Submit solution

Points:
7 (partial)

Time limit:
1.0s

Memory limit:
64M

Author:

Problem types

Allowed languages

Ada, Assembly, Awk, Brain****, C, C#, C++, COBOL, ~~CommonLisp~~, D, Dart, F#, Forth, Fortran, Go, ~~Groovy~~, Haskell, Intercal, Java, JS, Kotlin, Lisp, Lua, ~~Nim~~, ~~ObjC~~, OCaml, ~~Octave~~, Pascal, Perl, PHP, Pike, Prolog, Python, Racket, Ruby, Rust, Scala, Scheme, Sed, Swift, TCL, Text, Turing, VB, Zig

Recall that the factorial function is defined as follows:

Given integers and , please find the number of natural numbers such that has a number of trailing zeros in the range of .

#### Constraints

##### Subtask 1 [20%]

##### Subtask 2 [30%]

For the remaining 50% of the testcases, .

#### Input Specification

The first line of the input contains the two integers and .

#### Output Specification

The number of values of that satisfy the condition.

#### Sample Input

`0 2`

#### Sample Output

`14`

#### Explanation

is the first element that satisfies the condition, and is the last element. Hence, there are a total of values of that satisfies the condition.

## Comments

In the explanation you imply that natural numbers are 1,2,3, etc. but in the input specification you say a,b>=0

Natural numbers of set N can be 0,1,2,3... or 1,2,3...

Wikipedia says there's no agreement on which one is "standard", whether 0 is included or not.

The set N* is used to specify positive numbers only, 1,2,3,4...

Yes, but this problem's usage of natural numbers isn't consistent which led to confusion.