标签：des style blog http io color ar os sp
For a positive integer N , the digit-sum of N is defined as the sum of N itself and its digits. When M is the digitsum of N , we call N a generator of M .
For example, the digit-sum of 245 is 256 (= 245 + 2 + 4 + 5). Therefore, 245 is a generator of 256.
Not surprisingly, some numbers do not have any generators and some numbers have more than one generator. For example, the generators of 216 are 198 and 207.
You are to write a program to find the smallest generator of the given integer.
Your program is to read from standard input. The input consists of T test cases. The number of test cases T is given in the first line of the input. Each test case takes one line containing an integer N , 1≤N≤100, 000 .
Your program is to write to standard output. Print exactly one line for each test case. The line is to contain a generator of N for each test case. If N has multiple generators, print the smallest. If N does not have any generators, print 0.
The following shows sample input and output for three test cases.
3 216 121 2005
198 0 1979
这道题主要是发现100000中数位和最大的数位99,999 所以我们只需要从给定的数n - 45 开始，然后寻找就可以了。
直接上代码。。。
1 #include<iostream> 2 #include<cstdlib> 3 using namespace std; 4 int main() { 5 int t; 6 cin >> t; 7 while (t--) { 8 long n; 9 cin >> n; 10 long i = n - 45; 11 bool find = false; 12 while (i < n) { 13 long res = i; 14 long gen = i; 15 while (gen) { 16 res += gen % 10; 17 gen /= 10; 18 } 19 if (res == n) { 20 find = true; 21 break; 22 } 23 i++; 24 } 25 if (find) cout << i << endl; 26 else cout << 0 << endl; 27 } 28 // system("pause"); 29 return 0; 30 }
【sicily系列】1325 digit generator
标签：des style blog http io color ar os sp
原文地址：http://www.cnblogs.com/tonyyangsysu/p/4094565.html
