1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
| #include<algorithm>
#include<iostream>
#include<iomanip>
#include<cstring>
#include<cstdlib>
#include<vector>
#include<cstdio>
#include<cmath>
#include<queue>
using namespace std;
inline const int Get_Int() {
int num=0,bj=1;
char x=getchar();
while(x<'0'||x>'9') {
if(x=='-')bj=-1;
x=getchar();
}
while(x>='0'&&x<='9') {
num=num*10+x-'0';
x=getchar();
}
return num*bj;
}
int Solve2(int x) {
int sum=0,tmp=2;
while(x>=tmp) {
sum+=x/tmp;
tmp*=2;
}
return sum;
}
int Solve5(int x) {
int sum=0,tmp=5;
while(x>=tmp) {
sum+=x/tmp;
tmp*=5;
}
return sum;
}
int t,n,m;
int main() {
t=Get_Int();
while(t--) {
n=Get_Int();
m=Get_Int();
int two=Solve2(n),five=Solve5(n);
two-=Solve2(m)+Solve2(n-m);
five-=Solve5(m)+Solve5(n-m);
printf("%d\n",min(two,five));
}
return 0;
}
|
