code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
long n,m;cin>>n;
set<long> s;
rep(i,n){cin>>m; s.insert(m);}
//cout<<*rbegin(s)<<endl;
while(1){
if(*rbegin(s)==*begin(s)||s.size()==1){cout<<*rbegin(s);break;}
else {
//if(s.size()==1){cout<<*be... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, c) for (int i = 0; i < (int)c; i++)
using ll = long long;
ll GCD(ll a, ll b) {
if (b == 0)
return a;
else
return GCD(b, a % b);
}
int main() {
int n;
cin >> n;
ll res = 0;
rep(i, n) {
ll a;
cin >> a;
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long lnt;
const lnt P = 1000000007;
template <class T> inline void read(T &x) {
x = 0; int c = getchar(), f = 1;
for (; !isdigit(c); c = getchar()) if (c == 45) f = -1;
for (; isdigit(c); c = getchar()) (x *= 10) += f*(c-'0');
}
int n, m, s;
lnt PowMod(lnt x... | #include <bits/stdc++.h>
#define rep3(i, s, n, a) for (int i = (s); i < (int)(n); i += a)
#define rep2(i, s, n) rep3(i, s, n, 1)
#define rep(i, n) rep2(i, 0, n)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
int main() {
string n;
cin >> n;
int nlen =... |
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <cmath>
#include <iomanip>
#include <bitset>
using namespace std;
#define REP(i,n) for (int i=0;i<(n);++i)
#define rep(i,a,b) for(int i=a;i<(b);++i)
template<class T> inline bool chmin(T &a, T b){ if(a > b) { a = b; retu... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n,k,m,s=0,i;
cin>>n>>k>>m;
int arr[n];
for(i=0;i<n-1;i++)
{
cin>>arr[i];
s+=arr[i];
}
int ans=n*m-s;
if(ans>k)
cout<<"-1"<<endl;
else if(ans<0)
cout<<"0"<<endl;
else
cout<<ans<<endl;
}
|
#include <iostream>
using namespace std;
int f[16][16],p[16][2];
int h,w,a,b,a1,b1;
int set1(int j,int k){
int i0,i1;
i0=j/w;
i1=j%w;
if(f[i0][i1]==1)
return 0;
switch(k){
case 1:
if(a1==0||i0+1==h||f[i0+1][i1]==1)
return 0;
f[i0][i1]=1;
f[i0+1][i1]=1;
a1--;
bre... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define vec vector
#define rep(i,n) for (int i=0; i<(n); i++)
#define print(a) cout << a << endl
#define fix(n) fixed << setprecision(n)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define Yes "Yes"
#d... |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <s... | #include <bits/stdc++.h>
using namespace std;
int main(){
int V;
int T;
int S;
int D;
cin >> V >> T >> S >> D;
if(V*T <= D && V*S >= D) {
cout << "No";
}
else {
cout << "Yes";
}
} |
//#pragma GCC optimize ("O2")
//#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<cstdio>
#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... | #include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
#define rep(i,n) for(ll i=0; i<n; i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rrep(i,n) for(ll i=n-1; i>=0; i--)
#define fi first
#define se second
#define pcnt __builtin_popcountll
typedef long long ll;
typedef unsigned long lon... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rep_up(i, a, n) for (ll i = a; i < n; ++i)
#define rep_down(i, a, n) for (ll i = a; i >= n; --i)
#define P pair<ll, ll>
#define all(v) v.begin(), v.end()
#define fi first
#define se second
#define v... | #include<bits/stdc++.h>
using namespace std;
int main(){
long long A,B,C,D; cin >> A >> B >> C >> D;
long long blue = A, red = 0;
for(int i = 1; i <= A; i++){
blue += B;
red += C;
if(blue <= D*red){
cout << i << endl;
return 0;
}
}
cout << -1 <... |
#include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;
using P = pair<ll, ll>;
// clang-format off
#ifdef _DEBUG_
#define dump(...) do{... | #include <bits/stdc++.h>
using namespace std;
int a, b, c;
int main() {
// freopen("in.txt", "r", stdin);
cin >> a >> b >> c;
cout << max({a + b, a + c, b + c}) << '\n';
return 0;
}
|
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<vector>
#define rg register
inline int read(){
rg int x=0,fh=1;
rg char ch=getchar();
while(ch<'0' || ch>'9'){
if(ch=='-') fh=-1;
ch=getchar();
}
while(ch>='0' && ch<='9'){
x=(x<<1)+(x<<3)+(ch^48);
ch=getchar();
}
return x... | #include <cstdio>
using namespace std;
int n,m,k;
int c[102],d[102],a[102],b[102],ans;
bool vis[102];
void dfs(int x){
if(x==k){
int cnt=0;
for(int i=0;i<m;++i){
if(vis[a[i]]&&vis[b[i]])++cnt;
}
if(ans<cnt)ans=cnt;
}else if(vis[c[x]]&&vis[d[x]]){
dfs(x+1);
}else{
if(!vis[c[x]]){
vis[c[x]]=true;
... |
//@Author: KeinYukiyoshi
// clang-format off
#include <bits/stdc++.h>
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx")
#define int long long
using namespace std;
#define stoi stoll
#define fi first
#define se second
#define rep(i, n) for(int i=0, i##_len=(n); i<i##_len; i++)
#define rep2(i, a, b) for (int i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
#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++)
const int INF =2e5+1;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0... |
#include <bits/stdc++.h>
#include <algorithm>
#define _GLIBCXX_DEBUG
using namespace std;
typedef long long ll;
int main(){
ll a,b,mx=1; cin >> a >> b;
vector<ll> count(b+1,0);
for(ll i=a; i<=b; i++){
for(ll j=1; j*j<=i; j++){
if(i%j==0){
if(j*j==i){
count[j]++;
}
else{... | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
#include <cstdint>
#include <string>
#include <sstream>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if ... |
#include<bits/stdc++.h>
using namespace std;
const int mx=505;
const int mod=998244353;
int n,m,dp[mx][mx];
long long tmp=1;
char a[mx][mx];
int main() {
// freopen("data.in","r",stdin);
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++) scanf("%s",a[i]+1);
for(int i=1;i<=n;i++) {
int col=0,col2=0;
for(int j=0;i-j>=1&&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 fr first
#define... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ppll pair<ll,pair<ll,ll>>
#define pll pair<ll,ll>
#define rep(i,x,y) for(ll i=x;i<=y;i++)
#define inf 1e16
#define imin INT_MIN
#define imax INT_MAX
#define pb push_back
#define pf push_front
#define vll vector<ll>
#define vvll vector<vector<ll... | #include"iostream"
#include"cstdio"
#include"cmath"
#include"cstring"
#include"algorithm"
#include"stack"
#include"queue"
using namespace std;
#define read(x) scanf("%d",&x)
#define readl(x) scanf("%lld",&x)
#define ll long long
#define ull unsigned long long
#define MOD 1000000007
#define MAXN 200005
int n,q,c;
int ... |
#include <iostream>
using namespace std;
int main() {
long long b, c; cin >> b >> c;
long long ans = 0;
if (b == 0) {
if (c == 0)
ans = 1;
else
ans = c;
}
else if (0 < b) {
if (c < 2 * b)
ans = c + 1;
else
ans = 2 * b + 1;
if (2 < c)
ans += c - 2;
}
else {
if (c == 0)
ans = 1;
... | #include <bits/stdc++.h>
using namespace std;
const int N = 200005;
typedef pair<long long, long long> pll;
long long b, c;
int solve() {
scanf("%lld %lld", &b, &c);
long long ans = 0;
pll range1 = {b - c/2, b + max(0LL, c - 2) / 2};
pll range2 = {-b - (c - 1) / 2, -b + (c - 1) / 2};
// cerr << range1.f... |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace std;
using namespace __gnu_pbds;
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_nod... | #include <bits/stdc++.h>
using namespace std;
// type alias
typedef long long LL;
typedef pair<int,int> II;
typedef tuple<int,int,int> III;
typedef vector<int> VI;
typedef vector<string> VS;
typedef unordered_map<int,int> MAPII;
typedef unordered_set<int> SETI;
template<class T> using VV=vector<vector<T>>;
// minmax
te... |
// author: erray
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int T;
cin >> T;
while (T--) {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
if (n % 2 == 1) {
cout << "Second";
... |
// Problem : D - Let's Play Nim
// Contest : AtCoder - AtCoder Regular Contest 105
// URL : https://atcoder.jp/contests/arc105/tasks/arc105_d
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma"... |
#include <bits/stdc++.h>
using namespace std;
#define faster \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ff first
#define ss second
#define pb push_back
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) (a * (b / gcd(a, b)))
#define all(a) a.begin(... | #include <cstdio>
long long two(int K) {
long long ans = 0;
for(int i = 1, j = 1; i <= K && j <= K; i = j+1, j = K/(K/i)) {
ans += (j - i + 1) * (K/i);
if(j == K) break;
}
return ans;
}
int main() {
int K; scanf("%d", &K);
long long ans = 0;
for(int i = 1, j = 1; i <= K && j <= K; i = j+1, j = K/(K/i)) {
... |
#include <iostream>
#include <vector>
#include <string>
#include <math.h>
/* MACROS START */
#define input std::cin
#define for2(i,n) for(int i=0; i<n; i++)
#define for3(i,a,n) for(int i=a; i<n; i++)
#define for4(i,a,n,s) for(int i=a; i<n; i+=s)
using lint = long long int;
using namespace std;
template <typename T>
... | #include<bits/stdc++.h>
#define int long long int
using namespace std;
int32_t main()
{
int a; cin >> a;
int now = 0, ind = 1;
while(now + ind <= a + 1)
{
now += ind;
ind ++;
}
cout << a + 1 - ind + 1 << '\n';
return 0;
} |
//bismillahir rahmanir rahim //Author:Fayed Anik
#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<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_up... | #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 int maxn = 55;
int n; ll x;
ll a[maxn];
ll b[maxn];
ll k[maxn];
ll dp[maxn][2];
int main() {
ios_base::sync... |
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include<stdio.h>
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<string.h>
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define NDEBUG
#define eprintf(...) do {} while (0)
#endif
#include<cassert>
using ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);i++)
#define ALL(v) v.begin(),v.end()
const int N=50;
int t[N][N],s[N][N],sy,sx,highscore,dy[4]={-1,0,0,1},dx[4]={0,-1,1,0};
string highans;
using B=bitset<1500>;
const double TIMELIMIT=1.95*CLOCKS_PER_SEC;
clock_t start;
void dfs(int s... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vl = vector<ll>;
using vvl = vector<vl>;
using pl = pair<ll, ll>;
const ll INF = ll(1e18);
const ll mod = ll(998244353);
const double pi = acos(-1);
#define rep0(i,n) for(ll (i) = 0; (i) < (n); ++(i))
#define rrep0... | #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<bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll solve(ll y, ll x, unordered_map<ll, ll> &mp)
{
if(mp.find(y)!=mp.end())
return mp[y];
if(x>=y)
return x-y;
if(y%2==0)
{
ll temp = min(1 + solve(y/2, x, mp), y-x);
mp[y] = temp;
... | #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;
vector<vector<int>> bata;
vector<int> dscore, nscore;
vector<int> stsize;
void getScores(int v) {
nscore[v] = 1;
dscore[v] = 0;
stsize[v] = 1;
if (bata[v].size() == 0) {
// printf("%d d n s %d %d %d\n", v, dscore[v], nscore[v], stsize[v]);
... | #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>
using namespace std;
int main(){
int n;
cin>>n;
string s;
cin>>s;
int count=0;
for(int i=0;i<s.length();i++){
int a=0,t=0,g=0,c=0;
for(int j=i;j<s.length();j++){
switch(s[j]){
case 'A':a++; break;
case 'T':t++; break;
case 'G':g++; break;
case... | #include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#inc... |
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
//#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//using namespace __gnu_pbds; ... | #include<bits/stdc++.h>
using namespace std;
int n;
#define Maxn 500010
#define cout cerr
char ch[Maxn];
int S[Maxn],T[Maxn];
int seq[Maxn],cnt;
int A[Maxn],a,B[Maxn],b;
int main(){
scanf("%d",&n);
scanf("%s",ch+1);
for(int i=1;i<=n;++i)S[i]=ch[i]-'0';
scanf("%s",ch+1);
for(int i=1;i<=n;++i)T[i]=ch[i]-'0';
long ... |
#include<iostream>
#include<vector>
#include<string>
#include<queue>
#include<map>
#include<algorithm>
using namespace std;
using ll = long long;
using ld = long double;
int main(){
ll l;
cin >> l;
ld prod = 1;
for(int i=1;i <= 11;i++){
if(i == l-11) break;
prod *= (l-i);
prod /= i;
}
ll ans ... | /******************************
Author: jhnah917(Justice_Hui)
g++ -std=c++14 -DLOCAL
******************************/
#include <bits/stdc++.h>
#define x first
#define y second
#define all(v) v.begin(), v.end()
#define compress(v) sort(all(v)), v.erase(unique(all(v)), v.end())
using namespace std;
typedef long long ll;... |
#include <bits/stdc++.h>
using namespace std;
bool ok(long long dx, long long dy, long long R) {
return dx * dx + dy * dy <= R * R;
}
long long f(long long x, long long y, long long R, long long lim) {
int l = 0, r = 1;
long long res = 0;
for (int i = int(1e9) + 50000; i >= lim; i -= 10000) {
w... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstring>
#include <iostream>
#include <sstream>
#include <numeric>
#include <map>
#include <set>
#include <queue>
#include <vector>
using namespace std;
typedef long long LL;
typedef long double LD;
const LD EPS = 1e-14;
LL solve(long double X, long d... |
//#include <bits/stdc++.h>
#include <iostream>
#include <iomanip>
#include <math.h>
#include <cmath>
#include <algorithm>
#include <climits>
#include <functional>
#include <cstring>
#include <string>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <vector>
#include <stack>
#include <queue>
#include <dequ... | /*
author:ryo3ihara
”継続は力なり、雨だれ石を穿つ”
”slow but steady wins the race”
*/
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
/*
// 多倍長テンプレ
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/mul... |
#include <bits/stdc++.h>
using namespace std;
int main() {
// 入力
vector<int> taste(4);
bool EQUAL = false;
for(int i=0; i<4; i++){
cin >> taste.at(i);
}
// 入力終わり
sort(taste.begin(),taste.end());
if(taste.at(0)+taste.at(3) == taste.at(1)+taste.at(2)){
EQUAL = true;
}else if(tast... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef queue<int> qi;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpii;
typedef multiset<int> msi;
typedef vector<vector<int>> vvi;
typedef queue<int> di;
typedef mult... |
#include<bits/stdc++.h>
using namespace std;
#define arep(i,x,n) for(int i=int(x);i<(int)(n);i++)
#define rep(i,n) for(long long i = 0;i < n;++i)
#define rrep(i,n) for(int i=int(n-1);i>=0;i--)
#define fs first
#define sc second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define coy c... | #include <iostream>
#include <set>
using namespace std;
typedef long long ll;
int main() {
ll x, y, a, b; cin >> x >> y >> a >> b;
ll exp = 0;
while ((double)a*x < 2e18 && a*x <= x+b && a*x < y) {
x = a * x; exp++;
}
if (x < y) {
exp += (y - x - 1) / b;
}
cout << exp;
} |
#include <algorithm>
#include <climits> // FOO_MAX, FOO_MIN
#include <cmath>
#include <cstdlib> // abs(int)
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
#define roundup(n, d) (((n) + ((d)-1)) / (d))
#define assign_ma... | #include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#... |
/*himanshukm2301*/
#include <bits/stdc++.h>
using namespace std;
#define hyperspeed \
ios::sync_with_stdio(0); \
cin.tie(0);
#define INF 1000000000000000003
typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll, ll> pi;
#define PB push_back
#define PF push_front
#define POB pop_back
#define MP... | #include <bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define mp make_pair
#define pb push_back
#define ll long long
#define ld long double
#define debug(x) cout << '[' << #x << " is: " << x << "] " << endl;
#define rsor(v) sort(v.rbegin() ... |
#include <bits/stdc++.h>
using i64 = long long;
#define REP(i, n) for (int i = 0, REP_N_ = int(n); i < REP_N_; ++i)
#define ALL(x) std::begin(x), std::end(x)
template <class T>
inline bool chmax(T &a, T b) {
return a < b and ((a = std::move(b)), true);
}
template <class T>
inline bool chmin(T &a, T b) {
return a >... | #include <bits/stdc++.h>
#define sz(a) a.size()
#define pb(a) push_back(a)
#define all(a) a.begin(),a.end()
#define mem(a,b) memset(a,b,sizeof(a))
#define rep(i,a,b) for(int i=a;i<b;i++)
using namespace std;typedef long long ll;const ll mod=1e9+7;
#define inf 0x3f3f3f3f
const int M=1e4+7,N=4e5+7;
int T;
int n,m;
vecto... |
#include <bits/stdc++.h>
using namespace std;
struct dsuflipcard {
vector<int> par, edgeincomp;
dsuflipcard(int n) {
par.assign(n + 1, -1);
edgeincomp.assign(n + 1, 0);
}
int find(int u) {
if (par[u] < 0) return u;
return par[u] = find(par[u]);
}
void join(int u, int v) {
u = find(u); ... | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define drep(i,j,n) for(int i=0;i<(int)(n-1);i++)for(int j=i+1;j<(int)(n);j++)
#define trep(i,j,k,n) for(int i=0;i<(int)(n-2);i++)for(int j=i+1;j<(int)(n-1);j++)for(int k=j+1;k<(i... |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
#include <cstdint>
#include <string>
#include <sstream>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if ... | #include <bits/stdc++.h>
typedef long long int64;
typedef unsigned int uint;
typedef unsigned long long uint64;
typedef double db;
typedef long double db64;
const int N = 2e5, K = 300, MOD = 998244353, I2 = (MOD + 1) / 2;
int n, k, a[N + 5], c[K + 5][K + 5];
int64 s[K + 5];
int main() {
scanf("%d%d", &n, &k);
for... |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long N, X;
//string S;
cin >> N >> X;
long long ans = X;
for(int i=0; i<N; i++){
char c;
cin >> c;
if(c=='o'){
ans++;
}else{
if(ans>0) ans--;
}
}
cout << ans << endl;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for (ll i = 0; i < (n); ++i)
#define All(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend() //reverse
#define strall(v) (v).cbegin(),(v).cend() //const_itterator
#define IN(a, b, x) (a<=x&&x<b)
using namespace std;
using... |
#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>
#define ll long long
#define ld long double
#define f first
#define s second
#define dbg(x) cout<< #x <<" "<<x<<"\n";
using namespace std;
void solve(){
ll n;
cin>>n;
vector<string> v(n+1);
vector<ll> dp(n+1,1);
for(ll i=1; i<=n; ++i){
cin>>v[i];
}
for(l... |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using vvvll = vector<vector<vector<ll>>>;
using vvvvll = vector<vector<vector<vector<ll>>>>;
using pl4 = pair<ll,ll>;
using str = string;
using vpl4 = ve... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define yes {cout<<"Yes"<<endl;return 0;}
#define no {cout<<"No"<<endl;return 0;}
#define INF 2147483647
#define LINF 9223372036854775807
int DigitSum(int n1)
{
int digitsum;
digitsum=0;
while(n1!=0)
{
digitsum+=n1%10;
n1=... |
#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;
template <typename T>
using indexed_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <class T> bool umin(T &a, const T ... | #include <bits/stdc++.h>
using namespace std;
const int maxm=1010;
int N,n,m,t,a[maxm],b[maxm];
int main()
{
scanf("%d%d%d",&n,&m,&t);N=n;
for(int i=1;i<=m;i++) scanf("%d%d",&a[i],&b[i]);
a[0]=b[0]=0;
a[m+1]=t;
for(int i=1;i<=m+1;i++)
{
n-=a[i]-b[i-1];
if(n<=0) return !printf("No");
n+=b[i]-a[i];
n=... |
/*** keep hungry and calm PushyTao!***/
#include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <math.h>
using namespace std;
typedef long long ll;
#define HEAP(...) priority_queue<__VA_ARGS__ >
#define heap(...) priority_que... | #include <bits/stdc++.h>
// #include <atcoder/all>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i)
#define pb push_back
#define eb empla... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
class mint{
static const int MOD=1e9+7;
int x;
public:
mint():x(0){}
mint(long long y){ x=y%MOD; if(x<0) x+=MOD; }
mint& operator+=(const mint& m){ x+=m.x; if(x>=MOD) x-=MOD; return *this; }
mint& operator-=(const mint& m){ ... | #include <iostream>
#include <vector>
#include<bits/stdc++.h>
#include <algorithm>
#include <math.h>
#include <string>
#include <iomanip>
#include <string.h>
using namespace std;
bool used[1009];
int main(){
long long t; cin>>t;
long long n; cin>>n;
for(int i=1; i<=100; i++){
used[i*(100+t)... |
#include <iostream>
#include <set>
#include <algorithm>
int main()
{
int N, M, tmp;
std::cin >> N >> M;
std::set<int> A, B, C, D, OUT;
for (int i = 0; i < N; i++)
{
std::cin >> tmp;
A.insert(tmp);
}
for (int i = 0; i < M; i++)
{
std::cin >> tmp;
B.insert... | #include <bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ll long long
#define ull unsigned long long
#define pi 2*acos(0.0)
#define readl(v,n) for(ll i=0;i<n;i++) {ll val; cin>>val; v.pb(val);}
#define readi(v,n) for(int i=0;i<n;i++) {int val;... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int> ;
#define rep(i,n) for(ll i=0;i<(n);i++)
ll min_ll(ll a,ll b){return a>=b ? b:a;}
ll max_ll(ll a,ll b){return a>=b ? a:b;}
int main(){
int n;
cin >> n;
ll a[n];
rep(i,n){
ll m;
cin >> m;
i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair <ll, ll> llll;
const int Maxn = 300005;
int n;
map <ll, ll> M;
ll res;
int main()
{
scanf("%d", &n);
llll cur = llll(0ll, 0ll);
M[cur.first - cur.second]++;
for (int i = 0; i < n; i++) {
int a; scanf("%d", &a);
if (i % 2 == 0) ... |
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define For(i, l, r) for (i = int64(l); i <= int64(r); i++)
#define Fo(i, n) For(i, 1, n)
#define Rof(i, r, l) for (i = int64(r); i >= int64... | #include<iostream>
using namespace std;
int P[20]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71};
long A,B;
long dp[1<<20];
main()
{
cin>>A>>B;
dp[0]=1;
for(long x=A;x<=B;x++)
{
int bit=0;
for(int i=0;i<20;i++)if(x%P[i]==0)bit|=1<<i;
for(int i=0;i<1<<20;i++)if(!(i&bit))
{
dp[i|bit]+=dp[i];
}... |
#include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ostream &operator<<(ostream &os, const... | #include<bits/stdc++.h>
using namespace std;
int main(){
long a, n, sum = 0, sumy = 0, amax = 0, ans = 0;
cin >> n;
for(int i = 1; i <= n; i++){
cin >> a;
amax = max(a, amax);
sum += a, sumy += sum;
ans = sumy + amax * i;
cout << ans << endl;
}
return 0;
} |
#include <bits/stdc++.h>
#include <fstream>
#include <bitset>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF=2147483647;
// 9,223,372,036,854,775,807
const ll INFL = 9223372036854775807;
bool func(const pair<ll,ll> &x,const pair<ll,ll> &y){
if(x.second<y.second) return true;
... | #include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
int mod = 1e9 + 7;
int mul(int a, int b) {
ll ans = a * 1ll * b;
return ans % mod;
}
int inv(int i) {
int temp = mod - 2;
int ans = 1;
while (temp) {
if (temp & 1) {
ans = mul(ans,... |
#include <iostream>
#include <set>
#include <string>
#include <vector>
int main() {
int n;
std::cin >> n;
std::string s, x;
std::cin >> s >> x;
std::vector<std::set<int>> dp(n+1);
dp[n] = {0};
for (int i = n - 1; i >= 0; --i) {
if (x[i] == 'A') {
for (int j {0}; j < 7; +... | #line 1 "/workspaces/compro/lib/template.hpp"
#line 1 "/workspaces/compro/lib/io/vector.hpp"
#include <iostream>
#include <vector>
#ifndef IO_VECTOR
#define IO_VECTOR
template <class T> std::ostream &operator<<(std::ostream &out, const std::vector<T> &v) {
int size = v.size();
for (int i = 0; i < size; i++) {
... |
/*
15
63 25 66 36 39 29 93 3 188 128 191 82 179 178 168
*/
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = (a); i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define endl '\... | //in dp prefix suffix sum helps..
#include<iostream>
#include<vector>
#include<string.h>
#include<algorithm>
#include<iomanip>
#include<cmath>
#include<stack>
#include <iterator>
#include <map>
#include<list>
#include <fstream>
#include<unordered_map>
#include<set>
#include<queue>
#define int long long
#define double ... |
#include <bits/stdc++.h>
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define rep(i, n) FOR(i,0,n)
#define irep(i, n) IFOR(i,0,n)
#define all(v) begin(v), end(v)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define forn(i,x,n) for(int i = x;i <= n;++i)
#define forr(i,x,n) for(int i = n;i >= x;--i)
#define Angel_Dust ios::sync_with_stdio(0);cin.tie(0)
const int N = 1005;
struct Node
{
string name;int h;
bool operator<(const Node& r) const
{
... |
#include <bits/stdc++.h>
#include <variant>
#define rep2(i,k,n) for(i64 i=(i64)(k);i<(i64)(n);i++)
#define rep(i,n) rep2(i,0,n)
#define all(x) begin(x),end(x)
#ifdef ENV_LOCAL
#define dump if (1) cerr
#else
#define dump if (0) cerr
#endif
using namespace std;
using namespace std::string_literals;
using i32 = int32_t... | #include <bits/stdc++.h>
#define REP(i, e) for(int (i) = 0; (i) < (e); ++(i))
#define FOR(i, b, e) for(int (i) = (b); (i) < (e); ++(i))
#define ALL(c) (c).begin(), (c).end()
#define PRINT(x) cout << (x) << "\n"
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const long long MOD = 1000000007;
ll N,... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 359; i < (int)(n); i++)
int main () {
int x,y;
cin >> x >> y;
if (x==y){cout<< x<<endl;
return 0;}
else {
cout <<3-x-y <<endl;
return 0;}
}
| #include<bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
int a,b,c;
cin>>a>>b;
if(a==1 &&b==0||a==0&&b==1)
cout<<2;
else if(a==b)
cout<<a;
else if(a==1 &&b==2||a==2 &&b==1)
cout<<0;
else
cout<<1;
}
|
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("O2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
////
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
#include <bits/stdc++.h>
#include <utility>
#define all(x) (x).begin(), (x).end()
#define allp(x) (x)->begin(), (x)->end... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
/*-----for personal-----*/
#define rep(i,a,b) for(int i=(a);i<(b);++i)
#define repn(i,n) rep(i,0,n)
/*-----for lib-----*/
#define REP(i, n) for (int i = 0; (i) < (int)(n); ++ (i))
#define REP3(i, m, n) for (int i = (m); (i) < (int)(n); ++ (i))
#def... |
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
using ld = long double;
using vld = vector<ld>;
using vb = vector<bool>;
#define rep(i, n) for ... | #include <bits/stdc++.h>
using namespace std;
const int P = 998'244'353;
using ll = long long;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
int a[n];
for (int &x : a) cin >> x;
sort(a, a + n);
ll s = 0, r = 0;
for (int i = 0; i < n; ++i) {
r += (s + a[i]) * a[i] % P;
s = ... |
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define int long long int
#define popcount(x) __builtin_popcountll(x)
#define fastio ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define sc second
#define pb push_back
#define fr first
#define all(a) (a).begin(),(a).end()
#define mem0(a) mems... | #include <bits/stdc++.h>
using namespace std;
#define MOD (long long int)(998244353)
#define ll long long int
#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define reps(i,n) for(int i=1; i<=(int)(n); i++)
#define REP(i,n) for(int i=n-1; i>=0; i--)
#define REPS(i,n) for(int i=n; i>0; i--)
#define FOR(i,a,b) for(int i=a... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,N) for(int i=0;i<int(N);++i)
#define rep1(i,N) for(int i=1;i<int(N);++i)
#define all(a) (a).begin(),(a).end()
#define bit(k) (1LL<<(k))
#define SUM(v) accumulate(all(v), 0LL)
typedef pair<int, int> i_i;
typedef pair<ll, ll> l_l;
template... | //#pragma GCC optimize ("O2")
//#pragma GCC target ("avx2")
#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cos... |
#include <bits/stdc++.h>
using namespace std;
using P = pair<int, long long>;
int main() {
long long n,m;
long long a,b,c,d;
cin >> n >> m;
vector<vector<long long>> data;
vector<vector<long>> path(n,vector<long>());
for(int i=0;i<m;i++) {
cin >> a >> b >> c >> d;
a--; b--;
data.push_back({a,b,... | //https://atcoder.jp/contests/abc188/tasks/abc188_d
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
typedef long long ll;
typedef long double ld;
const ll mod = 1e9 + 7;
int main ()
{
ios_base::sync_with_stdio (0); cin.tie (0); cout.tie (0);
ll n, c, ans = 0;
cin >> n >> c;
... |
#include<bits/stdc++.h>
#include<iostream>
#include<string>
#include<cmath>
#include<cstdio>
#include<cctype>
#include<cstring>
#include<iomanip>
#include<cstdlib>
#include<ctime>
#include<set>
#include<map>
#include<utility>
#include<queue>
#include<vector>
#include<stack>
#include<sstream>
#include<algorithm>
#define... | #include <bits/stdc++.h>
const int N = 200000;
int v[2*N + 5], n;
int main() {
scanf("%d", &n); for(int i=1;i<=(n<<1);i++) scanf("%d", &v[i]);
long long sum = 0;
std::priority_queue<int>que;
for(int i=n;i>=1;i--) {
que.push(v[n - i + 1]), que.push(v[n + i]);
sum += que.top(), que.pop();
}
printf("%lld\n"... |
///17571@nith.ac.in @Ankit Verma
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define MP make_pair
#define int long long
#define ll long long
#define inf 0x3f3f3f3f
#define MOD 1000000007
#defin... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
static const ll MOD = 1e9 + 7;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
int k;
cin >> s >> k;
vector<vector<ll>> dp(s.size(), vector<ll>(17));
set<char> st;
for (auto nc : {'1', '2', '3', '4', '5', '6', '7... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
void find_sum(vector<ll>& A, ll n, vector<ll>& v)
{
ll m=A.size();
for(ll i=0;i<n;i++)
{
ll sum=0,x=i,j=m-1;
while(x)
{
if(x&1)
sum+=A[j];
j--;
x/=2;
}
... | #include <bits/stdc++.h>
#include <map>
#include <iostream>
using namespace std;
typedef long long ll;
typedef long double ld;
#define BIG 2005
set<ll> solve(vector<ll> B, ll T){
set<ll> ans;
for(int i=0;i<B.size();i++){
if(B[i] > T) continue;
set<ll> add;
add.insert(B[i]);
fo... |
#include<bits/stdc++.h>
using namespace std;
typedef unsigned int ui;
typedef long long ll;
typedef unsigned long long ull;
#define rep(i,a,b) for(i=(a);i<=(b);++i)
#define per(i,a,b) for(i=(a);i>=(b);--i)
#define REP(i,a,b) for(i=(a);i< (b);++i)
#define PER(i,a,b) for(i=(a);i> (b);--i)
#define ERR(...) fprintf(stderr,... | #include<bits/stdc++.h>
using namespace std;
const int N=1e6+10;
int cnt[N];
int main() {
string s;
cin>>s;
int f=0;
int g=0;
int x=0;
if(s.size()==1) {
if(s[0]=='8') {
cout<<"Yes"<<endl;
return 0;
}
else {
cout<<"No"<<endl;
return 0;
}
}
else if(s.size()==2) {
int cur = s[0]-'0';
int ... |
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using db = double;
using ld = long double;
template<typename T> using... | #include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll mod=1e9+7;
int main()
{
int t;
scanf("%lld",&t);
while(t--)
{
ll a,b,c,ans=0;
scanf("%lld%lld%lld",&a,&b,&c);
if(a>=b+c){
ll res=(a-b-c+1)*(a-b-c+2)%mod;
ll num=2*(a-b+1)*(a-c+1)%mod-r... |
/**
* author: shu8Cream
* created: 26.04.2021 09:06:13
**/
#include <bits/stdc++.h>
#include <chrono>
using namespace std;
#define rep(i,n) for (int i=0; i<(n); i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using P = pair<int,int>;
using vi = vector<int>;
using vvi = vector<vi>;
using namespa... | #include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef vector<LL> VL;
typedef vector<VL> VVL;
typedef pair<LL, LL> PLL;
typedef vector<PLL> VP... |
#include <bits/stdc++.h>
#include <random>
using namespace std; typedef unsigned long long _ulong; typedef long long int lint; typedef pair<lint, lint> plint; typedef pair<double long, double long> pld;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define FOR(i, begin, end) for(lint i=(begin),... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int sz = 19, msz = 1 << sz;
int n, m, g[sz][sz], dp[msz];
bitset <msz> can;
int main() {
cin >> n >> m;
while(m--) {
int u, v;
scanf("%d %d", &u, &v);
u--, v--;
g[u][v] = g[v][u] = 1;
}
int lim = 1 << n;
c... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
vector<int> a;
int n;
long double f(long double x){
long double sum = 0;
for(int i = 0; i < n; i++){
sum += (x + a[i] - min(2 * x, (long double)a[i]));
// if(x == 1.5)
// cout << x << " " << a[i] << " " << min(2 * x, (long double)a[i]) << endl... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define P pair<int,int>
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(),v.end()
#define pb push_back
template<class T,class U>
inline bool chmax(T &a,U b){
if(a<b){
a=b;
return true;
... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int MAXN = 1e5, INF = 1e9;
int n, m, vis[MAXN], dis[17][17], gems[17];
vector<int> adj[MAXN];
int bfs(int start, int find) {
int dis = INF;
queue<pair<int, int>> q;
q.push({start, 0});
vis[start] = 1;
while(!q.empty()) {
auto curr = q.fro... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#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 ALL(v) (v).begin(),(v... |
#include <bits/stdc++.h>
#define przxct ""
#define fto(i,j,h) for (int i=j; i<=h; ++i)
#define maxn
#define ll long long
#define pi 3.141592653589
using namespace std;
string s;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> s;
int n = s.length();
s = "... | #include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<class T>
ostream &operator<<(... |
#include <bits/stdc++.h>
#define FOR(i, n) for(int i = 0; i < (n); ++i)
#define REP(i, a, b) for(int i = (a); i < (b); ++i)
#define TRAV(i, a) for(auto & i : (a))
#define SZ(x) ((int)(x).size())
#define X first
#define Y second
#define MP std::make_pair
#define PR std::pair
typedef long long ll;
typedef std::pair<int, ... | //LIBRARIES
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <fstream>
#include <cmath>
#include <algorithm>
#include <string>
#include <cstring>
#include <vector>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
#include <deque>
#include... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string a;
getline(cin, a ,'.');
cout << a;
return 0;
}
| #include <bits/stdc++.h>
using namespace std ;
int main(){
int n ;
cin >> n ;
if(n%100 == 0){
cout << 100 << endl ;
}else{
cout << 100 - (n%100) << endl ;
}
return 0 ;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
// For debug
// Ref: https://qiita.com/ysuzuki19/items/d89057d65284ba1a16ac
#define dump(var) do{std::cerr << #var << " : ";view(var);}while(0)
template<typename T> void vie... | #include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include <vector>
#include <queue>
#include <cmath>
#include <complex>
#include <functional>
#include <numeric>
#include <iomanip>
#include <cassert>
#include <random>
#include ... |
#include <bits/stdc++.h>
const int N = 3e5+5;
int n, q, t[N], a[N];
int ask(int x)
{
int y = 0;
for( ; x; x -= x&-x) y ^= t[x];
return y;
}
void add(int x, int y)
{
for( ; x <= n; x += x&-x) t[x] ^= y;
}
int main()
{
scanf("%d%d", &n, &q);
for(int i = 1; i <= n; ++i) scanf("%d", a+i), a[i] ^= a[... | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define f first
#define s second
#define pb push_back
#define eb emplace_back
#define mk make_pair
#define mt make_tuple
#define MOD 1000000007
#define fo(i,a,b) for(i=a;i<b;i++)
#define foe(i,a,b) for(i=a;i<=b;i++)
#define all(x) x.begin(), x.end... |
// Problem: B - RGB Matching
// Contest: AtCoder - NOMURA Programming Contest 2021(AtCoder Regular Contest 121)
// URL: https://atcoder.jp/contests/arc121/tasks/arc121_b
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include <bits/stdc++.h>
using namespace std;
usin... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 20;
int x[N], y[N], z[N];
int g[N][N];
int f[N][1 << N], n;
int get_dis(int a, int b) {
return abs(x[a] - x[b]) + abs(y[a] - y[b]) + max(0ll, z[b] - z[a]);
}
signed main() {
#ifndef ONLINE_JUDGE
freopen("E:\\in.txt", "r", stdin);
#endi... |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using Graph = vector<vector<int>>;
using ll = long long;
using P = pair<int, int>;
vector<bool> seen;
void dfs(const Graph &G, int v) {
seen[v] = true;
for (auto next_v : G[v]) {
if (seen[next_v]) continue;
... | #include<bits/stdc++.h>
#define forn(i,a,b)for(int i=(a),_b=(b);i<=_b;i++)
#define fore(i,b,a)for(int i=(b),_a=(a);i>=_a;i--)
#define rep(i,n)for(int i=0,_n=n;i<n;i++)
#define ll long long
#define pii pair<int,int>
#define m_p make_pair
#define pb push_back
#define fi first
#define se second
#define foreach(i,c) for(__... |
// #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
// using namespace atcoder;
// using ll = long long;
// int : -2**31 〜 2**31-1 (2**31=2147483648=2*10**9)
// long long : -2**63 〜 2**63-1 (2**63=9223372036854775808=9*10**18)
using P = pair<int,int>;
// #define int ll
... | #pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define double long double
#define rep(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define endl '\n'
#define ff first
#define ss sec... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr int Inf = 2000000030;
constexpr long long INF= 2000000000000000000;
template<typename T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; }
template<typename T> inline bool chmin(T &a, T b) { if (a > b) { a = b;... | //@Author: KeinYukiyoshi
// clang-format off
#include <bits/stdc++.h>
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx")
#define int long long
using namespace std;
#define stoi stoll
#define fi first
#define se second
#define rep(i, n) for(int i=0, i##_len=(n); i<i##_len; i++)
#define rep2(i, a, b) for (int i... |
//fake_name
#include<bits/stdc++.h>
using namespace std ;
#define int long long int
#define F first
#define S second
int MOD = 998244353 ;
int mod = 1e9 + 7 ;
int inf = 1e18 ;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
signed main()
{
ios_base::sync_with_stdio(false) ;
cin.... | #include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef long double ld;
/*
#include <chrono>
using namespace std::chrono;
#include <boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using nam... |
#include <bits/stdc++.h>
#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;
using ll = long long;
using P = pair<int, ll>;
int main() {
int n;
cin >> n;
vector<string> s(n);
vector<int> t(n);
rep(i,n){
cin >> s[i] >> t[i];
}
int mx = 0;
rep(i,n){... | #pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
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, 1, 1048576, stdin);
s = 0;
}
if(s == e){
return EOF;
}
r... |
///Bismillahir Rahmanir Rahim
#include "bits/stdc++.h"
#define ll long long
#define int ll
#define fi first
#define si ... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi=vector<int>;
int main() {
int N,K; cin>>N>>K;
vector<vector<ll>> T(N,vector<ll>(N));
for (int i = 0; i < N; i++){
for (int j = 0; j < N; j++){
cin>>T[i][j];
}
}
vi v;
fo... |
#include<bits/stdc++.h>
#define pi acos(-1)
#define ll long long
using namespace std;
void solve();
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int q=1;//cin... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define print(a) \
for (auto x : a) \
cout << x << " "; \
cout << endl
#define print_upto(a, n) \
for (ll i = 1; i <= n; i++) \
cout << a[i] << " "; \
cout << endl
#define take(a, n) ... |
#include <iostream>
#include <cstdio>
#include <vector>
#include <iomanip>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <map>
#include <set>
#include <cmath>
using namespace std;
using VLL = vector <long long>;
using VVLL = vector <VLL>;
long long gcd(long long a, long long b) {
... | #include <bits/stdc++.h>
#define ln '\n'
#define all(dat) dat.begin(), dat.end()
#define loop(i, to) for (__typeof(to) i = 0; i < to; ++i)
#define cont(i, to) for (__typeof(to) i = 1; i <= to; ++i)
#define circ(i, fm, to) for (__typeof(to) i = fm; i <= to; ++i)
#define foreac... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int M=2e5+1;
struct BIT{
ll bit[200004];
int dat[200004];
void init(){
for(int i=0;i<=M;i++)bit[i]=dat[i]=0;
}
void add(int id,int a,int b){
for(;id;id-=(id&-id))dat[id]+=a,bit[id]+=b;
}
ll got1(int id){
ll res=0;
for(;id<=M;id+=(id... | // Jai Shree Ram
#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define ook order_of_key
#define fb... |
#include<bits/stdc++.h>
#define For(i,j,k) for(int i=j;i<=k;++i)
#define Dow(i,j,k) for(int i=k;i>=j;--i)
#define ll long long
#define pb push_back
#define fir first
#define sec second
#define pb push_back
#define pa pair<int,int>
#define mk make_pair
using namespace std;
inline ll read()
{
ll ... | #include <cstdio>
#include <algorithm>
typedef long long LL;
const int Mod = 998244353;
const int MN = 3005;
int N, K, f[MN][MN];
int main() {
scanf("%d%d", &N, &K), N -= K;
f[0][0] = 1;
for (int i = 1; i <= N; ++i) {
f[i][0] = 0;
for (int j = 1; j <= i; ++j)
f[i][j] = (f[i][j - 1] + f[i - j][std::min(i - ... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int A;
cin >> A;
int B;
cin >> B;
cout << N - A + B << endl;
}
| #include<bits/stdc++.h>
typedef long long ll;
//forループ
//引数は、(ループ内変数,動く範囲)か(ループ内変数,始めの数,終わりの数)、のどちらか
//Dがついてないものはループ変数は1ずつインクリメントされ、Dがついてるものはループ変数は1ずつデクリメントされる
#define REP(i,n) for(ll i=0;i<ll(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=ll(b);i++)
#define FORD(i,a,b) for(ll i=a;i... |
#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define pb emplace_back
#define mp make_pair
#define fi first
#define se second
#define all(v) v.begin(),v.end()
#define run ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);cerr.tie(0);
#define mod 1000000007
#define decimal(k) cout<<fixed... | // Etavioxy
#include<cstdio>
#include<cctype>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cmath>
#define il inline
#define ll long long
#define rep(i,s,t) for(register int i=(s);i<=(t);i++)
#define rev_rep(i,s,t) for(register int i=(s);i>=(t);i--)
#define each(i,u) for(int i=head[u];i;i=bow[i].nxt... |
#include <bits/stdc++.h>
using namespace std;
const int nax = 805;
int n, k, a[nax][nax];
int sum[nax][nax];
int main() {
cin >> n >> k;
for(int i = 1; i <= n; i += 1)
for(int j = 1; j <= n; j += 1)
cin >> a[i][j];
int L = 0, R = 1e9;
while(L < R) {
int M = (L + R + 1) / 2... | #include<bits/stdc++.h>
using namespace std;
#define GODSPEED ios:: sync_with_stdio(0);cin.tie(0);cout.tie(0);cout<<fixed;cout<<setprecision(15);
#define f first
#define s second
#define newl cout<<"\n";
#define pb push_back
#define mset(a,x) memset(a,x... |
#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>;
template<class T> using V=vector<T>;
template<class T,class U... | #include <bits/stdc++.h>
#define int long long int
#define all(x) x.begin(), x.end()
#define send ios_base::sync_with_stdio(false);
#define help cin.tie(NULL)
#define inf (int)(1e17+1)
#define mod (int)(998244353)
#define N (int)(2e5+5)
#define fi first
#define se second
#define endl "\n"
#define double long double
#de... |
#include<bits/stdc++.h>
using namespace std;
#define rg register
#define In inline
#define ll long long
#define rep(i,l,r) for(rg int i = (l);i <= (r);i++)
#define dwn(i,r,l) for(rg int i = (r);i >= (l);i--)
#define mp make_pair
#define fi first
#define se second
const int N = 2e5;
namespace IO{
In ll read(){
ll... | #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 <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iostream>
#include <vector>
#include <unordered_set>
#include <unordered_map>
#include <memory>
#include <list>
#include <deque>
#include <queue>
#include <iomanip>
#include <stack>
#include <string.h>
using namespace std;
#define RE... | #include <iostream>
using namespace std;
#define ll long long
const ll mod = 1e9 + 7;
const ll MAX = 2e5 + 1;
ll t;
ll power(ll x, ll p) {
ll ans = 1;
while (p) {
if (p & 1) {
ans = (ans * x) % mod;
p--;
}
x = (x * x) % mod;
p >>= 1;
}
return ans;
}
ll add(ll x, ll y) { return (... |
#include <math.h>
#include <iostream>
#include <string>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <cmath>
#include<set>
#include <sstream>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(a) (a).begin(),(a).end()//配列を全部参照
using namespace std;
using ll = long long int;
//vector... | /*{{{ #include */
#include <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <map>
#include <tuple>
#include <algorithm>
#include <utility>
#include <cmath>/*}}}*/
/*{{{ namespace R2357 */
namespace R2357 {
inline void IN(void){return;}
te... |
#include <bits/stdc++.h>
#if MYDEBUG
#include "lib/cp_debug.hpp"
#else
#define DBG(...) ;
#endif
#if __cplusplus <= 201402L
template <typename T>
T gcd(T a, T b) { return ((a % b == 0) ? b : gcd(b, a % b)); }
template <typename T>
T lcm(T a, T b) { return a / gcd(a, b) * b; }
#endif
using LL = long long;
constexpr LL ... | #include<bits/stdc++.h>
#define Pair pair<ll,int>
#define ar array
#define ll long long
#define ull unsigned long long
#define pb push_back
using namespace std ;
const ll LLMAX = 9223372036854775807;
const int INF = 1e9;
struct Exp{
long double a, b;
};
Exp operator +(Exp x, Exp y){
return {x.a+y.a, x.b+y.b... |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(v) v.begin(), v.end()
template<class T>bool chmax(T& a, const T& b) { if (a<b) { a=b; return 1;} return 0;}
template<class T>bool chmin(T& a, const T& b) { if (b<a)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pi;
//bool vis[1000];
int x[]={1,-1,0,0};
int y[]={0,0,1,-1};
//int f=0;
//int t[500000];
//int ll[500000];
//"'';
int main(){
int r,c,n,m;
cin>>r>>c>>n>>m;
int dp[r][c][4];
memset(dp,0,sizeof(dp));
vector<vector<int> > v(r,vect... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
ll N, K;
cin >> N >> K;
vector<ll> a(N), b(N, 0);
rep(i, N) {
cin >> a[i];
b[a[i]]++;
}
b[0] = min(b[0], K);
rep(i, N - 1) b[i + 1] = min(b[i], b[i... | #include <bits/stdc++.h>
using namespace std;
//TEMPLATE
#define len(a) (ll) a.size()
#define ms(a, x) memset(a, x, sizeof a)
#define bitcount(n) __builtin_popcountll(n)
#define FR ios_base::sync_with_stdio(false);cin.tie(NULL)
#define cin1(a) cin >> a
#define cin2(... |
#include<bits/stdc++.h>
using namespace std;
#define For(i,a,b) for(int i=(a),(i##i)=(b);i<=(i##i);++i)
#define Rep(i,n) for(int i=0,(i##i)=(n);i<(i##i);++i)
#define Fodn(i,a,b) for(int i=(a),(i##i)=(b);i>=(i##i);--i)
#define pln puts("")
#define il inline
#define ff first
#define ss second
using LL=long long;using u32... | #include<bits/stdc++.h>
#define l long
#define ll long long
#define ld long double
#define MOD 1000000007
#define MAX_N 1000006
#define f first
#define s second
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
using namespace std;
const ll inf=1e18;
ll gcd(ll a,ll b){
if(a==0){
... |
#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
... | //@formatter:off
#include<bits/stdc++.h>
#define overload4(_1,_2,_3,_4,name,...) name
#define rep1(i,n) for (ll i = 0; i < ll(n); ++i)
#define rep2(i,s,n) for (ll i = ll(s); i < ll(n); ++i)
#define rep3(i,s,n,d) for(ll i = ll(s); i < ll(n); i+=d)
#define rep(...) overload4(__VA_ARGS__,rep3,rep2,rep1)(__VA_ARGS__)
#defi... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
string s;
char a, b;
cin >> n >> s;
a = s[0];
b = s[s.length()-1];
bool ok = false;
for(int i=1; i<s.length(); i++){
if(s[i]!=a && s[i+1]!=b) ok= true;
}
if(a!=b) cout << "1";
else if(ok) cout << "2";
else cout << "-1";
return 0;
}
| #include <bits/stdc++.h>
#include <climits>
using namespace std;
template<class T>
using V = vector<T>;
template<class T>
using VV = V<V<T>>;
using ld = long double;
#define ll long long
using ull = unsigned ll;
using PLL = pair<ll, ll>;
using VLL = V<ll>;
using VB = V<bool>;
using VVB = VV<bool>;
using VVLL = VV<ll... |
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds; //required
using namespace std;
template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define fast ios_base::sync_with_stdio(... | #include <bits/stdc++.h>
using namespace std;
using lli = int64_t;
using ld = long double;
lli g = 10000;
lli dist(lli x1, lli y1, lli x2, lli y2)
{
return (x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2);
}
lli bsearch(lli x, lli y, lli r, lli y1, lli l, lli h, bool fl)
{
lli ans = LLONG_MAX;
while (l <=... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
void solve(){
int n;
string a,b,c;
cin>>n;
cin>>a>>b>>c;
for(int i=1;i<=n;i++) cout<<0;
for(int i=1;i<=n;i++) cout<<1;
cout<<0<<"\n";
}
int main(){
int t=1;
cin>>t;
for(int tc=1; tc<=t; tc++){
solve();
}
retur... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll; //int:2*10**9
typedef long double ld;
typedef pair<ll,ll> P;
#define REP(i,n) for(ll i = 0; i<(ll)(n); i++)
#define FOR(i,a,b) for(ll i=(a);i<=(b);i++)
#define FORD(i,a,b) for(ll i=(a);i>=(b);i--)
#define pb push_back
#define MOD 1000000007 //998244353... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define endl "\n"
#define mod 1000000007
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n - 1; i >= 0; i--)
void solve()
{
int n;
cin >> n;
ve... | #include <stdio.h>
int N, Ans;
int d[1500][2];
int main() {
int i, u, Max;
scanf("%d", &N);
for (i = 0; i < N; i++) scanf("%d%d", &d[i][0], &d[i][1]);
Ans = d[0][0] + d[0][1];
for (i = 0; i < N; i++) Ans = ((Ans < d[i][0] + d[i][1]) ? Ans : d[i][0] + d[i][1]);
for (i = 0; i < N; i++) for (u = 0; u < N; u++) i... |
#include<bits/stdc++.h>
#define N 505
#define ll long long
#define inf 0x3f3f3f3f
using namespace std;
bool mmp1;
int n,m,K;
namespace P100 {
int C[N][N];
int A[N],B[N];
int D[N][N];
void solve() {
scanf("%d",&n);
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
scanf("%d",&C[i][j]);
for(int i=1;i<=n;i++)
... | #include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
using ll=long long;
using ld=long double;
//using mint = modint1000000007;
#define rep(i,n) for (ll i=0; i<n; ++i)
#define all(c) begin(c),end(c)
#define PI acos(-1)
#define oo 2e18
template<typename T1, typename T2>
bool ... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
ll gcd(ll x, ll y) {
if (y == 0) return x;
return gcd(y, x % y);
}
int main() {
int prime[20] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71};
int N;... | #include <iostream>
#include<vector>
#include<algorithm>
#include<math.h>
#include<map>
#define f first
#define s second
using namespace std;
vector<pair<int,int> > e(60);
vector<int> num;
bool cmp(pair<int,int> a,pair<int,int> b){
if(a.first==b.first) return a.second<b.second;
return a.first>b.first;
}
int mai... |
#include <bits/stdc++.h>
using namespace std;
//#define MULTITEST
#define x first
#define y second
#define mp make_pair
#define pb push_back
#define sqr(a) ((a) * (a))
#define sz(a) int(a.size())
#define all(a) a.begin(), a.end()
#define forn(i, n) for(int i = 0; i < int(n); i++)
#define fore(i, l, r) for(int i ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll solve() {
ll N, M;
cin >> N >> M;
vector<ll> L(N), R(N);
if ( N == 1 ) {
if ( M != 0 ) return -1;
cout << 1 << " " << 2 << "\n";
return 0;
}
if ( M > N-2 ) return -1;
if ( M < 0 ) return -1;
f... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.