SCAU 10305 Password
做了一阵子的题目了,还不知道什么才能用暴力撸过去,这题不知道是当初我们看见还是真的不懂得用暴力,郁闷,缅怀!
Description
Maybe, how to remember a lot of passwords is a big problem for someone. Today, Xiaoming forgot the password of his bank card. The password is made of 6 digits. He only remembers that the password is a multiple of his lucky number. And he also knows that his lucky number is a multiple of the sum of every digits of the password. Now, given the lucky number, can you tell Xiaoming how many passwords satisfy the requirement?
输入格式
The input is just one line which contains a number, the lucky number.
输出格式
Outputs the number of passwords satisfy the requirement.
1 #include<stdio.h> 2 #include<string.h> 3 int divide(int num, int n) 4 { 5 int last = 0; 6 while(num) 7 { 8 last += num%10; 9 num /= 10; 10 } 11 return n%last ? 0 : 1; 12 } 13 14 int main() 15 { 16 int luck, pas, n, m, i, j, sum = 0; 17 scanf("%d", &luck); 18 for(i=1; i*luck<1000000; ++i) 19 { 20 if(divide(i*luck, luck)) sum++; 21 } 22 printf("%d\n", sum); 23 return 0; 24 }
![物役记](https://s2.ax1x.com/2019/05/26/VE5YD0.jpg)
更多内容请关注个人微信公众号 物役记 (微信号:materialchains)
作者:雪影蓝枫
本文版权归作者和博客园共有,欢迎转载,未经作者同意须保留此段声明,且在文章页面明显位置给出原文链接,否则保留追究法律责任的权利。