Modulus of a really really long number (fmod)
I want to find the number of zeroes in a factorial using Cpp. The problem is when I use really big numbers. #include <stdio.h> #include <math.h> long zeroesInFact(long n) { long double fact=1; long double denominator=10.00; long double zero=0.0000; long z=0; printf("Strating loop with n %ld\n",n); for(int i=2;i<=n;i++) { fact=fact*i; printf("Looping with fact %LF\n",fact); } printf("Fmod %lf %d\n",fmod(fact,denominator),(fmod(fact,denominator)==zero)); while(fmod(fact,denominator)==zero) { fact=fact/10; z++; } printf("Number of zeroes is %ld\n",z); return z; } int main() { long n; long x;