| Task: | Bit Strings |
| Sender: | tykkipeli |
| Submission time: | 2019-05-25 13:11:15 +0300 |
| Language: | C++ |
| Status: | READY |
| Result: | ACCEPTED |
| test | verdict | time | |
|---|---|---|---|
| #1 | ACCEPTED | 0.02 s | details |
| #2 | ACCEPTED | 0.03 s | details |
| #3 | ACCEPTED | 0.02 s | details |
| #4 | ACCEPTED | 0.02 s | details |
| #5 | ACCEPTED | 0.02 s | details |
| #6 | ACCEPTED | 0.02 s | details |
| #7 | ACCEPTED | 0.02 s | details |
| #8 | ACCEPTED | 0.02 s | details |
| #9 | ACCEPTED | 0.01 s | details |
| #10 | ACCEPTED | 0.01 s | details |
| #11 | ACCEPTED | 0.06 s | details |
| #12 | ACCEPTED | 0.06 s | details |
| #13 | ACCEPTED | 0.07 s | details |
| #14 | ACCEPTED | 0.07 s | details |
| #15 | ACCEPTED | 0.07 s | details |
| #16 | ACCEPTED | 0.07 s | details |
| #17 | ACCEPTED | 0.07 s | details |
| #18 | ACCEPTED | 0.05 s | details |
Code
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll M = 1e9 + 7;
ll pot[1010101];
ll dp[1010101];
int main() {
ll n,k;
cin >> n >> k;
pot[0] = 1;
for (int i = 1; i <= n; i++) {
pot[i] = pot[i-1]*2;
pot[i] = pot[i] % M;
}
for (int i = 0; i < k; i++) {
dp[i] = pot[i];
}
dp[k] = pot[k]-1;
for (int i = k+1; i <= n; i++) {
dp[i] += dp[i-1];
dp[i] += dp[i-1]- dp[i-k-1];
dp[i] += M;
dp[i] = dp[i] % M;
}
cout << dp[n] << endl;
}Test details
Test 1
Verdict: ACCEPTED
| input |
|---|
| 1 1 |
| correct output |
|---|
| 1 |
| user output |
|---|
| 1 |
Test 2
Verdict: ACCEPTED
| input |
|---|
| 2 1 |
| correct output |
|---|
| 1 |
| user output |
|---|
| 1 |
Test 3
Verdict: ACCEPTED
| input |
|---|
| 2 2 |
| correct output |
|---|
| 3 |
| user output |
|---|
| 3 |
Test 4
Verdict: ACCEPTED
| input |
|---|
| 3 1 |
| correct output |
|---|
| 1 |
| user output |
|---|
| 1 |
Test 5
Verdict: ACCEPTED
| input |
|---|
| 3 2 |
| correct output |
|---|
| 5 |
| user output |
|---|
| 5 |
Test 6
Verdict: ACCEPTED
| input |
|---|
| 3 3 |
| correct output |
|---|
| 7 |
| user output |
|---|
| 7 |
Test 7
Verdict: ACCEPTED
| input |
|---|
| 4 1 |
| correct output |
|---|
| 1 |
| user output |
|---|
| 1 |
Test 8
Verdict: ACCEPTED
| input |
|---|
| 4 2 |
| correct output |
|---|
| 8 |
| user output |
|---|
| 8 |
Test 9
Verdict: ACCEPTED
| input |
|---|
| 4 3 |
| correct output |
|---|
| 13 |
| user output |
|---|
| 13 |
Test 10
Verdict: ACCEPTED
| input |
|---|
| 4 4 |
| correct output |
|---|
| 15 |
| user output |
|---|
| 15 |
Test 11
Verdict: ACCEPTED
| input |
|---|
| 654321 123456 |
| correct output |
|---|
| 796245691 |
| user output |
|---|
| 796245691 |
Test 12
Verdict: ACCEPTED
| input |
|---|
| 1000000 1 |
| correct output |
|---|
| 1 |
| user output |
|---|
| 1 |
Test 13
Verdict: ACCEPTED
| input |
|---|
| 1000000 10 |
| correct output |
|---|
| 256933600 |
| user output |
|---|
| 256933600 |
Test 14
Verdict: ACCEPTED
| input |
|---|
| 1000000 100 |
| correct output |
|---|
| 142013415 |
| user output |
|---|
| 142013415 |
Test 15
Verdict: ACCEPTED
| input |
|---|
| 1000000 1000 |
| correct output |
|---|
| 899626120 |
| user output |
|---|
| 899626120 |
Test 16
Verdict: ACCEPTED
| input |
|---|
| 1000000 10000 |
| correct output |
|---|
| 374265948 |
| user output |
|---|
| 374265948 |
Test 17
Verdict: ACCEPTED
| input |
|---|
| 1000000 100000 |
| correct output |
|---|
| 388134512 |
| user output |
|---|
| 388134512 |
Test 18
Verdict: ACCEPTED
| input |
|---|
| 1000000 1000000 |
| correct output |
|---|
| 235042058 |
| user output |
|---|
| 235042058 |
