code_file1 stringlengths 87 4k | code_file2 stringlengths 85 4k |
|---|---|
#include<iostream>
using namespace std;
int N, X;
string S;
int main() {
cin >> N >> X >> S;
int res = X;
for (int i = 0; i < S.size(); i++) {
if(S[i] == 'o')
res++;
if(S[i] == 'x') {
res--;
res = max(0, res);
}
}
cout << res << endl;
} | /* Jai Shree Ram 🚩🚩🚩 */
#include "bits/stdc++.h"
#define ll long long int
#define oo 1000000000000000000
#define forr(i,n) for(int i=0;i<n;i++)
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define all(x) x.begin(),x.end()
#define unique(v) sort(all(v)); v.resize(distance(v.begin(),unique(a... |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... | #include <bits/stdc++.h>
using namespace std;
map<int64_t, int64_t> memo;
int64_t solve(int64_t X, int64_t Y) {
if (Y <= X) {
return X - Y;
}
if (Y == X + 1 || Y == 2 * X) {
return 1;
}
if (memo.count(Y) > 0) {
return memo[Y];
}
int64_t ans = abs(X - Y);
//最... |
#include<bits/stdc++.h>
using namespace std;
#define INF 1e9
#define MOD 1000000007
#define foru(i,a,b) for(int i=(a); i<(b); i++)
#define forue(i,a,b) for(int i=(a); i<=(b); i++)
#define forb(i,n) for(int i=n-1; i>=0; i--)
#define forall(it,v) for(auto it=v.begin();it!=v.end();++it)
#define pb push_back
#define fst fi... | #include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll a;
cin >> a;
... |
#include<bits/stdc++.h>
using namespace std;
#define SPEED ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define READ freopen("out.txt","r",stdin)
#define WRITE freopen("out.txt","w",stdout);
#define pb push_back
#define mem(arr,val) memset(arr,val,sizeof(arr))
#define sf(x) scanf("%d",&x)
#define sf2(x,y) s... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main()
{
int k;
cin >> k;
int a=1,b=1,c=1;
ll ans = 0;
while(a*b*c<=k){
whi... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define N 214514
#define all(x) (x).begin(), (x).end()
const ll mod = 1000000007;
const ll inf = 1000000000000000000;
int main() {
vector<ll> cnt(10);
ll k;
cin >> k;
for (int... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef vector<vector<long long>> VVL;
typedef pair<int,int> P;
typedef tuple<int,int,int> tpl;
#define ALL(a) (a).begin(),(a).end()
#define SORT(c) sort((c).begin(),(c).e... |
#include <bits/stdc++.h>
using namespace std;
//begin of def
#define fastio ios_base::sync_with_stdio(false);cin.tie(0)
#define endl '\n'
using lli = long long int;
using ulli = unsigned long long int;
using Ld = long double;
using pii = pair<int, int>;
using pll = pair<lli, lli>;
using pld = pair<Ld, Ld>;
#define X... | #include <bits/stdc++.h>
using namespace std;
typedef long long lint;
#define rep(i,n) for(lint (i)=0;(i)<(n);(i)++)
#define repp(i,m,n) for(lint (i)=(m);(i)<(n);(i)++)
#define repm(i,n) for(lint (i)=(n-1);(i)>=0;(i)--)
#define INF (1ll<<60)
#define all(x) (x).begin(),(x).end()
const lint MOD =1000000007;
//const lint ... |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
cout<<(1<<n)-1<<endl;
for(int i=1;i<(1<<n);i++)
{
for(int j=0;j<(1<<n);j++)
putchar('A'+(__builtin_popcount(i&j)&1));
puts("");
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
vector<string> ret[8];
int main(){
ret[0].push_back("AB");
for(int i=1;i<8;i++){
for(string s: ret[i-1]){
string t="";
for(int j=0;j<s.size();j++){
t+=s[j]; t+=s[j];
}
ret[i].push_back(t);
}
for(int j=0;j<(1<<i);j++){
string t="";
if(j==0){
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;
template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (ll i=(ll)from; i<(ll)to; i++)
#define all(vec) vec.begin(), vec.en... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <map>
#include <cmath>
#include <queue>
#include <deque>
#include <set>
#include <iomanip>
#include <utility>
typedef long long ll;
typedef long double ld;
using namespace std;
int A[100010], B[100010];
int main() {
int N, L;
cin ... |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll n;
cin >> n;
vector<ll> a(n);
rep(i,n){
cin >>a[i];
}
ll ans;
ans = n*(n-1)/2;
sort(a.begin(),a.end());
ll cnt=0;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long L;
cin >> L;
long long res = 1;
for(int i = 1; i <= 11; i++) {
res *= L-i;
res /= i;
}
cout << res << endl;
} |
#include <iostream>
#include <algorithm>
#define rep(i,N) for(int i=0;i<N;i++)
#define REP(i,a,b) for(int i=a;i<b;i++)
using namespace std;
typedef long long ll;
#define PInt std::pair<int,int>
int main(void){
int H,W,N,M;
cin >> H >> W >> N >> M;
enum kind{
EMPTY,
BLOCK,
LIGHT,
MAX
};
in... | #include <bits/stdc++.h>
using namespace std;
// #include <atcoder/all>
// using namespace atcoder;
#define rep(i,n) for (int i = 0; i < (n); ++i)
using ll = long long;
void solve(long long N, long long M, std::vector<long long> A, std::vector<long long> B){
vector<vector<int>> e(N);
rep(i, M) {
A[i... |
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdlib>
#include<queue>
#include<set>
#include<cstdio>
#include<map>
#include<cassert>
using namespace std;
#define ll long long
#define reps(i, a, b) for(int i = a; i < b; i++)
#define rreps(i, a, b) for(int i = a-1; i >= b; i--)
#def... | //#define local
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define rep(i,n); for(long long i = 0;i < (n);i++)
using ll = long long;
using P = pair<long long,long long>;
template <class T> using vec = vector<T>;
#ifdef local
#include "library/debug.cpp"
#else
#define debug(...)
#endif
int main(){
... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int,int>;
#define pb push_back
#define mp make_pair
const int INF = 0x3f3f3f3f;
const int MOD = 1e9+7;
const int MAX_N = 2e5+10;
const string YES = "Takahashi\n", NO = "Aoki\n";
int N;
string s, x;
int dp[MAX_N][7];
int go(int at, i... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
// #pragma GCC optimize("-O3")
// #pragma GCC optimize("Ofast")
// #pragma GCC target("avx,avx2,fma")
using namespace std;
using namespace __gnu_pbds;
#ifdef ON_LINUX
#include <sys/resource.h>
#define meminc ... |
#include <iostream>
using namespace std;
long long power(long long x, long long k, long long mod){
long long ret = 1;
while(k > 0){
if(k&1) ret *= x, ret %= mod;
x *= x, x %= mod;
k >>= 1;
}
return ret;
}
int main(){
long long N, M;
cin >> N >> M;
long long ans = power(10,N,M*M);
ans /= ... | #include<bits/stdc++.h>
#define pb push_back
using namespace std;
#define G getchar()
int read()
{
int x=0; bool flg=false; char ch=G;
for (;!isdigit(ch);ch=G) if (ch=='-') flg=true;
for (;isdigit(ch);ch=G) x=(x<<3)+(x<<1)+(ch^48);
return flg?-x:x;
}
#undef G
#define fi first
#define se second
typedef long long ll;... |
#include<bits/stdc++.h>
using namespace std ;
const int maxn = 100 + 10 ;
int dp[maxn][maxn][maxn][maxn] ;
int main()
{
std::ios::sync_with_stdio(false) , cin.tie(0) ;
int n ;
long long x ;
cin >> n >> x ;
vector<int> a(n + 1) ;
for(int i = 1 ; i <= n ; i ++) cin >> a[i] ;
//dp[i][j][k][p]?... | #include<bits/stdc++.h>
using namespace std;
//dengyaotriangle!
const int maxn=100005;
int n,l;
int a[2][maxn];
int v[maxn],li[maxn],ri[maxn],lj[maxn],rj[maxn],t;
int main(){
ios::sync_with_stdio(0);cin.tie(0);
cin>>n>>l;
for(int t=0;t<2;t++){
for(int i=1;i<=n;i++)cin>>a[t][i],a[t][i]-=i;
... |
#include<bits/stdc++.h>
using namespace std;
#define fi(a,b) for(int i=a;i<b;i++)
#define fj(a,b) for(int j=a;j<b;j++)
#define ff first
#define ss second
#define ll long long
#define ld long double
#define ull unsigned long long
#define bp(x) __builtin_popcount(x)
#define pr(x) for(auto it: x) cout<<... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define mod 998244353
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __pri... |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
//const int MAX=INT_MAX;
//const ll MAX=100000000000;
//const int mod = 1000000007;
//const int mod = 998244353;
//const ll A=100000000000;
const int INF=1000000000;
ll extgcd(ll a,ll b,ll& x,ll& y){
if(b==0){
x=1;
y=0... | #include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<utility>
#include<set>
#include<stack>
#include<list>
#include<deque>
#include<bitset>
#include<iomanip>
#include<cstring>
#include<sstream>
#include<cstdio>
#include<cstdlib>
#include<climits>
#include<cmath>
#include<cctype... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
vector<int> V;
vector<int> P;
long X;
long drink = 0;
int ans;
cin >> N >> X;
int a, b;
for(int i = 0; i < N; ++i){
cin >> a >> b;
V.push_back(a);
P.push_back(b);
}
for(ans = 0; ans < N; ++ans){
drink += V.at(ans) ... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0;i<n;++i)
#define rep1(i, n) for(int i=1;i<=n;++i)
#define ll long long
int main(){
int n;
ll x, v, p;
cin>>n>>x;
x *= 100;
vector<ll>a;
rep(i, n){
cin>>v>>p;
a.emplace_back(v * p);
}
int ans = -1;... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define N 100005
#define MOD 1000000007
#define dd double
#define vi vector<int>
#define vll vector<ll>
#define forr(i,n) for(ll i=0;i<n;i++)
#define revf(i,n) for(ll i=n-1;i>=0;i--)
#define REP(i,a,b) for(ll i=a;i<b;i++)
#define rep1(i,b) for(ll i=... | /*
* author: Apiram
* created: 23.01.2021 17:34:22
*/
#include<bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int64_t n;
int64_t k;
cin>>n>>k;
k*=100;
vector<int64_t>arr(n);
for (auto i =0;i<n;++i){
int64_t a,b;
cin>>a>>b;
arr[i]=a*b;
}
int64_t i=0;
... |
#include <iostream>
#include<string>
#include <vector>
#include <iomanip>
#include <stdio.h>
#include <math.h>
using namespace std;
int main()
{
int n;
string s;
cin >> s;
int result = 0;
for (int i = 0; i < 9; i++)
{
if(s[i] == 'Z'){
if(s[i+1] == 'O'){
if(s[... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define ll long long int
#define test() int tt; cin>>tt; while(tt--)
#define fst_io ios_base::sync_with_stdio(false);cin.tie(NULL);
#define endl '\n'
#define lg 1000000000
#define vec vector<int>
void arrInput(int a[],int n){rep(i,0... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vc = vector<char>;
using vii = vector<vector<int>>;
using vll = vector<vector<ll>>;
using vcc = vector<vector<char>>;
using vs = vector<string>;
using Pi = pair<int , int>;
using Pl = pair<ll, ll>;
u... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;++i)
#define reps(i,s,n) for(int i=s;i<n;++i)
using ll = long long;
using namespace std;
int main()
{
int n;
cin >> n;
ll ans = 0;
rep(i, n)
{
ll a, b; cin >> a >> b;
ll s1 = b * (b + 1) / 2;
ll s2 = a * (a + 1) / 2;... |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,k,m,sum(0),avg,ans(-1);
cin >> n >> k >> m;
for(int i = 0;i<n-1;i++){
cin >> avg;
sum += avg;
}
avg = sum/n;
if(m <= avg){
ans = 0;
}else if((m*n-sum) <= k){
ans = m*n - sum;
}
cout << ans << endl;
} | #include <stdio.h>
#include<iostream>
#include <string>
#include <string.h>
#include <vector>
#include <cmath>
#include <algorithm>
#include <queue>
#include <climits>
#include <set>
#include <unordered_map>
#include <map>
#include <stack>
#include <unordered_set>
#define hash hassh
using namespace std;
int main() {
... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll inf=1e18,mod=1e9+7;
ll fact[1000000],ifact[1000000];
ll power (ll a,ll b){
ll res=1;
while(b){
if(b&1)
res=(res*a)%mod;
b/=2;
a=(a*a)%mod;
}
return res;
}
ll ncr(ll n,ll r){
if(n<=r)
retur... | #include <iostream>
using namespace std;
int main() {
int n,y,z,w,ab;
cin>>n;
cin>>y>>z>>w;
if(w>y) ab=z;
else ab=0;
for(int i=1;i<n;i++){
int A,P,X;
cin>>A>>P>>X;
if(X>A){
if(ab>P) ab=P;
if(ab==0)ab=... |
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define ll long long
#define rep(i,N) for(ll i=0; i<N; i++)
const int mx = 2e5;
ll modpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
... | #include<bits/stdc++.h>
#define forn(i, n) for(int i=0;i<(int)(n);i++)
#define for1(i, n) for(int i=1;i<=(int)(n);i++)
#define fore(i, l, r) for(int i=(int)(l);i<=(int)(r);i++)
#define ford(i, n) for(int i=(int)(n)-1;i>=0;i--)
#define pb push_back
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()... |
#include <bits/stdc++.h>
using namespace std;
//UnionFindテンプレ
class UnionFind {
// まとめる 判定 サイズを知る
public:
// Aから見た親の番号を格納する。rootだったら-1*その集合のサイズ。
vector<int> Parent;
// 初期化
UnionFind(int N) {
Parent = vector<int>(N, -1);
}
// Aのrootを調べる
int root(int A) {
if (Parent[... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long llp;
#define mod 1000000007
#define deb(x) cerr << '\t' << "[" << #x << ": "<< x << "]\n";
#define f first
#define s second
#define pb push_back
/*
numeric_limits<llp>::max();
*/
void solution();
int main() {
ios_base... |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<vector>
#include<cmath>
#include<algorithm>
#include<map>
#include<queue>
#include<deque>
#include<iomanip>
#include<tuple>
#include<cassert>
#include<set>
#include<complex>
#include<numeric>
#include<functional>
#include<unordered_map>
#in... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll z = 0, mod = 998244353;
ll ruijo(ll a, ll b) {
ll res = 1;
for (a %= mod; b; a = a * a % mod, b >>= 1)
if (b & 1) res = res * a % mod;
return res;
}
int main(){
ll N;
cin >> N;
vector<ll> f(N + 1);
for (ll i = 1; i <= N; i... |
#include<bits/stdc++.h>
#define ll long long
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define _rep(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
using pii=std::pair<int,int>;
using u32=unsigned;
using u64=unsigned ll;
inline bool up(int&x,const int y){return x<y?x=y,1:0;}
inline bool down(int&x,const int y){... | #include <iostream>
#include <algorithm>
#include <unordered_set>
#include <set>
#include <vector>
#include <queue>
#include <map>
#include <numeric>
#include <math.h>
#include <complex>
using namespace std;
#define rep(i, n) for (long long int i = 0; i < (long long int)(n); i++)
#define irep(i, n) for (long long int... |
#include<cstdio>
#include<iostream>
#include<cstring>
#include<vector>
#include<algorithm>
#include<set>
typedef long long ll;
typedef unsigned un;
typedef std::vector<int> P;
typedef std::pair<int,int> pii;
ll read(){ll x=0,f=1;char c=getchar();while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}while(c>='0'&&c<='9')x=x*1... | #include <bits/stdc++.h>
using namespace std;
#define int ll
#define fi first
#define se second
#define Mp make_pair
#define pb push_back
typedef long long ll;
typedef double db;
typedef pair<int, int> pii;
typedef vector<int> vi;
mt19937 mrand(time(0));
#define debug(...) fprintf(stderr, __VA_ARGS__)
ll get(ll r) { r... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i =0;i<(n);++i)
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
int main(){
int X,Y,Z;
cin >>X>>Y>>Z;
int tmp=Y*Z;
if(tmp%X==0)cout <<tmp/X-1;
else cout <<tmp/X;
} | #include <bits/stdc++.h>
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef unsigned long long llu;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<int, pii> piii;
typedef pair<ll, ll> pll;
typedef pair<ll, int> pli;
typedef... |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define N 200100
#define MOD 1000000007 //998244353
#define ll long long
#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep2(i, a, b) for(int i = a; i <= b; ++i)
#define rep3(i, a, b) for(int i = a; i >= b; --i)
#define eb emplace_back
#de... | #include<bits/stdc++.h>
using namespace std;
long long binpow(long long i, long long x, long long MOD)
{
long long rs=1;
long long a=x;
while(i)
{
if (i&1)
{
i--;
rs*=a;
rs%=MOD;
}
else
{
i/=2;
a*=a;
... |
#include <bits/stdc++.h>
//#include <atcoder/lazysegtree>
//#include <atcoder/segtree>
//#define rep(i,a,n) for (int i=a;i<n;i++)
#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(n) for(ll i = 0; i < (n); ++i)
#define rep2(i, n) for(ll i = 0; i < (n); ++i)
#define rep3(i, a, b) for(ll i = (a); i < (b); ++... | /* Goal to be a Master */
#include <algorithm>
#include <bits/stdc++.h>
#include<string>
using namespace std;
#define endl "\n"
#define fo1(i,n) for(int i=1;i<=n;i++)
#define min3(a,b,c) min(a,min(b,c))
#define s(v) (ll)v.size()
#define e(v) v.empty()
#define ... |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int maxn=1e5+7;
const LL MOD=1e9+7;
LL rec[maxn];
int main()
{
int len;
cin >> len;
string arr;
LL ans=1;
rec[3]=1;rec[4]=2;rec[2]==1;
for(int i=0;i<4;++i)
{
char tem; cin >> tem; arr+=tem;
}
if(len<4||arr[0]=='A'&&arr[1]=='A'||arr[1]... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1003;
const ll MOD = int(1e9) + 7;
ll add(ll a, ll b) {
a %= MOD;
b %= MOD;
ll ans = (a + b) % MOD;
return ans;
}
ll sub(ll a, ll b) {
a %= MOD;
b %= MOD;
ll ans = (a - b + MOD) % MOD;
return ans;
}
ll mul(ll a, ll b... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define absdiff(a,b) (a>b)?a-b:b-a
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define fast ios_base::sync_with_stdio(false);cin.tie(0);
#define MOD 1000000007
#define ll_MAX 19223372036859
#define endl "\n"
ll f... | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define endl "\n"
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {os << "["; for... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
using ll = long long;
using P = pair<int,int>;
int main()
{
int n, s, d;
cin >> n >> s >> d;
rep(i, n){
int x, y;
cin >> x >> y;
if(x < s && y > d){
cout << "Yes" << endl;
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
if(a!=b && a==c){
cout<<b<<endl;
}
else if(a==b && a==c){
cout<<a<<endl;
}else if(a!=b && b!= c){
cout<<0<<endl;
}
else if(a!=b && a!=c){
cout<<a<<end... |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define pb push_back
#define fi first
#define se second
#define int long long
typedef... | #include <bits/stdc++.h>
//#include <bits/extc++.h>
//#include <immintrin.h>
using namespace std;
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
template<typename T>
istream &operator>>(istream &in, vector<T> &... |
#include <iostream>
#include <iomanip> //<<setprecision(12), or <<fixed
#include <algorithm>
#include <functional>
#include <map>
#include <vector>
#include <queue>
#include <cmath>
#include <set>
using namespace std;
using ll=long long;
using ull=unsigned long long;
using pll=pair<ll,ll>;
int main()
{
ll A,B,C... | #include<bits/stdc++.h>
#define ST first
#define ND second
#define ll long long
#define ld long double
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
using namespace std;
const ll INF = 1e9 + 9;
//const ll MOD = 1e9 + 7;
const ll MOD = 998244353;
const long long LINF = (ll)1e18 + 3;
// secik.i... |
#include<bits/stdc++.h>
using namespace std;
int h[30][29], v[29][30], hc[30][29], vc[29][30];
int si, sj, ti, tj, prev_si, prev_sj, prev_ti, prev_tj;
int prev_result;
int i=0, j=0;
int border=3;
int repeat_count=1000;
string query(int si, int sj, int ti, int tj){
string path;
while(si!=ti || sj!=tj){
if(si==ti)... |
#include <cstdio>
#include <cassert>
#include <iostream>
#include <algorithm>
#include <queue>
#include <vector>
using namespace std;
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
typedef long long ll;
const int N = 30;
const int MIN_COST = 1000;
// const int MAX_COST = 9000;
const int nQuery = 1000;
enum {
... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d\n", &n);
vector<int> a(n), b(n), c(n);
vector<long long> d(n + 1, 0), e(n + 1, 0), f(n + 1, 0);
for(int i = 0; i < n; i++) {
scanf("%d", &a.at(i));
d.at(a.at(i))++;
}
for(int i = 0; i < n; i++) {
scanf("%d", &b.at(i)... | #include <bits/stdc++.h>
#define REP(i,a,b) for (int i = (a); i <= (b); ++i)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) (int)(x).size()
#define dbgpr(x) cout << #x << " is " << x << endl
#define endl '\n'
using namespace std; using ll = long long; using ii = pair<int,int>;
void solution(); int main() {ios::syn... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << (a*d)-(b*c);
}
| #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll,ll> pi;
typedef vector<pi> vp;
typedef set<ll> si;
typedef map<string, ll> msi;
#define REP(i,a,b) \
for(ll i=ll(a);i<=ll(b);i++)
#define DEP(i,a,b) \
for(ll i=ll(a);i>=ll(b);i--)
#define TR(c, it) \
for (auto it =... |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S, ret = "", tmp; cin >> S;
for (auto s : S) {
switch (s)
{
case '0': tmp = '0'; break;
case '1': tmp = '1'; break;
case '6': tmp = '9'; break;
case '8': tmp = '8'; break;
case '9': tmp = '6'; break;
}
ret = tmp +... | #include <iostream>
#include<stdio.h>
#include <cmath>
using namespace std;
int main(){
int num;
cin>>num;
if(num%2==0){
cout<<"White";
}else{ cout<<"Black";
}
} |
#include <bits/stdc++.h>
using namespace std;
#define fast ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl "\n"
#define ll long long
#define pb push_back
#define ff first
#define ss second
int main()
{
fast;
int a[3];
for (int i = 0; i < 3; ++i)
{
cin >> a[i];
}
sort(a, a + 3);
if (2 * a[1] =... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Yes_cout cout <<"Yes"<<endl;
#define No_cout cout <<"No"<<endl;
int main() {
vector<int> v(4);
for (int i = 0; i < 4; i++) {
cin >> v.at(i);
}
int x;
x = v[0]*v[3]-v[1]*v[2];
cout << x <... |
#include <iostream>
#include <cstdio>
#include <vector>
using namespace std;
int main(){
long long a, b, c, d;
cin >> a >> b >> c >> d;
long long minv = a;
minv = min(minv, b);
minv = min(minv, c);
minv = min(minv, d);
cout << minv << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int v, t, s, d;
cin >> v >> t >> s >> d;
if(d<v*t || d>v*s)
cout << "Yes" << endl;
else
cout << "No" << endl;
} |
#include<bits/stdc++.h>
using namespace std;
#define F first
#define se second
#define pb push_back
#define SZ(x) x.size()
#define all(v) ... | #include <bits/stdc++.h>
using namespace std ;
#define ios ios_base::sync_with_stdio(0);cin.tie(nullptr);cout.tie(nullptr)
#define f first
#define s second
#define endl '\n'
typedef long long int ll ;
void solve() {
int n ;
cin >> n ;
pair <double , double> xy[n] ;
for (int i = 0 ; i < n ; i++) cin >... |
#include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
// using namespace atcoder;
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl;
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 998244353;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
ll a, b, c;
cin >> a >> b >> c;
a = (a * (a + 1) / 2) % mod;
b = (b * (b + 1) / 2) % mod;
c = (c * (c + 1) / 2) % mod;
cout << (((a... |
#include <bits/stdc++.h>
//#include <atcoder/all>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i)
#define pb push_back
#define eb emplac... | //#pragma GCC optimize ("O2")
//#pragma GCC target ("avx2")
#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cos... |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define po pop_front
#define mo(o) memset(o,-1,sizeof(o))
#define forn(i,n) for(int i=0;i<n;i++)
#define fore(i,n) for(int i=1;i<=n;i++)
#define mp make_pair
#define ll long long
#define itn int
int main()
{
int n;
cin>>n;
if(n%2) cout<<"Black"<<endl;... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
if (N % 2 == 0){
cout << "White";
} else{
cout << "Black";
}
return 0;
} |
//#include<math.h>
#include<algorithm>
#include<stdlib.h>
#include<time.h>
#include<stdio.h>
#include<string.h>
#define un unsigned
#define srd srand(time(0))
#define ll long long
#define con continue
#define gtc getchar()
#define ptc putchar
#define dou double
#define eps 0.00000000001
#define opr operator
#define cl(... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;++i)
#define all(x) (x).begin(),(x).end()
using namespace std;
constexpr int INF = 1e9, MOD = 1e9 + 7;
constexpr int64_t LINF = 5e18, LMOD = 998244353;
// #include <atcoder/all>
// using namespace atcoder;
// const int dy[]={0,-1,0,1,1,-1,-1,1};
// const int dx[... |
#pragma GCC optimize("Ofast")
#pragma GCC target ("sse4")
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#inc... | #include<bits/stdc++.h>
using namespace std;
#define il inline
#define ri register int
#define ll long long
#define ui unsigned int
il ll read(){
bool f=true;ll x=0;
register char ch=getchar();
while(ch<'0'||ch>'9') {if(ch=='-') f=false;ch=getchar();}
while(ch>='0'&&ch<='9') x=(x<<3)+(x<<1)+(ch^48),ch=g... |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define int long long
using namespace std;
#define endl '\n'
#define br cout<<endl
#define mem(a) memset(a,0,sizeof(a))
const double pi=3.141592653589793238;
#define d(x) cout<<x<<endl;
#define de(x) cout<<#x<<" "<<x<<endl;
#define pb push_back
#define mp make_pair
#d... | #include <iostream>
#include <vector>
#include <functional>
#include <string>
using namespace std;
string naive(int N, vector<long long> a)
{
vector<bool> U(N);
vector<long long> T;
function<int(int)> f = [&](int t) -> int
{
bool remain = false;
bool win = false;
for (int i=0; ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define repp(i,n) for(int i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define vvi vector<vector<int> >
const ll mod=998244353;
int n,m=1;
bool A(int i,int j){
int x=i&j,cnt=0;
do if(x&1)cnt++;
while(... | #include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
# define rep(i,a,b) for(int i=(a); i<=(b); ++i)
inline int readint(){
int a = 0; char c = getchar(), f = 1;
for(; c<'0'||c>'9'; c=getchar())
if(c == '-') f = -f;
for(; '0'<=c&&c<='9'; c=getchar())
a = (a<<3)+(a<<1)... |
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define fo(i,n) for(ll i=0;i<n;i++)
#define fo1(i,n) for(ll i=1;i<=n;i++)
#define loop(i,a,b)for(ll i=a;i<=b;i++)
#define loopr(i,a,b)for(ll i=b;i>=a;i--)
#define all(x... | #include <iostream>
#include <cmath>
using namespace std;
int main()
{
int A, B, C;
cin >> A >> B >> C;
bool signFlag1 = (C % 2 == 1) && (A < 0);
bool signFlag2 = (C % 2 == 1) && (B < 0);
char ans;
if (signFlag1 != signFlag2) {
ans = (signFlag1 ? '<' : '>');
}
else {
if (abs(A) == abs(B)) {
ans = '='... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define ull unsigned long long
typedef vector<int> VI;
typedef vector<ll> VLL ;
typedef vector<ull> VULL;
typedef map<int,int> MPII;
typedef set<int> SETI;
typedef multiset<int> MSETI;
typedef pair<int,int> PII ;
#define PI 3.141592653589793238
#d... | /**
* @author: adityasonani
* */
#include <bits/stdc++.h>
// #pragma GCC optimize("Ofast")
// #pragma GCC target("avx,avx2,fma")
#define int long long
#define ld long double
#define ln "\n"
#define fastio ios_base::sync_with_stdio(0); cin.tie(nullptr)
#define MOD ... |
#include <bits/stdc++.h>
using namespace std;
long long INF = 1000000000000000000;
template<const int MOD> struct modint{
long long val;
modint(): val(0) {}
modint(long long x){
if(x < 0) val = x % MOD + MOD;
else val = x % MOD;
}
modint(const modint &t){
val = t.val;
}
... | #include <bits/stdc++.h>
using namespace std;
#define INF 0x3f3f3f3f
#define gcd __gcd
#define FOR(i, a, b) for (int i = a; i <= (b); i++)
#define ROF(i, a, b) for (int i = a; i >= (b); i--)
#define pb(x) push_back(x)
#define ALL(x) x.begin(), x.end()
#define RALL(x) x.rbegin(), x.rend()
#define sz(x) ((int)x.size())
#... |
/* Great things never come from comfort zones,
"whatever the mind of a man can conceive and believe,it can achieve." */
#include <bits/stdc++.h>
using namespace std;
void my_dbg() { cout << endl; }
template<typename Arg, typename... Args> void my_dbg(Arg A, Args... B)
{ cout << ' ' ... | // ABC187 - A
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<stack>
#include<algorithm>
#include<iostream>
#include<cmath>
#include<vector>
#include<queue>
using namespace std;
int calcSum(int num)
{
int sum = 0, count = 0;;
int divide[3] = {100, 10, 1};
while(num != 0)
{
sum += num / divide[cou... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll t[100][100] ; ll RAM ;
ll k ;
void printArr(ll a[], ll n)
{
vector <ll> ye ;
ye.push_back(1);
for (ll i = 0; i < n; i++)
{ye.push_back(a[i]);
// cout << a[i] << " ";
}
ye.push_back(1);
//printf("\n");
ll cost = 0 ;
ll p = ye.si... | #include<bits/stdc++.h>
using ll = long long;
using ull = unsigned long long;
using namespace std;
constexpr int inf = 1<<30;
constexpr int mo = 1e9+7;
constexpr ll infl = 1ll<<60;
int main(){
cin.tie(nullptr);
std::ios::sync_with_stdio(false);
int n,k;
cin>>n>>k;
vector<vector<int>> t(n,vec... |
#include<bits/stdc++.h>
using namespace std;
#define lli long long int
#define lld long double
#define ul unsigned long int
#define pii pair<int,int>
#define pll pair<lli, lli>
#define vi vector<int>
#define vii vector<pair<int,int>>
#define vll vector<lli>
#define pb push_back
#define mpr make_pair
#define ss sec... | #include <bits/stdc++.h>
#define int long long
#define menhera_chan_is_mine ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define pb push_back
#define pi pair<int, int>
#define BE(i) i.begin(),i.end()
#define fi first
#define se second
#define INF 2147483647
#define mkp make_pair
#define ist insert
#define mod 10... |
#include <iostream>
#include <vector>
using namespace std;
const int MAX_N = 105;
const int MAX_M = 1e4 + 5;
#define u first
#define v second
pair<int, int> edges [MAX_M];
int dir [MAX_M];
vector<int> adj [MAX_N]; // idx of the edge
int arr [MAX_N];
int vis [MAX_N];
void direct (int u) {
vis[u] = 1;
for (int ... | #include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
using ld = long double;
using vld = vector<ld>;
using vb = vector<bool>;
#define rep(i, n) for ... |
#include <iostream>
#include <vector>
#include <unordered_set>
#include <string>
#include <algorithm>
#include <cstdio>
using namespace std;
int main(void) {
int t, n;
string s1, s2, s3;
cout << fixed;
cin >> t;
for (int i = 0; i < t; i++) {
cin >> n;
cin >> s1 >> s2 >> s3;
... | #include<bits/stdc++.h>
using namespace std;
long long n,m,mx=-1e9,a[1000010],i,j,k,l=-1,s,t,p;
int main(){
cin>>n>>m;
for(i=1;i<=n;i++){
cin>>s>>t>>p;
a[s+1]+=p;
a[t+1]=a[t+1]-p;
l=max(l,t);
}
for(i=1;i<=l;i++){
a[i]+=a[i-1];
mx=max(a[i],mx);
}
if(mx>m) cout<<"No";
else cout<<"Yes";
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
typedef unsigned long long ull;
#define loop(i,a,b) for(ll i=a;i<b;i++)
#define f(i,a,b) for(ll i=a;i<=b;i++)
#define testcases ll t;cin>>t;while(t--)
#define dec(x) greater<x>()
/*** Define fues ***/
#define mx 200005
#define mod... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(9);
int n;
cin >> n;
vector<int> x(n);
for (auto &i : x) cin >> i, i = abs(i);
long long M = 0;
for (auto i : x) M += i;
double E = 0;
for (auto i : x) E += 1LL * i * i;
E ... |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
//#i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vb = vector<bool>;
using vi = vector<int>;
using vll = vector<long long>;
using pll = pair<long long, long long>;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
constexpr long long mod = 1000000007;
#define rep(i, n) for (ll i = 0; i <... |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define ll int64_t
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<=n;i++)
#define all(V) V.begin(),V.end()
#define PI 3.14159265359
#define fi fixed
#define se setprecision(10)
using namespace std;
int main() {
ll s,p;cin >> s >> p;
for(ll i=1;i... | #include<bits/stdc++.h>
using namespace std;
int main()
{
long long int i,s,p,j;
cin>>s>>p;
for(i=1;;i++){
if(i*(s-i)==p){
cout<<"Yes\n";
return 0;
}
if(i*(s-i)>p){break;}
}
cout<<"No\n";
}
|
//50以内的质数有15个，所以我们穷举Y有哪些质因子，然后求出Y（注意要用long long）再一个个判断是不是互质，直接验证就行，与A题思路相似
#include <iostream>
#include<cmath>
#include<algorithm>
#include<vector>
using namespace std;
#define maxx 100
#define ll long long
int ans[maxx];
int prime[maxx];
int a[maxx];
vector<ll > p;
int in=0;
bool cmop(ll a,ll b){
return a>b;
}
ll ... | // Author: Vinay Khilwani
// Language: C++
// @vok8: Codeforces, AtCoder, LeetCode, HackerEarth, TopCoder, Google, FB, CSES, Spoj, GitHub
// @vok_8: CodeChef, GFG
// @vok8_khilwani: HackerRank
// Never Stop Trying.
// Trying to be Better than Myself.
// while(true)
// {
// if(AC)
// {
// break;
// ... |
#include <bits/stdc++.h>
using namespace std;
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>::value, typename T_container::valu... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
const int N = 1500005;
ll getgcd(ll x,ll y) {return (y==0) ? x : getgcd(y,x%y);}
int a[N],n,ans;
map <int,int> mp;
void ins(int x,int t)
{
if (!mp[x]) mp[x]=t;
else mp[x]=getgcd(mp[x],t);
}
int main()
{
cin>>n; for (int... |
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define REP(i, n) FOR(i,0,n)
// Z algorithm (... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define SORT(c) sort((c).begin(), (c).end())
#define REVERSE(v) reverse((v).begin(), (v).end())
#define ANS(ans) cout << (ans) << endl;
#define UNIQUE(v) (v).erase(unique((v).begin(), (v).end()), (v).end());
typedef vector<int> VI;
typedef pair<int, i... |
#include<iostream>
using namespace std;
int main(){
int N,ans=0,q;
cin>>N;
for(int i=0;i<N;i++){
cin>>q;
if(q<=10)ans+=0;
else ans+= q-10;
}
cout<<ans<<endl;
} | // // Created by ...Rahul Chandra
// #include <bits/stdc++.h>
// #define db1(x) cout<<#x<<"="<<x<<'\n'
// #define db2(x,y) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<'\n'
// #define db3(x,y,z) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<","<<#z<<"="<<z<<'\n'
// #define rep(i,n) for(int i=0;i<(n);++i)
// #define repA(i,a,n) for(int i=a... |
#include <bits/stdc++.h>
#define FAST_IO ios::sync_with_stdio(false); cin.tie(0), cout << setprecision(15);
#define ll long long int
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rrep(i, k, n) for (ll i = k; i>=n; i--)
#define repp(i, k, n) for (ll i = k; i < (n); i++)
#define pb push_back
#define all(x) begi... | #include <bits/stdc++.h>
// #include <atcoder/all>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for(int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
// using namespace atcoder;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}e... |
#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define ll long long int
#define ld long double
#define pb push_back
#define fi first
#define se second
#define all(x) x.begin(),x.end()
#define mem(x,y) memset(x,y,sizeof(x))
#define pii pair<int,int>
#define pll... | #pragma GCC optimize(2)
#pragma GCC optimize(3,"Ofast","inline")
#include <bits/stdc++.h>
#define inf 0x7fffffff
#define ll long long
//#define int long long
//#define double long double
#define eps 1e-8
//#define mod 1e9+7
#define ls(p) p<<1
#define rs(p) p<<1|1
#define pi acos(-1.0)
using namespace std;
const int mod... |
#include <bits/stdc++.h>
using namespace std;
#define range(i, l, r) for (int i = (int)(l); i < (int)(r); (i) += 1)
#define rrange(i, l, r) for (int i = (int)(r)-1; i >= (int)(l); (i) -= 1)
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) { a = (a > b ? a : b); }
template <typename T1, typename T2> in... | #include <bitset>
#include <iostream>
#include <iomanip>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <valarray>
// alias, using declaration
using llint = long long; using ldouble = long double;
template <class T = llint> using vector = st... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
using pl = pair<ll, ll>;
const ll INF = ll(1e18);
const ll mod = ll(998244353);
const double pi = acos(-1);
#define rep0(i,n) for(ll (i) = 0; (i) < (n); ++(i))
#define rrep0(i,n) for(ll (i) = (n) - 1; (i) ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (long long i = 0; i < (n); ++i)
#define DIV 1000000007 //10^9+7
#define INF LONG_MAX/3
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<... |
#include<bits/stdc++.h>
using namespace std;
int main() {
int n, w;
cin >> n >> w;
cout << n / w;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define pb push_back
#define ll long long
#define ld long double
#define sz(x) (ll)x.size()
#... |
#include <bits/stdc++.h>
#define MP make_pair
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++ i)
#define rep1(i, n) for (int i = 1; i <= (int)(n); ++ i)
#define foreach(itr, c) for (__typeof((c).begin()) itr = (c).begin(); itr != (c).end(); ++ itr)
typedef long long LL;
typedef pair<int, int> ... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define str to_string
#define endl "\n"
#define PI 3.141592653589
using namespace std;
using lint = long long;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v)
{o<<"{";for(int i=0;i<(int)v.size()... |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
int main() {
long long N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) cin >> A[i];
sort(A.begin(), A.end());
long long ans = 0;
long long start = 0, end = 1;
while (end < N) {
if (A[start] != A[end]) ... | #include <bits/stdc++.h>
#include <vector>
#include <set>
#include <map>
#include <string>
#include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
using namespace std;
#define pq_max priority_queue<ll>
#define pq_min priority_queue<ll,vi,greater<ll>>
#define iint int
#define f(i,a,b) ... |
//#include <tourist>
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18);
const int MOD = 1000000007;
const int dx[4] = {0,... | #include<iostream>
using namespace std;
int main()
{
int n,day;
cin>>n;
day=1;
day=day+n;
if(day%2==1)cout<<"White";
else cout<<"Black";
return 0;
} |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pii pair<int,int>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define endl '\n'
#define ios ios_base::sync_with_st... | #include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
using ll=long long;
using ld=long double;
using pll=pair<ll, ll>;
//using mint = modint1000000007;
#define rep(i,n) for (ll i=0; i<n; ++i)
#define all(c) begin(c),end(c)
#define PI acos(-1)
#define oo 2e18
template<typenam... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned ll;
using ld = long double;
using pi = pair<int, int>;
using pii = pair<ll, ll>;
using vi = vector<int>;
using vii = vector<ll>;
using vip = vector<pair<int, int>>;
const int MAX_N = 1e5 + 1;
const ll mod = 1e9 + 7;
const ll ... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
int ans=0;
cin>>n;
int A[n];
for(int i=0;i<n;i++)
{
cin>>A[i];
if(A[i]>10)
{
ans+=(A[i]-10);
}
}
cout<<ans;
r... |
#include <bits/stdc++.h>
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using namespace std;
using Graph = vector<vector<int>>;
using vst= vector<string>;
using vin= vector<int>;
using ll=long long;
using ull=unsigned long long;
using vll= vector<ll>;
using P=pair<int ,... | #include<bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A*A + B*B < C*C) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} |
#include <iostream>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
cout << ((y % x == 0)?"Yes":"No");
return 0;
} | #include<bits/stdc++.h>
#include<cstdio>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef pair<int,int> pair;
#define MOD 1000000007
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int main(void){
int m,h;
cin >> m >> h;
if(h%m==0) puts("Yes");
else puts("No")... |
#pragma GCC optimize("Ofast")
#include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <algorithm>
#include <iomanip>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
using namespace std;
#define REP(i,n) for(ll (i) = (0);(i) < (n);++i)
... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vc = vector<char>;
using vvl = vector<vl>;
using vvc = vector<vc>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for(ll i = (ll)(m); i < (ll)(n); ... |
// 4 minuts
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define REP(NAME, NUM) for (int NAME = 0; NAME < int(NUM); ++NAME)
#define BREP(NAME, NUM) for (int NAME = (NUM)-1; NAME >= 0; --NAME)
#define ALL(NAME) (NAME).begin(), (NAME).end()
... | #include <iostream>
using namespace std;
int main()
{
int n,k;
long long res=0;
cin>>n>>k;
for (int i=1;i<=n;i++)
for (int j=1;j<=k;j++)
{
res+=100*i+j;
}
cout<<res;
return 0;
}
|
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main() {
int N;
long K;
cin >> N;
cin >> K;
vector<vector<long> > t(N,vector<long>(N,0));
for(int i = 0;i < N; ++i) {
for (int j = 0;j < N; ++j) {
cin >> t[i][j];
}
}
vector<int> city(N-1,0);
f... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,x; cin>>n>>x;
int al=0;
for(int i=1;i<n+1;++i){
int v,p; cin>>v>>p;
al+=v*p;
if(al>100*x){
cout<<i<<endl;
return 0;
}
}
cout<<-1<<endl;
return 0;
} |
#pragma region header
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n)for(int i=0;i<(n);i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define int ll
#define each(i, a) for (auto &&i : (a))
using ll = long long;
using ld = long double;
using vi = v... | #include<bits/stdc++.h>
using namespace std;
int main(){
int a, b, c; cin >> a >> b >> c;
if((a+b==2*c)||(a+c == 2*b)||(b+c==2*a)){
cout << "Yes" << endl;
}
else cout << "No"<< endl;
}
|
#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <algorithm>
#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
using namespace std;
typedef long long LL;
typede... | #include<iostream>
using namespace std;
typedef long long ll;
const int MOD = 998244353;
ll dp[5010];
ll f[5010];
int n , m;
ll Q_power(ll a,ll b){
ll res = 1;
while(b){
if(b & 1) res = res * a % MOD;
b >>= 1;
a = a * a % MOD;
}
return res;
}
ll X_1(ll a){ return Q_power(a ,... |
#include<bits/stdc++.h>
#include<tuple>
typedef long long ll;
#define INF 99999999999999
#define mod 1000000007
#define eps 1e-9
using namespace std;
typedef pair<ll,ll>du;
ll n,x,c,y,l=0,r=0;
long double ans;
int main(){
ios::sync_with_stdio(0);
cin>>n;
for(ll i=1;i<n;i++)
ans+=(long double)n/(n-i)... | #include "bits/stdc++.h"
#define in std::cin
#define out std::cout
#define rep(i,N) for(LL i=0;i<N;++i)
typedef long long int LL;
int main()
{
LL N;
in >> N;
LL ans = N;
std::map<LL, LL>flag;
for (LL a = 2; a * a <= N; ++a)
{
if (flag[a] == 1) continue;
LL m = a * a;
do
{
--ans;
flag[m] = 1;
m ... |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll p=998244353;
ll n,k,b[200010][301],c[302][302],a[200010],sum[302];
ll ksm(ll x,ll y){
ll sej=1;
while(y){
if(y&1)sej=sej*x%p;
x=x*x%p;
y/=2;
}
return sej;
}
int main(){
ll i,j,x,y,xlh;
scanf("%lld%lld",&n,&k);
for(i=0;i<=k;i++)c[i][... | #pragma GCC optimize ("Ofast")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i=(a); i<(b); i++)
#define FORD(i, a, b) for (int i=(a); i>(b); i--)
#define PPC(x) __builtin_popcount(x)
#define MSB(x) (63 - __builtin_clzll(x))
#define SZ(x) ((int)(x).size())
#define pb push_back
#define ... |
#include<bits/stdc++.h>
#define re register
using namespace std;
inline int read(){
re int t=0;re char v=getchar();
while(v<'0')v=getchar();
while(v>='0')t=(t<<3)+(t<<1)+v-48,v=getchar();
return t;
}
const int M=998244353;
inline void add(re int &x,re int y){
(x+=y)>=M?x-=M:x;
}
int n,m,ans,a,b,c,d;
int main(){
a... | /*
* @author: codancer
* @createTime: 2021-01-30, 20:01:13
*/
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include ... |
#include <iostream>
using namespace std;
void sol(int m, int h){
if(h%m==0)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
}
int main() {
int m,h;
cin>>m>>h;
sol(m, h);
return 0;
} | #include<bits/stdc++.h>
//#include <atcoder/all>
#define rep(i,n)for(int i=0;(i)<(int)(n);i++)
#define REP(i,a,b)for(int i=(int)(a);(i)<=(int)(b);i++)
#define ALL(a) (a).begin(),(a).end()
#define pb push_back
#define fi first
#define se second
#define sz(x) ((int)x.size())
using namespace std;
//using namespace atc... |
#include <bits/stdc++.h>
#include <cstring>
using namespace std;
typedef long long ll;
#define F0R(i, x, y) for (int i = x; i < y; i++)
#define FOR(i, n) F0R(i, 0, n)
#define F0RD(i, x, y) for (int i = y - 1; i >= x; i--)
#define FORD(i, n) F0RD(i, 0, n)
#define F first
#define S second
int mp(int x, int c) {
... | #include<bits/stdc++.h>
using namespace std;
int n,m,fa[2005],t1[2005],t2[2005],s1,s2;
char a[1005][1005];
int find(int x){
if (x==fa[x]) return x;
else return fa[x]=find(fa[x]);
}
void Union(int x,int y){
fa[find(x)]=find(y);
}
int main(){
scanf("%d%d",&n,&m);
for (int i=1;i<=n+m;i++) fa[i]=i;
for (int i=1;i<=n;... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
string solve(ll n, ll w, vector<ll> s, vector<ll> t, vector<ll> p) {
vector<ll> a(2 * pow(10, 5) + 1, 0);
for(ll i = 0; i < n; i++) {
a[s[i]] += p[i];
a[t[i]] -= p[i];
}
if(a[0] > w) {
return "No";
}
fo... | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<string> vs;
typedef long long int ll;
typedef unsigned long long int ull;
typedef pair<int, int> pii;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef ve... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
char s,t;
cin>>s>>t;
if(s == 'Y')
{
if(t == 'a'|| t == 'A')
cout<<'A';
else if(t == 'b'|| t == 'B')
cout<<'B';
else if(t == 'c'|| t == 'C')
cout<<'C';
}
else if(s == 'N')
{
cout<<t;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O0")
typedef long long int ll;
typedef long double ld;
const ll mod = 1e9+7;
const ll INF = 1e18;
#define rep(i,n) for (ll i = 0; i < (n); ++i)
#define Rep(i,a,n) for (ll i = (a); i < (n); ++i)
#define All(a) (a).begin(),(a).end()
#define Pi acos(-1)
u... |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); ++i)
#define sz(x) int(x.size())
#define show(x) {for(auto i:x){cout << i << " ";} cout << endl;}
#define isin(x,l,r) ((l)<=(x) && (x)<(r))
using namespace std;
using ll=long long;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
template<typename T>bool chm... | #include<bits/stdc++.h>
#define ll long long int
#define mk make_pair
#define pb push_back
#define INF (ll)1e18
#define pii pair<ll,ll>
#define mod 1000000007 //998244353
#define f(i,a,b) for(ll i=a;i<b;i++)
#define fb(i,a,b) for(ll i=a;i>b;i--)
#define ff first
#define ss second
#define srt(v) if(!v.empty())sort(v.be... |
/*
* author : rits1272
*/
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define print(x) cerr << "[" << #x << ": " << x << "]";
#define println(x) cerr << "[" << #x << ": " << x << "]\n";
#define show(v) for(int i = 0; i < (int)v.size(); i++) cout << v[i] << (i == (int)v.size()-1 ? "\n" : " ");... | #include <bits/stdc++.h>
template <class T>
T read() {
T num = 0;
T f = 1;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-') f = -1;
ch = getchar();
}
while (isdigit(ch)) {
num = num * 10 + ch - '0';
ch = getchar();
}
return num * f;
}
constexpr int N = 1e5 + 7;
std::vector<st... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int T,ans,m;
string S;
string S0;
cin >> T ;
S0="atcoder";
rep(k,T) {
cin >> S;
ans=-1;
rep(i,S.size()){
if ('a'!=S.at(i)){
ans=i;
break;
}
}
if (ans<=0){
cout << ans <... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define T \
int t; \
cin >> t; \
while (t--)
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define PI 3.141592653589793238462643383
#define pb push_back
#define all(s) s.begin(),... |
using namespace std;
#include <bits/stdc++.h>
#define N 105
#define INF 1000000000
int n;
char str[N];
int a[N],b[N],c[N];
int main(){
scanf("%d%s",&n,str+1);
for (int i=0;i<=n;++i)
scanf("%d",&a[i]);
int k=INF;
for (int i=1;i<=n;++i)
if (str[i]=='<')
k=min(k,a[i]-a[i-1]);
else
k=min(k,a[i-1]-a[i]);
// ... | //IQ134高知能系Vtuberの高井茅乃です。
//Twitter: https://twitter.com/takaichino
//YouTube: https://www.youtube.com/channel/UCTOxnI3eOI_o1HRgzq-LEZw
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF INT_MAX
#define LLINF LLONG_MAX
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(... |
//
// Created by bytedance on 2020/4/10.
//
#include <bits/stdc++.h>
//#include <fstream>
using namespace std;
const int maxn = 1e5 + 5;
int a[maxn], b[maxn];
vector<int> even, odd;
int main() {
int n;
scanf("%d", &n);
long long sum = 0;
for (int i = 0; i < n; i++) {
scanf("%d", a + i);
... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
// Acknowledgement: Special thanks to kyomukyomupurin, who developed this
// template.
template <class T, class U>
std::os... |
/*
author: l_a_k_s_h_g
*/
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define f(a,b) for(ll i=a;i<b;i++)
#define mod 1000000007
#define inf 1e9 + 1
#define all(x) (x).begin(),(x).end()
#define prDouble(x,dec) cout << fixed << setprecision(dec) << x
#define triplet pair<ll,pair<ll,ll> ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,a,b) for(ll i=a;i<b;++i)
#define rrep(i,a,b) for(ll i=a;i>b;--i)
#define FOR(i,n) for(ll i=0;i<n;i++)
#define vi vector<int>
#define vl vector<ll>
#define ld long double
#define vld vector<ld>
#define vvi vector<vector<int>>
#def... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const double PI = 4*atan(1);
const int INF = 0x3f3f3f3f;
const int MOD = 1e9+7;
const ll LINF = 0x3f3f3f3f3f3f3f3f;
const double EPS = 1e-9;
const string YES = "Possible";
const string NO = "Impossible";
#define pb push_... | #include<bits/stdc++.h>
#define inf 0x3f3f3f3f3f3f3f3fll
typedef unsigned long long ull;
typedef long long ll;
#define rep(i,l,r) for(int i=l;i<=r;i++)
#define nep(i,r,l) for(int i=r;i>=l;i--)
void sc(int &x){scanf("%d",&x);}
void sc(int &x,int &y){scanf("%d%d",&x,&y);}
void sc(int &x,int &y,int &z){scanf("%d%d%d",&x,&... |
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define mod 998244353
#define INF 998244353
#define ull unsigned long long
#define pb push_back
#define endl '\n'
#define pi acos(-1)
#define pii pair<ll int,ll int>
#define all(a) ... | // dont stop until you reach there
#include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define int long long
#define rep(i,j,k) for(int i=j;i<k;i+=1)
#define rrep(i,j,k) for(int i=n-1;i>=0;i-=1)
#define sorti(v) sort(v.begin(),v.end())
#define sortd(v) sort(v.begin(),v.end(),greater<int>())
#define mm map<... |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define m_p make_pair
#define sz(x) (int)x.size()
#define line cerr<<"-----------------... | #include<cstdio>
#include<cstring>
#define fo(x,a,b) for(int x=(a),_e=(b);x<=_e;x++)
#define fd(x,a,b) for(int x=(a),_e=(b);x>=_e;x--)
#define inc(a,b) (a=a+b-(a+b>=mo?mo:0))
#define ww printf
#define min(a,b) ((a)<(b)?(a):(b))
const int N=550006;
int f[101][N],top[101],n,ti,mo;
int main(){
scanf("%d %d %d",&n,&ti,&m... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define rep(i,a,b,c) for(ll i=(a);i<=(b);i+=(c))
#define repb(i,a,b,c) for(ll i=(a);i>=(b);i-=(c))
#define MOD 1000000007
#define inf ... | #include<bits/stdc++.h>
using namespace::std;
int n;
long long k;
long long C(long long x){
return x * (x + 1) / 2;
}
long long f(long long x){
long long ans = 0;
for(int i = 1; i <= n; i++){
long long a = x - i;
if(a < 2) continue;
long long lim = min(1ll * n, a - 1);
long long lim1 = min(1ll * n, (a + 1... |
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <optional>
#include <queue>
#include <random>
#includ... | #include <cmath>
#include <cstdio>
#include <cctype>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#define N 807
using namespace std;
typedef long long ll;
inline int rd() {
int x = 0;
bool f = 0;
char c = getchar();
for (; !isdigit(c); c = getchar()) f |= (c == '-');
... |
#include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <algorithm>
#include <iomanip>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
using namespace std;
#define REP(i,n) for(ll (i) = (0);(i) < (n);++i)
#define REV(i,n) for(ll (i) = (... | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#def... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.