uva 10127 - Ones
2013-05-23 10:30
337 查看
#include <iostream> using namespace std; int main() { int number; while (cin >> number) { long long start = 1; int counter = 1; while (start % number) { start = (start % number) * (10 % number) + 1; counter++; } cout << counter << endl; } return 0; }
相关文章推荐
- UVA 10127 - Ones(数论)
- 【数论,水题】UVa 10127 - Ones
- UVa 10127/POJ 2551 Ones (模运算&转换思想)
- UVa Problem Solution: 10127 - Ones
- UVa:10127 Ones
- uva 10127 - Ones(数论)
- UVa 10127 - Ones
- uva 10127 Ones
- UVA 10127 Ones (数论) 计算至少要多少位十进制的1能够被n整除
- uva 10127——ones
- UVA-10127 Ones (数论)
- UVA 10127 - Ones(数论)
- uva 10127 - Ones(数论)
- UVa Problem 10127 Ones (仅由 1 组成的数)
- UVA - 10127 Ones
- UVA 10127- Ones 数学
- UVA 12063 Zeros and Ones(三维dp)
- UVA 10127
- 数学专项number_theory:UVa 10127
- uva 709 Formatting Text