Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <bits/stdc++.h>
- using namespace std;
- const int maxn=1e3;
- int n,s,dem;
- int a[maxn];
- int x[maxn];
- int sum=0;
- void backtracking(int k)
- {
- for (int i=0;i<=1;i++){
- x[k]=i;
- if (x[k]==1) sum += a[k];
- if (k==n){
- if(sum==s) dem++;
- }else backtracking(k+1);
- if (x[k]==1) sum -= a[k];
- }
- }
- int main()
- {
- cin>>n>>s;
- for(int i=1;i<=n;i++)
- cin>>a[i];
- backtracking(1);
- cout<<dem;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement