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;
const int MOD=1000000007;
long long POW(long long a,long long b){
long long res=1;
while(b>0){
if(b%2) res=res*a%MOD;
a=a*a%MOD;
b/=2;
}
return res;
}
void solve(){
int n,m;
cin>>n>>m;
int ans=0; int ... | C++ | c4ba92632e10b1710686930f0c4536fa | 38140abcc3a416b371d81a481f3b1de6 | 1,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int MOD=1000000007;
void solve(){
int n,m;
cin>>n>>m;
int ans=0; int x;
for(int i=0;i<m;i++) cin>>x>>x>>x,ans|=x;
ans%=MOD;
for(int i=0;i<n-1;i++) ans=ans*2%MOD;
cout<<ans<<'\n';
}
int main(){
ios::sync_with_stdio(0)... | C++ | c4ba92632e10b1710686930f0c4536fa | e1f7a5178e5ac2c39bba840d5e2642c4 | 1,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int MOD=1000000007;
void solve(){
int n,m;
cin>>n>>m;
long long ans=0; long long x;
for(int i=0;i<m;i++) cin>>x>>x>>x,ans|=x;
ans%=MOD;
for(int i=0;i<n-1;i++) ans=2LL*ans%MOD;
cout<<ans<<'\n';
}
int main(){
ios::sync... | C++ | c4ba92632e10b1710686930f0c4536fa | 7c463118e6dbc56f8cb7fbc2bbb88dd6 | 1,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int MOD=1000000007;
void solve(){
int n,m;
cin>>n>>m;
long long ans=0; long long x;
for(int i=0;i<m;i++) cin>>x>>x>>x,ans|=x;
ans%=MOD;
for(int i=0;i<n-1;i++) ans=ans*2%MOD;
cout<<ans<<'\n';
}
int main(){
ios::sync_w... | C++ | c4ba92632e10b1710686930f0c4536fa | 57b840449f540d41125e7f0ccf4ea139 | 1,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int MOD=1000000007;
void solve(){
int n,m;
cin>>n>>m;
long long ans=0; long long x;
for(int i=0;i<m;i++) cin>>x>>x>>x,ans|=x;
long long K=1;
for(int i=0;i<n-1;i++) K=K*2%MOD;
cout<<ans*K%MOD<<'\n';
}
int main(){
ios:... | C++ | c4ba92632e10b1710686930f0c4536fa | c72284ec00424853b83edd39df7fe019 | 1,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int MOD=1000000007;
long long POW(long long a,long long b){
long long res=1;
while(b>0){
if(b%2) res=res*a%MOD;
a=a*a%MOD;
b/=2;
}
return res;
}
void solve(){
int n,m;
cin>>n>>m;
long long ans=0... | C++ | c4ba92632e10b1710686930f0c4536fa | 1cf5060ce27a4cabc50bfe7b02139526 | 1,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int MOD=1000000007;
void solve(){
int n,m;
cin>>n>>m;
vector<int> x(m);
for(int i=0;i<m;i++) cin>>x[i]>>x[i]>>x[i];
int K=1;
for(int i=0;i<n-1;i++) K=K*2%MOD;
int ans=0;
for(int bit=0;bit<30;bit++){
bool one=0;
... | C++ | c4ba92632e10b1710686930f0c4536fa | 619bf230df4ec842b39abe34af942850 | 1,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int MOD=1000000007;
long long POW(long long a,long long b){
long long res=1;
while(b>0){
if(b%2) res=res*a%MOD;
a=a*a%MOD;
b/=2;
}
return res;
}
void solve(){
int n,m;
cin>>n>>m;
vector<int> x(m... | C++ | c4ba92632e10b1710686930f0c4536fa | 9dff519454d6cde679e9a44979f886de | 1,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int MOD=1000000007;
long long POW(long long a,long long b){
long long res=1;
while(b>0){
if(b%2) res=res*a%MOD;
a=a*a%MOD;
b/=2;
}
return res;
}
void solve(){
int n,m;
cin>>n>>m;
vector<int> x(m... | C++ | c4ba92632e10b1710686930f0c4536fa | f1064a96e3408d40d76e581e43cb060c | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
void solve (){
int n, l, r, k;
cin >> n >> l >> r >> k;
std::vector<int> v(n);
int count = 0;
for (int i = 0; i < n; ++i)
cin >> v[i];
for (int i = 0; i < n / 20; ++i) {
for (int i = 0; i < n / 20; ++i) {
for (int i = 0; i < n ... | C++ | f577695d39a11e8507681f307677c883 | 0a44b78eb6b36c910f515adff8aa8e64 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
void solve (){
int n, l, r, k;
cin >> n >> l >> r >> k;
std::vector<int> v(n);
int count = 0;
for (int i = 0; i < n; ++i)
cin >> v[i];
for (int i = 0; i < n / 20; ++i) {
for (int i = 0; i < n / 20; ++i) {
for (int i = 0; i < n ... | C++ | f577695d39a11e8507681f307677c883 | 0f11985140d8f4b9051f12a1e6d9bd5b | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
void solve (){
int n, l, r, k;
cin >> n >> l >> r >> k;
std::vector<int> v(n);
int count = 0;
for (int i = 0; i < n; ++i)
cin >> v[i];
for (int i = 0; i < n * n * n * n * n * n * n * 10000000; ++i) {
for (int i = 0; i < n; ++i) {
... | C++ | f577695d39a11e8507681f307677c883 | cba0963cd611af502044b405aae08527 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
void solve (){
int n, l, r, k;
cin >> n >> l >> r >> k;
std::vector<int> v(n);
int count = 0;
for (int i = 0; i < n; ++i)
cin >> v[i];
for (int i = 0; i < n * n * n * n * n * n * n; ++i) {
for (int i = 0; i < n; ++i) {
for (int... | C++ | f577695d39a11e8507681f307677c883 | 96f9a2e4f03503615ed00c573e45f262 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
void solve (){
int n, l, r, k;
cin >> n >> l >> r >> k;
std::vector<int> v(n);
int count = 0;
for (int i = 0; i < n; ++i)
cin >> v[i];
for (int i = 0; i < n * n * n; ++i) {
for (int i = 0; i < n; ++i) {
for (int i = 0; i < n; +... | C++ | f577695d39a11e8507681f307677c883 | beea53d2363acd4e7731d3f2dfba6f5e | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
void solve (){
int n, l, r, k;
cin >> n >> l >> r >> k;
std::vector<int> v(n);
int count = 0;
for (int i = 0; i < n; ++i)
cin >> v[i];
for (int i = 0; i < n * n; ++i) {
for (int i = 0; i < n; ++i) {
for (int i = 0; i < n; ++i) ... | C++ | f577695d39a11e8507681f307677c883 | a724eaa5c6cb3a0d118a5a5a14ab8b96 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
void solve (){
int n, l, r, k;
cin >> n >> l >> r >> k;
std::vector<int> v(n);
int count = 0;
for (int i = 0; i < n; ++i)
cin >> v[i];
for (int i = 0; i < n * 2; ++i) {
for (int i = 0; i < n; ++i) {
for (int i = 0; i < n; ++i) ... | C++ | f577695d39a11e8507681f307677c883 | 04a4236d91d28713dcdf470302e919f1 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
void solve (){
int n, l, r, k;
cin >> n >> l >> r >> k;
std::vector<int> v(n);
int count = 0;
for (int i = 0; i < n; ++i)
cin >> v[i];
for (int i = 0; i < n; ++i) {
for (int i = 0; i < n; ++i) {
for (int i = 0; i < n; ++i) {
... | C++ | f577695d39a11e8507681f307677c883 | 648d6f105c7ec2d5d903eaeb906480df | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
void solve (){
int n, l, r, k;
cin >> n >> l >> r >> k;
std::vector<int> v(n);
int count = 0;
for (int i = 0; i < n; ++i)
cin >> v[i];
for (int i = 0; i < n; ++i) {
for (int i = 0; i < n; ++i) {
for (int i = 0; i < n; ++i)
... | C++ | f577695d39a11e8507681f307677c883 | 9a6089c50e6b7a874d09135b7e71f9d5 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
void solve (){
int n, l, r, k;
cin >> n >> l >> r >> k;
std::vector<int> v(n);
int count = 0;
for (int i = 0; i < n; ++i)
cin >> v[i];
for (int i = 0; i < n; ++i) {
for (int i = 0; i < n; ++i) {
for (int i = 0; i < n; ++i)
... | C++ | f577695d39a11e8507681f307677c883 | 0fd75145296e4aaf9dbc6d072e17de0a | 800 | PASSED |
#include<bits/stdc++.h>
#define ll long long
#define PI pair<int,int>
#define fi first
#define se second
#define mp make_pair
#define ui unsigned int
using namespace std;
const int N=200010,M=21000010;
int T,n,a[N];
struct d{
int l,r,val,val2,tag;
}qwq[M];
int tot;
int newnode(int l,int r){
++tot;
qw... | C++ | 401e470b6499d807ecba40cdd708ede0 | 64eb1f4f71bc6369f5773bf3274d709b | 2,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
constexpr int mod=1e9+1;
int n,tot;
struct SegmentTree
{
int ls,rs,mx,mn,laz;
#define ls(i) tree[i].ls
#define rs(i) tree[i].rs
#define mx(i) tree[i].mx
#define mn(i) tree[i].mn
#define laz(i) tree[i].laz
}tree[30000010];
inline int New(int mn,int mx){tre... | C++ | 401e470b6499d807ecba40cdd708ede0 | 7cc30162d6f4d906dd95f296806825de | 2,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
constexpr int mod=1e9+1;
int n,tot;
struct SegmentTree
{
int ls,rs,mx,mn,laz;
#define ls(i) tree[i].ls
#define rs(i) tree[i].rs
#define mx(i) tree[i].mx
#define mn(i) tree[i].mn
#define laz(i) tree[i].laz
}tree[30000010];
inline int New(int mn,int mx){tre... | C++ | 401e470b6499d807ecba40cdd708ede0 | 5471482663724630aba1ca8bcf2e02d6 | 2,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int mod=1e9+1;
int n,tot;
struct SegmentTree
{
int ls,rs,mx,mn,laz;
#define ls(i) tree[i].ls
#define rs(i) tree[i].rs
#define mx(i) tree[i].mx
#define mn(i) tree[i].mn
#define laz(i) tree[i].laz
}tree[50000010];
inline int New(int mn,int mx){tree[++... | C++ | 401e470b6499d807ecba40cdd708ede0 | 38c36b91851ff0e80f867b9f165e5754 | 2,600 | PASSED |
#include<cstdio>
#include<cstring>
#define N 210000
#define NN 410000
#define NNN 25000000
using namespace std;
const int mod=1e9+1;
inline int mymin(int x,int y){return x<y?x:y;}
inline int mymax(int x,int y){return x>y?x:y;}
struct node{
int l,r,lazy;
int mi,mn;
}tr[NNN];int len=1,rt=1;
int now=0;
inl... | C++ | 401e470b6499d807ecba40cdd708ede0 | f93ba86dcade1b9c10a9e12d714353ea | 2,600 | PASSED |
#include<cstdio>
#include<algorithm>
#include<vector>
using namespace std;
const int N=200100;
int n,tot;
struct tree{
int mx,mn,l,r,add;
}t[N*25];
int New(int l,int r){
t[++tot].mx=r,t[tot].mn=l;
t[tot].add=0;
return tot;
}
void pushdown(int x){
t[t[x].l].mn+=t[x].add;
t[t[x].r].mx+=t[x].add;
t... | C++ | 401e470b6499d807ecba40cdd708ede0 | e832556af4bf9540910fcecb9bcfa998 | 2,600 | PASSED |
#include<cstdio>
#include<algorithm>
#include<vector>
using namespace std;
const int N=200100;
int n,tot;
struct tree{
int mx,mn,l,r,add;
}t[N*30];
int New(int l,int r){
t[++tot].mx=r,t[tot].mn=l;
t[tot].add=0;
return tot;
}
void pushdown(int x){
t[t[x].l].mn+=t[x].add;
t[t[x].r].mx+=t[x].add;
t... | C++ | 401e470b6499d807ecba40cdd708ede0 | 4ff6397dfa73fa8393a07f8fa5be3841 | 2,600 | PASSED |
#include<cstdio>
#include<algorithm>
#include<vector>
using namespace std;
const int N=200100;
int n,tot;
struct tree{
int mx,mn,l,r,add;
}t[N*60];
int New(int l,int r){
t[++tot].mx=r,t[tot].mn=l;
t[tot].add=0;
return tot;
}
void pushdown(int x){
t[t[x].l].mn+=t[x].add;
t[t[x].r].mx+=t[x].add;
t... | C++ | 401e470b6499d807ecba40cdd708ede0 | 8fcefb6e5702fc0d2d9d8ac2e5878ba0 | 2,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int N,Tag[60000005],Tree[60000005],lasans,cnt,ls[60000005],rs[60000005];
const int mx=1e9;
const int MOD=1e9+1;
int rt=0;
void Insert(int &Now,int l,int r,int L,int R,int ned){
if (!Now) Now=++cnt;
if (L<=l&&r<=R){
Tag[Now]+=ned;
return;
}
int mid=(l+r)>... | C++ | 401e470b6499d807ecba40cdd708ede0 | e11de849625e50657bd14202337f7a6a | 2,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int N,Tag[60000005],lasans,cnt,ls[60000005],rs[60000005];
const int mx=1e9;
const int MOD=1e9+1;
int rt=0;
void Insert(int &Now,int l,int r,int L,int R,int ned){
if (!Now) Now=++cnt;
if (L<=l&&r<=R){
Tag[Now]+=ned;
return;
}
int mid=(l+r)>>1;
if (L<=mi... | C++ | 401e470b6499d807ecba40cdd708ede0 | 28f163c0c0d4fb7e8e60290117f05e45 | 2,600 | PASSED |
#include<iostream>
#include<string>
using namespace std;
int main(){
int t;
cin>>t;
while(t--){
int n;
cin>>n;
string se;
cin>>se;
int a=-1,b=-1;
for(int i=0;i<n-1;i++){
if(int(se[i])==int(se[i+1])){
}
else{
... | C++ | 127d7f23a0ac8fcecccd687565d6f35a | fe8aca8e621014f1fc4aeaed2d116436 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define FOR(i,x,n) for(int i = x; i<=n; i++)
#define FORO(i,n) for(int i = 0; i<n; i++)
#define ROF(i,x,n) for(int i = x; i>=n; i--)
#define nl "\n"
#define sp " "
#define INF 1000000000000000000
#define pb push_back
#defi... | C++ | 127d7f23a0ac8fcecccd687565d6f35a | 8e98540e55884e5d5f0f0fe7e44de990 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t,n;
cin>>t;
string s;
while(t--){
cin>>n;
cin>>s;
if(n==1){
cout<<-1<<" "<<-1<<endl;
}else{
int count=0;
for(int i=0;i<s.length()-1;i++){
if(s[i]==s[i+1]){
... | C++ | 127d7f23a0ac8fcecccd687565d6f35a | 9cde399f5c4e82fcf3e0ba6e5b598872 | 800 | PASSED |
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
int n, flag=0;
scanf("%d",&n);
char s[100];
scanf("%s",s);
for(int i=0;i<n;i++)
{
if((s[i]=='a'&&s[i+1]=='b')||(s[i]=='b'&&s[i+1]=='a'))
{
printf("%d %d\n",i+1,i+2);
flag=1;
brea... | C++ | 127d7f23a0ac8fcecccd687565d6f35a | 682046a3876b3ecdf44e7222052d182b | 800 | PASSED |
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
int main()
{
int t;
scanf("%d", &t);
while (t--)
{
int n, pin = 0;
scanf("%d", &n);
char s[100];
scanf("%s", s);
for (int i = 0; i<n; i++)
{
if ((s[i] == 'a'&&s[i + 1] == 'b') || (s[i] == 'b'&&s[i + 1] == 'a'))
{
printf("%d %d\n", i ... | C++ | 127d7f23a0ac8fcecccd687565d6f35a | 585eeae3def17709adfdb88ea539be95 | 800 | PASSED |
// 赤コーダーになりたい
// お願い いいですか？
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
// Pragmas
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// Namespaces
using n... | C++ | 127d7f23a0ac8fcecccd687565d6f35a | 9148b820b5ab75e9ded8ee50f84660ff | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t,n;
cin>>t;
string s;
while(t--){
cin>>n;
cin>>s;
if(n==1){
cout<<-1<<" "<<-1<<endl;
}else{
int count=0;
for(int i=0;i<s.length()-1;i++){
if(s[i]==s[i+1]){
... | C++ | 127d7f23a0ac8fcecccd687565d6f35a | 9c0a4004dcfd8fe05b0a36ab3638a9ce | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a=0,b=0,d=0;
cin >> a;
for(int i=0;i<a;i++){
d=0;
cin >> b;
string c;
cin >> c;
for(int j=1;j<b;j++){
if(b!=1){
if(j>=1){
if(c[j]!=c[j-1]){
... | C++ | 127d7f23a0ac8fcecccd687565d6f35a | d778c873f65e41ceb294cef9fba68dbe | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
map<char,int>ti;
int main(){
int t;
cin>>t;
while(t--){
int n;
cin>>n;
string a;
cin>>a;
ti.clear();
for(int i=0;i<n;i++)ti[a[i]]++;
if(ti['a']==0||ti['b']==0){
cout<<"-1 -1"<<endl;
}else {
for(int i=0;i<n;i++){
if( i>0 && a[i]=='b' && a[i-1]=='a... | C++ | 127d7f23a0ac8fcecccd687565d6f35a | 0bcc5f0d06d3880e2f86a50796198084 | 800 | PASSED |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int t,n;
string s;
int main()
{
cin>>t;
while(t--)
{
cin>>n;
cin>>s;
bool w=0;
for(int i=0;i<n-1;i++)
{
if(s[i]!=s[i+1])
{
cout<<i+1<... | C++ | 127d7f23a0ac8fcecccd687565d6f35a | 7bc90526cd7745483bbd6d442426f994 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long
int main(){
ios::sync_with_stdio(0); cin.tie(0);
int t;
cin>>t;
while(t--){
int n;
string a;
cin>>n>>a;
int one = 0;
int two = 0;
for(int i=0; i<n; i++){
if(a[i] == '1') one++;
else two++;
}
if(two > 0 && two <... | C++ | 7e15bb1d6040d786983865143d1799cd | b45560291f9899a14e1c811efa8546d1 | 1,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int mod=1e9+7;
char mat[55][55];
void solve(){
int n;
cin>>n;
string s;
cin>>s;
vector<int>two;
for(int i=0;i<s.size();i++)
if(s[i]=='2') two.push_back(i);
if(two.size()==1||two.size()==2){
cout<<"NO\n";
ret... | C++ | 7e15bb1d6040d786983865143d1799cd | 7491fa789c4e2acd05accbfb323eb6af | 1,000 | PASSED |
#include<iostream>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
int t;
cin>>t;
while(t--)
{
char zu[51][51];
char zuzu[51];
int n;
cin>>n;
cin>>zuzu;
int a1=0,a2=0;
for(int i=0;i<n;i++)
{
if(zuzu[i]=='1')a1++;
else a2++;
}
if(a2>0&&a2<3)cout<<"NO\n";
else
{
for(i... | C++ | 7e15bb1d6040d786983865143d1799cd | 97bc854f8bc72d3bf690004f2f994ed3 | 1,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
char g[55][55];
int st[55];
int main()
{
int t;
cin >> t;
while (t--)
{
memset(st, 0, sizeof st);
int n;
cin >> n;
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
... | C++ | 7e15bb1d6040d786983865143d1799cd | 740b55eae1edf1e5a0490f787a25ba7c | 1,000 | PASSED |
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<=b;++i)
#define reps(i,a,b) for(int i=a;i<b;++i)
#define inf 0x3f3f3f3f
#define ull unsigned long long
#define sz(a) (int)a.size()
#define buff ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define rush() int T;cin>>T;while(T--)
typedef long long ll;
using ... | C++ | 7e15bb1d6040d786983865143d1799cd | bc3d4fc6c97b53339ce0197b31a81122 | 1,000 | PASSED |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int t, n;
string s;
string ans[50];
int main() {
cin >> t;
while (t--) {
cin >> n >> s;
vector<int> id;
for (int i = 0; i < n; ++i) {
ans[i] = string(n, '=');
ans[i][i] = 'X';
... | C++ | 7e15bb1d6040d786983865143d1799cd | abf9cdf20952a5060aa00b4e680a202d | 1,000 | PASSED |
#include<stdio.h>
#include<bits/stdc++.h>
using namespace std;
#define H 500005
#define LL long long
int T,N;
int Ans[55][55],M[55];
int main(){
scanf("%d",&T);
while(T--){
bool flag=1;
scanf("%d",&N);
for(int i=1;i<=N;i++){
for(int j=1;j<=N;j++)Ans[i][j]=4;;
}
getchar();
for(int i=1;i<=N;i++){
cha... | C++ | 7e15bb1d6040d786983865143d1799cd | eb5b5f25478d45205d194f445be86112 | 1,000 | PASSED |
#include<iostream>
#include<math.h>
#include<vector>
#include<algorithm>
using namespace std;
bool f=false;
void dfs(string& s,vector<vector<char>>& vec,int now){
if(f) return;
if(now==s.size()){
printf("YES\n");
f=true;
for(int i=0;i<s.size();i++){
for(int j=0;j<s.size();j++... | C++ | 7e15bb1d6040d786983865143d1799cd | 9c1889e76a83c8e2cabf2183462f86d1 | 1,000 | PASSED |
#include<iostream>
#include<algorithm>
#include<string.h>
#include<string>
#include<map>
using namespace std;
const int INF=0x3f3f3f3f;
const int N=1e5+10;
int dir[8][2]= {0,1,1,1,1,0,1,-1,0,-1,-1,-1,-1,0,-1,1};
string s;
char mp[55][55];
int vis[55][55],p;
int main()
{
std::ios::sync_with_stdio(false);
cin.tie... | C++ | 7e15bb1d6040d786983865143d1799cd | b5f60f083f39628c9ce1842ed8f29409 | 1,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x;
cin >> x;
for(int i = 0; i < x; i++) {
int y;
string s;
cin >> y;
cin >> s;
char arr[y];
char arr2[y][y];
vector <int> v;
int wins[y]{};
for(int j = 0; j < y; j++) {
char yy = s[j];
if(yy == '2') {
v.push_back(j);
}
... | C++ | 7e15bb1d6040d786983865143d1799cd | e9bc585b8fdda92df56f137cd2736da6 | 1,000 | PASSED |
// Jury Meeting (https://codeforces.com/contest/1569/problem/C)
#pragma GCC optimize("fast-math")
// begin "cp-lib/prelude.hpp"
#include <bits/stdc++.h>
#ifdef LOCAL
# include <dbg.h>
#else
# define dbg(...) do {} while (0)
#endif
#define cp_lib_4th(_1, _2, _3, x, ...) x
#define cp_lib_rep(i, l, r) for ... | C++ | 81d4867a7e5128baf316193e9cc3dfce | 6ef318b7e107bbab20af066257c884e4 | 1,500 | PASSED |
// Jury Meeting (https://codeforces.com/contest/1569/problem/C)
#pragma GCC optimize("fast-math")
// begin "cp-lib/prelude.hpp"
#include <bits/stdc++.h>
#ifdef LOCAL
# include <dbg.h>
#else
# define dbg(...) do {} while (0)
#endif
#define cp_lib_4th(_1, _2, _3, x, ...) x
#define cp_lib_rep(i, l, r) for ... | C++ | 81d4867a7e5128baf316193e9cc3dfce | d5640318bd197296fd8e7b7274689cb2 | 1,500 | PASSED |
// Jury Meeting (https://codeforces.com/contest/1569/problem/C)
#pragma GCC optimize("fast-math")
// begin "cp-lib/prelude.hpp"
#include <bits/stdc++.h>
#ifdef LOCAL
# include <dbg.h>
#else
# define dbg(...) do {} while (0)
#endif
#define cp_lib_4th(_1, _2, _3, x, ...) x
#define cp_lib_rep(i, l, r) for ... | C++ | 81d4867a7e5128baf316193e9cc3dfce | 7ce5675483d03c9e8426f93a189d927c | 1,500 | PASSED |
// Jury Meeting (https://codeforces.com/contest/1569/problem/C)
#pragma GCC optimize("fast-math")
// begin "cp-lib/prelude.hpp"
#include <bits/stdc++.h>
#ifdef LOCAL
# include <dbg.h>
#else
# define dbg(...) do {} while (0)
#endif
#define cp_lib_4th(_1, _2, _3, x, ...) x
#define cp_lib_rep(i, l, r) for ... | C++ | 81d4867a7e5128baf316193e9cc3dfce | 7ca14f13e474a6577d01df5e387e84d3 | 1,500 | PASSED |
// Jury Meeting (https://codeforces.com/contest/1569/problem/C)
#pragma GCC optimize("fast-math")
// begin "cp-lib/prelude.hpp"
#include <bits/stdc++.h>
#ifdef LOCAL
# include <dbg.h>
#else
# define dbg(...) do {} while (0)
#endif
#define cp_lib_4th(_1, _2, _3, x, ...) x
#define cp_lib_rep(i, l, r) for ... | C++ | 81d4867a7e5128baf316193e9cc3dfce | e8fabeca1e32504b751562dd025b64d9 | 1,500 | PASSED |
// Jury Meeting (https://codeforces.com/contest/1569/problem/C)
#pragma GCC optimize("fast-math")
// begin "cp-lib/prelude.hpp"
#include <bits/stdc++.h>
#ifdef LOCAL
# include <dbg.h>
#else
# define dbg(...) do {} while (0)
#endif
#define cp_lib_4th(_1, _2, _3, x, ...) x
#define cp_lib_rep(i, l, r) for ... | C++ | 81d4867a7e5128baf316193e9cc3dfce | d59a4075def58b9e8f7716c698abc6d6 | 1,500 | PASSED |
// Jury Meeting (https://codeforces.com/contest/1569/problem/C)
#pragma GCC optimize("fast-math")
// begin "cp-lib/prelude.hpp"
#include <bits/stdc++.h>
#ifdef LOCAL
# include <dbg.h>
#else
# define dbg(...) do {} while (0)
#endif
#define cp_lib_4th(_1, _2, _3, x, ...) x
#define cp_lib_rep(i, l, r) for ... | C++ | 81d4867a7e5128baf316193e9cc3dfce | 304b7d4b2e52651b2a870c195252ccea | 1,500 | PASSED |
// Jury Meeting (https://codeforces.com/contest/1569/problem/C)
#pragma GCC optimize("fast-math")
// begin "cp-lib/prelude.hpp"
#include <bits/stdc++.h>
#ifdef LOCAL
# include <dbg.h>
#else
# define dbg(...) do {} while (0)
#endif
#define cp_lib_4th(_1, _2, _3, x, ...) x
#define cp_lib_rep(i, l, r) for ... | C++ | 81d4867a7e5128baf316193e9cc3dfce | 00fef83af680ed81350fd32909042476 | 1,500 | PASSED |
// Jury Meeting (https://codeforces.com/contest/1569/problem/C)
#pragma GCC optimize("fast-math")
// begin "cp-lib/prelude.hpp"
#include <bits/stdc++.h>
#ifdef LOCAL
# include <dbg.h>
#else
# define dbg(...) do {} while (0)
#endif
#define cp_lib_4th(_1, _2, _3, x, ...) x
#define cp_lib_rep(i, l, r) for ... | C++ | 81d4867a7e5128baf316193e9cc3dfce | 7470edfa50584ed6c051e83ccb8afe64 | 1,500 | PASSED |
// Jury Meeting (https://codeforces.com/contest/1569/problem/C)
#pragma GCC optimize("fast-math")
// begin "cp-lib/prelude.hpp"
#include <bits/stdc++.h>
#ifdef LOCAL
# include <dbg.h>
#else
# define dbg(...) do {} while (0)
#endif
#define cp_lib_4th(_1, _2, _3, x, ...) x
#define cp_lib_rep(i, l, r) for ... | C++ | 81d4867a7e5128baf316193e9cc3dfce | 64367c96bdb3ab4db04fab135ee913ca | 1,500 | PASSED |
#include <bits/stdc++.h>
#define ft first
#define sd second
#define IOS ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define seteps(N) fixed << setprecision(N)
#define endl "\n"
const int maxn = 1e6 + 10;
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<int, int> pii;
const ... | C++ | e69c0010e093792011a0c7b846a9bc42 | 0303e949e10f88e8a772715f1ac097a9 | 1,900 | PASSED |
#include <bits/stdc++.h>
#define ft first
#define sd second
#define IOS ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define seteps(N) fixed << setprecision(N)
#define endl "\n"
const int maxn = 1e6 + 10;
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<int, int> pii;
const ... | C++ | e69c0010e093792011a0c7b846a9bc42 | 2192ed0cab88a07851138af02edb2af8 | 1,900 | PASSED |
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define all(A) A.begin(), A.end()
#define pb push_back
#define fri(start , end , step) for(int i = start; i < end ; i = i + step)
#define frj(start , end , step) for(int j = start; j < end ; j = j + step)
#define fast ios_base::sync_... | C++ | e69c0010e093792011a0c7b846a9bc42 | 613c431419d6bd454b8126d489c5634c | 1,900 | PASSED |
#include<bits/stdc++.h>
using namespace std;
map<int,int> mpx,mpy;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
cin>>t;
while(t--)
{
int n,m,k,z1,z2,fx,fy;
long long int res=0,sub=0;
cin>>n>>m>>k;
vector<int> xv,yv;
... | C++ | e69c0010e093792011a0c7b846a9bc42 | 4b5cc92d6797b61e051d1a56fe2c3d34 | 1,900 | PASSED |
#include<bits/stdc++.h>
using namespace std;
map<int,int> mpx,mpy;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
cin>>t;
while(t--)
{
int n,m,k,z1,z2,fx,fy;
long long int res=0,sub=0;
cin>>n>>m>>k;
vector<int> xv,yv;
... | C++ | e69c0010e093792011a0c7b846a9bc42 | 8a3d029ca53c69a8bb7aca79b4bd80fb | 1,900 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define fore(i, l, r) for(int i = int(l); i < int(r); i++)
#define sz(a) int((a).size())
#define all(a) (a).begin(), (a).end()
#define x first
#define y second
typedef long long li;
typedef pair<int, int> pt;
template<class A, class B> ostream& operator <<... | C++ | e69c0010e093792011a0c7b846a9bc42 | 2a7bab27c22bc7cc27526df91e487799 | 1,900 | 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 pb push_back
# define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
typedef unsigned long long int ull;
typedef long long ll;
typ... | C++ | e69c0010e093792011a0c7b846a9bc42 | 606f6234578e87572b17bc7f00a878d2 | 1,900 | 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 pb push_back
# define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
typedef unsigned long long int ull;
typedef long long ll;
typ... | C++ | e69c0010e093792011a0c7b846a9bc42 | a489af439c6d185448c92d346554e993 | 1,900 | PASSED |
// Priyansh Agarwal
// Check out my Youtube Channel: https://www.youtube.com/c/PriyanshAgarwal
#include<bits/stdc++.h>
// #include<ext/pb_ds/assoc_container.hpp>
// #include<ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace chrono;
// using namespace __gnu_pbds;
#define fastio() ios_base::sy... | C++ | e69c0010e093792011a0c7b846a9bc42 | 5ee33a1faf0f5349a331b83ec636f360 | 1,900 | 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 pb push_back
# define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
typedef unsigned long long int ull;
typedef long long ll;
typ... | C++ | e69c0010e093792011a0c7b846a9bc42 | 8e550a838ee12039dbe58d9d47dea5aa | 1,900 | PASSED |
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <array>
#include <unordered_map>
#include <unordered_set>
#include <map>
#include <set>
#include <chrono>
#include <string>
#include <functional>
#include <bitset>
#include <numeric>
using ll = long long;
struct custom... | C++ | f3d9afa76d0309e9688784c5de238cfe | 26183b5e29fd13918d1da5169c6c8a0b | 2,600 | PASSED |
// Lynkcat.
// Problem: E. Playoff Restoration
// URL: https://codeforces.com/contest/1569/problem/E
// Memory Limit: 512 MB
// Time Limit: 4000 ms
// -----------------------------------------------
#include<bits/stdc++.h>
#define poly vector<int>
#define IOS ios::sync_with_stdio(false)
#define ll long long
... | C++ | f3d9afa76d0309e9688784c5de238cfe | 31b5e4a1d0f118b44e485f80ea2953d8 | 2,600 | PASSED |
// LUOGU_RID: 92564851
#include<bits/stdc++.h>
#define N 40
#define ll long long
#define pb push_back
using namespace std;
int k,n,g[12],m,fl,ans[40],olg;
ll h,a,mi[N],mod=998244353,fin;
void qd(int x){
if(x>m){
ll sum=0;
for(int i=1;i<=n;i++){
sum+=i*mi[ans[i]];
sum%=mod;
}
if(sum==h){
... | C++ | f3d9afa76d0309e9688784c5de238cfe | 0a1528bb296ed08a892f56fc9da21691 | 2,600 | PASSED |
#include<bits/stdc++.h>
#define N 40
#define ll long long
#define pb push_back
using namespace std;
int k,n,g[12],m,fl,ans[40],olg;
ll h,a,mi[N],mod=998244353,fin;
void qd(int x){
if(x>m){
ll sum=0;
for(int i=1;i<=n;i++){
sum+=i*mi[ans[i]];
sum%=mod;
}
if(sum==h){
olg=1;
for(int i... | C++ | f3d9afa76d0309e9688784c5de238cfe | d7ff53dd28d8810c7416d2727ee4a541 | 2,600 | PASSED |
#pragma GCC optimaze(3)
#pragma GCC optimaze(2)
#pragma GCC optimaze("Ofast")
#pragma GCC optimaze("inline")
#pragma GCC optimaze("unroll-loops")
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int md=998244353;
int k,A,h,w[40],a[40],b[40];
map <int,int> mp1,mp2;
bool flag=0;
int mi... | C++ | f3d9afa76d0309e9688784c5de238cfe | b2121d45f6ecb557e5747fc4012b7da6 | 2,600 | PASSED |
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int md=998244353;
int k,A,h,w[40],a[40],b[40];
map <int,int> mp1,mp2;
bool flag=0;
int mid;
inline int qsm(int a,int b)
{
int ret=1;
for (;b;b>>=1)
{
if (b&1) ret=ret*a%md;
a=a*a%md;
}
return ret;
}
void dfs(int t,in... | C++ | f3d9afa76d0309e9688784c5de238cfe | 33e171cbb01bd38ddabcdf0a81b26efb | 2,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int mod=998244353;
int ans[35],k,A,h,num,cmask,cnt=0;
bool check=false;
int power(int a,int n){
int res=1;
while(n){
if(n&1) res=(res*a)%mod;
a=(a*a)%mod;n>>=1;
}
return res;
}
vector<int> d;
bool iso... | C++ | f3d9afa76d0309e9688784c5de238cfe | b6bf1eca0d46501b6e67e129408d92a7 | 2,600 | PASSED |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define AquA cin.tie(0);ios_base::sync_with_stdio(0);
#define fs first
#define sc second
#define p_q priority_queue
using namespace std;
int main(){
AquA;
int k,a,h;
cin >> k >> a >> h;
vector<int> v((1<<k));
iota(v.begin(),v.end()... | C++ | f3d9afa76d0309e9688784c5de238cfe | 44e772abd22ba18179d78cc9a4487d67 | 2,600 | PASSED |
#include "bits/stdc++.h"
using namespace std;
#define all(x) begin(x),end(x)
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>... | C++ | f3d9afa76d0309e9688784c5de238cfe | 6d571064971777c95853f23a97ab37ef | 2,600 | PASSED |
#include <bits/stdc++.h>
#define st first
#define nd second
using lint = int64_t;
constexpr int mod = 998244353;
constexpr int inf = 0x3f3f3f3f;
constexpr int ninf = 0xcfcfcfcf;
constexpr lint linf = 0x3f3f3f3f3f3f3f3f;
const long double pi = acosl(-1.0);
// Returns -1 if a < b, 0 if a = b and 1 if a > b.
int... | C++ | f3d9afa76d0309e9688784c5de238cfe | 8ed6c6865c098190177936a18cff1c77 | 2,600 | PASSED |
// Lynkcat.
// Problem: F. Palindromic Hamiltonian Path
// URL: https://codeforces.com/problemset/problem/1569/F
// Memory Limit: 256 MB
// Time Limit: 5000 ms
// -----------------------------------------------
#include<bits/stdc++.h>
#define poly vector<int>
#define IOS ios::sync_with_stdio(false)
#define l... | C++ | 97f96e83c8e893d2a12dd5ca2b401323 | f026d246ff9d2d1052e82c2bf7c6be38 | 3,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int M=12;
#define int long long
int n,m,k,ans,g[M][M],a[M],p[M],fac[M];
map<int,bool>dp;
void init(int nc){
int x=n;
for(int i=0;i<n;i++)if(p[i]==-1){
x=i;
break;
}
if(x==n){
int f[1<<6][M]={},p1[M]={},p2[M]={};
for(int i=0;i<n;i++){
p2[p[... | C++ | 97f96e83c8e893d2a12dd5ca2b401323 | b60a7c6bbf8f99174455b3e18d5332d4 | 3,000 | PASSED |
#include <stdio.h>
#include <map>
using namespace std;
#define MS 10395
#define MD 150000
#define ll long long
int encode(int n,int pp[15])
{
int st[15],jg=0;bool bk[15]={0};
for(int i=n/2;i>=1;i--)
{
int w[15],s=0,o;
for(int x=0;x<n;x++)
if(!bk[x])
{
... | C++ | 97f96e83c8e893d2a12dd5ca2b401323 | 9adb3a940f6e1d949a486c6259c30c2f | 3,000 | PASSED |
// #pragma comment(linker, "/stack:200000000")
#include <bits/stdc++.h>
#include <limits>
#include <type_traits>
namespace suisen {
// ! utility
template <typename ...Types>
using constraints_t = std::enable_if_t<std::conjunction_v<Types...>, std::nullptr_t>;
template <bool cond_v, typename Then, typename OrElse>
co... | C++ | 97f96e83c8e893d2a12dd5ca2b401323 | 8cd4f6b1ac25de0b75bb187d10443da9 | 3,000 | PASSED |
// cv
// 你紫名觉得是我的锅，那就是我的锅，为什么你知道吗？因为紫名说的话，就像是一个癌症晚期患者说的话一样。
// 他都已经这样了，你为什么不顺从他呢?你总要给人最后一段时间一个好的回忆吧，最后的时光里。
// 因为紫名这个段位很尴尬，紫名橙名再往上一点，grandmaster，可能说，欸，有点实力，能操作一下。
// 紫名往下，绿名，蓝名，啊，人家是纯属玩游戏的，因为太垃圾了，自己也知道自己没什么实力。
// 但紫名，上不去下不来的这个段位，他觉得，蓝名的人不配跟他一起玩儿，对吧？蓝名是最垃圾的。
// 但是呢他想上去，他又上不去，所以这个分段是最尴尬的，没办法，卡在这里了。
// 想操作，又操作不... | C++ | 97f96e83c8e893d2a12dd5ca2b401323 | 6b4b8857c04e9ae37e535a7fd5c3ac6b | 3,000 | PASSED |
#include <stdio.h>
#include <map>
using namespace std;
#define MS 10395
#define MD 150000
#define ll long long
int encode(int n,int pp[15])
{
int st[15],jg=0;bool bk[15]={0};
for(int i=n/2;i>=1;i--)
{
int w[15],s=0,o;
for(int x=0;x<n;x++)
if(!bk[x])
{
... | C++ | 97f96e83c8e893d2a12dd5ca2b401323 | 446e9ac988a87cf52a320c4918274e67 | 3,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, m, k;
vector<vector<bool>> adj;
vector<unsigned int> pow6(12);
unordered_map<unsigned int, bool> validgroups;
vector<int> labelcounts(12);
ll ans = 0;
bool valid (vector<vector<int>>& groups) {
vector<vector<bool>> dp(1<<(n/2), vector<bool>(... | C++ | 97f96e83c8e893d2a12dd5ca2b401323 | d2b99d0e55ecb83e923af4e473e95b4a | 3,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define MP make_pair
#define fst first
#define snd second
const int maxn = 12;
const int maxm = 6;
int n, m, k;
int fac[maxn + 5];
int f[1 << maxm][maxm];
int used[maxn], vis[maxn];
int ed[maxn][maxn];
vector<vector<int> > part;
se... | C++ | 97f96e83c8e893d2a12dd5ca2b401323 | 061dc69c486856c07cac24031cf913bb | 3,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N=12;
int n,m,sk,e[N+9][N+9];
void into(){
scanf("%d%d%d",&n,&m,&sk);
for (int i=1;i<=m;++i){
int x,y;
scanf("%d%d",&x,&y);
--x;--y;
e[x][y]=e[y][x]=1;
}
}
LL bn[N+9][N+9];
void Get_bn(){
bn[... | C++ | 97f96e83c8e893d2a12dd5ca2b401323 | 75d8fb07661a594784221c4cf05d23f1 | 3,000 | PASSED |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <assert.h>
#include <stack>
#include <vector>
#include <cmath>
#include <queue>
#include <map>
#include <unordered_set>
#include <set>
#include <time.h>
#include <unordered_map>
using namespace std;
int rev[1<<20];... | C++ | 97f96e83c8e893d2a12dd5ca2b401323 | 3ce58015bd27f4b2e6a2e22848df2192 | 3,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main ()
{
int t; cin>>t;
while (t--)
{
int n,a; cin>>n; a=n%3; n=(n-a)/3; cout<<n+int(a==1)<<" "<<n+int(a==2)<<endl;
}
}
| C++ | 71335a9489f0985f4e16435b14d6a34a | 9124df1da82e446ab3a5b2040763cde6 | 800 | PASSED |
#include<iostream>
#include<cmath>
#include<iomanip>
#include <algorithm>
using namespace std;
int main()
{
int t;
cin >> t;
for(int i=0;i<t;i++)
{
double n;
cin >> n;
double c2=round(n/3);
int c1 = int(n - 2*c2);
cout << fixed<<setprecision(0);
cout << round(c1) <<" " << round(c2) << endl;
}
}
... | C++ | 71335a9489f0985f4e16435b14d6a34a | 867882e42dd13ad1cf81ebcf1f0c53bb | 800 | PASSED |
#include<iostream>
#include <cmath>
using namespace std;
void calc (int n){
double a = 0.5 * (n - (n/3.0));
int b;
int c = (int)a;
if (round(a) >= c)
b = round(a);
else
b = round(a) - 1;
int r = n - 2 * b;
cout << r << " " << b << endl;
}
int main() {
int t;
cin... | C++ | 71335a9489f0985f4e16435b14d6a34a | dfedca225b80b6865a94ec57cb0f32af | 800 | PASSED |
#include <iostream>
using namespace std;
int main(){
int t;
cin>>t;
long long n,x,a,b;
for(int i=0; i<t; i++){
cin>>n;
x=n/3;
if(n==1){
cout<<1<<" "<<0<<endl;
}
else if(n%3==0){
cout<<x<<" "<<x<<endl;
}
else if(x+((x+1)*2)=... | C++ | 71335a9489f0985f4e16435b14d6a34a | 2a37ee202dcd214148260785fb205be9 | 800 | PASSED |
#include<iostream>
using namespace std;
int main(){
int t;cin>>t;
while(t--){
int n;cin>>n;
int c=(n+1)/3;
cout<<n-2*c<<" "<<c<<endl;
}
}
| C++ | 71335a9489f0985f4e16435b14d6a34a | 5837b837425b225a565fbd74c8d1d764 | 800 | PASSED |
#include <bits/stdc++.h>
#define SUPERPOWER ios_base::sync_with_stdio(false); cout.tie(0);
#define ll long long
#define el '\n'
#define vl vector<ll>
#define v vector<int>
#define all(v) ((v).begin()), ((v).end())
/*
arr[v[c - 'a'][a - 1]] = true; // ?????? ????? ??? ????????
v[c - 'a'].erase(v[c - 'a'].begin() + a -... | C++ | 71335a9489f0985f4e16435b14d6a34a | 3695deba9e2300cf1a4cddf106bc1bac | 800 | PASSED |
#include <bits/stdc++.h>
#define endl "\n";
//#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
int main() {
//fast;
int t; cin>>t;
while(t--){
int n; cin>>n;
int x = n/3;
if(n%3 == 0){
cout<<x<<" "<<x<<endl;
}
else ... | C++ | 71335a9489f0985f4e16435b14d6a34a | 0a15d0da0f53301603d57f722e942d52 | 800 | PASSED |
#include <iostream>
#include <utility>
#include <vector>
typedef long long ll;//CLAWNS CAN NOT STOP SAYing كله عل البلبل
#define FAST ios::sync_with_stdio(0); cin.tie(NULL); cout.tie(0);
#define all(x) x.begin(),x.end()
using namespace std;
void clawn()
{
ll n;
cin>>n;
ll v=n%3;
ll x=n/3;... | C++ | 71335a9489f0985f4e16435b14d6a34a | d1f5eab583b9c94acef92e8d14848ef3 | 800 | PASSED |
#include<iostream>
using namespace std;
int main()
{
long long test;
cin >> test;
while (test--)
{
long long b;
cin >> b;
if (b == 1)
cout << 1 << " " << 0 << endl;
else if (b % 3 == 1)
{
cout << (b / 3) + 1 << " " << (b / 3) << endl;
}
else if (b % 3 == 0)
cout << b / 3 << " " << b / 3 << en... | C++ | 71335a9489f0985f4e16435b14d6a34a | 21f3b0909cb64b50250ad10a60d6822f | 800 | PASSED |
#include <bits/stdc++.h>
#define pcchamps ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define ll long long
using namespace std;
ll ans=0;
bool comp(const pair<char,int>& i,const pair<char,int>& j) {
return i.first < j.first;
}
pair<int,int>pa... | C++ | 71335a9489f0985f4e16435b14d6a34a | 9801938566fa96bb7f1f9863ce3be82d | 800 | PASSED |
//
// Created by changhyeonnam on 2021/08/03.
//
#include <iostream>
#include <cstring>
#include <string>
#include <algorithm>
#include <vector>
#include<queue>
#define endl '\n'
#define INF 1e9
#define LINF 2e15
using namespace std;
typedef long long ll;
typedef pair<int,int> pi;
typedef pair<int,pa... | C++ | 18ac51a009c907fe8e4cd2bb8612da20 | feda6194349b6f6b5814c8d77cc74670 | 1,500 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.