51nod1346 递归

题目
题解

#include<bits/stdc++.h>
using namespace std;
const int M=131072;
int a[102][M+103],b[M+103][102],q,x,y,i,j;
inline char gc(){
    static char buf[100000],*p1=buf,*p2=buf;
    return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
}
#define gc getchar
inline int read(){
    int x=0,fl=1;char ch=gc();
    for (;ch<48||ch>57;ch=gc())if(ch=='-')fl=-1;
    for (;48<=ch&&ch<=57;ch=gc())x=(x<<3)+(x<<1)+(ch^48);
    return x*fl;
}
inline void wri(int a){if(a<0)a=-a,putchar('-');if(a>=10)wri(a/10);putchar(a%10|48);}
inline void wln(int a){wri(a);puts("");}
int main(){
    freopen("1.in","r",stdin);
    freopen("1.out","w",stdout);
    for (i=2;i<=M+100;i++){
        a[1][i]=read();
        if (i<=100) b[1][i]=a[1][i];
    }
    for (i=2;i<=M+100;i++){
        b[i][1]=read();
        if (i<=100) a[i][1]=b[i][1];
    }
    for (i=2;i<=100;i++)
        for (j=2;j<=M+100;j++) a[i][j]=a[i-1][j]^a[i][j-1];
    for (i=2;i<=M+100;i++)
        for (j=2;j<=100;j++) b[i][j]=b[i-1][j]^b[i][j-1];
    q=read();
    while (q--){
        x=read();y=read();
        wln(a[x][y+M]^b[x+M][y]);
    }
}