Cod sursa(job #2983699)
Utilizator | Data | 22 februarie 2023 19:41:45 | |
---|---|---|---|
Problema | Factorial | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.41 kb |
#include<iostream>
#include<fstream>
using namespace std;
int main()
{ int P,N,Nf,i,k;
ifstream f("fact.in");
ofstream g("ofact.out");
f>>P;
while(i<=10)
{ N=i;
for (int i=1;i<=N;i++)
Nf=Nf*i;
if (Nf%10^P==0)
k++;
}
if (k>0)
g<<k;
else
g<<-1;
f.close();
g.close();
return 0;
}