//https://www.acmicpc.net/problem/1182#include using namespace std;int arr[20];int cnt;int N, S;void match(int idx, int sum){ if(idx==N){ cnt = sum==S ? cnt+1 : cnt; return; } for(int i=0; i> N >> S; for(int i=0; i> arr[i]; } match(0, 0); if(S==0) cnt--; cout
//https://www.acmicpc.net/problem/2501 #include using namespace std; int main(){ int N, K; cin >> N >> K; int cnt=0; for(int i=1; i
//https://www.acmicpc.net/problem/9506 #include #include using namespace std; void process(int n){ int ans=1; int tmp[5000]; memset(tmp, 0, sizeof(int)*5000); tmp[0]=1; int index=1; for(int i=2; i
//https://www.acmicpc.net/problem/2600 #include using namespace std;bool dp[501][501];int b[3];int k[2][5];void find_dp(){ for(int i=0; i> b[0] >> b[1] >> b[2] ; find_dp(); for(int i=0; i> k[0][i] >> k[1][i]; } for(int i=0; i
