Submission #74316969

---

Source Code Expand

#include<bits/stdc++.h>
//#define int long long
//#define MSOD
//#define READ_IN_FILE
#define endl '\n'
#define FAST ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
const int N=1e3+10,P=998244353,MOD=1e9+7,inf=0x3f3f3f3f;
bool cmpbig(int i,int j)
{
	return i>j;
}
double mylog(int x,int y)
{
	return log(x)/log(y);
}
long long qpow(long long a,long long b,long long mod=LLONG_MAX)
{
	long long num=1;
	while(b)
	{
		if(b&1)num=num*a%mod;
		a=a*a%mod;
		b>>=1;
	}
	return num;
}
int n,c[N][N];
void solve()
{
	cin>>n;
	for(int i=1;i<n;i++)
		for(int j=i+1;j<=n;j++)
			cin>>c[i][j];
	for(int i=1;i<=n;i++)
		for(int j=i+1;j<=n;j++)
			for(int k=j+1;k<=n;k++)
				if(c[i][j]+c[j][k]<c[i][k])
				{
					cout<<"Yes";
					return;
				}
	cout<<"No";
	return;
}
signed main()
{
	FAST
#ifdef READ_IN_FILE
	freopen(".in","r",stdin);
	freopen(".out","w",stdout);
#endif
	int _T_=1;
#ifdef MSOD
	cin>>_T_;
#endif
	while(_T_--)solve();
	return 0;
}

Submission Info

Judge Result