code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);i++)
#define ALL(v) v.begin(),v.end()
#define int long long
template<typename T>
void chmin(T &a,T b){
if(a>b)a=b;
}
template<typename T>
void chmax(T &a,T b){
if(a<b)a=b;
}
const int INF=1e9+1;
signed main(){
int n;cin>>n;
vect... | #include <bits/stdc++.h>
using namespace std;
const int N=2e5+10;
long long dis(long long x,long long y){
return abs(x-y);
}
int main()
{
int n;
scanf("%d",&n);
vector<int> lft(n+1,1e9),rit(n+1,-1e9),C;
for(int i=0;i<n;++i){
int x,c;
scanf("%d%d",&x,&c);
lft[c]=min(lft[c... |
//雪花飄飄北風嘯嘯
//天地一片蒼茫
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
#define se seco... | #include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
// using namespace atcoder;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = "... |
// C++ program to implement Best First Search using priority
// queue
#include <bits/stdc++.h>
using namespace std;
typedef pair<long long, int> pi;
struct node {
int next, c, d;
node(int next, int c, int d) {
this->next = next;
this->c = c;
this->d = d;
}
};
vector<vector<node> > ... | #include <cstdio>
#include <algorithm>
#include <ctype.h>
const int bufSize = 1e6;
#define int long long
inline char nc()
{
#ifdef DEBUG
return getchar();
#endif
static char buf[bufSize], *p1 = buf, *p2 = buf;
return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, bufSize, stdin), p1 == p2) ? EOF : *p1... |
#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;
typedef tree<pair<int,int>,null_type,less<pair<int,int>>,rb_tree_tag,tree_order_statistics_node_update> oset;
#define sim template < class c
#define ris return * this... | #include<bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
mt19937_64 mrand(chrono::steady_clock::now().time_since_epoch().count());
//mt19937_64 mrand(42);
#define ii for(int i=1;i<=n;++i)
#define ji for(int j=1;j<=n;++j)
#define jj for(int j=1;j<=m;++j)
#define ij for(int i=1;i<=m;++i... |
#include <iostream>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <iterator>
#include <cassert>
#include <numeric>
#include <functional>
#include <ctime>
#pragma war... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
const int M = 998244353;
int n,m;
vector<bool> num(210000,true);
vector<int> prime(210000,-1);
vector<ll> fac(210000); //n!(mod M)
vector<ll> ifac(210000); //k!^{M-2} (mod M)
inline ll mpow(ll x, ll n){ //x^n(mod M) ←普通にp... |
// Problem: E - Unique Color
// Contest: AtCoder - AtCoder Beginner Contest 198
// URL: https://atcoder.jp/contests/abc198/tasks/abc198_e
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include<bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_st... | #include <bits/stdc++.h>
using namespace std;
const int mod=998244353;
int n;
int a[200005];
int b[200005];
int vis[200005];
int main()
{
scanf("%d",&n);
for (int i=1;i<=n;i++)
{
scanf("%d",&a[i]);
b[a[i]]++;
}
int tmp=1;
for (int i=1;i<=n;i++)
{
if (vis[i]==0 && b[i... |
#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... | /*
* @Author: Krishnakant
* @Date: 2021-03-19 23:18:20
* @Last Modified by: Krishnakant
* @Last Modified time: 2021-03-20 01:23:11
*/
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
using namespace std;
typedef long long ll;
#de... |
#include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 1000000007;
const ll LINF = 1LL << 60;
co... | #include<iostream>
#include<algorithm>
#include<numeric>
#include<queue>
#include<vector>
using namespace std;
const int BUF = 400005;
int nVal;
int val[BUF];
void read() {
cin >> nVal;
nVal *= 2;
for (int i = 0; i < nVal; ++i) {
cin >> val[i];
}
}
void work() {
long long sum = accumulat... |
#include <bits/stdc++.h>
#define fst first
#define snd second
#define ll long long
#define ld long double
#define pb push_back
#define emp emplace_back
#define pii pair<int, int>
#define usg unsigned
#define sg signed
#define mp make_pair
using namespace std;
void setIO(){
ios::sync_with_stdio(0);
cin.tie(0); c... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll> ;
#define rep(i,n) for(ll i=0;i<(n);i++)
#define fastio ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define inf 1LL<<60;
ll min(ll a,ll b){return a>=b ? b:a;}
ll max(ll a,ll b){return a>=b ? a:b;}
ll dist[1<<18];
typedef... |
#include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
typedef long long ll;
typedef long double ld;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define mod 1000000007
#define pii pair<ll,ll>
#define inf 1000000000000000000
#define bpc(x) __... | #include<bits/stdc++.h>
using namespace std;
const int N=500010;
char s[N],t[N];
int sta[N],top;
int n;
void fail(){printf("-1\n");exit(0);}
int main(){
scanf("%d",&n);
scanf("%s",s+1);
scanf("%s",t+1);
int las=0;
for(int i=n;i>=1;i--) if(t[i]=='1') sta[++top]=i;
long long ans=0;
for(int i=1;i<=n;i++)
if(s[... |
//Author: RingweEH
#include <cstdio>
#include <cstring>
#include <algorithm>
#define ll long long
#define db double
using namespace std;
const int L=1<<20;
char buf[L],*p1,*p2;
#define getchar() (p1==p2?(p2=buf+fread(p1=buf,1,L,stdin),p1==p2?EOF:*p1++):*p1++)
int read()
{
int x=0,w=1; char ch=getchar();
while (... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
typedef vector<int> VI;
typedef vector<VI> VVI;
#define REP(i,n) for(ll i=0;i<(n);i++)
#define ALL(v) v.begin(),v.end()
constexpr ll MOD=1000000007;
constexpr ll INF=2e18;
const int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int X, Y, Z;
cin >> X >> Y >> Z;
if(Z * Y % X == 0) cout << Z * Y / X - 1 << endl;
else cout << Z * Y / X << endl;
} | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define ALL(obj) obj.begin(),obj.end()
#define SORT(obj) sort(obj.begin(),obj.end())
#define pb(obj) push_back(obj)
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
ll const MOD=1e9+7;
const ll INF = 9000000000000000000;
vecto... |
#include<bits/stdc++.h>
using namespace std;
int x,y,z;
int b;
int main()
{
cin>>x>>y>>z;
if((y/x)*x==y)cout<<y/x*z-1;
else
{
b=y/x*z;
while(b*x<y*z)b++;
cout<<b-1;
}
return 0;
} | #pragma region my_template
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using uint = unsigned int;
#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 per(i,n) for(int i=int(n)-1;i>=0;i--)
#define per1(i,n) for(int i=int(n);i>0;i--)
#define all(c) c.begin(),c.end()
#define si(x) ... | #include <algorithm>
#include <array>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <vector>
using namespace std;
int main() {
ios::... |
// C++(GCC 9.2.1)
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using vi = vector<int>;
#define repex(i, a, b, c) for(int i = a; i < b; i += c)
#define repx(i, a, b) repex(i, a, b, 1)
#define rep(i, n) repx(i, 0, n)
#define repr(i, a, b) for(int i = a; i >= b; i--)
#define pb push_back
LL a[22];
... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define rep(i,n) for(ll i=0;i<(n);i++)
#define init(a,i) for(int k=0;k<(i);k++)(a)[k]=0
#define in(a,i) for(int k=0;k<(i);k++)cin>>(a)[k]
#define all(a) (a).begin(),(a).end()
#define inf 2147483647
#define range(x,a,b) (a)<... | /* union_find_tree_size.cpp
素集合系を union-find tree で管理するライブラリ
併合時の工夫：union by size
verified: AtCoder ABC157 D - Friend Suggestions
https://atcoder.jp/contests/abc157/tasks/abc157_d
*/
#include <bits/stdc++.h>
using namespace std;
/* UnionFind：素集合系管理の構造体(union by size)
isSame(x, y): x と y が同じ集... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
ll a,b,c;
cin >> a>> b >> c;
if (a*a + b*b < c*c)cout << "Yes";
else cout << "No";
} | //https://atcoder.jp/contests/abc190/tasks/abc190_b
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
typedef long long ll;
typedef long double ld;
const ll mod = 1e9 + 7;
int main ()
{
ios_base::sync_with_stdio (0); cin.tie (0); cout.tie (0);
int n, s, d;
cin >> n >> s >> d;
... |
#include <bits/stdc++.h>
using i32 = std::int32_t;
using u32 = std::uint32_t;
using i64 = std::int64_t;
using u64 = std::uint64_t;
using i128 = __int128_t;
using u128 = __uint128_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;
class rep {
struct Iter {
usize itr;
constexpr Iter(const u... | #include <iostream>
using namespace std;
const int N = 35;
int prims[N], idx;
bool st[N];
int main() {
for (int i = 2; i <= 30; i ++) {
if (!st[i]) prims[idx ++] = i;
for (int j = 0; prims[j] <= 30 / i; j ++) {
st[prims[j] * i] = true;
if (i % prims[j] == 0) break;
}
}
// for (int i = 0; i < idx; i... |
#include <bits/stdc++.h>
#include <math.h>
#define REP(i,a,b) for (int i=a; i<b; i++)
#define ALL(v) (v).begin(), (v).end()
#define FORE(i,a) for(auto &i:a)
using namespace std;
typedef long long ll;
const ll infl = 1LL << 60;
template<class T>bool chmax(T& a, const T& b) { if (a<b) { a=b; return 1; } return 0; }
templ... | // Problem: B - Palindrome with leading zeros
// Contest: AtCoder - AtCoder Beginner Contest 198
// URL: https://atcoder.jp/contests/abc198/tasks/abc198_b
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#inclu... |
#include<cstdio>
#define fo(x,a,b) for(int x=(a),_e=(b);x<=_e;x++)
#define fd(x,a,b) for(int x=(a),_e=(b);x>=_e;x--)
typedef long long ll;
const int N=5005;
int a[N][4],pd[N],n,ans;
char c[N];
int main(){
scanf("%d",&n);scanf("%s",c+1);
pd['A']=0, pd['T']=1, pd['C']=2, pd['G']=3;
fo(i,1,n) {
fo(j,0,3) a[i][j]=a[i-... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll (i) = 0 ; (i) < (ll)(n) ; ++(i))
#define REPN(i, m, n) for (ll (i) = m ; (i) < (ll)(n) ; ++(i))
#define REP_REV(i, n) for (ll (i) = (ll)(n) - 1 ; (i) >= 0 ; --(i))
#define REPN_REV(i, m, n) for (ll (i) = (ll)(n) - 1 ; (i) >= m ; --(i))
#define IN... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define fcout cout << fixed << setprecision(18)
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll N; cin >> N;
double M; cin >> M;
ll K; cin >> K;
vector<ll> A(N + 10, 0);
for (ll i = 0; i < K; i++) {
ll X; cin >> X;
A[X... | #include<bits/stdc++.h>
using namespace std;
struct vals{
double val1;
double val2;
vals():val1(0.f),val2(0.f){};
vals operator +(const vals & b){
vals tmp;
tmp.val1 = b.val1 + val1;
tmp.val2 = b.val2 + val2;
return tmp;
}
vals operator -(const vals & b){
... |
#include<bits/stdc++.h>
#define pb push_back
#define pf push_front
using namespace std;
typedef long long int lli;
lli n,k,m,t,a,b,l,r,h,u,x,y,temp1,temp2,temp,q,d,mod=1e9+7,w,p,c,z;
lli gcd(lli a,lli b)
{
if(b == 0)return a;
return gcd(b, a%b);
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(N... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;++i)
#define reps(i,s,n) for(int i=s;i<n;++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int M = 1e5;
int main()
{
int n;
cin >> n;
vector<int> t(n);
rep(i, n) cin >> t[i];
int sum = 0;
rep(i, n) sum += t... |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n, s, d;
cin >> n >> s >> d;
string ans = "No";
for(int i = 0; i < n; i++){
int x, y;
cin >> x >> y;
if(x < s && y > d){
ans = "Yes";
break;
}
}
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
//kaizen_philosopher
//Al Waris
/*-----------------------------------------------------------------------*/
#define fastio ios::sync_with_stdio(false);cin.tie(0);
#define ll long long int
//loops
#define lp0(i,a) for(i=0;i<a;i++)
#define lp1(i,a) for(i=1;i<=a;i++)
//file in... |
#include <bits/stdc++.h>
using namespace std;
main() {
int N; scanf("%d", &N);
int A[N + 5], B[N + 5];
for (int k = 0; k < 2; k++) {
for (int i = 0; i < N; i++) {
if (k == 1) scanf("%d", &B[i]);
else scanf("%d", &A[i]);
}
}
int ans = 0;
for (int i = 0; i... | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <deque>
#include <set>
#include <sstream>
#include <stack>
#include <... |
#include <iostream>
#include <iomanip>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <string>
#include <algorithm>
#include <bitset>
#include <queue>
#include <set>
#include <map>
using namespace std;
#define ll long long
#define MOD 1000000007
#define rep(i, n) for( ll int i = 0; i < (n); i++ )
int... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define each(e, v) for(auto &e: v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x)... |
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
using ll =long long;
using vi = vector<ll>;
using vc = vector<char>;
using vs = vector<string>;
using P = pair<ll , ll>;
using vp = vector<P>;
#define rep(i, n) for (long long int i = 0; i < n; i++)
#define rep2(i, s, n) f... | #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> vll;
template <typename T>
inline void read(T &x)
{
T data = 0, f = 1;
char ch = getchar();
while (!isdigit(ch))
{
if (ch ==... |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
template <class T>
using idx_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define ll long long
#define ull unsigned long long
#define arr array
#define vt vector
#def... | #include <cstdio>
const int M = 1005;
int read()
{
int x=0,f=1;char c;
while((c=getchar())<'0' || c>'9') {if(c=='-') f=-1;}
while(c>='0' && c<='9') {x=(x<<3)+(x<<1)+(c^48);c=getchar();}
return x*f;
}
char s[M];int ans;
signed main()
{
scanf("%s",s+1);
for(int i=1;i<=12;i++)
if(s[i]=='Z' && s[i+1]=='... |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define int ll
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vpii = vector<pii>;
using vvpii = vector<vpii>;
template<typename T, typename U>
ostream& operator<<(ostream& o, const pair<T,U>& p... | // chrono::system_clock::now().time_since_epoch().count()
#include <bits/stdc++.h>
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define rep(i, a, b) for (int i = (a); i < (b); ++i)
#define debug(... |
/*
( _
) /=>
( +____________________/\/\___ / /|
.''._____________'._____ / /|/\
: () : :\ ----\| \ )
'..'______________.'0|----| \
0_0/____/ \
... | //
// main.cpp
// atcoder
//
// Created by 荣恒嬉 on 2020/10/24.
//
#include <bits/stdc++.h>
#define ll unsigned long long
using namespace std;
int main() {
ll a;
cin>>a;
ll x=1,y=1;
for(int i=1;i<38;i++){
x*=3;
ll y=1;
for(int j=1;j<28;j++){
y*=5;
if(x+y==a)
{
cout<<i<<" "<<j;
return 0;
... |
#include<bits/stdc++.h>
#define ar long long int
using namespace std;
int main() {
ar n;
cin>>n;
ar a[n];
for(ar i=0; i<n; i++){
cin>>a[i];
}
ar sum = 0;
for(ar i=0; i<n; i++){
if(a[i] <= 10){
continue;
} else {
sum = sum + (a[i] - 10);
}
}
cout<<sum<<endl;
... | #include <bits/stdc++.h>
#define gc() getchar()
using namespace std;
typedef long long ll;
template <typename T> void rd(T &x){
ll f=1;x=0;char c=gc();
for(;!isdigit(c);c=gc())if(c=='-')f=-1;
for(;isdigit(c);c=gc())x=(x<<1)+(x<<3)+(c^48);
x*=f;
}
int main(){
int n,a,ans=0;
rd(n);
for(;n;--n)rd(a),ans+=max(0,a-... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;cin>>N;
for(int i=1;i<=N;i++)
cout<<(i*2%N==0? N:i*2%N)<<" "<<((i*2+1)%N==0? N:(i*2+1)%N)<<endl;
} | #pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
#define ll long long
#define f first
#define s second
#define pii pair<int,int>
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbe... |
#include <bits/stdc++.h>
const long long INF = 1ll << 61;
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<pair<int, int>>> edges(26);
for (int e = 0; e < M; e++) {
int A, B;
char C;
cin >> A >> B >> C;
edges[C - 'a'].push_back({--A, --B});
}
vector<v... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;
template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (ll i=(ll)from; i<(ll)to; i++)
#define all(vec) vec.begin(), vec.en... |
#include <bits/stdc++.h>
using namespace std;
const long nPrime = 998244353;
int main() {
long n,m;
cin >> n >> m;
vector<long> viPowSum(n,0);
vector<long> viPow(m,1);
for(long i = 0; i < n; i++){
for(long j = 0; j < m; j++){
viPowSum[i] += viPow[j];
viPow[j] *= j;
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define p_ary(ary,a,b) do { cout << "["; for (int count = (a);count < (b);++count) cout << ary[count] << ((b)-1 == count ? "" : ", "); cout << "]\n"; } while(0)
#define p_map(map,it) do {cout << "{";for (auto (it) = map.begin(... |
#pragma GCC optimize ("O2")
#pragma GCC target ("avx")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<iostream>
#include<cstring>
#include<bitset>
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)... | #include <vector>
#include <iostream>
#include <string>
#include <algorithm>
#include <random>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main()
{
int N;
int M;
vector<string> S(M, "");
int L = 0;
cin >> N >> M;
for (int i = 0; i < M; i++)
{
cin ... |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);i++)
#define ALL(v) v.begin(),v.end()
int pw(int n,int k){
assert(k>=0);
int res=1;
while(k){
if(k&1)res*=n;
n*=n;
k>>=1;
}
return res;
}
signed main(){
string s;cin>>s;
int ans=0;
REP(i,10000){
bool ok=1... |
#pragma GCC optimize("O3")
//#pragma GCC target("avx2")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef vector<bool> vb;
... |
#include<bits/stdc++.h>
using namespace std;
#define A(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define int long long
void _read();
int32_t main () { _read();
int n;
cin >> n;
vector<char> vec;
for( int i = 0; i < n; i++) {
char c; cin >> c;
if( c == '... | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define int long long
#define __ ios_base::sync_with_stdio(false);cin.tie(NULL);
const int maxn = 200007;
const int mod = 998244353;
int mod_pow(int a,int b){
int x = 1;
while(b){
if(b&1)(x*=a)%=mod;
(a*=a)%=mod;
b>>=1;
... |
#define G 3
#include<map>
#define AK goto
#include<cmath>
#include<queue>
#include<bitset>
#include<cstdio>
#include<vector>
#include<cstring>
#include<iostream>
#include<algorithm>
#define ll long long
#define md ((l+r)>>1)
#define cht 1000000007
#define inf 1145141919810
#define mem(i,j)memset(i,j,sizeof(i))
#define ... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x... |
#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 ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define ll long long
#define vl vector<ll>
#define vs vector<strin... | #include <bits/stdc++.h>
#include <vector>
#include<math.h>
#include<string.h>
using namespace std;
#define MAX 300005
#define MOD 1000000007
#define GMAX 19
#define INF 20000000000000000
#define EPS 0.000000001
#define FASTIO ios_base::sync_with_stdio(false);cin.tie(NULL)
#include <ext/pb_ds/assoc_container.hpp>
#incl... |
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
#include <complex>
#include <queue>
#include <set>
#include <unordered_set>
#include <list>
#include <chrono>
#include <random>
#include <iostream>
#include <algorithm>
#include ... | #include <bits/stdc++.h>
using namespace std;
#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(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define INF 1e9
typedef long long ll;
t... |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define int LL
const int N = 300;
int c[N][N];
signed main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
c[0][0] = 1;
for (int i = 1; i < N; i++) {
c[i][0] = 1;
for (int j = 1; j <= i; j++) {
c[i][j] = c[i - 1][j]+... | #include<iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
using namespace std;
using ll = long long;
void solve(ll n, ll r)
{
long long p = 1, k = 1;
if (n - r < r)
r = n - r;
if (r != 0) {
while (r) {
p *= n;
k *= r;
long long m = __gcd(p, k);
p /= m;
k /= m;
n... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define ld long double
#define inf 2000000000
#define infLL 2000000000000000000
#define MAX5 100005
#define MAX6 1000006
#define MAX7 10000007
#define sf(a) scanf("%d", &a)
#define sfl(a) scanf("%lld", &a)
#define sfs(a) sc... | #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define pb(a) push_back(a)
#define vll vector<ll>
#define loop(i, n) for(ll i=1;i<=n;i++)
#define loop0(i, n) for(ll i=0;i<n;i++)
#define in(i) scanf("%lld", &i);
#define out(i) printf("%lld", i)
#define pll pair<ll, ll>
#define vpll vector<pair<l... |
#include <bits/stdc++.h>
#include <fstream>
#include <cstdio>
using namespace std;
// vector<pair<int,int> > v;
// cin.ignore();//twice getline(cin,s);
// g++ iterator.cpp -std=c++17
// cout<<(A + B == C ? "YES" : "NO")<<endl;
// __gcd(a,b)
// string s=to_string(n);
// string p=s.substr(0,len);
// string q=s.insert(0,s... | /** I can do this all day **/
#pragma GCC optimize("O2")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define all(x) (x).begin(),(x).e... |
#include <bits/stdc++.h>
#include <cmath>
#include <limits>
using namespace std;
typedef long long LL;
static long long INF = (1LL<<62);
int isPrime(LL p){
if(p<=1) return 0;
if(p==2 || p==3 || p==5 || p==7) return 1;
if(p==4 || p==6 || p==8 || p==9) return 0;
LL i;
int ret = 1;
for(i=2; i*i<=p; i++){
if(p%i... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
vector<long long> enum_divisors(long long N) {
vector<long long> res;
for (long long i = 1; i * i <= N; ++i) {
if (N % i == 0) {
res.push_back(i);
// 重複しないならば i の相方である N/i も push
if (N/i ... |
#include <bits/stdc++.h>
#define fast() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define ll long long int
using namespace std;
ll dp[105][100005];
ll t[105];
ll n;
ll totalsum=0;
ll solve(ll pos,ll sum)
{
if(sum>totalsum/2)
return INT_MIN;
if(pos>=n&&sum<=totalsum/2)
return sum;
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxl=2e5+10;
const int mod=1e9+7;
int n,k;
int a[maxl];
ll dp[maxl][17][2][2];
char s[maxl];
inline ll dfs(int pos,int st,bool up,bool lead)
{
int cnt=__builtin_popcount(st);
if(cnt>k) return 0;
if(pos>n) return cnt==k;
ll &ret=dp[po... |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define SZ(x) (int)x.size()
#define F first
#define S second
#define ALL(x) x.begin(), x.end()
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define FOR... | #include <bits/stdc++.h>
using namespace std;
#define fo(i, x, y) for (int i = (x); i <= (y); ++i)
#define fd(i, x, y) for (int i = (x); i >= (y); --i)
typedef long long ll;
const int p[10][4] = {{0, 0, 0, 0}
, {0, 0, 0, 0}
, {6, 2, 4, 8}
, {1, 3, 9, 7}
, {6, 4, 0, 0}
, {0, 0, 0, 0}
, {... |
/*
मनस्वी म्रियते कामं कार्पण्यं न तु गच्छति ।
अपि निर्वाणमायाति नानलो याति शीतताम् ॥
*/
#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... | /*
#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>
#include <set>
#include <queue>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/stan... |
#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... | #include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rep_up(i, a, b) for (ll i = a; i < b; ++i)
#define rep_down(i, a, b) for (ll i = a; i > b; --i)
#define P pair<ll, ll>
#define Graph vector<vector<ll>>
#define fi f... |
#include <bits/stdc++.h>
#define int long long
#define double long double
#define ff first
#define ss second
#define endl '\n'
#define ii pair<int, int>
#define mp make_pair
#define mt make_tuple
#define DESYNC \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.ti... | #include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;
template<class T>
struct graph{
struct edge{
int to;
T cost;
edge(int to, T cost) : to(to), cost(cost){}
bool operator<(const edge& r)const { return cost < r.cost; }
};
int V;
... |
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include <unordered_map>
//#include"testlib.h"
#define endl '\n'
#define all(v) v.begin(),v.end()
#define allr(s) s.rbegin(),s.rend()
#define RT(s) return cout<<s,0
#define sz(s) (int)(s.size())
//#define PI acos(-1)
#define EPS 1e-8
#define watch(x) cout << (#... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define isin(x,l,r) ((l) <= (x) &&... |
/*
Over Again
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define sz(v) ((int)(v).size())
#define all(v) ((v).begin()),((v).end())
#define allr(v) ((v).rbegin()),((v).rend())
#define pb push_back
#define mp make_pair
#define ... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define Erep(i,n) for(int i = 0; i <= (n); ++i)
#define repS(i,s,n) for(int i = s; i < (n); ++i)
#define ErepS(i,s,n) for(int i = s; i <= (n); ++i)
#define Sort(a) sort(a.begin(), a.end())
#de... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int MAX_N=1e6+10;
ll n,k;
ll dp[4][MAX_N*3];
ll sum[MAX_N*3];
int main()
{
cin>>n>>k;
for(int i=1;i<=n;i++) dp[1][i]=1;
for(int i=2;i<=3;i++){
sum[0]=0;
for(int j=1;j<=i*n;j++) sum[j]=sum[j-1]+dp[i-1][j];
for(int j=1;j<=i*n;j++) dp[i][j]=... | #line 1 "/Users/lynmisakura/kyopro/library_cp/template.cpp"
#include<bits/stdc++.h>
#line 3 "/Users/lynmisakura/kyopro/library_cp/template.cpp"
using namespace std;
#define REP(i,n) for(int i = 0;i < n;i++)
#define RNG(i,s,n) for(int i = s;i <= n;i++)
#define _RNG(i,e,s) for(int i = e;i >= s;i--)
#define mp make_pair
#... |
/*
皮卡丘冲鸭！
へ ／|
/＼7 ∠＿/
/ │ ／ ／
│ Z ＿,＜ ／ /`ヽ
│ ヽ / 〉
Y ` / /
ｲ● ､ ● ⊂⊃〈 /
() へ | ＼〈
>ｰ ､_ ィ │ ／／
/ へ / ﾉ＜| ＼＼
ヽ_ﾉ (_／ │／／
7 |／
＞―r￣￣`ｰ―＿
*/
#include <iostream>
#include <cstdio>
#include <fstream>
#include <algorithm>
#include <cmath>
#include <iomanip>
#inc... | /**
* author: shu8Cream
* created: 13.05.2021 00:15:07
**/
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i=0; i<(n); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using ll = long long;
using P = pair<ll,ll>;
using vi = vector<ll>;
using vvi = vecto... |
#include <bits/stdc++.h>
using namespace std;
#define inf 1e15
#define ll long long int
void solve(ll n, ll k){
vector<ll>a(n);
vector<ll>mp(n,0);
for(int i=0;i<n;++i){
cin>>a[i];
++mp[a[i]];
}
ll i=0;
ll res = 0;
while(i<n){
... | #include<bits/stdc++.h>
using namespace std;
typedef vector <int> vi;
typedef pair< int ,int > pii;
#define endl "\n"
#define sd(val) scanf("%d",&val)
#define ss(val) scanf("%s",&val)
#define sl(val) scanf("%lld",&val)
#define debug(val) printf("check%d\n",val)
#define all(v) v.begin(),v.end()
#define PB push_back
#d... |
/* Aditya0412 */
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define vii vector < int >
#define pii pair < int , int >
#define fi first
#define all(a) (a).begin(),(a).end()
#define si(x) (int)((x).size())
#define debug(x) cout<<#x<<" is "<<(x)<<endl;cout.fl... | #include<iostream>
#include<string>
#include<algorithm>
#include<cmath>
#include<map>
#include<vector>
#include<math.h>
#include<stdio.h>
#include<stack>
#include<queue>
#include<tuple>
#include<cassert>
#include<set>
#include<functional>
//#include<bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ios_base::sync_with_stdio(false);cin.tie(0);
int n;
cin>>n;
string s;
cin>>s;
vector<int> min_rem(n+1, n);
min_rem[n]=0;
vector<int> ending_with_char(26, -1);
for(int i=n-1;i>=0;i--){
if(i==n-1)... | #include<bits/stdc++.h>
#define ull unsigned long long
#define ll long long
#define F first
#define S second
#define pss pair<string,string>
#define pcc pair<char,char>
#define pll pair<ll,ll>
#define pii pair<int,int>
#define piii pair<int,pii>
#define vi vector<int>
#define vii vector<pii>
#define pb push_back
#defin... |
#pragma region head
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using pi = pair<int, int>;
using pll = pair<ll, ll>;
template <class T>
using vv = vector<vector<T>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (in... | #include <bits/stdc++.h>
using namespace std;
const int MAX_LEN = 50;
string DIR[5] = {"U", "D", "L", "R", ""};
int dir2int(char c) {
if ( c == 'U' ) { return 0; }
if ( c == 'D' ) { return 1; }
if ( c == 'L' ) { return 2; }
if ( c == 'R' ) { return 3; }
return 4;
}
void move(int* i, int* j, int dir) {
if (... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> ii;
typedef tuple<ll, ll, ll> iii;
typedef vector<ll> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<vi> vvi;
typedef vector<vii> vvii;
#define REP(i,n) for (ll i = 0; i < n; ++i)
#def... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
ll n, m;
vi x(100), y(100), z(100);
ll cntmask(ll n) {
ll ans = 0;
while (n) {
ans += n%2;
n /= 2;
}
return ans;
}
bool checkrule(ll mask, ll rule) {
ll cnt = 0;
for (ll i = 0; i < y[rul... |
#include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define st first
#define nd second
#define pii pair<int,int>
#define mp make_pair
#define pll pair<long long,long long>
using namespace std;
const int nax = 205;
vector<pii> parki;
int dp[nax];
int n;
void solve(){
cin >> n;
for(int i=1;i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define ... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define f(i,a,n) for(ll i=a;i<n;i++)
#define w(x) ll _t;cin>>_t;f(x,1,_t+1)
#define br cout<<"\n"
#define N 10000000
ll md=1e9+7,n;
ll h,w,m;
//l,d,r,u
ll x[]={0,1,0,-1};
ll y[]={1,0,-1,0};
ll mat[1501][1501];
bool isSafe(ll i,ll j){
return i>=0 ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,m,n) for(int i=(m); i<(int)(n); i++)
#define RREP(i,m,n) for(int i=(int)((n)-1); i>=m; i--)
#define rep(i,n) REP(i,0,n)
#define rrep(i,n) RREP(i,0,n)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define fi first
#define se seco... |
#include <cstdio>
#include <cmath>
#include <iostream>
#include <set>
#include <algorithm>
#include <vector>
#include <map>
#include <cassert>
#include <string>
#include <cstring>
#include <queue>
using namespace std;
#define rep(i,a,b) for(int i = a; i < b; i++)
#define S(x) scanf("%d",&x)
#define S2(x,y) scanf("%d%... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define all(c) (c).begin(),(c).end()
#define endl "\n"
#define ff first
#define ss second
#define allr(c) (c).rbegin(),(c).ren... |
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,avx512f")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <iostream>
#include <iomanip>
#include <string>
#include <cmath>
#include <algorithm>
#include <vect... | #include <bits/stdc++.h>
#define endl '\n'
#define fi first
#define se second
#define MOD(n,k) ( ( ((n) % (k)) + (k) ) % (k))
#define forn(i,n) for (int i = 0; i < int(n); i++)
#define forr(i,a,b) for (int i = a; i <= b; i++)
#define all(v) v.begin(), v.end()
#define pb push_back
using namespace std;
typedef long lo... |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
int t = s.size();
int flag=0;
for(int i=0;i<t;i++){
if(i%2==0){
if((s[i]-'Z')<=0){
flag++;
}
}
else{
if((s[i]-'Z')>0){
flag++;
}
}
}
if(flag>0){
cout << "No" << endl;
}
else{
cout << "Yes" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
for (unsigned int i{};i<s.length()/2;i++){
char temp = s.at(i);
s.at(i) = s.at(s.length() - i - 1);
s.at(s.length() - i - 1) = temp;
}
for (unsigned int i{};i<s.length();i++){
if (s.at(i) == '... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin>>N;
if(N%2==1){
cout<<"Black"<<endl;
}else{
cout<<"White"<<endl;
}
} | #include <stdio.h>
#include <iostream>
#include <algorithm>
using namespace std;
const int MAXN = 20000;
int Max[MAXN<<2];
int S[MAXN];
void build(int l,int r,int rt) {
if(l == r) {
Max[rt] = S[l];
return ;
}
int m = (l+r)>>1;
build(l,m,rt<<1);
build(m+1,r,rt<<1|1);
Max[rt] = max... |
// Qg3
// //g++ -std=c++17 -O2 -Wall a.cpp -o test
// _()_
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define vll vector<ll>
#define vi vector<int>
#define vb vector<bool>
#define pi pair<int,int>
#define pll pair<ll,ll>
#define vp vector<pi>
#define vpll vector<pll>
#defin... | #include <bits/stdc++.h>
using namespace std;
int N, A[200000], ufds[200000], rnk[200000];
map<int,int> m;
int findSet(int i) {
return ufds[i] == i ? i : ufds[i] = findSet(ufds[i]);
}
void unionSet(int i, int j) {
int a = findSet(i), b = findSet(j);
if (a == b) return;
if (rnk[a] < rnk[b]) ufds[a] = ... |
#include<bits/stdc++.h>
#ifdef BIZON
#define rr(...) [](const auto&...x){ char c='='; cerr << boolalpha << "\e[1;38;5;68m" << #__VA_ARGS__ << " "; ((cerr<<"\e[0;38;5;61m"<<exchange(c,',')<<"\e[0m "<<x),...); cerr<<endl; }(__VA_ARGS__);
#else
#define rr(...) 0;
#define endl '\n'
#endif
#define ALL(c) begin(c... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template<class T> using vc = vector<T>;
template<class T> using vvc = vector<vector<T>>;
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#defin... |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
ll N;
ll par[105];
ll rank_[105];
void init_uf(ll n_){
for(ll i=0;i<n_;i++){
par[i]=i;
rank_[i]=0;
}
}
ll find(ll x){
if(par[x]==x)
return x;
return par[x]=find(par[x]);
}
void unite(ll x,ll y){
x=find(x); y=find(y);
if(x==... | // C++(GCC 9.2.1)
#include <bits/stdc++.h>
using namespace std;
using P = pair<double, pair<int, int>>;
#define repex(i, a, b, c) for(int i = a; i < b; i += c)
#define repx(i, a, b) repex(i, a, b, 1)
#define rep(i, n) repx(i, 0, n)
#define repr(i, a, b) for(int i = a; i >= b; i--)
#define a first
#define b second
doubl... |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) (int)(a.size())
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define MOD (ll)(998244353)
#define INF (ll)(1e18)
#defin... | #ifdef __LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
template<typename T> bool chmax(T &a,T b) {if(a<b) {a=b; return true;} return false;}
template<typename T> bool chmin(T &a,T b) {if(a>b) {a=b; return true;} return false;}
#define itn int
#define fi first
#define se second
#def... |
#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 endl '\n'
#define fi first
#define se second
#define For(i, l, r) for (int i = l; i < r; i++)
#define ForE(i, l, r) for (int i = l; i <= r; i++)
#define For... | #include <bits/stdc++.h>
int ri() {
int n;
scanf("%d", &n);
return n;
}
int main() {
int h = ri();
int w = ri();
int x = ri() - 1;
int y = ri() - 1;
std::string s[h];
for (auto &i : s) std::cin >> i;
int cnt = -3;
for (int i = x; i < h && s[i][y] != '#'; i++) cnt++;
for (int i = x; i >= 0 && s[i][y] != ... |
#define skies dashabi
#include <bits/stdc++.h>
using namespace std;
const int N= 200+10;
#define inf 0x3f3f3f3f
#define ll long long
#define ull unsigned long long
#define PII pair<int,int>
inline int inc(int x,int v,int mod){x+=v;return x>=mod?x-mod:x;}
inline int dec(int x,int v,int mod){x-=v;return x<0?x+mod:x;}
inl... | #line 1 "/workspaces/compro/lib/template.hpp"
#line 1 "/workspaces/compro/lib/io/vector.hpp"
#include <iostream>
#include <vector>
#ifndef IO_VECTOR
#define IO_VECTOR
template <class T> std::ostream &operator<<(std::ostream &out, const std::vector<T> &v) {
int size = v.size();
for (int i = 0; i < size; i++) {
... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define each(e, v) for(auto &e: v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x)... | #include<bits/stdc++.h>
using namespace std;
#define Re register int
typedef long long ll;
const int N = 5005;
const int p = 998244353;
int n, m, k, t, fac[N], inv[N], f[15][5005];
inline int read()
{
char c = getchar();
int ans = 0;
bool f = 1;
while (c < 48 || c > 57)
{
if (c == '-') f = 0;
c = getchar();... |
#include<bits/stdc++.h>
using namespace std;
int main () {
int N;
cin >> N;
int gr[101][101];
for (int i = 0; i < N; i ++) {
for (int j = 0; j < N; j ++) {
char c;
cin >> c;
gr[i][j] = (c == '1');
}
}
for (int i = 0; i < N; i ++) gr[i][i] = 1;
for (int p = 0; p < 10; p ++) {
... | #include<bits/stdc++.h>
using namespace std;
const int maxn=100000;
int f[maxn+5],l[maxn+5];
bool d[maxn+5];
vector<int>g[maxn+5];
bool cmp(int i,int j)
{
return (f[i]-l[i])>(f[j]-l[j]);
}
void dfs(int x)
{
//cout<<x<<endl;
if(g[x].size()==0)
{
l[x]=1;
f[x]=0;
d[x]=1;
re... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<int> getIntArray(int num) {
vector<int> result;
int tmp = num;
while(tmp > 0) {
int digit = tmp % 10;
result.push_back(digit);
tmp /= 10;
}
return result;
}
int calc(vector<int> v) {
sort(v.begin(), v.end());
int grea... | #include <bits/stdc++.h>
using namespace std;
template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl
using ll = long long;
const int maxn = 1e6 + 5;
int g2(int x) {
string s = to_string(x);
sort(s.begin(),s.end());
return stoi(s)... |
#include <iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<strings.h>
#include<sstream>
using namespace std;
int fan(int x)
{
int maxn=0,mixn=0;
int a[10]= {0},b[10]= {0};
string str;
stringstream ss;
ss << x;
ss >> str;
if(x==0)
return 0;
else
{
... | #include<cstdio>
#include<iostream>
#include<iomanip>
#include<map>
#include<unordered_map>
#include<string>
#include<queue>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<cstdlib>
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define endl "\n"
#define int long long
//#define double l... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void fun()
{
ll n,k;
cin>>n>>k;
// ll a[n];
map<ll,ll>mp;
for(ll i=0;i<n;i++)
{
ll a,b;
cin>>a>>b;
mp[a]+=b;
}
ll curr=0;
for(auto i:mp)
{
if(curr+k>=i.first)
{
... | /*jai_ganeshdeva*/
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define pu push // adds the value to the last of the queue
#define lld long long int
#define ldo long double
#define ins insert /// used in set to insert the values
#define adv advance /// used to increment the iterator
#define m... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N, M;
vector<vector<int>> G(N);
bool visited[100];
vector<pair<int,int>> E1;
set<pair<int,int>> E2;
void f(int p) {
visited[p] = true;
for (int x : G[p]) {
if (visited[x]) {
E2.insert({min(p,x),max(x,p)});
} else {
E1.push_back({p,x});
... | #include<algorithm>
#include<bitset>
#include<cassert>
#include<cfloat>
#include<climits>
#include<cmath>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_se... |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);i++)
#define N 20
#define INF 1000000005
#define INFLL (ll)1000000000000000005
#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<<(a... | #include <bits/stdc++.h>
#define watch(x) std::cout << (#x) << " is " << (x) << std::endl
using LL = long long;
const int M = 1e9 + 7;
int main() {
// freopen("in", "r", stdin);
std::cin.tie(nullptr)->sync_with_stdio(false);
int n;
std::cin >> n;
std::vector<std::vector<std::pair<int, LL>>> e(n + 1);
for (int i ... |
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
using pii = pair<int, int>;
bool nBase(string s, ll n, ll m){
__int128 res = 0;
int len = s.length();
for (int i = 0; i < len;i++){
res = res * n + s[i] - '0';
... | // YATIN KWATRA
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ar array
#define sz(v) (int)(v.size())
#define inf 1e18
#define int... |
#include <bits/stdc++.h>
using namespace std;
template<typename T> vector<T> vin(int n) {
vector<T> v(n);
for (int i = 0; i < n; ++i) cin >> v[i];
return v;
}
vector<int> vi(int n) {
vector<int> v(n);
for (int i = 0; i < n; ++i) v[i] = i;
return v;
}
void in() {
}
template<typename Head, typename... Tail>
v... | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
typedef long long ll;
typedef pair<int, int> PII;
const int N = 10;
const int M = 110;
ll h[N], ne[M], e[M], w[M], idx;
ll ans;
int n;
ll k;
bool vis[N];
bool vis1;
int cnt = 1;
void add(int a, int b, in... |
//templete
#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;
vector<int>A;
vector<int>B;
int tmpa,tmpb;
cin>>N;
rep(i,N){
cin>>tmpa>>tmpb;
A.push_back(tmpa);
B.push_back... | #include <bits/stdc++.h>
#define ALL(a) a.begin(), a.end()
#define ALLR(a) a.rbegin(), a.rend()
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define FORD(i, a, b) for (int i = (a); i > (b); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REPR(i, n) for (int i = (n)-1; i >= 0; i--)
#define SI(a) (in... |
#define DEBUG 0
#include <bits/stdc++.h>
using namespace std;
#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printA... | #include <bits/stdc++.h>
using namespace std;
#define M1 1000000007
#define M2 998244353
#define INF 1e18
#define ll long long
#define pll pair<ll,ll>
#define REP(i,a,b) for(ll i=a;i<b;i++)
#define REPR(i,a,b) for(ll i=b-1;i>=a;i--)
#define forr(i,n) for(ll i=0;i<n;i++)
#define F first
#define S second
#define pb push... |
#include <bits/stdc++.h>
// #include <atcoder/all>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for(int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
// using namespace atcoder;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}e... | #include <bits/stdc++.h>
using namespace std;
template <typename T> using vec = vector<T>;
template <typename T> using vvec = vector<vector<T>>;
int main() {
int n, w; cin >> n >> w;
vec<int64_t> imos(2 * 1e5 + 1, 0);
for (int i = 0; i < n; ++i) {
int s, t, p; cin >> s >> t >> p;
imos[s] +... |
#include <bits/stdc++.h>
#define ft first
#define sc second
#define pt(sth) cout << sth << "\n"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
template<class T>bool chmax(T &a, const T &b) {if(a<b) {a=b; return 1;} return 0;}
template<class T>bool chmin(T &a, const T &b) {if(b<a) {a=b; return 1;} ... | #include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <map>
#include <algorithm>
#include <iomanip>
#include <queue>
#include <utility>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <stack>
#include <functional>
#include <iterator>
#include <random>
#include <fstr... |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define ud unsigned int
#define ll long long
#define ull unsigned long long
#define MAX_INF 0x3f
#define MAX_INF_VAL 0x3f3f3f3f
#define MAX_INF_VAL_LL 0x3f3f3f3f3f3f3f3f
//#define pi 3.141592653589
#define eps 1e-9
#define F(x) ((x)/3+((x)%3==1?0:tb))
#define G(x) ... |
/**
* Dont raise your voice, improve your argument.
* --Desmond Tutu
*/
#include <bits/stdc++.h>
using namespace std;
const bool ready = [](){
ios_base::sync_with_stdio(false); cin.tie(0);
cout << fixed << setprecision(12);
return true;
}();
using ld=long double;
const ld PI = acos((ld)-1);
using ll= ... |
#include <bits/stdc++.h>
using namespace std;
#define MEM(a, b) memset(a, (b), sizeof(a))
#define FOREACH(it, l) for (auto it = l.begin(); it != l.end(); it++)
#define IN(A, B, C) assert( B <= A && A <= C)
#define MP make_pair
#define FOR(i,a) for(int i=0;i<a;i++)
#define FOR1(i,j,a) for(int i=j;i<a;i++)
#defi... | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define forn(i,n) for(int i = 0; i < n; i++)
int32_t main() {
int n, q, k; cin >> n >> q;
vector<int> a(n);
forn(i, n) cin >> a[i];
vector<int> ps(n);
ps[0] = a[0] - 1;
forn(i, n - 1) ps[i + 1] = ps[i] + a[i + 1] - a[i] - 1;
... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i = (a); i < (b); i++)
#define drep(i,b,a) for(int i = (b)-1; i >= (a); i--)
#define bit(n) (1LL << (n))
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define SORT(v) sort(v.begin(),v.end());
#define RSORT(v) sort(v.rbegin()... | // #pragma GCC optimize(2)
// #pragma GCC optimize(3)
// #pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define _rep(i, x, y) for(int i = (int)x; i < (int)y; ++i)
#define _dep(i,x,y) for(int i = (int)x; i > (int)y; i--)
#define PII pair<int,int>
#define eb emplace_back
#define pb push_back
#... |
#include <bits/stdc++.h>
#include <immintrin.h>
using namespace std;
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
template<typename T>
istream &operator>>(istream &in, vector<T> &a) {
for (auto &i : a)
... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define mkp make_pair
#define ins insert
#define pqueue... |
#include <bits/stdc++.h>
#define forloop(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define ll long long int
#define ld long double
#define pb emplace_back
#define ravi ios_base::sync_with_stdio(false);
#define parmar2002 cin.tie(NU... | #include<bits/stdc++.h>
#define god dimasi5eks
#pragma GCC optimize("O3")
#define fi first
#define se second
#define pb push_back
#define pf push_front
// #define fisier 1
using namespace std;
typedef long long ll;
const int mod = 1000000007;
const double dancila = 3.14159265359; // PI
const double eps = 1e-9;... |
/*
Alexander Rango
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n'
#define pii pair <ll , ll>
#define F first
#define S second
const ll max_n = 1e3 + 20, inf = 1e18 + 20;
ll dist[max_n][max_n], n, m ,s, t, T, u, v, w, ans;
char c;
bitset <max_n> visited[ma... | #include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
typedef long long ll;
typedef long double ld;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define mod 1000000007
#define pii pair<ll,ll>
#define inf 1000000000000000000
#define bpc(x) __... |
#include<iostream>
#include<iomanip>
#include<cstdlib>
#include<algorithm>
#include<vector>
#include<map>
#include<cmath>
#include<string>
#define rep(i,p) for(long long int i=0;i<p;i++)
#define reep(i,p) for(long long int i=1;i<=p;i++)
#define ll long long
#define mod 1000000007
using namespace std;
//-------------... | /*
{
######################
# Author #
# Gary #
# 2021 #
######################
*/
#include<bits/stdc++.h>
#define rb(a,b,c) for(int a=b;a<=c;++a)
#define rl(a,b,c) for(int a=b;a>=c;--a)
#define LL long long
#define IT iterator
#define PB push_back
#define II(a,b) make_pair(a,b)
... |
#include <iostream>
using namespace std;
int main(void) {
int N, A, B;
cin >> N >> A >> B;
N -= A;
if (N < 0) {
N = 0;
}
N += B;
cout << N << endl;
return 0;
} | #include <iostream>
using namespace std;
int main()
{
int a,b,c,d;
cin>>a>>b>>c;
d=a-b+c;
cout<<d;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
const int N = 100;
char s[N][N];
int dx[4] = {0, -1, 0, 1};
int dy[4] = {1, 0, -1, 0};
int solve() {
int n, m;
scanf("%d %d", &n, &m);
for (int i = 0; i < n; ++i) {
scanf("%s", s[i]);
}
int ans = 0;
for (int i = 0; i < n; ++i) {
for (int j = 0; j <... | #include <bits/stdc++.h>
using namespace std;
//UnionFindテンプレ
class UnionFind {
// まとめる 判定 サイズを知る
public:
// Aから見た親の番号を格納する。rootだったら-1*その集合のサイズ。
vector<int> Parent;
// 初期化
UnionFind(int N) {
Parent = vector<int>(N, -1);
}
// Aのrootを調べる
int root(int A) {
if (Parent[... |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll m;
int A[62],n;
bool judge(ll x){
ll ret = 0,bs = 1;
for(int i(0);i <= n;++i){
ll sum = bs*A[i];
if(sum > m) return 0;
if(ret+sum > m) return 0;
ret += sum;
if(i != n){
if(m/x < bs) return 0;
bs = bs*x;
if(bs... | /*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#include <cstdio>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstring>
#include <vector>
#include <numeric>
#include <iostream>
#include <random>
#include <map... |
// {{{ by unolight
#include <bits/stdc++.h>
#pragma GCC diagnostic ignored "-Wunused-result"
#pragma GCC diagnostic ignored "-Wunused-function"
#define SZ(x) ((int)(x).size())
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REP1(i,a,b) for (int i = a; i <= (int)(b); i++)
#define ALL(c) (c).begin(), (c).end... | #include<bits/stdc++.h>
#define fi first
#define se second
using namespace std;
const int K=1e5;
long long w[K+10];
priority_queue<pair<long long,int>> pq;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int k;
long long n,m;
cin>>k>>n>>m;
int lft=m;
for(int i=1;i<=k;i++)
{
long... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll z = 0, mod = 1000000007;
int main(){
ll N;
cin >> N;
if (N == 1){
cout << 1 << endl;
cout << 1 << endl;
exit(0);
}
vector<ll> fib(2);
fib[0] = 1;
fib[1] = 1;
ll now = 2;
while (true){
ll next = fib[now... |
#pragma GCC optimize("O3")
//#pragma GCC target("avx2")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef vector<bool> vb;
... |
/*
P_r_A_d_Y ☹
*/
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define endl "\n"
#define mod 1000000007
#define inf 1e18
#define pb push_back
#define all(x) x.begin(),x.end()
#define arr_max(x) *max_element(x.begin(),x.end())
#define arr_min(x) *min_element(x.begi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for(ll i=0;i<ll(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i, a, b) for(ll i=a;i<=ll(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=ll(b);i--)
int main() {
string S;
cin >> S;
... |
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long int
#define pb push_back
#define mp make_pair
#define FIO ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define all(in) in.begin(), in.end()
typedef pair<ll, ll> pll;
void solve(){
ll n; cin >> n;
ll ans = 0;
... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()... |
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define ll long long
using namespace std;
inline ll read(){
ll x=0,f=1;char ch=getchar();
while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}
while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;
}
bool vis[200];
int main(){
... | #include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC target("avx,avx2,fma")
typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;
#define MP make_pair
#define PB push_back
#define X first
#define Y second
#define FOR(i, a, b) for(int i = (a); i ... |
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define FILL(i,n) memset(i,n,sizeof i)
#define X first
#define Y second
#define ET cout << "\n"
#define SZ(a) ((int)a.size())
#define... | #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 10000
#define mod 1000000007
#define inf 0x3f3f3f3f
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
t... |
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <vector>
#include <bitset>
#include <string>
#include <cstring>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <utility>
#include <algorithm>
#include <random>
#include <cmath>
#include <cassert>
#include <climi... | #include<bits/stdc++.h>
using namespace std;
#define ma 2147483647
#define ll long long
#define ld long double
#define pii pair<int,int>
#define mii map<int,int>
#define umii unordered_map<int,int>
#define um unordered_map
#define vi vector<int>
#define mii map<int,int>
#define si set<int>
#define ft first
#define sc s... |
#include <iostream>
#include <cmath>
#include <utility>
using namespace std;
#define mp make_pair
#define x first
#define y second
typedef pair<int,int> pii;
typedef long long ll;
pii tocke[1003];
int main(){
ios::sync_with_stdio(0);
int n;
cin>>n;
for(int i=0;i<n;i++){
cin>>tocke[i].x>>tocke[i].y;
}
int br... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main(){
ll n;
cin>>n;
vector<pair<ll,ll>>v;
ll two=INT_MAX;
for(int i=0;i<n;i++){
ll a,b;
cin>>a>>b;
v.push_back(make_pair(a,b));
two=min(two,a+b);
}
ll first=INT_MAX;
ll second=INT... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.