1562A - The Miracle and the Sleeper - CodeForces Solution

greedy math *800

Please click on ads to support us..

Python Code: 

from math import *
def solve(l,r):
    b = r // 2 + 1;
    b = max(l, b)
    return r % b;
n=int(input())
for i in range(n):
    l,r=map(int,input().split(' '))
    print(solve(l,r))

C++ Code: 

#include<bits/stdc++.h>
using namespace std;
int main() 
{
    int n;
    cin >> n;
    while (n --) 
    {
        int a, b , mx;
        cin >> a >> b;
        mx = max (a , b / 2 + 1);
        cout << b % mx << endl;
    }
}


Comments

Submit
0 Comments
More Questions

1370C - Number Game
1206B - Make Product Equal One
131A - cAPS lOCK
1635A - Min Or Sum
474A - Keyboard
1343A - Candies
1343C - Alternating Subsequence
1325A - EhAb AnD gCd
746A - Compote
318A - Even Odds
550B - Preparing Olympiad
939B - Hamster Farm
732A - Buy a Shovel
1220C - Substring Game in the Lesson
452A - Eevee
1647B - Madoka and the Elegant Gift
1408A - Circle Coloring
766B - Mahmoud and a Triangle
1618C - Paint the Array
469A - I Wanna Be the Guy
1294A - Collecting Coins
1227A - Math Problem
349A - Cinema Line
47A - Triangular numbers
1516B - AGAGA XOOORRR
1515A - Phoenix and Gold
1515B - Phoenix and Puzzle
155A - I_love_username
49A - Sleuth
1541A - Pretty Permutations