Cod sursa(job #1255283)
Utilizator | Data | 4 noiembrie 2014 17:07:12 | |
---|---|---|---|
Problema | Dirichlet | Scor | 8 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.37 kb |
#include <cstdio>
using namespace std;
const long long MODULO=9999991;
long long tac(int n)
{
if (n==0)
return 1;
return (4*(long long)n-2)*tac(n-1)/((long long)n+1)%MODULO;
}
int main()
{
freopen("dirichlet.in","r",stdin);
freopen("dirichlet.out","w",stdout);
int n;
scanf("%d",&n);
printf("%lld\n",tac(n));
return 0;
}