UVa 1587 Box
2017-09-02 21:43
357 查看
#include <stdio.h> #include <string.h> #include <iostream> using namespace std; int main() { int w, h, d; int data[6][2]; //freopen("1587.txt", "r", stdin); while(cin >> data[0][0] >> data[0][1] >> data[1][0] >> data[1][1] >> data[2][0] >> data[2][1] >> data[3][0] >> data[3][1] >> data[4][0] >> data[4][1] >> data[5][0] >> data[5][1]) { for(int i = 0; i < 6; i++) { if(data[i][0] < data[i][1]) { int temp = data[i][1]; data[i][1] = data[i][0]; data[i][0] = temp; } } for(int i = 0; i < 6; i++) { for(int j = i+1; j < 6; j++) { if(data[i][0] < data[j][0]) { int temp0 = data[j][0]; data[j][0] = data[i][0]; data[i][0] = temp0; int temp1 = data[j][1]; data[j][1] = data[i][1]; data[i][1] = temp1; } if(data[i][0] == data[j][0] && data[i][1] < data[j][1]) { int temp1 = data[j][1]; data[j][1] = data[i][1]; data[i][1] = temp1; } } } bool flag = false; /* for(int i = 0; i < 6; i++) printf("%d %d\n", data[i][0], data[i][1]); */ if(data[0][0] == data[1][0] && data[1][0] == data[2][0] && data[2][0] == data[3][0] && data[4][0] == data[5][0] && data[5][0] == data[0][1] && data[0][1] == data[1][1] && data[2][1] == data[3][1] && data[3][1] == data[4][1] && data[4][1] == data[5][1]) { flag = true; } if(flag == true) printf("POSSIBLE\n"); else printf("IMPOSSIBLE\n"); } return 0; }
相关文章推荐
- ???习题3-10 UVa1587 Box
- uva 1587 Box
- UVA 1587 Box
- Uva-1587-Box-AC
- UVA - 1587 Box
- UVA1587 UVALive3214 POJ2160 Box
- uva-1587-Box
- Uva 1587:Box
- UVA-1587 box
- UVa1587-Box
- UVA 1587 Box
- UVa 1587 - Box【水题】
- 算法竞赛入门经典(紫书)第三章——Box UVA-1587
- UVA - 1587 Box 麻烦
- uva_1587_BOX
- UVa 1587 Box(暴力)
- UVa1587--Box--盒子(代码超简洁)
- UVA - 1587 Box
- UVa 1587 - Box
- UVa 1587 Box