bool Gauss(Matrix a, int n) {
for(int i=1; i<=n; i++) {
int r=i;
for(int j=i+1; j<=n; j++)
if(abs(a[j][i]) > abs(a[r][i])) r=j;
if(abs(a[r][i])<eps) return false;
if(r!=i) for(int j=1; j<=n+1; j++) swap(a[r][j], a[i][j]);
for(int j=i+1; j<=n; j++) {
double t = a[j][i]/a[i][i];
for(int k=i; k<=n+1; k++) a[j][k] -= t*a[i][k];
}
}
for(int i=n; i>=1; i--) {
for(int j=n; j>i; j--) a[i][n+1] -= a[i][j]*a[j][n+1];
a[i][n+1] /= a[i][i];
}
return true;
}bool Gauss(Matrix a, int n) {
for(int i=1; i<=n; i++) {
int r=i;
for(int j=i+1; j<=n; j++)
if(abs(a[j][i]) > abs(a[r][i])) r=j;
if(abs(a[r][i])<eps) return false;
if(r!=i) for(int j=1; j<=n+1; j++) swap(a[r][j], a[i][j]);
for(int j=i+1; j<=n; j++) {
double t = a[j][i]/a[i][i];
for(int k=i; k<=n+1; k++) a[j][k] -= t*a[i][k];
}
}
for(int i=n; i>=1; i--) {
for(int j=n; j>i; j--) a[i][n+1] -= a[i][j]*a[j][n+1];
a[i][n+1] /= a[i][i];
}
return true;
}#pragma GCC optimize(3,"Ofast","inline")
#pragma GCC optimize(2)
#include<algorithm>
#include<cstring>
#include<cstdio>
#define LL long long
#define Re register int
using namespace std;
const int N=5e5+3,logN=20,inf=2e9;
int n,x,y,T;
inline void in(Re &x){
int f=0;x=0;char c=getchar();
while(c<'0'||c>'9')f|=c=='-',c=getchar();
while(c>='0'&&c<='9')x=(x<<1)+(x<<3)+(c^48),c=getchar();
x=f?-x:x;
}
struct JI{
int p[logN+1],ip[logN+1];JI(){memset(p,0,sizeof(p));}
inline void insert(Re x,Re id){
for(Re i=logN;i>=0;--i)
if((x>>i)&1){
if(!p[i]){p[i]=x,ip[i]=id;break;}
if(ip[i]<id)swap(p[i],x),swap(ip[i],id);
x^=p[i];
}
}
inline int ask(Re L){
Re ans=0;
for(Re i=logN;i>=0;--i)if(ip[i]>=L)ans=max(ans,ans^p[i]);
return ans;
}
}A[N],S[N];
int main(){
// freopen("456.txt","r",stdin);
in(n);
for(Re i=1;i<=n;++i)in(x),S[i]=S[i-1],S[i].insert(x,i);
in(T);
while(T--)in(x),in(y),printf("%d\n",S[y].ask(x));
}
#include<cstring>
#include<cstdio>
#define LL long long
#define Re register LL
const int N=103,P=1e9+7;
LL n,K;
inline void in(Re &x){
int f=0;x=0;char c=getchar();
while(c<'0'||c>'9')f|=c=='-',c=getchar();
while(c>='0'&&c<='9')x=(x<<1)+(x<<3)+(c^48),c=getchar();
x=f?-x:x;
}
struct Matrix{
LL a[N][N];
Matrix(){memset(a,0,sizeof(a));}
inline void read(){
for(Re i=1;i<=n;++i)
for(Re j=1;j<=n;++j)
in(a[i][j]);
}
inline void print(){
for(Re i=1;i<=n;puts(""),++i)
for(Re j=1;j<=n;++j)
printf("%lld ",a[i][j]);
}
inline Matrix operator*(const Matrix &O)const{
Matrix ans;
for(Re i=1;i<=n;++i)
for(Re j=1;j<=n;++j)
for(Re k=1;k<=n;++k)
(ans.a[i][j]+=a[i][k]*O.a[k][j]%P)%=P;
return ans;
}
inline Matrix operator*=(Matrix &O){return *this=*this*O;}
}A;
inline Matrix mi(Matrix x,Re k){
if(!k)return x;--k;
Matrix s=x;
while(k){
if(k&1)s*=x;
x*=x,k>>=1;
}
return s;
}
int main(){
in(n),in(K),A.read(),mi(A,K).print();
}
#include<algorithm>
#include<cstdio>
#define LL long long
#define Re register LL
using namespace std;
const int N=55;
LL n,x,ans,p[N];
inline void in(Re &x){
Re fu=0;x=0;char ch=getchar();
while(ch<'0'||ch>'9')fu|=ch=='-',ch=getchar();
while(ch>='0'&&ch<='9')x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
x=fu?-x:x;
}
inline void insert(Re x){
for(Re i=50;i>=0;--i)
if((x>>i)&1){
if(!p[i]){p[i]=x;break;}
x^=p[i];
}
}
int main(){
// freopen("123.txt","r",stdin);
in(n);
for(Re i=1;i<=n;++i)in(x),insert(x);
for(Re i=50;i>=0;--i)ans=max(ans,ans^p[i]);
printf("%lld\n",ans);
}
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<queue>
#define LL long long
#define Re register LL
using namespace std;
const LL N=2e4+3,M=2e5+3,inf=2e18,logN=14;
LL n,m,o,x,y,T,A[N],head[N];
struct QAQ{LL to,next;}a[N<<1];
inline void add(Re x,Re y){a[++o].to=y,a[o].next=head[x],head[x]=o;}
inline void in(Re &x){
int f=0;x=0;char c=getchar();
while(c<'0'||c>'9')f|=c=='-',c=getchar();
while(c>='0'&&c<='9')x=(x<<1)+(x<<3)+(c^48),c=getchar();
x=f?-x:x;
}
struct JI{
LL p[61];JI(){memset(p,0,sizeof(p));}
inline void insert(Re x){
for(Re i=60;i>=0;--i)
if((x>>i)&1){
if(!p[i]){p[i]=x;break;}
x^=p[i];
}
}
inline void merge(JI O){
for(Re i=60;i>=0;--i)if(O.p[i])insert(O.p[i]);
}
inline LL ask(){
Re ans=0;
for(Re i=60;i>=0;--i)ans=max(ans,ans^p[i]);
return ans;
}
};
struct LCA{
LL deep[N],fa[N][15],ant[N][15];JI dp[N][15];
inline void dfs(Re x,Re fa){
deep[x]=deep[ant[x][0]=fa]+1,dp[x][0].insert(A[fa]);
for(Re j=1;(1<<j)<=deep[x];++j)ant[x][j]=ant[ant[x][j-1]][j-1],dp[x][j]=dp[x][j-1],dp[x][j].merge(dp[ant[x][j-1]][j-1]);
for(Re i=head[x];i;i=a[i].next)if(a[i].to!=fa)dfs(a[i].to,x);
}
inline JI ask(Re x,Re y){
JI Ans;Ans.insert(A[x]),Ans.insert(A[y]);
if(deep[x]<deep[y])swap(x,y);
for(Re i=logN;i>=0;--i)if(deep[ant[x][i]]>=deep[y])Ans.merge(dp[x][i]),x=ant[x][i];
if(x==y)return Ans;
for(Re i=logN;i>=0;--i)if(ant[x][i]!=ant[y][i])Ans.merge(dp[x][i]),Ans.merge(dp[y][i]),x=ant[x][i],y=ant[y][i];
Ans.merge(dp[x][0]);
return Ans;
}
}T1;
int main(){
// freopen("lucky.in","r",stdin);
// freopen("lucky.out","w",stdout);
in(n),in(T),m=n-1;
for(Re i=1;i<=n;++i)in(A[i]);
while(m--)in(x),in(y),add(x,y),add(y,x);
T1.dfs(1,0);
while(T--)in(x),in(y),printf("%lld\n",T1.ask(x,y).ask());
}
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<cmath>
#define LD double
#define LL long long
#define Re register int
using namespace std;
const int N=103;
int n;LD eps=1e-8,a[N][N];
inline int dcmp(Re a){return a<-eps?-1:(a>eps?1:0);}
inline LD Abs(LD a){return dcmp(a)*a;}
inline void in(Re &x){
Re fu=0;x=0;char ch=getchar();
while(ch<'0'||ch>'9')fu|=ch=='-',ch=getchar();
while(ch>='0'&&ch<='9')x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
x=fu?-x:x;
}
int main(){
// freopen("123.txt","r",stdin);
in(n);
for(Re i=1;i<=n;++i)
for(Re j=1;j<=n+1;++j)
scanf("%lf",&a[i][j]);
for(Re j=1;j<=n;++j){
Re w=j;
for(Re i=j+1;i<=n;++i)
if(dcmp(Abs(a[i][j])-Abs(a[w][j]))>0)w=i;
for(Re k=1;k<=n+1;++k)swap(a[j][k],a[w][k]);
if(!dcmp(a[j][j]))return !puts("No Solution");
for(Re i=1;i<=n;++i)
if(i!=j){
LD tmp=a[i][j]/a[j][j];
for(Re k=j;k<=n+1;++k)a[i][k]-=a[j][k]*tmp;
}
}
for(Re i=1;i<=n;++i)printf("%.2lf\n",a[i][n+1]/a[i][i]);
}