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 <stdio.h>
#include <stdlib.h>
//two elevators
int main()
{int x=0;
int y=0;
int n,a,b,c;
int t,i=1;
scanf("%d",&t);
int res[t];
for (i=1;i<=t;i++){
scanf("%d %d %d",&a,&b,&c);
if (a==1){printf("1\n");continue;}
if (b<c){y=c-b+c;}
else {y=b;}
if (a<y){printf("1... | C | aca2346553f9e7b6e944ca2c74bb0b3d | 39ec6b84ba28b2a7adefbc9ede044f60 | 800 | PASSED |
#include <stdio.h>
#include <stdlib.h>
//two elevators
int main()
{int x=0;
int y=0;
int n,a,b,c;
int t,i=1;
scanf("%d",&t);
int res[t];
for (i=1;i<=t;i++){
scanf("%d %d %d",&a,&b,&c);
if (a==1){res[i]=1;continue;}
if (b<c){y=c-b+c;}
else {y=b;}
if (a<y){res[i]=1;}
... | C | aca2346553f9e7b6e944ca2c74bb0b3d | 8d90f97c281eba50ea85f08fcf28a42f | 800 | PASSED |
#include <stdio.h>
#include <stdlib.h>
int main()
{
int e ;
scanf("%d" ,&e);
int t[3];
while(e--){
for (int j=0;j<3;j++)
{
scanf("%d",&t[j]);
}
int b = abs(t[1]-t[2])+t[2] ;
if (b == t[0]){
printf("3");
... | C | aca2346553f9e7b6e944ca2c74bb0b3d | 34a74a8355bd4cbc9eb647fd8203008a | 800 | PASSED |
#include<stdio.h>
int main()
{
int a,b,c,n;
scanf("%d",&n);
while(n--){
scanf("%d%d%d",&a,&b,&c);
if(a<b)printf("1\n");
else if(a>b&&b>c)printf("2\n");
else if(b<a&&b<c){
if(2*c-b>a)printf("1\n");
else if(2*c-b<a)printf("2\n");
else printf("3\n");
}
... | C | aca2346553f9e7b6e944ca2c74bb0b3d | 00d7ea873a690ad2900d9a25b8a8b7ed | 800 | PASSED |
#include <stdlib.h>
#include <stdio.h>
#include <math.h>
int main ()
{
int i, t,a,b,c;
scanf("%d",&t);
for (i=0 ;i<t;i++) {
scanf ("%d%d%d",&a,&b,&c);
if (abs(c-b)+c > a)
{
printf("1\n");
}
else if (a > abs(c-b)+c)
{
printf("2\n");
}
e... | C | aca2346553f9e7b6e944ca2c74bb0b3d | 0ac0f9b263122f2c32fdd166c4775e2b | 800 | PASSED |
#include<stdio.h>
int main()
{
int t, i, a, b, c, l;
scanf("%d", &t);
for (i = 1; i <= t;i++)
{
scanf("%d %d %d", &a, &b, &c);
if(c>b)
{
l = (c-b)+c;
}
else{
l = b;
}
if(a==l)
{
printf(... | C | aca2346553f9e7b6e944ca2c74bb0b3d | 3ac8a18f6435aeb7ed53bf7789bf2ff0 | 800 | PASSED |
#include<stdio.h>
int main()
{
int t;
scanf("%d\n",&t);
while(t--)
{
int a,b,c;
scanf("%d%d%d\n",&a,&b,&c);
int s1,s2;
s1=a;
//判断初始电梯上，下
if(b<c)
{
s2=c-b+c;
}
else{
s2=b;
}
if(s1<s2)
printf("1\n");
else if(s1>s2)
printf("2\n");
else
printf("3\n");
}
return 0;
}
... | C | aca2346553f9e7b6e944ca2c74bb0b3d | 6effaa7a598c5531c4cd0346a2a473d6 | 800 | PASSED |
#include<stdio.h>
int main()
{
int n,d1,d2,i;
long long int a,b,c;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%lld %lld %lld",&a,&b,&c);
d1=a-1;
d2=abs(c-b)+c-1;
if(d1<d2)
printf("1\n");
else if(d2<d1)
printf("2\n");
else
... | C | aca2346553f9e7b6e944ca2c74bb0b3d | 839a63d03391c6935a4ec8b46900547a | 800 | PASSED |
#include<stdio.h>
int main()
{
int t, a, b, c;
int arr[10000][3];
scanf("%d", &t);
for (int d = 0; d < t; d++)
{
for (int e = 0; e < 3; e++)
{
scanf("%d", &arr[d][e]);
}
}
for (int d = 0; d < t; d++)
{
int f = 0;
if (arr[d][1] > arr[d][2])
{
f = arr[d][1];
}
else
{
f = arr[d][2] - arr... | C | aca2346553f9e7b6e944ca2c74bb0b3d | f20668b952e2f36b2231a4e35e69a7cc | 800 | PASSED |
#include <iostream>
#include <vector>
#include <string>
#include<algorithm>
using namespace std;
long long n,t ;
vector<int> x,y ;
vector<int> z ;
int main()
{
cin>>t;
for (int i=0;i<t;i++){
int s;
cin >> n;
x.clear();
y.clear();
z.clear();
... | C++ | 7c8884b72dcc3c51e0696eec8d6aa8ef | 4974b657b79963b8ddb0df3abfafff0f | 1,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
void Emsawy() {
#ifdef Online_Judge
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
}
typedef long long ll;
#define _3isssa ios::sync_with_stdio(false), cin.tie(nullptr) , cout.tie(nullptr);
#define all(x) ... | C++ | 7c8884b72dcc3c51e0696eec8d6aa8ef | ba7747ea56381cc6f9b3416c2262e965 | 1,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
void Emsawy() {
#ifdef Online_Judge
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
}
typedef long long ll;
#define _3isssa ios::sync_with_stdio(false), cin.tie(nullptr) , cout.tie(nullptr);
#define all(x) ... | C++ | 7c8884b72dcc3c51e0696eec8d6aa8ef | b8432b64fee231194004090890fc9aeb | 1,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
void Emsawy() {
#ifdef Online_Judge
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
}
typedef long long ll;
#define _3isssa ios::sync_with_stdio(false), cin.tie(nullptr) , cout.tie(nullptr);
#define all(x) ... | C++ | 7c8884b72dcc3c51e0696eec8d6aa8ef | 57a753e8dbc91e0b52ba3bcefe415c79 | 1,200 | PASSED |
#include <bits/stdc++.h>
#define N '\n'
#define ll long long
#define L size()
#define pb push_back
#define mk make_pair
#define S(g) g.begin(),g.end()
#define Fast ios_base::sync_with_stdio(false);cin.tie(NULL);
using namespace std;
void solve()
{
int a,b,c,d,i,j,k,l;
cin>>a;
int xx[a+10];
... | C++ | 7c8884b72dcc3c51e0696eec8d6aa8ef | d98a3c7d9069bc1c994cbabe7d10500b | 1,200 | PASSED |
#include <bits/stdc++.h>
#define N '\n'
#define ll long long
#define L size()
#define pb push_back
#define mk make_pair
#define S(g) g.begin(),g.end()
#define Fast ios_base::sync_with_stdio(false);cin.tie(NULL);
using namespace std;
void solve()
{
ll a,b,c,d,i,j,k,l;
cin>>a;
ll xx[a+10];
... | C++ | 7c8884b72dcc3c51e0696eec8d6aa8ef | 596ac25967530d1cb1c751c089716b5e | 1,200 | PASSED |
#include <bits/stdc++.h>
#define N '\n'
#define ll long long
#define L size()
#define pb push_back
#define mk make_pair
#define S(g) g.begin(),g.end()
#define Fast ios_base::sync_with_stdio(false);cin.tie(NULL);
using namespace std;
void solve()
{
ll a,b,c,d,i,j,k,l;
cin>>a;
ll xx[a+10];
... | C++ | 7c8884b72dcc3c51e0696eec8d6aa8ef | d4b797ff3e8bb176633ed3a3a69603d0 | 1,200 | PASSED |
#include <bits/stdc++.h>
#include <string.h>
using namespace std;
#define endl '\n'
typedef long long ll;
typedef unsigned long long ull;
void fast_IO(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
const ll N = 1e5+9;
ll cost[N];
ll budget[N];
ll pos[N];
ll neg[N];
void ... | C++ | 7c8884b72dcc3c51e0696eec8d6aa8ef | b090ddda80e923e107e921c68c7f524b | 1,200 | PASSED |
#include<bits/stdc++.h>
using namespace std;
void solve()
{
int n;
cin>>n;
int cnt = 0;
vector<long long> c(n), d(n);
vector<pair<int, int>> a(n);
for (auto &i : c)
cin>>i;
for (auto &i : d)
cin>>i;
for (int i = 0; i < n; i++) {
a[i].first = d[i]... | C++ | 7c8884b72dcc3c51e0696eec8d6aa8ef | 7365d44e3e518ed005fad4a59b5c6899 | 1,200 | PASSED |
#include <iostream>
#include<bits/stdc++.h>
#define ll long long
#define endl '\n'
using namespace std;
int main()
{
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int t = 1;
cin>>t;
while(t--)
{
int n; cin>>n;
int x[n],y[n];
vector<int> a;
mu... | C++ | 7c8884b72dcc3c51e0696eec8d6aa8ef | 71417d59fdb5fb84ad3a66868f047362 | 1,200 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define fr ios::sync_with_stdio(false); cin.tie(nullptr);
#define ln '\n'
#define L first
#define R second
#define array2 array<int, 2>
#define len(s) (int)s.size()
#define sel(j, m) " \n"[j == (m - 1)]
#define rep(i, l, r) for(__typeof(r) i = l; i != r; ++i)
... | C++ | 904af5d6a9d84b7b7b7ff8d63e6f0254 | eac0bb250182ad4eda2fffc712fa650f | 2,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef int64_t ll;
#define pii(x) array<int,x>
#define sz(x) int(x.size())
#define all(x) x.begin(), x.end()
#define dbug(x) cerr<<"Value of "<<#x<<": "<<x<<"\n"
const int MOD = 1e9+7;
template<typename T>
struct minQueue{
stack<pair<T,T> >A,B;
minQueue()... | C++ | 904af5d6a9d84b7b7b7ff8d63e6f0254 | 3853ad3e6e118d17ac607805e82be980 | 2,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define fr ios::sync_with_stdio(false); cin.tie(nullptr);
#define ln '\n'
#define L first
#define R second
#define array2 array<int, 2>
#define len(s) (int)s.size()
#define sel(j, m) " \n"[j == (m - 1)]
#define rep(i, l, r) for(__typeof(r) i = l; i != r; ++i)
... | C++ | 904af5d6a9d84b7b7b7ff8d63e6f0254 | 48326cb6151f668417107b2fc573f783 | 2,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define LL long long int
#define PLL pair<LL, LL>
#define tLL(A) int64_t(A)
LL LL0 = 0, LL1 = 1, inf = LONG_LONG_MAX;
LL mod = 1000000007;
void sol() {
LL n, m, h, k, h1, h2, p1, p2, s1, s2, t, y, z, s, ss;
string a, b;
cin >> a >> b;
if (a.... | C++ | 904af5d6a9d84b7b7b7ff8d63e6f0254 | 0a54184f01e468aeb99358061148ec00 | 2,100 | PASSED |
#include<bits/stdc++.h>
#pragma GCC optimize ("Ofast")
#pragma GCC target ("avx2")
using namespace std;
#define mod 1000000007
#define mod9 998244353
#define int long long
#define pi acos(-1)
#define fastttt std::ios::sync_with_stdio(false);std::cin.tie(NULL);std::cout.tie(NULL);
#define endl "\n"
mt19937 rng... | C++ | 904af5d6a9d84b7b7b7ff8d63e6f0254 | 2661cf88a32799b8e930dd97e24f3484 | 2,100 | PASSED |
#include<bits/stdc++.h>
#pragma GCC optimize ("Ofast")
#pragma GCC target ("avx2")
using namespace std;
#define mod 1000000007
#define mod9 998244353
// #define int long long
#define pi acos(-1)
#define fastttt std::ios::sync_with_stdio(false);std::cin.tie(NULL);std::cout.tie(NULL);
#define endl "\n"
mt19937 ... | C++ | 904af5d6a9d84b7b7b7ff8d63e6f0254 | 4a1dfea13548319138881d41ca4965da | 2,100 | PASSED |
#include<bits/stdc++.h>
#pragma GCC optimize ("Ofast")
#pragma GCC target ("avx2")
using namespace std;
#define endl '\n'
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define fi first
#define se second
// #define int long long
typedef long long ll;
typedef long double ld;
#define pii ... | C++ | 904af5d6a9d84b7b7b7ff8d63e6f0254 | bbc1b841d0118744069909c10c35e340 | 2,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef int64_t ll;
#define pii(x) array<int,x>
#define sz(x) int(x.size())
#define all(x) x.begin(), x.end()
#define dbug(x) cerr<<"Value of "<<#x<<": "<<x<<"\n"
const int MOD = 1e9+7;
template<typename T>
struct segtree{/// 1 indexed
T *Tree=NULL;
int n;... | C++ | 904af5d6a9d84b7b7b7ff8d63e6f0254 | 5b2dc4d1b0508ca5a17fa745832f9a4e | 2,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef int64_t ll;
#define pii(x) array<int,x>
#define sz(x) int(x.size())
#define all(x) x.begin(), x.end()
#define dbug(x) cerr<<"Value of "<<#x<<": "<<x<<"\n"
const int MOD = 1e9+7;
template<typename T>
struct minQueue{
stack<pair<T,T> >A,B;
minQueue()... | C++ | 904af5d6a9d84b7b7b7ff8d63e6f0254 | 631084753b228eab8c735de7f8f23cc0 | 2,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef int64_t ll;
#define pii(x) array<int,x>
#define sz(x) int(x.size())
#define all(x) x.begin(), x.end()
#define dbug(x) cerr<<"Value of "<<#x<<": "<<x<<"\n"
const int MOD = 1e9+7;
const int N = 505;
struct segtree{
#define T pii(2)
T Tree[4*N];
i... | C++ | 904af5d6a9d84b7b7b7ff8d63e6f0254 | 1686af779524bda9ee1a30641ef46d7a | 2,100 | PASSED |
#include<bits/stdc++.h>
#define File(s) freopen(#s".in","r",stdin),freopen(#s".out","w",stdout)
#ifdef GTRAKIOI
#define _GLIBCXX_DEBUG
#define defrog(...) fprintf(stderr,__VA_ARGS__)
#else
#define defrog(...) 1
#endif
#if __cplusplus>=201703L
#define rg
#else
#define rg register
#endif
#define ri rg int
t... | C++ | d17c9f91504e1d4c4eae7294bf09dcfc | 48e3ae12f31aa90af380be26f25d24b3 | 1,100 | PASSED |
#include<bits/stdc++.h>
#define File(s) freopen(#s".in","r",stdin),freopen(#s".out","w",stdout)
#ifdef GTRAKIOI
#define _GLIBCXX_DEBUG
#define defrog(...) fprintf(stderr,__VA_ARGS__)
#else
#define defrog(...) 1
#endif
#if __cplusplus>=201703L
#define rg
#else
#define rg register
#endif
#define ri rg int
t... | C++ | d17c9f91504e1d4c4eae7294bf09dcfc | 3cf6547d52da33e780d4d308a1a813dd | 1,100 | PASSED |
#include<bits/stdc++.h>
#define File(s) freopen(#s".in","r",stdin),freopen(#s".out","w",stdout)
#ifdef GTRAKIOI
#define _GLIBCXX_DEBUG
#define defrog(...) fprintf(stderr,__VA_ARGS__)
#else
#define defrog(...) 1
#endif
#if __cplusplus>=201703L
#define rg
#else
#define rg register
#endif
#define ri rg int
t... | C++ | d17c9f91504e1d4c4eae7294bf09dcfc | 1f1bee075223473461cdbd7675e4cbb9 | 1,100 | PASSED |
#include<iostream>
#include<vector>
#include<algorithm>
#define PII pair<int,int>
using namespace std;
void solve()
{
string a;
cin >> a;
int n = (int)a.length();
a = " " + a;
cout << abs(a[1] - a[n])<<" ";
vector<int>b(n+1);
for (int i = 1; i <= n; i++)
{
b[i] = a[i] - 'a' + 1;
}
vector<PI... | C++ | d17c9f91504e1d4c4eae7294bf09dcfc | 8d497b3158249add990c93330b4f4a01 | 1,100 | PASSED |
#include <string>
#include <iostream>
#include <algorithm>
#include <vector>
#include <cstdio>
using namespace std;
int main() {
// freopen("input.txt", "r", stdin);
int t;
cin >> t;
while (t--) {
string s;
cin >> s;
vector<pair<char, int> > a;
int n = s.size();
... | C++ | d17c9f91504e1d4c4eae7294bf09dcfc | 1312c1697fe960c1cc863b52a4471178 | 1,100 | PASSED |
#include <string>
#include <iostream>
#include <algorithm>
#include <vector>
#include <cstdio>
using namespace std;
int main() {
// freopen("input.txt", "r", stdin);
int t;
cin >> t;
while (t--) {
string s;
cin >> s;
vector<pair<char, int> > a;
int n = s.size();
... | C++ | d17c9f91504e1d4c4eae7294bf09dcfc | 73ade7ef0f3ed0878349894b7479dde4 | 1,100 | PASSED |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main()
{
int t; string s;
int keys[200010];
cin >> t;
while (t--) {
cin >> s;
int size = s.size();
vector <int> values(size);
vector <int> keys(size);
for (i... | C++ | d17c9f91504e1d4c4eae7294bf09dcfc | f05d906a01cb733d3205a4413c71aa7e | 1,100 | PASSED |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main()
{
int t; string s;
int keys[200010];
cin >> t;
while (t--) {
cin >> s;
int size = s.size();
vector <int> values(size);
for (int i = 0; i < size; i++) {
... | C++ | d17c9f91504e1d4c4eae7294bf09dcfc | c7ba50266180d46d8b4ecceed4f8ae3a | 1,100 | PASSED |
//
// main.cpp
// cppTestSimple
//
// Created by admin_user on 03/09/22.
//
#include <stdlib.h>
#include <stdio.h>
#include <string>
#include <cstring>
#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <deque>
typedef std::map<char, int> BasePairMap;
typedef s... | C++ | d17c9f91504e1d4c4eae7294bf09dcfc | 20fde0117ff93aa773a5b4ce5fe72bbb | 1,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define forn(i, n) for (int i = 0; i < int(n); i++)
void solve() {
string s;
cin >> s;
int n = s.size();
map<char, vector<int>> let_to_ind;
for (int i = 0; i < n; ++i) {
let_to_ind[s[i]].push_back(i);... | C++ | d17c9f91504e1d4c4eae7294bf09dcfc | c28d8503f35f15fe7daa951d1ec5bb06 | 1,100 | PASSED |
#include <bits/stdc++.h>
#define int long long
#define endl '\n'
using namespace std;
int a[200005];
void solve()
{
string s;int w,q;
cin>>s>>w>>q;
int n=s.size();
for(int i=0;i<n;i++)
{
a[i]=(a[i-1]+(s[i]-'0'))%9;
}
vector<vector<int>>v(9);
for(int k=0;k<9;k++)
... | C++ | b67870dcffa7bad682ef980dacd1f3db | feb5b7d047feb57790ea5aff28bc75cb | 1,900 | PASSED |
#include <bits/stdc++.h>
#define int long long
#define endl '\n'
using namespace std;
int a[200005];
void solve()
{
string s;int w,q;
cin>>s>>w>>q;
int n=s.size();
for(int i=0;i<n;i++)
{
a[i]=(a[i-1]+(s[i]-'0'))%9;
}
vector<vector<int>>v(9);
for(int k=0;k<9;k++)
... | C++ | b67870dcffa7bad682ef980dacd1f3db | 64c64a121ead9c13c703077df03a581a | 1,900 | PASSED |
#include <bits/stdc++.h>
#define endl '\n'
//testing file upload 2 ajisdfhaipusdhfpaisefh
// bruh
//bruh
//bruh
using namespace std;
typedef pair<int, int> ipair;
const int MAXSZ = 200200;
const int INF = 2e9;
inline int add(int a, int b) {
return (a + b >= 9 ? a + b - 9 : a + b);
... | C++ | b67870dcffa7bad682ef980dacd1f3db | e56e4ecf15534fb663af3c50f14240fb | 1,900 | PASSED |
#include <bits/stdc++.h>
#define endl '\n'
//testing file upload 2 ajisdfhaipusdhfpaisefh
// bruh
//bruh
using namespace std;
typedef pair<int, int> ipair;
const int MAXSZ = 200200;
const int INF = 2e9;
inline int add(int a, int b) {
return (a + b >= 9 ? a + b - 9 : a + b);
}
inli... | C++ | b67870dcffa7bad682ef980dacd1f3db | bfd70aaea0cacabaf72a2d7b3dd07d3b | 1,900 | PASSED |
#include <bits/stdc++.h>
#define endl '\n'
//testing file upload 2 ajisdfhaipusdhfpaisefh
// bruh
using namespace std;
typedef pair<int, int> ipair;
const int MAXSZ = 200200;
const int INF = 2e9;
inline int add(int a, int b) {
return (a + b >= 9 ? a + b - 9 : a + b);
}
inline int s... | C++ | b67870dcffa7bad682ef980dacd1f3db | fd9d79d4703fe9fc4712e4223aa3c4a7 | 1,900 | PASSED |
#include <bits/stdc++.h>
#define endl '\n'
//testing file upload 2 ajosdnfiawenfu9weufn
using namespace std;
typedef pair<int, int> ipair;
const int MAXSZ = 200200;
const int INF = 2e9;
inline int add(int a, int b) {
return (a + b >= 9 ? a + b - 9 : a + b);
}
inline int sub(int a, int b) {
... | C++ | b67870dcffa7bad682ef980dacd1f3db | 8b3b178d97b28379e50afd6fccc5bb2b | 1,900 | PASSED |
#include <bits/stdc++.h>
#define endl '\n'
//testing file upload 2
using namespace std;
typedef pair<int, int> ipair;
const int MAXSZ = 200200;
const int INF = 2e9;
inline int add(int a, int b) {
return (a + b >= 9 ? a + b - 9 : a + b);
}
inline int sub(int a, int b) {
return (a < b ? a +... | C++ | b67870dcffa7bad682ef980dacd1f3db | f20163b909b08ee05a63ee30ccac3fe2 | 1,900 | PASSED |
#include <bits/stdc++.h>
#define endl '\n'
//testing file upload
using namespace std;
typedef pair<int, int> ipair;
const int MAXSZ = 200200;
const int INF = 2e9;
inline int add(int a, int b) {
return (a + b >= 9 ? a + b - 9 : a + b);
}
inline int sub(int a, int b) {
return (a < b ? a + 9... | C++ | b67870dcffa7bad682ef980dacd1f3db | 4eb335320dad39b8b1eb03e463e861fd | 1,900 | PASSED |
#include <bits/stdc++.h>
#define endl '\n'
//testing superagent
using namespace std;
typedef pair<int, int> ipair;
const int MAXSZ = 200200;
const int INF = 2e9;
inline int add(int a, int b) {
return (a + b >= 9 ? a + b - 9 : a + b);
}
inline int sub(int a, int b) {
return (a < b ? a + 9 ... | C++ | b67870dcffa7bad682ef980dacd1f3db | 16b825044c1300cc68b91998c0dd4c74 | 1,900 | PASSED |
#include <bits/stdc++.h>
#define endl '\n'
//testing
//testing
using namespace std;
typedef pair<int, int> ipair;
const int MAXSZ = 200200;
const int INF = 2e9;
inline int add(int a, int b) {
return (a + b >= 9 ? a + b - 9 : a + b);
}
inline int sub(int a, int b) {
return (a < b ? a + 9 ... | C++ | b67870dcffa7bad682ef980dacd1f3db | a869b11516ac812b5a9889faf84f43f3 | 1,900 | PASSED |
/*~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~**
* In the name of Allah, Most Gracious, Most Merciful *
**~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~*/
///#pragma GCC optimize("Ofast")
///#pragma GCC target("avx,avx2,fma")
///#p... | C++ | 8590f40e7509614694486165ee824587 | 32ddbef9b9faae8e4eaf007ec0010cd4 | 1,800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
lli ans=3;
bool f=true;
for(int i=3;i<50;i++)
{
lli x;
cout<<'?'<<" "<<1<<" "<<i<<endl;
cin>>x;
... | C++ | 8590f40e7509614694486165ee824587 | 2af9f5d239bf82a0f92b80b46f553aa7 | 1,800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
lli ans=3;
bool f=true;
for(int i=3;i<27;i++)
{
lli x;
cout<<'?'<<" "<<1<<" "<<i<<endl;
cin>>x;
... | C++ | 8590f40e7509614694486165ee824587 | 0d1dea919369809c138fe13037d0634c | 1,800 | PASSED |
#include<bits/stdc++.h>
#define vc vector
#define db double
#define ll long long
#define mk make_pair
#define pb push_back
#define RI register int
#define PI pair<int,int>
#define ull unsigned long long
#define err cerr << " -_- " << endl
#define debug cerr << "-------------------" << endl
//useful:
#define int l... | C++ | 8590f40e7509614694486165ee824587 | e6236494c91af2fd367c1302f91da5f0 | 1,800 | PASSED |
#include<bits/stdc++.h>
#define vc vector
#define db double
#define ll long long
#define mk make_pair
#define pb push_back
#define RI register int
#define PI pair<int,int>
#define ull unsigned long long
#define err cerr << " -_- " << endl
#define debug cerr << "-------------------" << endl
//useful:
... | C++ | 8590f40e7509614694486165ee824587 | dd2d1b980ee7bc4f51ae88e66a73807f | 1,800 | PASSED |
#include<bits/stdc++.h>
#define vc vector
#define db double
#define ll long long
#define mk make_pair
#define pb push_back
#define RI register int
#define PI pair<int,int>
#define ull unsigned long long
#define err cerr << " -_- " << endl
#define debug cerr << "-------------------" << endl
//useful:
... | C++ | 8590f40e7509614694486165ee824587 | fb00c84c44daa40971bedeee8eb113d6 | 1,800 | PASSED |
#include<bits/stdc++.h>
#define vc vector
#define db double
#define ll long long
#define mk make_pair
#define pb push_back
#define RI register int
#define PI pair<int,int>
#define ull unsigned long long
#define err cerr << " -_- " << endl
#define debug cerr << "-------------------" << endl
//useful:
... | C++ | 8590f40e7509614694486165ee824587 | 8856f1f5a12bf4e08e9e2fe945b5f337 | 1,800 | PASSED |
#include <iostream>
#include <assert.h>
using namespace std;
int main() {
long long int now = 3;
int flag = 0;
cout.flush();
while (flag == 0) {
cout << "? " << 1 << " " << now << endl;
long long int r1;
cin >> r1;
cout << "? " << now << " " << 1 << endl;
... | C++ | 8590f40e7509614694486165ee824587 | 65bbe76788a91d51a79aef1d200ea9c3 | 1,800 | PASSED |
#include <iostream>
using namespace std;
typedef long long int ll;
void ask(ll a, ll b){
cout << "? " << a << " " << b << endl;
}
void answer(ll n){
cout << "! " << n << endl;
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
ll ans1,ans2;
for(ll i = 1; i <= 25; i++){
... | C++ | 8590f40e7509614694486165ee824587 | a2a1ab12ee4dd258dc1a8d52d14d4490 | 1,800 | PASSED |
/*Ritik jain */
#include<bits/stdc++.h>
using namespace std;
using namespace chrono;
#define fastio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define MOD1 998244353
#define MOD 1000000007
#define PI 3.141592653589793238462
#define INF 1e18
#define nline "\n"
#define nl "\n"
// #define cout cerr ... | C++ | 8590f40e7509614694486165ee824587 | 8712e18af3360bf01663dc583cd3f429 | 1,800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
//typedef long long LL;
#define int long long
const int N=2e5+10;
int f[N],f1[N],f2[N],sum[N];
int q[N];
int n,a,b,t;
bool check(int x){
if(f1[x]+f2[x]+sum[x]<=f1[x+1]+f2[x+1]+sum[x+1])return true;
else return false;
}
void solve(){
/*
cin.tie(0);
... | C++ | ce2b12f1d7c0388c39fee52f5410b94b | 1f04f68cfc49db5444147f37a7e12179 | 1,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
//#define int long long
const int N=2e5+10;
LL f[N],f1[N],f2[N],sum[N];
int q[N];
int n,a,b,t;
bool check(int x){
if(f1[x]+f2[x]+sum[x]<=f1[x+1]+f2[x+1]+sum[x+1])return true;
else return false;
}
void solve(){
/*
cin.tie(0);
... | C++ | ce2b12f1d7c0388c39fee52f5410b94b | 4d39355fafa6a3c4b9759ad0ff72a7af | 1,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
//typedef long long LL;
#define int long long
const int N=2e5+10;
int f[N],f1[N],f2[N],sum[N];
int q[N];
int n,a,b,t;
bool check(int x){
if(f1[x]+f2[x]+sum[x]<=f1[x+1]+f2[x+1]+sum[x+1])return true;
else return false;
}
void solve(){
/*
cin.tie(0);
... | C++ | ce2b12f1d7c0388c39fee52f5410b94b | 9249c88967cb92592b9f83d7fb3edfda | 1,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
//typedef long long LL;
#define int long long
const int N=2e5+10;
int f[N],f1[N],f2[N],sum[N];
int q[N];
int n,a,b,t;
inline bool check(int x){
if(f1[x]+f2[x]+sum[x]<=f1[x+1]+f2[x+1]+sum[x+1])return true;
else return false;
}
inline void solve(){
/*
... | C++ | ce2b12f1d7c0388c39fee52f5410b94b | e2809eb1f7ebbf68edef2ebf66a4e042 | 1,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
//typedef long long LL;
#define int long long
const int N=2e5+10;
int f[N],f1[N],f2[N],sum[N];
int q[N];
int n,a,b,t;
bool check(int x){
if(f1[x]+f2[x]+sum[x]<=f1[x+1]+f2[x+1]+sum[x+1])return true;
else return false;
}
void solve(){
/*
cin.tie(0);
... | C++ | ce2b12f1d7c0388c39fee52f5410b94b | 3645ebe9ce1b58a09655ee70eb9d94ba | 1,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
//
//typedef long long LL;
#define int long long
const int N=2e5+10;
int f[N],f1[N],f2[N],sum[N];
int q[N];
int n,a,b,t;
bool check(int x){
if(f1[x]+f2[x]+sum[x]<=f1[x+1]+f2[x+1]+sum[x+1])return true;
else return false;
}
void solve(){
/*
cin.tie(0);... | C++ | ce2b12f1d7c0388c39fee52f5410b94b | 93bea837c6b69cdbbe73c5ea78c7199c | 1,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
//typedef long long LL;
#define int long long
const int N=2e5+10;
int f[N],f1[N],f2[N],sum[N];
int q[N];
int n,a,b,t;
bool check(int x){
if(f1[x]+f2[x]+sum[x]<=f1[x+1]+f2[x+1]+sum[x+1])return true;
else return false;
}
void solve(){
/*
cin.tie(0);
... | C++ | ce2b12f1d7c0388c39fee52f5410b94b | f8f942a2e266265343972f262b1c6179 | 1,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
//typedef long long LL;
#define int long long
const int N=2e5+10;
int f[N],f1[N],f2[N],sum[N];
int q[N];
int n,a,b,t;
bool check(int x){
if(f1[x]+f2[x]+sum[x]<=f1[x+1]+f2[x+1]+sum[x+1])return true;
else return false;
}
void solve(){
cin>>n>>a>>b;
/*
... | C++ | ce2b12f1d7c0388c39fee52f5410b94b | e00110405b41d0326181c7e571dfa0e9 | 1,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
//typedef long long LL;
#define int long long
const int N=2e5+10;
int f[N],f1[N],f2[N],sum[N];
int q[N];
int n,a,b,t;
bool check(int x){
if(f1[x]+f2[x]+sum[x]<=f1[x+1]+f2[x+1]+sum[x+1])return true;
else return false;
}
void solve(){
cin>>n>>a>>b;
memset(... | C++ | ce2b12f1d7c0388c39fee52f5410b94b | adbec2456e8505d82c7853b5638c8696 | 1,500 | PASSED |
#include<iostream>
using namespace std;
int main(){
int t=0;
cin>>t;
while(t--){
int n=0,x[200005];
long long sum=0,a=0,b=0;
cin>>n>>a>>b;//a迁都 b攻城
for(int i=1;i<=n;i++){
cin>>x[i];
}
x[0]=0;
//以上为输入
/*if()条件 迁都<攻城 ,都... | C++ | ce2b12f1d7c0388c39fee52f5410b94b | 9235182e1b881a29f48e5ae6c4d3ca73 | 1,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main(){
int t;
scanf("%d",&t);
while(t--){
int n,k,cnt;
char c;
scanf("%d%d",&n,&k);cnt=k;
int s[n];
memset(s,0,sizeof(s));
bool f=k%2;
getchar();
for(int i=0;i<n;i++){
c=getchar();
if(i==n-1){
if((cnt-k)%2){
if(c=='1')p... | C++ | 38375efafa4861f3443126f20cacf3ae | 85fa5118d5f0ac442aaa7e8053ed4d83 | 1,300 | PASSED |
#include<iostream>
using namespace std;
int main() {
int t,n,k;
cin>>t;
while(t--) {
cin>>n>>k;
int a[n+10]= {},l[n+10]= {},cut=0;
char a1[n+10]= {};
for(int i=1; i<=n; i++) {
cin>>a1[i];
a[i]=a1[i]-'0';
}
if(k%2==0) {
for(int i=1; k>=1&&i<=n; i++) {
if(a[i]==0) {
l[i]++... | C++ | 38375efafa4861f3443126f20cacf3ae | 24960df2b5ed836e930d4ea6dff6d20a | 1,300 | PASSED |
#include<iostream>
#include<cstring>
using namespace std;
int i,t,k;
int n;
string s;
int main() {
cin>>t;
while(t--){
int len;
cin>>len;
int num[len+4]={};
cin>>k;
cin>>s;
//first
if(k%2!=0) {
for(i=0; i<len; i++) {
if(s[i]=='0') s[i]='1';
else s[i]='0';
}
}
//sec... | C++ | 38375efafa4861f3443126f20cacf3ae | e62caf7d1dffb2577ca8070ba509e86a | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int maxn=2e5+10;
inline int read() {
int x=0,f=1;
char ch=getchar();
while (!isdigit(ch)) {
if (ch=='-') f=-1;
ch=getchar();
}
while (isdigit(ch)) {
x=(x<<1)+(x<<3)+(ch^48);
ch=getchar();
}
return x*f;
}
int T,n,k;
int ans[maxn];
char ... | C++ | 38375efafa4861f3443126f20cacf3ae | fdcbb653023816835d1ea8969fad792b | 1,300 | PASSED |
#include <stdio.h>
char buf[210000];
int x[210000];
void solve(){
int n,k;
scanf("%d%d%s",&n,&k,buf);
int pk = k&1;
for(int i=0;i<n;i++){
int pb = buf[i]=='0';
int odd = pk^pb;
if(i==n-1){
x[i]=k;
}else{
if(odd){
if(k>0){
k--;x[i]=1;
}else{
x[i]=0;
}
... | C++ | 38375efafa4861f3443126f20cacf3ae | 7307d57c8e163d3af2e48232d7614391 | 1,300 | PASSED |
#include<iostream>
using namespace std;
char s[200010];
int t,n,ans[200010];
long long k;
int main () {
cin>>t;
for(int i=1; i<=t; i++) {
cin>>n>>k;
long long kb=k;
for(int j=1; j<n; j++) {
cin>>s[j];
ans[j]=0;//初始化
if(kb%2==1) { //如果k为奇数
if(s[j]=='1') {
s[j]='0';
} else {
s[j]='1';
... | C++ | 38375efafa4861f3443126f20cacf3ae | 6d1f01fd9e8e5bf4dba50034ca7abcdc | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main(){
int t;
scanf("%d",&t);
while(t--){
int n,k,cnt;
char c;
scanf("%d%d",&n,&k);cnt=k;
int s[n];
memset(s,0,sizeof(s));
bool f=k%2;
getchar();
for(int i=0;i<n;i++){
c=getchar();
if(i==n-1){
if((cnt-k)%2){
if(c=='1')p... | C++ | 38375efafa4861f3443126f20cacf3ae | ff08752c0e5ce62f669fa96673bb791c | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
using lol=long long int;
#define endl "\n"
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int _=1;
cin>>_;
while(_--)
{
int n,k;
cin>>n>>k;
string s;
cin>>s;
vector<int> f(n,0);
int tmpk=k;
for(int i=0;i<n && tm... | C++ | 38375efafa4861f3443126f20cacf3ae | 03139dc35cd925056dce5a0378429252 | 1,300 | PASSED |
#include<iostream>
using namespace std;
string h;
int l,k;
int a[200001];
int main(){
int n;
cin>>n;
for(int up=1;up<=n;up++){
cin>>l>>k;
cin>>h;
int kk=k;
for(int i=0;i<l;i++){
if(k%2!=0){
if(h[i]=='0')h[i]='1';
else h[i]='0';
}
if(kk>0&&h[i]=='0'){
kk--;
h[i]='1';
... | C++ | 38375efafa4861f3443126f20cacf3ae | 36d8e822f5abca67f92934a562d597a3 | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define mem(a,b) memset(a,b,sizeof(a))
const int N = 2e5 + 10;
int T, n, m, q, k;
string s;
int ans[N];//记录每个元素的操作次数
int re(char c) {
if (c == '1')return 0;
return 1;
}
int main(){
cin >> T;
while (T--) {
mem(ans, 0);
cin >> n >> k;
m = k;
cin >>... | C++ | 38375efafa4861f3443126f20cacf3ae | 87d21e078500fb95a4535e5639653311 | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define fr first
#define se second
#define pb push_back
typedef pair<ll,ll> pi;
#define rep(i,a,n) for (int i=int(a);i<int(n);i++)
#define irep(i,a,n) for (int i=int(n)-1;i>=int(a);i--)
typedef vector<long long int> ... | C++ | 7cec27879b443ada552a6474c4e45c30 | 40e38500f3eca08fa1e5fb21cca50950 | 1,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main(){
int t;
cin >> t;
while(t--){
int n,r,b;
cin >> n >> r >> b;
if(b == 1){
for(int i = 0; i < r/2; i++){
cout << 'R';
}
cout << 'B';
for(int i =... | C++ | 7cec27879b443ada552a6474c4e45c30 | 9e7dc761273a7b340a33527d1cc19c35 | 1,000 | PASSED |
#include <iostream>
#include <algorithm>
#include <string.h>
#include <vector>
#include <map>
using namespace std;
const int N = 1e6+10;
typedef long long ll;
void solve(){
int n,r,c;
cin >> n >> r >> c;
int cnt = 0;
int cnt1 = 0;
if (r >= c){
cnt = r / (c+1);
... | C++ | 7cec27879b443ada552a6474c4e45c30 | 75f57c3c8bd7a9f565c7327f81df4eec | 1,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main(){
ll t;
cin>>t;
while(t--){
ll n,r,b;
cin>>n>>r>>b;
ll pos = r/(b+1), max_pos = r % (b+1);
for(int i=0;i<max_pos;i++){
cout<< string(pos+1,'R')<<'B';
}
for(int i=max_pos;i<b;i++){
cout<< string(p... | C++ | 7cec27879b443ada552a6474c4e45c30 | 712d1ac0101910b3e5e127e0a2f06a2a | 1,000 | PASSED |
#include<algorithm>
#include<iostream>
#include<vector>
#include<cmath>
using namespace std;
void solve()
{
int n,a,b;
cin>>n>>a>>b;
int s=round(a/(b+1.0));
// cout<<s<<endl;
int sum=a-s*b;
// cout<<sum<<endl;
int q=b-a/s;
// cout<<q;
int sum1=b;
if (q>0)
sum1... | C++ | 7cec27879b443ada552a6474c4e45c30 | 9a847ee5faf7fbe4610006283772b504 | 1,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1e9+7
int main(){
int tt; cin>>tt;
while(tt--){
int n,r,b; cin>>n>>r>>b;
int div = r/(b+1), divr=0, divb=0;
int extra = r - (div*(b+1)), total = 0;
while(total < n){
int tmp = ... | C++ | 7cec27879b443ada552a6474c4e45c30 | f2f287fbb50f95c2f0267e76ea1f4220 | 1,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long int lld;
#define test lld t; cin >>t; while(t--)
#define dbug cout <<"dukse" <<endl;
int main() {
test{
lld n, r, b;
cin >> n >> r >> b;
lld diff = (n / (b + 1));
... | C++ | 7cec27879b443ada552a6474c4e45c30 | fb27864b7e31ac998ffe84000faf9ed3 | 1,000 | PASSED |
#include<bits/stdc++.h>
#define R register
using namespace std;
typedef long long ll;
inline ll read(){
R ll s=0,f=0,c=getchar();
for(;!isdigit(c);c=getchar())f|=c==45;
for(;isdigit(c);c=getchar())s=(s<<3)+(s<<1)+(c^48);
return f?-s:s;
}
inline void put1(R ll x){
if(x<0)putchar(45),x=-x;
if(x>9)put1(x... | C++ | 7cec27879b443ada552a6474c4e45c30 | 681d9a157297a17166133ee01476de1b | 1,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int t,n,r,b,c,y;
int main()
{
cin>>t;
while(t--)
{
cin>>n>>r>>b;
c=r/(b+1),y=r%(b+1);
for(int i=1;i<=b;i++)
{
for(int j=1;j<=c;j++)
cout<<'R';
if(y!=0)
{
cout<<'R';
... | C++ | 7cec27879b443ada552a6474c4e45c30 | d7f3d4b3cee4a83577f65ae80afdf4a5 | 1,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
char c[110];
int cnt;
int main()
{
int t;
cin>>t;
while(t--)
{
cnt=0;
int n;
cin>>n;
int r,b;
cin>>r>>b;
int even=r/(b+1);
int left=r%(b+1);
for(int i=1;i<=(b+1);i++)
{
for(int j=1;j<=even;j++)c[++cnt]='R';
if(left)c[++cnt]='R'... | C++ | 7cec27879b443ada552a6474c4e45c30 | 949ee5de7f2e32ee76ce007beb7cfef8 | 1,000 | PASSED |
#include<stdio.h>
#include<malloc.h>
#include<functional>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cmath>
#include<map>
#include<unordered_map>
#include<vector>
#include<queue>
#include<set>
#include<unordered_set>
#include<bitset>
using namespace std;
typedef long long ll;
type... | C++ | 9dc1bee4e53ced89d827826f2d83dabf | 195a99c4482cbd151827f9a61e9182cc | 1,900 | PASSED |
#include<stdio.h>
#include<malloc.h>
#include<functional>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cmath>
#include<map>
#include<unordered_map>
#include<vector>
#include<queue>
#include<set>
#include<unordered_set>
#include<bitset>
using namespace std;
typedef long long ll;
type... | C++ | 9dc1bee4e53ced89d827826f2d83dabf | b43e043d22289cdc35ef7c45aa5150fe | 1,900 | PASSED |
#include<stdio.h>
#include<malloc.h>
#include<functional>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cmath>
#include<map>
#include<unordered_map>
#include<vector>
#include<queue>
#include<set>
#include<unordered_set>
#include<bitset>
using namespace std;
typedef long long ll;
type... | C++ | 9dc1bee4e53ced89d827826f2d83dabf | f36d341595b7726590e751b33066f6e7 | 1,900 | PASSED |
#include<stdio.h>
#include<malloc.h>
#include<functional>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cmath>
#include<map>
#include<unordered_map>
#include<vector>
#include<queue>
#include<set>
#include<unordered_set>
#include<bitset>
using namespace std;
typedef long long ll;
type... | C++ | 9dc1bee4e53ced89d827826f2d83dabf | 4ef5af976ad377f1134c6c3934661c25 | 1,900 | PASSED |
#pragma GCC optimize("Ofast")
#include <cstdio>
/** Interface */
inline int readChar();
template <class T = int> inline T readInt();
template <class T> inline void writeInt( T x, char end = 0 );
inline void writeChar( int x );
inline void writeWord( const char *s );
/** Read */
static const int buf_siz... | C++ | 9dc1bee4e53ced89d827826f2d83dabf | c7145903cdffdd3906fa3b46d8fdad78 | 1,900 | PASSED |
#pragma GCC optimize("Ofast")
//#include <iostream>
//#include <vector>
//#include <numeric>
#include <cstdio>
/** Interface */
inline int readChar();
template <class T = int> inline T readInt();
template <class T> inline void writeInt( T x, char end = 0 );
inline void writeChar( int x );
inline void writ... | C++ | 9dc1bee4e53ced89d827826f2d83dabf | 346732277606a27ac06b5f9268c486e0 | 1,900 | PASSED |
#pragma GCC optimize("Ofast")
#include <iostream>
#include <vector>
#include <numeric>
using namespace std;
typedef long long ll;
#define fast_io ios_base::sync_with_stdio(false); cin.tie(nullptr);
#define lf '\n'
#define cinv(v) for (auto& refv : v) cin >> refv
const size_t MAXN = 200000;
ll... | C++ | 9dc1bee4e53ced89d827826f2d83dabf | 4cd27befd018cc4e25591fea200aadc4 | 1,900 | PASSED |
#pragma GCC optimize("Ofast")
#include <iostream>
#include <vector>
#include <numeric>
using namespace std;
typedef long long ll;
#define fast_io ios_base::sync_with_stdio(false); cin.tie(nullptr);
#define lf '\n'
#define cinv(v) for (auto& refv : v) cin >> refv
void run_case() {
ll n;
cin... | C++ | 9dc1bee4e53ced89d827826f2d83dabf | 43bd8c811d178fb756c0e8a42ddec939 | 1,900 | PASSED |
#pragma GCC optimize("Ofast")
#include <iostream>
#include <cstdlib>
#include <ctime>
#include <algorithm>
#include <vector>
#include <numeric>
using namespace std;
typedef long long ll;
#define fast_io ios_base::sync_with_stdio(false); cin.tie(nullptr);
#define lf '\n'
#define cinv(v) for (auto... | C++ | 9dc1bee4e53ced89d827826f2d83dabf | 677ddcedd24cfd63c2ada875f7171ec0 | 1,900 | PASSED |
#pragma GCC optimize("Ofast")
#include <iostream>
#include <cstdlib>
#include <ctime>
#include <algorithm>
#include <vector>
#include <numeric>
using namespace std;
typedef long long ll;
#define fast_io ios_base::sync_with_stdio(false); cin.tie(nullptr);
#define lf '\n'
#define cinv(v) for (auto... | C++ | 9dc1bee4e53ced89d827826f2d83dabf | b0a9ec2e144963a3f7dbe54df3883472 | 1,900 | PASSED |
// Problem: E. AND-MEX Walk
// Contest: Codeforces Round #782 (Div. 2)
// URL: https://codeforces.com/contest/1659/problem/E
// Memory Limit: 256 MB
// Time Limit: 3000 ms
// Create Time : 2022-04-24 20:30:08
//
// Powered by CP Editor (https://cpeditor.org)
#include <bits/stdc++.h>
#define all(x) x.begin()... | C++ | a3e89153f98c139d7e84f2307b128b24 | 05c6fe94fd1db182a92f10ffd776b809 | 2,200 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.