code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,Q;
cin >> N;
string S;
cin >> S>> Q;
int t,a,b;
char c;
string St;
int Fcnt = 0;
for(int q=0;q<Q;q++){
cin >> t>> a>> b;
a--;
b--;
if(t==1){
if(Fcnt%2==0){
c = S.at(a);
S.at(a) = S.at(b);
S.at(b)... | #include <iostream>
#include <sstream>
#include <fstream>
#include <string>
#include <iomanip>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <utility>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using pl = pair<ll, ll>;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define fore(i_in,a) for (auto& i_in:... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef vector <int> vi;
typedef vector <vi> vii;
typedef vector <string> vs;
typedef vector <ll> vll;
#define LSB(x) x&(-x)
#define endl "\n"
#define quick ios_base::sync_with_stdio(false);cin.ti... |
#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;
typedef long long ll;
typedef double dbl;
#define REP(i, n) for (ll i = 0; i < ll(n); ++i)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= ll(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= ll(b); i--)
#define FORA(i, I) for (c... |
#include "bits/stdc++.h"
using namespace std;
const int MOD=998244353;
long long powMod(long long a,int p){
if(p==1){
return a%MOD;
}
if(p==0){
return 1ll;
}
long long t=powMod(a,p/2);
t*=t;
t%=MOD;
if(p&1){
t*=a;
t%=MOD;
}
return t;
}
long lon... | #include "bits/stdc++.h"
using namespace std;
#define for_(i, s, e) for (int i = s; i < (int) e; i++)
#define for__(i, s, e) for (ll i = s; i < e; i++)
typedef long long ll;
typedef vector<int> vi;
typedef array<int, 2> ii;
#define endl '\n'
ll n, k;
ll nCr(ll v, ll r) {
assert(r == 1 or r == 2);
if (r == 1) return... |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <stdio.h>
#include <... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define f first
#define s second
#ifndef LOCAL
#define cerr if(0) cerr
#endif
#pragma GCC diagnostic ignored "-Wunused-result"
void unsyncIO() { ios_base::sync_with_stdio(0); cin.tie(0); }
void setIO(string s = "") {
unsyncIO();
if (s.size()) { ... |
using namespace std;
#include<string>
#include<cmath>
#include<list>
#include <map>
#include <unordered_map>
#include <set>
#define ll long long
#define ld long double
#define ull unsigned long long
#define ml map<ll,ll>
#define pb push_back
#define mp make_pair
#define ppl pair<ll,ll>
#define F first
#define S second
... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
struct UnionFind{
vector<int> par, siz;
UnionFind(int n) : par(n,-1) , siz(n,1) {}
int root(int x){
if (par[x] == -1) return x;
else return pa... |
#include <bits/stdc++.h>
#define int long long int
#define ll long long int
#define ld long double
#define getFaster ios_base::sync_with_stdio(false), cin.tie(nullptr)
#define rep(i, init, n) for (int i = init; i < (int)n; i++)
#define rev(i, n, init) for (int i = (int)n; i >= init; i--)
#define MOD1 1e9 + 7
#define MO... | #include <bits/stdc++.h>
//#include <atcoder/all>
#define endl "\n"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
template<class T>
inline bo... |
#include "bits/stdc++.h"
//#include "atcoder/all"
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i... | #include<bits/stdc++.h>
using namespace std ;
#define ll long long
#define pb push_back
#define F first
#define S second
#define endl "\n"
#define pii pair<ll,ll>
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
ll power(ll b,ll e,ll m)
{
if(e==0) return 1;
if(e&1) return b*power(b*b%m,e/2,m)%m;
r... |
// C - Exoswap
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
int main(){
int n; cin>>n;
vector<int> ans, P(n); for(auto& x:P) cin>>x, --x; // -1
int l = 0;
rep(r, n){
if(r == n-1 and P[r] != l){ puts("-1"); return 0; }
if(P[r] == l){
for(int i=r-1; i>=l; --i){
an... | #include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<n; i++)
#define rng(i,l,r) for (int i=l; i<r; i++)
#define all(x) begin(x), end(x)
using namespace std;
using ll = long long;
using P = pair<int,int>;
template <class T> using V = vector<T>;
template<class T> bool chmin(T& a, T b){ if (a > b){ a = b; return true... |
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a),i##end=(b);i<=i##end;i++)
#define per(i,a,b) for(int i=(a),i##end=(b);i>=i##end;i--)
#define mem(a,b) memset(a,b,sizeof(a))
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ll long long
using namespace std;
template<typename T>... | #include<bits/stdc++.h>
#include<chrono>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace std::chrono;
using namespace __gnu_pbds;
#define ll long long int
#define ull unsigned long long int
#define FOR(I,a,b) for(ll I=a;I<b;I++)
#define FORit(it,a) for(... |
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <chrono>
#include <climits>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstre... | #include<bits/stdc++.h>
using namespace std;
const int mod = 998244353;
int A, B, C;
int qpow(int a, int b)
{
int res = 1;
for(; b > 0; b >>= 1, a = 1ll * a * a % mod) if(b & 1) res = 1ll * res * a % mod;
return res;
}
int S(int n)
{
n %= mod;
return 1ll * n * (n + 1) % mod * qpow(2, mod - 2) % mod;
}
int mai... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define INF ((1LL<<62)-(1LL<<31))
typedef long long ll;
int main()
{
int n,k;
cin >> n >> k;
vector<int> a(n),cnt(n,0);
rep(i,n) {
cin >> a[i];
cnt[a[i]]++;
}
int sum=0,nk=k;
for(int i=0;... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fo(i,n) for(int i=0;i<n;i++)
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define tr(it,a) for(auto it=a.begin();it!=a.end();it++)
typedef pair<int, int> pii;
typedef pair<long, long> pll;
typedef vector<int> vi;
typ... |
#include <bits/stdc++.h>
#include <math.h>
#include <cmath>
using namespace std;
using ll =long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vs = vector<string>;
using vvs = vector<vs>;
using vc = vector<char>;
using vvc = vector<vc>;
using vb = vecto... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace __gnu_pbds;
using namespace std;
#define getbit(n, i) (((n) & (1LL << (i))) != 0)
#define setbit0(n, i) ((n) & (~(1LL << (i))))
#define setbit1(n, i... |
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define ll long long
#define pb(a) push_back(a)
#define arr(a) new ll int[a]
#define INF 100000000000000000
#define MOD 1000000007
#define MOD1 998244353
#define arr1(a) new arra[a]
#define str(a) new string[a]
#define all(arr,n,a) for(ll int i=0;i<=n;i++)... | //#include "input.h"
//#include "output.h"
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define NDEBUG
NDEBUG
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cstring>
#include <cmath>
#include <functional>
#include <numeric>
#include <iomanip>
#inclu... |
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<algorithm>
#include<cstring>
#define rg register
#define il inline
using namespace std;
il int read()
{
rg int save=0, w=1;rg char q=getchar();
while(q<'0'||q>'9'){if(q=='-')w=-1;q=getchar();}
while(q>='0'&&q<='9')save=(save<<3)... | #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<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
#define ll long long
#define ld long double
#define pii pair<int... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (lli i = a; i < b; i++)
#define lli long long int
#define ld double
#define all(v) v.begin(), v.end()
#define hell 1000000000000000
#define pb push_back
#define vi vector<lli>
#define vip vector<pair<lli, lli>>
#define F first
#define S second
// #d... | #include<bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << n - a + b << "\n";
return 0;
} |
/* Lucky_Glass */
#include <cstdio>
#include <cstring>
#include <algorithm>
const int N = 105, MOD = 998244353;
inline int add(int a, const int &b) { return (a += b) >= MOD ? a - MOD : a; }
inline int sub(int a, const int &b) { return (a -= b) < 0 ? a + MOD : a; }
inline int mul(const int &a, const int &b) { return i... | #include <bits/stdc++.h>
using i64 = long long;
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int n;
std::cin >> n;
std::set<std::tuple<int, int, int>> s;
std::vector<std::pair<int, int>> a(n);
for (auto &[x, y] : a) {
std::cin >> x >> y;
}
sort(a.begi... |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long int ;
using P = pair<ll,ll>;
using Graph= vector<vector<ll>>;
struct edge{ll to ; ll cost ;} ;
using graph =vector<vector<edge>> ;
#define rep(i,n) for (ll i=0; i < (n); ++i)
#define rep2(i,n,m) for(ll i=n;i<=m;i++)
#defin... | #include<bits/stdc++.h>
//=====================START-MACRO=====================
namespace gengar
{
#pragma GCC optimize("Ofast")
using namespace std;
namespace TypeDef
{
#define int long long
#define itn int
#define uint unsigned long long
using Int=int64_t;
using uInt=uint64_t;
#define ld long double
... |
#include <bits/stdc++.h>
#include <list>
using namespace std;
#define rep(i,t,n) for(int64_t i=t;i<n;i++)
#define Sort(a) sort(a.begin(),a.end())
#define rSort(a,n,m) sort(a.begin()+n-1,a.begin()+m)
#define Reverse(a) reverse(a.begin(),a.end())
#define rReverse(a,n,m) reverse(a.begin()+n-1,a.begin()+m)
#define MOD 1000... | #include <iostream>
#include <vector>
#include <string>
#include <array>
#include <functional>
#include <algorithm>
#include <stack>
#include <map>
#include <set>
#include <climits>
#include <queue>
#include <bitset>
#include <cassert>
#include <math.h>
#include <complex>
#include <iomanip>
#include <unordered_map>
usi... |
#include <bits/stdc++.h>
using namespace std;
#ifdef __local_leywar
#include <debug/debugger.h>
#endif
#define int unsigned long long
#define endl '\n'
const int INF = 2e9,
MOD = 1e9+7,
INFLL = 1e18;
using pii = pair<int, int>;
mt19937_64 rng(time(0));
int gcd (int a, int b)
{
return (b ==... | /*
Date: 2/27/2021 8:09:28 PM
*/
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
int a, p, x, n, minn = INF;
int main() {
scanf("%d", &n);
for (register int i = 0; i < n; i++) {
scanf("%d%d%d", &a, &p, &x);
if (x - a > 0 && p < minn) minn = p;
}
minn != INF ? printf("%d\n", minn) ... |
#include <bits/stdc++.h>
using namespace std;
map<int, string> vis;
signed main() {
int n; cin >> n;
for ( int i = 0; i < n; ++ i ) {
string s;
int x;
cin >> s >> x;
vis[x] = s;
}
int num = 1;
for ( auto iter: vis ) {
if ( num == vis.size() - 1 ) {
cout << iter.second << endl;
... | #include<bits/stdc++.h>
using namespace std;
template <class T> ostream &operator << (ostream &os, const vector<T> &p) { os << "["; for (auto&it : p) os << it << " "; return os << "]";}
template <class S, class T> ostream &operator << (ostream &os, const pair<S, T> &p) { return os << "(" << p.first << "," << p.second <... |
#include <iostream>
#include <fstream>
#include <cstdlib>
#include <bitset>
#include <map>
#include <iomanip>
#include <string>
#include <vector>
#include <cmath>
#include <queue>
#include <algorithm>
#include <sstream>
#include <set>
#include <unordered_set>
using namespace std;
#define ll long long
#define ld long ... | #include<bits/stdc++.h>
#define ll long long
#define Fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define endl '\n'
using namespace std;
ll a,b,c,d,e,x,y,n,k,m,z,sum,i,j;
#define mx 1000000000
int main()
{
Fast
cin>>n;
i=1;
while(1)
{
sum=sum+i;
i++;
k++;
... |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <set>
#include <vector>
#include <map>
#include <sstream>
#include<bitset>
using namespace std;
void solve() {
int n;
cin >> n;
vector<pair<int, string>> a(n);
for(int i = 0; i < n; i++) {
cin >> a[i].second;
cin >> a[i].first;
}
sort(a.begin... |
#include <iostream>
using namespace std;
int a[1000],n;
string s[1000];
int t[1000];
void partition(int *A, int n, int a, int *left,int *right);
void quicksort(int *A, int n);
int main() {
for(int i =0;i<1000;i++){
a[i]=i;
}
cin >> n;
for(int i=0;i<n;i++)cin >> s[i] >> t[i];
quicksort(... |
#include<bits/stdc++.h>
using namespace std;
namespace Ruri{
#define ms(a,b) memset(a,b,sizeof(a))
#define repi(i,a,b) for(int i=a,bbb=b;i<=bbb;++i)//attention reg int or reg ll ?
#define repd(i,a,b) for(int i=a,bbb=b;i>=bbb;--i)
#define reps(s) for(int i=head[s],v=e[i].to;i;i=e[i].nxt,v=e[i].to)
#... | /**
* 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<iostream>
using namespace std;
const long mod=998244353;
long A,B,C;
main()
{
cin>>A>>B>>C;
A=A*(A+1)/2%mod;
B=B*(B+1)/2%mod;
C=C*(C+1)/2%mod;
cout<<A*B%mod*C%mod<<endl;
}
| #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,s,n) for (int i = (s); i < (n); ++i)
#define rrep(i,n,g) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define len(x) (int)(x).size()
#define dup(x,y) (((x)+(y)-1)/(y))
#define pb push_bac... |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define ull unsigned long long
#define ll long long
#define M 998244353
#define pb push_back
#defin... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> pre(n);
for (int i = 0; i < n; i++) {
int num;
cin >> num;
pre[num].emplace_back(i);
}
for (int i = 0; i < n; i++) {
int next = -1;
pre[i].emplace_back... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C, D;
cin >> A >> B;
C = A + B;
if(C >= 15 && B >= 8){
D = 1;
}
else if(C >= 10 && B >= 3){
D = 2;
}
else if(C >= 3){
D = 3;
}
else{
D = 4;
}
cout << D << endl;
} | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define int long long
#define ll long long
#define mod 1000000007
#define N 10000002
#define ... |
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
ll power(ll x, ll n, ll m) {
if (n == 0ll)
return 0ll;
ll y = power(x, n / 2ll, m);
if ((y == -1ll) || (y > m - y))
return -1ll;
y = (y + y);
if (n % 2ll) {
if ((x > m) || (y > m - x)) {
return -1ll;
}
y = y + x;
}
return y;
}
bo... | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#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 order... |
#include <bits/stdc++.h>
using namespace std;
const int MOD=1e9+7;
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize ("unroll-loops")
#define pb emplace_back
#define fi first
#define se second
#define FOR(a,b,i) for (int i=a;i!=b;a>b?i--:i++)
#define F0R(a,i) FOR(0,a,i)
#define sz(a) (int)(a).... | #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>;
struct uf {
vector<int> d;
uf(){}
uf(int mx):d(mx,-1){}
int root(int x) {
if(d[x] < 0) return x;
return d[x] = root(d[x]);
}
bool unite(int x, int y) {
x =... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAX_N = 2e5+2;
int n;
pair<ll,ll> p[MAX_N];
int m;
ll t[MAX_N],axis[MAX_N];
int q;
ll A[MAX_N], B[MAX_N];
pair<ll,ll> ans[MAX_N];
struct query
{
ll a, b, id;
bool operator<(const query& other) const
{
return a < other.a;... | #include <bits/stdc++.h>
#define rep(i, n) for(ll i=0;i<(ll)(n);i++)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll=long long;
typedef pair<ll,ll> P;
void op2(ll& x,ll& y){
y*=(-1);
ll tmp=x;
x=y; y=tmp;
return ;
}
void op1(ll& x,ll& y){
x*=(-1);
ll tmp=x;
x=y; y=tmp;
... |
#include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<unordered_map>
#include<vector>
#include<set>
#include<queue>
#include<stack>
#include <math.h>
#include<climits>
using namespace std;
#define int long long
#define vi vector<int>
#define vpii vector<pair<int,int>>
#define pii pair<int,int>
... | #include <bits/stdc++.h>
// clang-format off
using namespace std; using ll = int64_t; using ull = uint64_t; const ll INF = 9e18;
void print0() {}
template<typename Head,typename... Tail> void print0(Head head,Tail... tail){cout<<fixed<<setprecision(15)<<head;print0(tail...);}
void print() { print0("\n"); }
template<typ... |
#include<bits/stdc++.h>
using namespace std ;
#define FASTIO ios::sync_with_stdio(0) ; cin.tie(0) ; cout.tie(0) ;
#define int long long
#define mod ((int)1e9 + 7)
int n , m , ans = INT_MIN ;
vector<int> a , mb , ms ;
vector<vector<int>> adj ;
vector<bool> visited ;
void dfs(int x){
visited[x] = true ;
... | #include<bits/stdc++.h>
#include<iostream>
#include<string>
#include<cmath>
#include<cstdio>
#include<cctype>
#include<cstring>
#include<iomanip>
#include<cstdlib>
#include<ctime>
#include<set>
#include<map>
#include<utility>
#include<queue>
#include<vector>
#include<stack>
#include<sstream>
#include<algorithm>
#define... |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;
int main()
{
int a,b;
cin >> a >> b;
int ans = 2*a+100 - b;
if(ans < 0) ans = 0;
cout << ans << endl;
} | #include <iostream>
using namespace std;
int main(){
int m, h;
cin >> m >> h;
if (h%m == 0){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
const int64_t INF=1000000007;
typedef pair<int,set<int>> P;
typedef pair<int,int>Q ;
int64_t gcd(int64_t x, int64_t y) {
if(x % y == 0) {
return y;
} else {
return gcd(y, x % y);
}
}
int64_t modinv(int64_t a, int64_t m) {
int64_t b = m, u ... | #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>
#define rep(i, n) for (int i = 0, length = n; i < length; i++)
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ep emplace
#define epb emplace_back
#define scll static_cast<long long>
#define sz(x) static_cast<int>((x).size())
#define pfll(x) printf("%lld... | #include <iostream>
#include <string>
using namespace std;
#include <algorithm>
#include <vector>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <set>
#include <map>
#include <cassert>
#define MOD1 1000000007
#define MOD2 998244353
#define LIMIT1 200010
#define LIMI... |
#include <bits/stdc++.h>
using namespace std;
int main(){
double A,B;
cin >> A >> B;
double ans = 0.0;
ans = 100 - B/A*100;
cout << ans << endl;
} | #include<iostream>
using namespace std;
int main()
{
int x,y;
cin>>x>>y;
if(x>y)
{
if(y+3>x)
{cout<<"Yes"<<endl;}
else
{cout<<"No"<<endl;}
}
else
{
if(x+3>y)
{cout<<"Yes"<<endl;}
else
{cout<<"No"<<endl;}
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define forn(i,a,n) for (int i=a; i<n; i++)
#define mod 1000000007
//dp(i,j)
//i=until the ith element
//j=how many groups
int dp[3005][3005];
int su[3005],sum[3005];
int a[3005];
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
//freope... | #include <bits/stdc++.h>
#define ll long long
#define pi pair<int, int>
#define pf pair<float, int>
#define ps pair<string, int>
#define pii pair<int, pi>
#define mi map<int, int>
#define ml map<long long, int>
#define ms map<string, int>
#define mc map<char, int>
#define mpi map<pi, int>
#define F first
#define S sec... |
#include <bits/stdc++.h>
#define INF 1e9
#define INFLL 1ull<<60u
using namespace std;
#define REPR(i,n) for(int i=(n); i >= 0; --i)
#define FOR(i, m, n) for(int i = (m); i < (n); ++i)
#define REP(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define ALL(a) (a).begin(),(a).end()
#define endl "\n"
template<class T>b... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef __int128_t LL;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define F first
#define S second
#define pb push_back
mt19937 rnd;
const int N = 2e5 + 10;
int a[N], b[N], c[N];
vector<int> open[N + N], close[N + N]... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define all(x) (x).begin(),(x).end()
ll GCD(ll a, ll b) {
if (b == 0) return a;
else return GCD(b, a % b);
}
ll LCM(ll a, ll b) { return a * b / GCD(a, b); }
int main(){
int N, K, M;
cin... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep3(i,m,n) for(int (i)=m;(i)<=(n);(i)++)
#define rep3rev(i,m,n) for(int (i)=m;(i)>=(n);(i)--)
#define all(a) (a.begin()),(a.end())
#define rall(a) (a.rbegin()),(a.rend())
#define fi first
#define se second
#define pb p... |
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#pragma GCC optimize ("-O3")
using namespace std;
void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long ... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
ll gcd(ll a, ll b){
ll r = a%b, re;
if(r == 0) re = b;
else re = gcd(b, r);
return re;
}
int main(){
ll n;
cin >> n;
vector<ll> a(n);
for(int i = 0; i < n; i++) cin >> a[i];
ll tmp = a[0];
for(ll i = 1; i < n; i... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
unsigned long long s, d, x[100], y[100];
cin >> s >> d;
for (int i = 0; i < n; ++i)
{
cin >> x[i] >> y[i];
}
int ans = 0;
for (int i = 0; i < n; ++i)
{
if (x[i] < s && y[i] > d)
{... | #include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
vector<pair<int,string>>v;
int n;
cin>>n;
string name;
int length;
for(int i=0;i<n;i++){
cin>>name>>length;
v.push_back({length,name});
}
sort(v.begin(),v.end());
cout<<... |
#pragma GCC optimize("O2")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define test int tt; cin>>tt; while(tt--)
#define ff first
#define ss second
#define pb push_back
#define Mod 998244353
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin>>n;
vect... | #include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<n;++i)
#define rrep(i, n) for(ll i=n-1;i>=0;--i)
#define rep1(i, n) for(ll i=1; i<=n; ++i)
#define repitr(itr,mp) for(auto itr=mp.begin();itr!=mp.end();++itr)
#define rrepitr(itr, mp) for(auto itr = mp.rbegin(); itr!=mp.rend(); ++itr)
#define ALL(a) (a).begin(),(... |
#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 fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair<... | #define taskname "test"
#include <bits/stdc++.h>
using namespace std;
#define sz(x) (int)x.size()
#define fi first
#define se second
typedef long long lli;
typedef pair<int, int> pii;
const int maxn = 2e5 + 5;
int n, k;
vector<int> gr[maxn];
int depth[maxn], p[maxn];
int max_depth = 0;
vector<int> vertices[maxn... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MAX 510000
#define MOD 998244353
#define rep(i, n) for (ll i = 0; i < n; ++i)
void solve(void)
{
ll n;
cin >> n;
set<ll> st;
for (ll i = 1; i * i <= n; ++i)
{
if (n % i == 0)
{
ll j = n / i;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, s, e) for (int i = (int)(s); i < (int)(e); i++)
#define _rep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define _REP(i, e, s) for (int i = (int)(e - 1); i >= (int)(s); i--)
#define yes cout << "yes" <<... |
#include <bits/stdc++.h>
using namespace std;
// #include <atcoder/all>
// using namespace atcoder;
// #define int long long
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps... | //**sn0wrus**//
#include <bits/stdc++.h>
#include <algorithm>
using namespace std;
//#pragma GCC optimize("Ofast")
//#pragma GCC optimization("unroll-loops, no-stack-protector")
//#pragma GCC target("avx,avx2,fma")
#define fast \
ios_base::sync_with_stdio(false); \
cout.tie(NULL); ... |
#include <bits/stdc++.h>
using namespace std;
template<typename T>
bool is_prime(T x) {
if (x == 1) {
return false;
}
for (int i = 2; (T) i * i <= x; i++) {
if (x % i == 0) {
return false;
}
}
return true;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
long long a, b;
cin >> a >> b;
... | #pragma GCC optimize(2)
#pragma GCC optimize(3)
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define fi first
#define se second
#define pb push_back
#define wzh(x) cerr<<#x<<'='<<x<<endl;
LL a,b;
int g[22],d[22];
int _v,_w;
LL gcd(LL x,LL y){
return y==0?x:gcd(y,x%y);
}
int ban_v[1<<22];
int su... |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define rep(i,n) for ... | #include<bits/stdc++.h>
using namespace std;
int n,m;
int f[2000][2000];
int a[2000],b[2000];
int main()
{
cin>>n>>m;
for(int i=1;i<=n;i++)
cin>>a[i];
for(int i=1;i<=m;i++)
cin>>b[i];
memset(f,10,sizeof(f));
f[0][0]=0;
for(int i=1;i<=n;i++)
f[i][0]=i;
for(int i=1;i<=m;i++)
f[0][i]=i;
for(int i=1;i<=n;i++)
... |
#include <bits/stdc++.h>
#define ll long long
#define endl '\n'
#define PI acos(-1)
#define sz 300
#define RUN_FAST ios::sync_with_stdio(false);
using namespace std;
int main ()
{
RUN_FAST; cin.tie(nullptr);
int n, cnt, mx1=0, mx2, ans;
cin >> n;
int arr[n], i, j;
for (i=0; i<n; i++) {
cin ... | #include<iostream>
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
int t;
long int n=0, m=0, a=0, a1=0, b=0, c=0, d=0, x=0, y=0, z=0, k=0, l=0, x1;
cin>>n;
long int arr[n];
for ( int i=0; i<n; i++ ) { cin>>arr[i];
a=a+abs(arr[i]);
... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<(int)(n); i++)
#define rep1(i, n) for(int i=1; i<=(int)(n); i++)
#define rep2(i, n, m) for(int i=(int)n; i<=(int)m; i++)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> wi;
typedef vector<ll> vl;
const ll inf=1LL<<60;
const ... | #include<bits/stdc++.h>
#define int long long
#define zmrl(x) signed((x).size())
#define ahen(x) (x).begin(),(x).end()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
using pii = pair<int,int>;
signed main() {
ios_base::sync_with_stdio(false); cin.tie(NULL);
in... |
#include <bits/stdc++.h>
#define lc (o<<1)
#define rc ((o<<1)|1)
#define PB push_back
#define MK make_pair
using namespace std;
#define DebugP(x) cout << "Line" << __LINE__ << " " << #x << "=" << x << endl
const int maxn = 3e5 + 5;
const int modu = 998244353; // 1e9 + 7
const int inf = 0x3f3f3f3f;
const double eps = 1... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
vector<long long> count(401);
for (int i = 0; i < N; i++) {
count.at(A.at(i) + 200)++;
}
long long total = 0;
for (int i = 0; i < 401; i++)... |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
string ans[20];
bool check(string s){
bool ret=false;
int i,j;
for(i=0;i<20;i++){
string wk="";
for(j=0;j<20;j++){
if(ans[i].size()>j){
wk+=ans[i];
}else{
brea... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N,M;
string a;
random_device rnd;
cin >> N >> M;
for(int i=0; i<M; i++) {
cin >> a;
}
for(int y=0; y<N; y++) {
for(int x=0; x<N; x++){
char a = rnd()%8 + 'A';
cout << a;
}
... |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string a;
int t=0;
cin>>a;
for(int i=0;i<a.size()-3;i++){
string s(a,i,4);
if(s=="ZONe") t++;
}
cout<<t;
return 0;
} | /*COMPETITIVE PROGRAMMING C++ TEMPLATE */
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <string>
#include <cmath>
#include <iostream>
#include <stack>
#include <queue>
#include <climits>
#include <iomanip>
#include <cassert>
#include <f... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(x) x.begin(), x.end()
int main(){
ios::sync_with_stdio(0); cin.tie(0);
int n, m; cin >> n >> m;
vector<array<int, 2>> black(m);
for(auto &[x, y] : black) cin >> x >> y;
set<int> white;
white.insert(n);
sort(all(black));
for(int i =... | #include <cstdio>
#include <string>
#include <iostream>
#include <algorithm>
#include <vector>
#include <list>
#include <bits/stdc++.h>
using namespace std;
/*----------------------------------ここからマクロ----------------------------------*/
#define f(i, n) for(int i=0;i<n;i++)
#define rep(i,n) for(int i=0, i##_len=(n); i<i... |
#include <iostream>
#include <fstream>
#include <algorithm>
#include <functional>
#include <array>
#include <chrono>
#include <random>
#include <vector>
#include <string>
#include <cmath>
#include <bitset>
#include <list>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <cassert>
#define sq(x) ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
const ll MOD = 1000000007;
const ll INF = 0x3fffffff;
#define lln \
long long n = 0; \
cin >> n
#define rep(i, n) for (ll i = 0; i < n; i++)
#define sVec(vec) sort(vec.begin(), vec.end... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A,B;
cin>>A>>B;
int solids=A+B;
if(solids >= 15 and B>=8) cout<<1<<endl;
else if(solids >= 10 and B>=3) cout<<2<<endl;
else if(solids >= 3) cout<<3<<endl;
else cout<<4<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
//.define
// #define FILE_IN_OUT
#define RET(_x) cout << (_x) << '\n'; return;
#define all(_obj) (_obj).begin(), (_obj).end()
#define loop(_n) for (int i = 0; i < (_n); ++i)
#define sz(_obj) static_cast<int>((_obj).size())
#ifdef SHJ_LOCAL
#define debug(_x) std::c... |
#include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
//indexed set is using "int" here--------- use ll ...
// typedef tree <int,null_type,less <int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
// #include <ext/rope>
// using namespace... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define FOR(i,f,n) for(int i=f;i<n;i++)
#define FORI(i,f,n) for(int i=f;i>=n;i--)
#define sz(a) ((int)(a).size())
#define ff first
#define ss second
#define all(a) (a).begin(),(a).end()
#define alli(a) (a).rbegin(),(a).rend()
#define approx(a) fixed<<... |
#include <iostream>
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <deque>
#include <stack>
#include <queue>
#include <array>
#include <bitset>
#include <cstdio>
#include <string>
#include <vector>
#include <random>
#include <chrono>
#include <utility>
#include <numeric>
#include <cstdlib>
#in... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define all(v) begin(v), end(v)
#define sz(v) v.size()
#define INF 1e18+9
#define EPSILON 1e-14
template <typename T>
bool chmax(T &a, const T& ... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define fore(i_in,a) for (auto& i_in: a)
#define sz(x) (int)x.... | #include <iostream>
#include <vector>
#include <numeric>
using namespace std;
typedef long long ll;
vector<ll> v;
int main() {
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n; cin >> n; v.resize(n);
for (auto& x : v) { cin >> x; }
ll res = 0; for (auto& x : v)
res += x * x * (n - 1);
ll s = accumul... |
#include <bits/stdc++.h>
#define fast ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define ll long long
#define F first
#define S second
#define pb push_back
using namespace std;
const ll mx1=3e5+6, mx2=6e3+6, mod=1e9+7, lg=30;
ll a[10];
int main(){
fast;
ll sum=0;
for(int i=0; i<4; i++){
cin>>a[i];
sum+=a... | #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 fbo find_by_order
#define ook order_of_key
#define fi first
#define se second
#define long long long
#define mul(a, b) ((a*b)%MOD)
#define add(a, b) (... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int64_t R, C;
cin >> R >> C;
vector<vector<int64_t>> A(R, vector<int64_t>(C - 1));
vector<vector<int64_t>> B(R - 1, vector<int64_t>(C));
for (int64_t i = 0; i < R; i++) {
for (int64_t j = 0; j < C - 1; j++) {
cin >> A[i]... | // E - 潜入
#include <bits/stdc++.h>
using namespace std;
#define vec vector
using vi = vec<int>;
using PR = pair<int,int>;
#define rep(i,n) for(int i=0;i<(int)(n);++i)
int V; // 頂点数
vec<vec<PR>> G; // [from]<to, cost> 隣接リスト
int INF = 1e9;
vi dijkstra(int s){
vi dist(V, INF);
dist[s] = 0;
priority_queue<PR, vec<PR>,... |
#include <iostream>
#include <bits/stdc++.h>
#include <vector>
#include <string>
#define rep(i, n) for(int i = 0; i < n; i++)
#define repr(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
typedef long long ll;
using namespace std;
int ... | #include<bits/stdc++.h>
using namespace std;
double slope(int n,int m,int n1,int m1){
if(n-n1==0)return 9;
double i=(m1-m)*1.00;
double j=(n-n1)*1.00;
return i/j;
}
int a[100001];
int b[100001];
int main(){
int n,ans=0;
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d %d",&a[i],&b[i]);
for(int i=1;i<=n;i++)
... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
const ll mod = 1000000007;
int main()
{
#ifndef ONLINE_JUDGE
// for getting input from input.txt
freopen("input.txt", "r", stdin);
// for writing output to output.txt
freopen("output.txt", "w", stdout);
... | #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 pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define endl '\n'
typedef long long ll;
typedef pair<int,int> pii;
typedef... |
#include <bits/stdc++.h>
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#defin... | #include <bits/stdc++.h>
#define s second
#define f first
#define pb push_back
#define endl '\n'
#define all(x) (x).begin(), (x).end()
#define _ ios_base::sync_with_stdio(0);cin.tie(0);
#define read(x) for(auto& qw : (x)) cin >> qw;
#define print(x) for(auto& qw : (x)) cout << qw << " "; cout << endl;
using namespace s... |
#include<cstdio>
#include<algorithm>
#include<vector>
#include<set>
#include<cstring>
#include<string>
#include<iostream>
using namespace std;
typedef long long ll;
const int N = 1e6 + 50;
ll M;
char s[N];
bool mul(ll &x, ll y){
ll tt = 0;
while(y){
if(x > M) return 0;
if(y & 1) tt += x;
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
string t,s;
int main()
{
cin>>n;
cin>>t;
while(s.size()<t.size()+3-1)
s+="110";
int m=s.size();
int cnt=0,ok0=0,ok1=0;
for(int i=0;i<3;i++)
{
int ok=1;
for(int j=0;j<t.size();j++)
ok&=t[j]==s[i+j];
cnt+=ok;
if(i==0)
ok0... |
#include<bits/stdc++.h>
using namespace std;
long long a,b,c,d,e,i,j,ii,jj,zx,xc,p[100009],pi,N=10000;
long long fx[100009];
int main(){
ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
cin>>a;
pi=3;
p[1]=6;p[2]=15;p[3]=10;
for(i=2; i<=N; i++){
if(i*p[3]>N) break;
if(fx[i*p[3... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e6 + 5;
// int tree[maxn];
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// iota(tree, tree + maxn, 0);
string s;
cin >> s;
cout << s.substr(1) << s[0] << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef long double ld;
/*
#include <chrono>
using namespace std::chrono;
#include <boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using nam... | #include<bits/stdc++.h>
#include<iostream>
#include<set>
#include<map>
#include<iterator>
#define ll long long
#define lli long long int
#define pb push_back
#define RIP(i,n) for(int i=0; i<n; i++)
#define RIP1(i,n) for(int i=n-1; i>=0; i--)
#define FOR(i,a,b) for... |
#include"bits/stdc++.h"
using namespace std;
#define int long long
#define pb push_back
#define all(v) begin(v), end(v)
#define inf (int)(4e18)
#define N (int)(2e5 + 10)
void testCase() {
int n; cin >> n;
vector<int> a(n);
for (int &i : a) cin >> i;
sort(all(a));
int ans = 0;
for (int i ... | #include<bits/stdc++.h>
#define lli long long int
#define endl "\n"
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL); cout.tie(NULL);
using namespace std;
lli min(lli a,lli b)
{
if (a<b)
{
return a;
}
else
{
return b;
}
}
lli max(lli a,lli b)
{
if (a>b)
... |
#include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#define llint long ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define ... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<ll,ll> P;
#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define EFOR(i,a,b) for(ll i=(a);i<=(b);++i)
#define REP(i, n) FOR(i,0,n)
#define INF 1000000000
ll nums = 10000000000;
int main() {
int n; cin >> n;
string s,t; cin >> s;
R... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
const int mod = 1000000007;
int mpow(int b, int e);
int main(){
IOS
int n, m; cin>>n>>m;
vector<int> g(1<<n, 0), complete(1<<n, -1);
for(int i=0; i<m; i++){
... |
#include<bits/stdc++.h>
#define re register
#define in inline
#define ll int
using namespace std;
char rbuf[10000002];
int pt;
in char gc(){
return getchar();
}
in int read(){
re int t=0;
re char v=gc();
while(v<'0')v=gc();
while(v>='0'){
t=(t<<3)+(t<<1)+(v^48);
v=gc();
}
ret... | #include"bits/stdc++.h"
using namespace std;
const int N=2100;
char a[N][N];
vector<pair<int,int>> c[26];
int dx[]={1,-1,0,0};
int dy[]={0,0,-1,1};
int d[N][N];
int n,m;
const int inf=1e9;
bool vis[26];
bool ok(int x,int y){
return (x<=n and y<=m and x>=1 and y>=1);
}
int main(){
cin>>n>>m;
for(int i=1;i<=n;i++)
f... |
// Rakib (CSE'19)
#include<bits/stdc++.h>
#define ll long long
#define boost_ ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define pb push_back
#define ... | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <stack>
#include <numeric>
#include <bitset>
#include <math.h>
#include <iomanip>
#include <sstream>
#include <cstdlib>
#include <stdio.h>
using namespace std;
typedef l... |
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define sz(a) ((int)a.size())
#define re return
#define all(a) a.begin(),a.end()
#define int long long
#define Type int
#define rept(i,a,b) for(int i=(a);i<(b);i++)
#define rep(i,a) rept(i,0,a)
using namespace std;
signed main()
{
int n,m;
cin>>n>>m;m... | #include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 4000000000000000000 //オーバーフローに注意
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
ll mod_pow(ll x,ll count, ll mod){
if(count == 0)return 1;
ll ret = mod_pow((x*x)%m... |
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <string>
#include <set>
#include <cstdint>
#include <numeric>
#define INF 1000000000
#define LLINF 2000000000000000
#define MOD 1000000007
using namespace std;
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define LOOP(i,N) fo... | #include <iostream>
using namespace std;
int main(void)
{
long long n;
cin >> n;
const int x[] = { 2,3,4,5,7,8,9,11,13,16,17,19,23,25,27,29,31};
const int e[] = { 2,3,2,5,7,2,3,11,13,2,17,19,23,5,3,29,31};
long long ans = 1;
for (int i = 0; x[i] <= n; i++) {
ans *= e[i];
}
cout << ans+1 << endl;
return 0;... |
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define FOR(a, b, c) for(int a = b; a <= c; ++a)
#define FORW(a,b,c) for(int a = b; a >= c; --a)
#define pb push_back
#define int long long
#define SZ(a) (int)(a.size())
#define mtp make_tuple
const int MOD = 998244353;
const int oo = 1... | #include <bits/stdc++.h>
using namespace std;
int N;
string s;
signed main()
{
ios::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
cin >> N >> s;
string t;
for(int i = 0; i < N; i++)
{
t += s[i];
while(t.size() > 2 && t[t.size() - 1] == 'x' && t[t.size() - 2] == 'o' && t[t.size() - 3] == 'f')
{
t.pop_bac... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define ppb pop_back
#define mp make_pair
using pi = pair<int,int>;
using vi = vector<int>;
using vvi = vector<vector<int> >;
#define ff first
#define ss second
#define all(x) x.begin(),x.end()
#define sz(x) (int)(x).size()
//con... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, l, r) for (int i = l; i <= r; ++i)
const int N = 5e3 + 5;
const int P = 1e9 + 7;
int n, ans, a[N], sum[N], f[N][N], g[N][N];
signed main () {
cin >> n;
rep(i, 1, n) cin >> a[i], sum[i] = sum[i - 1] + a[i];
f[0][0] = g[0][0] = 1;
rep... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i,a,b) for(ll i=a;(i)<(b);++(i))
#define RFOR(i,a,b) for(ll i=a;(i)>=(b);--(i))
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,n,0)
#define ALL(v) v.begin(), v.end()
#define UNIQ(v) sort(ALL(v)); v.erase(unique(ALL(v))... | #include <bits/stdc++.h>
#include <variant>
#define rep2(i,k,n) for(i64 i=(i64)(k);i<(i64)(n);i++)
#define rep(i,n) rep2(i,0,n)
#define all(x) begin(x),end(x)
#ifdef ENV_LOCAL
#define dump if (1) cerr
#else
#define dump if (0) cerr
#endif
using namespace std;
using namespace std::string_literals;
using i32 = int32... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define deb(x) cout<< #x << " " << x << "\n";
#define MAX 9223372036854775807
#define MIN -9223372036854775807
#define setbits(n) __builtin_popcountll(n)
#define mkunique(a... |
// Author: Muhesh Kumar
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pl = pair<ll, ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
#define nl '\n'
#define fr first
#define sc second
#define pb push_back
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define sz(x) (int) (x).size... |
#include<bits/stdc++.h>
#define forb(i,a,b) for(ll i=a;i<b;i++)
#define fore(i,a,b) for(ll i=a;i<=b;i++)
#define sortb(a) sort(a.begin(),a.end())
#define sortr(a) sort(a.begin(),a.end(),greater<ll> ())
#define inf LLONG_MAX
typedef long long int ll;
typedef long double ld;
using namespace std;
void solve(){
ll n,a,x;... |
#include"bits/stdc++.h"
#define rep(i,n) for(ll i=0;i<n;++i)
#define ALL(x) x.begin(),x.end()
#define BACK(x) x.rbegin(),x.rend()
#define MOD 1000000007
#define INF INT_MAX
#define FLOAT_ANS setprecision(30)
#define TORAD(x) (x*acos(-1)/180.0)
#define TODEG(x) (x*180/acos(-1))
#define elif else if
using namespace std... |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <iomanip>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#includ... | #include <bits/stdc++.h>
#define pb push_back
#define eb emplace_back
#define pf push_front
#define ff first
#define ss second
#define pi acos(-1.0)
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend()
#define SORT_UNIQUE(c) (s... |
#ifdef LOCAL
cout<<"\nTime Elapsed: " << 1.0*clock() / CLOCKS_PER_SEC << " sec\n";
#endif
#include "bits/stdc++.h"
using namespace std;
#define ll long long
#define vll vector<ll>
#define pii pair<ll,ll>
#define un_mp unordered_map<char,ll>
#define endl "\n"
#define pb push_back
#define all(a) a.begin(),a.end()... | //always use
#include <bits/stdc++.h>
using namespace std;
#define forn(i, n) for(int i=0; i<n; i++)
#define mp make_pair
#define pb push_back
#define f first
#define s second
typedef long long ll;
#define MOD 998244353
//2 147 483 647 (2^31-1) int max
//9 223 372 036 854 775 807 (2^63-1) ll max
//codeforces and USAC... |
#include <iostream>
#include <cmath>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
using ll = long long;
int in(){
double x;
cin >> x;
x*=10000;
return round(x);
}
bool ok(ll dx,ll dy,ll z){
return dx*dx+dy*dy <= z*z;
}
ll f(ll x,ll y,ll z,ll lim){
int l=0,r=1;
ll res = 0;
for(int i=1e... | #include <cstdio>
#define DIV 10000LL
using namespace std;
typedef long long LL;
LL x, y, R;
inline LL read()
{
// Returns: input * 10000.
LL res = 0LL;
int num = 0;
bool flag = false, negative = false;
for(char c=getchar(); c != ' ' && c != '\n'; c=getchar())
{
if(c == '-') negative = true;
else if(c == '... |
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#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; }
... | #include <bits/stdc++.h>
using namespace std;
struct UnionFind {
vector<int> par, size;
UnionFind(int n) : par(n), size(n) {
for(int i = 0; i < n; i++) {
par[i] = i;
size[i] = 1;
}
}
int root(int x) {
return par[x] == x ? x : par[x] = root(par[x]);
}
bool unite(int x, int y) {
... |
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define D(a) cerr << #a << " = " << a << endl
#else
#define D(a) 8
#endif
#define fastio ios_base::sync_with_stdio(0); cin.tie(0)
#define dforsn(i,s,n) for(int i=int(n-1);i>=int(s);i--)
#define forsn(i,s,n) for(int i=int(s);i<int(n);i++)
#define all(... | #include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<math.h>
using namespace std;
typedef long long ll;
#define int long long
#define double long double
typedef vector<int> VI;
typedef pair<int, int> pii;
typedef vector<pii> VP;
t... |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s; cin >> s;
int tmp = 8;
map<char,int> sub;
for(int i = 0; i < (int) s.size(); i++) sub[s.at(i)]++;
vector<string> oct(0);
int count = 1;
bool result = false;
if(s.size() == 1) {
if(s == "8") result = true;
... | //Shinchan Loves Coding :))
#include<bits/stdc++.h>
using namespace std;
#define night_rider ios::sync_with_stdio(false);cin.tie(NULL);
#define double long double
#define int long long int
#define en "\n"
#define fi first
#define se second
#define PB push_back
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin... |
#include <bits/stdc++.h>
using namespace std;
void prime_factor(int n, vector<bool> &p)
{
for (int i = 2; i * i <= n; i++)
{
while(n % i == 0)
{
p[i] = true;
n /= i;
}
}
if(n != 1)p[n] = true;
return;
}
int GCD(long long x, long long y) {
if(x < ... | #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(... |
///Bismillahir Rahmanir Rahim
#include<bits/stdc++.h>
#define ll uint64_t
#define ll1 long long
#define endl "\n"
#define PI acos(-1)
#define fi first
#define si second
#define mkp mak... | #include<bits/stdc++.h>
using namespace std;
#define ALL(x) begin(x),end(x)
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define mod 1000000007
using ll=long long;
const int INF=1000000000;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0},dy[]={0... |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long x, y, a, b;
cin >> x >> y >> a >> b;
long long ans = 0;
long long tmp = x;
while (1) {
if (tmp >= (y / a))break;
if (tmp * a >= (long long) 2e18)break;
if (tmp * (a - 1) > b)break;
ans++;
tmp *= a;
}
ans += (y - tmp -1) / b;
co... | #include <iostream>
#include <algorithm>
#include <cmath>
#include <tuple>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#define flush fflush(stdout)
#define endl '\n'
#define all(v) v.begin(), v.end... |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()... | #include <iostream>
#include <vector>
using namespace std;
int main(void){
int n;
std::cin >> n;
int a[n] ;
int b[n] ;
for (int i = 0; i < n; i++) {
std::cin >> a[i];
}
for (int i = 0; i < n; i++) {
std::cin >> b[i];
}
int ans = 0;
for (int i = 0; i... |
#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... | #pragma GCC optimize ("O2")
#pragma GCC target ("avx")
#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) ... |
#include <bits/stdc++.h>
using namespace std;
int n, m, q, a, b, v[55], w[55], cnt, dp[55][55];
pair <int, int> p[55];
int main(){
cin >> n >> m >> q;
for(int i = 1; i <= n; i++) cin >> a >> b, p[i] = make_pair(a, b);
sort(p + 1, p + 1 + n);
for(int i = 1; i <= m; i++) cin >> v[i];
while(q--){
... | /**
* author: tomo0608
* created: 20.02.2021 21:39:59
**/
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
typedef pair<int,int> pii;
typedef pair<long long, l... |
#include <bits/stdc++.h>
using namespace std;
using LL=long long;
using ULL=unsigned long long;
#define rep(i,n) for(int i=0; i<(n); i++)
int K;
LL dp[4][200001];
int main(){
cin>>K;
rep(t,4) rep(i,K+1) dp[t][i]=0;
dp[0][1]=1;
rep(t,3) for(int i=1; i<=K; i++)
for(int j=i; j<=K; j+=i) dp[t+1][j]+=dp[t][i];... | #include<bits/stdc++.h>
#define int long long
using namespace std;
int n;
set<int>s;
signed main(){
cin>>n;
for(int i=2;i*i<=n;i++){
if(s.count(i))continue;
int t=i*i;
while(t<=n)s.insert(t),t*=i;
}
cout<<n-s.size();
return 0;
} |
//Hare Krishna
//author: Dipjoy Basak
//dip_10
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define ll long long
#define int ll
#define ld long double
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define vi vector<int>
#define pi pair<int, int>
#define vpi vector<pai... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
template<typename T1,typename T2> bool chmin(T1 &a,T2 b){if(a<=b)return 0; a=b; return 1;}
template<typename T1,typename T2> bool chmax(T1 &a,T2 b){if(a>=b)return 0; a=b; return 1;}
int dx[4]={0,1,0,-1}, dy[4]={1,0,... |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
pair<long long,long long> sum[40... | // abc199_d
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
#ifdef LOCAL
#include "../../debug_util/cxx-prettyprint/prettyprint.hpp"
#include "../../debug_util/rng.hpp"
#include "../../debug_util/timer.hpp"
#endif
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>... |
#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline")
#pragma GCC optimize(3 , "Ofast" , "inline")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <unordered_map>
#include <... | #include <bits/stdc++.h>
#define rep(i, l, r) for (register int i = l; i <= r; i++)
#define per(i, r, l) for (register int i = r; i >= l; i--)
#define srep(i, l, r) for (register int i = l; i < r; i++)
#define sper(i, r, l) for (register int i = r; i > l; i--)
#define erep(i, x) for (register int i = h[x]; i; i = e[i].... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template<class T> using vc = vector<T>;
template<class T> using vvc = vc<vc<T>>;
template<class T> using vvvc = vc<vvc<T>>;
template<class T> using vvvvc = vvc<vvc<T>>;
template<class T> using PQ = priority_queue<T>;
template<class T> using invPQ = pri... | #include <bits/stdc++.h>
using namespace std;
const int N=102;
const int mod=1e9+7;
int n,m,K,v[N],deg[N];
void add(int &x,int y)
{
(x+=y)>=mod&&(x-=mod);
}
int mul(int x,int y)
{
return 1ll*x*y%mod;
}
struct mat
{
int a[N][N];
mat(int x=0)
{
memset(a,0,sizeof a);
for(int i=1;i<=n;++i)
a[i][i]=x;
}
mat op... |
#include <stdio.h>
#include <math.h>
int main(void) {
long long int n;
long long int m;
scanf("%lld", &n);
scanf("%lld", &m);
long long int x = 0;
for(long long int i = 1; i < n; i++) {
x +=i;
}
for(long long int l =1; l <n; l++){
printf("%lld ",l);
}
printf("%lld ",1000000000-x);
long ... | #include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
// using namespace atcoder;
typedef int64_t lint;
#define rep(i, n) for(int i=0; i<n; i++)
#define repx(i, l, n) for(int i=l; i<n; i++)
#define all(v) v.begin(), v.end()
#define show(x) cout << #x << ": " << x << endl;
#define list(x) cout << #x <<... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e3 + 10;
const ll mod = 1e9 + 7;
ll n, m, a[N];
ll ksm(ll a, ll p)
{
ll res = 1;
while (p)
{
if (p & 1) res = res * a % mod;
a = a * a % mod;
p >>= 1;
}
return res;
}
ll get_c(ll n, ll m)
{
ll res = 1;
for (ll i = 1; i... | #include <bits/stdc++.h>
using namespace std;
template<class T> ostream& operator<<(ostream &os, vector<T> V) { os << "[ ";
for(auto v:V)os << v << " "; return os << "]";
}
template<class T> ostream& operator<<(ostream &os, set<T> S){ os << "{ ";
for(auto s:S) os<<s<<" "; return os<<"}";
}
template<class L, cla... |
/**
* author: ekusiadadus
* created: 11.04.2021 03:33:32
**/
#include<bits/stdc++.h>
using namespace std;
using i64 = long long;
int main(){
cin.tie(0);
ios_base::sync_with_stdio(false);
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
int n;
cin >> ... | #include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << "\n"
#define COUTF(x) cout << setpre... |
#include <iostream>
#include <vector>
using namespace std;
class Solution{
public:
long long solve(int L){
vector<vector<long long>> dp(L, vector<long long>(12, -1ll));
return C(L - 1, 11, dp);
}
private:
long long C(int N, int K, vector<vector<long long>>& dp){
if(K == 0) ret... | #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... |
// #pragma GCC optimize("Ofast,unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include <bits/stdc++.h>
#define ll long long int
#define vi vector<int>
#define vvi vector<vector<int>>
#define vll vector<long long>
#define vs vector<string>
#define vc vector<char>
#de... | /* -*- coding: utf-8 -*-
*
* e.cc: E - Train
*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.