#include<bits/stdc++.h>
using namespace std;
int main()
{
int data[] = [5650,4542,3554,473,946,4114,3871,9073,90,4329,
2758,7949,6113,5659,5245,7432,3051,4434,6704,3594,...... ];
int c2=0,c5=0;//记录因式分解中2的个数和5的个数
for(int i=0;i<100;i++){
int num = data[i];
while(num%2==0){
c2++;
num=num/2;
}
while(num%5==0){
c5++;
num=num/5;
}
}
cout<<min(c2,c5)<<'\n';
return 0;
}
201803乘积尾零
最新推荐文章于 2022-08-27 10:18:18 发布