1415A - Prison Break - CodeForces Solution


brute force math *800

Please click on ads to support us..

Python Code:

for _ in range(int(input())):
    n, m, r, c = list(map(int, input().split()))
    print(max(m-c,c-1) + max(n-r,r-1))

C++ Code:

#include <iostream>
#include <bits/stdc++.h>
using namespace std;

int main()
{
    int t;
    cin>>t;
    
    while(t--){
        
        int n,m, r,c;
        cin>>n>>m>>r>>c;
        
        int hr, vr;
        
        if(r > n - r){
            hr = r - 1;
        }else{
            hr = n - r;
        }
        
        
        if(c > m - c){
            vr = c - 1;
        }else{
            vr = m - c;
        }
        
        cout<<hr + vr<<endl;
    }

    return 0;
}


Comments

Submit
0 Comments
More Questions

1437A - Marketing Scheme
1473B - String LCM
1374A - Required Remainder
1265E - Beautiful Mirrors
1296A - Array with Odd Sum
1385A - Three Pairwise Maximums
911A - Nearest Minimums
102B - Sum of Digits
707A - Brain's Photos
1331B - Limericks
305B - Continued Fractions
1165B - Polycarp Training
1646C - Factorials and Powers of Two
596A - Wilbur and Swimming Pool
1462B - Last Year's Substring
1608B - Build the Permutation
1505A - Is it rated - 2
169A - Chores
765A - Neverending competitions
1303A - Erasing Zeroes
1005B - Delete from the Left
94A - Restoring Password
1529B - Sifid and Strange Subsequences
1455C - Ping-pong
1644C - Increase Subarray Sums
1433A - Boring Apartments
1428B - Belted Rooms
519B - A and B and Compilation Errors
1152B - Neko Performs Cat Furrier Transform
1411A - In-game Chat