Trivial Problem CodeForces - 633B

最新推荐文章于 2020-02-04 11:20:42 发布

Lila_老妖

最新推荐文章于 2020-02-04 11:20:42 发布

阅读量302

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/qq_32823673/article/details/61614285

本文介绍了一道名为“ATrivialProblem”的CodeForces竞赛题目633B的解答过程，该题要求计算阶乘末尾恰好包含m个零的正整数n的数量，并给出这些数。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

A Trivial Problem CodeForces - 633B

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.

Example
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.

题解：这道题就是问阶乘的末尾有几个零。只需要求出有几个5就行了。

#include<stdio.h>
int main()
{

      long long n;
    while(scanf("%I64d",&n)!=EOF)
    {
        long long k=0;
        for(int i=5;;i=i+5)
        {
        long long temp=i;
        while(temp%5==0)
        {
            temp /= 5 ;
            k++;
        }
        if(k>=n)
            if(k==n)
            {
                printf("5\n");
                printf("%d %d %d %d %d\n",i,i+1,i+2,i+3,i+4 );
                break;
            }
            else
            {
                printf("0\n");
                break;
            }
        }
    }
}