int main()
{
int i, j;
int d[105][15] = {0};
for (i = 2; i <= 100; ++i) {
int ans = 1;
int visit[105] = {0};
visit[ans] = 1;//重点
while (1) {
int t = ans * 10 / i;
d[i][t]++;
ans = ans * 10 % i;
if (ans == 0 || visit[ans] == 1)//重点
break;
visit[ans] = 1;//重点
}
}
for (i = 3; i <= 100; ++i) {
for (j = 0; j <= 9; ++j)
d[i][j] += d[i - 1][j];
}
int a, b;
while (scanf("%d%d", &a, &b) == 2) {
printf("%d\n", d[a][b]);
}
return 0;
}
POJ-3720(分数的小数表示,只要循环节)(Occurrence of Digits)
最新推荐文章于 2018-10-04 15:56:44 发布