Pagini recente » Cod sursa (job #2055152) | Cod sursa (job #1829048) | Cod sursa (job #1788975) | Cod sursa (job #2793375) | Cod sursa (job #43340)
Cod sursa(job #43340)
// Problema factorial
#include <stdio.h>
#define MAX 2000000000
long nrz( long c )
{
long p = 0;
while( c>1 )
{
p += c/5;
c /= 5;
}
return p;
}
int main()
{
long p;
freopen( "fact.in", "rt", stdin );
scanf( "%ld", &p );
fclose( stdin );
long st = 0;
long dr = MAX;
long n = 1;
long numarz;
long c;
while( n )
{
c = ( st + dr ) /2;
numarz = nrz( c );
if( (numarz == p ) && (st==dr) )
{
n = st;
break;
}
if( dr < st )
{
n =-1;
break;
}
if( numarz < p ) st = c+1; else dr = c-1;
}
freopen( "fact.out", "wt", stdout );
printf( "%ld\n", n );
fclose( stdout );
return 0;
}