POJ 2160 Box G++

#include <iostream>using namespace std;//谢谢博友翻译 int main(){int x[6],y[6];for(int i=0;i<6;i++){int a,b;cin>>a>>b;if(a>b){int t;t=a;a=b;b=t;}x[i]=a;y[i]=b;}for(int i=0;i<6;i++)//排序 {for(int j=i+1;j<6;j++){if(x[i]>x[j]){int t1,t2;t1=x[i];t2=y[i];x[i]=x[j];y[i]=y[j];x[j]=t1;y[j]=t2;}else if((x[i]==x[j])&&(y[i]>y[j])){int t1,t2;t1=x[i];t2=y[i];x[i]=x[j];y[i]=y[j];x[j]=t1;y[j]=t2;}}} int m[3],n[3];int js=0;for(int i=0;i<6;)//提取3个不同的板子 {if((x[i]==x[i+1])&&(y[i]==y[i+1])){m[js]=x[i];n[js]=y[i];js++;}i++;i++;}int jg=0;int a=0,b=0;if(js==3){if((m[0]==m[1])||(n[0]==m[1])){jg++;a=n[1]; }else if((m[0]==n[1])||(n[0]==n[1])){jg++;a=m[1];}if((m[0]==m[2])||(n[0]==m[2])){jg++;b=n[2];}else if((m[0]==n[2])||(n[0]==n[2])){jg++;b=m[2];}if(a==b){jg++;}}if(jg==3){cout<<"POSSIBLE";}else{cout<<"IMPOSSIBLE";}return 0;}