Cod sursa(job #1122703)
Utilizator | theo .c Theory | Data | 25 februarie 2014 19:59:45 |
---|---|---|---|
Problema | 12-Perm | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.43 kb |
#include <fstream>
#include <cmath>
using namespace std;
ifstream fin ("12perm.in");
ofstream fout ("12perm.out");
int N; long long A[4];
const long long MOD = (1 << 20);
int main() {
fin >> N;
A[0] = 2;
A[1] = 6;
A[2] = 12;
for(int i = 3; i <= N - 1; ++i) {
A[ i % 3 ] = (A[(i + 2) % 3] + A[i % 3] + 1ll * 2 *(i)) % MOD ;
}
fout << A[(N - 1) % 3];
return 0;
}