code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
#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>
using namespace std;
const int MAX_LEN = 50;
string DIR[4] = {"U", "D", "L", "R"};
int depth;
int si, sj;
int t[MAX_LEN][MAX_LEN], p[MAX_LEN][MAX_LEN];
int next_sim(int i, int j, bool visited[], int num) {
if ( num == 0 ) { return p[i][j]; }
bool *now_visited;
now_visited = new boo... |
#include "bits/stdc++.h"
#include "random"
#include <unistd.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define vl vector<long long>
#define vvi vector<vi>
#define pi pair<int,int>
#define mp make_pair
#define pb push_back
#define MOD int(1e9) + 7
#define PAI 3.1415926535
#define all(x) (x... | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int n;
cin >> n;
vector<int> a(n),t(n);
for (int i = 0; i < n; i++) {
cin >> a[i] >> t[i];
}
int q;
cin >> q;
vector<int> x(q);
for (auto &it:x) cin >> it;
int sum = 0;
int l = -INT_MAX;
int r = INT_MAX;
... |
#include <iostream>
using namespace std;
int main(){
int A, B, C;
cin >> A >> B >> C;
cout << (A + C > B ? "Takahashi" : "Aoki") << endl;
} | #include <iostream>
#include<bits/stdc++.h>
using namespace std;
int main(){
int x,y,z;cin>>x>>y>>z;
if(x==y && z==0){
cout<<"Aoki";
}
else if(x==y && z==1){
cout<<"Takahashi";
}
else if(x>y){
cout<<"Takahashi";
}
else{
cout<<"Aoki";
}
return 0;
} |
#include <bits/stdc++.h>
#define Rep(i,n,m) for(int i=(int)(n);i<(int)(m);i++)
#define rep(i,n) Rep(i,0,n)
#define all(v) v.begin(),v.end()
using namespace std;
using ll=long long;
using vi=vector<int>;
using vll=vector<ll>;
#define _GLIBCXX_DEBUG
const double e=0.000001;
const double pi=M_PI;
struct Point{
double x,... | #include <bits/stdc++.h>
#define rep3(i, s, n, a) for (int i = (s); i < (int)(n); i += a)
#define rep2(i, s, n) rep3(i, s, n, 1)
#define rep(i, n) rep2(i, 0, n)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
int main() {
ll n, k;
cin >> n >> k;
ll res... |
#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <bitset>
#include <ctime>
#include <map>
#include <uno... | #include<bits/stdc++.h>
using namespace std;
using namespace std::chrono;
const int mod=1e9+7;
const int mex=2002;
#define ll long long
#define test int t;cin>>t;while(t--)
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);
#define fo(i,a,n) for(int i=a;i<n;i++)
#define rfo(i,a,b) for(int i=a;i>=b;i--)
#de... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define MS(x) memset((x), -1, sizeof((x)))
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; }
int yta(){
int n;
cin >> n;
... | #define MOD_TYPE 1
#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
#if 0
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using Int = boost::multiprecision::cpp_int;
using lld = boost::multiprecision::cpp_dec_float_100;
#endif
#if 1
#pragma GCC target(... |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
int array1[N], array2[N];
for(int i = 0; i < N; i++) cin >> array1[i];
for(int i = 0; i < N; i++) cin >> array2[i];
int result = 0;
for(int i = 1; i <= 1000; i++){
bool check = true;
for(int j = 0; j < ... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
vector<int> a(n), b(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
for (int i = 0; i < n; ++i)
cin >> b[i];
int l = 0, r = 1000;
... |
// __________________
// | ________________ |
// || ____ ||
// || /\ | ||
// || /__\ | ||
// || / \ |____ ||
// ||________________||
// |__________________|
// \###################\
// \###################\
// \ ____ \
// \_______\___\_______\
// An AC a ... | #include<bits/stdc++.h>
#define ll long long
#define clr(x,i) memset(x,i,sizeof(x))
using namespace std;
const int N=2005;
inline int read()
{
int x=0,f=1; char ch=getchar();
while(ch<'0'||ch>'9') {if(ch=='-') f=-1; ch=getchar();}
while(ch>='0'&&ch<='9') {x=x*10+ch-'0',ch=getchar();}
return x*f;
}
const... |
#include <bits/stdc++.h>
#define dbg(args...){ string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }
#define fastio() ios_base::sync_with_stdio(false); cin.tie(nullptr)
#define pb push_back
#define ff first
#define ss second
using namesp... |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define Kshitiz ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(0);
#define deb(x) cout << #x << " is :" << x << "\n";
#define print(x) cout << x << "\n";
#define int long long
#define forf(i,k,n) for (int i = k; i < n; i++)
#define forb(i,n... |
#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using P=pair<ll,ll>;
template<class T> using V=vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
const ll inf=(1e18);
//const ll mod=998244353;
const ll mod=1000000007;
const vector<int> dy={-1... | #include<bits/stdc++.h>
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;
int main(){
long long n;
long long t;
cin >> t >> n;
long long ans = (n*100-1)/t + n;
cout << ans <<endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
using P=pair<int,int>;
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
ll t,n;
cin >> t >> n;
ll l=0,r=1e15;
while(l+1<r){
ll i=(l+r)/2;
ll k=i*(100+t)/100-i;
if(n<=k) r=i;
else l=i;
}
cout << l*(100+t... |
#include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<N;i++)
#define rep2(i,N) for(int i=1;i<=N;i++)
using namespace std;
long long INF=1e18;
long long mod=1e9+7;
long long GCD(long long a, long long b) {
if (a < 0) a = -a;
if (b < 0) b = -b;
if (b == 0) return a;
else return GCD(b, a % b);
}
long l... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using Graph= vector<vector<int>>;
#define rep(i,n) for (ll i=0; i < (n); ++i)
#define rep2(i,n,m) for(ll i=n;i<=m;i++)
#define rep3(i,n,m) for(ll i=n;i>=m;i--)
#define pb push_back
#define eb emplac... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1000000007;
#define REP(i, n) for (ll i = 0; i < (n); i++)
#define REP2(i, x, n) for (ll i = x; i < (n); i++)
#define PR(x) cout << (x) << "\n"
#define PS(x) cout << (x) << " "
#define PRYES(x) PR((x) ? "Yes" : "No")
const lo... | #pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef vector<long double> vd;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<pair<ll,ll>> vp;
#define ... |
#include <bits/stdc++.h>
using namespace std;
//using namespace atcoder;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=... | #include <bits/stdc++.h>
using namespace std;
int main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
long long int B,C;
long long int res = 0;
vector <pair<long long int,long long int>> seg;
cin >> B >> C;
//1. 빼는 경우
long long int L = B - (C/2);
long long int R = B;
seg.push_back(make_pair(L,R))... |
#ifdef LOGX
#define _GLIBCXX_DEBUG
#endif
#include <bits/extc++.h>
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
/*---------macro---------*/
#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 ALL(a) a.begin(),a.end()
#define ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fo(i, k, n) for(int i = k; i < n; i++)
#define deb(x) cout<<#x<<" = "<<x<<endl;
#define el endl
#define ff first
#define ss second
#define pb push_back
void solve(){
string s;
cin>>s;
for(int i = 1; i < s.length(); i++){
... |
#include <bits/stdc++.h>
using namespace std;
#define Gene template< class
#define Rics printer& operator,
Gene c> struct rge{c b, e;};
Gene c> rge<c> range(c i, c j){ return {i, j};}
struct printer{
~printer(){cerr<<endl;}
Gene c >Rics(c x){ cerr<<boolalpha<<x; return *this;}
Rics(string x){cerr<<x;return... | #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;
ll dp_mask[1 << 16][17][17];
int64_t solveCase(int64_t H, int64_t W, int64_t A, int64_t ... |
#include<bits/stdc++.h>
using namespace std;
inline int read(){
int res=0;
bool zf=0;
char c;
while(((c=getchar())<'0'||c>'9')&&c!='-');
if(c=='-')zf=1;
else res=c-'0';
while((c=getchar())>='0'&&c<='9')res=(res<<3)+(res<<1)+c-'0';
if(zf)return -res;
return res;
}
const int N=2e5+5;
int dta[N];
vector<int>G[N];... | #include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
using pii = pair<i64, i64>;
#define rep(i, n) for (i64 i = 0; i < i64(n); i++)
#define per(i, n) for (i64 i = n - 1; i >= 0; i--)
#define REP(i, a, b) for (i64 i = a; i < i64(b); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 1e+7;
const ld PI = acos(-1);
const ld EPS = 1e-8;
const ll LINF = 1LL<<60;
const int INF = 1LL<<17;
#define rep(i, a, b) for(ll i=a; i<(ll)(b); i++)
#define rrep(i, a, b) for(ll i=b-1; a<=i; i--)
#define ALL(x)... | #include<bits/stdc++.h>
#define int long long
using namespace std;
struct edge{
int to,next;
}e[10000];
int n,m,a[30],head[30],cnt,ans=1,res,t,b[30];
bool vis[30];
inline void add(int u,int v){
cnt++;
e[cnt].to=v;
e[cnt].next=head[u];
head[u]=cnt;
}
inline void dfs1(int u){
for(int i=head[u];i;i=e[i].next){
int... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define io ios::sync_with_stdio(false); cin.tie(0)
const ll INF = 1L << 60;
struct edge { int to; ll cost; int k; };
struct graph{
int V;
vector<vector<edge... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
const long long inf = 1LL<<60;
using ll = long long;
int main(){
int n;
cin >> n;
string s, t;
cin >> s >> t;
auto solve = [&]() -> ll {
deque<ll> a, b;
for (int i=0; i<n; i++) {
if (s[i] == '1') a.push_back(i);
if (t[i] ... |
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdlib>
#include<queue>
#include<set>
#include<cstdio>
#include<map>
#include<cassert>
using namespace std;
#define ll long long
#define reps(i, a, b) for(int i = a; i < b; i++)
#define rreps(i, a, b) for(int i = a-1; i >= b; i--)
#def... | #include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
const int N = 510, mod = 998244353;
int n, m;
char a[N][N];
int c[2 * N];
int main(){
scanf("%d%d", &n, &m);
for(int i = 1; i <= n; i ++) scanf("%s", a[i] + 1);
for(int i = 1; i <= n; i ++)
for(int j = 1; j <... |
#include<bits/stdc++.h>
#include<iostream>
#include<math.h>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
int main()
{
int a,b,c;
cin>>a>>b>>c;
int arr[6];
for(int i=0;i<6;i++){
arr[i]=6-i;
}
int x=arr[a-1]+arr[b-1]+arr[c-1];
cout<<x;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main()
{
vector<int> a(3);
int sum(0);
for(auto &x:a)
{
cin>>x;
sum=sum+x;
}
cout<<(21-sum);
return 0;
}
|
#include <iostream>
#include <cstring>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <vector>
#include <queue>
#include <random>
using namespace std;
const long long MAXT = 1000000007;
int a, b;
vector<int> res;
int main() {
... | #define _USE_MATH_DEFINES
#include <iostream>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
#include <cstring>
#include <cmath>
#include <stack>
#include <iomanip>
#include <tuple>
#include <functional>
#include <cfloat>
#include <map>
#i... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=1;i<=n;++i)
#define mp make_pair
#define pb push_back
#define size sze
#define inf 998244353
int n,k;
vector<int> g[210000];
int v[210000],dep[210000];
int q[210000];
int f[210000][20],size[210000],son[210000],minp[210000];
int father[210000],root... | //Code by oryon
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define pb push_back
#define ppb pop_back
#define int long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define mii map<int, int>
#define pii pair<int, int>
#define sz(a) (a... |
/* --------------------
| LOSER |
| ~NOOBOSS~ |
--------------------
*/
#include <bits/stdc++.h>
using namespace std;
#define mxx LLONG_MAX
#define mnn LLONG_MIN
#define Y() cout<< "YES" <<endl
#define N() ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;//大きなint型
using P = pair<int,int>;//pair型の型エイリアス
#define rep(i,n) for (int i = 0; i < (n); ++i)//iをnまですすめる。
ll my_pow(ll x, ll n) {
if (n == 0) return 1;
if (n % 2 == 0) return my_pow(x * x, n / 2);
return x * my_pow(x, n - 1);
}
int main()... |
#include <bits/stdc++.h>
#include <cstdio>
using namespace std;
typedef long long int int64;
struct Edge {
int to;
};
using Graph = vector<vector<Edge>>;
vector<int> V[200010];
// 深さ優先探索
vector<bool> seen; // 探索したか記録
void dfs2(const Graph &GG, int v,int cnt) {
//printf("z");
seen[v] = true;
for (aut... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef double dd;
#define tst int tttt;cin>>tttt;for(int TTTT=1;TTTT<=tttt;TTTT++)
#define nl cout<<"\n";
#define forn(a,b) for(int ii=a;ii<b;ii++)
const ll MOD1=1e9+7;
const ll MOD2=998244353;
#define mp(a,b) make_pair(a,b)
#define pb(a) push_bac... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rep_up(i, a, n) for (ll i = a; i < n; ++i)
#define rep_down(i, a, n) for (ll i = a; i >= n; --i)
#define P pair<ll, ll>
#define all(v) v.begin(), v.end()
#define fi first
#define se second
#define v... | #pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include<stdio.h>
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<string.h>
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define NDEBUG
#define eprintf(...) do {} while (0)
#endif
#include<cassert>
using ... |
#include <bits/stdc++.h>
template <typename T>
T next() {
T temp; std::cin >> temp;
return temp;
}
template <>
int next() {
int temp; scanf("%d", &temp);
return temp;
}
template <>
long long next() {
long long temp; scanf("%lld", &temp);
return temp;
}
template <>
double next() {
double te... | // #pragma GCC optimize ("O3")
#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 <class T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <class ke... |
#include <cassert>
#include <cstdint>
#include <iostream>
#include <vector>
#define REP_(i, a_, b_, a, b, ...) \
for (int i = (a), lim##i = (b); i < lim##i; i++)
#define REP(i, ...) REP_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
using namespace std;
using Int = int64_t;
template <class T>
struct Matrix {
... | #include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define mod 1000000007
#define pdd pair<double,double>
#define pii pair<ll,ll>
#define fi first
#define sec second
#define MAXN 1000000000000000005
#define N 300005
#define lgn 20
using namespace std;
#define TRACE
#ifdef TRACE
#define trace(...) __f(... |
#include <bits/stdc++.h>
#define LL long long
#define PII pair<int,int>
#define PIL pair<int,LL>
#define PLI pair<LL,int>
#define PIII pair<int,PII>
#define PLL pair<LL,LL>
#define PLII pair<LL,PII>
#define VI vector<int>
#define VVI vector<VI>
#define VL vector<LL>
#define VVL vector<VL>
#define VPII vector<PII>
#defi... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using ll = int64_t;
using ull = uint64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007;
constexpr long long INF = 1000000000 + 100;
constexpr long long LINF = 1000000000000000000 + 100;
#define all(v) v.begin(), v.end()
#define rep(i, ... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
inline int read(){
int 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 * 10 + c - '0';
c = getchar();
}
return x * f;
}
const int maxn = 505;
int a[maxn... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n,m;
int main()
{
cin>>n>>m;
vector<int> v(m+2);
v[0] = 0;
v[m+1] = n+1;
for(int i=1;i<=m;i++){
cin>>v[i];
}
sort(v.begin(),v.end());
int mm = n;
for(int i=1;i<m+2;i++){
int d = v[i]-v[i-1];
... | #include <bits/stdc++.h>
#define arr(i,n) for(ll i=0;i<n;i++)
#define ARR(i,n) for(ll i=n-1;i>=0;i--)
#define f(i,a,b) for(ll i=a;i<b;i++)
#define F(i,a,b) for(ll i=b-1;i>=a;i--)
#define float double
#define PI 3.14159265358979323846
#define pb push_back
#define mp make_pair
#define vi vector<ll>
#define ceil(a,b) ce... |
#include<bits/stdc++.h>
using namespace std;
#define fastio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define int long long
#define rep(i,j,n) for(int i=j;i<n;i++)
#define scn(a) scanf("%lld",&a)
#define pri(a) printf("%lld",a)
#define prinl(a) printf("%lld\n",a)
#de... | #include<bits/stdc++.h>
using namespace std;
#define dd double
#define ll long long int
#define ull unsigned long long
#define lld long double
#define light ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pb push_back
#define mkp make_pair
#define pi pair<ll,ll>
#define pii pair<ll,pi>
#define fi first
#... |
#include<bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define frfr freopen("input.txt","r",stdin); //freopen("output.txt","w",stdout)
#define ll long long int
#define wh int T;cin >> T;while(T--)
#define foro(i,n) for(int i=0;i<n;i++)
void solve()... | #include <bits/stdc++.h>
using namespace std;
template<typename T> using vec = vector<T>;
template<typename K, typename V> using umap = unordered_map<K, V>;
using ll = long long;
using ld = long double;
using str = string;
using pll = pair<ll, ll>;
using vll = vec<ll>;
using vi = vec<int>;
using vs = vec<str>;
using ma... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int a,b,c;
cin >> a >> b >> c;
if(a*a + b*b < c*c) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | #include <ctime>
#include <deque>
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
#include <climits>
#include <cmath>
#include <sstream>
#include <iomanip>
#include <map>
#include <stack>
#include <regex>
#include <set>
#include <bitset>
const int64_t infl = 1LL << 60;
con... |
#include <bits/stdc++.h>
#define ll long long
#define vll vector<ll>
#define vpp vector<pair<pair<ll, ll>, ll>>
#define vp vector<pair<ll, ll>>
#define mk make_pair
#define pb push_back
#define IOS ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define N 1000000007
using namespace std;
void fun()
{
// code... | #include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<util... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<pll> vpll;
typedef vector<vpll> vvpll;
typedef vector<bool> vbl;
typedef vector<vector<bool>> vvbl;
typedef pair<string, ll> pstl... | /********include********/
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <ra... |
#include <bits/stdc++.h>
#define db1(x) cout<<#x<<"="<<x<<'\n'
#define db2(x,y) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<'\n'
#define db3(x,y,z) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<","<<#z<<"="<<z<<'\n'
#define rep(i,n) for(int i=0;i<(n);++i)
#define repA(i,a,n) for(int i=a;i<=(n);++i)
#define fast ios_base::sync_with_stdio(0... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef ve... |
#include <iostream>
using namespace std;
typedef long long ll;
int main()
{
ll s, p;
cin >> s >> p;
for(ll i = 1; i * i <= p; i++){
if(p % i == 0 && i + p / i == s){
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define scan(any) for(auto &i:any) cin>>i;
#define print(any) for(auto i:any) cout<<i<<" ";
#define endl '\n'
#define pb push_back
#define vll vector<ll>
#define f(i,x,y) for(i=x;... |
#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define ll long long
#define ALL(a) (a).begin(),(a).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define Pii pair<int,int>
#define Pll pair<long long,long long>
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#defin... |
#include<bits/stdc++.h>
// #include<atcoder/all>
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
#define all(x) (x).begin(),(x).end()
#pragma ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int gcd(int a, int b){
if(b == 0) return a;
return gcd(b, a % b);
}
int main() {
int N,W;
cin >> N >> W;
if(N%W == 0){
cout << N/W;
} else {
cout << (N-N%W)/W;
}
} |
#include<bits/stdc++.h>
using namespace std;
int H,W;
int A[101][101];
int func(int i,int j)
{
int ans = 0;
if((j > 0)&&(A[i][j-1] == 1))
{
ans++;
}
if((i > 0)&&(A[i-1][j] == 1))
{
ans++;
}
if((j < W-1)&&(A[i][j+1] == 1))
{
ans++;
}
if((i < H-1)&&(A[i+1][j] == 1))
{
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef map<int,int> mii;
typedef map<ll,ll> mll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
#define f(i,n) for(i=0;i<n;i++)
#define f1(i,n) for(i=1;i<n;i++)
#d... |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
const int l1[8] = {0,4,8,10,11,12,14,15};
const int l2[4] = {2,3,5,13};
const int l3[4] = {1,6,7,9};
int n, mask, F[1005];
int main() {
char c1, c2, c3, c4;
scanf("%d %c %c %c %c", &n, &c1, &c2, &c3, &c4);
c1 -= 'A';
c2 -= 'A';
c3 -= 'A';
c... | #include <cstdio>
const int Mod = 1000000007;
int N;
char AA[3], AB[3], BA[3], BB[3];
void pow2() {
int n = N - 3;
int res = 1;
for (int i = 1; i <= n; ++i)
res = res * 2 % Mod;
printf("%d\n", res);
}
void fib() {
int n = N - 3;
int a1 = 1, a2 = 1;
for (int i = 1; i <= n; ++i) {
int tmp = (a1 + a2) % Mod... |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int N, K;
cin >> N >> K;
int T[N][N];
vector<int> array(0);
for(int i = 0; i < N; i++){
array.push_back(i);
}
for(int i = 0; i < N; i++){
for(int j = 0; j < N; j++){
cin >> T[i][j];
}
}
int ans = 0;
... | // I SELL YOU...!
#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
#include<queue>
#include<chrono>
#include<iomanip>
#include<map>
#include<set>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using TP = tuple<ll,ll,ll>;
void init_io(){
cin.tie(0);
ios::sync_with_stdi... |
#include <bits/stdc++.h>
//#include<fstream>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
#define endl '\n'
#define pb push_back
#define fi first
#define se second
typedef long long ll;
#define double long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define fr(a,b,c) for(int a=b; a<=c; a++... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define MOD 1000000007
#define mod9 1000000009
#define fast ios_base :: sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
#define mp make_pair
#define pb push_back
#define ct ll t;cin>>t;whil... |
/*
atcoder —— abc199 —— F-Graph Smoothing
*/
#include <bits/stdc++.h>
using namespace std;
#define closeSync ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
typedef long long ll;
const ll MOD = 1e9+7;
const int MAXN = 105;
int n,m,k;
ll A[MAXN],B[MAXN],down = 1;
ll mp[MAXN][MAXN];
struct Mat{
ll a[MAXN][M... | #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 <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <queue>
#include <deque>
#include <bitset>
#include <iterator>
#include <list>
#include <stack>
#include <climits>
#include <map>
#include <set>
#include <iomanip>
#include <unordered_set>
#include <functional>
#inc... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template<class T> using vc = vector<T>;
template<class T> using vvc = vector<vector<T>>;
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#defin... |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, s, n) for (int i = (s); i < (int)(n); i++)
#define repn(i, n) for (int i = (int)(n)-1; i>= 0; --i)
#define ll long long
using Graph = vector<vector<int>>;
int main(){
int n, m;
... | //Fuck the world....don't care anyone........................................................
#include <bits/stdc++.h>
#include<bitset>
#include<iostream>
using namespace std;
#include<math.h>
#include<map>
#include<vector>
#include<string>
#include<algorithm>
#define ll long long
#define ld double
#include<stdio.h>
#d... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define _GLIBCXX_DEBUG
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define makev(a, n) vector<int> a(n, 0)
#define all(v) v.begin(), v.end()
#define F first
#define S second
#define printv(v) rep(i, (int)v.size()) cout << v[i] << (i+1 == (int)v.s... | #include <bits/stdc++.h>
using namespace std;
const int P = (int) 998244353;
int main() {
cin.tie(nullptr)->sync_with_stdio(false);
int n;
cin >> n;
vector<int> w(n);
for (int i = 0; i < n; i++) {
cin >> w[i];
}
int s = accumulate(begin(w), end(w), 0);
if (s % 2 == 1) {
cout << 0 << endl;
} else {
vector... |
#include<bits/stdc++.h>
#define repa(x,y,z) for(ll x=y;x<z;x++)
#define ll long long int
#define pb(a) push_back(a)
#define mp(a,b) make_pair(a,b)
#define all(a) a.begin(),a.end()
#define memf(a) memset(a,false,sizeof(a))
#define F first
#define S second
#define ot(a) cout<<a<<endl;
#define endl "\n"
#define godspeed... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define P pair<ll, ll>
int main(){
ll N;
cin >> N;
double x_0, y_0;
double x_half, y_half;
cin >> x_0 >> y_0;
cin >> x_half >> y_half;
... |
#include<bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
long long n , k , a [300005] , num [300005] , ans;
void go ( int x )
{
num [x] --;
if ( num [ x + 1 ] == 0 )
{
ans += x + 1;
return;
}
else go ( x + 1 );
}
int main()
{
ios_base::sync_with_stdio(false);
... | #include <bits/stdc++.h>
using namespace std;
#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)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define pb push_back
#define eb emplace_back
#define mp make_pair
template<class T> bool ckmin(T& a, co... |
#include <stdio.h>
#include<iostream>
#include <string>
#include <string.h>
#include <vector>
#include <cmath>
#include <algorithm>
#include <queue>
#include <climits>
#include <set>
#include <unordered_map>
#include <map>
#include <stack>
#include <unordered_set>
#define hash hassh
using namespace std;
long double ans... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main() {
ll N, M, K, A;
cin >> N >> M >> K;
vector<bool> start(N + 1, false);
rep(i, K) {
cin >> A;
start[A] = true;
}
double L = 0, R = 1e20;
vector... |
/* winners never quit and quitters never win.
#swap */
#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;
#pragma GCC optimize ("-O3")
using ll = long long;
using ld = long ... | #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 M 1000000007
#define pi 3.14159265358979323846
#define ll long long
#define lld ... |
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
using namespace std;
int t;
void solve()
{
cin >> t;
while(t--)
{
string s;
cin >> s;
if(s > "atcoder")
{
cout << 0 << "\n";
continue;
}
if(s... | #include<stdio.h>
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include <cassert>
#include <numeric>
#include <unordered_map>
#include <queue>
#include <math.h>
#include <climits>
#include <set>
#include <map>
using namespace std;
using ll = long long;
using ld = long double;
using pll = pa... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pi (3.141592653589)
#define mod 1000000007
#define int long long
#define float double
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(c) c.begin(), c.end()
#define min3(a, b, c) min(c, min(a, b))
#define... | #include <bits/stdc++.h>
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define RI register int
typedef long long LL;
#define FILEIO(name) freopen(name".in", "r", stdin), freopen(name".out", "w", stdout);
using namespace std;
namespace IO {
char buf[1000000], *p1 = buf, *p2 = buf;
inline char gc() {
if (p1 ... |
#include<bits/stdc++.h>
#define w(x) int x; cin>>x; for(int tc=1;tc<=x;tc++)
#define trace(x) cerr<<#x<<": "<<x<<" "<<endl;
#define trace1(x,y) cerr<<#x<<": "<<x<<" "<<endl;cerr<<#y<<": "<<y<<" "<<endl;
#define FIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long
#d... | #include<bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for(int i = 0; i < n; i++) cin >> a[i];
vector<vector<int>> m(n, vector<int>(n, -1));
for(int i = 0; i < n; i++) {
int mi = 1e9;
mi = min(mi, a[i]);
for(int j = i; j < n; j++) {
... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
vector<string> v;
unordered_set<string> set;
for(int i=0; i<n; i++){
string s; cin >> s;
if(s[0] != '!') v.push_back(s);
set.insert(s);
}
for(auto &s : v){
if(set.count('!' + s)){
... | #include<bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
string s[N];
map<string, int> mp;
int n;
int main()
{
cin >> n;
for(int i = 0; i < n; ++i) cin >> s[i];
sort(s, s + n);
int i = 0;
for(; i < n; ++i) {
if(s[i][0] != '!') break;
mp[s[i]] = 1;
}
for(; i < n; ++i) {
if(mp.count("!" + s[i... |
#include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define all(v) (v).begin(), (v).end()
#define inp(t, ...) \
t __VA_ARGS__; \
in(__VA_ARGS__)
#define inv(t, v, n) \
vector<t> v(n); \
for (t & num : v) \
cin >> num;
using namespace std;
using ll = long long;
using ld = long d... | #include <bits/stdc++.h>
using namespace std;
class InversionCount {
public:
InversionCount(vector<int64_t> target) : target_(target) {}
int64_t count(int64_t left = 0, int64_t right = -1) {
if (right < 0) {
//rはtarget_.size()で初期化
right = target_.size();
}
if (ri... |
/*
( _
) /=>
( +____________________/\/\___ / /|
.''._____________'._____ / /|/\
: () : :\ ----\| \ )
'..'______________.'0|----| \... | #include <iostream>
using namespace std;
int main()
{
int a,b,c;
cin>>a>>b>>c;
if(c==0)
{
if(a==0)
{
cout<<"Aoki";
}
else
{
if(b==0) cout<<"Takahashi";
}
}
else
{
if(b==0)
{
cout<<"Takahashi";
}
else
{
if(a==0) cout<<"Aoki";
}
}
if(c==0)
{
while(a > 0 && b > 0)
{... |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
void debug_out() { cerr << endl; }
template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << "[" << H << "]";
debug_out(T...);
}
#ifdef dddxxz
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debu... | #include <iostream>
#include <vector>
#include <queue>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n + 1; i++)
#define all(A) A.begin(), A.end()
typedef long long ll;
using P = pair<int, int>;
int main()
{
int n, m;
cin >> n >> m;
vector<vector<... |
#include <bits/stdc++.h>
#define task "D"
#define all(v) (v).begin(), (v).end()
#define rep(i, l, r) for (int i = (l); i < (r); ++i)
#define FOR(i, l, r) for (int i = (l); i <= (r); ++i)
#define FORD(i, r, l) for (int i = (r); i >= (l); --i)
#define DB(X) { cerr << #X << " = " << (X) << '\n'; }
#define DB1(A, _) { cer... | #include<bits/stdc++.h>
#define int long long
#define x first
#define y second
#define mp make_pair
#define pb push_back
#define endl "\n"
using namespace std;
const int max_n = 2e5+100;
const int off_set = 1e5+5;
const int max_A = 55;
const int Mod = 1e9+7;
const int inf = 2e18;
int n;
vector<int> adj[max_n];
int... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
string s;
ll ans;
char prv;
int prvLoc;
int cnt[26];
int main(){
cin >> s;
n = (int)s.size();
prvLoc = n;
for(int i=n-1; i>=0; i--){
if(i < n-1 && s[i] == s[i+1] && (i == n-2 || s[i+1] != s[i+2])){
if(s[i]... | //#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
//#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#define int long long
using namespace std;
typedef long long ll;
template<class T>T ABS(T x) {return x<0?-x:x;}
//int ksm(int x,int y) {int r=1;whil... |
#define _LIBCPP_DEBUG 0
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<ll>>;
template<class T> bool chmin(T &a, T b) {if(a>b){a=b;return 1;}return 0;}
template<class T> bool chmax(T &a, T b) {if(a<b){a=b;return 1;}return 0;}
#define rep(i,n) for(ll i=0;i<ll(n);i++)
#def... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int inf=0x3f3f3f3f;
const ll INF=0x3f3f3f3f3f3f3f;
const double pi=3.1415926535897932384626;
inline ll read(){
ll x=0,f=1;
char ch=getchar();
while(ch<'0'||ch>'9'){
if(ch=='-') f=-1;
ch=getchar();
}
while(ch>='0'&&ch<='9'){
x=(x<<1)+(x<... |
#include<bits/stdc++.h>
using namespace std;
//#Rohitpratap311
//#Keep Calm And say Happy
using ll = long long;
using ld = long double;
vector<ll> adj[2001];
void dfs(ll v,ll &x,vector<bool> &vis)
{
x++;
vis[v]=1;
for(auto u:adj[v])
{
if(!vis[u]) dfs(u,x,vis);
}
}
void solveCP311()
{
... | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define pb push_back
#define f(i,a,n) for(int i=a ; i<n ; i++)
#define rf(i,n,a) for(int i=n ; i>=a ; i--)
#define F first
#define S second
#define all(c) (c).begin(),(c).end()
#define sz(v) (int)(v).size()
#define fast ios::sync_with_stdio(0); cin.ti... |
#include <bits/stdc++.h>
#define FOR(i, begin, end) for(int i = (begin); i < (end); i++)
#define FAST_IO ios_base::sync_with_stdio(false); cin.tie(nullptr)
#define F first
#define S second
#define PB push_back
#define MP make_pair
using namespace std;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef long lo... | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define dbg(x) cerr << "|" << #x << ": " << x << "|" << '\n'
#define cout(x) cout << x << '\n'
constexpr ... |
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int length=1048577;
int n1[length],n2[length];
void cal(int n,const int a[],int l[],int c)
{
for(int i=0;i<(1<<n);i++)
{
int s=0;
for(int j=0;j<n;j++)
{
if(i&(1<<j))
{
s+=a[j+c];
}
}
l[i]=s;
}
return ;
}
signed mai... | #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>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define nl cout<<endl
#define pii pair<ll,ll>
#define vi vector<ll>
#define vii vector<pii>
#define mi map<ll,ll>
#define all(a) (a).begin(),(a).end()
#define pb push_back
#define ... | #include<bits/stdc++.h>
using namespace std;
typedef long long D;
const int maxn=3003,mod=998244353;
int Plus(int x,int y){return (x+=y)>=mod?x-mod:x;}
int n,k,a[maxn],dp[maxn][maxn];
int main(){
scanf("%d%d",&n,&k);
dp[0][0]=1;
for(int i=1;i<=n;i++){
for(int j=i;j>=1;j--){
dp[i][j]=Plus(dp[i-1][j-1],(j<<1)<=i?... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a,b,w,min,max;
cin>>a>>b>>w;
max=w*1000/a;
min=w*1000/b;
if(w*1000%b!=0 && w*1000%a!=0 && max==min)
cout<<"UNSATISFIABLE";
else
{
if(w*1000%a!=0)
min++;
cout<<min<<' '<<max;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
#include <cstdint>
#include <string>
#include <sstream>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if ... |
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ll long long
#define pii pair<ll,ll>
#define vi vector<ll>
#define mii map<ll,ll>
#define pqi ... | #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 ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
*/typedef long long ll;
typedef unsigned long long... |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
void io()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
time_t timer1;
time_t timer2;
double second;
struct result_found{};
int n=50;
vector<vector<int>>a( n , vector<int> (n));
vector<vector... | /**
* author: shu8Cream
* created: 26.04.2021 20:04:07
**/
#include <bits/stdc++.h>
#include <chrono>
using namespace std;
#define rep(i,n) for (int i=0; i<(n); i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using P = pair<int,int>;
using vi = vector<int>;
using vvi = vector<vi>;
using namespa... |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
long long mx = 0, tot = 0, x;
long double d = 0;
for (int i = 0; i < n; ++i) {
cin >> x;
mx = max(mx, abs(x));
tot += abs(x);
d += (x ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int64_t ans = pow(2,N+1);
vector<int> vec(N);
for (int i = 0; i < N; i++) {
string S;
cin >> S;
if(S == "AND"){
vec.at(i) = 1;
}else {
vec.at(i) = 0;
}
}
int64_t dp[N+3][2]; //[][1]=true
... |
/*/ Author: _Math.man /*/
#include<bits/stdc++.h>
using namespace std;
/*/---------------------------Defines-----------------------------------------/*/
#pragma GCC optimize("Ofast")
#define int long long
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);
#define pb push_back
#define eb emplace_back
#... | #include <bits/stdc++.h>
#include <iostream>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
ll x, y, a, b;
cin >> x >> y >> a >> b;
ll ans = 0;
while (true)
{
if (y / a < x)
... |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long a = sqrt(1.75 + 2 * n) - 0.5;
a--;
while ((a + 1) * (a + 2) / 2 <= n + 1) a++;
cout << n + 1 - a;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define long long int;
typedef std::vector<ll> vi;
typedef pair<ll, ll> pi;
#define ull unsigned long long
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define boht_tez ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define mod 1000000007
#define FAST ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define f(i,n) for(int i=0;i<n;i++)
#define fp(i,k,n) for(int i=k;i<=n;i++)
#define fr(i,k,n) for(int i=k;i>=n;i--)
#define pb p... | #include<bits/stdc++.h>
#define pb push_back
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
#define SORT(v) sort(all(v))
#define int long long
#define ff first
#define ss second
#define mod 1000000007
#define endl "\n"
using namespace std;
void oj()
{
ios::sync_with_stdio(0);cin.tie(0);cout.ti... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=100;
const ll Inf=1e18;
ll n,m,p,fib[N];
queue<int> q;
vector<int> a;
int main()
{
fib[1]=1;
for (m=2;fib[m-1]<=Inf;m++)
fib[m]=fib[m-1]+fib[m-2];
cin>>n; p=n;
for (int i=m;i>=1;i--)
if (fib[i]<=p) p-=fib[i],a.push_back(i);
a.pus... | #include<bits/stdc++.h>
using namespace std;
const double SQUP=0.618033992;
const double SQLO=0.618033982;
bool Deal(long long x,long long y,int dep)
{
if(dep>129)return false;
if(x<5 && y<5)
{
int tot=dep+x+y+1;
if(tot>129)return false;
printf("%d\n",tot);
for(int i=1;i<=x;i++)puts("1");
for(int i=1;i<=y... |
#include <bits/stdc++.h>
#include <vector>
#include<math.h>
#include<string.h>
using namespace std;
#define MAX 400005
#define MOD 1000000007
#define SMOD 998244353
#define ROOT 512
#define GMAX 20
#define INF 2000000000000000
#define EPS 0.000000001
#define NIL 0
#define FASTIO ios_base::sync_with_stdio(false);cin.tie... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define pf push_front
#define ft first
#define sec second
#define pr pair<int,int>
#define ISCC ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
using namespace std;
int t ,n ,m;
ll a[100005] ,k ,sum[100005];
vector<ll> vec;
int sol()
{
int l = 0 ,r = ... |
#include <bits/stdc++.h>
using namespace std;
#define INF_LL (int64)1e18
#define INF (int32)1e9
#define REP(i, n) for(int64 i = 0;i < (n);i++)
#define FOR(i, a, b) for(int64 i = (a);i < (b);i++)
#define all(x) x.begin(),x.end()
#define fs first
#define sc second
using int32 = int_fast32_t;
using uint32 = uint_fast32_... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pll = std::pair<ll, ll>;
template <class T> using vec = std::vector<T>;
template <class T> using vec2 = std::vector<vec<T>>;
template <class T> using vec3 = std::vector<vec2<T>>;
#define debug(var) std::cerr << #var << " :... |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define N 3010
#define MOD 998244353
#define ll long long
#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep2(i, a, b) for(int i = a; i <= b; ++i)
#define rep3(i, a, b) for(int i = a; i >= b; --i)
#define eb emplace_back
#define pb push_bac... | #include <bits/stdc++.h>
#define fi first
#define se second
#define sz(a) (int)(a).size()
#define all(a) (a).begin(), (a).end()
#define reset(a,v) memset((a), v, sizeof(a))
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
co... |
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define pi 3.141592653589793238
#define int long long
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>... | /*
Author: QAQAutomaton
Lang: C++
Code: C.cpp
Mail: lk@qaq-am.com
Blog: https://www.qaq-am.com/
*/
#include<bits/stdc++.h>
#define debug(...) fprintf(stderr,__VA_ARGS__)
#define DEBUG printf("Passing [%s] in LINE %d\n",__FUNCTION__,__LINE__)
#define Debug debug("Passing [%s] in LINE %d\n",__FUNCTION__,__LINE__)
#define... |
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
int H,W,ans;
char s[110][110];
int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
int main(){
cin >> H >> W;
for(int i=0;i<H;i++){
for (int j=0; j<W; j++) {
cin >> s[i][j];
}
}
ans=0;
for(int i=0;i<H;i++)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll b, c;
int main() {
cin >> b >> c;
ll ans = 0;
if (b > 0) {
// [0, b]
ans += b - max(0LL, b - (c >> 1)) + 1;
// [-b, 0)
ans += b - max(1LL, b - ((c - 1) >> 1)) + 1;
// (-inf, -b)
ans += ((c - 1) >> 1);
// (b, inf... |
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define drep(i,j,n) for(int i=0;i<(int)(n-1);i++)for(int j=i+1;j<(int)(n);j++)
#define trep(i,j,k,n) for(int i=0;i<(int)(n-2);i++)for(int j=i+1;j<(int)(n-1);j++)for(int k=j+1;k<(i... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
constexpr int N = 1005;
int n, m;
std::string s;
int f[N << 1];
std::vector<int> a, b;
int find(int x) {
if (x != f[x]) f[x] = find(f[x]);
return f[x];
}
inline void merge(int x, int y) { f[find(x)] = find(y); }
int main() {
s... |
#include <bits/stdc++.h>
using namespace std;
double A, B;
int main() {
cin >> A >> B;
cout << fixed << setprecision(9) << (A-B) / A * 100.0 << endl;
} | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <algorithm>
#define rep(i,n) for(int i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
//using Graph = vector<vector<pair<ll,ll>>>;
const int mod =1e+9+7;
const int dy[4]={0,1,0,-1... |
/*
{
######################
# Author #
# Gary #
# 2021 #
######################
*/
#include<bits/stdc++.h>
#define rb(a,b,c) for(int a=b;a<=c;++a)
#define rl(a,b,c) for(int a=b;a>=c;--a)
#define LL long long
#define IT iterator
#define PB push_back
#define II(a,b) make_pair(a,b)
... | #include <iostream>
#include <unordered_set>
#include <algorithm>
using namespace std;
typedef long long ll;
const ll maxn = 1e9 + 7;
const double eps = 1e-6;
const ll N = 9e5 + 999;
struct node {
ll x, y;
}a[N];
ll cas;
ll dis(ll i, ll j) {
return (a[i].x - a[j].x) * (a[i].x - a[j].x) + (a[i].y - a[j].y ) * (a[i].y... |
#include<bits/stdc++.h>
using namespace std;
const int MAX = 2010;
const int INF = 1e9;
bool seen[MAX][MAX];
int dp[MAX][MAX];
int H, W;
int add(char x){
if(x == '+'){
return 1;
}
else{
return -1;
}
}
int dfs(int h, int w, vector<vector<char>> &vec){
if(seen[h][w]){
return dp[h][w];
}
int a ... | #include <bits/stdc++.h>
//#include <atcoder/all>
#ifndef LOCAL
#pragma GCC target("arch=skylake-avx512")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
static const double EPS = 1e-12;
static ... |
#include<bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL)
#define MOD 1000000007
#define int long long int
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;cin>>n;
int l = 1, r = 1e9;
while(l<r)
{
int mid = (l+r-1)/2;... | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <complex>
#include <queue>
#include <set>
#include <unordered_set>
#include <list>
#include <chrono>
#include <random>
#include <iostream>
#in... |
#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 pb push_back
#define f first
#define s second
#define nl "\n"
typedef long long ll;
typedef pair<int, int> pii;
typedef vec... | #include<iostream>
using namespace std;
int main() {
int a, b, c, d;
cin>>a>>b;
cin>>c>>d;
cout<<(b-c);
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
int a,b,c,d;
cin >> a >> b >> c >> d;
if( b-c*d==0)
{
cout << -1 << endl;
}
else
{
int k=(c*d-b);
if(k<0)
{
cout << -1 << endl;
}
else if... | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define f first
#define s second
#define pb push_back
#define eb emplace_back
#define mk make_pair
#define mt make_tuple
#define MOD 1000000007
#define fo(i,a,b) for(i=a;i<b;i++)
#define foe(i,a,b) for(i=a;i<=b;i++)
#define all(x) x.begin(), x.end... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define for0(i,n) for(ll i=0;i<n;i++)
#define for1(i,n) for(ll i=1;i<=n;i++)
#define loop(i,a,b) for(ll i=a;i<b;i++)
#define maxpq priority_queue<int>
#define minpq priority_queue<int ,vector<int>,greater<int>>
#define fio ios_base::sy... | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
const char newl = '\n';
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
template<typename T> void drop(const T &x){cout<<x<<endl;exit(0);}
te... |
#include <bits/stdc++.h>
const int INF =1e9;
const int MOD =1e9+7;
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define REPD(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (int i = a; i < int(b); i++)
#define FORD(i, a, b) for (int i = b - 1; i >= ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
ll n,b,c,a[100009];
ll dp[1000005];
int main(){
ll n,a,b;
cin>>n>>a>>b;
cout<<(n-a)+b<<endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
typedef pair<int,int>P;
const int INF=0x3f3f3f3f;
const ll INFL=0x3f3f3f3f3f3f3f3f;
const int MOD=1000000007;
int x[2000],y[2000];
int main(){
int n;cin>>n;
rep(i,n){
scanf("%d%d",&x[i],&y[i]);
}
int cnt=0... | #include<bits/stdc++.h>
typedef long long ll;
#define rep(i,l,r) for(int i=l;i<=r;i++)
#define nep(i,r,l) for(int i=r;i>=l;i--)
void re(int &x){scanf("%d",&x);}
void re(int &x,int &y){scanf("%d %d",&x,&y);}
void re(ll &x){scanf("%lld",&x);}
void re(ll &x,ll &y){scanf("%lld %lld",&x,&y);}
void re(double &x){scanf("%lf",... |
# include <bits/stdc++.h>
# define ull unsigned long long
# define ll long long
# define double long double
# define pll pair<ll,ll>
# define pb push_back
# define fi first
# define se second
# define mp make_pair
# define max3(a,b,c) max(a,max(b,c))
# define min3(a,b,c) min(a,min(b,c))
# define all(x) x.begin(),x.end(... | #include <iostream>
using namespace std;
int main()
{
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << b - c << endl;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FAST ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define pb push_back
#define MOD 1000000007
#define sz5 100005
#define sz6 1000005
#define UP upper_bound
#d... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define S second
#define F first
#define f(i,n) for(int i=0;i<n;i++)
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define vi vector<int>
#define pii pair<int,int>
#define all(x) x.begin(),x.end()
const int N = 505;
const int inf ... |
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<l... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define MAX 128
#define pb push_back
#define mp make_pair
#define ALL(x) (x).begin(), (x).end()
#define bit(n) (1LL << (n))
... |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll MX=100000000000000000LL;
ll ck(vector<ll> a, vector<ll> b)
{
ll mn=MX;
sort(a.begin(), a.end());
sort(b.begin(), b.end());
for(int i=0;i<a.size();i++)
{
auto it=upper_bound(b.begin(), b.end(), a[i]);
if(it!=b.end(... | #include <stdio.h>
typedef long long ll;
int num[105][105], max = -1, vis[20], k, n, m;
struct node {
int x1, x2;
} a[20], b[105];
void dfs(int now) {
if (now >= k) {
int sum = 0;
//for (int i = 0; i < 17; i ++) printf("%d ", vis[i]);printf("\n");
for (int i = 0; i < m; i ++)
if (vis[b[i].x1] && vis[b[i].... |
#include <bits/stdc++.h>
#define vi vector<int>
#define tests int t; cin>>t; while(t--)
#define ll long long
#define vll vector<long long>
#define srt(v) sort(v.begin(), v.end())
#define srtg(v) sort(v.begin(), v.end(), greater<int> ())
#define FOR(k, n) for(int k=0; k<n; k++)
#define pb push_back
#define yes cout<<"... | #include <iostream>
#include<algorithm>
using namespace std;
int main()
{
ios::sync_with_stdio(0);cin.tie(0);
int N,S,T;long W,P;
int maxx = 0;
long long a[200010]={0},sum=0,sum1=0;
cin >> N >> W;
for(int i=1;i<=N;i++){
cin >> S >> T >> P;
maxx = max(maxx,T);
a[S] += P;... |
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int a1 = a / 100, b1 = b / 100;
int a2 = (a -= a1*100) / 10, b2 = (b -= b1*100) / 10;
int a3 = a - a2*10, b3 = b - b2*10;
a = a1 + a2 + a3, b = b1 + b2 + b3;
if(a >= b) cout << a << endl;
else cout << b << ... | #include <iostream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <utility>
#include <algorithm>
#include <cmath>
#include <climits>
#include <iomanip>
#include <queue>
#include <stack>
using namespace std;
typedef long long ll;
const int INF = (1<<30)-1;
const ll LINF = 1e18;
#define r... |
#include <bits/stdc++.h>
using namespace std;
#define PI acos(-1)
typedef long long int T; /// basic type
typedef double Tf; /// floating point type
Tf eps = 1e-6;
//int sgn(Tf x){
// if(fabs(x) < eps) return 0;
// if(x > 0) return 1;
// else return -1;
//}
int sgn(T x){
if(x == 0) return 0;
... | #include<iostream>
using namespace std;
#define progend {delete [] x;delete [] y; return 0;}
int* makevector(int* a, int p, int len) {
int* temp = new int[len];
for (int i = 0; i < len; i++) {
temp[i] = a[i] - p;
}
return temp;
}
int main() {
int n, a, b;
cin >> n;
int* x = new 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;
void fastio() {
cin.tie(nullptr);
cin.sync_with_stdio(false);
}
using LL = long long;
using LD = long double;
const LL MOD = 1e9+7;
const LL INF = LLONG_MAX;
const LL N = 101;
#define F first
#define S second
#define vt vector
LL gcd(LL a, LL b, LL& x, LL& y) {
if ... |
#include <bits/stdc++.h>
using namespace std;
int modPow(int x, int n, int mod) {
if (n == 0) return 1;
int z = modPow(x, n / 2, mod);
z *= z;
z %= mod;
if (n & 1) z *= x, z %= mod;
return z;
}
int main() {
int a, b, c;
cin >> a >> b >> c;
a %= 10;
vector<int> p;
p.push_b... | #include <bits/stdc++.h>
using namespace std;
int main() {
long double X, Y, R;
cin >> X >> Y >> R;
long ans = 0;
int high = floor(Y + R);
int low = ceil(Y - R);
R += 1e-14;
long double RR = R*R;
for(long double h = high; h >= low; h--) {
long double YYhh = (Y-h)*(Y-h);
if(RR > YYhh ){
... |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 200005;
const int INF = 1000000007;
int A[MAXN], max_reachable[MAXN];
vector <int> G[MAXN];
int main(int argc, char const *argv[])
{
int n, m;
cin>>n>>m;
for (int i = 1; i <= n; ++i)
{
cin>>A[i];
}
for (int i = 0; i < m; ++i)
{
int u, v;
cin>>u... | #include <bits/stdc++.h>
using namespace std;
#define fst ios::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endk cout<<"\n";
typedef long long int ll;
typedef long int l;
#define l(i,a,b) for(i=a;i<b;i++)
#define lo(i,a,b) for(i=a;i>=b;i--)
#define s(v) sort(v.begin(),v.end());
#define pb push_back;
#de... |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define all(v) v.begin(),v.end()
using namespace std... | #include<bits/stdc++.h>
#include<bits/extc++.h>
using namespace std;
using namespace __gnu_pbds;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef vector<int> vi;
typedef pa... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.