Task: | Lähetit |
Sender: | |
Submission time: | 2015-07-18 16:16:23 +0300 |
Language: | C++ |
Status: | READY |
Result: | 100 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 12 |
#2 | ACCEPTED | 23 |
#3 | ACCEPTED | 65 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.09 s | 1 | details |
#2 | ACCEPTED | 0.10 s | 1 | details |
#3 | ACCEPTED | 0.10 s | 1 | details |
#4 | ACCEPTED | 0.10 s | 1 | details |
#5 | ACCEPTED | 0.09 s | 1 | details |
#6 | ACCEPTED | 0.10 s | 2 | details |
#7 | ACCEPTED | 0.09 s | 2 | details |
#8 | ACCEPTED | 0.10 s | 2 | details |
#9 | ACCEPTED | 0.11 s | 2 | details |
#10 | ACCEPTED | 0.11 s | 2 | details |
#11 | ACCEPTED | 0.09 s | 3 | details |
#12 | ACCEPTED | 0.11 s | 3 | details |
#13 | ACCEPTED | 0.08 s | 3 | details |
#14 | ACCEPTED | 0.10 s | 3 | details |
#15 | ACCEPTED | 0.10 s | 3 | details |
Code
#include <iostream> #define ll long long #define ull unsigned long long #define pii pair<int, int> #define pll pair<long long, long long> #define defmod 1000000007 using namespace std; ll s[2020][2020] = {0}; ll d[2020][2020] = {0}; int main(){ cin.sync_with_stdio(0); cin.tie(0); ll n, k; cin >> n >> k; s[0][0] = 1; for (int i = 1; i <= 2000; i++) { for (int j = 1; j <= i; j++) { s[i][j] = j*s[i-1][j]+s[i-1][j-1]; s[i][j]%=defmod; } } for (int i = 0; i <= 2000; i++) { d[i][0] = 1; for (int j = 1; j <= i; j++) { d[i][j] = d[i-1][j-1]+d[i-1][j]; d[i][j]%=defmod; } } ll re = 0; for(ll i = max(0LL, k-n); i <= min(k, n); i++){ ll a = 0; for(ll j = 0; j <= (n+1)/2; j++){ a+=((d[(n+1)/2][j])*s[j+n/2][n-i]); a%=defmod; } ll b = 0; for(ll j = 0; j <= n/2; j++){ b+=(d[n/2][j])*(s[j+(n+1)/2][n-k+i]); b%=defmod; } re+=a*b; re%=defmod; } cout << re << endl; return 0; }
Test details
Test 1
Group: 1
Verdict: ACCEPTED
input |
---|
5 2 |
correct output |
---|
240 |
user output |
---|
240 |
Test 2
Group: 1
Verdict: ACCEPTED
input |
---|
5 4 |
correct output |
---|
2728 |
user output |
---|
2728 |
Test 3
Group: 1
Verdict: ACCEPTED
input |
---|
5 6 |
correct output |
---|
1960 |
user output |
---|
1960 |
Test 4
Group: 1
Verdict: ACCEPTED
input |
---|
5 8 |
correct output |
---|
32 |
user output |
---|
32 |
Test 5
Group: 1
Verdict: ACCEPTED
input |
---|
5 10 |
correct output |
---|
0 |
user output |
---|
0 |
Test 6
Group: 2
Verdict: ACCEPTED
input |
---|
10 4 |
correct output |
---|
1809464 |
user output |
---|
1809464 |
Test 7
Group: 2
Verdict: ACCEPTED
input |
---|
10 8 |
correct output |
---|
209594075 |
user output |
---|
209594075 |
Test 8
Group: 2
Verdict: ACCEPTED
input |
---|
10 12 |
correct output |
---|
811277399 |
user output |
---|
811277399 |
Test 9
Group: 2
Verdict: ACCEPTED
input |
---|
10 16 |
correct output |
---|
17275136 |
user output |
---|
17275136 |
Test 10
Group: 2
Verdict: ACCEPTED
input |
---|
10 20 |
correct output |
---|
0 |
user output |
---|
0 |
Test 11
Group: 3
Verdict: ACCEPTED
input |
---|
100 40 |
correct output |
---|
126883191 |
user output |
---|
126883191 |
Test 12
Group: 3
Verdict: ACCEPTED
input |
---|
100 80 |
correct output |
---|
785497039 |
user output |
---|
785497039 |
Test 13
Group: 3
Verdict: ACCEPTED
input |
---|
100 120 |
correct output |
---|
324216296 |
user output |
---|
324216296 |
Test 14
Group: 3
Verdict: ACCEPTED
input |
---|
100 160 |
correct output |
---|
895190039 |
user output |
---|
895190039 |
Test 15
Group: 3
Verdict: ACCEPTED
input |
---|
100 200 |
correct output |
---|
0 |
user output |
---|
0 |