Submission #74272298

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef double db;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<int,char> pic;
typedef vector<int> vi;
typedef vector<ll> vll;
#define SZ(x) ((int)x.size())
ll ksm(ll a,ll b,ll p){if (p == 1)return 0;if (b == 0)return 1%p;
ll ans = 1;	a %= p;while (b > 0){if (b&1){ans = ans*a%p;}a = (a*a)
%p;b >>= 1;}return ans;}
const int mod = 1e9+7;
const int P = 998244353;
const ll inf = (1LL << 50LL);
const ll N = 5010;

int n;
int c[110][110];
int main(){
	scanf("%d",&n);
	for (int i = 1;i <= n-1;i++){
		for (int j = i+1;j <= n;j++){
			scanf("%d",&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]){
					printf("Yes");
					return 0;
				}
			}
		}
	}
	printf("No");
		
    return 0;
}

Submission Info

Judge Result