Cod sursa(job #2326025)
Utilizator | Data | 23 ianuarie 2019 12:01:09 | |
---|---|---|---|
Problema | Factorial | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | simulare_preoli | Marime | 0.33 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("factorial.in");
ofstream fout("factorial.out");
int main()
{
int l=1, j=1, i=1, n=1, k=1, p;
fin>>p;
while(i<=p){
l*=10;
i++;
}
while(k<l){
k=k*n;
n++;
}
fout<<n;
return 0;
}