Fork me on GitHub

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 }
复制代码

 

posted @   Gifur  阅读(291)  评论(0编辑  收藏  举报
编辑推荐:
· 如何编写易于单元测试的代码
· 10年+ .NET Coder 心语,封装的思维:从隐藏、稳定开始理解其本质意义
· .NET Core 中如何实现缓存的预热?
· 从 HTTP 原因短语缺失研究 HTTP/2 和 HTTP/3 的设计差异
· AI与.NET技术实操系列:向量存储与相似性搜索在 .NET 中的实现
阅读排行:
· 周边上新:园子的第一款马克杯温暖上架
· Open-Sora 2.0 重磅开源!
· 分享 3 个 .NET 开源的文件压缩处理库,助力快速实现文件压缩解压功能!
· Ollama——大语言模型本地部署的极速利器
· DeepSeek如何颠覆传统软件测试?测试工程师会被淘汰吗?
TOP
点击右上角即可分享
微信分享提示