hiho week 313 register

Ended

Participants:23

Verdict:Accepted
Score:100 / 100
Submitted:2020-07-02 08:20:03

Lang:G++

Edit
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
#include <iostream>
using namespace std; 
int f[310][310][310];
int n,k;
int find(int a,int b,int c)
{
    if(f[a][b][c])
        return f[a][b][c];
    if(a == c)
    {
        f[a][b][c] = 1;
        return 1;
    }
    if(a-b>c)
        return 0;
    if(c == 0)
    {
        f[a][b][c] = (find(a,b-1,c+1)+find(a,b-1,0))%1000000007;
        return f[a][b][c];
    }
    else
    {
        f[a][b][c] = (find(a,b-1,c+1)+find(a-1,b,c-1))%1000000007;
        return f[a][b][c];
    }
}
int main(int argc, char** argv) {
    cin>>n>>k;
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX