code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
//#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 int long long
using namespace std;
string refridgerator(string s, vector<char> &p){
for(char &c : s) c = p[c-'0'];
return s;
}
signed main(){
string s1,s2,s3; cin >> s1 >> s2 >> s3;
set<char> cs;
for(char c : s1) cs.insert(c);
for(char c : s2) cs.insert(c);
... |
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
using ld = long double;
using vld = vector<ld>;
using vb = vector<bool>;
#define rep(i, n) for ... | /**
* created: 28/03/2021, 15:04:37
**/
#include <bits/stdc++.h>
using namespace std;
const int max_n = 200222, mod = 998244353;
int n, ans, a[max_n];
void inc(int &x, int y) {
x += y;
if (x >= mod) {
x -= mod;
}
}
int mul(int x, int y) {
return 1LL * x * y % mod;
}
int main() {
//f... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i=0;i<n;i++)
#define Rep(i,x,n) for(i=x;i<=n;i++)
#define all(v) v.begin(),v.end()
#define foreach(c,itr) for(__typeof(c.begin()) itr=c.begin();itr!=c.end();itr++)
#define p_b push_back
#define pii pair<int,int>
#define fr first
#define sc second
#defin... | #include<bits/stdc++.h>
using namespace std;
using LL=long long;
using P=pair<int,int>;
using T=tuple<LL,int,int,int>;
constexpr LL mod=1000000007;
constexpr LL inf=1e18;
constexpr double eps=1e-13;
constexpr double pi=3.141592653589;
int in(){
int x;
scanf("%d",&x);
return x;
}
struct segtree{
int N=26... |
#include <iostream>
#include <string>
using namespace std;
using Int = long long int;
Int combi(int A, int B)
{ // (A + B)! / (A! B!);
if (A > B) return combi(B, A);
if (A == 0) return 1;
return combi(A - 1, B) * (A + B) / A;
}
void f(const string &S, int A, int B, Int &K)
{
if (K <= 0) return;
Int C = co... | #include <bits/stdc++.h>
#define rep(i,n) for (int i=0;i<(n);i++)
#define rep1(i,n) for (int i=1;i<(n);i++)
using namespace std;
using ll = long long;
using P = pair<int, ll>;
void comb(vector<vector <long long int> > &v){
for(int i = 0;i <v.size(); i++){
v[i][0]=1;
v[i][i]=1;
}
for(int k = 1;k <v.size()... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int c;
vector<vector<int>> a(n, vector<int>(2));
for(int i = 0; i < 2*n; i++){
cin >> a.at(i % n).at(i / n);
}
for(int i = 0; i < n; i++){
c += a.at(i).at(0) * a.at(i).at(1);
}
if ( c == 0){
cout << "Yes" << endl;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve() {
ll n;
cin >> n;
vector<ll> a(n), b(n);
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
ll ans = 0;
for (int i = 0; i < n; i++)
ans += a[i]*b[i... |
#include <bits/stdc++.h>
#define rep(i,N) for(int i=0; i<(N); i++)
using namespace std;
int main() {
int N,M,Q;
cin >> N >> M >> Q;
vector<pair<int,int>> a(N);
rep(i,N) cin >> a.at(i).second >> a.at(i).first;
vector<int> b(M),k(M);
rep(i,M){
cin >> b.at(i);
k.at(i) = b.at(i);
}
vector<pair<int,... | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
#define FASTIO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define PRECISION cout << fixed << setprecision(20);
using namespace std;
void solve() {
int n, m, q;
cin >> n >> m >> q;
vector<array<int, 2>> arr(n);... |
#include<iostream>
#include<vector>
#include<algorithm>
#define rep(i,n) for(ll i = 0; i < (n); i++)
using ll = long long;
using namespace std;
int main(){
ll n, ans = 0;
cin >> n;
vector<ll>a(n);
rep(i,n) cin >> a[i];
ans = (n-1)*(1+n-1)/2;
sort(a.begin(),a.end());
bool check = false;
... | #include <bits/stdc++.h>
using namespace std;
int main()
{
long long n;
cin>>n;
long long a[n];
for(int i=0;i<n;i++)
{
cin>>a[i];
}
long long sum=0;
map<int,int>m;
for(int i=0;i<n;i++)
{
sum+=(n-i-1-m[a[i]]);
m[a[i]]++;
}
cout<<sum;
re... |
#include<bits/stdc++.h>
#include<bits/stdc++.h>
#define min(a,b) ((a)<(b)?(a):(b))
#define max(a,b) ((a)>(b)?(a):(b))
#define lli long long int
using namespace std;
int main()
{
string s;
cin>>s;
int flag=0,count=0;
for(int i=0; i<=s.length(); i+=2)
{
if(s[i]>=9... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
if((N * 108) / 100 < 206) cout << "Yay!" << endl;
else if((N * 108) / 100 == 206) cout << "so-so" << endl;
else cout << ":(" << endl;
} |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, n) FOR(i, 0, n)
#define FOR(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define ALLR(obj) (obj).rbegin(), (obj).rend()
#define CEIL(a, b) ((a - 1) / b + 1)
void solve() {
s... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define rep1(i,n) for(int i=1;i<=(int)n;i++)
#define sp(n) cout << fixed << setprecision(n)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b... |
#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()... | #include <bits/stdc++.h>
using namespace std;
const long LINF = 1L << 62;
const int IINF = 1 << 30;
#define rep(i, s, n) for (long i = s; i < (long)(n); i++)
template <class T>
using Graph = std::vector<std::vector<T>>;
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
bool is_in(int x, int y, int xlim, int ylim)
... |
#line 2 "/home/defineprogram/Desktop/Library/template/template.cpp"
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(ll i=0;i<n;i++)
#define REP(i,n) for(ll i=1;i<n;i++)
#define rev(i,n) for(ll i=n-1;i>=0;i--)
#define all(v) v.begin(),v.end()
#define P pair<ll,ll>
#define len(s) (l... | #include <cmath>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include<cstdio>
#include<functional>
#include <bitset>
#include <iomanip>
#include <cctype>
#include <list>
#include <cassert>
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repr(i, n) ... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define S second
#define F first
#define f(i,n) for(int i=0;i<n;i++)
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define vi vector<int>
#define pii pair<int,int>
const int MOD = 1e9+7;
int mod_pow(int a,i... | #include<bits/stdc++.h>
using namespace std;
#define ALL(x) begin(x),end(x)
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define mod 1000000007
using ll=long long;
const int INF=1000000000;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0},dy[]={0... |
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9+7;
//const long long MOD = 998244353;
const long long INF_LL = 1e18+11; const int INF_int = 1e9+11;
#define ll long long
#define mp std::make_pair
#define rep(i,n) for(int i = 0;i<n;i++)
#define lrep(i,n) for(long long i = 0;i<n;i++)
#define All(a)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main(){
string s, t;
cin >> s >> t;
if(s[0] == 'Y'){
printf("%c\n", t[0]+('A'-'a'));
} else {
cout << t << endl;
}
} |
// arc120_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<int, int>... | #include <cstdio>
#include <iostream>
#include <cassert>
#include <string>
#include <algorithm>
#include <cstring>
#include <utility>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <cmath>
#include <deque>
#include <random>
#include <chrono>
#include <numeric>
#include <unord... |
#include <bits/stdc++.h>
using namespace std;
int n,m;
int a[805][805];
int pre[805][805];
bool check(int x) {
for(int i=1;i<=n;i++) {
for(int j=1;j<=n;j++) {
pre[i][j]=pre[i-1][j]+pre[i][j-1]-pre[i-1][j-1]+(a[i][j]<=x?-1:1);
}
}
for(int i=m;i<=n;i++) {
for(int j=m;j<=n;j++) {
if(pre[i][j]-pre[i-m]... | #include<bits/stdc++.h>
using namespace std;
int main(){
int N,M;
cin>>N>>M;
int L=max(N,M);
vector<int> A(N);
vector<int> B(M);
vector<int> C(N+M);
for(int i=0;i<N;i++){cin>>C.at(i);}
for(int i=0;i<M;i++){cin>>C.at(i+N);}
sort(C.begin(),C.end());
if(C.at(0)!=0&&C.at(0)!=C.at(1)) cout<<C.at(0)<... |
#include<iostream>
#include<bits/stdc++.h>
#include<vector>
#define vi vector<int>
#define lli long long int
#define fo(i,n) for(int i=1;i<=n;i++)
#define foo(i,n) for(int i=0;i<n;i++)
#define ff first
#define ss second
#define pb push_back
#define vii vector<lli>
#define ok ios_base::sync_with_stdio(false); cin.tie(NU... | #include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
# define rep(i,a,b) for(int i=(a); i<=(b); ++i)
inline int readint(){
int a = 0; char c = getchar(), f = 1;
for(; c<'0'||c>'9'; c=getchar())
if(c == '-') f = -f;
for(; '0'<=c&&c<='9'; c=getchar())
a = (a<<3)+(a<<1)... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define printV(v) for(int i=0;i<(int)v.size();i++){cout << v[i]<< " ";} cout << endl
#define printRev(v) for(int i=(int)v.size()-1;i >= 0;i--){cout << v[i] << " ";} cout << endl
... | #include <bits/stdc++.h>
using namespace std;
long long INF = 1000000000000000000;
int main(){
string X;
cin >> X;
long long M;
cin >> M;
int N = X.size();
int ma = 0;
for(int i = 0; i < N; i++){
ma = max(ma, (int)(X[i] - '0'));
}
if(N == 1){
if(M < X[0] - '0') cout <... |
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define ll long long
#define int long long
#define inf ((ll)1e18)
#define mod 1000000007
#define double long double
#define ull unsigned long long
#define vi vector<ll>
#define ppi ... | #include <iostream>
using namespace std;
typedef long long ll;
int main(void) {
ll n, ans = 0;
ll A, B;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> A >> B;
ans += B * (B + 1) / 2 - (A - 1) * A / 2;
}
cout << ans << endl;
return 0;
} |
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int n,counter=0,mx=0,ans=0;
cin>>n;
int arr[n];
for(int i=0;i<n;i++){
cin>>arr[i];
}
sort(arr,arr+n);
for(int i=2;i<=arr[n-1];i++){
counter=0;
for(int a=0;a<n;a++){
if(arr[a]%i==0){
counter++;
}
}
if(counter>mx){
mx=c... | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
using namespace std;
#define int ll
#define FOR(i,s,e) for(ll i = s; i <= (ll)e; ++i)
#define DEC(i,s,e) for(ll i = s; i >= (ll)e; --i)
#define IAMSPEED ios_base::sync_with_stdio(false); cin.tie(0);
#define db(x) cerr << #x << "=... |
#include <bits/stdc++.h>
typedef long long int LL;
typedef unsigned long long int ULL;
using namespace std;
// 插入此處
constexpr int MAXN = 1e5 + 2;
array<LL, MAXN> A;
int main() {
std::ios::sync_with_stdio(false);
cin.tie(0);
int N; cin >> N;
for (int i = 0; i < N; ++i) cin >> A[i];
sort(A.begin(),... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define REP(i, a, b) for (ll i = a; i <= b; i++)
#define REP_REV(i, a, b) for (ll i = a; i >= b; i--)
#define debug(x) cerr << #x << " is " << x << endl;
#define all(x) (x).begin(),... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int main() {
ll b, c;
cin >> b >> c;
ll ans = 0;
if (b > 0) {
ll l1 = b - c / 2;
ll r1 = b + (c - 2) / 2;
ll l2 = -b - (c - 1) / 2;
ll r2 = -b + (c - ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using uint = unsigned int;
using ull = unsigned long long;
#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) ... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
string h;
cin >> h;
for(int i=0;i<a;i++){
if(h.at(i)=='x'){
if(b>0){
b--;
}
else{
b=0;
}
}
else if(h.at(i)=='o'){
b++;
}
}
if(b<=0){
cout << 0 << ... | #pragma GCC optimize("Ofast") //Comment optimisations for interactive problems (use endl)
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
#define fastio ios:: sync_with_stdio(0);cin.tie(0);cout.tie(0);cout<<fixed;cout<<setprecision(1... |
#include <bits/stdc++.h>
#define int int64_t
const int N=1e5+9, N2=2e5+9;
using namespace std;
signed main(){
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n, q;
string s,c;
cin >> n >> s >> q;
c=s.substr(n,n);
s.erase(n,n);
for (int i=0; i<q; i++){
int t, a, b;
cin >> t >> a >> b;
if (t=... | #include<bits/stdc++.h>
#define ll long long
#define re register
#define INF 2147483647
using namespace std;
inline int read()
{
int f=1,x=0;char s=getchar();
while(s<'0'||s>'9')
{
if(s=='-') f=-1;
s=getchar();
}
while(s>='0'&&s<='9')
{
x=x*10+s-48;
s=getchar();
}
return f*x;
}
map<string,int> m1,m2;
... |
#include "bits/stdc++.h"
#define all_of(x) std::begin(x), std::end(x)
#ifdef _GLIBCXX_DEBUG
#define debug(x) cerr << #x << ": " << x << endl
#else
#define debug(x)
#endif
using namespace std;
using LL = long long;
template<typename T>
ostream& operator << (ostream& out, const vector<T>& v) {
out << "["... | #include <cstdio>
#include <cstring>
#include <cmath>
#include <cassert>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <iostream>
#include <numeric>
/* debug macros */
#ifdef WAFDAYO
#define DBG_LINE() {std::cerr<<"\e[2m[L"<<__LINE__<<... |
// 4 3 2 1
//
// ( = +1
// ) = -1
// >= 0 every time
// == 0 at the end
#include "bits/stdc++.h"
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
#define int long long
#define FOR(i, a, b) for (int i = (a), _##i = (b); i <= _##i; ++i)
#de... | #include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
template... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> PP;
#define MOD 1000000007
//#define MOD 998244353
#define INF 2305843009213693951
//#define INF 810114514
#define PI 3.141592653589
#define setdouble setprecision
#define REP(i,n) for(ll i=0;i<(n);++i)
#define OREP(i,n) for(ll i=1;... | #include <iostream>
#include <iomanip>
#include <vector>
#include <set>
#include <string>
#include <queue>
#include <algorithm>
#include <map>
#include <cmath>
#include <numeric>
#include <list>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <tuple>
#include <deque>
#include <complex>... |
/*
Arthor: Ender_zzm
E-mail: zzm_ender_wiggin@outlook.com
Blog: oi.ender-zzm.pro
*/
#include <bits/stdc++.h>
using namespace std;
inline int Isdigit(char c) {
if (c < '0' || c > '9') return 0;
return 1;
}
template <class T>
T read(){
register T x = 0, flag = 1;
register char ch;
while (!Isdigit(ch = ge... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
#... |
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define print(x) cout << (x) << '\n'
typedef long long ll;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
const ll MOD = 1000000007;
//const ll MOD = 998244353;
template <typename T> inline bool chmax(T &a, T b) {return a ... | #pragma GCC optimize "trapv"
#include<iostream>
#include <bits/stdc++.h>
using namespace std;
#define fio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define vi vector<int>
#define vll vector<ll>
#define pb push_back
#define l... |
//#pragma GCC optimize ("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
#define pb push_back
#define F first
#define S second
#define ins insert
#define mp ma... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <st... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repp(i, st, en) for (ll i = (ll)st; i < (ll)(en); i++)
#define repm(i, st, en) for (ll i = (ll)st; i >= (ll)(en); i--)
#define all(v) v.begin(), v.end()
void c... | #include<bits/stdc++.h>
using namespace std;
int a[10];
int main()
{
cin>>a[0]>>a[1]>>a[2];
sort(a,a+3);
if(a[1]-a[0]==a[2]-a[1])
{
cout<<"Yes";
}
else
cout<<"No";
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
// type alias
typedef long long LL;
typedef pair<int,int> II;
typedef tuple<int,int,int> III;
typedef vector<int> VI;
typedef vector<string> VS;
typedef unordered_map<int,int> MAPII;
typedef unordered_set<int> SETI;
template<class T> using VV=vector<vector<T>>;
// minmax
te... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
using vi = vector<int64_t>;
using vvi = vector<vi>;
using pii = pair<int64_t, int64_t>;
int INF = 1e9;
int main() {
char s, t;
cin >> s >> t;
if (s == 'Y')... |
#include <cstdio>
#include <algorithm>
using namespace std;
#define int long long
#define mod 998244353
#define maxn 200005
int n, ret, cnt;
int a[maxn], sum[maxn];
int qkpow( int x, int y ) {
int ans = 1;
while( y ) {
if( y & 1 ) ans = ans * x % mod;
x = x * x % mod;
y >>= 1;
}
return ans;
}
signed main() ... | #include<iostream>
#include<array>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#incl... |
/**
* author: shu8Cream
* created: 06.03.2021 11:57:11
**/
#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()
using ll = long long;
using P = pair<int,int>;
using vi = vector<int>;
using vvi = vector<vi>;
int main() {
cin.tie(nullp... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> A(N), B(M);
for (int& x : A) cin >> x;
for (int& x : B) cin >> x;
vector<int> C;
set_symmetric_difference(A.begin(), A.end(),
B.begin(), B.end(),
bac... |
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <fstream>
#include <sstream>
#include <set>
#include <map>
#include <vector>
#include <list>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <string>
#include <stack>
#include <queue>
#include <bitset> //UWAGA - w czasie kompilacji ... | #include<iostream>
#include<algorithm>
#include<cstdlib>
#include<string>
#include<vector>
#include<math.h>
#include<map>
using namespace std;
using ll = long long;
int main() {
string s,t;
cin >> s >> t;
if(s == "Y"){
t = toupper(t[0]);
cout << t << endl;
}else{
cout << t << end... |
#include <bits/stdc++.h>
using namespace std;
long long int func(long long int x)
{
long long int val1=0;
long long int val2=0;
string s="";
while(x>0)
{
int temp=x%10;
s.push_back(temp+'0');
x/=10;
}
sort(s.begin() , s.end());
// cout<<s<<endl;
long l... | /*************************************************************************
> File Name: C.cpp
> Author: Bran
> Mail: 1811161330@qq.com
> Created Time: 2021/1/30 20:29:30
************************************************************************/
#include <bits/stdc++.h>
#define all(x) x.begin(), x.end... |
#include<bits/stdc++.h>
#define ll long long int
#define ld long double
#define pb push_back
#define fi first
#define se second
#define all(x) x.begin(),x.end()
#define mem(x,y) memset(x,y,sizeof(x))
#define pii pair<int,int>
#define pll pair<ll,ll>
#define INF 1e9+10
#define INFL 1e18
//#define mod 1000000007
#define... | #include<bits/stdc++.h>
#define rep(i,a,b) for(R int i=a;i<=b;i++)
#define R register
#define endl putchar('\n')
const int N=1005;
const long long mod=998244353;
using namespace std;
int n,m;
long long ans=1;
char s[N][N];
void solve() {
rep(sm,2,n+m) {
int r=0,b=0;
if(sm<=m+1) {
rep(i,1,sm-1) {
int j=sm-... |
#include <iostream>
#include <vector>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> A(N),mod_200(N);
for(int n=0;n<N;n++) cin >> A[n];
for(int n=0;n<N;n++) mod_200[n] = A[n]%200;
vector<long long> num_pairs(200,0);
for(int n=0;n<N;n++) num_pairs[mod_200[n]]++;
long long... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <queue>
#include <deque>
#include <bitset>
#include <iterator>
#include <list>
#include <stack>
#include <map>
#include <set>
#include <functional>
#include <numeric>
#include <utility>
#include <iomanip>
#include <... |
#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <bitset>
#include <ctime>
#include <map>
#include <uno... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
long long A[N];
for (int i=0; i<N; i++) cin >> A[i];
sort(A,A+N);
long long count=0;
for (int i=0; i<N; i++) {
count+=(A[i]*(-N+1+2*i));
}
cout << count << endl;
} |
#include <iostream>
#include <stdio.h>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <cstring>
#include <algorithm>
#include <math.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
#de... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
bool coprime(ll a, ll b) {
if ( __gcd(a, b) == 1)
return true;
else
return false;
}
int main()
{
ll N;
cin >> N;
ll X[N];
for (ll i = 0; i < N; i++) {
cin >> X[i];
}
const int p... |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
deque<char> dq;
bool b=true;
for(int i=0;i<int(s.size());i++){
if(s[i]=='R') b=!b;
else{
if(b){
if(!dq.empty()&&dq.back()==s[i]){
dq.pop_back();
}else{
dq.push_back(s[i]);
}
... | #include <iostream>
#include <cmath>
#include <climits>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <stack>
#include <bitset>
#include <functional>
#include <random>
#include <casser... |
#include <algorithm>
#include <iostream>
#include <vector>
#include <map>
#include <cstdio>
#include <string>
#include <cmath>
#include <queue>
#include <tuple>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <random>
#include <set>
#include <sta... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)
#define ALL(v) (v).begin(),(v).end()
#define CLR(t,v) memset(t,(v),sizeof(t))
template<class T1,class T2>ostream& operator<<(ostream& os,const pair<T1,T2>&a){return os<<"("<<a.first<<","<<a.second<< "... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define chmin(a, b) a = min(a, b)
#define chmax(a, b) a = max(a, b)
#define ALL(v) v.begin(),v.end()
#define sz(v) (ll)v.size()
const ll INF = 1e18;
// E - Train
ll Ceil(ll a, ll b) {
if(a%b == 0) return a/b;
else return (a+b)/b;
}
int main()... | #include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <unordered_map>
#include <vector>
#include <queue>
#include <set>
#include <bitset>
#include <cmath>
#define P 131
#define lc u << 1
#define rc u << 1 | 1
using namespace std;
typedef long long LL;
typedef pair<LL,int> PII;
const ... |
#include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (ll i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define all(x) (x).begin(),(x).end()
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;
using P = pair<ll, ll>;
// clang-format off
#ifdef _DEBUG_
#define dump(...) do{... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef pair<int,int> pi;
typedef vector<pi> pii;
#define all(x) x.begin(),x.end()
#define sz(x) (int)(x).size()
#define pb push_back
#define mk make_pair
#define en '\n'
void solve() {
ll n,ans = 0;
cin >> n;
n *= 2;
set<l... | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define ff first
#define ss second
ll a,b,c,d=0,e=0,i,f=0,g=0,j,k=0,l=0,r,z,m[101],h[101],p[101],mod=1000000007,mod1=998244353;
string t,x,q,s;
ll df[201];
//double ;
vector<ll>v;
vector<ll>u,w;
vector<ll>dv[201];
//vector<string>;
s... |
#include "bits/stdc++.h"
using namespace std;
#define REP(i, n) for(ll i = 0;i < n;i++)
#define ll long long
#define MOD 998244353LL
using vi = vector<ll>; // intの1次元の型に vi という別名をつける
using vvi = vector<vi>; // intの2次元の型に vvi という別名をつける
using vvvi = vector<vvi>; // intの2次元の型に vvi という別名をつける
const ll llMAX=9223372036854775... | #include "bits/stdc++.h"
#define int long long
#define endl '\n'
using namespace std;
typedef long long ll;
#define db(x) cerr << #x << ": " << x << '\n';
#define read(a) int a; cin >> a;
#define readb(a, b) int a, b; cin >> a >> b;
#define readc(a, b, c) int a, b, c; cin >> a >> b >> c;
#define readarr(a, n) int a[(... |
/**
* created: 21/03/2021, 13:00:59
**/
#include <bits/stdc++.h>
using namespace std;
template<bool inv, typename T>
void xor_convolution(int n, T a[]) {
if (n == 0) {
return;
}
for (int i = 0; i < n / 2; ++i) {
T x = a[i] + a[i + n / 2], y = a[i] - a[i + n / 2];
a[i] = x;
... | #include <iostream>
using namespace std;
int main() {
long n,m,k,cou;
cin>>n>>m;
k=0;
string str;
for(long i=0; i<n; i++){
cin>>str;
cou=0;
for(long j=0; j<m; j++){
if(str.at(j)=='1'){
cou++;
}
}
cou=cou%2;
if(cou==1)k++;
}
k=k*(n-k);
cout<<k;
}
|
#include <iostream>
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#define fast_io \
ios::sync_with_stdio(false); ... | #include<cstdio>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<string>
#include<sstream>
#include<queue>
#include<list>
#include<stack>
#include<bitset>
#include<iomanip>
#include<set>
#include<cmath>
#include<map>
#include<functional>
#define int long long
#define IO ios::sync_with_stdio(false)
us... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll; typedef double db;
typedef pair<int, int> pii; typedef pair<ll, ll> pll;
typedef vector<int> vi; typedef vector<ll> vl;
typedef vector<pii> vpii; typedef vector<pll> vpll;
#define FOR(n) for(int i=0;i<n;++i)
#define IOS ios::sync_with_stdio(0); cin.tie(... | //Bismillahirrahmanirrahim
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long lo;
typedef pair< lo,lo > PII;
#define fi first
#define se second
#define mp make_pair
#define endl "\n"
#define pb push_back
#define fio() ios_base::sync_with_stdio(fa... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, ca, cb, ans, cur;
cin >> A >> B;
if(A>=B){
ans=0;
for(int i=1;i<=A;i++){
cout << i << " ";
if(i>B){ans+=i;}
}
for(int i=1;i<=B;i++){
cur=-i;
if(i==B){cur-=ans;}
cout << cur << " ";
}
}else{
... | #ifdef DBG_MACRO_NO_WARNING
#include <dbg.h>
#else
#define dbg(...) ((void)0)
#endif
#include <bits/stdc++.h>
#define all(c) begin(c), end(c)
#define isz(c) (int)(c).size()
using namespace std;
using ll = long long;
using ii = pair<int, int>;
using vi = vector<int>;
int main(void)
{
ios::sync_with_stdio(false), c... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int>x(n);
vector<long double>x2(n);
for(int i=0;i<n;i++)cin >> x.at(i);
for(int i=0;i<n;i++)x2.at(i)= x.at(i);
long long ans1=0;
for(int i=0;i<n;i++)ans1+=abs(x.at(i));
cout << ans1 << endl;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define endl "\n"
#define alfa "abcdefghijklmnopqrstuvwxyz"
#define pi 3.141592653589793
int main(void){
// using t = tuple<int,int,int>;
using p = pair<int,int>;
int n;cin >> n;
vector<int> a (n);
vector<int> b (n);
vector<in... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define pb emplace_back
#define lb(v,k) (lower_bound(all(v),(k))-v.begin())
#define ub(v,k) (upper_bound(all(v),(k))-v.begin())
#define fi first
#define se ... | #include <bits/stdc++.h>
using namespace std;
#define INF 0x3f3f3f3f
#define _2n (n << 1)
typedef long long ll;
vector<ll> R, G, B;
ll find(vector<ll>& a, vector<ll>& b, vector<ll>& another)
{
ll mn = 0x3f3f3f3f3f3f3f3f;
for (ll x : a) {
auto it = lower_bound(b.begin(), b.end(), x);
if (it != ... |
#include <bits/stdc++.h>
using namespace std;
typedef long L;
typedef long long LL;
const int MAXN = 1e5+10;
bool D[MAXN]={true}, O[MAXN]={true};
int main() {
int N;
cin >> N;
int s = 0;
for(int i=1; i<=N; i++) {
int d = i/10;
if(i%10==7) {
D[i] = false;
} else {... | #include <bits/stdc++.h>
using namespace std;
#define int long long
ostream& operator << (ostream& stream, const vector<int>& v) {
for(int x : v) {
stream << x << " ";
}
return stream;
}
//ostream& operator << (ostream& stream, const int *a) {
//for(int i = 0; i < n; i++) {
//stream << *(a + i) << ... |
#include<bits/stdc++.h>
using namespace std;
#define ps push_back
#define mk make_pair
#define ll long long int
const int dig=1e5+7;
void solve()
{
vector<int> a(3);
cin>>a[0]>>a[1]>>a[2];
sort(a.begin(),a.end());
cout<<a[1]+a[2]<<endl;
}
int main()
{
ios_ba... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define ull unsigned long long int
#define pb push_back
#define mod 1000000007
#define PI 3.1415926535897932384626433832795
#define lb lower_bound
#define ub upper_bound
#define endl '\n'
#define um unordered_map
#define ff first
#define ss second
#defi... |
#include <bits/stdc++.h>
int ri() {
int n;
scanf("%d", &n);
return n;
}
int main() {
int n = ri();
int m = ri();
int t = ri();
int last_time = 0;
int cur = n;
bool res = true;
for (int i = 0; i <= m; i++) {
int a = i < m ? ri() : t;
int b = i < m ? ri() : t;
cur -= a - last_time;
if (cur <= 0) res =... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, S, D;
cin >> N >> S >> D;
string check = "No";
int X, Y;
for(int i=0; i<N; i++){
cin >> X >> Y;
if(S > X && Y > D){
check = "Yes";
break;
}
}
cout << check;
} |
#include<bits/stdc++.h>
#define N 400001
using namespace std;
int n,a[N],b[N],p[N],fp[N],vis[N],tot;
vector<int>v;
struct Node{int x,y;}ans[N];
signed main(void){
int i,x,mi,pos;scanf("%d",&n);
for(i=1;i<=n;++i)scanf("%d",a+i);
for(i=1;i<=n;++i)scanf("%d",b+i);
for(i=1;i<=n;++i){scanf("%d",p+i),fp[p[i]]=i,vis[i]=(p... | #include <cstdio>
#include <iostream>
#include <cassert>
#include <string>
#include <algorithm>
#include <cstring>
#include <utility>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <cmath>
#include <deque>
#include <unordered_map>
#define IOS ios_base::sync_with_stdio(0); cin... |
#include<bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a),i##end=(b);i<i##end;i++)
#define REP(i,a,b) for(int i=(a),i##end=(b);i<=i##end;i++)
#define RFOR(i,a,b) for(int i=(a),i##end=(b);i>i##end;i--)
#define RREP(i,a,b) for(int i=(a),i##end=(b);i>=i##end;i--)
typedef long long LL;
const int maxs=(1<<16)+1;
const int m... | #include<bits/stdc++.h>
using namespace std;
using LL=long long;
using P=pair<int,int>;
using T=tuple<int,int,int>;
constexpr int mod=998244353;
constexpr LL inf=1e9;
constexpr double eps=1e-13;
constexpr double pi=3.141592653589;
int in(){
int x;
scanf("%d",&x);
return x;
}
struct graph{
vector<vector<... |
#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)... | /*
ID: zhangbe5
TASK: test
LANG: C++
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int a,b,ta,tb,ans;
int main(){
scanf("%d%d",&a,&b);
do{
ta+=a%10;
a/=10;
}while(a!=0);
do{
tb+=b%10;
b/=10;
}while(b!=0);
ans=max(ta,tb);
printf("%d",ans);
return 0;
} |
#include <iostream>
#include <algorithm>
#define flush fflush(stdout)
#define endl '\n'
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pl;
const int mod1 = (int)1e9 + 7, mod2 = (int)998244353;
const int INF = (int)1e9;
const int di[8] = {1, 0, -1, 0, 1, 1, -1, -1}, dj[8] = {0,... | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
#define ll long long int
#define lp(i,a,b) for(int i=a;i<b;i++)
#define pb push_back
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define pi 3.14159265358979323846
#define gcd __gcd
#define fastio ios_base::s... |
#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 ll mod = 998244353;
ll pw(ll x, ll y) {
ll res=1;
while (y) {
if (y%2) res=res*x%mod;
x=x*x%mod;y=y/2;
... | #pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define MOD2 998244353
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define reps(i,s,n) for (int i = (int)(s); i < (int)(n); i++)
#define repit(i,C) for ... |
#ifdef DEBUG
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
typedef long double ld;
#ifdef DEBUG
#define eprintf(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#else
#define eprintf(...) ;
#endif
#define sz(x) ((int) (x).size())
#define TASK "text"
const int inf = (int) 1.01e9;
con... | #include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include <vector>
#include <queue>
#include <cmath>
#include <complex>
#include <functional>
#include <numeric>
#include <iomanip>
#include <cassert>
#include <random>
#include ... |
#include <bits/stdc++.h>
using namespace std;
typedef int_fast32_t int32;
typedef int_fast64_t int64;
const int32 inf = 1e9+7;
const int32 MOD = 1000000007;
const int64 llinf = 1e18;
#define YES(n) cout << ((n) ? "YES\n" : "NO\n" )
#define Yes(n) cout << ((n) ? "Yes\n" : "No\n" )
#define POSSIBLE(n) cout << ((n) ?... | #include<bits/stdc++.h>
#include<algorithm>
#include<map>
#include<string>
#include<vector>
#include<set>
#include<cmath>
#define ll long long
#define pb push_back
using namespace std;
int fact(int n)
{
int res = 1;
for (int i = 2; i <= n; i++)
res = res * i;
return res;
}
int firstDigit(int n)
... |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define pb(x) push_back(x);
#define mp(x, y) make_pair(x, y)
#define mem(dp, a) memset(dp, a, sizeof dp);
#define all(a) a.begin(), a.end()
#define sall(a) sort(all(a))
#define X first
#define Y second
typedef long long int ll;
typ... | //#pragma GCC optimize(2)
#include<iostream>
#include<cstdio>
#include<cmath>
#include<map>
#include<cstring>
#include<vector>
#include<algorithm>
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f
//#define int long long
using namespace std;
typedef long long ll;
const int maxn=1e5+10;
const int mod=998244353;
co... |
#include<bits/stdc++.h>
using ll = long long int;
using namespace std;
#define sync ios_base::sync_with_stdio(false); cin.tie(NULL)
using ld = long double;
#define input(arr,n) for(ll i1=0;i1<n;i1++ )cin>>arr[i1]
#define mod 1000000007
#define F first
#define S second
#include <ext/pb_ds/assoc_container.hpp>
#include... | #include <iostream>
#include <string.h>
#include <string>
#include <cmath>
#include<vector>
#include <algorithm>
#include <iterator>
#include <map>
#include <utility>
#include<numeric>
#include <iomanip>
#include <set>
#define ul unsigned long long int
#define sll signed long long int
#define ll long long int
#define... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<long long> vll;
typedef vector<vector<long long>> vvll;
typedef pair<int,int> pii;
typedef pair<long long, int> pli;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define a... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, ll> Pil;
int N;
const int MAX_N = 110;
double x[MAX_N], y[MAX_N];
double eps = 1.0e-9;
int main() {
cin >> N;
for (int i = 0; i < N; i++) {
cin >> x[i] >> y[i];
}
bool ans = false;
for (int i = 0; i < N... |
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,sse4,fma")
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using ull = uint64_t;
using f32 = double;
using f64 = long double;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using u128 = _... | #include <bits/stdc++.h>
#define ll long long
#define ii pair<int, int>
#define pll pair<ll, ll>
#define dd pair<double, double>
#define vi vector<int>
#define vl vector<ll>
#define vd vector<double>
#define vii vector<ii>
#define vll vector<pll>
#define vdd vector<dd>
#define vvi vector<vi>
#define vvl vector<vl>
#de... |
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#define mii map<int,int>
#define pqb priority_... | #define taskname "test"
#include <bits/stdc++.h>
using namespace std;
#define sz(x) (int)x.size()
#define fi first
#define se second
typedef long long lli;
typedef pair<int, int> pii;
const int maxn = 1e4 + 5;
int n, m;
pii edges[maxn];
vector<int> gr[maxn];
int c[maxn];
string ans[maxn];
bool vis[maxn];
int de... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef pair<ll, int> li;
typedef pair<int, ll> il;
typedef vector<ii> vii;
typedef vector<il> vil;
typedef vector<li> vli;
#define F first
#define S ... | #include <iostream>
using namespace std;
int ab(int x){
if(x>=0) return x;
else return x*(-1);
}
int main(){
int r1,c1,r2,c2,t; cin>>r1>>c1>>r2>>c2;
if(r1==r2&&c1==c2) t=0;
else if(r1+c1==r2+c2||r1-c1==r2-c2||ab(r1-r2)+ab(c1-c2)<=3) t=1;
else if((r1+c1+r2+c2)%2==0) t=2;
else if(ab(r1-r2)+a... |
#include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int H, W; cin >> H >> W;
char S[110][110];
for(int i = 0; i < H; i++){
for(int j = 0; j < W; j++){
cin >> S[i][j];
}
}
int cnt1 = 0; int cnt2 = 0;
for(int i = 0; i < H-1; i++){
for(int j = 0;... | #include<bits/stdc++.h>
#define rep(i,a,...) for(int i = (a)*(strlen(#__VA_ARGS__)!=0);i<(int)(strlen(#__VA_ARGS__)?__VA_ARGS__:(a));++i)
#define per(i,a,...) for(int i = (strlen(#__VA_ARGS__)?__VA_ARGS__:(a))-1;i>=(int)(strlen(#__VA_ARGS__)?(a):0);--i)
#define foreach(i, n) for(auto &i:(n))
#define all(x) (x).begin(),... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
int mod=1e9+7;
const int N=1e6+10;
int32_t main()
{
vector<int> prime(N+1);
for(int i=2;i<=N;i++)
{
if(!prime[i])
{
for(int j=i;j<=N;j+=i)
{
if(!prime[j])
{
... | #include <stdio.h>
#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <algorithm>
using ll = long long int;
const int INF = (1<<30);
const ll INFLL = (1ll<<60);
const ll MOD = (ll)(1e9+7);
#define l_ength size
void mul_mod(ll& a, ll b){
a *= b;
a %= MOD;
}
void add_mod(ll& a, ll b){
... |
#include <bits/stdc++.h>
// #include <atcoder/modint>
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define INF 2000000000000000000
#define ll long long
#define ld long double
#define pll pair<ll, ll>
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; }... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<ll> a(200);
rep(i, n) {
int x;
cin >> x;
a[x % 200]++;
}
ll ans = 0;
rep(i, 200) ans += a[i] * (a[i] - 1) / 2;... |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const LL MOD = 1000000007;
#define fr(i, n) for (i = 0; i < n; i++)
#define rep(i, n) for (i = 1; i <= n; i++)
#define lcm(x, y) ((x) * (y) / __gcd((x), (y)))
#define pb push_back
#define all(c) (c).begin(), (c).end()
#define debug(x) cout << #x << " :... | #include<bits/stdc++.h>
#define int long long
#define pb push_back
#define range(v) v.begin(),v.end()
#define rrange(v) v.rbegin(), v.rend()
#define mod (int)(1e9 + 7)
#define inf (int)(1e17)
#define N (int)(2e5 + 10)
using namespace std;
void solve() {
int n, m;
cin >> n >> m;
vector<int> a(n), b(m);
for (int &... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=200005;
int n,l,ans,sum,a[N],b[N],c[N],d[N];
signed main(){
scanf("%lld%lld",&n,&l);
for (int i=1;i<=n;i++)scanf("%lld",&a[i]);
for (int i=1;i<=n;i++)scanf("%lld",&b[i]);
a[n+1]=b[n+1]=l+1;
for (int i=0;i<=n;i++)c[i]=a[i+1]-a[i]-1,d[i]=... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define pii pair<int,int>
#define pll pair<ll,ll>
#define ldb double
template<typename T>void ckmn(T&a,T b){a=min(a,b);}
template<typename T>void ckmx(T&a,T b)... |
#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define DD double
#define Pb push_back
#define Bp pop_back
#define Pf push_front
#define Fp pop_front
#define Ub upper_bound
#define Lb lower_bound
#define Bs binary_search
#define In insert
#define Mp make_pair
#define All(x) x.begin(), x.end()
#defin... | #include <stdio.h>
#include <vector>
#include <string.h>
std::vector<int> V;
int check[11];
int value[30], count[30];
int a,b,c, control = 0;
char x[20],y[20],z[20];
void func(int k)
{
if(control) return;
if(k==V.size())
{
long long int S1 = 0, S2 = 0, S3 = 0;
if(value[x[1]-'a']==0) return;
if(value[y[1]-'a'... |
#include <vector>
template <typename T, typename F>
class segment_tree {
public:
segment_tree(int n, const F& f, const T& e)
: f(f), e(e)
{
sz = 1;
while (sz < n) {
sz *= 2;
}
dat.assign(2 * sz, e);
}
void update(int i, const T& x) {
i += sz;
dat[i] = x;
while (i > 1) {
i /= 2;
dat[i] = f... |
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <vector>
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
using namespace std;
typedef long long ll;
template<typename T>
struct BIT {
vector<T> data;
BIT() {}
BIT(int n) : data(n+1, 0) {}
void init(int n) { data.assign(... |
#include <iostream>
#include <vector>
#include <set>
#include <math.h>
#include <algorithm>
#define MAXA 1000000
#define ll long long
using namespace std;
int GetNorm(int x,int y) {
return x*x+y*y;
}
int A[111];
int B[111];
int C[111];
int D[111];
bool Check(int N) {
if (N == 1) return true;
vector<pai... | #include <algorithm>
#include <iostream>
#include <random>
#include <vector>
std::mt19937 g_rand;
double rand_double() { return g_rand() * (1.0 / std::mt19937::max()); }
int rand_int(int n) { return static_cast<int>(n * rand_double()); }
struct Company {
int x;
int y;
int r;
};
class Space {
private:
const Comp... |
#include <iostream>
using namespace std;
using LL = long long;
LL x, y, EXP;
int a, b;
int main() {
cin >> x >> y >> a >> b;
while (x * a <= x + b) {
if ((double)x * a >= 2e18 || x * a >= y) {
break;
}
x *= a;
EXP++;
}
if (!((y - x) % b)) {
EXP += ((y - x) / b) - 1;
} else {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int,int> pi;
typedef pair<ll,ll> pl;
#define F first
#define S second
#define endl '\n'
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#ifdef dremix
#define p(... |
#include <bits/stdc++.h>
using namespace std;
//#define int long long
int32_t main() {
ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n; cin >> n;
multiset <int> st;
for(int i = 1; i <= n; i++) {
int x; cin >> x;
st.insert(x);
}
while(true) {
int x = *st.begin(), y = *st.rbegin();
if(x ... | #include <bits/stdc++.h>
using namespace std;
int main(void)
{
int X;
int P=0;
int F=0;
cin >> X;
F=X/100;
P=100*(F+1)-X;
cout << P << endl;
return 0;
} |
#include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#include <complex>
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const int MAXN=2e5+10;
int minu[MAXN],minl[MAXN];
int t[MAXN];
int get(int p){
int res=0;
for(;p;p=(p&(p-1)))
res+=t[p];
return res;
}
void add(int p,int n){
for(;p<=n;p=(p|(p-1))+1)
t[p]++;
}
int main(){
ios_base::sync_with_stdio(false)... |
#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 <iostream>
using namespace std;
const int MAXN = 19;
int n, m, dp[(1 << MAXN)];
bool isol[(1 << MAXN)];
bool adj[MAXN][MAXN];
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++)
adj[i][i] = 1;
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
adj[a][b] = ... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define int long long
#define pb push_back
#define mod 1000000007
#define mp make_pair
ll fact[200005];
ll powermod(ll x,ll y){
if(y==0) return 1;
ll temp = powermod( x,y/2 )%mod;
if( y%2 ){
return (((temp*temp)%mod)*x%mod);
}
return (tem... | #include <bits/stdc++.h>
using namespace std;
#define f(i,a,b) for( ll i = a; i < b ; i++ )
#define af(i,a,b) for( ll i = a; i >= b ; i--)
#define rep(i,a,b,k) for(ll i = a; i < b ; i+= k )
#define arep(i,a,b,k) for( ll i = a; i >= b ; i-= k)
#define ones(numeros) (ll) __builtin_popcountll(numeros)
#define fs first
#de... |
#include <bits/stdc++.h>
using namespace std;
int main(void){
long long N,M;
cin >> N >> M;
//高橋くんの戦略は最適手
if(M<0){
cout << -1 << endl;
return 0;
}
//大罠にきあくん笑
if(N==1 && M==0){
cout << "1 2" << endl;
return 0;
}
//青木くんも１つは取るから、高橋くんが... | #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(... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr int MOD = 1'000'000'000 + 7;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
string s;
cin >> s;
int k;
cin >> k;
auto combination = [&](int n, int m) {
if (m == 0 || n == 0)
... | #include <bits/stdc++.h>
#include <map>
#include <iostream>
using namespace std;
typedef long long ll;
typedef long double ld;
#define BIG 2005
int main() {
int H, W;
cin >> H >> W;
vector<vector<int>> dp(BIG, vector<int>(BIG, -1));
vector<string> ma(BIG);
for(int h=0;h<H;h++){
cin >> ma[h... |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repk(i, k, n) for (int i = k; i < n; i++)
using namespace std;
using ll = long long;
int main (){
ll n, a, b, c;
cin >> n;
ll two = 1;
ll ans=100100100100100100;
rep(i, 60){
a = n/two;
c = n-a*two;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll OO = 0x3f3f3f3f;
const ll mod = 1e9 + 7;
const double pi = 3.14159265359;
//freopen("window.in", "r", stdin);
//freopen("output.out", "w", stdout);
void skrrrt() {
ios_base::sync_with_stdio(0), cin.tie(0);
}
//#########################... |
#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>
#define endl '\n'
#define ll long long
#define rt(x) return cout<<x,0;
#define rt1(x) return cout<<x;
#define all(c) c.begin(), c.end()
#define rall(c) c.rbegin(), c.rend()
#define rrep(i, n) for(int i=n-1;i>=0;i--)
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
const auto EPS = 1e-... |
#include <iostream>
#include <vector>
#include <cmath>
#include <string>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
int main()
{
long long N;
cin >> N;
long long digit = (long long)(log10(N)) + 2;
long long upper = 1;
REP(i, digit / 2){... | //I still luve you Kashish <3
#include<bits/stdc++.h>
using namespace std ;
#define int long long
#define pb push_back
#define F first
#define S second
#define P push
#defin... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a1,a2,a3,a4;
cin>>a1>>a2>>a3>>a4;;
cout<<min(a1,min(a2,min(a3,a4)));
return 0;
} | #include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
#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 mydeb(fmt, ...) fprintf(stderr, fmt, __VA_ARGS__)
//#define mydeb(fmt, ...)
int main()
{
int n;
... |
//#include <fsociety>
#include <cmath>
#include <deque>
#include <algorithm>
#include <iterator>
#include <list>
#include <map>
#include <unordered_map>
#include <queue>
#include <set>
#include <unordered_set>
#include <stack>
#include <string>
#include <vector>
#include <fstream>
#include <iostream>
#include <iomanip>... | #include <bits/stdc++.h>
using namespace std;
#define eps 1e-9
#define INF 2000000000 // 2e9
#define LLINF 2000000000000000000ll // 2e18 (llmax:9e18)
#define all(x) (x).begin(), (x).end()
#define sq(x) ((x) * (x))
#define rep(i, x) for (int i = 0; i < (int)(x); i++)
#define drep(i, x) for (int i = ((int... |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
#include <ext/pb_ds/detail/standard_policies.hpp>
/*
* coder :: ATUL_PANDEY_2608
* >>> INDIA <<<
*/
using namespace std;
using namespace __gnu... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef long long l... |
#pragma GCC optimize ("O2")
#pragma GCC target ("avx")
#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) ... | #include<bits/stdc++.h>
using namespace std;
int t,n;
int main(){
cin>>t>>n;
cout<<(100*1ll*n+t-1)/t*(100+t)/100-1<<endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 233333;
const int mod = 10;
const int phi = 4;
int cnt[26];
char s[N];
int main() {
scanf("%s", s + 1);
int n = strlen(s + 1);
ll ans = 0;
for(int i = n; i >= 1; --i) {
cnt[(s[i]-'a')]++;
if(i < n && s[i]... | #include <bits/stdc++.h>
#define rep(i,a,b) for(int i = (a); i <= (b); i++)
#define rng(a) a.begin(), a.end()
#define ina(n,a) cin >> n; for(int i = 1; i <= n; i++) cin >> a[i]
#define sz(x) (int)(x).size()
#define se second
#define fi first
#define prev coyhhhhhhyoc
#define next sdNNNmNNNNNNNmd... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
int main(){
int n, m = 0; cin >> n;
for(; m < n; m=m*2+1);
rep(i,n){
int t = i*2, u = t+1;
while(t >= n) t -= 1 << (31 - __builtin_clz(t));
while(u >= n) u -= 1 << (31 - __builtin_clz(u));
cout << t+1 << " " << u+1 << "\n... | #include <cstdio>
int N, M;
int main() {
scanf("%d", &N);
for (M = 1; M < N; M <<= 1) ;
for (int i = 0; i < N; ++i) {
int x = i << 1;
int y = x | 1;
x &= M - 1;
y &= M - 1;
if (x >= N) x ^= M >> 1;
if (y >= N) y ^= M >> 1;
printf("%d %d\n", x + 1, y + 1);
}
return 0;
} |
#include <iostream>
#include <climits>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
#define MOD 1000000007LL
int N;
ll W;
map<ll, ll> st;
int main()
{
ll si, ti, pi;
ll ps;
cin >> N >>... | #include <bits/stdc++.h>
#define ll long long int
#define omar main
#define fastIO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
//priority_queue push_back make_pair emplace vector double float unordered_map unordered_set queue stack sort begin resize clear second first continue break
using namespace s... |
#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;
//template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
//class Timer {
// clock_t start;... | #include <bits/stdc++.h>
#define rep3(i, s, n, a) for (long long i = (s); i < (long long)(n); i += a)
#define rep2(i, s, n) rep3(i, s, n, 1)
#define rep(i, n) rep2(i, 0, n)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
using Pll = pair<ll, ll>;
int main() {
... |
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int mod=1e9+7;
class unionfind{
int n;
vector<int>par;
vector<int>rank;
public:
unionfind(int n_){
n=n_;
par.resize(n,-1);
rank.resize(n,0);
}
int find(int x){
if(par[x]<0)
return... | #include<stdio.h>
#include<string.h>
#include<math.h>
#include<stdlib.h>
#include<algorithm>
using namespace std;
inline void MAX(int &a,const int &b) {if(b>a) a=b;}
inline void MIN(int &a,const int &b) {if(b<a) a=b;}
inline int max(const int &a,const int &b) {return a>b?a:b;}
inline int min(const int &a,const int &b)... |
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeo... | #include <bits/stdc++.h>
#define ALL(A) (A).begin(), (A).end()
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; retu... |
#include <bits/stdc++.h>
using namespace std;
#define sz(x) (int)x.size()
#define pb push_back
#define mp make_pair
#define ll long long
#define mod 1000000007
#define endl "\n"
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pi;
ll zero = 0;
ll one = 1;
int fast()
{
ios_base::sync_with_stdi... | #include<bits/stdc++.h>
#include<tuple>
typedef long long ll;
#define INF 9999999999
#define mod 1000000007
#define eps 1e-9
#define pi acos(-1)
using namespace std;
typedef pair<ll,ll>du;
ll n,ans,res;
int main(){
ios::sync_with_stdio(0);
cin>>n;
ans=INF;
for(ll i=0;(n>>i)!=0;i++){
if((n>>i)&1)... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, l, n) for (int i = (int)(l); i < (int)(n); i++)
#define drep(i, l, n) for (int i = (int)(n); i > (int)(l); i--)
#define INF INT_MAX
#define def (200007)
#define MOD (1000000007)
typedef vector<int> veci;
typedef vector<vector<int>> Veci;
typedef vector<int64_... | #pragma GCC optimize("O3")
#pragma GCC target("avx2")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef pair<int, int> pi;
typedef pair<long long, long long> pll;
#define ff first
#define ss second
#define pb push_back
#define ... |
//PochurSolveKortaHobaa
#include<bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int a,b,c;
cin>>a>>b>>c;
if(c==0){
while(1){
a--;
if(a<=0){
cout<<"Aoki";
break;
... | #include<iostream>
using namespace std;
int main(){
int a,b,c;cin>>a>>b>>c;
if(a==0 && c==1 && b==0){
cout<<"Takahashi"<<endl;
return 0;
}
while(a && b){
if(!c){
--a;
}else{
--b;
}
c=!c;
}
if(a){
cout<<"Takahashi"<<e... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll N; cin >> N;
ll a,b=0,c, ans=1e18;
for(ll j=1; j<=N; b++,j=j*2){
a = N/j;
c = N%j;
ans = min(ans, a+b+c);
}
cout << ans << endl;
return 0;
} | #include<iostream>
using namespace std;
int main()
{
long long int num;
cin>>num;
long long int ans =0;
long long int ans2;
long long int one =1;
for(long long int i=0;num>(one<<(i-one));i++)
{
//(num&((2<<i)-1))
if((ans<=(num-(num>>i)*(one<<i)))&&ans!=0)
{
break;
... |
// doot diddly donger cuckerino Hahahahahah
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using vi = vector<i... | #include<bits/stdc++.h>
#define ll long long
#define ld long double
#define vec vector
#define psb push_back
#define ppb pop_back
#define mkp make_pair
#define fst first
#define scd second
#define ins insert
#define psf push_front
#define ppf pop_front
using namespace std;
const ll maxk = 1e5;
ll n, m, k, a[maxk], b[ma... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.