Cod sursa(job #2427661)
| Utilizator | Data | 1 iunie 2019 14:17:37 | |
|---|---|---|---|
| Problema | Factorial | Scor | 5 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.58 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("fact.in") ;
ofstream out("fact.out") ;
const int NM = 1000 ;
int v[NM], n ;
int braian_tasescu( int n )
{
int nr = 0 ;
while( n > 0 )
{
nr += n / 5 ;
n /= 5 ;
}
return nr ;
}
int main()
{
in >> n ;
for( int i = 0 ; i < n ; i++ )
{
in >> v[i] ;
}
int r = 0, pas = 1 << 29 ;
while( pas != 0 )
{
if( !braian_tasescu( r + pas ) )
{
r += pas ;
}
pas /= 2 ;
}
out << r + 1 ;
return 0 ;
}
