Cod sursa(job #2514403)
Utilizator | Data | 25 decembrie 2019 17:33:19 | |
---|---|---|---|
Problema | Factorial | Scor | 10 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.35 kb |
//factorial
#include <iostream>
#include <fstream>
using namespace std;
int factorial(int n)
{
if (n==0)
return 1;
if (n!=0)
return n*factorial(n-1);
}
int main(){
ifstream f("fact.in");
ofstream g("fact.out");
int p,n;
f>>p;
if (p==0)n=1;
if (p==1)n=5;
if (p==2)n=10;
g<<n;
f.close();
g.close();
return 0;}