Competitive Programming Solutions pinned «#include <bits/stdc++.h> using namespace std; int main(){ long long t; cin>>t; for(int j=0;j<t;j++){ long long n,s,y; cin>>n>>s; y=s/((n/2)+1); cout<<y<<endl; } return 0; }»
Screenshot (6).png
158.5 KB
MEDIAN MAXIMIZATION OTHER SOLUTION
Competitive Programming Solutions
Message
MIN-MEX Cut Solution
Competitive Programming Solutions pinned «This message couldn't be displayed on your device due to copyright infringement.»
Competitive Programming Solutions
Message
SITTING ARRANGEMENT EASY
Competitive Programming Solutions
https://youtu.be/u8M9WumqKaY
MAX MEX SOLUTION
If you guys want any course for free then please send the name in the group I’m sending here