Cod sursa(job #1836618)
Utilizator | Data | 28 decembrie 2016 15:27:23 | |
---|---|---|---|
Problema | Factorial | Scor | 5 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.57 kb |
#include <iostream>
#include <fstream>
#include <limits>
#include <tgmath.h>
using namespace std;
int main()
{
int n,p;
long long fact;
ifstream fisier("fact.in");
while(fisier>>p)
{
}
for( n=0; n<=100; n++)
{
fact = 1;
for(int i=1; i<=n; i++)
{
fact=fact*i;
}
if(p>8)
{
break;
}
if(fact%((int)pow(10,p))==0)
{
break;
}
}
ofstream fisier2;
fisier2.open("fact.out");
fisier2<<n;
}