时间限制:1 Sec
内存限制:128 MiB
提交:40
答案正确:12
One of My Teammates asd encountered a difficult problem recently. Given an integer q, he wants to now whether there is an integer n that n! contains q zeroes on the trail in decimal notation and n is minimal.
Input starts with an integer T(T <= 20000),denoting the number of test cases. Each test case contains an integer q (1 <= q <= 10^8)
For each case, print the case number and your answer, if no solution is found then print "I need anwei".
3 1 2 5
Case 1: 5 Case 2: 10 Case 3: I need anwei
[Fjnu]yifan