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>
using namespace std;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long t, n, x, y, z, a;
cin >> t;
while(t--){
cin >> n >> x >> y;
x%=2;
for(int i=0; i<n; i++){
cin >> a;
x^=(a%2);
}
... | C++ | d17752513405fc68d838e9b3792c7bef | 47006cb6fbcc73e62bf0642d04ddc3cf | 1,400 | PASSED |
# include <bits/stdc++.h>
# define ll long long
using namespace std;
int main() {
int cases;
scanf("%d", &cases);
while(cases--) {
ll N, x, y;
scanf("%lld %lld %lld", &N, &x, &y);
for(int i=0;i<N;i++) {
ll C;
scanf("%lld", &C);
x ^= C;
}
if((x&1) == (y&1)) printf("Alice\n");
else printf("... | C++ | d17752513405fc68d838e9b3792c7bef | e916b0e9952d6208cac0e2911a24f29b | 1,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define maxn 1000005
#define maxm 2000005
#define inf 0x3f3f3f3f
#define int long long
#define mod 1000000007
#define local
void file(string s){freopen((s+".in").c_str(),"r",stdin);freopen((s+".out").c_str(),"w",stdout);}
template <typename Tp> void read(Tp &x){
int fh=1;ch... | C++ | d17752513405fc68d838e9b3792c7bef | e84494d88d11f22da122f08ff7c2c166 | 1,400 | PASSED |
/* TAHMID RAHMAN
DAMIAN FOREVER
MATH LOVER
NEVER GIVE UP
*/
#include<bits/stdc++.h>
using namespace std;
#define pi acos(-1.0)
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define ll long long
#define pb push_back
#define fi first
#define se second
#define in insert
#define... | C++ | d17752513405fc68d838e9b3792c7bef | 7a4dc59a7b9a79c6c10057c34db5dab2 | 1,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
void Fast()
{std::ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);}
int main(){ Fast();
long long t,n,x,a,b;
cin>>t;
while(t--){
cin>>n>>x>>a;
for(int i=0;i<n;i++){
cin>>b; x+=b;}
if(((x&1)&&(a&1))||(x%2==0&&a%2==0))
cout<<"Alice\n";
else
cout<<"Bo... | C++ | d17752513405fc68d838e9b3792c7bef | 63d83d12061688b0e49322043c6d851a | 1,400 | PASSED |
#include <iostream>
#include <stdio.h>
using namespace std;
int main()
{
int _,n;
scanf("%d",&_);
long long y,x;
while(_--)
{
int tem,sum;
sum=0;
scanf("%d%lld%lld",&n,&x,&y);
for(int i=1;i<=n;i++)
{
scanf("%d",&tem);
if(tem%2)
... | C++ | d17752513405fc68d838e9b3792c7bef | 6389fd3264dbc70ae50c7839292ced98 | 1,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
long long n,x,y;
cin>>n>>x>>y;
long long sum=0;
for(int i=1;i<=n;i++)
{
long long cc;cin>>cc;
sum^=cc;
}
if((x^sum)%2==y%2)
{
cout<<"Alice"<<endl;
}
else
cout<<"Bob"<<endl;
}
}
... | C++ | d17752513405fc68d838e9b3792c7bef | 62e755398de53ae4697eec5f87cab26a | 1,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod=1e9+7;
int t;
ll n,x,y;
int main()
{
cin>>t;
while(t--)
{
cin>>n>>x>>y;
ll a;
for(int i=1;i<=n;i++)
{
cin>>a;
x^=a;
}
if(x%2==y%2) cout<<"Alice"<<'\n';
else cout<<"B... | C++ | d17752513405fc68d838e9b3792c7bef | 0fccc647431f1a2e0c8fdc0ed73443ef | 1,400 | PASSED |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <string>
#include <cstdio>
#include <map>
#define ll long long
using namespace std;
const int inf = 0x3f3f3f3f;
const int N = 1e5 + 5;
int s[N];
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
ll n,x,y;
... | C++ | d17752513405fc68d838e9b3792c7bef | 67270f976151d1a6dd7c721d70dce388 | 1,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> pri;
typedef pair<pri, int> prpi;
const int N = 400000;
typedef long long ll;
#define DI(n) int n; cin>>n
#define I(n) for (int i=0; i<n; i++)
#define J(n) for (int j=0; j<n; j++)
vector<string> res;
vector<int> g[N];
... | C++ | 14d16cfc20da1320ae844dd73b68cc3c | 97d13bd8195d8e5945672b60aea2dd87 | 2,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> pri;
typedef pair<pri, int> prpi;
const int N = 400000;
typedef long long ll;
#define DI(n) int n; cin>>n
#define I(n) for (int i=0; i<n; i++)
#define J(n) for (int j=0; j<n; j++)
vector<string> res;
map<int, vector<int... | C++ | 14d16cfc20da1320ae844dd73b68cc3c | 9ecd4a59892551769c955340ceb62fb5 | 2,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> pri;
typedef pair<pri, int> prpi;
const int N = 400000;
typedef long long ll;
#define DI(n) int n; cin>>n
#define I(n) for (int i=0; i<n; i++)
#define J(n) for (int j=0; j<n; j++)
vector<string> res;
map<int, vector<int... | C++ | 14d16cfc20da1320ae844dd73b68cc3c | e28e4ecf7c478218312e3072a8e59856 | 2,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> pri;
typedef pair<pri, int> prpi;
const int N = 400000;
typedef long long ll;
#define DI(n) int n; cin>>n
#define I(n) for (int i=0; i<n; i++)
#define J(n) for (int j=0; j<n; j++)
vector<string> res;
map<int, vector<int... | C++ | 14d16cfc20da1320ae844dd73b68cc3c | 4e0708b707036ef8fc1bb4df85a2ae65 | 2,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> pri;
typedef pair<pri, int> prpi;
const int N = 400000;
typedef long long ll;
#define DI(n) int n; cin>>n
#define I(n) for (int i=0; i<n; i++)
#define J(n) for (int j=0; j<n; j++)
vector<string> res;
map<int, vector<int... | C++ | 14d16cfc20da1320ae844dd73b68cc3c | f7bbd1b2d890cf7724f27150065b39a5 | 2,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> pri;
typedef pair<pri, int> prpi;
const int N = 400000;
typedef long long ll;
#define DI(n) int n; cin>>n
#define I(n) for (int i=0; i<n; i++)
#define J(n) for (int j=0; j<n; j++)
vector<string> res;
map<int, vector<int... | C++ | 14d16cfc20da1320ae844dd73b68cc3c | 760cd7953e87d742698e902841c0f4fb | 2,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> pri;
typedef pair<pri, int> prpi;
const int N = 400000;
typedef long long ll;
#define DI(n) int n; cin>>n
#define I(n) for (int i=0; i<n; i++)
#define J(n) for (int j=0; j<n; j++)
vector<string> res;
map<int, vector<int... | C++ | 14d16cfc20da1320ae844dd73b68cc3c | 74bf90729fdeadc10dc2b34f594bef12 | 2,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> pri;
typedef pair<pri, int> prpi;
const int N = 400000;
typedef long long ll;
#define DI(n) int n; cin>>n
#define I(n) for (int i=0; i<n; i++)
#define J(n) for (int j=0; j<n; j++)
vector<string> res;
map<int, vector<int> >... | C++ | 14d16cfc20da1320ae844dd73b68cc3c | f67dd60e7931cf44c835cb7ee71a5b39 | 2,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> pri;
typedef pair<pri, int> prpi;
const int N = 400000;
typedef long long ll;
#define DI(n) int n; cin>>n
#define I(n) for (int i=0; i<n; i++)
#define J(n) for (int j=0; j<n; j++)
vector<string> res;
map<int, vector<int> >... | C++ | 14d16cfc20da1320ae844dd73b68cc3c | ed396551c81832cfe71a9f1cb1449dae | 2,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> pri;
typedef pair<pri, int> prpi;
const int N = 400000;
typedef long long ll;
#define DI(n) int n; cin>>n
#define I(n) for (int i=0; i<n; i++)
#define J(n) for (int j=0; j<n; j++)
vector<string> res;
map<int, vector<int> >... | C++ | 14d16cfc20da1320ae844dd73b68cc3c | 566a4803ec6db2f51d0cfbbae96d271e | 2,400 | PASSED |
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
//using namespace __gnu_pbds;
#define int long long
#define MOD 1000000007
#define pb push_back
#define fi first
#define se second
#define endl "\n"
#define all(v) v.begin(), v.end(... | C++ | 85f0621e6cd7fa233cdee8269310f141 | 5870c95c7255d06a999b10040f7b7a0e | 800 | PASSED |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cctype>
#include<string>
#include<vector>
#include<deque>
#include<queue>
#include<set>
#include<map>
#include<stack>
#include<bitset>
#include<list>
#include<cmath>
#include<tuple>
using namespace std;
#define ll long long
#define doubl... | C++ | 85f0621e6cd7fa233cdee8269310f141 | ac03cda66133bf9c7d924c8965562a1a | 800 | PASSED |
#include <iostream>
#include <cstring>
using namespace std;
int n, t, used[55], ans[55], cnt;
void solve(int deeph = 0){
if(cnt == n)
return;
if(deeph >= n){
cnt++;
for(int i = 0; i < n; i++){
if(i != 0)
cout << ' ';
cout << ans[i];
}
... | C++ | 85f0621e6cd7fa233cdee8269310f141 | a686b3b45dcb5a3a0a36be6644d8bec7 | 800 | PASSED |
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front
#define ff first
#define ss second
#define SetBit(x, k) (x |= (1LL << k))
#define ClearBit(x, k) (x &= ~(1LL << k))
#define CheckBit(x, k) (x & (1LL << k))
#define scn(n) scanf("%d",&n)
#de... | C++ | 85f0621e6cd7fa233cdee8269310f141 | d6d1a6b2a8b26c4d12fd87e610d99798 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int a[10001];
int main(){
int t;
scanf("%d",&t);
while(t--){
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++) {
cout<<i;
for(int j=n;j>=1;j--){
if(i!=j) cout<<" "<<j;
}
cout<<endl;
}
}
}
| C++ | 85f0621e6cd7fa233cdee8269310f141 | e50c3874f90a53ddd6c377bcab736843 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int main () {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int tc; cin >> tc;
while(tc--){
int n; cin >> n;
if (n == 3){
cout << "3" << " " << "2" << " " << "1" << '\n';
cout << "3" << " " << "1" << " " << "2" << '\n';
cout <... | C++ | 85f0621e6cd7fa233cdee8269310f141 | c1e855f62f011ef1b748b3cdcb5b540f | 800 | PASSED |
#include<stdio.h>
#include<algorithm>
using namespace std;
int n;
int main(){
int t;
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
int a[60];
for(int i=1;i<=n;i++)
a[i]=i;
int ans=0;
do
{
for(int i=n;i>0;i--)
{
if(i!=n)
printf(" ");
printf("%d",a[i]);
}
puts("");
ans++;
... | C++ | 85f0621e6cd7fa233cdee8269310f141 | 5bf7699adafd7e6fbd0288b2ab00af77 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int a[55];
int main()
{
int T;
scanf("%d",&T);
while(T --)
{
int n;
scanf("%d",&n);
for(int i = n;i >= 1;i --)
{
a[i] = n - i + 1;
}
for(int i = 1;i <= n;i ++)
{
printf("%d ",a[i]... | C++ | 85f0621e6cd7fa233cdee8269310f141 | 4bcd17cea6aa3b617b6945bd8dfd30f5 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int t,n;
int main()
{
cin>>t;
while(t--)
{
cin>>n;
for(int i=1;i<=n;i++)
{
cout<<i;
for(int j=n;j>=1;j--)
{
if(j!=i)
cout<<" "<<j;
}
cout<<endl;
}
}
}
| C++ | 85f0621e6cd7fa233cdee8269310f141 | 14afa16704041fd4a70288c70e7938d7 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 998244353, N = 2e5 + 10, Log = 20 + 5;
void solve() {
vector<int> a;
int n;
cin >> n;
for(int i = n; i >= 1; i--) a.push_back(i);
for(int i : a) cout << i << ' ';
cout << '\n';
f... | C++ | 85f0621e6cd7fa233cdee8269310f141 | 572c4cabdac015939f4a9cc94dc2b691 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
long long n,x,a[1000005],g[1000005],mx,T;
int main()
{
cin>>T;
while(T--)
{
scanf("%lld%lld",&n,&x);
for(int i=1;i<=n;i++)
{
scanf("%lld",&a[i]);
g[i]=-1e9;
}
g[0]=0;
for(int i=2;i<=n;i++)
{
a[i]=a[i-1]+a[i];
}
for(int i=1;i<... | C++ | a5927e1883fbd5e5098a8454f6f6631f | 949747aa4be426aaad0a3c16192f9283 | 1,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int mx,n,x,t,g[100005],a[100005];
int main()
{
cin>>t;
while(t--)
{
cin>>n>>x;
for(int i=1;i<=n;i++)
{
cin>>a[i];
g[i]=-1e9;
}
g[0]=0;
for(int i=2;i<=n;i++)
{
a[i]=a[i-1]+a[i];
}
for(int i=1;i<=n;i++)
{
for(int j=i;j<=n;... | C++ | a5927e1883fbd5e5098a8454f6f6631f | 49d3811c6e47910ccce665e032e8ce46 | 1,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int t,n,x,a[5005],g[5005],imax;
int main()
{
scanf("%d",&t);
while(t--)
{
scanf("%d%d",&n,&x);
for(int i=1; i<=n; i++)
{
scanf("%d",&a[i]);
g[i]=-1e9;
}
g[0]=0,imax=0;
for(int i=2; i<=n; i... | C++ | a5927e1883fbd5e5098a8454f6f6631f | 56a4517c5755d8e4c904761f9699e29e | 1,400 | PASSED |
#include<bits/stdc++.h>
//#include<Windows.h>
using namespace std;
const int minv=-1e9;
int n,x,a[10000],g[10000],T,s[10000];
int main(){
ios::sync_with_stdio(0);
cin>>T;
while(T--)
{
g[0]=0;
cin>>n>>x;
for(int i=1;i<=n;i++) {cin>>a[i],g[i]=minv;}
for(int i=1;i<=n;i++) s[i]=s[i-1]+a[i];
for(... | C++ | a5927e1883fbd5e5098a8454f6f6631f | baca128af98bbd46f08cae64a1725337 | 1,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int a[5005],g[5005],s[5005];
int n,x;
int main()
{
int T;
cin>>T;
while(T--)
{
g[0]=0;
cin>>n>>x;
for(int i=1;i<=n;i++)
{
cin>>a[i];
g[i]=-1e9;
}
for(int i=1;i<=n;i++)
{
s[i]=s[i-1]+a[i];... | C++ | a5927e1883fbd5e5098a8454f6f6631f | bfeb410df9491f72d5252573c25277ae | 1,400 | PASSED |
#include<bits/stdc++.h>
//#include<Windows.h>
using namespace std;
const int minv=-1e9;
int n,x,a[10000],g[10000],T,s[10000];
int main(){
ios::sync_with_stdio(0);
cin>>T;
while(T--)
{
g[0]=0;
cin>>n>>x;
for(int i=1;i<=n;i++) {cin>>a[i],g[i]=minv;}
for(int i=1;i<=n;i++) s[i]=s[i-1]+a[i];
for(... | C++ | a5927e1883fbd5e5098a8454f6f6631f | fe866218e2e99eb23f35c431a8da0680 | 1,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
long long n,x,a[100005],g[100005],mx,s[100005],t;
int main()
{
cin>>t;
while(t--)
{
cin>>n>>x;
for(int i=1;i<=n;i++)
{
cin>>a[i];
g[0]=0;
g[i]=-1e9;
}
for(int i=1;i<=n;i++)
{
s[i]=s[i-1]+a[i];
}
... | C++ | a5927e1883fbd5e5098a8454f6f6631f | 7aa565c19690ab942f567362f3c40a6c | 1,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int n,x,a[100001],g[100001],mx,s[100001],T;
int main()
{
cin>>T;
while(T--)
{
cin>>n>>x;
g[0]=0;
for(int i=1;i<=n;i++)
{
cin>>a[i];
g[i]=-1e9;
}
for(int i=1;i<=n;i++)
s[i]=s[i-1]+a[i];
for(int i=1;i<=n;i++)
{
for(int j=i;j<=n;j++)
{
... | C++ | a5927e1883fbd5e5098a8454f6f6631f | c6dd6af0c85978c8f72445c9f3865def | 1,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t,n,x,a[10000],g[10000],s[10000];
cin>>t;
while(t--)
{ g[0]=0;
s[0]=0;
cin>>n>>x;
for(int i=1;i<=n;i++)
{
cin>>a[i];
g[i]=-1e9;
}
for(int i=1;i<=n;i++)
{
s[i]=s[i-1]+a[i];
}
for(int i=1;i<=n;i++)
{
fo... | C++ | a5927e1883fbd5e5098a8454f6f6631f | b82f11626fe390a8f578495ef7ab97c2 | 1,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int n,x,t,a[5500],g[5500],s[5500];
int main()
{
cin>>t;
while(t--)
{
cin>>n>>x;
g[0]=0;
for(int i=1;i<=n;i++)
{
cin>>a[i];
g[i]=-1e9;
}
for(int i=1;i<=n;i++) s[i]=s[i-1]+a[i];
for(int i=1;i<=n;i++)
{
for(int j=i;j<=n;j++)
{
... | C++ | a5927e1883fbd5e5098a8454f6f6631f | 3553d3100e48e23dd520d87c7bd4439c | 1,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int n;
string a;
int main()
{
cin>>n;
while(n--)
{
cin>>a;
int b=0,c=0,d=0,e;
for(int i=0;i<a.size();i++)
{
e=i+1;
if(a[i]=='r')
b=1;
else if(a[i]=='g')
c=1;
else if(a[i]=='b')
d=1;
else if(a[i]=='R' && b==0)
{
... | C++ | 60eb29b2dfb4d6b136c58b33dbd2558e | f0f8d9f6b1772beb94bc27a76b36743d | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
while(n--){
string s;
cin>>s;
int a=0,b=0,c=0,d=0;
for(int i=0;i<s.length();i++){
if(s[i]=='r'){
a=1;
}
if(s[i]=='g'){
b=1;
}
if(s[i]=='b'){
c=1;
}
if(s[i]=='R'&&a==1){
d++;
}
... | C++ | 60eb29b2dfb4d6b136c58b33dbd2558e | 20f03b8d2936793797a1347893f66086 | 800 | PASSED |
#include <iostream>
using namespace std;
int main()
{
int T, len, f, fr, fg, fb; //æTç»æµè¯æ°æ®
cin>>T;
string s;
while(T--)
{
cin>>s;
f=fr=fg=fb=0; //æ¯æ¬¡è¦åå§å
len = s.size();
for(int i=0; i<len; i++)
{
if(s[i] == 'r') fr=1;
else if(s[i] == 'g') fg=1;
... | C++ | 60eb29b2dfb4d6b136c58b33dbd2558e | c64762b04e8cbb5489ba821b6200e774 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
string a;
cin>>a;
int f[7]={0};
for(int i=0; i<a.size(); i++)
{
if(a[i]=='r')
f[1]=1;
else if(a[i]=='g')
f[2]=1;
else if(a[i]=='b')
f[3]=1;
if(a[i]=='R'&&f[1]==1)
f[4]=1;... | C++ | 60eb29b2dfb4d6b136c58b33dbd2558e | 2cab531f490e56ad49bad6bc4eb0b6d7 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
string a;
cin>>a;
int f[7]={0};
for(int i=0; i<a.size(); i++)
{
if(a[i]=='r')
f[1]=1;
else if(a[i]=='g')
f[2]=1;
else if(a[i]=='b')
f[3]=1;
if(a[i]=='R'&&f[1]==1)
f[4]=1;... | C++ | 60eb29b2dfb4d6b136c58b33dbd2558e | 5010973ac13df201398d12060b01b159 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
string a;
cin>>a;
int f[7]={0};
for(int i=0; i<a.size(); i++)
{
if(a[i]=='r')
f[1]=1;
else if(a[i]=='g')
f[2]=1;
else if(a[i]=='b')
f[3]=1;
if(a[i]=='R'&&f[1]==1)
f[4]=1;... | C++ | 60eb29b2dfb4d6b136c58b33dbd2558e | 3c3cc9e16cc54e553a96a0fb4de557c7 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
string a;
cin>>a;
int f[7]={0};
for(int i=0; i<a.size(); i++)
{
if(a[i]=='r')
f[1]=1;
else if(a[i]=='g')
f[2]=1;
else if(a[i]=='b')
f[3]=1;
if(a[i]=='R'&&f[1]==1)
f[4]=1;... | C++ | 60eb29b2dfb4d6b136c58b33dbd2558e | 40d52add52ffe58ea40a43c6cc350bd6 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
string a;
cin>>a;
int f[7]={0};
for(int i=0; i<a.size(); i++)
{
if(a[i]=='r')
f[1]=1;
else if(a[i]=='g')
f[2]=1;
else if(a[i]=='b')
f[3]=1;
if(a[i]=='R'&&f[1]==1)
f[4]=1;... | C++ | 60eb29b2dfb4d6b136c58b33dbd2558e | 969dbfe1e446e68f0380316ab918ff8e | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string a;
int n;
cin>>n;
for(int i=0; i<n; i++)
{
cin>>a;
int f1=0,f2=0,f3=0,k=0;
for(int j=0; j<6; j++)
{
if(a[j]=='R'&&f1==0||a[j]=='G'&&f2==0||a[j]=='B'&&f3==0)
{
cout<<"NO\n";
k=1;
break;
}
i... | C++ | 60eb29b2dfb4d6b136c58b33dbd2558e | 13e8805104885fe750e6fd2dedacb628 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int t;
bool r, g, b;
string s;
int main() {
scanf("%d", &t);
while(t--) {
cin >> s;
bool flag = true;
r = 0, g = 0, b = 0;
for(int i = 0; i < s.size(); i++) {
switch (s[i]) {
case 'r':r = 1;break;
case 'g':g = 1;break;
case 'b':b = 1;b... | C++ | 60eb29b2dfb4d6b136c58b33dbd2558e | 295c6dcc7003713cfbd277a1963a72df | 800 | PASSED |
#include <stdio.h>
#include <iostream>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <string>
#include <cstring>
#include <algorithm>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <string>
#include <set>
#include <bitset>
#include <vector>
#include <map>
#... | C++ | 623a373709e4c4223fbbb9a320f307b1 | f89562773a920a2d9ecd5401d6b7fe53 | 1,700 | PASSED |
#include <stdio.h>
#include <iostream>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <string>
#include <cstring>
#include <algorithm>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <string>
#include <set>
#include <bitset>
#include <vector>
#include <map>
#... | C++ | 623a373709e4c4223fbbb9a320f307b1 | 107723733b2abda39dcf8a4b25df5e9d | 1,700 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn = 200010;
const int mod = 998244353;
bool col[maxn], row[maxn];
int numr, numc;
int n, m, k, q;
int x[maxn], y[maxn];
void solve() {
scanf("%d%d%d%d", &n, &m, &k, &q);
for (int i = 0; i < q; ++i) {
scanf("%d%d", &x[i], &y... | C++ | 623a373709e4c4223fbbb9a320f307b1 | 497b908d85b267e238104e049e0fde25 | 1,700 | PASSED |
#include <stdio.h>
#include <iostream>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <string>
#include <cstring>
#include <algorithm>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <string>
#include <set>
#include <bitset>
#include <vector>
#include <map>
#... | C++ | 623a373709e4c4223fbbb9a320f307b1 | dd4ff65180ecfe00fde63291d9580e5d | 1,700 | PASSED |
//=========================== INCLUDE =============================================
#include <iostream>
#include <fstream>
#include <stdio.h>
#include <cstdio>
#include <stdlib.h>
#include <cmath>
#include <set>
#include <map>
#include <queue>
#include <numeric>
#include <algorithm>
#include <vector>... | C++ | 623a373709e4c4223fbbb9a320f307b1 | 4cd30889d47eaeb87d5f4a6cd5b73fee | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb push_back
#define mp make_pair
#define f first
#define s second
const int INF = 1e9 + 7;
const int MOD = 998244353;
int main(){
int tc;
cin >> tc;
while(tc--){
int n, m;
ll k; int q;
... | C++ | 623a373709e4c4223fbbb9a320f307b1 | 053e0e37283966155d8ca81593f8a251 | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb push_back
#define mp make_pair
#define f first
#define s second
const int INF = 1e9 + 7;
const int MOD = 998244353;
int main(){
cin.tie(0) -> sync_with_stdio(0);
int tc;
cin >> tc;
while(tc--){
i... | C++ | 623a373709e4c4223fbbb9a320f307b1 | 2786e008efa6c04dd4d8502efb7198b1 | 1,700 | PASSED |
#include <bits/stdc++.h>
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define sz(a) (int)(a).size()
#define F first
#define S second
using namespace std;
#define int long long
using pi = pair<int, int>;
using vi = vector<int>;
const int mod = 998244353;
int bpow(in... | C++ | 623a373709e4c4223fbbb9a320f307b1 | 0c76340507b2e72eec23f17d6c1c6a2f | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll mod = 998244353;
ll binexp(ll a, ll b) {
if (b == 0) return 1;
ll cur = binexp(a, b / 2);
cur = (cur * cur) % mod;
return (b & 1 ? (cur * a) % mod : cur);
}
void solve(int tc) {
int n, m, q; ll k; cin >> n >... | C++ | 623a373709e4c4223fbbb9a320f307b1 | e2c1e635ba7bb73c39ddcd93ba6eec88 | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int MOD = 998244353;
// what the hell is wrong with me putting hyphens in the mod
// Find the number of possibly-different-coloured cells and the answer
// will be k^that number. How to find? Iterate backwards since any first
// q... | C++ | 623a373709e4c4223fbbb9a320f307b1 | 75748752d95278cb889b139cbf1234cd | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
static struct FastInput {
static constexpr int BUF_SIZE = 1 << 20;
char buf[BUF_SIZE];
size_t chars_read = 0;
size_t buf_pos = 0;
FILE *in = stdin;
char cur = 0;
inline char get_char() {
if (buf_pos >= c... | C++ | 113a43af2f1c5303f83eb842ef532040 | 2583b525b1549583506a2e40ecbb2ae0 | 1,900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
int n;
string s;
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int tt=1;
cin>>tt;
while(tt--)
{
cin>>n>>s;
/* if(tt==10000-35)
{
... | C++ | 113a43af2f1c5303f83eb842ef532040 | bcc40a1b84279d94847ae1d49c0fb88c | 1,900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
int n;
string s;
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int tt=1;
cin>>tt;
while(tt--)
{
cin>>n>>s;
/* if(tt==10000-35)
{
... | C++ | 113a43af2f1c5303f83eb842ef532040 | cd71aecd666f95505085f53e28f813cd | 1,900 | PASSED |
//blog: vk.com/power_of_symmetry
//#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC target("avx,avx2,tune=native")
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include... | C++ | 113a43af2f1c5303f83eb842ef532040 | 67d7ed38f64cdf82ed0a35a737ea9999 | 1,900 | PASSED |
//blog: vk.com/power_of_symmetry
//#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC target("avx,avx2,tune=native")
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include... | C++ | 113a43af2f1c5303f83eb842ef532040 | 98bfb3bc154b89b3fa8592e3dade93bb | 1,900 | PASSED |
//blog: vk.com/power_of_symmetry
//#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC target("avx,avx2,tune=native")
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include... | C++ | 113a43af2f1c5303f83eb842ef532040 | c0b092918bc6820c6b99bc8e9e7afb7a | 1,900 | PASSED |
//blog: vk.com/power_of_symmetry
//#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC target("avx,avx2,tune=native")
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include... | C++ | 113a43af2f1c5303f83eb842ef532040 | d9ade963733d5af03f01cc18a6ef594d | 1,900 | PASSED |
//blog: vk.com/power_of_symmetry
//#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC target("avx,avx2,tune=native")
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include... | C++ | 113a43af2f1c5303f83eb842ef532040 | 9d8954b068bf0af4c3c8d9b440e9beda | 1,900 | PASSED |
//blog: vk.com/power_of_symmetry
//#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC target("avx,avx2,tune=native")
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include... | C++ | 113a43af2f1c5303f83eb842ef532040 | affd9d8849797129ab4b06f9c1f05b34 | 1,900 | PASSED |
//blog: vk.com/power_of_symmetry
//#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC target("avx,avx2,tune=native")
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include... | C++ | 113a43af2f1c5303f83eb842ef532040 | 3243865c4acf51214f5469d4c0127761 | 1,900 | PASSED |
#include<bits/stdc++.h>
#define ii pair<int, int>
#define st first
#define nd second
#define pb push_back
#define pf push_front
#define N 2005
using namespace std;
int n;
bool good[N][N];
vector<ii> edges;
vector<int> nodes;
vector<int> idx_l, idx_r, idx_all;
int dad[N];
string s;
void merge_idx(... | C++ | 4393b6a482697df9cac2fa50e7124a77 | f7d02639c06a755df165e6b623f08723 | 3,400 | PASSED |
#include<bits/stdc++.h>
#define ii pair<int, int>
#define st first
#define nd second
#define pb push_back
#define pf push_front
#define N 2005
using namespace std;
int n;
bool good[N][N];
vector<ii> edges;
vector<int> nodes;
vector<int> idx_l, idx_r, idx_all;
int dad[N];
void merge_idx() {
id... | C++ | 4393b6a482697df9cac2fa50e7124a77 | b7b96d72cc647b03aa7c12ac3b8f7ab2 | 3,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fi first
#define se second
const int N=2e6+1;
ll n;
int a[2001][2001];
typedef pair<int,int> pii;
void add(vector<pii>&x,vector<pii>&y){
for(auto c:y) x.push_back(c);
}
vector<pii>solve(int l,int r){
vector<pii>e;
if(l==r) retur... | C++ | 4393b6a482697df9cac2fa50e7124a77 | 991955746e9344fc793aecbc5dcafe11 | 3,400 | PASSED |
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#define N 2005
using namespace std;
int n,fa[N];
vector<pair<int,int> > v;
char s[N][N];
inline int find(int x){return fa[x]==x?x:fa[x]=find(fa[x]);}
void link(int x,int y){
printf("%d %d\n",x,y);
v.push_back({x,y});
}
void solve(){
scanf("%d",&n);
... | C++ | 4393b6a482697df9cac2fa50e7124a77 | 4f72721a8a6a482eb78ae52d89adec72 | 3,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int c=2005;
int w, n, veg[c], kezd[c];
bool v[c][c];
vector<pair<int, int> > ans;
void add(int a, int b) {
ans.push_back({a, b});
}
int main()
{
ios_base::sync_with_stdio(false);
cin >> w;
while (w--) {
cin >> n;
for (i... | C++ | 4393b6a482697df9cac2fa50e7124a77 | d4ed7f061a87fc8d062b842ebf934149 | 3,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int c=2005;
int w, n, veg[c], kezd[c];
bool v[c][c];
vector<pair<int, int> > ans;
void add(int a, int b) {
ans.push_back({a, b});
}
int main()
{
ios_base::sync_with_stdio(false);
cin >> w;
while (w--) {
cin >> n;
for (i... | C++ | 4393b6a482697df9cac2fa50e7124a77 | a57cc06a6b6ab27981b8ea71d544cddf | 3,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
vector<array<int, 2>> segs;
for (int i = 1; i <= n; ++i) {
for (int j = i; j <= n; ++j) {
... | C++ | 4393b6a482697df9cac2fa50e7124a77 | 1d9fb088a3b6e7bca0f7b41f20deca1f | 3,400 | PASSED |
#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); ++i)
#define R(i, j, k) for(int i = (j); i >= (k); --i)
#define ll long long
#define sz(a) ((int) (a).size())
#define vi vector < int >
#define me(a, x) memset(a, x, sizeof(a))
#define ull unsigned long long
#define ld __float128
using names... | C++ | 4393b6a482697df9cac2fa50e7124a77 | 036b59ae8b5ebedd3bd33983d55b4fab | 3,400 | PASSED |
#include <bits/stdc++.h>
#include <algorithm>
#include <cassert>
#include <vector>
namespace atcoder {
// Implement (union by size) + (path compression)
// Reference:
// Zvi Galil and Giuseppe F. Italiano,
// Data structures and algorithms for disjoint set union problems
struct dsu {
public:
dsu() : _n(0) {}
... | C++ | 4393b6a482697df9cac2fa50e7124a77 | 19a812440dc66744d4374caaed1b3b77 | 3,400 | PASSED |
#include <bits/stdc++.h>
#include <algorithm>
#include <cassert>
#include <vector>
namespace atcoder {
// Implement (union by size) + (path compression)
// Reference:
// Zvi Galil and Giuseppe F. Italiano,
// Data structures and algorithms for disjoint set union problems
struct dsu {
public:
dsu() : _n(0) {}
... | C++ | 4393b6a482697df9cac2fa50e7124a77 | 05167a422d0bc9ecaded9bfdef4efc1f | 3,400 | PASSED |
// LUOGU_RID: 91497652
#include<cstdio>
#include<algorithm>
#define LL long long
using namespace std;
const int N = 2e5 + 5;
int n, m, X, Y, ln[N], lm[N];
struct nd{int z, id;}a[N], b[N];
bool cmp(nd x, nd y){return x.z < y.z;}
int check(int lit) {
if (a[X].z + b[Y].z <= lit) return 1;
LL res = 0, tmp = ... | C++ | 05e5b2a46f4d57c54c5c1497c589d7c1 | 38f5090bd384e712787f552021b5081f | 2,400 | PASSED |
// LUOGU_RID: 91417896
#include<bits/stdc++.h>
#define N 1000000
#define ll long long
using namespace std;
ll n,m,a[N],b[N],x,y,l,r,mid,ans,s[N],mn1[N],mn2[N];
ll v,sum1,sum2,sv[N];
bool cmp(ll a,ll b){return a>b;}
ll get(ll x,ll y){
ll h=0;
if(x!=0&&y!=0)
if(mn1[y]<=x)h+=(sv[x]-sv[mn1[y]])+mn1[y]*y;
els... | C++ | 05e5b2a46f4d57c54c5c1497c589d7c1 | 415327d8f63793fb4d910f6e03d6770e | 2,400 | PASSED |
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int O = 2e5 + 5;
int n, m, a1, b1, a[O], b[O], row[O], col[O];
bool check(int x){
int I = 0;
/// row
for (int i = 1, j = m; i <= n; ++ i){
while (a[i] + b[j] > x && j) j -= 1;
row[i] = j;
I... | C++ | 05e5b2a46f4d57c54c5c1497c589d7c1 | 5c06c553e60700217e9674ccb31381c0 | 2,400 | PASSED |
#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#define R register
using namespace std;
const int N=3e6+5;
int n,m,xx,yy,jla1,jlb1;
int a[N],b[N],yclh[N],ycll[N];
int getl(int x,int y)
{
int res=min(ycll[x],y);
return res;
}
int geth(int x,int y)
{
int res=min(yclh[x],y);
re... | C++ | 05e5b2a46f4d57c54c5c1497c589d7c1 | eb07b1a571f4fbd4a1d18c26b6ae8235 | 2,400 | PASSED |
#include<bits/stdc++.h>
#define I inline
#define R register
#define LL long long
#define fo(i, a, b) for(R int i = a; i <= b; ++i)
#define fd(i, a, b) for(R int i = a; i >= b; --i)
#define fz(i, x) for(R int i = head[x]; i; i = nxt[i])
using namespace std;
const int N = 200010, P = 1000000007, inf = 0x3f3f3f3f;... | C++ | 05e5b2a46f4d57c54c5c1497c589d7c1 | e0a90cf7e19615de3a4257f24bac8f70 | 2,400 | PASSED |
// LUOGU_RID: 91394149
#include <bits/stdc++.h>
#define maxN 200010
#define LL long long
using namespace std;
LL R = 0, C = 0, n = 0, m = 0;
LL A[maxN], B[maxN];
LL sum[maxN], len[maxN], pos[maxN];
LL read ()
{
LL x = 0, Fu = 1;
char c = getchar();
while(c < '0' || c > '9')
{
if(c == '-') Fu = -1;
... | C++ | 05e5b2a46f4d57c54c5c1497c589d7c1 | 834319b771b9a3bafbc7259287134544 | 2,400 | PASSED |
// LUOGU_RID: 91324534
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
const int N=2e5+5;
int a[N],b[N],col[N],n,m,Sx,Sy,ans;
long long row[N];
ll calc(int x,int y,int op)
{
ll res=1ll*x*y+1ll*(n-x)*(m-y);
if (col[y]>=x)
res-=row[col[y]]-row[x]-1ll*(col[y]-x)*y;
else res-=row[col[y]]-... | C++ | 05e5b2a46f4d57c54c5c1497c589d7c1 | 4c781d401029bf6e723a41843c826f68 | 2,400 | PASSED |
// LUOGU_RID: 91312528
#include<cstdio>
#include<algorithm>
using namespace std;
const int N=2e5+5;
int n,m,l,r,mid,ans,a[N],b[N],px,py,d[N];
long long c[N];
long long calc(int x,int y,int z)
{
long long res=1ll*x*y+1ll*(n-x)*(m-y);
if(x<=d[y])res-=c[d[y]]-c[x]-1ll*(d[y]-x)*y;
else res-=1ll*(x-d[y])*y-c[x]... | C++ | 05e5b2a46f4d57c54c5c1497c589d7c1 | 102bfbc0b26b95d52e9d72b8577a1496 | 2,400 | PASSED |
// LUOGU_RID: 91118782
#include<bits/stdc++.h>
#define il inline
#define ll long long
using namespace std;
const int maxn=300010;
il int read(){
int x=0;
char c=getchar();
for(;!(c>='0'&&c<='9');c=getchar());
for(;c>='0'&&c<='9';c=getchar())
x=(x<<1)+(x<<3)+c-'0';
return x;
}
int px,py;
ll pre[maxn],lst[maxn];
i... | C++ | 05e5b2a46f4d57c54c5c1497c589d7c1 | ca0fd59a4e8511294cdafad9cf11e454 | 2,400 | PASSED |
#include<bits/stdc++.h>
#define il inline
#define ll long long
using namespace std;
const int maxn=300010;
il int read(){
int x=0;
char c=getchar();
for(;!(c>='0'&&c<='9');c=getchar());
for(;c>='0'&&c<='9';c=getchar())
x=(x<<1)+(x<<3)+c-'0';
return x;
}
int px,py;
ll pre[maxn],lst[maxn];
int n,m,a... | C++ | 05e5b2a46f4d57c54c5c1497c589d7c1 | 0ccf750d504b1a816d4782376ec43a4f | 2,400 | PASSED |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define int long long
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
... | C++ | fc75935b149cf9f4f2ddb9e2ac01d1c2 | 99e6e3f96577faceed0f1d3993782901 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define rep(x,start,end) for(auto x=(start)-((start)>(end));x!=(end)-((start)>(end));((start)<(end)?x++:x--))
int n;
int arr[105];
signed main(){
int TC;
cin>>TC;
while (TC--){
cin>>n;
... | C++ | fc75935b149cf9f4f2ddb9e2ac01d1c2 | ca43d176358619a803499c31ff105a4f | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main(){
int t;cin>>t;
while(t--){
int n;cin>>n;
int arr[n];
for(int i=0;i<n;++i){
cin>>arr[i];
}
int sum = 0;
for(int i=0;i<n;++i){
sum = sum+arr[i]-1;
}
if(sum%2 == 0){
cout<<"maomao90\n";
}else{
cout<<"errorgor... | C++ | fc75935b149cf9f4f2ddb9e2ac01d1c2 | e683c547a492457525d52badaac3b39e | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;cin>>t;
int x=0;
while (t--){
int n;
cin>>n;
int arr[n];
int x=0;
for (int i=0;i<n;i++){
cin>>arr[i];
x+=arr[i]-1;
}
if (x%2==0){
co... | C++ | fc75935b149cf9f4f2ddb9e2ac01d1c2 | c65c0a257aa687ed706ddf6e628f127c | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int dq(int n) {
if(n == 1) return 0;
if(n == 2) return 1;
if(n % 2 == 1) return 1 + dq(n - 1);
else return 2 * dq(n / 2) + 1;
}
void solve() {
int n; cin >> n;
vector<int> a(n);
for(auto &i : a) cin >> i;
// if(n == 1) {
... | C++ | fc75935b149cf9f4f2ddb9e2ac01d1c2 | fdf4320ec162b8c43b321152bfea2f1d | 800 | PASSED |
#include <bits/stdc++.h>
#define int long long
#define ll long long
#define ff first
#define ss second
using namespace std;
signed main(){
int TTTT=1;
cin>>TTTT;
while(TTTT--){
int n;
cin>>n;
int a[n],s=0;
for(int i=0;i<n;i++)
cin>>a[i],s+=a[i];
s-=n;
if... | C++ | fc75935b149cf9f4f2ddb9e2ac01d1c2 | 8cd126b51cf40da8e9c5e23106405335 | 800 | PASSED |
#include<iostream>
#include<string>
#include<bits/stdc++.h>
#define ll long long
#define p(n,os) pow(n,os)
#define dd long double
#define des(x1,y1,x2,y2) sqrt(pow(x1-x2,2)+pow(y1-y2,2))
#define endl '\n'
#define Mabrouk ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr)
using namespace ... | C++ | fc75935b149cf9f4f2ddb9e2ac01d1c2 | 3ebf2fcb3336eddc2be799cb3e321835 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
main(){
int t;
cin>>t;
while(t--){
int n;
cin>>n;
int cnt=0;
for(int i=0;i<n;i++){
int x;
cin>>x;
cnt+=(x-1);
}
if(cnt%2) cout<<"errorgorn"<<endl;
else cout<<"maomao90"<<endl;
}
} | C++ | fc75935b149cf9f4f2ddb9e2ac01d1c2 | f7ff2445e03cf2a68fdb2e79f85b0e96 | 800 | PASSED |
#include<iostream>
#include<vector>
#include<algorithm>
#include<iomanip>
#include<set>
#include <cmath>
#include<unordered_map>
#include<utility>
#include<cstdlib>
#define int long long
#define endl '\n'
#define FAST_IO ios_base::sync_with_stdio(false);cin.tie(NULL)
using namespace std;
void addRToStringNTimes(string... | C++ | fc75935b149cf9f4f2ddb9e2ac01d1c2 | 3e3610763a608cc45d551e88ad181520 | 800 | PASSED |
#include<iostream>
#include<stdio.h>
#include<math.h>
#include<bits/stdc++.h>
using namespace std;
int main(){
int t;
int n;
cin>>t;
//int p=0;
int p;
int arr[1000];
while(t--){
p=0;
cin>>n;
for(int i=1;i<n+1;i++){
scanf("%d",&arr[i]);
p=p+arr[i]-1;}
if(p%2==1)
... | C++ | fc75935b149cf9f4f2ddb9e2ac01d1c2 | 66a9e44d2a83940f4b1fe55031443ebe | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll t;
cin>>t;
while(t--)
{
string s;
cin>>s;
// map<char,ll> m;
ll n=s.size();
if(n==1)
{
cout<<"NO"<<endl;
continue;
}
... | C++ | 0b9be2f076cfa13cdc76c489bf1ea416 | 6f9ce9f5fa75b14d71f903e29ec9961b | 800 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.