Cod sursa(job #870193)
| Utilizator |  Teodora Gidiuta teodora0076 |
Data | 2 februarie 2013 23:03:38 |
|---|---|---|---|
| Problema | Factorial | Scor | 5 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.33 kb |
#include<fstream>
#include<iostream>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
int main()
{long long fa=0,n=1,nf=0,fz=0,p;
f>>p;
do
{
do
{if(n%10==0)
{fz++;
n/=10;}}
while((n%10==0)&&(n>0));
fa+=fz;
fz=0;
if(fa==p) g<<nf;
if(fa>p) g<<"-1";
nf++;
n*=nf;
n%=1000;}
while(fa<p);
}