Description

对于一个正整数n，可以计算出它的阶乘 n!=1 × 2 × 3 × 4 × ... × n，假定它的阶乘值为S，现在告诉你n的值，你能统计出n的阶乘值S的最右边有多少个连续的零吗？例如 n=10，S=10！值为3628800，它的最右边有两个连续的零

Format

Input

输入一个正整数n， 0<n<32767

Output

输出n！的值最右边有多少个连续零

Sample 1

Input

10

Output

2

Limitation

1s, 32Mb for each test case.

Hint

Free Pascal Code

var a,b:longint;
begin
    readln(a,b);
    writeln(a+b);
end.

C Code

#include <stdio.h>
int main(void)
{
    int a, b;
    scanf("%d%d", &a, &b);
    printf("%d\n", a + b);
    return 0;
}

C++ Code

#include <iostream>
using namespace std;
int main()
{
    int a, b;
    cin >> a >> b;
    cout << a + b << endl;
    return 0;
}

Python Code

a, b = [int(i) for i in raw_input().split()]
print(a + b)

Java Code

import java.io.*;
import java.util.Scanner;

public class Main {

    /**
     * @param args
     * @throws IOException 
     */
    public static void main(String[] args) throws IOException {
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        int b = sc.nextInt();
        System.out.println(a + b);
    }
}

Source

Vijos Original