code_file1 stringlengths 87 4k | code_file2 stringlengths 85 4k |
|---|---|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
double x, y;
complex<double> a, b;
cin >> n;
cin >> x >> y;
a = {x, y};
cin >> x >> y;
b = {x, y};
auto m = (a + b) / 2.0;
auto res = m + (a - m) * polar(1.0, M_PI * 2.0 / n);
cout << setprecision(9) << r... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mit map<int,int>::iterator
#define sit set<int>::iterator
#define itrm(g,x) for(mit g=x.begin();g!=x.end();g++)
#define itrs(g,x) for(sit g=x.begin();g!=x.end();g++)
#define ltype int
#define rep(i,j,k) for(ltype(i)=(j);(i)<=(k);(i)++)
#define r... |
/*
#pragma GCC optimize(2)
#pragma GCC optimize(3,"Ofast","inline")
*/
#include<bits/stdc++.h>
#define ALL(x) (x).begin(),(x).end()
#define ll long long
#define db double
#define ull unsigned long long
#define pii_ pair<int,int>
#define mp_ make_pair
#define pb push_back
#define fi first
#define se second
#define rep(i... | #include <cctype>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <ios>
#include <iostream>
#include <iterator>
#include <string_view>
#include <utility>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
#include <climits>
#include <cmath>
#include <sstream>
#inc... |
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#pragma GCC optimize ("-O3")
using namespace std;
void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long ... | #include<bits/stdc++.h>
#define rep(i, n) for(int i = 0;i < (n);i++)
using namespace std;
const int INF = 10000000;
using ll = long long;
int main() {
int n, m, q;
cin >> n >> m >> q;
vector<int> x(m);
vector<pair<int, int>> vw(n);
rep(i, n) cin >> vw[i].second >> vw[i].first;
rep(i, m) cin... |
#include <bits/stdc++.h>
#define int long long
#define x first
#define y second
using namespace std;
void solve(){
int n;
string s,t;
cin>>n>>s>>t;
vector <int> aw {0,1,1,1,1,1,1},tw {1,0,0,0,0,0,0};
for (int i=n-1; i>=0; i--){
vector <int> temp {0,0,0,0,0,0,0};
if (t[i]=='A'){
for (int j=0; j<7; j++){
... | #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<(n);i++)
#define MAX_N 200001
int par[MAX_N]; //親
int rnk[MAX_N]; //木の深さ
int siz[MAX_N]; //木のサイズ
typedef long long ll;
//n要素で初期化
void init(){
REP(i,MAX_N){
par[i]=i;
rnk[i]=0;
siz[i]=1;
}
}
//木の根を求める
int find... | #include <bits/stdc++.h>
using namespace std;
inline int read(){
int f=1,r=0;char c=getchar();
while(!isdigit(c))f^=c=='-',c=getchar();
while(isdigit(c))r=(r<<1)+(r<<3)+(c^48),c=getchar();
return f?r:-r;
}
int main(){
cout<<max(read(),0);
return 0;
} |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using P = pair<int,int>;
const int Max_W = 1000000, INF = 1e9;
int dpmin[Max_W+1], dpmax[Max_W+1];
int main(){
int a, b, w;
cin >> a >> b >> w;
w *= 1000;
fil... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using LL = long long;
using P = pair<int,int>;
const long double INF = 2e12;
const long double eps = 1e-12;
int N, M, K;
vector<int> A;
long double solve(long double ans){
vector<long double> dp(N + 1), sum(N + 1);
rep... |
//-------------------------------------
//| -<{ Besme llahe Rahmane Rahim }>- |
//-------------------------------------
#include <bits/stdc++.h>
#define pb push_back
#define fast ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define sz(x) (int)(x).size()
#define all(c) (c).begin(),(c).end()
using namespace std;
//#... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)//iをaからn
#define per(i,n,a) for (int i=a-1;i>=n;i--)//iをnからa
#define db(x) cout << #x << " = " << x << endl
#define db2(x, y) cout << "(" << #x << ", " << #y << ") = (" << x << ", " << y << ")\n"; //デバッグ用
#define all(x) (x).begin(), (... |
#include <bits/stdc++.h>
using namespace std;
std::vector<std::string> split(std::string str, char del)
{
int first = 0;
int last = str.find_first_of(del);
std::vector<std::string> result;
while (first < str.size())
{
std::string subStr(str, first, last - first);
result.push_back(... | #include<bits/stdc++.h>
using namespace std;
#define int long long
int32_t main()
{
string s;
cin>>s;
int ans;
int n=s.length();
if(n&1) ans=pow(10,n/2)-1;
else
{
int x = stoi(s.substr(0,n/2));
int y = stoi(s.substr(n/2,n/2));
if(x<=y) ans=x;
else ans=x-1;
... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
struct edge{ ll to, cost; };
#defi... | #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 <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
const int RANGEMAX = 10000;
struct record{
int id;
int x;
int y;
int r;
bool operator<(const record &other) const {
return this->r < other.r;
}
bool operator>(const record &other) const {... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for(int i=0; i<(n); ++i)
#define FOR(i, a, b) for(int i=(a); i<(b); ++i)
#define FORR(i, a, b) for... |
#include<map>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define N 600006
#define LL long long
#define int long long
using namespace std;
int n,m;
int a[N];
map<int,int>mp;
LL ans;
inline int qr()
{
char a=0;int w=1,x=0;
while(a<'0'||a>'9'){if(a=='-')w=-1;a=getchar();}
while(a<='9'&... | #include <bits/stdc++.h>
using namespace std;
#define int long long
using vec_int = vector<int>;
using P = pair<int,int>;
using T = tuple<int,int,int>;
using ll = long long;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int charToInt(char c){
char zero_num = '0';
return (int)c - (int)zero_num;
}
signed ... |
#include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define rrep(i,b,a) for(int 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 lon... | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <map>
#include <cmath>
#include <cstring>
#include <stack>
#include <queue>
using namespace std;
typedef long long LL;
const LL LINF = 0x3f3f3f3f3f3f3f3f;
const int INF = 0x3f3f3f3f;
const double Pi = acos(-1.0);
double N, a, b, c, d, e, f, A1, A2,... |
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cst... | #include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
#define rep(i,x,y) for(ll i=(x);i<(y);i++)
#define rrep(i,x,y) for(ll i=(ll)(y)-1;i>=(x);i--)
#define all(x) (x).begin(),(x).end()
#define itrout(x) for(int i=0;i<x.size();i++) {cout << x[i] << (i==x.size()-1 ? "\n" : " ");}
#ifdef LOCAL
#define de... |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <iomanip>
#include <cstdio>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cstdlib>
#include <queue>
#include <stack>
#include <bitset>
us... | //#pragma GCC optimize ("O3")
//#pragma GCC target ("sse4")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC target("avx,avx2,fma")
#include <algorithm>
#include <array>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstring>
#include <functional>
#include <iom... |
#include<ctime>
#include<cmath>
#include<cstdio>
#include<cctype>
#include<algorithm>
#define ll long long
using namespace std;
const double k=(sqrt(5)-1)/2;
const double t=k;
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... | #include <cmath>
#include <cstdio>
#include <stack>
using namespace std;
int main() {
long long N;
scanf("%lld", &N);
stack<int> ans;
long long x, y;
x = N;
__float128 phi = (1 + sqrtf128((__float128)5)) / 2;
y = (long long)(x / phi) + 1;
for (; x != 0 || y != 0;) {
if (y == 0) {
ans.push(1);
x--;
} ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
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; }
const int INF = (1<<30)-1;
const int M... | /*
これを入れて実行
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... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
cin.tie(nullptr)->sync_with_stdio(false);
int t,n;
cin >> t >> n;
vector<int>arr;
set<int>s;
set<int>mods;
int cur = 100+t;
while(true){
if(s.find(cur/100-1)==s.end()&&cur!=100+t){
arr.push_back(cur/100-1);
}
if(cur%100=... | #include <bits/stdc++.h>
#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, a, b) for (int i = a; i < b; ++i)
#define FORR(i, a, b) for (int i = b - 1; i >= a; --i)
#define SORT(v) sort(v.begin(), v.end())
#define SORTR(v) sort(v.rbegin(), v.rend())
#define ... |
#ifdef __GNUC__
#pragma GCC diagnostic ignored "-Wunused-result"
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif
#include <algorithm>
#include <cmath>
#include <cstring>
#include <cctype>
#include <iostream>
#include <sstream>
#include <numeric>
#include <map>
#include... | #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"
using namespace std;
int main()
{
string s;
cin >>s;
reverse(s.begin(),s.end());
for(const auto c:s)
{
if(c=='6')
{
cout<<"9";
}
else if(c=='9')
{
cout<<"6";
}else{
cout<<c;
}
}... | #include <bits/stdc++.h>
using namespace std;
#define SZ(x) (int)(x).size()
#define REP(i,n) for(int i=0;i<(n);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REPR(i,n) for(int i=(n)-1;i>=0;i--)
#define ALL(s) (s).begin(), (s).end()
#define so(V) sort(ALL(V))
#define rev(V) reverse(ALL(V))
#define uni(v) v.er... |
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define int long long
#define ld long double
#define ff first
#define ss second
#define BS binary_search
#define all(c) (c).begin(),... | #include<bits/stdc++.h>
#define ls(p) p<<1
#define rs(p) p<<1|1
#define de(x) cout<<#x<<" = "<<x<<endl;
#define rep(i,a,b) for(int i = (a);i<=(b);++i)
#define endl '\n'
#define PI acos(-1.0)
#define pb push_back
using namespace std;
void debug(){freopen("data.in","r",stdin);freopen("data.out","w",stdout);}
typedef long... |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long N;
cin >> N;
vector<long long> A(N);
for(int i = 0; i < N;i++){
long long a = 0;
cin >> a;
A.at(i) = a;
}
sort(A.begin(), A.end());
reverse(A.begin(),A.end());
long long ans =0;
for(int i = 0; i < N ;i++){
ans += A.at(i)*((N-... | ///Bismillahir Rahmanir Rahim
#include<bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(false);cin.tie(NULL)
#define int long long
#define pb push_back
#define pp pop_back
#define mp make_pair
#define pi 2*acos(0.0)
#define sca... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=2e5+5;
int res=INT_MIN,a[N],mark[N],m,n;
vector<int> adj[N];
void dfs(int u){
for(int v: adj[u]){
if(mark[v]==INT_MIN)dfs(v);
mark[u]=max(mark[u],mark[v]);
res = max(res,mark[u]-a[u]);
}
mark[u]=max(a[u],mark[u]);
}
... | #include <bits/stdc++.h>
#define speedup ios::sync_with_stdio(false),cin.tie(nullptr),cout.tie(nullptr),cout.precision(12)
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_sta... |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep2(i, x, n) for(int i = x; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int N;
string S;
cin >> N >> S;
int ans = 0;
for(int i = 0; i < N - 1; i++) {
int a = 0, t = 0, g = 0, c = 0;
... | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define repi(i,a,b) for(ll i=... |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repx(i, x, n) for (ll i = (ll)(x); i < (ll)(n); i++)
#define repr(i, n) for (ll i = ((ll)(n)-1); i >= 0; i--)
#define reprx(i, x, n) for (ll i = ((ll)(n)-1); i >= (ll)(x); i--)
#define all(x) ... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
# define M_PI 3.14159265358979323846
const int M=1e9+7;
long long mod(long long x){
return ((x%M + M)%M);
}
... |
#include <iostream>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <cmath>
#include <set>
#include <map>
#include <stack>
#include <queue>
#define ll long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define P pair<ll, ll>
using namespace std;
int main(){
int n; cin >> n;
vector<ve... | #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 <int, int>, null_type,less<pair <int, int>>, rb_tree_tag,tree_order_statistics_node_update>
const int MAXN = 3e5 + 20, MAXM = 16e... |
#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<bits/stdc++.h>
#define rep(i, n) for (int i = 0, length = n; i < length; i++)
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ep emplace
#define epb emplace_back
#define scll static_cast<long long>
#define sz(x) static_cast<int>((x).size())
#define pfll(x) printf("%lld... |
#include<iostream>
using namespace std;
int main()
{
int n, m;
cin >> n >> m;
cout << n / m;
} | //#include <atcoder/all>
//using namespace atcoder;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#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 ALL(v) v.begin(), v.end()
#define bit(n) (1LL<<(n))
#define FI... |
#include <iostream>
#include <algorithm>
using namespace std;
long long md = 1000000007;
long long fp(long long n, long long k)
{
long long s = 1;
while (k) {
if (k & 1) s = (s * n) % md;
k /= 2; n = (n * n) % md;
}
return s;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
int n, m; c... | //#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... |
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
using namespace std;
#define N 110
#define sq(_) ((_) * (_))
#define eps 1e-7
bool equ(double x , double y) {
return fabs(x - y) < eps;
}
int n;
double x[2][N] , y[2][N];
double gx , gy;
bool vis[N];
int main() {
cin >> n;... | // ----- In the name of ALLAH, the Most Gracious, the Most Merciful -----
#include<bits/stdc++.h>
using namespace std;
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > stru... |
#include <bits/stdc++.h>
#define ff first
#define ss second
#define endl '\n'
using namespace std;
const long long INF = (long long) 1e18;
const int mod = (int) 998244353;
const int MAXN = (int) 3e5+5;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll n, k;
in... | #include <iostream>
#include <cstdio>
#include <vector>
#include <map>
#include <queue>
#include <cstring>
#include <algorithm>
using namespace std;
//#define int long long
int n,m,a[1500010],f[1500010];
signed main() {
memset(f,0,sizeof(f));
scanf("%d%d",&n,&m);
for(int i = 1; i <= n; i++) {
scanf("%d",&a[i]);
}... |
#include <bits/stdc++.h>
#define clog(x) std::clog << (#x) << " is " << (x) << '\n';
using LL = long long;
int main() {
//freopen("in", "r", stdin);
std::cin.tie(nullptr)->sync_with_stdio(false);
LL n;
std::cin >> n;
std::vector<LL> F{1, 1};
while (F.back() <= n) F.emplace_back(F[F.size() - 2] + F[F.size() - 1... | ///
#include <bits/stdc++.h>
using namespace std;
#define fo(i,a,b) for(int i=a;i<b;i++)
#define fodec(i,a,b) for(int i=a;i>b;i--)
#define sz(v) int(v.size())
#define len(s) s.length()
#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define... |
#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), ## ... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define int long long
int lst[3][11];
int nlst[10];
bool check(void) {
int num[3] = {0};
for (int i = 0; i < 3; i++) {
if (nlst[lst[i][0]] == 0) return false;
for (int j = 0; j < lst[i][10]; j++) {
num[i... |
#include "bits/stdc++.h"
using namespace std;
#include "string"
#define int long long
#define pi pair<int, int>
#define ff first
#define ss second
#define boost ios::sync_with_stdio(false);cin.tie(nullptr)
#define endl '\n'
#define vi vector<int>
int32_t main() {
boost;
int n;
cin >> n;
string s;
cin >>... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
bool s_first = true;//true_s1,false_s2
void swap_char(vector<char>&,vector<char>&,int,int,int);
int main(){
int n;
cin >> n;
string s;
cin >> s;
vector<char> s1(n);
vector<char> s2(n);
for(int i = 0;i < n;i++){
... |
#include <bits/stdc++.h>
#define endl "\n";
#define pii pair<int,int>;
using namespace std;
typedef long long ll;
const ll BIG=1000000007;
const double PI=3.141592653589793238;
ll binpow(ll a,ll b,ll m)
{
ll res=1;
while(b>0){
if(b&1){res=(res*a)%m;}
b>>=1;a=(a*a)%m;
}
return res;
}
template... | #include<bits/stdc++.h>
#define For(i,x,y) for (register int i=(x);i<=(y);i++)
#define FOR(i,x,y) for (register int i=(x);i<(y);i++)
#define Dow(i,x,y) for (register int i=(x);i>=(y);i--)
#define Debug(v) for (auto i:v) printf("%lld ",i);puts("")
#define mp make_pair
#define fi first
#define se second
#define pb push_b... |
//Many 110
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define rep(i,x,y) for(ll i=x;i<y;i++)
#define rrep(i,x,y) for(ll i=x-1;i>=y;i--)
#define nvarep(n,a) ll n;cin>>n;vector<ll>a(n);rep(i,0,n)cin>>a[i]
#define vecrep(n,a,type) vector<type>a(n);rep(i,0,n)cin>>a[i]
#define... | #include <iostream>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cstdio>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
ll N, ans;
string Tstr;
ll check_valid(ll offset, const char* T) {
ll i;
ll m;
... |
#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;
#define int long long int
#define fio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define pii pair<int,int>
#define F first
#define S second
#define pb push_back
const int mod1=998244353,mod2=(int)1e9+7;
int power(int n,int k,int mod){int ans=1; n=n%mod;whi... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)//iをaからn
#define per(i,n,a) for (int i=a-1;i>=n;i--)//iをnからa
#define db(x) cout << #x << " = " << x << endl//デバッグ用
#define db2(x, y) cout << "(" << #x << ", " << #y << ") = (" << x << ", " << y << ")\n"; //デバッグ用
#define all(x) (x).beg... | #include<bits/stdc++.h>
typedef int LL;
typedef double dl;
#define opt operator
#define pb push_back
#define pii std::pair<LL,LL>
const LL maxn=1e6+9,mod=998244353,inf=0x3f3f3f3f;
LL Read(){
LL x(0),f(1); char c=getchar();
while(c<'0' || c>'9'){
if(c=='-') f=-1; c=getchar();
}
while(c>='0' && c<='9'){
x=(x<<3ll... |
/**
* author : Nikh1l
* created: 27.02.2021 17:29:54
**/
#include<bits/stdc++.h>
using namespace std;
using ll = int64_t;
void Learner() {
double a, b, ans = 0;
cin >> a >> b;
cout << setprecision(10) << (a - b)*100/a;
}
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
Learn... | #include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 2e5 + 10, oo = 1e9 + 10, MOD = 1e9 + 7;
ll s, p;
main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> s >> p;
for(ll i = 1; i * i <= p; i++) {
if(p % i == 0) {
if(p / i + i == s) {
cout << "Yes\n";
... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll gcd(ll a, ll b){return b ? gcd(b,a%b):a;}
int main(){
ll n;
cin >> n;
ll ans = 2;
for(ll i=3; i<=n; ++i){
ans *= i /gcd(ans,i);
}
cout << ans+1 << endl;
} | #include<bits/stdc++.h>
#include<string.h>
#include<vector>
#include<set>
#include<map>
#include<stack>
#include<queue>
#define endl "\n"
#define ll long long
#define int long long
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cin.exceptions(cin.failbit);cout.tie(NULL);
using namespace std;
bool isPrime(... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define lld long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define f first
#define s second
#define mk make_pair
/*----------------------DEBUGGER---------------------------*/
#ifndef ON... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <math.h>
#include <queue>
#include <numeric>
#include <iomanip>
#include <map>
#include <set>
using namespace std;
using ll = long long;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
#define pb push_... |
#pragma region Template // clang-format off
#include <bits/stdc++.h>
using namespace std;
// #include <atcoder/all>
// using namespace atcoder;
#define rep(i, m, n) for (int i = m; i < (int)(n); i++)
#define repe(i, m, n) for (int i = m; i <= (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define yesno {cout<<"Ye... | #include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>
static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;
template<class T> constexpr... |
#include <stdio.h>
#include <iostream>
#include <vector>
#include <algorithm>
//#define LOCAL
using namespace std;
typedef long long ll;
const int mx=100+10;
const int SIZE=50;
ll prime[mx], ptot;
bool isp[mx];
ll x[mx];
ll ans;
ll n;
vector<ll>vec[mx];
void fj(ll v){
ll cpy=v;
for(ll i=2;i*i<=v;i++){
i... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long long unsigned int ull;
typedef pair<ll, ll> llpair;
typedef std::numeric_limits<double> dbl;
#if defined(_USE_MATH_DEFINES) && !defined(_MATH_DEFINES_DEFINED)
#define _MATH_DEFINES_DEFINED
#define M_E 2.71828182845904523536
#define ... |
#include<bits/stdc++.h>
using namespace std;
#define boost ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define mp make_pair
#define pb push_back
#define fp first
#define sp second
typedef long long int ll;
typedef pair<ll,ll> pp;
#define check(x, i) ((x>>i)&1LL)
#define set(x,i) (x|(1LL<<i))
#define unset(x,i) ... | #include <bits/stdc++.h>
#define ll long long
#define ui unsigned int
#define forn(i, n) for (int i = 0; i < int(n); i++)
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll N, M;
cin >> N;
int d = 0;
M = N;
while (M > 0) {
d++;
M /= 10;
}
if (d == 1) {
cout << 0 << end... |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<vector>
#include<cmath>
#include<algorithm>
#include<map>
#include<queue>
#include<deque>
#include<iomanip>
#include<tuple>
#include<cassert>
#include<set>
#include<complex>
#include<numeric>
#include<functional>
#include<unordered_map>
#in... | #include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const ll INF = 3e18;
inline ll mod(ll a, ll m) { return (a%m+m)%m;}
// EXTGCD a*x + b*y = extGCD
ll extGCD(ll a, ll b, ll &x, ll &y){
if(b == 0) { x = 1; y = 0; return a;}... |
#include <bits/stdc++.h>
#define int long long
#define mod 998244353
using namespace std;
const int O = 3e5 + 5;
int tree[O * 4], lazy[O * 4];
void Push(int id, int l, int r){
int &x = lazy[id];
int mid = (l + r) / 2;
if (x == 0) return;
tree[id << 1] += x;
lazy[id << 1] += x;
tree[id << 1 |... | #include <bits/stdc++.h>
#define sz(c) int(c.size())
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define per(i, a, b) for (int i = (b)-1; i >= (a); --i)
using namespace std;
using ll = long long;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <... |
#include<bits/stdc++.h>
using namespace std;
bool cmp(char c1, char c2) {
if (c1 == c2) return 1;
if (c1 == 'R' && c2 == 'S') return 1;
if (c1 == 'P' && c2 == 'R') return 1;
if (c1 == 'S' && c2 == 'P') return 1;
return 0;
}
int main() {
int n, k;
string s;
cin >> n >> k >> s;
for (int i = 1; i <= k; i++) {
s... | #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>
using namespace std;
using Long = long long;
using Double = long double;
using pii = pair<int,int>;
using pll = pair<Long,Long>;
using vi = vector<int>;
using vl = vector<Long>;
using vs = vector<string>;
using vii = vector<pii>;
using vll = vector<pll>;
#define ff first
#define ss second
#defi... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
vector<int> A(100);
cin >> N;
for (size_t i = 0; i < N; i++)
{
cin >> A[i];
}
int maxcount = 0, count, ans;
for (size_t i = 2; i <= 1000; i++)
{
count = 0;
for (size_t j = 0; j < N; j++)
... |
#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... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; ++i)
using ll = long long;
using P = pair<int, int>;
int main() {
ll T;
cin >> T;
rep(i, T) {
ll L, R;
cin >> L >> R;
if (R - L < L) {
cout << 0 << endl;
... |
#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... | /*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#include <cstdio>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstring>
#include <vector>
#include <numeric>
#include <iostream>
#include <random>
#include <map... |
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<string>
#include<vector>
#include<stack>
#include<bitset>
#include<cstdlib>
#include<cmath>
#include<set>
#include<list>
#include<deque>
#include<map>
#include<queue>
using namespace std;
typedef long long ll;
ll n,k;
ll a[100];
void Y... | #include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n,x;
cin>>n>>x;
int a[n];
for(int i=0;i<n;i++){
cin>>a[i];
if(a[i] == x)
a[i] = 0;
}
for(int i=0;i<n;i++){
cin>>a[i];
if(a[i] != 0)
cout<<a[i]<<" ";
}
} |
#include<bits/stdc++.h>
using namespace std ;
int main()
{
int n;
cin>>n;
int a[n],b[1001]={0};
int i;
for(i=0;i<n;i++)
cin>>a[i];
int j;
for(i=2;i<=1000;i++)
{
for(j=0;j<n;j++)
{
if(a[j]%i==0)
b[i]++;
}
}
int max=0;
for(i=2;i<=1000;i++)
{
if(b[i]>max)
max=b[... | #include<bits/stdc++.h>
#define int long long
const int N=500050;
using namespace std;
map<int,int> a;
int n,x,s[N],ans;
main(){
scanf("%lld",&n),a[0]=1;
for(int i=1;i<=n;i++)scanf("%lld",&x),s[i]=s[i-1]+((i&1)?-x:x),a[s[i]]++;
for(int i=1;i<=n;i++)--a[s[i]],ans+=a[s[i]];
printf("%lld",ans);
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INFint = 1e9+1;
const ll INFll = (ll)1e18+1;
const int MOD=1e9+7;
int main(){
int N,M;
cin>>N>>M;
vector<vector<int>> G(N,vector<int>());
for(int i(0);i<M;i++){
int a,b; cin>>a>>b; a--;b--;
G[a].push_back(b); G[b].push_back(a... | #include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
#define rep(i,x,y) for(ll i=(x);i<(y);i++)
#define rrep(i,x,y) for(ll i=(ll)(y)-1;i>=(x);i--)
#define all(x) (x).begin(),(x).end()
#define itrout(x) for(int i=0;i<x.size();i++) {cout << x[i] << (i==x.size()-1 ? "\n" : " ");}
#ifdef LOCAL
#define de... |
#include<iostream>
#include<vector>
using namespace std;
using ll = long long;
int main() {
int n; ll x;
cin >> n >> x;
vector<int> A(n);
for (auto& Ai : A) cin >> Ai;
ll ans = (ll)2e18;
for (int base = 1; base <= n; base++) {
vector<vector<int>> T(base + 1, vector<int>(base, -(int)2e9));
T[0][(base-(x%ba... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define REP(i, n) for(ll i = 0LL; i < (ll)(n); i++)
#define REPR(i, n) for (ll i = (ll)(n) - 1; i >= 0; i--)
#define FOR(i, n, m) for(ll i = (ll)n; i < (ll)(m); i++)
#define ALL(x) (x).begin(),(x).end()
#define MOD 10000000... |
#include<bits/stdc++.h>
#define show(x) cerr << #x << " = " << x << '\n';
using namespace std;
#define int long long
#pragma GCC optimize(2)
int n, q;
vector<int> a;
void solve()
{
cin >> n >> q;
for(int i = 1; i <= n; i ++)
{
int t;
cin >> t;
a.push_back(t);
}
for(int i = 1... |
/*NEVER GIVE UP*/
/*First try brute force and check if it is in the range of time complexity*/
/*Then try to solve the problem in mathematical form*/
/*Then try to imagine how the final ans will look like*/
/*Write on paper if still not able to get*/
/*Try to think diff. algorithms and data structures that could solv... |
// ＵＴＦ−８
#include<bits/stdc++.h>
using namespace std;
using ll = long long int;
using lc = complex<double>;
/* #include<atcoder/all> */
/* using namespace atcoder; */
template<class T>bool chmax(T &a, const T &b) { return (a<b ? (a=b,1) : 0); }
template<class T>bool chmin(T &a, const T &b) { return (a>b ? (a=b,1) :... | #include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
#include <complex>
using namespace std;
using ll = long long;
using C = complex<double>;
C inC() {
double x, y;
cin >> x >> y;
return C(x, y);
}
int main() {
int n;
cin >> n;
C s = i... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define scan(a,n) for(long long int index=0;index<n;index++) cin>>a[index];
#define print(a,n) for(long long int index=0;index<n;index++) cout<<a[index]<<" ";cout<<endl;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int a, b, c, d, maks=-1e9+7; cin >> a >> b >> c >> d;
for(int i=a;i<=b;++i){
for(int j=c;j<=d;++j){
maks=max(maks, i-j);
}
}
cout << maks << '\n';
}
/* stuff you should... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
struct Edge{
int v,c,d;
inline ll arrive(ll t){
return t+c+ll(d)/(t+1);
}
inline ll tmin(ll t0){
return arrive(max(t0,ll(round(sqrt(d)))-1));
}
};
int main(){
int n,m;
cin>>n>>m;
vector<vector<Edge>> adj(n);
for(int i=0;i<m;... | //wtrl,everybody hangbeat me
#include<bits/stdc++.h>
/*#include<iostream>
#include<string>
#include<cmath>
#include<cstdio>
#include<cctype>
#include<cstring>
#include<iomanip>
#include<cstdlib>
#include<ctime>
#include<set>
#include<map>
#include<utility>
#include<queue>
#include<vector>
#include<stack>
#include<sstre... |
//#include <atcoder/all>
#include <bits/stdc++.h>
//using namespace atcoder;
using namespace std;
typedef long long ll;
#define MOD (long long)(1e9+7)
#define INF (1LL<<60)
#define rep(i,n) for(ll i = 0; i < (n); i++)
#define rep1(i,n) for(ll i = 1; i <= (n); i++)
template<class T> inline bool chmin(T& a, T b) {
if... | // execute g++ main.cpp -std=c++14 -I C:\Users\naoya\Desktop\code\Atcoder
#include<bits/stdc++.h>
//#include<atcoder/all>
typedef long long ll;
typedef long double ld;
using namespace std;
//using namespace atcoder;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
//ordered_set 重複不可
#include <ext/pb_ds/assoc_con... |
#include <bits/stdc++.h>
#define LL long long
#define rep(i,n) for(int i=0;i<n;++i)
#define repn(i,n) for(int i=1;i<=n;++i)
using namespace std;
int qmi(int a, int k, int p) // 快速幂模板
{
int res = 1 % p;
while (k)
{
if (k & 1) res = (LL)res * a % p;
a = (LL)a * a % p;
k >>= 1;
}
... | #include<iostream>
#include<unordered_map>
#include<cstring>
using namespace std;
const int N = 400010;
typedef long long ll;
int m, q;
ll n;
int pow10(ll n)
{
ll res = 1%q;
int i = -1;
while(n >> ++i);
--i;
while(~i)
{
int j = n >> i & 1;
res = (res * res) % q;
if(j) res = (res * 10) % q;
--i;
}
retu... |
#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>;
int main() {
int n, m, q;
cin >> n >> m >> q;
vector<P> wv(n);
rep(i, n) {
int w, v;
cin >> w >> v;
wv[i] = {v, -w};
}
sort(wv.b... | #include <bits/stdc++.h>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
class segtree{
public:
static const int N=1<<18;
ll dp[1<<19];
segtree(){
memset(dp,0,sizeof(dp));
}
void update(int k,ll v){
k+=N-1;
dp[k]+=v;
while(k>0){
k=(k-1)/2;
dp[k]=dp[k*2+1]... |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5+5;
typedef long long LL;
int n,m,q,a[maxn],b[maxn];
LL ans;
struct Seg {
LL sum[maxn<<5];
int root,ch[maxn<<5][2],cnt[maxn<<5],tot;
void upd(int &u,int l,int r,int p,int v) {
if(!u)u = ++tot;
cnt[u]+=v,sum[u] += v*p;
if(l == r)return ;
int mi... | /* हरे कृष्ण हरे कृष्ण कृष्ण कृष्ण हरे हरे
हरे राम हरे राम राम राम हरे हरे */
#include<bits/stdc++.h>
using namespace std;
#define pb emplace_back
#define pob pop_back
typedef long long int lli;
#define test lli t; cin>>t;... |
/*
“The only way that we can live is if we grow.
The only way we can grow is if we change.
The only way we can change is if we learn.
The only way we can learn is if we are exposed.
And the only way that we are exposed is if we throw ourselves into the open.”
*************************************** *************... |
// Problem: F - Valid payments
// Contest: AtCoder - AtCoder Beginner Contest 182
// URL: https://atcoder.jp/contests/abc182/tasks/abc182_f
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
#define ll long long int
#define ii int
#d... |
#define _DEBUG
#include "bits/stdc++.h"
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0,a1,a2,a3,a4,x,...) x
#define debug_1(x1) cout<<#x1<<": "<<x1<<endl
#define debug_2(x1,x2) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<endl
#define debug_3(x1,x2,x3) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<endl
#define ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int count = 0;
int X;
double A = 1.0000/3.000;
X = pow(N,A)+0.00001;
int Y,Z;
for(int i = 0; i < X ;i++){
Y = sqrt(N/(i+1));
//cout << Y << endl;
for(int j = i; j < Y ;j++){
Z = N/(i+1)/(j+1);
... |
#include <bits/stdc++.h>
#define pb push_back
#define ss second
#define ff first
#define all(x) x.begin(), x.end()
#define INF 3000000000000001 // 3e15
#define ll_max 9000000000000000000
#define PI 3.14159265358979323846L
#define fill(a, n, x) for(int i = 0; i < n; i++) a[i] = x;
#define fast ios_base::sync_with_stdio(... | //Author: AnandRaj doubleux
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pll> vpll; ... |
/**
* @author Macesuted (macesuted@qq.com)
* @copyright Copyright (c) 2021
*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define maxn 3005
#define mod 1000000007
int a[maxn], f[maxn][maxn], cnt[maxn];
void work(void) {
int n;
cin >> n;
for (register int i = 1; i <= n; i++) c... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define fast ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
#define int long long
#define ld long double
using namespace __gnu_pbds;
using namespace std;
using ll = long long;
template<class T> us... |
// C - Bowls and Dishes
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i=0; i < n; i++) // 0 ~ n-1
template<class T> inline bool chmax(T& a, T& b) { if (a < b) { int tmp=a; a=b; b=tmp; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T& b) { if (a > b) {... | #include<bits/stdc++.h>
using namespace std;
#define pi acos(-1.0)
#define endl "\n"
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
typedef long long ll;
typedef unsigned long long ull;
bool sortbysecc(const pair<int,int> &a, const pair<int,int> &b){
return (a.second < b.second);
}
l... |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
int n;
int dp[18][(1<<18)];
int cost[18][18];
int solve(int i,int mask)
{
if(mask==0)
return cost[i][0];
if(dp[i][mask]!=-1)
return dp[i][mask];
int ans=INT_MAX;
f... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
// --------------------------------------------------------
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; }
#define ... |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef... | /*
Written By mafailure
*/
#define ill
//In the name of God
#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 std;
using namespace __gnu_pbds;
#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)... |
#include<iostream>
#include<stdio.h>
#include<string>
#include<vector>
#include<map>
#include<tuple>
#include<algorithm>
#include<cmath>
#include<limits>
#include<set>
#include<deque>
#include<queue>
#include<stack>
using namespace std;
#define int long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#def... | #include <iostream>
#include <string>
#include <algorithm>
#include <map>
using namespace std;
int naive(int N, string S, string T)
{
map<string, int> M;
M[S] = 0;
for (int d=0; d<100; d++)
{
for (auto it: M)
{
string s = it.first;
int n = it.second;
... |
#pragma region header
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n)for(int i=0;i<(n);i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define int ll
#define each(i, a) for (auto &&i : (a))
using ll = long long;
using ld = long double;
using vi = v... | #include<bits/stdc++.h>
#define F(i,l,r) for(register int i=l;i<=r;i++)
#define D(i,r,l) for(register int i=r;i>=l;i--)
#define ll long long
#define mem(a,b) memset(a,b,sizeof(a))
#define p_b push_back
#define m_p make_pair
#define il inline
#define fi first
#define se second
const int INF=0x7f7f7f7f,N=2e5+5;
using nam... |
//#pragma GCC optimize ("O3")
//#pragma GCC target ("sse4")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC target("avx,avx2,fma")
#include <algorithm>
#include <array>
#include <cassert>
//#include <chrono>
#include <cmath>
//#include <cstring>
//#include <functional>
//#incl... | #include <bits/stdc++.h>
using namespace std;
int main(){
int64_t N, X;
cin >> N >> X;
string S;
cin >> S;
int64_t ans = X;
for(int i=0;i<N;i++){
if(S.at(i)=='x' && ans>0){
ans--;
}else if(S.at(i) == 'o'){
ans++;
}
}
cout << ans << endl;
return 0;
} |
#include <cmath>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <queue>
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
using namespace std;
typedef long long ll;
double xs[200000+10];
double ys[200000+10];
bool g[105][105];
int visited[105];
int counter;
int main(void) {... | /****************************************** By Lord Sanskar Bhargava******************************/
#include<bits/stdc++.h>
#include <algorithm>
#include <array>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#includ... |
#include<bits/stdc++.h>
#define Fast ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define Freed freopen ("0in.txt","r",stdin);
#define Fout freopen ("0out.txt","w",stdout);
#define ll long long int
#define pb push_back
#define mp make_pair
#define pi acos(-1.0)
#define Mod 1000000007
#define limit 200008
using names... | // Author :: <Hitesh_Saini>
#include<bits/stdc++.h>
#define __speed() ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#define dbg(x) cout << "[" << __LINE__ << ": "<< #x << " = " << x << " ]\n";
#define tt int t; for (cin>>t; t--; )
#define f0(i, n) for (i = 0; i < (int)(n); i++)
#define f1(i, n) for (i ... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define REP(NAME, NUM) for (int NAME = 0; NAME < int(NUM); ++NAME)
#define BREP(NAME, NUM) for (int NAME = (NUM)-1; NAME >= 0; --NAME)
#define ALL(NAME) (NAME).begin(), (NAME).end()
#define cMOD... | #include <bits/stdc++.h>
#define fast ios::sync_with_stdio(0), cin.tie(nullptr)
#define all(v) v.begin(), v.end()
#define compress(v) sort(all(v)), v.erase(unique(all(v)), v.end())
#define fi first
#define se second
#define cat(a, b) a##b
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef p... |
#include <iostream>
#include <vector>
using namespace std;
void check(bool& Akaried, vector<vector<int>>& Map, int i, int j) {
switch (Map[i][j]) {
case 1:
break;
case -1:
if (Akaried) Map[i][j] = 1;
break;
case 2:
Akaried = true;
break;
case 3:
Akaried = false;
break;
}
return;
}
int main() {
i... | #include <bits/stdc++.h>
//#include <atcoder/all>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
//using namespace atcoder;
using ll = long long;
using P = pair<int, int>;
int main()
{
int H, W, N, M;
cin >> H >> W >> N >> M;
vector<vector<int>> dp(H + 2, vector<int>(W + 2));
rep(i, N)
{
i... |
#include<bits/stdc++.h>
#define ll long long int
#define mk make_pair
#define pb push_back
#define INF (ll)1e18
#define pii pair<ll,ll>
#define mod 998244353
#define ff first
#define ss second
#define srt(v) if(!v.empty())sort(v.begin(),v.end())
#define rev(v) if(!v.empty())reverse(v.begin(),v.end())
#define PI 3.141... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define int ll
const int N = (int) 2e5 + 7;
int n, a[N], b[N], aib[N];
map<int, vector<int>> pos;
map<int, int> cur;
void add(int i, int x) {
while (i <= n) {
aib[i] += x;
i += i & (-i);
}
}
int get(int i) {
i... |
// Problem: D - Base n
// Contest: AtCoder - AtCoder Beginner Contest 192
// URL: https://atcoder.jp/contests/abc192/tasks/abc192_d
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
// Disclaimer: Don't copy my template, it may lead to plagiarism.
/* Author:... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define dump(...)
#endif
#define endl '\n'
//#define int long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++... |
#include<cstdio>
#include<cstring>
#include<queue>
#include<cmath>
#include<algorithm>
using namespace std;
typedef int int_;
#define int long long
#define maxn 400010
const int inf=1e9+7;
queue<int> q;
inline int read(){
int ret=0,ff=1;
char ch=getchar();
while(ch<'0'||ch>'9'){
if(ch=='-') ff=-ff;
ch=getchar();... | #pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
inline int my_getchar(){
static char buf[1048576];
static int s = 1048576;
static int e = 1048576;
if(s == e && e == 1048576){
e = fread(buf, 1, 1048576, stdin);
s = 0;
}
if(s == e){
return EOF;
}
return buf[s++];
}
... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vc = vector<char>;
using vcc = vector<vc>;
using Pii = pair<int,int>;
using ld = long double;
#define rep(i,n) for(int i... | #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 <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeo... | #include <bits/stdc++.h>
using namespace std;
#define N 100010
typedef long long ll;
ll arr[N];
int main()
{
ll n, q;
cin >> n >> q;
for (int i = 0; i < n; i++)
{
cin >> arr[i];
}
ll k;
while (q--)
{
cin >> k;
ll target = 1;
ll left = 0, right = n - 1;
... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define loop(i,a,b) for(ll i=a;i<=b;i++)
#define pb push_back
#define mod 1000000007
void contest()
{
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
freopen("out.txt", ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
using PII = pair<int, int>;
inline void quickread() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
}
ll qpow(ll a, ll b, ll p) {
ll ret = 1;
while(b) {
if(b & 1) ret = (ret * a) % p;
a = (a * a) % p;... |
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(NULL);
ios_base::sync_with_stdio(false);
int a, b;
int x = 1^2;
cin >> a >> b;
if ((x^a^b) != (1^2)) cout << (x^a^b);
else cout << a;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
if ( x == y ) cout << x;
else {
int arr[3] = {0, 1, 2};
for ( int i = 0; i < 3; i ++ ) {
if ( arr[i] != x && arr[i] != y ) {
cout << arr[i];
break;
... |
#include <bits/stdc++.h>
#include <string>
#include <algorithm>
#include <cstdlib>
#include <math.h>
using namespace std;
int t[200001];
int main(void){
int n;
cin >> n;
int at=0;
for(int i=0;i<n;i++){
int s;
cin >> s;
t[s]++;
while(t[at]){
//cout << ":" <... | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define int long long int
#define mod 1000000007
#define vi vector<int>
#define pint pair<int,int>
#define vint vector<vector<int>>
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
const int N = 1e6+5;
int A[N], B[N], P[N], Q[... |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
int a, b, c;
cin >> a >> b >> c;
if(( a*a + b*b) < (c*c) ){
printf("Yes\n");
}
else{
printf("No\n");
}
}
| #define LOCAL
#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,s,n) for (int i = (ll)s; i < (ll)n; i++)
#define rrep(i,n,e) for (int i = (ll)n; i > (ll)e; i--)
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace... |
#include<bits/stdc++.h>
using namespace std;
const double eps=1e-5;//精度
int n;
struct point{
int x,y;
}p[110];
int fa[110];
int father(int x){
return fa[x]==x?x:fa[x]=father(fa[x]);
}
double dis(int x,int y){
return sqrt(pow(p[x].x-p[y].x,2)+pow(p[x].y-p[y].y,2));
}
int main(){
scanf("%d",&n);
for(int i=1;i<=n;i+... | # include <algorithm>
# include <stdio.h>
# include <math.h>
using namespace std;
int n, k;
int x[111];
int y[111];
int f[111];
struct edge {
int x;
int y;
double l;
} e[10010];
bool cmp(edge a, edge b) {
return a.l < b.l;
}
int fi(int x) {
int t = x;
while (t != f[t]) {
t = f[t];
}
while (x !=... |
#include <iostream>
#include <vector>
#include <algorithm>
int main() {
int n, m;
std::cin >> n >> m;
std::vector<int> a(m);
for (int i=0; i<m; ++i) {
std::cin >> a[i];
}
std::sort(a.begin(), a.end());
std::vector<int> s;
for (int i=0; i<=m; ++i) {
int j;
if (i =... | #include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
const int N = 810;
int n, k, a[N][N];
bool check(int mid)
{
int s[N][N], d[N][N];
memset(s, 0, sizeof(s));
memset(d, 0, sizeof(d));
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= n; j++)
{
s[i][j] = s[i - 1][j] + s[i][j - ... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
int main()
{
ll t = 1;
// cin >> t;
while(t--)
{
ll n;
cin >> n;
ll c = 0 , x = 1 , c1 = 0;
while(1)
{
// x*y + x*(x-1)/2 =
ll val = n - ((x*(x-1))/2);
// cout << val << endl;
ll val1 = val / x;
if(val1 ... | #include<bits/stdc++.h>
#define pb push_back
#define fo(i,n) for(int i=0;i<n;i++)
#define ll long long
#define int long long
#define Mod 1000000007
#define maxn 200005
#define MAX 4294967296 // 2^32
const int M=1e9+7;
#define ip pair<int,int>
#define test(t) ll t;cin>>t;while(t--)
using namespace std;
long lon... |
#include<bits/stdc++.h>
using namespace std;
long long a,s,x,mx;
int n;
int main(){
cin>>n;
int i;
for(i=1;i<=n;i++){
cin>>x;
mx=max(mx,x);
a+=x;
s+=a;
cout<<s+i*mx<<endl;
}
} | #include <bits/stdc++.h>
#include <bits/extc++.h>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;
typedef pair<int,int> pi;
typedef pair<ll,ll> pl;
typedef pair<db,db> pd;
typedef vector<int> vi;
typedef vector<ll> vl;
typ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define fi first
#define se second
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep0(i, n) for (ll i = 0; i <= (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= (n); ++i)
#define rrep1(i, n) for (ll i = (n); i > 0; --i)
#define rrep0(i, n)... | #include<bits/stdc++.h>
using namespace std;
void solve()
{
string s;
cin>>s;
int n=s.size();
s="."+s;
string t=".atcoder";
int res=-1;
for(int i=0;i<=7;i++)
{
string a=s;
int cur=0;
for(int j=1;j<=i;j++)
{
bool found=false;
for(i... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
// #include <atcoder/all>
// using namespace atcoder;
int main(){
int n, w;
cin >> n >> w;
... | #include<iostream>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<algorithm>
#include<numeric>
#include<cmath>
#include<iomanip>
#include<regex>
using namespace std;
#define int long long
const int mod=1e9+7;
bool pri[1000001],squf[1000001],even[1000001];
signed m... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(c) (c).begin(),(c).end()
#define fast ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
typedef long double ld;
typedef pair<ll,ll> pii;
const ll inf = 1e9;
const ll inf64 = 1e18;
con... | #include <iostream>
#include <vector>
#include <algorithm>
int main() {
const auto g1 = [](long a) {
std::vector<long> v;
while (a > 0) {
v.push_back(a % 10);
a /= 10;
}
std::sort(v.begin(), v.end(), std::greater<long>());
long ret = 0;
long... |
#include "bits/stdc++.h"
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ub upper_bound
#define lb lower_bound
#define isrt insert
#define clr clear
#define rsz resize
#define ff first
#define s... | #include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long ll;
typedef pair<ll,ll> P;
const ll mod=1000000007;
const ll LINF=1LL<<60;
const int IN... |
#include<bits/stdc++.h>
using namespace std;
const int N=4e5+1e3+7;
int C(int n,int m)
{
if(n<m||n<0||m<0)
return 0;
long long ret=1;
for(int i=n;i>=n-m+1;i--)
ret=ret*i;
for(int i=1;i<=m;i++)
ret=ret/i;
return ret%3;
}
int Lucas(int n,int m)
{
if(n<3||m<3)
return C(n,m);
return C(n%3,m%3)*Lucas(n/3,m... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(x,y,z) for(int x=y;x<=z;x++)
const int N=4e5+10;
const double eps = 0.01;
const ll mod = 1e9+7;
const double pi = acos(-1.0) ;
const ll inf = 0x3f3f3f3f3f3f3f3f;
const ll DIV=100000;
inline ll read()
{
ll x=0,f=1;char ch=getchar();
w... |
#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 a,b;cin>>a>>b;
vector<ll> x(a,0),y(b,0);
ll ttl=0;
REP(i,a){
x.at(i)=600000-i;
ttl+=x.at(i);
}
ll ttl2=0;
REP(i,b-1){
y.at(i)=i+1;
ttl2+=y.at(i);
}
y.at(b-1)=ttl... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
using ll = long long;
int mod = 1000000007;
const int INF = 1001001001;
template<class T> void chmin(T& a, T b) {if (a > b) a = b;}
template<class T> void chmax(T& a, T b) {if (a < b) a = ... |
#include<bits/stdc++.h>
#include<iostream>
#include<string>
#include<cmath>
#include<cstdio>
#include<cctype>
#include<cstring>
#include<iomanip>
#include<cstdlib>
#include<ctime>
#include<set>
#include<map>
#include<utility>
#include<queue>
#include<vector>
#include<stack>
#include<sstream>
#include<algorithm>
#define... | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
int n;
int a[100000], b[100000];
int result;
int main() {
cin >> n;
for(int i=0; i<n; i++)
cin >> a[i];
for(int i=0; i<n; i++)
cin >> b[i];
for(int i=0; i<n; i++)
result += a[i] * b[i];
cout << (result... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
ll n;
cin >> n;
ll a;
cin >> a;
ll b;
cin >> b;
cout << n-a+b << '\n';
return 0;
}
| //******\\
||udc321||
#include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<queue>
#include<map>
#include<set>
#include<fstream>
#include<cstring>
#include<sstream>
#define ll long long
#define fr(e,r,v) for(ll e=r;e<v;e++)
#define bc(e,r,v) for(ll e=r;e>v;e--)
#define all... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
typedef pair <int, int> pin;
const int N = 2005;
const int dx[] = {0, 0, 1, -1}, dy[] = {1, -1, 0, 0};
int n, m, f[N][N];
char s[N][N];
bool vis[N][N];
vector <pin> vec[26];
template <typename T>
inline void read(T &X) {
char ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i = (a); i < (b); i++)
#define drep(i,b,a) for(int i = (b)-1; i >= (a); i--)
#define bit(n) (1LL << (n))
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define SORT(v) sort(v.begin(),v.end());
#define RSORT(v) sort(v.rbegin()... |
// #pragma optimization_level 3
// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#include<bits/stdc++.h>
using namespace std;
#define fastio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define MOD ... | #include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#include<ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#define forn(i,x1,n) for(int i=x1;... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pi pair<ll,ll>
#define pd pair<ld,ld>
#define pb push_back
#define inf 1e16
#define en '\n'
#define ld long double
#define ff first
#define ss second
#define ull unsigned long long
#define lb lower_bound
#define ub upper_bound
#define fr(a,... | #pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline")
#pragma GCC optimize(3 , "Ofast" , "inline")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <unordered_map>
#include <... |
#include <bits/stdc++.h>
#define rep(a,b,c) for(ll a = b; a < c; a++)
#define rep2(a,b,c) for(ll a = c - 1; a >=b; a--)
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define x first
#define y second
using namespace std;
using ll = long long;
using tl = tuple<ll, ll, ll>;
using pl = pair<ll, ll>;
using pi =... | #include <bits/stdc++.h>
#define MP make_pair
#define PB push_back
#define int long long
#define st first
#define nd second
#define rd third
#define FOR(i, a, b) for(int i =(a); i <=(b); ++i)
#define RE(i, n) FOR(i, 1, n)
#define FORD(i, a, b) for(int i = (a); i >= (b); --i)
#define REP(i, n) for(int i = 0;i <(n); ++i)... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.