1612A - Distance - CodeForces Solution

brute force constructive algorithms *800

Please click on ads to support us..

Python Code: 

for i in range(int(input())):
    x, y = map(int, input().split())
    if (x+y) % 2==1:
        print('-1 -1')
    elif x%2==1:
        if x > y:
            print(int((x+y)/2)-y,y)
        else:
            print(x,int((x+y)/2)-x)

    else:
        print(int(x/2),int(y/2))

C++ Code: 

#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define ll long long
int main(){
    int t;
    cin>>t;
    while(t--){
        int a,b;
        cin>>a>>b;
        if((a+b)&1){
            cout<<"-1 -1"<<endl;
        }
        else{
            if(a&1){
                if(a>b){
                    cout<<(a-b)/2<<" "<<b<<endl;
                }
                else{
                    cout<<a<<" "<<(b-a)/2<<endl;
                }
            }
            else{
                cout<<a/2<<" "<<b/2<<endl;
            }
        }
    }
}


Comments

Submit
0 Comments
More Questions

1221. Split a String in Balanced Strings
1002. Find Common Characters
1602A - Two Subsequences
1555A - PizzaForces
1607B - Odd Grasshopper
1084A - The Fair Nut and Elevator
1440B - Sum of Medians
1032A - Kitchen Utensils
1501B - Napoleon Cake
1584B - Coloring Rectangles
1562B - Scenes From a Memory
1521A - Nastia and Nearly Good Numbers
208. Implement Trie
1605B - Reverse Sort
1607C - Minimum Extraction
1604B - XOR Specia-LIS-t
1606B - Update Files
1598B - Groups
1602B - Divine Array
1594B - Special Numbers
1614A - Divan and a Store
2085. Count Common Words With One Occurrence
2089. Find Target Indices After Sorting Array
2090. K Radius Subarray Averages
2091. Removing Minimum and Maximum From Array
6. Zigzag Conversion
1612B - Special Permutation
1481. Least Number of Unique Integers after K Removals
1035. Uncrossed Lines
328. Odd Even Linked List