Cod sursa(job #1025831)
Utilizator | Data | 10 noiembrie 2013 16:40:39 | |
---|---|---|---|
Problema | Factorial | Scor | 5 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.28 kb |
#include<iostream>
#include<fstream>
using namespace std;
int main()
{
ifstream f ("fact.in");
ofstream g ("fact.out");
unsigned long long p=1;
int n;
f>>n;
if (n<0) g<< -1;
else
for(int i=1;i<=n;i++)
p=p*i;
g<<p;
f.close();
g.close();
return 0;
}