WA40分

#include<bits/stdc++.h>
using namespace std;
int n,p,maxn,minn,sum;
vector<int> a[21];
void dfs(int x,int w){
	if(x==0){
		if(a[1][0]&&a[1][1]){
			sum=__gcd(a[1][0],a[1][1]);
		}
		maxn=sum;
		minn=sum;
		if(a[1][0]){
			dfs(1,0);
		}
		if(a[1][1]){
			dfs(1,2);
		}
	}else if(x<n-1){
		if(a[x+1][w]&&a[x+1][w+1]){
			sum=__gcd(a[x+1][w],a[x+1][w+1]);
		}
		if(sum>maxn)maxn=sum;
		if(sum<minn)minn=sum;
		if(a[x+1][w]){
			dfs(x+1,w);
		}
		if(a[x+1][w+1]){
			dfs(x+1,(w+1)*2);
		}
	}
}
int main(){
	scanf("%d",&n);
	for(int i=0;i<n;i++){
		for(int j=0;j<(int)(pow(2,i));j++){
			scanf("%d",&p);
			a[i].push_back(p);
		}
	}
	dfs(0,0);
	printf("%d %d",maxn,minn);
	return 0;
}