Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- #define D(x) cout<<#x<<" = "<<x<<endl
- string s;
- int n, k;
- int ck[20];
- int dp[11][11];
- int solve(int pos, int last)
- {
- if(pos == k) return 1;
- if(dp[pos][last]) return dp[pos][last];
- int ret = 0;
- for(int i = 0; i<n; i++)
- {
- if(pos == 0 && s[i] == '0') continue;
- if(ck[i]) continue;
- ck[i] = 1;
- ret += solve(pos+1, i);
- ck[i] = 0;
- }
- return dp[pos][last] = ret;
- }
- int main()
- {
- int t;
- cin>>t;
- while(t--)
- {
- memset(ck, 0, sizeof ck);
- memset(dp, 0, sizeof dp);
- cin>>s;
- n = s.length();
- cin>>k;
- int ans = solve(0, 0);
- cout<<ans<<endl;
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement