code_file1 stringlengths 87 4k | code_file2 stringlengths 85 4k |
|---|---|
#include <cstdio>
#include <queue>
using namespace std;
int main(){
int n;
scanf("%d", &n);
vector<int> a(n*2);
for(int& i: a)
scanf("%d", &i);
priority_queue<int> q;
long long ans=0;
for(int i = 0;i < n;i ++){
q.push(a[i]);
q.push(a[n*2-1-i]);
ans+=q.top();
q.pop();
}
printf("%lld\n", ans);
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
const int Maxn = 100005;
int n;
int a[Maxn];
int main()
{
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
sort(a, a + n + 1);
int res = 1;
for (int i = 1; i <= n; i++)
res = ll(res) * (a[i] - a... |
#include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
typedef long long ll;
typedef long double ld;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define mod 1000000007
#define pii pair<ll,ll>
#define inf 1000000000000000000
#define bpc(x) __... | #include <bits/stdc++.h>
using namespace std;
int main()
{
vector<int> A1(2),A2(2);
for(int i =0; i <2; i++)
{
cin >> A1[i];
}
for(int i =0; i <2; i++)
{
cin >> A2[i];
}
int ans = A1[0]*A2[1]-A1[1]*A2[0];
cout << ans << endl;
} |
#include<bits/stdc++.h>
using namespace std;
const int N=205;
const int DS=900;
int n,tot,ran[10];
int x[N],y[N],r[N],a[N],b[N],c[N],d[N],s[N],que[N];
unsigned int Se;
set<pair<int,int> > S;
set<pair<int,int> > :: iterator it;
pair<int,int> aa[N];
bool U(int i){
a[i]--; bool flag=0;
for (int j=1; j<=n; j++){
if (i=... | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,mmx,avx")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define PB push_back
#define MP make_pair
#define endl "\n"
#define fst first
#define snd second
const int UNDEF = -1;
co... |
#include <bits/stdc++.h>
#define rep(i, l, r) for (int i = (l); i < (r); i++)
#define max(p, q) ((p) > (q) ? (p) : (q))
#define min(p, q) ((p) < (q) ? (p) : (q))
#define ALL(a) (a).begin(), (a).end()
#define INF ((1LL << 62) - (1LL << 31))
#define MOD 1000000007
using namespace std;
using ll = long long;
using ld = lon... | #include<bits/stdc++.h>
#define ll long long int
using namespace std;
ll i,t, n,j, a[200600], ans;
double temp;
bool cond;
char c;
string s;
int main()
{
//I am Monim, a tiny creature of Allah
//freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
ios_base::sync_with_stdio(false);
cin... |
#include <bits/stdc++.h>
#define fir first
#define sec second
#define PB push_back
#define MP make_pair
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i < (int)(n); ++i)
template <class T> void chkmax(T& x, T y) { x = (x > y ? x : y); }
template <class T>... | #include<bits/stdc++.h>
#define fi first
#define se second
#define pb(i) push_back(i)
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define per(i,a,b) for(int i=b;i>=a;i--)
#define mem(a,b) memset(a,b,sizeof(a))
#define VI vector<int>
#define VLL vector<ll>
#define MPII map<pair<int,int>,int>
#define mp make_pair
#define PQ... |
//μ's forever
#include <bits/stdc++.h>
#define mod 998244353
#define getchar nc
using namespace std;
inline char nc(){
static char buf[100000],*p1=buf,*p2=buf;
return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
}
inline int read()
{
register int x=0,f=1;register char ch=getchar();
... | #include<bits/stdc++.h>
#define ll long long
#define mod 998244353
#define N 55
using namespace std;
int n,a[N][N],lim,f[2][N],sze[N],sm[N];
inline int find(int x,int way)
{
return f[way][x]==x?x:f[way][x]=find(f[way][x],way);
}
int main()
{
#ifdef lovelyG
Sfile(1);
#endif
scanf("%d%d",&n,&lim);
for(int i=1;i<=n;++i... |
#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using P=pair<ll,ll>;
template<class T> using V=vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
const ll inf=(1e18);
//const ll mod=998244353;
const ll mod=1000000007;
const vector<int> dy={-1... | #include<bits/stdc++.h>
#define f(i,n) for(long long int i = 0 ; i < n; i++)
#define F first
#define S second
#define vll vector<ll>
#define vvll vector<vector<ll>>
#define all(s) s.begin(), s.end()
#define u_s unordered_set
#define u_m unordered_map
#define ll long long int
#define pb push_back
#define pll pair<ll,ll... |
#include<bits/stdc++.h>
using namespace std;
const int N=101;
int n,g[N][N],C[N][N],vis[N],to[N];
char s[N][N];
void dfs(int x)
{
if(vis[x])
return;
vis[x]=1;
for(int i=1;i<=n;i++)
if(g[x][i])
dfs(i);
}
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
const int MAX = 2e5+10;
int a[MAX];
int b[MAX];
int c[MAX];
vi e[MAX];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
for(int i=0;i<n;i++){
cin >> a[i];
b[a[i]] = 1;
}
for(int i=0;i... |
//include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <... | #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>;
using Graph = vector<vector<int>>;
template<class T> void chmax(T& a, T b){
if(a < b){
a = b;
}
}
template<class T> void chmin(T& a, T b){
if(a > b){
a ... |
/*
author: Maksim1744
created: 14.11.2020 15:06:23
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define sum(a) ( accumulate ((a).begin(), (a).end(), 0ll))
#define mine(a) (*mi... | //#include <atcoder/all>
//using namespace atcoder;
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define RFOR(i, a, b) for (ll i = (a); i > (b); --i)
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define all(c) begin(c), end(c)
#define rall(c) rbegin(c), rend(c)
#d... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#ifdef _DEBUG
#define show(x) \
cerr << #x << " : "; \
showVal(x)
template <typename T>
void showVal(const T &a) { cerr << a << endl; }
template <typename T>
void showVal(const vector<T> &a) {
for (const T &v : a) cerr << v << " ";
cerr <<... | #include<bits/stdc++.h>
using namespace std;
//////////////////////////////////////////////////////////////////////////////
void files(){freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);}
void speed(){ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);}
int lcm(int a,int b){return (a*b)/__gcd(a,b);}... |
#line 2 "/home/defineprogram/Desktop/Library/template/template.cpp"
#include<bits/stdc++.h>
#pragma GCC optimization ("Ofast")
#pragma GCC optimization ("unroll-loops")
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;... | #include <bits/stdc++.h>
using namespace std;
int n,q;
int c[200001];
int uf[200001];
vector <pair<int,pair<int,int>>> query;
map <int,int> cnt[200001];
int check[200001];
int find(int x)
{
if(uf[x] < 0)
{
return x;
}
return uf[x] = find(uf[x]);
}
int main(void)
{
cin.tie(0);
ios::sync_with_stdio(fal... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define p_ary(ary,a,b) do { cout << "["; for (int count = (a);count < (b);++count) cout << ary[count] << ((b)-1 == count ? "" : ", "); cout << "]\n"; } while(0)
#define p_map(map,it) do {cout << "{";for (auto (it) = map.begin(... | #include <bits/stdc++.h>
//#include <chrono>
//#pragma GCC optimize("O3")
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se sec... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int N=35;
int t,n,m;
ll a,b,k;
ll f[N][N];
string finds(ll a,ll b,ll k){
if(!a) return string(b,'b');
if(!b) return string(a,'a');
if(f[a-1][b] >= k) return "a" + finds(a-1,b,k);
else return "b" + finds... | #include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <map>
#include <set>
#include <unistd.h>
#include <stdlib.h>
#include <cassert>
using namespace std;
// using namespace atcoder;
// using mint = long double;
// using mint = modint998244353;
// using mint = modint1000000007;
typedef... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int i = 0; i < (int)(a); i++)
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
typedef long long ll;
template<typename T>istream& operator>>(istream&i,vector<T>&v){rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const vec... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (long long i = 0; i < (n); ++i)
#define INF LONG_MAX/3
//#define DIV 1000000007
//#define DIV 998244353
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, con... |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
int main() {
long n, temp = 0;
string s;
stack<char> st;
cin >> n >> s;
if(n >= 3) {
st.push(s.at(0));
st.push(s.at(1));
rep(i, n - 2) {
if(st.size() < 2) {
... | #include <iostream>
#include <vector>
#include <time.h>
#include <math.h>
#include <algorithm>
#include <list>
#include <stack>
#include <queue>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> ... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, ans=0;
cin >> n;
char s[n+1];
int a[n+1], t[n+1], c[n+1], g[n+1];
for (int i=1; i<=n; i++){
cin >> s[i];
a[i]=t[i]=c[i]=g[i]=0;
}
a[0]=t[0]=c[0]=g[0]=0;
for (int i=1; i<=n; i++){
a[i]=a[i-1], t[i]=t[i-1], c[i]=c[i-1], g[i]=g[i-1];
if (s[i]... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define int long long
using namespace std;
const ll INF = 1e18;
const ll MOD = 998244353;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __prin... |
//clear adj and visited vector declared globally after each test case
//check for long long overflow
//while adding and subs check if mod becomes -ve
//while using an integer directly in a builtin function add ll
//Mod wale question mein last mein if dalo ie. Ans<0 then ans+=mod;
//Dont keep array name as size or any o... | #include <bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin >> s;
int len = s.size();
for(int i = 1; i < len; i++) cout << s[i];
cout << s[0] << endl;
return 0;
} |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
//const int MAX=INT_MAX;
//const ll MAX=100000000000;
//const int mod = 1000000007;
//const int mod = 998244353;
//const ll A=100000000000;
const int INF=1000000000;
ll extgcd(ll a,ll b,ll& x,ll& y){
if(b==0){
x=1;
y=0... | #include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define all(x) (x).begin(),(x).end()
#define SIZE(x) ll(x.size())
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chm... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
const int MN = 2020;
const ll M = 1e9+7;
inline ll mul(ll a, ll b) {
return (a*b)%M;
}
ll bp(ll b, ll p) {
ll ac = 1;
while(p) {
if(p&1) {
ac = mul(ac,b);
}
b = mul(b,b);
p >>= 1;
}
return ac;
}
ll prf[MN*MN];
ll ... | // Problem: D - Binomial Coefficient is Fun
// Contest: AtCoder - AtCoder Regular Contest 110（Sponsored by KAJIMA CORPORATION）
// Time: 2020-12-14 00:33:52
// 私に忍び寄るのをやめてください、ありがとう
#include<bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC optimi... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
//first second
//memset(dp, -1, sizeof dp);
struct keycompare {
bool operator()(const pair<ll, ll>& v, const ll& k) {
return (v.first < k);
}
bool operator()(const ll& k, const pair<ll, ll>& v) {
r... | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
#include <cstdint>
#include <string>
#include <sstream>
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... |
#include<cstdio>
int n;
int w[105];
int dp[105][21000];
int ndp[105][21000];
int mod = 998244353;
int dpbase = 10500;
long long int fct[105];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &w[i]);
}
dp[0][dpbase] = 1;
for (int i = 0; i < n; i++) {
for (int j = 0; j <= i; j++) {
for ... | #include<bits/stdc++.h>
typedef unsigned long long ull;
typedef long long ll;
#define inf 0x3f3f3f3f
#define rep(i,l,r) for(int i=l;i<=r;i++)
#define nep(i,r,l) for(int i=r;i>=l;i--)
void sc(int &x){scanf("%d",&x);}
void sc(int &x,int &y){scanf("%d%d",&x,&y);}
void sc(int &x,int &y,int &z){scanf("%d%d%d",&x,&y,&z);}
vo... |
// どこが間違っているか分からない時は,簡単なミス(型,スペル,入力or出力など)をしていたり問題文の見落としがあったりする. 一度落ち着いて頭をリセットしよう.
// 計算途中のオーバーフローに注意しよう
#include "bits/stdc++.h"
#define REP(i, n, N) for(ll i=(n); i<(N); i++)
#define RREP(i, n, N) for(ll i=(N-1); i>=(n); i--)
#define LREP(lst,itr) for(auto itr = lst.begin(); itr != lst.end(); ++itr)
#define CK(n, a... | /*..................................
"Be not afraid of GROWING slowly, be afraid only of Standing Still"
....................................*/
#include <bits/stdc++.h>
using namespace std;
# define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define amin(a,b) a=min(a,b)
#define amax(a,b) ... |
//#pragma GCC optimize ("O2")
//#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<cstdio>
#include<cstring>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ll long long
#define pp pair<ll,ll>
#define ld long double
#define all(a) (a).begin(),(a).end()
#define mk make_pair
constexpr int inf=1000001000;
constexpr ll INF=2e18;
constexpr ll mod=1000000007;
// ll MOD=998244353;
... |
// abc188_e
#include <bits/stdc++.h>
#ifdef LOCAL
#include "../cxx-prettyprint/prettyprint.hpp"
#endif
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
#define REP(i, n) for (int (i) = 0 ; (i) < (int)(n) ; ++(i))
#define REPN(i, m, n) for (int (i) = m ; (i) < (int)(... | #include<iostream>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<algorithm>
#include<cstring>
using namespace std;
int n, m;
int arr[200010];
vector<int> v[200010];
int come[200010];
int sell[200010];
int mn[200010];
int main()
{
int i;
int a, b;
queue<int> ... |
//int max = 2 147 483 647 (2^31-1)
//ll max = 9 223 372 036 854 775 807 (2^63-1)
#include<bits/stdc++.h>
using namespace std;
#define forn(i,n) for(int i=0;i<n;i++)
#define mp make_pair
#define f first
#define s second
#define pb push_back
#define MOD 1000000007
typedef long long ll;
typedef long double ld;
typedef v... | // KNOW NOTHING!
#include <bits/stdc++.h>
#define ll long long int
#define F(i,j,k,in) for(int i=j;i<k;i+=in)
#define DF(i,j,k,in) for(int i=j;i>=k;i-=in)
#define feach(it,l) for (auto it = l.begin(); it != l.end(); ++it)
#define fall(a) a.begin(),a.end()
#define sz(x) (int)x.size()
#define szs(x) (int)x.length()
#defi... |
/*~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=
*$* WRITER:kakitamasziru/OxOmisosiru *$*
~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=*/
#ifdef LOCAL_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <stdio.h>
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorit... | // #undef _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#ifdef SG
#include <debug.h>
#else
#define show(...)
#define debug(...)
#define deepen(...)
#define timer(...)
#endif
#define ARG4(_1,_2,_3,_4,...) _4
#define forn3(i,l,r) for (int i = int(l); i < int(r); ++i)
#define forn2(i,n) forn3 (i... |
#pragma region head
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using pi = pair<int, int>;
using pll = pair<ll,ll>;
template <class T> using vv = vector<vector<T>>;
#define _roverload(_a1,_a2,_a3,name,...) name
... | #include <iostream>
using namespace std;
int main() {
int N,W;
cin>>N>>W;
cout<<N/W;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll ;
#define sz(x) ((int)(x).size())
#define all(x) x.begin() , x.end()
#define mem(arr,val) memset(arr,val,sizeof(arr))
#define deb(x) cout<<#x<<"="<<x<<endl
#define debs(x,y) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<endl
#define ppc __builtin_popcount
#define... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ans = 0;
for(int i = 1; i <= n; i++){
bool ok = true;
for(int base : {8,10}){
int x = i;
while( x > 0){
if(x%base == 7) ok = false;
x /= base;
}
}
if(ok) ++ans;
}
cout << ans <... |
#include<bits/stdc++.h>
#define ld double long
#define ll long long
#define ull unsigned long long
#define all(A) A.begin(), A.end()
#define pb push_back
#define fri(start , end , step) for(int i = start; i < end ; i = i + step)
#define frj(start , end , step) for(int j = start; j < end ; j = j + step)
#define fast ... | #include <bits/stdc++.h>
using namespace std;
clock_t start=clock();
int main()
{
int N,M;
cin>>N>>M;
vector<string> s(M);
string answer[N][N];
for(int i=0;i<M;i++) cin>>s[i];
for(int i=0;i<N;i++){
for(int j=0;j<N;j++){
answer[i][j]=".";
}
}
int num=0;
for(int i=0;i<N;i++){
for(int j... |
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stri... | #include <bits/stdc++.h>
#define ll long long
#define int long long
#define arr(a) new int[a]
#define db1(x) cout<<#x<<"="<<x<<'\n'
#define db2(x,y) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<'\n'
#define db3(x,y,z) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<","<<#z<<"="<<z<<'\n'
#define dbV(arr) cout << #arr << "=[ "; \
for(auto i:ar... |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(ll i=0;i<(ll)n;i++)
#define dump(x) cerr << "Line " << __LINE__ << ": " << #x << " = " << (x) << "\n";
#define spa << " " <<
#define fi first
#define se second
#define ALL(a) (a).begin(),(a).end()
#define ALLR(a) (a).rbegin(),(a).rend()
using ld =... | // Jai Shree Ram
#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for(int i=a;i<n;i++)
#define ll long long
#define int long long
#define pb push_back
#define all(v) v.begin(),v.end()
#define endl "\n"
#define x first
#define y ... |
//#define _DEBUG
#include "bits/stdc++.h"
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0,a1,a2,a3,a4,x,...) x
#define debug_1(x1) cout<<#x1<<": "<<x1<<endl
#define debug_2(x1,x2) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<endl
#define debug_3(x1,x2,x3) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<endl
#defin... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
using ll = long long;
int A[100100], B[100100], C[100100];
vector<bool> seen(100100, false);
vector<int> ans = {1}, pass(100100,0);
void dfs(int s, vector<vector<int>> &G){
seen.at(s) = true;
pass.at(C[... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
vector<int> answers(n+1,1);
for(int i=2;i<=n;i++){
set<int> divisors;
for(int j=1;j<=sqrt(i);j++){
if(i%j==0){
divisors.insert(answers[j]);
divisors.insert(answers[i/j]);
... | #include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
#define MAX 510000
#define rrep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define rep(i, n) for(ll i = 1; i <= (ll)(n); i++)
#define dcout cout<<fixed<<setprecision(15);
#define mp make_pair
#define pb push_back
using namespace std;
typedef long long int ll;
type... |
#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;
#define intt long long int
#define intu unsigned long long int
#define vi vector<intt>
#define ii pair<int,int>
#define pb push_back
#define ff first
#define ss second
#define fast_io ios::sync_with_stdio(0);cin.tie(NULL);std::cout.tie(NULL);
# define PI 3.14159265... |
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <numeric>
#include <string>
#include <cstdio>
#include <cstring>
#include <queue>
#include <stack>
#include <set>
#include <cmath>
#include <bitset>
#include <iomanip>
#include <unordered_set>
#include <unordered_map>
using namespace s... | #include<bits/stdc++.h>
using namespace std;
#define fast() ios :: sync_with_stdio(false); cin.tie(0);
#define ll long long int
#define ull unsigned long long int
#define vl vector<long long>
#define vc vector<char>
#define vs vector<string>
#define ... |
#include <bits/stdc++.h>
using namespace std;
const int N = 2 * 1e5 + 10;
long long a[N],b[N];
int n,w;
void insert(int l , int r , int c){
b[l] += c;
b[r] -=c;
}
int main(){
#ifndef ONLINE_JUDGE
freopen("water_heater.txt","r",stdin);
#endif
ios::sync_with_stdio(false);
cin >> n >> w;
int maxt = -1;
for(int... | #pragma GCC optimize("Ofast")
#include <iostream>
#include <fstream>
#include <algorithm>
#include <functional>
#include <array>
#include <chrono>
#include <random>
#include <vector>
#include <string>
#include <sstream>
#include <cmath>
#include <cstring>
#include <bitset>
#include <list>
#include <stack>
#include <qu... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
//O(V+E)
vector <ll> v[10000];
void bfs(ll source,ll vis[])
{
ll i,child;
queue<ll>q;
q.push(source);
vis[source] = 1;
while(!q.empty())
{
ll parent = q.front();
q.pop();
for(i=0;i<v[parent].size();i++)
{
child = v... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define sz(a) ((int)a.size())
#define re return
#define all(a) a.begin(),a.end()
#define int long long
#define rept(i,a,b) for(int i=(a);i<(b);i++)
#define rep(i,a) rept(i,0,a)
#define vi vector<int>
#define vvi(_Name,_Height,_Width) vector<vi>_Name(_He... |
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stri... | #include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
typedef long long ll;
vector<int> v[1000][26];
int n,m,a,b,c,d[1000][1000];
char cha;
string s;
queue<int> que;
int main(void){
cin>>n>>m;
for(int i=0;i<n;i++){
que.push(i*1000+i);
for(int j=0;j<n;j++){
if... |
/*input
3 2
*/
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pdd;
#define IOS ios_base::sync_with_stdio(0); cin.tie(0)
#define ALL(a) a.begin(),a... | // TestCpp.cpp : このファイルには 'main' 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
#include <iostream>
#include <string>
using namespace std;
int main() {
string x;
cin >> x;
//cin >> c >> d;
auto pos = x.find(".");
auto res = x.substr(0, pos);
cout << res << endl;
} |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
int N,W,x;
cin>>N>>W;
x=N/W;
cout<<x;
} | #include <bits/stdc++.h>
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
#define ll long long
#define INF 9999999999999999
#define rep(i,m,n) for(int i = m; i < n ;i++)
#define rrep(i,m,n) for(int i = m - 1; i >= n ;i--)
#define pb(n) push_back(n)
#defi... |
#include <bits/stdc++.h>
// #pragma GCC optimize("O3")
#define Fast cin.tie(0), ios::sync_with_stdio(0)
#define All(x) x.begin(), x.end()
#define louisfghbvc int t; cin >> t; for(int tt = 0; tt < t; ++tt)
#define sz(x) (int)(x).size()
#define sort_unique(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end())... | #include<bits/stdc++.h>
#define w(x) int x; cin>>x; for(int tc=1;tc<=x;tc++)
#define trace(x) cerr<<#x<<": "<<x<<" "<<endl;
#define trace1(x,y) cerr<<#x<<": "<<x<<" "<<endl;cerr<<#y<<": "<<y<<" "<<endl;
#define FIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long
#d... |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long N,L;
cin >> N >> L;
vector<long long> A(N+2),B(N+2);
for (int i=0; i<N; i++) {
cin >> A[i+1];
}
for (int i=0; i<N; i++) {
cin >> B[i+1];
}
A[0] = 0;
B[0] = 0;
A[N+1] = L+1;
B[N+1] = L+1;
long long ans = ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int main(){
int n, x;
int v, p;
cin >> n >> x;
int cnt = 0;
int sum = 0;
bool flag = true;
rep(i, n){
cin >> v >> p;
sum += v*p;
if(sum > 100*x && flag){
cnt... |
#include<bits/stdc++.h>
using namespace std;
#define DEBUG
typedef long long int ll;
typedef long double ld;
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define MOD (ll)(1e9 + 7)
#define vi vector<int>
#define vii vector<vector<int> >
#define vl vector<ll>
#define vll vector<vector<ll> >
#... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
vector<long long> A(N);
for (auto& x : A) {
cin >> x;
}
vector<long long> low(N);
for (int i = 0; i < N; ++i) {
low[i] = A[i] - (i + 1);
}
... |
#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define yes cout<<"YES\n";
#define no cout<<"NO\n";
#define fl(n) for(int i=0;i<n;i++)
#define flj(n) for(int j=0;j<n;j++)
#define flo(n) for(int i=1;i<=n;i++)
#define mii map<int,int>
#define mci map<char,int>
#define V vector<int>
#define vp vect... | #include <bits/stdc++.h>
using namespace std;
int main(){
int a, b, c, d;
cin >> a >> b >> c >> d;
if(b >= d * c){
cout << -1 << endl;
return 0;
}
long long i = 1;
while(a + b * i > d * c * i) i++;
cout << i << endl;
return 0;
} |
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<cctype>
using namespace std;
template <typename T>
inline void read(T&x){
x=0; char temp=getchar(); bool f=false;
while(!isdigit(temp)){if(temp=='-') f=true; temp=getchar();}
while(isdigit(temp)){x=(x<<1)+(x<<3)+temp-'0'; temp... | #include <bits/stdc++.h>
using namespace std;
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...)
#endif
struct dsu {
vector<int> p;
vector<int> sz;
vector<map<int, int>> c;
int n;
dsu(int _n) : n(_n) {
p.resize(n);
iota(p.begin(), p.end(), 0);
c.resize(n);
... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
int main() {
int N;
cin >> N;
vector<vector<int>> child(N+1);
vector<int> par(N+1, 0);
for (int i = 2; i <= N; i++) {
int p;
cin >> p;
child[p].push_back(i);
par[i] = p;
}
... | #include<bits/stdc++.h>
#include<iostream>
#include<string>
#include<cmath>
#include<cstdio>
#include<cctype>
#include<cstring>
#include<iomanip>
#include<cstdlib>
#include<ctime>
#include<set>
#include<map>
#include<utility>
#include<queue>
#include<vector>
#include<stack>
#include<sstream>
#include<algorithm>
/******... |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N,V,P,i,X;
cin >> N >> X;
for(X=X*100,i=1;i<=N;i++){
cin >> V >> P;
X=X-V*P;
if(X<0){
cout << i << endl;
return 0;
}
}
cout << "-1" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define mp make_pair
#define pii pair <int, int>
#define fast_io ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define F first
#define S second
ld eps = 1e-9;
int main(){
fast_io;
int n, x;
cin >... |
#include<bits/stdc++.h>
#define forn(i,a,b)for(int i=(a),_b=(b);i<=_b;i++)
#define fore(i,b,a)for(int i=(b),_a=(a);i>=_a;i--)
#define rep(i,n)for(int i=0,_n=n;i<n;i++)
#define ll long long
#define pii pair<int,int>
#define m_p make_pair
#define pb push_back
#define fi first
#define se second
#define foreach(i,c) for(__... | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
// #include <atcoder/all>
// #include <bits/stdc++.h>
#include <complex>
#include <queue>
#include <set>
#include <unordered_set>
#include <list>
#include <chrono>
#include <rand... |
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
typedef long long ll;
int now[15];
void getstring(int n){
now[0]=0;
while(n!=0){
now[now[0]+1]=n%10;
now[0]++;
n=n/10;
}
sort(now+1,now+now[0]+1);
// for(int i=1;i<=now[0];i++){
// cout<<now[i]<<endl;
// }
}
int mai... | #include<iostream>
#include<string>
#include<queue>
#include<vector>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//学习到了 string的函数 to_string() ,reverse(s.begin(),s.end()), stol
int main()
{
int N;
int k;
cin >> N >> k;
for (int i = 0; i < k; i++)
{
string S = to_stri... |
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
//#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
#define readFast ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define fin cin
#define ll long long
#define sz(x) (int)(x).size()
#define all(v) v.begin(), v.end()
#define o... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c;cin>>a>>b>>c;
if(c==0)
a>b?cout<<"Takahashi"<<endl:cout<<"Aoki"<<endl;
else
b>a?cout<<"Aoki"<<endl:cout<<"Takahashi"<<endl;
}
/* * * * *
* * ... |
//Let's join Kaede Takagaki Fan Club !!
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cassert>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <fun... | #include<bits/stdc++.h>
#define ll long long
#define fi first
#define se second
using namespace std;
const int N = 1e5 + 5;
struct elm{
int a, b, c;
bool operator < (const elm &other){
return c < other.c;
}
};
int main(){
ios::sync_with_stdio(0), cin.tie(0);
int n, k, p;
cin >> n >> k;
... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define T third
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<pair<int,int>> vp;
typedef vector<long long> vll;
typedef vector<vector<in... | #pragma GCC optimize ("O2")
#pragma GCC target ("avx")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<iostream>
#include<cstring>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(... |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstring>
#include <cstdlib>
#include <cmath>
using namespace std;
using ll = long long;
constexpr int P = 998244353;
ll powmod(ll n, ll k) {
ll r = 1, t = n % P;
for (; k != 0; k /= 2) {
if (k & 1) r = r * t % P;
... | #include "bits/stdc++.h"
using namespace std;
#define FAST ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define eb emplace_back
#define ins insert
#define f first
#define s second
#define cbr cerr<<"hi\n"
#define mmst(x, v) memset((x), v, sizeof ((x)))
#define siz(x) ll(x.size())
#define all(x) (... |
#include<bits/stdc++.h>
#define pb push_back
using namespace std;
#define G getchar()
int read()
{
int x=0; bool flg=false; char ch=G;
for (;!isdigit(ch);ch=G) if (ch=='-') flg=true;
for (;isdigit(ch);ch=G) x=(x<<3)+(x<<1)+(ch^48);
return flg?-x:x;
}
#undef G
#define fi first
#define se second
typedef long long ll;... | #include <cstdio>
#include <queue>
using namespace std;
int main(){
int n;
scanf("%d", &n);
vector<int> a(n*2);
for(int& i: a)
scanf("%d", &i);
priority_queue<int> q;
long long ans=0;
for(int i = 0;i < n;i ++){
q.push(a[i]);
q.push(a[n*2-1-i]);
ans+=q.top();
q.pop();
}
printf("%lld\n", ans);
} |
#define _USE_MATH_DEFINES
#include <iostream>
#include <cstring>
#include <regex>
#include <cmath>
#include <algorithm>
#include <vector>
#include <list>
#include <map>
#include <unordered_set>
#include <queue>
#include <unordered_map>
#include <set>
#include <cassert>
#include <climits>
#pragma GCC optimize("O3")
u... | #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], d[N], h[N];
int n, m, H, D;
bool chck(double... |
#include <bits/stdc++.h>
using namespace std;
#define M 1005
#define LL long long
const LL mod = 1000000007;
int n;
LL f[M];
char Caa, Cab, Cba, Cbb;
inline LL qkpow (LL x, LL y){
LL res = 1;
while (y){
if (y & 1)
res = res * x % mod;
x = x * x % mod;
y >>= 1;
}
return res;
}
signed main (){
scanf ("%d... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<ll(n);i++)
#define REP(i,k,n) for(ll i=k;i<ll(n);i++)
#define all(a) a.begin(),a.end()
#define eb 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 secon... |
#include<bits/stdc++.h>
#include <algorithm>
using namespace std;
#define ll long long int
#define ull unsigned long long int
#define db double
#define ld long double
#define MOD 1000000007
#define inf (1LL << 62)
#define pi acos(-1.0)
#define si(a) scanf("%lld",&a)
#define sd(n) scanf("%lf", &n)
#define for1(i, stop)... | #include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<cstdlib>
#define fo(i,x,y) for(int i = x;i <= y;++i)
#define fd(i,x,y) for(int i = x;i >= y;--i)
using namespace std;
char s1[100],s2[100],s3[110];
int len1,len2,len3,cnt,nm[100],l,s[100];
bool bz[100],bz2[100];
void dg(int x)
{
if(x > l)
... |
#include <bits/stdc++.h>
#include <unordered_set>
#include <cmath>
#include <algorithm>
// #include <atcoder/all>
// URL:
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll; //int:2*10**9
typedef long double ld;
typedef pair<ll,ll> P;
#define REP(i,n) for(ll i = 0; i<(ll)(n); i++)
#define FOR(i,a,b) for(ll i=(a);i<=(b);i++)
#define FORD(i,a,b) for(ll i=(a);i>=(b);i--)
#define pb push_back
#define MOD 1000000007 //998244353... |
#include<bits/stdc++.h>
using namespace std;
#define rep(x, L, R) for(int x = (L), _x = (R); x <= _x; x++)
#define per(x, R, L) for(int x = (R), _x = (L); x >= _x; x--)
#define broken fprintf(stderr, "running on %s %d\n", __FUNCTION__, __LINE__)
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define SZ(v) (int)(v).s... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<char> vc;
typedef queue<ll> ql;
typedef deque<ll> dql;
typedef priority_queue<ll> pql;
typedef set<ll> sl;
typedef pair<ll, ll> pl;
ty... |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
char* cstr = new char[N];
strcpy(cstr, S.c_str());
bool f = true;
for(int i = 0; i < N; ++ i){
if((i + 1) % 2 == 1){ // 奇数
if(+cstr[i] < 91){
f = false;
break;
}
}else{ /... | #include<iostream>
#include <cstring>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#de... |
/**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author kant97
*/
#include <iostream>
#include <fstream>
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#i... | #include <bits/stdc++.h>
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define ll long long
#define ld long double
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define mkpr make_pair
#define fi(i,a,b) for ... |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
using vi = vector<int64_t>;
using vvi = vector<vi>;
using vc = vector<char>;
using vvc = vector<vc>;
using vd = vector<long double>;
using vvd = vector<vd>;
usin... | # include <bits/stdc++.h>
# define rep(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
# define reps(i, n) for(int i=1, i##_len=(n); i<=i##_len; ++i)
# define rrep(i, n) for(int i=((int)(n)-1); i>=0; --i)
# define rreps(i, n) for(int i=((int)(n)); i>0; --i)
# define ALL(x) (x).begin(), (x).end()
# define SZ(x) ((int)(x... |
/*And I thought my jokes were bad*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define dbg puts("Viva la vida");
#define CHECK(x) cout << (#x) << " is " << (x) << endl;
#define nl puts("");
#define mp make_pair
#define IN(x) scanf("%d",&x);
#define INL(x) scanf("%lld",&x);
#define OUT(x) printf(... | #include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
// using namespace atcoder;
#define rp(i, k, n) for (int i = k; i < n; i++)
using ll = long long;
using ld = double;
template<class T>inline bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>inline bool chm... |
#include <bits/stdc++.h>
using namespace std;
int main() {int N;cin>>N;
vector<long long>A(N),B(N);
for(int i=0;i<N;i++)
cin>>A.at(i);
for(int i=0;i<N;i++)
cin>>B.at(i);
long long c=0;
int d=0;
for(int i=0;i<N;i++)
... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int64_t> A(n), B(n);
copy_n(istream_iterator<int64_t>(cin), n, A.begin());
copy_n(istream_iterator<int64_t>(cin), n, B.begin());
int64_t ma = 1, mab = 1;
for (int i = 0; i < n; i++){
ma = max(ma, A[i... |
#include<bits/stdc++.h>
const int mod=3,N=600005;
using namespace std;
struct nd{
int a,b;
nd(int k=1){b=0;if(k)while(k%mod==0)k/=mod,b++;a=k%mod;}
nd(int A,int B){a=A,b=B;}
nd operator*(nd c){
nd as=(nd){a*c.a%mod,b+c.b};
return as;
}
nd operator/(nd c){
nd as=(nd){a*c.a%mod,b-c.b};
return as;
}
int o... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
#include <bits/stdc++.h>
using namespace std;
/*
前処理: O(MAX_N*MAX_N)
nCk(n,k): nCk の計算。O(1)
*/
const int MAX_N = 60; // n の最大値
vector<vector<long long>> com; // 前計算の結果を保存
// 動的計画法で前処理
void init() {
com.assign(MAX_N, vector<l... |
//#include <atcoder/all>
#include <bits/stdc++.h>
//using namespace atcoder;
using namespace std;
typedef long long ll;
#define MOD (long long)(1e9+7)
#define INF (1LL<<60)
#define rep(i,n) for(ll i = 0; i < (n); i++)
#define rep1(i,n) for(ll i = 1; i <= (n); i++)
template<class T> inline bool chmin(T& a, T b) {
if... | #include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main() {
int N, X;
cin >> N >> X;
int num = 0;
int cnt = 0;
int ans = -1;
X *= 100;
rep(i, N) {
int V, P;
cin >> V >> P;
cnt += V * P;
... |
/* Ahmed Maher ( Acro_14 )*/
/*while(WA)try();*/
#include <bits/stdc++.h>
using namespace std;
#define fastIO ios::sync_with_stdio(0), ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef ... | #include<bits/stdc++.h>
using namespace std;
int main() {
char a, b, c;
cin >> a >> b >> c;
cout << (a == b && b == c ? "Won\n" : "Lost\n");
return 0;
} |
#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;
int f(int x){
int ans=0;
while (x){
ans+=x%10;
x/=10;
}
return ans;
}
int main(){
int a,b;
cin>>a>>b;
printf("%d\n",max(f(a),f(b)));
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define debug printf("%d %s\n",__LINE__,__FUNCTION__)
using ll=long long;using ld=double;using pii=pair<int,int>;using vi=vector<int>;
using qi=queue<int>;using pqi=priority_queue<int>;using si=set<int>;
#define pb push_back
#define mk make_pair
#define ins insert
#define er... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
using namespace std;
int main(){
int n,m;
cin>>n>>m;
vector<long long>a(m,0);
for(int i=0;i<a.size();i++)
cin>>a.at(i);
a.insert(a.begin(),0);
a.push_back(n+1);
sort(a.begin(),a.end());
vector<long long>len;
long long k=100000... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
int combination(int n, int k){
vector<vector<int>> comb(n + 1, vector<int>(k + 1, 0));
for(int i = 0; i <= n; i++){
for(int j = 0; j <= k && j <= i; j++){
// printf("(i, j) = (%d, %d)\n", i, j);
if(j == 0){
comb[i][j] = 1;
... | #include <bits/stdc++.h>
using namespace std;
using ld = long double;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vll = vector<ll>;
#define max(p, q) ((p) > (q) ? (p) : (q))
#define min(p, q) ((p) < (q) ? (p) : (q))
#define... |
//Problem link :
//done by ankit reddy
#include<bits/stdc++.h>
using namespace std;
#define loop(i,l,h) for(int i=l;i<h;i++)
#define loopr(i,l,h) for(int i=(h);i>=(l);i--)
#define ll long long
#define ld long double
#define inf 1e9
#define mod 1000000007
#defi... | #include<bits/stdc++.h>
using namespace std;
#define int long long
int32_t main(){
ios::sync_with_stdio(0);
cin.tie(0),cout.tie(0);
int a,b,c;
cin>>a>>b>>c;
int ac_minus=c%2==1&a<0;
int bc_minus=c%2==1&b<0;
if(ac_minus!=bc_minus){
if(ac_minus)
cout<<"<";
else
cout<<">";
}
else{
if(abs(a)<abs(b))
... |
// ----- In the name of ALLAH, the Most Gracious, the Most Merciful -----
#include<bits/stdc++.h>
using namespace std;
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > stru... | #include <bits/stdc++.h>
using namespace std;
// general template {{{
// region
typedef int int_;
#define int int64_t
#define pb push_back
#define pi pair<int,int>
#define vpi vector<pi>
#define vi vector<int>
#define vvi vector<vi>
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define db doubl... |
#include<cstdio>
#include<cstring>
using namespace std;
long long answer,ans=1;
long long used[20],x[101];
bool prime[101];
int n;
long long gcd(long long x,long long y)
{
if (y==0) return x;
return gcd(y,x%y);
}
void dfs(int k,long long sum)
{
if (k>used[0])
{
bool bo=false;
for (int i=1;i<=n;i++)
{
if (g... | #include<bits/stdc++.h>
#define N 500005
using namespace std;
int n,zs,zt;
char s[N],t[N];
int front[N],behind[N];
void init(){
scanf("%d",&n);
for(int i=1;i<=n;i++){
cin>>s[i];
if(s[i]=='0')zs++;
}
for(int i=1;i<=n;i++){
cin>>t[i];
if(t[i]=='0')zt++;
}
}
int main(){
init();
if(zs!=zt)printf("-1");
else... |
#include<iostream>
using namespace std;
typedef long long ll;
const ll N = 2e5+10;
ll a[N],b[N],maxn[N],c[N];
ll n;
int main(){
cin>>n;
for(ll i=1;i<=n;i++){
cin>>a[i];
}
maxn[1]=a[1];
for(ll i=2;i<=n;i++){
if(a[i]>maxn[i-1]){
maxn[i]=a[i];
}
else{
... | #include <bits/stdc++.h>
#define all(a) (a).begin(), (a).end()
using namespace std;
using ll = long long int;
using pii = pair<ll, ll>;
using vi = vector<ll>;
template <typename T> void out(const T& t) {cout << t << '\n';}
vi vin(int n) {vi res(n); for(auto&i:res)cin>>i; return res;}
ll in() {ll x; cin>>x; return x;}
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
long double sx, sy, gx, gy;
cin >> sx >> sy >> gx >> gy;
long double ans = (sx * gy + sy * gx) / (sy + gy);
cout << fixed << setprecision(10) <<ans;
}
| #include <iostream>
#include <stdexcept>
#include <cassert>
#include <cmath>
#include <vector>
#include <string>
#include <iomanip>
using namespace std;
int main() {
int sx, sy, gx, gy;
cin >> sx >> sy >> gx >> gy;
gy *= -1;
cout << setprecision(12) << - (double) (gx - sx) / (gy - sy) * sy + sx << endl;
re... |
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define PI acos(-1)
#define pb push_back
#define int long long
#define ld long double
#define sp fixed<<setprecision
#define bp __builtin_popcountll
#define all(x) x.begin(),x.end()
#define pii pair<long long,long long>
#define FAST ios_ba... | #include <bits/stdc++.h>
#define f first
#define s second
#define fore(i,a,b) for(int i = (a), ThxMK = (b); i < ThxMK; ++i)
#define pb push_back
#define all(s) begin(s), end(s)
#define _ ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define sz(s) int(s.size())
#define ENDL '\n'
#define vv(type, name, h, ...) vec... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_backk
#define pp pair
int main()
{
int tt;
tt=1;
while(tt--)
{
ll n;
cin>>n;
ll ans=0,spit=n+1;
ll kk=1;
while(spit>=kk)
{
ans++;
spit-=kk;
kk+=1;
}
cout... | #define LOCAL
#define _USE_MATH_DEFINES
#include <array>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include... |
#include <bits/stdc++.h>
#define rep(i,n) ;for (int i=0; i<(n); i++)
// #include <atcoder/all>
#include <random>
using namespace std;
// using namespace atcoder;
using ll = long long;
using P = pair<int, int>;
const ll MOD = 1000000007;
const int INF = 1e9;
// using Graph = vector<vector<int>>;
/* divisor(n)
入... | #include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<unordered_map>
#include<unordered_set>
#include<cstring>... |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<pair<int, int>> pos(n);
for (auto &&[x, y] : pos) {
cin >> x >> y;
}
auto judge = [&](double r) -> bool {
queue<int> q;
for (auto i = 0; i != n; ++i) {
if (100 ... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
template<typename T> bool chmin(T &a, T b) {if(a>b){a=b; return 1; } return 0; }
int h, w;
#ifndef dijkstra_hpp
#define dijkstra_hpp
#include<vector>
#include<queue>
#include<utility>
struct Dijkstra {
// Edge: 辺の情報の構造体
pri... |
#line 1 "main_c.cpp"
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cstdint>
#include <cstdlib>
#include <cmath>
#include <complex>
#include <chrono>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#in... | #include <bits/stdc++.h>
// #include<iomanip>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pii;
#define f(i,a,b) for(ll i=a;i<b;i++)
#define fo(i,a,b) for(ll i = a; i<=b;i+=1)
// #define Vector vector
#define rf(i,a,b) for(ll i=a;i>=b;i--)
#define vll vector<ll>
#define sz(a) ll(a.size())
#defi... |
#include<iostream>
#include<algorithm>
using namespace std;
int t[10][10],a[12];
int n,k,ans;
int main()
{
cin>>n>>k;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
cin>>t[i][j];
for(int i=1;i<=n;i++) a[i]=i;
do{
int sum=0;
for(int i=2;i<=n;i++)
{
sum+=t[a[i-1]][a[i]];
... | #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;
}
int a[10];
int main()
... |
#include<bits/stdc++.h>
using namespace std;
int n;
struct CH
{
string s;
int v;
}Ty[1010];
bool cmp(CH x,CH y)
{
return x.v>y.v;
}
template<typename Tp>
void read(Tp &x)
{
x=0;int f=1;char c=getchar();
while(c<'0'||c>'9'){if(c=='-') f=-1;c=getchar();}
while(c>='0'&&c<='9'){x=x*10+c-'0';c=getchar();}x*=f;
}
i... | #include "bits/stdc++.h"
using namespace std;
// Hi
int main(){
ios::sync_with_stdio(0);cin.tie(0);
string n;int k;
cin>>n>>k;
for(int i=0;i<k;i++){
string a = n;
sort(a.begin(),a.end());
int an = 0,bn = 0;
for(int i=0;i<(int)(a.size());i++){
an = (an*10)+(a... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define int long long
const int inf = 100100100100100100;
const int maxn = 17;
int n, m;
int dist[maxn][maxn];
int dp[1<<maxn][maxn];
int dfs(int s, int v){
if(dp[s][v] >= 0){
return dp[s][v];
}
if(s == (1<<n)-... | #pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using ll = int64_t;
using ld = long double;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vector<int>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vpii = vector<pii>;
using vpll =... |
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define pai arccos(-1);
#define keta(n) cout << fixed << setprecision((n));
using ll = long long;
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N = 3;
int X[N];
for(int i=0; i<N; i++) cin>>X[i];
int A, B, C;
A = X[0];
B = X[1];
C = X[2];
if ( !(C%2) ) {
if (abs(A)==abs(B)){
cout << "=" << endl;
} else if (abs(A)<abs(B)){
cout << "<" << e... |
#include <iostream>
using namespace std;
int main() {
int n,x;
cin >> n >> x;
int a[n],b[n];
for(int i=0;i<n;i++){
cin >> a[i] >> b[i];
}
int count=0;
for(int i=0;i<n;i++){
count=count+a[i]*b[i];
if(count>100*x){
cout << i+1 << endl;
break;
}
if((i==n-1)&&(count<=100*x)){
cout << -1 << endl;
... | /*********************************************************************************\
* _________ _ _ ________ _ _ __ ________ *
* |___ ___|| | | || ______|| | | | / \ | ____ | *
* | | | | | || |______ | |_____| | / /\ \ | |____| |... |
#include<bits/stdc++.h>
using namespace std;
int main(void)
{
int a,b;cin>>a>>b;if(a==b)cout<<a<<endl;else cout<<3-a-b<<endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define M 1000000007
#define pb push_back
#define bg begin
#define pob pop_back
#define rep(x,y,j) for(ll j = x;j < y ;j++)
#define sz size
#define ss second
#define ff first
#define SUM accumulate
#define INF 2000000000000000000
#define SPACE " "
#de... |
#pragma GCC optimize("Ofast")
#if 1
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using ll = int64_t;
using db = double;
using ld = long double;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vector<int>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vpii = ... | //by ciwomuli
//enter ICPC WF 2020
#include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define LL long long
using namespace std;
template <typename T>
... |
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <string>
#include <vector>
#include <math.h>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#define PI 3.14159265359
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pa... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define N 100005
#define MOD 1000000007
#define dd double
#define vi vector<int>
#define vll vector<ll>
#define forr(i,n) for(ll i=0;i<n;i++)
#define revf(i,n) for(ll i=n-1;i>=0;i--)
#define REP(i,a,b) for(ll i=a;i<b;i++)
#define rep1(i,b) for(ll i=... |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long a,b,c;
cin>>a>>b>>c;
vector<long long>vec;
vec.push_back(a);vec.push_back(c);vec.push_back(b);
sort(vec.begin(),vec.end());
if(vec[1]-vec[0]==vec[2]-vec[1])
{
cout<<"Yes"<<endl;
}
else
{
cout<<"No"<<endl;
... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
// UnionFind
class UnionFind{
vector<int> d;
int m;
public:
UnionFind(int n = 0):d(n,-1),m(1){}
~UnionFind(){}
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 fi first
#define se second
#define rep(i, s, n) for (int i = (s); i < (n); ++i)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define len(x) (int)(x).size()
#define pb push_back
#define vi vector<int>
#define vl vector<long long>
#define fast \
cin.tie(0); \
... |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,x,y) for(int i=(int)(x);i<(int)(y);i++)
#define print(A,x,n) rep(i,0,n){cout<<(i ? " ":"")<<A[i]x;}cout<<endl;
#define pprint(A,y,m,n) rep(j,0,m){print(A[j],y,n);}
const long mod=1e9+7;
const int siz=2e5;
const int inf=1e9;
vector<pair<int,long>> g[siz];
long d... | #include <bits/stdc++.h>
using namespace std;
using lli = long long int;
using ii = pair<int, lli>;
const int MAXN = 2e5;
const lli MOD = 1e9+7;
int n;
vector<ii> adj[MAXN+1];
lli rootXor[MAXN+1];
void dfs(int u, int p, lli x) {
rootXor[u] = x;
for(ii v: adj[u]) {
if(v.first == p) {
con... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int maxn = 2e5 + 5;
vector<int> adj[maxn];
int x, y;
int a[maxn], b[maxn];
bool visited[maxn];
void dfs(int src)
{
visited[src] = true;
x += a[src];
y += b[src];
for (auto node : adj[src])
{
if (!visited[node])
{
dfs(node);
}
}
}
... | #include <bits/stdc++.h>
using namespace std;
template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define pb push_back
#define mp make_pair
#define cotu cout
#define itn int
#de... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main(){
cin.tie(0);
ios::sync_with_stdio(0);
ll N; cin >> N;
vector<vector<ll>> p(N, vector<ll> (5));
rep(i,N)rep(j,5) cin >> p[i][j];
vector<vector<pair<ll,ll>>> x(5, vector<p... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
//#i... |
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
ll n;
ll a[100005];
vector<ll> ve[100005], now;
ll d[100005];
bool v[100005];
int main()
{
scanf("%lld", &n);
for(ll i = 2; i <= n; i++)
{
scanf("%lld", &a[i]);
ve[a[i]... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define fo(i,n) for(ll i=0;i<n;i++)
#define fo1(i,n) for(ll i=1;i<=n;i++)
#define loop(i,a,b)for(ll i=a;i<=b;i++)
#define loopr(i,a,b)for(ll i=b;i>=a;i--)
#define vll v... |
#include<bits/stdc++.h>
#define ll long long int
#define ld long double
#define ff first
#define ss second
#define mod 1000000007
#define ull unsigned long long
#define vll vector<ll>
#define uom unordered_map
#define uo... | #include <iostream>
#include <cmath>
#include <climits>
#include <algorithm>
using namespace std;
typedef unsigned long long ull;
int main()
{
ull N;
cin >> N;
ull b = floor(log2(N)), sum = LLONG_MAX;
for (int i = 0; i <= b; i += 1)
sum = min(sum, (N / (1ULL << i)) + i + (N % (1ULL << i)));
... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll k, dp[262144][18], ok[18][18];
ll solve(ll m, ll e){
if (dp[m][e] != 0) return dp[m][e];
if ((m ^ (1ll << e)) == 0) return dp[m][e] = 1;
dp[m][e] = 1e18;
for (ll i = 0; i < k; i++){
if (ok[i][e] != -1 && m & (1 << i)) dp[m][e] = min(dp[m][e], s... | #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;
using ll = long long;
using ld = long double;
using Graph = vector<vector<int>>;
int main(void)
{
ll n,tmp;
cin >> n;
vector<ll> v;
for(long i=1;i<=sqrt(n);++i)
{
if(n%i==0)
{
cout << i << endl;
if(i!=n/i)
... | #include<bits/stdc++.h>
using namespace std;
#define PI 3.1415926536
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vi vector<int>... |
#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
typedef pair<ll,ll> pll;
typedef long double D;
//typedef complex<D> P;
#define F first
#define S second
const ll MOD=1000000007;
//const ll MOD=998244353;
template<typename T,typename U>istream & operator >> (is... | #include<bits/stdc++.h>
using namespace std;
namespace Ruri{
#define ms(a,b) memset(a,b,sizeof(a))
#define repi(i,a,b) for(int i=a,bbb=b;i<=bbb;++i)//attention reg int or reg ll ?
#define repd(i,a,b) for(int i=a,bbb=b;i>=bbb;--i)
#define reps(s) for(int i=head[s],v=e[i].to;i;i=e[i].nxt,v=e[i].to)
#... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll,ll>;
using pld = pair<ld,ld>;
using vll = vector<ll>;
using vld = vector<ld>;
using vstr = vector<string>;
#define _GLIBCXX_DEBUG
#define rep(j, m) for (ll j = 0; j < (ll)(m); j++)
#define rep2(i, l, n) for (... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll>vl1;
typedef vector<vl1> vl2;
typedef vector<double> vd1;
typedef vector<vl1> vl2;
struct struka
{ll val; ll ind;};
typedef vector<struka> vs;
bool compa(struka& a, struka& b)
{ if(a.val==b.val) return a.ind<b.ind;
return a.val<... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.