| Author: | T. Chistyakov, A. Klenin | Time limit: | 1 sec | |
| Input file: | input.txt | Memory limit: | 256 Mb | |
| Output file: | output.txt |
For given integers P and N you need to find all such values of x < 10N, that N last digits of xP are non-zero and equal.
Fortunately, there is not so many numbers showing this property. For example, for P = 2 and N = 2 there exist only 4 of them:
12, 38, 62, 88
Output the number of existing numbers X, then all these numbers in any order.
2 ≤ P ≤ 100
2 ≤ N ≤ 9
| No. | Input file (input.txt) |
Output file (output.txt) |
|---|---|---|
| 1 |
|
|