#include<bits/stdc++.h> #define MAXN 1000005 #define int long long usingnamespace std; inlineintread(){ int x=0,f=1; char ch=getchar(); while (ch<'0'||ch>'9'){ if (ch=='-') f=-1; ch=getchar(); } while (ch>='0'&&ch<='9'){ x=(x<<3)+(x<<1)+(ch^'0'); ch=getchar(); } return x*f; } #undef int intmain(){ #define int long long int t=read(); for (registerint i=1;i<=t;++i){ int a=read(),b=read(),n=read(); printf("%I64d\n",(n%3==0?a:(n%3==1?b:a^b))); } }
#include<bits/stdc++.h> #define MAXN 1000005 usingnamespace std; inlineintread(){ int x=0,f=1; char ch=getchar(); while (ch<'0'||ch>'9'){ if (ch=='-') f=-1; ch=getchar(); } while (ch>='0'&&ch<='9'){ x=(x<<3)+(x<<1)+(ch^'0'); ch=getchar(); } return x*f; } int ans[1005][1005]; intmain(){ int n=read(); int p=n/4; int cnt=0; for (registerint i=1;i<=p;++i){ for (registerint j=1;j<=p;++j){ for (registerint k=0;k<4;++k){ for (registerint l=0;l<4;++l){ ans[(i-1)*4+k+1][(j-1)*4+l+1]=cnt++; } } } } for (registerint i=1;i<=n;++i){ for (registerint j=1;j<=n;++j){ printf("%d ",ans[i][j]); } printf("\n"); } }
#include<bits/stdc++.h> #define MAXN 1000005 #define int long long usingnamespace std; inlineintread(){ int x=0,f=1; char ch=getchar(); while (ch<'0'||ch>'9'){ if (ch=='-') f=-1; ch=getchar(); } while (ch>='0'&&ch<='9'){ x=(x<<3)+(x<<1)+(ch^'0'); ch=getchar(); } return x*f; } namespace BIT{ int C[MAXN]; #define lowbit(i) (i&(-i)) inlinevoidAdd(int x,int val){ for (registerint i=x;i<MAXN;i+=lowbit(i)){ C[i]+=val; } } inlineintQuery(int x){ int ans=0; for (registerint i=x;i>0;i-=lowbit(i)){ ans+=C[i]; } return ans; } }; usingnamespace BIT; int a[MAXN],n; inlineintBinSearch(int pos){ int l=0,r=MAXN-1,ans; while (l<r-1){ int mid=(l+r)>>1; if (Query(mid)<=a[pos]) l=mid; else r=mid; } return r; } int ans[MAXN]; #undef int intmain(){ #define int long long n=read(); for (registerint i=1;i<=n;++i) a[i]=read(); for (registerint i=1;i<=n;++i){ Add(i,i); } for (registerint i=n;i>=1;--i){ int pos=BinSearch(i); Add(pos,-pos); ans[i]=pos; } for (registerint i=1;i<=n;++i){ printf("%I64d ",ans[i]); } }