Submission #60944405

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rrep(i,a,b) for(int i=(int)(a);i<=(int)(b);i++)
#define all(v) v.begin(),v.end()
typedef long long ll;
typedef pair<int,int> pii;
#include <atcoder/convolution>
#include <atcoder/modint>
//using mint = atcoder::modint1000000007;
using mint = atcoder::modint998244353;
//.val()でintとして出力　llに注意
ll INF=3e18;
ll modpow(ll a,ll x,ll M){//a^x modM
              ll r=1;
              for (; x>0; x>>=1,a=a*a%M) if (x&1) r=r*a%M;
             return r;
}

ll A,B,C;

int main(){
  
  cin >> A >> B >> C;
  ll a=1;
  a*=(A-B)*(A-B)+(B-C)*(B-C);
  a*=(A+B-C);
  a*=(-A+B+C);
  a*=(A-B+C);
  if(a==0) cout << "Yes" << endl;
  else cout << "No" << endl;
}

Submission Info

Judge Result