0分求调

#include<iostream>
using namespace std;
long long kr,x,y;
void fenz(long long wx,long long wy,long long a,long long b,long long k);
int main(){
	cin >> kr >> x >> y;
	fenz(1,1,x,y,kr);cin >> x;
    return 0;
}
void fenz(long long wx,long long wy,long long a,long long b,long long k){
	if(k==0) return;
	long long lsa = 2<<(k-2);
	if(k == 1) lsa = 1;
	long long midx=wx+lsa;long long midy=wy+lsa;
	if(a<midx&&b<midy) {
		printf("%d %d %d\n",midx,midy,1);
		fenz(wx,wy,a,b,k-1);
		fenz(wx,midy,midx-1,midy,k-1);
		fenz(midx,wy,midx,midy-1,k-1);
		fenz(midx,midy,midx,midy,k-1);
	}
	else if(a < midx&&midy>b) {
		printf("%d %d %d\n",midx,midy-1,2);
		fenz(wx,wy,midx-1,midy-1,k-1);
		fenz(wx,midy,a,b,k-1);
		fenz(midx,wy,midx,midy-1,k-1);
		fenz(midx,midy,midx,midy,k-1);
	}
	else if(midx<=a&&midy>b) {
		printf("%d %d %d\n",midx-1,midy,3);
		fenz(wx,wy,midx-1,midy-1,k-1);
		fenz(wx,midy,midx-1,midy,k-1);
		fenz(midx,wy,a,b,k-1);
		fenz(midx,midy,midx,midy,k-1);
	}
	else if(midx <= a&midy<=b){
		printf("%d %d %d\n",midx-1,midy-1,4);
		fenz(wx,wy,midx-1,midy-1,k-1);
		fenz(wx,midy,midx-1,midy,k-1);
		fenz(midx,wy,midx,midy-1,k-1);
		fenz(midx,midy,a,b,k-1);
	}
}