Cod sursa(job #2367729)
Utilizator | Data | 5 martie 2019 12:02:59 | |
---|---|---|---|
Problema | Lista lui Andrei | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | bv_10 | Marime | 0.42 kb |
#include <iostream>
#define MOD 104659
using namespace std;
long long int fac[30], f = 2;
long long int factorial(int x) {
if (x < f) return fac[x];
int i;
for (i = f; i <= x; ++i) {
fac[i] = (fac[i-1] * i)%MOD;
}
f = i;
return fac[f-1];
}
int main()
{
fac[1] = 1;
cout << ((factorial(26) + MOD)/(factorial(24)*2));
cout << " " << factorial(26);
return 0;
}