Example
input
8
1 5
2 5
3 5
2 1
7 17
4 14
1 1000000000
1000000000 1
output
5
2
2
0
4
4
1000000000
0
Note
Possible arrays for the first three test cases (in each array the median is underlined):
- In the first test case [5–][5_]
- In the second test case [2–,3][2_,3]
- In the third test case [1,2–,2][1,2_,2]
--------------------------------------------------------------------------------------------------------------------------
#include <iostream>
#include <sstream>
#include <vector>
#include <cstring>
#include <string>
#include <map>
#include <unordered_map>
#include <math.h>
#include <algorithm>
#include <stdio.h>
#include <windows.h>
#include <deque>
#include <unordered_set>
#include <stack>
using namespace std;
class Operater {
public:
static unsigned int call2(unsigned int n, unsigned int s);
};
unsigned int Operater::call2(unsigned int n, unsigned int s)
{
unsigned int mid = (n%2 == 0)? n/2 : n/2 + 1;
unsigned int total = n - mid + 1;
unsigned int mod = s % total;
cout<<s/total<<endl;
return 0;
}
int main() {
int test_loop = 0;
cin >> test_loop;
while (test_loop) {
unsigned int n,s;
cin>>n;
cin>>s;
Operater::call2(n,s);
test_loop--;
// cout << "=>" << n << s << endl;
}
return 0;
}