#include <bits/stdc++.h> using namespace std; typedef long long ll; int a[7]; int b[7]; int main() { int T; cin>>T; while(T--) { int n=6; for(int i=1;i<=n;i++) cin>>a[i]; bool ans=false; for(int i1=1;i1<=n;i1++) { for(int i2=1;i2<=n;i2++) { for(int i3=1;i3<=n;i3++) { for(int i4=1;i4<=n;i4++) { for(int i5=1;i5<=n;i5++) { for(int i6=1;i6<=n;i6++) { memset(b,0,sizeof b); b[i1]++,b[i2]++,b[i3]++,b[i4]++,b[i5]++,b[i6]++; int cnt=0; for(int i=1;i<=6;i++) if(b[i]) cnt+=1; if(cnt==6) { if((a[i1]+a[i2]>a[i3]&&a[i1]+a[i3]>a[i2]&&a[i2]+a[i3]>a[i1])&&(a[i4]+a[i5]>a[i6]&&a[i4]+a[i6]>a[i5]&&a[i5]+a[i6]>a[i4])) ans=true; } } } } } } } if(ans) puts("Yes"); else puts("No"); } return 0; }
https://ac.nowcoder.com/acm/contest/view-submission?submissionId=70110531