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<set>
#include<map>
#include<cmath>
#include<stack>
#include<array>
#include<queue>
#include<bitset>
#include<vector>
#include<string>
#include<iomanip>
#include<cstring>
#include<iostream>
#include<algorithm>
#define rep(i,x,y) for(int i=x;i<=y;i++)
#define per(i,x,y) for(int i=x;i>=y;i--)
usin... | C++ | 7fb8b73fa2948b360644d40b7035ce4a | 4dbb06e0c53fa406fb5828b9a830111c | 1,800 | PASSED |
/**โโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโ
โโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโ
โโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโ
โโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโ
โโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโ
โโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโ
โโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโ
โโ... | C++ | 7fb8b73fa2948b360644d40b7035ce4a | d1a1a73eb891ffb11064eaf7286c7749 | 1,800 | PASSED |
#define IO \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define debug(a) cout << #a << ':' << a << '\n'
#include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <cstring>
#include <fstream>
#include <iomanip>
#incl... | C++ | 7fb8b73fa2948b360644d40b7035ce4a | ed2a0a878714fff6ab34d79be1d4c283 | 1,800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
/* โค i love u Joan โค */
/* ๅฆๆ็ฐๅจๅคงไธ, ่ฟๆ่ฟไนๅคๅๅฃไธ่ฎญ็ปๅ๏ผ */
#define mybae Joanna
#define ll long long
#define rep(a, b, c) for (int a = b; a < c; ++a)
#define per(a, b, c) for (int a = c - 1; a >= b; --a)
#define IOS ios::sync_with_stdio(false); cin.tie(0)
#define pii pair<i... | C++ | 7fb8b73fa2948b360644d40b7035ce4a | 327d8a2e54b8f226c1d6a7800294915a | 1,800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
/* โค i love u Joan โค */
/* ๅฆๆ็ฐๅจๅคงไธ, ่ฟๆ่ฟไนๅคๅๅฃไธ่ฎญ็ปๅ๏ผ */
#define mybae Joanna
#define ll long long
#define rep(a, b, c) for (int a = b; a < c; ++a)
#define per(a, b, c) for (int a = c - 1; a >= b; --a)
#define IOS ios::sync_with_stdio(false); cin.tie(0)
#define pii pair<i... | C++ | 7fb8b73fa2948b360644d40b7035ce4a | c33aba959f598327091b9f613f9aa0e5 | 1,800 | PASSED |
#include <bits/stdc++.h>
#define pb push_back
#define F first
#define S second
#define ll long long
#define ull unsigned long long
#define ld long double
#define endl '\n'
#define TIME 1.0*clock()/CLOCKS_PER_SEC
#define pii pair < int , int >
#define sz size
#... | C++ | 7fb8b73fa2948b360644d40b7035ce4a | 2d414022f1bbb97e1796e45efbbde899 | 1,800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using vi = vector<int>;
using vll = vector<ll>;
using vld = vector<ld>;
using vvi = vector<vector<int>>;
string to_string(bool b) { return b ? "true" : "false"; }
string to_string(string s) { retu... | C++ | 7fb8b73fa2948b360644d40b7035ce4a | a4a510cb2ff263ee28231a3b2d8db4cd | 1,800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int ask(int a,int b,bool f){
cout<<(f?"and ":"or ")<<a<<" "<<b<<endl;
int p;cin>>p;
return p;
}
int main(){
ios::sync_with_stdio(0);cin.tie(0);
int x,k;cin>>x>>k;
int a[x+2];
for(int i=1;i<=x;i++)a[i]=0;
int z=ask(1,2,1),z2=ask(1,3,1),z3=ask(2,3,... | C++ | 7fb8b73fa2948b360644d40b7035ce4a | 7500454f49e33bb81d160731b11e90eb | 1,800 | PASSED |
/******************************************************************************
Welcome to GDB Online.
GDB online is an online compiler and debugger tool for C, C++, Python, Java, PHP, Ruby, Perl,
C#, OCaml, VB, Swift, Pascal, Fortran, Haskell, Objective-C, Assembly, HTML, CSS, JS, SQLite, Prolog.
Code, Compile, ... | C++ | 7fb8b73fa2948b360644d40b7035ce4a | 3b5a5e815a219acecb0c377fa772b088 | 1,800 | PASSED |
/*
1ntroduction
Author: hotboy2703
Problem: 1556E
*/
#include<bits/stdc++.h>
using namespace std;
const long long INF = 1e18;
const int maxn = 1e5;
const int maxk = 17;
int n,q;
int a[maxn + 100];
int b[maxn + 100];
int c[maxn + 100];
long long sp_max[maxk][maxn + 100];
long long sp_min[maxk][maxn + 100]... | C++ | 5f3022de0429cca31bab24501347eb69 | 2ef4c5b346ea50bbe4c765b02d1058d0 | 2,200 | PASSED |
/*
1ntroduction
Author: hotboy2703
Problem: 1556E
*/
#include<bits/stdc++.h>
using namespace std;
const long long INF = 1e18;
const int maxn = 1e5;
const int maxk = 18;
int n,q;
int a[maxn + 100];
int b[maxn + 100];
int c[maxn + 100];
long long sp_max[maxk][maxn + 100];
long long sp_min[maxk][maxn + 100]... | C++ | 5f3022de0429cca31bab24501347eb69 | fa285fa3f82692d8acd13110d7bf9e41 | 2,200 | PASSED |
/*
1ntroduction
Author: hotboy2703
Problem: 1556E
*/
#include<bits/stdc++.h>
using namespace std;
const long long INF = 1e18;
const int maxn = 1e5;
const int maxk = 17;
int n,q;
int a[maxn + 100];
int b[maxn + 100];
int c[maxn + 100];
long long sp_max[maxk][maxn + 100];
long long sp_min[maxk][maxn + 100]... | C++ | 5f3022de0429cca31bab24501347eb69 | 74dc3e4f32dd2478effa131705106521 | 2,200 | PASSED |
/*
1ntroduction
Author: hotboy2703
Problem: 1556E
*/
#include<bits/stdc++.h>
using namespace std;
const long long INF = 1e18;
const int maxn = 1e5;
const int maxk = 18;
int n,q;
int a[maxn + 100];
int b[maxn + 100];
int c[maxn + 100];
long long sp_max[maxk][maxn + 100];
long long sp_min[maxk][maxn + 100]... | C++ | 5f3022de0429cca31bab24501347eb69 | edc726a1ed91e329fd08a125181cf3e2 | 2,200 | PASSED |
/*
1ntroduction
Author: hotboy2703
Problem: 1556E
*/
#include<bits/stdc++.h>
using namespace std;
const long long INF = 1e18;
const long long maxn = 1e5;
const long long maxk = 18;
long long n,q;
long long a[maxn + 100];
long long b[maxn + 100];
long long c[maxn + 100];
long long sp_max[maxk][maxn + 100];... | C++ | 5f3022de0429cca31bab24501347eb69 | c51e6867924eaecb41485d6446a1ec77 | 2,200 | PASSED |
#pragma GCC optimize("-funsafe-loop-optimizations")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-fwhole-program")
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-falign-functions")
#pragma GCC optimize("-falign-jumps")
#pragma GCC op... | C++ | 5f3022de0429cca31bab24501347eb69 | ed2be1d2b9bfd3cbb05b1bf3e7879e82 | 2,200 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
const int MOD = 998244353;
struct segTree {
int size;
vector<ll> mx;
vector<ll> mn;
void init(int n){
size = 1;
while (size < n) size *= 2;
mx.assign(2 * size, -1e18);
... | C++ | 5f3022de0429cca31bab24501347eb69 | 523034f64b22990cdabf6ff415c0aff5 | 2,200 | PASSED |
#include <bits/stdc++.h>
#pragma GCC target ("avx2")
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#define pb push_back
#define is insert
#define reset(a, n) memset(a, 0, (n + 1) * sizeof(int))
#define endl "\n"
#define file(name) if (fopen (name".inp", "r")) { freopen (name".inp", "r", s... | C++ | 5f3022de0429cca31bab24501347eb69 | e68db1ba231637733e0e373efd08655c | 2,200 | PASSED |
#define TLE ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#include<bits/stdc++.h>
using namespace std;
using ll =long long ;
#define int ll
const int N=2e6+500;
const int mod=998244353;
int n,q;
int a[N],b[N],c[N],tr1[N],tr2[N];
void build(int l,int r,int rt){
if(l==r) return tr1[rt]=tr2[rt]=c[l],void()... | C++ | 5f3022de0429cca31bab24501347eb69 | c09e87a601c5715767bc1f6e16df1dae | 2,200 | PASSED |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef long double db;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<db,db> pdb... | C++ | 5f3022de0429cca31bab24501347eb69 | a873619bb08f8c3d5c2737a857c9b1a6 | 2,200 | PASSED |
#include <bits/stdc++.h>
#define besmellah ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll INF = 1e9 + 7;
const ll MOD = 1e9 + 7;
#define M_PI 3.14159265358979323846
#define endl '\n'
int main() {
besmellah
#ifndef... | C++ | be51a3e4038bd9a3f6d4993b75a20d1c | 9187d3a6b95209c7cfabaaa9d3ea8fd0 | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int tt;
cin>>tt;
while(tt--){
int n;
cin>>n;
vector<int> pos[2];
for (int i = 0; i < n; ++i)
{
in... | C++ | be51a3e4038bd9a3f6d4993b75a20d1c | 6031cdca939eda72a55ef7827cb799e0 | 1,300 | PASSED |
// B. Take Your Places! - Mathe.cpp : This file contains the 'main' function. Program execution begins and ends there.
//
#include <bits/stdc++.h>
using namespace std;
int standbegin(int n) {
int ans = 0;
for (int i = 0; i < n; i += 2) ans += i;
return ans;
}
int main()
{
int t;
cin >>... | C++ | be51a3e4038bd9a3f6d4993b75a20d1c | 49157c66e8c44f18b086de19e066ef7b | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector <int>;
using vvi = vector <vi>;
using vpii = vector <pair<int,int>>;
using vc = vector <char>;
using vvc = vector <vc>;
#define fr first
#define sc second
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), r... | C++ | be51a3e4038bd9a3f6d4993b75a20d1c | 3cdd30aee44091a01e415a56497d6084 | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std ;
#define fo(i, n) for (int i = 0; i < n; i++)
#define fo1(i, n) for (int i = 1; i < n; i++)
#define ll long long
#define ull unsigned ll
#define deb(x) cout << #x << = << x << endl
#define all(x) x.begin(), x.end()
#define tr(it, a) for (auto it = a.begin(); it !=... | C++ | be51a3e4038bd9a3f6d4993b75a20d1c | 44503427fc99c0ca89e49c821e18c6f7 | 1,300 | PASSED |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define loop(i,start,n,it) (int i = start;i<n;i = i+it)
#define all(x) x.begin(), x.end()
#define fst first
#define snd second
#define printv(x) for loop(z,0,x.size(),1) cout << ( z != x.size()-1 ? to_string(x[z]) + " " :... | C++ | be51a3e4038bd9a3f6d4993b75a20d1c | b5831d983bad0feb485faf45396742bc | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int maxn=1e6+10;
int a[maxn];
int main()
{
int t;
cin >> t;
while(t--)
{
int n ;
cin >> n ;
int a1 = 0, b = 0 ;
for(int i = 0 ; i <n ; i++)
{
cin >> a[i] ;
if(a[i] %2 == 1)... | C++ | be51a3e4038bd9a3f6d4993b75a20d1c | 2ef082fcf4a1b6c2a074374becf29d4a | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int maxn=1e6+10;
int a[maxn];
int main()
{
int t;
cin >> t;
while(t--)
{
int n ;
cin >> n ;
int a1 = 0, b = 0 ;
for(int i = 0 ; i <n ; i++)
{
cin >> a[i] ;
if(a[i] %2 == 1)... | C++ | be51a3e4038bd9a3f6d4993b75a20d1c | 2747c94c8a2ab571a493a26fee10e76c | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define vb vector<bool>
#define pb push_back
#define mp make_pair
#define rs resize
#define um unordered_map<int,int>
#define f(i,j,k) for(int i=j;i<k;i++)
#define s(v) sort(v.begin(),v.end());
const int MAX=2... | C++ | be51a3e4038bd9a3f6d4993b75a20d1c | 84f35af9569e3c6e1693261b51dc824d | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define vb vector<bool>
#define pb push_back
#define mp make_pair
#define rs resize
#define um unordered_map<int,int>
#define f(i,j,k) for(int i=j;i<k;i++)
#define s(v) sort(v.begin(),v.end());
const int MAX=2... | C++ | be51a3e4038bd9a3f6d4993b75a20d1c | 741a857a93b88c05042730f28855d357 | 1,300 | PASSED |
#include<bits/stdc++.h>
#include<unordered_map>
#include<unordered_set>
using namespace std;
using LL = long long;
using LD = long double;
using ULL = unsigned long long;
using PII = pair<int, int>;
using TP = tuple<int, int, int>;
#define all(x) x.begin(),x.end()
#define mst(x,v) memset(x,v,sizeof(x))
#defi... | C++ | ca4ae2484800a98b5592ae65cd45b67f | 971377e43a9ee1e86983801a9f2f3df1 | 1,800 | 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 ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define endl '\n'
#define int long long
#define all(a) a.begin(... | C++ | ca4ae2484800a98b5592ae65cd45b67f | ea537361daacb88431406a01136dbf03 | 1,800 | PASSED |
๏ปฟ// \
#include <YENGOYAN>
#include <iostream>
#include <cmath>
#include <algorithm>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <deque>
#include <climits>
#include <queue>
#include <numeric>
#include <stack>
#include <list>
#include <unordered_set>
#include <unordered_map>... | C++ | ca4ae2484800a98b5592ae65cd45b67f | ae11c15a41f4d6adbccdcc66dd15e50e | 1,800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void ACPLS()
{
#ifndef ONLINE_JUDGE
freopen("output.txt", "w", stdout);
freopen("input.txt", "r", stdin);
#endif
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
void moo(string fileName){
freopen((fileName+".in... | C++ | ca4ae2484800a98b5592ae65cd45b67f | a18f8d8d6645ab27f0ac54651dc65d69 | 1,800 | PASSED |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <list>
#include <fstream>
#include <deque>
#include <set>
#include <map>
#include <queue>
#include <functional>
#include <numeric>
#include <cmath>
#include <bitset>
#include <stack>
#include <cassert>
#include <c... | C++ | ca4ae2484800a98b5592ae65cd45b67f | 771d98cb759f562032ef115be818afaf | 1,800 | PASSED |
/* Long Road but worth the pain */
#include"bits/stdc++.h"
using namespace std;
#define int long long
#define ld long double
#define ff first
#define ss second
#define pb push_back
#define mag(v) (int)v.size()
#define all(v) begin(v), end(v)
const int inf = 4e18;
const int N = 2e5 + 10;
template<typename T> bool ckmi... | C++ | ca4ae2484800a98b5592ae65cd45b67f | 727912b2a2705ff8221bd4b34810907a | 1,800 | PASSED |
๏ปฟ#include<set>
#include<map>
#include<cmath>
#include<stack>
#include<array>
#include<queue>
#include<bitset>
#include<vector>
#include<string>
#include<iomanip>
#include<cstring>
#include<iostream>
#include<algorithm>
#define rep(i,x,y) for(int i=x;i<=y;i++)
#define per(i,x,y) for(int i=x;i>=y;i--)
usin... | C++ | ca4ae2484800a98b5592ae65cd45b67f | ba0194416736365289e74d9e99e9e216 | 1,800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define fastio() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define f(i,n) for(int i=0; i<n; i++)
#define ai(n, arr) f(i,n) cin>>arr[i]
#define matin(n, m, mat) f(i,n) f(j,m) cin>>mat[i][j]
#define all(x) x.begin(), x.end()
... | C++ | ca4ae2484800a98b5592ae65cd45b67f | 05db14bc06a85cfd1eb4b54149f79f9b | 1,800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define fr first
#define sc second
typedef long long ll;
typedef pair<ll, ll> pll;
typedef long double ld;
const ll INF = 100000007, DIM = 200007, DIM2 = 707, MOD = 998244353 ;
ll tt, t, mid, res, pos, j, sum, a[DIM], suff[DIM], curans, n, m, x, h, k1, k2, ... | C++ | ca4ae2484800a98b5592ae65cd45b67f | ac672d1e23809e6d35a1c1aafbc64bb8 | 1,800 | PASSED |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <list>
#include <fstream>
#include <deque>
#include <set>
#include <map>
#include <queue>
#include <functional>
#include <numeric>
#include <cmath>
#include <bitset>
#include <stack>
#include <cassert>
#include <c... | C++ | ca4ae2484800a98b5592ae65cd45b67f | c6c9f965cf88e4f99df721718a807e0b | 1,800 | PASSED |
/*
* Author : bd26
* Ins : Norther University of Bangladesh
*/
#include<bits/stdc++.h>
using namespace std;
int main()
{
int tt;
cin >> tt;
while(tt--){
long long c,d;
cin >> c >> d;
if ( c == 0 && d == 0){ cout << 0 << endl; continue;}
else if (abs(c - d) % 2 == 1... | C++ | 8e7c0b703155dd9b90cda706d22525c9 | e074c1efa87a15777ff1518b5dc6aafc | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) x.begin(),x.end()
#define arll(x) x,x+n
#define fr first
#define sc second
#define pb push_back
#define b(x,n) binpow((x),(n))
main(){
int t;
cin>>t;
while(t--){
int c,d;
cin>>c>>d;
if((c+d)%2==1){
cout<<-1<... | C++ | 8e7c0b703155dd9b90cda706d22525c9 | 7d5473f72e7fe4f33146e9e5f513bc05 | 800 | PASSED |
#include <iostream>
using namespace std;
int main(){
int t;
cin>>t;
while(t--) {
int a,b;
cin>>a>>b;
if(a==0 && b==0) {
cout<<0<<endl;
}
else if(a==b) {
cout<<1<<endl;
}
else if((a-b)%2==0) {
cout<<2<<endl;
} else {
cout<<-1<<endl;
}
}
return 0;
}
| C++ | 8e7c0b703155dd9b90cda706d22525c9 | 66720e8347733ecb2626bef963486bfc | 800 | PASSED |
#include <bits/stdc++.h>
#define ll long long
#define yes cout << "Yes\n"
#define no cout << "No\n"
#define pb push_back
using namespace std;
signed main()
{
int t;
cin>>t;
while(t--){
int a,b;
cin>>a>>b;
if(a==0&&b==0)cout<<0;
else if(abs(a-b)%2){
... | C++ | 8e7c0b703155dd9b90cda706d22525c9 | 6253a91dd4eee442ea8c893a4f38403a | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
long long md= 1e9 + 123;
int main(){
int tt;
cin >> tt;
while(tt--){
int a,b;
cin >>a >> b;
if(abs(a-b) % 2 != 0)cout << -1;
else if(a == 0 and b == a)cout << 0;
else if(a == b)cout << 1;
else cout << 2;... | C++ | 8e7c0b703155dd9b90cda706d22525c9 | be99203d3b666bb681c1505c5f2a7ee1 | 800 | PASSED |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
ll a,b,d;
cin>>a>>b;
d=abs(a-b);
if(a==0&&b==0)
cout<<"0\n";
else if(d%2==1)cout<<"-1\n";
else if(d==0)cout<<"1\n";
... | C++ | 8e7c0b703155dd9b90cda706d22525c9 | 7137d4f36fa5800bc833c29ae28b27cd | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t; cin >> t;
while(t--){
int c , d ; cin >> c >> d;
if(c == 0 && d == 0) cout << 0 << endl;
else if(abs(c - d) % 2 != 0) cout << -1 << endl;
else if(abs(c - d) == 0) cout << 1 << endl;
else cout << 2 << endl;
}
return 0;
} | C++ | 8e7c0b703155dd9b90cda706d22525c9 | 160991495ad008641485c26f5b187599 | 800 | PASSED |
#include <iostream>
#include <cmath>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--){
int n,m;
cin>>n>>m;
if(n==0&&m==0){
cout<<0<<endl;
}
else if(n==m){
cout<<1<<endl;
}
else if((n%2==0&&m%2==1)||(... | C++ | 8e7c0b703155dd9b90cda706d22525c9 | 7d6a68460db96961fe4ca577a0c0a756 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
/* โค i love u Joan โค */
/* ๅฆๆ็ฐๅจๅคงไธ, ่ฟๆ่ฟไนๅคๅๅฃไธ่ฎญ็ปๅ๏ผ */
#define mybae Joanna
#define ll long long
#define rep(a, b, c) for (int a = b; a < c; ++a)
#define per(a, b, c) for (int a = c - 1; a >= b; --a)
#define IOS ios::sync_with_stdio(false); cin.tie(0)
#define pii pair<i... | C++ | 8e7c0b703155dd9b90cda706d22525c9 | 1682d3eee13ebe84fce45b2b5fe176e0 | 800 | PASSED |
#include <bits/stdc++.h>
#define ll long long
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define o cout<<"BUG"<<endl;
#define FOR(i, j, n) for(int j = i; j < n; ++j)
#define forn(i, j, n) for(int j = i; j <= n; ++j)
#define nfor(i, j, n) for(int j = n; j >= i; --j)
#define so... | C++ | 8e7c0b703155dd9b90cda706d22525c9 | 52dc4ca791e91edd54411a3d3d482faa | 800 | PASSED |
/*
Author : DeMen100ns (a.k.a Vo Khac Trieu)
School : VNU-HCM High school for the Gifted
fuck you adhoc
*/
#include <bits/stdc++.h>
using namespace std;
const int N = 50 + 5;
const long long INF = 1e18 + 7;
const int MAXA = 1e9;
const int B = sqrt(N) + 5;
mt19937_64 rng(chrono::steady_clock::now().ti... | C++ | d870600853fa87cce3e0b4a985bcc5c8 | 011eb918e5b38456e4e93619a7a5bbda | 3,300 | PASSED |
#pragma GCC optimize("-funsafe-loop-optimizations")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-fwhole-program")
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-falign-functions")
#pragma GCC optimize("-falign-jumps")
#pragma GCC op... | C++ | d870600853fa87cce3e0b4a985bcc5c8 | 3d94a7d4bf7dafa088eed6022648679a | 3,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
typedef long long ll;
typedef long double ld;
ll k;
struct edge{
int u, v;
ll w;
edge(int u, int v, ll w): u(u), v(v), w(w){}
};
bool operator<(edge a, edge b){return a.w < b.w;}
vector<int> ceid;
ll csum = 0;
vector<edge> edges;
... | C++ | d870600853fa87cce3e0b4a985bcc5c8 | 9cb8ae1faf146e53a6904ba4fcf5eb20 | 3,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ull unsigned long long
#define ll long long
#define ld long double
#define p(a,b) pair<a,b> // its for pair
#define vt(a) vector<a> // its for vector
#define ctn continue
#define pb push_back
#define endl "\n"
#define all(a) a.begin(),a.end()
#define ... | C++ | d870600853fa87cce3e0b4a985bcc5c8 | 3604ff3286bf38c0519bc5b26e38cc25 | 3,300 | PASSED |
// BEGIN BOILERPLATE CODE
#include <bits/stdc++.h>
using namespace std;
#ifdef KAMIRULEZ
const bool kami_loc = true;
const long long kami_seed = 69420;
#else
const bool kami_loc = false;
const long long kami_seed = 69420;
#endif
const string kami_fi = "kamirulez.inp";
const string kami_fo = "kamiru... | C++ | d870600853fa87cce3e0b4a985bcc5c8 | a9f580d8f3bd848d76dc13c607b9b2c3 | 3,300 | PASSED |
// BEGIN BOILERPLATE CODE
#include <bits/stdc++.h>
using namespace std;
#ifdef KAMIRULEZ
const bool kami_loc = true;
const long long kami_seed = 69420;
#else
const bool kami_loc = false;
const long long kami_seed = 69420;
#endif
const string kami_fi = "kamirulez.inp";
const string kami_fo = "kamiru... | C++ | d870600853fa87cce3e0b4a985bcc5c8 | f8841cfa63f4162216b77fe8942c98a7 | 3,300 | PASSED |
// BEGIN BOILERPLATE CODE
#include <bits/stdc++.h>
using namespace std;
#ifdef KAMIRULEZ
const bool kami_loc = true;
const long long kami_seed = 69420;
#else
const bool kami_loc = false;
const long long kami_seed = 69420;
#endif
const string kami_fi = "kamirulez.inp";
const string kami_fo = "kamiru... | C++ | d870600853fa87cce3e0b4a985bcc5c8 | faedc867158f766403db810b05b7aba9 | 3,300 | PASSED |
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2")
#include<bits/stdc++.h>
using namespace std;
#define f first
#define s second
typedef long long ll;
const long double alp = 0.99995;
const int SEC = 1e6;
mt19937_64 rng(chrono::steady_clock::now().time_si... | C++ | d870600853fa87cce3e0b4a985bcc5c8 | 43f252239a660c0baeef107396e34e31 | 3,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define pii pair <int, int>
#define X first
#define Y second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
void abc() {cout << endl;}
template <t... | C++ | d870600853fa87cce3e0b4a985bcc5c8 | 8720851f81ad2de0ddb132928b857dd3 | 3,300 | PASSED |
#pragma GCC optimize("Ofast")
#pragma GCC optimization("unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/trie_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
... | C++ | d870600853fa87cce3e0b4a985bcc5c8 | a3d030b2833e60d25d63775c089c0118 | 3,300 | PASSED |
#pragma region Macros
#pragma comment(linker, "/stack:200000000")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2,tune=native")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2")
// #pragma GCC target("avx2")
#pragma GC... | C++ | 327718077f69c0ed1c48acaf09b8e576 | c2d35a1a6dbbd4d203565c87634893c5 | 3,300 | PASSED |
#pragma region Macros
#pragma comment(linker, "/stack:200000000")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2,tune=native")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2")
// #pragma GCC target("avx2")
#pragma GC... | C++ | 327718077f69c0ed1c48acaf09b8e576 | 1c4d63c5e3ea717e662d8a1003c98777 | 3,300 | PASSED |
#pragma region Macros
#pragma comment(linker, "/stack:200000000")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2,tune=native")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2")
// #pragma GCC target("avx2")
#pragma GC... | C++ | 327718077f69c0ed1c48acaf09b8e576 | 2be7bdb2a3c1e06bcb2766debcdda6ac | 3,300 | PASSED |
#pragma region Macros
#pragma comment(linker, "/stack:200000000")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2,tune=native")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2")
// #pragma GCC target("avx2")
#pragma GC... | C++ | 327718077f69c0ed1c48acaf09b8e576 | 4bc03757c44529c6d3d8cb4d2bd5f716 | 3,300 | PASSED |
#pragma region Macros
#pragma comment(linker, "/stack:200000000")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2,tune=native")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2")
// #pragma GCC target("avx2")
#pragma GC... | C++ | 327718077f69c0ed1c48acaf09b8e576 | eca4f97d441ee5d7dc517d3166a1d4ec | 3,300 | PASSED |
#pragma region Macros
#pragma comment(linker, "/stack:200000000")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2,tune=native")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2")
// #pragma GCC target("avx2")
#pragma GC... | C++ | 327718077f69c0ed1c48acaf09b8e576 | ff4e9cd4c0392331fad81b9dd246fb2a | 3,300 | PASSED |
#pragma region Macros
#pragma comment(linker, "/stack:200000000")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2,tune=native")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2")
// #pragma GCC target("avx2")
#pragma GC... | C++ | 327718077f69c0ed1c48acaf09b8e576 | 3321af6944270eba2ff8e4379a0db30f | 3,300 | PASSED |
#pragma region Macros
#pragma comment(linker, "/stack:200000000")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2,tune=native")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2")
// #pragma GCC target("avx2")
#pragma GC... | C++ | 327718077f69c0ed1c48acaf09b8e576 | 8a1225130c890f26a524d609cc38d8d9 | 3,300 | PASSED |
#pragma region Macros
#pragma comment(linker, "/stack:200000000")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2,tune=native")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2")
// #pragma GCC target("avx2")
#pragma GC... | C++ | 327718077f69c0ed1c48acaf09b8e576 | 1389efc90cca0e8e2c53fc260e56bada | 3,300 | PASSED |
#pragma region Macros
#pragma comment(linker, "/stack:200000000")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2,tune=native")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2")
// #pragma GCC target("avx2")
#pragma GC... | C++ | 327718077f69c0ed1c48acaf09b8e576 | 5ff4a175539a8f506014deae11048071 | 3,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
set<char> used;
int getLocal(char &target) {
int id = 0;
for (char c = 'a'; c <= 'z'; c++) {
if (used.count(c)) continue;
if (c == target) {
used.insert(c);
return id;
}
++id;
}
return 69420;
}
void... | C++ | 2e3006d663a3c7ad3781aba1e37be3ca | ee55eeee96fec5e96e03d2df5665264a | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin >> t;
char str[2];
int nu[2];
while (t--)
{
for (int i = 0; i < 2; i++)
cin >> str[i];
nu[0] = (str[0] - 'a');
nu[0] *= 25;
if(str[0]<str[1])
nu[1] = str[1] - 'a';
el... | C++ | 2e3006d663a3c7ad3781aba1e37be3ca | 89b502dbd7535b661125be84cbe86764 | 800 | PASSED |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int t;
string s;
cin >>t;
while(t--){
cin >> s;
int ans;
ans = s[0] - 'a';
ans *= 25;
if(s[1] > s[0])
s[1]--;... | C++ | 2e3006d663a3c7ad3781aba1e37be3ca | 9e85a0ffa31914074d237265e14a64bb | 800 | PASSED |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 1e6 + 10;
int mod = 10007;
ll f[N], inf[N];
ll qni(ll a, ll k)
{
ll res = 1;
while (k)
{
if (k & 1)
{
res = (ll)res * a % mod;
}
a = (ll)a * a % mod;
k >>= 1;
}
retu... | C++ | 2e3006d663a3c7ad3781aba1e37be3ca | eb3c54171381b790a800c9dcfee7d1eb | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t; cin >> t;
while (t--)
{
string s; cin >> s;
if (s[0] > s[1])
cout << ((s[0] - 'a') * 25) + abs(s[1] - 'a') + 1 << "\n";
else
cout << ((s[0] - 'a') * 25) + abs(s[1] - 'a') <<"\n";
}
return 0;
}
| C++ | 2e3006d663a3c7ad3781aba1e37be3ca | f89004f90946025c47d456a7fd11e840 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin >> t;
while (t--)
{
string s;
cin >> s;
int a = (s[0] - 'a') * 25 + (s[1] - 'a' + 1) ;
if(s[1] > s[0]) a--;
cout << a << endl;
}
return 0;
}
| C++ | 2e3006d663a3c7ad3781aba1e37be3ca | d740e6fd8cbb43979ecfcccd325768a9 | 800 | PASSED |
#include <iostream>
using namespace std;
int main()
{ string f;
int y=0,t;
cin>>t;
string s;
for(int v=1;v<=t;v++)
{ cin>>s;
y=0;
for(char i='a';i<='z';i++)
{
for(char j='a';j<='z';j++)
{
if(i!=j)
{
f[0]=i;
f[1]=j;
... | C++ | 2e3006d663a3c7ad3781aba1e37be3ca | 04a893a6e00467c6ab20f75ed8ee4834 | 800 | PASSED |
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<string>
using ll=long long;
using namespace std;
void solve(){
string s;
cin>>s;
int k,i;
//int cnt=0;
k=25*(s[0]-'a');
if(s[1]>s[0]) i=(s[1]-'a');
else i=(s[1]-'a')+1;
/*int p=0;
for(;;){
if(s[0]==s[1]){p=... | C++ | 2e3006d663a3c7ad3781aba1e37be3ca | 6ea4d2da11bcaafbe24ad6f19f225dc9 | 800 | PASSED |
#include<iostream>
using namespace std;
int main()
{
int t;cin>>t;
while (t--)
{
string s(2,0);
cin>>s;
int a[26][26];
int i,j,count=1;
for(i=0;i<26;i++)
{
for(j=0;j<26;j++)
{
if(i==j)
a[i][j]=0;
... | C++ | 2e3006d663a3c7ad3781aba1e37be3ca | a37cf5533823613dba914da07a6dda58 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll i,t,n,c,ans;
cin>>t;
string s;
while(t--)
{
cin>>s;
n=s[0]-'a';
c=s[1]-'a';
//cout<<n<<" "<<c<<endl;
if(s[1]>s[0])
cout<<n*25+c<<endl;
else
cout<... | C++ | 2e3006d663a3c7ad3781aba1e37be3ca | 867151f0e9406db4fb7995faffd8e413 | 800 | PASSED |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main(){
int t;
cin >>t;
while (t--){
int x,y;
cin>>x>>y;
int a=1;
int b;
int q=1;
int ans;
ans=y/x;
if (y%x==0){
c... | C++ | f7defb09175c842de490aa13a4f5a0c9 | b1340165c07add965b58fbb3516a2a62 | 800 | PASSED |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main(){
int t;
cin >>t;
while (t--){
int x,y;
cin>>x>>y;
int a=1;
int b;
int q=1;
int ans;
ans=y/x;
if (y % x != 0){
cout<<0<<' '<<0<<e... | C++ | f7defb09175c842de490aa13a4f5a0c9 | cb434ca2bbccdd829096e6edf3eda671 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main(){
int t;
cin >> t;
for (int i = 0; i < t; i++){
int x, y;
cin >> x >> y;
if (y % x != 0){
cout << 0 << ' ' << 0 << endl;
} else {
cout << 1 << ' ' << y / x << endl;
}
}
} | C++ | f7defb09175c842de490aa13a4f5a0c9 | e43d3c6e205ea56f9d3a46077227b4e7 | 800 | PASSED |
#include <iostream>
using namespace std;
int main() {
int t;
cin>>t;
while(t--)
{
int x,y,a=1,b;
cin>>x>>y;
if(x>y || (y%x)!=0)
{
cout<<"0"<<" "<<"0\n";
}
else
{
b=y/x;
cout<<a<<" "<<b<<"\n";
}
}
return 0;
}
| C++ | f7defb09175c842de490aa13a4f5a0c9 | c4824017047f1c2ef427b9a35e41d891 | 800 | PASSED |
#include<iostream>
using namespace std;
int pow[102][2],t,x,y,p;
int main()
{
pow[1][0]=1;pow[1][1]=1;
for (int i=2;i<=100;++i){
p=i;
for (int j=1;p<=100;++j){
//printf("%d=%d^%d\n",p,i,j);
pow[p][0]=j;
pow[p][1]=i;
p*=i;
}
};
scan... | C++ | f7defb09175c842de490aa13a4f5a0c9 | d343718b89ca321a553169ab16f4e953 | 800 | PASSED |
/** You're Amazing Just The Way You Are **/
#include<bits/stdc++.h>
using namespace std;
//int word(string xyz){ stringstream xxx(xyz); string yyy; int zj=0; while(xxx>>yyy){ zj++; } return zj; }
#define ll long long
#define pb push_back
#define pi acos(-1)
#define mod 1000000007
#define mem(a,x) memset(a,x,sizeo... | C++ | f7defb09175c842de490aa13a4f5a0c9 | 43a275074c1b6fb6d76b18fcad212a73 | 800 | PASSED |
#include <bits/stdc++.h>
#include<cmath>
#include<iostream>
#include<stdio.h>
#include<iomanip>
#define ll long long
#define nl cout<<endl;
#include<math.h>
#include<string.h>
using namespace std;
int main(){
ll k;
cin>>k;
while(k--){
ll x,y,a,b;
cin>>x>>y;
if(y%x==0)
{
ll q=y/x;
... | C++ | f7defb09175c842de490aa13a4f5a0c9 | bbe9c2ab5569f0c69927f042dc680591 | 800 | PASSED |
#include <iostream>
int main()
{
int t, x, y;
scanf("%d", &t);
while (t--)
{
scanf("%d %d", &x, &y);
if (y / x >= 1 && y % x == 0) printf("1 %d\n", y / x);
else printf("0 0\n");
}
return 0;
}
| C++ | f7defb09175c842de490aa13a4f5a0c9 | 6510eb76f9bc1df883f7bd5df5964278 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin>>t;
while(t--)
{
int x,y;
cin>>x>>y;
int k;
int a=0,b=0;
if(y%x==0)
{
cout<<"1"<<" "<<y/x<<"\n";
}
else
{
cout<<"0"<<" "<<"0"<<endl;
}
}
return 0;
}
| C++ | f7defb09175c842de490aa13a4f5a0c9 | 370f43991e7d32214f7cedc44e741108 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int t;
scanf("%d",&t);
while(t--){
int x,y;
scanf("%d%d",&x,&y);
if(y%x==0){
printf("%d %d\n",1,y/x);
}
else{
printf("0 0\n");
}
}
return 0;
}
| C++ | f7defb09175c842de490aa13a4f5a0c9 | 5ccba44759524d9ec9a1736660262517 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
string s;
string t;
cin>>s>>t;
int n=s.size();
long long ans=0;
if(t[0]=='a'&&t.size()==1)
{
cout<<1<<endl;
}else
{
bool flag=0;
for(int i=0;i<t.size();i++)
{
if(t[i]=='a')
{
cout... | C++ | d6ac9ca9cc5dfd9f43f5f65ce226349e | 81e023469569476c14a61186fbfe1f50 | 1,000 | PASSED |
#include<bits/stdc++.h>
typedef long long int ll;
typedef long int l;
typedef long double ld;
#define pii pair<long long int,long long int>
#define intmax INT_MAX
#define endl "\n"
#define READ(x) freopen(x,"r",stdin)
#define WRITE(x) freopen(x,"w",stdout)
#define sl(x) scanf("%lld", &x)
#defin... | C++ | d6ac9ca9cc5dfd9f43f5f65ce226349e | 50e16ccecec07346900ce99a92d373e2 | 1,000 | PASSED |
/*** remain true to the original aspiration ***/
#include<bits/stdc++.h>
using namespace std;
typedef bool boo;
typedef int li;
typedef long il;
typedef unsigned long ul;
typedef long long int ll;
typedef unsigned long long ull;
typedef doub... | C++ | d6ac9ca9cc5dfd9f43f5f65ce226349e | fa3c72b9dfd3ffe456307b6e83433680 | 1,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int n;
cin >> n;
while (n--) {
string s, t;
cin >> s >> t;
int x = count(t.begin(), t.end(), 'a');
if (x) {
if (t.length() > 1)cout << -1 << endl;
else cout << 1 ... | C++ | d6ac9ca9cc5dfd9f43f5f65ce226349e | 034aaf61c84e83df50eab4b92e51eee6 | 1,000 | PASSED |
#include <iostream>
#include <bits/stdc++.h>
#include<iostream>
using namespace std;
int t;
string s,k;
int main(){
cin>>t;
while(t--){
cin>>s>>k;
if(k =="a")cout<<1<<"\n";
else if(k.find('a')!=-1)cout<<-1<<"\n";
else cout<<(1LL<<s.size())<<"\n";
}}
... | C++ | d6ac9ca9cc5dfd9f43f5f65ce226349e | 38ff17ff1f37f2d3223db9f071a2e44d | 1,000 | PASSED |
#include<bits/stdc++.h>
#include<algorithm>
#include<math.h>
using namespace std;
typedef long long ll;
//H - Infinite Replacement
int main()
{
int q;
cin>>q;
while(q--)
{
string s,t;
long long tmp=0;
cin>>s>>t;
char a=s[0];
int len1=s.length();
int len2=t.length();
for(int i=0;i<len2;i++)
{
if(t... | C++ | d6ac9ca9cc5dfd9f43f5f65ce226349e | a2f097dcce07bf92dd9dc1150231068b | 1,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main() {
int T;
cin >> T;
while(T--) {
string s, t;
cin >> s >> t;
bool ca = false;
bool caa = false;
for(int i = 0; i < t.size(); i++) {
if(t[i] == 'a') {
ca = true;
}
if(t[i] != 'a') caa = true;
}
if(t == "a") cout << "1" << en... | C++ | d6ac9ca9cc5dfd9f43f5f65ce226349e | 28239106d4ae490b3790cc3bdb28dbd3 | 1,000 | PASSED |
#include<stdio.h>
#include<math.h>
#include<string.h>
typedef long long ll;
int main() {
int q;
scanf("%d",&q);
getchar();
char s[100],t[100];
while (q--) {
scanf("%s %s",s,t);
if (strlen(t) == 1 && t[0] == 'a') {
printf("1\n");
}
else if (strchr(t,'a') != NULL) {
printf("-1\n");
}
else {
l... | C++ | d6ac9ca9cc5dfd9f43f5f65ce226349e | 53b1c490dfc19a732bc4fc1d334f626f | 1,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define x first
#define y second
#define ump unordered_map
#define IC std::ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define debug cout<<"++++++++++"<<endl;
const ll N=1e5+5,mod=1e9+7,INF=0x3f3f3f3f;//ll
int main(){
IC;
int t; cin>>... | C++ | d6ac9ca9cc5dfd9f43f5f65ce226349e | 53a2bf5ec9f25da8b1c6870e43496eeb | 1,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define LIM 5000000
#define two(i) (1LL<<(i))
typedef long long ll;
ll n,test,m,cas;
string str1,str2;
int main()
{
#ifndef ONLINE_JUDGE
freopen("in.txt","r",stdin);
#endif
cin>>test;
while(test--)
{
cin>... | C++ | d6ac9ca9cc5dfd9f43f5f65ce226349e | 113e871929a0f4e8422e725a9248faf1 | 1,000 | PASSED |
#include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <cmath>
#include <set>
using namespace std;
string solve(vector<int> &a, int n) {
int lim = (n-1)/2;
int u, v, temp;
for (int i = 0; i <= lim; i++) {
u = n-2*i-2;
v = n-2*i - 1;
if (u < 0) break;
if (a[u] > a[... | C++ | 95b35c53028ed0565684713a93910860 | d6de41390fc7899bd5840447f06b2418 | 1,200 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.