暴搜+剪枝。#include<bits/stdc++.h>usingnamespacestd;structf{intrank,sum;}cou[10];inta[10][10],hang[10][10],lie[10][10],gong[10][10],s[100][4],u,ok,most=-1,have;intwhich(inti,intj){if(i<=3){if(j<=3)return1;