Cod sursa(job #1876963)
Utilizator | Data | 12 februarie 2017 19:49:01 | |
---|---|---|---|
Problema | 12-Perm | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
#define Nmax 15000001
using namespace std;
ifstream fin("12perm.in");
ofstream fout("12perm.out");
int dp[Nmax],n;
const int mod=1048576;
int main()
{
fin>>n;
if(n<=2)
{
fout<<n;
return 0;
}
dp[1]=dp[2]=2;dp[3]=6;
for(int i=4;i<=n;i++)
dp[i]=(dp[i-1]+dp[i-3]+2*(i-2))%mod;
fout<<dp[n];
return 0;
}