how mang n

2009-05-09 08:45:17 171 阅读 AI 写同款 · GEO 优化AI 选题数据监测一键分发 ›

浏览器主页被360篡改？教你彻底解决并预防再次发生通过本文介绍的快捷方式修复、注册表清理、启动项管理三步法，可解决99%的浏览器主页篡改问题。权限最小化原则：非管理员账户日常使用，关键系统目录设置写保护定期安全审计：每月检查启动项/计划任务/浏览器扩展备份还原机制：创建系统还原点，重要操作前做好快照安全意识培养：不安装来源不明的软件，谨慎处理软件安装向导中的附加选项浏览器安全是系统防护的重要环节，建议结合EDR（终端检测与响应）方案构建立体防护体系。对于普通用户，保持系统更新、使用官方渠道下载软件、定期清理系统垃圾，即可有效预防绝大多数安全威胁。阅读详情

How mang N
以下是这道题的描述（据传是道ACM）：
Find a minimal interger K which is merely comprised of N and can be divided by M.

For example,11 is the minimal number that and be divided by 11, and it is comprised of two '1's, and 111111 can be divided by 13 which is comprised of six '1's.

Input
On each line of input , there will be two positive integer, N and M. N is a digit number, M is no more than 10000.

Output
On each single line, output the number of N, if no such K, output zero.

Sample Input
1 5
1 11
1 13

Sample Output
0
2
6
有高人给出如下答案，小子实在看不懂原理，请牛人指点，说明原理即可，谢谢！
#include <stdio.h>

int main( )
{
int n, m, t, f[ 10000 ], i, count;
while ( scanf("%d%d", &n, &m) == 2 )
{
count = t = 0;
for ( i = 0; i < m; i++ )
f[ i ] = 0;
while ( !f[ t ] )
{
count++;
f[ t ] = 1;
t = ( t * 10 + n ) % m;
}
if ( !t )
printf("%d\n", count);
else
printf("0\n");
}
return 0;
}

...全文