code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(int)n; ++i)
using ll=long long;
int main() {
int n; cin >> n;
ll f=0, s=0;
rep(i,n) { ll a; cin >> a; f+=a; s+=a*a; }
cout << n*s-f*f << endl;
} | #include <bits/stdc++.h>
using namespace std;
long long x,y,i,m,c,r;
pair<long long,int> a[11];
int main() {
scanf("%lld%lld",&x,&y);
a[m++]={x-y/2,1};
a[m++]={x+1,-1};
a[m++]={-x-(y-1)/2,1};
a[m++]={-x+(y-1)/2+1,-1};
if (y>1) {
a[m++]={x,1};
a[m++]={x+(y-2)/2+1,-1};
}
sort(a,a+m);
for (c=i=0;... |
#include <bits/stdc++.h>
using namespace std;
#define fast ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define ll long long
#define ull unsigned long long
#define pb push_back
#define pii pair<int,int>
#define pll pair<long,long>
#define vi vector<int>
#define vl... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll r,x,y;
cin >> r >> x >> y;
ll euqlid = x*x+y*y;
if(euqlid<r*r){
cout << 2 << endl;
return 0;
}
ll i = 1;
while(1){
if(euqlid<=i*i*r*r) break;
i++;
}
cout << i << endl;
} |
//ΔARC120D
#include<iostream>
#include<cstdio>
#include<fstream>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<bitset>
#include<cmath>
#include<cstring>
#include<cstdlib>
using namespace std;
typedef long long LL;
typedef double DB;
const int N = 444444;
int n,a[N],b[N],c[N];... | #include <bits/stdc++.h>
// clang-format off
using namespace std; using ll = long long; using ull = unsigned long long; using pll = pair<ll,ll>; const ll INF = 4e18;
// clang-format on
void print(ll v){
cout << v << endl;
}
ll calc(vector<pll> &task, ll x){
ll y = x;
for(auto tsk: task){
ll a=tsk.first;
l... |
#include<iostream>
using namespace std;
int main()
{
// 整数の入力
int N;
cin >> N;
double t[N], l[N], r[N], between[N];
int ans =0;
for (int i=0;i<N;i++) {
cin >> t[i] >> l[i] >> r[i];
if (t[i] == 1) {
}
else if (t[i] == 2) {
r[i... | #include <map>
#include <cmath>
#include <ctime>
#include <queue>
#include <cstdio>
#include <vector>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define LL long long
#define Lc(x) x << 1
#define Rc(x) x << 1 | 1
#define Int register int
#define Lowbit(x) ((x) &... |
//Let's join Kaede Takagaki Fan Club !!
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
#define int long long
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> ... | #include <bits/stdc++.h>
using namespace std;
namespace kuro {
template<typename Cap>
struct MaxFlow {
public:
MaxFlow(int n=0) : _n(0) {
add_vertices(n);
}
int add_vertex() {
++_n;
g.resize(_n);
return _n-1;
}
vector<int> add_vertices(int size) {
assert(size >= 0);
vector<int> res(... |
#include <iostream>
#include<string>
#include<cmath>
#include<algorithm>
#include<cctype>
#include<queue>
#include<deque>
#include<regex>
#include<stack>
#include<stdio.h>
#include<vector>
#include<set>
#include<map>
#include<iomanip>
#define rep(i,n) for(int i=0;i<n;i++)
typedef int long long ll;
using namespace std;... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define x first
#define y second
#define FOR(i, m, n) for (ll i(m); i < n; i++)
#define DWN(i, m, n) for (ll i(m); i >= n; i--)
#define REP(i, n) FOR(i, 0, n)
#define DW(i, n) DWN(i, n, 0)
#define F(n) REP(i, n)
#define FF(n) REP... |
#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 k;
cin >> k;
int ans = 0;
for (... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N;
cin >> N;
vector<int64_t> A(N);
rep(i, N) cin >> A.at(i);
sort(A.begin(), A.end());
int64_t ans = 0, min;
rep(i, N) {
if (i == 0) {
min = A.at(i);
} else {
ans += (A.... |
#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <climits>
#include <ctime>
... | #include<bits/stdc++.h>
#define int long long
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pi;
const int mod = 1e9 + 7;
const int nax ... |
// 论证: 差分a即可
// 构造: 把a_i平均分
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ldouble;
template<class T> bool chmin(T &x, const T &y) {
return x > y ? (x = y, true) : false;
}
template<class T> bool chmax(T &x, const T &y) {
return x < y ? (x = ... | #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define inp 200005
#define check exit(0)
#define nl cout<<endl;
#define mod 1000000007
#define ll long long int
#define trace(x) cerr<<#x<<" : "<<x<<endl;
#define jaldi ios_base::sync_with_stdio(false);cin.tie(NULL);c... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if ( A*A + B*B < C*C)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... |
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#includ... | #include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <set>
#include <cmath>
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
set<int> a;
set<int> b;
int ... |
/***Bismillahhirrahmannirrahim***/
/***coding is fun if u enjoy it***/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
using... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A,B,C,R;
cin >> A >> B >> C;
R = C*C - (A*A + B*B);
if (R > 0){
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} |
#include<bits/stdc++.h>
#define FastIO ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define uniq(v) (v).erase(unique(all(v)),(v).end())
#define sz(x) (int)((x).size())
#define fr first
#define sc ... | #include <bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
for(auto &x: a) cin >> x;
map<int, vector<int>> graph;
for(int i=0;2*i<n;i++) {
graph[a[i]].push_back(a[n-i-1]);
graph[a[n-i-1]].push_back(a[i]);
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(), (x).end()
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vector<bool>> vvb;
typedef vector<vector<int>> vvi;
typedef vector<vector<ll>> vvl;
typedef pair<int,int> pii;
typedef pair<ll... | /*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#include <cstdio>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstring>
#include <vector>
#include <numeric>
#include <iostream>
#include <random>
#includ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long i64;
typedef unsigned long long ui64;
typedef vector<i64> vi;
typedef vector<vi> vvi;
typedef pair<i64, i64> pi;
#define pb push_back
#define sz(a) i64((a).size())
#define all(c) (c).begin(), (c).end()
#define REP(s, e, i) for(i=(s); i < (e); ++i)
inlin... | #include<bits/stdc++.h>
using namespace std;
char x[66];
int l,d;
bool ok(long long ts,long long n)
{
long long now=0;
for(int i=0;i<l;i++)
{
now+=x[i];
if(now>ts)
return 0;
if(i<l-1 && now>ts/n)
return 0;
now=now*n;
}
return 1;
}
int main()... |
// main.cpp
// ervb
//
// Created by Kanak Gautam on 21/04/20.
// Copyright © 2020 Kanak Gautam. All rights reserved.
//
#include <iostream>
#include <cstdio>
#include <stdio.h>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <stack>
#include <map>
#include <un... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define rep1(i,n) for(int i=1;i<=(int)n;i++)
#define sp(n) cout << fixed << setprecision(n)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b... |
/**
* For the brave souls who get this far: You are the chosen ones,
* the valiant knights of programming who toil away, without rest,
* fixing our most awful code. To you, true saviors, kings of men,
* I say this: never gonna give you up, never gonna let you down,
* never gonna run around and desert you. Never gonna ... | #pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
#define int long long
using namespace std;
inline int read()
{
bool flag=1;
int x=0;
char c=getchar();
while(c<'0'||c>'9')
{
if(c=='-')
flag=0;
c=getchar();
}
while(c>='0'&&c<='9')
{
x=(x<<1)+(x<<3)+c-'0';
c=getchar();
}
return (flag?x:~(x-1));... |
#include <bits/stdc++.h>
#define XOX
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
using namespace std;
#define Time cerr << "Time Taken : " << (float)clock() / CLOCKS_PER_SEC << " secs" << endl
#define ll long long
#define beg() begin()
#define test int t=1; cin>>t; while(t--)
#define vll vecto... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vll = vector<ll>;
using vi = vector<int>;
using vb = vector<bool>;
using vs = vector<string>;
using pll = pair<ll, ll>;
using pii = pair<int, int>;
using vpii = vector<pii>;
using vpll = vector<pll>;
const ll LIN... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define P pair<int,char>
#define Tp tuple<int,int,int>
using Graph = vector<vector<P>>;
int main(){
int N,M; cin >> N >> M;
int a,b; char c;
Graph g(N+1);
rep(i,M){
cin >> a >> b >> ... | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
const int mod = 998244353;
const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
cerr << fixed << set... |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define dbl(k, x) fixed << setprecision(k) << (x)
template <typename _T>
inline void _DBG(const char *s, _T x) {
cerr << s << " = " << x << "\n";
}
template <typename _T, typename... args>
void _DBG(const c... | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define print(x) cout << (x) << '\n'
typedef long long ll;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
//const ll MOD = 1000000007;
const ll MOD = 998244353;
template <typename T> inline bool chmax(T &a, T b) {return a ... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define MOD 1000000007
#define pd push_back
#define sort(v) sort(v.begin(),v.end())
#define Sort(v) sort(v.begin(),v.end(),greater<int>())
#define display(s) for(auto val:s) cout<<val<<" "; cout<<endl;
#define displayMap(mymap) for(auto val:mymap) cout<... | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
/*
#include<vector>
#include<iostream>
//*/
using namespace std;
#define ll long long
#define yes {cout<<"Yes"<<endl;return 0;}
#define no {cout<<"No"<<endl;return 0;}
#define YES {cout<<"YES"<<endl;return 0;}
#define NO {cout<<"NO"<<endl;return 0;}
#define cyes {cout<<"... |
/* bimillahir rahmanir rahim...
* AUTHOR
* mubin_akib */
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair <int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef... | #include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <string.h>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#include <math.h>
#define ll long long
#define ull unsigned long long
using namespace std;
i... |
//pikuskd_32->42
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define ll long long
#define fr(i,s,e) for(ll i=s;i<=e;i++)
#define rfo(i,s,e) for(ll i=s;i>=e;i--)
#define f(x,m) for(auto x : m)
#define ff first
#define ss second
const ll INF = (1LL << 60) - 1;
#define pb push_back
#define pp pop_back
... | #include <iostream>
#include <iomanip>
#include <vector>
#include <cmath>
#include <algorithm>
#include <set>
#include <utility>
#include <queue>
#include <map>
#include <assert.h>
#include <stack>
#include <string>
using namespace std;
int power[31]={0};
string cmp(string s)
{
string res="";
for (int j=0; j<s.size(... |
#include <bits/stdc++.h>
using namespace std;
#define save_some_time ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define pb push_back
#define ll long long int
void V_in(vector <ll> &V, int n) {
for (int i = 0; i < n; i++) {
int a; cin >> a;
V.pb(a);
}
}
void V_out(vector <ll> V) {
for (int i = 0; i ... | #include <bits/stdc++.h>
#define ll long long
#define mod 1e9 + 7
using namespace std;
int main(){
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
ll n;cin>>n;
ll rem = n%100;
if(rem==0){
cout<<100;
}else{
cout<<100-rem;
... |
#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>
#define int long long
using namespace std;
const int O = 2e5 + 5;
int tree[2][O * 4], t[2][O * 4];
vector <int> val;
void Update(int id, int l, int r, int u, int v, int k){
if (l > u || r < u) return;
if (l == r){
tree[k][id] += val[l] * v;
t[k][id] += v;
re... |
#include <bits/stdc++.h>
#define REP(i, n) for (int i=0; i<(n); i++)
using namespace std;
typedef long long ll;
ll K, N, M, A[(int)1e5], B[(int)1e5];
ll check(ll x) {
ll sumL = 0, sumR = 0;
REP(i, K)
sumL += max(0LL, (M * A[i] - x + N - 1) / N);
REP(i, K)
sumR += (M * A[i] + x) / N;
return (sumL <= M && M <= ... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
const int maxn = 1e5+9;
int k,n,m;
ll A[maxn],B[maxn];
int main(){
cin>>k>>n>>m;
int sum=0;
priority_queue<pair<int,int>>q;
for(int i=1;i<=k;i++){
cin>>A[i];
B[i]=((1.0*m)/n)*A[i];
sum+=B[i];
q.push({abs(n*... |
//------------------------------------------
// C++ template
//------------------------------------------
#include <bits/stdc++.h>
#define lint long long int
using namespace std;
//typedef
//------------------------------------------
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef ... | #include<bits/stdc++.h>
using namespace std;
int main (){
ios::sync_with_stdio(0);cin.tie(0);
int a,b,c;
cin>>a>>b>>c;
if (a+c>=b+1) cout<<"Takahashi\n";
else cout<<"Aoki\n";
} |
/*input
4
4 2 3 1
2 3 2 4
*/
#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 tree<pair<int,int>, null_type, less<pair<int,int>>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#pragma GC... | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define ll long long int
#define sd(x) scanf("%lld",&x)
#define sdi(x) scanf("%d",&x)
#define sdc(c) scanf("%c",&c)
#define inf 1000000000000000000ll
#define pll pair<ll,ll>
#define pii pair<int,int>
#define fastio ios_base::sync_w... |
#include <algorithm>
#include <bitset>
#include <complex>
#include <ctime>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#in... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
typedef vector<int> vi;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
mt19937 mrand(random_device{}());
const ll mod = 1000000007;
int rnd(int x) {... |
#include<bits/stdc++.h>
typedef long long ll;
#define int ll
#define pii pair<int,int>
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define rrep(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
const double pi=acos(-1.0);
const double eps=1e-8;
const int INF=0x3f3f3f3f;
const int MAXN=1e5+10;
const int mod=1e9+7;
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
#define FOR(i, a, b) for(int i = (int)(a); i <= (int)(b); ++i)
#define FORR(i, a, b) for(int i = (int)(a); i >= (int)(b); --i)
#define ALL(c) (c).begin(), (c).end()
using ll = long long;
using VI = vector<int>;
using VL ... |
#include <bits/stdc++.h>
template <typename T> inline void rd(T& x) {
int si = 1; char c = getchar(); x = 0;
while(!isdigit(c)) si = c == '-' ? -1 : si, c = getchar();
while(isdigit(c)) x = x * 10 + c - 48, c = getchar();
x *= si;
}
template <typename T, typename... Args>
inline void rd(T& x, Args&... args) { rd(x... | # include <bits/stdc++.h>
using namespace std;
int a[10][10];
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int n, k;
cin >> n >> k;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
cin >> a[i][j];
}
}
vector<int> v;
for (in... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define ld long double
#define sd second
#define ft first
#define is in... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, k, n) for (int i = k; i < (int)(n); i++)
#define repd(i, n) for (int i = n-1; i >= 0; i--)
#define rrepd(i, k, n) for (int i = n-1; i >= (int)(k); i--)
#define all(x) (x).begin(),(x).end()
#define chmax(x,y... |
#include <bits/stdc++.h>
using namespace std;
int r1, c1, r2, c2;
void solve() {
if (r1 == r2 && c1 == c2) {
printf("0\n");
return;
}
if (r1 + c1 == r2 + c2 || r1 - c1 == r2 - c2 || abs(r1 - r2) + abs(c1 - c2) <= 3) {
printf("1\n");
return;
}
if ((r1 + c1 + r2 + c2) % 2 == 0 || abs(r1 - r2) ... | #include <bits/stdc++.h>
using namespace std;
int r1, c1, r2, c2;
bool is_in(int x, int y) {
if (r1 + c1 == x + y || c1 - r1 == y - x || abs(r1 - x) + abs(c1 - y) <= 3) return true;
return false;
}
int main() {
int ans;
scanf("%d%d%d%d", &r1, &c1, &r2, &c2);
if (r1 == r2 && c1 == c2) ans = 0;
... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define all(x) (x).begin() ,(x... | /*
Author: rafa45
Date: 28 Sep 2020
*/
#include<bits/stdc++.h>
#define ll long long
#define endl "\n"
#define mod 1000000007
using namespace std;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int i=0, j=0, n=0;
int c1=0, c2=0, cnt=0;
string s, sub;
cin >> n >> s;
for... |
#include<bits/stdc++.h>
#define ll long long int
#define lb long long double
#define mp make_pair
#define MOD 1000000007
#define pb push_back
#define ppi pair<ll,pair<ll,ll>>
#define F(i,n) for(ll i=0;i<n;i++)
#define w(t) ll t;cin >> t;while(t--)
using namespace std;
vector<ll> divisor;
void getDivisors(ll n)
{
... |
#include "bits/stdc++.h"
using namespace std;
int main()
{
int N;
cin >> N;
vector<int> A(N), B(N);
for (int i = 0; i < N; i++) {
cin >> A[i] >> B[i];
}
int min_A, min_B, min_A2, min_B2;
int min_AB = min(A[0] + B[0], A[1] + B[1]);
int idx_A = -1;
int idx_B = -1;
if ... |
// #pragma GCC target("avx") // CPU 処理並列化
// #pragma GCC optimize("O3") // CPU 処理並列化
// #pragma GCC optimize("unroll-loops") // 条件処理の呼び出しを減らす
// #define BEGIN_STACK_EXTEND(size) void * stack_extend_memory_ = malloc(size);void * stack_extend_origin_memory_;char * stack_extend_dummy_memory_ = (char*)alloca((1+(int)(((... | #include <iostream>
#include <vector>
#include <utility>
typedef long long ll;
int N,T;
double L,R;
using namespace std;
double eps = 1e-4;
int main() {
cin >> N;
vector<pair<double,double>> intervals;
for(int i = 0; i < N; i++) {
cin >> T >> L >> R;
if(T == 1) {
intervals.e... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
long long arr[n];
long long diff[n];
cin >> arr[0];
diff[0] = arr[0] - 1;
for (int i = 1; i < n; ++i) {
cin >> arr[i];
diff[i] = diff[i-1] + arr[i] - arr[i-1] - 1;
}
while (q--)... | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
#define FASTIO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define PRECISION cout << fixed << setprecision(20);
using namespace std;
template <typename SegNode>
struct SegTree {
vector<SegNode> tree, arr;
int n;
... |
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define endl "\n"
#define mod 1000000007
#define vec vector <ll>
#define vecp vector <pair<ll,ll>>
#define mp make_pair
#define A first
#define B second
#define PattSee ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
#define all(v) v.begin(),v.... | #include<bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int dp[n + 1];
dp[1] = 1;
for(int i = 2;i <= n;++i) {
int max_div = 1;
for(int d = 2;d <= sqrt(i);++d) {
if(i % d == 0) {
max_div = max(max_div, d);
max_div = max(... |
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std ;
typedef long long ll ;
const int mod=1000000007;
const int INF=1e9 ;
const int N=2e5 ;
ll AbsDiff(ll a[], int n)
{
if ( n < 2 ) return 0;
sort(a,a+n);
ll sum = 0;
int i;
for(i=n-1;i>=0;i... | #include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <se... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
//const ll INF = numeric_limits<ll>::max() / 4;
//const int INF = numeric_limits<int>::max() / 4;
int main() {
// ll N;
ll A, B, C, D;
cin >> A >> B >> C >> D;
ll b = A;
ll r = 0;
ll c = 0;
if(C * D <= B){
cou... | #include <iostream>
#include <cmath>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <tuple>
#include <utility>
#include <functional>
#include <set>
#include <map>
#include <bitset>
#include <list>
#include<iomanip>
using namespace std;
using ll = long long;
using UL... |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <set>
#include <sstream>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define reps(i, s, n) for (int i = s; i < n; i++)
#define d... | #include <iostream>
void print_mat(int h, int w, int* mat){
for(int i=0; i<h; i++){
for(int j=0; j<w; j++){
std::cout << mat[i*w + j] << " ";
}
std::cout << std::endl;
}
}
int main(){
int h, w;
std::cin >> h >> w;
bool* map = new bool[h*w];
int* dp = new i... |
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define all(x) begin(x), end(x)
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int n0 = 5003, mod = 998244353;
int h, w, k, dp[n0][n0], p[n0][n0], pw[n0 * n0];
char g[n0][n0];
void add(int & x, int y) {... | /*
Auther: ghoshashis545 Ashis Ghosh 😎
College: Jalpaiguri Govt Enggineering College
*/
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#include<algorithm>
#include<string>
using namespace std;
#define ll int
#define int long long
#define ld long double
#define f... |
#include<bits/stdc++.h>
template <typename _Tp>void read(_Tp &x){
char ch(getchar());bool f(false);while(!isdigit(ch))f|=ch==45,ch=getchar();
x=ch&15,ch=getchar();while(isdigit(ch))x=x*10+(ch&15),ch=getchar();
if(f)x=-x;
}
template <typename _Tp,typename... Args>void read(_Tp &t,Args &...args){read(t);read(args...);... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int f[11]={2,3,5,7,11,13,17,19,23,29,31};
int m[11]={0};
int n;
cin>>n;
long long daan=1;
for(int i=2;i<=n;i++)
{
int ans=i;
for(int c=0;f[c]<=n;c++)
{
if(ans%f[c]==0)
{
... |
#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const... | #include <iostream>
using namespace std;
using ll = long long;
int main() {
int A, B, W;
cin >> A >> B >> W;
int W_A, W_B;
W_A = W * 1000 / A;
W_B = W * 1000 / B;
if (W_A == W_B && W * 1000 % A != 0 && W * 1000 % B != 0) {
cout << "UNSATISFIABLE" << endl;
} else {
cout << (W*1000 + (B-1)) / B << ... |
#include<bits/stdc++.h>
using namespace std;
int f[1100];
int main()
{
memset(f,0,sizeof(f));
int k;cin>>k;int sum;bool flag=0;
for(int i=1;i<=k;i++)
{
cin>>sum;
if(sum<1||sum>k) {flag=1;continue;}
if(f[sum]==0) f[sum]++;
else flag=1;
}
if(flag==1) cout<<"No";
else cout<<"Yes";
return 0;
} | #include<bits/stdc++.h>
#define ll long long
#define x first
#define y second
#define pi pair
#define K 1000000007
using namespace std;
ll a[2000000];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll test_case=1;//cin>>test_case;
while(test_case--)
{
string n;cin>>n;
ll i=0,j=n.... |
#include <bits/stdc++.h>
using namespace std;
int main()
{int N, X, i{}, V, P, s{};
for (cin >> N >> X; ++i, cin >> V >> P;) if ((s += V * P) > 100 * X) cout << i, exit(0);
puts("-1");} | // Premature optimization is the root of all evil in programming - Knuth.
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define mod (int) (1e9+7)
void solve(){
ll n,x; cin>>n>>x;
x=x*100; ll curr=0,ans=-1;
for(int i=1; i<=n; i++){
ll a,b; cin>>a>>b;
a=a*b; curr+=a;
if(cu... |
#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 = ... | #include <bits/stdc++.h>
using namespace std;
string mu = "atcoder", s;
int wei = 0, anss = 0;
int Find(char a) {
for(int i = 0; i < s.size(); ++i) {
if(s[i] > a) return wei;
}
return 0x3f3f3f3f;
}
int main() {
int t; cin >> t;
while(t--) {
anss = 0x3f3f3f3f;
cin >> s;
if(s > mu) anss = 0;
if(s.size()... |
// Created by ...Rahul Chandra
#include <bits/stdc++.h>
#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 rep(i,n) for(int i=0;i<(n);++i)
#define repA(i,a,n) for(int i=a;i<=(n);++i)
#define ... | #include<iostream>
using namespace std;
int main(){
string s,ans="";
cin>>s;
for (int i=0;i<s.length();i++){
if (s[i]!='.') ans+=s[i];
else break;
}
cout<<ans<<endl;
} |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
//マクロ
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define BIT(i, n) for (int i = 0; i < (1 << n); i++)
typedef long long ll;
//const ll INF = 10000000010;
in... | #include<bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
std::vector<int> A(N);
std::vector<int> B(N);
for (int i = 0; i < N; ++i){
cin >> A[i];
}
for (int i = 0; i < N; ++i){
cin >> B[i];
}
int result = std::inner_product(
A.begin()... |
#include<bits/stdc++.h>
#define int long long
using namespace std;
int32_t main(){
ios_base::sync_with_stdio(NULL);
cin.tie(NULL);
cout.tie(NULL);
int a,b,c;
cin>>a>>b>>c;
int d=min(c,min(a,b));
cout<<a+b+c-d;
return 0;
} | #include<cstdio>
#include<iostream>
#include<cstring>
#include<string>
#include<cmath>
#include<algorithm>
#include<cstdlib>
#include<vector>
typedef long long ll;
using namespace std;
int a,b;
template<typename int_t>
void readx(int_t &x)
{
x=0; int_t k=1; char ch=0;
while (ch<'0' || ch>'9') { ch=getchar(); if (ch... |
#include <iostream>
#include <string>
#include <vector>
#include <list>
#include <algorithm>
#include <cmath>
#include <iomanip>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
int main()
{
char num[10];
rep(i, 10)
{
cin >> num[i];
}
int ans = 0;
rep(i, 10000)
{
int tmp = i;
bool b[10] ... | #include <algorithm>
#include <iostream>
using namespace std;
const int A = 200;
int kk[A + A + 1];
int main() {
int n; cin >> n;
long long ans = 0;
while (n--) {
int a; cin >> a, a += A;
for (int b = 0; b <= A + A; b++)
ans += (long long) ((a - A) - (b - A)) * ((a - A) - (b - A)) * kk[b];
kk[a]++;
}
... |
#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 <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <cstdio>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
ll N, M;
vector<ll> H, W;
const ll INF = 1e17;
ll fpsum[200005];
ll bpsum[200005];
int main()
{
ll an... |
/**
* author: longvu
* created: 06/24/21 10:08:58
**/
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define sz(x) ((int)x.size())
#define all(x) (x).begin(), (x).end()
const int INF = numeric_limits<int>::max();
const int nax = (int)(1000001);
const int mod = 1e9 + 7;
int dp[nax];
int3... | // Date: 2020-10-03
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef long double LD;
typedef vector<int> VI;
typedef pair<LL, LL> pll;
typedef pair<int, int> pii;
#define IO freopen("in.txt", "r", stdin);freopen("out.txt", "w", stdout)
#define FIO ios::sync_with_stdio(false);cin.tie(0);cout... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define FOR(i, n) for(int (i)=0; (i)<(n); (i)++)
#define FOR1(i, n) for(int (i)=1; (i)<=(n); (i)++)
#define FORI(i, n) for(int (i)=n-1; (i)>=0; (i)--)
template<class T, class U> void umin(T& x, const... | /*
* @Author: tusikalanse
* @Date: 2021-06-26 19:48:54
* @LastEditTime: 2021-06-26 20:04:29
* @LastEditors: tusikalanse
* @Description:
* @FilePath: /atcoder/abc/207/b.cpp
*/
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
LL gcd(LL a, LL b) {
return b == 0 ? a : gcd(b, a % b);
}
const i... |
#include <bits/stdc++.h>
#define SZ(v) ((int)(v).size())
using namespace std;
using ll = long long;
template<typename... Args>
void read(Args&... args)
{
((cin >> args), ...);
}
template<typename... Args>
void write(Args... args)
{
((cout << args << " "), ...);
}
template<typename... Args>
void writeln(Args... ar... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "/debug.h"
#else
#define db(...)
#endif
#define all(v) v.begin(), v.end()
#define pb push_back
using ll = long long;
const int NAX = 2e5 + 5, MOD = 1000000007;
vector<int> solveCase(int n, vector<int64_t> &a)
{
// TODO: edit here
db(n, a);
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define FOR(i, n) for(int (i)=0; (i)<(n); (i)++)
#define FOR1(i, n) for(int (i)=1; (i)<=(n); (i)++)
#define FORI(i, n) for(int (i)=n-1; (i)>=0; (i)--)
template<class T, class U> void umin(T& x, const U& y){ x = min(x, (T)y)... | #include <iostream>
#include <string>
#include <vector>
#include <utility>
using ll=long long;
using namespace std;
int main(){
int N;
cin>>N;
vector<int> A(N);
vector<int> B(N);
for(int i=0;i<N;i++){
cin>>A[i]>>B[i];
}
int MX=1e6;
int minA=MX;
int minB=MX;
for(int i=0;i... |
#include <fstream>
#include <iostream>
#include <algorithm>
#include <array>
#include <bitset>
#include <complex>
#include <functional>
#include <map>
#include <memory>
#include <numeric>
#include <optional>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#... | #include"bits/stdc++.h"
using namespace std;
using ll = long long;
const ll mod = 1000000007;
#define rep(i,m,n) for(ll i=m;i<n;i++)
int main() {
ll n;
string s;
cin >> n >> s;
ll ans = n;
vector<bool>f(n);
rep(i, 0, n-2) {
if (f[i] == 0&&f[i+1]==0&&f[i+2]==0) {
if (s[i] == 'f' && s[i + 1] == 'o' && s[i + 2... |
#include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_ll.hpp>
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define rrep(i,b,a) for(ll i=b;i>=a;i--)
#define fori(a) for(auto i : a )
#define all(a) begin(a), end(a)
#define set(a,b) memset(a,b,sizeof(a))
#define sz(a) a.size()
double pi=acos(-1);
#define ll long long
... | #pragma GCC diagnostic warning "-Wextra"
#pragma GCC diagnostic warning "-Wshadow"
#include <bits/stdc++.h>
using namespace std;
template <class A, class B> bool cmin(A& a, B b) { return a > b && (a = b, true); }
template <class A, class B> bool cmax(A& a, B b) { return a < b && (a = b, true); }
signed main() {
cin... |
#include<bits/stdc++.h>
using namespace std;
// #include <atcoder/all>
// using namespace atcoder;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define drep(i,n) for(int i = (n-1); i >= 0; i--)
#define all(v) (v).begin(),(v).end()
#define maxs(x,y) (x = max(x,y))
#define mins(x,y) (x = min(x,y))
template <class T> bo... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;++i)
#define repn(i,n) for(int i=1;i<=n;++i)
#define LL long long
#define pii pair <int,int>
#define pb push_back
#define fi first
#define se second
#define mpr make_pair
using namespace std;
const LL MOD=1e9+7;
LL t,N;
int main()
{
cin>>t>>N;
LL n=0;
... |
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("inline")
// #include<bits/stdc++.h>
#include<iostream>
#include<string>
using namespace std;
string dfs(int n,string s){
if(n == 1)return s;
while(n%3!=1){
string t;
for(int i=1;i<n... | #include<bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define fo(n1,n) for(int i=n1;i<n;i++)
#define Fo(i,k,n) for(i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define ll long long
#define si(x) scanf("%d",&x)
#define sl(x) scanf("%lld",&x)
#define ss(s) scanf("%s",s)
#define pi(x) printf("%d\n",x)
#define pl(x) p... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define range(a) a.begin(), a.end()
#define endl "\n"
#define Yes() cout << "Yes" << endl
#define No() cout << "No" << endl
#define MP make_pair
using P = pair<int, int>;
const... | /*
author: Maksim1744
created: 13.02.2021 15:00:56
*/
#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 <stdio.h>
#include <iostream>
#include <vector>
// #include <bits/stdc++.h>
#include <queue>
#include <algorithm>
#include <string>
#include <iomanip>
#include <cmath>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i,k,n) for(ll i=k; i<(ll)(n); i++)
int main(){
ll n; cin >> n;
... | #pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define debug(x) cerr << #x << ": " << x << endl
#define debug2(x, y) debug(x), debug(y)
#define repn(i, a, b) for(int i ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int maxn=2e3+5;
ll dp[maxn][maxn],sum[3][maxn*2],belong[maxn][maxn];
char buff[maxn][maxn];
const int mod=1e9+7;
int main() {
int n,m;cin>>n>>m;
for(int i=1;i<=n;i++) cin>>(buff[i]+1);
for(int i=1;i<=m;i++) ... | #include <cstring>
#include <cmath>
#include <algorithm>
#include <string>
#include <map>
#include <iostream>
#include <vector>
#include <queue>
#include <unordered_map>
#include <random>
#include <stack>
#include <set>
#include <list>
#include <unordered_set>
#define bug(x) cout<<"zdongdebug1: "<<x<<endl;
#define bug... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N ;
double X=0;
for(double i = 1; i < N; i++){
X += N/i;
}
cout << std::fixed << std::setprecision(12) << X << endl;
} | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e6;
typedef long long ll;
template<class T> T read()
{
T f = 1, k = 0;
char c = getchar();
while (c < '0' || c > '9')
{
if (c == '-')
f = -1;
c = getchar();
}
while (c >= '0' && c <= '9')
{
k = k * 10 + c - '0';
c = getchar();
}
return ... |
#include <iostream>
#include<algorithm>
using namespace std;
typedef unsigned long long ull;
string x;
ull m;
bool check(ull mid)
{
ull ans=0;
int flag=1;
for(int i=0;i<x.size();i++)
{
if(ans > m / mid) return false;
ans=ans*mid+(x[i]-'0');
}
return ans <= m;
}
int main()
{
... | #include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define reps(i, s, n) for (int i = (s); i < (int)(n); ++i)
#define all(obj) begin(obj), end(obj)
#define allr(obj) rbegin(obj), rend(obj)
#define cinv(a) rep(i,(int)a.size()) cin >> a[i]... |
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdlib>
#include<queue>
#include<set>
#include<cstdio>
#include<map>
#include<cassert>
using namespace std;
#define ll long long
#define reps(i, a, b) for(int i = a; i < b; i++)
#define rreps(i, a, b) for(int i = a-1; i >= b; i--)
#def... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int mod = 1e9 + 7;
const int N = 1e6 + 5;
int g[N];
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int l, r;
cin >> l >> r;
for (int i = 2; i <= r; i++) {
int x = ceil(1.0 * l / i), y = floor(1.0 * r / i);
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
#define all(x) (x).begin(),(x).end()
#define Sort(x) sort(all((x)))
#define X first
#define Y ... | #include"bits/stdc++.h"
//#include"atcoder.h"
#include<iostream>
using namespace std;
typedef long long ll;
#define rep(i,n) for (ll i = 0; i < (n); ++i)
const ll inf = ll(1e18) + 1;
const ll mod = 1000000007;
int main() {
ll n,m,t;
cin >> n >> m >> t;
vector<ll>a(m);
vector<ll>b(m);
rep(i,m) {... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int inf=0x3f3f3f3f;
const double pi=3.1415926535897932384626;
inline ll read(){
ll 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<<1)+(x<<3)+(ch^48);
ch=getchar();
}... | #include <bits/stdc++.h>
#define DEBUG if(0)
#define lli long long int
#define ldouble long double
using namespace std;
const int maxX = 72, maxPrimes = 20;
bool notPrime[maxX + 1];
vector<lli> primes;
const int maxN = 72;
lli a, b; int n;
int primesMask[maxN + 1];
lli memo[maxN + 1][1LL << maxPrimes];
lli solve(int ... |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#pragma GCC optimize ("-O3")
#define int long long
#define ld long double
#define endl "\n"
#define rep(i,begin,end) for (__typeof(end) i=begin-(begin>end); i!=(end)-(begin>end); i+=1-2*(begin>end))
#defin... | #include"bits/stdc++.h"
#define rep(i,n) for(ll i=0;i<n;++i)
#define ALL(x) x.begin(),x.end()
#define MOD 1000000007
#define INF INT_MAX
#define FLOAT_ANS setprecision(10)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; retur... |
#include <bits/stdc++.h>
#define pb push_back
#define ll long long
#define ts to_string
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define dbg(a); cerr<<#a<<"="<<(a)<<endl;
#define dbg2(a,b); cerr<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<endl;
#define dbgarr(a); for(auto elem:a)cerr<<elem<<" ";cerr<<endl;
#de... | #include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n%2 == 0) {
cout << "White" << endl;
} else {
cout << "Black" << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for(ll i=0;i<ll(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i, a, b) for(ll i=a;i<=ll(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=ll(b);i--)
int main() {
char S[4];
cin >> S;
... | #include <iostream>
using namespace std;
int main(){
string s;
cin>>s;
cout<<s[1]<<s[2]<<s[0];
} |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define mod ((int)1e9+7)
#define lim 1000000000000000007
#define lim1 18446744073709551615 //Unsigned
#define sq(a) ((a)*(a))
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define mms(v,i) memset(v,i,siz... | // "C:\Users\ianli\Desktop\CP\template\"
#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define F first
#define S second
#define MP make_pair
#define MTP make_tuple
typedef long long int ll;
constexpr int kN = 20;
bitset<kN> graph[kN];
int dp[1 << 18];
int main() {
//ios::sync_with_stdio(false);
... |
#include<bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int h,w;
cin>>h>>w;
vector<string> a(h);
vector<vector<int>> dp(h,vector<int>(w,0));
for(int i=0;i<h;i++)
cin>>a[i];
for(int i=h-2;i>=0;i--){
if((i+w-1... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define maxn 5005
int main()
{
int n,m;
cin>>n>>m;
vector<int> h(n),w(m);
for(int i=0;i<n;i++){
cin>>h[i];
}
for(int i=0;i<m;i++){
cin>>w[i];
}
sort(h.begin(),h.end());
ll pref[n]={0};
pref[0]=-h[0];
for(int i=1;i<n;i++){
... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const ll mod = 1000000007;
int main() {
ll T, N, A, B;
ll a, b, ans;
cin >> T;
ll l, r;
rep(i, T) {
cin >> N >> A >> B;
a = max(A, B);
b = min(A, B);
... | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if(a > b) {
a = b;
return 1;
}
return 0;
}
#define DEBUG
#ifdef DEBUG
templ... |
#include <set>
#include <unordered_set>
#include <iostream>
#include <stack>
#include <string>
#include <sstream>
#include <vector>
#include <map>
#include <cmath>
#include <numeric>
#include <algorithm>
#include <queue>
#include <bitset>
#define INFL 100100100100100100
#define INF 1100100100
using namespace std;
in... | #include <bits/stdc++.h>
using namespace std;
// #define int long long // intで書いたけど心配なときにlong longに変換する
struct Fast {Fast(){std::cin.tie(0);ios::sync_with_stdio(false);}} fast;
/* short */
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define Fi first
#define Se second
#define ALL(v) begin(v), end... |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define int long long
#define mod 1000000007
#define FAST ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define f(i,n) for(int i=0;i<n;i++)
#define fp(i,k,n) for(int i=k;i<=n... | // Sakhiya07 - Yagnik Sakhiya
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define all(x) x.begin(),x.end()
#define pll pair<ll,ll>
#define ff first
#define ss second
#define MOD 1000000007
const int N = 100005;
void solve()
{
ll n;
cin >> n;
map<ll,ll> y... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a, b, c;
cin >> a >> b >> c;
if(a != b && b != c && c != a){
cout << 0 << endl;
}else if(a == b){
cout << c << endl;
}else if(b == c){
cout << a << endl;
}else if(a == c){
cout << b << endl;
}
} | #include<bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define ll long long
#define rep(i,n) for(int i = 0; i < int(n); i++)
#define vi vector<int>
using namespace std;
const int INF = 1001001001;
const int MOD = 1e9+7;
template<class T> inline bool chmax(T &a, const T &b){ if(a<b){ a=b; return 1; } return 0; }
t... |
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define inp 200005
#define check exit(0)
#define nl cout<<endl;
#define mod 1000000007
#define ll long long int
#define trace(x) cerr<<#x<<" : "<<x<<endl;
#define jaldi ios_base::sync_with_stdio(false);cin.tie(NULL);c... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i = (m); i <= (n); i++)
#define zep(i,m,n) for(ll i = (m); i < (n); i++)
#define rrep(i,m,n) for(ll i = (m); i >= (n); i--)
#define print(x) cout << (x) << end... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define rep(i, n) for(int i=0;i<(int)(n);++i)
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
cin >> n;
vector<int> vec(n);
vector<ll> re_sum(n);
rep(i,n) {
cin >> vec[i];
}
sort(vec.begin(), ... | #include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
using ll=long long;
using ld=long double;
using pll=pair<ll, ll>;
//using mint = modint1000000007;
#define rep(i,n) for (ll i=0; i<n; ++i)
#define all(c) begin(c),end(c)
#define PI acos(-1)
#define oo 2e18
template<typenam... |
//#ifdef DEBUG
//#define _GLIBCXX_DEBUG
//#endif
//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long ll;
const int maxN = 1005;
int dist[maxN][maxN];
int a[maxN];
int b[maxN];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
//... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
struct A {
int id;
int l, r;
A(int id) : id(id) {
l = r = 0;
}
};
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
int n;
cin >> n;
vector<A> v;
for (int i = 1; i <= n; ++i) {
... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
// --------------------------------------------------------
template<class T> bool chmax(T& a, const T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T& a, const T b) { if (b < a) { a = b; return 1... | #include<bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007LL
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define vi vector<ll>
#define vvi vector<vi>
#define SHIFT(n) (1LL<<((ll)n))
#define ALL(a) (a).begin(),(a).end()
#define Max(a) (*max_eleme... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,n,m) for(int i=(int)(n); i<=(int)(m); i++)
#define RFOR(i,n,m) for(int i=(int)(n); i>=(int)(m); i--)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define RITR(x,c) for(__typeof(c.rbegin()) x=c.rbegin();x!=c.rend... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n, m;
cin >> n >> m;
vector<int> A(n + m);
for (auto &a: A)
cin >> a;
sort(A.begin(), A.end());
vector<int> B;
for (const auto &a: A){
if (B.size() > 0 and B.back() == a)
B.pop_back();
... |
#include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 4000000000000000000 //オーバーフローに注意
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
ll gcd(ll x,ll y){
x = abs(x);
y = abs(y);
if(x < y){
swap(x,y);
}
if(y == 0)... | #include<bits/stdc++.h>
using namespace std;
int main(){
long long n;
cin >> n;
vector<int> a(n);
for(auto &nx : a){cin >> nx;}
long long res1=(n*(n-1)/2);
sort(a.begin(),a.end());
a.push_back(-1);
long long cnt=1;
for(int i=0;i<n;i++){
if(a[i]!=a[i+1]){
res1-=((cnt*(cnt-1))/2);
c... |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> P;
const int INF = 1e9;
const int MOD = 1e9+7;
int main(){
string s;
cin >> s;
rep(i,s.size()){
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define FORR(i,m,n) for(int i = m - 1; i >= n; i--)
#define ALL(v) v.begin(), v.end()
#define itn int
#define Yes() cout << "Yes" ... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ii pair <int,int>
#define F first
#define S second
#define ever (;;)
const int N = 100100;
int n,m,x,y,par[N];
ll dis[N],inf=1e18;
vector < pair <int,ii> > adj[N];
priority_queue < pair < ll , int > , vector < pair < ll , int > > , greater < ... | #include "bits/stdc++.h"
/*
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
using namespace __gnu_pbds;
// a new data structure defined. Please refer below
// GNU link : https://goo.gl/WVDL6g
typedef tree<int, null_type, less<int>, rb_... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
const int MAX_P = 3;
int fact[MAX_P];
int extgcd(int a, int b, int& x, int& y) {
int d = a;
if (b != 0) {
d = extgcd(b, a % b, y, x);
y -= (a / b) * x;
} else {
... | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define all(x) (x).begin(),(x).end()
#define uniq(v) (v).erase(unique(all... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define re... | #include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); i++)
#define R(i, j, k) for(int i = (j); i >= (k); i--)
#define ll long long
#define sz(a) ((int) a.size())
#define vi vector<int>
using namespace std;
const int N = 2e5 + 7;
int n, a[N], b[N], r1[N], r2[N];
ll sum;
int main() {
ios::sync_with_stdio... |
#include<bits/stdc++.h>
using namespace std ;
#define int long long int
const int mod = 998244353;
void TESTCASE(){
int H, W; cin >> H >> W;
vector<vector<char>> grid(H+1, vector<char>(W+1, '.'));
int K; cin >> K;
for(int q = 1, h, w; q <= K; q++){
char c;
cin >> h >> w >> c;
g... | #include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#define dlog(str) cout << "====" << str << endl;
#else
#define dlog(str)
#endif
#define INF 999999999
#define MOD 998244353
#define LLI long long int
#define REP(i, n) for(int i = 0, i##_l = (n); i < i##_l; i++)
#define FOR(i, s, e) for(int i = s, i##_l = (e);... |
#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<ll,ll>;
const ll MAX = 1000000000000;
double p;
int main() {
string s;
cin >> s;
int n[10] = {0};
rep(i,s.size()){
n[s[i]-'0'] ++;
}
bool flag = false;
if(s.size() ==1)... | #include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#include <math.h>
#include <iomanip>
#include <limits>
#include <list>
#include <queue>
#include <tuple>
#include <map>
#include <stack>
#include <set>
#include <bitset>
#include <functional>
#include <cassert>
using namespa... |
/*
Created by: Amit Kumar at 22:29 on 16 Mar 21
*/
#include <bits/stdc++.h>
#ifdef LOCAL
#include "debug.h"
#else
#define db(...)
#endif
using namespace std;
#define ll long long
#define mod 1000000007
#define S(x, n) memset(x, n, sizeof(x));
#define pb(x) push_back(x)
#define all(x) x.begin(), x.end()
#define NIL -1... | #include <cstdio>
using namespace std;
const int max_n = 200000;
char s[max_n+1], op[max_n+1];
bool wn[7] = {}, nwn[7];
int main()
{
int n, cur = 1;
bool sl1, sl2;
scanf("%d%s%s", &n, s, op);
wn[0] = true;
for (int i = n - 1; i >= 0; i--)
{
for (int j = 0; j < 7; j++)
nwn[j] = wn[j];
if (op[i] == 'A')... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using P = pair<int, int>;
int main(){
long double x,y,r; cin>>x>>y>>r;
r += 1e-14;
int lx = ceil(x-r);
int rx = floor(x+r);
ll ans = 0;
for(int i=lx; i<=rx; i++){
dou... | #include<bits/stdc++.h>
using namespace std;
namespace Sakurajima_Mai{
#define ms(a) memset(a,0,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)
#define ... |
#include <bits/stdc++.h>
namespace IO{
char buf[1000000],*p1,*p2;
inline char getc(){
if(p1==p2) p2=(p1=buf)+fread(buf,1,1000000,stdin);
return p1==p2?EOF:*(p1++);
}
template<typename tp>inline void r(tp &n){
n=0;char c=getc();
while(!isdigit(c)) c=getc();
while( ... | #include "bits/stdc++.h"
#define MOD 998244353
#define rep(i, n) for(ll i=0; i < (n); i++)
#define rrep(i, n) for(ll i=(n)-1; i >=0; i--)
#define ALL(v) v.begin(),v.end()
#define rALL(v) v.rbegin(),v.rend()
#define FOR(i, j, k) for(ll i=j;i<k;i++)
#define debug_print(var) cerr << #var << "=" << var <<endl;
#define DUM... |
#include <bits/stdc++.h> //Header Files
#define ll long long int
#define mod 1000000007
#define endl "\n"
using namespace std;
template <class T>
void out(int t, T ans)
{
cout << "Case #" << t << ": " << ans << endl;
}
template <class T>
void out(int t, T ans[])
{
cout << "Case #" << t << ": ";
for (T v... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n; cin >> n;
vector<ll> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
ll ans=0;
sort(v.begin(), v.end());
for (ll i = 0; i < n; i++) {
ans += (2ll*i - n + 1ll) * v[i];
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int N, M; cin >> N >> M;
if(N == 1 && M == 0){
cout << 1 << " " << 2 << endl;
return 0;
}
if(M < 0){
cout << -1 << endl;
... | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#defin... |
#include <bits/stdc++.h>
#define eprintf(args...) fprintf(stderr, args)
#define rep(i, n) for (int i = 0; i < (int)(n); ++ i)
const int mxn = 1e5 + 5;
const int mod = 1e9 + 7;
int f[mxn];
int n, a[mxn];
int main() {
scanf("%d", &n);
rep(i, n) scanf("%d", &a[i]);
f[0] = 1; f[1] = 2;
for (int i = 1; i < n; ++ i) f... | #include<ctime>
#include<cstdio>
#include<cctype>
#define ll long long
using namespace std;
const ll N=1e5+7;
const ll p=1e9+7;
ll read(){
char c;ll x=0,f=1;
while(!isdigit(c=getchar()))f-=2*(c=='-');
while(isdigit(c))x=x*10+f*(c-48),c=getchar();
return x;
}
ll n,res,x,f[N],g[N],h[N];
int main(){
n=read(),h[1]=0,h... |
// Problem: D - Game in Momotetsu World
// Contest: AtCoder - Mynavi Programming Contest 2021（AtCoder Beginner Contest 201）
// URL: https://atcoder.jp/contests/abc201/tasks/abc201_d
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include<bits/stdc++.h>
using namespac... | #include <bits/stdc++.h>
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll I=1167167167167167167;
ll Q=1e9+7;
#define rep(i,a) for (ll i=0;i<a;i++)
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> ... |
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#in... | #include <bits/stdc++.h>
struct __fastio__ { __fastio__ () { std::ios::sync_with_stdio(false); std::cin.tie(nullptr); } } __fast_io__;
template<class T, class U> bool chmin (T &a, const U &b) { if (a > b) { a = b; return 1; } return 0; }
template<class T, class U> bool chmax (T &a, const T &b) { if (a < b) { a = b; ret... |
#include<bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(v) v.begin(),v.end()
#define PI acos(-1)
typedef long long ll;
ll MOD=1000000007;
ll gcd(ll x,ll y){
if(y==0) return x;
else return gcd(y,x%y);
}
ll lcm(ll x,ll y){
return x/gcd(x,y)*y;
}
... | #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;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int getRand(int l, int r)
{
uniform_int_distribution<int> uid(l, r);
return uid(rng);... |
#include <stdio.h>
#include <map>
int x[100010],y[100010];
int type[100010];
std::map<int,int> check;
int main()
{
int a,b;
scanf("%d%d",&a,&b);
for(int i=1;i<=a;i++) scanf("%d",&x[i]);
for(int i=1;i<=a;i++) scanf("%d",&y[i]);
x[0] = 0, y[0] = 0;
x[a+1] = b+1, y[a+1] = b+1;
for(int i=1;i<=a;i++)
{
if(x[i]>y... | #include<bits/stdc++.h>
using namespace std;
using lli = long long int;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
const int MOD = 1000000007;
const int MOD1 = 998244353;
const int maxn = 100010;
const int lim = (int)1e9;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define reg register
#define x1 x11
#define x2 x22
#define y1 y11
#define y2 y22
#define z1 z11
#define z2 z22
const int mod=1e9+7;
const int INF=2e16;
const int maxn=5e5+5;
const double Pi=acos(-1.0);
double Exp=1e-6;
inline int read()
{
int x=0,f=1;... | #include <iostream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <utility>
#include <algorithm>
#include <cmath>
#include <climits>
#include <iomanip>
#include <queue>
#include <stack>
#include <ctype.h>
using namespace std;
typedef long long ll;
const int INF = (1<<30)-1;
const ll LINF... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.