C + + seeking n! The number of 0

/* #include <iostream>using namespace std;//2014! The number of 0 inside. int giral (int x) {int i=0;int j=0;while (x) {int sum = x;if (x%2==0) { while (x%2==0) {x/=2;i++;}} if (x%5==0) {while (x%5==0) {x/=5;j++;}} Sum--;x=sum;} return i>j?j:i;} int main () {cout<<giral () <<endl;//This bad test, I tested the number within 20. return 0; *//* #include <iostream>using namespace std;//How to write a function int grial (const char *str) {int sum=0;while) from string to long shape in 4 lines of code ( *str!= ' + ') {sum= (sum*10) + (*str-' 0 '); str++;} return sum; }int Main () {const char p[] = "1234567"; cout<<grial (p) <<endl;return 0;} *//* #include <iostream>using namespace std;//has an array of Yi integers, requesting a value with a minimum of 22 difference. int Set (int x) {return x>=0?x: (-X);} int grial (int a[],int n) {int min=set (a[0]-a[1]), for (int. i=0;i<n-1;i++) {for (int j=i+1;j<n;j++) {min= (Set (a[i]-a[ J]) <min)? (Set (A[i]-a[j])): min;}} return min;} int main () {int a[]={3,7,9};cout<<grial (a,3) <<endl;} */

C + + seeking n! The number of 0