Cod sursa(job #2308683)
Utilizator | Data | 27 decembrie 2018 16:17:56 | |
---|---|---|---|
Problema | Factorial | Scor | 5 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ( "fact.in" ) ;
ofstream g ( "fact.out" ) ;
int p, n = 0, m , k = 1 ;
int main()
{
f >> p ;
if ( p == 0 )
g << 1 ;
else
{
while ( p > 0 )
{
n += 5 ;
if ( n >= 25 * k )
{
p -= 2 ;
k ++ ;
}
else
p -- ;
}
}
if ( p == 0 )
g << n ;
else
g << - 1 ;
return 0;
}