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 |
|---|---|---|---|---|---|
#include <bits/stdc++.h>
int main(){
int test;
std::cin >> test;
std::vector <std::vector <int>> resultados(test, std::vector <int>());
for(int i = 0; i <test ; i++){
int largo;
std::cin >> largo;
std::vector <int> b(largo);
std::vector <int> a(largo);
for(int j ... | C++ | 5481863fd03c37cdcb7d6ee40f973cb9 | e3068a75ccb46052214dad1f93384b9c | 1,900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main(){
int t;
cin>>t; //cant de casos de prueba (primer valor)
for(int i=0; i<t; i++){ //recorremos todas las pruebas
int n;
cin>>n; //tamaño de la permutación
vector <int> B(n); //permutación
for(int j=0; j<n; j++){ //... | C++ | 5481863fd03c37cdcb7d6ee40f973cb9 | 464843e6f369e90baed6002414409e47 | 1,900 | PASSED |
#include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>
#include <tuple>
using namespace std;
typedef pair<int, int> pi;
void display(vector<int> v, int n) {
for (int i = 0; i < n; ++i)
{
cout << v[i] << ' ';
}
cout << endl;
}
int main()
{
// #ifnde... | C++ | 5481863fd03c37cdcb7d6ee40f973cb9 | cbbe1b36b7a4bf6f75a65f437c1b5707 | 1,900 | PASSED |
#include <iostream>
#include <vector>
#include <bits/stdc++.h>
#include <queue>
using namespace std;
vector<vector<tuple<int, int>>> func_posib(vector<int> &posib); // Función
int main() {
// Iteracion sobre t casos
int t; cin >> t;
for(int ciclos = 0; ciclos < t; ciclos++){
// ... | C++ | 5481863fd03c37cdcb7d6ee40f973cb9 | 7c9c6c459919ac1b6a21f1a9fb8ce43f | 1,900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main(){
int t; cin >> t;
while(t--){
int n; cin>>n;
vector <pair <pair <int, int>, int>> v;
vector <int> perm(n);
for (int i= 0; i< n; i++){
int b; cin >> b;
int index = i + 1;
if (b!=0){
... | C++ | 5481863fd03c37cdcb7d6ee40f973cb9 | 2dfdb069967224a581c2f635cf9d637c | 1,900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main() {
//casos
int t;
cin >> t;
vector<int> casos(t);
for (int i=0; i<t; i++){
//tamaño
int n;
cin >> n;
vector<int> b;
int bi;
for (int j=0; j<n; j++){
cin >> bi;
b.push... | C++ | 5481863fd03c37cdcb7d6ee40f973cb9 | 2cdada9285138490d70d9d9040780342 | 1,900 | PASSED |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <string>
using namespace std;
int b[500005];
bool vis[500005];
struct node{
int l, r, pos;
}p[500005];
bool cmp(node x, node y){
if(x.r != y.r) return x.r < y.r;
return x.l < y.l;
}
signed main()
{
int T;
cin... | C++ | 5481863fd03c37cdcb7d6ee40f973cb9 | 2d11662923a441c0befc212801aebca5 | 1,900 | PASSED |
#include <bits/stdc++.h>
//#include "A.txt";
typedef long long ll;
typedef long double ld;
#define int long long
#define pb push_back
#define f first
#define s second
#define forr(a,b) for(int a = 0;a<=b;a++)
using namespace std;
struct elem{
ll l,r,ps;
};
bool cmd(elem a,elem b)
{
if( ... | C++ | 5481863fd03c37cdcb7d6ee40f973cb9 | 0bcaf039991c064ef949530e43ceaeb2 | 1,900 | PASSED |
#include <bits/stdc++.h>
//#include "A.txt";
typedef long long ll;
typedef long double ld;
#define int long long
#define pb push_back
#define f first
#define s second
#define forr(a,b) for(int a = 0;a<=b;a++)
using namespace std;
struct elem{
ll l,r,ps;
};
bool cmd(elem a,elem b)
{
if( ... | C++ | 5481863fd03c37cdcb7d6ee40f973cb9 | 2d08f30a70b8b70d4cbf77b6323e421f | 1,900 | PASSED |
#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef array<array<ll,3>,3>mat;
mat operator+(const mat&a,const mat&b){
mat c;
for(int i = 0; i < 3; i++)
for(int j = 0; j < 3; j++)
c[i][j] = 0;
for(int i=0;i<3;i++)c[0][i]=a[0][i]+b[0][i];
... | C++ | a4f03259518029b38d71ed4c41209677 | 7bd535e72e85c45e54bf7483e69b2744 | 2,500 | PASSED |
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2,sse3,sse4,sse4.1,sse4.2")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int NMAX=2e5;
bitset<NMAX+5>have;
bitset<NMAX+5>bs;
const int C=500;
int a[NMAX+5];
ll t1[NMAX+5],t2[NMAX+5]; // number of points, number of... | C++ | a4f03259518029b38d71ed4c41209677 | 90e66c2a24de7ea7f2f2737a2b91aeba | 2,500 | PASSED |
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2,sse3,sse4,sse4.1,sse4.2")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int NMAX=2e5;
bitset<NMAX+5>have;
bitset<NMAX+5>bs;
const int C=80;
int a[NMAX+5];
ll t1[NMAX+5],t2[NMAX+5]; // number of points, number of ... | C++ | a4f03259518029b38d71ed4c41209677 | 44810b02d4c75f90dbda746f1dd1afbc | 2,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long llo;
#define a first
#define b second
#define pb push_back
//#define endl '\n'
llo tree2[4*200010][3];
llo lazy[4*200010][3];
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define ... | C++ | a4f03259518029b38d71ed4c41209677 | b6be0218c75390f6d2eba09337b9f6f6 | 2,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long llo;
#define a first
#define b second
#define pb push_back
//#define endl '\n'
llo tree2[4*200010][3];
llo lazy[4*200010][3];
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define ... | C++ | a4f03259518029b38d71ed4c41209677 | 8f4f85655a4b0406c4948ca01537dc6c | 2,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long llo;
#define a first
#define b second
#define pb push_back
//#define endl '\n'
llo tree2[4*200010][3];
llo lazy[4*200010][3];
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define ... | C++ | a4f03259518029b38d71ed4c41209677 | 91902a745b0d25f16669ab72bdd42a35 | 2,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long llo;
#define a first
#define b second
#define pb push_back
//#define endl '\n'
llo tree2[4*200010][3];
llo lazy[4*200010][3];
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define ... | C++ | a4f03259518029b38d71ed4c41209677 | a1e22b4a4c9514361e263ce6e50b0ee8 | 2,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long llo;
#define a first
#define b second
#define pb push_back
//#define endl '\n'
llo tree2[4*200010][3];
llo lazy[4*200010][3];
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define ... | C++ | a4f03259518029b38d71ed4c41209677 | 4ec5673a3bce8d561313b153ca283d6e | 2,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long llo;
#define a first
#define b second
#define pb push_back
//#define endl '\n'
llo tree2[4*200010][3];
llo lazy[4*200010][3];
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define ... | C++ | a4f03259518029b38d71ed4c41209677 | 59da690a3c9db5441d3841bb9b00b33c | 2,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long llo;
#define a first
#define b second
#define pb push_back
//#define endl '\n'
llo tree2[4*200010][3];
llo lazy[4*200010][3];
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define ... | C++ | a4f03259518029b38d71ed4c41209677 | 84102e9271974774b62dd5d220adfd29 | 2,500 | PASSED |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=5005;
int t,n,m,flag,f[5005][5005];
int l[5005],r[5005];
char a[5005],b[5005];
int main(){
cin>>t;
while(t--){
cin>>n>>m>>a+1>>b+1;
flag=1;
for(int i=1,j=1;j<=m;j++,i++){
while(a[i]!=b[j]&&i<=n) i++;
if(i>n){
... | C++ | 81abcdc77ffcf8858b4e81f3db5ee7fb | 8eecb4064a08ec570f2413ad8e07491f | 2,500 | PASSED |
#include<bits/stdc++.h>
#define INT long long
using namespace std;
const int NN = 5010;
char A[NN],B[NN];
int L[NN][NN];
int dp[NN][NN];
int main(){
#ifndef ONLINE_JUDGE
freopen("in.in","r",stdin);
freopen("out.out","w",stdout);
#endif
int q;
cin >> q;
while(q--){
int n,m;
scanf("%d%d",&n,&m);
scanf("%s",A... | C++ | 81abcdc77ffcf8858b4e81f3db5ee7fb | e1745a5bbeaed0868489f321259a6af0 | 2,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int NN = 5050;
char s[NN], a[NN];
int flag1[NN][NN], flag2[NN][NN], dp1[NN], dp2[NN];
int main() {
#ifndef ONLINE_JUDGE
freopen("in.in", "r", stdin);
freopen("out.out", "w", stdout);
#endif
int t; cin>>t;
while(t --){
int n, m; scanf("%d%d", &n, &m);
scanf("... | C++ | 81abcdc77ffcf8858b4e81f3db5ee7fb | 1e9879535460b9376f9929b4eb80d75d | 2,500 | PASSED |
#include<bits/stdc++.h>
#define NN 5100
using namespace std;
using INT=long long;
const int inf = 0x3f3f3f3f;
int dp[NN][NN][2];
char s[NN], t[NN];
int tmp[NN], val[NN];
int main() {
#ifndef ONLINE_JUDGE
freopen("in.in", "r", stdin);
freopen("out.out", "w", stdout);
#endif
int T; cin >> T;
while(T --) {
int n,... | C++ | 81abcdc77ffcf8858b4e81f3db5ee7fb | c842918a5698780df71c462e50eaac7a | 2,500 | PASSED |
// Hydro submission #6330eb5892c9810c36210278@1664150364989
#include<bits/stdc++.h>
using namespace std;
int T,n,m,dp[2][5010][3];
char s[5010],t[5010];
int main(){
scanf("%d",&T);
while(T--){
scanf("%d%d%s%s",&n,&m,s+1,t+1);
int num=1;
for(int i=1;i<=n;i++){
if(num<=m&&t[num]==s[i]){
num++;
... | C++ | 81abcdc77ffcf8858b4e81f3db5ee7fb | f96409584aeb1cdc33f58c7fe0bd7af1 | 2,500 | PASSED |
// Hydro submission #632c402c26897f03be3e5605@1663844396090
#include <bits/stdc++.h>
using namespace std;
inline int read() {
int x = 0, f = 1; char c = getchar();
while (c < '0' || c > '9') {if (c == '-') f = -f; c = getchar();}
while (c >= '0' && c <= '9') {x = x * 10 + (c ^ 48); c = getchar();}
return x * ... | C++ | 81abcdc77ffcf8858b4e81f3db5ee7fb | 978192a15996ae212643533dd4d388b7 | 2,500 | PASSED |
// Hydro submission #632c0e7326897f03be3e4b8f@1663831667732
#include<bits/stdc++.h>
using namespace std;
const int N=5e3+10;
const int INF=0x3f3f3f3f;
int T,n,m,f[2][N][5];
char a[N],b[N];
bool pd() {
int i=1,j=1;
for(;i<=n;i++) {
if(a[i]==b[j]) j++;
if(j==m+1) break;
}
if(j==m+1) return true;
els... | C++ | 81abcdc77ffcf8858b4e81f3db5ee7fb | dc6f86b5d0ace354f8c2db103f8f91e4 | 2,500 | PASSED |
// Hydro submission #632bfc2126897f03be3e45e5@1663826977974
#include <bits/stdc++.h>
using namespace std;
const int N = 5e3 + 10, INF = 0x3f3f3f3f;
char s[N], t[N];
int f[2][N][3];
inline int read()
{
register unsigned int r = 0, c = getchar();
register int f = 1;
while (c < '0' || c > '9')
{
c = getch... | C++ | 81abcdc77ffcf8858b4e81f3db5ee7fb | 3398e953c7b75ed0464a808909dd364c | 2,500 | PASSED |
// Hydro submission #632bd6d426897f03be3e404c@1663817428899
#include <bits/stdc++.h>
using namespace std;
int read() {
int x=0, f=0; char c=getchar();
while (!isdigit(c)) f|=c=='-', c=getchar();
while (isdigit(c)) x=(x<<3)+(x<<1)+(c^48), c=getchar();
return f ? -x : x;
}
const int N=5e3+10;
int n, ... | C++ | 81abcdc77ffcf8858b4e81f3db5ee7fb | 05b0673c479319346e6fdda77415eb0d | 2,500 | PASSED |
// Hydro submission #632bba8926897f03be3e3363@1663810185476
#include <bits/stdc++.h>
using namespace std::string_literals;
namespace szc {
namespace types {
using i8 = int8_t; using i16 = int16_t; using i32 = int32_t; using i64 = long long;
using u8 = uint8_t; using u16 = uint16_t; using u3... | C++ | 81abcdc77ffcf8858b4e81f3db5ee7fb | c91ed50795ae647b72e1f40a98ab975a | 2,500 | PASSED |
def f(x,m):
if x%(2*m-1)!=0:
return x//(2*m-1)
else:
return x//(2*m-1)-1
N=int(input())
for i in range(N):
n=int(input())
L=list(map(int,input().split()))
M=max(L)
m=min(L)
L1=[x for x in L if x>=2*m]
Lm=[m for i in range(len(L1))]
L2=list(map(f,L1,Lm))
... | Python | 128d9ad5e5dfe4943e16fcc6a103e51b | c178e0e806b0ecf466dece9e12880c67 | 900 | PASSED |
def main():
n_tests = int(input())
for _ in range(n_tests):
n = int(input())
data = list(map(int, input().split(" ")))
min_val = data[0]
max_val = 2*min_val - 1
# print(min_val, max_val, 'HERE')
operations = 0
if min_val == 1:
for x in data:... | Python | 128d9ad5e5dfe4943e16fcc6a103e51b | d08f2b95472bb4c40f4bb2d8fd146f59 | 900 | PASSED |
t = int (input ())
while t:
t-=1
n = int (input ())
a = list (map(int, input().split()))
result = 0
first = a[0]
for x in a[1:]:
result += (x-1) // (2*first-1)
print (result) | Python | 128d9ad5e5dfe4943e16fcc6a103e51b | efbf2b88e0afe6263e428b978acf2777 | 900 | PASSED |
t = int (input ())
while t:
t-=1
n = int (input ())
a = list (map(int, input().split()))
result = 0
first = a[0]
for x in a[1:]:
result += (x-1) // (2*first-1)
print (result) | Python | 128d9ad5e5dfe4943e16fcc6a103e51b | e757e3cd53596301a3eb7ada59442e4f | 900 | PASSED |
import sys,math
sys.setrecursionlimit(1000000)
res = []
for _ in range(int(input())):
a = int(input())
b = list(map(int, input().split()))
smallest = min(b)
res.append(sum([max(0, math.ceil((i-((2*smallest)-1))/((2*smallest)-1))) for i in b]))
print(*res,sep="\n")
| Python | 128d9ad5e5dfe4943e16fcc6a103e51b | b60cbbdd27ba89bbe9c4543220ee3ec4 | 900 | PASSED |
# https://codeforces.com/problemset/problem/1735/B
# Time complexity: O(N) Linear time complexity
# Space complexity: O(1) Constant space complexity
def solve(a):
min_ = a[0]
max_ = (min_ * 2) -1
c = 0
for e in a[1:]:
if e > max_:
c += e // max_ - (1 if e % max_ == 0 else 0)
ret... | Python | 128d9ad5e5dfe4943e16fcc6a103e51b | 4a9da0fa593c0976278e2c3a5e42119c | 900 | PASSED |
def solve(a):
min_ = min(a)
max_ = (min_ * 2) -1
c = 0
for e in a[1:]:
if e > max_:
c += e // max_ - (1 if e % max_ == 0 else 0)
return c
t = int(input())
for _ in range(t):
n = input()
a = [int(e) for e in input().split()]
print(solve(a))
| Python | 128d9ad5e5dfe4943e16fcc6a103e51b | a45fa6ca898511f3f328a1078226b598 | 900 | PASSED |
def solve(a):
min_ = min(a)
max_ = (min_ * 2) -1
#print(f'min_: {min_}')
#print(f'max_: {max_}')
c = 0
for e in a[1:]:
#print(f'e: {e}')
if e > max_:
div_c = int(e/max_) - (1 if e % max_ == 0 else 0)
#print(f'div_c: {div_c}')
#subs_c ... | Python | 128d9ad5e5dfe4943e16fcc6a103e51b | 79566315ffabf9586a7de45b6c1ff1fc | 900 | PASSED |
size=input()
for i in range(int(size)):
n=int(input())
temp=input().split()
if n==1:
print(0)
continue
listt=[int(temp[i]) for i in range(n)]
if listt[-1]<2*listt[0]:
print(0)
continue
temp=listt[0]
sum=0
for i in range(1,n):
if listt... | Python | 128d9ad5e5dfe4943e16fcc6a103e51b | b0dd5317039bb49a37300a840f81a8b5 | 900 | PASSED |
from math import ceil, floor
def find(mini,maxi,count):
if mini *2 <= maxi:
return int(((maxi-1) / ((2*mini)-1)))
# while 2 * mini <= maxi:
# maxi -= (2* mini) - 1
# count+=1
# return count
# if mini *2 > maxi:
# return count
# else:
# count= fi... | Python | 128d9ad5e5dfe4943e16fcc6a103e51b | d45e9eb3a299f98d8c9ef4e6c098bcff | 900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ll t;
cin>>t;
for(int j=0; j<t; j++){
ll n;
cin>>n;
ll min1 = 0;
ll min2 = 0;
if(n>0){
if((n-4)%2 == 0){
ll b=((n-4)/2)-1;
ll p ... | C++ | 0690e2df87f60e5be34505d9e2817032 | d47ec596a7990ba1a186fe17b9d5521e | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ll t;
cin>>t;
for(int j=0; j<t; j++){
ll n;
cin>>n;
ll min1 = 0;
ll min2 = 0;
if(n>0){
if((n-4)%2 == 0){
ll b=((n-4)/2)-1;
ll p =... | C++ | 0690e2df87f60e5be34505d9e2817032 | 7c231b8e194d6e8f4d2c3d10037caf8e | 800 | PASSED |
#include <bits/stdc++.h>
#include <algorithm>
using namespace std;
#define ll long long
int main(){
ll t;
cin>>t;
for(int j=0; j<t; j++){
ll n;
cin>>n;
ll min1 = 0;
ll min2 = 0;
// if(n<=100){
// if((n-4)%2 ==... | C++ | 0690e2df87f60e5be34505d9e2817032 | bff9262a80e2e005d64df1dc85be99d9 | 800 | PASSED |
#include <bits/stdc++.h>
#include <algorithm>
using namespace std;
#define ll long long
int main(){
ll t;
cin>>t;
for(int j=0; j<t; j++){
ll n;
cin>>n;
ll min1 = 0;
ll min2 = 0;
if(n<=100){
if((n-4)%2 == 0){
... | C++ | 0690e2df87f60e5be34505d9e2817032 | 401027ec7da4b4006a10e98f07321233 | 800 | PASSED |
#include <bits/stdc++.h>
#include <algorithm>
using namespace std;
#define ll long long
int main(){
ll t;
cin>>t;
for(int j=0; j<t; j++){
ll n;
cin>>n;
ll min1 = 0;
ll min2 = 0;
if(n<=100){
if((n-4)%2 == 0){
... | C++ | 0690e2df87f60e5be34505d9e2817032 | b68b7a5ee3dca16d8bd3adb146e9b1a4 | 800 | PASSED |
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
int t;
cin >> t;
while(t--)
{
int n,w;
cin >> n;
cout << (n-3)/3-1 <<endl;
}
} | C++ | 0690e2df87f60e5be34505d9e2817032 | b56aac967990409fd17e10282e1e1c7b | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int t;
long long n;
scanf("%d",&t);
while(t)
{
scanf("%lld",&n);
printf("%lld\n",(n-6)/3);
t--;
}
return 0;
} | C++ | 0690e2df87f60e5be34505d9e2817032 | 34ac2c15a4bd694cc3ab13f0b87619b3 | 800 | PASSED |
#include <iostream>
#include <algorithm>
#include <cstring>
#include <stdio.h>
using namespace std;
const int N = 10010;
int main()
{
int t;
scanf("%d", &t);
while (t --)
{
int n;
scanf("%d", &n);
if (n <= 8) printf("%d\n", 0);
else
{
... | C++ | 0690e2df87f60e5be34505d9e2817032 | ab41274820df7e9518723fe372be68d3 | 800 | PASSED |
#include <iostream>
#include <cstdio>
#include <fstream>
#include <algorithm>
#include <cmath>
#include <deque>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <map>
#include <stack>
#include <set>
using namespace std;
int main() {
int t;
scanf("%d",&t);
... | C++ | 0690e2df87f60e5be34505d9e2817032 | 553be179de8f9af6fdf2648527a05af4 | 800 | PASSED |
#include<iostream>
using namespace std;
int main()
{
int t;
cin >> t;
while(t--)
{
int n,w;
cin >> n;
w=(n-3)/3;
cout << w-1 <<endl;
}
} | C++ | 0690e2df87f60e5be34505d9e2817032 | 6e9b91c3d36bad57d4490464b5a25227 | 800 | PASSED |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Collection;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Random;
import java.util.StringTokenizer;
import java.util.concurrent.ThreadLocalRandom;
/*
1 1 1
1 1 1 1
1 0... | Java | faf5ec909f5147c11454e1ecb9c372ee | 88833d22979dfac296b8ace44599390e | 1,400 | PASSED |
import java.io.*;
import java.util.Scanner;
import java.util.*;
public class Solution {
static int mod = (int) 1e9 + 7;
static Kattio io = new Kattio();
static int h = (int) 1e5 * 2 + 2;
public static void main(String[] args) {
int t = io.nextInt();
for (int i = 0; i < t; i++)... | Java | faf5ec909f5147c11454e1ecb9c372ee | e94948dcf83470d0c2079d49591e641f | 1,400 | PASSED |
import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) throws IOException {
//BufferedReader f = new BufferedReader(new FileReader("uva.in"));
//PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("threesum.out")));
BufferedRe... | Java | faf5ec909f5147c11454e1ecb9c372ee | e1cf364653383b84a50f5f1fec5d887c | 1,400 | PASSED |
import java.awt.*;
import java.io.*;
import java.util.*;
import java.util.List;
public class TaskC {
private static final String YES = "YES";
private static final String NO = "NO";
public static void main(String[] arg) {
final FastScanner in = new FastScanner(System.in);
final PrintWriter ... | Java | faf5ec909f5147c11454e1ecb9c372ee | 214cfd50a610de499b35df5b14a4d65b | 1,400 | PASSED |
import java.awt.*;
import java.io.*;
import java.util.*;
import java.util.List;
public class TaskC {
private static final String YES = "YES";
private static final String NO = "NO";
public static void main(String[] arg) {
final FastScanner in = new FastScanner(System.in);
final PrintWriter ... | Java | faf5ec909f5147c11454e1ecb9c372ee | addad312494fa96ddc44fd8c4d9e76e2 | 1,400 | PASSED |
import java.io.*;
import java.util.*;
public class TaskC {
private static final String YES = "YES";
private static final String NO = "NO";
public static void main(String[] arg) {
final FastScanner in = new FastScanner(System.in);
final PrintWriter out = new PrintWriter(System.out);
... | Java | faf5ec909f5147c11454e1ecb9c372ee | 4d1282bb324d1a28d7d062b17feeda88 | 1,400 | PASSED |
import java.io.*;
import java.util.*;
public class Main {
static PrintWriter out;
static Kioken sc;
static boolean checkOnlineJudge = System.getProperty("ONLINE_JUDGE") == null;
public static void main(String[] args) throws FileNotFoundException {
if (checkOnlineJudge) {
... | Java | faf5ec909f5147c11454e1ecb9c372ee | a4d2e4b6b2658669f68255b9742c4c73 | 1,400 | PASSED |
import java.util.*;
@SuppressWarnings("ALL")
public class Main {
private static void solve(String t) {
int n = 26;
int[] parent = new int[n];
for (int i = 0; i < n; i++) {
parent[i] = i;
}
Map<Character, Character> mappings = new HashMap<>();
... | Java | faf5ec909f5147c11454e1ecb9c372ee | 9fb9c92cd7d1aa5c9162f5047e8547ff | 1,400 | PASSED |
/***** ---> :) Vijender Srivastava (: <--- *****/
import java.util.*;
import java.lang.*;
import java.io.*;
public class Main
{
static FastReader sc =new FastReader();
static PrintWriter out=new PrintWriter(System.out);
static long mod=(long)32768;
static StringB... | Java | faf5ec909f5147c11454e1ecb9c372ee | 8146387ef3c9a305d4d0fd0e45fb3c2a | 1,400 | PASSED |
/***** ---> :) Vijender Srivastava (: <--- *****/
import java.util.*;
import java.lang.*;
import java.io.*;
public class Main
{
static FastReader sc =new FastReader();
static PrintWriter out=new PrintWriter(System.out);
static long mod=(long)32768;
static StringB... | Java | faf5ec909f5147c11454e1ecb9c372ee | ae4f8a59e34c9813609a8467dfce11dc | 1,400 | PASSED |
#include <iostream>
#include <string>
#include <vector>
#include <array>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <numeric>
#include <iomanip>
#include <cassert>
//#include <bit>
#include <map>
std::map<int, int> facts;
int fact(int n)
{
if (n == 0) return 1;
int t = n;
... | C++ | 6fa3f1fd7675affcf326eeb7fb3c60a5 | 0584dcdf510946f1ad7304d7ab51d175 | 1,700 | PASSED |
#include <iostream>
#include <string>
#include <vector>
#include <array>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <numeric>
#include <iomanip>
#include <cassert>
//#include <bit>
#include <map>
std::map<unsigned long long, unsigned long long> facts;
unsigned long long fact(unsi... | C++ | 6fa3f1fd7675affcf326eeb7fb3c60a5 | 8605e67cb2a51810e9a09b2f524db944 | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll int
#define endl '\n'
string s[1000 + 10];
void solve()
{
ll n, k;
cin >> n >> k;
map<string, ll> mp;
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= k; j++)
{
string c;
cin >> c... | C++ | 6fa3f1fd7675affcf326eeb7fb3c60a5 | ac57a6fa9bec510584320314826d2a54 | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll int
#define endl '\n'
string s[1000 + 10];
void solve()
{
ll n, k;
cin >> n >> k;
unordered_map<string, ll> mp;
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= k; j++)
{
string c;
... | C++ | 6fa3f1fd7675affcf326eeb7fb3c60a5 | 35ac069d953bafe44ea671bcfe357881 | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll int
#define endl '\n'
string s[1000 + 10];
void solve()
{
ll n, k;
cin >> n >> k;
unordered_map<string, ll> mp;
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= k; j++)
{
string c;
... | C++ | 6fa3f1fd7675affcf326eeb7fb3c60a5 | 6b52a99634cdf50413328f7ad5fc7d02 | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
ll p[k];
p[0] = 1;
for (int i = 1; i < k; i++) {
p[i] = p[i -... | C++ | 6fa3f1fd7675affcf326eeb7fb3c60a5 | 0bff7a8e9d9a10812c2ed6f3dfe780dd | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
map <ll,int> mp;
int TC,n,k;
ll w[2005];
bool find(ll x,ll y){
ll z = 0;
for(int i = 0;i < k;i ++){
int w1 = (x >> (i + i)) & 3;
int w2 = (y >> (i + i)) & 3;
ll w3 = (w1 == w2 ? w1 : 3 - w1 - w2);
z |= (w3 << (i + i));
}
i... | C++ | 6fa3f1fd7675affcf326eeb7fb3c60a5 | 34e85a7cce5dff4e566d933b18a6e675 | 1,700 | PASSED |
#include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <list>
#include <vector>
#include <queue>
#include <cstdlib>
#include <cstring>
#include <stack>
//#include <complex>
using namespace ::std;
#define close ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define Endl... | C++ | 6fa3f1fd7675affcf326eeb7fb3c60a5 | b98440dd831950c17c323ee0763d5377 | 1,700 | PASSED |
#include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <list>
#include <vector>
#include <queue>
#include <cstdlib>
#include <cstring>
#include <stack>
//#include <complex>
using namespace ::std;
#define close ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define Endl... | C++ | 6fa3f1fd7675affcf326eeb7fb3c60a5 | 5bc9dfc2a62608378258e8c9d61674bd | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int a[1005];
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, m;
cin >> n >> m;
vector<string> s(n, string(m, '0'));
unordered_map<string, int> mp;
mp.reserve(10000000);
for(int i = 0; i < n... | C++ | 6fa3f1fd7675affcf326eeb7fb3c60a5 | 7129d032963110f34ff7d97346a2808c | 1,700 | PASSED |
#include<bits/stdc++.h>
#define fi first
#define se second
#define lc (root<<1)
#define rc (root<<1|1)
//#define mid ((l+r)>>1)
#define ll long long
#define lowbit(x) (x&-x)
#define ull unsigned long long
#define mp(x, y) make_pair(x, y)
#define RNG mt19937 rng(time(0))
#define IOS cin.tie(nullptr), cout.tie... | C++ | 3e08d07aa3762c262dcd23607febad7a | d1788a4417220f998e4a777676e0cb2c | 2,400 | PASSED |
#include<bits/stdc++.h>
#define fi first
#define se second
#define lc (root<<1)
#define rc (root<<1|1)
//#define mid ((l+r)>>1)
#define ll long long
#define lowbit(x) (x&-x)
#define ull unsigned long long
#define mp(x, y) make_pair(x, y)
#define RNG mt19937 rng(time(0))
#define IOS cin.tie(nullptr), cout.tie... | C++ | 3e08d07aa3762c262dcd23607febad7a | 8d6d2d608559188fe9606126c7b7bdaf | 2,400 | PASSED |
#include<bits/stdc++.h>
#define fi first
#define se second
#define lc (root<<1)
#define rc (root<<1|1)
//#define mid ((l+r)>>1)
#define ll long long
#define lowbit(x) (x&-x)
#define ull unsigned long long
#define mp(x, y) make_pair(x, y)
#define RNG mt19937 rng(time(0))
#define IOS cin.tie(nullptr), cout.tie... | C++ | 3e08d07aa3762c262dcd23607febad7a | 1553c798c034c05647c7e4c1091230c2 | 2,400 | PASSED |
#include<bits/stdc++.h>
#define fi first
#define se second
#define lc (root<<1)
#define rc (root<<1|1)
//#define mid ((l+r)>>1)
#define ll long long
#define lowbit(x) (x&-x)
#define ull unsigned long long
#define mp(x, y) make_pair(x, y)
#define RNG mt19937 rng(time(0))
#define IOS cin.tie(nullptr), cout.tie... | C++ | 3e08d07aa3762c262dcd23607febad7a | bac049f96b37757a04b7b64d92207f52 | 2,400 | PASSED |
#include<bits/stdc++.h>
#define fi first
#define se second
#define lc (root<<1)
#define rc (root<<1|1)
//#define mid ((l+r)>>1)
#define ll long long
#define lowbit(x) (x&-x)
#define ull unsigned long long
#define mp(x, y) make_pair(x, y)
#define RNG mt19937 rng(time(0))
#define IOS cin.tie(nullptr), cout.tie... | C++ | 3e08d07aa3762c262dcd23607febad7a | 06c55a2dbb20ba11ea3c08017db5fc5e | 2,400 | PASSED |
#include<bits/stdc++.h>
#define fi first
#define se second
#define lc (root<<1)
#define rc (root<<1|1)
//#define mid ((l+r)>>1)
#define ll long long
#define lowbit(x) (x&-x)
#define ull unsigned long long
#define mp(x, y) make_pair(x, y)
#define RNG mt19937 rng(time(0))
#define IOS cin.tie(nullptr), cout.tie... | C++ | 3e08d07aa3762c262dcd23607febad7a | fa7097cc8e7f620b38f59dea31ca4e3d | 2,400 | PASSED |
#include<bits/stdc++.h>
#define fi first
#define se second
#define lc (root<<1)
#define rc (root<<1|1)
//#define mid ((l+r)>>1)
#define ll long long
#define lowbit(x) (x&-x)
#define ull unsigned long long
#define mp(x, y) make_pair(x, y)
#define RNG mt19937 rng(time(0))
#define IOS cin.tie(nullptr), cout.tie... | C++ | 3e08d07aa3762c262dcd23607febad7a | 4bf8559ea5ecdac4b745c9754caa5e93 | 2,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define dbg(x...) \
do { \
cout << #x << " -> "; \
err(x); \
} while (0)
void err() {
cout << endl;
}
template<class T, class... Ts>
void err(T arg, Ts &... args) {
cout << arg << ' ';
err(args...);
}
typedef int ll... | C++ | 3e08d07aa3762c262dcd23607febad7a | d721398b9e2fe8ca6cd2b719016f0b40 | 2,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define dbg(x...) \
do { \
cout << #x << " -> "; \
err(x); \
} while (0)
void err() {
cout << endl;
}
template<class T, class... Ts>
void err(T arg, Ts &... args) {
cout << arg << ' ';
err(args...);
}
typedef int ll... | C++ | 3e08d07aa3762c262dcd23607febad7a | f322bc5582b9fc9479f5b25e2d2a11ee | 2,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
const int MAXN = 10010, MAXM = 8200001, inf = 0x3f3f3f3f, N = 1010;
struct Edge{
int to,next,cap,flow;
}edge[MAXM];
int tol;
int head[MAXN];
void init(int n){
tol = 2;
for(int i = 0; i < n; i++) head[i] = -1;
}
void a... | C++ | 3e08d07aa3762c262dcd23607febad7a | f9dc2cca444d5cee9232b18d1835ed19 | 2,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define fastio() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define pb push_back
#define show(x) cout << (#x) << " : " << x << endl;
#define pii pair<int, int>
const int bar = (1<<19);
double... | C++ | 8021dd86433fc187c74f123683456eec | 984e540e1819311ddefc5fae36bb33b1 | 2,900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
typedef pair<int32_t, int32_t> pi;
typedef vector <int> vi;
typedef vector <pi> vpi;
typedef pair<pi, ll> pii;
typedef set <ll> si;
typedef long double ld;
#define f first
#define s second
#define mp make_pair
#define FOR(... | C++ | 8021dd86433fc187c74f123683456eec | 8bba8a1fd23210269dee8bdfeac09071 | 2,900 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
struct Pt {
ld x, y;
};
bool operator<(Pt a, Pt b) {
return a.y * b.x - a.x * b.y < 0;
}
const ld EPS = 1e-9;
void ProGamerMove() {
int n; cin >> n;
Pt cur; cin >> cur.x >> cur.y;
vector<ld> x(n), y(n);
for (ld& v : x) ... | C++ | 8021dd86433fc187c74f123683456eec | 042aee861586d5f8833209cd0f8fa352 | 2,900 | PASSED |
#pragma region Macros
#if defined(noimi) && defined(_GLIBCXX_DEBUG) && defined(_GLIBCXX_DEBUG_PEDANTIC)
#pragma comment(linker, "/stack:200000000")
#include <stdc++.h>
#pragma GCC optimize("O3")
#else
#pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("popcnt")
// #prag... | C++ | 8021dd86433fc187c74f123683456eec | 2d2fa451c7d3c3ae3f3381557448d46b | 2,900 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const long long N=3e5+10;
long long t,n,p[N],q[N];
long long a,b;
struct node{
long long x,y;
mutable long double len;
bool operator<(const node b)const{return x*b.y<b.x*y;}
};
long double k(node kk){return 1.l*kk.x/kk.y;}
long double r(node kk){return... | C++ | 8021dd86433fc187c74f123683456eec | c35d80b3c59d9ee67fc343c68a54acda | 2,900 | PASSED |
// wygzgyw
#include <bits/stdc++.h>
using namespace std;
template <typename T> void read(T &t) {
t=0; char ch=getchar(); int f=1;
while (ch<'0'||ch>'9') { if (ch=='-') f=-1; ch=getchar(); }
do { (t*=10)+=ch-'0'; ch=getchar(); } while ('0'<=ch&&ch<='9'); t*=f;
}
template <typename T> void write(T t) {
if (t... | C++ | 8021dd86433fc187c74f123683456eec | 5e4010f73747709a685503705f6cd595 | 2,900 | PASSED |
#include <bits/stdc++.h>
#define F(x, y, z) for (int x = (y); x <= (z); ++x)
#define DF(x, y, z) for (int x = (y); x >= (z); --x)
using namespace std;
typedef long long ll;
using ld = long double;
const ld eps = 1e-9;
const int maxn = 500005;
int read() {
char ch = getchar();
int x = 0, pd = 0;
while (ch ... | C++ | 8021dd86433fc187c74f123683456eec | 643338169806e6046ff3d0b66184afc0 | 2,900 | PASSED |
#include<bits/stdc++.h>
#define ll long long
#define int ll
#define ld long double
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define REP(i,j) for(int i=0;i<j;++i)
#define REPA(i,j) for(int i=1;i<=j;++i)
#define vi vector<int>
#define pii pair<int,int>
#define mt make_tuple... | C++ | 8021dd86433fc187c74f123683456eec | 37b8afabe046eca4645112dec939eb44 | 2,900 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long double db;
const db eps=1e-9;
multiset<pair<db,db> >st;
db sx,sy,tx,ty;
int n,xx,yy,P[300004],Q[300004];
void sol(){
scanf("%d%d%d",&n,&xx,&yy);
sx=tx=xx,sy=ty=yy;st.clear();
for(int i=1;i<=n;i++)scanf("%d",&P[i]);
for(int i=1;i<=n;i++)scanf("%d",... | C++ | 8021dd86433fc187c74f123683456eec | 0d6ad8d61f1fd8e27a31b073f8971abb | 2,900 | PASSED |
#include <iostream>
#include <vector>
#include <climits>
#include <unordered_map>
#include <stack>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <set>
#include <cstring>
#include <cstdlib>
#include <queue>
#include <iomanip>
#include <map>
using namespace std;
#define MAXN 300011
in... | C++ | 8021dd86433fc187c74f123683456eec | ff1fde21ad03cd484533ab11bc459aaf | 2,900 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define F first
#define S second
const ll N = 1e6 + 20 ;
const ll MOD = 1e9 + 7;
const ll M = 1e9 ;
const ll Inf = 1e18 + 1 ;
const long double eps = 1e-7;
const ll dx[] = {1 , 0 , -1 , 0 , 1 , -1 , 1 , -1} ;
const ll dy[] = {0 , 1 , 0 , -1 ,... | C++ | eee1ad545b2c4833e871989809355baf | 3d182fb2a5296b6139d1b914fd0d381e | 1,800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define F first
#define S second
const ll N = 1e6 + 20 ;
const ll MOD = 1e9 + 7;
const ll M = 1e9 ;
const ll Inf = 1e18 + 1 ;
const long double eps = 1e-7;
const ll dx[] = {1 , 0 , -1 , 0 , 1 , -1 , 1 , -1} ;
const ll dy[] = {0 , 1 , 0 , -1 ,... | C++ | eee1ad545b2c4833e871989809355baf | cf422fe4658adc31f43b0697d097d58e | 1,800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define F first
#define S second
const ll N = 1e6 + 20 ;
const ll MOD = 1e9 + 7;
const ll M = 1e9 ;
const ll Inf = 1e18 + 1 ;
const long double eps = 1e-7;
const ll dx[] = {1 , 0 , -1 , 0 , 1 , -1 , 1 , -1} ;
const ll dy[] = {0 , 1 , 0 , -1 ,... | C++ | eee1ad545b2c4833e871989809355baf | cce69e0abfefd33342eba30446640561 | 1,800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define F first
#define S second
const ll N = 1e6 + 20 ;
const ll MOD = 1e9 + 7;
const ll M = 1e9 ;
const ll Inf = 1e18 + 1 ;
const long double eps = 1e-7;
const ll dx[] = {1 , 0 , -1 , 0 , 1 , -1 , 1 , -1} ;
const ll dy[] = {0 , 1 , 0 , -1 ,... | C++ | eee1ad545b2c4833e871989809355baf | c05d65866e26a84478c4e72de8f248fb | 1,800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define F first
#define S second
const ll N = 1e6 + 20 ;
const ll MOD = 1e9 + 7;
const ll M = 1e9 ;
const ll Inf = 1e18 + 1 ;
const long double eps = 1e-7;
const ll dx[] = {1 , 0 , -1 , 0 , 1 , -1 , 1 , -1} ;
const ll dy[] = {0 , 1 , 0 , -1 ,... | C++ | eee1ad545b2c4833e871989809355baf | 3b4a764513078f71d65454deb2a8e50f | 1,800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define F first
#define S second
const ll N = 1e6 + 20 ;
const ll MOD = 1e9 + 7;
const ll M = 1e9 ;
const ll Inf = 1e18 + 1 ;
const long double eps = 1e-7;
const ll dx[] = {1 , 0 , -1 , 0 , 1 , -1 , 1 , -1} ;
const ll dy[] = {0 , 1 , 0 , -1 ,... | C++ | eee1ad545b2c4833e871989809355baf | 8abfe7baf7af28a0234b279c3978e0e7 | 1,800 | PASSED |
#include <vector>
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <map>
#include <algorithm>
#include <cmath>
//#define int long long
using namespace std;
const int N = 3e5 + 10, M = 210;
using PII = pair<int, int>;
int ... | C++ | eee1ad545b2c4833e871989809355baf | 69efcb38d5a2e15c33413de8130ffa44 | 1,800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define FOR(i,x,n) for(int i = x; i<=n; i++)
#define FORO(i,n) for(int i = 0; i<n; i++)
#define ROF(i,x,n) for(int i = x; i>=n; i--)
#define nl "\n"
#define sp " "
#define INF 1000000000000000000
#define pb push_... | C++ | eee1ad545b2c4833e871989809355baf | 94ed1c6b731fb98b9355c60bf5c2c282 | 1,800 | PASSED |
#include <bits/stdc++.h>
#define ll long long int
#define ull unsigned long long int
using namespace std;
void printv(vector<ll>&v)
{
for(auto a:v)
cout<<a<<" ";
cout<<endl;
}
void inputv(vector<ll>&v)
{
for(ll i=0;i<v.size();i++)
{
cin>>v[i];
}
}
ll rec(vector<int>... | C++ | eee1ad545b2c4833e871989809355baf | 4825ca4c285fe84764517eaefe9197c7 | 1,800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N=3e5+5;
int a[N];
int dp[N];
void solve() {
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++) {
dp[i] = 1;
for (int j=max(0, i - 255);j<=i-1;j++) {
... | C++ | eee1ad545b2c4833e871989809355baf | e1664aab9266d691ae895e5e2044b599 | 1,800 | PASSED |
#include <iostream>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <iomanip>
#include <cmath>
#include <string>
#include <fstream>
using namespace std;
#define ll long long
#define llu unsigned long long
#define F first
#define S second... | C++ | 3bf5d493813c5582200eca9248b357d3 | eabdd471775a090b573d698db3c3066e | 1,200 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.