week16- B2. Two Swords Style Easy, Author Solution

#include<bits/stdc++.h>
using namespace std;
bitset<20>sword[1000];
int main(){
    int n,q;
    scanf("%d%d",&n,&q);
    for(int i=0;i<n;i++){
        string s;
        cin>>s;
        sword[i]=bitset<20>(s);
    }
    while(q--){
        string s;
        cin>>s;
        bitset<20> mission(s);
        int cnt=0;
        for(int i=0;i<n;i++)
            for(int j=0;j<i;j++)
                if(((sword[i]|sword[j])&mission)==mission)cnt++;
        printf("%d\n",cnt);
    }
}