Cod sursa(job #843844)
Utilizator | Data | 28 decembrie 2012 15:28:42 | |
---|---|---|---|
Problema | Factorial | Scor | 0 |
Compilator | cpp | Status | done |
Runda | 23dezile_2 | Marime | 0.22 kb |
#include<fstream>
using namespace std;
ifstream f("factorial.in");
ofstream g("factorial.out");
int n,p;
int main()
{
p=1;
f>>n;
for(int i=1;i<=n;++i)
{
p*=i;
}
g<<p;
g.close();
return 0;
}