codeforces 452B 4-point polyline

#include<cstdio>
#include<cstring>
#include<cmath>
#include<climits>
#include<cctype>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<queue>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<stack>
#define ll long long
#define MAX 1000
#define INF INT_MAX
#define eps 1e-7

using namespace std;

int main(){
	int n,m;
	while (scanf("%d%d",&n,&m) != EOF){
		if (n == 0){
			printf("%d %d\n%d %d\n%d %d\n%d %d\n",0,1,0,m,0,0,0,m-1);
		}
		else if (m == 0){
			printf("%d %d\n%d %d\n%d %d\n%d %d\n",1,0,n,0,0,0,n-1,0);
		}
		else {
			double t1 = (double)(2*sqrt((double)((n-1)*(n-1) + m*m)) ) + eps;
			double t2 = (double)(2*sqrt((double)((m-1)*(m-1) + n*n)) ) + eps;
			double t3 = (double)(sqrt((double)(n*n+m*m)) + n ) + eps;
			double t4 = (double)(sqrt((double)(n*n+m*m)) + m ) + eps;
			//printf("%lf %lf %lf %lf\n",t1,t2,t3,t4);
			if (t1 >= t2 && t1 >= t3 && t1 >= t4){
				printf("%d %d\n%d %d\n%d %d\n%d %d\n",1,0,n,m,0,0,n-1,m);
			}
			else if (t2 >= t1 && t2 >= t3   && t2 >= t4 ){
				printf("%d %d\n%d %d\n%d %d\n%d %d\n",0,1,n,m,0,0,n,m-1);
			}
			else if (t3 >= t1  && t3 >= t2 && t3 >= t4 ){
				printf("%d %d\n%d %d\n%d %d\n%d %d\n",0,0,n,m,0,m,n,0);
			}
			else{
				printf("%d %d\n%d %d\n%d %d\n%d %d\n",0,0,n,m,n,0,0,m);
			}
		}
	}
	return 0;
}