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>
#define fi first
#define se second
#define ll long long
#define uint unsigned int
#define ull unsigned long long
#define pii pair<int, int>
#define pil pair<int, long long>
#define pli pair<long long, int>
#define pll pair<long long, long long>
#define m_p make_pair
#define m_t ma... | C++ | 202396838c98654c4e40179f21a225a0 | 299d4fe1ced7acd33a69a1c4f4ecff51 | 2,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int i,j,k,n,m,t,t1,t2,it,a[6050];
bool vis2[3050],vis[3050];
vector<int> v[3050];
long long res;
void dfs(int x){
if(vis[x])return;
a[++it]=x;
vis[x]=1;
for(auto i:v[x]){
dfs(i);
}
}
void chk(){
int i,j,k;
for(i=1;i<=it;i++){
a[it+i]=a[i];
... | C++ | 202396838c98654c4e40179f21a225a0 | 31128e1367ffcbc89662592dcb37ec8e | 2,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
int i,j,k,n,m,t,t1,t2,vis[50500],it,a[50500],vis2[50500];
vector<int> v[50500];
int res;
void dfs(int x){
if(vis[x])return;
a[++it]=x;
vis[x]=1;
for(auto i:v[x]){
dfs(i);
}
}
void chk(){
int i,j,k;
for(i=1;i<=it;i++){
... | C++ | 202396838c98654c4e40179f21a225a0 | 4e813466e33b4cd9e5f8d66731d72760 | 2,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define f first
#define s second
typedef long long ll;
const int maxn = 1505;
ll crr = 0, ans = 0;
int n;
ll gt(ll x){
return x*(x+1)/2;
}
struct dsu{
int l, r, contrib, root;
set<int> out;
void recalc(){
if(out.empty())co... | C++ | 202396838c98654c4e40179f21a225a0 | 3955ce653043afa73c4fdf83eea2411d | 2,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define f first
#define s second
typedef long long ll;
const int maxn = 1505;
ll crr = 0, ans = 0;
int n;
ll gt(ll x){
return x*(x+1)/2;
}
struct dsu{
int l, r, contrib, root;
set<int> out;
void recalc(){
if(out.empty())co... | C++ | 202396838c98654c4e40179f21a225a0 | 6db21780ab889878540d9a48e60df7cc | 2,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
bool home=1;
const int inf=(int)1e9+7;
const int N=3000+7;
int n;
ll print;
vector<int> g[N],curpath;
bool vis[N];
vector<vector<int>> paths;
void dfs(int a){
vis[a]=1;
curpath.push_back(a);
for(auto&b:g[... | C++ | 202396838c98654c4e40179f21a225a0 | 8f8643a09b6122d8c1c5f2afc9cb4c11 | 2,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
bool home=1;
const int inf=(int)1e9+7;
const int N=3000+7;
int n;
ll print;
vector<int> g[N],curpath;
bool vis[N];
vector<vector<int>> paths;
void dfs(int a){
vis[a]=1;
curpath.push_back(a);
for(auto&b:g[... | C++ | 202396838c98654c4e40179f21a225a0 | e85267c65226cd918a36aa1fe4fedfea | 2,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using i128 = __int128_t;
using u128 = __uint128_t;
namespace debugger {
template <typename T>
void __print_var(string_view name, const T & x) { std::cerr << name << " = " << x; }
template <type... | C++ | 202396838c98654c4e40179f21a225a0 | 0a7a1de5a7da6fc2478d8ba5c5d1a585 | 2,600 | PASSED |
// LUOGU_RID: 90446467
#include<bits/stdc++.h>
using namespace std;
#define N 200010
#define mod 1000000007
#define ll long long
#define ull unsigned long long
#define For(i,j,k) for(int i=j;i<=k;i++)
#define DFor(i,j,k) for(int i=j;i>=k;i--)
#define efor(i,u) for(int i=h[u];i;i=nxt[i])
#define pb push_back
#... | C++ | f24193d656bca889e5167d9b7bd2a379 | f00ea4465c51eccb9b2e6e0a67c586e3 | 3,000 | PASSED |
// LUOGU_RID: 90424840
#include <cstdio>
#include <vector>
#include <iostream>
using namespace std;
const int M = 200005;
const int N = 30*M;
#define int long long
int read() {
int x=0,f=1;
char c;
while((c=getchar())<'0' || c>'9') {
if(c=='-') f=-1;
}
while(c>='0' && c<='9') {
x=(x<<3)+(x<<1)+(c... | C++ | f24193d656bca889e5167d9b7bd2a379 | 27a170b75229749dcf0609b15e3b7b16 | 3,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 200010;
const int Bs = 310;
const int Mx = 200000;
LL n, m, B, num[N], bel[N], cnt = 0;
LL ans, v[Bs][N], r[N], c[N], rest[N], used[Bs], tim[Bs];
inline LL read()
{
LL x = 0, f = 1;
char c = getchar();
while(... | C++ | f24193d656bca889e5167d9b7bd2a379 | 85311303a54fafffe530e3cbe5c91124 | 3,000 | PASSED |
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC target("avx,sse2,sse3,sse4,mmx")
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
long long a,b,d[200001],f[200001],q,w,an,mx,cn,v[200001],rt[200001],lim=200001,su[200001],cnt,all,suu[200001];
struct p{long long l,r,v;}m[200001... | C++ | f24193d656bca889e5167d9b7bd2a379 | d768979c495469c4b9e461330d9f2a38 | 3,000 | PASSED |
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
#include <cmath>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <iostream>
#include <cstdlib>
#include <ctime>
#pragma GCC optimize(3)
#pragma GCC target("avx")
#pragma GCC optimize("Ofast")
#pragma GC... | C++ | f24193d656bca889e5167d9b7bd2a379 | 67e66d743b4523a8a91173bf4dd5ee22 | 3,000 | PASSED |
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
#include <cmath>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <iostream>
#include <cstdlib>
#include <ctime>
#define int long long
#define Lid ch[id][0]
#define Rid ch[id][1]
#define M ((L+R)>>1)
... | C++ | f24193d656bca889e5167d9b7bd2a379 | c9b5b1b4b298222855decfb30feceddb | 3,000 | PASSED |
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
#include <cmath>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <iostream>
#include <cstdlib>
#include <ctime>
#pragma GCC optimize(3)
#pragma GCC target("avx")
#pragma GCC optimize("Ofast")
#pragma GC... | C++ | f24193d656bca889e5167d9b7bd2a379 | c44ca02afac0ff681af29ec3368933dd | 3,000 | PASSED |
#include<bits/stdc++.h>
#define ll long long
#define pll pair<long long,long long>
#define fi first
#define se second
using namespace std;
const int N=2e5+10;
int n,q,c[N],r[N],cur[N];
struct Block
{
int sz,cnt,L[N],R[N],pos[N];
int lstzer[N],lstcov[N];
vector<pair<int,pll> >go[N];
void init()
{
... | C++ | f24193d656bca889e5167d9b7bd2a379 | 894ea1967b418c966a03017b80aff5ac | 3,000 | PASSED |
#include<bits/stdc++.h>
#define ll long long
#define pll pair<long long,long long>
#define fi first
#define se second
using namespace std;
const int N=2e5+10;
int n,q,c[N],r[N],cur[N];
struct Block
{
int sz,cnt,L[N],R[N],pos[N];
int lstzer[N],lstcov[N];
vector<pair<int,pll> >go[N];
void init()
{
... | C++ | f24193d656bca889e5167d9b7bd2a379 | d534df596ba9eadfab556c208677be31 | 3,000 | PASSED |
#include<bits/stdc++.h>
#define ll long long
#define pll pair<long long,long long>
#define fi first
#define se second
using namespace std;
const int N=2e5+10;
int n,q,c[N],r[N],cur[N];
struct Block
{
int sz,cnt,L[N],R[N],pos[N];
int lstzer[N],lstcov[N];
vector<pair<int,pll> >go[N];
void init()
{
... | C++ | f24193d656bca889e5167d9b7bd2a379 | 2ba736267755791b2057aeb114e9455b | 3,000 | PASSED |
#include <bits/stdc++.h>
#define endl "\n"
using namespace std;
// For ordered sets
// #include <ext/pb_ds/assoc_container.hpp>
// using namespace std;
// using namespace __gnu_pbds;
// typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
// pbds;
// long long rfr[100000... | C++ | 9851ff47c77e13f62be1edaf3d74c4ad | 4f538c91148c421b294a230478f895a7 | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define fast ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
typedef long long ll;typedef long double ld;typedef pair<int,int> pii;
#define F first
#define S second
#define PB push_back
#... | C++ | 9851ff47c77e13f62be1edaf3d74c4ad | b29de3f552bbc55aa781f59e72d765c5 | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define fast ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
typedef long long ll;typedef long double ld;typedef pair<int,int> pii;
#define F first
#define S second
#define PB push_back
#... | C++ | 9851ff47c77e13f62be1edaf3d74c4ad | c3650f69823809334ee1fd32321ac972 | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10,inf = 1e9;
int a[N],b[N];
int main()
{
int T;
scanf("%d",&T);
while(T--)
{
int n;
bool ag = 0;
scanf("%d",&n);
for(int i = 1;i <= n;i++)
scanf("%d",a + i);
for(int ... | C++ | 9851ff47c77e13f62be1edaf3d74c4ad | 842406df40a4a26b0aaa84feb3fe03c0 | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define FF first
#define SS second
#define pb push_back
#define sz(v) (int)v.size()
#define all(v) v.begin(), v.end()
#define asort(v) sort(v.begin(), v.end()); // For Sorting in accending order
#defin... | C++ | 9851ff47c77e13f62be1edaf3d74c4ad | 4dc15ef7f34735f69f9437fc97fcb82b | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define FF first
#define SS second
#define pb push_back
#define sz(v) (int)v.size()
#define all(v) v.begin(), v.end()
#define asort(v) sort(v.begin(), v.end()); // For Sorting in accending order
#defin... | C++ | 9851ff47c77e13f62be1edaf3d74c4ad | a4c2f9700f198ef9940d362beddd9091 | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
bool check(int a[],int b[],int n){
for(int i=0;i<n;i++)
if(a[i]!=b[i]) return false;
return true;
}
bool check1(int a[],int b[],int n){
for(int i=0;i<n;i++)
if(a[i]>b[i]) return false;
return true;
}
int32_t main() {
... | C++ | 9851ff47c77e13f62be1edaf3d74c4ad | 88f39d40cb7b1886f6d2d585d31c316f | 1,300 | PASSED |
//2112048
//dimpal kalita
#include<bits/stdc++.h>
using namespace std;
#define md 1000000007
#define pb push_back
#define fr(i,n) for(ll i=0;i<n;i++)
#define fr1(i,k,n) for(ll i=k;i<n;i++)
#define endl "\n"
#define F ... | C++ | 9851ff47c77e13f62be1edaf3d74c4ad | 8aa9edd8045738d70646b5d59d0bb97c | 1,300 | PASSED |
// betichod hu mai joh iss college aaya
#include <bits/stdc++.h>
#define ll long long
#define srv(v) sort(v.begin(), v.end())
#define fo(i, a, b) for (ll i = a; i < b; i++)
#define str string
#define sz size()
#define dv(v) vector<ll> v
#define ds(s) set<ll> s
#define dm(mp) map<ll, ll> mp
using namespace std... | C++ | 9851ff47c77e13f62be1edaf3d74c4ad | fd6f6302a529193dfac646b1614d590c | 1,300 | PASSED |
// betichod hu mai joh iss college aaya
#include <bits/stdc++.h>
#define ll long long
#define srv(v) sort(v.begin(), v.end())
#define fo(i, a, b) for (ll i = a; i < b; i++)
#define str string
#define sz size()
#define dv(v) vector<ll> v
#define ds(s) set<ll> s
#define dm(mp) map<ll, ll> mp
using namespace std... | C++ | 9851ff47c77e13f62be1edaf3d74c4ad | 21ff4befdee17fec336bcd6c477ec9d6 | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int N=1e3+10;
char c[N][N];
int main()
{
int t;cin>>t;
while(t--)
{
int n,k,r,p;
cin>>n>>k>>r>>p;
for(int i=1;i<=n*2;i++)
for(int j=1;j<=n*2;j++)c[i][j]='.';
char x='X';
c[r][p]=x;
for(int i=p;i<=n*2;i+=k)c[r][i]='X';
for(int i=p;i>=1... | C++ | 1cbbf71a8e50b58547d1f74437509319 | a4b72644ccb6f7d5a874a6ed9e139e70 | 1,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int N=5e2+10;
char q[N][N];
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
int n,k,r,c;
scanf("%d%d%d%d",&n,&k,&r,&c);
if(k==1)
{
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
printf("X");
... | C++ | 1cbbf71a8e50b58547d1f74437509319 | d6755ff59659d1e7d5bf8bee59ace0fb | 1,100 | PASSED |
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N =5e2+10,mod=998244353;
char ma[N][N];
void solve()
{
memset(ma,'.',sizeof ma);
int n,k,r,c;
cin>>n>>k>>r>>c;
ma[r][c]='X';
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j+=k)
{
in... | C++ | 1cbbf71a8e50b58547d1f74437509319 | 11b002a69dedd4dc6dba1d319f5ec604 | 1,100 | PASSED |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--){
int n,k,x,y;
cin>>n>>k>>x>>y;
x--;
y--;
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
if(abs(i+j-x-y)%k==0)cout<<'X';
else cout<<'.';
}
cout<<endl;
}
... | C++ | 1cbbf71a8e50b58547d1f74437509319 | 774cd96980066128efa9218a928788e1 | 1,100 | PASSED |
/*Rabbi Zidni Eilmaa*/
#include<bits/stdc++.h>
#include<string.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef string str;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<pair<int,int>> vpi;
... | C++ | 1cbbf71a8e50b58547d1f74437509319 | ade9a3da246ae3ec86111b8b9d7e735d | 1,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define max3(a, b, c) max(a, max(b, c))
#define max4(a, b, c, d) max(a, max(b, max(c, d)))
#define min3(a, b, c) min(a, min(b, c))
#define min4(a, b, c, d) min(a, min(b, min(c, d)))
#define yes cout << 'Y' << 'E'... | C++ | 1cbbf71a8e50b58547d1f74437509319 | 4aa0e98cfb6321d9342bac8381628a26 | 1,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define max3(a, b, c) max(a, max(b, c))
#define max4(a, b, c, d) max(a, max(b, max(c, d)))
#define min3(a, b, c) min(a, min(b, c))
#define min4(a, b, c, d) min(a, min(b, min(c, d)))
#define yes cout << 'Y' << 'E'... | C++ | 1cbbf71a8e50b58547d1f74437509319 | bb5c411142cdab2e260f726018d9b0d6 | 1,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
//#define ll long long
#define int long long
#define endl '\n'
#define fi first
#define se second
#define PI acos(-1.0)
#define TT int t = read(); while(t--)
#define IOS ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
//#pragma GCC optimize(3)
//const int mod... | C++ | 1cbbf71a8e50b58547d1f74437509319 | 9952c9fe142319f91745ac6e6ef03a3c | 1,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int T,n,k,r,c;
int main(){
cin>>T;
while(T--){
cin>>n>>k>>r>>c;
for(int i=1;i<=n;cout<<endl,i++)
for(int j=1;j<=n;j++)
if((i+j)%k==(r+c)%k)putchar('X');
else putchar('.');
}
return 0;
} | C++ | 1cbbf71a8e50b58547d1f74437509319 | 44205ba1003a3158de16b15c3e80f084 | 1,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define fastio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define MOD 1000000007
#define MOD1 998244353
#define INF 1e18
#define nline "\n"
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define ff first
#define ss second
#define PI 3... | C++ | 1cbbf71a8e50b58547d1f74437509319 | 5ef75ee8f7d2a2e3d86b84ea7779711a | 1,100 | PASSED |
#include<iostream>
using namespace std;
int main()
{
int n;
cin>>n;
while(n--)
{
int t;
cin>>t;
cout<<t + 2*(t/2) + 2*(t/3)<<endl;
}
return 0;
} | C++ | a6b6d9ff2ac5c367c00a64a387cc9e36 | 8465334c9e25d73bb242ca2010fe4d20 | 800 | PASSED |
#include <iostream>
using namespace std;
int main() {
int t;
cin>>t;
for(int i =0; i<t; i++) {
int n;
cin>>n;
cout<< n+ 2*(n/2) + 2*(n/3)<<endl;
}
} | C++ | a6b6d9ff2ac5c367c00a64a387cc9e36 | 6fb7952203c28db60fc2c14035d073e8 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
long long int func(long long int n)
{
return n+((n/2)*2)+2*(n/3);
}
int main(int argc, char const *argv[])
{
long long int n;
cin>>n;
long long int arr[n];
for (long long int i = 0; i < n; ++i)
{
cin>>arr[i];
cout<<func(arr[i])<<"\n";
}
ret... | C++ | a6b6d9ff2ac5c367c00a64a387cc9e36 | e5858a879081e93940b794c5afae50c6 | 800 | PASSED |
#include<iostream>
using namespace std;
int main(){
int t;
cin>>t;
while(t--){
int n;
cin>>n;
int ans = n/2 + n/3;
ans *= 2;
ans += n;
cout<<ans<<endl;
}
return 0;
} | C++ | a6b6d9ff2ac5c367c00a64a387cc9e36 | 5ac5154376c8db5bff9b9277f5cf4213 | 800 | PASSED |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <string>
#include <queue>
#include <functional>
#include <map>
#include <set>
#include <cmath>
#include <cstring>
#include <deque>
#include <stack>
#include <ctime>
#include <cstdlib>
using namespace std;
typedef long ... | C++ | a6b6d9ff2ac5c367c00a64a387cc9e36 | 2b6d80445f4ab9126e65131cca2a9dda | 800 | PASSED |
#include<bits/stdc++.h>
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int t;
cin>>t;
while(t--)
{
int n;
cin>>n;
int sum=n;
sum+=(n/2)*2;
sum+=(n/3)*2;
... | C++ | a6b6d9ff2ac5c367c00a64a387cc9e36 | 0e926ad58ec42241ae208f2d0c3e9f6c | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define int long long
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int tt;
cin >> tt;
while(tt--) {
int n;
cin >> n;
if(n & 1) cout << (n + n - 1 + (n/3)*2) << '\n';
else cout << (n + n + (n/3)*2) << '\n';
}
ret... | C++ | a6b6d9ff2ac5c367c00a64a387cc9e36 | 85c352c7796ac21c380ccfda67910097 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define sad '\n'
#define all(b) b.begin() , b.end()
#define ha cout << "YES" << '\n'
#define na cout << "NO" << '\n'
long long t = 1;
long long gcd(long long x , long long y){
if(y == 0) return x;
return gcd(y , x % y);
}
long long lcm(long long x , long long... | C++ | a6b6d9ff2ac5c367c00a64a387cc9e36 | 033f37125007dcbc7b68553346ef15d9 | 800 | PASSED |
#include<bits/stdc++.h>
#define FastIO ios::sync_with_stdio(0); cin.tie(0)
using namespace std;
using ll = long long;
void Solve() {
ll i, j, k;
ll n;
cin >> n;
ll res = n+2*ll(n/2)+2*ll(n/3);
cout << res << endl;
}
int main() {
FastIO;
int t;
cin >> t;
while (t--) Solve();
} | C++ | a6b6d9ff2ac5c367c00a64a387cc9e36 | b51022058c94ac031b1611120f27fa59 | 800 | PASSED |
// Problem: A. Madoka and Strange Thoughts
// Contest: Codeforces - Codeforces Round #818 (Div. 2)
// URL: https://codeforces.com/contest/1717/problem/0
// Memory Limit: 256 MB
// Time Limit: 1000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include<bits/stdc++.h>
typedef long long ll;
#define int ... | C++ | a6b6d9ff2ac5c367c00a64a387cc9e36 | 8b17de88e07e3c15210a6602ab953168 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
template<typename T>
struct Flow {
const int n;
struct Edge {
int to;
T cap;
Edge(int to, T cap) : to(to), cap(cap) {}
Edge() = default;
};
vector<Edge> e;
vector<vector<int>> g;
vector<int> pnt, h;
Flow() =... | C++ | 29a9015981b39df9db40d41c73286e9f | e588889b31f0cedebda3c82c8e11715d | 2,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
template<typename T>
struct Flow {
const int n;
struct Edge {
int to;
T cap;
Edge(int to, T cap) : to(to), cap(cap) {}
Edge() = default;
};
vector<Edge> e;
vector<vector<int>> g;
vector<int> pnt, h;
Flow(int... | C++ | 29a9015981b39df9db40d41c73286e9f | 8cad5b617ffdea68ff9aca8bcd2303e5 | 2,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
template<typename T>
struct Flow {
const int n;
struct Edge {
int to;
T cap;
Edge(int to, T cap) : to(to), cap(cap) {}
Edge() = default;
};
vector<Edge> e;
vector<vector<int>> g;
vector<int> pnt, h;
Flow(int... | C++ | 29a9015981b39df9db40d41c73286e9f | 49753c8a8b1fadb7e9ff335eb17af756 | 2,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
template<typename T>
struct Flow {
const int n;
struct Edge {
int to;
T cap;
Edge(int to, T cap) : to(to), cap(cap) {}
Edge() = default;
};
vector<Edge> e;
vector<vector<int>> g;
vector<int> pnt, h;
Flow(int... | C++ | 29a9015981b39df9db40d41c73286e9f | aaf09456dade2f1a59223a0dc1aded61 | 2,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
template<typename T>
struct Flow {
const int n;
struct Edge {
int to;
T cap;
Edge(int to, T cap) : to(to), cap(cap) {}
Edge() = default;
};
vector<Edge> e;
vector<vector<int>> g;
vector<int> pnt, h;
Flow(int... | C++ | 29a9015981b39df9db40d41c73286e9f | 26be747498daa3ced85634f493657f9e | 2,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
template<typename T>
struct Flow {
const int n;
struct Edge {
int to;
T cap;
Edge(int to, T cap) : to(to), cap(cap) {}
Edge() = default;
};
vector<Edge> e;
vector<vector<int>> g;
vector<int> pnt, h;
Flow(int... | C++ | 29a9015981b39df9db40d41c73286e9f | cda8fe1c7c264304d457a04cca676079 | 2,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
template<typename T>
struct Flow {
const int n;
struct Edge {
int to;
T cap;
Edge(int to, T cap) : to(to), cap(cap) {}
Edge() = default;
};
vector<Edge> e;
vector<vector<int>> g;
vector<int> pnt, h;
Flow(int... | C++ | 29a9015981b39df9db40d41c73286e9f | 81d42a2817d3b0e00e97c3a766a714ff | 2,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
template<typename T>
struct Flow {
const int n;
struct Edge {
int to;
T cap;
Edge(int to, T cap) : to(to), cap(cap) {}
Edge() = default;
};
vector<Edge> e;
vector<vector<int>> g;
vector<int> pnt, h;
Flow(int... | C++ | 29a9015981b39df9db40d41c73286e9f | 860c3781332b03660835f8fa685d91f0 | 2,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
template<typename T>
struct Flow {
const int n;
struct Edge {
int to;
T cap;
Edge(int to, T cap) : to(to), cap(cap) {}
Edge() = default;
};
vector<Edge> e;
vector<vector<int>> g;
vector<int> pnt, h;
Flow(int... | C++ | 29a9015981b39df9db40d41c73286e9f | 13e2d27af863527b79271497d84f82b3 | 2,500 | PASSED |
//#pragma GCC optimize(2)
#define fileopen freopen("in","r",stdin);cout << "freeeeopen here !!!" << "\n"
#define debug(x) cout << "here" << x << "\n"
#define depair(x,y) cout << "here" << x << " " << y << "\n"
#define derr(...) fprintf(stderr,__VA_ARGS__)
#define GFOR(i,u) for(int (i) = fst[(u)]; (i); (i) = nxt[(i... | C++ | 29a9015981b39df9db40d41c73286e9f | 81d97bf5c262074a44c8c69d31956ecd | 2,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin>>t;
while(t--)
{
int n , x , y ;
cin >> n >> x >> y ;
if( ( (x == 0) && (y != 0) ) || ( (x != 0) && (y == 0) ) )
{
int nonZero = x ;
if(x == 0)
nonZero = y ;
... | C++ | 024d7b1d5f7401080560174003456037 | fc3ff717486fc21ab0d00263d8d0c0e0 | 900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin>>t;
while(t--)
{
int n,x,y;
cin>>n>>x>>y;
if(x==0)
{
swap(x,y);
}
if(x!=0 && y!=0 ||x==0 && y==0 ||(n-1)%x!=0 )
{
cout<<"-1"<<endl;
continue;
}
... | C++ | 024d7b1d5f7401080560174003456037 | 3edaca7b2990adc6705b6e9ff18ed915 | 900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin>>t;
while(t--)
{
int n,x,y;
cin>>n>>x>>y;
if(x==0)
{
swap(x,y);
}
if(x!=0 && y!=0 ||x==0 && y==0 )
{
cout<<"-1"<<endl;
continue;
}
int k=x;... | C++ | 024d7b1d5f7401080560174003456037 | bd1cb8d7b94507d79f1e1696d7e0f52d | 900 | PASSED |
#include <iostream>
typedef long long ll;
using namespace std;
int main() {
ll t;
cin >> t;
while (t--) {
ll n, x, y;
cin >> n >> x >> y;
if (x > y) swap(x, y);
if (x || !y || (n - 1) % y) {
cout << ... | C++ | 024d7b1d5f7401080560174003456037 | 9c6f661216877a8b9b8e90b26aa8513c | 900 | PASSED |
#include <iostream>
typedef long long ll;
using namespace std;
int main() {
ll t;
cin >> t;
while (t--) {
ll n, x, y;
cin >> n >> x >> y;
if (x > y) swap(x, y);
if (x || !y || (n - 1) % y) {
cout << ... | C++ | 024d7b1d5f7401080560174003456037 | dfcf621712cb8692e4fd5fd887a3b958 | 900 | PASSED |
#include <iostream>
typedef long long ll;
using namespace std;
int main() {
ll t;
cin >> t;
while (t--) {
ll n, x, y;
cin >> n >> x >> y;
if (x > y) swap(x, y);
if (x || !y || (n - 1) % y) {
cout << "-1\n";
} else {
for (ll i... | C++ | 024d7b1d5f7401080560174003456037 | 90a146643f05d6fb16b1f4a4f4237c95 | 900 | PASSED |
#include <iostream>
#include <vector>
#include <unistd.h>
#include <unistd.h>
#include <algorithm>
#include <map>
#include <cmath>
#include <cstring>
#include <sstream>
#include <set>
#include <unordered_set>
#include <cstring>
#include <string.h>
#include <queue>
using namespace std;
#define mid(s, e)... | C++ | 024d7b1d5f7401080560174003456037 | 595400e99e2a3c43240b610f48f45325 | 900 | PASSED |
#include <iostream>
#include <vector>
#include <unistd.h>
#include <unistd.h>
#include <algorithm>
#include<map>
#include<cmath>
#include<cstring>
#include<sstream>
#include <set>
#include <unordered_set>
#include <cstring>
#include <string.h>
#includ... | C++ | 024d7b1d5f7401080560174003456037 | d159d4fb4bdc215d9fe56c94c00df5a4 | 900 | PASSED |
#include <iostream>
#include <vector>
#include <unistd.h>
#include <unistd.h>
#include <algorithm>
#include<map>
#include<cmath>
#include<cstring>
#include<sstream>
#include <set>
#include <unordered_set>
#include... | C++ | 024d7b1d5f7401080560174003456037 | e137ffc407261543c12e505ea4398866 | 900 | PASSED |
#include <iostream>
#include <vector>
#include <unistd.h>
#include <unistd.h>
#include <algorithm>
#include<map>
#include<cmath>
#include<cstring>
#include<sstream>
#include <set>
#include <unordered_set>
#include <cstring>
#include <string.h>
#includ... | C++ | 024d7b1d5f7401080560174003456037 | 922bc818930a7bbec185ea9eb0f4cada | 900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn = 1e5 + 10;
const double INF = 1e9 + 1;
ll n, m, k, x, y;
string s1, s2;
ll gg = 1;
void solve()
{
cin >> n >> x >> y;
cin >> s1 >> s2;
if (s1 == s2)
{
cout << "0\n";
return;
}
vector<ll> ve;
for (ll i = 0; ... | C++ | f3c097872643f6fce645c05824b574e5 | 35bf0303c7882ac1d890349cee37e0e0 | 1,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn = 1e5 + 10;
const double INF = 1e9 + 1;
ll n, m, k, x, y;
string s1, s2;
ll gg = 1;
void solve()
{
cin >> n >> x >> y;
cin >> s1 >> s2;
if (s1 == s2)
{
cout << "0\n";
return;
}
vector<ll> ve;
for (ll i = 0; ... | C++ | f3c097872643f6fce645c05824b574e5 | 751352b74b7306f14f2cb18718756ace | 1,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn = 1e5 + 10;
const double INF = 1e9 + 1;
ll n, m, k, x, y;
string s1, s2;
ll gg = 1;
void solve()
{
cin >> n >> x >> y;
cin >> s1 >> s2;
// if (gg == 230)
// cout << s1 << s2 << "***" << x << '*' << y << '\n';
if (s1 ==... | C++ | f3c097872643f6fce645c05824b574e5 | 557b691420ac8858dadbe2d923ea9cf1 | 1,400 | PASSED |
#include<bits/stdc++.h>
#define endl '\n'
#define int long long
#define fi first
#define se second
#define pb push_back
#define lowbit(x) ((x)&(-x))
#define rep(i,a,n) for (int i=a;i<=n;i++)
#define per(i,n,a) for (int i=n;i>=a;i--)
#define all(x) x.begin(),x.end()
#define SZ(x) ((int)(x).size())
#define deb... | C++ | f3c097872643f6fce645c05824b574e5 | b222032502559adad985573b3f0b0d08 | 1,400 | PASSED |
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
#include<map>
#include<queue>
#include<stack>
#include<cmath>
#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define int long long
#define debug(x) cerr << #x << ": " << (x) << endl
#define lowbit(i) (-i)&i
#define mem(i,... | C++ | f3c097872643f6fce645c05824b574e5 | 7acfa4bec534235f6abce0d5369766ff | 1,400 | PASSED |
#include <bits/stdc++.h>
using i64 = long long;
void solve() {
int n, x, y;
std::cin >> n >> x >> y;
std::vector<int> a(n);
for (int i = 0; i < n; i++) {
char ch;
std::cin >> ch;
a[i] ^= ch - '0';
}
for (int i = 0; i < n; i++) {
char ch;
... | C++ | f3c097872643f6fce645c05824b574e5 | c4e45180ce701a8d817b528529c2af39 | 1,400 | PASSED |
#include <bits/stdc++.h>
using i64 = long long;
void solve() {
int n, x, y;
std::cin >> n >> x >> y;
std::vector<int> a(n);
for (int i = 0; i < n; i++) {
char ch;
std::cin >> ch;
a[i] ^= ch - '0';
}
for (int i = 0; i < n; i++) {
char ch;
... | C++ | f3c097872643f6fce645c05824b574e5 | 1295cfbc33d451384b71a42b08a5e42e | 1,400 | PASSED |
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
#include<map>
#include<queue>
#include<stack>
#include<cmath>
#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define int long long
#define debug(x) cerr << #x << ": " << (x) << endl
#define lowbit(i) (-i)&i
#define mem(i,... | C++ | f3c097872643f6fce645c05824b574e5 | 4abf3a800072255a96cceb790a95f22c | 1,400 | PASSED |
#include <bits/stdc++.h>
using i64 = long long;
void solve() {
int n, x, y;
std::cin >> n >> x >> y;
std::vector<int> a(n);
for (int i = 0; i < n; i++) {
char ch;
std::cin >> ch;
a[i] ^= ch - '0';
}
for (int i = 0; i < n; i++) {
char ch;
... | C++ | f3c097872643f6fce645c05824b574e5 | e37a803cc4112c35d9bab9e68aa33d88 | 1,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main(){
int t;
cin>>t;
while(t--){
long long int n,x,y;
cin>>n>>x>>y;
string a;
string b;
cin>>a>>b;
/*
if(t==253){
cout<<n<<x<<y<<a<<b;
}
*/
long long int parity=0;
for(int i=0;i<n;i++){
if(a[i]!=b[... | C++ | f3c097872643f6fce645c05824b574e5 | 6b19732465469ba1209da2eee0930b29 | 1,400 | PASSED |
#include <bits/stdc++.h>
#define int long long
#define N 105
using namespace std;
int n,k,a[N],mx[N];
void solve(){
cin>>n>>k;
memset(mx,0,sizeof(mx));
for(int i=1;i<=n;i++)
{
cin>>a[i];
mx[i%k]=max(mx[i%k],a[i]);
} int sum = 0;
for(int i=0;i<k;i++)
sum+=mx[i];
cout<<sum<<endl;
}
signed main(){
... | C++ | f974c33780a933a6076c0559e48b7552 | 61e4b05bf20666dbcfe914805cd3beb3 | 800 | PASSED |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int MAXN = 1e6 + 10;
signed main(){
int t;
cin>>t;
while(t--){
int n,k,a[MAXN];
cin>>n>>k;
for(int i = 1; i <= n; i++)
cin >> a[i];
for(int i = 1; i <= n; i++) {
... | C++ | f974c33780a933a6076c0559e48b7552 | 9206553125fd1c32866e9491bdf1a599 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int MAXN = 1e6 + 10;
int a[MAXN];
inline void solve() {
int k, n;
cin >> n >> k;
for(int i = 1; i <= n; i++)
cin >> a[i];
for(int i = 1; i <= n; i++) {
for(int j = i + k; j <= n; j += k) {
... | C++ | f974c33780a933a6076c0559e48b7552 | 9d9de5f883d39ac24b977effd1ea972d | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define IO ios::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define int long long
const int MAXN = 1e6 + 10;
int a[MAXN];
inline void solve() {
int k, n;
cin >> n >> k;
for(int i = 1; i <= n; i++)
cin >> a[i];
for(int i ... | C++ | f974c33780a933a6076c0559e48b7552 | c9255535a5b8816df4cc9a85c769b3f1 | 800 | PASSED |
#include<bits/stdc++.h>
#define fi first
#define se second
#define pq priority_queue
#define mp make_pair
#define str string
#define ll long long
#define ii pair<int, int>
#define pb push_back
using namespace std;
void solve() {
int t;
cin >> t;
while (t--) {
int n, k;
cin >> n >> k;
int a[k];
memset(a, 0,... | C++ | f974c33780a933a6076c0559e48b7552 | e2fe2d4f59c6f1e36e94112e7a20b4ed | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
const int N=1e6+10;
int arr[N];
int main(){
int t;
cin>>t;
while(t--){
int n,k;
cin>>n>>k;
for(int i=1;i<=n;i++){
int x;
cin>>x;
arr[i%k]=max(arr[i%k],x);
}
ll sum=0;
for(int i=0;i<k;i++){
sum+=arr[i];
}
... | C++ | f974c33780a933a6076c0559e48b7552 | 99e8916b7948a1a8f711639454b30941 | 800 | PASSED |
#include<iostream>
#include<cstdio>
using namespace std;
typedef long long ll;
ll ma[105];
int main()
{
int t;
cin >> t;
while (t--)
{
int n, k;
scanf("%d%d", &n, &k);
for (int i = 0; i <= k; i++)
{
ma[i] = 0;
}
ll x;
for (int i = 1; i <= n; i++)
{
scanf("%lld", &x);
int p = i % k;
if (x... | C++ | f974c33780a933a6076c0559e48b7552 | 14262cf0b31f56cbc448fe31b348bd09 | 800 | PASSED |
#include<iostream>
using namespace std;
int main()
{
int a[105];
int t, n, k, b;
long long int sum = 0;
cin >> t;
while (t--)
{
sum = 0;
cin >> n >> k;
for (int i = 1; i <= n; i++)
{
cin >> a[i];
}
for (int i = 1; i <= k; i++)
{
b = 0;
for (int j = i; j <= n; j += k)
{
b = (b > a[j]?... | C++ | f974c33780a933a6076c0559e48b7552 | b87e3636243ea22be85e4cce23f556cb | 800 | PASSED |
#include<iostream>
using namespace std;
int main()
{
int t;
long long num,yu,sum;
long long maxlist[101];
cin >> t;
while(t--)
{
for(int i=0;i<=101;i++)
{
maxlist[i]=0;
}
sum=0;
int n,k;
cin >> n>>k;
for(int i=1;i<=n;i++)
{
scanf("%lld",&nu... | C++ | f974c33780a933a6076c0559e48b7552 | 52944829820c2ab52a7870e6de4251dc | 800 | PASSED |
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
const int N=110;
int t;
int a[N],b[N];
int main(){
cin>>t;
while(t--){
int n,k;
scanf("%d%d",&n,&k);
for(int i=1,j=1;i<=n;i++,j++){
if(j>k)j=1;
scanf("%d",&a[i]);
b[j]=max(b[j],a[i]);
}
long long ans=0;
for(int i=1;i<... | C++ | f974c33780a933a6076c0559e48b7552 | 3b85fa02a843c3ccdd5a52861c8564a7 | 800 | PASSED |
//NEWBIE CONTESTANT
#include <bits/stdc++.h>
#define clo cout << "Time execute: " << clock() / (double)CLOCKS_PER_SEC << " sec" << endl;
#define NB iostream::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
#define OUT cout << setprecision(20) ;
#define yes cout << "YES\n" ;
#define PI 3.14159265359
#... | C++ | 10f3f4ae348fd4d28c371d8bf570d4c2 | b91d12e8ac157fa480e02b2bec1eb7b0 | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int TC = 1; cin >> TC;
while (TC--) {
int n; cin >> n;
int arr[n + 1] = {};
for(int i = 1; i <= n; ++i) {
cin >> arr[i];
arr[i] %=... | C++ | 10f3f4ae348fd4d28c371d8bf570d4c2 | 11afdd424b6810cfa8ad27eea90e6c54 | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int TC = 1; cin >> TC;
while (TC--) {
int n; cin >> n;
int arr[n + 1] = {};
for(int i = 1; i <= n; ++i) {
cin >> arr[i];
arr[i] %=... | C++ | 10f3f4ae348fd4d28c371d8bf570d4c2 | 146423450476e0823295ef3d90ed17e8 | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int TC = 1; cin >> TC;
while (TC--) {
int n; cin >> n;
int arr[n + 1] = {};
for(int i = 1; i <= n; ++i) cin >> arr[i];
vector<pair<int, int>> a... | C++ | 10f3f4ae348fd4d28c371d8bf570d4c2 | 45d349dc2d5e53dc27f92dc65a34d6fd | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int TC = 1; cin >> TC;
while (TC--) {
int n; cin >> n;
int arr[n + 1] = {};
for(int i = 1; i <= n; ++i) {
cin >> arr[i];
arr[i] ... | C++ | 10f3f4ae348fd4d28c371d8bf570d4c2 | 2745d31dfa049a13df971c9e6ea949fb | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int TC = 1; cin >> TC;
while (TC--) {
int n; cin >> n;
int arr[n + 1] = {};
for(int i = 1; i <= n; ++i) cin >> arr[i];
// vector<pair<int, int... | C++ | 10f3f4ae348fd4d28c371d8bf570d4c2 | 62ede6f59e28b1da96240bde2f8b8fcd | 1,300 | PASSED |
#include<iostream>
#include<algorithm>
#include<cstring>
#include<map>
#include<vector>
#include<queue>
#include<cmath>
#define int long long
#define IOS ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
using namespace std;
typedef pair<int,int> PII;
void solve(){
int n;
vector<PII> vo;
vector<... | C++ | 10f3f4ae348fd4d28c371d8bf570d4c2 | 4b77140a2bf5af8b6aae6b1dc9b8352b | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll INF = 1e9 + 100, MOD = 1e9 + 7, MAXN = 2e5;
const ld EPS = 1e-2;
random_device rd;
mt19937 rnd(rd());
#define debug(x) cerr << (#x) << ": " << x << endl;
#define pow2(x) ((x)*(x))
#define mod(x, m) (... | C++ | 10f3f4ae348fd4d28c371d8bf570d4c2 | 672000a62695afd5c0306edbdecb9805 | 1,300 | PASSED |
#include <iostream>
#include <bits/stdc++.h>
#include <vector>
using namespace std;
int main(){
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
int a[n];
for(int i = 0; i < n; i++) {
cin >> a[i];
}
cout << n - 1 << endl;
if(n - 1 > 0) {
cout << 1 << ' ' << n << endl;
if(n ... | C++ | 10f3f4ae348fd4d28c371d8bf570d4c2 | 6b01d33e9cfd9521a7ce0d482f51b6e8 | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define getDoubleTill(x, y) fixed<<setprecision(y)<<x
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << endl
#define all(x) x.begin(), x.end()
#define clr(x) memset(x, 0, sizeof(x... | C++ | 10f3f4ae348fd4d28c371d8bf570d4c2 | 8f63b6ef65e1d09ae091c7a2c9f248f5 | 1,300 | PASSED |
//
// main.cpp
// CP
//
// Created by richard_bachman
//
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
#include <iostream>
const int INF = 1061109567;
const long long LL_INF = 1000000000000000;
#define all(x) (x).begin(), (x).end... | C++ | 498b31f46ed24fb5fa7f126eaf377901 | 7f9b2e627e38090cbc2c8e0b2a0b0a7a | 2,000 | PASSED |
//
// main.cpp
// CP
//
// Created by richard_bachman
//
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
#include <iostream>
const int INF = 1061109567;
const long long LL_INF = 1000000000000000;
#define all(x) (x).begin(), (x).end... | C++ | 498b31f46ed24fb5fa7f126eaf377901 | 5176fd1f461473a2469fc143d85e84b3 | 2,000 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.