Pagini recente » Cod sursa (job #508325) | Cod sursa (job #877255) | Cod sursa (job #1869052) | Istoria paginii runda/testare_chiur/clasament | Cod sursa (job #879240)
Cod sursa(job #879240)
#include<iostream>
#include<fstream.h>
using namespace std;
/*long int p, P;
int e=0;
void nr0(int x) {
while((x!=0) && (x%10==0)) {
x/=10;
if(x%10==0) e++;
}
}
int compact(int x) {
while(x && x%10==0) {
x/=10;
}
return x;
}
int inmultire(int x, int y) {
P=compact(x)*compact(y);
nr0(x);
nr0(y);
}*/
long long fact(int n) {
if(n==1) return 1;
else if(n>1) return n*fact(n-1);
}
int nrZerouri(long long x) {
int nrzero=0;
while(x!=0 && x%10==0) {
nrzero++;
x=x/10;
}
return nrzero;
}
int main() {
int gasit=0,i=1, p;
ifstream f("fact.in");
ofstream g("fact.out");
f>>p;
while(!gasit) {
if(nrZerouri(fact(i))==p) gasit++;
else if(nrZerouri(fact(i))>p) {
i=-1;
break;
}
else i++;
}
if(i==0) cout<<"nu exista";
g<<i;
f.close();
g.close();
return 0;
}