Submission #76232998

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
int main() {
    int N;
    cin >> N;
    for (int i = 0; i < N; i++) {
      long long Xo;
      cin >> Xo;
      long long Yo;
      cin >> Yo;
      long long Ro;
      cin >> Ro;
      long long Xt;
      cin >> Xt;
      long long Yt;
      cin >> Yt;
      long long Rt;
      cin >> Rt;
      long long alpha = (Ro-Rt)*(Ro-Rt);
      long long beta = (Ro+Rt)*(Ro+Rt);
      long long dist = (Xt-Xo)*(Xt-Xo)+(Yt-Yo)*(Yt-Yo);
      if (alpha <= dist && dist <= beta) {
        cout << "Yes" << endl;
      }
      else {
        cout << "No" << endl;
      }
    }
    
    return 0;
  }

Submission Info

Judge Result