code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
//Author:RingweEH
#include <cstdio>
#include <algorithm>
#include <cstring>
#define ll long long
#define db double
using namespace std;
int min( int a,int b ) { return (a<b) ? a : b; }
int max( int a,int b ) { return (a>b) ? a : b; }
void bmin( int &a,int b ) { a=(a<b) ? a : b; }
void bmax( int &a,int b ) { a=(a>b) ? a... | #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>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 rng(chrono::steady_cloc... | #include<fstream>
#include<iostream>
#include<sstream>
#include<vector>
#include<stack>
#include<string>
#include<algorithm>
#include<cmath>
#include<map>
#include<queue>
#include<tuple>
#include<iomanip>
#include<bitset>
#include<stdio.h>
#include<set>
#include<array>
using namespace std;
#define rep(i,n) for(int i=0;... |
#include<iostream>
using namespace std;
int main()
{
int v,t,s,d,s1,s2;
cin>>v>>t>>s>>d;
s1=t*v;
s2=v*s;
if(d>=s1&&d<=s2)
cout<<"No";
else
cout<<"Yes";
return 0;
}
| #include <iostream>
using namespace std;
int main()
{
int a[4];
char flag = 0;
cin >> a[0] >> a[1] >> a[2] >> a[3];
int sum = 0;
for (int i = 0; i < 4; i++) {
sum += a[i];
}
bool find = false;
if (sum % 2 == 0)
{
for (int i = 0; i < 8; i++)
{
int sub = a[3];
if ((i & (1 << ... |
#include <bits/stdc++.h>
// #include <atcoder/all>
// #include "icld.cpp"
using namespace std;
using ll = long long int;
using vi = vector<int>;
using si = set<int>;
using vll = vector<ll>;
using vvi = vector<vector<int>>;
using ss = string;
using db = double;
template<typename T> using minpq = priority_queue <T,vector... | #include<stdio.h>
#include<bits/stdc++.h>
#include<math.h>
#include<stdlib.h>
#include<stdbool.h>
#include<vector>
#define ll long long
#define pb push_back
#define inp(x) scanf("%d",&x);
#define input(x) scanf("%lld",&x);
#define tc int t;scanf("%d",&t);while(t--)
using namespace std;
//Functions
int MaxNum(int nu... |
/*ver 7*/
#include <bits/stdc++.h>
using namespace std;
void init() {cin.tie(0);ios::sync_with_stdio(false);cout << fixed << setprecision(15);}
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vd = vector<ld>;
using vs = vector<string>;
using vb = vector<bool>;
using vvl = vector<vector<ll>>;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (long long i = 0; i < (n); i++)
using ll = long long;
using P = pair<ll, ll>;
const ll INF = 1001001001;
int main() {
ll N; cin >> N;
vector<vector<ll>> C(N, vector<ll>(N));
vector<ll> A(N), B(N);
// (最小値, 最小値が含まれる行数) を表す Pair
P min... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for(int i=0; i<(int)(n); i++)
#define debug(x) cerr << #x << ": " << x << "\n";
int N;
vector<int> P, iP;
bool solve(int left, vector<int> &res){
if(res.size() == N-1){
rep(i, N){
if(P[i] != i){
... | #include<iostream>
#include<bits/stdc++.h>
#define mod 1000000007
#define int long long
#define pii pair<int,int>
#define pb(x) push_back(x)
#define lbound lower_bound
#define ubound upper_bound
#define gcd(a,b) __gcd(a,b)
#define all(v) v.begin(),v.end()
#define bits(x) __builtin_popcountll(x)
#define heap_min priorit... |
#include <iostream>
#include <set>
#include <iterator>
#include <bitset>
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll mod=1000000007;
int main() {
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int t;
cin>>t;
while(t--){
int n;
cin>>n;
... | #pragma GCC optimize ("Ofast")
#pragma GCC optimization ("unroll-loops, no-stack-protector")
#pragma GCC target ("avx")
#pragma GCC target ("avx2")
#pragma GCC target ("fma")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
#define fastio ios_bas... |
#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <climits>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <cassert>
#include <stack>
#include <numeric>
typedef int64_t ll;
typedef std::pair<int, int> Pii;
typedef st... | #include "bits/stdc++.h"
using namespace std;
#ifdef LOCAL
#include "debug.h"
#define input freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
#else
#define debug(...) 4
#define input 4
#endif
using ll = long long;
//const int mod = 998244353;
const int mod = 1e9 + 7;
const int N =... |
#include <stdio.h>
#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <algorithm>
#include <set>
using namespace std;
#define rep(i,s,N) for(unsigned int i=s;i<N;i++)
typedef long long int lli;
int main(void)
{
int N, S, D; cin >> N >> S >> D;
vector<... | //
#include<bits/stdc++.h>
using namespace std;
#define PB push_back
#define f first
#define s second
#define what_is(x) cerr << #x << " is " << x << endl;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
const int INF = 1000000007;
const ll MOD = 1000000007;
vector<pii> graph[301];
in... |
#include<bits/stdc++.h>
using namespace std;
int main(void)
{
int A,B,C;
cin >> A >> B >> C;
if (A < 0 && C%2 == 0)
{
A *= (-1);
}
if(B < 0 && C%2 == 0)
{
B *= (-1);
}
if(A < B)
{
cout << "<" << endl;
}
else if(A > B)
{
cout << ">" << endl;
}
else if (A == B)
{
cout << "=" << endl;
}
return... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, a, n) for (int i = (a); i < (int) (n); ++i)
#define MOD 1000000007
int main() {
ll A, B, C;
cin >> A >> B >> C;
char ans;
if(C % 2 == 0) {
... |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <cmath>
using namespace std;
void dfs(int v, int other, vector<vector<pair<int, int>>>& Graph, vector<bool> &seen, vector<int> &color, int N) {
if (v == 0) {
if (Graph[v].size() > 0) color[0] = Graph[v][0].second;
}
... | #include <bits/stdc++.h>
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define RI register int
typedef long long LL;
#define FILEIO(name) freopen(name".in", "r", stdin), freopen(name".out", "w", stdout);
using namespace std;
namespace IO {
char buf[1000000], *p1 = buf, *p2 = buf;
inline char gc() {
if (p1 ... |
#include <cstdio>
#include <algorithm>
const int Maxn=200000;
int n;
std::pair<int,int> a[Maxn<<1|5];
bool col[Maxn<<1|5];
int main(){
scanf("%d",&n);
for(int i=1;i<=(n<<1);i++){
scanf("%d",&a[i].first);
a[i].second=i;
}
std::sort(a+1,a+1+(n<<1));
for(int i=1;i<=n;i++){
col[a[i].second]=1;
}
int num=0;
fo... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[200050];
const int mod =998244353;
ll l[200050];
ll in[200050];
ll sum[200050];
ll pow_mod(ll a, ll n, ll m)
{
long long ans = 1;
while(n){
if(n&1){
ans = (ans * a) % m;
}
a = (a * a) % m;
n >>=... |
#include<iostream>
#include<vector>
int main(){
int N, K;
std::cin >> N >> K;
std::vector<long long> sum(2*N+2,0);
for(int a=1; a<=N; a++){
sum[a+1] += 1;
sum[a+N+1] -= 1;
}
for(int i=0; i<2*N+1; i++){
sum[i+1] += sum[i];
}
long long ans = 0;
if (K < 0) K *= -1;
for(int i=0; i<2*... | #include <iostream>
using namespace std;
int main(void){
// Your code here!
long long n;
cin>>n;
int k;
cin>>k;
for(int i=0;i<k;i++){
if(n%200==0) n/=200;
else{
n*=1000;
n+=200;
}
}
cout<<n<<endl;
return 0;
}
|
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,abm,mmx,avx,avx2")
#pragma GCC optimize("unroll-loops")
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define req(i,a,b) for(int i=(a);i>=(b);--i)
#define rep_(i,a,b) for(int i=(a);i<(b).size();++i)
#define F(a) rep(a,1,n)... | #pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x)... |
#include<iostream>
#include<vector>
#include<string>
#include<map>
#include<algorithm>
using namespace std;
int main(){
int N;
std::cin >> N;
vector<string> S_list(N);
for(int i= 0; i < N; i++){
std::cin >> S_list[i];
}
vector<long long> t_list(N+1), f_list(N+1);
t_list[0] = 1;
... | #include<bits/stdc++.h>
#define ll long long
#define fl(i,n) for(i=0;i<n;i++)
#define fld(i,a,b) for(i=a;i>b;i--)
#define fli(i,a,n) for(i=a;i<n;i++)
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define mod 1000000007
#define all(x) ... |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n,m) for(int i=n;i<m;i++)
void solve(){
priority_queue<int>pq;
rep(i,0,3){
int a;
cin>>a;
// cout<<a;
pq.push(a);
}
int sum=0;
sum+=pq.top();
pq.pop();
sum+=pq.top();
cout<<s... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int LL;
typedef pair<int,int> II;
typedef priority_queue<int> pqD;//降順
typedef priority_queue<int,vector<int>,greater<int>> pqU;//昇順
LL MOD=1000000007;
LL MO2=998244353;
LL INF=1000000000000;
#define SP(x) cout<<setprecision(x)
#define RP(i,n) for(i=0;i<n;... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
/* alias */
using ull = unsigned long long;
using ll = long long;
/* define short */
#define all(obj) (obj).begin(), (obj).end()
#define YESNO(bool) if(bool){cout<<"YES"<<endl;}else{... |
#include<iostream>
#include<iomanip>
#include<cmath>
#include<algorithm>
#include<numeric>
#include<vector>
#include<string>
#include<set>
#include<map>
//#include<atcoder/all>
#define fi first
#define se second
#define pb(x) emplace_back(x)
using namespace std;
using ll = long long;
using v_ll = vector <ll>;
bool... | #include <iostream>
#include <cmath>
#include <stdio.h>
#include <string.h>
#include <bits/stdc++.h>
#include <vector>
#include <array>
#include <tuple>
#include <algorithm>
#include <functional>
#include <numeric>
using namespace std;
typedef long long ll;
int main() {
int N, p, t;
cin >> N;
ll l[N], r[N], y, ... |
#include<bits/stdc++.h>
using namespace std;
#define FOR(i,n) for(ll i=1;i<=n;i++)
#define LOOP(i,n) for(ll i=0;i<n;i++)
#define loop(a,b) for(ll i=a;i<=b;i++)
#define sci(n) scanf("%d",&n)
#define scl(n) scanf("%lld",&n)
#define scl3(a,b,c) scanf("... | #include <bits/stdc++.h>
using namespace std;
vector<int> seen;
vector<vector<int>> g;
vector<int> a, b;
void dfs(int node, int64_t& sum) {
seen[node] = 1;
sum += a[node];
sum -= b[node];
for (auto v : g[node])
if (not seen[v])
dfs(v, sum);
}
int main() {
int n, m; cin >> n >>... |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
#define asort(a,n) sort(a,a+n)
#define vsort(v) sort(v.begin(),v.end())
#define all(v) v.begin(),v.end()
#define run ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);cerr.tie(0);
#define mod 10000000... |
#include <bits/stdc++.h>
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
/*---------macro---------*/
#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 Clear(a) a = decltype(a)()
#define all(a) begin(a),end(a)
#define rall(a) r... | //For higher stack size use g++ -O2 -std=c++11 -Wall -Wl,--stack=268435456 a.cpp -o a.exe in cmd
#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstring>
#include <chrono>
#include <complex>
#define ll long long
#define ld long double
... |
// #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 <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
using ll = long long;
constexpr int P = 1000000007;
ll powmod(ll n, ll k) {
ll r = 1, t = n % P;
for (; k != 0; k /= 2) {
if (k & 1) r = r * t % P;
... |
#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>
using namespace std;
int h[1600000] = { 0 };
int num[1600000] = { 0 };
int main()
{
int n;
cin >> n;
int size;
cin >> size;
for (int i = 1;i <= n;i++)
{
cin >> h[i];
if (i <= size)num[h[i]]++;
}
int mina;
for (int i = 0;;i++)
{
if (num[i] == 0)
{
mina = i;
break;
}
}... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a,b;
cin>>b>>a;
cout<<b*2+100-a<<endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
int n,m;
int main(){
scanf("%d%d",&n,&m);
printf("%d",2*n+100-m);
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
typedef int64_t ll;
typedef long double ld;
const ll MOD=1000000007;
const ll MODA=998244353;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
long long gcd(long long a,long long b){
ll gcdmax=max(a,b);
ll gcdmin=min(a,b);
while(true){
if(gcdmax%gcdmin==0)break... | /*
Ashraful Islam Paran
11-April-2021
18:14:49
*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define f(n) for (int i = 0; i < n; i++)
#define show(x, y) cout << x << " " << y << "\n"
#define fo(i, x, n) for (int i = x; i < n; i++)
#define fb(i, x, n) for (int i = n - 1... |
#include<iostream>
#include<string>
using namespace std;
int main() {
int T,N;
cin >> T;
string s1,s2,s3;
int i,j;
for(i=0;i<T;i++) {
cin >> N >> s1 >> s2 >> s3;
if(min(s1[0],s1[2*N-1]) == '0' && min(s2[0],s2[2*N-1]) == '0' && min(s3[0],s3[2*N-1]) == '0') {
for(j=0;j<N;j++)cout << "1";
cou... | //#include <bits/stdc++.h>
#include <iostream>
#include <iomanip>
#include <math.h>
#include <cmath>
#include <algorithm>
#include <climits>
#include <functional>
#include <cstring>
#include <string>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <vector>
#include <stack>
#include <queue>
#include <dequ... |
// 霽れを待つ
#include <bits/stdc++.h>
#define forn(i,s,t) for(register int i=(s);i<=(t);++i)
using namespace std;
const int N = 2e5 + 3;
struct Lst {int dir, nxt;}E[N<<1];
int G[N], cnt;
inline void Add(int u, int v) {
E[++cnt].dir = v, E[cnt].nxt = G[u], G[u] = cnt;
}
int P, len;
void Pre_dfs(int u, int lst, int d) {
(d... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define lld long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define f first
#define s second
#define mk make_pair
/*----------------------DEBUGGER---------------------------*/
#ifndef O... | #include <bits/stdc++.h>
#define MONKE 0
#define vt(x) vector < x >
#define p(x, y) pair < x, y >
#define M 1000000007
#define fl(i, a, b) for(int i = a; i < b; ++i)
#define fld(i, a, b) for(int i = a; i >= b; --i)
typedef long long ll;
typedef long double ld;
using namespace std;
int main() {
ios_base::sync_wi... |
#include <bits/stdc++.h>
// #include<iomanip>
using namespace std;
#define int long long int
typedef pair<int, int> pii;
#define f(i,a,b) for(int i=a;i<b;i++)
#define fo(i,a,b) for(int i = a; i<=b;i+=1)
// #define Vector vector
#define rf(i,a,b) for(int i=a;i>=b;i--)
#define vll vector<int>
#define sz(a) int(a.size(... | #include <bits/stdc++.h>
#define ll long long
#define map unordered_map
#define set unordered_set
#define l_l pair<ll, ll>
#define P pair<ll, ll>
#define vll vector<ll>
#define mll map<ll, ll>
#define mp make_pair
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##... |
// E - White Pawn
#include <bits/stdc++.h>
using namespace std;
int main(){
int N, M; cin>>N>>M;
map<int,vector<int>> D;
while(M--){
int x, y; cin>>x>>y;
D[x].push_back(y);
}
set<int> S({N});
for(auto&[x, Y]:D){
vector<int> A;
for(int&y:Y)
if(S.count(y-1) || S.count(y+1)) A.push_back(y);
for(int&y... | //#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep2(a,i,n) for(ll i=(a);i<(n);i++)
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pii pair<int, int>
#define pll pair<ll, ll>
#define cinf(x,n) for(ll i=0;i<(n);i++)cin>>x[i];
#define coutf(x,n) for(ll i=0;i<(n);i++)cout<<x[i]<<endl;
typedef long long ll... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define f(i,a,n) for(int i=a ; i<n ; i++)
#define rf(i,n,a) for(int i=n ; i>=a ; i--)
#define F first
#define S second
#define all(c) (c).begin(),(c).end()
#define sz(v) (int)(v).size()
#define fast ios::sync_with_stdio(0); cin.tie... | /*****************************************JAI SHREE RAM***************************************************/
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for((i)=0;(i)<(n);(i)++)
#define rep1(i,n) for((i)=1;(i)<=(n);(i)++)
int main()
{
ll n, k;
cin >> n >> k;
int a... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
typedef pair<ll,ll> Pll;
typedef pair<string,string> Pstring;
typedef pair<double,double> Pdouble;
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define Precision13 cout << fixed << setprecis... | #include<cstdio>
#include<cmath>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<vector>
#include<set>
using namespace std;
#define MAXN 500005
#define lowbit(x) (x&-x)
#define reg register
typedef long long LL;
typedef unsigned long long uLL;
typedef unsigned int uint;
typedef pair<int,int> pii;
cons... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int sum = 0;
for (int i = 0; i < N; i++) {
int nuts;
cin >> nuts;
if (nuts > 10) {
sum += (nuts - 10);
}
else {
}
}
cout << sum << endl;
} | /* dont stick to an approach */
#include <iostream>
#include <iomanip>
#include <cmath>
#include <string>
#include <algorithm>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <vector>
#include <numeric>
#include <cstdlib>
#include <bitset>
using namespa... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define pb push_back
#define mp make_pair
#define vi vector<int>
#define vll vector<ll>
const int maxn = 2e5 + 5;
const int mod = 1e9 + 7;
int a[maxn];
ll dp[maxn][17];
int states;
int main()
{
ios::sync_with_stdio(false);
... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;++i)
using namespace std;
template<typename T>
struct UnionFind {
vector<int> d;
//コンストラクタ
UnionFind(int n = 0) : d(n, -1) {}
//根の探索と張り替え
int find(int x) {
if (d[x] < 0) return x;
//根のはりかえ
return d[x] = find(d[x]);
}
//根の結合
bool unite(int x, int y)... |
#include <bits/stdc++.h>
#define rep(i,l,r) for(int i=l,i##_end=r;i<i##_end;++i)
#define all(v) v.begin(), v.end()
#define sz(x) ((int)(x).size())
#define uniera(v) v.erase(unique(all(v)), v.end())
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(){
int n, k;
cin >> n >> k;
int sum =... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
signed main()
{
fast;
int n,k;
cin>>n>>k;
int sum=(k*(k+1))/2;
sum*=n;
int ans=(n*(n+1))/2;
ans*=100;
ans*=k;
ans+=sum;
cout<<ans<<"\n";
return ... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<int> vi;
typedef vector<ll> vl;
const int MAX = 55;
const ll MOD = 998'244'353;
// input
int N, K;
vector<vi> A, B;
ll perm[MAX];
void input() {
cin >>... | #include <bits/extc++.h>
using namespace std;
using namespace __gnu_cxx;
template<typename T>
int ex(T p){
T a = 1;
if(p == 0){
return a;
}
else{
for(T i = 1; i <= p; i++){
a = a*i%1000000007;
}
return a;
}
}
template<typename T>
int eq(T p, T q){
T r,s = 0,nextp,prevp = 0,prev2p = ... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int pass;
int ans=0;
string s;
for(int i=0; i<10; i++){
cin >> s ;
}
for(int i=0; i<10000; i++){
vector<int>a(10);
pass=i;
for(int j=0; j<4; j++){
a.at(pass%10)=1;
pass/=10;
}
bool ok=true;
for(... | #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>;
map<int, int> mp;
void prime_factor(int x) {
for (int i = 2; i * i <= x; i++) {
if (x % i != 0) continue;
while (x % i == 0) x /= i;
mp[i]++;
}
if (x != 1) mp[x... |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
string s;
cin>>n>>s;
vector<int>dp(n,1e9);
vector<vector<int> >diff(26);
for(int i=0;i<26;i++)
for(int j=0;j<n;j++)
if(s[j]!=i+'a') diff[i].push_back(j);
vector<priority_queue<int> >pq(26);
for... | #pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,sse4,fma")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
using vl = vector<ll>;
using vi = vector<int>;
using vb = vector<bool>;
using pll ... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef string str;
typedef vector<ll> vll;
typedef... | /*
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 ... |
#include <iostream>
#include <string>
#include <stdio.h>
#include <math.h>
#include <queue>
#include <algorithm>
#include <utility>
#include <vector>
#include <tuple>
#include <numeric>
using namespace std;
int main(int argc, char* argv[]){
int N,M;
cin >> N >> M;
vector<long long> A(N);
vector<long long> B(N);
vecto... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef ve... |
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
const int MOD = 1000000007;
const int INF = numeric_limits<int>::max() / 2;
typedef pair<int,int> P;
using Graph = vector<vector<int>>;
class UnionFind {
public:
vector <int> par; // 各元の親を表す配列
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
//#define int long long
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define all(x) (x).begin(),(x).end()
#define uniq(v) (v).erase(unique(all(v)),(v).end())
#define sz(x) (int)((x).size())
#define fr ... |
/////home/mohammed/.config/sublime-text-3/Packages/User
/*input
*/
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <math.h>
#include <sstream>
#include <iterator>
#include <cstdlib>
#include <unordered_map>
#include <map>
#include <li... | #pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<iostream>
#include<cstdint>
#include<cstddef>
#include<vector>
#include<iomanip>
#include<cstring>
//#include<atcoder/all>
//using namespace atcoder;
using namespace std;
using i32 = int_fast32_t;
using i64 = int_fast64_... |
#include <bits/stdc++.h>
#define int long long
#define double long double
using namespace std;
const int MOD = 998244353;
const int INF = 1e18;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
signed main(){
string S;
cin >> S;
int N = (int)S.size();
vector<pair<int, int... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(pow(2, N));
for (int i = 0; i < pow(2, N); i++) cin >> A.at(i);
int max1 = A.at(0), max2 = A.at(pow(2, N - 1));
for (int i = 0; i < pow(2, N - 1); i++) {
if (A.at(i) > max1) max1 = A.at(i);
if... |
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#include<iostream>
#include<cmath>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define mod 1000000007
#define one(x) __builtin_popcountll(x)
#define zero(x) __builtin_ctzll(x)
#d... | /* dont stick to an approach */
#include <iostream>
#include <iomanip>
#include <cmath>
#include <string>
#include <algorithm>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <vector>
#include <numeric>
#include <cstdlib>
using namespace std;
typedef l... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#define rep(i, n) for (int i = 0; i < (int)(n); ++ i)
int dp[3005][3005];
int main() {
int n, k;
cin >> n >> k;
const int mod = 998244353;
dp[0][k] = 1;
... | #include <iostream>
#include <math.h>
#include <cmath>
#include <algorithm>
#include <utility>
#include <vector>
#define ll long long
using namespace std;
int main() {
int arr[3]={0,0,0};
int x, y;
cin >> x >> y;
arr[x]++;
arr[y]++;
if(x==y){cout << x;}
else{
if(arr[0]==0){cout << "0";}
... |
#include <bits/stdc++.h>
#define mk make_pair
#define fs first
#define sc second
using namespace std;
typedef long long ll;
typedef long double ld;
// please, read the question correctly (do you need set or multiset)???
const int N=200010; //check the limits, dummy
int a[N];
int n, m, md;
int mem[101][101][101];
int dp... | #pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline")
#pragma GCC option("arch=native","tune=native","no-zero-upper")
#pragma GCC target("avx2")
#include <bits/stdc++.h>
using namespace std;
#define INF 2147483647
#define infL (1LL<<60)
#define inf (1<<30)
#define inf9 (1000000000)
#define MOD 1000... |
#include<bits/stdc++.h>
using namespace std;
const long long mod=998244353,INF=1e18;
#define ll long long
#define line cout<<"\n";
#define flush cout<<endl;
#define pll pair<ll,ll>
#define x first
#define y second
#define p_all(arr) for(auto i:arr){cout<<i<<" ";}cout<<"\n";
ll k,n;
vector<vector<ll> > tree;
ll cnt=0;
l... | #include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
//#define puts sdf
using std::vector;
//using std::cout;
//using std::endl;
using std::sort;
using std::swap;
using std::min;
using std::max;
int read(){//int 无负数
int h=0;char c=getchar();
while(c<'0'||c>'9')c=getchar();
whi... |
#pragma GCC optimize("O3") //
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define per(i, b, a) for(int i = b - 1; i >= a; i--)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int... | #include<bits/stdc++.h>
using namespace std;
#define N 200005
int n,x[N],y[N],i,p1,p2,ans,f1[N],f2[N];
int main(){
cin>>n;
for(i=1;i<=n;++i)cin>>x[i]>>y[i],f1[i]=x[i],f2[i]=y[i];
sort(x+1,x+n+1);sort(y+1,y+n+1);
if(x[n]-x[1]>y[n]-y[1]){
for(i=1;i<=n;++i)swap(x[i],y[i]),swap(f1[i],f2[i]);
}
ans=max(y[n]-y[2],y[n... |
#include <bits/stdc++.h>
using namespace std;
#define M1 1000000007
#define M3 1000000009
#define M2 998244353
#define ll long long
#define ld long double
#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
#def... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for(ll (i)=(m);(i)<(n);++(i))
#define REP(i, n) FOR(i,n,0)
#define OF64 std::setprecision(40)
const ll MOD = 1000000007;
const ll INF = (ll) 1e15;
struct Vertex {
vector<pll> node;
};
Vertex V... |
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,fma,abm,mmx,avx,avx2")
#pragma GCC target("avx2")
#pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
template <typename T = long long, const i... | #include <bits/stdc++.h>
#define err(args...) {}
#ifdef DEBUG
#include "_debug.cpp"
#endif
using namespace std;
using ll = long long;
using ld = long double;
template <typename T> using lim = numeric_limits<T>;
template <typename T> istream& operator>>(istream& is, vector<T>& a) { for(T& x : a) { is >> x; } return is; ... |
#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;
typedef pair<double,int> P;
typedef tuple<int,int,int> tii;
typedef vector<int> vec;
typedef vector<vec> mat;
#define rep(i,s,n) for(int i=(int)(s);i<(int)(n);i++)
#define bit(... | #include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#pragma GCC optimize ("-O3")
using namespace std;
void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long ... |
#include <bits/stdc++.h>
using namespace std;
int main() {
string X;
cin >> X;
int s;
for (int i = 0; i < (int)X.size(); i++) {
if (X.at(i) == '.') {
s = X.size();
for (int j = 0; j < s - i; j++) {
X.pop_back();
}
}
}
cout << X << endl;
} | #include<bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define sz(x) (ll)x.size()
#define debug(x) cout << #x << ':' << x << endl;
#define rep(i,n) for(long long i = 0; i < n ; i++)
#define reps(i,n) for(long long i = 1; i <= n ; i++)
#define make_unique(v) ... |
#include<iostream>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
const int maxT=2*100010;
int main(){
int N,W;
cin >> N >> W;
int S[N], T[N], P[N];
ll as[maxT];
rep(i,maxT) as[i]=0;
rep(i,N){
cin >> S[i] >> T[i] >> P[i];
as[S[i]] += P[i];
... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll n,w;
ll arr[200005];
int main() {
cin >> n >> w;
for(int i=0; i<n; i++){
ll s,t,p;
cin >> s >> t >> p;
arr[s] += p;
arr[t]-=p;
}
ll sum=0;
bool flag=1;
for(int i=0; i<n; i++){
sum+=arr[i];
if(sum>w){
flag=0;
break;
}
}
if(... |
#include <string>
#include <iostream>
#include <stack>
#include <queue> // priority_queue も入ってる
#include <set> // 要素数は size() で取得 multisetもある
#include <map>
#include <array> // sizeはコンパイル時定数で固定
#include <vector>
#include <numeric> // accumulate, gcd
#include <algorithm> // count_ifに必要
#include <iomanip> // cout <... | #include<bits/stdc++.h>
#define rep(i,n) for (int i=0; i<n; i++)
#define REP(i,x,n) for (int i=x; i<n; i++)
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using ll = long long;
#define P pair<ll,ll>
#define T tuple<int, int, int>
#define PP pair<P,P>
#define ALL(a) a.begin(), a.end()
int main()... |
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdlib>
#include<queue>
#include<set>
#include<cstdio>
#include<map>
#include<cassert>
using namespace std;
#define ll long long
#define reps(i, a, b) for(int i = a; i < b; i++)
#define rreps(i, a, b) for(int i = a-1; i >= b; i--)
#def... | #include<bits/stdc++.h>
using namespace std;
int n;
double f[200001];
int main()
{
cin>>n;
for(int i=n-1;i>=1;i--)
{
f[i]=1.0*((n-i)*(f[i+1]+1)+i)/(n-i);
}
printf("%.6lf",f[1]);
return 0;
} |
/*
NAME : RISHABH SINGH
INSTITUTION : DELHI TECHNOLOGICAL UNIVERSITY
*/
#include "bits/stdc++.h"
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define int long long
#define pii pair<int, int>
#define bi __builtin_inf()
#define ll long ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
string t;
char s;
cin >> s >> t;
if (s == 'Y') {
for (int i = 0; i < t.size(); ++i) {
t[i] = t[i] - 32;
}
cout << t << endl;
return ... |
#include<bits/stdc++.h>
using namespace std;
int fa[400050],ring[400050],xd[400050];
int n,a,b,ans;
int find(int x){return x==fa[x]?x:fa[x]=find(fa[x]);}
inline int read()
{
int x=0,f=1;
char c=getchar();
while(c<'0'||c>'9')
{
if(c=='-') f=-f;
c=getchar();
}
while(c>='0'&&c<='9')... | // **************************** Prajwal ********************************
#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;
//template <typename T> using ordered_set = tree<T, nul... |
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("fast-math")
#pragma GCC optimize("trapv")
#pragma GCC target("sse4")
#include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> pi;
typedef pair<long ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#defin... |
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
#include<cmath>
#include<cstdlib>
#include<ctime>
#include<vector>
#define rg register
template<typename T>void read(rg T &x){
x=0;rg int fh=1;
rg char ch=getchar();
while(ch<'0' || ch>'9'){
if(ch=='-') fh=-1;
ch=getchar();
}
while(ch>='... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=double;
using vll=vector<ll>;
using vvll=vector<vector<ll>>;
#define FOR(i,a,b) for(ll i=a;i<(ll)b;++i)
#define F(n) FOR(i,0,n)
#define FF(n) FOR(j,0,n)
#define aa first
#define bb second
#define PB push_back
#define EQ(a,b) (fabs(a-b)<=(fabs(a+... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using iPair = pair<int,int>;
using lPair = pair<ll, ll>;
using ivector = vector<int>;
using lvector = vector<ll>;
using istack = stack<int>;
using iqueue = queue<int>;
using ivv = vector<vector<int>>;
using lvv = vector<vector<ll>>;
const int INF =... | //Saptak_Roy_Turja
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
int main()
{
string s;
cin>>s;
if(s[0]==s[1]&&s[0]==s[2]){
cout<<"Won"<<endl;
}
else {
cout<<"Lost"<<endl;
}
}
|
#include <iostream>
#include <vector>
#include <set>
#include <map>
template <class E> struct FenwickTree {
int _n;
std::vector<E> data;
FenwickTree(int n) : _n(n), data(n) { }
void add(int p, E x) {
++p;
while (p <= _n) {
data[p - 1] += x;
p += p & -p;
... | // give up
#include <bitset>
#include <cassert>
#include <iostream>
#include <iomanip>
#include <list>
#include <numeric>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <valarray>
// alias, using declaration
using llint = long long; using ldouble = long double;
template <class T = llint> u... |
#include <bits/stdc++.h>
#define ll long long int
#define db double
#define pb push_back
#define mpr make_pair
#define andl "\n"
#define f first
#define s second
#define mset(x,y) memset(x,y,sizeof(x))
#define fr(i,n) for(long long int i=0;i<n;i++)
#define trace(it,x) for(auto it = (x).begin(); it != (x).end... | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define ... |
#include <bits/stdc++.h>
#define ff first
#define ss second
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
#define all(x) x.begin(), x.end()
const int inf = 1e4;
void solve() {
int n, m, u, v;
cin >> n >> m;
vector <vector <bool>> adj(n + 1, vector <bool> (n + 1));
... | #include<bits/stdc++.h>
using namespace std;
template<typename T>inline bool read(T&x){
x=0;char c=getchar();int f=1;while(!isdigit(c)&&(c!='-')&&(c!=EOF))c=getchar();
if(c==EOF)return 0;if(c=='-')f=-1,c=getchar();
while(isdigit(c)){x=(x<<1)+(x<<3)+(c&15);c=getchar();}x*=f;return 1;
}template<typename T,typename...Args... |
#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <tuple>
#include <cstdio>
#include <cmath>
#define rep(i, n) for(i = 0; i < n; i++)
#define int long long
using namespace std;
int h, w;
string s[2... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define lld long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define f first
#define s second
#define mk make_pair
/*----------------------DEBUGGER---------------------------*/
#ifndef ON... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep3(i,m,n) for(int (i)=m;(i)<=(n);(i)++)
#define rep3rev(i,m,n) for(int (i)=m;(i)>=(n);(i)--)
#define all(a) (a.begin()),(a.end())
#define rall(a) (a.rbegin()),(a.rend())
#define fi first
#define se second
#define pb p... | // Best practice
#include<bits/stdc++.h>
#define int long long
#define pb push_back
#define pf emplace_front
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define pii pair<int,int>
#define psi pair<string,int>
#define vi vect... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int64_t a,b,c,d;
cin>>a>>b>>c>>d;
if(a==c&&b==d){cout<<0<<endl;}
else if(a+b==c+d||a-b==c-d||abs(a-c)+abs(b-d)<=3){cout<<1<<endl;}
else if((a+b-c-d)%2==0||abs(a-c)+abs(b-d)<=6||abs(a+b-c-d)<=3||abs(a-b-c+d)<=3)
{cout<<2<<endl;}
else{cout<<3<... | #include <bits/stdc++.h>
#define PI 3.14159265358979323846
#define MAXINF (1e18L)
#define INF (1e9L)
#define EPS (1e-9)
#define MOD ((ll)(1e9+7))
#define REP(i, n) for(int i=0;i<int(n);++i)
#define REPA(x, v) for(auto&& x:v)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define RREP(i, n) for(int i=int(n)-1;i>=0;--i)
#de... |
#include <bits/stdc++.h>
using namespace std;
const int P = 998244353;
//const int P = 1e9 + 7;
//const int P = 1e9 + 9;
int mul(const int &x, const int &y) { return 1ll * x * y % P; }
int qpow(int x, int y) {
if (y < 0) {
y += P - 1;
}
int r = 1;
while (y) {
if (y & 1) {
r = mul(r, x);
}
x = mul(x, x);... | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
#pragma region DEBUG
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef
tree<
pair<int,int>,
null_type,
less<pair<int,int>>,
rb_tree_tag,
tree_order_statistics_node_update>
o... |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<ll(n);i++)
#define YESNO(T) if(T){cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}
#define yesno(T) if(T){cout<<"yes"<<endl;}else{cout<<"no"<<endl;}
#define YesNo(T) if(T){cout<<"Yes"<<endl;}else{cout<<"N... | #include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <regex>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using dl = long double;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
... |
#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... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#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++)
int main() {
ll N;
cin >> N;
vector<string> vec(N);
rep(i, N) {
cin >> vec.at(i);
if(vec.at(i).at(0) != '!') {
vec.at(... |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, k, n) for (int i = k; i < (int)(n); i++)
#define repd(i, n) for (int i = n-1; i >= 0; i--)
#define rrepd(i, k, n) for (int i = n-1; i >= (int)(k); i--)
#define all(x) (x).begin(),(x).end()
#define chmax(x,y... | #include <iostream>
#include <vector>
#include <queue>
#include <set>
#include <algorithm>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using Graph = vector<vector<int>>;
int main() {
float a, b;
cin >> a >> b;
float ret = b / 100 * a;
cout << ret << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<ll, ll> Pair;
typedef vector<Pair> VP;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, s, n) for(int i = (int)(s); i <... | #include<bits/stdc++.h>
using namespace std;
int n; vector<int> ans;
const int MAX=5e2+7;
int s[MAX],p[MAX];
void opt (int pos) {
swap(p[s[pos]],p[s[pos+1]]);
swap(s[pos],s[pos+1]);
ans.push_back(pos);
return;
}
void solve (int p1,int p2,int p3) {
while (!(s[p1]<s[p2]&&s[p2]<s[p3])) {
if (ans.size()%2==p1%2... |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s; cin >> s;
int n = s.size();
int ans = 0;
for(int i = 1; i <= (n-1)/2; i++){
ans += 9*pow(10,i-1);
}
if(n%2 == 0){
string sl = s.substr(0,n/2);
string sr = s.substr(n/2);
ans += stoi(sl)-pow(10,n/... | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
void solve()
{
ull MAX = 1e18;//((ull)1)<<60;
//cerr<<MAX<<endl;
ull n;
cin>>n;
vector<ull> P3, P5;
ull z = 3;
while(z<MAX) {
P3.push_back(z);
z*=3;
}
z = 5;
while(... |
#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>;
using Graph = vector<vector<int>>;
// 二次元幾何は複素数で考えると楽になるかもしれない
using C = complex<double>;
C inC() {
double x, y;
cin >> x >> y;
return C(x, y);
}
int main() {
int n;
... | #include <iostream>
using namespace std;
int main()
{
int a,b,temp1[3],temp[3];
cin>>a>>b;
temp[0]=a%10;
a=a/10;
temp[0]+=a%10;
a=a/10;
temp[0]+=a%10;
a=temp[0];
temp[1]=b%10;
b=b/10;
temp[1]+=b%10;
b=b/10;
temp[1]+=b%10;
b=temp[1];
if(a>=b)
cout<<a;
... |
#include<iostream>
#define FAST ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
using namespace std;
typedef long long ll;
const int MAXN=1e5+5;
int ok(int n, int base) {
while(n) {
if(n%base == 7) return 0;
n/=base;
}
return 1;
}
int main() {
FAST;
int n; cin>>n;
int ans=0... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
cout << N - 1;
} |
#include <bits/stdc++.h>
#define ll long long
#define endl '\n'
using namespace std;
void solve(){
ll s,p;
cin>>s>>p;
for(ll i = 1;i*i<=p;i++){
if(p % i == 0){
if(i + p/i == s){
cout<<"Yes";
return;
}
}
}
cout<<"No";
}
int main(){
... | #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) &&... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve() {
int h, w;
cin>>h>>w;
vector<string> grid(h);
for(auto &i : grid) {
cin>>i;
}
vector<vector<int>> dp(h, vector<int> (w, -1e9));
for(int i=h-1; i>=0; i--) {
for(int j=w-1; j>=0; j--) {
... | #pragma GCC optimize("Ofast")
#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;
/... |
#include <bits/stdc++.h>
#define MOD (long long)(1E9+7)
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
int main(){
int n,m;
cin >> n;
vector<vector<int>> x(n);
rep(i, n){
rep(j, n) {
cin >> m;
x[i].push_back(m);
}
}
if(n==1) {
cout << "Yes" << endl;
... | /**
* author: said_v15
**/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
typedef long long ll;
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
... |
#include <bits/stdc++.h>
using namespace std;
int a[100010], b[100010];
map <int, vector <int> > all;
map <int, int> cnt, sum;
int main () {
int n, L; scanf("%d%d", &n, &L);
a[0] = 0, a[n + 1] = L + 1;
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
for (int i = 0; i <= n + 1; i++) {
all[a[i] - i].push_... | /*
* @Author: zhl
* @LastEditTime: 2021-02-13 22:14:39
*/
#include<bits/stdc++.h>
using namespace std;
const int N = 2e3 + 10;
typedef long long ll;
char mp[N][N];
int n,m;
vector<int>G[N];
int fa[N];
int find(int a){
return a == fa[a] ? a : fa[a] = find(fa[a]);
}
void merge(int a,int b){
a = find(a);b = f... |
// abc203_c
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
#ifdef LOCAL
#include "../../debug_util/cxx-prettyprint/prettyprint.hpp"
#include "../../debug_util/rng.hpp"
#include "../../debug_util/timer.hpp"
#endif
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<ll, ll>;
... | /* code by savagecarol */
#include <bits/stdc++.h>
using namespace std;
/* predefined value */
#define yes() cout << "YES"
#define no() cout << "NO"
#define one() cout << "1"
#define zero() cout << "0"
#define ll long long int
#define mp make_pair
#define fi first
#define se second
#define pb push_back
/* loops */... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, max = 0;
bool sin = true;
cin >> N;
int a[N];
for (int i=0; i<N; i++){
cin >> a[i];
if (max < a[i])
max = a[i];
if (i>0 && a[i-1] != a[i])
sin = false;
}
if (sin){
... | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
//(double)clock() / CLOCKS_PER_SEC;
int main... |
#include<bits/stdc++.h>
using namespace std;
int a,b,c;
int main()
{
cin>>a>>b>>c;
if(c%2==0)
{
if(abs(a)>abs(b)) cout<<">";
if(abs(a)==abs(b)) cout<<"=";
if(abs(a)<abs(b)) cout<<"<";
}
else
{
if(a>b) cout<<">";
if(a==b) cout<<"=";
if(a<b) cout<<"<";
}
return 0;
} | /*
author : aryan57
created : 13-June-2021 17:33:20 IST
*/
#include <bits/stdc++.h>
using namespace std;
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable... |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
//template
#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define ALL(v) (v).begin(),(v).end()
using ll=long long int;
const int inf = 0x3fffffff; const ll INF = 0x1fffffffffffffff; const double eps=1e-12;
template<typename T>inline bool ch... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <iomanip>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#includ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 100010;
int a[N], b[N], c[N], d[N];
int n, l;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> l;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= n; i++)
cin >> b[i];
... | #include <bits/stdc++.h>
using namespace std;
#define eb emplace_back
using ll = long long;
const int inf = 1e9+5;
const ll INF = 1e18+5;
const int nax = 2e5+500;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int h, w;
cin >> h >> w;
vector<vector<int>> g(h+1, vector<int> (w+1));
for(int i=1;i<=h;i++... |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#pragma comment(linker, "/stack:200000000")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=n... | #include <bits/stdc++.h>
#define Vanya Unstoppable
#define int long long
#define pb push_back
#define ll long long
#define pii pair<int, int>
#define all(a) a.begin(), a.end()
#define TESTS 0
typedef long double ld;
using namespace std;
void solve() {
string a;
cin >> a;
int n = a.size();
for (in... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, ans = 0;
cin >> n;
int sum = 0;
for(int i = 1; 1;++i){
if(sum >= n){
ans = i - 1;break;
}
sum+=i;
}
cout << ans << '\n';
}
| #include<bits/stdc++.h>
using namespace std;
int n;
int main(){
scanf("%d",&n);
for(int i=1;i;++i)if(i*(i+1)/2>=n){printf("%d",i);return 0;}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define co(n) cout<<n<<endl;
const double eps=1e-10,pi=3.1415926535898;
const int mod=1e9+7,maxn=410;
int T,n,m,k,x,y;
long long dp[maxn][maxn];
void init() {
for (int i=0;i<maxn;++i) {
dp[i][0] = dp[i][i] = 1;
}
for (int i=2;i<maxn;++i) {
for (int j=1;j<i;++j) {
... | #include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll; typedef pair<int,int>pint;
using vll=vector<ll>; using vs=vector<string>;
#define b2e(v)v.begin(),v.end()
#define p2a(v, p) v[p.first][p.second]
class var { public: ll min,max,ct,sum,dif,result; };
int main()... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll maxn=200005;
const ll mod=998244353;
const ll INF64 = ll(1e18);
const ll max2=10500000;
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
vector<ll> adj_row[52],adj_c... | #include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define ll long long
#define ALL(a) (a).begin(),(a).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define fi first
#define se second
#define pb push_back
#define ... |
#line 1 "main.cpp"
#include <iostream>
#include <algorithm>
#include <numeric>
#include <vector>
#include <string>
using namespace std;
using lint = long long;
void solve() {
int n, m;
cin >> n >> m;
vector<lint> cnt(2, 0);
while (n--) {
string s;
cin >> s;
++cnt[count(s.begin... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i,s,n) for(int i = s; i < (int)(n); i++)
#define Rep(i,s,n) for(int i = n; i >= (int)(s); i--)
int main(){
int n;
cin >> n;
vector<ll>r, g, b;
rep(i, 0, 2 * n) {
ll a;
char c;
cin... |
#include<iostream>
#include<vector>
#include<queue>
#include<algorithm>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<(n);i++)
#define P pair<int,int>
//#define LOCAL_TEST
#define init_val 2500
template<class T>int chmin(T&a,const T&b){if(b<a){a=b;return 1;}return 0;}
//----------def struct... | #include<bits/stdc++.h>
using namespace std;
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')';}
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
using ll = long long;
using P = pair<int, int>;
const ll INF = 1LL << 60;
const int MAX = 200001;
int main() {
ll n, w;
cin >> n >> w;
bool flag = false;
vector<ll> a(MAX, 0);
rep(i, n){
ll s, t, p;
cin >... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll b,c;
scanf("%lld%lld",&b,&c);
ll cnt=0;
if(b<=0){
cnt=c+1;
c--;
if(b==0)cnt--;
if(c>0&&b<0)cnt+=min(-2*b-1,c-1);
}else {
cnt=c+(c==1?1:0);
cnt+=min(2*b-1,c-1);
}printf("%lld\n",cnt);
} |
/**
* 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= ... | /*
{
######################
# 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 <bits/stdc++.h>
//#include <atcoder/all>
#define endl "\n"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
template<class T>
inline bo... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(var, begin, end) for (int var = (begin); var <= (end); var++)
#define RFOR(var, begin, end) for (int var = (begin); var >= (end); var--)
#define REP(var, length) FOR(var, 0, length - 1)
#define RREP(var, length) RFOR(var, length - 1, 0)
#de... |
/**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
inline int inint(istream& in) {int x; in >> x; return x;}
inline ll inll(istream& in) {ll x; in >> x; retur... | #include <bits/stdc++.h>
using namespace std;
// using mint = long double;
// using mint = modint998244353;
// using mint = modint1000000007;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<ll, P> T;
typedef pair<ll, vector<ll>> Pd;
const ll INF = 1e18;
const ll fact_table = 820000;
priority_queue<ll> p... |
#include<iostream>
#define ll long long
using namespace std;
ll T,X,Y,P,Q,a,b,c,k1,k2,tans;
ll exgcd(ll a,ll b,ll &x,ll &y) {
if(!b) {
x=1,y=0;
return a;
}
int t=exgcd(b,a%b,y,x);
y-=a/b*x;
return t;
}
int main() {
cin>>T;
while(T--) {
cin>>X>>Y>>P>>Q;
a=2*X+2*Y,b=P+Q;
tans=5e18;
for(int q=0; q<Q; q+... | //#include <atcoder/maxflow.hpp>
#include <memory>
#include <iostream>
#include <map>
#include <list>
#include <set>
#include <algorithm>
#include <vector>
#include <sstream>
#include <string>
#include <functional>
#include <queue>
#include <deque>
#include <stack>
#include <limits>
#include <unordered_map>
#include <u... |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define cinf(n,x) for(int i=0;i<(n);i++)cin>>x[i];
#define ft first
#define sc second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(),(v).end()
#define LB(a,x) lb(all(a),x)-a.begin(... | /*
* @author: codancer
* @createTime: 2020-12-05, 19:52:03
*/
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include ... |
#include <bits/stdc++.h>
using namespace std;
mt19937_64 llrand((int) chrono::steady_clock::now().time_since_epoch().count());
#define st first
#define nd second
#define pb push_back
#ifndef ONLINE_JUDGE
#define db(x) cerr << #x << " == " << x << endl
#define dbs(x) cerr << x << endl
#define _ << ", " <<
#else... | #include <iostream>
#include <vector>
#include <deque>
#include <algorithm>
#include <numeric>
#include <string>
#include <cstring>
#include <list>
#include <unordered_set>
#include <tuple>
#include <cmath>
#include <limits>
#include <type_traits>
#include <iomanip>
#include <map>
#include <unordered_map>
#include <que... |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
/*coment
*/
int main () {
using ll = long long int ;
using p = pair<int,int>;
int a,b,x,y;
cin >> a >> b >> x >> y;
// a + 1 = b// a = b
int t = 0;
if (a - 1 == b) {
cout << x << endl;
}
else {
i... | //nik
#include <bits/stdc++.h>
#pragma GCC target("avx")
#pragma GCC optimize("Ofast")
#define reg register
#define FOR(a, b, c) for (a = b; a <=c; a++)
#define rFOR(a, b, c) for (a = b;a >= c; a--)
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define SORT(x) sort(all(x))
#define all(x) x.begin(), ... |
#include <iostream>
#include <cstdio>
#include <vector>
#include <queue>
#include <cmath>
#define re register
#define pb push_back
#define cl clear
#define MAXN 100005
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
inline int read(){
int x = 0, f = 1;
char ch = g... | #include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <string>
#include <vector>
#include <cstdlib>
using namespace std;
int main(){
int N,M,tmp,cnt,ANS_size;
vector<int>vec,ANS_vec;
cin>>N>>M;
for(int i = 1;i<=N+M;i++){
cin>>tmp;
vec.push_back(tm... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long; // 2^31-1
using P = pair<string, int>; // 2変数を一括でつかえる 2重にすれば3,4変数同時も．
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define repi(i, s, n) for (int i = (s); i <= (n); i++)
#define all(v) v.begin(),v.end()
#define INF32 2147483647 // 32bit max
#define INF... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define endl '\n'
#define pb push_back
#define ub upper_bound
#define lb lower_bound... |
#include<bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define ll long long
#define pb push_back
#define vec vector<ll>
#define pii pair<ll,ll>
#define pr_que priority_queue<pii,vector<pii>,greater<pii> >
#define itr(i,x,y) for(ll i=x;i<y;i++)
#define mo... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
const long long MOD = 1000000007;
const long long INF = 9999999999999999;
using ll = long long;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.