code_file1 stringlengths 87 4k | code_file2 stringlengths 85 4k |
|---|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(NULL);
ios_base::sync_with_stdio(false);
int tt=1;
while(tt--){
long double a,b,w; cin>>a>>b>>w;
w*=1000;
if(w<a || (long long)ceil(w/b)>(long long)(w/a)){
cout<<"UNSATISFIABLE";
}
else{
cout<<(l... | #include <bits/stdc++.h>
template<class T> inline bool chmin(T&a, T b){if(a > b){a = b; return true;}else{return false;}}
template<class T> inline bool chmax(T&a, T b){if(a < b){a = b; return true;}else{return false;}}
#define ll long long
#define double long double
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,K,M;
cin>>N>>K>>M;
vector<int>A(N-1);
int sum=0;
for(int i=0;i<N-1;i++){
cin>>A.at(i);
sum+=A.at(i);
}
for(int i=0;i<=K;i++){
if(sum+i>=M*N){
cout<<i;
break;
}
if(i==K&&sum+i<M*N)
cout<<-1;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef map<int,int> mkmap;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<pii> vp;
typedef vector<vi> vv;
#define fast ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)
const ll mod=100000000... |
// writer: w33z8kqrqk8zzzx33
#include <bits/stdc++.h>
using namespace std;
// begin fast read template by CYJian (source: https://www.luogu.com.cn/paste/i11c3ppx)
namespace io {
const int __SIZE = (1 << 21) + 1;
char ibuf[__SIZE], *iS, *iT, obuf[__SIZE], *oS = obuf, *oT = oS + __SIZE - 1, __c, qu[55]; int __f, qr, ... | #include <cstdio>
#include <algorithm>
#include <cstring>
#include <functional>
#include <cmath>
#include <math.h>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <unordered_map>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#defin... |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main()
{
unsigned int oi[4];
bool flag = false;
int sum = 0;
cin >> oi[0] >> oi[1] >> oi[2] >> oi[3];
sum = oi[0] + oi[1] + oi[2] + oi[3];
for(int i=0; i<4; i++){
if(oi[i] == (sum - oi[i])){
... | constexpr bool isDebugMode = false;
int testcase = 1;
#include <bits/stdc++.h>
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using namespace std;
typedef long long ll;
typedef pair<long long, long long> P;
struct edge{long long to,cost;};
const int inf = 1 << 27;
const ... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=2e5+5;
vector<int> adj[N];
int vis[N];
int main(){
ios::sync_with_stdio(0), cin.tie(0);
int n, m; cin >> n >> m;
ll a[n];
for (int i = 0; i < n; ++i){
cin >> a[i];
}
ll b[n];
for (int i = 0; i < n; ++i){
cin >> b... | #include <bits/stdc++.h>
using namespace std;
#define ms(a, b) memset((a), (b), sizeof(a))
#define eps 1e-8
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
const int N = 3e5 + 5;
const int M = 1e6 + 5;
const int INF = 0x3f3f3f3f;
const ll LL_MAX = 0x3f3f3f3f3f3f3f3f;
const int mod = 1e9 ... |
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL_
void debug_out() {cerr << endl;}
template<typename Head,typename... Tail> void debug_out(Head H,Tail... T){cerr << ' ' << H; debug_out(T...);}
#define debug(...) cerr << 'L' << __LINE__ << " [" << #__VA_ARGS__ << "]:",debug_out(__VA_ARGS__)
#define dump(x) cer... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(var, begin, end) for (int var = (begin); var <= (end); var++)
#define RFOR(var, begin, end) for (int var = (begin); var >= (end); var--)
#define REP(var, length) FOR(var, 0, length - 1)
#define RREP(var, length) RFOR(var, length - 1, 0)
#de... |
#include<bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(n);++i)
#define ll long long
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define pb push_back
#define pob pop_back()
#define Mod (ll)(1e9+7)
#define mod (ll)(998244353)
#define setp(x) setprecision((ll)(n))
#define INF (ll)(1000000000000000... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
long long n, k;
cin >> n >> k;
vector<pair<long long, int>> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i].first >> v[i].second;
}
sort(v.begin(), v.end());
for (auto [x... |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ALL(x) (x).begin(), (x).end()
template<class T> bool chmax(T &x, const T &y){if (x < y) {x = y; return true;} return false;}
template<class T> bool chmin(T &x, const T &y){if (x > y) {x = y; return true;} return false;}
template<class T> void pr... | #include <bits/stdc++.h>
using namespace std;
//int x[100007], y[100007], r[100007];
struct nod{
int x, y, r;
}a[207];
int n;
int main(){
scanf("%d", &n);
for(int i = 0; i < n; i++){
scanf("%d %d %d", &a[i].x, &a[i].y, &a[i].r);
}
for(int i = 0; i < n; i++){
printf("%d %d %d %d\n", a[i].x, a[i].y, a[i].x + 1, ... |
#include <set>
#include <iostream>
using namespace std;
constexpr int M = 1000000007;
long long modexp(int x, long long e, int m) {
long long ans = 1, p = x % m;
while (e > 0) {
if (e % 2 != 0) ans = (ans * p) % m;
p = (p * p) % m;
e >>= 1;
}
return ans;
}
class ModComb {
... | #include "bits/stdc++.h"
#include "ext/pb_ds/assoc_container.hpp"
#include "ext/pb_ds/tree_policy.hpp"
using namespace std;
#pragma GCC optimize("O3","unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC target("avx2")
#define sync ios_base::sync_with_stdio(0); ci... |
#include <bits/stdc++.h>
int main(){
std::string s1, s2, s3;
std::cin >> s1 >> s2 >> s3;
std::map< int, int > mp;
std::vector< int > s1v(s1.size());
std::vector< int > s2v(s2.size());
std::vector< int > s3v(s3.size());
for(int i=0; i<s1.size(); i++){
auto itr = mp.fin... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define srep(i, l, r) for (int i = (l); i < (r); ++i)
int main(void) {
char S[3];
scanf("%c%c%c", &S[2], &S[0], &S[1]);
printf("%c%c%c", S[0], S[1], S[2]);
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
#define Rep(i,n) for(int i = 1; i <= n; i++)
#define sz(a) int(a.size())
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define fin(a) { cout << a << endl; return 0; }
#define debug(a) { cerr << #a << ": " ... | #include <bits/stdc++.h>
#define PI pair<int,int>
using namespace std;
const int maxm=5e1+5;
PI e[maxm];
PI ee[maxm];
int n,m,q;
void solve(){
cin>>n>>m>>q;
for(int i=1;i<=n;i++){
int x,y;cin>>x>>y;
e[i]={x,y};
}
for(int i=1;i<=m;i++){
int x;cin>>x;
ee[i]={x,i};
}
... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); ++i)
int main() {
int N; double D, H;
cin >> N >> D >> H;
double ans = 0;
rep(i, N) {
double d, h;
cin >> d >> h;
double y = d * (H - h) / (D - d);
ans = max(ans, h - y);
}
co... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define lop(n) for(ll i=0;i<n;i++)
#define loop(a,b) for(ll i=a;i<b;i++)
#define sortt(x) sort(x.begin(),x.end())
#define MOD 1000000007
#define en "\n"
#define F first
#define S second
#define inputlist for(ll i=0;i<n;i+... |
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<ctime>
#define ll long long
#define MAXN 200005
#define uns unsigned
#define INF 0x7f7f7f7f
#define MOD 1000000007ll
using namespace std;
inline ll read(){
l... | #include <bits/stdc++.h>
using namespace std;
int main(void)
{
char s[3];
cin >> s;
cout << s[1] << s[2] << s[0] << endl;
return 0;
} |
#include <bits/stdc++.h>
// #include <atcoder/all>
// #include "icld.cpp"
using namespace std;
using ll = long long int;
using vi = vector<int>;
using si = set<int>;
using vll = vector<ll>;
using vvi = vector<vector<int>>;
using ss = string;
using db = double;
template<typename T> using minpq = priority_queue <T,vector... | #include<bits/stdc++.h>
using namespace std;
typedef int64_t ll;
typedef long double ld;
const ll MOD=1000000007;
const ll MODA=998244353;
ll vx[4]={0,1,0,-1};
ll vy[4]={1,0,-1,0};
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
long long gcd(long long a,long long b){
ll gcdmax=max(a,b);
ll gcdmin=min(a,b);
whi... |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include... | #include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
int a[N];
for(auto &i :a) cin >> i;
int ans = 2000000000;
for(int i=0; i < 1 << (N-1);i++){
int xored = 0;
int ored = 0;
for(int j=0;j<N;j++){
ored |= a[j];
if(i>>j & 1) xor... |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const int N = 1500000;
int aa[N];
vector<int> ii[N];
int main() {
int n, m; cin >> n >> m;
for (int i = 0; i < n; i++)
cin >> aa[i];
for (int i = 0; i < n; i++)
ii[aa[i]].push_back(i);
for (int a = 0; a < n; a++) {
int i_ = -1... | #include <stdio.h>
#include <assert.h>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <vector>
#include <numeric>
#include <iomanip>
#define ll long long
#define mint modint<MOD>
#define rep2(i,a,b) for(int i=a;i<=b;++... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pint;
typedef vector<int> vi;
typedef vector<ll> vll;
#define all(v) v.begin(), v.end()
#define rep(i,s,n) for(int i=(int)(s);i<(int)(n);i++)
#define lep(i,s,n) for(ll i=(ll)(s);i<(ll)(n);i++)
#define vep(v) for(auto&& x : v)
#def... | #include <bits/stdc++.h>
using namespace std;
//ans[]の添字を数列の和(mod 200)にして、bit全探索で和の添字の要素をインクリメントし、値が２になった時点で数列出力
int main()
{
int n;
cin >> n;
long long A[210], B[210];
for (int i = 0; i < n; i++)
{
cin >> A[i];
A[i] %= 200;
}
n = min(n,8);
int ans[200] = {};
for... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b) cout << c << endl;
else if (a == c) cout << b << endl;
else if (b == c) cout << a << endl;
else cout << 0 << endl;
return 0;
}
| #include <iostream>
#include <sstream>
#include <fstream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <utility>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cs... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll r, x, y;
cin >> r >> x >> y;
ll dist = x*x + y*y;
if(pow(dist, 0.5) < r) cout << 2 << endl;
else cout << ceil(pow(dist, 0.5) / r) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#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(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x).size()
#define e... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
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>;
#define f(i, a, b) for(int i = (a); i < (b); ++i)
#define PB push_back
#defi... | #include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<util... |
#include <bits/stdc++.h>
using namespace std;
#define PI 3.14159265358979323846264338327950L
int main(void){
int N;
long long tmp,sumB,sumC;
cin>>N;
vector<long long> A(N),B,C,num(N,0);
for(int i=0;i<N;i++){
cin>>tmp;
A[i]=tmp%200;
}
bool flg=false;
for(long long i... | #include "bits/stdc++.h"
using namespace std;
#define max(a, b) (a < b ? b : a)
#define min(a, b) ((a > b) ? b : a)
#define mem(a,b) memset(a,(b),sizeof(a))
#define for0(a, c) for (int(a) = 0; (a) < (c); (a)++)
#define forc(a, b, c) for (int(a) = (b); (a) <= (c); (a)++)
#define forr(a, b, c) for (int(a) = (b); (... |
#include <bits/stdc++.h>
using namespace std;
//useful
#define rep(i,n) for(int i = 0; i < (n); i++)
int long long gcd(int long long a, int long long b){
return b?gcd(b,a%b):a;
} //最大公約数
int long long lcm(int long long a, int long long b){
return a/gcd(a,b)*b;
} //最小公倍数
int long long GetDigit(int long long num... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int a, b, c;
cin >> a >> b >> c;
cout << max(a + b, max(b + c, a + c)) << endl;
return 0;
} |
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
#define fr(i, a, b) for (ll i = a; i < b; i++)
#define rf(i, a, b) for (ll i = a; i >= b; i--)
typedef std::vector<long long> vi;
#define F first
#define S second
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0)... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod=1e9+7;
const int maxn=2e6+5;
int n,m,k;
int inv[maxn];
int main()
{
scanf("%d%d%d",&n,&m,&k);
if(n>m+k)
{
printf("0");
return 0;
}
int ans=1,res=1;
inv[0]=inv[1]=1;
for(int i=2;i<=max(n,m+k+... |
#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline")
#pragma GCC option("arch=native","tune=native","no-zero-upper")
#pragma GCC target("avx2")
#include <bits/stdc++.h>
using namespace std;
#define INF 2147483647
#define infL (1LL<<60)
#define inf (1<<30)
#define inf9 (1000000000)
#define MOD 1000... | #include <bits/stdc++.h>
using namespace std;
const int N=1002;
int n,m;
char s[2];
struct node
{
int s,t,sp;
} r;
queue<node>q;
vector<int>a[N][26];
int ans=1e9,vis[N][N];
//把边看成点
//对于两对边(a,b) (c,d)
//如果(a,c) 和 (b,c)之间存在边 而且边上的字母相同的话
//那么这两个边变成的点就可以联通
int bfs()
{
while(!q.empty())
{
r=q.front();
q.pop();
if(... |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<string, string> pss;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vii;
typedef vector<ll> vl;
t... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <assert.h>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <unordered_map>
#includ... |
#include <bits/stdc++.h>
#define PB push_back
#define MP(x,y) make_pair(x,y)
#define F first
#define S second
#define loop(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rloop(i,m,n) for(int i=(int)(m) ; i > (int) (n) ; --i )
#define lp(i,n) loop(i,0,n)
#define rlp(i,n) rloop(i,n,0)
#define mod 1000000007
us... | #pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunused-variable"
#pragma GCC diagnostic ignored "-Wfloat-conversion"
#include <iostream> // IO
#include <cmath> // sqrt, trig, ceil, log
#include <utility> // swap, pair
// #include <chrono> // non c style time
// #include <algorithm> // sort, binary sear... |
#include<iostream>
#include<cstdio>
using namespace std;
const int N=2021,INF=2e9;
int n,a[N],b[N],c[N][N];
int read(){
int x=0,f=1; char ch=getchar();
while(ch<'0' || ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0' && ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
int main()
{
n=read();
for(int i=1;i<=... | // 2021-03-21 20:11:03
// clang-format off
#include <bits/stdc++.h>
#ifdef LOCAL
#include "lib/debug.hpp"
#else
#define debug(...) 1
#endif
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define rep(i, n) REP(i, 0, (n))
#define repc(i, n) REPC(i, 0, (n))
#define REP(i, n, m) for (int i =... |
//Author- Vaibhav Singh
#include<bits/stdc++.h>
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_multiset tree<long long , null_type,less_equal<long long >, rb_tree_tag,tree_order_statistics_node_update>
#define ordered_set tree<long long , n... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int mod=1e9+7;
ll x,y,a,b,res;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin>>x>>y>>a>>b;
ll cnt=0;
while((double)a*x<=2e18 && x*a<=x+b && x*a<y)
{
x=x*a;
cnt++;
}
res=((y-x-1)/b);
res=res+cnt;
cout<<res<<e... |
#include<bits/stdc++.h>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int unsigned long long int
#define mod 1000000007
#define inf 1e18+42
#define endl "\n"
#define pi 3.141592653589793238462643383279502884197169399375... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#ifdef ENABLE_DEBUG
#define dump(a) cerr<<#a<<"="<<(a)<<endl
#define dumparr(a,n) cerr<<#a<<"["<<(n)<<"]="<<(a[n])<<endl
#else
#define dump(a)
#define dumparr(a,n)
#e... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n; cin >> n;
vector<ll> a(n);
ll k = 200;
for(int i=0; i<n; i++) {
cin >> a[i];
a[i] = (a[i] + k) % k;
}
vector<ll> h(k);
for(int i=0; i<n; i++) h[a[i]]++;
ll ans = 0;
for (int i=... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
int n;
cin >> n;
vector<ll> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
ll val = 0, val2 = 0;
for (ll i = 0; i < n; i++) {
val += a[i] * a[i];
val2 += a[i];
}
cout << (n * val) - (val2 * val2);
} |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constex... | /**
* Author : Tanbin_Hasan
* Created : 13.04.2021 02:40:07
**/
#include <bits/stdc++.h>
using namespace std ;
int main(void) {
ios::sync_with_stdio(false) ; cin.tie(0) ;
string a , b , c ;
cin >> a ;
cin >> b ;
cin >> c ;
string s = a + b + c ;
unordered_set<char> tot ;
for (auto &i : s) {
... |
#include <bits/stdc++.h>
using namespace std;
void solveCase() {
string s1, s2, s3;
cin >> s1 >> s2 >> s3;
vector<bool> visit(26);
for (auto& c : s1) visit[c - 'a'] = 1;
for (auto& c : s2) visit[c - 'a'] = 1;
for (auto& c : s3) visit[c - 'a'] = 1;
vector<int> can;
for (int k = 0; k < 26; ++k) {
if ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s[3];
for (int i = 0; i < 3; i++) cin >> s[i];
bool c[26] = {};
vector<char> top;
for (int i = 0; i < 3; i++) {
top.push_back(s[i][0]);
for (int j = 0; j < s[i].length(); j++) c[s[i][j] - 'a'] = true;
}
int n ... |
//Bismillahirrahmanirrahim
#include"bits/stdc++.h"
using namespace std;
#define ll long long
#define sz(i) (int)i.size()
#define ln "\n"
const int N = 2e5+5;
void solve(){
string s; cin >> s;
string ans;
for(int i =0; i < s.size(); i++){
if(s[i] != '.')
ans+=s[i];
else
break;
}
cout << ans << endl;
}
in... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
const ll INF=1LL<<60;
const double EPS = 1e-10;
const ll mod=1000000007;
//const ll mod=998244353;
int main(void){
ll n;
cin>>n;
double ans=0;
for(int i=1;i<n;i++){
ans+=double(n)/double(i);
}
pri... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define sz(a) int(a.size())
template <typename A, typename B>
ostream& operator <<(ostream& out, const pair<A, B>& a) { out << "(" << a.first << "," << a.second << ")"; return out; }
template <typename T, size_t N> ostream& operator <<(ostream& out, con... | #include <bits/stdc++.h>
using namespace std;
// template {{{
#define range(i, l, r) for (int i = (int)(l); i < (int)(r); (i) += 1)
#define rrange(i, l, r) for (int i = (int)(r) - 1; i >= (int)(l); (i) -= 1)
#define whole(f, x, ...) ([&](decltype((x)) container) { return (f)( begin(container), end(container), ## ... |
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
//#include<boost/multiprecision/cpp_int.hpp>
//#include <atcoder/all>
using namespace std;
//using namespace boost::multiprecision;
//using namespace atcoder;
typedef long long ll;
#define FOR(i, a, n) fo... | #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 <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) (v).begin(), (v).end()
using ll = long long;
constexpr int INF = 1e9;
constexpr long long LINF = 1e18;
constexpr long long MOD = 1e9 + 7;
signed main() {
int a[4];
int ans = INF;
rep(i, 4) {
... | #include <bits/stdc++.h>
using namespace std;
const int MOD=1e9+7;
//const int MOD=998244353;
vector<int> dij(vector<vector<pair<int,int>>> graph, int source){
int n=graph.size();
vector<int> dists(n,MOD);
vector<bool> mark(n,false);
dists[source]=0;
priority_queue<pair<int,int>, vector<pai... |
#include<bits/stdc++.h>
using namespace std;
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')';}
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_... | #include <iostream>
#include <string>
#include <map>
#include <climits>
#include <set>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
typedef long long ll;
// a*x - b*y = return value = GCD(a,b). x,y >= 0
ll egcd(ll a, ll b, ll& x, ll& y) { // MINUS B*Y
if (b == 0) {
x = 1; y = 0;
re... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int h=0,w=0;
cin>>h>>w;
vector<vector<char>> a(h,vector<char>(w,0));
vector<vector<int>> b(h,vector<int>(w,0));
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
cin>>a.at(i).at(j);
if(a.at(i).at(j)=='#')
b.at(i).at(j)=1;
else
... | #include <bits/stdc++.h>
#define rep(i, n) for(int i= 0; i < (n); i++)
using ll= long long int;
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; }
ll mod= 1e9 + 7;
... |
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <x86intrin.h> // __builtin_popcount(int x)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define V vector
#define pb push... | #include <iostream>
#include <random>
#include <cmath>
using namespace std;
struct Point
{
int i;
int j;
};
string calculate_path(Point s, Point t) {
int di = s.i - t.i;
int dj = s.j - t.j;
char ci = 'U', cj = 'L';
if (di < 0) {
ci = 'D';
di = -di;
}
if (dj < 0) {
cj = 'R';
dj = -dj;
... |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
... | #include <string>
#include <iostream>
#include <algorithm>
#include <queue>
#include <stack>
#include <vector>
#include <deque>
#include <functional>
#include <climits>
#include <set>
#include <map>
#include <cassert>
using namespace std;
using ll = long long;
int main()
{
cin.tie(NULL); cout.tie(NULL);
ios_base::s... |
#if _MSC_VER
#define _CRT_SECURE_NO_WARNINGS
#endif
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#ifndef ONLINE_JUDGE
const bool DEBUG = true;
#else
const bool DEBUG = false;
#endif
// Reads a 1D vector
template <class T>
void read1d(vector<T> & arg) {
const int l ... | // Created by Kshitij Anand NSIT
#include <bits/stdc++.h>
#include <ext/numeric>
using namespace __gnu_cxx;
using namespace std;
#define int long long
#define pb push_back
#define P pair<int,int>
#define F first
#define S second
#define vi vector<int>
#define vc vector<char>
#define vb vector<bool>
#define vp vecto... |
#include<bits/stdc++.h>
using namespace std;
int dp[101][1000004];
int solve(int a[],int n, int cursum, int sum)
{
if(n==-1)
{
return abs(sum-cursum-cursum);
}
if(dp[n][cursum]!=-1)
return dp[n][cursum];
return dp[n][cursum]=min(solve(a,n-1,cursum,sum),solve(a,n-1,cursum+a[n],... | #pragma GCC optimize("Ofast", "unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
using pii = pair<int, int>;
template<typename T>
using Prior = std::priority_queue<T>;
template<typename T>
using prior = std::priority_queue<T, vector<T>, greater<T>>;
#define ... |
//Nihal Mittal - nihal_47
//Strike First , Strike Hard , No Mercy !!
/**⠀⠀⠀⠀⠀⠀⣀⣤⣤⣄⣀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⣠⣾⣿⣿⣿⣿⣿⣿⣿⣿⣿⣦⣀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⣰⣿⣿⣿⣿⠿⠿⣿⣿⣿⣿⣿⣿⣿⣧⢀⠀⠀⠀⠀
⠀⠀⠀⣿⣿⣿⠋⠀⠀⠀⠀⠀⠙⠀⠙⣿⣿⣿⣷⢳⢀⠀⠀⠀
⠀⠀⣠⣿⣿⣿⢸⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣿⣿⣿⣿⣿⢀
⠀⠀⣸⣿⣿⣿⠸⠀⠀⠀⠒⠒⠒⠐⠀⠀⢿⣿⣿⣿⣿⣿⠀⠀
⠀⣴⣿⣿⣿⡿⠀⠒⣋⣙⡒⢰⠀⠤⣖⠒⢾⣿⣿⣿⣿⣧⠀⠀
⢺⣿⣿⣿⣿⢀⠀⠀⠉⠉⠉⠸⠀⡇⠉⠉⠀⢿⣿⣿⣿⣄⠀⠀
⠀⠙⣿⣿⣧⢻⠀⠀⠀⠀⠀⠠⠀⠰⠀⠀⠀⣸⠸⣿⣿⠿⠰⠀
⠀⠀⠀⠹⣿⣿⣿⣷⠀⡠⠙⣲⣔⣅⢡⣰⣷⣿⣿⣿⣧⠀⠀⠀
⠀... | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#define fi first
#define se second
#define pb push_back
#define pii pair<int,int>
#define endl "\n"
#define scd(a) scanf("%d",&a)
#define scdd(a,b) scanf("%d%d",&a,&b)
#define scddd(a,b,c) scanf("%d%d%d",&a,&b,&c)
con... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define mem(a,val) memset(a,(val),sizeof((a)))
#define FAST std::ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define decimal(n) cout << fixed ; cout << setprecision((n));
#define mp make_pair
#define eb emplace_ba... | #include<bits/stdc++.h>
typedef long long ll;
using namespace std;
int main(){
ll a,b,c;
cin>>a>>b>>c;
cout<<21-(a+b+c);
} |
#include <bits/stdc++.h>
using namespace std;
typedef long double ld;
const int N = (int) 2e5 + 7;
int n;
int m;
int k;
int x[N];
bool is[N];
ld dp[N];
ld algo(ld dp0) {
ld sum = 0;
for (int i = n - 1; i >= 0; i--) {
if (is[i]) {
dp[i] = dp0;
} else {
dp[i] = 1 + sum / (ld) m;
}
sum ... | /*#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
*/
#include <bits/stdc++.h>
using namespace std;
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<pair<ll,ll>, null_type,less<pair<ll,ll>>, rb_tree_tag,tree_order_s... |
#include <bits/stdc++.h>
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define size_t unsigned long long
#define ll long long
#define rep(i, a) for (int i = 0; i < (a); i++)
#define repr(i, a) for (int i = (int)(a)-1; i >= 0; i--)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#de... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long A, B, C;
cin >> A >> B >> C;
bool aNeg = A < 0 && (C % 2 == 1);
bool bNeg = B < 0 && (C % 2 == 1);
if (!aNeg && !bNeg) {
if (abs(A) == abs(B)) {
cout << "=" << endl;
return 0;
}
cout... |
//#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
//using namespace atcoder;
#define rep2(x,fr,to) for(int x=(fr);x<(to);x++)
#define rep(x,to) for(int x=0;x<(to);x++)
#define repr(x,fr,to) for(int x=(fr);x>=(to);x--)
#define all(c) c.begin(),c.end()
#define sz(v) (int)v.size()
typedef long lon... | //#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define lfs cout<<fixed<<setprecision(10)
#define ALL(a) (a).begin(),(a).end()
#define ALLR(a) (a).rbegin(),(a).rend()
#define spa << " " <<
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#define P... |
// Created by BJMinhNhut
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define FOR(i, a, b) for(int i = a, _b = b; i <= _b; ++i)
#define FORD(i, a, b) for(int i = a, _b = b; i >= _b; --i)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a)... | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
const ll MOD = 1000000007;
const ll MAX = 2000010;
ll fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD ... |
/**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author Pine1999
*/
#include <bits/stdc++.h>
using namespace std;
void solve(std::istream& in, std::ostream& out) {
int n; in >> n;
string s, t;
in >> s >> t;
queue<int> spos, tpos;
for (int i = 0; i < n; ... | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <stack>
#include <queue>
#include <set>
#include <map>
using namespace std;
#define MOD @
#define ADD(X,Y) ((X) = ((X) + (Y)%MOD) % MOD)
typedef long long i64; typedef vector<int... |
#include <bits/stdc++.h>
typedef unsigned long long ull;
typedef long long ll;
#define repu(i,a,b) for(ull i = a; i<b; i++)
#define rep(i,a,b) for(int i = a; i<b; i++)
using namespace std;
int n,res;
double per;
int main() {
per = 1.08;
cin>>n;
res = floor(n*per);
if(res<206){
cout<<"Yay!";
} else if(res>... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
string str;
int cal(int x, int size)
{
string tp;
for (int k = 0; k < size; ++k) {
if (x >> k & 1) tp += str[k];
}
ll val = stol(tp);
return (0 == val % 3) ? tp.size() : -1;
}
int solve(void)
{
int res = 0;
int size = str.size();
for (int ... |
#include <bits/stdc++.h>
using namespace std;
struct Fast {Fast() {std::cin.tie(0); ios::sync_with_stdio(false);}} fast;
using ull = unsigned long long;
using ll = long long;
using vi = vector<int>;
using vl = vector<long>;
using vll = vector<long long>;
using vvi = vector<vi>;
using vvl = vector<vl>;
using vvll = ve... | #include <bits/stdc++.h>
using namespace std;
using i128 = __int128_t;
using u128 = __uint128_t;
//define
#define trav(i,v) for(auto i: v)
#define rep(i,n) for(int i=0;i<n;i++)
#define repu(i,k,n) for(int i=k;i<=n;i++)
#define repd(i,k,n) for(int i=k;i>=n;i--)
#define se second
#define fi first
#define pb push_... |
#include <bits/stdc++.h>
using namespace std;
#define llong long long
#define len(x) ((int)x.size())
#define rep(i,n) for (int i = -1; ++ i < n; )
#define rep1(i,n) for (int i = 0; i ++ < n; )
#ifdef testing/*{{{*/
mt19937 rng(177013);
#else
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
#endif
... | /*
これを入れて実行
g++ code.cpp
./a.out
*/
#include <iostream>
#include <cstdio>
#include <stdio.h>
#include <vector>
#include <string>
#include <cstring>
#include <queue>
#include <deque>
#include <stack>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set... |
/*
これを入れて実行
g++ code.cpp
./a.out
*/
#include <iostream>
#include <cstdio>
#include <stdio.h>
#include <vector>
#include <string>
#include <cstring>
#include <queue>
#include <deque>
#include <stack>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set... | //#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 co... |
#include <bits/stdc++.h>
typedef long double ld;
#define int long long
#define gcd __gcd
#define endl "\n"
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 998244353
#define mod2 998244353
#define maxe *max_element... | #include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ostream &operator<<(ostream &os, const... |
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
#define all(v) v.begin(), v.end()
using in = long long;
#define rep(i, n) for (in i = 0; i < (in)(n); i++)
#define REP(i,a,b) for(in i=(in)(a);i<(in)(b);i+... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 2e5 + 10;
int n,a[N],b[N],lisan[N],num,c[N],tmp[N];
ll ans = 0;
queue <int> q[N];
void mysort(int l,int r)
{
if(l == r) return ;
int mid = (l + r) >> 1;
mysort(l,mid); mysort(mid+1,r);
int lnow = l , rnow = mid + 1 , top = l-1;
... |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
vector<int> p(n);
for(int i = 0; i < n; i++) cin >> p[i];
int l = 0;
vector<int> ans;
for(int r = 0; r < n; r++) {
if(p[l] == l + 1) {
cout << -1 << endl;
return 0;
}
if(p[r] == l + 1) {
for(int j = r - 1; j >= l; j--) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for(int i=0; i<n; i++)
#define REPi(i, a, b) for(int i=int(a); i<int(b); i++)
#define MEMS(a,b) memset(a,b,sizeof(a))
#define mp make_pair
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=... |
#include <bits/stdc++.h>
using namespace std;
using uint=unsigned int;
using LL=long long;
using ULL=unsigned long long;
#define rep(i,n) for(uint i=0; i<(n); i++)
uint GCD(uint a,uint b){ return b?GCD(b,a%b):a; }
uint sieve[32768]={};
vector<uint> P;
vector<pair<uint,uint>> factorize(uint N){
vector<pair<uint,ui... | #include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
... |
#include<bits/stdc++.h>
using namespace std;
#define fast ios::sync_with_stdio(false);cin.tie(NULL)
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define pb push_back
#define eb emplace_back
#define em emplace
#define mp make_pair
#define pre(a) cout<<fixed; cout.precision(a);... | #include<cstdio>
#include<iostream>
#include<cctype>
#include<cstring>
#include<cmath>
#include<string>
#include<algorithm>
#include<queue>
#include<stack>
using namespace std;
int main() {
int n;
long long ans[3] = {};
cin >> n;
int x[n] = {};
for (int i = 0; i < n; i++) {
cin >> x[i];
... |
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <iomanip>
#include <queue>
#include <deque>
#include <map>
#include <unordered_map>
#define rep(i,n) for(int i=0;i<n;i++)
#define repn(i,n) for(int i=1;i<=n;i++)
#define repr(e,x) for(auto& e:x)
usi... | #include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//using namespace __gnu_pbds;
using namespace std;
#define int long long
#define pb push_back
#define deb(x) cerr << #x << " is " << x << endl;
const int N = 3e5 + 5, MOD = 998244353; //1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch(... |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <map>
#define rep(i,n) for(int i=0;i<n;i++)
#define ll long long
using namespace std;
int n, a[200010], b[200010], c[200010];
map<int, vector<int>> m;
map<int, int> id;
ll res;
int bit[200010];
ll sum(int i){
ll s = 0;
wh... | #include <bits/stdc++.h>
using namespace std;
void DBG() { cerr << endl; }
template<class Head, class... Tail>
void DBG(Head H, Tail... T) { cerr << ' ' << H; DBG(T...); }
#define dbg(...) cerr << "(" << (#__VA_ARGS__) << "):", DBG(__VA_ARGS__)
using ll = long long;
using ld = long double;
#define sqr(a) ll(a) * (a)... |
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <string>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, b, n) for (int i = (b); i < (n); i++)
using namespace std;
using ll = long long;
const ll M = 998244353;
int main() {
int h, w;
string s[101];
int ans = 0;
cin >> h >> w;
... | #include <bits/stdc++.h>
using namespace std;
// #include <atcoder/all>
// using namespace atcoder;
#define rep(i,n) for(int i=0;i<(int)n;++i)
#define ll long long
int main(){
ll n;
cin>>n;
vector<int> v;
rep(i,n){
int a;
cin>>a;
v.push_back(a);
}
sort(v.begin(),v.end());
ll ans=n*(n-1)/2;
l... |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < (n); ++i)
#define FOR(i, m, n) for(ll i = m; i < (n); i++)
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
using vi = vector<int>;
using vii = vector<vi>;
using pii = pair<int, int>;
using vl = vector<ll... | #include<bits/stdc++.h>
using namespace std;
int main(){
int A, B;
cin >> A >> B;
vector<int> ans(A+B);
if(A == B){
for(int i=0; i<A; i++){
ans[i] = i+1;
}
for(int i=0; i<B; i++){
ans[i+A] = -(i+1);
}
}
else if(A > B){
int sum = 0;
for(int i=0; i<A; i++){
ans[i] = i... |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <numeric>
#include <utility>
#include <tuple>
#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{... | // Skyqwq
#include <iostream>
#include <cstdio>
using namespace std;
typedef long long LL;
const int N = 2e5 + 5, P = 998244353;
int n, m, K;
int inline power(int a, int b) {
int res = 1;
while (b) {
if (b & 1) res = (LL)res * a % P;
a = (LL)a * a % P;
b >>= 1;
}
return res;
}
int ans;
int main() {
sc... |
#include<iostream>
#include<vector>
#include<queue>
#include<stack>
#include<unordered_map>
#include<map>
#include<set>
#include<unordered_set>
#include<algorithm>
#include<list>
#include<bitset>
#include<utility>
#include<climits>
#include<deque>
#include<math.h>
#include<stdio.h>
#define INF (int)1e9
#define MOD 100... | #include<bits/stdc++.h>
using namespace std;
#define int long long
int T;
int l,r,ans;
signed main()
{
cin>>T;
while(T--)
{
cin>>l>>r;
if(2*l>r)
{
cout<<0<<endl;
continue;
}
ans=(r-2*l+1);
ans=((ans+1)*(ans))/2;
cout<<ans<<endl;
}
return 0;
} |
#include <bits/stdc++.h>
#define int long long
using namespace std;
// https://github.com/nweeks1/UltiSnips
template <const int32_t MOD> struct ModInt {
long long x;
ModInt() : x(0) {}
ModInt(long long u) : x(u) {
x %= MOD;
if (x < 0)
x += MOD;
}
friend bool operator==(const ModInt &a, const Mo... | #include <bits/stdc++.h>
using namespace std;
#define m_p make_pair
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define fi first
#define se second
typedef long long ll;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
mt19937 rnf(2106);
const int N = 5003, M = 998244353;
/*... |
//* Jai shree Ram
#include <bits/stdc++.h>
#define ios ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define lli long long int
#define ll long long
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define pi ... | #include <iostream>
#include <map>
#include <vector>
#include <string>
#include <set>
#include <algorithm>
#include <queue>
#include <iomanip>
#include <math.h>
using namespace std;
//#define int long long
#define all(x) x.begin(), x.end()
const int maxn = 6e5 + 13;
const int INF = 2e18 + 1;
const int MOD = 1e9 + 7;... |
#include <bits/stdc++.h>
#define int long long
#define rep(i, x, y) for(int i = x; i <= y; ++ i)
using namespace std;
const int N = 800050;
const int M = 998244353;
//const int M = 1e9 + 7;
vector <int> v[N];
void add(int x, int y) { v[x].push_back(y); v[y].push_back(x); }
int fa[N], vs[N], n, a[N], b[N], vis[N], s, ... | #include <bits/stdc++.h>
#if MYDEBUG
#include "lib/cp_debug.hpp"
#else
#define DBG(...) ;
#endif
#if __cplusplus <= 201402L
template <typename T>
T gcd(T a, T b) { return ((a % b == 0) ? b : gcd(b, a % b)); }
template <typename T>
T lcm(T a, T b) { return a / gcd(a, b) * b; }
#endif
using LL = long long;
constexpr LL ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<string, string> pss;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vii;
typedef vector<ll> vl;
typedef vector<vl> vvl;
double EPS=1e-9;
int INF=1000000005;
long ... | //#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
// using namespace atcoder;
int main() {
int N;
cin >> N;
vector<bool> p(200100, false);
int ans = 0;
for (int i = 0; i < N; ++i) {
int next;
cin >> next;
p[next] = true;
while (p[ans])
++ans;
cout << ans << '\n'... |
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2")
#pragma comment(linker, "/stack:200000000")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define pb push_... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const ll MOD = 1e9+7;
ll GD(ll num){//各桁の和
ll digit=0;
while(num!=0){
digit+=num%10;
num/=10;
}
return digit;
}
bool is_integer( long double x ){//整数判定
return std::floor(x)==x;
}
int gcd(int aa... |
#include<bits/stdc++.h>
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
using namespace std;
inline int read(){
int res=0;
bool zf=0;
char c;
while(((c=getchar())<'0'||c>'9')&&c!='-');
if(c=='-')zf=1;
else res=c-'0';
while((c=getchar())>='0'&&c<='9')res=(res<<3)+(res<<1)+c-'0';
if(... | // RedStone
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define endl '\n'
#define D(x) cerr << #x << " = " << (x) << '\n'
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
typedef long long ll;
const int N = 200010... |
#include <bits/stdc++.h>
#define int long long
#define IOS std::ios::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL);
#define pb push_back
#define mod 1000000007
#define lld long double
#define mii map<int, int>
#define mci map<char, int>
#define msi map<string, int>
#define pii pair<int, int>
#define ff first
#de... | #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>;
int64_t INF = 1e9;
int64_t mod = 998244353;
int main() {
int n, k;
cin... |
#include <bits/stdc++.h>
using namespace std;
int M;
struct modint {
int val = 0;
modint() {}
modint(int a) : val(a) {
while (val < 0) {
val += M;
}
while (val >= M) {
val -= M;
}
}
modint(long long a) : val(a % M) {
if (val < 0) {
val += M;
}
}
modint opera... | #include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << "\n"
#define COUTF(x) cout << setpre... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define reps(i,s,n) for(int i=(s); i<(n); i++)
#define all(v) v.begin(),v.end()
#define outve(v) for(auto i : v) cout << i << " ";cout << endl
#define outmat(v) for(auto i : v){for(auto j : i) cout << j << " ";cout << endl;}
#define in(n,v) for(int i=0;... | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
typedef pair<int, int> pi;
typedef long long ll;
void Solve() {
int n, m;
cin >> n >> m;
vector< vector<char> > grid(n + 1, vector<char>(m + 1));
for (int i = 1; i <= n; ++i) {
for (int ... |
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
int suma = a/100 + (a%100)/10 + a%10;
int sumb = b/100 + (b%100)/10 + b%10;
if(suma > sumb) cout << suma << endl;
else cout << sumb << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll LINF = 1e18;
const int INF = 1e9;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
template <class T>
inline bool chmax(T &a, T b)
{
if (a < b)
{
a = b;
return 1;
}
return 0;
}
template... |
#include <iostream>
using namespace std;
int main() {
string s; cin >> s;
cout << s[1] << s[2] << s[0];
} | #include <bits/stdc++.h>
using namespace std;
#define max(a,b) (a>b?a:b)
#define min(a,b) (a<b?a:b)
typedef long long int ll;
int main()
{ string s;
char temp;
cin>>s;
temp=s[0];
s[0]=s[1];
s[1]=s[2];
s[2]=temp;
cout<<s;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> p;
#define MOD 1000000007
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
bool c = false;
ll ans = 1e15;
for(int i = 0; i < N; i++) {
ll A, P, X;
cin >> A >> ... | #include <bits/stdc++.h>
using namespace std;
int main()
{
long int T;
cin >>T;
for (int i = 0; i < T; i++) {
long int L;
long int R;
cin >> L >> R;
long int maxC = R-L;
long int minC = L;
if (minC > maxC) {
cout << 0 << endl;
} else {
cout << (maxC-minC+1)*(maxC-minC+2)/... |
#line 2 "header.hpp"
//%snippet.set('header')%
//%snippet.fold()%
#ifndef HEADER_H
#define HEADER_H
// template version 2.0
#include <bits/stdc++.h>
using namespace std;
// varibable settings
template <class T> constexpr T inf = numeric_limits<T>::max() / 2.1;
#define _overload3(_1, _2, _3, name, ...) name
#define ... | #include <bits/stdc++.h>
// #include <atcoder/all>
// #include <boost/multiprecision/cpp_int.hpp>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(a) a.begin(), a.end()
#define yn(p) cout << (p?"Yes":"No") << endl;
using namespace std;
// using namespace atcoder;
using ll = long long;
// using lll = boost::mu... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, k = 0;
cin >> n;
int p[n + 1], c[n + 1] = {}, a[n + 1] = {}, gc = 0, ga = 0;
vector<pair<int, int>> v;
for(int i = 1; i <= n; i++){
cin >> p[i];
if(p[i] == i) k = -1;
else if(p[i] > i){
c[p[i]]--;
... | #include "bits/stdc++.h"
#include <chrono>
#include <random>
#define lli long long int
using namespace std;
#define mod 1000000007
#define mod1 998244353
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define INF 1000000000
#define common cout << "Case #" << w+1 << ": "
#define MAXN 20... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n, a[400020];
vector<pair<ll, ll>> v;
queue<int> pos;
string ans;
int main() {
scanf("%lld", &n);
ans.resize(2*n, 'p');
for(int i = 0; i < 2*n; i++) {
scanf("%lld", &a[i]);
v.emplace_back(a[i], i);
}
sort(v.beg... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<ll> dp(2, 1);
for (int i = 0; i < n; i++) {
string s;
cin >> s;
vector<ll> p(2);
swap(dp, p);
if (s == "AND") {
dp[0] = 2 * p[0] + p[1];
dp[1] = p[1];
} else {
dp[0] = p[0];
dp[1] = p[0]... |
#include "bits/stdc++.h"
#define ll long long int
#define MOD 1000000007
#define oo 1000000000000000000
#define forr(i,n) for(int i=0;i<n;i++)
#define fastio ios_base::sync_with_stdio(false); cin.tie(0) ; cout.tie(0);
#define all(x) x.begin(),x.end()
#define eb emplace_back
#define FF first
#define SS second
#define m... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << n - 1 << endl;
} |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 rng(chrono::steady_cloc... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<int> vz;
typedef vector<vz> vvz;
typedef pair<ll, ll> pll;
#define sz(x) ll((x).size())
#define fo(i,n) for(ll i=0; i<(n); i++)
#define FO(i,a,b) for(ll i=(a); i!=(b); i+=(b)>(a)?1:-1)
#define pb push_back
#defin... |
#include <bits/stdc++.h>
#include <cmath>
#include <algorithm>
using namespace std;
//#pragma GCC optimize("Ofast")
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<st... | #include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <cmath>
using namespace std;
typedef long long ll;
const long double PI = (acos(-1));
const long long MOD = 1000000007;
static const int MAX_INT = std::numeric_limits<int>::max();
static cons... |
#include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
a += c;
if (a > b) puts("Takahashi");
else puts("Aoki");
} | #include <bits/stdc++.h>
#define fio ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define ll long long int
using namespace std;
int main()
{
fio;
ll tc,n,a,b,m,x,y,i,j,k,c;
//cin>>tc;
//while(tc--)
{
cin>>a>>b>>c;
if(a==b)
{
if(c==0)
cout<<"Aoki... |
#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);
else
{ long long int n=0;
while((a+(n*b))>(d*n*c))
{
n++;
}
cout<<n;
}
}
| #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define REP(i,a,b) for (int i = a; i <= b; i++)
#define ALL(c) c.begin(), c.end()
#define T... |
// ||| ||| ||||||| |||| ||| ||| ||||||| ||||
// ||| ||| ||| ||||| ||| || ||| |||
// ||||| ||||||| ||| ||| ||| ||||||| |||
// ||| ||| ||| ||| ||||| ||| |||
// ||| ||| ||||||| ||| |||| ... | #line 1 "c.cpp"
/*
Author : MatsuTaku
Date : 01/02/21
*/
#include <bits/stdc++.h>
using namespace std;
#line 2 "/mnt/c/Users/tkmma/competitive_programming/CPBF/library/include/cpmacro.hpp"
#define rep(i, n) for (int i = 0; i < (n); i++)
using lint = long long int;
template<typename T>
using vvec = ... |
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define INF 100000000
#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define repp(i, n, s) for (int i = (int)(n); i >= (int)(s); i--)
#define mp make_pair
#define tp make_tuple
typedef pa... | #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;
int main() {
int N,K;
cin >> N >> K;
vector<int> a(N);
for (int i = 0; i < N; i++){
cin >> a.at(i);
}
vector<int> hindo(N);
for (int i = 0; i < N; i++){
hindo.at(a.at(i))++;
}
vector<vector<int>>hako(K,vector<int>(0));
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define PI 3.14159265359
#define rep(i, n) for (int i = 0; i < (n); i++)
const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
int main() {
int n;
ll ans = 0;
string s;
cin >> n >> s;
vector<vector<int>> count(n + 1, vecto... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll t,n,s,k;
ll gcd(ll a,ll b){
if(b==0) return a;
return gcd(b,a%b);
}
ll exgcd(ll a,ll b,ll &x,ll &y){
if(b==0){
x = 1;
y = 0;
return a;
}
ll d = exgcd(b,a%b,x,y);
ll z = x;
x = y;
y = z-(a/... | #include<bits/stdc++.h>
#define pb push_back
#define fast ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define ll long long
#define LL long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define f first
#define s second
#define int long long
#define sz(x) (ll)(x.size())
using namespace std;
const... |
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iomanip> // setprecision
#in... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define mem(a,val) memset(a,(val),sizeof((a)))
#define FAST std::ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define decimal(n) cout << fixed ; cout << setprecision((n));
#define mp make_pair
#define eb emplace_ba... |
#include <algorithm>
#include <iomanip>
#include <iostream>
#include <string>
#include <string.h>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, init, end) for(ll i = init; i < end; i++)
#define REP(i, init, end) for(ll i = init; i < end + 1; i++)
#define rev(i, end, init) for(ll i = init ... | # include<iostream>
# include <algorithm>
# include <queue>
# include <vector>
using namespace std;
int n;
long long a[200010],b[200010];
long long c[200010];
int main(void)
{
scanf("%d",&n);
for (int i=1;i<=n;i++)
scanf("%lld",&a[i]);
for (int i=1;i<=n;i++)
scanf("%lld",&b[i]);
long long ans =... |
#include<stdio.h>
#include<iostream>
using namespace std;
int main()
{
string a,b;
cin>>a>>b;
int sum=0;
int sum2=0;
for(int i=0;i<a.size();i++){
sum=sum+(a[i]-'0');
}
for(int i=0;i<b.size();i++){
sum2=sum2+(b[i]-'0');
}
if(sum>sum2) cout<<sum<<endl;
else if(sum2>... | #pragma GCC optimize("Ofast")
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
int sum(int n){
int s=0;
while(n>0){
s+=n%10;
n/=10;
}
return s;
}
void solve() {
int a,b; cin>>a>>b;
cout<<max(sum(a),sum(b));
}
int32_t main() {
#ifndef ONLINE_JUD... |
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<string>
#include<algorithm>
#include<queue>
#include<vector>
#include<set>
#include<map>
using std::cin;using std::cerr;
using std::max;using std::min;
#define N 100005
#define ll long long
#define db double
#define dbg1(x)... | #include<bits/stdc++.h>
#define rint register int
using namespace std;
int n,a[1010000];
int main(){
int T;
cin>>T;
while(T--) {
cin>>n;
for(rint i=1;i<=n;++i) cin>>a[i];
sort(a+1,a+n+1);
if(n&1) {cout<<"Second\n";}
else {
int fl=0;
for(rint i=2;i<=n;i+=2){
if(a[i]!=a[i-1]) {cout<<"First\n",fl=1... |
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define drep(i,j,n) for(int i=0;i<(int)(n-1);i++)for(int j=i+1;j<(int)(n);j++)
#define trep(i,j,k,n) for(int i=0;i<(int)(n-2);i++)for(int j=i+1;j<(int)(n-1);j++)for(int k=j+1;k<(i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using WGraph = vector<vector<pair<int, ll>>>;
template<class T>inline bool chmax(T &a, const T &b) { if (b > a) { a = b; return true; } return false; }
template<class T>inline bool chmin(T &a, const T &b) { if (b < ... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
int x;
cin >> x;
cout << max(x, 0) << endl;
return 0;
} | #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 = long 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 boo... |
#include<iostream>
#include<deque>
using namespace std;
int main(){
deque <char> s;
char c;
int r=0;
while((c=getchar())!='\n'){
if(c=='R'){
r^=1;
continue;
}
if(r==0){
if(s.empty()) s.push_back(c);
else{
if(c==s.back()) s.pop_back();
else s.push_back(c);
}
}else{
if(s.empty()) s.... | #include<bits/stdc++.h>
using namespace std;
int main()
{
long long t;
cin>>t;
while(t--){
long long n;
cin>>n;
if(n%2==1) cout<<"Odd"<<endl;
else if(n%4==0) cout<<"Even"<<endl;
else cout<<"Same"<<endl;
}
return 0;
} |
//order_of_key(k): Number of items strictly smaller than k .
//find_by_order(k): K-th element in a set (counting from zero).
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define full(x,n) x,x+n+1
#define full(x) x.begin(),x.end()
#define finish return 0
#define putb push_back
#define f first
#def... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<n; i++)
#define reps(i,s,n) for(int i=s; i<n; i++)
#define per(i,n) for(int i=n-1; i>=0; i--)
#define pers(i,n,s) for(int i=n-1; i>=s; i--)
#define all(v) v.begin(),v.end()
#define fi first
#define se second
#define pb push_back
#define si(v) int(v.size())
#defin... |
// #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define Graph vector<vector<ll>>
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1000000007;
// cout << fixed << setprecision(桁数);
int main(){
... | /*
* author: cyclexit
* start from: 2021-01-16 12:06
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, m;
cin >> n >> m;
vector<int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
vector<pair<i... |
#include<bits/stdc++.h>
using namespace std;
#define arep(i,x,n) for(int i=int(x);i<(int)(n);i++)
#define rep(i,n) for(long long i = 0;i < n;++i)
#define rrep(i,n) for(int i=int(n-1);i>=0;i--)
#define fs first
#define sc second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define coy c... | #include <math.h>
#include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
... |
// Problem : E - Unique Color
// Contest : AtCoder - AtCoder Beginner Contest 198
// URL : https://atcoder.jp/contests/abc198/tasks/abc198_e
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
// Delete the dynamically allocated memory
#include<bits/stdc++... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#defin... |
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize("-Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef int in;
#define int long long
const long double EPS=1e-9;
const int MOD=1e9+7;
const int N=1e6;
int n,m,arr1[200005],arr2[200005];
struct node{
int x,a,b;
};
vector<... | #include<iostream>
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<math.h>
#include<set>
#include<map>
#include<time.h>
#include<list>
#include<iomanip>
#include<string>
#include<sstream>
#include<string.h>
#include<queue>
#include<stack>
#include <numeric>
#include<ctype.h>
#define h 1010
#define infi ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.