http://codeforces.com/problemset/problem/733/D 先给边排序,然后按3条边排序,只要判断相邻是否能组成长方体. #include<iostream> #include<cstring> #include<cstdio> #include<algorithm> using namespace std; struct xxx { int a,b,c,p; }xx[]; ]; bool cmp(xxx X,xxx Y)…