763B - Timofey and rectangles - CodeForces Solution

constructive algorithms geometry *2100

Please click on ads to support us..

Python Code: 

print('YES')
n = int(input())

for i in range(n):
    x, y, _, __ = input().split()
    print(2 * (int(x) % 2) + (int(y) % 2) + 1)

C++ Code: 

#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define pii pair<int, int>
#define oo 1e9
vector<array<int, 4>> v;

void solve(){
    int n; cin >> n;
    cout << "YES\n";
    for(int i = 1; i <= n; i++){
        int x1, y1, x2, y2;
        cin >> x1 >> y1 >> x2 >> y2;
        x1 += 1e9;
        y1 += 1e9;
        cout << 2 * (x1 % 2) + (y1 % 2) + 1 << '\n';
    }

}

int main(){
    int t = 1;
    while(t--){
        solve();
    }
}


Comments

Submit
0 Comments
More Questions

1025D - Recovering BST
439A - Devu the Singer and Churu the Joker
1323A - Even Subset Sum Problem
1095A - Repeating Cipher
630F - Selection of Personnel
630K - Indivisibility
20B - Equation
600B - Queries about less or equal elements
1015A - Points in Segments
1593B - Make it Divisible by 25
680C - Bear and Prime 100
1300A - Non-zero
1475E - Advertising Agency
1345B - Card Constructions
1077B - Disturbed People
653A - Bear and Three Balls
794A - Bank Robbery
157A - Game Outcome
3B - Lorry
1392A - Omkar and Password
489A - SwapSort
932A - Palindromic Supersequence
433A - Kitahara Haruki's Gift
672A - Summer Camp
1277A - Happy Birthday Polycarp
577A - Multiplication Table
817C - Really Big Numbers
1355A - Sequence with Digits
977B - Two-gram
993A - Two Squares