code_file1 stringlengths 87 4k | code_file2 stringlengths 85 4k |
|---|---|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using que_type = tuple<int, pair<int, int>, vector<int>>;
void solve(long long si, long long sj, std::vector<std::vector<long long>> t, std::vector<std::vector<long long>> p){
priority_queue<que_type, vector<que_type>, greater<que_type>> que;
... | #include<bits/stdc++.h>
using namespace std;
#define hi {ios_base::sync_with_stdio(false);}
#define mani_jo {cin.tie(NULL);}
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> vi;
#define pp pair<ll,ll>
#define MAX 10000000
#define all(v) ((v).begin()), ((v).end())
#define sz(v) ((int)((v)... |
//#pragma GCC optimize ("O2")
//#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<cstdio>
#include<cstring>
#include<algorithm>
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 <... | #include <bits/stdc++.h>
using namespace std;
typedef long long i64;
typedef unsigned long long ui64;
typedef vector<i64> vi;
typedef vector<vi> vvi;
typedef pair<i64, i64> pi;
#define pb push_back
#define sz(a) i64((a).size())
#define all(c) (c).begin(), (c).end()
#define REP(s, e, i) for(i=(s); i < (e); ++i)
inlin... |
// #pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll p = 1e9 + 7;
const ll nax = 55;
ll ps[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71};
ll dp[(1 << 20)];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(... | #include <bits/stdc++.h>
#include <cassert>
#define rep(i, N) for (int i = 0; i < (N); ++i)
#define rep2(i, a, b) for (ll i = a; i <= b; ++i)
#define rep3(i, a, b) for (ll i = a; i >= b; --i)
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(c) begin(c), end(c)
#define ok() put... |
#include <bits/stdc++.h>
#define MAXN 2000005
#define ll long long
#define F first
#define S second
#define MOD 1000000007
#define ll long long
using namespace std;
ll a, b, c, d;
void solve()
{
cin >> a >> b >> c >> d;
ll ans = (b - 1ll*c * d);
if(ans == 0)
{
cout << -1;
return;
... | #include <bits/stdc++.h>
using namespace std;
using uli = unsigned long int;
using ll = long long;
#define rep(i, x) for (int i = 0; i < x; i++)
#define REP(i, x) for (int i = 1; i <= x; i++)
#define chmin(a, b) \
if (a > b) a = b
#define chmax(a, b) \
if (a < b) a = b
int main() {
double V, T, S, D;
cin >>... |
#include "bits/stdc++.h"
using namespace std;
#define int long long
using ll = long long;
using P = pair<ll, ll>;
const ll INF = (1LL << 61);
ll mod = 998244353;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) :x((x%mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint& operator+=(const... | #include<bits/stdc++.h>
using namespace std;
namespace Sakurajima_Mai{
#define ms(a) memset(a,0,sizeof(a))
#define repi(i,a,b) for(int i=a,bbb=b;i<=bbb;++i)//attention reg int or reg ll ?
#define repd(i,a,b) for(int i=a,bbb=b;i>=bbb;--i)
#define reps(s) for(int i=head[s],v=e[i].to;i;i=e[i].nxt,v=e[i].t... |
#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... | // #pragma GCC optimize(3)
#include <bits/stdc++.h>
using namespace std;
#define repeat(i,a,b) for(int i=(a),_=(b);i<_;i++)
#define repeat_back(i,a,b) for(int i=(b)-1,_=(a);i>=_;i--)
#define mst(a,x) memset(a,x,sizeof(a))
#define fi first
#define se second
mt19937 rnd(chrono::high_resolution_clock::now().time_since_epo... |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(ll i=0;i<(ll)n;i++)
#define dump(x) cerr << "Line " << __LINE__ << ": " << #x << " = " << (x) << "\n";
#define spa << " " <<
#define fi first
#define se second
#define ALL(a) (a).begin(),(a).end()
#define ALLR(a) (a).rbegin(),(a).rend()
using ld =... | #include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<queue>
using namespace std;
typedef long long ll;
const int N=100005;
int n,a[N],b[N],c[N],d[N];
ll ans;
priority_queue<ll> q[2];
int main(){
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%d",&a[i]);
ans+=a[i];
}
for(int i=1;i<=n;i+... |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <iomanip>
#include <functional>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i,n) for (ll i = 0; i < (ll)(n); i++)
#define ... | /* --------------------
| LOSER |
| ~NOOBOSS~ |
--------------------
*/
#include <bits/stdc++.h>
using namespace std;
#define mxx 1e18
#define mnn -1e18
#define Y() cout<< "YES" <<endl
#define N() co... |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef vector<pair<int,int> > vpii;
typedef vector<vector<int> > vvi;
typedef vector<vector<char... | // Code Written by Pinaki Bhattacharjee (pinakipb2)
#include<bits/stdc++.h>
using namespace std;
// typedef
typedef long long ll;
typedef long double ld;
typedef unsigned int uint;
typedef unsigned long long ull;
// #define
#define LOCAL
#define endl "\n"
#define PI 2*acos(0.0)
#define ff first
#define ss second
#def... |
/**
* Author: dhruv_gheewala
* Problem: A - Hands
* Date: 28.11.2020
* Time: 18:31:28
**/
#if __has_include("debug.h")
#include "debug.h"
#else
#include<bits/stdc++.h>
using namespace std;
#define fundri 108
#define debug(...) 1729
#endif
#define endl '\n'
#define int int64_t
... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int , int>;
int main(int argc, char const *argv[])
{
int a, b , c;
cin >> a >> b >> c;
a = 7-a;
b = 7- b;
c = 7-c;
cout << a + b + c << endl;
return 0;
}
|
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <queue>
#include <vector>
#include <stack>
#include <string>
#include <bitset>
#include <set>
#include <cmath>
#define LL long long
#define ull unsigned long long
#define mk(t1, t2) make_pair(t1, t2)
using namespace std;
const LL mo ... | #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstring>
#include <functional>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <istream>
#include <map>
#include <math.h>
#include <numeric>
#include <ostream>
... |
#include <bits/stdc++.h>
#define arr array
#define pb push_back
#define fs first
#define sc second
#define eb emplace_back
#define vt vector
#define rep(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
using namespace std;
typedef long... | /**
* author: BohaoWang (bj050323@gmail.com)
* id:
* tag:
*/
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <queue>
#include <... |
#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 all(x) (x).begin(), (x).end()
#define SZ(x) ((int) (x).size())
using ll = long long;
int main() {
int n, k, m;
cin >> n >> k >> m;
vector <... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
string S, X;
cin >> N >> S >> X;
vector<vector<bool>> dp(N + 1, vector<bool>(7, false));
dp[N][0] = true;
for (int i = N - 1; i >= 0; i--) {
int s = (int)S[i] - 0x30;
if (X[i] == 'A') {
for (int j = 0; j < 7; j++)... |
#include<bits/stdc++.h>
using namespace std;
int a[801][801],b[640001],n,k,sum[801][801];
bool check(int x){
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++){
if(a[i][j]>x) sum[i][j]=sum[i][j-1]+sum[i-1][j]-sum[i-1][j-1]+1;
else sum[i][j]=sum[i][j-1]+sum[i-1][j]-sum[i-1][j-1];
}
for(int i=1;i<=n-k+1;i++)
for... | /*** author: yuji9511 ***/
#include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
using namespace std;
using ll = long long;
using lpair = pair<ll, ll>;
using vll = vector<ll>;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i=(m);i<(n);i++)
#define rrep(i,m,n) for(ll i=(m);... |
#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define int long long int
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vi vector<int>
#defi... | #include <bits/stdc++.h>
#define int long long
using namespace std;
int32_t main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int N;
cin >> N;
set<int> st;
for(int i = 0 ; i < N ; i++)
{
int n;
cin >> n;
st.insert(n);
}
while(1)
{
if(st.size() == 1)b... |
#include <bits/stdc++.h>
using namespace std;
#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++)
int nota(string S){
rep(i,S.size()){
if(S.at(i) != 'a'){
return i;
}
if(i== (int) (S.size()-1) && S.at(i) == 'a'){
return -10;
}
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, c) for(int i = 0; i < (int)c; i++)
int main(){
int n, ans = 0;
cin >> n;
int a[n];
rep(i, n) cin >> a[i];
rep(i, n){
if(a[i] > 10){
ans += a[i] - 10;
}
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<=n;i++)
#define per(i,a,n) for (int i=n;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi firstk
#define se second
#define SZ(x) ((int)(x).size())
#define mem(a,b) memset(a,b,sizeof (a))
#def... | #include <bits/stdc++.h>
using namespace std;
struct UnionFind {
vector<int> par;
vector<int> sz;
UnionFind(int n=0){ if(n>0) initialize(n); }
void initialize(int n){
par.resize(n);
sz.assign(n, 1);
for(int i=0; i<n; i++){
par[i] = i;
}
}
int find(i... |
#include "bits/stdc++.h"
using namespace std;
int main() {
string S;
cin >> S;
map<int, int> s;
string ans = "No\n";
for (int i = 0; i < S.size(); ++i) ++s[S.at(i) - '0'];
if (S.size() == 1) {
if (S == "0" || S == "8") ans = "Yes\n";
}
else if (S.size() == 2) {
for (int i = 0; i < 100; i ... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define ff first
#define ss second
#define rep(i, n) for(int i = 0; i < n; ++i)
#define repR(i, n) for (int i = n-1; i >= 0; --i)
#define repA(i, a, n) for (int i = a; i <= n; ++i)
#de... |
#define NDEBUG
#include <bits/stdc++.h>
using namespace std;
void dbg() {
cerr << endl;
}
template <typename U, typename... Ts>
void dbg(U foo, Ts... bar) {
cerr << ' ' << to_string(foo);
dbg(bar...);
}
#ifndef NDEBUG
#define debug(...) cerr << '[' << #__VA_ARGS__ << "]: ", dbg(__VA_ARGS__)
#else
#defi... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vpl = vector<pair<ll, ll>>;
using pll = pair<ll, ll>;
#define rep(i, k, n) for(ll i = k; i < n; i++)
#define pb push_back
#define mp make_pair
ll change(string x, ll k, ll m){
... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,a,b) for(int i=a;i<b;i++)
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define FORe(i,a,b) for(int i=a;i<=b;i++)
#define FORr(i,a,b) for(int i=a;i>b;i--)
#define FORre(i,a,b) for(int i=a;i>=b;i--)
#define pb push_back
#define imie(...) " [" <<... | #include<cstdio>
#include<cstring>
#include<queue>
#include<cmath>
#include<algorithm>
using namespace std;
typedef int int_;
#define int long long
#define maxn 400010
const int inf=1e9+7;
queue<int> q;
inline int read(){
int ret=0,ff=1;
char ch=getchar();
while(ch<'0'||ch>'9'){
if(ch=='-') ff=-ff;
ch=getchar();... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair <int, int>;
const int N = 1e3 + 7;
int main () {
ios::sync_with_stdio(0);
cin.tie(0);
#ifdef LOCAL
freopen("in.txt", "r", stdin);
#endif
int n, m; cin >> n >> m;
vector <bool> a(N), b(N);
for (int i = 0; i < n; ++i) {
... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
const int INF = (int)1e9;
const ll INFL = (ll)1e18;... |
#include <iostream>
using namespace std;
struct point {
int x, y;
}p[105];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> p[i].x >> p[i].y;
}
int max = 0;
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j < n; j++) {
int cnt = 2;
point vec1;
vec1.x = p[j].x - p[i].x;
vec... | #include <algorithm>
// #include <atcoder/all>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered... |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <numeric>
#include <utility>
#include <tuple>
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;
using P = pair<ll, ll>;
// clang-format off
#ifdef _DEBUG_
#define dump(...) do{... | #include <bits/stdc++.h>
#define ln '\n'
#define all(dat) dat.begin(), dat.end()
#define loop(i, to) for (int i = 0; i < to; ++i)
#define cont(i, to) for (int i = 1; i <= to; ++i)
#define circ(i, fm, to) for (int i = fm; i <= to; ++i)
#define foreach(i, dat) for (__typeof(... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define PI 3.14159265359
#define mod 1000000007
#define ALL(a) (a).begin(),(a).end()
int main(){
ll a,b;
cin >> a >> b;
int ans = 1;
for(int i = 1; i <= 200000; i++){
if(a % i != 0){
... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
int a,b;
cin >> a >> b;
//cout<<__gcd(a,b)<<endl;
int dis = b-a;
for(int i=dis;i>=1;i--)
{
int n = b/i;
// cout<<i<<" "<<n<<endl;
if((n+1)*i <=b && (n+1)*i>=a)
{
cout<... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define ls rt<<1
#define rs rt<<1|1
const int N=2e5+5;
const ll REQ=1e13;
const int INF=0x3f3f3f3f;
const int mod=1e9+7;
const double eps=1e-9;
const double pi=acos(-1);
ll quick(ll a,int n){
ll re=1;
while(n){
if(n&1... | #include <bits/stdc++.h>
#define rei register int
#define int long long
using namespace std;
const int N=2e3+100,mod=1e9+7;
int n,m,a[N];
inline int read(){
int sum=0,sign=1;
char ch=getchar();
while(ch<'0'||ch>'9'){
if(ch=='-') sign=-1;
ch=getchar();
}
while(ch>='0'&&ch<='9'){
... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=5e5+5;
const int mod=1000000000+7;
const int inf=0x3f3f3f3f;
int h,w;
char g[5050][5050];
ll x[5050][5050],y[5050][5050],z[5050][5050];
ll dp[5050][5050];
int main(){
scanf("%d%d",&h,&w);
for(int i=1;i<=h;i++)
scanf("%s",g... | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define ... |
#include<iostream>
#include<cstdio>
#include<stack>
#include<queue>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<set>
#include<iomanip>
using namespace std;
#define N 300009
#define LL long long
#define INF 0x3f3f3f3f
#define mymin(x,y) (x>=y?y:x)
#define mymax(x,y) (x>=y?x:y)
int tong[N];
int main() ... | #include<bits/stdc++.h>
using namespace std;
#define ff first
#define brn "\n"
#define ss second
#define mk make_pair
#define int long long
#define pb push_back
#define ps(x,y) fixed<<setprecision(y)<<x
#define w(x) ... |
#include <bits/stdc++.h>
using namespace std;
#define co(n) cout<<n<<endl;
const double eps=1e-10,pi=3.1415926535898;
const int mod=998244353,maxn=5e3+10;
int T,n,m,q,k;
long long x,y,a[maxn][maxn];
long long qpow(long long x, int k) {
long long cnt=1;
while (k) {
if (k&1) cnt = cnt*x%mod;
x = x*x%mod;
k >>= ... | #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>
using namespace std;
#define int long long
void read (int &x) {
char ch = getchar(); x = 0; int f = 0;
while (!isdigit(ch)) { if (ch == '-') f = 1; ch = getchar(); }
while (isdigit(ch)) x = x * 10 + ch - 48, ch = getchar();
if (f) x = -x;
} const int N = 1e5 + 5, mod = 1e9 + 7;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 998244353;
ll mem[3005][3005];
ll dp(int n, int k){
if (k > n) return 0;
if (n == 0) return (k == 0);
if (k <= 0) return 0;
//printf("%d %d\n",n,k);
if (mem[n][k] != -1) return mem[n][k];
int ans1 = 0;
if (k ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 100 + 5;
const ll mod = 1e9 + 7;
int n, m, k, b[maxn][maxn];
ll powMod(ll a, ll k) { ll ret = 1; while(k) { if(k & 1) ret = ret * a % mod; a = a * a % mod; k >>= 1;} return ret;}
ll getinv(ll x) { return powMod(x, mod - 2);}
struct Mat... | #include<cstdio>
#include<vector>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<algorithm>
#include<set>
using namespace std;
#define NDEBUG
#include<cassert>
namespace Elaina{
#define rep(i, l, r) for(int i=(l), i##_end_=(r); i<=i##_end_; ++i)
#define drep(i, l, r) for(int i=(l), i##_end_=(r);... |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
#define all(v) v.begin(),v.end()
using namespace std;
using ll = long long;
int H, W;
int pt(char c){
if(c == '+') return 1;
else return -1;
}
bool inarea(int y, int x){
if(0 <= y && y < H && 0 <= x && x < W) return true;
else return ... | #include <iostream>
#include <algorithm>
#include <numeric>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <iomanip>
#include <functional>
#include <bitset>
#include <limits>
#include <cstdio>
#include <cmath>
#include <cassert>
#include <ra... |
/*
om namah shivay
*/
#include<bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define REP(i,a,b) for(i=a;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define ll long long
#define si(x) scanf("%d",&x)
#define sl(x) scanf("%lld",&x)
#define ss(s) scanf("%s",s)
#define pi(x) printf("%d\n",x)
#define pl(x) printf("%lld\... | // clang++ -std=c++14 probA.cpp
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio... |
#include<bits/stdc++.h>
using namespace std;
#define INF 1000000007
#define MOD 998244353
#define LINF (1LL << 62)
#define PI 3.14159265358979
typedef long long i64;
typedef pair<int,int> P;
inline i64 mod(i64 a, i64 m) { return (a % m + m) % m; }
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; ret... | #include<iostream>
#include<vector>
#include<algorithm>
#include<random>
#include<map>
long long int realOdometer = 0;
long long int manhattanOdometer = 0;
long long int generalAverage = 0;
using namespace std;
int main(){
pair<int, int>s, t;
map<pair<pair<int, int>, pair<int, int>>, pair<int, int>>distance;
int ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve() {
int n; cin >> n;
vector<int> a(n);
for (int &i : a) {
cin >> i;
}
sort(a.begin(), a.end());
ll f = 0;
for (int i = n - 1; i >= 0; i -= 2) {
f += a[i];
}
ll s = accumulate(a.begin(), a... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#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 all(a) (a).begin(),(a).end()
#define bit(k) (1LL<<(k))
#define SUM(v) accumulate(all(v), 0LL)
typedef pair<int, int> i_i;
typedef pair<ll, ll> l_l;
template... |
/*
Author: Aryan Yadav
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define f(i, a, b) for (long long i = a; i < b; i++)
#define rep(i, a, b) for (long long i = a; i <= b; i++)
#define fm(i, a, b) for (long long i = a; i > b; i--)
#define repm(i, a, b) for (long long... | //#include <atcoder/all>
//using namespace atcoder;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for(int i=0; i<n; i++)
#define REPR(i, n) for(int i=n-1; i>=0; i--)
#define FOR(i, m, n) for(int i=m; i<n; i++)
#define ALL(v) v.begin(), v.end()
#define SIZE(x) int(x.size())
#defi... |
#include <bits/stdc++.h>
using namespace std;
using namespace std::chrono;
typedef long long int ll;
using ii= pair<ll,ll>;
#define fr(i,a,b) for(ll i=a;i<b;i++)
#define all(o) (o).begin(),(o).end()
#define F first
#define S second
#define MP make_pair
#define PB push_back
#define ld long double
#define eps 0.00000000... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N, M,T;
cin >> N >> M>>T;
int Nmax = N;
vector<int> A(M);
vector<int> B(M);
for(int i = 0; i < M;i++){
int x = 0;
int y = 0;
cin >> x >> y;
A.at(i) = x;
B.at(i) = y;
}
bool flag = true;
for(int i = 0; i < M; i++){
if(i == 0... |
#include <iostream>
#include <cassert>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
long long n;
cin >> n;
long long x = 0, y = 0;
vector<int> Q;
auto q = [&](int i){
if(i == 0){
x += 1;
}
if(i == 1){
y += 1;
}
if(i == 2){
x += y;
}
if(... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... |
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#incl... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define N 214514
#define all(x) (x).begin(), (x).end()
const ll mod = 998244353;
const ll inf = 8000000000000000000;
int main() {
vector<ll> used(1010);
ll n, m;
cin >> n >> m;
... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int x;
cin >> x;
if(x < 0){
cout << 0 << endl;
}else {
cout << x << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i = 0; i < (n); i++)
#define INF 2 << 29
#define MOD 1000000007
#define Yes(f) puts((f)? "Yes" : "No")
#define YES(f) puts((f)? "YES" : "NO")
#define pi 3.1415926535897
int gcd(int a, int b) {
if (b != 0) return gcd(b, a % b);... |
#include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int main(){
string S;
cin >> S;
int cnt = 0;
for( int i = 0; i < 10000; i++ ){
int used[10] = {0};
for( int a = 0; a < 4; a++ ){
int temp = i / int... | /*
written by Pankaj Kumar.
country:-INDIA
Institute: National Institute of Technology, Uttarakhand
*/
#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 long long ll ;
typedef unsigned long long ull... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> p;
#define MOD 1000000007
map<ll, ll> m;
map<ll, bool> c;
ll memo(ll x, ll y) {
if(c[y]) return m[y];
ll a;
if(y == 1LL) {
a = x - 1LL;
} else if(y % 2LL) {
a = min(abs(x - y), min(memo(x, (... | #include <algorithm>
#include <array>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <... |
#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++)
int main()
{
int n;
string s,t;
cin >> n >> s >> t;
vector<int> s0;
vector<int> t0;
rep(i,n){
if(s[i] == '0')s0.push_back(i);
if(t[i] == '0')t... | #include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
#define rep(i, l, r) for(int i=(l), i##_end_=(r); i<=i##_end_; ++i)
#define drep(i, l, r) for(int i=(l), i##_end_=(r); i>=i##_end_; --i)
#define fi first
#define se second
#define Endl putchar('\n')
typedef long long ll;
typedef pair<int, int> ... |
#include <iostream>
using namespace std;
int main()
{
int x, y;
cin >> x >> y;
if (x > y && y + 3 > x)
cout << "Yes";
else if(y > x && x + 3 > y)
cout << "Yes";
else
cout << "No";
} | #include<bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <string>
#include <chrono>
#include <complex>
using namespace std;
#define ll long long
#define ld long double
#define ui unsigned int
#define ull unsigned ll
#define mp make_pair
#define eb emplac... |
#include<set>
#include<ctime>
#include<cstdio>
#include<cctype>
#include<vector>
#include<cstdlib>
#include<cstring>
#include<algorithm>
using namespace std;
const int N=1e4+7;
int read(){
char c;
int x=0,f=1;
while(!isdigit(c=getchar()))
f-=2*(c=='-');
while(isdigit(c)){
x=x*10+f*(c-48);
c=getchar();
}
ret... | #include <bits/stdc++.h>
using namespace std;
void chmin(long long int& a, long long int b)
{
if (a > b) {
a = b;
}
}
int main()
{
int N, M;
cin >> N >> M;
// 入力する
vector<long long int> H(N);
vector<long long int> W(M);
for (int i = 0; i < N; i++) {
cin >> H[i];
}
... |
#include<bits/stdc++.h>
#include<iostream>
#include<map>
#include<math.h>
#include<string>
#include<string.h>
#include<vector>
#include<queue>
#include<algorithm>
#include<set>
#define _GLIBCXX_DEBUG
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
using namespace std;
using ll=long long;
co... | #include<bits/stdc++.h>
using ll = int_fast64_t;
using P = std::pair<ll,ll>;
using PP = std::pair<ll,P>;
#define REP(i,b,e) for(int i=b; i<e; i++)
#define PRINT(vec) {printf("[ ");for(auto &i:vec)printf("%ld ",i);puts("]");}
#define fi first
#define se second
const int MOD = 1e9+7;
int dx[] = {0, 1, 0, -1, 1, 1, -1, ... |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int MAX32 = 2147483647;
const double PI = 3.14159265358979323846;
int main() {
long long n, p, min = 0;
cin >> n;
vector<char> num(300000, 0);
for (int i = 0; i < n; i++) {
cin >> p;
num[p] = 1;
while (num[min]) {
... | #include<bits/stdc++.h>
using namespace std;
const int N=100;
string a[N];
long long dp[N];
int main(){
int n;
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
}
for(int i=1;i<=n;i++){
if(a[i]=="AND")
dp[i]=dp[i-1];
else
dp[i]=dp[i-1]+(1LL<<i);
}
c... |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int main(){
IOS;
int n;
cin >> n;
vector<long long int> vec;
for(int i=0; i<n; i++){
int a;
cin >> a;
vec.push_back(a);
}
long long first=0;
for(int i=0; i<... | /*
*
* AUTHOR :- @soham01
* // "WORK HARD AND NEVER GIVE UP" //
*
*/
#include "bits/stdc++.h"
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_updat... |
#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 MOD = 1e9 + 7;
int main(){
string s; cin >> s;
deque<char> t;
int r = 0;
for(char c : s){
if(c == 'R') r = 1 - r;
else {
if(r =... | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#include <stack>
#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()
us... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main () {
int n;
cin >> n;
pair<int, int> ar[n];
for (int i = 0; i < n; i++) {
cin >> ar[i].first >> ar[i].second;
}
int sol = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
ld x = ar[j].f... | // Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools
#include <bits/stdc++.h>
// #include "atcoder/all"
using namespace std;
using i64 = long long;
const i64 MOD = 1e9 + 7;
const i64 INF = i64(1e18) + 7;
template <typename T>
bool chmin(T& x, T y){
if(x > y){
x = y;
return tr... |
#pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<cstdio>
#include<cstring>
#include<algorithm>
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... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 2e5 + 10;
vector<int> edge[maxn];
int n, k, p, tot;
int mx[maxn];
void dfs(int u, int pre)
{
mx[u] = 0;
for(int v : edge[u]) if(v != pre)
{
dfs(v, u);
if(mx[u] + mx[v] + 1 > 2 * p)
{
tot ++;
mx[u] = min(mx[u], mx[v] ... |
#include<bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
long long n;
unordered_set <long long> se;
cin >> n;
int x = sqrt(n);
for (int i = 2;i < x+2;i++)
for (int j = 2;j < n && pow(i,j) <= n;j++)
se.insert(pow... | //Codeforcesで128bit整数を使いたいとき
//→__int128_tを使う&GNU C++17 (64)で提出する
//インクルードなど
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//イテレーション
#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 FO... |
#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... | /*************************************************************************
> File Name: 1.cpp
> Author: Knowledge_llz
> Mail: 925538513@qq.com
> Blog: https://blog.csdn.net/Pig_cfbsl
> Created Time: 2020/10/11 14:09:05
************************************************************************/
#include<bits/stdc+... |
#include <bits/stdc++.h>
using namespace std;
//UnionFindテンプレ
class UnionFind {
// まとめる 判定 サイズを知る
public:
// Aから見た親の番号を格納する。rootだったら-1*その集合のサイズ。
vector<int> Parent;
// 初期化
UnionFind(int N) {
Parent = vector<int>(N, -1);
}
// Aのrootを調べる
int root(int A) {
if (Parent[... | #include<bits/stdc++.h>
#define title "title"
#define ll long long
#define ull unsigned ll
#define fix(x) fixed<<setprecision(x)
#define pii pair<int,int>
#define vint vector<int>
#define pb push_back
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define red(i,a,b) for(int i=(a);i>=(b);i--)
#define Help freopen("a.cpp",... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll; //int:2*10**9
typedef long double ld;
typedef pair<ll,ll> P;
#define REP(i,n) for(ll i = 0; i<(ll)(n); i++)
#define FOR(i,a,b) for(ll i=(a);i<=(b);i++)
#define FORD(i,a,b) for(ll i=(a);i>=(b);i--)
#define pb push_back
#define MOD 1000000007 //998244353... | #include <iostream>
#include <string>
#include <set>
#include <map>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <cmath>
#include <queue>
#include <sstream>
#include <ctime>
#include <iterator>
#include <string.h>
#include <stack>
#include <unordered_set>
#include <unordered_map>
#include <bitset>... |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, a, n) for (int i = (a); i < (int)(n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
using ll = long long;
int main() {
int A,B,C; cin >> A >> B >> C;
bool c = (C%2 == 0 ? true : false);
strin... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <set>
#include <sstream>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define reps(i, s, n) for (int i = s; i < n; i++)
#define d... |
#include<bits/stdc++.h>
using namespace std;
#define INF 1234567890
#define ll long long
int N, M, sy, sx, sd, res = 0;
string s[11];
int dir[4][2] = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};
int block[4][2] = {{-1, 1}, {1, 1}, {1, -1}, {-1, -1}};
bool vis[11][11][4];
void f(int y, int x, int d)
{
if (vis[y][x][d]) re... | #include <iostream>
#define rep(i,a,n) for(int i = a; i < (n); i++)
using namespace std;
int main(){
int h,w,cnt = 0;
cin >> h >> w;
char g[h][w];
rep(i,0,h)
rep(j,0,w){
cin >> g[i][j];
//if(g[i][j] == '#') cout << "Ye" << endl;
}
rep(i,0,h-1)
rep(j,0,w-1){
int v = (g[i][j] == '#') + (g[i+1][... |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <numeric>
#include <utility>
#include <tuple>
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;
using P = pair<ll, ll>;
// clang-format off
#ifdef _DEBUG_
#define dump(...) do{... |
/**
* Coded by : lucky_21
* --------Lokesh Singh
**/
#include<bits/stdc++.h>
using namespace std;
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T> using oset=tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_upd... |
#include <bits/stdc++.h>
#define rep(i,s,n) for (int i = s; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
using Matrix = vector<vector<int>>;
const ll INF = LLONG_MAX;
const ld EPS = 1e... | #include "bits/stdc++.h"
using namespace std;
// #define int long long
constexpr int N = 801;
int f[N][N];
int n, k;
int bound;
int a[N][N];
int get(int x1, int y1, int x2, int y2) {
return f[x2][y2] - f[x1 - 1][y2] - f[x2][y1 - 1] + f[x1 - 1][y1 - 1];
}
bool check(int t) {
for (int i = 1; i <= n; i ++) {
for (... |
#include <bits/stdc++.h>
using ull = unsigned long long int;
using ll = long long;
using ld = long double;
using pii = std::pair<int,int>;
using pll = std::pair<ll, ll>;
using vi = std::vector<int> ;
using vvi = std::vector<vi> ;
using vll = std::vector<ll>;
using vvll = std::vector<vll>;
using vd = std::vector<double... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<string, string> pss;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vii;
typedef vector<ll> vl;
typedef vector<vl> vvl;
double EPS=1e-9;
int INF=1000000005;
long ... |
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
//#include<boost/multipre... | //@Author: KeinYukiyoshi
// clang-format off
#include <bits/stdc++.h>
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx")
#define int long long
using namespace std;
#define stoi stoll
#define fi first
#define se second
#define rep(i, n) for(int i=0, i##_len=(n); i<i##_len; i++)
#define rep2(i, a, b) for (int i... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
#define vec vector<ll>
#define mat vector<vector... |
#include <bits/stdc++.h>
#include <fstream>
#define FIXED_FLOAT(x) std::fixed <<std::setprecision(3)<<(x)
#define all(v) (v).begin(), ( v).end()
using namespace std;
#define forn(i, b) for (int i=0; i<b; ++i)
using ll = long long;
const int mod = (ll)1e9 + 7;
#define PI acos(-1)
typedef pair<int , int> pairs;
typed... |
#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define ff first
#define ss second
int main(void){
// Your code here!
ll i,ans,n;
cin >> n;
ll a[n],b[n];
for(i=0;i<n;i++)
{
cin >> a[i];
b[i]=a[i];
}
for(i=1;i<n;i++)
{
a[i]+=a[i-1];
b[i]+=b[i-1];
}
for(i=... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i=0; i<n; i++)
using ll = long long;
using P = pair<int, int>;
using T = tuple<int, int, int>;
const int INF = 1001001001;
#define pcnt __builtin_popcount
map<int, int> mp;
vector<int> A;
int b, c;
int main(){
int N;
cin >> N;
A = vector<in... | #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<bits/stdc++.h>
using namespace std;
int n,m;
int edge[1001][1001];
bool visited[1001][1001];
vector<int> vc[1001][26];
struct PT{
int st,ed;
int size;
};
int main(){
int x,y,sz;
char c;
cin>>n>>m;
for(int i=0;i<m;i++){
cin>>x>>y>>c;
edge[x][y]=edge[y][x]=1;
vc... | #include <bits/stdc++.h>
using namespace std;
#define la1ee ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
int main()
{
la1ee
int n; cin>>n;
bool f = false;
long long int a[n]{}, b[n]{}, c[n]{};
for(int i=0; i<n; ++i)
{
cin>>a[i]>>b[i]>>c[i];
}
long long int ans = 1e11;
//cout<<ans;
for (in... |
#include <bits/stdc++.h>
#define ll long long int
#define w(t) int t; cin>>t; while(t--)
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define mii map<int,int>
#defin... | #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 int N=101000;
#define x first
#define y second
struct node{
int val;
string ch;
}arr[13456];
bool cmp(node a,node b)
{
return a.val>b.val;
}
long long dp[105][105];
int main()
{
int n;
cin>>n;
for(int i=1;i<=n;i++)
cin>>arr[i].ch>>arr[i].val;
sort(arr+1,arr+1+n... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int x;
cin>>x;
int ans = 100-x%100;
cout<<ans<<endl;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define endl '\n'
#define all(x) (x).begin(),(x).end()
#define trace(...) debug(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void debug(const char* name, Arg1&& arg1){
cerr << name << ": " << arg1 << endl;
}
tem... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define each(e, v) for(auto &e: v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x)... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<char> vc;
typedef pair<int,int> pii;
#define ALL(x) x.begin(),x.end()
#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... | #include<iostream>
#include<vector>
#include<chrono>
#define int long long
#define fi first
#define se second
using namespace std;
//const int MAXN = 100005;
const int MOD = 1e9 + 7;
//const int INF = 1e18;
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
x += 0x9e3779b97f4a7c15;
x ... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,a,b) for(int i=a;i<b;i++)
void solve(){
string s;
cin >> s;
int countl = 0 ,countu = 0;
rep(i,0,s.size()){
if((i+1) % 2 == 0){
if(isupper(s[i]))countu++;
}
... | #include<bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
#define pb push_back
using namespace std;
const int N = 4e5+5, mod = 3;
int n;
ll A[N],f[N],g[N];
ll answer = 0;
int C(int a,int b){
if(f[b] > f[a] + f[b-a]){
return 0;
}
int x = 4*g[b]/g[a]/g[b-a];
if(x == 1) re... |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int sum = 2*n;
int i=1;
while(1){
if(i*(i+1) >= sum){
break;
}
i++;
}
cout<<i;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fastIO ios_base::sync_with_stdio(false); cin.tie(0);
#define mod 1000000007
ll power(ll x, ll n) {
ll ans = 1;
while(n>0) {
if(n&1){
ans = (ans*x)%mod;
n = n-1;
}
else {
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define range(a) a.begin(), a.end()
#define endl "\n"
#define Yes() cout << "Yes" << endl
#define No() cout << "No" << endl
#define MP make_pair
con... |
#include <vector>
#include <stdio.h>
using namespace std;
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<(n);++i)
using ll = long long;
using p = pair<int,int>;
int n;
vector<vector<int>> to;
vector<int> used,col;
vector<int> vs;
void dfs(int v)//引数は今見ている頂点
{
if(used[v])//頂点に訪れていたならreturn
{
return;
... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ll n,m; cin>>n>>m;
vector<ll>a(n),b(m);
map<ll,ll>mp;
for(auto &it : a)
{
cin>>it;
mp[it]++;
}
for(auto &it : b)
{
cin>>it;
mp[it]++;
}
for(auto i : mp)
{
... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ull unsigned long long
#define ld long double
#define F first
#define S second
#define eb emplace_back
#define pb push_back
#define mp make_pair
#define all(x) begin(x), end(x)
#define ra... |
#include <bits/stdc++.h>
#define For(i, a, b) for (int(i) = (int)(a); (i) < (int)(b); ++(i))
#define rFor(i, a, b) for (int(i) = (int)(a)-1; (i) >= (int)(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
... | #define _CRT_SECURE_NO_WARNINGS 1
#include <iostream>
#include <cstdio>
#include <utility>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;
using ll = long long int;
int n, m;
vector<int> g[1001][30];
int d[1001][1001];
bool g2[1001][1001];
int res;
constexpr int INF = 987654321;
int ma... |
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define pb push_back
#define ll long long
#define ld long double
#define sz(x) (ll)x.size()
#... | // #pragma GCC optimise ("O1")
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,j,n) for(ll i=j;i<n;i++)
#define _rep(i,n) for(ll i=n-1;i>=1;i--)
#define scn(a) scanf("%lld",&a)
#define scns(a,b) scanf("%lld %lld",&a,&b)
#define print(a) printf("%lld",a)
#define... |
#include<bits/stdc++.h>
#define ll long long int
#define ld long double
using namespace std;
#define fio ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define endl "\n"
#define maxpq priority_queue<ll>
#define minpq priority... | #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;
/*---------------------DEBUGGING--------------------------------------------*/
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(lon... |
#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 = long long;
const long long INF = 1LL << 60;
const int SINF = 1LL << 30;
const ll mod = 1000000000+7;
const ll MOD = 998244353;
const int dx[8] = ... |
/*
ॐ
JAI SHREE RAM
Hare Krishna Hare Krishna Krishna Krishna Hare Hare
Hare Rama Hare Rama Rama Rama Hare Hare
ॐ
*/
//Written by Bhuwanesh Nainwal
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace s... |
// E - Traveler
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define rep(i,e) for(int i=0;i<(e);++i)
int main(){
ll INF = 1e9 + 1;
int n; cin>>n;
vector<pair<ll,ll>> A(n+1);
rep(i, n) A[i] = {INF, -INF};
rep(i, n){
ll x, c; cin>>x>>c; --c;
auto[mn, mx] = A[c];
A[c] = {min(mn, x), max(mx... | //AnkitCode99 here....
//every ups and downs matter!
#include<bits/stdc++.h>
#define endl "\n"
#define IOS ios_base::sync_with_stdio(0);cin.tie(nullptr);cout.tie(nullptr)
typedef long long int ll;
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define pb push_back
using namespace std;
const ll sz=(1e5+5)*2;
const ll szz=1e6... |
#include<bits/stdc++.h>
using namespace std;
char s[1000005];
int f[1000005],mn[205];
int main()
{
int n;
scanf("%d%s",&n,s+1);
memset(f,0x3f,sizeof(f));
memset(mn,0x3f,sizeof(mn));
f[0]=0,mn[s[1]-'a']=0;
for(int i=1;i<=n;i++)
{
for(int j=0;j<=25;j++)
if(j!=s[i]-'a')f[i]=... | #include <bits/stdc++.h>
using namespace std;
long long i,j,p,l,t;
long long c[234567],a[213167],b[211167],d,e[234567],tt=0,k=0,y,z,n=0,x;
char m;
string q,w,s;
int main(){
cin >>t>>s;
if(s[0]!=s[s.size()-1]){
cout<<1;
return 0;
}
k=1;
for(i=1; i<s.size()-1; i++){
k++;
... |
using namespace std;
#include <bits/stdc++.h>
#define frr(i, r, l) for(int i = r; i >= l; --i)
#define fr(i, l, r) for(int i = l; i < r; ++i)
#define forit(it, type, var) for(type::iterator it = var.begin(); it != var.end(); it++)
#define ii pair<int, int>
#define iii pair<int, ii>
#define MEMS(a,b) memset(a,b,sizeof(a... | #include <bits/stdc++.h>
using namespace std;
#define clr(a) memset(a, 0, sizeof(a))
#define full(a) memset(a, 0x3f, sizeof(a))
#define fornext(x, i) for(int i = head[x], y = ver[i]; i; i = nxt[i], y = ver[i])
#define mset(a, b) memset(a, b, sizeof(a))
#define Rep(i, a, b) for(int i = (a); i <= (b); ++i)
#define dRep(i... |
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
#include<set>
#include<map>
#include<iostream>
#define fi first
#define se second
#define mk make_pair
#define pb push_back
#define ls (t<<1)
#define rs ((t<<1)|1)
#define mid ((l+r)>>1)
#define N 300005
using namespace std;
int A[N], B[N], ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;
template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (ll i=(ll)from; i<(ll)to; i++)
#define all(vec) vec.begin(), vec.en... |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main(){
int n;
cin >> n;
vector<string> s(n);
rep(i, n) cin >> s[i];
unordered_set<string> h(s.begin(), s.end());
for(string t : s) if(h.count('!' + t)){
... | //BISMILLAH
#include <bits/stdc++.h>
using namespace std;
#define read(x) freopen(x, "r", stdin);
#define write(x) freopen(x, "w", stdout);
#define ll long long
#define lli long long int
#define mod 1000000007
#define mx 1000005
// #define sazzad
int main()
{
#ifdef sazzad
read("input.txt");
// w... |
#include<iostream>
#include<vector>
using namespace std;
int main(){
string S;
string T="";
cin >> S;
for(int i=S.size()-1; i>=0; i--){
T += S[i];
}
for(int i=0;i<T.size();i++){
if(T[i]=='6'){
T[i] = '9';
}else if(T[i] == '9'){
T[i] = '6';
}
}
cout << T << en... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define fo(i,n) for(ll i=0;i<n;i++)
#define fo1(i,n) for(ll i=1;i<=n;i++)
#define loop(i,a,b)for(ll i=a;i<=b;i++)
#define loopr(i,a,b)for(ll i=b;i>=a;i--)
#define vll v... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define maxn 200010
int mod;
vector<int> getCycle(int val) {
vector<int> v;
int now = val % 10;
while (v.empty() or v.front() != now) {
v.push_back(now);
now *= val;
now %= 10;
}
return v... | //CODED BY SUMIT KUMAR PRAJAPATI
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pl;
#define PI 3.1415926535897932384626
#define pb push_back
#define mk make_pair
#define ff first
#define ss second
#define watch(x) ... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
//macros
#define fi first
#define se second
#define pb push_back
#define ReadInputFile() freopen("input.txt","r",stdin); freopen("output.txt","w",stdout);
#define FAST_IO() ios_base::sync_with_stdio(false);cin.tie(nullptr);
const int MAX = 1e9+1;
cons... | #include<bits/stdc++.h>
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define reprrev(i,a,b) for(int i=b-1;i>=a;i--) // [a, b)
#define reprev(i,n) reprrev(i,0,n)
using ll = long long;
using ull = unsigned long long;
template<class T> inline bool chmax(T& a, T b) { ... |
// Problem: F - Sugoroku2
// Contest: AtCoder - AtCoder Beginner Contest 189
// URL: https://atcoder.jp/contests/abc189/tasks/abc189_f
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
type... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define debug(x) {cerr<<#x<<" = "<<(x)<<endl;}
int main()
{
ios::sync_with_stdio(false);
ll b,c; cin>>b>>c;
if(c==0) {cout<<1; return 0;}
if(c==1) {cout<<2-(b==0); return 0;}
ll d=c/2, e=(c-1)/2;
if(abs(b)>c/2)
{
if(... |
#include <bits/stdc++.h>
using namespace std;
int n, d;
long long m;
char s[1005];
int debug() {
int res = 0;
bool gg = 0;
for (int base = d + 1; ; base++) {
long long num = 0LL;
for (int i = 0; i < n; i++) {
if (num > (m - (s[i] - '0')) / base) {
gg = 1;
... | #include <bits/stdc++.h>
using namespace std;
int main()
{
string x; cin>>x;
long long m; cin>>m;
vector<long long> x1,x2;
bool flag=true;
for (int i = 0; i < x.length(); i++) x1.push_back(x[i]-'0');
long long n=*max_element(x1.begin(),x1.end());
n++;
long long m1=m;
while (m1>0) {x... |
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(v) v.begin(),v.end()
typedef long long ll;
#include<bits/stdc++.h>
using namespace std;
int n;
double A[100010];
double f(double x) {
double res=0;
rep(i,n){
res+=x+A[i]-min(A[i],2.0*x);
}
return res;
}
int main(){
ios::sync_with_stdio(false);... | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
using int128 = __int128;
constexpr int DEBUG = 0;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int64 x, y, a, b;
cin >> x >> y >> a >> b;
int64 z = 0;
while (true) {
if (static_cast<int128>(x) * a >= x + b) break;
i... |
#include <iostream>
using namespace std;
int main(){
string s;
cin >> s;
if(s[0] == s[1] && s[1] == s[2]) cout << "Won\n";
else cout << "Lost\n";
} | #include <bits/stdc++.h>
#define debug(var) do{std::cout << #var << " :";std::cout << std::endl;view(var);}while(0)
template<typename T> void view(T e){ std::cout << e << std::endl;}
template<typename T> void view(const std::vector<T>& v){ int c = v.size(); std::cout << "{"; for(const auto& e : v){ std::cout << e; if... |
#include<bits/stdc++.h>
using namespace std;
int main(){
int h,w;
cin>>h>>w;
vector<string> field(h);
for(int i=0;i<h;i++) cin>>field[i];
vector<vector<int>> dp(h,vector<int>(w,2e9));
dp[h-1][w-1]=0;
for(int i=h-1;i>=0;i--){
for(int j=w-1;j>=0;j--){
if(0<=i-1){
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<pair<int,int>> vpi;
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0... |
#include <bits/stdc++.h>
using namespace std;
// ******************* SNIPPET TEMPLATE - STARTS***************
#define range(t) for (int i = 0; i < t; i++)
#define rep(i, t, q) for (int i = t; i < q; i++)
#define pb(t) push_back(t)
#define rangeG(i, t) for (i = 0; i < t; i++)
#define printVec(vec) \
for (auto... | #include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <set>
#include <stack>
#include <numeric>
#include <chrono>
#include <random>
#include <bitset>
#include <tuple>
#include <queue>
#include <map>
#include <unordered_map>
#include <cstring>
#include <cassert>
#include <climits>
#inclu... |
#include <bits/stdc++.h>
using namespace std ;
#define int long long
int32_t main(){
int n , m ;
cin >> n >> m ;
int a[n][m] ;
int mn = 101 ;
for(int i = 0 ; i < n ; i++){
for(int j = 0 ; j < m ; j++){
cin >> a[i][j] ;
mn = min(mn , a[i][j]) ;
}
}
int ans = 0 ;
for(int i = 0 ; i < n ; i++){
for(in... | // Created at 2020/12/19 21:01
// {TODO}WA, {TODO}min
#include <bits/stdc++.h>
//#include <atcoder/all>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define rep(i, n) for (lint i = 0, i##_len = n; i < i##_len; i++)
#define rep2(i, n) for (lint i = 1, i##_len = n; i <= i##_l... |
#include <bits/stdc++.h>
using namespace std;
// 型
#define ll int64_t // ll -> int64_t
using graph = vector<vector<int>>; // グラフ型
// for文
#define lp(i,n) for(int i=0;i<n;i++) // 変数 i をおいて n 回繰り返し
#define lp_(i,n) for(int i=0;i<=n;i++) // 条件に＝つき
#define lpp(i,n,m) for(int i=n;i<m;i++) // 開始と終... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
const ll M = 1e18;
int si[] = {-1, 0, 1, 0};
int sj[] = {0, -1, 0, 1};
int main(){
ll a,b;
cin >> a >> b;
cout << max(2*a+100-b,(ll)0) << endl;
return 0;
}
|
#include <bits/stdc++.h>
#include <iostream>
//#include <algorithm>
// #include <iomanip>
#define ll long long
#define map unordered_map
#define set unordered_set
#define l_l pair<ll, ll>
#define vll vector<ll>
#define mll map<ll, ll>
#define mp make_pair
using namespace std;
const ll MOD = 1000000007LL;
const ll IN... | #include <iostream>
#include <algorithm>
using namespace std;
const int inf = 3e5+10;
const int N = 3e5+10;
typedef long long ll;
struct node
{
int val,i;
bool operator<(node x)const {
return val<x.val;
}
}sn[inf];
ll tree[inf],b[inf],n;
void add(int i,ll x)
{
while(i<=n){
tree[i]+=x;
i+=i&-i;
}
}
ll query(int i)
{
... |
#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>
using namespace std;
typedef long long ll;
#define int ll
typedef pair<int, int> P;
ll gcd(ll a, ll b){return b? gcd(b, a % b): a;}
ll quickpow(ll a, ll b){ll res = 1; while(b){if (b & 1) res = res * a; a = a * a; b >>= 1;} return res;}
// head
const int N = 2e5 + 5;
int a[N], b[N], n, num, ans... |
#include <bits/stdc++.h>
#define FIXED_FLOAT(x) std::fixed <<std::setprecision(20) << (x)
#define all(v) (v).begin(), (v).end()
using namespace std;
#define forn(i,n) for (int i = 0; i < (n); ++i)
using ll = long long;
int mod = (ll)1e9 + 7;
#define PI acos(-1)
typedef pair<int, int> pairs;
const int ... | #include <bits/stdc++.h>
using namespace std;
using lli = long long int;
using ii = pair<int, int>;
const int MAXN = 500;
int r, c;
int a[MAXN+1][MAXN];
int b[MAXN][MAXN+1];
int cost[MAXN+1][MAXN+1];
int dijkstra() {
memset(cost, -1, sizeof(cost));
priority_queue<pair<int, ii>, vector<pair<int, ii>>, great... |
#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 (a > b) { a = b; return 1; } return ... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <ios>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=2e5+5;
const int mod=1e9+7;
int n,m;
int C[17][17];
char s[N];
int a[N];
int w[200];
inline int po(int x,int k){
int ret=1;
while(k){
if(k&1) ret=1ll*ret*x%mod;
x=1ll*x*x%mod;
k>>=1;
}
return ret;
}
inline int calc(int f,int c){
i... | #include <iostream>
#include <iomanip>
#include <fstream>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <algorithm>
#include <numeric>
#include <utility>
#include <random>
#include <chrono>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include... |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <utility>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <cstdio>
#include <limits>
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
using namespace std;
template<clas... | #include <cstdio>
#include <vector>
inline int min(int a,int b){return a<b?a:b;}
inline int max(int a,int b){return a>b?a:b;}
const int maxn = 8e5+5;
int n,q,c[maxn];
int head[maxn],tot;
struct Edge{
int next,to;
}e[maxn];
inline void add_edge(int x,int y){
e[++tot].next = head[x];
e[tot].to = y,head[x] = tot;
}
int... |
#include<bits/stdc++.h>
#define lli long long int
using namespace std;
bool sumpro(lli s, lli p)
{
if(s == p+1) return true;
else if(s == p || s>p) return false;
for(int i =1; i<int(sqrt(p)) + 1; i++)
{
if (p%i == 0)
{
if(p/i + i == s) return true;
}
}
retur... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> p_ll;
typedef vector<pair<ll, ll>> vec_p; //vector<pair<ll, ll>> pairs(n) ,pairs.at(i) = make_pair(i*i, i)
#define ture ture
#define flase false
#define falg flag
#define REP(i, x) for (ll i = 0; i < (ll)(x); i++)
#define RE... |
//#define _GLIBCXX_DEBUG
//#include "atcoder/all"
//using namespace atcoder;
#include <bits/stdc++.h>
#define int long long
#define ll long long
using ull = unsigned long long;
using namespace std;
#define Dump(x) \
if (dbg) { \
cerr << #x << " = " <<... | #pragma GCC optimize("Ofast")
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.