Pagini recente » Cod sursa (job #2668531) | Cod sursa (job #2492292) | Cod sursa (job #2904552) | Cod sursa (job #1443652) | Cod sursa (job #2225976)
#include <iostream>
#include <fstream>
using namespace std;
int factorial (int n){
int r = 1,i;
for (i = 1; i <=n; i++){
r *=i;
}
return r;
}
int combinari (int n, int k){
return factorial(n) / factorial(k) / factorial(n - k);
}
int main()
{
ifstream in ("patrate2.in");
ofstream out ("patrate2.out");
int n,i, rasp=1;
in >> n;
rasp = factorial(n);
for (i = 1; i <= n; i++) rasp *= combinari(n,i);
rasp *=2;
int aux = n * n - n;
for(i= 1; i <= aux; i++) rasp *= combinari(n,i);
if(aux != 0) rasp *=2;
out <<rasp<<endl;
return 0;
}