code_file1 stringlengths 87 4k | code_file2 stringlengths 85 4k |
|---|---|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 10;
const int N = 1e5 + 10;
const ll mod = 1e9 + 7;
int k;
ll res;
int main() {
#ifndef ONLINE_JUDGE
freopen("1.txt", "r", stdin);
#endif
scanf("%d", &k);
for (ll i = 1; i <= k; ++i) {
for (ll j = 1; i * j <... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
void run(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
const int N=2e5+5;
int dp[19][3][19],n;
bool vis[19][3][19];
string s;
int sol(int i,int sum,int erased){
sum%=3;
if(i==n){
return !(sum==0&&erased!=n)*1e9;
}
... |
#include <bits/stdc++.h>
using namespace std;
struct node{
long long val = 0;
node *lc = nullptr, *rc = nullptr;
node() {}
node(long long val): val(val) {}
node(node *lc, node *rc): lc(lc), rc(rc) {
val += lc->val;
val += rc->val;
}
};
typedef node * pnode;
const int maxn = 3e5+4;
int n, a[2*maxn];
pnode r... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
ll read() {
ll x=0, f=1; char ch=' ';
while(!isdigit(ch)) {ch=getchar(); if(ch=='-') f=-1;}
while(isdigit(ch)) x=(x<<3)+(x<<1)+(ch^48), ch=getchar();
return x*f;
}
int n, a[300005];
ll c[500005], ans;
void jia(int i,ll x){
while(i<=n){
c[i]+=x;
... |
#include<cstdio>//JZM YYDS!!!
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#define ll long long
#define MAXN 200005
#define uns unsigned
#define MOD 998244353ll
#define INF 0x7f7f7f7f
using namespace std;
inline ll read(){
ll x=... | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long
#define pb(a)... |
#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 <bits/stdc++.h>
using namespace std;
int n, m;
vector<long long> a;
int solve();
int main() {
cin >> n >> m;
a.resize(m);
for (int i = 0; i < m; ++i) cin >> a[i];
cout << solve() << endl;
return 0;
}
int solve() {
long long res = 0, len = 3e9;
a.push_back(0);
a.push_back(n + 1);
sort(a.be... |
#include <bits/stdc++.h>
using namespace std;
/***********************************MACROS***********************************/
#define ll long long
#define pll pair<ll,ll>
#define vll vector<ll>
#define vii vector<int>
#define mll map<ll, ll>
#define all(v) v.begin(), v.end()
#define ce(ele) cout<<ele<<' '
#defi... | #include<bits/stdc++.h>
using namespace std;
int n,k,tot;
priority_queue<int, vector<int>, greater<int> > g2;
priority_queue<int ,vector<int>,less<int> >g1;
int G1(int x)
{
int num=0,NUM=1;
int X;
while(x/10!=0)
{
X=x%10;
g1.push(X);
x=x/10;
if(x<10&&x>0) g1.push(x);
}
while(!g1.empty())
{
num+=g1.to... |
#include <bits/stdc++.h>
#include <chrono>
#include <math.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace std::chrono;
using namespace __gnu_pbds;
using ll = long long;
using ld = long double;
#define fo(i,z,n) for(int i = z;i<n;i++)
#define r... | #include <bits/stdc++.h>
using namespace std;
const int N = 10000;
int n;
bool mem[N][N];
class ad {
public:
int a, b, c, d, r, id;
ad() {}
void read() {
scanf("%d%d%d", &a, &b, &r);
mem[a][b] = true;
c = a + 1, d = b + 1;
}
void print() { printf("%d %d %d %d\n", a, b, c, ... |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#ifdef ENABLE_DEBUG
#define dump(a) cerr<<#a<<"="<<(a)<<endl
#define dumparr(a,n) cerr<<#a<<"["<<(n)<<"]="<<(a[n])<<endl
#else
#define dump(a)
#define dumparr(a,n)
#e... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <complex>
#include <iostream>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#include <queue>
#define INF 1010101010LL
#define INFLL 101... |
#include<bits/stdc++.h>
using namespace std;
template<typename T>inline T read(){
T f=0,x=0;char c=getchar();
while(!isdigit(c)) f=c=='-',c=getchar();
while(isdigit(c)) x=x*10+c-48,c=getchar();
return f?-x:x;
}
namespace run{
int n,m;
int main(){
n=read<int>(),m=read<int>();
if(n==1){
if(m!=0) puts("-1"),e... | /*
* Author : YangDavid
* Created Time : 2020.10.24 20:11:31
*/
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 1; i <= n; ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int B = 10000000;
int main() {
int n, m;
scanf("%d%d", &n, &m);
if(n == 1) {
if(m == 0) {
... |
#include <bits/stdc++.h>
#define endl '\n'
#define ALL(V) V.begin(), V.end()
#define L_B lower_bound
#define U_B upper_bound
#define pb push_back
#define ll long long
#define fr first
#define sc second
#define rep(i,n) for (i = 0; i < n; ++i)
#define REP(i,k,n) for (i = k; i <= n; ++i)
#define REPR(i,k,n) for (i = k;... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define forin(in ,n) for(ll i=0; i<n; i++) cin>>in[i]
#define forout(out) for(ll i=0; i<(ll)out.size(); i++) cout<<out[i]<<endl
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rep_up(i, a, n) for (ll i = a; i < n; ++i)
#define rep_down(i, a, n) fo... |
#include<iostream>
#include<vector>
#include<math.h>
using namespace std;
int main()
{
int n;
cin>>n;
vector<int> a(n);
vector<int> b(n);
for(int i=0;i<n;i++)
{
cin>>a[i];
cin>>b[i];
}
int result=100000000;
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++)
{
result=min(result, i==j ?... | #include<bits/stdc++.h>
using namespace std;
#define int int64_t
signed main(){
int n;cin>>n;
vector<string> s(n);
for(int i=0;i<n;++i)cin>>s[i];
vector<vector<int>>dp(n, vector<int>(2,0));
//base case ==> dp[0][0] && dp[0][1]
if(s[0]=="AND"){
dp[0][0]= 3;
dp[0][1]= 1;
}else{
dp[0][0]= 1;
... |
#include<bits/stdc++.h>
#define For(i,j,k) for (int i=(int)(j);i<=(int)(k);i++)
#define Rep(i,j,k) for (int i=(int)(j);i>=(int)(k);i--)
#define pii pair<int,int>
#define fi first
#define se second
#define PB push_back
#define ll long long
#define ull unsigned long long
#define y1 orzkcz
using namespace std;
const int ... | //#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
#define rep2(x,fr,to) for(int x=(fr);x<(to);x++)
#define rep(x,to) for(int x=0;x<(to);x++)
#define repr(x,fr,to) for(int x=(fr);x>=(to);x--)
#define all(c) c.begin(),c.end()
#define sz(v) (int)v.size()
typedef long long ll; typedef vector<int> V... |
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define all(x) begin(x),end(x)
#define F(i,n) for (int i = 0; i < n; ++i)
#define F1(i,n) for (int i = 1; i <= n; ++i)
#define dbg(x) cerr << #x << " = " << x << endl
#define dbgg(x) cerr << #x << " = " << x << ' '
#de... | #include<bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
int mod=1000000007;
int N;cin>>N;
vector<vector<int>>V(N,vector<int>(2));//0は正、1は負
vector<int>J(N);J[0]=1;J[1]=1;
for(int X=2;X<N;X++){
J[X]=J[X-1]+J[X-2];J[X]%=mod;
}
for(int X=0;X<N;X++){
int A;cin>>A;
if(X==0)... |
#define _USE_MATH_DEFIMES
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <ioman... | #include <iostream>
#include <cstdint>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unorder... |
#include<algorithm>
#include<iostream>
#include<cstring>
#include<bitset>
#include<cstdio>
#include<string>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
#include<set>
using namespace std;
#define neinf 0xc0c0c0c0c0c0c0c0ll
#define inf 0x3f3f3f3f3f3f3f3fll
#define uint unsigned int
#define ull unsigned ... | #include <bits/stdc++.h>
using namespace std;
#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 FORR(i,m,n) for(int i = m - 1; i >= n; i--)
#define ALL(v) v.begin(), v.end()
#define itn int
#define Yes() cout << "Yes" ... |
#include <algorithm>
#include <bits/stdc++.h>
#include <stdio.h>
#include <string.h>
using namespace std;
#define _CRT_SECURE_NO_WARNINGS
#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 re_rep(i, n) for (int i = (n); i >= 1;)
#define wrep(a) while... | #ifdef LOGX
#define _GLIBCXX_DEBUG
#endif
#include <bits/extc++.h>
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
/*---------macro---------*/
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = s; i < (int)(n); i++)
#define ALL(a) a.begin(),a.end()
#define ... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
ll maxx(ll a, ll b){
if(a>b){
return a;
}
else{
return b;
}
}
ll minn(ll a, ll b){
if(a<b){
return a;
}
else{
return b;
}
}
int main()
{
ll n;
cin>>n;
ll N = pow(2, n);... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define f(i,a,b) for( ll i = a; i < b ; i++ )
#define af(i,a,b) for( ll i = a; i >= b ; i--)
#define rep(i,a,b,k) for(ll i = a; i < b ; i+= k )
#define arep(i,a,b,k) fo... |
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <math.h>
#include <cassert>
#define rep(i,n) for(int i = 0; i < n; ++i )
using namespace std;
using ll = long long;
// auto mod int
const int mod = 1000000007;
struct min... | // g++ -std=c++11 a.cpp
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<unordered_map>
#include<utility>
#include<cmath>
#include<random>
#include<cstring>
#include<queue>
#include<stack>
#include<bitset>
#include<cstdio>
#include<sstream>
#include<random>
#... |
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define isYES(x) printf("%s\n",(x) ? "YES" : "NO")
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define isYes(x) printf("%s\n",(x) ? "Yes" : "No")
#define isIn(x,y,h,... | #include <bits/stdc++.h>
using namespace std;
typedef long long lli;
const int N = 200000 + 10;
const int Q = 200000 + 10;
struct Item{
lli val;
int id;
};
lli ans[Q];
int a[N], t[N];
Item x[Q];
bool cmp(const Item& u, const Item& v){
return u.val < v.val;
}
int main(){
lli add, v;
int n, q, left, right;
... |
#include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
int main(void){
int n; string s1, s2 = "";
cin >> n >> s1;
if (n < 3){cout << n << endl; return 0;}
s2 = s1.substr(n - 2, 2);
s1 = s1.substr(0, n - 2);
reverse(all(s2));
auto size = [&]()->int{return s1.lengt... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_multiset tree<long long , null_type,less_equal<long long >, rb_tree_tag,tree_order_statistics_node_update>
#define ordered_set tree<long long , null_type,less<long long >, rb... |
#include <bits/stdc++.h>
#define REP(i, nn ) for(int i = 0 ; i < (int) nn; i++)
#define REPS(i, ss, nn ) for(int i = ss ; i < (int) nn; i++)
#define REV(i, ss, nn ) for(int i = ss ; i >= nn; i--)
#define deb(x) std::cout << #x << " " << x << endl;
#define debl(x) std::cout << #x << " " << x << " ";
using namespace std;... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios::sync_with_stdio(false); cin.tie(0);
//f
long long x, y;
cin >> x >> y;
map<long long, long long> memo;
auto rec = [&] (auto&& self, long long cur) -> long long {
if (memo.count(cur)) return memo[cur];
if (c... |
#include <bits/stdc++.h>
using namespace std;
#define INF 1<<30
#define endl '\n'
#define maxn 1000005
#define FASTIO ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
typedef long long ll;
const double PI = acos(-1.0);
const ll mod = 1e9 + 7;
inline void normal(ll &a) { a %= mod; (a < 0) && (a += mod); }
inl... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
#define ls(x) (x << 1)
#define rs(x) (x << 1 | 1)
#define lowbit(x) (x & -x)
const ll INF=0x3f3f3f3f;
const ll LL_INF=0x3f3f3f3f3f3f3f3f;
const double EPS=1e-7;
ll mod=1e9+7;
const ll MOD=99824435... |
/* Great things never come from comfort zones,
"whatever the mind of a man can conceive and believe,it can achieve." */
#include <bits/stdc++.h>
using namespace std;
void my_dbg() { cout << endl; }
template<typename Arg, typename... Args> void my_dbg(Arg A, Args... B)
{ cout << ' ' ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define veci vector<int>
#define vecll vector<ll>
#define ii pair<ll, ll>
#define iii pair<ii, ll>
#define fi first
#define se second
#define endl '\n'
#define debug(x) cout << #x << " is " << x << endl
#define pub push_back
#define pob pop_back
#def... |
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) fo... | #include <iostream>
#include <string>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <sstream>
#include <stack>
#include <set>
#include <bitset>
#include <deque>
#include <vector>
using namespace std;
... |
#include <bits/stdc++.h>
using namespace std;
void fast() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
vector<string> vec_splitter(string s) {
s += ',';
vector<string> res;
while(!s.empty()) {
res.push_back(s.substr(0, s.find(',')));
s = s.substr(s.find(',') + 1);
}
return res;
}
void deb... |
#include <bits/stdc++.h>
#define ll long long
#define sz(x) ((int) (x).size())
#define all(x) (x).begin(), (x).end()
#define vi vector<int>
#define pii pair<int, int>
#define rep(i, a, b) for(int i = (a); i < (b); i++)
using namespace std;
template<typename T>
using minpq = priority_queue<T, vector<T>, greater<T>>;
... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int W;
cin >> N >> W;
int count = 0;
int weight = 0;
while (weight <= N-W){
count++;
weight += W;
}
cout << count << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
#define FOR(i, a, b) for(int i = (int)(a); i <= (int)(b); ++i)
#define FORR(i, a, b) for(int i = (int)(a); i >= (int)(b); --i)
#define ALL(c) (c).begin(), (c).end()
using ll = long long;
using VI = vector<int>;
using VL ... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define reps(i,s,n) for(int i=(s); i<(n); i++)
#define all(v) v.begin(),v.end()
#define outve(v) for(auto i : v) cout << i << " ";cout << endl
#define outmat(v) for(auto i : v){for(auto j : i) cout << j << " ";cout << endl;}
#define in(n,v) for(int i=0;... | //yukicoder@cpp14
//writer:luckYrat(twitter:@luckYrat_)
//競技プログラミングから逃げるな
//https://www.youtube.com/watch?v=z_B9iJ8r4ic
//せんげん！
#include <iostream>
#include <cmath>
#include <algorithm>
#include <iomanip>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <bi... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, i, last, cc;
cin >> n;
vector<int> p(n);
vector<int> sw(200001);
last = 0;
cc = 0;
for (i = 0; i < 200001; ++i)
{
sw[i] = 0;
}
for (i = 0; i < n; ++i)
{
cin >> p[i];
sw[p[i]]=1;
... | #include <iostream>
#include <algorithm>
#include <list>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <chrono>
#include <cstdio>
#include <cstring>
#include <cmath>
#include... |
/* Author: rrrr_wys
**/
#include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)
#define pb push_back
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second
typedef double db;
typedef long long ll;
using namesp... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, a, b) for (auto i = (a); i < (b); ++i)
#define per(i, a, b) for (auto i = (b); i-- > (a); )
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) int((x).size())
#define lb(x...)... |
#include<bits/stdc++.h>
typedef long long int ll;
#define pb push_back
#define pi 3.141592653589793238462643383279
#define int long long
#define ff first
#define ss second
#define endl '\n'
#define all(x) (x).begin(), (x).end()
#define rep(i,x,y) for(int i=(int)x; i<y; i++)
#define high_functioning_sociopath ios_base... | #pragma region Macros
#include <bits/stdc++.h>
#if defined(LOCAL) || defined(ONLINE_JUDGE) || defined(_DEBUG)
#include <atcoder/all>
#endif
using namespace std;
#define REP(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REPR(i, n) for(int i=(n); i>=0; --i)
#define FOR(i, n, m) for(int i=(m), i##_len=(n); i<i##... |
#include<bits/stdc++.h>
using namespace std;
bool dp[1000005];
int main(){
int n,sum=0,x;
cin>>n;
dp[0]=1;
while(n--){
scanf("%d",&x);
for(int i=sum+x;i>=x;i--){
dp[i]|=dp[i-x];
}
sum+=x;
}
int ans=sum;
for(int i=0;i<=sum;i++)
if(dp[i])ans=min(ans,max(i,sum-i));
printf("%d\n",ans);
return 0;
} | #include <iostream>
#include <vector>
int main()
{
int N;
std::cin>>N;
std::vector<int64_t>T;
for(int i=0;i<N;i++)
{
int64_t t;
std::cin>>t;
T.push_back(t);
}
int sum=0;
for(auto e:T)sum+=e;
bool g[101][100001]{0};
g[0][0]=true;
for(int i=0;i<=N-1;i++)
{
for(int64_t j=0... |
#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;
// #pragma GCC optimize("O2")
typedef long long int ll;
typedef long double ld;
typedef map <ll,ll> mm;
typedef vector <ll> mv;
typedef pair <ll,ll> mp;
typedef set <l... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll LINF = 1001001001001001001;
#ifdef _DEBUG
#define show(x) \
cerr << #x << " : "; \
showVal(x)
template <typename T>
void showVal(const T &a) { cerr << a << endl; }
template <typename T>
void showVal(const vector<T> &a) {
for (const... |
#define _USE_MATH_DEFIMES
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <ioman... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fr(i,j,k) for(int i=j;i<k;i++)
#define f(n) fr(i,0,n)
#define f1(n) fr(i,1,n+1)
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
const ll mod = 1e9 + 7;
const int maxn = 1e5+5;
void go() {
int n;
c... |
#include<bits/stdc++.h>
using ll = int_fast64_t;
#define REP(i,b,e) for(ll i=b; i<e; i++)
int main(){
ll n, k;
scanf("%ld %ld", &n, &k);
ll ans = 0;
REP(ab, 2, 3*n){
ll cd = ab-k;
if(cd<2) continue;
ll l1 = std::max(0l, ab-n), r1 = std::min(ab, 0+n);
ll l2 = std::max(0l, cd-n), r2 = std::min(cd, 0+n);
an... | #include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <ctype.h>
#include <math.h>
#include <stack>
#include <string>
#include <string.h>
#define rep(i,n) for(ll i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
const long double PI = acos(-1.0);
const ll mod =... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define reps(i, s, n) for(int i = (s); i < (n); i++)
#define rrep(i, n) for(int i = (n) - 1; i >= 0; i--)
#define rreps(i, s, n) for(int i = (n) - 1; i >= (s); i--)
#define INF ~(1 << 31)
#define INFL ~(1LL... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
#define ll long long
int main() {
int a, b, w, min, max, goal, dif;
bool stop = false;
cin >> a >> b >> w;
w *= 1000;
if (w < a) cout << "UNSATISFIABLE";
else if (a == b) {
if (w % a == 0) cout << w / a << ' ' <<... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)n; i++)
using ll = long long;
const int MAX = 2e5;
int main(){
int n;
cin >> n;
int t[n];
int st = 0;
rep(i,n) {
cin >> t[i];
st += t[i];
}
vector<int> dp(MAX);
dp[0] = 1;
rep(i,n) {
vector<int> dpn(MAX... | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#define N 105
#define M 100001
using namespace std;
inline int read()
{
int x=0,f=1;char ch=getchar();
while(ch<'0' || ch>'9'){if(ch=='-') f=-1;ch=getchar();}
while(ch>='0' && ch<='9'){x=(x<<3)+(x<<1)+(ch^48);ch=getchar();}
re... |
/**
* Dont raise your voice, improve your argument.
* --Desmond Tutu
*/
#include <bits/stdc++.h>
using namespace std;
const bool ready = [](){
ios_base::sync_with_stdio(false); cin.tie(0);
cout << fixed << setprecision(12);
return true;
}();
using ld=long double;
const ld PI = acos((ld)-1);
using ll= ... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
//#i... |
#include <bits/stdc++.h>
using namespace std;
#define SZ(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define loop(i, a) for (int i = 0; i < (a); ++i)
#define cont(i, a) for (int i = 1; i <= (a); ++i)
#define circ(i, a, b) for (int i = (a); i <= (b); ++i)
#define range(i, a, b, c) for (int i = (a); (c) > ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
using vec_int = vector<int>;
using P = pair<int,int>;
// using T = tuple<int,int,int>;
using ll = long long;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int charToInt(char c){
char zero_num = '0';
return (int)c - (int)zero_num;
}
boo... |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
reverse(s.begin(),s.end());
for(int i=0; i<s.size(); i++){
if(s.at(i) == '6')s.at(i)='9';
else if(s.at(i) == '9')s.at(i)='6';
}
cout<<s<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define int long long
#define ll long long
#define ld long double
#define all(v) v.begin(), v.end()
#define endl "\n"
const ll inf = 1e18;
const ll mod = 1e9 + 7;
const ll MAX ... |
///****In the name of ALLAH, most Gracious, most Compassionate****//
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
#define ALL(a) a.begin(), a.end()
#define FastIO... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,s,e) for(int i=(s);(i)<(int)(e);++(i))
#define REP(i,e) FOR(i,0,e)
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();++it)
#define all(o) (o).begin(), (o).end()
typedef long long ll;
const int N = 200000;
int n;
int a[N];
class union... |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
struct BIT{
vector<LL> node;
int size;
BIT(int n){
size=n;
node.resize(size,0);
}
void add(int a,int x){
for(int i=a;i<size;i|=i+1) node[i]+=x;
}
LL sum(int a){
LL res=0;
for(int ... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
#define MAX 1000000007
int nCrModpDP(int n, int r, int p)
{
// The array C is going to store last row of
// pascal triangle at the end. And last entry
// of last row is nCr
int C[r+1];
memset(C, 0, sizeof(C));
C[0] = 1; // To... |
#define wiwihorz
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma loop-opt(on)
#define rep(i, a, b) for(int i = a; i <= b; i++)
#define rrep(i, a, b) for(int i = b; i >= a; i--)
#define all(x) x.begin(), x.end()
#define ceil(a, b) ((a + b - 1) / (b))
#define MAXN 1000005
#define INF 1000000000000000000
... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int n;
cin >> n;
vector<int> v(n);
for(auto& a: v){
cin >> a;
}
int ret = 0;
int maxcount = 0;
for(int i = 2; i <= 1000; ++i){
int count = 0;
for(auto& a : v){
if(a % i == 0){
++count; ... |
//#define localsystem 1
#ifdef localsystem
#include"mytimer.h"
#define mytest 1
#ifdef mytest
#include<fstream>
#endif
#endif
#define min(x, y) ((x < y) ? x : y)
#define max(x, y) ((x > y) ? x : y)
#include<iostream>
#include<string>
using namespace std;
int main() {
#ifdef mytest
ifstream mycin("Sample.txt")... | #include <bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin >> s;
while (s.back() == '0')
{
s.pop_back();
}
string t = s;
reverse(t.begin(), t.end());
if (s == t)
cout << "Yes\n";
else
cout << "No\n";
}
|
#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;
const int maxn = 2e3 + 10;
int n, m;
int g[maxn][maxn];
ll dp[maxn][maxn];
void add(ll &x, ll y... | #pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define REP(i, n) FOR(i,0,n)
constexpr unsigned MOD = 1000000007;
inline void add(unsigned &x, con... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#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 REP(i,a,b) for(int i = (a); i < (b); i++)
#define MOD 1000000007
int main(void) {
ll k;
cin >> k;
string s,t;
cin >> s >> t... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x... |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi=vector<int>;
int main() {
int N; cin>>N;
ll M = 10000000000;
string T; cin>>T;
if(T=="1"){
cout<<2*M<<endl;
return 0;
}else if(T=="11"){
cout<<M<<endl;
return 0;
}
int cnt = 0;
in... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int N;
cin >> N;
string T;
cin >> T;
string S;
while(S.length() < T.length()) {
S += "110";
}
ll ans = 0;
for(size_t i=0; i+T.size() <= S.... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ll x; cin >> x;
cout << 100 - (x%100) << endl;
return 0;
}
| #include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
using namespace std;
using ll = long long;
const int MOD = 1000000007;
const int INF = 2147483647;
int main() {
FAST;
int i, s = 0, l = 0, ans = 0;
ll m;
cin >> m;
vector<int> d(3,0);
while (m... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false); cin.tie(0);
ll a, b;
cin >> a >> b;
vector <int> primes = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71};
vector <ll> dp(1 << 20, 0);
dp[0] = 1;
for(ll x = a; x <= b; x+... | #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>
#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 ll MOD_NUM = 998244353;
// 二分累乗法
ll pow_mod(ll n, ll p, ll m) {
const int N = 64;
vector<ll> memory(N);
memory[0] = n % m;
rep(i, N) memory... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
const int M = 200;
int N;
cin >> N;
vector<int> A(N);
for (int& a : A) { cin >> a; }
vector<vector<int>> rest(M);
vector<int> ans1, ans2;
bool flag = false;
for (int i = 0; i < N; ++i)
... |
#include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1e9 + 7;
const int64_t MOD2 = 998244353;
const int INF = 2e9;
const long long inf = 1LL<<62;
template<int MOD> struct ModInt {
static const int Mod = MOD; unsigned x; ModInt() : x(0) { }
ModInt(signed sig) { x = sig < 0 ? sig % MOD + MOD : sig ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair<... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define ld long double
#define TIME clock() * 1.0 / CLOCKS_PER_SEC
#define sz(x) (int)(x.size())
const int modn = 998244353;
inline int add(int a, const int& b) {
// ensure both arguments are in the range [0, modn)
a += b;
... | #include <bits/stdc++.h>
using namespace std;
int main(){
long long i,j,k,l,m,n,a,b,c;
cin>>a>>b>>c;
if (c&1) {
if (a>b) {
cout<<'>';
}
else if (a<b) {
cout<<'<';
}
else {
cout<<'=';
}
}
else {
a=abs(a);
... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define loop(i,n) for(ll i=0;i<n;i++)
#define loopn(i,j,n) for(ll i=j;i<n;i++)
#define m_arr(arr, n) vector<ll>arr(n)
#define m_arre(arr) vector<ll>arr
#define m_set(sat) set<ll>sat
#define ppn(name) pair<ll,ll>name
#define pp pair<ll,ll>
#define sort_al... | #include <bits/stdc++.h>
using namespace std;
int main(){
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
long double X, Y, Z;
cin >> X >> Y >> Z;
long double iti = Y / X;
for(int i = 1; i <= 10000000; i++){
if(Z*iti <= (long double)(i)){
cout << i-1 << '\n';
... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
//constexpr ll MOD = 1e9 + 7;
constexpr ll MOD = 998244353;
//constexpr ll MOD = ;
ll mod(ll A, ll M) {return (A % M + M) % M;}
constexpr ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if ... | #include <iostream>
#include <string>
#include <vector>
#include <numeric>
#include <algorithm>
using ll = long long;
using namespace std;
ll N;
int main(int argc, char *argv[]) {
cin >> N;
vector<ll> A(N);
for (ll i = 0; i < N; i++) {
cin >> A[i];
}
ll ans = 1LL << 60;
for (ll i = 0; i < (1 << (N - 1)... |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;
int main(){
int a,b;
ll k;
cin >> a >> b >> k;
int n = a+b;
string s(n, 'a');
ll f1,f2,f3;
for(int i=0;i<n;i++){
ll sum = 1;
ll j = 1, l = 1, m = 1;
if(b == 0){
s[i] = 'a';
cont... | #include <bits/stdc++.h>
#define fi first
#define se second
#define ll long long
#define dl double
using namespace std;
const int N = 1e6 + 7;
const long long mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int L,R;
int p[N];
vector<int> v[N];
void solve()
{
cin >> L >> ... |
#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;
template <typename T> using vt = vector<T>;
template <typename T> using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define pb p... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int h, w, mini = -1, sum = 0;
cin >> h >> w;
vector<vector<int>> a(h, vector<int>(w, 0));
for (int i = 0; i < h; i++)
{
for (int j = 0; j < w; j++)
{
cin >> a.at(i).at(j);
if (mini == -1)
{
mini = a.at(i).at(j);
... |
#include<bits/stdc++.h>
using namespace std;
int N;
int a[300005];
map<long long,int>mp;
long long cnt,ans=0;
int main()
{
cin>>N;
for(int i=1;i<=N;i++)
{cin>>a[i];
mp[a[i]]++;
}
if(mp[a[1]]==N){cout<<"0";return 0;}//�״���
for(auto &v:mp)ans+=(long long)v.second*(v.second-1)/2;//v.secondΪ���ͣ���ǿ��
cnt=(long ... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define N 100004
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii... |
#include<bits/stdc++.h>
using namespace std;
#define re register
#define in inline
#define get getchar()
#define ll long long
int main()
{
ll n;
cin>>n;
if(n<=2) cout<<1<<endl;
else
{
ll l=2,r=sqrt(2*n),mid,ans;
while(l<=r)
{
mid=l+r>>1;
if((2+mid)*(mid-1)/2<=n) ans=mid, l=mid+1;
else r=mid-1;
}
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define FIO ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define mod 1000000007
int main(){
FIO;
ll t,n,k,i,j,ans=0;
string s;
cin >> s;
int a[26]={0};
t=0;
n=s.size();
for(i=n-2;i>=0;i--){
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i = (m); i <= (n); i++)
#define zep(i,m,n) for(ll i = (m); i < (n); i++)
#define rrep(i,m,n) for(ll i = (m); i >= (n); i--)
#define print(x) cout << (x) << end... | #include <bits/stdc++.h>
using namespace std;
template<class Cost = int>
struct Edge {
int from, to;
Cost cost;
Edge(const int &from = -1, const int &to = -1, const Cost &cost = 1)
: from(from), to(to), cost(cost) {}
bool operator<(const Edge<Cost> &rhs) const { return this->cost < rhs.cost; }... |
#include <bits/stdc++.h>
#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 FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n)
using namespace std;
using ll = long long;
using vll = vector<... | #include <bits/stdc++.h>
using namespace std;
signed main(void){
int n,a,b;
scanf("%d%d%d",&n,&a,&b);
printf("%d",n-a+b);
}
|
#define _USE_MATH_DEFIMES
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <ioman... | #include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <iomanip>
using namespace std;
int main(void){
string str;
int num;
int i,j,k;
int a,b;
int ans=0;
int flag =0;
cin >> a >> b;
for(;;){
a = a-b;
if(a < 0){
break;
}
ans++;
}
c... |
#pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using ll = int64_t;
using db = double;
using ld = long double;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vector<int>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vpii = vector... | /// Containers Start
#include <algorithm>
#include <bitset>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <regex>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include... |
#include<bits/stdc++.h>
typedef long long ll;
#define V(a) vector<a>
#define P(a,b) pair<a,b>
#define A(a) set<a>
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define in insert
#define bp __builtin_popcount
#define ppb pop_back
#define FOR(a,b,c) for(ll(a) = b; a < c; a++)
#define FORN(a,b... | #include <bits/stdc++.h>
using namespace std;
#define MP make_pair
#define PB push_back
#define REP(i, L, R) for (int i = L; i < (R); ++i)
#define SZ(x) (int)x.size()
using ll = long long;
using ld = long double;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
template <typename T>
bool ckmin(T &a, const T &b) ... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define dd double
#define endl "\n"
#define pb push_back
#define all(v) v.begin(),v.end()
#define mp make_pair
#define fi first
#define se second
#define vll vector<ll>
#define pll pair<ll,ll>
#define fo(i,n) for(int i=0;i<n;i++)
#define fo1(i,n) for(int... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007;
//constexpr long long MOD = 998244353;
constexpr long long INF = 1000000000 + 100;
constexpr long long LINF = 1000000000000000000 + 100;
#define wh... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007;
constexpr long long INF = 1000000000 + 100;
constexpr long long LINF = 1000000000000000000 + 100;
#define all(v) v.begin( ), v.end()
#define rep(i,... | #include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <climits>
#include <cmath>
#include <complex>
#include <functional>
#include <cassert>
#include <stack>
#include <numeric>
#include <iomanip>
#include <limits>
#include <random>
#include <unordered_map>
t... |
#include <algorithm>
#include <array>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
#... |
#include <iostream>
using namespace std;
int main (){
long long n,a;
cin >> n;
long long accm(0);
for (size_t i=0; i<n; i++){
cin >> a;
if (a <= 10)
continue;
accm += a - 10;
}
cout << accm << endl;
return 0;
}
|
#pragma GCC optimize ("O2")
#pragma GCC target ("avx")
//#include<bits/stdc++.h>
#include<iostream>
#include<cstring>
//#include<atcoder/all>
//using namespace atcoder;
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(... | #include<bits/stdc++.h>
using namespace std;
#define ri register int
typedef long long ll;
const int maxn=3010,mod=1e9+7;
inline bool ckmin(int &x,const int &y){return x>y?x=y,1:0;}
inline bool ckmax(int &x,const int &y){return x<y?x=y,1:0;}
struct modint{
int val;
inline modint(int val_=0):val(val_){}
inline modint... |
/* *****fireice**** */
#include<bits/stdc++.h>
#define ll long long int
#define ld long double
#define vi vector<int>
#define vc vector<char>
#define vl vector<ll>
#define vii vector<pair<int,int>>
#define vll vector<pair<ll,ll>>
#define pii pair<int,int>
#define pb push_back
#define eb emplace_back
#define el '\n'
#... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main()
{
int tc=1;
// cin>>tc;
while(tc--)
{
ll n;
cin>>n;
cout<<ceil( (n*1.0)/100 )<<endl;
}
return 0;
}
|
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int mod=1e9+7;
const int N=1e5+10;
int a[3000][3000];
struct node
{
int ta,ao;
int id;
} b[3000][3000];
int main()
{
int h,w;
cin>>h>>w;
char c;
for(int i=1; i<=h; i++)
{
for(int j=1; j<=w; j++)
{
... | #include <bits/stdc++.h>
#define rep(i,n) for (ll i = 0; i < (ll)(n); i++)
#define repr(i,a,b) for (ll i = (a); i < (ll)(b); i++)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
#define popcnt(x) __builtin_popcountll(x)
#define pb push_back
#define eb emplace_back
#define MP make_pair
#de... |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#ifdef ENABLE_DEBUG
#define dump(a) cerr<<#a<<"="<<a<<endl
#define dumparr(a,n) cerr<<#a<<"["<<n<<"]="<<a[n]<<endl
#else
#define dump(a)
#define dumparr(a,n)
#endif
#... | #include <bits/stdc++.h>
using namespace std;
int main() {
float A, B;
cin >> A >> B;
cout << (A - B) * 100 / A << endl;
return 0;
} |
/*{{{*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<string>
#include<iostream>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<bitset>
#include<vector>
#include<limits.h>
#include<assert.h>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).be... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;++i)
#define all(x) (x).begin(),(x).end()
using namespace std;
constexpr int INF = 1e9, MOD = 1e9 + 7;
constexpr int64_t LINF = 5e18, LMOD = 998244353;
// #include <atcoder/all>
// using namespace atcoder;
// const int dy[]={0,-1,0,1,1,-1,-1,1};
// const int dx[... |
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
int p[500];
int main() {
int t, i;
scanf("%d", &t);
for (i = 0; i < t; i++) {
int n, c = 1, j, k;
vector<int> v;
scanf("%d", &n);
for (j = 0; j < n; j++) scanf("%d", &... | #include<bits/stdc++.h>
using namespace std;
/**************************************************/
#define int long long
#define fr(i,st,c) for(int i=st;i<c;i++)
#define rfr(i,e,c) for(int i=e;i>=c;i--)
#define i_output(f1) cout<<(f1?"YES":"NO")<<endl;
#define vi vector<int>
... |
#include<bits/stdc++.h>
#define int long long
#define ri register signed
#define rd(x) x=read()
using namespace std;
const int N=3e5+5;
const int maxn=5e6+5;
const int mod=998244353;
const int inf=0x3f3f3f3f3f3f3f3f;
inline int read(){int x=0,f=1;char ch=getchar();while(ch>'9'||ch<'0'){if(ch=='-')f=-1;ch=getchar();}wh... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define per(i, a, b) for (int i = a; i >= b; i--)
using namespace std;
typedef unsigned long long ull;
typedef pair <int, int> pii;
typedef long long ll;
template <typename _T>
inline void read(_T &f) {
f = 0; _T fu = 1; char c = getchar()... |
#include<vector>
#include<cstring>
#include<algorithm>
#include<queue>
#include<iostream>
using namespace std;
int main(){
int a[3];
for(int i=0;i<3;i++) cin>>a[i];
sort(a,a+3);
if(a[2]-a[1]==a[1]-a[0]) cout<<"Yes";
else cout<<"No";
} | #include<bits/stdc++.h>
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define REP(i,j) for(int i=0;i<j;i++)
#define REPA(i,j) for(int i=1;i<=j;i++)
#define FORN(i,j,k) for(int i=j;i<k;i++)
#define vi vector<int>
#define vvi vector<vi >
#define p... |
#include<bits/stdc++.h>
#define ll long long
#define db double
#define M 200006
#define mo 998244353
using namespace std;
bool s1;
char o;
int Read(){
bool f=1;
while(!isdigit(o=getchar()))if(o=='-')f=0;
int res=o^48;
while(isdigit(o=getchar()))res=(res<<3)+(res<<1)+(o^48);
return f?res:-res;
}
int n,m,ans,cnt[M][... | #include <bits/stdc++.h>
#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)
#define unless(p) if(!(p))
#define until(p) while(!(p))
using ll = std::int64_t;
using P = std::tuple<int,int>;
int N;
ll X, Y[60];
ll A[60], B[60];
ll dp[60][10];
ll rec(int i, int c){
if(i == N -... |
#include <bits/stdc++.h>
using namespace std;
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...)
#endif
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long n;
cin >> n;
long long m = n;
vector<long long> f(88);
f[0] = f[1] = 1;
for (int i = 2; i < (int) f.size... | #include <bits/stdc++.h>
using namespace std;
#define SZ(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define loop(i, a) for (int i = 0; i < (a); ++i)
#define cont(i, a) for (int i = 1; i <= (a); ++i)
#define circ(i, a, b) for (int i = (a); i <= (b); ++i)
#define range(i, a, b, c) for (int i = (a); (c) > ... |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
long long mod=1e9+7;
long long modpascal=14348907;
int ic(char c){
if (c=='B') return 0;
if (c=='R') return 1;
return 2;
}
char ci(int i){
if (i==0) return 'B';
if (i==1) return 'R';
return 'W';
}
long long pp(long long a, l... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
using vl = vector<ll>;
using vs = vector<string>;
using vvl = vector<vector<ll>>;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_b... |
#include <bits/stdc++.h>
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_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)
#define... | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define oo 1000000010
const int N = 100010;
int n , l , a[N] , b[N];
map < int , int > mp , mp2;
int in[N] , it , val , g[N];
/*
pair< int , int > seg[4 * N];
void update(int s,int e,int idx){
if(s > r || e < l)
return;
if(s >= l && e <= r){... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n;
vector<ll> divs;
void divisors(ll n) {
divs.clear();
for (ll i = 1; i * i <= n; ++i) {
if (n % i == 0) {
divs.emplace_back(i);
if (i != n / i) divs.emplace_back(n/i);
}
}
sort(divs.begin(), divs.end());
}
int main()... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/trie_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define fef(i,a,b) for(ll i=a;i<=b;i++)
#define rer(i,a,b) for(ll i=b;i>=a;i--)
#d... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define reps(i,s,n) for(int i=(s); i<(n); i++)
#define all(v) v.begin(),v.end()
#define outve(v) for(auto i : v) cout << i << " ";cout << endl
#define outmat(v) for(auto i : v){for(auto j : i) cout << j << " ";cout << endl;}
#define in(n,v) for(int i=0;... | #include<bits/stdc++.h>
using namespace std;
int n,m,x,y;
char a[105][105];
int ans;
signed main()
{
cin>>n>>m>>x>>y;
for(int i=1;i<=n;++i)
{
for(int j=1;j<=m;++j)
{
cin>>a[i][j];
}
}
if(a[x][y]=='#'){
cout<<0<<'\n';
return 0;
}
ans=1;
for(int i=1;i<=n;++i)
{
if(x+i>n || a[x+i][y]=='#') break;
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
const int MOD = 1e9+7;
const int INF = 0x3f3f3f3f;
const ll LLI... | #include <bits/stdc++.h>
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using namespace std;
//#define int long long
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
typedef vector<vector<int>> graph;
#define pu push
#define p... |
#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 int long long
#define pb push_back
#define mp make_pair
#define for0(i,n) for(int i=0;i<n;i++)
#define for1(i,n) for(int i=1;i<=n;i++)
#define w(x) int x;cin>>x;wh... | #include<iostream>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>
#include<list>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#include<tuple>
#include<cstring>
#include<bitset>
#define REP(i,n) for(ll i=0;i<(ll)n;i++)
#define ALL(x) (x).begin(),(x).end()
#define ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define mems(p) memset(p,-1,sizeof(p))
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define nl "\n"
const int mxN = 1e5;
const ll MOD = 1e9 + 7;
void fast()
{ios_base::sync_with_stdio(false);cin.tie(0);c... | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
typedef long long ll; typedef long double ld; typedef vector <int> vi; typedef vector <ll> vll; typedef vector <string> vS; typedef vector <vector <int>> vv; typedef map<int, int> mi; typedef map<string, int> ms; typedef map<char, int> mc; ty... |
#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
typedef pair<string,int> psi;
typedef pair<int,string> pis;
typedef array<int,2> aii;
typedef array<int,3> aiii;
typedef array<int,4> aiiii;
typedef unsigned long long ull;
typedef long long int ll;
typedef array<ll,2> all;
typedef array<ll,3> all... | #include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define all(x) (x).begin(),(x).end()
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { ... |
#include<bits/stdc++.h>
using namespace std;
long long a[2000005],s[2000005],mmax[2000005];
int main()
{
int n;
cin>>n;
long long sum=0;
for (int i=1;i<=n;i++){
cin>>a[i];
sum-=1ll*(i-1)*mmax[i-1];
mmax[i]=max(mmax[i-1],a[i]);
s[i]=s[i-1]+a[i];
sum+=i*mmax[i];
... | //#include <bits/stdc++.h>
//using namespace std;
#include <cstdio>
#define rep(i,_l,_r) for(signed i=(_l),_end=(_r);i<=_end;++i)
#define fep(i,_l,_r) for(signed i=(_l),_end=(_r);i>=_end;--i)
#define erep(i,u) for(signed i=head[u],v=to[i];i;i=nxt[i],v=to[i])
#define efep(i,u) for(signed i=Head[u],v=to[i];i;i=nxt[i],v=... |
#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-1;i>=a;i--)
// #define repl(i,a,n) for(long long int i=a;i<n;i++)
#define pb push_back
#define mp make_pair
#define all(x) x.begin(),x.end()
#define fi first
#define se second
#define SZ(x) ((int)(x).... | //g++ t.cpp -o t && t < p.txt
//d>p.txt&&t<p.txt&&t2<p.txt
#include <iostream> //
#include <vector> //
#include <algorithm> //
#include <queue> //
#include <string> //
#include <functional> //
#include <set> //
#include <unordered_map> //
#include <random> //
#include <ctime> //
#include <bitset> //
#include... |
#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;
int main()
{
long long int i,s,p,j;
cin>>s>>p;
for(i=1;;i++){
if(i*(s-i)==p){
cout<<"Yes\n";
return 0;
}
if(i*(s-i)>p){break;}
}
cout<<"No\n";
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 3e5 + 10;
int n, m;
int t[N];
void add(int x, int v) {
for(int i = x; i <= n; i += i & (-i)) t[i] ^= v;
}
int cal(int x) {
int res = 0;
for(int i = x; i > 0; i -= i & (-i)) res ^= t[i];
return res;
}
int main() {
scanf("%d%d", &n... | #include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include<math.h>
#include<unordered_set>
#include<unordered_map>
#include<cassert>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef vector<ll> vll;
typedef vector<pll> vpll;
#define mp make_pai... |
#include<iostream>
#include<string>
#include<vector>
#include<numeric>
#include<algorithm>
#include<cmath>
#include <iomanip>
using namespace std;
template<class T>
istream& operator >>(istream& is, vector<T>& v){
for(auto&& elem:v)cin >> elem;
return is;
}
template<class T>
ostream& operator <<(ostream& os, const... | /** (buri nazar wale tera muh kala 😑)
*
* @Author : rudraksh
* @Created : Saturday, January 16th 2021, 6:13:01 pm
* @Email : rudrakshk@iitbhilai.ac.in
*
* “My code works? - don't ask me how”
*/
#include <bits/stdc++.h>
#include <unistd.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file... |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(size_t i=(l); i<(r); i++)
#define REP(i,n) FOR(i,0,n)
#define endl "\n"
#define debug(x) cout<<x<<endl;
typedef long long ll;
static const ll INF = 1ll<<60;
static const double EPS = 10e-12;
int main(){
int N;
ll X;
cin>>N>>X;
vector... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i=0;i<n;i++)
#define Rep(i,x,n) for(i=x;i<=n;i++)
#define foreach(c,itr) for(__typeof(c)::iterator itr=c.begin();itr!=c.end();itr++)
#define all(v) v.begin(),v.end()
#define p_b push_back
#define fr first
#define sc second
#define m_p make_pair
#define ... |
#include<bits/stdc++.h>
using namespace std;
using namespace std::chrono;
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 chm... | // I SELL YOU...!
#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
#include<queue>
#include<chrono>
#include<iomanip>
#include<map>
#include<set>
#include<random>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using TP = tuple<ll,ll,ll>;
void init_io(){
cin.tie(0);
io... |
#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 <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using Graph=vector<vector<int>>;
const double pi=3.141592653589793;
const int64_t inf=1L<<60;
const int64_t minf=-inf;
const int64_t mod=998244353; /*1000000007*/
int64_t N,M;
//pow
int64_t power(int64_t a,int64_t b){
int64_t res=1;
while(b>0){... |
#pragma GCC target ("avx2")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("O3")
#include "bits/stdc++.h"
#include <unordered_set>
#include <unordered_map>
#include <random>
using namespace std;
typedef long long ll;
const ll MOD = 1'000'000'007LL; /*998'244'353LL;*/
#define pb push_back
#define mp make_pa... | #include <bits/stdc++.h>
using namespace std;
int main()
{
// Input from input.txt
ifstream in("input.txt");
cin.rdbuf(in.rdbuf());
// Speeding up cin
cin.tie(0);
ios::sync_with_stdio(false);
// Main code
int N, M;
cin >> N >> M;
vector<string> S(N);
for (int i = 0; i < N... |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, l, r) for (int i = l; i <= r; ++i)
#define dep(i, r, l) for (int i = r; i >= l; --i)
const int mod = 1e9 + 7;
void read (int &x) {
x = 0; char c = getchar();
while(c < '0' || c > '9') c = getchar();
while(c >= '0' && c <= '9')
x = x * 10 + c - 48, c = ... |
// Problem: C - ORXOR
// Contest: AtCoder - AtCoder Beginner Contest 197（Sponsored by Panasonic）
// URL: https://atcoder.jp/contests/abc197/tasks/abc197_c
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include<bits/stdc++.h>
using namespace std;
const i... |
/// BISMILLA HIRRAHMANIR RAHIM
/// ALLAH IS ALMIGHTY
/// ALLAH IS MUCH MORE CREATIVE
#include<bits/stdc++.h>
#define faster ios :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define pb push_back
#define ff first... | #ifdef __LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
#pragma region macros
using str=string;
using ll=long long;
using vl=vector<ll>;
using vc=vector<char>;
using pl=pair<ll,ll>;
using ml=map<ll,ll>;
using sl=set<ll>;
using graph=vector<vector<ll>>;
template<class T> using V=vec... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define mod 1000000007
#define m 998244353
int main()
{
ll a,b,c,ans=0;
cin>>a>>b>>c;
ll x=((a*(a+1))/2)%m;
ll y=((b*(b+1))/2)%m;
ll z=((c*(c+1))/2)%m;
ans=(x*y)%m;
ans=(ans*z)%m;
cout<<ans;
} | #include<bits/stdc++.h>
typedef long long ll;
#define V(a) vector<a>
#define P(a,b) pair<a,b>
#define A(a) set<a>
#define M(a,b) map<a,b>
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define in insert
#define bp __builtin_popcount
#define ppb pop_back
#define FOR(a,b,c) for(ll(a) = b; a < ... |
#define _CRT_SECURE_NO_WARNINGS
#include <cstdio>
#include <map>
#include <set>
#include <vector>
int main(){
int N, M;
scanf("%d %d", &N, &M);
std::map<int, std::vector<int>> Map;
for(int i = 0; i < M; i++){
int X, Y;
scanf("%d %d", &X, &Y);
Map[X].emplace_back(Y);
}
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
using ll = long long;
using P = pair<int,int>;
int n,m;
signed main(){
cin >> n >> m ;
map<int,int> cnt;
vector<P> p(m);
for(int i=0;i<m;i++){
cin >> p[i].first;
cin >> p[i].second;
cnt[p[i].first]++;
}
sort(p.begin(),p... |
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
#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 mydeb(fmt, ...) fprintf(stderr, fmt, __VA_ARGS__)
//#define mydeb(fmt, ...)
int main()
{
int ... | #include<bits/stdc++.h>
using namespace std;
#define INF 1e15
#define EPS 1e-9
#define MOD 1000000007
#define Pi 3.14159265358979323846264338327950288419716939937510
#define umap unordered_map
#define uset unordered_set
#define fi first
#define se second
#define l... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll,ll>
#define FOR(I,A,B) for(ll I = ll(A); I < ll(B); ++I)
#define FORR(I,A,B) for(ll I = ll((B)-1); I >= ll(A); --I)
#define TO(x,t,f) ((x)?(t):(f))
#define SORT(x) (sort(x.begin(),x.end())) // 0 2 2 3 4 5 8 9
#define POSL(x,v) (lower_... | #include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int si, sj, ti, tj, t[50][50], p[50][50],
dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
bool done[2500] = {};
char c[4] = {'R', 'D', 'L', 'U'};
string ans = "";
pair<int, int> next(int d){
pair<int, int> res = {ti + dx[d % 4], tj + d... |
#include <algorithm>
#include <cstdlib>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#def... | #include<stdio.h>
static inline int IN(void)
{
int x=0,f=1,c=getchar();while(c<48||c>57){if(c==45){f=-f;}c=getchar();}
while(c>47&&c<58){x=x*10+c-48,c=getchar();}return f*x;
}
static inline void OUT(int x){if(x<0){putchar('-'),x=-x;}if(x>=10){OUT(x/10);}putchar(x-x/10*10+48);}
int main(void)
{
int N=IN(),M=1,x=1;... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define SZ(x) ((int)(x).size())
#define FOR(var, begin, end) for (int var = (begin); var <= (end); var++)
#define RFOR(var, begin, end) for (int var = (begin); var >= (end); var--)
#define REP(var, length) FOR(var, 0, length - 1)
#define RREP(var, leng... | #include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<stack>
#include<string>
#include<map>
#include<set>
#include<tuple>
#include<cmath>
#include<iomanip>
using namespace std;
typedef long long ll;
typedef vector<ll> v;
typedef vector<vector<ll>> vv;
#define MOD 1000000007
#define INF 10... |
#pragma GCC optimize("O3")
#pragma GCC target("avx2")
#include <algorithm>
#include <iostream>
#include <bitset>
#include <vector>
#include <array>
using namespace std;
#define f(x,y,z) for(int x=y;x<=z;++x)
vector<int> v[200001];
int n, a, b, it;
array<int, 200001> jr, dlm, nmr;
bitset<200001> sdh;
void jrk(int x) {
... | //全力以赴
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define PI 3.141592653L
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
const ll INF = (ll)1e18;
const int N = 2e5 + 5;
const ll MOD = 1e9+7;
int parent[N];
const int dx[4] = {+1, 0, -1, 0};
const int dy[4]... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.