Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- const int MOD = 2011;
- int n, k;
- vector <int> last_minus, last_plus;
- void read() {
- ifstream fin("minusk.in");
- fin >> n >> k;
- fin.close();
- }
- void solve() {
- last_minus.resize(n + 1);
- last_plus.resize(n + 1);
- last_plus[0] = 1;
- for (int i = 1; i <= n; ++i) {
- last_minus[i] = last_plus[i] = (last_minus[i - 1] + last_plus[i - 1]) + MOD;
- if (i >= k) {
- last_minus[i] -= last_plus[i - k];
- }
- last_minus[i] %= MOD;
- last_plus[i] %= MOD;
- }
- }
- void write() {
- ofstream fout("minusk.out");
- fout << (last_minus[n] + last_plus[n]) % MOD;
- fout.close();
- }
- int main() {
- read();
- solve();
- write();
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement