code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
//Problem link :
//done by sanath kumar
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define mod 1000000007
#define inf 1e9
#define endl "\n"
#define pb push_back
#define vi vector<ll>
#define vs vector<string>
#defin... | #include<stdio.h>
#include<string.h>
char ch[101000];
int main(){
scanf("%s",ch+1);
// scanf("%d%d%d",&a,&b,&c);
// printf("%d",21-a-b-c);
int len = strlen(ch+1);
for(int i = len;i>=1;i--){
if(ch[i]=='0'||ch[i]=='1'||ch[i]=='8'){
printf("%c",ch[i]);
}
else {
if(ch[i]=='6'){
printf("9");
}
else ... |
#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++)
#define repab(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define repr(i, n) for (ll i = (ll)(n); i >= 0; i--)
#define vsort(v) sort(v.begin(), v.end())
#define vsortr(v) sor... | #include <bits/stdc++.h>
using namespace std;
int main(){
int A,B,W;
cin >> A >> B >> W;
W*=1000;
int mi=1e9;
int ma=-1;
for(int i=1;i<=1e6;i++){
if(A*i>W){
break;
}else if(B*i<W){
continue;
}else{
mi=min(mi,i);
ma=max(ma,i);
}
}
if(ma==-1){
cout << "UNSATISF... |
/* -*- coding: utf-8 -*-
*
* f.cc: F - Graph Smoothing
*/
#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>
#inclu... | #pragma GCC optimize ("O2")
#pragma GCC target ("avx")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<iostream>
#include<cstring>
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(... |
#include <iostream>
#include <vector>
#include <map>
using namespace std;
class UnionFind {
public:
UnionFind(int size) : r(size), p(size) // 0 origin
{ for (int i = 0; i < size; i++) p[i] = i; }
int unite(int x, int y) {
x = find(x), y = find(y);
if (r[x] > r[y]) swap(x, y);
else... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pll> vpl;
double EPS = 1e-9;
int INF = 1000000005;
long long INFF = 100... |
//int a = s - '0'; 文字から数字
//小文字から大文字
//transform(a.begin(), a.end(), a.begin(), ::toupper);
//map 全探索
//auto begin = p.begin(), end = p.end();
//for (auto it = begin; it != end; it++) {}
//mapのキー：it->first mapのバリュー：it->second
//大文字判定 isupper(文字) 小文字判定 islower(文字)
//do{}while(next_permutation(ALL(配列)))
//小文字に対応する文字コード：S... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<double,double> ;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define rep2(i,s1,n) for (ll i=(s1);i<(ll)(n);i++)
#define rrep(i,a,b) for (ll i=(a);i>=(ll)(b);i--)
#define fastio ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define al... |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
#include <cstdint>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF=1001001001;
const... | #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 = int64_t;
ll score(string s){
vector<ll> cnt(10);
iota(cnt.begin(), cnt.end(), 0);
for(char c : s) cnt[c-'0'] *= 10;
return accumulate(cnt.begin(), cnt.end(), 0);
}
int main(){
ll k;
string s,t;
cin >> k >> s >> t;
vector<ll> cnt(10,k);
for(char c : s+t... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
using ll = long long;
const ll mod = 1000000007;
const double pi = 3.14159265358979;
const ll INF = 1e18;
int main() {
ll k; cin >> k;
ll cards = k * 9 - 8;
string s, t; cin ... |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef... | #include <bits/stdc++.h>
#define INF 1000000007
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define REP(i,a,b) for (int i = a; i < b; i++)
using namespace std;
typedef long long ll;
typedef long long int lli;
typedef long double ld;
typedef vector<int> vi;
typedef unordered_map<int,i... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll mod = 1000000007;
typedef unsigned int uint;
int main() {
ll R, C;
cin >> R >> C;
vector<vector<ll>> a(R, vector<ll>(C-1));
for (int i = 0; i < R; ++i) {
for (int j = 0; j < C - 1; ++j) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
int main() {
ll H,W; cin>>H>>W;
vector<string> field(H);
for(int i=0; i<H; ++i) cin>>field[i];
// マス目と縦横ナナメの三種類の移動について
vector<vector<vector<ll>>> dp(H,vector<vector<ll>>(W,vector<ll>(3,0)));
for(int i=0; i<H; ++i) {... |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ordered_set tree<ll, null_type , less<ll> , rb_tree_tag , tree_order_statistics_Node_update>
#define ll long long
#define ull unsigned long long
#define pb... | #include <bits/stdc++.h>
#define MAX_H 16
#define MAX_W 16
using namespace std;
typedef long long ll;
ll H, W, A, B;
bool used[MAX_H][MAX_W];
ll dfs(ll i, ll bit, ll a, ll b) {
if (i == H * W) return 1;
if (bit & 1 << i) return dfs(i + 1, bit, a, b);
ll res = 0;
if (b) res += dfs(i + 1, bit | 1 << i, a, b - 1... |
#include <bits/stdc++.h>
#include <unordered_map>
using namespace std;
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, t... | #include<iostream>
#include<cmath>
using namespace std;
#define ll long long
int main(){
ll n,ans,N=10000000000;
char s[200005];
cin>>n;
for(ll i=0;i<n;i++){
cin>>s[i];
}
char last='2';
ll num1=0,num0=0;
bool flag=0;
for(ll i=0;i<n;i++){
if(s[i]=='0'){
num0++;
if(num0>1){
flag=1;
break;
}
... |
#include<bits/stdc++.h>
#define int long long
using namespace std;
char s[500001];
int bb[30];
int vis,numm,ans;
char viss;
signed main()
{
scanf("%s",s+1);
viss='!';
int len=strlen(s+1);
for(int i=len;i>=3;i--)
{
if(s[i-1]==s[i-2]&&s[i]!=s[i-2])
{
if(s[i-1]!=viss)
{
ans+=(long long)(len-i+1-bb[s... | #include<bits/stdc++.h>
using namespace std;
#define FIO ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define mod 1000000007
#define endl "\n"
#define test ll txtc; cin>>txtc; while(txtc--)
typedef long long int ll;
typedef long double ld;
int main() {
FIO;
//test
{
string s; cin>>s;
... |
// #define _GLIBCXX_DEBUG // for STL debug (optional)
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex... | /*ver 7*/
#include <bits/stdc++.h>
using namespace std;
void init() {cin.tie(0);ios::sync_with_stdio(false);cout << fixed << setprecision(15);}
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vd = vector<ld>;
using vs = vector<string>;
using vb = vector<bool>;
using vvl = vector<vector<ll>>;
... |
#include <bits/stdc++.h>
// clang-format off
using namespace std;
class Rep{struct I{int i;void operator++(){++i;}int operator*(){return i;}bool operator!=(I o){return i<*o;}}b,e;
public:Rep(int l,int r):b{l},e{r}{}Rep(int n):Rep(0,n){}I begin(){return b;}I end(){return e;}};
class Per{struct I{int i;void operator++()... | #include <iostream>
#include <string>
#include <set>
#include <map>
using namespace std;
int main()
{
string s;
cin >> s;
int r = 0;
map<int, int> c;
int d[10] = {};
for (int i = 0; i < 10; i++)
{
if (s[i] == 'o')
{
c[i] = 1;
d[i] = 1;
r++;
}
else if (s[i] == '?')
... |
#ifdef MY_LOCAL
#define MY_NAMESPACE(ns) namespace ns {
#define MY_NAMESPACE_ }
#define MY_DEBUG(s) s
#define MY_IS_DEBUG (true)
#else
#define MY_NAMESPACE(ns)
#define MY_NAMESPACE_
#define MY_DEBUG(s)
#define MY_IS_DEBUG (false)
#endif
#include <algorithm>
#include <bitset>
#include <cmath>
#in... | #include <bits/stdc++.h>
// #include <atcoder/modint>
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define INF 2000000000000000000
#define ll long long
#define ld long double
#define pll pair<ll, ll>
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; }... |
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <tuple>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
double f(double w, double t, double c, double d) {
return t + w + c + (d / (t + w + 1.0));
}
int64_t get_wait(int64_t ... | #include <bits/stdc++.h>
#define rep(i, n) for(int i= 0; i < (n); i++)
using ll= long long int;
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
ll mod= 1e9 + 7;
... |
#include<bits/stdc++.h>
using namespace std;
#define f(i,a,b) for(int i=a; i<b; i++)
#define fr(i,a,b) for(int i=a; i>=b; i--)
#define fll(i,a,b) for(ll i=a; i<b; i++)
#define frll(i,a,b) for(ll i=a; i>=b; i--)
typedef vector<int> vi;
typedef long long int ll;
typedef vector<ll> vll;
#define fastio std::ios::sync_with_... | #include <bits/stdc++.h>
using namespace std;
#define io ios_base::sync_with_stdio(false); cin.tie(nullptr);
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b... |
// --------------------<optimizations>--------------------
#pragma GCC optimize("O3")
//(UNCOMMENT WHEN HAVING LOTS OF RECURSIONS)
#pragma comment(linker, "/stack:200000000")
//(UNCOMMENT WHEN TRYING TO BRUTEFORCE WITH A LOT OF LOOPS)
#pragma GCC optimize("unroll-loops")
// -------------------</optimizations>--------... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int inf=0x3f3f3f3f;
const ll INF=0x3f3f3f3f3f3f3f;
const double pi=3.1415926535897932384626;
inline ll read(){
ll x=0,f=1;
char ch=getchar();
while(ch<'0'||ch>'9'){
if(ch=='-') f=-1;
ch=getchar();
}
while(ch>='0'&&ch<='9'){
x=(x<<1)+(x<... |
#pragma GCC optimize ("O2")
#pragma GCC target ("avx")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<iostream>
#include<cstring>
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(... | /*@author : ashnove*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define lld long double
#define F first
#define S second
#define endl "\n"
#define nl cout<<endl;
#define pb push_back
#define f(i,a,b) for(ll i=a;i<b;i++)
#define what_is(x) cerr << #x << " is " << x << endl;
#define mat vecto... |
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, e... | #include <bits/stdc++.h>
using namespace std;
#define INF (int)1e9
#define eps (int)1e-9
#define ll long long
#define ld long double
#define FOR(i,m,n) for(int i=m; i<n; i++)
#define vt vector
#define pb push_back
#define all(c) (c).begin(), (c).end()
#define sz(x) (int)(x).size()
void solve(){
ld n; cin >> n;
... |
/**
* author: stein
* created: 2020.12.19 14:59:32
**/
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int N, W;
cin >> N >> W;
cout << N / W << '\n';
return 0;
}
| #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define indexed_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define ook order_of_key
#define fbo find_by_order
#define ll long long
ll md=998244353;
#de... |
#ifdef LOCAL
//#define _GLIBCXX_DEBUG
#endif
//#pragma GCC target("avx512f,avx512dq,avx512cd,avx512bw,avx512vl")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec... | #include<bits/stdc++.h>
using namespace std;
const int maxn=102;
vector<int> g[maxn];
bool vis[maxn];
int n;
string s[maxn];
int dfs(int s,int p)
{
int res=1;
if(vis[s])
return 0;
vis[s]=1;
for(auto it:g[s])
if(it!=p)
res+=dfs(it,s);
return res;
}
int main()
{
cin>>n;
for(int i=0... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mxN = 1+1000*100;
#define int long long
const int mod = 1e9+7;
signed main()
{
int n;
cin>>n;
string s;
cin>>s;
vector<char> v;
for(int i = 0 ;i<n;i++)
{
v.push_back(s[i]);
if(v.size()>=3)
{
int sz = v.size();
if(v[sz-1]=='... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> count(N+10);
int a;
for (int i = 0; i < N; i++) {
cin >> a;
count[a]++;
}
count[0] = min(count[0],K);
int sum = 0;
for (int i = 1; i < N+10; i++) {
if (count[i-1] <= count[i]) {
... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
int main(){
string s;
cin >> s;
deque<char> t;
string ans;
bool h = false;
rep(i, s.size()){
if (s[i] == 'R') h = !h;
else{
if (!h) t.push_back(s[i]);
else t.push... | // Author :: <Hitesh_Saini>
#include<bits/stdc++.h>
#define __speed() ios_base::sync_with_stdio(false), cin.tie(nullptr);
#define dbg(x) cout << "(" << __LINE__ << ": "<< #x << " = " << x << ")\n"
#define Yes(x) puts((x) ? "Yes" : "No")
#define tt int t; for (cin >> t; t--; )
#define f0(i, n) for (i =... |
#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <climits>
#include <string>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <ctime>
#include <cassert>
#include <fstream>
#include <stack>
#include <random>
#include <i... | /*
これを入れて実行
g++ code.cpp
./a.out
*/
#include <iostream>
#include <cstdio>
#include <stdio.h>
#include <vector>
#include <string>
#include <cstring>
#include <queue>
#include <deque>
#include <stack>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set... |
#include<iostream>
#include<unordered_set>
using namespace std;
int main(){
int N;
cin >> N;
string str;
string ss[N];
unordered_set<string> s;
for(int i=0; i<N; i++){
cin >> str;
s.insert(str);
ss[i] = str;
}
for(int i=0; i<N; i++){
string ch = "!" + s... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i=0;i<n;i++)
#define rep3(i,in,fn) for(int i=in;i<=fn;i++)
int main(){
int N,S,D;
cin >> N >> S >> D;
int X,Y;
rep(i,N){
cin >> X >> Y;
if(X<S && Y>D){
cout << "Yes" << endl;
return 0;
}
}
c... |
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<map>
#include<stack>
#include<queue>
#include<ctime>
#include<vector>
#include<set>
#include<cstdlib>
#include<utility>
using namespace std;
const int mod=1e9+7;
int a[100000+5];
int main()
{
int n,i,ans=1;
scanf(... | #include <bits/stdc++.h>
#define pb push_back
#define sz size()
#define all(c) (c).begin(), (c).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MOD = 1e9 + 7;
const int maxn = 2e5 + 7;
int cnt[200];
vector<int> g[200];
void solve(){
int n;
cin ... |
#include <bits/stdc++.h>
using namespace std;
int main(){
string X;
long long M;
cin >> X >> M;
int d = (*max_element(X.begin(), X.end())) - '0';
if(X.size() == 1){
if(atoi(X.c_str()) <= M)cout << "1\n";
else cout << "0\n";
return 0;
}
auto ok = [&](long long bas... | #pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
template<class S, class T> inline S max_L(S a,T b){
return a>=b?a:b;
}
inline int my_getchar_unlocked(){
static char buf[1048576];
static int s = 1048576;
static int e = 1048576;
if(s == e && e == 1048576){
e = fread_unlocked(buf,... |
#include <bits/stdc++.h>
using namespace std;
#ifdef __local_leywar
#include <debug/debugger.h>
#endif
#define int long long
#define endl '\n'
const int INF = 2e9,
MOD = 1e9+7,
INFLL = 1e18;
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
int cnt = 3;
cout << 6... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
using ll = long long;
const ll INF = 1LL << 30;
using pll = pair<string, ll>;
using Graph = vector<vector<int>>;
int main() {
int N;
cin >> N;
if(N == 3) {
cout << 6 << " " << 10 << " " << 15 << endl;
return 0;
}
... |
#include <bits/stdc++.h>
using namespace std;
#define int int64_t
#define MOD 998244353
#define inf 9e18
#define tikoo (int) (1e9 + 7)
#define amat(mat, n, m, val) mat.assign(n, vector<int>(m, val))
#define mmat(mat, n, m, val) vector<vector<int>> mat(n, vector<int>(m, val))
#define _mul(a, b) ((a % tikoo) * (b % tiko... | #include <bits/stdc++.h>
//#include <atcoder/all>
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define all(x) x.begin(), x.end()
using namespace std;
//using namespace atcoder;
... |
// Mere bas ka nahi hai
// still i'm trying
// apna time aayega
//
// .--------------.
// | Try First One|
// '--------------'
// | .--------------.
// | | |
// V V |
// .--------------. |
// ... | #include<bits/stdc++.h>
using namespace std;
#define int long long int
#define double long double
#define endl '\n'
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vi vector<int>
#define mii map<i... |
#include <bits/stdc++.h>
#define SZ(x) (int)(x).size()
#define ALL(x) (x).begin(),(x).end()
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
using namespace std;
typedef double DB;
typedef long double LD;
typedef long long LL;
typedef unsigned long long ULL;
typedef p... | #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(int i=0;(i)<(int)(n);i++)
#define REP(i,a,b)for(int i=(int)(a);(i)<=(int)(b);i++)
#define ALL(a) (a).begin(),(a).end()
#define pb push_back
#define fi first
#... |
#include <bits/stdc++.h>
using namespace std;
vector<vector<pair<int, int>>> graph; // {nxt, eid}
vector<pair<int, int>> elist; // edges, in orientation in input
vector<bool> marked, exited;
vector<bool> toDirectForward;
void direct(int eid, int i, int j) {
// printf("directing %d %d->%d\n", eid, i, j);
toDir... | #include <bits/stdc++.h>
//#include <chrono>
#pragma GCC optimize("Ofast")
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
using ll = long long;
using v... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef vector<vector<long long>> VVL;
typedef pair<int,int> P;
typedef tuple<int,int,int> tpl;
#define ALL(a) (a).begin(),(a).end()
#define SORT(c) sort((c).begin(),(c).e... | #include <bits/stdc++.h>
using namespace std;
using Pair = pair<int, int>;
using Queue = queue<int>;
using Graph = vector<vector<int>>;
int main()
{
int N, M;
cin >> N >> M;
int M2 = M + 1;
vector<Pair> XY(M2);
map<Pair, int> idx_map;
map<int, vector<int>> YX;
XY.at(0) = {0, N};
idx_map... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb emplace_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bo... | #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 <iostream>
#include <vector>
#include <string>
#include <unordered_map>
#include <bitset>
#include <map>
using namespace std;
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 ... | #include<bits/stdc++.h>
#define LL long long
#define DB double
#define pb push_back
#define mkp make_pair
#define LB lower_bound
#define UB upper_bound
#define rint register int
#define MS(x,y) memset(x,y,sizeof(x))
#define rep(i,a,b) for(rint i=a,i##end=b;i<=i##end;++i)
#define drep(i,a,b) for(rint i=a,i##end=b;i>=i##... |
#include "bits/stdc++.h"
using namespace std;
#define int long long
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define all(x) (x).begin(),(x).end()
#define uniq(v) (v).erase(unique(all... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#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, n, m) for(int (i)=(n); (i)<(m); ++i)
constexpr int INF = 1e9;
//constexpr ll INF = 1LL << 61;
constexpr int mod = 1e9+7;
struct Edge{
in... |
#define ll long long
#define lld double
#define M 202
#define f first
#define s second
#define pi 3.141592653589793238
#define vl vector<ll>
#define pll pair<ll,ll>
#define vpll vector<pll>
#define N 100002
#define Endl endl
#define maxx(a,b,c,d) max(max(a,b),max(d,c))
#define minn(a,b,c,d) min(min(a,b),min(d,c))
#defi... | #include <cstdio>
#include <cstring>
#include <string>
#include <iostream>
#include <algorithm>
#define M 100001
typedef long long ll;
typedef unsigned long long ull;
inline void read(ull &T) {
ull x = 0; bool f = 0; char c = getchar();
while (c < '0' || c > '9') { if (c == '-') f = !f; c = getchar(); }
while (c >=... |
/*
In the name of Allah, Most Gracious, Most Merciful
*/
#include<bits/stdc++.h>
#include<numeric>
using namespace std;
//*** constant value ***
const long double PI = 3.141592653589793238;
const double EPS = 1e-6 ;
//*** constant value ***
//****** define ********
#define IOS ios... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int a[4];
cin>>a[0]>>a[1]>>a[2]>>a[3];
cout<<*min_elemen... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
n += 99;
cout << n / 100 << endl;
return 0;
}
| #include<bits/stdc++.h>
typedef long long ll;
using namespace std;
bool f2;
char IO;
int rd(){
int num=0;bool f=0;
while(IO=getchar(),IO<48||IO>57)if(IO=='-')f=1;
do num=(num<<1)+(num<<3)+(IO^48);
while(IO=getchar(),IO>=48&&IO<=57);
return f?-num:num;
}
bool f1;
int main(){
// cout<<(&f1-&f2)/1024.0/1024.0<<endl;... |
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<iomanip>
using namespace std;
typedef long long ll;
//e_gcd()自体はaとbの最大公約数を返す。
//xとyは、a*x+b*y=gcd(a,b)となる(x,y)の1つの組を返す。
//a*x+b*y=gcdの時、a=b*p+(a%b)を代入して、b*p*x+(a%b)*x+b*y=b*(p*x+y)+(a%b)*x
//次のx->p*x+y
//次のy->x
//次のa->b
//次のb->a%b
ll... | /* -*- coding: utf-8 -*-
*
* a.cc: A - Fourtune Cookies
*/
#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>
#incl... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n);i++)
#define Graph vector<vector<int>>;
#define iterG(next_v, G, v) for(auto next_v : G[v]
#define ALL(... | #include <limits.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <unordered_set>
#include <map>
#include <cmath>
#include <iomanip>
#include <string>
#include <deque>
#include <assert.h>
#include <random>
#include <ctime>
#include <unordered_map>
#define pnode node*
typedef long ... |
/*
author: madhav_1999 aka orthodoxparadox
18 April 2021 at 5:31 PM
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define dbl long double
#define int ll
#defin... | #include <bits/stdc++.h>
using namespace std;
struct ios
{
inline char read()
{
static const int IN_LEN = 1e6 + 10;
static char buf[IN_LEN], *s, *t;
return (s == t) && (t = (s = buf) + fread(buf, 1, IN_LEN, stdin)), s == t ? -1 : *s++;
}
template <typename _Tp>
inline ios &o... |
#include <bits/stdc++.h>
using namespace std;
typedef long long Int;
typedef pair<int,int> PII;
typedef vector<int> VInt;
#define FOR(i, a, b) for(i = (a); i < (b); ++i)
#define RFOR(i, a, b) for(i = (a) - 1; i >= (b); --i)
#define EACH(it, a) for(auto it = (a).begin(); it != (a).end(); ++it)
#define CLEAR(a, b) mem... | // I've done my sentence but committed no crime
#pragma GCC optimize("Ofast")
#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
using namespace std;
#define int long long
#define pb push_back
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
#define mod (int)(1e9+7)
#define mod2 998244353
#d... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e17;
ll N, M;
vector<ll> W;
vector<pair<ll,ll>> A; //A[i] := first以下の耐荷重を持つものの最大の長さ
// #include"debug.hpp"
ll calc(ll weight) {
auto girigiri = upper_bound(A.begin(), A.end(), pair<ll,ll>{weight, -INF});
if(girigiri == A.beg... | #ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
#include<bits/stdc++.h>
using namespace std;
#define rep(i,s,t) for(ll i = (ll)(s); i < (ll)(t); i++)
#define rrep(i,s,t) for(ll i = (ll)(s-1);(ll)(t) <= i; i--)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> Pll;
typede... |
#include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
#define rep(i, n) for(int i=0;i<n;i++)
#define all(i, v) for(auto& i : v)
typedef long long ll;
using namespace std;
const ll mod=1000000007, INF=(1LL<<60);
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
int main() {... | #include<bits/stdc++.h>
#define ll long long
#define fr(i,k,n) for(ll i = k;i<n;i++)
using namespace std;
int main(){
ll t;
cin>>t;
while(t--){
ll n;
cin>>n;
string a,b,c;
cin>>a;
cin>>b;
cin>>c;
ll cs = a.size();
cs /= 2;
fr(i,0,cs)... |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
typedef long long ll;
const ll INFll = 1LL << 60;
int main(){
//input, initialize
int N, M; cin >> N >> M;
vector<vector<int>> A(N... | #include <bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define ll long long
#define vi std::vector<ll>
#define si set<ll>
#define pb push_back
vi v[2020];
bool visited[2020];
ll ans;
void dfs(ll s){
if(visited[s])return;
visited[s] = true;
ans++;
f... |
#include<cstdio>
#include<algorithm>
#define N 200007
using namespace std;
int n,sum,ans,ma,a[N],fa[N];
int find(int x){
if (fa[x]==x) return x;
fa[x]=find(fa[x]);
return fa[x];
}
int main(){
scanf("%d",&n);
for (int i=1;i<=n;i++){
scanf("%d",&a[i]);
sum++;
ma=max(ma,a[i]);
}
ans=n;
for (int i=1;i<=ma;i+... | #include <bits/stdc++.h>
#include <chrono>
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_... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(n);
long long mx = -1e9;
long long sm = 0;
long long pre = 0, pre_sum = 0;
for (int i = 0; i < n; ++i) {
cin >> a[i];
sm += a[i];
sm += pre;
pre += a[i];
mx = max(mx, a[i]);
cout << sm + mx * (i + 1) <... | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9+7;
template <typename Abel> struct BIT {
private:
int n;
vector<Abel> data;
public:
BIT (const int n_) : n(n_+1), data(n+1, 0) {}
void add(const int i, const Abel x) {
for(int k = i + 1 ; k < n; k += k & -k) data[... |
#include<bits/stdc++.h>
#define SZ(x) ((int)x.size())
#define pb push_back
template <typename _Tp>void read(_Tp &x){
char ch(getchar());bool f(false);while(!isdigit(ch))f|=ch==45,ch=getchar();
x=ch&15,ch=getchar();while(isdigit(ch))x=x*10+(ch&15),ch=getchar();
if(f)x=-x;
}
template <typename _Tp,typename... Args>voi... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll mod = 1000000007;
bool tooBig(__int128 x, __int128 y) {
return (2 * x - y) * (2 * x - y) > 5 * y * y;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(20);
ll x;
cin >> x... |
#include <iostream>
#include <string>
using namespace std;
int main(int argc, const char* argv[]){
string n;
cin >> n;
int n_s = n.length()-1;
while(n.at(n_s) == '0' && n_s != 0){
n_s = n_s-1;
}
int n_min=0;
int n_max=n_s;
bool r_f=true;
while(n_min < n_max) {
if... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define ff first
#define ss second
#define sc(x) scanf("%d",&x)
#define fra(v) for(auto &it:v)
#define fastIO ios_base::sync_with_stdio(false);cin.tie(NULL)
ll binaryExponentiation(ll x,ll n)
{
ll result=1;
while(n>0)
... |
#include <bits/stdc++.h>
using namespace std;
#define gap " "
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define ok cout<<"ok"<<endl
#define DBG(a) cerr<< "Line "<<__LINE__ <<" : "<< #a <<" = "<<(a)<<endl
#define fas... | #include <bits/stdc++.h>
using namespace std;
int solve(long long* available, int n, long long k) {
if (available[n - 1] < k) {
return -1;
}
int l = 0, r = n - 1;
while (l < r) {
int middle = l + (r - l) / 2;
if (available[middle] >= k) {
if (available[middle - 1... |
#include<bits/stdc++.h>
#define mxn 500005
#define ll long long
using namespace std;
char str[mxn], t[mxn];
int a[mxn], b[mxn];
int main()
{
int n;
scanf("%d %s %s", &n, str+1, t+1);
for(int i=1; i<=n; i++)
a[i]= str[i]-'0', b[i]= t[i]-'0';
ll res= 0;
int lst;
if(str[1]==t[1])lst= 2;
els... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repp(i, st, en) for (ll i = (ll)st; i < (ll)(en); i++)
#define repm(i, st, en) for (ll i = (ll)st; i >= (ll)(en); i--)
#define all(v) v.begin(), v.end()
void c... |
#include<bits/stdc++.h>
using namespace std;
int read();
#define LL long long
#define fr(i,l,r) for(int i = (l);i <= (r);++i)
#define rf(i,l,r) for(int i = (l);i >= (r);--i)
#define fo(i,l,r) for(int i = (l);i < (r);++i)
#define foredge(i,u,v) for(int i = fir[u],v;v = to[i],i;i = nxt[i])
#define ci const int &
#define... | /**
* Author : Tanbin_Hasan
* Created : 14.03.2021
**/
#include <bits/stdc++.h>
using namespace std ;
void subsets(vector<long long> &ar , int n , vector<long long> &d) {
for (int mask = 0 ; mask < (1LL << n) ; ++mask) {
vector<long long> temp ;
for (int i = 0 ; i < n ; ++i) {
if (mask & (1LL ... |
#include <iostream>
#include <string>
#include <cstring>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
const int maxn = 100;
double ret[maxn][maxn][maxn];
double dfs(vector<int>&coins){
if(coins[1]==0) return 100.0 - coins[0];
if(coins[0]==100 || coins[1] ==100 || coins[2]==100)... | #include <sstream>
#include <iostream>
#include <string>
#include <vector>
#include <numeric>
#include <algorithm>
#include <iomanip>
#include <map>
#include <set>
#include <list>
#include <cassert>
#include <cmath>
using namespace std;
int main()
{
auto& in = cin;
int a, b, c;
in >> a >> b >> c;
vector<vector<v... |
// #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>... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll b,c;cin>>b>>c;
if(c==1){cout<<(b==0?1:2)<<endl;return 0;}
else{
if(((c-1)/2-b) < (b-c/2) || b+(c-2)/2 < -b-(c-1)/2)cout<<((c-1)/2)*2+(c-2)/2+c/2+2<<endl;
else cout<<max(-b+(c-1)/2,b+(c-2)/2)-min(b-c/2,-b-(c-1)/2)+1<<endl;
... |
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
constexpr lint inf = 1LL << 60;
constexpr lint mod = 1000000007;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
lint n;
cin >> n;
vector<int> a(n), b(n);
map<int, int> cnt;
vector<pair<int, char>> pos... | #include<bits/stdc++.h>
#define register
#define N 201
#define INFs 0x3f3f3f3f
using namespace std;
int n,a[N],b[N],sum[N],tot;
inline void Add(int x){if(~x){++sum[x];++tot;if(sum[x]>1){puts("No");exit(0);}}}
int main(void){
int i,j,k,T=0;scanf("%d",&n);
for(i=1;i<=n;++i){
scanf("%d%d",a+i,b+i);
if((~a[i]&&~b[i]&... |
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include <cassert>
#include <numeric>
#include <unordered_map>
//#include <atcoder/all>
#include <queue>
#include <math.h>
#include <climits>
#include <set>
#include <map>
//using namespace atcoder;
typedef long long ll;
#define... | #include <bits/stdc++.h>
using namespace std;
struct ad {
int x;
int y;
int r;
ad(int _x = 0, int _y = 0, int _r = 0) : x(_x), y(_y), r(_r) {}
int left;
int up;
int right;
int down;
int& operator[](int i) {
if (i == 0) {
return left;
} else if (i == 1) ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(v) v.begin(), v.end()
//ll の最大値 2147483647≒10^9
//long longの最大値 9,223,372,036,854,775,807≒10^18
ll gcd(ll a, ll b){
if(a%b==0){
return b;
}
else{
return gcd(b,a%b)... | #include <algorithm>
#include <iostream>
#include <iomanip>
#include <cassert>
#include <cstring>
#include <string>
#include <vector>
#include <random>
#include <queue>
#include <cmath>
#include <unordered_map>
#include <set>
#include <map>
#define INCANT cin.tie(0), cout.tie(0), ios::sync_with_stdio(0), cout << fixed ... |
#pragma GCC optimize("Ofast")
#include <limits.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <unordered_set>
#include <map>
#include <cmath>
#include <iomanip>
#include <string>
#include <deque>
#include <assert.h>
#include <random>
#include <ctime>
#include <unordered_map>
#incl... | //##### ##### ##### ##### ##### # ##### # #//
//# # # # # # # # # # # ## ##//
//##### ##### ##### # ##### # ##### # # #//
//## # # # # # # # # # # #//
//# # # # # # # # # # # ... |
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
typedef long long int ll;
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c... | #include <bits/stdc++.h>
using namespace std;
bool comp(string& a, string& b) {
return int(a.length()) < int(b.length());
}
bool check(char** ans,string &s, int i, int j, int n,unordered_map<char,vector<int>>& ii) {
bool flg = true;
for(int a=0;a<int(s.length());a++) {
if (ans[(a+i)%n][j]!=s[a] && ans[(a+i)%n][... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)n;i++)
using ll = long long;
using P = pair<int, int>;
int main() {
ll a, b, c, d;
cin >> a >> b >> c >> d;
a = c - a, b = d - b;
if (a == 0 && b == 0) cout << 0 << endl;
else if (a + b == 0 || a - b == 0 || abs(a) + ... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, n) for(int i = 0; i < n; ++i)
#define GETVEC(v) for(auto& m : v) cin >> m;
using namespace std;
using LLONG ... |
#include <bits/stdc++.h>
#define rep(i, n) for (auto i = 0; i < n; ++i)
#define ALL(a) a.begin(), a.end()
using namespace std;
using ll = long long int;
const int MOD_NUM = 1e9 + 7;
struct Item {
int size;
int value;
};
bool compare_item_greater(const Item& l, const Item& r) {
return l.value == r.valu... | #include <bits/stdc++.h>
#include <map>
#include <iostream>
using namespace std;
typedef long long ll;
typedef long double ld;
#define BIG 200005
int N;
struct Data{
int ind;
int label; // ans
bool tree = false; // in tree?
vector<pair<int, int>> edges; // node, label
vector<pair<int, int>> tree_ed... |
#include <iostream>
using namespace std;
const int kMaxN = 20;
const int kMaxL = 73;
const int kP[kMaxN] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71};
int s[kMaxL], c;
long long f[kMaxL + 1][1 << kMaxN], a, b, ans;
long long C(int i, int j) {
if (f[i][j]) {
return f[i][j];
... | #include <bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define dbg(...) cerr << #__VA_ARGS__ << " ->", debug_out(__VA_ARGS__)
#define dbg_p(x) cerr<<#x": "<<(x).first<<' ... |
#include <bits/stdc++.h>
using namespace std;
void fastStd()
{
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
fastStd();
string s;
cin >> s;
int n = s.length();
vector<int> a... | #include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define deb(x) cout << #x << " = " << x << endl
#define deb2(x,y) cout << #x << " = " << x << ", " << #y << " = " << y << endl
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define PI 3.1415926535897932384626
typedef lon... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 5000 + 10;
const LL MOD = 998244353;
int n, m;
LL mpow(LL a, LL x) {
if (x == 0) return 1;
LL t = mpow(a, x>>1);
if (x % 2 == 0) return t * t % MOD;
return t * t % MOD * a % MOD;
}
LL f[N][N], pw[N][N];
int main() {
pw[0][0] = 1;
... |
#include <bits/stdc++.h>
using namespace std;
#define ios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl '\n'
#define debugg(x) cout<<#x<<'='<<x<<endl;
#define debug1(x,y,z) cout<<#x<<' '<<x<<' '<<#y<<' '<<y<<' '<<#z<<' '<<z<<endl;
#define debug cout<<endl<<"********"<<endl;
#define ll long long
#define u... | #include <bits/stdc++.h>
#define Rep(i,n,m) for(int i=(int)(n);i<(int)(m);i++)
#define rep(i,n) Rep(i,0,n)
#define all(v) v.begin(),v.end()
using namespace std;
using ll=long long;
using vi=vector<int>;
using vll=vector<ll>;
#define _GLIBCXX_DEBUG
vll g;
using pii=pair<int,ll>;
using graph=vector<vector<pii>>;
const ll... |
#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
#define DBG(a) cout<< "line "<<__LINE__ <<" : "<< #a <<" --> "<<(a)<<endl
#define eps 1e-8
#define eq(x,y) (fabs((x)-(y)) < eps)
using namespace std;
typedef long long ll;
typedef long... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int MOD = 1000000007;
template <class T>
struct fenwick_tree {
vector<T> x;
fenwick_tree(int n) : x(n, 0) {}
T sum(int i, int j) {
if (i == 0) {
T S = 0;
for (j; j >= 0; j = (j & (j + 1)) - 1) S += x[j];
return S;
} else
retur... |
/*
author: Maksim1744
created: 20.02.2021 15:01:36
*/
#include "bits/stdc++.h"
using namespace std;
#define ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define sum(a) ( accumulate ((a).begin(), (a).end(), 0ll))
#define mine(a) (*mi... | #include<bits/stdc++.h>
using namespace std;
int main(){
string S;cin>>S;
int l=S.size();
for(int i=0;i<l;i++){
if(i%2==0 && S[i]<='Z'){
cout<<"No"<<endl;
return 0;
}
else if(i%2==1 && S[i]>='a'){
cout<<"No"<<endl;
return 0;
}
}
cout<<"Yes"<<endl;
} |
//I'll always miss you like a darling.
#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define LD long double
#define ull unsigned long long
#define x first
#define y second
#define pb push_back
#define pf push_front
#define mp make_pair
#define Pair pair<int,int>
#define pLL pair<LL,LL>
#define pii... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for(ll i = 0; i < (ll)(n); ++i)
#define FOR(i, a, b) for(ll i=(a); i < (ll)(b); ++i)
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=... |
#pragma GCC optimize("Ofast")
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
#include <algorithm>
#include <cstdlib>
#include <cmath>
#include <iomanip>
#include <cctype>
#include <sstream>
#include <stack>
#include <deque>
#include <queue>
#include <list>
#include <set>
#include <map>
#incl... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ar array
#define sz(v) (int)(v).size()
#define fi first
#define se second
#define pb push_back
#define rep(i,a,b) for(int i = (a) ; i<(b) ; ++i)
const int mxN = 2e5;
const ll MOD = 998244353;
map<char,int> mp;
int n;
vector<ll> c[3];
ll fin... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define int ll
const int N = 50 + 7;
int n;
int y;
int a[N];
int b[N];
int valuey[N];
int dp[N][2];
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n >> y;
for (int i = 1; i <= n; i++) {
cin >> a[i];... | #include <bits/stdc++.h>
using namespace std;
typedef long long lli;
int MOD = 998244353;
inline int add(const int a, const int b, const int mod = MOD) { return (a + b >= mod) ? (a + b - mod) : (a + b); }
inline void _add(int &a, const int b, const int mod = MOD) { a = add(a, b, mod); }
inline int sub(const int a, con... |
// author : redwackyferret
#include<bits/stdc++.h>
#define pb push_back
#define pdd pair<ld, ld>
#define int long long
#define ff first
#define pii pair<int,int>
#define ss second
#define pp make_pair
#define endl "\n"
#define ll long long
#define ld long double
#define REP(i,n) for((i)=0;(i)<(int)(n);(i)++)
#define PI... | #include <bits/stdc++.h>
#ifndef M_PI
#define M_PI 3.14159265358979
#endif
#define deg_to_rad(deg) (((deg) / 360) * 2 * M_PI)
#define rad_to_deg(rad) (((rad) / 2 / M_PI) * 360)
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<int> vi;
typedef pair<ll, ll> pll;
typedef pair<int, int> ... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
class union_find{
int n;
vector<int> p;
vector<map<int,int>> f; // color -> number of vertices
public:
union_find(int n,vector<int> color):n(n),p(n,-1),f(n){
rep(u,n) f[u][color[u]]=1;
}
int find(int u){ return p[u]<0?u:p[u... | #include <stdio.h>
#include <set>
#include <vector>
#include <utility>
#define mp make_pair
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pl;
int main(void) {
ll i, j, k, n, m, a, b, c, ans;
scanf("%lld%lld", &n, &m);
vector<pl> vec[n];
for(i = 0; i < m; ++i) {
scanf("%lld%lld%lld", &a, &... |
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define rep(i, n) for(long long i = 0; i < n; i++)
#define rep1(i, n) for(long long i = 1; i <= n; i++)
#define rrep(i, n) for(long long i = n; i > 0; i—)
#defin... | #include<bits/stdc++.h>
using namespace std;
int n,a[200005],b[200005];
long long ans;
int main(){
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%d",&a[i]);
b[a[i]]=a[i];
}
for(int i=1;i<=n;i++){
int j=n-i+1;
while(b[b[a[i]]]!=b[a[i]]){
b[a[i]]=b[b[a[i]]];
}
while(b[b[a[j]]]!=b[a[j]]){
b[a[j]]=b[b... |
/**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author Kein Yukiyoshi
*/
#include "bits/stdc++.h"
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define FOR(i, a) for (auto &i : a)
#... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<vector<int>> Graph;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
#define pi 3.14159265359
#define inf 2147483647
#define INF 9223372036854775807
#define mod 1000000007
#define mod2 998244353
... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pi 2*acos(0.0)
#define mod 1000000007
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);
#define pii pair<ll,ll>
#define pb push_back
#define Bit_off(val,pos) (val & (~(1<<pos)))
#define Bit_on(val,pos) (val | (... | #include<map>
#include<ctime>
#include<cstdio>
#include<cctype>
#include<string>
#define ll long long
const ll N=1e3+10;
const ll HgS=1e9+7;
using namespace std;
ll read() {
char c;
ll x=0,f=1;
while(!isdigit(c=getchar()))
f-=2*(c=='-');
while (isdigit(c)){
x=x*10+(c-48)*f;
c=getchar();
}
return x;
}
ll n,f... |
#include<bits/stdc++.h>
using namespace std;
#define nl '\n'
typedef long long ll;
#define f(i,start,end) for(i=start;i<=end;i++)
#define pii pair<int,int>
#define pll pair<ll,ll>
#define piii pair<pii,int>
#define F first
#define S second
#define min_heap priority_queue<ll, vector<ll>, greater<ll> >
#define max_heap p... | #include<bits/stdc++.h>
typedef long long ll;
using namespace std;
int main()
{
string str;
cin >> str;
int num=0;
int index=0;
string sub="ZONe";
while( (index=str.find(sub,index)) < str.length() ){
num++;
index++;
}
cout << num << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl
using ll = long long;
const ll mod = 1e9 + 7;
void add(ll &x, ll y) {
x %= mod;
y %= mod;
x += y;
x %= mod;
}
ll pw(ll x, ll y)... | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stri... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
long N,K;
cin >> N >> K;
rep(i,K){
if(N%200 ==0){
N /=200;
}
else{
N = N*1000+200;
}
}
cout << N << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define w(t) int t;cin>>t;while(t--)
#define int long long
#define fr(i,a,b) for(int i=a;i<=b;i++)
#define rep(i,a,b) for(int i=a;i<b;i++)
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define all(x) x.begin(),x.end()
#define f... |
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <iostream>
using namespace std;
typedef long long ll;
ll mod = 998244353,dp[5010][5010] = {},pw[10020],cnt[10010] = {};
char c[5010][5010];
int main(){
int i,j,h,w,k; cin >> h >> w >> k;
for(i=0;i<h;i++){
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> P;
typedef vector<ll> VI;
typedef vector<VI> VVI;
#define REP(i,n) for(int i=0;i<(n);i++)
#define ALL(v) v.begin(),v.end()
constexpr ll MOD=998244353;
constexpr ll INF=1e18;
ll power(ll x, ll y){
x%=MOD;
ll ret=1;
w... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
string s;
int n,k;
int C[18][19];
const int mod=1e9+7;
int cnt[190];
int ans=0;
char base[16]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F'};
const int N=2e5+5;
int dp[N][18][18];
int poww(int a,int b,int c){
int ans=1,base=a;... | # include <stdio.h>
# include <string.h>
using namespace std;
const int mod = 1000000007;
const int kMaxN = 200200;
int k, n;
char s[kMaxN];
long long a[kMaxN];
long long dp[kMaxN][20];
int Cnt(int x) {
int cnt = 0;
while (x) {
cnt += x & 1;
x >>= 1;
}
return cnt;
}
int main() {
scanf("%s%d", s, &... |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
ll mod=998244353;
int main(){
int H,W;
cin>>H>>W;
vector<string> S(H);
for(int i=0;i<H;i++) cin>>S[i];
vector<int> r(H+W,0),b(H+W,0),w(H+W,0);
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
if(S[i][j]=='R') r[i+j... | #include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
#include <set>
#include <map>
#include <array>
#include <random>
#include <cmath>
#include <list>
#include <ctime>
#include <sstream>
#include <queue>
#include <climits>
#include <stack>
#include <random>
#include <bitset>
#... |
// #include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <cmath>
#include <iomanip>
#include <numeric>
#define ll long long int
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define drep(i, n) for(ll i = ((ll)(n)... | #include<iostream>
using namespace std;
int main() {
int N;
cin >> N;
int A = 1, B = 1, C = 1;
for(int i = 0; i < N - 3; i++) {
if(A <= 1600) A++;
else if (B <= 600) B++;
else C++;
}
for (int i = 1; i <= A; i++) {
if (i > 1) cout << " ";
cout << 6 * i;
}
int x = 10;
for (... |
#include<bits/stdc++.h>
#define ll long long int
#define M 1000000007
#define mod 998244353
#define mp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define pi pair<ll,ll>
#define endl "\n"
using namespace std;
const ll N=200010;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL)... | #include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define rep(i,cc,n) for(int i=cc... |
#include <iostream>
using namespace std;
using ll = long long;
int MOD = 1e9 + 7;
ll my_pow(ll x, ll n) {
if (n == 0) {
return 1;
}
else if (n % 2 == 0) {
return my_pow(x * x % MOD, n >> 1);
} else {
return x * my_pow(x, n - 1) % MOD;
}
}
int main(void){
int N, P;
cin >> N >> P;
ll ans... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<char> vc;
typedef queue<ll> ql;
typedef deque<ll> dql;
typedef priority_queue<ll> pql;
typedef set<ll> sl;
typedef pair<ll, ll> pl;
ty... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long int;
using ld = long double;
#define pow(n,m) powl(n,m)
#define sqrt(n) sqrtl(n)
const ll MAX = 5000000000000000000;
const ll MOD = 1000000007;
//998244353;
void randinit(){srand((unsigned)time(NULL));}
int main(){
ll N;
cin >> N;
string S,T;... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
typedef long long ll;
typedef pair<int,int> ii;
string s;
map<char,int> cnt;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> s;
ll ans = 0;
for (int i = s.length()-1; i >= 1; i--) {
if... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i=a; i<=b; i++)
#define repd(i, a, b) for(int i=a; i>=b; i--)
#define vi vector<int>
#define vll vector<long long>
#define pii pair<int,int>
#define pll pair<long long,long long>
#define pb push_back
#define fr first
#define sc second
#define vb... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,avx,avx2,fma,tune=native")
#define ll long long
#define int ll
#define ull unsigned ll
#define ld long double
#define rep(a) rep1(i,a)
#define rep1(i,a) rep2(i,0,a)
#define rep2(i,b,a) ... |
#include <cstdio>
#define rep( i, a, b ) for( int (i) = (a) ; (i) <= (b) ; ++ (i) )
#define per( i, a, b ) for( int (i) = (a) ; (i) >= (b) ; -- (i) )
const int mod = 1e9 + 7;
const int MAXN = 2e3 + 5;
template<typename _T>
void read( _T &x )
{
x = 0; char s = getchar(); int f = 1;
while( s < '0' || '9' < s ) { f =... | #include<bits/stdc++.h>
#define it register int
#define ct const int
#define il inline
using namespace std;
const int N=1000005;
int p[N],cn,mn[N],n;
bool isp[N];
il int Min(ct p,ct q){return p<q?p:q;}
il void Pre(){
it i,j,x;mn[1]=1;
for(i=2;i<=n;++i){
if(!isp[i]) p[++cn]=i,mn[i]=i;
for(j=1;(x=p[j]*i)<=n;++j){
... |
#include <iostream>
#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 ONLINE_JUDGE
#ifndef ONLINE_JUDGE
template<typename T>
void __p(T a) {
cout << a;
}
template<typename T, typename F>
void __p(pair<T, F> ... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <array>
#include <climits>
using namespace ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
#define ALL(x) (x).begin(),(x).end()
const ll zero = 0;
const ll one = 1;
const ll INF = 9223372036854775807; //10^18
const int inINF = 2147483647; //10^9
const ll MO... | #include<bits/stdc++.h>
#define M_PI 3.14159265358979323846
#define Speed_UP ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define pb push_back
#define ff first
#define ss second
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#warning Remember to change t
inline ... |
#include<iostream>
#include<string.h>
#include<stdio.h>
#include<math.h>
#include<queue>
#include<algorithm>
#include<map>
using namespace std;
typedef long long ll;
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fd(i,a,b) for(int i=b;i>=a;i--)
const ll INF=0x3f3f3f3f3f3f3f3f,mod=1e9+7;
const int inf=0x3f3f3f3f,maxn=1... | #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 <bits/stdc++.h>
typedef long long ll;
const ll max_N = 100;
const ll max_M = 1000000;
ll n, K, mod, dp[max_N + 5][max_M + 5], G[max_M + 5];
ll read() {
char c = getchar(); ll ans = 0;
while (c < '0' || c > '9') c = getchar();
while (c >= '0' && c <= '9') ans = ans * 10 + c - '0', c = getchar();
return ans;... | #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;
int main () {
string S;
cin >> S;
int n = (int)S.size();
int fl = n - 1;
while (fl >= 0 && S[fl] == '0') fl --;
for (int i = 0; i <= fl; i ++) {
int j = fl - i;
if (S[i] != S[j]) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << ... | #include<bits/stdc++.h>
using namespace std;
int n , f , las = -1e9;
string s;
int main()
{
cin >> n >> s;
if(s[0] != s[n - 1])
{
printf("1");
return 0;
}
for(int i = 0 ; i < n ; i++ )
{
if(s[i] != s[0])
{
f |= (las == (i - 1));
las = i;
}
}
if(f) printf("2");
else printf("-1");
return 0;
}... |
//
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n'
const int maxn = 3050;
const int maxm = maxn*maxn*4;
int head[maxm],vis[maxm];
char G[maxn][maxn];
int dis[maxm];
struct Edge{
int f,t,w,next;
Edge(int f = 0,int t = 0,int w = 0,int next = 0):f(f),t(t),w(w),next(next){}
}edge[max... | /**
* Author: dhruv_gheewala
* Problem: __________
* Date: 13.12.2020
* Time: 17:51:47
**/
#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 <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int n; cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<int>::iterator iter = max_element(a.begin(), a.end());
int amax = *iter ;
long long c = 0, ans = 0, psum = 0;
for (int i = 0; i <... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod = pow(10,9)+7;
int main(){
ll n;
cin >> n;
vector<ll> A(n);
for(ll i=0; i<n; i++) cin >> A[i];
sort(A.begin(),A.end());
ll ans = A[0]+1;
for(ll i=1; i<n; i++){
ans*= (A[i]-A[i-1])+1;
ans %= mod;
}
cout << ans << ... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define db double
#define pii pair<int,int>
#define pli pair<ll,int>
#define pil pair<int,ll>
#define pll pair<ll,ll>
#define ti3 tuple<int,int,int>
#define mat vector<vector<int>>
const int inf = 1 << 30;
const ll linf = 1... | #pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
template<class S, class T> inline S max_L(S a,T b){
return a>=b?a:b;
}
inline int my_getchar_unlocked(){
static char buf[1048576];
static int s = 1048576;
static int e = 1048576;
if(s == e && e == 1048576){
e = fread_unlocked(buf,... |
#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<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (long long i = 0; i < (n); ++i)
#define DIV 1000000007 //10^9+7
#define INF LONG_MAX/3
#define bit(n) (1LL<<(n))
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(... |
#include <bits/stdc++.h>
long long func(std::vector<std::pair<long long, long long>> &vw, std::vector<long long> &boxsize, int l, int r) {
std::vector<long long> box;
for (int i = 0; i < (int)boxsize.size(); ++i) {
if (i < l || i > r) box.push_back(boxsize[i]);
}
std::vector<bool> used(box.size(), false);... | #include <bits/stdc++.h>
#include <cassert>
typedef long long int ll;
using namespace std;
// #include <atcoder/all>
// using namespace atcoder;
// @@ !! LIM()
int main(/* int argc, char *argv[] */) {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout << setprecision(20);
ll N, M; cin >> N >> M;
usin... |
#include<iostream>
using namespace std;
int main()
{
int a,b,c,d;
cin>>a>>b>>c>>d;
int result = b-c;
cout<<result <<endl;
return 0;
}
| typedef long long ll;
typedef long double ld;
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<ll> a(2);
for (int i = 0; i < 2; i++) {
std::cin >> a[i];
}
sort(a.begin(),a.end());
if(a[0]+3>a[1]){
std::cout << "Yes" << std::endl;
}else{
std::cout <<... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.