·题目
·
- ·思路:1.可以直接死算。
2.一个数的末尾有多少个零取决于该数分解后包含因子10的个数。对于尾部有多少个“0”;可以拆解为:有多少个5或者2。因为10=2*5;我们写出程序计算每一个乘数有几个2和5,将其依次相加。取最少的哪一个。就可以知道有多少个0。
代码
#include <stdio.h>
int count_zeros(int arr[], int n) {
int count = 0;
for (int i = 0; i < n; i++) {
while (arr[i] % 5 == 0 && arr[i] > 0) {
count++;
arr[i] /= 5;
}
}
return count;
}
int main() {
int arr[100]={5650,4542,3554,473,946,4114,3871,9073,90,4329,2758,7949,6113,5659,5245,7432,3051,4434,6704,3594,9937,1173,6866,3397,4759,7557,3070,2287,1453,9899,1486,5722,3135,1170,4014,5510,5120,729,2880,9019,2049,698,4582,4346,4427,646,9742,7340,1230,7683,5693,7015,6887,7381,4172,4341,2909,2027,7355,5649,6701,6645,1671,5978,2704,9926,295,3125,3878,6785,2066,4247,4800,1578,6652,4616,1113,6205,3264,2915,3966,5291,2904,1285,2193,1428,2265,8730,9436,7074,689,5510,8243,6114,337,4096,8199,7313,3685,211}; // 假设这里是题目给出的100个整数
int n = 100; // 数组长度为100
int result = count_zeros(arr, n);
printf("末尾有%d个零", result);
return 0;
}
- PS:其实我们只需要去计算5有多少个。因为2一定比5要多的多。2出现的条件比较宽泛。比如:4,8,12,16····这类。而5的出现,只能为5的倍数。