code_file1 stringlengths 87 4k | code_file2 stringlengths 85 4k |
|---|---|
//#define _GLIBCXX_DEBUG
#include <iostream>
#include <time.h>
#include <fstream>
#include <iomanip>
#include <cmath>
#include <vector>
#include <algorithm>
#include <functional>
#include <random>
#include <string>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <bits/stdc++.h>
#include <deque... | #include<bits/stdc++.h>
#define REP(i,b,e) for(int i=b;i<e;i++)
std::vector<std::vector<int>> scc_decompose(
std::vector<std::vector<int>> &links,
std::vector<std::vector<int>> &rlinks
){
int n = links.size();
int cnt = 0;
std::vector<int> order;
std::vector<bool> visited(n, false);
std::function<void(int)> ... |
#include <iostream>
#include<string>
#include<vector>
using namespace std;
int cnt[100001];//色の有無を表す配列
int C[100001];
bool check[100001];
vector<vector<int> > E(100001);
void dfs(int n, int bef){
if(cnt[C[n]]==0){
check[n]=true;
}
cnt[C[n]]++;
for(int i=0; i<E[n].size(); i++){
if(E[n]... | #pragma GCC optimize("Ofast", "unroll-loops")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
constexpr ll INF = (1LL << 60);
struct func{
ll base, m, M;
func() : base(0), m(-INF), M(INF) {}
ll value(ll x){
ll tmp = x + base;
tmp = max(m, tmp);
tmp = min(M, tmp)... |
//#pragma GCC optimize ("O3")
//#pragma GCC target ("sse4")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC target("avx,avx2,fma")
#include <algorithm>
#include <array>
#include <cassert>
//#include <chrono>
#include <cmath>
//#include <cstring>
//#include <functional>
//#incl... | //#pragma GCC optimize ("Ofast")
//#pragma GCC target("avx2")
//#pragma GCC optimize("unroll-loops")
//#include <x86intrin.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
#define PI 3.141592653589793L
#define FAST ios::sync_with_stdio(false); cin.tie(NULL);... |
#include <bits/stdc++.h>
#define FOR(i, m, n) for (ll i = m; i < (n); i++)
#define RFOR(i, m, n) for (ll i = (m - 1); i >= 0; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, n, 0)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
//#define print(ele) cout << (ele) << "\n"
#define pri... | #include<iostream>
using namespace std;
int main()
{
int N;
while(cin>>N)
{
if(N%2==0)cout<<"White"<<endl;
else if(N%2==1) cout<<"Black"<<endl;
}
return 0;
} |
/*
*Team hhu_6814
*Author big_yellow_doge
*/
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <string>
#include <string.h>
#include <queue>
#include <map>
#include <stack>
#include <vector>
#include <set>
#include <list>
using namespace std;
//ios::sync_with_stdio(false);
const in... | #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() {
int n;
cin >> n;
int a = floor(1.08 * n);
if (a < 206) cout << "Yay!" << endl;
if (a == 206) cout << "so-so" << endl;
if (a > 206) cout << "... |
#include<bits/stdc++.h>
using namespace std;
//typedef long long int lld;
using lld=long long int;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
lld n,ans=0;
cin>>n;
lld a[n];
map<lld,lld>m;
for(int i=0;i<n;i++){
cin>>a[i];
m[a[i]%200]++;
}
for(auto i:m)
ans+=((i.secon... | #include <bits/stdc++.h>
int ri() {
int n;
scanf("%d", &n);
return n;
}
#define MOD 1000000007
int mpow(int a, int b) {
int res = 1;
for (; b; b >>= 1) {
if (b & 1) res = (int64_t) res * a % MOD;
a = (int64_t) a * a % MOD;
}
return res;
}
#ifdef WIN32
#define getchar_fast getchar
#else
#define getchar_fa... |
#include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ep emplace
#define epb emplace_back
#define scll static_cast<long long>
#define sz(x) static_cast<int>((x).size())
#define pfll(x) printf("%lld\n", x)
#define c... | #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... |
#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() {
vector<int> v(4);
rep(i, 4) cin >> v[i];
ll total = 0;
rep(i, 4) total += v[i];
for (int bit = 0; bit < (1 << 4); ++bit) {
ll sum_bit =... | #include<bits/stdc++.h>
#define fast ios::sync_with_stdio(false); cin.tie(NULL);
#define int long long
#define f first
#define s second
#define endl "\n"
//#define m 1000000007
#define out(v,n) for(int i=0;i<n;i++) cout<<v[i]<<" "; cout<<endl;
using namespace std;
signed main(){
//freopen("input.txt","r",stdin);... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
const ll INF = ll(1e18) + 5;
string atcoder = "atcoder";
void solve() {
string S;
cin >> S;
if (S > atcoder) {
cout << 0 << endl;
return;
}
string revS = S;
sort(r... | #include<bits/stdc++.h>
#define ll long long int
using namespace std;
ll n,low,high,mid,x,z,a;
void solve(ll the)
{
ll i,j,k,b,c,d,m,l,r,sum=0,ans=0,temp,t;
scanf("%lld",&n);a=n+1;
low=0;high=sqrt((8*a)+1)-1;high/=2;
while(low<=high){
mid=low+(high-low)/2;
x=1;
if(mid&1){
x=(mid+1)/... |
#include<iostream>
#include<vector>
#include<string>
#include<set>
#define rep(i, start, end) for (int i = (int)start; i < (int)end; ++i)
#define rrep(i, start, end) for (int i = (int)start - 1; i >= (int)end; --i)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
template<typename T> inl... | #include <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <iomanip>
#include <stdlib.h>
#include <string.h>
#include <cmath>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <set>
#include <stdio.h>
using namespace std;
using... |
//GIVE ME AC!!!!!!!!!!!!!!!!!
//#pragma GCC target("avx")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define floatset() fixed<<setprecision(15)
#define all(n) n.begin(),n.end()
#define rall(n) n.rbegin(),n.rend()
#define rep(i,... | #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
#include<set>
#include<tuple>
#include<array>
#include<map>
#include<memory>
int main()
{
int64_t N;
std::cin >> N;
std::vector<int64_t> A(N);
for (int64_t n = 0; n < N; ++n)
{
int64_t a;
std::... |
#include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define pb push_back
#define int long long int
#define ll long long
#define vi vector<int>
#define vll vector<ll>
#define vvi vector < vi >
#define pii pair<int,int>
#define pll pair<long long, long long>
#define F first
#define S second
#define mod 1000000... | #include <bits/stdc++.h>
using namespace std;
int main(){
vector<int> A(4);
for(int i=0;i<4;i++) cin >> A[i];
int ans = 99999;
for(int i=0;i<4;i++){
ans = min(ans,A[i]);
}
cout << ans << endl;
return 0;
} |
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2")
#pragma comment(linker, "/stack:200000000")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define pb push_... | #pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("fast-math")
#pragma GCC optimize("trapv")
#pragma GCC target("sse4")
#include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> pi;
typedef pair<long ... |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
//input
int N;
cin >> N;
string name[N];
int height[N];
vector<int> height_checker(N);
for(int i = 0; i < N; i++){
cin >> name[i] >> height[i];
height_checker.at(i) = height[i];
}
//高さをsort
sort(height_ch... | #include <bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define input_output freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
template <typename Arg1>
void prn(Arg1&& arg1) { cout<<arg1<<"\n";}
temp... |
#include <cstdio>
typedef long long ll;
inline void in(ll &x) {
x=0;
ll f=1;
char ch=getchar();
while (ch<'0'||ch>'9') {
if (ch=='-') f=-1;
ch=getchar();
}
while (ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
x*=f;
}
inline void out(ll x) {
if (x<0) putchar('-'),x=-x;
if (x>9) out(x/10);
putchar(x%10+'0')... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N;
if(N>=0)cout<<N;
else cout<<0;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int C[3][3] = {{1,0,0}, {1,1,0}, {1,2,1}};
int Lucas(int X, int M){
int XX[20] = {};
int MM[20] = {};
int x = X; int m = M;
int ans = 1;
for(int i = 0; i < 15; i++){
XX[i] = x % 3; x /= 3;
MM[i] = m % 3; m /= 3;
ans *= C[XX[i]][MM[i]];
ans %= 3;
}
retur... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define w(x) int x; cin>>x; while(x--)
#define endl ("\n")
#define f(i, a, n) for(int i=a; i<n; i++)
#define cc(r) cout<<r<<" "
#define ce(r) cout<<r<<endl
void inout()
{
ios_base::sync_... |
#include<bits/stdc++.h>
using namespace std;
int n,m;
int main(){
cin>>n>>m;
if(n==1&&m==0)cout<<"1 2"<<endl,exit(0);
if(m<0||m>=n-1)cout<<-1,exit(0);
n--;
cout<<"1 1000001"<<endl;
for(int i=1;i<=m+1;i++)cout<<i*2<<" "<<i*2+1<<endl;
n-=m+1;
for(int i=1;i<=n;i++)cout<<1000000+i*2<<" "<<1000000+i*2+1<<endl;
ret... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include... |
#define _USE_MA_DEFINES
#include <iostream>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
#include <cstring>
#include <cmath>
#include <stack>
#include <iomanip>
#include <tuple>
#include <functional>
#include <cfloat>
#include <map>
#inc... | #include<bits/stdc++.h>
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
using namespace std;
inline int read(){
int X=0;bool flag=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')flag=0;ch=getchar();}
while(ch>='0'&&ch<='9'){X=(X<<1)+(X<<3)+ch-'0'; ch=getchar();}
if(flag)return X;... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using lint=long long;
template<class T> struct edge{
int to;
T wt;
edge(int to,const T& wt):to(to),wt(wt){}
};
template<class T> using weighted_graph=vector<vector<edge<T>>>;
template<class T>
void add_directed_edge(weighted_gr... | #include <bits/stdc++.h>
#pragma GCC optimize(2)
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<cmath>
#include<cstring>
#include<bitset>
#include<stack>
#include<time.h>
#define X first
#define Y second
#define PB push_b... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define u unsigned
#define endl '\n'
#define mod 1000000007
#define quick ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
void solve(){
ll n,k;
cin>>n>>k;
string str="";
while(k--){
if(n%200==0... | #include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <deque>
#include <complex>
#include <stack>
#include ... |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <typeinfo>
#include <unordered_set>
using namespace std;
typedef long long ll;
int main() {
int a, b,c;
cin >> a>>b>>c;
for (int i = c;;i++) {
if (a == 0 && b == 0) {
if (c == 1) {
cout << "Takahashi";
break;
}... | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
if(a==b){
if(c==0){
cout<<"Aoki";
}
else{
cout<<"Takahashi";
}
}
else if(a>b){
cout<<"Takahashi";
}
else{
cout<<"Aoki";
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std ;
int main(){
int H , W ;
cin >> H >> W ;
vector<vector<int > > A(H , vector<int> (W)) ;
for(int i= 0 ; i < H ; i++){
for(int j = 0 ; j < W ; j++){
cin >> A.at(i).at(j) ;
}
}
int cnt = A.at(0).at(0) ;
for(int i= 0 ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
typedef long long ll;
const ll INF = (1LL << 62) - (1LL << 31); /*オーバーフローしない程度に大きい数*/
const ll MOD = 1000000007;
using namespace std;
ll gcd(ll a, ll b) {
if (a % b == 0) return ... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N;
unordered_set<string> st;
bool ok = false;
string ans;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
if (st.count(s)) {
ok = true;
if (ans == "") ans = s;
}
... | /* Author : Aaryan Srivastava ^__^ */
#include <bits/stdc++.h>
#include <random>
#include <chrono>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define rep(i,n) for(int i = 0 ; i < (n) ; i++)
#define repA(... |
#include <iomanip>
#include <iostream>
using namespace std;
double dp[100][100][100];
double rec(int i, int j, int k) {
if (i == 100 || j == 100 || k == 100) return 0.0;
if (dp[i][j][k] > 0.0) return dp[i][j][k];
double n = double(i + j + k);
return dp[i][j][k] = ((rec(i + 1, j, k)) * i + (rec(i, j + 1, k)) * j... | #include<bits/stdc++.h>
#include<iostream>
#include<set>
#include<map>
#include<iterator>
#define ll long long
#define lli long long int
#define pb push_back
#define RIP(i,n) for(int i=0; i<n; i++)
#define RIP1(i,n) for(int i=n-1; i>=0; i--)
#define FOR(i,a,b) for... |
#include <bits/stdc++.h>
using namespace std;
using i64 = int_fast64_t;
void solve() {
int n, m;
cin >> n >> m;
vector<vector<int>> G(n);
while (m--) {
int a, b;
cin >> a >> b;
--a, --b;
G[a].emplace_back(b);
G[b].emplace_back(a);
}
uint32_t ans{};
for (int s = 0; s < 1 << n; s++) {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, a, b) for (auto i = (a); i < (b); ++i)
#define per(i, a, b) for (auto i = (b); i-- > (a); )
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) int((x).size())
#define lb(x...)... |
#include<bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/detail/standard_policies.hpp>
// using namespace __gnu_pbds;
#pragma GCC optimize("O3")
#ifdef LOCAL
#include "/Users/lbjlc/Desktop/coding/debug_utils.h"
#else
#define print(...) ;
#define printn(...) ;
#de... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstring>
#include <iostream>
#include <sstream>
#include <numeric>
#include <map>
#include <set>
#include <queue>
#include <vector>
using namespace std;
typedef long long LL;
typedef long double LD;
typedef pair<LL, LL> II;
typedef pair<LL, II> III;
ty... |
#include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#inc... | #include "bits/stdc++.h"
using namespace std;
#define REP(i, n) for(ll i = 0;i < n;i++)
#define ll long long
#define MOD 998244353LL
using vi = vector<ll>; // intの1次元の型に vi という別名をつける
using vvi = vector<vi>; // intの2次元の型に vvi という別名をつける
ll n,k,x,y;
//moddivとnCkとgarner
//c剰余下でaをbで割った値
ll moddiv(ll a,ll b,ll c){
ll x0=... |
/*
power code taken from geeks for geeks
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
// THINGS TO REMEMBER
// ENDL is slow, '\n' is fast
// Clear everything (including graphs) between test cases
// use anti-anti-hash: https://codeforces.com/blog/entry/62393
// pb-d... | #include<iostream>
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
const int mod=1e9+7;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
int a,b;
cin>>a>>b;
cout<<2*a+100-b<<"\n";
return 0;
}
|
#include <bits/stdc++.h>
#define pb push_back
#define vi vector<int>
#define vvi vector<vector<int>>
#define f(i,b) for(int i=0;i<b;i++)
#define int long long
using namespace std;
void solve()
{
int n;
cin>>n;
int a[n];
for(int i=0;i<n;i++)
cin>>a[i],a[i]%=200;
int ans=0;
map<int,int> m... | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define deb(a,b,c) cout<<#a<<" = "<<(a)<<", "<<#b<<" = "<<(b)<<", "<<#c<<" = "<<(c)<<endl;
typedef long long int ll;
typedef string str;
ll power(ll x, ll y, ll p)
{
ll res = 1;
x = x % p;
while (y)
... |
#include<iostream>
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define per(i,b,a) for(int i=b;i>=a;i--)
#define N 2021
using namespace std;
string map[N];
int fa[N];
int tf1[N],tf2[N];
int find(int x){
if(fa[x]==x)return x;
return fa[x]=find(fa[x]);
}
int main(){
ios::sync_with_stdio(false);
int h,w;
c... | #include <iostream>
#include <cmath>
#include <algorithm>
#include <string>
#include <map>
using namespace std;
long power_mod(long a, long b, long m)
{
int k = 0;
long c = b;
long n = 1L;
while (c >= 1)
{
c >>= 1;
++k;
}
for (int i = k; i >= 0; --i)
{
n = ((b >... |
#ifdef __LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
using PIL = pair<int,ll>;
using PLI = pair<ll,int>;
using PLL = pair<ll,ll>;
using Graph = vector<vector<int>>;
using Cost_Graph = vector<vector<PIL>>;
template<class T> bool chmin(... | #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 debug(output) if(debugFlag)cout<<#output<<"= "<<output<<endl
using lint = long long;
typedef pair<int,int> P;
const bool debugFlag=true;
const lint linf=1e18+7;
const lint inf=1e9+7;
cons... |
#include<bits/stdc++.h>
using namespace std;
const int N = 209;
int A, B, C;
double f[N][N][N];
signed main()
{
scanf("%d %d %d", &A, &B, &C);
if (A > B) swap(A, B);
if (A > C) swap(A, C);
if (B > C) swap(B, C);
if (A == 0 && B == 0) printf("%d\n", 100 - C);
else
{
f[A][B][C] = 1;
for (int i = A; i < 100;... | #include <iostream>
#include <map>
#include <tuple>
#include <algorithm>
#include <iomanip>
#include <array>
int main()
{
int A, B, C;
std::cin >> A >> B >> C;
std::array<int, 3> init_status = {A,B,C};
std::sort(init_status.begin(), init_status.end());
std::map<std::array<int,3>, double> status;
status.e... |
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
typedef long long tnum;
#define loop(i, num) for(int i = 0; i < num; i++)
tnum* tnumAlloc(int num);
tnum getNumStdin();
tnum* getNumsStdin(in... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool ch... |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
int mul (int a, int b) { return 1ll * a * b % MOD; }
int main() {
int n;
scanf("%d", &n);
vector<int> a(n);
for (int i = 0; i < n; i++) scanf("%d", &a[i]);
a.push_back(0);
sort(a.begin(), a.end());
int ans = 1;
for (int i = 1; i <= n; i++... | #include <iostream>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <string>
#include <algorithm>
#include <cmath>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rep2(i, s, n) for (ll i = s; i < (n); i++)
const ll MOD ... |
#include<iostream>
using namespace std;
int main(){
int N;
cin>>N;
if(N%2==0)
cout<<"White";
else
cout<<"Black";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
int main()
{
ios_base::sync_with_stdio(false); cin.tie(nullptr);
int N,i=1,save=0;
cin>>N;
while(save<N)
{
save=save+i;
i++;
}
cout<<i-1<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
static const ll mod=998244353;
ll N,K;
ll power[301];
ll modpow(ll a,ll n){
ll res=1;
while(0<n){
if(n%2==1)res=(res*a)%mod;
a=(a*a)%mod;
n>>=1;
}return res;
}
ll fac[301];
ll rev[301];
ll comb(ll n,ll k){
if(n<k)return 0;
ll x=(fac[n]*rev... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1000000007;
int f[100000][2] = {0}, times[100000][2] = {0};
int main() {
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n;
cin >> n >> f[0][0];
times[0][0] = 1;
for (int i = 1; i < n; ++i) {
time... |
#include "bits/stdc++.h"
#include <chrono>
#include <random>
#define lli long long int
using namespace std;
#define mod 1000000007
#define mod1 998244353
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define INF 1000000000
#define common cout << "Case #" << w+1 << ": "
#define maxn 20... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll; //int:2*10**9
typedef long double ld;
typedef pair<ll,ll> P;
#define REP(i,n) for(ll i = 0; i<(ll)(n); i++)
#define FOR(i,a,b) for(ll i=(a);i<=(b);i++)
#define FORD(i,a,b) for(ll i=(a);i>=(b);i--)
#define pb push_back
#define MOD 1000000007 //998244353... |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <math.h>
#include <map>
//#include <set>
using namespace std;
typedef long long LONG;
LONG gcd(LONG x, LONG y) {
if(x % y == 0) {
return y;
} else {
return gcd(y, x % y);
//x%y==0でないときはユーグリットの互除法を... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 3e5 + 5;
int n;
int a[N];
map<int , int> mp;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 1 ; i <= n ; ++i) cin >> a[i];
int cur = 0 , ans = 0;
mp[0... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N,M;
string a;
int x,y;
char dna[20][20];
cin >> N >> M;
x=y=0;
for(int i=0; i<N; i++) {
for(int j=0; j<N; j++){
dna[i][j]='.';
}
}
for(int i=0; i<M; i++) {
cin >> a;
if(a.... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll INF = (1ll << 60);
template <typename T>
bool chmax(T &a, const T &b)
{
if (a < b)
{
a = b;
return true;
}
return false;
}
template <typename T>
bool chmin(T &a... |
#include<bits/stdc++.h>
#define int long long
#define REP(i,a,n) for(int i=a;i<(n);i++)
#define REP_sz(i,s) for(int i=0;i<s.size();i++)
#define gcd(a,b) __gcd(a,b)
#define RE return
#define FILL(a,b) memset(a,b,sizeof(a))
#define SO(a) sort(all(a))
#define all(a) a.begin(),a.end()
#define pb push_back
#define sz(a) a.s... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vll vector<long long>
#define f first
#define s second
#define pb push_back
#define printoneline(arr) for(long long i=0;i<arr.size();i++){cout<<arr[i]<<" ";} cout<<"\n";
#define sort(a) sort(a.begin(),a.end());
#define rsort(a) sort(a.rbegin()... |
#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 <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
int main(void)
{
vector<int> vDice(3);
for (int i = 0; i < 3; i++)
{
cin >> vDice.at(i);
}
vector<int> vFind(6);
for (int i = 0; i < 6; i++)
{
std::vector<int... |
/*
* @Author: tusikalanse
* @Date: 2021-06-12 20:33:13
* @LastEditTime: 2021-06-12 20:37:22
* @LastEditors: tusikalanse
* @Description:
* @FilePath: /undefined/mnt/e/algo/atcoder/arc/122/b.cpp
*/
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
LL gcd(LL a, LL b) {
return b == 0 ? a : gcd... | #include <bits/stdc++.h>
using namespace std;
void debug_out() { cerr << endl; }
template<class T> ostream& prnt(ostream& out, T v) { out << v.size() << '\n'; for(auto e : v) out << e << ' '; return out;}
template<class T> ostream& operator<<(ostream& out, vector <T> v) { return prnt(out, v); }
template<class T> ostrea... |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
//#include <atcoder/convolution>
//#inclu... | #include <bits/stdc++.h>
using namespace std;
int a,b,c;
int main(void){
scanf("%d%d%d",&a,&b,&c);
printf("%d\n",7-a+7-b+7-c);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main(void){
int n,m;
cin >> n >> m;
vector<vector<int>> pos(n);
rep(i,n){
int a;
cin >> a;
pos[a].push_back(i);
}
rep(i,n){
int pre = -1;
pos[i].p... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned ll
#define pi pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vll vector<ll>
#define vb vector<bool>
#define vd vector<double>
#define vs vector<string>
#define vvi vector<vi>
#define ff first
#define ss seco... |
// ###### ### ####### ####### ## # ##### ### ##### //
// # # # # # # # # # # # # # ### //
// # # # # # # # # # # # # # ### //
// ###### ######### # # # # ... | #include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cmath>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <sstream>
#include <string>
#define _repargs(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi... |
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("Ofast")
using namespace __gnu_pbds;
using namespace std;
#define int long long int
#define endl '\n'
#define mod 1000000007
#define mmod 998244353
#define inf 1000000000000000000
#define PI 3.141592... | #include<bits/stdc++.h>
using namespace std;
int read()
{
int num=0;bool flag=1;
char c=getchar();
for(;c<'0'||c>'9';c=getchar())
if(c=='-')flag=0;
for(;c>='0'&&c<='9';c=getchar())
num=(num<<1)+(num<<3)+c-'0';
return flag?num:-num;
}
int n,m;
int jo[5];
char c[30];
long long ans;
int mai... |
# include <stdio.h>
# define max(a, b) (a>b?a:b)
using namespace std;
int n, x;
char s[200200];
int main() {
scanf("%d%d%s", &n, &x, s);
for (int i = 0; i < n; i++) {
if (s[i] == 'x') {
x = max(0, x - 1);
} else {
x++;
}
}
printf("%d", x);
} | #include<bits/stdc++.h>
// #include<iomanip>
// #pragma GCC optimize("Ofast")
#define eb emplace_back
#define pb push_back
#define top 200007
#define min(a,b) (a<b) ? a:b
#define max(a,b) (a>b) ? a:b;
#define F first
#define S second
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie... |
#include <bits/stdc++.h>
using namespace std;
int BASE = 1e9 + 7;
int n;
char aa, ab, ba, bb;
int solve() {
if (n <= 3) return 1;
if (ab == 'A') {
if (aa == 'A') return 1;
if (ba == 'A') {
// number of strings of length n-3 so that no two bs can be adjacent
// A....AB ... | #include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<iostream>
using namespace std;
int n,f[1005][2];
char s[2][2];
bool vis[2][2];
void dfs(int x,int y){
if(vis[x][y]){
return;
}
vis[x][y]=true;
dfs(x,s[x][y]);
dfs(s[x][y],y);
}
int main(){
cin>>n;
if(n==2){
puts("1");
return 0;... |
#include <bits/stdc++.h>
template <class T>
inline void read(T &x) {
static char ch;
static bool opt;
while (!isdigit(ch = getchar()) && ch != '-');
x = (opt = ch == '-') ? 0 : ch - '0';
while (isdigit(ch = getchar()))
x = x * 10 + ch - '0';
if (opt)
x = ~x + 1;
}
template <class T>
inline void putint... | #include <bits/stdc++.h>
using namespace std;
#define nl "\n"
#define nf endl
#define ll long long
#define pb push_back
#define _ << ' ' <<
#define INF (ll)1e18
#define mod 998244353
#define maxn 100010
ll i, i1, j, k, k1, t, n, m, res, flag[10], a[maxn], b[maxn];
ll m1, m2, l[maxn], r[maxn], bsl, bsm, bsu;
bool so... |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPR(i, n) for (ll i = (n); i >= 0; i--)
#define FOR(i, m, n) for (ll i = (m); i < (ll)(n); i++)
#define BIT(bit, n) for (int bit = 0; bit < (1 << (n)); ++bit)
#define I... | //Soham
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define soham1192k ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#ifndef ONLINE_JUDGE
#define debug(x) cerr<<#x<<" ";_print(x);cerr<<'\n';
#else
#define debug(x)
#endif
const int mod=1000000007;
const double pi = 3.141592653589... |
#include <bits/stdc++.h>
#include <unordered_set>
using namespace std;
using Graph = vector<vector<int> >;
#define INF 1e9
#define LLINF 1e18
#define PI 3.14159265358979323
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
typedef long long ll;
typedef long double ld;
template<... | #include <iostream>
using namespace std;
using ll = long long int;
int main(){
ll n;
cin >> n;
ll ac = 0;
ll wa = n+1;
while(wa-ac > 1){
ll mid = (ac+wa)/2;
if(mid <= (2LL*(n+1))/(mid+1)) ac = mid;
else wa = mid;
}
cout << n+1-ac << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define fio ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
#define ll long long
#define dd double
#define pb push_back
#define ff first
#define ss second
#define Mp make_pair
const ll Mod=1000000007;
const ll INF=999999999999999999;
const ll NN=(ll)(1e6+5);
ll m... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b;
cin>>a>>b;
int an = min(a,b);
int k = max(a,b);
if(an+3>k)
cout<<"Yes";
else
cout<<"No";
return 0;
} |
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
#define all(v) v.begin(), v.end()
using in = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i,a,b) for(int i=(int)(a);i<(int)(... | #include <bits/stdc++.h>
using namespace std;
struct DSU {
vector<int> ps;
vector<vector<int>> children;
DSU(int n): ps(n), children(n) {
iota(ps.begin(), ps.end(), 0);
for (int i = 0; i < n; ++i) {
children[i].push_back(i);
}
}
int find(int i) {
if (ps[... |
#include<bits/stdc++.h>
using namespace std;
const int N=200005;
typedef long long LL;
int a[N],b[N],f[N],st[N],n,m,top;
long long sum[N][2];
inline int Find(int x){
return x==f[x]?x:f[x]=Find(f[x]);
}
int main(void){
cin>>n>>m;
for(int i=1;i<=n;++i) f[i]=i;
for(int i=1;i<=n;++i) cin>>a[i];
for(int i=1;i<... | //Never stop trying
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
typedef string str;
typedef long long ll;
#define int ll
typedef double db;
typ... |
#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... | // *********************************************************************************
// * MURTAZA MUSTAFA KHUMUSI *
// * NIT-DGP,CSE - 2019-2023 *
// **************************************************************... |
///Bismillahir Rahmanir Rahim
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
ll gcd(int a,int b)
{
if(b==0)
return a;
return gcd(b,a%b);
}
#define in(x) scanf("%lld",&x)
#define ... | /*
author: parv2809
*/
#include<bits/stdc++.h>
#define int long long int
#define mod 1000000007
#define inf 1e18
#define fo(i,y,n,inc) for(int i=y;i<n+y;i+=inc)
#define cin(t) int t;cin>>t
#define w(t) while(t--)
#define nl cout<<endl;
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define ft(i) ... |
#include<bits/stdc++.h>
using namespace std;
#define ll int
vector<ll>seg[4*200009];
vector<ll>ad[200009];
ll s[200009];
ll f[200009];
ll T;
ll val[200009];
ll lev[200009];
void dfs(ll a,ll p)
{
lev[a]=lev[p]+1;
T++;
s[a]=T;
val[T]=a;
ll b,i,l=ad[a].size();
for(i=0;i<l;i++)
{
b=ad[a]... | #include "bits/stdc++.h"
using namespace std;
#define FastIO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long
#define mod 1000000007
const int N = 2e5 + 5;
vector<int> tree[N], depth(N);
vector<int> time_in(N), time_out(N);
vector<int> orders[N];
int timer = 0, n;
void dfs(int s) {
time_in[s] ... |
#include<bits/stdc++.h>
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 range(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define pb push_back
#define F first
#define S second
typedef long long ll;
typedef unsigned long long ull;
typed... | #pragma region Macros
#include <bits/stdc++.h>
#if defined(LOCAL) || defined(ONLINE_JUDGE) || defined(_DEBUG)
#include <atcoder/all>
#endif
using namespace std;
#define REP(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REPR(i, n) for(int i=(n); i>=0; --i)
#define FOR(i, n, m) for(int i=(m), i##_len=(n); i<i##... |
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define PI acos(-1)
#define pb push_back
#define int long long
#define ld long double
#define sp fixed<<setprecision
#define bp __builtin_popcountll
#define all(x) x.begin(),x.end()
#define pii pair<long long,long long>
#define FAST ios_ba... | #include<cstdio>
#define F(i,l,r) for(int i=l,i##_end=r;i<i##_end;++i)
using namespace std;
const int N=20,M=105;
template<typename T>void read(T &x)
{
bool neg=false;
unsigned char c=getchar();
for(;(c^48)>9;c=getchar())if(c=='-')neg=true;
for(x=0;(c^48)<10;c=getchar())x=(x<<3)+(x<<1)+(c^48);
if(neg)x=-x;
}
int n... |
#pragma GCC target ("sse4")
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#define endl '\n'
#define pb push_back
#define fr first
#define sc second
#define ll long long int
#define ld long double
#d... | #pragma GCC optimize ("O2")
#pragma GCC target ("avx")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<iostream>
#include<cstring>
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(... |
#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#define rep(i,n) for(ll i=0;i<(n);++i)
#define rep2(i,n) for(ll i=1;i<=(n);++i)
#define rep3(i,i0,n) for(ll i=i0;i<(n);++i)
#define rrep(i,n) for(ll i=((n)-1); i>=0; --i)
#define rrep2(i,n) for(ll i=(n); i>0; --i)
#define pb push_back
#define mo... | #include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#pragma GCC optimize ("-O3")
using namespace std;
typedef long long ll;
const int inf = INT_MAX / 2;
const ll infl = 1LL << 60;
int main()
... |
//Author- Vaibhav Singh
#include<bits/stdc++.h>
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_multiset tree<long long , null_type,less_equal<long long >, rb_tree_tag,tree_order_statistics_node_update>
#define ordered_set tree<long long , n... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
mt19937 rng(std::chrono::duration_cast<std::chrono::nanoseconds>(chrono::high_resolution_clock::now().time_since_epoch()).count());
#define mp make_pair
#define pb push_back
#define F first
#define S second
const int N=200005;
#define M 1000000007
... |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace __gnu_pbds;
using namespace std;
#define LETS_GET_SCHWIFTY ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ff first
#de... | #include <iostream>
#include <numeric>
#include <vector>
using namespace std;
using Mask = int;
bool IsPrime(int n) {
if (n < 2) {
return false;
}
for (int64_t i = 2; i * i <= n; i += 1) {
if (n % i == 0) {
return false;
}
}
return true;
}
vector<int> Primes(... |
#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP2(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; ++i)
#define REP3(i, l, r) for (int i = (l), i##_len = (int)(r); i < i##_len; ++i)
#define GET_MACRO_REP(_1, _2, _3, NAME, ...) NAME
#define REP(...) GET_MACRO_... | // Template
#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <iomanip>
#include <tuple>
#include <utility>
#include <queue>
#include <set>
#include <map>
#include <array>
#include <cassert>
#include <cmath>
#define rep_override(x, y, z, name, ...) name
#define rep2(i, n) for (int i... |
//Bismillahir Rahmanir Rahim
//Allahumma Rabbi Jhidni Elma
/*--------Please carefully check--------
1.Overflow and underflow
2.Corner case
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const ld PI = 2*acosl(0.0);
const int inf=1e5+... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
#define INF 0x3f3f3f3f
#define mem(a, b) memset(a , b , sizeof(a))
#define FOR(i, x, n) for(int i = x;i <= n; i++)
// const ll mod = 998244353;
// const ll mod = 1e9 + 7;
// const double eps = 1e-... |
#include<bits/stdc++.h>
#define int ll
#define sz(x) int((x).size())
#define all(x) (x).begin(),(x).end()
#define x first
#define y second
using namespace std;
using ll = long long;
using pi = pair<int,int>;
const int inf = 0x3f3f3f3f3f3f3f3f;
const int minf = 0xc0c0c0c0c0c0c0c0;
int comb[65][65];
signed main() {
... | #include <bits/stdc++.h>
#define Fast cin.tie(0), ios::sync_with_stdio(0)
#define All(x) x.begin(), x.end()
#define louisfghbvc int t; cin >> t; for(int tt = 0; tt < t; ++tt)
#define sz(x) (int)(x).size()
#define sort_unique(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()));
using namespace std;
typedef... |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rrep(i,n) for(int i=((n)-1);i>=0;--i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
#define mod 1000000007
using namespace std;
typede... | // Murabito-B 21/04/17
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve() {
int n, m;
cin >> n >> m;
vector<int> a(n);
map<int, int> mp;
for (int i = 0; i < n; ++i) {
cin >> a[i];
mp[a[i]]++;
}
vector<int> ans;
for (int i = 0, x; i < m; ++i) ... |
#include<bits/stdc++.h>
using namespace std;
namespace Sakurajima_Mai{
#define ms(a) memset(a,0,sizeof(a))
#define repi(i,a,b) for(int i=a,bbb=b;i<=bbb;++i)//attention reg int or reg ll ?
#define repd(i,a,b) for(int i=a,bbb=b;i>=bbb;--i)
#define reps(s) for(int i=head[s],v=e[i].to;i;i=e[i].nxt,v=e[i].t... | #include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/rope>
// #include <ext/pb_ds/tree_policy.hpp>
// #include <ext/pb_ds/trie_policy.hpp>
// using namespace __gnu_pbds;
// using namespace __gnu_cxx;
// typedef tree<long long, null_type, std::less<long l... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
int N, M;
cin >> N >> M;
vector<int> A(M);
vector<int> B(M);
for (int i = 0; i < M; i++) {
cin >> A[i] >> B[i];
}
int K;
cin >> K;
vector<int> C(K + 1);
vector<int> D(K + 1);
for (int i ... | #include<bits/stdc++.h>
#define ll long long
#define pi 3.1415926535897932384626
using namespace std;
struct P{
int x,y;
bool operator < (const P &a )const{
//if(x!=a.x) return x<a.x;
//if(y!=a.y)
return x>a.x;
};
};
int a,b,c,d,i,n,m,e,k,dx[10]={1,0,-1,0,1,1,-1,-1},dy[10]={0,1,0,-1,1,-1,1,-1};
i... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define mp make_pair
#define fr first
#define sc second
template<int MOD=1000000007>
struct modint{
/*static modint inv[2005];
static void init(){
for(int i=0;i<2005;i++)inv[i]=modpow(modint(i),MOD-2);
}*/
ull va... | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#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 ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define ... |
/* Lucky_Glass */
#include <cstdio>
#include <cstring>
#include <algorithm>
const int N = 1e5 + 10, INF = 0x3f3f3f3f;
int n;
char str[N];
int dp[N], mndp[30];
int main() {
scanf("%d%s", &n, str + 1);
memset(mndp, 0x3f, sizeof mndp);
mndp[str[1] - 'a'] = 0;
for (int i = 1; i <= n; ++i) {
int &now = dp[i]... | // by pakhomovee
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <cmath>
#include <unordered_map>
#include <cassert>
#include <queue>
#include <unordered_set>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#de... |
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<cmath>
#include<queue>
#include<map>
#include<set>
#define int long long
#define mid ((l+r)>>1)
#define lowbit(x) (x&(-x))
#define max Max
#define min Min
#define abs Abs
using namespa... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define ll long long
int f(int n){
return n%10 + n%100/10 + n/100;
}
int main(){
int a, b;
cin >> a >> b;
cout << max(f(a),... |
#include <bits/stdc++.h>
using namespace std;
#define all(v) (v).begin(),(v).end()
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
using ll = long long;
using vll = vector<ll>;
constexpr int inf=1e9+7;
constexpr ll longinf=1LL<<60 ;
constexpr ll mod=1e9+7 ;
int main(){
i... | #include <bits/stdc++.h>
#define f first
#define s second
#define fore(i,a,b) for(int i = (a), ThxMK = (b); i < ThxMK; ++i)
#define pb push_back
#define all(s) begin(s), end(s)
#define _ ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define sz(s) int(s.size())
#define ENDL '\n'
#define vv(type, name, h, ...) vec... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// int/long: -2,147,483,648 - 2,147,483,647 (-2^31 <= int < 2^31)
// long/long long: -9,223,372,036,854,775,808 - 9,223,372,036,854,775,807 (-2^63 <= long < 2^63)
//#define INF (1<<30)
#define INF (2147483647)
// 2^31 -1
//= 1,073,741,824 *2 -1
//= ... | #include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); ++i)
#define all(a) a.begin(), a.end()
using namespace std;
using P = pair<int, int>;
using ll = long long;
using vi = vector<int>;
using vv = vector<vi>;
template<typename T>
struct BIT{
int n;
vector<T> d;
BIT(int n=0): n(n), d(n+1) {}
v... |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define all(v) v.begin(),v.end()
using namespace std... | #include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N=500,mod=998244353;
int n,m;
char s[N+9][N+9];
void into(){
scanf("%d%d",&n,&m);
for (int i=1;i<=n;++i)
scanf("%s",s[i]+1);
}
int cnt[N*2+9][3],ans;
void Get_ans(){
for (int i=1;i<=n;++i)
for (int j=1;j<=m;++j) ++cnt[i+j][s[i][j... |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define drep(i,n) for (int i = (n)-1; i >= 0; --i)
#define dup(x,y) (((x)+(y)-1)/(y))
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const double EPS = 1e-10;
const int INF = 1e9;
const l... | #include <iostream>
using namespace std;
int main() {
int n;
while(cin>>n){
int ans=100-n%100;
cout<<ans<<endl;
}
} |
#include<bits/stdc++.h>
using namespace std;
#define GODSPEED ios:: sync_with_stdio(0);cin.tie(0);cout.tie(0);cout<<fixed;cout<<setprecision(15);
#define f f
#define s second
#define newl cout<<"\n";
#define pb push_back
#define mset(a,x)... | #include <bits/stdc++.h>
#define int long long
using namespace std;
template <const int32_t MOD> struct ModInt {
long long x;
ModInt() : x(0) {}
ModInt(long long u) : x(u) {
x %= MOD;
if (x < 0)
x += MOD;
}
friend bool operator==(const ModInt &a, const ModInt &b) {
return a.x == b.x;
}
... |
#include <bits/stdc++.h>
using namespace std;
typedef vector <int> vi;
typedef pair <int, int> pii;
typedef vector <long long> vll;
typedef pair <long long, long long> pll;
#define pb push_back
#define all(c) c.begin(), c.end()
#define For(i, a, b) for (long long i = a; i < b; ++i)
#define Forr(i, a, b) for (long ... | #include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define pb push_back
#define int long long int
#define ll long long
#define vi vector<int>
#define vll vector<ll>
#define vvi vector < vi >
#define pii pair<int,int>
#define pll pair<long long, long long>
#define F first
#define S second
#define mod 1000000... |
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
#include<set>
#include<map>
#include<iostream>
#define fi first
#define se second
#define mk make_pair
#define pb push_back
#define ls (t<<1)
#define rs ((t<<1)|1)
#define mid ((l+r)>>1)
#define N 500005
using namespace std;
int n, a[N], id[... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define Pr pair<ll,ll>
#define Tp tuple<int,int,int>
using Graph = vector<vector<Tp>>;
ll mod = 998244353;
int main() {
ll N; cin >> N;
vector<Pr> seq;
rep(i,2*N){
ll a; cin >> a;
... |
#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 cosp(x)... | #include <bits/stdc++.h>
using namespace std;
int main()
{
string s;
string t = "";
cin >> s;
int f = 1;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'R') f *= -1;
else if (f == 1) {
if (*t.end() == s[i]) t.pop_back();
else t.push_back(s[i]);
}
else if (f == -1) {
if (*t.begin() == s[i]) t.era... |
#include <bits/stdc++.h>
#define LL long long
#define st first
#define nd second
const LL LINF = 0x3f3f3f3f3f3f3f3f;
const int INF = 0x3f3f3f3f;
using namespace std;
template <class T> T read(T &a) {
a=0;char x=getchar();bool f=0;
for(;x<'0'||x>'9';x=getchar())f|=x=='-';
for(;x>='0'&&x<='9';x=getchar())a=(a<... | #include<bits/stdc++.h>
#define ll long long
#define SZ(x) (int)x.size()
#define pb push_back
#define FULL(x, y) memset(x, y, sizeof(x))
using namespace std;
const int N = 1000005, M = 1005;
int n, m;
vector<int> c[26], g[N];
int f[M][M], vis[N], dis[N];
void add(int a, int b, int u, int v) {
int x = a*n + u, y = b*... |
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,mmx,avx")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define PB push_back
#define MP make_pair
#define endl "\n"
#define fst first
#define snd second
const int UNDEF = -1;
co... | // RioTian 21/03/24
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios_base::sync_with_stdio(false), cin.tie(0);
int n;
cin >> n;
vector<pair<ll, ll>> towns;
ll sa = 0, sb = 0; // T,A
for (int i = 0; i < n; ++i) {
int a, b;
cin >> a >> b;
... |
#include<iostream>
#include<stdio.h>
#include<string.h>
#include<cmath>
#include <bits/stdc++.h>
using namespace std;
int main(){
long long N;
cin >> N;
long long ans = 0;
for(int i = 1; i <= 5; i++){
if(N >= pow(10, 3*i)){
ans += (N-pow(10, 3*i)+1);
}
}
cout << ans << endl;
}
... | // clang-format off
#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;
#ifndef godfather
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,av... |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 2e5+10;
int to_int(char c) {
if(c == 'R') return 0;
if(c == 'W') return 1;
if(c == 'B') return 2;
assert(false);
}
char to_char(int x) {
if(x == 0) return 'R';
if(x == 1) return 'W';
if(x == 2) return 'B';
assert(false);
}
int C(in... | #include <bits/stdc++.h>
#define rep(i, a, b) for(int i = a; i <= b; ++i)
#define repr(i,a,b) for(int i = a ; i >= b; --i)
#define NAME "NAME"
#define pb push_back
#define mp make_pair
#define EL cout << '\n'
#define cqtshadow int main
#define fillchar(a,x) memse... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vl;
#define mp make_pair
#define pb push_back
#define sz(x) ((int)((x).size()))
#define all(v) (v).begin(), (v).end()
#define endl "\n"
#define deb... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define w(x) int x; cin>>x; while(x--)
void basics()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
int32_t main()
{
basics();
int year;
cin >> year;
float ans = (float)year / 100;
int yr = (int)ans;
// cout << ans;
if ((float)yr... |
#include <bits/stdc++.h>
using namespace std;
#define fast_io cin.tie(0);ios_base::sync_with_stdio(0);
string to_string(string s) { return '"' + s + '"';}
string to_string(char s) { return string(1, s);}
string to_string(const char* s) { return to_string((string) s);}
string to_string(bool b) { return (b ? "true" : "fa... | #include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << "\n"
#define COUTF(x) cout << setpre... |
// Problem: C - Swappable
// Contest: AtCoder - AtCoder Beginner Contest 206（Sponsored by Panasonic）
// URL: https://atcoder.jp/contests/abc206/tasks/abc206_c
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include <bits/stdc++.h>
using namespace std;
#define ll lon... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
int N;
scanf("%d",&N);
map<int,int> M;
static int A[(int)3e5+16];
for(int i=0;i<N;i++){
scanf("%d",&A[i]);
M[A[i]]++;
}
ll result=0;
for(int i=0;i<N;i++){
result+=N-M[A[i]];
}
... |
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#inclu... | #include <bits/stdc++.h>
#define pb push_back
#define db1(x) cout << #x << " = " << x << endl
#define db2(x, y) cout << #x << " = " << x << ", " << #y << " = " << y << endl
#define paging cout << "-----------------------" << endl
using namespace std;
void localFileInput() {
#ifndef ONLINE_JUDGE
freopen("input.t... |
//#pragma GCC optimize ("O3")
//#pragma GCC target ("sse4")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC target("avx,avx2,fma")
#include <algorithm>
#include <array>
#include <cassert>
//#include <chrono>
#include <cmath>
//#include <cstring>
//#include <functional>
//#incl... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
const long long MOD = 1000000007;
const long long INF = 9999999999999999;
using ll = long long;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
... |
#include<bits/stdc++.h>
#define pb push_back
#define ll long long int
using namespace std;
int main()
{
ll i,j,k,T,c=0,n;
cin>>n>>T;
ll arr[n];
for(i=0;i<n;i++)
{
cin>>arr[i];
}
vector<ll>vec1,vec2,vec3;
for(i=0;i<n/2;i++)
{
vec1.pb(arr[i]);
}
for(i=n/2;i<n;i++)
{
... | #include<bits/stdc++.h>
#define re register
#define ll long long
#define dl double
#define LL inline ll
#define I inline int
#define V inline void
#define B inline bool
#define FOR(i,a,b) for(re int i=(a),i##i=(b) ; i<=i##i ; ++i)
#define ROF(i,a,b) for(re int i=(a),i##i=(b) ; i>=i##i ; --i)
#define gc getchar()
//#def... |
#include<bits/stdc++.h>
using namespace std;
#define inf 1001000009
#define infmx 1e18ll
#define ff first
#define ss second
#define ll long long
#define pb push_back
#define IOS ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define all(x) x.begin(),x.end()
///debug
#define wh(x) cerr<<#x<<" is "<<x<<endl... | #pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < (int)(n); i++)
#define ALL(a) a.begin(), a.end()
#define MOD 998244353
using namespace std;
using ll = long long;
template<int M>
class ModInt {
public:
ll... |
#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using P = pair<int, int>;
using PL = pair<lint, lint>;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#d... | #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(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, t;
cin >> n >> t;
vector<int> a(n);
rep(i,n) cin >> a[i];
vector<int> b, c;
rep(i,... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
string X; //原串
ll M; //最大
cin >> X >> M;
int n = X.size();
vector<ll> b(n); //n个向量(已经定型) 每个都是long long b数组
ll m = 0;
for (int i = 0; i < n; i++) {
b[i] = X[i] - '0'; //转数字
m = max(m, b[i]); //原串最大的数字
... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... |
#include<bits/stdc++.h>
using namespace std;
namespace Sakurajima_Mai{
#define ms(a) memset(a,0,sizeof(a))
#define repi(i,a,b) for(int i=a,bbb=b;i<=bbb;++i)//attention reg int or reg ll ?
#define repd(i,a,b) for(int i=a,bbb=b;i>=bbb;--i)
#define reps(s) for(int i=head[s],v=e[i].to;i;i=e[i].nxt,v=e[i].t... | #include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <cstdio>
#include <numeric>
#include <queue>
#include <list>
#include <random>
#include <iomanip>
using namespace std;
using ll=long long;
const double PI=3.14159265358979323846;
int m... |
#include<cstdio>
#include<iostream>
#include<vector>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<algorithm>
#include<map>
using namespace std;
// #define NDEBUG
#include<cassert>
namespace Elaina{
#define rep(i, l, r) for(int i=(l), i##_end_=(r); i<=i##_end_; ++i)
#define drep(i, l, r) for(in... | #include <bits/stdc++.h>
using namespace std;
int main(){
long n, g = 0;
cin >> n;
long a[n], b[n];
for(int i = 0; i < n; i++){
cin >> a[i];
g += a[i];
}
for(int i = 0; i < n; i++){
cin >> b[i];
g += b[i];
}
priority_queue<long, vector<long>, greater<lon... |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
unordered_map<int,bool> x;
int count = 0;
for (long long i = 2; i <= 100000 && i <= n; i++) {
if (x.count(i) > 0) {
continue;
}
long long t = i * i;
while (t <= n) {
if (t <= 100000) x[t] = true;
... | #include<iostream>
using namespace std;
int main()
{
int N,p;
cin>>N;
if(1<=N && 300>=N)
{
p=N*1.08;
if(p<206)
{
cout<<"Yay!";
}
else if(p==206)
{
cout<<"so-so";
}
if(p>206)
{
cout<<":(" ;
}
}
... |
#include "bits/stdc++.h"
using namespace std;
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 __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
voi... | #include<bits/stdc++.h>
#define int long long
using namespace std;
stack<char> st;
string s;
int n;
signed main(){
cin>>n>>s;
for(int i=0;i<n;i++){
st.push(s[i]);
if(st.size()<3) continue;
string cur="";
for(int j=0;j<3;j++) cur+=st.top(),st.pop();
//cout<<cur<<"\n";
if(cur!="xof") st.push(cur[2]),st.push... |
#include<algorithm>
#include<iostream>
#include<cstdio>
#include<queue>
#define int long long
#define uc getchar()
#define ph putchar
#define R register
#define CN const
#define rint R int
#define cint CN int
#define ps ph(' ')
#define pe ph('\n')
using namespace std;
cint inf=998244353;
cint mix=1e6+5;
inline int in()... | #include <bits/stdc++.h>
typedef long long ll;
#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 sp(n) cout << fixed << setprecision(n)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b... |
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <fstream>
#include <sstream>
#include <set>
#include <map>
#include <vector>
#include <list>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <string>
#include <stack>
#include <queue>
#include <bitset> //UWAGA - w czasie kompilacji ... | #include <bits/stdc++.h>
using namespace std;
int64_t Q=1000000007;
int main(){
int T;
cin>>T;
for(int l=0;l<T;l++){
int64_t N,A,B;
cin>>N>>A>>B;
int64_t L=B-1;
if(A+B>N){
cout<<"0"<<endl;
continue;
}
int64_t X=(N-A+1)*(N-A+1),Y=(N-B+1)*(N-B+1),W=0,V=4,U=0,S=0;
X%=Q;
... |
#include <iostream>
#include <vector>
using namespace std;
void solve() {
int n;
cin >> n;
vector<int> xs, ys;
for (int i = 0; i < n; ++i) {
char c;
cin >> c;
if (c == '0') xs.push_back(i);
}
for (int i = 0; i < n; ++i) {
char c;
cin >> c;
if (c... | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define all( v ) begin( v ), end( v )
#define rep( i, j ) for ( int i = 0; i < (int)j; +... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.