CodeForces 633B A Trivial Problem（思维，阶乘 0 的个数）

http://codeforces.com/problemset/problem/633/B

B. A Trivial Problem

time limit per test
2 seconds

memory limit per test
256 megabytes

input
standard input

output
standard output

Mr. Santa asks all the great programmers of the world to solve a trivial problem. He gives them an integer m and asks for the number
of positive integers n, such that the factorial of n ends
with exactly m zeroes. Are you among those great programmers who can solve this problem?

Input

The only line of input contains an integer m (1 ≤ m ≤ 100 000) —
the required number of trailing zeroes in factorial.

Output

First print k — the number of values of n such
that the factorial of n ends with m zeroes.
Then print these k integers in increasing order.

Examples

input

1

output

5
5 6 7 8 9

input

5

output

0

Note

The factorial of n is equal to the product of all integers from 1 to n inclusive,
that is n! = 1·2·3·...·n.

In the first sample, 5! = 120, 6! = 720, 7! = 5040, 8! = 40320 and 9! = 362880.

题意：

找出一个数字的阶乘尾部为 m 个 0 的所有数。如 实例。

思路：

找出 5 的个数。

AC CODE:

#include<stdio.h>
#include<cstring>
#include<algorithm>
#define AC main()
using namespace std;
const int MYDD = 1103;

int AC {
int m, i, flag = -1;
scanf("%d", &m);
for(i=5; ; i+=5) {
flag = 0;
for(int j=5; j<=i; j*=5)
flag += i/j;
if(flag == m) break;
if(flag > m) {
puts("0");
return 0;
}
}
puts("5");
for(int j = 0; j < 5; j++)
printf("%d ", i+j);
return 0;
}