Cod sursa(job #2543129)
Utilizator | Data | 10 februarie 2020 21:18:10 | |
---|---|---|---|
Problema | Factorial | Scor | 10 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.36 kb |
#include <iostream>
#include <fstream>
using namespace std;
int v[100];
ifstream f("fact.in");
ofstream g("fact.out");
int main()
{int p, n=0 ,i,aux,save;
f>>p;
while(aux!=p)
{
n++;
save=n;
for(i=2;i<=n;i++)
if(save%i==0)
{save=save/i;
v[i]++;
i--;}
if(v[2]<=v[5])
aux=v[2];
if(v[2]>v[5])
aux=v[5];
} g<<n;
}