September 30th - October 5th, 1997 Drama - Greece
Day 1. Problem 3. Factorials
 | |
 |
 |
 |
 |
 | |
| Day 1 | |
| Problem 1 | |
| Problem 2 | |
| Problem 3 | |
| Day 2 | |
| Problem 1 | |
| Problem 2 | |
| Problem 3 | |
| |
|
 |
|
 |
|
 |
|
 |
|
 |
| |
For a positive integer number N, find all positive integer numbers X (if any such number exists) with the property that the number 1*2*3*...*X has exactly N decimal digits. Assume that N is at most 150,000.
INPUT
The file INPUT.TXT has a single line which contains a positive integer number
denoting the number N.
OUTPUT
Your program should write the output into the file OUTPUT.TXT. The first
line should contain the string "NO", if such a number does not exist. Otherwise,
the first line should contain a positive integer denoting how many
X numbers exist. The next line (until the end of the file) should contain all
X numbers found, one number per line.
| INPUT.TXT | | OUTPUT.TXT |
5 |
1 8 |