Codeforces Round #407 (Div. 2), problem: (E) The Great Mixing Solution in C
#include<bits/stdc++.h> using namespace std; int n,k,f; bitset<2001> dp; int main() { cin>>n>>k; for(int i=1,t;i<=k;i++) { scanf(“%d”,&t); f=1; } dp=1; int now=0; for(int i=1;i<=1000;i++) { now^=1; dp.reset(); for(int j=0;j<=1000;j++) if(f)dp|=(dp<<j)>>n; if(dp) { return 0*printf(“%d\n”,i); } } …