source_code stringlengths 26 62k | lang_cluster stringclasses 11
values | src_uid stringlengths 32 32 | code_uid stringlengths 32 32 | difficulty int32 -1 3.5k ⌀ | exec_outcome stringclasses 1
value |
|---|---|---|---|---|---|
//#pragma GCC optimize("O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,abm,mmx,avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
//#include <bits/extc++... | C++ | 00574088a9a1d89c9d4c49c2bc8dc059 | 8defdbaab7d4fee06a61eb70f92a5c63 | 3,300 | PASSED |
//#pragma GCC optimize("O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,abm,mmx,avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
//#include <bits/extc++... | C++ | 00574088a9a1d89c9d4c49c2bc8dc059 | 6995fc3475d70fa56d0828ce76fd2740 | 3,300 | PASSED |
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); ++i)
#define R(i, j, k) for(int i = (j); i >= (k); --i)
#define ll long long
#define sz(a) ... | C++ | 00574088a9a1d89c9d4c49c2bc8dc059 | 1f32d7b1c1a546ec1cb3e1616429bd90 | 3,300 | PASSED |
//Let's join Kaede Takagaki Fan Club !!
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cassert>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
... | C++ | 00574088a9a1d89c9d4c49c2bc8dc059 | 1adaae854d32d07f9274c320f2e96d29 | 3,300 | PASSED |
//Let's join Kaede Takagaki Fan Club !!
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cassert>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
... | C++ | 00574088a9a1d89c9d4c49c2bc8dc059 | cf8a6b6b4ba17d5e888b3a558dfd6902 | 3,300 | PASSED |
//Let's join Kaede Takagaki Fan Club !!
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cassert>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
... | C++ | 00574088a9a1d89c9d4c49c2bc8dc059 | 958f8db16693a93633bbfd913c09a077 | 3,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
using lint = long long;
using pi = pair<lint, lint>;
typedef pair<int,int> pii;
typedef long double ld;
typedef long long ll;
typedef pair<ld,int> pdi;
typedef pair<ld,ld> pdd;
const int INF ... | C++ | 5048644a3bcfd65514c1aeef49363fdd | b9dab3f35834c075e2d287940f889730 | 3,300 | PASSED |
#include <cmath>
#include <cassert>
#include <iostream>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <vector>
#include <string>
#include <climits>
#include <cstdlib>
#include <algorithm>
using namespace std;
using ll = long long;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const doubl... | C++ | 5048644a3bcfd65514c1aeef49363fdd | c3e8c59f66bb02fde3c35749d6de3bae | 3,300 | PASSED |
#include <cmath>
#include <cassert>
#include <iostream>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <vector>
#include <string>
#include <climits>
#include <cstdlib>
#include <algorithm>
using namespace std;
using ll = long long;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const doubl... | C++ | 5048644a3bcfd65514c1aeef49363fdd | 21e25b1c3ca16b876ac2a01901dbe7a1 | 3,300 | PASSED |
#include<iostream>
#include<iomanip>
#include<vector>
#include<cmath>
#include<queue>
#include<algorithm>
#define ep emplace
#define eb emplace_back
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,i... | C++ | 5048644a3bcfd65514c1aeef49363fdd | dc47f63e73575a5e102fdff0e6d9cf0c | 3,300 | PASSED |
#include <bits/stdc++.h>
#define trace(x) cout << #x <<" = " << x << endl
#define _ << " " <<
#define sz(a) int((a).size())
#define x first
#define y second
using namespace std;
typedef long long ll;
typedef double db;
const int N = 3e5 + 10, M = 5;
int t, q, arr[M], c[M];
db p[M], sumc[N], a[N];
db sqsum =... | C++ | 5048644a3bcfd65514c1aeef49363fdd | 9eede56d419515854698cde13dc5b2c0 | 3,300 | PASSED |
#include <bits/stdc++.h>
#define trace(x) cout << #x <<" = " << x << endl
#define _ << " " <<
#define sz(a) int((a).size())
#define x first
#define y second
using namespace std;
typedef long long ll;
typedef double db;
const int N = 3e5 + 10, M = 5;
int t, q, arr[M], c[M];
db p[M], sumc[N], a[N];
db sqsum =... | C++ | 5048644a3bcfd65514c1aeef49363fdd | 293a28e26c2731d1bee5c840cd378224 | 3,300 | PASSED |
#include <iostream>
#include <tuple>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
const int N=3e5+10,M=5;
int t,q,arr[M],c[M];
double p[M],sumc[N],a[N];
double sqsum=0,nowc=0,suma=0,sumans=0,sump=0;
int tot=0;
tuple<double,double,double,double,double,double> cur[N*2];
vector<... | C++ | 5048644a3bcfd65514c1aeef49363fdd | 1234b71dc8ea598524ac969f75dbe685 | 3,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0), cin.tie(0);
int t, q;
cin >> t >> q;
double sum_p = 0, sum_inc = 0;
vector<array<double, 6>> ev;
while (t--) {
int n;
cin >> n;
vector<double> c(n), p(n);
for (auto &... | C++ | 5048644a3bcfd65514c1aeef49363fdd | a1026e9b65107540af715ad03e7190ac | 3,300 | PASSED |
#include <bits/stdc++.h>
#define trace(x) cout << #x <<" = " << x << endl
#define _ << " " <<
#define sz(a) int((a).size())
#define x first
#define y second
using namespace std;
typedef long long ll;
typedef double db;
const int N = 3e5 + 10, M = 5;
int t, q, arr[M], c[M];
db p[M], sumc[N], a[N];
db sqsum =... | C++ | 5048644a3bcfd65514c1aeef49363fdd | 1eea13313f12a55963ba1cc85cb294e5 | 3,300 | PASSED |
#include <iostream>
#include <tuple>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
const int N=3e5+10,M=5;
int t,q,arr[M],c[M];
double p[M],sumc[N],a[N];
double sqsum=0,nowc=0,suma=0,sumans=0,sump=0;
int tot=0;
tuple<double,double,double,double,double,double> cur[N*2];
vector<... | C++ | 5048644a3bcfd65514c1aeef49363fdd | a96ddf06ed9f282be6773d260c3920fe | 3,300 | PASSED |
#include "bits/stdc++.h"
using namespace std;
#define mx (int)(1<<16)+5
#define in :
vector<int> adj[mx];
vector<int> col[17];
vector<int> pos[17];
vector<int> range(int x) {
vector<int> res(x);
for (int i = 0; i < x; i++)
res[i] = i;
return res;
}
void addedge(int a, int b) {
adj[a].push_back(b... | C++ | 4c9c50f9ebe06a3e86c20aee2a0ee797 | 14ed2051d889edd08ea2bd8edd16ae5d | 2,700 | PASSED |
/*
* File created on 07/10/2022 at 18:59:16.
* Link to problem:
* Description:
* Time complexity: O()
* Space complexity: O()
* Status: ---
* Copyright: Ⓒ 2022 Francois Vogel
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namesp... | C++ | 4c9c50f9ebe06a3e86c20aee2a0ee797 | e86da94d7dedf4556e49884a2ffcdbdc | 2,700 | PASSED |
#include<bits/stdc++.h>
#define f first
#define s second
//#define int long long
#define pii pair<int,int>
using namespace std;
const int N = 2e5 + 5, mod = 1e9 + 7; // !
int t, vis[N], p[N];
vector<int> V[N];
main(){
ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
#define endl "\n"
int... | C++ | 4c9c50f9ebe06a3e86c20aee2a0ee797 | 49d4b8fe30f256d5058f9e26b27c064b | 2,700 | PASSED |
#include<bits/stdc++.h>
#define f first
#define s second
#define int long long
#define pii pair<int,int>
using namespace std;
const int N = 2e5 + 5, mod = 1e9 + 7; // !
int t, vis[N], p[N];
vector<int> V[N];
main(){
int t;
cin >> t;
while(t--) {
int n;
cin >> n;
for(in... | C++ | 4c9c50f9ebe06a3e86c20aee2a0ee797 | 1be1cf5357a78e4efb4fa2bbf90c17d6 | 2,700 | PASSED |
// LUOGU_RID: 93840678
#include<cstdio>
#include<vector>
#include<queue>
std::queue<int> q;
std::vector<int> a[70005];
int t,n,vis[70005],w[70005],dep[70005],tp[70005];
void add(int x,int y){a[x].push_back(y);a[y].push_back(x);}
void bfs(int s)
{
std::queue<int> q;
q.push(s);vis[s]=1;dep[s]=1;
while (!q.e... | C++ | 4c9c50f9ebe06a3e86c20aee2a0ee797 | ca7ea356f35d2da32928c8988f61f1ca | 2,700 | PASSED |
#include "bits/stdc++.h"
using namespace std;
#define all(x) begin(x),end(x)
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>... | C++ | 4c9c50f9ebe06a3e86c20aee2a0ee797 | 544f7f1254d5bb10db9f2757179f577b | 2,700 | PASSED |
// Assume that anything bigger than a square cannot be coloured
#include <bits/stdc++.h>
using namespace std;
int n;
int m;
vector<int> g[1 << 16];
vector<int> cross_edge[1 << 16];
int a[1 << 16];
int b[1 << 16];
int done[1 << 16];
int cnt;
queue<int> q;
int bfs(int u, int* dist) {
cnt++;
dist[u... | C++ | 4c9c50f9ebe06a3e86c20aee2a0ee797 | 4e103b5e2eddca1affdd1d77420d771a | 2,700 | PASSED |
// LUOGU_RID: 93089325
#include<bits/stdc++.h>
using namespace std;
namespace Solve{
typedef long long ll;
const int N=17;
int n;
vector<int>v[1<<N];
int a[1<<N],b[1<<N],mt[1<<N];
int st[1<<N],ind,d[1<<N];
void solve(int now){
if(now==0)return;
queue<pair<int,int>>q;
for(int i=0;i<(1<<n);i++)
... | C++ | 4c9c50f9ebe06a3e86c20aee2a0ee797 | 32a011a33b5a70c45fe6079992839233 | 2,700 | PASSED |
#include<bits/stdc++.h>
using namespace std;
namespace Solve{
typedef long long ll;
const int N=17;
int n;
vector<int>v[1<<N];
int a[1<<N],b[1<<N],mt[1<<N];
int st[1<<N],ind,d[1<<N];
void solve(int now){
if(now==0)return;
queue<pair<int,int>>q;
for(int i=0;i<(1<<n);i++)
if(st[i]){
for(... | C++ | 4c9c50f9ebe06a3e86c20aee2a0ee797 | f8154db78d4dfe113232ec59e92db9d2 | 2,700 | PASSED |
#pragma GCC optimize("O3")
#pragma GCC target("popcnt")
#include <bits/stdc++.h>
using namespace std;
#ifdef WAIMAI
#define debug(HEHE...) cout<<"["<<#HEHE<<"] = ",dout(HEHE)
void dout(){cerr<<endl;}
template<typename T,typename...U>
void dout(T t,U...u){cerr<<t<<(sizeof...(u)?", ":""),dout(u...);}
#else
#d... | C++ | 4c9c50f9ebe06a3e86c20aee2a0ee797 | 03e7161324a549362ebee745f967c5cc | 2,700 | PASSED |
#include <bits/stdc++.h>
#define ll long long int
#define vec vector
#define str string
#define pb push_back
#define kick(x) cout << x << "\n";
#define loop(i, a, b) for (int i = a; i < b; i++)
#define loope(i, a, b) for (int i = a; i <= b; i++)
#define loopr(i, a, b) for (int i = a; i >= b; i--)
using namespace std;
... | C++ | 994a9cb52cf0fdab72be068eab1b27ef | 89e808e61e61b5512e50d99cd2e68da1 | 900 | PASSED |
#include <iostream>
using namespace std;
int main()
{
int tc;
cin>>tc;
while(tc--)
{
long long int a,b;
cin>>a>>b;
cout<<abs(a - b)<<" ";
if(a==b)
{
cout<<0<<endl;
}
else
{
cout<<min(a%abs(a ... | C++ | 994a9cb52cf0fdab72be068eab1b27ef | 88c3f6f93fe01febbf3972bfab5dfec0 | 900 | PASSED |
#include<bits/stdc++.h>
#define FOR(i,n) for(int i=0;i<n;i++)
#define FOR1(i,n) for(int i=1;i<=n;i++)
#define MAXN 10000000
#define ll long long int
#define all(c) (c).begin(),(c).end()
#define srt(c) sort(all(c))
#define srtrev(c) sort(all(c... | C++ | 994a9cb52cf0fdab72be068eab1b27ef | ad09cd7b44b794c49352eae0c530a0f9 | 900 | PASSED |
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <complex>
#include <queue>
#include <set>
#include <unordered_set>
#include <list>
#include <chrono>
#include <random>
#include <iostream>
#inc... | C++ | 994a9cb52cf0fdab72be068eab1b27ef | 78adfa9a5e907e2c7b49460d7822699b | 900 | PASSED |
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
int main()
{
ll t;
cin>>t;
while(t--)
{
ll a,b;
cin>>a>>b;
ll mx=max(a,b);
ll mn=min(a,b);
ll ans=mx-mn;
if(a==b){
cout<<0<<" "<<0<<endl;
continue;
}
... | C++ | 994a9cb52cf0fdab72be068eab1b27ef | 34e8bb1565a17ce1bf30497b4f27c913 | 900 | PASSED |
#include<iostream>
#include <algorithm>
#include <cstdlib>
#define ll long long
using namespace std;
ll t, a, b;
int main() {
cin >> t;
while(t--) {
cin >> a >> b;
if(a == b) {
cout << "0 0" << endl;
continue;
}
ll x = abs(a - b);
ll y = min(a % ... | C++ | 994a9cb52cf0fdab72be068eab1b27ef | 1ccc2504dee26107271969c07a805b51 | 900 | PASSED |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<map>
#include<algorithm>
#define LL long long
using namespace std ;
//bool vis[200005] ;
//map<int,bool> m[400005] ;
inline long long abss(long long x) { return x>0?x:-x ; }
int main()
{
int t,n,q,k ; int a[100105] ;
scanf("%d",&t) ;
/*LL sum[100105] ;
... | C++ | 994a9cb52cf0fdab72be068eab1b27ef | f1e0d9cb0253ca0a34ef631341cb79e7 | 900 | PASSED |
#include <bits/stdc++.h>
#define zovs ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define ll long long
using namespace std;
/*int C(int n, int k) //nCk //cancelled with (n-k)!
{
// 6*5*4* (3*2*1)
double res = 1; //6c3=---------... | C++ | 994a9cb52cf0fdab72be068eab1b27ef | 9adb408ee21779ca97d84f7538422d58 | 900 | PASSED |
#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
const int MAX = 1e4 + 5;
typedef long long LL;
LL gcd(LL a, LL b) {
return b == 0 ? a : gcd(b, a % b);
}
int main() {
int n;
LL x, y;
cin >> n;
while(n--) {
cin >> x >> y;
if (x < y) {
swap(x, y);
}
if (x == y) {
cout << "0 0... | C++ | 994a9cb52cf0fdab72be068eab1b27ef | f5960735e9ffcb9936f4fa9678c20840 | 900 | PASSED |
#include <iostream>
using namespace std;
int main()
{
long long int n,a,b,i,m;
cin>>n;
for (i=1;i<=n;i++){
cin>>a>>b;
if (a>b){m=a;a=b;b=m;}
if(a==b){cout<<0<<' '<<0<<endl;}
else {
if (a%(b-a)>=(b-a)-a%(b-a)){m=(b-a)-a%(b-a);}
else {m=a%(b-a);}
cout<<b-a<<' '<<m<<endl;}
}
return 0;
}
| C++ | 994a9cb52cf0fdab72be068eab1b27ef | 766d49d422109a20021fa021d054b059 | 900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define lld long double
#define endl '\n';
const int MAX = 1e3 + 5;
lld ans;
lld v;
const lld small = 1e-10;
void _o_o_(int steps,lld c,lld m,lld p,lld prev){
//Take M
lld ev = (lld)(p*prev)*(lld)steps;
if(ev<small){
return;
}
ans ... | C++ | 738939f55bcc636c0340838818381d2f | 104cd323d7e47731251b34d6f07108cd | 1,900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define lld long double
#define endl '\n';
const int MAX = 1e3 + 5;
lld ans;
lld v;
const lld small = 1e-13;
void _o_o_(int steps,lld c,lld m,lld p,lld prev){
//Take M
lld ev = (lld)(p*prev)*(lld)steps;
if(ev<small){
return;
}
ans ... | C++ | 738939f55bcc636c0340838818381d2f | a45d97b149e072144db660c15227d577 | 1,900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define lld long double
#define endl '\n';
const int MAX = 1e3 + 5;
lld ans;
lld v;
const lld small = 1e-12;
void _o_o_(int steps,lld c,lld m,lld p,lld prev){
//Take M
lld ev = (lld)(p*prev)*(lld)steps;
if(ev<small){
return;
}
ans ... | C++ | 738939f55bcc636c0340838818381d2f | 180fd704d560f5e50431423cc2fc9cae | 1,900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define lld long double
#define endl '\n';
const int MAX = 1e3 + 5;
lld ans;
lld v;
const double small = 1e-7;
const long double verysmall = 1e-12;
void _o_o_(int steps,lld c,lld m,lld p,lld prev){
//Take M
lld ev = (lld)(p*prev)*(lld)steps;
ans += ... | C++ | 738939f55bcc636c0340838818381d2f | b7d88af214f7d22e8719b8bdf6373d3a | 1,900 | PASSED |
//Awwawa! Dis cold yis ratten buy Pikachu!
#pragma GCC optimize("-funsafe-loop-optimizations")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-fwhole-program")
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-falign-functions")
#pragma G... | C++ | 738939f55bcc636c0340838818381d2f | 2a0e818c2cc37884e56db0f0f7b7fdb6 | 1,900 | PASSED |
//Awwawa! Dis cold yis ratten buy Pikachu!
#pragma GCC optimize("-funsafe-loop-optimizations")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-fwhole-program")
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-falign-functions")
#pragma G... | C++ | 738939f55bcc636c0340838818381d2f | 2384a77f99312a21e2ed630a6313b129 | 1,900 | PASSED |
//Awwawa! Dis cold yis ratten buy Pikachu!
#pragma GCC optimize("-funsafe-loop-optimizations")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-fwhole-program")
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-falign-functions")
#pragma G... | C++ | 738939f55bcc636c0340838818381d2f | f155aee69bd7efa5e3d11cb6f4889228 | 1,900 | PASSED |
/*Awwawa! Dis cold yis ratten buy Pikachu!
#pragma GCC optimize("-funsafe-loop-optimizations")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-fwhole-program")
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-falign-functions")
#pragma G... | C++ | 738939f55bcc636c0340838818381d2f | c473791c0a8e2e993b2be53a5077969f | 1,900 | PASSED |
//Awwawa! Dis cold yis ratten buy Pikachu!
#pragma GCC optimize("-funsafe-loop-optimizations")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-fwhole-program")
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-falign-functions")
#pragma G... | C++ | 738939f55bcc636c0340838818381d2f | dcbcc83cb75539061bb0cac80bb205a9 | 1,900 | PASSED |
//#include<cstdio>
//#include<iostream>
//#include<algorithm>
//#include<iomanip>
#include<bits/stdc++.h>
using namespace std;
#define eps 1e-8
void solve();
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(12);
int t;
cin >> t;
while (t--){
solve();
... | C++ | 738939f55bcc636c0340838818381d2f | b0072f0f9cb1179e7c5e907bb72cab1b | 1,900 | PASSED |
import java.util.Scanner;
import java.util.Arrays;
public class scratch{
public static void main(String[] args){
Scanner scan = new Scanner(System.in);
int testCases = scan.nextInt();
while(testCases>0){
int numberOfTracks = scan.nextInt();
long sumOfCars = 0;
... | Java | 935bceb69117d06eb75121c805bff69c | df250b75abf712cfd2f2e2134ccdb352 | 900 | PASSED |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Random;
import java.util.Stack;
impor... | Java | 935bceb69117d06eb75121c805bff69c | c8cb6b3e4b2f162f410cd0f79e6afb94 | 900 | PASSED |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class CF1543B {
// https://codeforces.com/problemset/problem/1543/B
static class FastReader {
BufferedReader br;
StringTokenizer st;
public... | Java | 935bceb69117d06eb75121c805bff69c | 467c010b6e8acb6f816483a0fca60a0d | 900 | PASSED |
import java.io.*;
//import java.util.*;
public class CustomisingTheTrack {
public static void main(String[] args) throws Exception {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int t = Integer.parseInt(br.readLine());
while (t-- > 0) {
int n... | Java | 935bceb69117d06eb75121c805bff69c | 3e4dae8b1df39000f9b8a26c56b68861 | 900 | PASSED |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int t = sc.nextInt();
for (int i = 1; i <= t; i++) {
int n = sc.nextInt();
long count = 0;
for (int j = 0; j < n; j++)... | Java | 935bceb69117d06eb75121c805bff69c | e1084f690a358ef147af40ca2680a81d | 900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
// long get_incov(vector<ll> a){
// long c=0;
// for (ll i = 0; i < a.size(); ++i) {
// for (ll j = i+1; j < a.size(); ++j) {
// c+= abs(a[i]-a[j]);
// }
// }
// return c;
// }
int main() {
... | C++ | 935bceb69117d06eb75121c805bff69c | 5f27fb63faa249176ce08da6e3dad54a | 900 | PASSED |
//:::: Alien :::://
// Muhammad Eid //
#include <bits/stdc++.h>
using namespace std;
void Alien35() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
#ifndef ONLINE_JUDGE
freopen("test.in", "rt", stdin);
freopen("test.out", "wt", stdout);
#endif
}
const int N = 1e6 + 5, OO ... | C++ | 935bceb69117d06eb75121c805bff69c | efa38adbe53bc9e2be8750220609c105 | 900 | PASSED |
#include <iostream>
#include <deque>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <cmath>
#include <set>
#include <map>
#include <cstdio>
#include <fstream>
#include <algorithm>
#include <iomanip>
#include <cctype>
#include <limits>
using namespace std;
int main() {
ios_base::sy... | C++ | 935bceb69117d06eb75121c805bff69c | 09522716fb89c429f5f6d5d1bfdc844c | 900 | PASSED |
// Problem: B. Customising the Track
// Contest: Codeforces - Codeforces Round #730 (Div. 2)
// URL: https://codeforces.com/contest/1543/problem/B
// Memory Limit: 256 MB
// Time Limit: 1000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include <bits/stdc++.h>
using namespace std;
#define int long long
#de... | C++ | 935bceb69117d06eb75121c805bff69c | df96bc857d766854db37f4c763cca88a | 900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
struct edge
{
int from;
int to;
int cost;
};
typedef long long ll;
typedef long double ld;
typedef vector<vector<int>> GRAPH;
typedef map<int, vector<int>> MG;
typedef vector<vector<edge>> GRAPH_COST;
#define fast_ios \
ios::sync_with_stdio... | C++ | 935bceb69117d06eb75121c805bff69c | 235f513e2874478338585b8bffcd25d6 | 900 | PASSED |
for _ in range(int(input())):
n,k=map(int,input().split())
for i in range(n):
if(i==0):
print(0)
else:
print(i^(i-1))
if(int(input())==1):
break
| Python | ec77fc5674681d20bbaf9d903134b015 | d7a7709284fda0f4899505a4eeb8b743 | 1,700 | PASSED |
import math
import sys
from functools import reduce
import decimal
sys.setrecursionlimit(10 ** 9)
decimal.getcontext().rounding = decimal.ROUND_HALF_UP
def rounding(n):
return int(decimal.Decimal(f'{n}').to_integral_value())
def factors(n):
return set(reduce(list.__add__,
... | Python | ec77fc5674681d20bbaf9d903134b015 | fb8a50b2c8af27293e6f5168e03c7be6 | 1,700 | PASSED |
import sys,os.path
import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self... | Python | ec77fc5674681d20bbaf9d903134b015 | 76e8056ff90bcf72f6d0c7fefe79f68d | 1,700 | PASSED |
import sys,os.path
if __name__ == '__main__':
for _ in range(int(input())):
n,k = map(int,input().split())
for i in range(n):
if i==0:
print(f"0",flush = True)
a = int(input())
if a==1:
break
else:
... | Python | ec77fc5674681d20bbaf9d903134b015 | abe3939aaf1b835b9a86b7ed3171e15e | 1,700 | PASSED |
def cf_730D1(n: int, k: int):
print(0)
if int(input()):
return
for i in range(1, n):
currQ = i ^ (i - 1)
print(currQ)
r = int(input())
if r == 1:
break
elif r == -1:
exit()
if __name... | Python | ec77fc5674681d20bbaf9d903134b015 | 5edbe3241c31c6cb0a25765df656d1f9 | 1,700 | PASSED |
from sys import stdout
def cf_730D1(n: int, k: int):
print(0)
stdout.flush()
if int(input()):
return
for i in range(1, n):
currQ = i ^ (i - 1)
print(currQ)
stdout.flush()
r = int(input())
if r == 1:
break
elif r == ... | Python | ec77fc5674681d20bbaf9d903134b015 | be8adeed754c17b000f36e8685e70423 | 1,700 | PASSED |
from collections import defaultdict
for _ in range(int(input())):
n,k = map(int,input().split())
print(0)
r = int(input())
if r==1:
continue
for i in range(1,n):
print(i^(i-1))
r = int(input())
if r==1:
break
| Python | ec77fc5674681d20bbaf9d903134b015 | 376a8db5a02d4471d2d834b220fc5235 | 1,700 | PASSED |
from collections import defaultdict
for _ in range(int(input())):
n,k = map(int,input().split())
print(0)
r = int(input())
if r==1:
continue
for i in range(1,n):
print(i^(i-1))
r = int(input())
if r==1:
break
elif r==-1:
... | Python | ec77fc5674681d20bbaf9d903134b015 | 55d48eecf65bc827a56e102283123840 | 1,700 | PASSED |
from sys import stdout
for _ in range(int(input())):
n,k = map(int,input().split())
curr = 0
prev = 0
while True:
print(curr^prev)
stdout.flush()
z = int(input())
if z == 1:
break;
else:
prev = curr
... | Python | ec77fc5674681d20bbaf9d903134b015 | ce93779c9e8fe1d41ef68333df3694f3 | 1,700 | PASSED |
"""
from sys import stdin, stdout
import math
from functools import reduce
import statistics
import numpy as np
import itertools
import operator
from sys import stdin, stdout
import math
from functools import reduce
import statistics
import numpy as np
import itertools
import sys
import operator
from co... | Python | ec77fc5674681d20bbaf9d903134b015 | 9440639a3849ca5eee21de599d909628 | 1,700 | PASSED |
#include <bits/stdc++.h>
#include <chrono>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define pii pair<int,int>
// Macros
#define int long long
#define ll long long
#define ld long double
#define vt vector
#define vi vector<int>
#define vii ve... | C++ | 7a9b559eb3b601590e22eb128f2bf307 | a6ce9e6984da401479a00bdabd44e894 | 2,200 | PASSED |
#include <bits/stdc++.h>
#include <chrono>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define pii pair<int,int>
// Macros
#define int long long
#define ll long long
#define ld long double
#define vt vector
#define vi vector<int>
#define vii ve... | C++ | 7a9b559eb3b601590e22eb128f2bf307 | 60dd54cf92927a4363033e312c3adcb2 | 2,200 | PASSED |
#include <bits/stdc++.h>
#include <chrono>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define pii pair<int,int>
// Macros
#define int long long
#define ll long long
#define ld long double
#define vt vector
#define vi vector<int>
#define vii ve... | C++ | 7a9b559eb3b601590e22eb128f2bf307 | 05bf1a00986ae5d38c60ba55b26adc5e | 2,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define dbg(x...) \
do { \
cout << #x << " -> ";\
err(x); \
} while (0)
void err() {
cout << endl;
}
template <class T, class... Ts>
void err(const T& arg, const... | C++ | 7a9b559eb3b601590e22eb128f2bf307 | 0b079614eec28c674e5e16516be3d9a4 | 2,200 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define int ll
#define sz(x) int((x).size())
#define all(x) (x).begin(),(x).end()
using ll = long long;
using pi = pair<int,int>;
const int inf = 0x3f3f3f3f3f3f3f3f;
const int minf = 0xc0c0c0c0c0c0c0c0;
void make_base(int n, int base, vector<int> &ret) {
re... | C++ | 7a9b559eb3b601590e22eb128f2bf307 | 78952569ab88b16d930f580569d8c57f | 2,200 | PASSED |
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define int long long
#define up(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define down(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
using namespace std;
int n, m, k;
int read()
{
int s = 0, f = 1;
char ch = getchar();
w... | C++ | 7a9b559eb3b601590e22eb128f2bf307 | b61bf82851a4f98f9d829414ecc4dd08 | 2,200 | PASSED |
/**
* author : GDA
* created : 11/02/2021
*
**/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> //required
#include <ext/pb_ds/tree_policy.hpp> //required
#define pb push_back
#define pf push_front
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define dist... | C++ | 7a9b559eb3b601590e22eb128f2bf307 | e7bcf74b078a04db29b87d6908737f21 | 2,200 | PASSED |
// Cookie197
//#pragma GCC optimize("O4,unroint-loops,no-stack-protector")
#include<iostream>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<string>
#include<iomanip>
#include<math.h>
using namespace std;
#define no_tle_please ios::sync_with_stdio(... | C++ | 7a9b559eb3b601590e22eb128f2bf307 | 566167111dfb55040acc2075183c7b09 | 2,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int add(int i, int j, int k) {
return !i && !j ? 0 : add(i / k, j / k, k) * k + (i + j) % k;
}
int sub(int i, int j, int k) {
return !i && !j ? 0 : sub(i / k, j / k, k) * k + ((i - j) % k + k) % k;
}
void solve() {
int n, k;
scanf("%d%d", &n, &k);
for (i... | C++ | 7a9b559eb3b601590e22eb128f2bf307 | 7413a7c702fb92f400fed0a09158f9f5 | 2,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
vector<int> get(int x, int k) {
vector<int> d;
while (x > 0) d.push_back(x % k), x /= k;
return d;
}
int getxor(const vector<int>& a, const vector<int>& b, int k) {
int ans = 0, base = 1, n = (int) a.size(), m = (int) b.size();
for (int i = 0, aa, bb; i < (i... | C++ | 7a9b559eb3b601590e22eb128f2bf307 | 7277a36ed48c9f33db298aa7ef42a28b | 2,200 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define dbg(a) cout<<(#a)<<'='<<a<<"\n";
#define int long long
#define itn long long
#define zoom ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
const int N=1e5+10,mod=1e9+7;
int a[N],n,m;
int maxx;
struct TreeList {
int tr[N];
inline int lowbit(i... | C++ | 99c5e62d8e51e61cfd0c2531a231e7a8 | 86ddd863a5d93389d3b711bbb6789fb6 | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define dbg(a) cout<<(#a)<<'='<<a<<"\n";
#define int long long
#define itn long long
#define zoom ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
const int N=1e5+10,mod=1e9+7;
int a[N],n,m;
int maxx;
struct TreeList {
int tr[N];
inline int lowbit(int x){... | C++ | 99c5e62d8e51e61cfd0c2531a231e7a8 | 62b3622a8239ec4ec9e019a017c3c339 | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define dbg(a) cout<<(#a)<<'='<<a<<"\n";
#define int long long
#define itn long long
#define zoom ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
const int N=1e5+10,mod=1e9+7;
int a[N],n,m;
int maxx;
struct TreeList {
int tr[N];
inline int lowbit(int x){... | C++ | 99c5e62d8e51e61cfd0c2531a231e7a8 | 99e1172aa3dcbf7bcf0f1b1a183f50ea | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define dbg(a) cout<<(#a)<<'='<<a<<"\n";
#define int long long
#define itn long long
#define zoom ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
const int N=90010,mod=1e9+7;
int a[N],n,m;
int maxx;
struct TreeList {
int tr[N];
inline int lowbit(int x){r... | C++ | 99c5e62d8e51e61cfd0c2531a231e7a8 | b2c2248d1615ca6ff03b26be285849ca | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define dbg(a) cout<<(#a)<<'='<<a<<"\n";
#define int long long
#define itn long long
#define zoom ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
const int N=90010,mod=1e9+7;
int a[N],n,m;
int maxx;
struct TreeList {
int tr[N];
inline int lowbit(int x){r... | C++ | 99c5e62d8e51e61cfd0c2531a231e7a8 | 271e7ed1e987b9c3d03dbbbecf609392 | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define dbg(a) cout<<(#a)<<'='<<a<<"\n";
#define int long long
#define itn long long
#define zoom ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
const int N=90010,mod=1e9+7;
int a[N],n,m;
int maxx;
struct TreeList {
int tr[N];
inline int lowbit(int x){r... | C++ | 99c5e62d8e51e61cfd0c2531a231e7a8 | ff01da4b032c3a5398a7d443f8d6f579 | 1,600 | PASSED |
#include<iostream>
#include<cstdio>
#include<map>
#include<cstring>
#include<algorithm>
using namespace std;
map<int,int> mp;
struct node {
int elem,id;
bool operator<(const node b) const {
return this->elem<b.elem;
}
}a[100005],b[100005];
int cnt,n,m;
struct TreeList {
int tr[9... | C++ | 99c5e62d8e51e61cfd0c2531a231e7a8 | 0f4bb746ffd31efa94325962af15f045 | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define F first
#define S second
#define sz(x) int((x).size())
#define debug(x) cerr << #x << " = " << (x) << "\n";
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define rep(i,a,b) for (int i = (a); i < (b); ... | C++ | 99c5e62d8e51e61cfd0c2531a231e7a8 | 33297e16d70b25fa28838056fd4eb4e4 | 1,600 | PASSED |
#include<bits/stdc++.h>
#include<random>
using namespace std;
using ull = unsigned long long;
#define fi first
#define se second
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
// #define readInputFile freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
#define pb ... | C++ | 99c5e62d8e51e61cfd0c2531a231e7a8 | 184a91235cbad274d00d350b68767ecc | 1,600 | PASSED |
#include<bits/stdc++.h>
#include<random>
using namespace std;
using ull = unsigned long long;
#define fi first
#define se second
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
// #define readInputFile freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
#define pb ... | C++ | 99c5e62d8e51e61cfd0c2531a231e7a8 | bc0a95664b1ea7c879309c7bde374d21 | 1,600 | PASSED |
#include <iostream>
const int maxn=1e5+5;
using namespace std;
char a[maxn],b[maxn];
int main(){
int t,n,sum,u,v;
scanf("%d",&t);
while(t--){
sum=0;
scanf("%d",&n);
scanf("%s",&a);
scanf("%s",&b);
for(int i=0;i<n;i++){
if(a[i]!=b[i])
sum+=2;
else{
if(a[i]=='1'&&b[i]=='1')
if(a[i+1]... | C++ | 6c4445ee23fedcb913ed3de1beacc099 | 11b7180bcb083fa714394530468f56a7 | 1,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;scanf("%d",&t);
while (t--) {
int n;
string a,b;
cin>>n>>a>>b;
a[n]='.';
b[n]='.';
int sum=0,i=0;
while(true){
if((a[i]=='1'&&a[i+1]=='0'&&b[i]=='1'&&b[i+1]=='0')||(a[i]=='0'&&a[i+1]=='1'&&b[i]=='0'&&b[i+1]=='1')){
i+=2;
sum+=2;... | C++ | 6c4445ee23fedcb913ed3de1beacc099 | bb51482705e48b48527e2b10557ce4c2 | 1,000 | PASSED |
#include <iostream>
#include <string>
#include <math.h>
#include <stack>
#include <set>
#include <ctime>
#include <vector>
#include <string.h>
#include <queue>
#include <sstream>
#include <algorithm>
#include <bitset>
#include <map>
#include <iomanip>
#define FOR(i, a, b) for (ll (i) = (a); (i) <= (b); (i)++)
#define R... | C++ | 6c4445ee23fedcb913ed3de1beacc099 | 11764f3ee3f1362170dc3708fe63434a | 1,000 | PASSED |
#include <bits/stdc++.h>
#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
#define ll long long
int main()
{
int t;
char c[150000];
char c1[150000];
cin >> t;
getchar();
while(t--){
int n;
cin >> n;
cin >> c;
cin >> c1;
int a... | C++ | 6c4445ee23fedcb913ed3de1beacc099 | 5c52d64b07c443a0298fe322852bbaff | 1,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int t[100005];
int main(){
int n,m,k,p,s;
int a,b;
char c;
cin>>p;
while(p--){
cin>>n;
for(int i=0;i<n;i++){
cin>>c;
t[i]=0;t[i]=c-'0';}
for(int i=0;i<n;i++){
cin>>c;
t[i]+=c-'0';}
s=0;a=0;b=0;
for(int i=0;i<n;i++){... | C++ | 6c4445ee23fedcb913ed3de1beacc099 | 62a2c99efeb2711286a5e55a22c2ac00 | 1,000 | PASSED |
//E-M-M-I-N-T-Y\\
#include <bits/stdc++.h>
#include <unordered_map>
using namespace std;
#define _USE_MATH_DEFINES
#define FastIO ios_base::sync_with_stdio(false); cin.tie(0);
int t, n, ans;
string str[2];
int main() {
FastIO
/*#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
freopen("ou... | C++ | 6c4445ee23fedcb913ed3de1beacc099 | 74409cf2897da5b5637cd5c58dba4f0d | 1,000 | PASSED |
#include <iostream>
#include <math.h>
#include <algorithm>
#include <stdio.h>
#include <string.h>
#include <queue>
#include <map>
#define rep(i,a,b) for(int i=a;i<=b;++i)
#define reps(i,a,b) for(int i=a;i<b;++i)
#define inf 0x3f3f3f3f
#define ull unsigned long long
#define sz(a) (int)a.size()
#define pi acos(-1.0)
#def... | C++ | 6c4445ee23fedcb913ed3de1beacc099 | e78c2bf28b1849ad9aa2638bca7e71b5 | 1,000 | PASSED |
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<vector>
#include<utility>
#define ll long long
#define endl "\n"
using namespace std;
const int maxn=100010;
const int inf=0x3f3f3f3;
int t;
char s1[maxn],s2[maxn];
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cin>>t;
... | C++ | 6c4445ee23fedcb913ed3de1beacc099 | e2cce60f503bf2da358c7841e8d1aee1 | 1,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int N=100005;
int n,a[N],b[N],f[N][5],c[5]={0,1,0,2};
char s[N],t[N];
inline void chmax(int &a,int b){if(a<b)a=b;}
void sol()
{
scanf("%d%s%s",&n,s+1,t+1);
for(int i=1;i<=n;i++)
a[i]=s[i]-'0',b[i]=t[i]-'0';
for(int i=0;i<=n+1;i++)
for(int j=0;j<4;j++)
f[i][j]... | C++ | 6c4445ee23fedcb913ed3de1beacc099 | 6e1c63be4afc1186ce5ee44e3ce1a6f0 | 1,000 | PASSED |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=2e5+9;
int T,n;
char a[N],b[N];
int f[N];
inline void init(){
int x=0,y=0,z=0;
if(a[1]=='0') x++;
else if(a[1]=='1') y++;
else z++;
if(b[1]=='0') x++;
else if(b[1]=='1') y++;
else z++;
if(!x) f[1]=0;
else if(!y) f[1]=1;
else f[1]=2;... | C++ | 6c4445ee23fedcb913ed3de1beacc099 | 3ce7fec355c36721b85dcc951aeea504 | 1,000 | PASSED |
t = int(input())
for _ in range(t):
n,s = map(int,input().split())
if n%2 != 0:
res = s//(n-(n//2))
else:
res = s//(n//2+1)
print(res)
| Python | 0a05b11307fbb2536f868acf4e81c1e2 | cd318d7b099065409e578b7411364314 | 800 | PASSED |
t = int(input())
for _ in range(t):
n,s = map(int,input().split())
if n%2 != 0:
res = s//(n-(n//2))
else:
res = s//(n//2+1)
print(res)
| Python | 0a05b11307fbb2536f868acf4e81c1e2 | e647a3191cd651f34e18495d14270a6b | 800 | PASSED |
def solve():
n,s = map(int,input().split())
a = (n//2)+1
print(s//a)
case = int(input())
for _ in range(case):
solve()
5 | Python | 0a05b11307fbb2536f868acf4e81c1e2 | 029ae0bef2d3a2994492b6983798272b | 800 | PASSED |
t = int(input())
for _ in range(t):
n, s = map(int, input().split())
l = 0
r = s + 1
while r - l > 1:
mid = (r + l) // 2
m = n // 2 + 1
if m * mid <= s:
l = mid
else:
r = mid
print(l)
| Python | 0a05b11307fbb2536f868acf4e81c1e2 | 94d61565230e43738cf073a0efc30ae0 | 800 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.