Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import java.io.*;
- import java.util.*;
- public class Test7 {
- InputStream is = System.in;
- void solve() {
- PrintWriter pw = new PrintWriter(System.out);
- int a = ni(), b, ans = 0;
- long[] mask = new long[a];
- long l1, l2, k1 = (long) Math.pow(2, 8), k2 = (long) Math.pow(2, 16), k3 = (long) Math.pow(2, 24);
- for (int q = 0; q < a; q++) {
- mask[q] = (long)ni() * k3 + ni() * k2 + ni() * k1 + ni();
- }
- b = ni();
- for (int q = 0; q < b; q++, ans = 0) {
- l1 = (long)ni() * k3 + ni() * k2 + ni() * k1 + ni();
- l2 = (long)ni() * k3 + ni() * k2 + ni() * k1 + ni();
- for (int w = 0; w < a; w++) if (((l1) & (mask[w])) == ((l2) & (mask[w]))) ans++;
- pw.println(ans);
- }
- pw.flush();
- }
- public static void main(String[] args) throws Exception { new Test7().solve(); }
- byte[] inbuf = new byte[1<<20];
- int lenbuf = 0, ptrbuf = 0;
- int readByte()
- {
- if(lenbuf == -1) throw new InputMismatchException();
- if(ptrbuf >= lenbuf){
- ptrbuf = 0;
- try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
- if(lenbuf <= 0)return -1;
- }
- return inbuf[ptrbuf++];
- }
- int ni()
- {
- int num = 0, b, sign=1;
- while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
- if(b == '-'){
- sign=-1;
- b = readByte();
- }
- while(true){
- if(b >= '0' && b <= '9'){
- num = num * 10 + (b - '0');
- }else{
- return num*sign;
- }
- b = readByte();
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement