Submission #1075648
Source Code Expand
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <ctime>
#include <string>
#include <cstring>
#include <complex>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define mp make_pair
const ll MOD = (ll)1e9 + 7;
ll add(ll x, ll y)
{
x += y;
if (x >= MOD) return x - MOD;
return x;
}
ll sub(ll x, ll y)
{
x -= y;
if (x < 0) return x + MOD;
return x;
}
const int N = 2010;
int n, m, k;
ll dp[2 * N][N];
int main()
{
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
scanf("%d%d%d", &n, &m, &k);
if (n == 0 || m == 0)
{
printf("1\n");
return 0;
}
for (int i = 1; i < k; i++)
dp[1][i] = 1;
for (int i = 1; i < 2 * N - 1; i++)
{
ll sum = 0;
for (int j = 0; j < N; j++)
{
sum = add(sum, dp[i][j]);
if (j >= k)
sum = sub(sum, dp[i][j - k]);
dp[i + 1][j] = sum;
}
}
ll ans = 0;
for (int i = 1; i < 2 * N; i++)
for (int j = n; j >= 0; j -= k - 1)
{
int z = i * (k - 1) + 1 - j;
if (z <= 0 || z > m) continue;
ans = add(ans, dp[i][j]);
}
printf("%lld\n", ans);
return 0;
}
Submission Info
Submission Time
2017-01-22 22:24:17+0900
Task
E - Eternal Average
User
Um_nik
Language
C++14 (GCC 5.4.1)
Score
1600
Code Size
1435 Byte
Status
AC
Exec Time
93 ms
Memory
63488 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:42:32: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d%d", &n, &m, &k);
^
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
1600 / 1600
Status
Set Name
Test Cases
Sample
s1.txt, s2.txt, s3.txt
All
01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, s1.txt, s2.txt, s3.txt
Case Name
Status
Exec Time
Memory
01.txt
AC
83 ms
63360 KB
02.txt
AC
93 ms
63360 KB
03.txt
AC
82 ms
63360 KB
04.txt
AC
83 ms
63360 KB
05.txt
AC
87 ms
63360 KB
06.txt
AC
82 ms
63360 KB
07.txt
AC
84 ms
63488 KB
08.txt
AC
83 ms
63360 KB
09.txt
AC
83 ms
63360 KB
10.txt
AC
83 ms
63360 KB
11.txt
AC
76 ms
63360 KB
12.txt
AC
72 ms
63360 KB
13.txt
AC
82 ms
63360 KB
14.txt
AC
82 ms
63360 KB
15.txt
AC
82 ms
63360 KB
16.txt
AC
72 ms
63360 KB
17.txt
AC
80 ms
63360 KB
18.txt
AC
83 ms
63360 KB
19.txt
AC
89 ms
63360 KB
20.txt
AC
84 ms
63360 KB
21.txt
AC
83 ms
63360 KB
22.txt
AC
83 ms
63360 KB
23.txt
AC
83 ms
63360 KB
24.txt
AC
83 ms
63360 KB
s1.txt
AC
83 ms
63360 KB
s2.txt
AC
83 ms
63360 KB
s3.txt
AC
83 ms
63360 KB