Pagini recente » Cod sursa (job #1518062) | Cod sursa (job #41898) | Cod sursa (job #2787302) | Cod sursa (job #1983092) | Cod sursa (job #2367722)
#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;
}