1401A - Distance and Axis - CodeForces Solution


constructive algorithms math *900

Please click on ads to support us..

Python Code:

t = int(input())

for _ in range(t):
    a, b = map(int, input().split())

    if a <= b:
        print(b - a)
    elif a % 2 == b % 2:
        print(0)
    else:
        print(1)

C++ Code:

#include <bits/stdc++.h>
#define ll long long int

using namespace std;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t;
    cin >> t;
    while(t--) {
        ll n, k;
        cin >> n >> k;
        if(n <= k) {
            cout << k - n << "\n";
            continue;
        }
        ll x = 0;
        while(2 * x + k <= n) {
            x++;
        }
        ll a1 = 2 * x + k;
        ll a2 = 2 * (x - 1) + k;
        cout << min(abs(a1 - n), abs(a2 - n)) << "\n";
    }
    return 0;
}


Comments

Submit
0 Comments
More Questions

1302. Deepest Leaves Sum
1209. Remove All Adjacent Duplicates in String II
994. Rotting Oranges
983. Minimum Cost For Tickets
973. K Closest Points to Origin
969. Pancake Sorting
967. Numbers With Same Consecutive Differences
957. Prison Cells After N Days
946. Validate Stack Sequences
921. Minimum Add to Make Parentheses Valid
881. Boats to Save People
497. Random Point in Non-overlapping Rectangles
528. Random Pick with Weight
470. Implement Rand10() Using Rand7()
866. Prime Palindrome
1516A - Tit for Tat
622. Design Circular Queue
814. Binary Tree Pruning
791. Custom Sort String
787. Cheapest Flights Within K Stops
779. K-th Symbol in Grammar
701. Insert into a Binary Search Tree
429. N-ary Tree Level Order Traversal
739. Daily Temperatures
647. Palindromic Substrings
583. Delete Operation for Two Strings
518. Coin Change 2
516. Longest Palindromic Subsequence
468. Validate IP Address
450. Delete Node in a BST