1566A - Median Maximization - CodeForces Solution


binary search greedy math *800

Please click on ads to support us..

Python Code:

for _ in range(int(input())):
    n, s = input().split()
    print(int(s) // ((int(n) + 2) // 2))

C++ Code:

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


Comments

Submit
0 Comments
More Questions

Non empty subsets
1630A - And Matching
1630B - Range and Partition
1630C - Paint the Middle
1630D - Flipping Range
1328A - Divisibility Problem
339A - Helpful Maths
4A - Watermelon
476A - Dreamoon and Stairs
1409A - Yet Another Two Integers Problem
977A - Wrong Subtraction
263A - Beautiful Matrix
180C - Letter
151A - Soft Drinking
1352A - Sum of Round Numbers
281A - Word Capitalization
1646A - Square Counting
266A - Stones on the Table
61A - Ultra-Fast Mathematician
148A - Insomnia cure
1650A - Deletions of Two Adjacent Letters
1512A - Spy Detected
282A - Bit++
69A - Young Physicist
1651A - Playoff
734A - Anton and Danik
1300B - Assigning to Classes
1647A - Madoka and Math Dad
710A - King Moves
1131A - Sea Battle