Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- typedef vector<int> vi;
- typedef vector<long long> vll;
- typedef pair<int,int> pii;
- typedef vector< pii > vii;
- #define ll long long
- #define ff first
- #define ss second
- #define pb push_back
- #define mkp make_pair
- #define sz size()
- #define forf(a,b,c) for(int i=a;i<=b;i+=c)
- #define forr(a,b,c) for(int i=a;i>=b;i-=c)
- #define all(a) a.begin(),a.end()
- #define mem(a,b) memset(a,b,sizeof(a))
- #define pi 2*acos(0.0)
- #define End return 0;
- #define nl endl
- #define scan1(a) scanf("%d",&a)
- #define scan2(a,b) scanf("%d %d",&a,&b)
- #define scan3(a,b,c) scanf("%d %d %d",&a,&b,&c)
- #define scanl(a) scanf("%lld",&a)
- #define scanll(a,b) scanf("%lld %lld",&a,&b)
- #define scanlll(a,b,c) scanf("%lld %lld %lld",&a,&b,&c)
- #define print1(a) printf("%d",a)
- #define print2(a,b) printf("%d %d",a,b)
- #define print3(a,b,c) printf("%d %d %d",a,b,c)
- #define printl(a) printf("%lld",a)
- #define printll(a,b) printf("%lld %lld",a,b)
- #define printlll(a,b,c) printf("%lld %lld %lld",a,b,c)
- #define MAXN 100000007
- #define INF 0x3f3f3f3f
- bool mark[100005];vi prime;
- void seive(ll N){for(int i=2;i<=N;i++){if(mark[i]==false){prime.pb(i);for(int j=i+i;j<N;j+=i)mark[j]=true;}}}
- //freopen("input.txt", "r", stdin);
- ll DP[100][100],cnt=0;
- int n,kk,rw;
- ll recur(int row, int k)
- {
- if(k==kk) return (n-row+1)*(n-k+1);
- if(k==n+1||row>n||row+kk-k>n) return 0;
- if(DP[row+1][k]!=0) DP[row][k]+=DP[row+1][k];
- else DP[row][k]+=recur(row+1,k);
- if(DP[row+1][k+1]!=0) DP[row][k]+=(n-k+1)*DP[row+1][k+1];
- else DP[row][k]+=(n-k+1)*recur(row+1,k+1);
- return DP[row][k];
- }
- int main()
- {
- ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
- int t, cases=0; cin>>t;
- while(t--)
- {
- cin>>n>>kk;cnt=0;
- cout<<"Case "<<++cases<<": ";
- if(kk==0) cout<<1<<endl;
- else
- {
- DP[0][0]=recur(1,1);
- cout<<DP[0][0]<<endl;
- }
- for(int i=0;i<32;i++)
- for(int j=0;j<32;j++) DP[i][j]=0;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement