您的位置:首页
UVA 10127 - Ones(数论)
2017-05-22 12:52
218 查看
UVA 10127 - Ones
题目链接题意:求出多少个1组成的数字能整除n
思路:一位位去取模。记录答案就可以
代码:
#include <stdio.h> #include <string.h> int n; int main() { while (~scanf("%d", &n)) { int ans = 1; int now = 1; while (now) { now = (now * 10 + 1) % n; ans++; } printf("%d\n", ans); } return 0; }
相关文章推荐
- UVA-10127 Ones (数论)
- UVA 10127 - Ones(数论)
- uva 10127 - Ones(数论)
- 【数论,水题】UVa 10127 - Ones
- uva 10127 - Ones(数论)
- UVA 10127 Ones (数论) 计算至少要多少位十进制的1能够被n整除
- UVa 10127 - Ones
- UVa 10127/POJ 2551 Ones (模运算&转换思想)
- UVa:10127 Ones
- uva 10127 - Ones
- UVa Problem Solution: 10127 - Ones
- uva 10127 Ones
- UVa Problem 10127 Ones (仅由 1 组成的数)
- uva 10127——ones
- UVA - 10127 Ones
- uva 10673 Play with Floor and Ceil(简单数论)
- UVA 11388 - GCD LCM(数论)
- UVA 10995 - Educational Journey(数论)
- UVA 617 - Nonstop Travel(数论+暴力枚举)
- UVA 11806 - Cheerleaders(数论+容斥原理)