本文共 2184 字，大约阅读时间需要 7 分钟。
1088: The Owl and the Fox Time Limit: 5 Sec Memory Limit: 128 MB Submit: 44 Solved: 14 [Submit][Status][Web Board] Description Fox Mithra has finally learned the numbers and he is now familiar with the concept of ‘one’, ’two’, ‘three’ and also even ‘zero’, ‘minus one’, ‘minus two’ and so on. Really, an achievement for such a small fox. He took the textbook and copied the integers from the book one by one from the smallest to the biggest on the wall of his enclosure in the ZOO. “Look, there is something wrong with your sequence on the wall”, said the owl who just landed on the branch above Mithra’s head. “You should put 30 between 20 and 22, there.” “Why?” “Because the importance of a number is judged by the sum of its digits. 30 is therefore less important than 22 and it is more important than 20. And obviously, 30 should be equally close to 20 and 22 because its sum of digits differs only by one from both 20 and 22.” “I see,” replied Mithra, “you are really clever. Can you help me please to rearrange the sequence correctly? Each time I tell you a number N you will tell me the closest smaller number with sum of digits less by one than the sum of digits of N.” “With pleasure,” nodded the owl majestically. Your task is to imitate the owl’s task. Given an integer N you have to find the biggest integer which is smaller than N with sum of digits less by one than the sum of digits of N. Input There are more test cases. Each case consists of a line containing a single integer N (1 ≤ N ≤ 100 000). The input is terminated by a line containing string “END” and no other symbols. Output For each test case print on a separate line the number demanded by fox Mithra. Sample Input 30 199 1000 1520 END Sample Output 20 198 0 1510 HINTSource
容易超时 用字符char数组会快一点
#include#include #include using namespace std;int main(){ char a[1000010]; long long n,m,i,k; ios::sync_with_stdio(false); while(scanf("%s",a)&&strcmp(a,"END")) { n=strlen(a); n=n-1; k=5; for(i=n;i>=0;i--) { if(a[i]!='0') { a[i]=a[i]-1; if(i!=0) { break; } } if(a[0]=='0') { k=0; } } if(k==0)printf("0\n"); else printf("%s\n",a); } return 0;}
转载地址：http://xtfci.baihongyu.com/