code_file1 stringlengths 87 4k | code_file2 stringlengths 85 4k |
|---|---|
#ifdef _DEBUG
#define _GLIBCXX_DEBUG
#endif
#if __has_include(<atcoder/all>)
#include <atcoder/all>
#endif
#include <bits/stdc++.h>
using namespace std;
#define int long long
using ll = long long;
using ld = long double;
using P = pair<int, int>;
#define rep(i, a, b) for(int i = (int)(a); i <= (int)(b); i++)
#define rr... | #include<algorithm>
#include<cstdio>
#define ll long long
#define MaxN 400500
using namespace std;
int n;
ll a[MaxN],x[MaxN];
int main()
{
scanf("%d",&n);
for (int i=1;i<=n+n;i++){
scanf("%lld",&a[i]);
x[i]=a[i]=a[i]*n+i;
}
sort(x+1,x+n+n+1);
for (int i=1,cnt;i<=n+n;i++){
if (a[i]<=x[n]){
pu... |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constex... | #include <iostream>
using namespace std;
int main() {
string s;
getline(cin, s);
int i = s.find('.');
string x = s.substr(0, i);
cout<<x;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using matrix = vector<vector<ll>>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repp(i, st, en) for (ll i = (ll)st; i < (ll)(en); i++)
#define repm(i, st, en) for (ll i = (ll)st; i >= (ll)(en); i--)
#defi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
string n;
int k;
cin >> n >> k;
int sz=n.size();
n="$"+n;
const ll mod=1000000007;
auto add=[&](ll &a,ll b){a=(a+b)%mod;};
auto digit=[&](char c)->int
{
... |
#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;
// int a[101][101];
#define int __int128_t
#define ll __int128_t
__int128_t myabs(__int... | #include <bits/stdc++.h>
using namespace std;
#define R register
#define LL long long
inline int read() {
int x = 0, f = 1; char a = getchar();
for(; a > '9' || a < '0'; a = getchar()) if(a == '-') f = -1;
for(; a <= '9' && a >= '0'; a = getchar()) x = x * 10 + a - '0';
return x * f;
}
inline int gcd(int x, int ... |
#include <bits/stdc++.h>
using namespace std;
#define INF 1000000000
#define MOD 998244353
using ll=long long;
using Graph=vector<vector<int>>;
int n=1;
vector<int> tree;
int solve(int a,int b,int i,int left,int right){
if(b<=left||right<=a){
return 0;
}
if(a<=left&&right<=b){
return tree[i];
}
int x... | #include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<string>
#include<cmath>
#include<queue>
#include<map>
#include<bitset>
#include<deque>
#include<cstdlib>
#include<set>
#include<ctime>
#define ll long long
#define mp make_pair
using namespace std;
ll read()
{
ll x=0,f=1;
char c=getcha... |
#include <bits/stdc++.h>
using namespace std;
int index(int y, int x)
{
return y * 16 + x;
}
int search(bitset<256> ttm, int H, int W, int a, int b)
{
if (a == 0 && b == 0)
return 1;
int ans = 0;
int cx = 0, cy = 0;
bool flag = true;
for (int y = 0; y < H && flag; y++)
{
for... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, l, n) for (int i = (int)(l); i < (int)(n); i++)
#define drep(i, n, l) for (int i = (int)(n); i > (int)(l); i--)
#define INF INT_MAX
#define def (200007)
#define MOD (1000000007)
typedef vector<int> veci;
typedef vector<vector<int>> Veci;
typedef vector<int64_... |
#include<bits/stdc++.h>
using namespace std;
#define INF 0x3f3f3f3f
#define swap(a,b) (a^=b^=a^=b)
#define ll long long int
#define ull unsigned long long int
#define uint unsigned int
#define format(a) memset(a,0,sizeof(a))
#define rep(x,y,z) for(int x=y;x<=z;x++)
#define dec(x,y,z) for(int x=y;x>=z;x--)
#define mst(x... | #include <bits/stdc++.h>
using namespace std;
int main()
{
long long n, p = 0, a[2500] = {0};
cin >> n;
for (int i = 0; i < n; i++)
{
cin >> p;
a[p % 200]++;
}
long long ans = 0;
for (int i = 0; i < 200; i++)
{
ans += (a[i] * (a[i] - 1)) / 2;
}
cout << an... |
/*Lucky_Glass*/
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int N=2e5+10;
typedef long long llong;
int dv[N],prm[N],nprm;
void init(){
for(int i=2;i<N;i++){
if(!dv[i]){
dv[i]=i;
prm[++nprm]=i;
}
for(int j=1;j<=nprm && prm[j]*i<N;j++){
dv[prm[j]*i]=prm[j];
if(i... | #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>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
// #define endl '\n'
#define int long long int
#define rep(i, a, b) for (int i = a; i < b; i++)
#define revrep(i, a, b) for (int i = a; i >= b; i--)
#define pb push_... | #include<iostream>
#include<string.h>
using namespace std;
int main(){
long long h,w;
long long a[3000][3000];
long long s[3000][3000];
long long smax; //Takahashi - Aoki
long long posx = 0, posy = 0;
long long mode = 1; //1 xx 2 xy 3 yx 4 yy 5 xのaoki最適解 6 yのaoki最適解
long long temp[50];
l... |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
reverse(s.begin(),s.end());
unsigned int v=s.size();
for(unsigned int i=0;i<v;i++){
if(s[i]=='6'){
s[i]='9';
continue;
}
if(s[i]=='9'){
s[i]='6';
continue;
}
}
cout<<s<<endl;
return 0;
} | #include <iostream>
#include <stdio.h>
#include <climits>
#include <string>
//martin02
using namespace std;
int main() {
string s;
cin >> s;
string s2;
for (int i = s.length() - 1; i >= 0; i--) {
if (s.at(i) == '0') {
s2 += '0';
}
else if (s.at(i) == '1') {
s2 += '1';
}
else if (s.at(i) == '6') ... |
#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rrep(i,n) for(ll i = 1; i <= (n); ++i)
#define drep(i,n) for(ll i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define all(v) v.begin(),v.end()
#define len(x) (ll)(x).length()
#define maxs(x,y) x = max(x,y)
#define mins(x,y... | #include <bits/stdc++.h>
using namespace std;
int main() {
int m,h;
cin >> m >> h;
if(h % m == 0){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
} |
#include<bits/stdc++.h>
using namespace std;
#define LL __int128
long long T,t;
long long X,Y,P,Q;
long long mod1,mod2;
long long a1,a2,b1,b2;
inline long long qr(){
char a=0;long long w=1,x=0;
while(a<'0'||a>'9'){if(a=='-')w=-1;a=getchar();}
while(a<='9'&&a>='0'){x=(x<<3)+(x<<1)+(a^48);a=getchar();}
return w*x;
}
... | //#include <fsociety>
#include <cmath>
#include <deque>
#include <algorithm>
#include <iterator>
#include <list>
#include <map>
#include <unordered_map>
#include <queue>
#include <set>
#include <unordered_set>
#include <stack>
#include <string>
#include <vector>
#include <fstream>
#include <iostream>
#include <iomanip>... |
#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 <iostream>
#include <string>
#include <vector>
#include <utility>
#include <queue>
using ll=long long;
using namespace std;
ll n;
ll bs(ll st, ll ed){
//cout<<st<< " "<<ed<<endl;
if(ed-st<=1){
return st;
}
ll md=(st+ed)/2;
if(md*(md+1)/2<=n+1){
return bs(md,ed);
}else{... |
/**
* author: otera
**/
#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef long double ld;
const int inf=1e9+7;
const ll INF=1LL<<60;
#define rep(i, n) for(int i = 0; i < n; ++ i)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)... | #include<bits/stdc++.h>
#define int long long
using namespace std;
vector <vector<int> > multi(vector<vector<int> >&a,vector<vector<int> >&b,vector<vector<int> >&ans)
{
for(int i=0;i<3;i++)
{
for(int j=0;j<3;j++)
{
for(int k=0;k<3;k++)
{
ans[i][j]+=a[i][k]*b[k][j];
}
}
}
return ans;
}
signed ma... |
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
#define all(arr) arr.begin(),arr.end()
#define f first
#define s second
#define debug1(x) cout<<x<<"\n"
#define debug2(x,y) cout<<x<<" "<<y<<"\n"
#define debug3(x,y,z) cout<<x<<" "<<y<<" "<<z<<"\n"
#define nl cout<<"\n";
#define pq priority_queue... | #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>
#include<tuple>
typedef long long ll;
#define INF 99999999999999
#define mod 1000000007
#define eps 1e-9
using namespace std;
typedef pair<ll,ll>du;
ll a,b,can=1,ans=0;
ll cnt[200],now[205];
string s,cmp;
vector<string>mut;
void chan(ll x){
string res;
while(x!=0){
res+=(char)(x%... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e2+10;
int n[10];
int main(){
string s;
cin >> s;
for(int i = 0; i < s.size(); i++){
n[s[i]-'0']++;
}
if(s.size() < 2){
if((s[0]-'0')%8 == 0){
cout << "Yes" << endl;
retu... |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long A[3];
cin >> A[0];
cin >> A[1];
cin >> A[2];
sort(A, A+3);
cout << A[1] + A[2] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main(int argc, char* argv[]) {
int a, b, c;
cin >> a >> b >> c;
if(c==0) {
if(a==0) {
cout << "Aoki" << endl;
} else {
while(a!=0 && b!=0) {
a--;
if(a==0) {
cout... |
#include "bits/stdc++.h"
#pragma GCC target("avx,avx2")
#pragma GCC optimize("Ofast,unroll-loops")
#define FOR(a, b, c) for(a = b; a <=c; a++)
#define ROF(a, b, c) for(a = b;a >= c; a--)
#define mem0(A) memset(A,0,sizeof(A))
#define mem1(A) memset(A,-1,sizeof(A))
#define memf(A) memset(A,false,sizeof(A))
#define PB pus... | #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define pb(a) push_back(a)
#define vll vector<ll>
#define loop(i, n) for(ll i=1;i<=n;i++)
#define loop0(i, n) for(ll i=0;i<n;i++)
#define in(i) scanf("%lld", &i);
#define out(i) printf("%lld", i)
#define pll pair<ll, ll>
#define vpll vector<pair<l... |
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#... | #include<bits/stdc++.h>
using namespace std;
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char *name, Arg1 &&arg1) {
cerr << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args&&... args) {
const ... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i = (a); i < (b); i++)
#define drep(i,b,a) for(int i = (b)-1; i >= (a); i--)
#define bit(n) (1LL << (n))
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define SORT(v) sort(v.begin(),v.end());
#define RSORT(v) sort(v.rbegin()... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,x,y,ans;
cin>>a>>b>>x>>y;
int d=fabs(a-b),mn=min(2*x,y);
if(a==b) cout<<x<<endl;
else if (a>b)
{
cout<<x+(d-1)*mn<<endl;
}
else cout<<x+(d)*mn<<endl;
return 0;
}
|
#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 t;
cin >> t;
while(t--) {
ll l, r;
cin >> l >> r;
if(r < 2*l) cout << 0 << endl;
else cout << (r-2*l+1)*(r-2*l+2)/2 << endl;
}
return 0;
}
| #include <cstdio>
#include <cstring>
#include <cmath>
#include <cassert>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <iostream>
#include <numeric>
/* debug macros */
#ifdef WAFDAYO
#define DBG_LINE() {std::cerr<<"\e[2m[L"<<__LINE__<<... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define BE(x) x.begin(), x.end()
int main() {
ll n;
string t;
cin >> n >> t;
ll m = 10000000000;
if (t == "1") {
cout << m * 2LL << endl;
return 0;
}
if (t[0] == '0') t = "11" + t, n += 2;
else if (t.s... | #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<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
const int MAX_N = 1e9 + 5;
const int MAX_L = 20; // ~ Log ... |
#include <bits/stdc++.h>
using namespace std;
int main(void){
int a, b, c, d;
cin >> a >> b >> c >> d ;
cout << b - c << endl;
}
| #include <bits/stdc++.h>
using namespace std;
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T> using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define oset_find(k) find_by_order(k)
#define oset_o... |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <functional>
#define rep(i,n) for (int i=0;i<n;i++)
#define DENOM 1000000007
using namespace std;
using ll = long long;
char win_rps(char a, char b) {
if (a==b) {
return a ;
}
if ((a=='R' && b=='S') || (a... | #include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define f(i,j,n) for(long long i = j ; i < n ; ++i)
#define fr(i,n,j) for(long long i = n ; i >= j ; --i)
#define endl '\n'
using namespace std;
typedef long long ll;
typedef vector<long long> vll;
typedef pair<long long,long ... |
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<bitset>
#include<cmath>
#include<ctime>
#include<queue>
#include<map>
#include<set>
#define int long long
#define fi first
#define se second
#define max Max
#define min Min
#define abs Abs
#define lc (x<<1)
#define rc (x<<1|1)
#define m... |
#include <bits/stdc++.h>
using namespace std;
#define ar array
#define ll long long
const int MAX_N = 1e5 + 1;
const ll MOD = 1e9 + 7;
const ll INF = 1e15;
void solve()
{
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int N;
cin >> N;
vector<ll> cutenesses;
vecto... |
#include <iostream>
long long a[1000000]={0};
long long b[1000000]={0};
using namespace std;
int main(){
long long n,a,b;
cin>>n;
long long sum=0;
while(n>0){
cin>>a>>b;
sum+=(a+b)*(b-a+1)/2;
n--;
}
cout<<sum;
return 0;
} | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ordered_set tree<ll, null_type , less<ll> , rb_tree_tag , tree_order_statistics_node_update>
#define ll long long
#define ull unsigned long long
#define pb... |
#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 dp[105][105];
int n;
string s;
int p[105];
int dfs(int l, int w){
char c = s[l];
int t;
if(c == 'R') t = 0;
if(c == 'P') t = 1;
if(c == 'S') t = 2;
if(... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < (n); ++i)
#define FOR(i, m, n) for(ll i = m; i < (n); i++)
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
using vi = vector<int>;
using vii = vector<vi>;
using pii = pair<int, int>;
using vl = vector<ll... |
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
constexpr lint mod = 1e9 + 7;
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcountl((lint)(n))
#define fcout cout << fixed << setprecision(15)
#define highest(x) (63 - __builtin_clzl(x))
#define rep(i, n) for(int i = 0; i < in... | #include <bits/stdc++.h>
#define bug1(x) cout<<#x<<" = "<<x<<endl
#define bug2(x,y) cout<<#x<<" = "<<x<<" "<<#y<<" = "<<y<<endl
#define bug3(x,y,z) cout<<#x<<" = "<<x<<" "<<#y<<" = "<<y<<" "<<#z<<" = "<<z<<endl
#define bug4(x,y,z,m) cout<<#x<<" = "<<x<<" "<<#y<<" = "<<y<<" "<<#z<<" = "<<z<<" "<<#m<<" = "<<m<<endl
usin... |
#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
using namespace std;
typedef long long ll;
ll gcd (ll a, ll b) {
ll c = a % b;
if (c==0)
return b;
return gcd (b, c);
}
int main () {
ll L;
cin >> L;
ll ans = 1;
ll n[11];
ll d[11];
for (int i=0; i<11; i++) {
n[i] = L-i-1;
d... | #include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define pii pair<int,int>
#define vi vector<int>
#de... |
#include<bits/stdc++.h>
using namespace std;
int Nx,Ny;
const bool debug=false;
struct tile_map{
private:
int m[50][50];
int c[50][50];
bool visited[50][50];
public:
int64_t score=0;
string ans="";
int get(int x,int y){
if(x>=0&&x<50&&y>=0&&y<50){
return m[x][y];
}else{
if(debug)pu... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;
template<class T> bool chmin(T& a,T b){if(a>b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a,T b){if(a<b) {a = b; return true;} return fa... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
using ll = long long;
int main()
{
int n;
cin >> n;
ll sum = 0;
int i = 1;
while(sum < n){
sum += i;
i++;
}
cout << i-1 << endl;
return 0;... | /*
* @Date : 2021-03-28 20:23:44
* @Author : ssyze
* @Description :
*/
#include<bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
#define dbg(x...) do { cout << "\033[32;1m " << #x << " -> "; err(x); } while (0)
void err() { cout << "\033[39;0m" << endl; }
template<template<typename...> clas... |
#pragma GCC optimize("Ofast")
#pragma GCC target ("sse4")
#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<bitset>
#include<stack>
#inc... | #include<bits/stdc++.h>
#define MAX 200000
using namespace std;
long long trianglesum[MAX+10],linesum[MAX+10];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin>>n;
long long x;
for(int i=1;i<=n;++i)
{
cin>>x;
linesum[i] = linesum[i-1]+x;
trianglesum[i] = trianglesum[i-1]+linesum[i];... |
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define endl "\n"
#define ll long long
#define sz(s) (int)(s.size())
#define INF 0x3f3f3f3f3f3f3f3fLL
#define all(v) v.begin(),v.end()
#define watch(x) cout<<(#x)<<" = "<<x<<endl
const int dr[] { -1, -1, 0, 1, 1, 1, 0, -1 };... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define fastio() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define test() int t;cin>>t;for(int test=1;test<=t;test++)
#define pb pus... |
#include <bits/stdc++.h>
using namespace std;
char judge(char a, char b){
if(a=='R'){
if(b=='R'){
return 'R';
}else if(b=='P'){
return 'P';
}else if(b=='S'){
return 'R';
}
}else if(a=='P'){
if(b=='R'){
return 'P';
}else if(b=='P'){
return 'P';
}else if(b=='... | #include<bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define all(a) a.begin(), a.end()
#define ff(i,a,b) for(int i=a;i<=b;i++)
#define fb(i,b,a) for(int i=b;i>=a;i--)
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int maxn = 300005;
const int inf = 1e9 + 5;
int ... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FAST ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define mp make_pair
#define pb push_back
#define lp(i,s,f) for(ll i = s; i < ll(f); i++)
#define inF freopen("input.in", "r", stdin);
#define outF freopen("output.in", "w", stdout... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;
template<class T> bool chmin(T& a,T b){if(a>b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a,T b){if(a<b) {a = b; return true;} return fa... |
/**
* author: otera
**/
#include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<... | #include<bits/stdc++.h>
#define ll long long
using namespace std;
char str[200005];
int freq[26];
int main()
{
scanf("%s", str);
vector<int>vec, let;
for(int i=0; str[i]; i++)
{
int x= str[i], cnt= 0;
while(str[i] && str[i]==x)i++, cnt++;i--;
vec.push_back(cnt);
let.push... |
#include <bits/stdc++.h>
#include <vector>
#include <cstdint>
#define FOR(i,l,r) for(int i=(l);i<(r);++i)
#define RFOR(i,l,r) for(int i=(l);i>=(int)(r);i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,n-1,0)
#define int long long
using namespace std;
const int MX = 1e6;
const int inf = 1e9+5;
const int mod... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
//#i... |
#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define pa pair<int,int>
const int Maxn=200010;
const int inf=2147483647;
const double pi=acos(-1.0);
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*10ll+ch-'0',ch=getchar();
... | #include<bits/stdc++.h>
#define ln puts("")
using namespace std;
typedef long long ll;
inline ll read() {
ll sum = 0, ff = 1;
char ch = getchar();
while(ch < '0' || ch > '9') {
if(ch == '-')
ff = -1;
ch = getchar();
}
while(ch >= '0' && ch <= '9')
sum = sum * 10 + ch - '0', ch = getchar();
return sum * ... |
#include <iostream>
using namespace std;
int main(void){
// Your code here!
int a;
cin>>a;
cout<<a-1<<endl;
}
| #include<bits/stdc++.h>
using namespace std;
int main()
{
char a;
cin>>a;
char b;
cin>>b;
if(a=='Y') printf("%c",b-32);
else printf("%c",b);
return 0;
} |
//DUEL
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define x first
#define y second
#define pii pair<int,int>
#define pb push_back
#define eb emplace_back
#pragma GCC optimize("unroll-loops")
#define shandom_ruffle(a, b) shuffle(a, b, rng)
#define vi vector<int>
#define vl vector<ll>
#define popcn... | #include<bits/stdc++.h>
#define pb push_back
using namespace std;
typedef unsigned long long ull;
typedef unsigned uint;
typedef long long ll;
#define G getchar()
ll read()
{
ll x=0; bool flg=false; char ch=G;
for (;!isdigit(ch);ch=G) if (ch=='-') flg=true;
for (;isdigit(ch);ch=G) x=(x<<3)+(x<<1)+(ch^48);
return fl... |
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
long long x,y;
cin >> x >> y;
long long a[3]={0};
if(x==y) cout<<x<<endl;
else
{
a[x]++;
a[y]++;
for(long long i=0;i<3;i++)
{
if(a[i]==0) cout<<i<<endl;
}
}
return 0;
} | #include <iostream>
using namespace std;
int main(){
int x,y;
cin >> x >> y;
if(x==y)
cout << x;
else
cout << 3-(x+y);
return 0;
} |
//#include <bits/stdc++.h>
#include <iostream>
#include <iomanip>
#include <math.h>
#include <cmath>
#include <algorithm>
#include <climits>
#include <functional>
#include <cstring>
#include <string>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <vector>
#include <stack>
#include <queue>
#include <dequ... | #include<cstdio>//JZM YYDS!!!
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<ctime>
#define ll long long
#define MAXN 100005
#define uns unsigned
#define MOD 1000000007ll
#define INF 1e18
using namespace std;
inline ll rea... |
#include <bits/stdc++.h>
using namespace std;
// #define int long long
#define Rep(x, a, b) for(int x = a; x <= b; ++ x)
#define Dep(x, a, b) for(int x = a; x >= b; -- x)
int read() {
char c = getchar(); int f = 1, x = 0;
while(c < '0' || c > '9') { if(c == '-') f = -1; c = getchar(); }
while(c >= '0' && c ... | #pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#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>
#inc... |
#include <bits/stdc++.h>
using namespace std;
// #define LOCAL // 提出時はコメントアウト
#define DEBUG_
typedef long long ll;
const double EPS = 1e-9;
const ll INF = ((1LL<<62)-(1LL<<31));
typedef vector<ll> vecl;
typedef pair<ll, ll> pairl;
template<typename T> using uset = unordered_set<T>;
template<typename T, typename U> usi... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void){
int n, ans = 0;
cin >> n;
vector<int> a(n);
for(int i = 0; i < n; i++) cin >> a[i];
for(int l = 0; l < n; l++){
int x = a[l];
for(int r = l; r < n; r++){
x = min(x, a[r]);
ans... |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
void readFile(){
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
const ll MOD = 1e9 + 7;
int main(){
readFile();
ios::sync_with_stdio(false);
cin.tie(NULL);
... | #include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define LCM(a, b) (a) / __gcd((a), (b)) * (b)
#define log_2(a) (log((a)) / log(2))
#define ln '\n'
using namespace std;
using LL = long long;
using... |
#include <iostream>
#include <vector>
#include <algorithm>
std::vector<std::vector<int>> children, list;
std::vector<int> in, out, depth;
int timer;
void dfs(const int u) {
in[u] = timer++;
list[depth[u]].push_back(in[u]);
for (const int v : children[u]) {
depth[v] = depth[u] + 1;
dfs(v);
... | //#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma")
//#pragma GCC optimization("unroll-loops")
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define int long long
template<class T> using indexed_set=tree<T,null_type,less<T>,rb_tree_tag,... |
// clang-format off
#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;
#ifndef godfather
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,a... | #include<iostream>
#include<algorithm>
using namespace std;
#define ll long long
ll B,C;
long a,b,c,d;
void fun1()//判断C的
{
ll n=C/2;
if(C%2==1)
{
a=-1*B-n;
b=-1*B+n;
}
else
{
if(C==0)
{
a=B;
b=B;
}
else
{
... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define db double
#define in inline
namespace fast_io
{
char buf[1<<12],*p1=buf,*p2=buf,sr[1<<23],z[23],nc;int C=-1,Z=0,Bi=0,ny;
in char gc() {return p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<12,stdin),p1==p2)?EOF:*p1++;}
in ll read()
{
ll x=0;ny=1;while... | //a.9
#include<bits/stdc++.h>
#define ll long long
#define all(x) x.begin(),x.end()
#define CASE(t) cout<<"Case #"<<(t)<<": ";
#define endll endl
#define endl '\n'
#define mod 1000000007
#define INF 1e18
#define maxN 500005
#define ios ios_base::sync_with_stdio(false); cin.tie(NULL)
using namespace std;
ll ceill(ll a,l... |
#include<bits/stdc++.h>
#define MAX 1000000007
#define MOD 998244353
#define ll long long int
#define fo(i,a,n) for(int i=a;i<n;i++)
#define ull unsigned long long int
#define pb push_back
#define eb emplace_back
#define in insert
#define cl clear
#define ii pair<int,int>
#define ld long double
const ll INF = 1e18;
us... | #include<stdio.h>
int main(){
int n,x;
scanf("%d%d",&n,&x);
int sum=0;
for(int i=0;i<n;i++){
int v,p;
scanf("%d%d",&v,&p);
sum+=v*p;
if(sum>x*100){
printf("%d\n",i+1);
return 0;
}
}
puts("-1");
} |
#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
inline int my_getchar_unlocked(){
static char buf[1048576];
static int s = 1048576;
static int e = 1048576;
if(s == e && e == 1048576){
e = fread_unlocked(buf, 1, 1048576, stdin);
s = 0;
}
if(s == e){
return EOF;
}
r... | #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 <iostream>
#include <vector>
#include <tuple>
#include <algorithm>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#define ll long long
#define rep(i,n) for(int i = 0;i < (int)n;i ++)
#define mod % 998244353
using namespace std;
int main(void){
ll n;
cin >> n;
ll A[n+1];
A[0] = 1;
r... | #include<bits/stdc++.h>
#define cs const
#define pb push_back
using namespace std;
cs int mod = 998244353;
int add(int a, int b) {
return a + b >= mod ? a + b - mod : a + b;
}
int mul(int a, int b) {
return 1ll * a * b % mod;
}
int dec(int a, int b) {
return a - b < 0 ? a - b + mod : a - b;
}
void Add(int &a, int b... |
#include<bits/stdc++.h>
#define pb emplace_back
#define AI(i) begin(i), end(i)
using namespace std;
using ll = long long;
template<class T>
bool chmax(T &val, T nv) { return val < nv ? (val = nv, true) : false; }
template<class T>
bool chmin(T &val, T nv) { return nv < val ? (val = nv, true) : false; }
#ifdef KEV
#defi... | #include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
// using namespace atcoder;
#define int long long
int h, w;
bool is_in(int i, int j){
return 0 <= i && i < h && 0 <= j && j < w;
}
int INF = 1<<30;
int a[2000][2000];
int point[2000][2000];
int ad(int i, int j){
bool flag1 = false, flag... |
#include <bits/stdc++.h>
using namespace std;
#include <algorithm>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<int,int>;
using T = tuple<int,int,int>;
using Graph = vector<vector<int>>;
const int INF = 1001001001;
void printVec(vector<int> &vec) {
for (auto itr = vec.begin(); i... | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0)->sync_with_stdio(0);
long long n; cin >> n;
map<long long,bool> m;
long long ans = n;
for (long long i = 2; i * i <= n; i++) {
if (m.count(i)) continue;
long long t = i * i;
while (t <= n) {
ans--;
m[t] = true;
... |
#include <bits/stdc++.h>
#include <unordered_set>
#include <cmath>
#include <algorithm>
// #include <atcoder/all>
// URL:
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;... | #include <stdio.h>
#include <string>
#include <algorithm>
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); i++)
using ll = long long;
using P = pair<int, int>;
int main()
{
int n, start = 0, end = 1005;
int a, b;
cin >> n;
rep(i,n){
cin ... |
#include<ctime>
#include<cstdio>
#include<cctype>
#define ll long long
using namespace std;
const ll N=2e6+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,m,k,jc[N],inv[N];
ll C(ll i,ll j){
i... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, n) FOR(i, 0, n)
#define FOR(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define ALLR(obj) (obj).rbegin(), (obj).rend()
#define CEIL(a, b) ((a - 1) / b + 1)
void solve() {
i... |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
if (N == 1 && M == 0) {
cout << 1 << " " << 2 << "\n";
return 0;
}
if (M < 0 || M >= N - 1) {
cout << -1 << "\n";
return 0;
}
vector<long long> L(N), R(N);
for (int i = 0; i < N; i++) {
... |
/**
* Dont raise your voice, improve your argument.
* --Desmond Tutu
*/
#include <bits/stdc++.h>
using namespace std;
const bool ready = [](){
ios_base::sync_with_stdio(false); cin.tie(0);
cout << fixed << setprecision(12);
return true;
}();
const double PI = acos(-1);
using ll= long long;
#define in... |
#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((in... | #include <iostream>
#include <string>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
using ll=long long;
using namespace std;
//const int mod = 1000000007;
const int mod = 998244353;
struct mint {
ll x; // typedef long long ll;
mint(ll x=0):x((x%mod+mod)%mod){}
mint operator-() const { ... |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn = 500500;
int t[maxn];
int n;
void upd(int p,int x) {
for(; p < maxn; p |= (p + 1)) t[p] += x;
}
int get(int p) {
int r = 0;
for(; p >= 0; p = (p & (p + 1)) - 1) r += t[p];
return r;
}
int main() {
ios_base::sync_with_stdio(0), cin.t... | #include <iostream>
#include <algorithm>
#include <unordered_set>
#include <set>
#include <vector>
#include <queue>
#include <map>
#include <numeric>
#include <math.h>
#include <complex>
using namespace std;
#define rep(i, n) for (long long int i = 0; i < (long long int)(n); i++)
#define irep(i, n) for (long long int... |
#include "bits/stdc++.h"
using namespace std;
#define rep(i, a, b) for(int i=a; i<=b; i++)
#define trav(a, x) for(auto& a : x)
#define all(x) begin(x), end(x)
#define sz(x) (int) x.size()
#define f first
#define s second
#define nl "\n"
#define pb push_back
typedef long long ll;
typedef vector<int> vi;
typedef pair<in... | #include<bits/stdc++.h>
#define ll long long
#define N 2005
using namespace std;
struct node{
int to,nxt;
}e[N*N*2];
int head[N],tot,d[N];
void build(int a,int b)
{
++d[a],++d[b];
e[++tot].to=b;
e[tot].nxt=head[a];
head[a]=tot;
e[++tot].to=a;
e[tot].nxt=head[b];
head[b]=tot;
}
int n,m,vis[N];
char mp[N][N];
voi... |
#include<bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<queue>
#include<vector>
#include<cstring>
#include<map>
#include<set>
#include<cstdlib>
#include<bitset>
using namespace std;
#define FAST ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
typedef long long ll;
#define N 200005
... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#ifdef ENABLE_DEBUG
#define dump(a) cerr<<#a<<"="<<a<<endl
#define dumparr(a,n) cerr<<#a<<"["<<n<<"]="<<a[n]<<endl
#else
#define dump(a)
#define dumparr(a,n)
#endif
#... |
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define chmin(a,b) a=min(a,b)
#define chmax(a,b) a=max(a,b)
#define mod 1000000007
#define ad(a,b) a=(a+b)%mod;
#define X 200010
ll po(ll x,ll y){
ll res=1;
for(;y;y... | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007ll
#define rep(i, n) for(int i = 0; i < n; i++)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
int main() {
int n; cin >> n;
vector<pair<string, int>> s(n);
for (int i=0; i<n; i++) {
... |
/*
これを入れて実行
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;
using ll=long long;
static const ll mod=1000000007;
ll H,W;
char f[2005][2005];
ll modpow(ll x,ll y){
if(y==0)
return 1;
else if(y%2==0){
ll z=modpow(x,y/2);
return (z*z)%mod;
}else{
ll z=modpow(x,y/2);
return (x*((z*z)%mod))%mod;
}
}
ll sum[2005][20... |
/*
Auth: StardustSphere
Time: 2021/01/10
Prog: ARC111-C
Lang: cpp
*/
#define F_C
#include <bits/extc++.h>
#define rep(i, l, r) for(int i = l; i < r; i++)
#define hrp(i, l, r) for(int i = l; i <= r; i++)
#define rev(i, r, l) for(int i = r; i >= l; i--)
#define ms(n, t) memset(n, t, sizeof(n))
#define pb emplace_back... | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double db;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_st... |
#include <bits/stdc++.h>
/* #include <atcoder/all> */
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
using namespace std;
/* using namespace atcoder; */
using ll = long long;
usin... | #include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
typedef long long ll;
typedef long double ld;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define mod 1000000007
#define pii pair<ll,ll>
#define inf 1000000000000000000
#define bpc(x) __... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repp(i, st, en) for (ll i = (ll)st; i < (ll)(en); i++)
#define repm(i, st, en) for (ll i = (ll)st; i >= (ll)(en); i--)
#define all(v) v.begin(), v.end()
void c... | #include <algorithm>
#include <iomanip>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <sstream>
#include <unordered_map>
#in... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll _mergeSort(ll arr[], ll temp[],
ll left, ll right);
ll merge(ll arr[], ll temp[], ll left,
ll mid, ll right);
ll mergeSort(ll arr[], ll array_size)
{
ll temp[array_size];
return _mergeSort(arr, temp, 0, array_size - 1);
}
/* An ... |
/**
* author: upsolver69
**/
#include<bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0); cin.tie(0);
#define f_in(file) freopen(file, "r", stdin)
#define f_out(file) freopen(file, "w", stdout)
#define sz(a) int((a).size())
#define pp pair
#define fi first
#define vt vector
#define se second
#define vt vect... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template<typename T>
void compress(vector<T>& A) {
vector<T> vals=A;
vals.push_back(0);
sort(vals.begin(),vals.end());
vals.erase(unique(vals.begin(),vals.end()),vals.end());
for(auto& e:A) e=distance(vals.begin(),lower_bound(vals.begin(),va... | #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 st... |
#include <bits/stdc++.h>
#define Fast cin.tie(0), ios::sync_with_stdio(0)
#define All(x) x.begin(), x.end()
#define louisfghbvc int t; cin >> t; for(int tt = 0; tt < t; ++tt)
#define sz(x) (int)(x).size()
#define sort_unique(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()));
using namespace std;
typedef... | //#include <atcoder/all>
#include <iostream>
#include <numeric>
#include <cmath>
#include <limits>
#include <stdio.h>
#include <iomanip>
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, ma... |
/*
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;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tre... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define sz(x) int(x.size())
using namespace std;
using ll = long long;
using P = pair<int,int>;
using tp = tuple<int,int> ;
#include <bits/stdc++.h>
using namespace std;
void dfs(int v, ll x, int from, const vector<vector<int>>& e, vector<ll>& dp){
... |
#include<bits/stdc++.h>
#define rep(i, n) for(int i=0;i<n;++i)
using namespace std;
typedef long long ll;
class UnionFind {
public:
vector<int> par, rnk;
void init(int n) {
for (int i = 0; i < n; i++) par.push_back(i);
rnk.resize(n, 0);
}
int find(int x) {
if (par[x] == x) re... | #include <bits/stdc++.h>
#define int long long
using namespace std;
inline int read(){
int s=0,w=1;
char ch=getchar();
while(ch<'0'||ch>'9'){
if(ch=='-')w=-1;ch=getchar();
}
while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
return s*w;
}
inline bool read(int& a){
int s=0,w=1;
... |
#include <bits/stdc++.h>
using namespace std;
#define fo(a,b) for(int64_t a=0;a<b;a++)
#define sor(a) sort(a.begin(),a.end())
#define rev(a) reverse(a.begin(),a.end())
#define ll int64_t
#define mod 1000000007
#define vl vector<int64_t>
int64_t rui(int64_t n,int64_t x){
int64_t i,s,ans;
i=0;
ans=1;
vector<int64_t> vec(... | //
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n'
const ll p = 998244353;
const int maxn = 5005+10;
ll fac[maxn];
ll Pow(ll x,ll d){
ll tans = 1;
if(d == 0)return 1%p;
ll a = Pow(x,d/2);
tans = a*a%p;
if(d%2)tans = tans*x%p;
return tans%p;
}
char G[maxn][maxn];
ll f[maxn][m... |
#include <bits/stdc++.h>
const long long INF = 1e9;
const long long MOD = 1e9 + 7;
//const long long MOD = 998244353;
const long long LINF = 1e18;
using namespace std;
#define YES(n) cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ? "Yes" : "No" ) << endl
#define POSSIBLE(n) cout << ((n) ? "POSSIB... | //Har Har Mahadev
using namespace std;
#include <bits/stdc++.h>
#define booga cout << "booga" << endl
#define ll long long int
#define pb push_back
#define mp make_pair
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
template <typename A, typename B>
string to_string(pair<A, B> p);
te... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define MOD 1000000007
int main() {
int a, b; cin >> a >> b;
cout << (a - b) / (double)a * 100 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main()
{
double A, B;
cin >> A >> B;
double ans = B / A;
ans = 1.0 - ans;
ans *= 100.0;
cout << fixed << setprecision(20) << ans << endl;
return 0;
}
|
#include<stdio.h>
#include<bits/stdc++.h>
#define ll long long int
#define inf 1000000000000
#define mod 1000000007
#define all(v) v.begin(),v.end()
#define fi first
#define se second
#define sz(x) (int)x.size()
#define ps(x,y) fixed<<setprecision(y)<<x
using namespace std;
int check, cnt, n;
ll k;
ll mat[9][9];
void... | #include<bits/stdc++.h>
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,abm,mmx,avx,avx2")
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define req(i,a,b) for(int i=(a);i>=(b);--i)
#define rep_(i,a,b) for(int i=(a);i<(b).size();++i)
#define F(a) rep(a,1,n)
#define M(a,b) memset(a,b,sizeof a)
#define DC int T;cin>>T;while(... |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = a; i <= b; i++)
typedef long long ll;
ll h, w, n, m, a[500010], b[500010], c[100010], d[100010];
ll ans;
int mp[2000][2000];
void run(int T) {
cin >> h >> w >> n >> m;
rep(i, 1, n) {
cin >> a[i] >> b[i];
mp[a[i]][b[i]... | #include <bits/stdc++.h>
using namespace std;
const int N = 4e5 + 5;
const int M = 1500 + 10;
const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};
char s[M][M];
int h, w, n, m, mark[M][M];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> h >> w >> n >> m;
for (int i = 0; i < ... |
#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<bits/stdc++.h>
using namespace std;
/*#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
typedef tree<long long,null_type,less<long long>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
s.find_by_order(x) xth element in set
x.order_of_key(x) number of elements <x*/
#define ll long... |
#include <stdio.h>
#include <iostream>
#include <vector>
#include <queue>
#include <set>
#include <algorithm>
using ll = long long int;
const int INF = (1<<30);
const ll INFLL = (1ll<<60);
const ll MOD = (ll)(1e9+7);
#define l_ength size
void mul_mod(ll& a, ll b){
a *= b;
a %= MOD;
}
void add_mod(ll& a, ll b){
a... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;++i)
#define ll long long
const ll mod=1000000007;
inline int roundup(int a, int b) { return (((a + (b -1)) / b)); }
inline ll powmod(ll x, ll y) {ll res=1; for(ll i=0;i<y;i++){ res=res*x%mod; } return res;}
using namespace std;
signed main(void) {
cout << ... |
#include <cstdio>
#include <cctype>
using namespace std;
const int max_n = 200000;
int a[max_n], wa[max_n], ps[max_n], wa_cnt = 0;
bool us[max_n] = {};
#define gc getchar
inline int read()
{
int c = gc(), t = 1, n = 0;
while (isspace(c)) { c = gc(); }
if (c == '-') { t = -1, c = gc(); }
while (isdigit(c)) { n = n... | #include<bits/stdc++.h>
#define int long long
using namespace std;
int N,P[500];
vector<int> ans;
void f(int a){
ans.push_back(a);
swap(P[a],P[a+1]);
}
signed main(){
int T; cin>>T;
while(T--){
cin>>N;
for(int i=0;i<N;i++) cin>>P[i],P[i]--;
ans.clear();
for(int i=0;i<N-2;i++){
int d=i;
... |
#define ll long long
#include<bits/stdc++.h>
using namespace std;
const ll N = 805;
const ll range = 1e9;
ll a[N][N];
ll s[N][N],b[N][N];
int main()
{
ll n,k,l=0,mid,r=range,i,j;
cin>>n>>k;
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)cin>>a[i][j];
}
ll lim = ((k*k)/2) + 1;
while(l<=r)
{
... | #include <iostream>
#include <cstring>
#include <cstdio>
#include <map>
#define LL long long
#define Maxn 200005
using namespace std;
LL read() {
LL x = 0, f = 1;
char c = getchar();
while(c < '0' || c > '9') {
if(c == '-') f = -1;
c = getchar();
}
while('0' <= c && c <= '9') {
x = x * 10 + c - '0';
c =... |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <queue>
#include <map>
#include <set>
using namespace std;
using ll = long long int;
using ld = long double;
using P = pair<int, int>;
vector<vector<int>> dp;
vector<vector<bool>> visited;
vector<s... | //pls work
#include <bits/stdc++.h>
#include <cmath>
#include <cctype>
#include <cstring>
#define fori(i, j, k, in) for (int i = j; i < k; i += in)
#define rfori(i, j, k, in) for (int i = j - 1; i >= k; i -= in)
#define rep(i, j) fori(i, 0, j, 1)
#define rrep(i, j) rfori(i, j, 0, 1)
#define sq(a) (a) * (a)
#define... |
#include<bits/stdc++.h>
clock_t __t=clock();
namespace my_std{
using namespace std;
#define pii pair<int,int>
#define fir first
#define sec second
#define MP make_pair
#define rep(i,x,y) for (int i=(x);i<=(y);i++)
#define drep(i,x,y) for (int i=(x);i>=(y);i--)
#define go(x) for (int i=head[x];i;i=edge[i].nxt)
... | #include<iostream>
#include<list>
#include<set>
#include<map>
#include<vector>
using namespace std;
typedef long long li;
#define rep(i,n) for(int i=0;i<(n);i++)
#define df 0
template<class T> void print(const T& t){ cout << t << "\n"; }
template<class T, class... Ts> void print(const T& t, const Ts&... ts) { cout << t... |
#include<bits/stdc++.h>
using namespace std;
inline long long read()
{
long long sum=0,naga=1;char ch=getchar();
while(ch>'9'||ch<'0'){if(ch=='-')naga=-1;ch=getchar();}
while(ch<='9'&&ch>='0')sum=sum*10+ch-'0',ch=getchar();
return sum*naga;
}
inline void write(long long X)
{
if(X<0)putchar('-'),X=-X;
if(X>9)write... | #include <bits/stdc++.h>
using namespace std;
#define st first
#define nd second
#define pb push_back
#define cl(x,v) memset((x), (v), sizeof(x))
#define db(x) cerr << #x << " == " << x << endl
#define dbs(x) cerr << x << endl
#define _ << ", " <<
typedef long long ll;
typedef long double ld;
typedef pair<int,int> p... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define db double
const int maxn=2e5+10;
int n,m,t,is,cnt,ans;
string p;
int sum[10],q[150];
int main(){
#ifdef ONLINE_JUDGE
#else
freopen("in.txt","r",stdin);
freopen("out.txt","w",stdout);
#endif
ios::sync_with_stdio(false);
cout<<fixed<<setpre... | #include <bits/stdc++.h>
const int N = 200005, P = 1e9 + 7;
char s[N]; int n, K, c[16], fac[20], ifac[20];
int qpow(int a, int b) {
int t = 1;
for (; b; b >>= 1, a = 1LL * a * a % P)
if (b & 1) t = 1LL * t * a % P;
return t;
}
int idx(char c) {
if (isdigit(c)) return c - '0';
else return c - 'A' + 10;
}
int C(in... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<ll,ll> P;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define EFOR(i,a,b) for(int i=(a);i<=(b);++i)
#define REP(i, n) FOR(i,0,n)
#define INF 10e9
#define PI acos(-1)
bool cmp(const pair<int, int>& a, const pair<int, int>& b){
if(a.seco... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define ff first
#define ss second
#define f(i,a,b) for(int i = a; i < b; i++)
#define fa(i,a,b) for(int i = a; i >= b; i--)
const int inf=1e9+10;
const... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
// ap + bq = gcd(a, b) なる (p, q) を求め d = gcd(a, b) を返す
ll extgcd(const ll a, const ll b, ll &p, ll &q){
if (b==0) { p=1; q=0; return a; }
ll d = extgcd(b, a%b, q, p);
q -= a/b * p;
return d;
}
// x mod s = a, x mod t = b なる x >= 0 の最小... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define IFOR(i, a, b) for (long long i = (a); i <= (long long)(b); i++)
using namespace std;
using VL = vector<long long>;
using ll = int64_t;
ll mod(ll x,ll m){ll y=x%m;return (y>=0LL)?y:y+m;}
template<class T>bool chmin(T& a, T b){if(a>b){a... |
#include <bits/stdc++.h>
using namespace std;
#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 all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
template <typename T>
void updat... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
string c;
cin >> c;
char a[] = "BWR";
for (int i = 0; i < n; i++) {
c[i] = c[i] == a[0] ? 0 : c[i] == a[1] ? 1 : 2;
}
int t = 0,... |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const double PI = 3.141592653589793238;
int main() {
ll N, Q;
cin >> N >> Q;
vector<ll> A(N);
for (ll i = 0; i < N; ++i) cin >> A[i];
for (ll q = 0; q < Q; ++q) {
ll K;
cin >> K;
ll l = -1, r = (LLONG_MA... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long int
#define double long double
#define pb push_back
#define fi first
#define se second
#define vi vector<int>
#define pii pair<int,int>
#defi... |
#include<iostream>
int main() {
int N;
char cAA,cAB,cBA,cBB;
std::cin>>N>>cAA>>cAB>>cBA>>cBB;
if (cAA=='A'&&cAB=='A') {
std::cout<<'1'<<std::endl;
} else if (cAB=='B'&&cBB=='B') {
std::cout<<'1'<<std::endl;
} else if (N==2) {
std::cout<<'1'<<std::endl;
} else if (
(cAA=='A'&&cAB=='B'&&cBA==... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
//template
#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define ALL(v) (v).begin(),(v).end()
using ll=long long int;
const int inf = 0x3fffffff; const ll INF = 0x1fffffffffffffff; const double eps=1e-12;
template<typename T>inline bool ch... |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define ff first
#define ss second
#define mp make_pair
typedef long long int ll;
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ll n, m; cin >> n >> m;
ll a[n][m];
ll mi = 9999;
ll s... | #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,int>
#define Tp tuple<int,int,int>
using Graph = vector<vector<int>>;
int main(){
int N; cin >> N;
ll left[N+1],right[N+1]; bool col[N+1];
rep(i,N+1){
left[i] = 100000... |
#include <bits/stdc++.h>
// ifブロックはインデントがいる
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
#define repp(i, l, r) for (long long i = (l); i < (r); i++)
#define rep(i, n) for (long long i = 0; i < (n); ++i)
#define per(i, n) for (long long i = (n); i >= 0; --i)
#define all(v) v.be... | #include<bits/stdc++.h>
using namespace std;
template<class T> inline bool chmin(T& a,const T b){bool x=a>b;if(x)a=b;return x;}
constexpr int inf=1<<30;
double tate[29][30],yoko[30][29];
double dist[30][30];
int tateaccu[29][30],yokoaccu[29][30];
bool vis[30][30];
char rev[30][30];
using P=tuple<double,int,int>;
void... |
#include<cstdio>
#include<cstring>
#define int long long
const int N=105,MOD=998244353;
int n;
int w[N];
int f[N][N*N],fac[N],ans;
signed main()
{
scanf("%lld",&n);
for(int i=1;i<=n;++i)
{
scanf("%lld",w+i);
w[0]+=w[i];
}
fac[0]=1;
for(int i=1;i<=n;++i)
fac[i]=fac[i-1]*i%MOD;
if(w[0]%2)
printf("0\n")... | #include <iostream>
#include <vector>
#include <string>
#include <unordered_map>
#include <bitset>
#include <map>
// #include <bits/stdc++.h>
uintmax_t combination(unsigned int n, unsigned int r) {
if ( r * 2 > n ) r = n - r;
uintmax_t dividend = 1;
uintmax_t divisor = 1;
for ( unsigned int i = 1; i <= r; ++i ... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < n; ++i)
using C = complex<double>;
const ll md = 1000000007;
int main(){
int n;
cin >> n;
cout << n - 1 << endl;
return 0;
} | #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++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef vector<int> vi;
int main() {
ll n;
scanf("%lld", &n);
vector<ll> a;
for(ll i=2;i<=n;i++){
... |
//#include <atcoder/all>
#include <bits/stdc++.h>
#include <cassert>
#include <numeric>
using namespace std;
//using namespace atcoder;
typedef long long LONG;
const int MOD = 1000000007;
int gcd(int x, int y) {
if (x % y == 0) {
return y;
}
else {
return gcd(y, x % y);
//x%y==0でないときはユーグリットの互除法を使って再帰的に関数を呼... | #include<cmath>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define ch() getchar()
#define pc(x) putchar(x)
using namespace std;
template<typename T>void read(T&x){
char c;int f;
for(c=ch(),f=1;c<'0'||c>'9';c=ch())if(c=='-')f=-f;
for(x=0;c>='0'&&c<='9';c=ch())x=x*10+(c&15);x*=f;
}
templ... |
#include<iostream>
#include<cmath>
#include<vector>
#include<bitset>
#include<bitset>
#include<string>
#include<utility>
#include<queue>
#include <iomanip>
#include <limits>
#include<tuple>
#include<algorithm>
#include<set>
using namespace std;
typedef long long int ll;
// ll
int main(){
string s;
cin >> s;
... | #ifndef Local
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("popcnt,abm,mmx,avx2")
#endif
#include <bits/stdc++.h>
using namespace std;
#define popCnt(x) (__builtin_popcountll(x))
#define sz(x) ((int)(x.size()))
#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
#define rep(i, l,... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a, b, w;
cin >> a >> b >> w;
int m = 1e9, M = 0;
for (int n = 1; n <= 1000000; n++)
{
if (a * n <= 1000 * w && 1000 * w <= b * n)
{
m = min(m, n);
M = max(M, n);
}
}
if (M == 0)
... | #include<bits/stdc++.h>
using namespace std;
int main(){
char a,b,c;
cin>>a>>b>>c;
if(a==b&&b==c){
cout<<"Won";
}
else cout<<"Lost";
} |
#include "bits/stdc++.h"
using namespace std;
using ll = int64_t;
using vi = vector<int>;
using vb = vector<bool>;
using si = set<int>;
#define pb push_back
#define ist insert
#define sz(x) int((x).size())
#define ice(i, a, b) for (int (i) = (a); (i) < (b); ++(i))
vector<si> adj(20);
vi comp, colors(20, -1); vb ... | // YATIN KWATRA
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ar array
#define sz(v) (int)(v.size())
#define inf 1e18
#define int... |
//I'll always miss you like a darling.
#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define LD long double
#define ull unsigned long long
#define x first
#define y second
#define pb push_back
#define pf push_front
#define mp make_pair
#define Pair pair<int,int>
#define pLL pair<LL,LL>
#define pii... | #include <bits/stdc++.h>
using namespace std;
int _ = (cout << fixed << setprecision(9), cin.tie(0), ios::sync_with_stdio(0));
using Int = long long;
template <class T>
using MinHeap = priority_queue<T, vector<T>, greater<T>>;
int main() {
int N; cin >> N;
vector<int> V(2 * N); for (auto &v : V) cin >> v;
M... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long INF = 1LL<<60;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
#define rep(i, n) for ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pdd;
#define lc u << 1
#define rc u << 1 | 1
#define mid (t[u].l + t[u].r) / 2
#define INF 0x3f3f3f3f
#define lowbit(x) x & (-x)
#define mem(a, b) memset(a , b , sizeof(a))
#define FOR(i, x, n) for(int... |
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define int long long... | #include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <tuple>
#include <cstdio>
#include <cmath>
#define rep(i, n) for(i = 0; i < n; i++)
#define int long long
using namespace std;
int n;
int x[200000]... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
const string YES = "Yes";
const string NO = "No";
const double PI = 3.14159265359;
struct Gi {
ll a, b;
explicit Gi(ll x = 0, ll y = 0) : a(x)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
struct Vec {
ll x, y;
Vec(ll _x = 0, ll _y = 0) : x(_x), y(_y) {}
Vec operator-(const Vec &o) const {
return {x - o.x, y - o.y};
}
Vec operator+(const Vec &o) const {
return {x + o.x, y + o.y};
}
Vec operat... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.