題意 假設a加上a全部數位上的數等于b時 a稱為b的 generator ?求給定數的最小 generator?
給的數n是小于100,000的 ?考慮到全部數位和最大的數99,999的數位和也才45 ?因此我們僅僅須要從n-45到n枚舉即可了
#include<cstdio> #include<cstring> using namespace std; int t, n, a, b, ans, l; int main() { scanf ("%d", &t); while (t--) { scanf ("%d", &n); ans = 0; for (int i = n-50; i < n; ++i) { a = b = i; while (b) { a += b % 10; b /= 10; } if (a + b == n) { ans = i; break; } } printf ("%d\n", ans); } return 0; }
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.
Input ?
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 ?.
Output ?
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.
Sample Input ?
3 216 121 2005
Sample Output ?
198 0 1979
更多文章、技術交流、商務合作、聯系博主
微信掃碼或搜索:z360901061

微信掃一掃加我為好友
QQ號聯系: 360901061
您的支持是博主寫作最大的動力,如果您喜歡我的文章,感覺我的文章對您有幫助,請用微信掃描下面二維碼支持博主2元、5元、10元、20元等您想捐的金額吧,狠狠點擊下面給點支持吧,站長非常感激您!手機微信長按不能支付解決辦法:請將微信支付二維碼保存到相冊,切換到微信,然后點擊微信右上角掃一掃功能,選擇支付二維碼完成支付。
【本文對您有幫助就好】元
