|
||||||||||
Magic WisKeyTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 714 Accepted Submission(s): 391 Problem Description On New Year Festival, Liu Qian¡¯s magic impressed on little WisKey¡¯s heart and he wants to learn some magic to make himself stronger. One day, he met a cowman named LinLe. Linle is very nice, he told little WisKey the mysteries of magic. Now, little WisKey began to perform the magic to you. ¡°Hello, Everybody. I have five decimal numbers named a, b, c, d, e, (0 <= a, b, c, d, e <= 9) and I rearranged them, and then combined them into a number, for example <a, b, c, d, e> = a*10000 + b*1000 + c*100 + d*10 + e*1. You know the number of permutations is 5! = 120. So you have 120 numbers in your hands, you can pick a number N from the 120 numbers and calculate the sum S of remain 119 numbers. AHA~, If you tell me the S, I can guess the N~!¡± It¡¯s easy? Okay, you can challenge this. Input Each line will contain an integer S. Process to end of file. Output For each case, output all possible N, print the number N with 5 digits, including the leading zeros, one line per case. I promise every case have one solution at least. If have many N, please output them from small to large in one line, separate them with a blank space. Sample Input
Sample Output
Source | ||||||||||
|