1715A - Crossmarket - CodeForces Solution

constructive algorithms greedy math

Please click on ads to support us..

Python Code: 

for _ in range(int(input())):
    n, m = map(int, input().split())
    if n == 1 and m == 1:
        print(0)
    else:
        print((n-1) + (m-1) + min(n,m))

C++ Code: 

    #include <iostream>
     
    using namespace std;
     
    signed main() {
        (*cin.tie(0)).sync_with_stdio(0);
        int t; cin >> t;
        while (t--) {
            int n, m; cin >> n >> m;
            cout << n + m + min(n, m) - 3 + min(max(n, m) - 1, 1) << "\n";
        }
        return 0;
    }


Comments

Submit
0 Comments
More Questions

Help Jarvis!
Lift queries
Goki and his breakup
Ali and Helping innocent people
Book of Potion making
Duration
Birthday Party
e-maze-in
Bricks Game
Char Sum
Two Strings
Anagrams
Prime Number
Lexical Sorting Reloaded
1514A - Perfectly Imperfect Array
580A- Kefa and First Steps
1472B- Fair Division
996A - Hit the Lottery
MSNSADM1 Football
MATCHES Playing with Matches
HRDSEQ Hard Sequence
DRCHEF Doctor Chef
559. Maximum Depth of N-ary Tree
821. Shortest Distance to a Character
1441. Build an Array With Stack Operations
1356. Sort Integers by The Number of 1 Bits
922. Sort Array By Parity II
344. Reverse String
1047. Remove All Adjacent Duplicates In String
977. Squares of a Sorted Array