text
stringlengths 49
983k
|
|---|
#include<iostream>
using namespace std;
int main(){
int n,i,s,h,j;
char a,x[4][14]={false};
cin>>n;
for(i=0;i<n;i++)
{
cin>>a>>s;
if(a=='S')x[0][s]=true;
if(a=='H')x[1][s]=true;
if(a=='C')x[2][s]=true;
if(a=='D')x[3][s]=true;
}
for(h=0;h<4;h++)
{
for(j=0;j<13;j++)
{
if(x[h][j+1]==false){
if(h==0){cout<<"S "<<j+1<<endl;}
if(h==1){cout<<"H "<<j+1<<endl;}
if(h==2){cout<<"C "<<j+1<<endl;}
if(h==3){cout<<"D "<<j+1<<endl;}
}
}
}
return 0;
}
|
#include <iostream>
#include <vector>
#include <map>
#define PI 3.14159265359
using namespace std;
int main(){
int n, r;
char s, ss[] = {'S', 'H', 'C', 'D'};
map<char, map<int, bool> > card;
cin >> n;
for (int i = 0; i < 4; i++){
for (int j = 1; j <= 13; j++){
card[ss[i]][j] = false;
}
}
for (int i = 0; i < n; i++){
cin >> s >> r;
card[s][r] = true;
}
for (int i = 0; i < 4; i++){
for (int j = 1; j <= 13; j++){
if (!card[ss[i]][j]) cout << ss[i] << " " << j << endl;
}
}
}
|
#include<stdio.h>
int main()
{
int a[20][20]={0},num,n;
char card;
scanf("%d",&n);
for(int x=0;x<n;x++)
{
scanf(" %c %d",&card,&num);
if(card=='S') a[0][num]=1;
if(card=='H') a[1][num]=1;
if(card=='C') a[2][num]=1;
if(card=='D') a[3][num]=1;
}
for(int i=0;i<=3;i++)
{
for(int j=1;j<=13;j++)
{
if(a[i][j]==1) continue;
if(a[i][j]==0&&i==0) printf("S %d\n",j);
if(a[i][j]==0&&i==1) printf("H %d\n",j);
if(a[i][j]==0&&i==2) printf("C %d\n",j);
if(a[i][j]==0&&i==3) printf("D %d\n",j);
}
}
return 0;
}
|
#include <iostream>
int n, a[4][13] = {};
void plus(char c, int m) {
switch(c) {
case 'S':
a[0][m]++;
break;
case 'H':
a[1][m]++;
break;
case 'C':
a[2][m]++;
break;
case 'D':
a[3][m]++;
}
}
int main() {
char b[4] = {'S', 'H', 'C', 'D'};
std::cin >> n;
for (int i = 0; i < n; i++) {
char c;
int m;
std::cin >> c >> m;
plus(c, m - 1);
}
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 13; j++) {
if (a[i][j] == 0) std::cout << b[i] << " " << j + 1 << std::endl;
}
}
return 0;
}
|
#include <stdio.h>
#include <iostream>
using namespace std;
int main(){
char suit[4] = {'S', 'H', 'C', 'D'};
int card[4][13];
for(int i = 0; i < 4; i++){
for (int j = 0; j < 13; j++){
card[i][j] = 1;
}
}
int n;
cin >> n;
for(int i = 0; i < n; i++){
char s;
int c;
cin >> s >> c;
int snumber;
for(int j = 0; j < 4; j++){
if(s == suit[j]){
snumber = j;
}
}
card[snumber][c-1] = 0;
}
for(int i = 0; i < 4; i++){
for(int j = 0; j < 13; j++){
if(card[i][j]==1){
cout << suit[i] << " " << j+1 << "\n";
}
}
}
}
|
#include<stdio.h>
#include<string.h>
int main()
{
int a,n;
int f[13][4];
int i,j;
char b;
for(i=0;i<13;i++) for(j=0;j<4;j++) f[i][j]=0;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf(" %c %d",&b,&a);
if(b=='S') f[a-1][0]=1;
if(b=='H') f[a-1][1]=1;
if(b=='C') f[a-1][2]=1;
if(b=='D') f[a-1][3]=1;
}
for(i=0;i<4;i++)
{
for(j=0;j<13;j++)
{
if(f[j][i]==0)
{
if(i==0) printf("S %d\n",j+1);
else if(i==1) printf("H %d\n",j+1);
else if(i==2) printf("C %d\n",j+1);
else if(i==3) printf("D %d\n",j+1);
}
}
}
return 0;
}
|
#include<iostream>
#include<cstdio>
using namespace std;
int n,e,s[14],h[14],c[14],d[14];
char m;
int main(){
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf(" %c%d",&m,&e);
if(m=='S') s[e]++;
else if(m=='H') h[e]++;
else if(m=='C') c[e]++;
else if(m=='D') d[e]++;
}
for(int i=1;i<=13;i++){
if(s[i]==0) printf("S %d\n",i);
}
for(int i=1;i<=13;i++){
if(h[i]==0) printf("H %d\n",i);
}
for(int i=1;i<=13;i++){
if(c[i]==0) printf("C %d\n",i);
}
for(int i=1;i<=13;i++){
if(d[i]==0) printf("D %d\n",i);
}
return 0;
}
|
#include <iostream>
using namespace std;
int main(){
int n;
cin >> n;
int a[4][13] = {};
int x,y;
char c[] = "SHCD";
char b;
for(int i=0;i<n;i++){
cin >> b >> y;
for(int j=0;j<4;j++) if(b==c[j]) x = j;
a[x][y-1] = 1;
}
for(int i=0;i<4;i++){
for(int j=0;j<13;j++) if(a[i][j]==0) cout << c[i] << " " << j+1 << endl;
}
}
|
#include <iostream>
using namespace std;
int main() {
const int n = 13;
const int m = 4;
char mark[4] = {'S', 'H', 'C', 'D'};
int q;
cin >> q;
bool card[m][n] = {{}};
while (q--) {
char c;
int num;
cin >> c >> num;
for (int i = 0; i < 4; i++) {
if (mark[i] == c) {
card[i][num - 1] = true;
}
}
}
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
if (not card[i][j]) {
cout << mark[i] << ' ' << j + 1 << endl;
}
}
}
return 0;
}
|
#include<iostream>
using namespace std;
int main() {
int n;
cin >> n;
bool arry[4][13] = { false };
int rearr[100];
char k;
int num;
while (1) {
for (int i = 1; i <= n; i++) {
cin >> k >> num;
int m = k == 'S' ? 0 : k == 'H' ? 1 : k == 'C' ? 2 : k == 'D' ? 3 : NULL;
arry[m][num-1] = true;
}
for (int j = 0; j < 4; j++) {
for (int l = 0; l < 13; l++) {
if (arry[j][l] == 0) {
char q = j == 0 ? 'S' : j == 1 ? 'H' : j == 2 ? 'C' : j == 3 ? 'D' : NULL;
cout << q << " " << l+1 << endl;
}
}
}
break;
}
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
map<pair<char, int>, int> m;
for (int i=0;i<n;i++){
char c; int x;
cin >> c >> x;
m[{c,x}] = 1;
}
for (int i=1;i<=13;i++){
if (!m[{'S',i}]){
cout << 'S' << ' ' << i << endl;
}
}
for (int i=1;i<=13;i++){
if (!m[{'H',i}]){
cout << 'H' << ' ' << i << endl;
}
}
for (int i=1;i<=13;i++){
if (!m[{'C',i}]){
cout << 'C' << ' ' << i << endl;
}
}
for (int i=1;i<=13;i++){
if (!m[{'D',i}]){
cout << 'D' << ' ' << i << endl;
}
}
}
|
#include<iostream>
using namespace std;
int main(){
bool cards[4][14];
int n,rank;
char mark;
for(int i=0;i<4;i++){
for(int j=1;j<=13;j++){
cards[i][j]=0;
}
}
cin >>n;
for(int i=0;i<n;i++){
cin >>mark >>rank;
if(mark=='S') cards[0][rank]=1;
if(mark=='H') cards[1][rank]=1;
if(mark=='C') cards[2][rank]=1;
if(mark=='D') cards[3][rank]=1;
}
for(int i=0;i<4;i++){
for(int j=1;j<=13;j++){
if(cards[i][j]) continue;
if(i==0) mark='S';
if(i==1) mark='H';
if(i==2) mark='C';
if(i==3) mark='D';
cout <<mark <<" " <<j <<endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int n;
int main()
{
cin >> n;
map<pair<char, int>, int> mp;
for (int i = 0; i < n; i++)
{
char a;
int b;
cin >> a >> b;
pair<char, int> c = make_pair(a, b);
mp[c]++;
}
char p[4] = {'S', 'H', 'C', 'D'};
for (int i = 0; i < 4; i++)
{
for (int j = 1; j <= 13; j++)
{
pair<char, int> c = make_pair(p[i], j);
if (mp[c] == 0)
printf("%c %d\n", p[i], j);
}
}
}
|
#include<iostream>
using namespace std;
int main() {
int n,num,c[5][14]={0};
char a;
cin>>n;
for(int y=0;n>y;y++){
cin>>a>>num;
if(a=='S'){
c[1][num]=1;
}else if(a=='H'){
c[2][num]=1;
}else if(a=='C'){
c[3][num]=1;
}else{
c[4][num]=1;
}
}
for(int i=1;i<=4;i++){
for(int j=1;j<=13;j++){
if(c[i][j]==0){
if(i==1){
cout<<"S "<<j<<endl;
}else if(i==2){
cout<<"H "<<j<<endl;
}else if(i==3){
cout<<"C "<<j<<endl;
}else{
cout<<"D "<<j<<endl;
}
}
}
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
map<char, int>mp = {
{'S', 0},
{'H', 1},
{'C', 2},
{'D', 3},
};
string mark = "SHCD";
vector<vector<int>> a(4, vector<int>(13, 0));
int n;
cin >> n;
for(int i = 0; i < n; i++){
char c; cin >> c;
int x; cin >> x;
a[mp[c]][x - 1] = 1;
}
for(int i = 0; i < 4; i++){
for(int j = 0; j < 13; j++){
if(!a[i][j]){
cout << mark[i] << " " << j + 1 << endl;
}
}
}
}
|
#include<iostream>
using namespace std;
bool arr[4][55];
int n, m;
int id(char c) {
if (c == 'S') return 0;
if (c == 'H') return 1;
if (c == 'C') return 2;
if (c == 'D') return 3;
}
char mrk[] = {'S', 'H', 'C', 'D'}, c;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> c >> m;
arr[id(c)][m] = true;
}
for (int i = 0; i < 4; i++) for (int j = 1; j <= 13; j++) {
if (!arr[i][j]) cout << mrk[i] << " " << j << endl;
}
return 0;
}
|
#include <iostream>
#include <set>
using namespace std;
int main() {
int n;
cin >> n;
set<pair<char, int>> s;
for (int i = 0; i < n; i++) {
char c;
int x;
cin >> c >> x;
s.insert(make_pair(c, x));
}
string cards = "SHCD";
for (int i = 0; i < 4; i++) {
for (int j = 1; j <= 13; j++) {
if (!s.count(make_pair(cards[i], j))) cout << cards[i] << ' ' << j << endl;
}
}
}
|
#include <stdio.h>
#include <math.h>
int main(){
int n,a,d[4][14]={0};
char c;
scanf("%d",&n);
for(int i=0;i<n;i++){
getchar();
scanf("%c %d",&c,&a);
//printf(" c%c a%d\n",c,a);
if(c=='S') d[0][a]=1;
else if(c=='H') d[1][a]=1;
else if(c=='C') d[2][a]=1;
else if(c=='D') d[3][a]=1;
}
for(int i=0;i<4;i++){
for(int j=1;j<=13;j++){
if(d[i][j]==0){
if(i==0) c='S';
else if(i==1) c='H';
else if(i==2) c='C';
else if(i==3) c='D';
printf("%c %d\n",c,j);
}
}
}
return 0;
}
|
#include<iostream>
using namespace std;
#define F(i,s,e) for(int i=s;i<e;++i)
int main(){
int n;
cin >> n;
char m;
int x;
char M[4]={'S','H','C','D'};
int N[4][13];
F(i,0,13){
F(j,0,4){
N[j][i]=i+1;
}
}
F(i,0,n){
cin >> m >> x;
F(j,0,4) if(m==M[j]) N[j][x-1]=0;
}
F(i,0,4)
F(j,0,13)
if(N[i][j]>0) cout << M[i] << ' ' << N[i][j] << endl;
return 0;
}
|
#include <iostream>
#define TYPE 4
#define CLASS 13
int main(){
int num;
int array[TYPE][CLASS]={};
char type[4]={'S','H','C','D'};
std::cin>>num;
for(int i=0;i<num;i++){
char c;
int n;
std::cin>>c;
std::cin>>n;
for(int j=0;j<TYPE;j++){
if(c==type[j]){
array[j][n-1]=1;
}
}
}
for(int i=0;i<TYPE;i++){
for(int j=0;j<CLASS;j++){
if(!array[i][j]){
std::cout<<type[i]<<" "<<j+1<<std::endl;
}
}
}
return 0;
}
|
#include<iostream>
#include<cstdio>
using namespace std;
int main(){
int cards[4][14]={0};
int n;
cin>>n;
int a,r;
char c;
for(int i=0;i<n;i++){
cin>>c>>r;
if(c=='S')a=0;
if(c=='H')a=1;
if(c=='C')a=2;
if(c=='D')a=3;
cards[a][r]=1;
}
char egara[4]={'S','H','C','D'};
for(int i=0;i<4;i++){
for(int j=1;j<14;j++){
if(cards[i][j]==0){
cout<<egara[i]<<" "<<j<<endl;
}
}
}
return 0;
}
|
#include<iostream>
using namespace std;
#include<string.h>
#include<stdio.h>
int main()
{
char b, mark[]={"SHCD"};
int a,i,m[4][14]={0},n,j;
cin>>a;
for(i=0;i<a;i++)
{
cin>>b>>n;
if(b=='S')
{
m[0][n]=1;
}
if(b=='H')
{
m[1][n]=1;
}
if(b=='C')
{
m[2][n]=1;
}
if(b=='D')
{
m[3][n]=1;
}
}
for(i=0;i<4;i++)
{
for(j=1;j<14;j++)
{
if(m[i][j]==0)
{
cout<<mark[i] <<" "<<j<<endl;
}
}
}
return 0;
}
|
#include <iostream>
using namespace std;
int main(){
int n,b;
bool a[53];
char c;
cin>>n;
for (int i=0;i<53;i++){
a[i]=false;
}
for (int i=1;i<n+1;i++){
cin>>c>>b;
if (c=='S')
a[b]=true;
else if (c=='H')
a[b+13]=true;
else if (c=='C')
a[b+26]=true;
else if (c=='D')
a[b+39]=true;
}
for (int i=1;i<53;i++){
if (i<14 && a[i]==false)
cout<<"S "<<i<<endl;
else if (i<27 && a[i]==false)
cout<<"H "<<i-13<<endl;
else if (i<40 && a[i]==false)
cout<<"C "<<i-26<<endl;
else if (a[i]==false)
cout<<"D "<<i-39<<endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, x, t;
char ch, c[4] = {'S', 'H', 'C', 'D'};
bool b[60];
memset(b, false, sizeof(b));
cin >> n;
for(int i=1; i<=n; i++){
cin >> ch >> x;
for(int j=0; j<4; j++){
if(ch==c[j]){
t = j*13+x;
break;
}
}
b[t] = true;
}
for(int i=1; i<=52; i++){
if(!b[i]){
cout << c[(i-1)/13] << " " << (i-1)%13+1 << endl;
}
}
return 0;
}
|
#include <iostream>
using namespace std;
int main(){
int n, i;
char c;
int x;
int a[52]={0};
cin >> n;
for(i=0; i<n; i++){
cin >> c >> x;
if(c=='S'){
a[x-1]=1;
}
else if(c=='H'){
a[x-1+13]=1;
}
else if(c=='C'){
a[x-1+26]=1;
}
else if(c=='D'){
a[x-1+39]=1;
}
}
for(i=0; i<52; i++){
if(a[i]==0){
if(i<13) cout << 'S' << " " << i+1 << endl;
else if(i<26) cout << 'H' << " " << i-12 << endl;
else if(i<39) cout << 'C' << " " << i-25 << endl;
else cout << 'D' << " " << i-38 << endl;
}
}
}
|
#include<iostream>
using namespace std;
int main(void){
int n,lank;
bool A[4][14];
char s;
for(int i=0;i<4;i++)
for(int j=1;j<=13;j++)
A[i][j]=0;
cin>>n;
for(int i=0;i<n;i++){
cin>>s>>lank;
if(s=='S')A[0][lank]=1;
if(s=='H')A[1][lank]=1;
if(s=='C')A[2][lank]=1;
if(s=='D')A[3][lank]=1;}
for(int i=0;i<4;i++){
for(int j=1;j<=13;j++){
if(A[i][j])continue;
if(i==0)s='S';
if(i==1)s='H';
if(i==2)s='C';
if(i==3)s='D';
cout<<s<<" "<<j<<endl;
}
}
}
|
#include <iostream>
using namespace std;
int main()
{
string suits = "SHCD";
bool cards[4][13] = {};
int n;
cin >> n;
for (int i = 0; i < n; i++)
{
char suit;
int lank;
cin >> suit >> lank;
cards[suits.find(suit)][lank - 1] = true;
}
for (int s = 0; s < 4; s++)
{
for (int l = 0; l < 13; l++)
{
if (!cards[s][l])
{
cout << suits[s] << " " << l + 1 << "\n";
}
}
}
return 0;
}
|
#include <iostream>
using namespace std;
const int d_num = 4;
const int num = 13;
int main() {
char design[d_num] = {'S', 'H', 'C', 'D'};
bool hasCards[d_num][num] = {false};
int n;
cin >> n;
char d;
int e;
for (int i = 0; i < n; i++) {
cin >> d;
cin >> e;
for (int j = 0; j < d_num; j++) {
if (design[j] == d) hasCards[j][e-1] = true;
}
}
for (int k = 0; k < d_num; k++) {
for (int l = 0; l < num; l++) {
if (hasCards[k][l] == false) cout << design[k] << " " << l + 1 << endl;
}
}
return 0;
}
|
#include<iostream>
using namespace std;
int main() {
char ch;
int n, i, s, t, rank;
int card[4][14]={};
cin >> n;
for(i=0; i<n; i++){
cin >> ch >> rank;
if(ch == 'S') card[0][rank] = 1;
if(ch == 'H') card[1][rank] = 1;
if(ch == 'C') card[2][rank] = 1;
if(ch == 'D') card[3][rank] = 1;
}
for(s=0; s<4; s++){
for(t=1; t<14; t++){
if(card[s][t]) continue;
if(s==0) ch = 'S';
if(s==1) ch = 'H';
if(s==2) ch = 'C';
if(s==3) ch = 'D';
cout << ch << " " << t << endl;
}
}
return 0;
}
|
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int n, tmp2 = 0;
char tmp1;
bool array[4][13] = {};
int mark[64] = {};
mark['S' - 64] = 0;
mark['H' - 64] = 1;
mark['C' - 64] = 2;
mark['D' - 64] = 3;
char cards[4] = { 'S', 'H', 'C', 'D' };
cin >> n;
for (int i = 0; i < n; i++) {
cin >> tmp1;
cin >> tmp2;
array[mark[tmp1-64]][tmp2-1] = true;
}
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 13; j++) {
if (array[i][j] != true) { cout << cards[i] << " " << j + 1 << endl; }
}
}
cin >> n;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int n,a[4][13],num;
char marks,mark[4]={'S','H','C','D'};
cin>>n;
for (int i = 0; i < 13; i++) {
for (int j = 0; j < 4 ; j++) {
a[j][i]=0;
}
}
for (int k = 0; k <n; k++) {
cin>>marks>>num;
for (int j = 0; j < 4; j++) {
if(marks==mark[j]){
a[j][num-1]=1;
break;
}
}
}
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 13 ; j++) {
if(a[i][j]==0)cout<<mark[i]<<" "<<j+1<<endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
map<char, vector<int> > m;
m['S'] = vector<int>(13, 0);
m['H'] = vector<int>(13, 0);
m['C'] = vector<int>(13, 0);
m['D'] = vector<int>(13, 0);
for (int i = 0; i < N; i++) {
char S;
int rank;
cin >> S >> rank;
m[S].at(rank - 1) = 1;
}
string s = "SHCD";
for (int j = 0; j < s.size(); j++) {
for (int i = 0; i < 13; i++)
if (!m[s.at(j)].at(i)) {
cout << s.at(j) << " " << i+1 << endl;
}
}
}
|
#include <iostream>
#include <cstdio>
#include <map>
#include <array>
using namespace std;
int main()
{
map<char, array<bool,13> > in_posession = {{'S', {}}, {'H', {}}, {'C', {}}, {'D', {}}};
int n;
scanf("%d\n", &n);
for (int i = 0; i < n; i++) {
char suit;
int rank;
scanf("%c %d\n", &suit, &rank);
in_posession[suit][rank-1] = true;
}
for (char suit : { 'S', 'H', 'C', 'D' })
for (int i = 0; i < 13; i++)
if (!in_posession[suit][i])
cout << suit << ' ' << i+1 << endl;
}
|
#include<iostream>
using namespace std;
int main()
{
int n;
cin >> n;
int cards[4][13] = {0};
char p[4] = {'S','H','C','D'};
char c[52];
int x[52];
for (int i = 0; i < n ; i++)
{
cin >> c[i] >> x[i];
}
for (int i = 0; i < n; i++)
{
if (c[i] == 'S')
cards[0][x[i]-1] = 1;
else if (c[i] == 'H')
cards[1][x[i]-1] = 1;
else if (c[i] == 'C')
cards[2][x[i]-1] = 1;
else
cards[3][x[i]-1] = 1;
}
for (int i = 0; i < 4; i++)
{
for (int j = 0; j < 13; j++)
{
if (cards[i][j] != 1)
cout << p[i] << ' ' << j + 1 << '\n';
}
}
}
|
#include<bits/stdc++.h>
using namespace std;
bool s[13]={},h[13]={},c[13]={},d[13]={};
int main(){
int a,b;
char c1;
cin>>a;
for (int i=0;i<a;i++){
cin>>c1>>b;
if (c1=='S')s[b-1]=1;
if (c1=='H')h[b-1]=1;
if (c1=='C')c[b-1]=1;
if (c1=='D')d[b-1]=1;
}
for (int i=0;i<13;i++){
if (s[i]==0)cout<<"S "<<i+1<<endl;
}
for (int i=0;i<13;i++){
if (h[i]==0)cout<<"H "<<i+1<<endl;
}
for (int i=0;i<13;i++){
if (c[i]==0)cout<<"C "<<i+1<<endl;
}
for (int i=0;i<13;i++){
if (d[i]==0)cout<<"D "<<i+1<<endl;
}
//cout<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
map<string, vector<int>> m;
m["S"].resize(14);
m["H"].resize(14);
m["C"].resize(14);
m["D"].resize(14);
for (int i = 0; i < n; i++)
{
string s;
int k;
cin >> s >> k;
m[s][k] = 1;
}
vector<string> c = { "S","H","C","D" };
for (int i = 0; i < 4; i++)
{
for (int j = 1; j < 14; j++)
{
if (m[c[i]][j] == 0)
{
cout << c[i] << " " << j << endl;
}
}
}
return 0;
}
|
#include <iostream>
using std::cin;
using std::cout;
bool cards[26][14];
int main() {
int n;
cin >> n;
for(int i = 1; i <= n; i++) {
char s; int r;
cin >> s >> r;
cards[s - 'A'][r] = 1;
}
for(int i = 1; i <= 13; i++) if(!cards['S' - 'A'][i]) cout << "S " << i << '\n';
for(int i = 1; i <= 13; i++) if(!cards['H' - 'A'][i]) cout << "H " << i << '\n';
for(int i = 1; i <= 13; i++) if(!cards['C' - 'A'][i]) cout << "C " << i << '\n';
for(int i = 1; i <= 13; i++) if(!cards['D' - 'A'][i]) cout << "D " << i << '\n';
return 0;
}
|
#include <stdio.h>
int main(void){
int n,i,j;
scanf("%d",&n);
int a[4][13]={};
for(i=0;i<n;i++){
char x;
int y;
scanf(" %c%d",&x,&y);
y--;
if(x=='S')
a[0][y]++;
else if(x=='H')
a[1][y]++;
else if(x=='C')
a[2][y]++;
else
a[3][y]++;
}
for(i=0;i<4;i++){
char v;
if(i==0)
v='S';
else if(i==1)
v='H';
else if(i==2)
v='C';
else
v='D';
for(j=0;j<13;j++){
if(a[i][j]==0){
printf("%c %d\n",v,j+1);
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long ax, ay, bx, by, cx, cy;
long long AX[4], AY[4], CX[4], CY[4];
bool judge_51nod(long long ax, long long ay, long long cx, long long cy) {
long long zi1 = abs((bx - ax) * cx + (by - ay) * cy);
long long zi2 = abs((by - ay) * cx - (bx - ax) * cy);
long long mu = abs(cx * cx + cy * cy);
if (mu)
if (zi1 % mu || zi2 % mu) return 0;
return 1;
}
bool judge(long long ax, long long ay, long long cx, long long cy) {
if (cx == 0 && cy == 0) return ax == bx && ay == by;
long long zi1 = abs((bx - ax) * cx + (by - ay) * cy);
long long zi2 = abs((by - ay) * cx - (bx - ax) * cy);
long long mu = abs(cx * cx + cy * cy);
return zi1 % mu == 0 && zi2 % mu == 0;
}
int main() {
cin >> ax >> ay >> bx >> by >> cx >> cy;
AX[0] = ax, AY[0] = ay;
AX[1] = -ay, AY[1] = ax;
AX[2] = -ax, AY[2] = -ay;
AX[3] = ay, AY[3] = -ax;
CX[0] = cx, CY[0] = cy;
CX[1] = -cy, CY[1] = cx;
CX[2] = -cx, CY[2] = -cy;
CX[3] = cy, CY[3] = -cx;
for (int i = 0; i < 4; i++)
for (int j = 0; j < 4; j++)
if (judge(AX[i], AY[i], CX[j], CY[j])) return cout << "YES", 0;
cout << "NO";
}
|
#include <bits/stdc++.h>
using namespace std;
typedef struct cpx {
long long x, y;
cpx() {}
cpx(int a, int b) {
x = a;
y = b;
}
} cpx;
cpx add(cpx a, cpx b) { return cpx(a.x + b.x, a.y + b.y); }
cpx sub(cpx a, cpx b) { return cpx(a.x - b.x, a.y - b.y); }
cpx mul(cpx a, cpx b) {
return cpx(a.x * b.x - a.y * b.y, a.x * b.y + a.y * b.x);
}
cpx un(0, 1);
long long gcd(long long a, long long b) { return b > 0 ? gcd(b, a % b) : a; }
long long lcm(long long a, long long b) { return a * b / gcd(a, b); }
long long is(long long xc, long long yc, long long xd, long long yd) {
if (xc == 0 && yc == 0) {
if (xd == 0 && yd == 0) {
return 1;
}
} else if (xc == 0) {
if (xd % yc == 0 && yd % yc == 0) {
return 1;
}
} else if (yc == 0) {
if (xd % xc == 0 && yd % xc == 0) {
return 1;
}
} else {
long long l = lcm(xc, yc);
long long b;
b = (xc * yd - yc * xd) / (yc * yc + xc * xc);
if ((xc * yd - yc * xd) % (yc * yc + xc * xc) || (xd + b * yc) % xc)
return 0;
return 1;
}
return 0;
}
int main() {
long long x, y;
cpx a, b, c;
int i;
scanf("%I64d%I64d", &x, &y);
a = cpx(x, y);
scanf("%I64d%I64d", &x, &y);
b = cpx(x, y);
scanf("%I64d%I64d", &x, &y);
c = cpx(x, y);
cpx d;
long long xc, yc, xd, yd;
d = sub(b, mul(un, a));
xc = c.x;
yc = c.y;
xd = d.x;
yd = d.y;
if (is(xc, yc, xd, yd)) {
printf("YES");
return 0;
}
d = add(b, mul(un, a));
xd = d.x;
yd = d.y;
if (is(xc, yc, xd, yd)) {
printf("YES");
return 0;
}
d = add(b, a);
xd = d.x;
yd = d.y;
if (is(xc, yc, xd, yd)) {
printf("YES");
return 0;
}
d = sub(b, a);
xd = d.x;
yd = d.y;
if (is(xc, yc, xd, yd)) {
printf("YES");
return 0;
}
printf("NO");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool f(long long x, long long y, long long xc, long long yc) {
if (!x && !y) return true;
if (!xc && !yc) return false;
if (!xc)
if (x % yc || y % yc)
return false;
else
return true;
else if (!yc)
if (x % xc || y % xc)
return false;
else
return true;
else {
if ((y * yc + x * xc) % (yc * yc + xc * xc)) return false;
long long a = (y * yc + x * xc) / (yc * yc + xc * xc);
if ((x - a * xc) % yc)
return false;
else
return true;
}
}
int main() {
long long xa, ya, xb, yb, xc, yc;
cin >> xa >> ya >> xb >> yb >> xc >> yc;
if (f(xb - xa, yb - ya, xc, yc) || f(xb + xa, yb + ya, xc, yc) ||
f(xb - ya, yb + xa, xc, yc) || f(xb + ya, yb - xa, xc, yc))
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
|
#include <bits/stdc++.h>
long long x[3], y[3], a1, a2, b1, b2;
int f = 0, i, a, b;
int zz() {
long long t;
a1 = x[1] - x[0], b1 = x[2], a2 = y[1] - y[0], b2 = y[2];
t = x[0], x[0] = y[0], y[0] = -t;
return 0;
}
int main() {
for (i = 0; i < 3; i++) scanf("%I64d %I64d", &x[i], &y[i]);
for (i = 0; i < 4; i++) {
zz();
if (b1 && b2) {
b = (a1 * b1 + a2 * b2) / (b1 * b1 + b2 * b2), a = (b * b2 - a2) / b1;
if (b * b1 + a * b2 == a1 && b * b2 - a * b1 == a2) f = 1;
} else if (!b1 && !b2) {
if (!a1 && !a2) f = 1;
} else if (!b1) {
if ((int)(a1 / b2) * b2 == a1 && (int)(a2 / b2) * b2 == a2) f = 1;
} else if (!b2) {
if ((int)(a1 / b1) * b1 == a1 && (int)(a2 / b1) * b1 == a2) f = 1;
}
}
if (f)
printf("YES\n");
else
printf("NO\n");
}
|
#include <bits/stdc++.h>
using namespace std;
double a[100][100];
int vx[4], vy[4];
int Work() {
bool yes = false;
long long ax, ay, bx, by, cx, cy, xx, yy, dx, dy;
cin >> ax >> ay;
cin >> bx >> by;
cin >> cx >> cy;
dx = cy;
dy = -cx;
long long ek, et, k1, k2;
for (int i = 0; i < 4 && !yes; i++) {
xx = ax - bx;
yy = ay - by;
k1 = k2 = -1;
ek = xx * cy - yy * cx;
et = dx * cy - dy * cx;
if (ek == 0)
k2 = 0;
else if (et != 0 && ek % et == 0)
k2 = ek / et;
ek = xx * dy - yy * dx;
et = cx * dy - cy * dx;
if (ek == 0)
k1 = 0;
else if (et != 0 && ek % et == 0)
k1 = ek / et;
if (k1 * cx + k2 * dx == xx && k1 * cy + k2 * dy == yy) yes = true;
bx = -bx;
swap(bx, by);
}
if (yes)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
int main() {
Work();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct v {
long long x;
long long y;
void rot() {
long long nx = -y;
long long ny = x;
x = nx;
y = ny;
}
};
long long dotprod(v v1, v v2) { return v1.x * v2.x + v1.y * v2.y; }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
v a, b, c1;
cin >> a.x >> a.y;
cin >> b.x >> b.y;
cin >> c1.x >> c1.y;
long long len = c1.x * c1.x + c1.y * c1.y;
v c2 = c1;
c1.rot();
for (int i = 0; i < 6; i++) {
a.rot();
v B = b;
B.x -= a.x;
B.y -= a.y;
long long t1 = dotprod(B, c1);
long long t2 = dotprod(B, c2);
if (B.x == 0 && B.y == 0) {
cout << "YES";
return 0;
}
if (len != 0 && t1 % len == 0 && t2 % len == 0) {
cout << "YES";
return 0;
}
}
cout << "NO";
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void) {
long long x1, y1, x2, y2, x3, y3;
cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3;
for (int i = 0; i < 4; i++) {
long long dx = x2 - x1;
long long dy = y2 - y1;
long long u = dx * x3 + dy * y3;
long long v = dx * y3 - dy * x3;
long long w = x3 * x3 + y3 * y3;
if (dx == 0 && dy == 0) {
cout << "YES" << endl;
return 0;
}
if (w != 0 && u % w == 0 && v % w == 0) {
cout << "YES" << endl;
return 0;
}
x1 = -x1;
swap(x1, y1);
}
cout << "NO" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long Ax, Ay, Bx, By, Cx, Cy;
bool check(long long Cx, long long Cy) {
long long dx = Bx - Ax;
long long dy = By - Ay;
if (dx == 0 && dy == 0) return true;
if (Cx == 0 && Cy == 0) return false;
return (dx * Cx + dy * Cy) % (Cx * Cx + Cy * Cy) == 0;
}
bool judge() {
for (int i = 0; i < 4; i++) {
if (check(Cx, Cy) && check(-Cy, Cx)) return true;
long long tmp = Ax;
Ax = -Ay;
Ay = tmp;
}
return false;
}
int main() {
scanf("%lld%lld%lld%lld%lld%lld", &Ax, &Ay, &Bx, &By, &Cx, &Cy);
printf("%s\n", judge() ? "YES" : "NO");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long ar, ai, br, bi, cr, ci;
cin >> ar >> ai >> br >> bi >> cr >> ci;
complex<long long> a(ar, ai), b(br, bi), c(cr, ci);
complex<long long> e(1, 0), i(0, 1);
for (long long alpha = 0; alpha < 4; alpha++, e *= i) {
complex<long long> n = b - e * a;
if (norm(c) == 0) {
if (norm(n) == 0) {
cout << "YES\n";
return 0;
}
} else {
complex<long long> d = n / c;
if (c * d == n) {
cout << "YES\n";
return 0;
}
}
}
cout << "NO\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
inline bool check(long long x1, long long y1, long long x2, long long y2) {
{
long long num = x1 * x2 + y1 * y2;
long long den = x2 * x2 + y2 * y2;
if (den == 0 && (x1 != 0 || y1 != 0)) return false;
if (den != 0 && num % den != 0) return false;
}
{
long long num = x1 * y2 - y1 * x2;
long long den = x2 * x2 + y2 * y2;
if (den == 0 && (x1 != 0 || y1 != 0)) return false;
if (den != 0 && num % den != 0) return false;
}
return true;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout << setprecision(32);
long long xa, xb, xc, ya, yb, yc;
cin >> xa >> ya;
cin >> xb >> yb;
cin >> xc >> yc;
if (check(xb - xa, yb - ya, xc, yc) || check(xb - ya, yb + xa, xc, yc) ||
check(xb + xa, yb + ya, xc, yc) || check(xb + ya, yb - xa, xc, yc)) {
cout << "YES\n";
} else {
cout << "NO\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct point {
long long x, y;
point(long long a = 0, long long b = 0) : x(a), y(b) {}
long long operator*(point B) { return x * B.x + y * B.y; }
point rota() { return point(-y, x); }
point operator-(point B) { return point(x - B.x, y - B.y); }
void read() { cin >> x >> y; }
};
point A, B, C;
string solve() {
point Ct = C.rota();
long long tam = C * C;
for (int i = 0; i < 4; i++) {
point D = B - A;
if (C.x == 0 && C.y == 0) {
if (D.x == 0 && D.y == 0) return "YES";
} else if (D * C % tam == 0 && D * Ct % tam == 0)
return "YES";
A = A.rota();
}
return "NO";
}
int main() {
A.read();
B.read();
C.read();
cout << solve() << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int M = 300 + 10;
long long int Ax, Ay, Bx, By, Cx, Cy;
int main() {
cin >> Ax >> Ay >> Bx >> By >> Cx >> Cy;
bool ok = false;
for (int i = 0; i < 4; i++) {
long long int squ = (Cx * Cx + Cy * Cy);
long long int xbma = Bx - Ax;
long long int ybma = By - Ay;
long long int r1 = -xbma * Cy + ybma * Cx;
long long int r2 = xbma * Cx + ybma * Cy;
if (squ != 0) {
if (r1 % squ == 0 && r2 % squ == 0) {
ok = true;
break;
}
} else {
if (xbma == 0 && ybma == 0) {
ok = true;
break;
}
}
long long int nx = Ay;
long long int ny = -Ax;
Ax = nx;
Ay = ny;
}
string ans = ok ? "YES" : "NO";
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long double Ax, Ay, Bx, By, Cx, Cy, a11, a12, a21, a22, det;
bool flag;
void f(double x, double y) {
double tx, ty;
tx = a11 * x + a12 * y;
ty = a21 * x + a22 * y;
cerr << tx << " " << ty << "\n";
tx = fabs(tx);
ty = fabs(ty);
tx += 1e-11;
ty += 1e-11;
tx -= (long long)tx;
ty -= (long long)ty;
if (flag) {
tx = x;
ty = y;
}
if (fabs(tx) < 1e-10 && fabs(ty) < 1e-10) {
cout << "YES\n";
exit(0);
}
}
int main() {
cin >> Ax >> Ay >> Bx >> By >> Cx >> Cy;
det = Cx * Cx + Cy * Cy;
flag = fabs(det) < 1e-10;
a11 = Cx / det;
a12 = Cy / det;
a21 = -Cy / det;
a22 = Cx / det;
f(Bx - Ax, By - Ay);
f(Bx - Ay, By + Ax);
f(Bx + Ax, By + Ay);
f(Bx + Ay, By - Ax);
cout << "NO\n";
}
|
#include <bits/stdc++.h>
const int magicconst = 73743071;
using namespace std;
long long a[2], x, y, b[2];
bool check(long long u, long long v) {
long long det = x * x + y * y;
long long q = x * v - u * y;
long long w = u * x + y * v;
return (q % det == 0 && w % det == 0);
}
int main() {
scanf("%I64d%I64d%I64d%I64d%I64d%I64d", &a[0], &a[1], &b[0], &b[1], &x, &y);
if (x == 0 && y == 0) {
bool ans = 0;
if (b[0] == a[0] && b[1] == a[1]) ans = 1;
if (b[0] == -a[0] && b[1] == -a[1]) ans = 1;
if (b[0] == a[1] && b[1] == -a[0]) ans = 1;
if (b[0] == -a[1] && b[1] == a[0]) ans = 1;
if (ans)
printf("YES");
else
printf("NO");
} else {
bool ans = 0;
if (check(b[0] - a[0], b[1] - a[1])) ans = 1;
if (check(b[0] + a[0], b[1] + a[1])) ans = 1;
if (check(b[0] - a[1], b[1] + a[0])) ans = 1;
if (check(b[0] + a[1], b[1] - a[0])) ans = 1;
if (ans)
printf("YES");
else
printf("NO");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long Ax, Ay, Bx, By, Cx, Cy, verCx, verCy;
long long sqr(long long x) { return x * x; }
bool check(long long Dx, long long Dy) {
long long aa = Dx * Cx + Dy * Cy, bb = Dx * verCx + Dy * verCy,
l2 = sqr(Cx) + sqr(Cy);
if (l2 == 0) {
return Dx == 0 && Dy == 0;
}
return aa % l2 == 0 && bb % l2 == 0;
}
int main() {
int i;
scanf("%I64d%I64d", &Ax, &Ay);
scanf("%I64d%I64d", &Bx, &By);
scanf("%I64d%I64d", &Cx, &Cy);
verCx = -Cy, verCy = Cx;
for (i = 0; i < 4; i++) {
swap(Ax, Ay);
Ax = -Ax;
if (check(Bx - Ax, By - Ay)) break;
}
if (i < 4)
puts("YES");
else
puts("NO");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long Ax, Ay, Bx, By, Cx, Cy;
bool is_generated(long long a, long long b, long long x, long long y) {
long long norm = x * x + y * y;
if (norm == 0) return (a == 0 && b == 0);
return ((a * x + b * y) % norm == 0) && ((b * x - a * y) % norm == 0);
}
int main() {
cin >> Ax >> Ay >> Bx >> By >> Cx >> Cy;
bool yes = (is_generated(Ax - Bx, Ay - By, Cx, Cy) ||
is_generated(-Ay - Bx, Ax - By, Cx, Cy) ||
is_generated(-Ax - Bx, -Ay - By, Cx, Cy) ||
is_generated(Ay - Bx, -Ax - By, Cx, Cy));
cout << (yes ? "YES\n" : "NO\n");
}
|
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:16777216")
using namespace std;
struct point {
long long x, y;
void scan() { scanf("%lld%lld", &x, &y); }
} A, B, C;
bool can(long long a, long long b) {
if (a == 0 && b == 0) return true;
long long ch = a * C.y - b * C.x;
long long zn = C.y * C.y + C.x * C.x;
if (zn == 0) return false;
if (ch % zn != 0) return false;
long long y = ch / zn;
ch = a - y * C.y;
zn = C.x;
if (zn == 0) {
return y * C.y == a && b % C.y == 0;
}
if (ch % zn != 0) return false;
return true;
}
bool pos() {
return can(B.x - A.x, B.y - A.y) || can(B.y - A.x, -B.x - A.y) ||
can(-B.x - A.x, -B.y - A.y) || can(-B.y - A.x, B.x - A.y);
}
int main() {
A.scan();
B.scan();
C.scan();
for (int i = 0; i < 4; ++i) {
if (pos()) {
printf("YES");
return 0;
}
swap(C.x, C.y);
C.x = -C.x;
}
printf("NO");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int inf = 1000 * 1000 * 1000;
const long long INF = 1000ll * 1000ll * 1000ll * 1000ll * 1000ll * 1000ll;
long long ax, ay, bx, by, cx, cy;
int main() {
cin >> ax >> ay;
cin >> bx >> by;
cin >> cx >> cy;
long long _cx = -cy;
long long _cy = cx;
for (int i = 0; i < 4; ++i) {
long long t = ax;
ax = -ay;
ay = t;
if (ax == bx && ay == by) {
cout << "YES" << endl;
return 0;
}
}
for (int i = 0; i < 4; ++i) {
long long t = ax;
ax = -ay;
ay = t;
long long _y = _cx * cy - cx * _cy;
long long _x = cx * _cy - _cx * cy;
if (_y == 0 || _x == 0) break;
if ((cy * (bx - ax) - cx * (by - ay)) % _y == 0 &&
(_cy * (bx - ax) - _cx * (by - ay)) % _x == 0) {
cout << "YES" << endl;
return 0;
}
}
cout << "NO" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
long long a3, b3;
bool check1(long long a1, long long b1, long long a2, long long b2) {
if ((a2 * a3 + b2 * b3 + a1 * b3 - a3 * b1) % (a3 * a3 + b3 * b3))
return false;
if ((a2 * b3 - b2 * a3 - a1 * a3 - b1 * b3) % (a3 * a3 + b3 * b3))
return false;
return true;
}
bool check2(long long a1, long long b1, long long a2, long long b2) {
if ((a2 * a3 + b2 * b3 - a1 * a3 - b1 * b3) % (a3 * a3 + b3 * b3))
return false;
if ((a1 * b3 - b1 * a3 - a2 * b3 + b2 * a3) % (a3 * a3 + b3 * b3))
return false;
return true;
}
bool check(long long a1, long long b1, long long a2, long long b2) {
if (a1 == a2 && b1 == b2) return true;
if (b1 == a2 && -a1 == b2) return true;
if (-a1 == a2 && -b1 == b2) return true;
if (-b1 == a2 && a1 == b2) return true;
return false;
}
int main() {
long long a1, a2, b1, b2;
while (~scanf("%lld%lld%lld%lld%lld%lld", &a1, &b1, &a2, &b2, &a3, &b3)) {
if (a3 == b3 && a3 == 0) {
puts(check(a1, b1, a2, b2) ? "YES" : "NO");
} else {
int ok = 0;
ok += check(a1, b1, a2, b2);
ok += check1(a1, b1, a2, b2);
ok += check1(a1, b1, b2, -a2);
ok += check1(a1, b1, -a2, -b2);
ok += check1(a1, b1, -b2, a2);
ok += check2(a1, b1, a2, b2);
ok += check2(a1, b1, b2, -a2);
ok += check2(a1, b1, -a2, -b2);
ok += check2(a1, b1, -b2, a2);
puts(ok ? "YES" : "NO");
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool divisible(const complex<long long>& a, const complex<long long>& b) {
complex<long long> c(0, 0);
c = a / b;
return (b * c == a);
}
int main() {
long long a, b;
cin >> a;
cin >> b;
complex<long long> A(a, b);
cin >> a;
cin >> b;
complex<long long> B(a, b);
cin >> a;
cin >> b;
complex<long long> C(a, b);
complex<long long> I(0, 1);
bool res = false;
if (C.real() == 0 && C.imag() == 0) {
if (B == A)
res = true;
else if (B == -A)
res = true;
else if (B == A * I)
res = true;
else if (B == -A * I)
res = true;
} else {
if (divisible(B - A, C))
res = true;
else if (divisible(B + A, C))
res = true;
else if (divisible(B - A * I, C))
res = true;
else if (divisible(B + A * I, C))
res = true;
}
if (res)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long A, B, x, y, Cx, Cy;
bool ok(long long x, long long y, long long A, long long B, long long Cx,
long long Cy) {
if (Cx * Cx + Cy * Cy == 0) {
bool flg = 0;
if (x == A && y == B) flg = 1;
if (y == A && -x == B) flg = 1;
if (-x == A && -y == B) flg = 1;
if (-y == A && x == B) flg = 1;
return flg;
}
bool flg = 0;
if (x == A && y == B) flg = 1;
if (y == A && -x == B) flg = 1;
if (-x == A && -y == B) flg = 1;
if (-y == A && x == B) flg = 1;
if (flg == 1) {
return 1;
}
long long M = Cx * Cx + Cy * Cy;
long long tmp = (B - y) * Cx - Cy * (A - x);
if (tmp % M == 0) {
long long k2 = tmp / M;
if (Cx) {
if (Cx < 0) Cx = -Cx;
long long ret = (A - x) % Cx + (k2 % Cx) * Cy % Cx;
ret %= Cx;
if (ret < 0) ret += Cx;
if (ret == 0) flg = 1;
}
if (Cy) {
if (Cy < 0) Cy = -Cy;
long long ret = (B - y) % Cy - (k2 % Cy) * Cx % Cy;
ret %= Cy;
if (ret < 0) ret += Cy;
if (ret == 0) flg = 1;
}
return flg;
} else
return 0;
}
int main() {
while (cin >> x >> y >> A >> B >> Cx >> Cy) {
bool flg = 0;
flg |= ok(x, y, A, B, Cx, Cy);
flg |= ok(x, y, -A, -B, Cx, Cy);
flg |= ok(x, y, -B, A, Cx, Cy);
flg |= ok(x, y, B, -A, Cx, Cy);
puts(flg ? "YES" : "NO");
}
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize "trapv"
using namespace std;
const int INF = 1e9;
void _print(long long t) { cerr << t; }
void _print(int t) { cerr << t; }
void _print(string t) { cerr << t; }
void _print(char t) { cerr << t; }
void _print(long double t) { cerr << t; }
void _print(double t) { cerr << t; }
void _print(unsigned long long t) { cerr << t; }
template <class T, class V>
void _print(pair<T, V> p);
template <class T>
void _print(vector<T> v);
template <class T>
void _print(set<T> v);
template <class T, class V>
void _print(map<T, V> v);
template <class T>
void _print(multiset<T> v);
template <class T, class V>
void _print(pair<T, V> p) {
cerr << "{";
_print(p.first);
cerr << ",";
_print(p.second);
cerr << "}";
}
template <class T>
void _print(vector<T> v) {
cerr << "[ ";
for (T i : v) {
_print(i);
cerr << " ";
}
cerr << "]";
}
template <class T>
void _print(set<T> v) {
cerr << "[ ";
for (T i : v) {
_print(i);
cerr << " ";
}
cerr << "]";
}
template <class T>
void _print(multiset<T> v) {
cerr << "[ ";
for (T i : v) {
_print(i);
cerr << " ";
}
cerr << "]";
}
template <class T, class V>
void _print(map<T, V> v) {
cerr << "[ ";
for (auto i : v) {
_print(i);
cerr << " ";
}
cerr << "]";
}
void Rotate(pair<int, int> &p, vector<pair<int, int>> &v) {
v.push_back(p);
v.push_back({p.second, -p.first});
v.push_back({-p.first, -p.second});
v.push_back({-p.second, p.first});
}
void solve() {
int x, y;
pair<int, int> A, B, C;
cin >> x >> y;
A = {x, y};
cin >> x >> y;
B = {x, y};
cin >> x >> y;
vector<pair<int, int>> rotationofA;
Rotate(A, rotationofA);
;
if (x == 0 && y == 0) {
for (auto a : rotationofA) {
if (a.first == B.first && a.second == B.second) {
cout << "YES" << endl;
return;
}
}
cout << "NO" << endl;
return;
}
C = {x, y};
;
for (auto a : rotationofA) {
pair<int, int> req = {B.first - a.first, B.second - a.second};
long long x = req.first * 1LL * C.first + req.second * 1LL * C.second;
long long y = C.first * 1LL * C.first + C.second * 1LL * C.second;
long long z = req.first * 1LL * C.second - req.second * 1LL * C.first;
;
;
;
if (x % y == 0 && z % y == 0) {
cout << "YES" << endl;
return;
}
}
cout << "NO" << endl;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
solve();
}
|
#include <bits/stdc++.h>
int main() {
long long x1, x2, x3, y1, y2, y3;
scanf("%I64d %I64d\n%I64d %I64d\n%I64d %I64d", &x1, &y1, &x2, &y2, &x3, &y3);
long long z = x3 * x3 + y3 * y3;
for (int i = 0; i < 4; ++i) {
x1 ^= y1;
y1 ^= x1;
x1 ^= y1;
y1 = -y1;
long long difx = x2 - x1, dify = y2 - y1;
if (!z && !difx && !dify) {
printf("YES\n");
return 0;
}
if (z && !((difx * x3 + dify * y3) % z) && !((dify * x3 - difx * y3) % z)) {
printf("YES\n");
return 0;
}
}
printf("NO\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long ax, ay, bx, by, cx, cy;
bool f(long long P, long long Q) {
if (cx == 0 && cy == 0) return P == 0 && Q == 0;
long long r1 = (P * cx + Q * cy) % ((cx) * (cx) + (cy) * (cy));
long long r2 = (P * cy - Q * cx) % ((cx) * (cx) + (cy) * (cy));
return r1 == 0 && r2 == 0;
}
int main() {
cout << setprecision(9);
cin >> ax >> ay >> bx >> by >> cx >> cy;
if (f(bx - ax, by - ay) || f(bx - ay, by + ax) || f(bx + ax, by + ay) ||
f(bx + ay, by - ax))
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double EPS = 10e-8;
bool solve(long long int Ax, long long int Ay, long long int Cx,
long long int Cy, long long int CCx, long long int CCy) {
long long int d = Cx * CCy - CCx * Cy;
if (Ax == 0 and Ay == 0) return true;
if (d < 0) d = -d;
if (d == 0) return false;
bool r = true;
r = ((Ax * CCy - Ay * CCx) % d == 0);
r = r and ((Cx * Ay - Cy * Ax) % d == 0);
return r;
}
int main() {
long long int Ax, Ay, Bx, By, Cx, Cy;
cin >> Bx >> By >> Ax >> Ay >> Cx >> Cy;
if (solve(Ax - Bx, Ay - By, Cx, Cy, Cy, -Cx) or
solve(Ax - By, Ay + Bx, Cx, Cy, Cy, -Cx) or
solve(Ax + Bx, Ay + By, Cx, Cy, Cy, -Cx) or
solve(Ax + By, Ay - Bx, Cx, Cy, Cy, -Cx))
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long a1, a2, b1, b2, c1, c2, d1, d2;
int main() {
cin >> a1 >> a2 >> b1 >> b2 >> c1 >> c2;
for (int q = 0; q < 4; q++) {
if (q == 0) {
d1 = b1 - (a1);
d2 = b2 - (a2);
}
if (q == 1) {
d1 = b1 - (-a1);
d2 = b2 - (-a2);
}
if (q == 2) {
d1 = b1 - (-a2);
d2 = b2 - (a1);
}
if (q == 3) {
d1 = b1 - (a2);
d2 = b2 - (-a1);
}
long long k1 = d1 * c1 + d2 * c2;
long long k2 = c1 * c1 + c2 * c2;
long long k3 = c1 * d2 - c2 * d1;
long long k4 = c1 * c1 + c2 * c2;
if (k2 == 0) {
if (d1 == 0 && d2 == 0) {
cout << "YES";
return 0;
}
} else if (k1 % k2 == 0 && k3 % k4 == 0) {
cout << "YES";
return 0;
}
}
cout << "NO";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool check(int xa, int ya, int xb, int yb, long long xc, long long yc) {
long long k1 = xb - xa;
long long k2 = yb - ya;
if (xc != 0) {
long long wNum = k1 * yc - k2 * xc;
long long wDen = xc * xc + yc * yc;
if (wNum % wDen) return false;
long long w = wNum / wDen;
long long qNum = k1 - w * yc;
if (qNum % xc) return false;
return true;
} else {
return (k1 % yc == 0) && (k2 % yc == 0);
}
}
int main() {
ios_base::sync_with_stdio(false);
int xa, xb, xc, ya, yb, yc;
cin >> xa >> ya >> xb >> yb >> xc >> yc;
if (xc == 0 && yc == 0) {
if ((xa == xb && ya == yb) || (xa == -yb && ya == xb) ||
(xa == -xb && ya == -yb) || (xa == yb && ya == -xb))
cout << "YES";
else
cout << "NO";
return 0;
}
if (check(xa, ya, xb, yb, xc, yc) || check(ya, -xa, xb, yb, xc, yc) ||
check(-xa, -ya, xb, yb, xc, yc) || check(-ya, xa, xb, yb, xc, yc))
cout << "YES";
else
cout << "NO";
}
|
#include <bits/stdc++.h>
using namespace std;
long long ax, ay, bx, by, cx, cy;
void check(long long axx, long long ayy) {
int xx = bx - axx, yy = by - ayy;
if (cx == 0 && cy == 0) {
if (xx == 0 && yy == 0) {
cout << "YES";
exit(0);
} else
return;
}
if ((cx * (yy)-cy * (xx)) % (cx * cx + cy * cy) != 0 ||
(cx * (xx) + cy * (yy)) % (cx * cx + cy * cy) != 0)
return;
cout << "YES";
exit(0);
}
int main() {
cin >> ax >> ay >> bx >> by >> cx >> cy;
check(ax, ay);
check(ay, -ax);
check(-ax, -ay);
check(-ay, ax);
cout << "NO";
}
|
#include <bits/stdc++.h>
using namespace std;
long long det(long long a, long long b, long long c, long long d) {
return a * d - b * c;
}
long long x[3], y[3];
int main() {
ios::sync_with_stdio(0);
for (int i = 0; i < 3; ++i) cin >> x[i] >> y[i];
for (int i = 0; i < 4; ++i) {
swap(x[0], y[0]);
y[0] = -y[0];
long long a = x[1] - x[0];
long long b = y[1] - y[0];
long long dt = det(x[2], y[2], y[2], -x[2]);
long long d1 = det(a, y[2], b, -x[2]);
long long d2 = det(x[2], a, y[2], b);
if (dt == 0) {
if (a == 0 && b == 0) {
cout << "YES\n";
return 0;
}
} else {
if (d1 % dt == 0 && d2 % dt == 0) {
cout << "YES\n";
return 0;
}
}
}
cout << "NO\n";
return 0;
}
|
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:100000000")
using namespace std;
long long x, y, xx, yy, dx, dy, n;
bool res;
bool F() {
long long d1 = -dx * (y - yy) - dy * (xx - x);
long long d2 = dx * dx + dy * dy;
if (d2 == 0) return false;
if (d1 % d2 != 0) return false;
long long k2 = d1 / d2;
d1 = xx - x + k2 * dy;
d2 = dx;
if (d2 == 0) return false;
return (d1 % d2 == 0);
}
int main() {
cin >> x >> y;
cin >> xx >> yy;
cin >> dx >> dy;
res = false;
if (x == xx && y == yy)
res = true;
else {
for (int(j) = (0); (j) < (4); ++(j)) {
long long xx_new, yy_new;
xx_new = -yy;
yy_new = xx;
xx = xx_new;
yy = yy_new;
for (int(i) = (0); (i) < (4); ++(i)) {
long long dx_new, dy_new;
dx_new = -dy;
dy_new = dx;
dx = dx_new;
dy = dy_new;
if (F()) res = true;
}
if (dx == 0 || dy == 0)
if (xx == x && yy == y) res = true;
}
}
cout << (res == true ? "YES" : "NO") << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
long long ax, ay, bx, by, cx, cy;
int main() {
cin >> ax >> ay >> bx >> by >> cx >> cy;
long long dx = bx - ax, dy = by - ay, D = cx * cx + cy * cy;
if (!dx && !dy ||
D && (cx * dx + cy * dy) % D == 0 && (-cy * dx + cx * dy) % D == 0) {
cout << "YES";
return 0;
}
dx = bx + ay, dy = by - ax;
if (!dx && !dy ||
D && (cx * dx + cy * dy) % D == 0 && (-cy * dx + cx * dy) % D == 0) {
cout << "YES";
return 0;
}
dx = bx + ax, dy = by + ay;
if (!dx && !dy ||
D && (cx * dx + cy * dy) % D == 0 && (-cy * dx + cx * dy) % D == 0) {
cout << "YES";
return 0;
}
dx = bx - ay, dy = by + ax;
if (!dx && !dy ||
D && (cx * dx + cy * dy) % D == 0 && (-cy * dx + cx * dy) % D == 0) {
cout << "YES";
return 0;
}
cout << "NO";
}
|
#include <bits/stdc++.h>
using namespace std;
struct pnt {
int x, y;
long long dist() { return 1ll * x * x + 1ll * y * y; }
pnt operator-(const pnt &a) const { return pnt{x - a.x, y - a.y}; }
long long operator*(const pnt &a) const {
return 1ll * x * a.y - 1ll * y * a.x;
}
void in() { scanf("%d%d", &x, &y); }
void rot() {
swap(x, y);
x *= -1;
}
bool net(pnt a) {
if (x == 0 && y == 0) return a.x == 0 && a.y == 0;
return a.dist() % dist() == 0 && a * (*this) % dist() == 0;
}
} A, B, C;
int main() {
A.in(), B.in(), C.in();
if (C.net(B - A)) {
puts("YES");
return 0;
}
A.rot();
if (C.net(B - A)) {
puts("YES");
return 0;
}
A.rot();
if (C.net(B - A)) {
puts("YES");
return 0;
}
A.rot();
if (C.net(B - A)) {
puts("YES");
return 0;
}
puts("NO");
}
|
#include <bits/stdc++.h>
long long a, b;
bool check(long long x1, long long y1) {
if (a == 0 && b == 0) return x1 == 0 && y1 == 0;
return (a * y1 - b * x1) % (a * a + b * b) == 0 &&
(a * x1 + b * y1) % (a * a + b * b) == 0;
}
int main() {
int x1, y1, x2, y2, x3, y3;
scanf("%I64d%I64d%I64d%I64d%I64d%I64d", &x1, &y1, &x2, &y2, &a, &b);
if (check(x2 - x1, y2 - y1) || check(x2 - y1, y2 + x1) ||
check(x2 + x1, y2 + y1) || check(x2 + y1, y2 - x1))
printf("YES\n");
else
printf("NO\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const bool debug = !false;
const double epsilon = 1e-9;
double f(double x) {
if (x < 0) return -f(-x);
return int(x + epsilon);
}
bool ok(complex<double> x) {
if (debug) cerr << x << endl;
double a = x.imag(), b = x.real();
return fabs(a - f(a)) <= epsilon && fabs(b - f(b)) <= epsilon;
}
int main() {
double ax, ay, bx, by, cx, cy;
cin >> ax >> ay >> bx >> by >> cx >> cy;
complex<double> A(ax, ay), B(bx, by), C(cx, cy), i(0, 1);
if (fabs(cx) < epsilon && fabs(cy) < epsilon) {
for (int k = 0; k < 4; k++, A *= i)
if (A == B) {
cout << "YES" << endl;
return 0;
}
cout << "NO" << endl;
return 0;
}
if (ok((B - A) / C) || ok((B - A * i) / C) || ok((B + A) / C) ||
ok((B + A * i) / C))
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool can(long long x, long long y, long long m, long long n) {
if (m == 0 && n == 0) return x == 0 && y == 0;
return abs(x * m + y * n) % (m * m + n * n) == 0 &&
abs(x * n - y * m) % (m * m + n * n) == 0;
}
int main() {
int A[2], B[2], C[2];
while (cin >> A[0] >> A[1] >> B[0] >> B[1] >> C[0] >> C[1]) {
bool ok = 0;
ok |= can(B[0] - A[0], B[1] - A[1], C[0], C[1]);
ok |= can(B[0] + A[0], B[1] + A[1], C[0], C[1]);
ok |= can(B[0] - A[1], B[1] + A[0], C[0], C[1]);
ok |= can(B[0] + A[1], B[1] - A[0], C[0], C[1]);
if (ok)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct point {
long long x, y;
point(long long _x = 0, long long _y = 0) {
x = _x;
y = _y;
}
point operator+(point w) { return point(x + w.x, y + w.y); }
point operator-(point w) { return point(x - w.x, y - w.y); }
point perp() { return point(-y, x); }
};
point A, B, C, D;
double det(long long a, long long b, long long c, long long d) {
return (a * d - b * c);
}
bool cialo(double w) { return (w == (long long)(w)); }
int main() {
cin >> A.x >> A.y >> B.x >> B.y >> C.x >> C.y;
bool SOL = false;
D = C.perp();
for (int i = 0; i < 4; ++i) {
if (A.x == B.x && A.y == B.y) {
SOL = true;
break;
}
double DP = det(C.x, D.x, C.y, D.y);
if (DP == 0) {
A = A.perp();
continue;
}
point f = B - A;
if (cialo(det(f.x, D.x, f.y, D.y) / DP) &&
cialo(det(C.x, f.x, C.y, f.y) / DP)) {
SOL = true;
break;
}
A = A.perp();
}
if (SOL)
cout << "YES\n";
else
cout << "NO\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long x, y, ax[4], ay[4], by, bx, xx, yy;
bool ok() {
for (int i = 0; i < 4; i++) {
xx = ax[i] - bx;
yy = ay[i] - by;
if (x == 0 && y == 0) {
if (xx == 0 && yy == 0) {
return true;
}
} else if (abs(x * xx + y * yy) % abs(x * x + y * y) == 0 &&
abs(y * xx - x * yy) % abs(x * x + y * y) == 0) {
return true;
}
}
return false;
}
int main() {
cin >> ax[0] >> ay[0] >> bx >> by >> x >> y;
for (int i = 1; i <= 3; i++) {
ax[i] = ay[i - 1];
ay[i] = -ax[i - 1];
}
if (ok())
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const double eps = 1e-6;
bool can(long long ax, long long ay, long long bx, long long by, long long cx,
long long cy) {
long long q = ax - bx;
long long w = ay - by;
if (!q && !w) {
return true;
}
if (!cx && !cy) return false;
if (!cx) {
return (!(q % cy) && !(w % cy));
}
if (!cy) {
return (!(q % cx) && !(w % cx));
}
long long up1 = (q * cx + w * cy);
long long up2 = (q * cy - w * cx);
long long down = (cx * cx + cy * cy);
return !(up1 % down) && !(up2 % down);
}
int main() {
long long ax, ay, bx, by, cx, cy;
cin >> ax >> ay >> bx >> by >> cx >> cy;
for (int t = 0; t < 4; t++) {
if (can(ax, ay, bx, by, cx, cy)) {
puts("YES");
return 0;
}
long long z1 = bx;
long long z2 = by;
bx = z2;
by = -z1;
}
puts("NO");
return 0;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
pair<int, int> transform(const pair<int, int>& org, int dir) {
switch (dir) {
case (0):
return org;
case (1):
return make_pair(org.second, -org.first);
case (2):
return make_pair(-org.first, -org.second);
case (3):
return make_pair(-org.second, org.first);
}
assert(false);
}
int dir1[] = {0, 0, 2, 2};
int dir2[] = {1, 3, 1, 3};
void ok() {
cout << "YES" << endl;
exit(0);
}
long long GreatestCommonDivisor(long long abc, long long def) {
if (abc < 0LL || def < 0LL) return GreatestCommonDivisor(abs(abc), abs(def));
if (abc < def) return GreatestCommonDivisor(def, abc);
if (!def) return abc;
return GreatestCommonDivisor(def, abc % def);
}
int solve(long long x1, long long x2, long long x3) {
return x3 % GreatestCommonDivisor(x1, x2) == 0LL;
}
int main() {
pair<int, int> a;
cin >> a.first >> a.second;
pair<int, int> t;
cin >> t.first >> t.second;
pair<int, int> b;
cin >> b.first >> b.second;
for (int(i) = 0; (i) < (4); ++(i)) {
pair<int, int> trans = transform(a, i);
pair<int, int> target =
make_pair(t.first - trans.first, t.second - trans.second);
if (target.first == 0 && target.second == 0) {
cout << "YES" << endl;
return 0;
}
if (b.first == 0 && b.second == 0) {
continue;
}
for (int(j) = 0; (j) < (4); ++(j)) {
int d1 = dir1[j];
int d2 = dir2[j];
pair<int, int> trans1, trans2;
trans1 = transform(b, d1);
trans2 = transform(b, d2);
long long x1 = trans1.first;
long long y1 = trans1.second;
long long x2 = trans2.first;
long long y2 = trans2.second;
long long x3 = target.first;
long long y3 = target.second;
if (x1 == 0LL && x2 == 0LL && x3 != 0LL) continue;
if (y1 == 0LL && y2 == 0LL && y3 != 0LL) continue;
if (x1 == 0LL && x2 == 0LL && x3 == 0LL) {
if (solve(y1, y2, y3)) ok();
} else if (y1 == 0LL && y2 == 0LL && y3 == 0LL) {
if (solve(x1, x2, x3)) ok();
} else {
long long gcdx =
GreatestCommonDivisor(x1, GreatestCommonDivisor(x2, x3));
long long gcdy =
GreatestCommonDivisor(y1, GreatestCommonDivisor(y2, y3));
x1 /= gcdx;
x2 /= gcdx;
x3 /= gcdx;
y1 /= gcdy;
y2 /= gcdy;
y3 /= gcdy;
long long det = x1 * y2 - x2 * y1;
if (det == 0LL) {
if (solve(x1, x2, x3) && solve(y1, y2, y3)) ok();
continue;
}
long long xnum = x2 * y3 - x3 * y2;
long long xden = x2 * y1 - x1 * y2;
if (xnum % xden != 0LL) continue;
long long ynum = x1 * y3 - x3 * y1;
if (ynum % xden != 0LL) continue;
ok();
}
}
}
cout << "NO\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool ok(long long x1, long long y1, long long x2, long long y2) {
long long t;
if (y2 == 0 && x2 == 0) return (x1 == 0 && y1 == 0);
long long d1, d2;
d1 = (x1 * x2 + y1 * y2) % (x2 * x2 + y2 * y2);
t = x2, x2 = y2, y2 = -t;
d2 = (x1 * x2 + y1 * y2) % (x2 * x2 + y2 * y2);
if (d1 == 0 && d2 == 0) return true;
return false;
}
int main(void) {
long long ax, ay, bx, by, cx, cy;
long long t;
int i, j;
bool f;
while (cin >> ax >> ay >> bx >> by >> cx >> cy) {
f = 0;
for (i = 0; i < 4; i++) {
t = ax, ax = ay, ay = -t;
f |= ok(bx - ax, by - ay, cx, cy);
}
if (f)
printf("YES\n");
else
printf("NO\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int inf = 1 << 28;
const double INF = 1e12, EPS = 1e-9;
bool _(long long x, long long y, long long a, long long b) {
if (a == b && b == 0) return x == 0 && y == 0;
return (a * y - b * x) % (a * a + b * b) == 0 &&
(a * x + b * y) % (a * a + b * b) == 0;
}
void run() {
int a1, a2, b1, b2, c1, c2;
cin >> a1 >> a2 >> c1 >> c2 >> b1 >> b2;
cout << (_(c1 - a1, c2 - a2, b1, b2) || _(c1 + a2, c2 - a1, b1, b2) ||
_(c1 + a1, c2 + a2, b1, b2) || _(c1 - a2, c2 + a1, b1, b2)
? "YES"
: "NO")
<< endl;
}
int main() { run(); }
|
#include <bits/stdc++.h>
using namespace std;
long long a, b, c, d, e, f;
bool ju2(long long x, long long y) {
x -= c, y -= d;
long long div = e * e + f * f;
if (!div) return x == 0 && y == 0;
return (e * x + f * y) % div == 0 && (e * y - f * x) % div == 0;
}
bool ju1() {
if (ju2(a, b)) return 1;
if (ju2(-a, -b)) return 1;
if (ju2(-b, a)) return 1;
if (ju2(b, -a)) return 1;
return 0;
}
signed main() {
scanf("%lld%lld%lld%lld%lld%lld", &a, &b, &c, &d, &e, &f);
if (ju1())
puts("YES");
else
puts("NO");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
void read(T& num) {
char CH;
bool F = false;
for (CH = getchar(); CH < '0' || CH > '9'; F = CH == '-', CH = getchar())
;
for (num = 0; CH >= '0' && CH <= '9';
num = num * 10 + CH - '0', CH = getchar())
;
F && (num = -num);
}
int stk[70], tp;
template <class T>
inline void print(T p) {
if (!p) {
puts("0");
return;
}
while (p) stk[++tp] = p % 10, p /= 10;
while (tp) putchar(stk[tp--] + '0');
putchar('\n');
}
const long long mod = 1e9 + 7;
const double PI = acos(-1.0);
const long long inf = 1e18;
const int N = (1 << 20) + 10;
const int maxn = 1e6 + 10;
const double eps = 1e-12;
long long ax, ay, bx, by, cx, cy;
int solve(long long x, long long y) {
x = bx - x;
y = by - y;
if (cx == 0 && cy == 0) {
if (x == 0 && y == 0) return 1;
return 0;
} else if (cx == 0) {
long long g = x / cy, h = y / cy;
if (g * cy == x && h * cy == y) return 1;
return 0;
} else if (cy == 0) {
long long g = x / cx, h = y / cx;
if (g * cx == x && h * cx == y) return 1;
return 0;
} else {
long long tx = x * cy, ty = y * cx;
long long b = (tx - ty) / (cy * cy + cx * cx);
if (b * (cx * cx + cy * cy) != (tx - ty))
return 0;
else {
long long a = (x - b * cy) / cx;
if (a * cx + b * cy == x) return 1;
return 0;
}
}
}
int main() {
read(ax);
read(ay);
read(bx);
read(by);
read(cx);
read(cy);
int f = 0;
if (solve(ax, ay)) f = 1;
if (solve(-ax, -ay)) f = 1;
if (solve(ay, -ax)) f = 1;
if (solve(-ay, ax)) f = 1;
if (f)
cout << "YES\n";
else
cout << "NO\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-8;
struct pt {
long long x, y;
void read() { scanf("%I64d%I64d", &x, &y); }
pt() {}
pt(long long _x, long long _y) {
x = _x;
y = _y;
}
pt next() { return pt(y, -x); }
double mag() const { return sqrt(x * x + y * y); }
double operator*(const pt &a) const { return x * a.x + y * a.y; }
pt operator-(const pt &a) const { return pt(x - a.x, y - a.y); }
} A, B, C;
bool ok(const pt &delta, const pt &C) {
if (C.x == 0 && C.y == 0) return delta.x == 0 && delta.y == 0;
long long a = C.x, b = C.y, c = delta.x, d = delta.y;
long long r = d * a - c * b;
if (r % (a * a + b * b) == 0) {
long long y = r / (a * a + b * b);
if (a != 0) return (c + b * y) % a == 0;
if (b != 0) return (d - a * y) % b == 0;
}
return false;
}
int main() {
A.read();
B.read();
C.read();
bool ans = false;
for (int i = 0; i < 4; i++) {
pt delta = B - A;
if (ok(delta, C)) {
ans = true;
break;
}
A = A.next();
}
if (ans)
printf("YES\n");
else
printf("NO\n");
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long x1, x2, x3, y1, y2, y3, t, s1, s2, s;
int i;
while (cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3) {
if (x3 == 0 && y3 == 0) {
for (i = 0; i < 4; i++) {
if (x1 == x2 && y1 == y2) break;
t = x1;
x1 = y1;
y1 = -t;
}
if (i < 4)
cout << "YES" << endl;
else
cout << "NO" << endl;
continue;
}
for (i = 0; i < 4; i++) {
s1 = (x2 - x1) * x3 + (y2 - y1) * y3;
if (s1 < 0) s1 = -s1;
s2 = (x2 - x1) * y3 - (y2 - y1) * x3;
if (s2 < 0) s2 = -s2;
s = x3 * x3 + y3 * y3;
if (s1 % s == 0 && s2 % s == 0) break;
t = x1;
x1 = y1;
y1 = -t;
}
if (i < 4)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long aax, aay, bbx, bby, ccx, ccy;
long long num[3][5];
bool flag1, flag2, flag3, flag4;
long long gcd(long long x, long long y) { return y ? gcd(y, x % y) : x; }
long long lcm(long long x, long long y) { return (x * y) / gcd(x, y); }
bool check(long long ax, long long ay, long long bx, long long by, long long cx,
long long cy) {
if (cx * cx + cy * cy == 0) {
if (ax == bx && ay == by)
return 1;
else
return 0;
} else {
if ((cx * (by - ay) - cy * (bx - ax)) % (cx * cx + cy * cy) == 0 &&
(cy * (by - ay) + cx * (bx - ax)) % (cx * cx + cy * cy) == 0)
return 1;
else
return 0;
}
}
int main() {
scanf("%lld%lld%lld%lld%lld%lld", &aax, &aay, &bbx, &bby, &ccx, &ccy);
flag1 = check(aax, aay, bbx, bby, ccx, ccy);
flag2 = check(-aax, -aay, bbx, bby, ccx, ccy);
flag3 = check(aay, -aax, bbx, bby, ccx, ccy);
flag4 = check(-aay, aax, bbx, bby, ccx, ccy);
if (flag1 || flag2 || flag3 || flag4)
puts("YES");
else
puts("NO");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long ax, ay, bx, by, cx, cy;
long long AX[4], AY[4], CX[4], CY[4];
long long GCD(long long a, long long b) {
a = abs(a), b = abs(b);
if (a < b) swap(a, b);
return b ? GCD(b, a % b) : a;
}
bool judge(long long ax, long long ay, long long cx, long long cy) {
if (cx == 0 && cy == 0) return ax == bx && ay == by;
if (cx == 0) return (bx - ax) % cy == 0 && (by - ay) % cy == 0;
if (cy == 0) return (bx - ax) % cx == 0 && (by - ay) % cx == 0;
long long zi1 = abs((bx - ax) * cx + (by - ay) * cy);
long long zi2 = abs(cx * (by - ay) - cy * (bx - ax));
long long mu = abs(cx * cx + cy * cy);
if (mu)
if (zi1 % mu || zi2 % mu) return 0;
if (!mu && (zi1 || zi2)) return 0;
return 1;
}
int main() {
cin >> ax >> ay >> bx >> by >> cx >> cy;
AX[0] = ax, AY[0] = ay;
AX[1] = -ay, AY[1] = ax;
AX[2] = -ax, AY[2] = -ay;
AX[3] = ay, AY[3] = -ax;
CX[0] = cx, CY[0] = cy;
CX[1] = -cy, CY[1] = cx;
CX[2] = -cx, CY[2] = -cy;
CX[3] = cy, CY[3] = -cx;
for (int i = 0; i < 4; i++)
for (int j = 0; j < 4; j++)
if (judge(AX[i], AY[i], CX[j], CY[j])) return cout << "YES", 0;
cout << "NO";
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 50;
const int inf = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
bool divis(complex<long long> a, complex<long long> b) {
complex<long long> c = a / b;
return (b * c == a);
}
int main() {
long long a, b;
cin >> a >> b;
complex<long long> A(a, b);
cin >> a >> b;
complex<long long> B(a, b);
cin >> a >> b;
complex<long long> C(a, b);
complex<long long> I(0, 1);
bool flag = 0;
if (C.real() == 0 && C.imag() == 0) {
if (A == B)
flag = 1;
else if (-A == B)
flag = 1;
else if (B == -A * I)
flag = 1;
else if (B == A * I)
flag = 1;
} else {
if (divis(B - A, C)) flag = 1;
if (divis(B + A, C)) flag = 1;
if (divis(B + A * I, C)) flag = 1;
if (divis(B - A * I, C)) flag = 1;
}
cout << (flag ? "YES\n" : "NO\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long ax, ay, bx, by, cx, cy;
void check(long long axx, long long ayy) {
if (cx * cx + cy * cy == 0) {
if (axx == bx && ayy == by) {
cout << "YES";
exit(0);
} else
return;
}
if ((cx * (by + ayy) - cy * (bx + axx)) % (cx * cx + cy * cy) != 0 ||
(cx * (bx + axx) + cy * (by + ayy)) % (cx * cx + cy * cy) != 0)
return;
cout << "YES";
exit(0);
}
int main() {
cin >> ax >> ay >> bx >> by >> cx >> cy;
check(ax, ay);
check(ay, -ax);
check(-ax, -ay);
check(-ay, ax);
cout << "NO";
}
|
#include <bits/stdc++.h>
using namespace std;
const long long int INF = (long long int)1e9 + 10;
const long long int INFLL = (long long int)1e18 + 10;
const long double EPS = 1e-8;
const long double EPSLD = 1e-18;
const long long int MOD = 1e9 + 7;
template <class T>
T &chmin(T &a, const T &b) {
return a = min(a, b);
}
template <class T>
T &chmax(T &a, const T &b) {
return a = max(a, b);
}
long long int ax, ay, bx, by, bxa, bya, bxb, byb;
bool check(long long int arx, long long int ary) {
long long int tx = bx - arx;
long long int ty = by - ary;
if (bxa == 0 && bya == 0) return tx == 0 && ty == 0;
long long int dor = bxa * byb - bxb * bya;
assert(dor != 0);
long long int nx = byb * tx - bxb * ty;
long long int ny = -bya * tx + bxa * ty;
return nx % dor == 0 && ny % dor == 0;
}
int main() {
scanf("%lld %lld", &ax, &ay);
scanf("%lld %lld", &bx, &by);
scanf("%lld %lld", &bxa, &bya);
bxb = -bya;
byb = bxa;
if (check(ax, ay) || check(-ax, -ay) || check(ay, -ax) || check(-ay, ax))
puts("YES");
else
puts("NO");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long x0, y0, x, y, x1, y1;
long long m1, m2, n;
while (cin >> x0 >> y0) {
cin >> x >> y;
cin >> x1 >> y1;
if (x1 * x1 + y1 * y1 == 0) {
int i;
for (i = 0; i < 4; i++) {
if (x0 == x && y0 == y) break;
long long temp = x0;
x0 = y0;
y0 = -temp;
}
if (i < 4)
cout << "YES" << endl;
else
cout << "NO" << endl;
continue;
}
int i;
for (i = 0; i < 4; i++) {
m1 = (x - x0) * x1 + (y - y0) * y1;
if (m1 < 0) m1 = -m1;
m2 = (x - x0) * y1 - (y - y0) * x1;
if (m2 < 0) m2 = -m2;
n = x1 * x1 + y1 * y1;
if (m1 % n == 0 && m2 % n == 0) break;
long long temp = x0;
x0 = y0;
y0 = -temp;
}
if (i < 4)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename T>
void UpdateMax(T& a, T b) {
if (a < b) a = b;
}
template <typename T>
void UpdateMin(T& a, T b) {
if (a > b) a = b;
}
template <typename T>
inline void read(T& x) {
x = 0;
char c = getchar();
int flag = 1;
while (!isdigit(c)) {
if (c == '-') flag = -1;
c = getchar();
}
while (isdigit(c)) {
x = x * 10 + c - '0';
c = getchar();
}
x *= flag;
}
template <typename T>
void Unique(vector<T>& vec) {
sort(vec.begin(), vec.end());
vec.erase(unique(vec.begin(), vec.end()), vec.end());
}
template <typename T>
void Relabel(vector<T>& vec, T& value) {
value = lower_bound(vec.begin(), vec.end(), value) - vec.begin() + 1;
}
template <typename T, typename V>
void Print(const pair<T, V>& x) {
cout << x.first << " @ " << x.second << " | ";
}
template <typename T>
void Print(const T& x) {
cout << x << " ";
}
template <typename T>
void Pcon(const T& x) {
cout << "\nsize: " << x.size() << endl;
for (const auto& item : x) Print(item);
}
std::vector<int> LABS;
template <typename T>
void Print(const T* x, int offset, int loop) {
for (int i = 0; i <= loop; i++) {
cout << "[";
for (int item : LABS) cout << item - offset << ",";
cout << i - offset << "]:";
cout << x[i] << " ";
}
}
template <typename T, typename... Args>
void Print(const T* f, int offset, int loop, Args... args) {
for (int i = 0; i <= loop; i++) {
LABS.push_back(i);
Print(f[i], offset, args...);
cout << endl;
LABS.pop_back();
}
}
template <typename T, typename V>
bool Has(T& cluster, const V& item) {
return cluster.find(item) != cluster.end();
}
int Logn(long long x) {
int cnt = 0;
while (x) {
++cnt;
x >>= 1;
}
return cnt;
}
const int MOD = 1e9 + 7;
const int N = 2e5 + 5;
const int dir[4][2] = {{-1, 0}, {0, -1}, {1, 0}, {1, 0}};
struct Edg {
int x, y, z;
friend bool operator<(const Edg& lhs, const Edg& rhs) {
return lhs.z < rhs.z;
}
} edg[N];
bool vis[N], used[N];
clock_t start_time;
int t, n, m;
int f[N];
vector<int> G[N];
inline void SetClock() { start_time = clock(); }
bool TimeOut(size_t ms) {
if (1000 * (clock() - start_time) >= ms * ((clock_t)1000)) return true;
return false;
}
inline pair<int, int> DeSerialize(int c) { return {(c) / m, (c) % m}; }
template <typename T, typename V>
inline void Add(T& v, const V& delta) {
v += delta;
if (v >= MOD) v -= MOD;
}
long long a1, a2, b1, b2, c1, c2;
bool check(long long a1, long long a2) {
long long t1 = b1 + a1, t2 = b2 + a2;
long long d1 = t1 - t2, d2 = t1 + t2;
if (c1 == 0 && c2 == 0) {
return d1 == 0 && d2 == 0;
}
if (c1 == 0) {
return d1 % c2 == 0 && d2 % c2 == 0;
}
if (c2 == 0) {
return d1 % c1 == 0 && d2 % c1 == 0;
}
if ((d2 * c1 - d1 * c2) % (c1 * c1 + c2 * c2) != 0) {
return false;
}
long long b = (d2 * c1 - d1 * c2) / (c1 * c1 + c2 * c2);
if ((d1 + b * c2) % c1 != 0) {
return false;
}
long long a = (d1 + b * c2) / c1;
return (a & 1) == (b & 1);
}
int main() {
srand(time(0));
SetClock();
cin.sync_with_stdio(false);
cin >> a1 >> a2;
cin >> b1 >> b2;
cin >> c1 >> c2;
if (check(a1, a2) || check(a2, -a1) || check(-a1, -a2) || check(-a2, a1)) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long a, b, c, d, x, y;
long long pd(long long a, long long b) {
long long sum = c * c + d * d;
if (sum == 0)
return a == 0 && b == 0;
else
return (a * c + b * d) % sum == 0 && (b * c - a * d) % sum == 0;
}
int main() {
scanf("%lld%lld%lld%lld%lld%lld", &a, &b, &x, &y, &c, &d);
if (pd(a - x, b - y) || pd(a + x, b + y) || pd(a - y, b + x) ||
pd(a + y, b - x))
return printf("YES\n"), 0;
else
return printf("NO\n"), 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long xa, ya, xb, yb, xc, yc;
long long o;
bool check(long long xa, long long ya) {
if (!o) return xa == xb && ya == yb;
return ((xb - xa) * xc + (yb - ya) * yc) % o == 0 &&
((xb - xa) * yc - (yb - ya) * xc) % o == 0;
}
int main() {
scanf("%I64d %I64d %I64d %I64d %I64d %I64d", &xa, &ya, &xb, &yb, &xc, &yc);
o = xc * xc + yc * yc;
bool flag =
check(xa, ya) || check(ya, -xa) || check(-ya, xa) || check(-xa, -ya);
if (flag)
printf("YES\n");
else
printf("NO\n");
}
|
#include <bits/stdc++.h>
using namespace std;
struct coor {
int x, y;
} a, b, c;
int gcd(int x, int y) { return !y ? x : gcd(y, x % y); }
bool jud(int Ax, int Ay) {
long long x = b.x - Ax, y = b.y - Ay;
if (c.x && c.y) {
long long tx = x * c.y, ty = y * c.x;
if ((tx - ty) % (1ll * c.x * c.x + 1ll * c.y * c.y)) return 0;
long long t = (tx - ty) / (1ll * c.x * c.x + 1ll * c.y * c.y);
int a = (x - t * c.y) % c.x;
if (!a) return 1;
return 0;
} else if (!c.x && c.y) {
if ((x % c.y == 0) && (y % c.y == 0)) return 1;
return 0;
} else if (!c.y && c.x) {
if ((x % c.x == 0) && (y % c.x == 0)) return 1;
return 0;
} else
return (!x) && (!y);
}
int main() {
scanf("%d%d", &a.x, &a.y);
scanf("%d%d", &b.x, &b.y);
scanf("%d%d", &c.x, &c.y);
bool cnt = 0;
if (jud(a.x, a.y)) cnt = 1;
if (jud(a.y, -a.x)) cnt = 1;
if (jud(-a.y, a.x)) cnt = 1;
if (jud(-a.x, -a.y)) cnt = 1;
puts(cnt ? "YES" : "NO");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long ax, ay, bx, by, cx, cy;
bool solve(long long x, long long y) {
x = bx - x;
y = by - y;
if (cx == 0 && cy == 0) {
if (x == 0 && y == 0)
return 1;
else
return 0;
} else if (cx == 0) {
long long m = x / cy, n = y / cy;
if (m * cy == x && n * cy == y)
return 1;
else
return 0;
} else if (cy == 0) {
long long m = x / cx, n = y / cx;
if (m * cx == x && n * cx == y)
return 1;
else
return 0;
} else {
long long powsum = cx * cx + cy * cy;
long long m = (cx * x + cy * y) / powsum;
long long n = (x * cy - y * cx) / powsum;
if (m * cx + n * cy == x && m * cy - n * cx == y)
return 1;
else
return 0;
}
}
int main() {
scanf("%lld%lld%lld%lld%lld%lld", &ax, &ay, &bx, &by, &cx, &cy);
bool flag = 0;
if (solve(ax, ay)) flag = 1;
if (solve(-ax, -ay)) flag = 1;
if (solve(ay, -ax)) flag = 1;
if (solve(-ay, ax)) flag = 1;
if (flag)
cout << "YES\n";
else
cout << "NO\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long ax, ay, bx, by, cx, cy;
bool check(int ax, int ay) {
return (cx * ax + cy * ay) % (cx * cx + cy * cy) == 0 &&
(cx * ay - cy * ax) % (cx * cx + cy * cy) == 0;
}
int main() {
cin >> ax >> ay >> bx >> by >> cx >> cy;
if (cx == 0 && cy == 0) {
if ((ax == bx && ay == by) || (ax == -bx && ay == -by) ||
(ax == -by && ay == bx) || (ax == by && ay == -bx))
cout << "YES";
else
cout << "NO";
return 0;
}
if (cx == 0 && cy == 0) {
if (ax == 0 && ay == 0)
cout << "YES";
else
cout << "NO";
return 0;
}
if (check(ax - bx, ay - by) || check(ax + bx, ay + by) ||
check(ax + by, ay - bx) || check(ax - by, ay + bx))
cout << "YES";
else
cout << "NO";
}
|
#include <bits/stdc++.h>
using namespace std;
long long a, b, x, y, p, q;
long long c(long long a, long long b) {
long long d = p * p + q * q;
if (d == 0) return a == 0 && b == 0;
return (a * p + b * q) % d == 0 && (b * p - a * q) % d == 0;
}
int main() {
cin >> a >> b >> x >> y >> p >> q;
cout << (c(a - x, b - y) || c(a + x, b + y) || c(a - y, b + x) ||
c(a + y, b - x)
? "YES"
: "NO")
<< endl;
}
|
#include <bits/stdc++.h>
using namespace std;
long long a1, a2, b1, b2, c1, c2, x, y;
long long aaabs(long long a) { return (a >= 0) ? a : -a; }
void solve() {
cin >> a1 >> a2 >> b1 >> b2 >> c1 >> c2;
if (c1 == 0 && c2 == 0) {
if (a1 == b1 && a2 == b2) {
cout << "YES";
return;
}
if (a1 == -b1 && a2 == -b2) {
cout << "YES";
return;
}
if (a1 == b2 && a2 == -b1) {
cout << "YES";
return;
}
if (a1 == -b2 && a2 == b1) {
cout << "YES";
return;
}
cout << "NO";
return;
}
x = b1 - a1;
y = b2 - a2;
if (aaabs(c2 * x - c1 * y) % (c1 * c1 + c2 * c2) == 0 &&
aaabs(c1 * x + c2 * y) % (c1 * c1 + c2 * c2) == 0) {
cout << "YES";
return;
}
x = b1 + a1;
y = b2 + a2;
if (aaabs(c2 * x - c1 * y) % (c1 * c1 + c2 * c2) == 0 &&
aaabs(c1 * x + c2 * y) % (c1 * c1 + c2 * c2) == 0) {
cout << "YES";
return;
}
x = b1 - a2;
y = b2 + a1;
if (aaabs(c2 * x - c1 * y) % (c1 * c1 + c2 * c2) == 0 &&
aaabs(c1 * x + c2 * y) % (c1 * c1 + c2 * c2) == 0) {
cout << "YES";
return;
}
x = b1 + a2;
y = b2 - a1;
if (aaabs(c2 * x - c1 * y) % (c1 * c1 + c2 * c2) == 0 &&
aaabs(c1 * x + c2 * y) % (c1 * c1 + c2 * c2) == 0) {
cout << "YES";
return;
}
cout << "NO";
}
int main() {
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long x, y, ax[4], ay[4], by, bx, xx, yy;
bool ok() {
long long d = abs(x * x + y * y);
for (int i = 0; i < 4; i++) {
xx = ax[i] - bx;
yy = ay[i] - by;
if ((xx == 0 && yy == 0) || ((x || y) && abs(x * xx + y * yy) % d == 0 &&
abs(y * xx - x * yy) % d == 0)) {
return true;
}
}
return false;
}
int main() {
cin >> ax[0] >> ay[0] >> bx >> by >> x >> y;
for (int i = 1; i <= 3; i++) {
ax[i] = ay[i - 1];
ay[i] = -ax[i - 1];
}
if (ok())
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
if (b == 0) return a;
if (a % b == 0) return b;
return gcd(b, a % b);
}
bool sub_main(long long X, long long Y, long long x, long long y) {
if (x == 0 && y == 0) {
if (X == 0 && Y == 0)
cout << "YES" << endl;
else
return false;
return true;
}
long long left = x * x + y * y;
long long right = x * Y - X * y;
if (right % left == 0) {
long long tmp = right / left;
if (x != 0 && (X + y * tmp) % x == 0) {
cout << "YES" << endl;
return true;
} else if (x == 0 && X + y * tmp == 0 && (Y - x * tmp) % y == 0) {
cout << "YES" << endl;
return true;
}
}
return false;
}
int main() {
long long ax, ay, bx, by, cx, cy;
cin >> ax >> ay >> bx >> by >> cx >> cy;
for (long long i = 0; i < ((long long)4); i++) {
long long tmp = ax;
ax = -ay;
ay = tmp;
if (sub_main(bx - ax, by - ay, cx, cy)) return 0;
}
cout << "NO" << endl;
return 0;
}
|
#include <bits/stdc++.h>
long long a, b, x, y, p, q, d;
long long c(long long a, long long b) {
d = p * p + q * q;
if (d == 0) return a == 0 && b == 0;
return (a * p + b * q) % d == 0 && (b * p - a * q) % d == 0;
}
int main() {
std::cin >> a >> b >> x >> y >> p >> q;
puts(c(a - x, b - y) || c(a + x, b + y) || c(a - y, b + x) || c(a + y, b - x)
? "YES"
: "NO");
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.