code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
#define _USE_MATH_DEFINES
#include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <stack>
#include <string>
#inc... | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define pi 3.141592653589793238
#define int long long
#define ll long long
#define ld long double
using namespace __gnu_pbds;
using namespace std;
template... |
#include<bits/stdc++.h>
#define For(i,a,b) for(register int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(register int i=(a);i>=(b);--i)
//#define int long long
using namespace std;
inline int read()
{
char c=getchar();int x=0;bool f=0;
for(;!isdigit(c);c=getchar())f^=!(c^45);
for(;isdigit(c);c=getchar())x=(x<<1... | #include <bits/stdc++.h>
using namespace std;
// 0-indexed
template <class T>
struct BIT {
int treesize;
vector<T> lst;
// constructor
BIT(int newn = 0) : treesize(newn), lst(newn + 1, 0) {}
// a_place += num
void add(int place, T num) {
++place;
while (place <= treesize) {
lst[place] += num;... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
#define vec vector<ll>
#define mat vector<vector... | #line 2 "/home/defineprogram/Desktop/Library/template/template.cpp"
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(ll i=0;i<n;i++)
#define REP(i,n) for(ll i=1;i<n;i++)
#define rev(i,n) for(ll i=n-1;i>=0;i--)
#define all(v) v.begin(),v.end()
#define P pair<ll,ll>
#define len(s) (l... |
#pragma region templates
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using db = double;
using ld = long double;
t... | // Problem: C - Max GCD 2
// Contest: AtCoder - Japanese Student Championship 2021
// URL: https://atcoder.jp/contests/jsc2021/tasks/jsc2021_c
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
// Parsed on: 17-04-2021 12:52:09 IST (UTC+05:30)
// Author: Kapil Choudhary
// *************************************************... |
#pragma GCC optimize("-Ofast","-funroll-all-loops")
#pragma GCC optimize(2)
#pragma GCC optimize(3,"Ofast","inline")
#include <bits/stdc++.h>
using namespace std;
//#define int long long
//#define ULL unsigned long long
#define fi first
#define se second
#define ls 2 * rt
#define rs 2 * rt + 1
#define PII pair<int,int>... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for(int i=a;i<=b;i++)
using LL = long long;
const int Nmax=1e5+9,INF=987'654'321;
int N,M,a,b,dist[19][19],K,C[19],D[Nmax],Nt;
int visited[Nmax],q,dp[19][(1<<19)],ans=INF;
vector <int> adj[Nmax];
int F(int s, int e) {
fill(D+1,D+N+1,INF);
fill(... |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
long long N, M; cin >> N >> M;
vector<long long> H(N), W(M);
for (long long i = 0; i < N; i++) cin >> H[i];
for (long long i = 0; i < M; i++) cin >> W[i];
sort(H.begin(), H.end());
vector<long long> sum1((N + 1) /... | /*
मनस्वी म्रियते कामं कार्पण्यं न तु गच्छति ।
अपि निर्वाणमायाति नानलो याति शीतताम् ॥
*/
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define mod 1000000007
#define pb push_back
#define ll long long i... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define MOD 1000000007
#define PI 3.1415926535897932384626433832795
#define ee cout << "\n"
#define pb push_back
#define mkp make_pair
#define sall(v) sort(v.begin(), v.end())
#define fo(i, n) for (ll i = 0; i < n; i++)
#define vl vector<ll>
#define... | #include <bits/stdc++.h>
using namespace std;
int main(){
long long int n;
cin>>n;
long long int ans=n/100;
if(n%100!=0)
ans+=1;
cout<<ans;
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
long N;
cin >> N;
vector<long> A(N);
rep(i, N) cin >> A[i];
long ans = 0;
rep(i, N) {
long C = 1000000;
for(int j = i; j < N; j++) {
C = min(C, A[j]);
ans = max(ans, C*(j+1-i));
... | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define pb push_back
#define mp make_pair
#define int long long
#define ff first
#define ss second
#define double long double
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define dbg(x) cout << "~~~~~" << #x << "--->" << x << endl... |
#include <iostream>
using namespace std;
const int maxn=2e5;
const int maxa=2e5+1;
int N;
int A[maxn];
int rt[maxa];
int fndrt(int a){
return rt[a]=(a==rt[a])?a:fndrt(rt[a]);
}
int main() {
while(cin>>N){
//higha will minimize the amount of array being updated.
int higha=1;
for(int i=0;i<N;i++){
cin>>A[i];
... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define yes cout<<"YES\n";
#define no cout<<"NO\n";
#define fl(n) for(int i=0;i<n;i++)
#define flj(n) for(int j=0;j<n;j++)
#define flo(n) for(int i=1;i<=n;i++)
#define mii map<int,int>
#define mci map<char,int>
#define V vector<int>
#define vp vect... |
#include <cstring>
#include <cmath>
#include <cstdio>
#include <algorithm>
#include <string>
#include <map>
#include <iostream>
#include <vector>
#include <queue>
#include <unordered_map>
#include <random>
#include <stack>
#include <set>
#include <list>
#include <unordered_set>
//#include <atcoder/convolution>
//#inclu... | #include<bits/stdc++.h>
using namespace std;
#define fRead(x) freopen(x,"r",stdin)
#define fWrite(x) freopen (x,"w",stdout)
#define LL long long
#define ULL unsigned long long
#define ff first
#define ss second
#define pb push_back
#define ... |
#include<bits/stdc++.h>
using namespace std;
#define INF 0x3f3f3f3f
#define swap(a,b) (a^=b^=a^=b)
#define ll long long int
#define ull unsigned long long int
#define uint unsigned int
#define format(a) memset(a,0,sizeof(a))
#define rep(x,y,z) for(int x=y;x<=z;x++)
#define dec(x,y,z) for(int x=y;x>=z;x--)
#define mst(x... | #include<iostream>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<cstring>
#include<queue>
#include<stack>
#include<numeric>
using namespace std;
#define INF (1 << 30) - 1
#define LINF 1LL << 60
const int MOD = 1000000007;
using ll = long long;
using P = pair<int, int>;
int ... |
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2")
#include <bits/stdc++.h>
#define mem(a,x) memset(a,x,sizeof(a))
#define gi(x) scanf("%d",&x)
#define gi2(x,y) scanf("%d%d",&x,&y)
#define gll(x) scanf("%lld",&x)
#define gll2(x,y) scanf("%lld%lld",&x,&y)
using namespace std;
const double... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int N;
cin >> N;
vector<int> A(N);
for (auto &&e : A) {
cin >> e;
}
vector<vector<int>> X(200);
for (int i = 0; i < N; i++) {
X[A[i] % 200].emplace_back(i);
}
for (int i = 0; i < 200... |
#include <bits/stdc++.h>
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
#define repp(i, l, r) for (long long i = (l); i < (r); i++)
#define rep(i, n) for (long long i = 0; i < (n); ++i)
#define per(i, n) for (long long i = (n); i >= 0; --i)
#define all(v) v.begin(), v.end()
cons... | #include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
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) { if (a > b) { a = b; return 1; } return 0; }
#define rep(i,cc,n) for(int i=cc... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int a, b, w;
cin >> a >> b >> w;
w *= 1000;
int min_orange = -1;
int max_orange = -1;
if (w % b == 0) min_orange = w / b;
else if ((w / b + 1) * b - w <= (b - a) * (w / b + 1)) min_orange = w / b + 1;
if (w % a =... | #include <bits/stdc++.h>
#define int long long
using namespace std;
int cx[1000005];
int ci[1000005];
signed main(){
int a,b,w;
memset(ci,0X3f,sizeof(ci));
memset(cx,0,sizeof(cx));
ci[0] = 0;
cin>>a>>b>>w;
w = w*1000;
int judge = 0;
for(int i=a;i<=b;i++)
for(int j=i;j<=w;j++){
cx[j] = max(cx[j],cx[j-i]+1);
... |
#include<bits/stdc++.h>
using namespace std;
/**templates**/
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
#define si(x) scanf("%d",&x)
#define sl(x) scanf("%lld",&x)
#define sull(x) scanf("%llu",&x)
#define sf(x) scanf("%lf",&x)
#def... | // https://atcoder.jp/contests/abc185/tasks/abc185_e
#include<bits/stdc++.h>
using namespace std;
int main() {
int n,m;
cin>>n>>m;
int a[n+1],b[m+1];
for (int i=1;i<=n;++i) {
cin>>a[i];
}
for (int i=1;i<=m;++i) {
cin>>b[i];
}
int f[n+1][m+1];
memset(f,0x3f,sizeof f);
... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int inf=0x3f3f3f3f;
const ll INF=0x3f3f3f3f3f3f3f;
const double pi=3.1415926535897932384626;
inline ll read(){
ll x=0,f=1;
char ch=getchar();
while(ch<'0'||ch>'9'){
if(ch=='-') f=-1;
ch=getchar();
}
while(ch>='0'&&ch<='9'){
x=(x<<1)+(x<... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#pragma GCC optimize("-Ofast")
//#pragma GCC optimize("trapv")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.2,popcnt,abm,mmx,avx2,tune=native")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-funroll-loops")
using namespace std;
using n... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define ld long double
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
using P=... | #include <bits/stdc++.h>
using namespace std;
using INT = long long int;
using VINT = vector<INT>;
using VVINT = vector<VINT>;
using DBL = long double;
const int BX = 1;
INT N, M;
map<INT, VINT> E;
void init() {
cin >> N >> M;
for ( INT ix = 0 + BX; ix < M + BX; ix++ ) {
INT a, b;
cin >> a >> b;... |
#include "bits/stdc++.h"
using namespace std;
#define endl "\n"
#define endly " "
#define int long long
#define sz(x) ((int)x.size())
#define len(x) ((int)x.length())
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define tc() int test; cin>>test; while(test--)
#define pii pair<int,int>
int32_t mai... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define mod 1000000007
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);
#define each(x,v) for(auto& (x) : (v))
#define f(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define b(i,a,b) for(ll i=(ll)(a);i>=(ll)(b);i--)
#define pb push_back
#def... |
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vect... | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <utility>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <cstdio>
#include <limits>
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
using namespace std;
template<clas... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pint = pair<int,int>;
int main()
{
int N;cin >> N;
int m = N - 1;
vector<int> A(N);
for(auto &i: A) cin >> i;
int ans = 1<<30;
for(int bit = 0; bit < (1<<m); bit++) {
vector<int> b = {A[0]};
for(int i = 0; i < N - 1; i++) {
if((1 ... |
#include<bits/stdc++.h>
#define all(k) k.begin(),k.end()
#define repk(i,a, n) for(int i=a;i<=n;i++)
#define rep(i,a, n) for(int i=a;i<n;i++)
#define per(i,a,n) for(int i=n-1;i>=a;i--)
#define pb push_back
#define ppb pop_back
#define eb emplace_back
#define ll long long
#define ull unsigned long long
#define pci pa... |
#include<bits/stdc++.h>
using namespace std;
using namespace std::chrono;
//const int mod=1e9+7;
const int mex=200005;
#define ll long long
#define test int t;cin>>t;while(t--)
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);
#define fo(i,a,n) for(int i=a;i<n;i++)
#define rfo(i,a,b) for(int i=a;i>=b;i--)... | #include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define all(x) begin(x),end(x)
#define F(i,n) for (int i = 0; i < n; ++i)
#define F1(i,n) for (int i = 1; i <= n; ++i)
#define dbg(x) cerr << #x << " = " << x << endl
#define dbgg(x) cerr << #x << " = " << x << ' '
#de... |
#include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
char win(char a,char b){
if (a == 'R' && b == 'P') return b;
if (a == 'P' && b == 'S') return b;
if (a == 'S' && b == 'R') return b;
else return a;
}
int main(){
int n,k;
cin... | #include <iostream>
#include <vector>
#include <string>
#include <list>
#include <queue>
#include <algorithm>
#define rep(i, n) for(i = 0; i < (n); i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define INF 1 << 30
using namespace std;
... |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
using ll = long long;
using ld = long double;
#define mp make_pair
const int p = 998244353;
int mul(int a, int b) {
return (1LL * a * b) % p;
}
int add(int a,... | #include <bits/stdc++.h>
using namespace std;using ll=long long;using uint=unsigned int;using pii=pair<int,int>;using pll=pair<ll,ll>;using ull = unsigned long long;using ld=long double;template<typename T>void _(const char*s,T h){cerr<<s<<" = "<<h<<"\n";}template<typename T,typename...Ts>void _(const char*s,T h,Ts...t... |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2")
#define REP(i, N) for (int i = 0; i < (int)N; i++)
using namespace std;
constexpr long long llinf = 1LL << 62;
using ll = long long;
namespace FastIO {
struct Strs {
char strs[10000 * 4];
constexpr Strs() : strs() {
for (int ... | #include <bits/stdc++.h>
#include <vector>
using namespace std;
long long mypow(long a, long b) {
long long powed = 1;
if (b == 0) {
return 1;
} else {
for (long i=0; i<b; i++) {
powed = powed * a;
}
return powed;
}
}
int main() {
long long N;
cin >> N;... |
#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;
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
typedef long long int ll... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define int ll
#define fast(); ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define tests() int t; cin>>t; while(t--)
#define endl '\n'
#define sz(x) ll((x).size())
#define F first
#define S second
#define mp make_pair
#define vi vector <l... |
#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>
#include<unordered_map>
#include<utility>
#include<cassert>
#in... | #include<bits/stdc++.h>
using namespace std;
typedef long long int li;
typedef long double ld;
typedef vector<li> vi;
typedef pair<li,li> pi;
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define B begin()
#define E end()
#define f(i,l,r) for(li i=l;i<=r;++i)
#define fr(i,l,r) for(li i=l;... |
#include<bits/stdc++.h>
#define N 200006
#define LL __int128
#define int long long
using namespace std;
int T,t;
int X,Y,p,q;
int mod1,mod2;
int ai[12],bi[12];
inline int qr()
{
char a=0;int w=1,x=0;
while(a<'0'||a>'9'){if(a=='-')w=-1;a=getchar();}
while(a<='9'&&a>='0'){x=(x<<3)+(x<<1)+(a^48);a=getchar();}
retur... | #include<bits/stdc++.h>
#define rep(i, n) for (Int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(Int i=(n)-1;i>=0;i--)
#define FOR(i,a,b) for(Int i=a;i<=Int(b);i++)
#define __MAGIC__ ios::sync_with_stdio(false);cin.tie(nullptr);
//#include <atcoder/all>
//using namespace atcoder;
typedef long long Int;
const long lon... |
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
#define X first
#define Y second
#define endl "\n"
#define int long long int
#define FASTIO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define rep(i, a, b) for(int i = a; i < (b); ++i)
typedef pair<int, int> pii;
typedef vector<int> vi;
string to_s... | #include <cstring>
#include <iostream>
using namespace std;
typedef long long ll;
int net[1000001]; //指向下一结点的指针
int vis[1000001]; //对每个结点进行不同的标记
int ans, n, ringID, p;
void search()
{
for (int i = 1; i <= n; ++i)
{
if (vis[i]) continue;
p = i;
++ringID; //对每一种环进行一种不同的标记，新的起点... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define PI 3.14159265
template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
using vi = vector<int64_t>;
using vvi = vector<vi>;
using vc = vector<char>;
using vvc = vector<vc>;
using vd = vector<long double>;
using vvd = vector<vd>;
usin... |
#include<bits/stdc++.h>
//#include<atcoder/all>
using namespace std;
//using namespace atcoder;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<int, int>;
#define rep(i,m,n) for(int (i)=(m);(i)<(n);++(i))
#define rrep(i,m,n) for(int (i)=(n)-1;(i)>=(m);--(i))
#define all(x) (x).begin(),(x).end()
... | #include<bits/stdc++.h>
using namespace std;
int main()
{
long long int h,w,i,j,black,white,sum;
cin>>h>>w;
char ar[h][w];
string str;
for (i=0;i<h;i++)
{
cin>>str;
for(j=0;j<w;j++)
ar[i][j]=str[j];
}
sum=0;
for (i=0;i<h-1;i++)
{
for (j=0;j<w-1... |
#include<bits/stdc++.h>
using namespace std;
#define ios ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define scn(n) scanf("%d",&n)
#define lscn(n) scanf("%lld",&n)
#define rep(i,st,n) for(int i=st;i<n;i++)
typedef long long ll;
#define pri(n) printf("%d\n",n)
#define lpri(n) printf("%lld\n",n)
#define var(n) in... | #include<bits/stdc++.h>
#define PI 3.141592653589793238462
#define eps 1e-10
using namespace std;
typedef long long ll;
typedef long double db;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<db,db> pdd;
ll d[3005][3005],mod=998244353;
ll dfs(ll n,ll k){
if(n<k) return 0;
if(k==0) return !n;
... |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
int S = 0, one = 0, two = 0, len = 0;
while(N>0){
if((N%10)%3 == 1){
one++;
}else if((N%10)%3 == 2){
two++;
}
S += N%10;
N = N/10;
len++;
}
if(len == 1){
if(S%3 == 0){
cout << "0"... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;
int main()
{
ll n;
cin >> n;
vector<int> b;
int k = 1;
ll m = n;
while(m > 0){
if(m/10 != 0){
k++;
}
b.emplace_back(m%10);
m/=10;
}
if(n%3==0){
cout << 0 << endl;
return ... |
//tejustiwari
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define all(v) v.begin(),v.end()
#define f(i,a,b,c) for( i=a; i<b;i+=c)
#define rf(i,a,b,c) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
using ll = long long;
ll n;
cin >> n;
ll l = 0, r = 2e9;
while (r - l > 1) {
ll m = (l + r) / 2;
(m * (m + 1) / 2 <= n + 1 ? l : r) = m;
}
cout << n - l + 1 << endl;
return 0;
}
|
#include<bits/stdc++.h>
#define rep(i, n) for (int i = 0, length = n; i < length; 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... | #define rep(i, n) for(int i=0;i<(int)(n);i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
ll A[810][810];
ll B[810][810];
ll S[810][810];
ll n,k;
bool f(ll x){
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
if(A[i][j]<=x) B[i][j]=1;
else B[i][... |
#include<bits/stdc++.h>
#define ll long long
#define dl long double
#define pb push_back
#define F first
#define S second
#define endl "\n"
#define rep(i,a,b) for(i=a;i<b;i++)
#define all(v) v.begin(),v.end(... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n,i,e,j;
//e=1;;
//while(e--)
{
cin>>n;
long a[n],b[n],c[n],max,d;
for(i=0;i<n;i++)
cin>>a[i];
for(i=0;i<n;i++)
cin>>b[i];
c[0]=0;
max=a[0];
for(i=1;i<n;i++)
{
if(a[i]>max)
{
max=a[i];
c[i]=i;
}
else
c[i]=c[... |
#include <iterator>
#include <algorithm>
#include <list>
#include <deque>
#include <string>
#include <iostream>
using namespace std;
int main(){
string str,str2;
cin >> str;
for (int i = str.size()-1;i >=0;i--){
if (str[i] == '0') str.erase(i,1);
else i = -1;
}
str2 =str;
reverse... | #include <iostream>
using namespace std;
int main(){
int n; cin >> n;
if (n==0){
cout << "Yes\n";
return 0;
}
while (n%10==0) n/=10;
int n_inv=0,t=n;
while (t>0) {
n_inv = (t%10)+(n_inv<<3)+(n_inv<<1);
t/=10;
}
cout << (n==n_inv?"Yes\n":"No\n");
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define rev_rep(i, a, b) for (int i = a; i >= b; i--)
#define vi vector<int>
#define pb push_back
#define pi pair<int, int>
#define mod = 1e9 + 7
void __print(int x)
{
cerr << x;
}
void __print(... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define S second
#define F first
#define FAST ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define vll vector<long long int>
#define vld vector<long double>
#define pll pair<long long int,long long int>
#define mod 1000000007
#define mod2 9982... |
#include <bits/stdc++.h>
#define endl "\n"
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef pair<ll, ll> PP;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
#define rrep(i, n) for (ll i = n - 1; i > -1; i--)
#define all(v) v.begin(), v.end()
#define pb push_back
#define fi first
#define se sec... | #include<iostream>
#include<cstdio>
using namespace std;
const int N=5002020,INF=2e9;
int n,m,cnt,tot; char s[2020][2020];
int id[1000],v[N],dis[N],stk[N<<3]; bool vis[N];
int dx[]={1,-1,0,0};
int dy[]={0,0,1,-1};
struct Edge{int to,next,w;}e[N<<4];
void add(int x,int y,int z){
e[++tot].to=y; e[tot].next=v[x]; v[x]=to... |
#include<bits/stdc++.h>
#define ll long long
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define w(t) ll t;cin>>t;while(t--)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define fo(i,a,n) for(ll i=a;i<n;i++)
#define prec... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
ll x,a[55];
map<ll,ll> mem[55];
ll dfs(const int& i,const ll& v){
if(i==0)return v==0;
if(mem[i].find(v)!=mem[i].end())return mem[i][v];
ll nv=v%a[i];
mem[i][v]=dfs(i-1,nv);
if(nv&&a[i]+v!=a[i+1]+nv)mem[i][v]+=dfs(i-1,a[i]-... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
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 (a>b) { a=b; return 1; } return 0; }
const int MOD = 1e9+7;
const int INF = 0x3f3f3f3f;
const ll LLI... | #include <iostream>
#include <algorithm>
#include <iomanip>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <cstdlib>
#include <cstdio>
#include <vector>
#include <stdlib.h>
#include <cstring>
#include <cmath>
#include <math.h>
#include <string>
typedef long long ll;
using namespace std;
#defin... |
#include <iostream>
#include <cstring>
#include <vector>
using namespace std;
int main(void){
int N, M;
cin >> N >> M;
vector<int> node;
node.reserve(N);
int input;
for(int i=0; i<N; ++i){
cin >> input;
node.push_back(input);
}
for(int i=0; i<N; ++i){
cin >> input;
node.at(i)-=input;
}
long long int... | #include <iostream>
#include <iomanip>
#include <cstdlib>
#include <cstring>
#include <string>
#include <bitset>
#include <cmath>
#include <algorithm>
#include <climits>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
using namespace std;
//infの設定
#define INF32 2147483647
#define INF6... |
#include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define pf push_front
#define ff first
#define ss second
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define gcd(a,b) __gcd((a),(b))
#define lcm(a,b)... | #define _USE_MATH_DEFIMES
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <ioman... |
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> pii;
typedef vector<int> vii;
typedef vector<pii> vpii;
typedef unordered_map<int,int> umap;
typedef long double ld;
#de... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define rep(i,n) for(int i=0;i<(n);i++)
#define mod (1000000007)
int main()
{
int N,W;
cin >> N >> W;
cout << (N / W) << endl;
} |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define debug(x) cerr << #x << " : " << x << endl;
using namespace std;
using ll = long long;
vector<string> s(800);
vector<vector<char>> a(20, vector<char>(20));
// 部分列は構成済みか
vector<bool> used(800, false);
int main() {
int n, m;
... | #include <iostream>
#include <vector>
#include <tuple>
#include <algorithm>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#define ll long long
#define rep(i,n) for(int i = 0;i < (int)n;i ++)
using namespace std;
ll n,m;
vector<vector<ll>> ans(20,vector<ll>(20,-1));
vector<vector<ll>> a;
vector<tuple<... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
const ll LongINF=1e13+7;
const int INF=1e9+7;
const int dx[]={0,1,0,-1};
const int dy[]={1,0,-1,0};
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
temp... | #include <iostream>
using namespace std;
int main()
{
int n,m;
int c;
cin>>m>>n;
cout<<(( 2*m+100)-n);
}
|
#include<iostream>
#include<bits/stdc++.h>
#include<vector>
#define vi vector<int>
#define lli long long int
#define fo(i,n) for(int i=1;i<=n;i++)
#define foo(i,n) for(int i=0;i<n;i++)
#define ff first
#define ss second
#define pb push_back
#define vii vector<lli>
#define ok ios_base::sync_with_stdio(false); cin.tie(NU... |
//#pragma GCC target("avx2")
#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() {
c... |
#include <bits/stdc++.h>
using namespace std;
#define SF(A) sort(A.begin(), A.end())
#define LF(A) sort(A.rbegin(), A.rend())
#define COUNT(A,B) count(A.begin(),A.end(),B)
#define REP(i,b,e) for(i=b;i<e;i++)
int main()
{
int i;
long long int A, B, C, D, b, r;
cin >> A >> B >> C >> D;
if (B >= C * D)
{
cout << "... | #include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
#define rep(i,n) repi(i,0,n)
#define repi(i,a,n) for(ll i=a;i<(ll)n;++i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define Show(val) cout<<(val)<<" "
#define Showl... |
#include <iostream>
#include <vector>
#include <iomanip>
#include <string>
#include <algorithm>
#include <cmath>
#include <map>
#include <functional>
using ll = long long;
using vll = std::vector<ll>;
using namespace std;
#define REP(i, x, n) for(int i = x; i < (n); i++)
#define rep(i, n) REP(i, 0, n)
template<class T... | #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[... |
#include <bits/stdc++.h>
#define endl "\n"
using namespace std;
void setup() {
#ifdef LOCAL
freopen("input", "r", stdin);
#else
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#endif
}
int main() {
setup();
int N, W;
cin >> N >> W;
long long line[200020];
memset(l... | #include "bits/stdc++.h"
typedef long long ll;
#define all(x) (x).begin(), (x).end() // sortなどの引数を省略
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define max3(x, y, z) max(x, max(y, z))
#define min3(x, y, z) min(x, min(y, z))
#ifdef _MSC_FULL_VER //デバッグ出力
#define dout cout
#define debug() if (true)
#define c... |
/**
* author: Eccentric_9
* created: 12.05.2021 17:34:05
**/
#include<bits/stdc++.h>
using namespace std;
/*-----<Defines>-----*/
#define fast() ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define all(x) begin(x),end(x)
#define rz(x) resize(x)
#define asn(... | #include<iostream>
#include<iomanip>
#include<cassert>
#include<math.h>
#include<complex>
#include<algorithm>
#include<utility>
#include<queue>
#include<stack>
#include<string.h>
#include<string>
#include<set>
#include<map>
#include<unordered_map>
#include<functional>
#include<vector>
#include<bitset>
using namespace s... |
#include<bits/stdc++.h>
typedef long long ll;
#define int ll
using namespace std;
const int mod = 1e9+7;
const int MAXN = 100000005;
signed main(){
std::ios::sync_with_stdio(false);
int a,b,c;
cin >>a >> b>>c;
c *= 1000;
int maxn,minn;
minn = c/b;
maxn = c/a;
if(c-minn*b <= minn*(b-a) &... |
#include<bits/stdc++.h>
#define int long long
#define rd(x) x=read()
#define seg(x,y) (seg){x,y}
using namespace std;
const int N=1e5+5;
const int M=505;
const int inf=0x3f3f3f3f;
const int mod=1e9+7;
inline int read(){int x=0,f=1;char ch=getchar();while(ch>'9'||ch<'0'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<... |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<vector<int>> vvi;
typedef vector<vector<long long>> vvl;
const int INF=1e8;
void chmin(int& x, int y){ x=min(x,y);}
int main(){
int n;
cin >... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,n,m) for(int i=(int)(n); i<=(int)(m); i++)
#define RFOR(i,n,m) for(int i=(int)(n); i>=(int)(m); i--)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define RITR(x,c) for(__typeof(c.rbegin()) x=c.rbegin();x!=c.rend... |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
const long long inf = 1LL<<60;
using ll = long long;
int main(){
double a, b;
cin >> a >> b;
cout << fixed << setprecision(10) << b*a/100.0 << endl;
}
| #include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define nl "\n"
#define sp " "
#define rep(i,n) for(i=0;i<n;i++)
#define repe(i,e,n) for(i=e;i<=n;i++)
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define vl vector<ll>... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int inf = 1e12;
#define D long double
#define NeedForSpeed ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
int MOD = 1000000007;
#define fi first
#define se second
#define endl '\n'
// random_device rd;
// mt19937 rng(rd());
// int ge... | #include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define ms(s, n) memset(s, n, sizeof(s))
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORd(i, a, b) for (int i = (a) - 1; i >= (b); --i)
#define... |
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <cmath>
#include <cstring>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <unordered_map>
#include <fstream>
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define max(a,b) (a>b?a:b)
#define ... | #include<bits/stdc++.h>
#define F first
#define S second
#define LL long long
#define MP make_pair
#define PB push_back
#define I insert
const LL mod=1000000007, N=200005;
using namespace std;
LL n, m, i, j, k, l, r, t, ans[N];
LL fix[N], p[N], fox[N];
vector < LL > v[N];
void go ( LL u, LL par = 0 ){
fix[u] = fix[... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pi pair<int,int>
#define f first
#define s second
#define ld long double
signed main()
{
ios_base::sync_with_stdio(0);
cin.tie(nullptr);
int x,y;
cin>>x>>y;
if(x>y)
swap(x,y);
if(y-x<3)
cout<<"Yes";
else
... | #include<bits/stdc++.h>
#define ll long long
#define x first
#define y second
#define pi pair
#define K 1000000007
using namespace std;
ll a[2000000];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll test_case=1;//cin>>test_case;
while(test_case--)
{
ll m,h;cin>>m>>h;
if(h%m==0)... |
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
int main(){
ll b,c;
cin>>b>>c;
if(b==0) cout<<c<<endl;
else if(b>0){
if(c==1) cout<<2<<endl;
else if(c==2) cout<<3<<endl;
else cout<<c-1+min... | #include "bits/stdc++.h"
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define per(i,a,n) for(int i=n;i>=a;i--)
#define pb push_back
#define mp make_pair
#define FI first
#define SE second
#define maxn 200000
#define mod 1000000007
#define inf 0x3f3f3f3f
template<class T> bool chmax(T &a, const T &b) {if(a<b) {a=b; return 1... |
#include "bits/stdc++.h"
using namespace std;
#define int long long
using ll = long long;
using P = pair<ll, ll>;
const ll INF = (1LL << 61);
ll mod = 998244353;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) :x((x%mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint& operator+=(const... | #line 2 "/Users/kaage/Desktop/ProgrammingWorkspace/library/other/template.hpp"
#define _CRT_SECURE_NO_WARNINGS
#pragma target("avx2")
#pragma optimize("O3")
#pragma optimize("unroll-loops")
#include <string.h>
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmat... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repp(i, st, en) for (ll i = (ll)st; i < (ll)(en); i++)
#define repm(i, st, en) for (ll i = (ll)st; i >= (ll)(en); i--)
#define all(v) v.begin(), v.end()
void c... | #include <bits/stdc++.h>
using namespace std;
int main () {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int T = 1;
//~ cin >> T;
for (int test_case = 1; test_case <= T; ++test_case) {
int n,m;
cin >> n >> m;
pair<int,int> a[m + 1];
for (int i = 1; i <= m; ++i) cin >> a[i].... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=1;i<=n;++i)
#define mp make_pair
#define pb push_back
#define rep(i,n) for(int i=1;i<=n;++i)
#define size sze
typedef long long LL;
const int pri[15]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47};
int n;
int a[100];
int main()
{
cin>>n;
for(i... | #include<bits/stdc++.h>
using namespace std;
const int MAX = 200010;
bool is[MAX];
int main(){
int N;
cin >> N;
int ans = 0;
for(int i=0; i<N; i++){
int x;
cin >> x;
is[x] = true;
while(is[ans]){
ans++;
}
cout << ans << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int solve(int h, int w, vector<string> s) {
int res = 0;
for(int i = 0; i < h - 1; i++) {
for(int j = 0; j < w - 1; j++) {
int black = 0;
if(s[i][j] == '#')
black++;
if(s[i][j + 1] ==... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int(i)=0;i<(n);i++)
int main(){
int h,w,ans=0;
vector<string> s(11);
cin>>h>>w;
REP(i,h) cin>>s.at(i);
REP(i,h) REP(j,w){
if(s.at(i).at(j)=='#'){
int dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
bool f[4]={0,0,0,0};
REP(k,4){
... |
//yukicoder@cpp14
//coder:luckYrat(twitter:@luckYrat_)
//dijkstraから逃げるな
//おすすめの曲
//https://soundcloud.com/nagiha/alice-in-a-xxxxxxxx
//https://soundcloud.com/synthion/sweetheart
//せんげん！
#include <iostream>
#include <cmath>
#include <algorithm>
#include <iomanip>
#include <string>
#include <vector>
#include <set>
#in... | #include<bits/stdc++.h>
using namespace std;
int n, x[50];
int prime[] = {2,3,5,7,11,13,17,19,23,29,31,37,41,43,47};
int gcd(long long a, long long b) {
return b ? gcd(b, a % b) : a;
}
int main() {
cin >> n;
for (int i = 1; i <= n; i++) cin >> x[i];
long long ans = 0x3f3f3f3f3f3f3f3f;
for (int i = 0; i < (1<<15); ... |
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#define ll long long
#define MAXN 300005
#define uns unsigned
#define INF 0x3f3f3f3f
using namespace std;
inline ll read(){
ll x=0;bool f=1;char s=getchar();
while((... |
#include <bits/stdc++.h>
using namespace std;
long long diff;
map<long long, long long> dp;
long long fun(long long n, long long m)
{
if(n>=m)
return dp[m] = (n-m);
long long res=m-n;
if(m%2)
{
long long r1, r2;
if(!dp[m-1])
r1 = fun(n, m-1);
else
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int maxn=1e6+5;
//const int mod = 1000000007;
const int mod = 998244353;
template<long long MOD>
struct ModInt{
using ll = long long;
ll val;
void setval(ll v) { val = v % MOD; };
ModInt(): val(0) {}... | #include<iostream>
using namespace std;
int main(){
int T;
cin >> T;
long long j, c[T];
for(int i = 0; i < T; i++){
cin >> j;
c[i] = j;
}
for(int i = 0; i < T; i++){
if(c[i] % 2 != 0){
cout << "Odd\n";
} else if(c[i] % 4 == 0){
cout << "E... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
//#define mn LLONG_MAX
//#define mx LLONG_MIN
#define mod 1000000007
#define f(i,a,b) for(ll i=a;i<b;i++)
#define pb(a) push_back(a)
ll prime[][2]={{0,0},{2,3},{11,13},{101,103},{1009,1013},
{10007,10009},{100003,100013},{100000... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
vector<bool> t(n,false);
bool ans = true;
for(int i=0; i<n; i++){
int a; cin >> a;
if(t[a-1]) ans = false;
t[a-1] = true;
}
if(ans) cout << "Yes" << endl;
else cout << "No" << endl;
} |
#define DEBUG 0
#include <bits/stdc++.h>
#define all(v) (v).begin(), (v).end()
#define pb push_back
#define rep(i,n) for(int i=0; i<(n); i++)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define REP(i, begin, end) for(int i = int(begin); i < int(end); i++)
using namespace std;
using ll = long long;
using ld = long ... | #include <bits/stdc++.h>
using namespace std;
#define ffor(i, a, b) for (int i = a ; i <= (int) b ; i++)
#define rfor(i, a, b) for (int i = (int) a ; i >= b ; i--)
#define vec vector
#define PB push_back
#define MP make_pair
#define MT make_tuple
#define F first
#define S second
using ll = long long int;... |
//#include <atcoder/all>
#include <bits/stdc++.h>
//using namespace atcoder;
using namespace std;
typedef long long ll;
#define MOD (long long)(1e9+7)
#define INF (1LL<<60)
#define rep(i,n) for(ll i = 0; i < (n); i++)
#define rep1(i,n) for(ll i = 1; i <= (n); i++)
template<class T> inline bool chmin(T& a, T b) {
if... | #include <bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define ff first
#define ss second
#define pb push_back
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define ps(x) fixed << setprecision(10) << x
#define mod 1000000007
#define inf 1e18
#define w(tc) int tc; cin >... |
#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <climits>
#include <cmath>
#include <complex>
#include <functional>
#include <cassert>
#include <stack>
#include <numeric>
#include <iomanip>
#include <limits>
#include <random>
#include <unordered_set>
#i... | #pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
inline int my_getchar_unlocked(){
static char buf[1048576];
static int s = 1048576;
static int e = 1048576;
if(s == e && e == 1048576){
e = fread_unlocked(buf, 1, 1048576, stdin);
s = 0;
}
if(s == e){
return EOF;
}
r... |
#include <bits/stdc++.h>
#define ll long long
#define str string
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second
#define vc vector<char>
#define vvc vector<vc>
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define vvll vector<vll>
#define vvvll vector<vvll... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
char win[256][256];
int main()
{
// editorial
// 区間長2nの隣同士の対戦結果から
// 区間長nの列を生成
win['R']['R'] = win['R']['S'] = win['S']['R'] = 'R';
win['P']['P'] = win['P']['R'] = win['R']['P'] = 'P';
win['S']['S'] ... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const long long INF = 1LL << 60;
struct Edge {
int to;
pair<ll,ll>w;
Edge(int to, pair<ll,ll> w) : to(to), w(w) {}
};
using Graph = vector<vector<Edge>>;
template<class T> bool chmin(T& a, T b) {
if (a > b) {
a = b;
re... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define nline "\n"
const ll M1=1e9+7;
const ll M=998244353;
const ll N=100005;
const ll INF_ADD=1e18;
const ll INF_MU... |
#include <bits/stdc++.h>
using namespace std;
/* MAGIC */
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
/* ALIASES */
typedef long long lli;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<lli, lli> pl;
typedef pair<ld, ld> pd;
typedef vector<int> v... | #include<cstdio>
#include<cmath>
using namespace std;
int a,b,c;
int main() {
scanf("%d%d%d",&a,&b,&c);
if(c%2==0) {
a=abs(a);
b=abs(b);
}
if(a>b)
printf(">");
else if(a==b)
printf("=");
else
printf("<");
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#include <algorithm>
#define ll long long int
#define pb push_back
#define fo(i, n) for (int i = 0; i < n; i++)
#define vct vector<long long int>
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n;
cin>>n;
ll ans =0;
... | /*
これを入れて実行
g++ code.cpp
./a.out
*/
#include <iostream>
#include <cstdio>
#include <stdio.h>
#include <vector>
#include <string>
#include <cstring>
#include <queue>
#include <deque>
#include <stack>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define MOD 1000000007
ll powermd(long long x, int y, ll p)
{
ll res = 1; // Initialize result
x = x % p; // Update x if it is more than or
// equal to p
// if (x == 0) return 0; // In case x is divisible by p;
... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author aajisaka
*/
#include<bits/stdc++.h>
using namespace std;
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T... |
/*
ID:ACwisher
LANG:C++
TASK:
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
//const int N=;
typedef long long ll;
ll n;
int m;
int power(int a,ll b,int mo){
int ret=1;
while(b){
if(b&1) ret=1ll*ret*a%mo;
a=1ll*a*a%mo; b>>=1;
}
return ret;
}
int main(){
// freopen(".in","r",stdin);
// fr... | /*########################################################################
# File Name: A.cpp
# Author: SoMnus_L
# Mail: lr599909928@gmail.com
# Created Time:日 1/10 14:45:58 2021
########################################################################*/
#include <bits/stdc++.h>
#define ll long long
#define fi first
#d... |
#include <iostream>
#include <vector>
#include <map>
using namespace std;
typedef long long ll;
ll INF = 1000000000000000;
struct segment_tree{
int n; vector<ll> seg;
segment_tree(vector<ll> v){
n = v.size(); seg.resize(2*n);
for(int i=0;i<n;i++) seg[i + n] = v[i];
for(int i=n - 1;i>0;i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using ull = unsigned long long int;
using P = pair<int, int>;
using P3 = pair<int,P>;
using PP = pair<P, P>;
constexpr int INF32 = 1 << 29;
constexpr ll INF64 = 1LL << 62;
constexpr ll MOD = 1000000007;
// constexpr ll MOD = 998244353;
constexpr i... |
// #pragma GCC optimize("Ofast,unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include <bits/stdc++.h>
#define ll long long int
#define vi vector<int>
#define vvi vector<vector<int>>
#define vll vector<long long>
#define vs vector<string>
#define vc vector<char>
#de... | #include <bits/stdc++.h>
using namespace std;
#define INF ((int64_t)1e16)
int main()
{
int N;
int64_t X;
cin >> N >> X;
vector<int64_t> A(N);
for (auto &a : A)
{
cin >> a;
}
vector<int64_t> cnt(N);
for (int i = 0; i < N; i++)
{
int j = N - 1 - i;
cnt.at(... |
#include "bits/stdc++.h"
//#include "atcoder/all"
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
//const bool debug = false;
#define rep(i, n... | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <string.h>
using namespace std;
#define int long long
#define f first
#define s second
#define pb push_back
#define pii pair<int, int>
signed main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int a, b, ans = 0;
cin >> a;
for (int... |
//#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
template <class A, class B> inline bool chmax(A &a, const B &b) { return b > a && (a = b, true); }
template <class A, class B> inline bool chmin(A &a, const B &b) { return b < a && (a = b, true); }
typedef long long ll;
typedef vector<int> vint;
type... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define fi first
#define se second
#define all(x) x.begin(),x.end()
#define sz(x) (int)x.size()
#define pb push_back
#define faster ios_base::sync_with_stdio(0);cin.tie(0);
#define mem(a,v) memset(a,v,sizeof(a))
const ll INF=... |
#include <bits/stdc++.h>
using namespace std;
mt19937 rng(58);
typedef double db;
const int N = 10000;
bool sold[N][N];
struct rect{
int lx, ly, rx, ry;
rect(){}
rect(int x, int y){
lx = x; rx = x + 1;
ly = y; ry = y + 1;
}
rect(int _lx, int _ly, int _rx, int _ry){
lx = _lx; ly = _ly;
rx = _rx; ry = _ry... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned uint;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ldbl;
typedef pair<int, int> pii;
typedef pair<uint, uint> puu;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pull;
typedef pair<double, double> pdd;
typedef vector<int> vi... |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <chrono>
#include <typeinfo>
using namespace std;
using namespace std::chrono;
using namespace __gnu_pbds;
#define lli long long int
#define fr(i,a,b) for(lli i=a;i<b;i++)
#define bfr(i,a,b) for(lli i=a;i>... | #include<iostream>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<algorithm>
#include<cstring>
using namespace std;
int n, m;
bool visited[20][20];
int recur(int x, int y, int a, int b)
{
int ret = 0;
if (y == m)
{
x++;
y = 0;
}
if (x == n)
{
return... |
#include <iostream>
#include <math.h>
#include <numeric>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <queue>
#include <queue>
#include <stack>
#include <sstream>
#include <set>
typedef long long ll;
const int dx[8]={1,0,-1,0,1,-1,-1,1};
const int dy[8]={0,1,0,-1,1,1,-1,-1};
cons... | #include<bits/stdc++.h>
using namespace std;
using namespace std::chrono;
const int mod=1e9+7;
const int mex=300005;
#define ll long long
#define test int t;cin>>t;while(t--)
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);
#define fo(i,a,n) for(int i=a;i<n;i++)
#define rfo(i,a,b) for(int i=a;i>=b;i--)
#... |
#include <bits/stdc++.h>
#define rep(i, n) for (auto i = 0; i < n; ++i)
#define ALL(a) a.begin(), a.end()
using namespace std;
using ll = long long int;
const int MOD_NUM = 1e9 + 7;
int main() {
// Input
int T;
cin >> T;
rep(i, T) {
// Input
int L, R;
cin >> L >> R;
... | #include<bits/stdc++.h>
#define fo(i,a,b) for((i)=(a);i<=(b);i++)
#define rfo(i,a,b) for((i)=(a);i>=(b);i--)
#define inrange(x,y,z) (((x)>=(y))&&((x)<=(z)))
#define ALL(vec) (vec).begin(),(vec).end()
#define SOR(vec) sort(ALL(vec))
#define UNI(vec) (vec).erase(unique(ALL(vec)),(vec).end())
using namespace std;
int n;
l... |
#include<iostream>
using namespace std;
class Solver {
private:
int sy, sx, gy, gx, result;
string ans;
public:
void input() {
cin >> sy >> sx >> gy >> gx;
ans = "";
}
void output() {
cout << ans << endl;
}
void getResult() {
cin >> result;
}
void ... | //By: Luogu@rui_er(122461)
#include <bits/stdc++.h>
#define rep(x,y,z) for(int x=y;x<=z;x++)
#define per(x,y,z) for(int x=y;x>=z;x--)
#define debug printf("Running %s on line %d...\n",__FUNCTION__,__LINE__)
using namespace std;
typedef long long ll;
const int N = 1e5+5;
int n, ans; char s[N];
template<typename T> void... |
#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"
using namespace std;
#define rep(i, a, b) for(int i=a; i<=b; i++)
#define trav(a, x) for(auto& a : x)
#define all(x) begin(x), end(x)
#define sz(x) (int) x.size()
#define f first
#define s second
#define nl "\n"
#define pb push_back
typedef long long ll;
typedef vector<int> vi;
typedef pair<in... |
#include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
#include <functional>
#include <cmath>
#include <set>
#include <queue>
#include <deque>
#include <vector>
#include <climits>
#include <sstream>
#include <iomanip>
#include <map>
#include <stack>
using namespace std;
using ui = unsigned int;
u... | #include <bits/stdc++.h>
using namespace std;
#define ull unsigned long long
#define ll long long
#define ui unsigned int
#define us unsigned short
#define inf_int 1e9
#define inf_ll 1e18
#define mod 1000000007
#define smod 998244353
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// freo... |
# pragma GCC optimize ("O3")
# pragma GCC optimize ("Ofast")
# pragma GCC optimize ("unroll-loops")
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i = (a); i < (b); i++)
#define rep2(i,a,b) for(int i = (b) - 1; i >= (a); i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int... | #include <bits/stdc++.h>
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
#define rep(i, n) for(int i = 0, i##_len=(n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
#define len(x) ((int)(x).size())
void _cin() {} template <class Head, class... Tail> void _cin(Head&& head, Tail&&... ... |
#include <bits/stdc++.h>
#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for(int(i) = (m); (i) < (n); (i)++)
#define ALL(v) (v).begin(), (v).end()
#define LLA(v) (v).rbegin(), (v).rend()
#define SZ(v) (v).size()
#define INT(...) \
... | #include<string>
using namespace std;
#include<bits/stdc++.h>
#define lli long long int
#define mods 1000000007
#define pb push_back
#define mp make_pair
#define fio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
int main(){
lli n,w;
cin>>n>>w;
cout<<n/w;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef long double ld;
typedef pair<ll, ll> pll;
#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 ms memset
#define pb p... | //#include <bits/stdc++.h>
using namespace std;
#include <iostream>
int main() {
int A1,A2,A3;
cin>>A1>>A2>>A3;
if( A3-A2==A2-A1 || A3-A1==A1-A2 ||A2-A1==A1-A3 ||A2-A3==A3-A1 ||A1-A2==A2-A3 ||A1-A3==A3-A2 )
{
cout<<"Yes"<<endl;
}
else
{
cout<<"No"<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
typedef long long ll;
int main(){
string s; cin>>s;
ll cnt=0;
for(int k=0; k<10000; k++){
bool ans=true;
string r=to_string(k);
if(r.size()<4) r=string(4-r.size(),'0')+r;
for(int i=0; i<10; i++){
if(s[i]=='o'){
bo... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define int long long
#define ll long long
#define F(type, i, a, b, incr) for (type i = a; i <= (type)(b); i += (type)(incr))
#define RF(type, i, a, b, decr) for (type i = a; i >= (type)(b); i -= (type)(decr))
#define sz(a) sizeof(a)
#define deb(a) cerr ... |
#include <iostream>
using namespace std;
int main(){
int n;
cin >> n;
if (n%2 == 0) cout << "White" << endl;
else cout << "Black" << endl;
} | #include <bits/stdc++.h>
using namespace std;
#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 _GLIBCXX_DEBUG
int main(){
int N;
cin >> N;
if(N%2 == 0){
cout << "White" << endl;
}
else{
cout << "Black" <<endl;
}
} |
#include <iostream>
using namespace std;
int main() {
int n, w;
cin >> n >> w;
cout << n/w << endl;
return 0;
} | #include <iostream>
using namespace std;
//ios::sync_with_stdio(0);
//cin.tie(0);
int main() {
int a, b;
cin >> a >> b;
int mn = min(a, b);
int mx = max(a, b);
string ans = mn + 3 > mx ? "Yes" : "No";
cout << ans;
return 0;
} |
#include<bits/stdc++.h>
#define ll long long int
#define vll vector<ll>
#define mod 1e9+7
#define endl "\n"
#define fast ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define pb push_back
#define inp(V,n) for(int i=0;i<n;i++){cin >> V[i];}
#d... | #pragma GCC optimize("Ofast")
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // ... |
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define rep(i, n) FOR(i, 0, n - 1)
using namespace std;
typedef long long ll;
template <class T>
inline bool dpmin(T& a, T b)
{
if (a > b)
{
a = b;
return 1;
}
return 0;
}
template <class T>
inline bool dpmax(... | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cstdlib>
#include<cmath>
#include<map>
#include<queue>
#include<stack>
#include<set>
#include<iomanip>
#include<iterator>
#include<sstream>
using namespace std;
const long long mod=1000000007;
int main()
{
long long n,m... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main()
{
int V,T,S,D;
cin>>V>>T>>S>>D;
if(D*1.0/V>=T&&D*1.0/V<=S) cout<<"No\n";
else cout<<"Yes\n";
return 0;
} | #include <bits/stdc++.h>
#ifdef local
#define debug(args...) qqbx(#args, args)
template <typename ...T> void qqbx(const char *s, T ...args) {
int cnt = sizeof...(T);
((std::cerr << "(" << s << ") = (") , ... , (std::cerr << args << (--cnt ? ", " : ")\n")));
}
#else
#define debug(...) ((void)0)
#endif // local
#... |
#include<iostream>
#include<string>
#include<vector>
#include<set>
#include<iomanip>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
using Graph = vector<vector<int>>;
#define FOR(i,a,b) for(size_t i=(a); i<(b); ++i)
#define REP(i, n) FOR(... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
vector<string> s;
cin>>n;
for(int i=0;i<n;i++)
{
string temp;
cin>>temp;
s.push_back(temp);
}
long long int power[60];
power[0] = 1;
for(int i=1;i<=60;i++)
power[i] = power[i-1] * 2;
... |
#include<stdio.h>
static inline int IN(void)
{
int x=0,f=0,c=getchar();while(c<48||c>57){f^=(c==45),c=getchar();}
while(c>47&&c<58){x=x*10+c-48,c=getchar();}return f?-x:x;
}
static inline void OUT(long x){if(x<0){putchar('-'),x=-x;}if(x>=10){OUT(x/10);}putchar(x%10+48);}
static inline long Min(long a,long b){return... | #include<bits/stdc++.h>
#define maxn 200010
#define int long long
// #define maxn
// #define mod
using namespace std;
const long long INF=1ll<<60;
// template<class T>T ABS(T x) {return x<0?-x:x;}
//int ksm(int x,int y) {int r=1;while(y) y&1?r=1ll*r*x%mod:0,x=1ll*x*x%mod,y>>=1;return r;}
int read()
{
int s=0,w=1;
... |
#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;
bool comp(const pair<ll, ll> a, const pair<ll, ll> b) {
if (a.first == b.first) {
return a.second < b.second;
} else {
return a.first < b.first;
}
}
ll Kth(vector<pair... | /*
* Author: Moon-light
*/
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define lowbit(x) ((x)&(-x))
#define sz(x) ((int)x.size())
#define fr(x) freopen(x,'r',stdin)
#define fw(x)... |
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cassert>
#include<iostream>
#include<iomanip>
#include<map>
#include<unordered_map>
#include<set>
#include<unordered_set>
#include<vector>
#include<algorithm>
#include<string>
#include<queue>
using namespace std;
#define DEBUG(x) cout<<#x<<"="<<x<<endl
#define... | #include <bits/stdc++.h>
constexpr int DEBUG = 0;
using namespace std;
using int64 = long long;
#define REPEAT(i, l, r) for (int i = (int)(l); i < (int)(r); i++)
using Complex = complex<double>;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(10);
int n; cin >> n;
double... |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);i++)
#define N 100
#define INF 1000000005
#define INFLL (ll)1e17
#define ER 1e-10
#define PI 3.1415926535897
typedef long long ll;
#define ALL(v) (v).begin(),(v).end()
#define SZ(x) int(x.size())
#define IN(a) cin>>(a)
#define OUT(a) cout<... | #include <bits/stdc++.h>
#define fir first
#define sec second
#define PB push_back
#define MP make_pair
using namespace std;
#define REP(i, _a, _b) for (int (i) = (int)(_a); (i) < (int)(_b); (i)++)
#define REV(i, _b, _a) for (int (i) = (int)(_b) - 1; (i) >= (int)(_a); (i)--)
template <class T> void chkmax(T& x, T y)... |
#include<bits/stdc++.h> /*--------------->Logic%2==0---------------->*/
#define CASE(t) printf("Case %d: ",t)
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) ((a)*(b))/gcd(a,b)
#define PI 2*acos(0.0)
#define ll long l... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define rREP(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, a, b) for (int i = a; i <= b; ++i)
#define rFOR(i, a, b) for (int i = a; i >= b; --i)
#define aFOR(i, V) for (auto i : V)
#define ALL(vec) ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.