Cod sursa(job #2332365)
Utilizator | Data | 30 ianuarie 2019 18:02:59 | |
---|---|---|---|
Problema | Factorial | Scor | 5 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.41 kb |
#include <fstream>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
int n,i,a[1000001],c_25;
/*void mul(int *a, int x)
{
int t=0,i;
for(i=1; i<=a[0] || t; ++i,t/=10)
a[i]=(t+=a[i]*x)%10;
a[0]=i-1;
}
void afis()
{
for(int i=a[0]; i>=1; --i)
g<<a[i];
g<<'\n';
}*/
int main()
{
f>>n;
c_25=n/6;
g<<n*5-c_25*5;
return 0;
}