1622A - Construct a Rectangle - CodeForces Solution


geometry math *800

Please click on ads to support us..

Python Code:

n = int(input())
for i in range(n):
    a = list(int(x) for x in input().split())
    a.sort()
    if (a[-1] == a[1]+a[0]):
        print("YES")
    elif a[0]==a[1]:
        if (a[2]%2==0):
            print("YES")
        else:
            print("NO")
    elif a[2]==a[1]:
        if (a[0]%2==0):
            print("YES")
        else:
            print("NO")
    else:
        print("NO")

C++ Code:

#include<iostream>
#include<vector>
#include<algorithm>
typedef long long ll;
int main()  {
    ll t, a, b, c;
    std::cin >> t;

    while (t--) {
        std::cin >> a >> b >> c;
        std::vector<ll> nums;

        nums.push_back(a);
        nums.push_back(b);
        nums.push_back(c);
        sort(nums.begin(), nums.end());

        if (nums[0] + nums[1] == nums[2] ||
            (count(nums.begin(), nums.end(), nums[1]) >= 2 && 
                (a + b + c) % 2 == 0))
            std::cout << "YES" << std::endl;
        else std::cout << "NO" << std::endl;
    }
}


Comments

Submit
0 Comments
More Questions

80A - Panoramix's Prediction
1354B - Ternary String
122B - Lucky Substring
266B - Queue at the School
1490A - Dense Array
1650B - DIV + MOD
1549B - Gregor and the Pawn Game
553A - Kyoya and Colored Balls
1364A - XXXXX
1499B - Binary Removals
1569C - Jury Meeting
108A - Palindromic Times
46A - Ball Game
114A - Cifera
776A - A Serial Killer
25B - Phone numbers
1633C - Kill the Monster
1611A - Make Even
1030B - Vasya and Cornfield
1631A - Min Max Swap
1296B - Food Buying
133A - HQ9+
1650D - Twist the Permutation
1209A - Paint the Numbers
1234A - Equalize Prices Again
1613A - Long Comparison
1624B - Make AP
660B - Seating On Bus
405A - Gravity Flip
499B - Lecture