Cod sursa(job #998503)
| Utilizator | Data | 17 septembrie 2013 11:12:29 | |
|---|---|---|---|
| Problema | 12-Perm | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.39 kb |
#include<iostream>
#include<stdio.h>
#define MOD 1048576
using namespace std;
int main ()
{
freopen("12perm.in","r",stdin);
freopen("12perm.out","w",stdout);
int n, P[15000000];
cin >> n;
P[1] = 1, P[2] = 2, P[3] = 6, P[4] = 12;
for(int i=5;i<=n;i++)
P[i] = (P[i - 1] + P[i - 3] + 2 * (i - 2)) & ( MOD - 1);
cout << P[n];
return 0;
}
