Cod sursa(job #1552815)
Utilizator | Data | 18 decembrie 2015 18:34:29 | |
---|---|---|---|
Problema | Factorial | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
#include <math.h>
using namespace std;
int main()
{
long p,fact=1,ok=1,n=1;
ifstream f("fact.in");
f>>p;
if(p==0) ok=0;
while (ok==1)
{
n=n+1;;
fact=fact*n;
int a=(int) pow(10,p);
cout<<a;
if(fact % a==0) ok=0;
}
ofstream g("fact.out");
g<<n;
return 0;
}