UVa Problem 10127 Ones (仅由 1 组成的数)
2011-05-29 16:34
405 查看
// Ones (仅由 1 组成的数) // PC/UVa IDs: 110504/10127, Popularity: A, Success rate: high Level: 2 // Verdict: Accepted // Submission Date: 2011-05-29 // UVa Run Time: 0.008s // // 版权所有(C)2011,邱秋。metaphysis # yeah dot net // // 利用求模运算。(x * y + 1) mod n = ((x mod n) * (y mod n) + (1 mod n)) mod n。 #include <iostream> using namespace std; int main(int ac, char *av[]) { 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 Problem Solution: 10127 - Ones
- UVa 10127 - Ones
- UVA 10127 Ones (数论) 计算至少要多少位十进制的1能够被n整除
- UVA 10127 - Ones(数论)
- uva 10127 Ones
- uva 10127 - Ones
- UVA 10127 - Ones(数论)
- UVA - 10127 Ones
- uva 10127——ones
- UVa 10127/POJ 2551 Ones (模运算&转换思想)
- uva 10127 - Ones(数论)
- 【数论,水题】UVa 10127 - Ones
- uva 10127 - Ones(数论)
- UVa:10127 Ones
- UVA-10127 Ones (数论)
- UVa Problem 10033 Interpreter (解释器)
- UVALive Problem 7457 Discrete Logarithm Problem——Regionals 2015 :: Asia - Taipei
- UVA - 729 The Hamming Distance Problem (全排列)
- UVa Problem 10077 The Stern-Brocot Number System (Stern-Brocot 代数系统)
- uva 100 3n+1 problem