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>
#include<vector>
using namespace std;
int main()
{
int t;
cin >> t;
while (t--)
{
int n;
cin >> n;
vector<int>a(n);
int minn = 0x3f3f3f3f;
for (int i = 0; i < n; i++)
{
cin >> a[i];
minn = min(minn, a[i]);
}
int ans = minn;
sort(a.begin(), a.end());
for (int j = 0; ... | C++ | 4bd7ef5f6b3696bb44e22aea87981d9a | 1068fc80f8a6bcb9fd184075aea6731d | 1,000 | PASSED |
#include<iostream>
#include<algorithm>
using namespace std;
int a[200005];
int main()
{
cin.tie(0);
cout.tie(0);
int t;
cin>>t;
while(t--)
{
int n;
cin>>n;
for(int i=0;i<n;i++)
{
cin>>a[i];
}
sort(a,a+n);
int ans=a[0];
for(int i=1;i<n;i++)
{
ans=max(ans,a[i]-a[i-1]);
}
cout<<ans<<endl;... | C++ | 4bd7ef5f6b3696bb44e22aea87981d9a | 9588476b621b1930461288fe4bb76c4c | 1,000 | PASSED |
#include <bits/stdc++.h>
long long array[200002];
int main(){
int T;
scanf("%d", &T);
while (T--){
long long n;
scanf("%lld", &n);
for (int i = 0; i < n; ++i) {
scanf("%lld", array + i);
}
if (n == 1){
printf("%lld\n", array[0]);
... | C++ | 4bd7ef5f6b3696bb44e22aea87981d9a | d670ba9db040bfb63835c8d86f194e19 | 1,000 | PASSED |
#include "bits/stdc++.h"
using namespace std;
int t, n;
int main()
{
cin >> t;
while(t--)
{
priority_queue<int,vector<int>, greater<int>> que;
int res = 0;
int minf = -1e9;
cin >> n;
for(int i = 0; i < n; i++)
{
int x;
scanf("%d", &x);
que.push(x);
}
while(que.size())
{
int t = que... | C++ | 4bd7ef5f6b3696bb44e22aea87981d9a | baeb8251293975a7e84e9c6528cf1744 | 1,000 | PASSED |
#include"bits/stdc++.h"
using namespace std;
const int N=2e5+5;
const int INF=1e9+5;
int a[N];
int main(){
int t;
cin>>t;
while(t--){
int n,ans=-INF,sum=0;
cin>>n;
for(int i=0;i<n;i++)
cin>>a[i];
sort(a,a+n);
for(int i=0;i<n;i++){
a[i]-=sum;
sum+=a[i];
ans=max(a[i],ans);
}
cout<<ans<<endl;
... | C++ | 4bd7ef5f6b3696bb44e22aea87981d9a | cbf65ee483df3e6f69cb1c07a6c5bcfd | 1,000 | PASSED |
/***IN THE NAME OF ALMIGHTY ALLAH***/
/***ALHAMDULILLAH***/
/***From dust I have come, dust I will be***/
#include <bits/stdc++.h>
using namespace std;
#define optimize() \
ios::sync_with_stdio(0); \
cin.tie(0);
#define start \
int T; \
cin >> T; \
while (T--)
#define endl '\n'
#defin... | C++ | 4bd7ef5f6b3696bb44e22aea87981d9a | fc47dc8ea5329534ee014f300601dd82 | 1,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define preci cout<<fixed<<setprecision(10);
#define ll long long int
#define fo(i,a,b) for(ll i=a;i<b;i++)
#define fo1(i,a,b) for(ll i=b-1;i>=a;i--)
#define pb push_back
#define fast() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int main(){
fast();
int t;
cin>>t;
w... | C++ | 4bd7ef5f6b3696bb44e22aea87981d9a | 5683b69bdae9bceac5dcda9111aaa0e5 | 1,000 | PASSED |
#include <iostream>
#include<bits/stdc++.h>
using namespace std;
int main() {
int tc;
cin>>tc;
while(tc--){
long long n,i,sum=0;
cin>>n;
long long a[n];
for(int i=0;i<n;i++){
cin>>a[i];
}
sort(a,a+n);
long long res=a[0];
for(i=0;i<n;... | C++ | 4bd7ef5f6b3696bb44e22aea87981d9a | 5bb533a08240844826dbd7377fa98386 | 1,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
long long n,a[200005],t=0,b=0,x=INT_MIN;
cin>>n;
for(int i=0;i<n;++i)
{
cin>>a[i];
}
sort(a,a+n);
for(int i=0;i<n;++i)
{if(x<a[i]-t)
x=a[i]-... | C++ | 4bd7ef5f6b3696bb44e22aea87981d9a | 913674652efd4b0cb3d36f2c064b137e | 1,000 | 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++ | dbe12a665c374ce3745e20b4a8262eac | 92d8a35ebbe29d4054ada627d92683e1 | 900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll oo = 1LL << 32;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int t; cin >> t;
while (t--)
{
ll pos, n; cin >> pos >> n;
ll it = n % 4;
ll m = n - it;
if (abs(pos % 2) == 0 && n > 0 ... | C++ | dbe12a665c374ce3745e20b4a8262eac | 40cdc381f66029493aae9c510ebddcba | 900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int t;
long long int x , n;
cin >> t;
while (t--)
{
cin>>x>>n;
if(x%2==0){
if(n%4==0){
cout<<x<<endl;
}
else if(n%4==1)
cout<<x-n<<endl;
else if(n%4==2)
cout<<x+1<<endl;
else
cout<<x+n+1<<endl;
}
else{
if(n... | C++ | dbe12a665c374ce3745e20b4a8262eac | fafcd14e7ddebe18b11e3a4250ad5488 | 900 | PASSED |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll i, k, n, t;
cin >> t;
for(i = 1;i <= t;i++) {
cin >> k >> n;
if(k % 2 == 0) {
if(n % 4 == 0) {
cout << k << '\n';
}
else if(n % 4 == 2) {
cout << k + 1 << '\n';
}
else if(n % 4 == 1) {
cout << k - n << '... | C++ | dbe12a665c374ce3745e20b4a8262eac | 49bab3a6f6f5b0fbebc6728c1714e5be | 900 | PASSED |
#include<iostream>
#include<cmath>
using namespace std;
int main()
{
int t;
cin >> t;
while (t--)
{
long long p, n;
cin >> p >> n;
int m = n % 4;
for (long long i = n - m + 1; i <= n; ++i)
if (llabs(p) % 2) p += i;
else p -= i;
cout << p << endl;
}
return 0;
}
| C++ | dbe12a665c374ce3745e20b4a8262eac | 0a5d645ff48fcd5d7d3ab325dc464f2e | 900 | PASSED |
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long LL;
int t;
LL x,n;
int main()
{
cin>>t;
while(t--)
{
cin>>x>>n;
LL r=n;
if(x%2==0&&n>0)
{
n-=1;
x-=1;
x-=4*(n/4);
n%=4;
if(n==3)
x-=r,x+=2*r-3;
if(n==1)
{
x+=r;
}
if(n==2)
x+=2... | C++ | dbe12a665c374ce3745e20b4a8262eac | 5b3299a13eb894faa9fb21397b568a62 | 900 | PASSED |
#include "bits/stdc++.h"
using namespace std;
#define fp(i,a,b) for(int i = a; i <= b;i ++)
#define fd(i,a,b) for(int i = a; i >= b;i --)
#define ll long long
const int N = 2e3+10;
ll t;
int main()
{
ll t;
cin>>t;
while(t--)
{
ll n,k;cin>>n>>k;
if(n%2==0)
{
if(k%4==0) cout<<n<<endl;
if(k%4==1) cout<<... | C++ | dbe12a665c374ce3745e20b4a8262eac | d9eff66687f23f3be91fbb210c055d72 | 900 | PASSED |
/*
Created by YuXiao
Nothing to say.
*/
#define YuXiao() cin.tie(0), cout.tie(0), ios::sync_with_stdio(false)
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
using namespace std;
typedef long long LL;
void solve()
{
LL n, m;
cin >> n >> m;
LL tmp = m / 4 * 4;
while (tmp < m)
... | C++ | dbe12a665c374ce3745e20b4a8262eac | 913e25456c87cc854138ccfbe14486ab | 900 | PASSED |
#include <algorithm>
#include <iostream>
#include <cstring>
#include <vector>
#include <cstdio>
#include <string>
#include <cmath>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <unordered_map>
#define debug(x) cout << #x << ':' << x << endl
#define PII pair<int,int>
#define ll long long
#defi... | C++ | dbe12a665c374ce3745e20b4a8262eac | 7e5033bd5440d46071ffa8a293633f87 | 900 | PASSED |
#include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <list>
#include <utility>
#include <bitset>
#include <functional>
#include <cmath>
#include <string>
#include <cstring>
#include <fstream>
#include <ctime>
#include <cstdl... | C++ | dbe12a665c374ce3745e20b4a8262eac | f3421d00a5d4becbbd08b637faa7a9b8 | 900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ios ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
inline int read() {
char c(getchar());
int x(0);
while (!isdigit(c)) c = getchar();
while (isdigit(c)) x = (x << 3) + (x << 1) + (c ^ 48), c = getchar();
return x;
}
void write(int a... | C++ | fdbfe3108e701123693c6e0a6bf9a539 | 085e352b7686f69147ade37b3fb4b600 | 2,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
long long n,t,a[200002],b[200002],m[200002];
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin>>t;
while(t--){
cin>>n;
map<int,vector<pair<int, int>>>g;
for(int i=0;i<n;i++){
cin>>a[i]>>b[i]>>m[i];
g[a[i]+ b[i]-m[i]].push_bac... | C++ | fdbfe3108e701123693c6e0a6bf9a539 | 9d7cb22e359c1115d8da0c4805c1aeed | 2,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ii pair <int,int>
#define F first
#define S second
#define ever (;;)
const int N = 200100;
int T,n,a[N],b[N],c[N];
ii p[N];
vector <int> num[2001000];
vector < pair < ii , int > > v;
set <int> nums,s,solved;
set <ii> sol;
v... | C++ | fdbfe3108e701123693c6e0a6bf9a539 | 2dcb55b71c8a07d2e302b01dcde94f69 | 2,200 | PASSED |
#include <bits/stdc++.h>
#define endl '\n'
using namespace std;
struct dish
{
int mass,num;
dish(){};
dish(int masi, int ni)
{
mass=masi;
num=ni;
}
};
struct Point
{
int l,r,num2;
Point(){};
Point(int li, int ri, int ni)
{
l=li;
... | C++ | fdbfe3108e701123693c6e0a6bf9a539 | 7b9dfb6432a1070f95517f8283e81ef1 | 2,200 | PASSED |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define khan ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define ll long long
#define pii pair < int, int >
#define pb push_back
const int N = 1e6 + 5, mod = 998244353, INF = 1e9 + 7;
const ll BIG = 1e18;
cons... | C++ | fdbfe3108e701123693c6e0a6bf9a539 | fa3c6d182ecb924845e09613161dce9a | 2,200 | PASSED |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define khan ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define ll long long
#define pii pair < int, int >
#define pb push_back
const int N = 1e6 + 5, mod = 998244353, INF = 1e9 + 7;
const ll BIG = 1e18;
cons... | C++ | fdbfe3108e701123693c6e0a6bf9a539 | 60783e2c43ff2872ab5fb7493ebefcf7 | 2,200 | PASSED |
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fir first
#define sec second
#define pii pair<int,int>
#define print(a) cout << a.fir << " " << a.sec << endl;
typedef long long ll;
#define kon using
#define peko namespace
#define konpeko std
kon peko konpeko;
int n;
map<int,... | C++ | fdbfe3108e701123693c6e0a6bf9a539 | d479312cbd6a516f74bae0190fa9308c | 2,200 | PASSED |
#include <bits/stdc++.h>
#define int long long
#define rep(i,bbb,eee) for(int i=bbb;i<=eee;i++)
#define frep(i,bbb,eee) for(int i=bbb;i>=eee;i--)
#define mem(a,b) memset(a,b,sizeof(a))
#define cout(xxx) cout<<fixed<<setprecision(xxx)
#define endl "\n"
#define inf 0x3f3f3f3f
#define pb push_back
#define AC sig... | C++ | fdbfe3108e701123693c6e0a6bf9a539 | e7a28fb83dfc095806dda3e9dbd8168e | 2,200 | PASSED |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define int long long
#define watch(x) cerr << (#x) << " is " << (x) << endl;
#define endl '\n'
#define all(x) (x).begin(), (x).end()
#define sz(a) (int)(a).si... | C++ | fdbfe3108e701123693c6e0a6bf9a539 | 6d231720782a4e848a3710edceb46d71 | 2,200 | PASSED |
#include<bits/stdc++.h>
#include <cstdio>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define N 300005
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp ... | C++ | fdbfe3108e701123693c6e0a6bf9a539 | 4b70ce98c00cc9d844f553b0033e53ee | 2,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define db double
#define ll long long
#define pii pair<int,int>
#define rush() int Te; cin >> Te; while (Te--)
const int N = 2e5 + 5;
const int M = (N << 2);
const int P = 1e9 + 7;
ll n, m, T, Tres, A, B, C, D, l, r, x, add, a[N], b[N];
int main()
{
rush() ... | C++ | c63f5994543b136305a7ae2b9c744e13 | 5e3a6bd39ea64f0fe0399740e8022f9f | 2,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
int main() {
int t;
cin >> t;
while (t--) {
int n, m;
cin >> n >> m;
vector<pii> dishes(n);
ll balance = 0;
ll max_a = 0, max_b = 0;
ll total_eat... | C++ | c63f5994543b136305a7ae2b9c744e13 | bd646c703506ab006386fcf8ff4cff64 | 2,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
int main() {
int t;
cin >> t;
while (t--) {
int n, m;
cin >> n >> m;
vector<pii> dishes(n);
ll balance = 0;
ll max_a = 0, max_b = 0;
ll total_eat... | C++ | c63f5994543b136305a7ae2b9c744e13 | 2913f0f22d5bdb499f9435ffdb97cf00 | 2,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
int main() {
int t;
cin >> t;
while (t--) {
int n, m;
cin >> n >> m;
vector<pii> dishes(n);
ll balance = 0;
ll max_a = 0, max_b = 0;
ll total_eat... | C++ | c63f5994543b136305a7ae2b9c744e13 | ee39412083312988e3203468347a4382 | 2,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
int main() {
int t;
cin >> t;
while (t--) {
int n, m;
cin >> n >> m;
vector<pii> dishes(n);
ll balance = 0;
ll max_a = 0, max_b = 0;
ll total_eat... | C++ | c63f5994543b136305a7ae2b9c744e13 | f2643bf38be62917cf15accd3d9eb140 | 2,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main(){
int t;cin>>t;
while(t--){
long long n,m;cin>>n>>m;long long a[n],b[n];long long T=0,A=0,B=0, nm=n*m;
for(int i =0;i<n;i++){
cin>>a[i]>>b[i];
A+=min(a[i],m);B+=min(b[i],m);
T+=a[i]-b[i];
... | C++ | c63f5994543b136305a7ae2b9c744e13 | f0831b51c3984dd6b3ac1fe0f6ff6f13 | 2,200 | PASSED |
/*
Problem link:
Problems tags:
Ternary Search
Notes:
How to simplify thinking process?
*/
#include<bits/stdc++.h>
using namespace std;
// DEBUG
#define format(x) << #x << ": " << (x)
#define com << ", "
#define ndl << "\n"
#define debug1(x) cerr format(x) ndl;
#define debug2(x, y) cerr format... | C++ | c63f5994543b136305a7ae2b9c744e13 | 20cdad29de0d0806d7cba318c8a128e3 | 2,200 | PASSED |
/*
Problem link:
Problems tags:
Ternary Search
Notes:
How to simplify thinking process?
*/
#include<bits/stdc++.h>
using namespace std;
// DEBUG
#define format(x) << #x << ": " << (x)
#define com << ", "
#define ndl << "\n"
#define debug1(x) cerr format(x) ndl;
#define debug2(x, y) cerr format... | C++ | c63f5994543b136305a7ae2b9c744e13 | 70b9ca29f432fdc94932f604b4277b76 | 2,200 | PASSED |
/*
Problem link:
1. Understand
Input:
Output:
Conditions:
Separate various parts of the condition:
2. Plan
Connection between data and unknown:
Subproblem / Simpler problem:
Related problem:
Restate the problem:
Restate again:
Drop part of the condition:
Use all data?
Use ... | C++ | c63f5994543b136305a7ae2b9c744e13 | 5fa78319d9f3b1d14888039ba2a70a25 | 2,200 | PASSED |
/*
Problem link:
1. Understand
Input:
Output:
Conditions:
Separate various parts of the condition:
2. Plan
Connection between data and unknown:
Subproblem / Simpler problem:
Related problem:
Restate the problem:
Restate again:
Drop part of the condition:
Use all data?
Use ... | C++ | c63f5994543b136305a7ae2b9c744e13 | 8db935ff78b20334e084159593c09c03 | 2,200 | PASSED |
/*
Freedom of action
If there is no soul, there is still a body
*/
#pragma GCC optimize(3)
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/trie_policy.hpp>
#include <ext/pb_ds/priority_queue.hpp>
using namespace __gnu_pbds;
using ... | C++ | 67c748999e681fa6f60165f411e5149d | 10efd7070e94545bb8f5000cb7f90f7e | 2,300 | PASSED |
/*
Freedom of action
If there is no soul, there is still a body
*/
#pragma GCC optimize(3)
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/trie_policy.hpp>
#include <ext/pb_ds/priority_queue.hpp>
using namespace __gnu_pbds;
using ... | C++ | 67c748999e681fa6f60165f411e5149d | be166a703e7d38413d1dc969b2410e9e | 2,300 | PASSED |
/*
Freedom of action
If there is no soul, there is still a body
*/
#pragma GCC optimize(3)
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/trie_policy.hpp>
#include <ext/pb_ds/priority_queue.hpp>
using namespace __gnu_pbds;
using ... | C++ | 67c748999e681fa6f60165f411e5149d | d84bf31a07e1319b45f3271a217e3c95 | 2,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define fast ios::sync_with_stdio(false);cin.tie(0);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const string symp = "R... | C++ | 67c748999e681fa6f60165f411e5149d | b09f5029e141413b1650593e3c5d3989 | 2,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int n,m,ne[4000010],loop[4000010],T,dis[4000010],last[4000010];
int indeg[4000010];
char grid[2010][2010];
bool vis[4000010];
queue<int>v;
int get(int x,int y) {
return m*(x-1)+y;
}
void topsort() {
queue<int>nodes;
for(int i=1;i<=n*m;i++) {
if(indeg... | C++ | 67c748999e681fa6f60165f411e5149d | 03a633d9950abba76e6835c76c185f30 | 2,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int const maxn = 2005;
char a[maxn][maxn];
int dp[maxn][maxn];
pair < short int, short int > p[maxn][maxn];
int n, m;
void solve() {
cin >> n >> m;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= m; ++j) {
cin >> a[i][j];
... | C++ | 67c748999e681fa6f60165f411e5149d | 650a287beed99e68bcef3cc4f67fbae8 | 2,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll n,m,k;
int f;
int d;
void solve()
{
cin >> n >> m;
vector<int> g1[n*m],g(n*m);
vector<int> c(n*m,0),v(n*m,0);
for(int i=0;i<n*m;i++) g[i] = -1,v[i] = 0,c[i] = 0;
vector<char> in(n*m,0),in1(n*m,0);
for(int i=0;i<n;i++){
string s;
... | C++ | 67c748999e681fa6f60165f411e5149d | 8ef6034d9f50ec064e4edff1e8d744f0 | 2,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int t,n,m,cnt;
char a[2010][2010];
int dis[2010][2010],vis[2010][2010];
pair<int,int>path[2001*2001];
int dfs(int x,int y)
{
path[++cnt]={x,y};
if(vis[x][y]||x<1||x>n||y<1||y>m){
return dis[x][y];
}
vis[x][y]=1;
if(a[x][y]=='D')dis[x][y]=dfs(x+1,y)+1;
e... | C++ | 67c748999e681fa6f60165f411e5149d | a29f7377268831c917f11c3286577dd2 | 2,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int t,n,m,cnt=0;
char a[2010][2010];
int vis[2010][2010],dis[2010][2010];
pair<int,int>path[2011*2010];
int dfs(int x,int y)
{
path[++cnt]={x,y};
if(vis[x][y]||x<1||x>n||y<1||y>m){
return dis[x][y];
}
vis[x][y]=1;
if(a[x][y]=='D')dis[x][y]=dfs(x+1,y)+1;
... | C++ | 67c748999e681fa6f60165f411e5149d | c13896b62933912192ce5dee02b212c5 | 2,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int t,n,m,cnt=0,f;
char a[2010][2010];
int vis[2010][2010],dis[2010][2010];
pair<int,int>path[2011*2010];
int dfs(int x,int y)
{
path[++cnt]={x,y};
if(vis[x][y]||x<1||x>n||y<1||y>m){
return dis[x][y];
}
vis[x][y]=1;
if(a[x][y]=='D')dis[x][y]=dfs(x+1,y)+1;... | C++ | 67c748999e681fa6f60165f411e5149d | 26dac1d7ddcd14cb532db61ad7510a61 | 2,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main(){
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int t;
cin>>t;
while(t--){
vector<int>value;
int n,z=0;
cin>>n;
int arr[n];
int arr1[n];
for(int i=0;i<... | C++ | c3ee6419adfc85c80f35ecfdea6b0d43 | a397d2097f682075b733363ddcad65b9 | 1,200 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main(){
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int t;
cin>>t;
while(t--){
int n,count=0,katti=1;
cin>>n;
int arr[n];
for(int i=0;i<n;i++){
cin>>arr[i];
... | C++ | c3ee6419adfc85c80f35ecfdea6b0d43 | cf05a681b3690baba73f0a6f536629c7 | 1,200 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main(){
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int t;
cin>>t;
while(t--){
int n,count=0,katti=1;
cin>>n;
int arr[n];
for(int i=0;i<n;i++){
cin>>arr[i];
... | C++ | c3ee6419adfc85c80f35ecfdea6b0d43 | a170c9c6474005d443daf310ef6c3e7f | 1,200 | PASSED |
#include <bits/stdc++.h>
#define int long long
using namespace std;
struct Node {
int x, y, z;
};
void solve() {
int n;
cin >> n;
vector<int> arr(n + 3);
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
if (arr[n - 1] > arr[n]) {
cout << -1 << '\n';
return;
}
vector<N... | C++ | c3ee6419adfc85c80f35ecfdea6b0d43 | 735cabdab83894ae4d9f51b42cb4d8c4 | 1,200 | PASSED |
#include <bits/stdc++.h>
#define int long long
using namespace std;
struct Node {
int x, y, z;
};
void solve() {
int n;
cin >> n;
vector<int> arr(n + 3);
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
if (arr[n - 1] > arr[n]) {
cout << -1 << '\n';
return;
}
vector<N... | C++ | c3ee6419adfc85c80f35ecfdea6b0d43 | a0b47bf9894405af02c98f705b2ddf28 | 1,200 | PASSED |
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#define besmellah ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const ll INF = 1e9 + 7;
const int OO = 0x... | C++ | c3ee6419adfc85c80f35ecfdea6b0d43 | 8a65f502f62e0b06a0184f7b0be4961f | 1,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main(){ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int a;cin>>a;
while(a--){
long long b,t=1;cin>>b;vector<long long> v(b);
for(int c=0;c<b;c++){cin>>v[c];}
long long n=0;
if(v[b-2]<=v[b-1]){n=v[b-2]-v[b-1];
if(n<=v[b-2]&&n<=v[b-1]){
... | C++ | c3ee6419adfc85c80f35ecfdea6b0d43 | b12f208ef1d5976692d885794e4db4ae | 1,200 | PASSED |
/*-----------------------------------------------------------------
Gamers Never Quit.
-------------------------------------------------------------------*/
#include <bits/stdc++.h>
#define BOOST ios_base::sync_with_stdio(false); cin.tie(NULL);
#define empb emplace_back
#define mpr make_... | C++ | c3ee6419adfc85c80f35ecfdea6b0d43 | 455c3c376ccbcab6be062346de966e20 | 1,200 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fin(s) freopen(s, "r", stdin);
#define fout(s) freopen(s, "w", stdout);
#define ui unsigned int
#define ull unsigned long long
#define ld long double
#define fi first
#define se second
#define pb push_back
#define pk pop_back
#define ... | C++ | c3ee6419adfc85c80f35ecfdea6b0d43 | 27ffd096848ff179fb6dac5f5f704691 | 1,200 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fin(s) freopen(s, "r", stdin);
#define fout(s) freopen(s, "w", stdout);
#define ui unsigned int
#define ull unsigned long long
#define ld long double
#define fi first
#define se second
#define pb push_back
#define pk pop_back
#define ... | C++ | c3ee6419adfc85c80f35ecfdea6b0d43 | 977d4c841aea1eaa0cf687736ee60e99 | 1,200 | PASSED |
// LUOGU_RID: 93030885
#include <iostream>
#include <algorithm>
using namespace std;
/*int max(int a,int b)
{
if(a>=b) return a;
else return b;
}*/
int main()
{
int N,n,a[200000+50]={0},cnt=0;
scanf("%d",&N);
while(N--)
{
scanf("%d",&n);
for(int j=1;j<=n;j++) scanf("%d",&a[j]);
... | C++ | 255abf8750541f54d8ff0f1f80e1f8e7 | 8fa0b7a59794052cf670b28b5a335f27 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
int ans2[N];
int main()
{
int t;
cin >> t;
while (t--)
{
int n, ans = 0;
cin >> n;
for (int i = 1; i <= n; i++)
{
cin >> ans2[i];
}
for (int i = 2; i < n; i++... | C++ | 255abf8750541f54d8ff0f1f80e1f8e7 | 6cc1804346b6893d280c72f45980de5b | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 200000 + 10;
int t, n;
int a[maxn];
int main(){
cin>>t;
while(t--){
cin>>n;
for(int i = 1;i <= n;++i){
cin>>a[i];
}
int ans = 0;
for(int i = 2;i < n;++i){
if(a[i] > ... | C++ | 255abf8750541f54d8ff0f1f80e1f8e7 | 1fbe112fbb17fcfd7c1560844f482ae0 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int read() {
int x=0, sg=1; char c=getchar();
while (c!='-'&&!isdigit(c)) c=getchar();
if (c=='-') sg=-1, c=getchar();
while (isdigit(c)) x=x*10+c-'0', c=getchar();
return x*sg;
}
const int N=1000005;
int a[N], b[N];
int main() {
int... | C++ | 255abf8750541f54d8ff0f1f80e1f8e7 | 265968a00743d8af08861af083179bfe | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int read() {
int x=0, sg=1; char c=getchar();
while (c!='-'&&!isdigit(c)) c=getchar();
if (c=='-') sg=-1, c=getchar();
while (isdigit(c)) x=x*10+c-'0', c=getchar();
return x*sg;
}
const int N=1000005;
int a[N], b[N];
int main() {
int... | C++ | 255abf8750541f54d8ff0f1f80e1f8e7 | 5b25909f739ac5f6395f09690f3368d6 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
//freopen("in.txt","r",stdin);
int t,n,a,b,f[200010],cnt;
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
for(int i=1;i<=n;++i)
scanf("%d",&f[i]);
a=0;b=0;cnt=0;
for(int i=2;i<n;++i)
{
if(f[i-1]<f[i]&&f[i]>f[i+1])
{
if(!... | C++ | 255abf8750541f54d8ff0f1f80e1f8e7 | e2b28fa85b3f4dcd85e7d6226bfe628a | 800 | PASSED |
#include <iostream>
#include <vector>
using namespace std;
int a[200010];
int main() {
int t;
scanf("%d", &t);
while(t -- ) {
int n;
scanf("%d", &n);
for(int i = 1; i <= n; i ++ )
scanf("%d", a + i);
vector<int> v;
for(int i = 2; i <= n... | C++ | 255abf8750541f54d8ff0f1f80e1f8e7 | 863866e935c7168329d24a8b9ae02ba5 | 800 | PASSED |
#include<iostream>
#include<algorithm>
using namespace std;
#define N 1000100
#define ll long long
int a[N];
int main()
{
int t;
cin>>t;
while(t--)
{
int n ;
cin>>n;
int ans = 0 ;
for(int i = 1 ; i <= n ; i ++)
cin>>a[i];
a[n+1] = 1e9;... | C++ | 255abf8750541f54d8ff0f1f80e1f8e7 | 62b35c9d8900305af296c274435d9488 | 800 | PASSED |
#include <iostream>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
int n,ans=0;
cin>>n;
int a[200005];
for(int i=0;i<n;i++)
{
cin>>a[i];
}
for(int i=1;i<n-1;i++)
{
if(a[i]>a[i-1]&&a[i]... | C++ | 255abf8750541f54d8ff0f1f80e1f8e7 | aa2815d509e428e6d20ce109c7515e25 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
inline int read() {
int x = 0, f = 0;
char ch = getchar();
while(!isdigit(ch)) {
f ^=! (ch ^ 45);
ch=getchar();
}
while(isdigit(ch)) {
x = (x << 1) + (x << 3) + (ch ^ 48);
ch=getchar();
}
return f?-x:x;
}
inline void write(int x){
if(x < 0) ... | C++ | 255abf8750541f54d8ff0f1f80e1f8e7 | 60d05fa63bc0dce116542a018e5a70bc | 800 | PASSED |
#include<stdio.h>
#include<iostream>
#include<cmath>
#include<algorithm>
using namespace std;
const int N = 100005;
int n,a[N],b[N],c[N],res=0;
int main()
{
std::ios::sync_with_stdio(false);
int t;
cin>>t;
while(t--)
{
int n,sum=0;
cin>>n;
for(int i=0;i<n;i++)
{
... | C++ | 7fca54a73076ddfeb30b921b9e341f26 | 196600750711c12fb215cf9eee63e8c2 | 800 | PASSED |
#pragma GCC optimize(2)
#include<bits/stdc++.h>
#define int long long
#define endl '\n'
#include<ctime>
#include<random>
using namespace std;
int v[35];
int a[105];
signed main() {
//ios::sync_with_stdio(false);
int t;cin >> t;
while(t--){
int n;cin >> n;
for(int i=1;i<=n;i++){
... | C++ | 7fca54a73076ddfeb30b921b9e341f26 | 3b72bedcdb4d68a957fd5c09e7f61234 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int l = 1e5 + 7;
int n,m;
int a[3000];
int cmo(string s,string sb){
if (s.size() == sb.size())return s > sb;
else return s.size() > sb.size();
}
int solve(){
int o = 0;
cin >> n;
for (int i = 0; i < n; ++i) {
int k;
int oo = o;
... | C++ | 7fca54a73076ddfeb30b921b9e341f26 | d69b4cdf3ffd8a92d4b0fd943d31a4dc | 800 | PASSED |
#include<iostream>
int main(){int t,n,x,y;std::cin>>t;while(t--){std::cin>>n;for(x=0;n;n--)std::cin>>y,x|=y;std::cout<<x<<'\n';}}
| C++ | 7fca54a73076ddfeb30b921b9e341f26 | f4dfcc15f888fc743ca95c37347bed41 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define sz(v) (int)v.size()
#define all(x) (x).begin(), (x).end()
#define mp(a,b) make_pair(a,b)
#define pb(x) push_back(x)
#define eb(x) emplace_back(x)
#define F first
#define S second
#define endl ... | C++ | 7fca54a73076ddfeb30b921b9e341f26 | ea95a9c53c5410a89dd71e3f8d072dd9 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
long long a[105];
int main()
{
int t,n;
scanf("%d",&t);
while(t--){
scanf("%d",&n);
long long re=0;
for(int i=1;i<=n;i++){
scanf("%lld",&a[i]);
re|=a[i];
}
printf("%lld\n",re);
}
return 0 ;
}
| C++ | 7fca54a73076ddfeb30b921b9e341f26 | c6493ea23a912df5179db003149e86dc | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main(){
int t,n;
scanf("%d",&t);
while(t--){
int a,b;
scanf("%d%d",&n,&a);
while(n > 1){
scanf("%d",&b);
a |= b;
n--;
}
cout<<a<<endl;
}
return 0;
}
| C++ | 7fca54a73076ddfeb30b921b9e341f26 | 228bbb0cea41c96a354827935038dcad | 800 | PASSED |
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#pragma GCC optimize(2)
#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef long long LL;
typedef pair<int,int> PII;
const int N = 1010, MOD = 1e9+7;
inline void solve()
{
int n;cin>>n;
LL res=0;
for(int i=0;i<n;i++)
{
LL x;... | C++ | 7fca54a73076ddfeb30b921b9e341f26 | 79e44fa5c930ea9a1fafd43d05eec6a0 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int N = 1e5+50;
typedef long long ll;
bool flag[32];
int main(){
int t;
scanf("%d",&t);
while(t--){
memset(flag, false, sizeof flag);
int n;
ll ans = 0;
scanf("%d",&n);
for(int i = 1;i <= n;i++){
int x;
scanf("%d",&x);
for(int j = 0;j <= 30;j++)... | C++ | 7fca54a73076ddfeb30b921b9e341f26 | d194fe8829ebb1ef4eca4dc644291b40 | 800 | PASSED |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <experimental/random>
class EmptyList { };
class EmptyDict { };
template <class T, class S>
struct CommonType { };
struct String;
template <class T>
struct List {
std::shared_ptr<std::vector<T>> inne... | C++ | 7fca54a73076ddfeb30b921b9e341f26 | 5a747df9269984309957a1e51ad309fe | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
namespace FastIO{
FILE *_fin=stdin,*_fout=stdout;
#ifndef LOCAL
const int MXBUF=1<<21;
const int BRDBUF=MXBUF-1;
#define FastR
#define FastW
#endif
#ifdef FastR
char bufr[MXBUF],*_head,*_tail;
inline char GetChar(){
if(_head!=_tail) goto End;
_he... | C++ | 1c03ad9c0aacfbc9e40edc018a2526d3 | d5053b3a41491ec323e398002813948f | 2,200 | PASSED |
#include <bits/stdc++.h>
#include<iostream>
using namespace std;
namespace FastIO{
FILE *_fin=stdin,*_fout=stdout;
#define Fast
#ifdef Fast
int wr=-1;
const int MXBUF=1<<21;
const int BRDBUF=MXBUF-1;
char bufr[MXBUF],bufw[MXBUF],*_head,*_tail;
inline char GetChar(){
if(_head!=_tail) goto End;
_... | C++ | 1c03ad9c0aacfbc9e40edc018a2526d3 | f46f8d8800fc43f7ceed454f04487b82 | 2,200 | PASSED |
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; ... | C++ | 1c03ad9c0aacfbc9e40edc018a2526d3 | 14012bdc46e98bde731b85d394f3cb26 | 2,200 | PASSED |
#ifdef LOCAL
#include "debug.cpp"
#else
#include <bits/stdc++.h>
using namespace std;
#define dbg(...)
#endif
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define mem(x, n) memset(x, n, sizeof(x))
#define all(x) x.begin(), x.end()
#define sz(x) ((int)(x).size())
#define... | C++ | 1c03ad9c0aacfbc9e40edc018a2526d3 | 915ecfb6edbd66c66ffa41b4ddf56e2e | 2,200 | PASSED |
#ifdef LOCAL
#include "debug.cpp"
#else
#include <bits/stdc++.h>
using namespace std;
#define dbg(...)
#endif
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define mem(x, n) memset(x, n, sizeof(x))
#define all(x) x.begin(), x.end()
#define sz(x) ((int)(x).size())
#define... | C++ | 1c03ad9c0aacfbc9e40edc018a2526d3 | fec52b6d5e41bf0dc61d42f225bd1449 | 2,200 | PASSED |
#ifdef LOCAL
#include "debug.cpp"
#else
#include <bits/stdc++.h>
using namespace std;
#define dbg(...)
#endif
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define mem(x, n) memset(x, n, sizeof(x))
#define all(x) x.begin(), x.end()
#define sz(x) ((int)(x).size())
#define... | C++ | 1c03ad9c0aacfbc9e40edc018a2526d3 | c99bd234c4bd14e3c1dffe9917cceee6 | 2,200 | PASSED |
#ifdef LOCAL
#include "debug.cpp"
#else
#include <bits/stdc++.h>
using namespace std;
#define dbg(...)
#endif
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define mem(x, n) memset(x, n, sizeof(x))
#define all(x) x.begin(), x.end()
#define sz(x) ((int)(x).size())
#define... | C++ | 1c03ad9c0aacfbc9e40edc018a2526d3 | 3f3e5048f5bc72b1757bed52a889024f | 2,200 | PASSED |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define fr first
#define sc second
#define all(x) (x).begin(), (x).end()
#define pw(x) (1ll << x)
#define sz(x) (int)((x).size())
#define pb push_back
#define endl '\n'
///
using namespace std;
using names... | C++ | 1c03ad9c0aacfbc9e40edc018a2526d3 | 33f80a9912d681c2d0de584baff3166e | 2,200 | PASSED |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 2e5 + 1;
vector<pair<int,int>> g[N];
vector<int> dg[N];
set<int> s;
int c[N], x[N], vis[N];
void dfs(int node) {
for(auto [i, e] : g[node]) {
if(c[i] == -1) {
c[i] = c[node] ^ 1;
dfs(i);
... | C++ | 1c03ad9c0aacfbc9e40edc018a2526d3 | aa83e7e3075aae2ee485da32fe8b755a | 2,200 | PASSED |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 2e5 + 1;
vector<pair<int,int>> g[N];
vector<int> dg[N];
set<int> s;
int c[N], x[N], vis[N];
void dfs(int node) {
for(auto [i, e] : g[node]) {
if(c[i] == -1) {
c[i] = c[node] ^ 1;
dfs(i);
... | C++ | 1c03ad9c0aacfbc9e40edc018a2526d3 | 3f1e0e9f7d5ded044d8f6552cd7a0d1d | 2,200 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define dd double
#define sg string
#define modd 1000000007
#define en "\n"
#define sc(a) scanf("%lld",&a);
#define f(i,a,n) for(ll i=a;i<n;i++)
#define ps(a) printf("%lld ",a);
#define pn(a) printf("%lld\n",a);
int main()
{
ll ... | C++ | fbb6d21b757d8d56396af1253ec9e719 | 67e34b94d3ff8c9ff9cf3b7f0326d0c7 | 1,800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define dd double
#define sg string
#define modd 1000000007
#define en "\n"
#define sc(a) scanf("%lld",&a);
#define f(i,a,n) for(ll i=a;i<n;i++)
#define ps(a) printf("%lld ",a);
#define pn(a) printf("%lld\n",a);
int main()
{
ll ... | C++ | fbb6d21b757d8d56396af1253ec9e719 | 0c49aad7a0bf2c1e1d4b0dcd8160e25a | 1,800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define dd double
#define sg string
#define modd 1000000007
#define en "\n"
#define sc(a) scanf("%lld",&a);
#define f(i,a,n) for(ll i=a;i<n;i++)
#define ps(a) printf("%lld ",a);
#define pn(a) printf("%lld\n",a);
int main()
{
ll ... | C++ | fbb6d21b757d8d56396af1253ec9e719 | 9cbcb57017746b9551d83a9a9fc57068 | 1,800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define dd double
#define sg string
#define modd 1000000007
#define en "\n"
#define sc(a) scanf("%lld",&a);
#define f(i,a,n) for(ll i=a;i<n;i++)
#define ps(a) printf("%lld ",a);
#define pn(a) printf("%lld\n",a);
int main()
{
ll ... | C++ | fbb6d21b757d8d56396af1253ec9e719 | 5282db46c6520855fae1d852ee7e2390 | 1,800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define dd double
#define sg string
#define modd 1000000007
#define en "\n"
#define sc(a) scanf("%lld",&a);
#define f(i,a,n) for(ll i=a;i<n;i++)
#define ps(a) printf("%lld ",a);
#define pn(a) printf("%lld\n",a);
int main()
{
//f... | C++ | fbb6d21b757d8d56396af1253ec9e719 | 6af439f18fd41001edb83fb7e5a4e7f9 | 1,800 | PASSED |
#include<bits/stdc++.h>
#include<vector>
#include<set>
#include<map>
#include<queue>
using namespace std;
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR(i,a,b) for(int i=a ; i < b ; ++i)
#define rep(i,n) FOR(i,0,n)
#define rev(i,n) for(int i=n-1;i>=0;i--)
#define INF ... | C++ | fbb6d21b757d8d56396af1253ec9e719 | 4cdfcf6a5d706b8828578bfc61a6e83d | 1,800 | PASSED |
#include<bits/stdc++.h>
#include<vector>
#include<set>
#include<map>
#include<queue>
using namespace std;
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define rev(i,n) for(int i=n-1;i>=0;i--)
#define INF INT_MAX
#define pb push_back
#define tc int t;cin>>t;while(t--)
#define l... | C++ | fbb6d21b757d8d56396af1253ec9e719 | 776e56513a052d5e3145666a815b9ba4 | 1,800 | PASSED |
#include<bits/stdc++.h>
#include<vector>
#include<set>
#include<map>
#include<queue>
using namespace std;
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define rev(i,n) for(int i=n-1;i>=0;i--)
#define INF INT_MAX
#define pb push_back
#define tc int t;cin>>t;while(t--)
#define l... | C++ | fbb6d21b757d8d56396af1253ec9e719 | d1fc32dd638ee78304d2255273b6e730 | 1,800 | PASSED |
#include<bits/stdc++.h>
#include<vector>
#include<set>
#include<map>
#include<queue>
using namespace std;
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define rev(i,n) for(int i=n-1;i>=0;i--)
#define INF INT_MAX
#define pb push_back
#define tc int t;cin>>t;while(t--)
#define l... | C++ | fbb6d21b757d8d56396af1253ec9e719 | 38b847c7d263a1f357d694e399470fac | 1,800 | PASSED |
#include<bits/stdc++.h>
#include<vector>
#include<set>
#include<map>
#include<queue>
using namespace std;
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define rev(i,n) for(int i=n-1;i>=0;i--)
#define INF INT_MAX
#define pb push_back
#define tc int t;cin>>t;while(t--)
#define l... | C++ | fbb6d21b757d8d56396af1253ec9e719 | 47bd691d298815bf41c6fb537f1ed114 | 1,800 | PASSED |
#include<bits/stdc++.h>
#define gcd(a,b) __gcd(a,b)
#define debug(x) cout<<#x<<'='<<(x)<<endl
#define setp setiosflags(ios::fixed)<<setprecision
#define IOS ios_base::sync_with_stdio(false),cin.tie(0)
#define LL long long
#define pii pair<int,int>
#define vc vector
#define pb push_back
#define epb emplace_back... | C++ | 046d0c0c73aad1a5dc295af1a43e0fc6 | 9d4dd105831b063c35b41a8ecf125dc0 | 2,800 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.