Cod sursa(job #395585)
Utilizator | Data | 13 februarie 2010 14:56:55 | |
---|---|---|---|
Problema | Factorial | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.31 kb |
#include <fstream>
using namespace std;
ifstream fi("fact.in");
ofstream fo("fact.out");
long a[16], b[16], p, n, i=1;
int main(){
fi>>p;
a[0]=0;
a[1]=25;
b[0]=1;
while(p>b[i-1]){
if(i>1)
a[i]=a[i-1]*5;
b[i]=b[i-1]*5+1;
i++;
if(b[i-1]==p){
fo<<a[i-1];
return 0;
}
}
}