Cod sursa(job #1451224)
Utilizator | Data | 16 iunie 2015 16:31:57 | |
---|---|---|---|
Problema | Factorial | Scor | 5 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.33 kb |
#include <iostream>
#include<math.h>
#include<stdlib.h>
#include<fstream>
using namespace std;
char c[230];
ifstream in("fact.in");
ofstream out("fact.out");
int main()
{
int P,N,y,u1,n=1,i=0,x,count=0;
in>>P;
while (1)
{
if (pow(5,n)==i)
{
n++;
count=count+n-2;
}
i=i+5;
count++;
if (count==P) break;
}
out<<i;
}