code_file1 stringlengths 87 4k | code_file2 stringlengths 85 4k |
|---|---|
#include<bits/stdc++.h>
#define int long long
using namespace std;
int b,c,ans;
signed main()
{
scanf("%lld%lld",&b,&c);
int que=c/2,ko=(c-1)/2,ko2=(c-2)/2;
// b=abs(b);
int l1=b-que,r1=b+ko2;
int l2=-b-ko,r2=-b+ko;
if(l1<=r2) printf("%lld\n",max(r1,r2)-min(l1,l2)+1);
else printf("%lld\n",r1-l1+1+r2-l2+1);
retu... | #include <iostream>
#include <vector>
#include <array>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <string>
#include <sstream>
#include <algorithm>
#include <random>
#include <cstdio>
#include <cstdlib>
#in... |
#include <bits/stdc++.h>
using namespace std;
short M, H;
int main()
{
cin>>M>>H;
if(H%M) cout<<"No\n";
else cout<<"Yes\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
int main() {
ll A, B;
cin >> A >> B;
if(B % A == 0) {
cout << "Yes";
}
else {
cout << "No";
}
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long ;
int main(){
int a;
cin >> a;
if(a >= 0) cout << a << endl;
else cout << 0 << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define fastio() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define test() int t;cin>>t;for(int test=1;test<=t;test++)
#define pb push_back
#define nl cout<<"\n"
#define all(x) x.begin(... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define MN LLONG_MIN
#define MX LLONG_MAX
#define UL ULLONG_MAX
#define pb push_back
#define e "\n"
#define iff(u,v) if(abs(u-v)<1e-9)
#define vi vector<long long>v,v1,v2;
#define pi 3.1415926536
#define fix cout<<fixed; cout<<setprecision(10);
#define ... | #include<bits/stdc++.h>
using namespace std;
#define ff first
#define brn "\n"
#define ss second
#define mk make_pair
#define int long long
#define pb push_back
#define ps(x,y) fixed<<setprecision(y)<<x
#define w(x) ... |
#include <bits/stdc++.h>
#define task "triangles"
#define pb push_back
#define pll pair<ll, ll>
#define pii pair< pll, ll>
#define fi first
#define se second
using namespace std;
using ll = long long;
using ld = long double;
const int N = 2e5+5;
const ll mod = 1e5;
const ll ex = 1e5;
ll n, m, t, k, tong, a[N][5], b[N... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repp(i, st, en) for (ll i = (ll)st; i < (ll)(en); i++)
#define repm(i, st, en) for (ll i = (ll)st; i >= (ll)(en); i--)
#define all(v) v.begin(), v.end()
void c... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,j,n) for(ll i=j;i<n;i++)
#define scn(a) scanf("%lld",&a)
#define scns(a,b) scanf("%lld %lld",&a,&b)
#define print(a) printf("%lld\n",a)
#define vec vector<ll>
#define pb push_back
#define pair... | ///====================== TEMPLATE STARTS HERE =====================///
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define pb push_back
#define MP make_pair
#define ff first
#define ss second
#define ABS(x) ((x)<0?-(x):(x))
#define FABS(x) ((x)+eps<0?-(x):(x))
#define LCM(x,y) (((x)/gcd((x),(y)))*... |
#include "iostream"
using namespace std;
#include "string"
#include "vector"
#include "unordered_set"
#include "map"
#include "stack"
#include "algorithm"
#include "queue"
#define int long long
#define pi pair<int,int>
#define ff first
#define ss second
#define boost ios::sync_with_stdio(false);cin.tie(nullptr)
#define... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for(int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005
int GCD(int x, ... |
#include <bits/stdc++.h>
#define MAX_N (200000 + 5)
#define LL long long
using namespace std;
const int mod = 998244353;
int n, m;
int inv[MAX_N];
int p[MAX_N], tot;
bool is[MAX_N];
int pw[MAX_N], f[MAX_N];
int main() {
scanf("%d%d", &n, &m);
inv[1] = 1;
for (int i = 2; i <= m; ++i) inv[i] = (LL)(mod - mod / i) * in... | #include<bits/stdc++.h>
using namespace std;
long long int MOD = 998244353;
long long int power(long long int b, long long int e) {
if (e == 0)
return 1;
long long int temp = power(b, e / 2);
if (e % 2 == 0)
return temp * temp % MOD;
return (temp * temp) % MOD * b % MOD;
}
long long i... |
#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
const double pi = acos(-1);
int n, xa, ya, xb, yb;
struct Point{
double x, y;
Point(double x = 0, double y = 0):x(x),y(y){}
};
typedef Point Vector;
Vector Rotate(Vector A, double rad){//radไธบๅผงๅบฆ ไธไธบ้ๆถ้ๆ่ฝฌ็่ง
return Vector(A.x*cos(ra... | #include <bits/stdc++.h>
#define ull unsigned long long
#define int long long
#define ll long long
#define fr(i, n) for (int i = 0; i < n; i++)
#define frf(i, j, n) for (int i = j; i <= n; i++)
#define frd(i, n) for (int i = n; i >= 0; i--)
#define mp(i, j) make_pair(i, j)
#define pb(x) push_back(x)
#define INF 1e18
#d... |
#include<stdio.h>
#include<string.h>
// helpful functions
#define fl(i,n) for(int i = 0; i < n; i++)
#define fls(i,a,b) for(int i = a; i <= b; i++) // flexible for loop
#define fls2(i,a,b) for(int i = a; i >= b; i--) // flexible for loop 2
#define afl(i,a,n) int a[n]; for(int i = 0; i < n; i++) scanf("%d", &a[i])
// ... | #include<cstdio>
#include<cstring>
using namespace std;
typedef long long ll;
int a[20],b[110],n;bool bk[20];ll Ans=5e18;
void dfs(int k){
if(k>15){
bool PD=true;
for(int i=1;i<=n;i++){
bool pd=false;
for(int j=1;j<=15;j++)
if(bk[j]&&b[i]%a[j]==0) {pd=true;break;}
if(!pd) {PD=false;break;}
}
if(PD... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N;
cin >> N;
ll M = floor(sqrt(N));
vector<bool> isExp(M+1, true);
ll cnt = 0;
isExp[0] = false;
for (ll i=2; i<=M; i++) {
if (isExp[i]) {
for (ll j=2; pow(i,j)<=N; j++) {
... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
ll n;
cin >> n;
set<ll> s;
for (ll a = 2; a*a <= n; ++a){
ll x = a*a;
while (x <= n) {
s.insert(x);
x *= a;
}
}
cout << n-s.size()... |
// YATIN KWATRA
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize ("Ofast")
#define ll long long
#define ar array
#define sz(v) (int)(v.size())
#define inf ... | #include <bits/stdc++.h>
using namespace std;
#define M 1005
#define LL long long
const LL mod = 1000000007;
int n;
LL f[M];
char Caa, Cab, Cba, Cbb;
inline LL qkpow (LL x, LL y){
LL res = 1;
while (y){
if (y & 1)
res = res * x % mod;
x = x * x % mod;
y >>= 1;
}
return res;
}
signed main (){
scanf ("%d... |
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ll long long
#define pii pair<ll,ll>
#define vi vector<ll>
#define mii map<ll,ll>
#define pqi ... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... |
#include <cmath>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define ll long long
using namespace std;
const int maxn=2e5+10;
const int mod=998244353;
int n,ans=1,now,f[maxn],v[maxn];
int read(int x=0,bool f=0,char ch=getchar()){
for(;ch<'0' || ch>'9';ch=getchar()) f=ch=='-';
for(;ch>='0'&&ch<='9';ch... | #include <bits/stdc++.h>
using namespace std;
template <int MOD>
struct ModInt {
int _v;
ModInt(int64_t v = 0) {
if (v < 0) v = v % MOD + MOD;
if (v >= MOD) v %= MOD;
_v = int(v);
}
ModInt(uint64_t v) {
if (v >= MOD) v %= MOD;
_v = int(v);
}
ModInt(int v) : ModInt(int64_t(v)) {}
Mo... |
#include <bits/stdc++.h>
using namespace std;
int N, a[505];
void solve() {
cin >> N;
for (int i = 1; i <= N; i++) cin >> a[i];
vector<int> ans;
for (int stp = 1; stp <= N * N; stp++) {
bool flg = 1;
for (int i = 2; i <= N && flg; i++) flg &= a[i - 1] < a[i];
if (flg) break;
int cur = (stp & 1) ? 1 : 2;
f... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
//#include <atcoder/convolution>
//#incl... |
#ifdef __LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
using PIL = pair<int,ll>;
using PLI = pair<ll,int>;
using PLL = pair<ll,ll>;
using Graph = vector<vector<int>>;
using Cost_Graph = vector<vector<PIL>>;
template<class T> bool chmin(... | #include <iostream>
#include <vector>
int main()
{
for (int query = 0; query < 1000; query++)
{
int si, sj, ti, tj;
std::cin >> si >> sj >> ti >> tj;
for (int i = 0; i < std::max(si - ti, 0); i++)
{
std::cout << 'U';
}
for (int i = 0; i < std::max(ti ... |
#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;
#define enviar {io... | //Utkarsh.25dec
#include <bits/stdc++.h>
#include <chrono>
#include <random>
#define ll long long int
#define ull unsigned long long int
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define rep(i,n) for(ll i=0;i<n;i++)
#define loop(i,a,b) for(ll i=a;i<=b;i++)
#define vi vector <int>
#define vs vecto... |
/* ๏ฟฝ Ashiq Uddin Pranto
Department of Computer Science and Engineering
BATCH 27
University Of Rajshahi,Bangladesh
*/
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define FOR(x,y) for(ll i=x;i<=y;i++)
#define pb(x) push_back(x)
#define mp make_pair
#define pii pair<int,int>
#define pll ... | //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 <map> //
#include <random> //
#include <ctime> //
#include <bitset> //
#include <cassert>... |
//abc185 b
#include <bits/stdc++.h>
#include <string>
using namespace std;
int main() {
int n,m,t;
cin >> n >> m >> t;
int last_time = 0;
int max = n;
string ans = "Yes";
for(int i=0 ; i<m ; i++){
int a,b;
cin >> a >> b;
n -= a-last_time;
if(n < 1){
... | #include <bits/stdc++.h>
using namespace std;
using P=pair<int64_t,int>;
int main(){
int N,K;
cin >> N >> K;
vector<P> vp;
for(int i=0;i<N;i++){
int64_t A;
int B;
cin >> A >> B;
vp.emplace_back(A,B);
}
sort(vp.begin(),vp.end());
int64_t m=K;
for(int i=0;... |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
typedef long long ll;
const int maxn=2e5+5;
ll p[maxn];
bool cmp(ll a,ll b){
return a>b;
}
int main(){
int n;
cin>>n;
ll sum=0;
for(int i=0;i<n;i++){
ll a,b;
cin>>a>>b;
sum+=a;
p[i]=2*a+... | #include <bits/stdc++.h>
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define reprrev(i, a, b) for (int i = b - 1; i >= a; i--) // [a, b)
#define reprev(i, n) reprrev(i, 0, n)
#define _GLIBCXX_DEBUG
using ll = long long;
using ull = unsigned long long;
template <class... |
/* What we know is a drop , but what we don't know is an ocean !*/
#include <bits/stdc++.h>
#define ll long long int
#define F(i,j,k,in) for(int i=j;i<k;i+=in)
#define DF(i,j,k,in) for(int i=j;i>=k;i-=in)
#define feach(it,l) for (auto it = l.begin(); it != l.end(); ++it)
#define fall(a) a.begin(),a.end()
#define sz(x)... | #include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define MOD 1000000007
//#define MOD 998244353
#define INF 1000000010000
#define EPS 1e-9
#define F first
#define S second
#define debug(x) cout<<x<<endl;
#define repi(i,x,n) for(int i=x;i<n;i++)
#define rep(... |
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <numeric>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <regex>
#include <complex>
using namespace std;
#define all(v) v.begin(),v.end... | #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... |
//ใใใใฐ็จใชใใทใงใณ๏ผ-fsanitize=undefined,address
//ใณใณใใคใฉๆ้ฉๅ
#pragma GCC optimize("Ofast")
//ใคใณใฏใซใผใใชใฉ
#include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
// using namespace atcoder;
typedef long long ll;
using vint = vector<int>;
using vll = vector<ll>;
using vs = vector<string>;
using vbool = vector<bo... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (ll i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define sz(x) (int)(x).size()
#define pb push_back
using ll = long long;
using ld=lon... |
/*
@Author
Sujeet Kushwaha
*/
#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 ll long long int
#define fast ios_base::sync_with_stdio(false)
#define fast_input cin.tie(NULL)
#define fast_output cout... | #include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <climits>
#include <string>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <ctime>
#include <cassert>
#include <fstream>
#include <stack>
#include <random>
#include <i... |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c;
cin>>a>>b>>c;
cout<<21-a-b-c<<endl;
return 0;
} | //#pragma GCC target ("avx2")
//#pragma GCC optimization ("O3")
//#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define forr(i,n) for(int i=0;i<n;i++)
#define f(i,a,b) for(ll i=a;i<b;i++)
#define fi first
#define se second
#define pb push_back
//#defin... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int inf = 1001001001;
ll INF = 1001001001001001001;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define rep(i, n) FOR(i, 0, n)
#define all(x) x.begin(), x.end()
#define pb push_back
#define pf push_front
ll MOD = 1000000007;
using P = pair... | #include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=200005;
int n,m,k,a[N],b[N],c[N],sa[N],sb[N];
vector<int>e[N];
void dfs(int u)
{
sa[c[u]]+=a[u];
sb[c[u]]+=b[u];
for(auto v:e[u])
{
if(!c[v])
{
c[v]=c[u];
dfs(v);
}
}
}
signed main()
{
ios::sync_with_stdio(false);
cin>>n>>... |
#include <math.h>
#include <assert.h>
#include <vector>
#include <numeric>
#include <iostream>
#include <algorithm>
#include <functional>
template <typename T1, typename T2>
std::istream& operator>>(std::istream& is, std::pair<T1, T2>& v) {
return is >> v.first >> v.second;
}
template <typename T>
std::istream& ... | #include<bits/stdc++.h>
#define int long long
using namespace std;
const int MOD=998244353;
signed main() {
int a,b,c;
cin>>a>>b>>c;
int A=a*(a+1)/2,B=b*(b+1)/2,C=c*(c+1)/2;
A%=MOD,B%=MOD,C%=MOD;
cout<<((A*B)%MOD*C)%MOD;
return 0;
}
|
#include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <random>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define repp(i,n,m) for (int i = m; i < (n); ++i)
#define repl(i,n) for (long long i = 0; i < (n); ++i)
#defin... | #include<cmath>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
#define ch() getchar()
#define pc(x) putchar(x)
template<typename T>inline void read(T&x){
int f;char c;
for(f=1,c=ch();c<'0'||c>'9';c=ch())if(c=='-')f=-f;
for(x=0;c<='9'&&c>='0';c=ch())x=x*10+(c&15);x*=f;
... |
#include <bits/stdc++.h>
template<class T> inline bool chmin(T&a, T b){if(a > b){a = b; return true;}else{return false;}}
template<class T> inline bool chmax(T&a, T b){if(a < b){a = b; return true;}else{return false;}}
#define ll long long
#define double long double
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i... | #include <bits/stdc++.h>
using namespace std;
//---------------- ๅฎๆฐ ----------------
// [X_MIN, X_MAX], [Y_MIN, Y_MAX]
#define X_MIN 0
#define X_MAX 29
#define Y_MIN 0
#define Y_MAX 29
#define QUERY 1000
// -------- util function --------
int rand_int(){
static unsigned long long x=123456789, y=362436069, z=521... |
#include <string>
#include <iostream>
#include <stack>
#include <queue> // priority_queue ใๅ
ฅใฃใฆใ
#include <set> // ่ฆ็ด ๆฐใฏ size() ใงๅๅพ multisetใใใ
#include <map>
#include <array> // sizeใฏใณใณใใคใซๆๅฎๆฐใงๅบๅฎ
#include <vector>
#include <numeric> // accumulate, gcd
#include <algorithm> // count_ifใซๅฟ
่ฆ
#include <iomanip> // cout <... |
//#include <atcoder/maxflow.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#include <iostream>
#include <map>
#include <list>
#include <set>
#include <algorithm>
#include <vector>
#include <string>
#include <functional>
#include <queue>
#include <deque>
#include <stack>
#incl... |
#include <bits/stdc++.h>
using namespace std;
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
s... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
void solveA() {
int n;
cin>>n;
int tax=1.08*n;
if(tax<206) cout<<"Yay!"<<endl;
else if(tax==206) cout<<"so-so"<<endl;
else cout<<":("<<endl;
}
ll Nat(ll n) {
return (n*(n+1))/2;
}
void solveB() {
ll n;
... |
#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 <stdio.h>
int main()
{
double sx,sy,gx,gy;
double a, b, ans;
scanf("%lf %lf %lf %lf", &sx, &sy, &gx, &gy);
a = -((gy + sy) / (gx - sx));
b = sy - a * sx;
ans = -b / a;
printf("%lf", ans);
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define pii pair<int,int>
#define vi vector<int>
#define vpii vector<pii>
#define pll pair<ll,ll>
#define vll vector<long long>
#define f first
#define s second
long long mod = 1e9+7;
typedef vector<map<char,int>> vmci;
... | #include <iostream>
#include <string.h>
using namespace std;
int main()
{
int size, intial = 0;
char s;
cin >> size >> intial;
for (int i = 0;i < size;i++)
{
cin >> s;
if (s == 'o')
{
intial++;
}
else if (s == 'x')
{
if (intial != 0)
{
intial--;
}
}
}
cout << intial << endl;
retur... |
//#pragma GCC target("avx512f,avx512dq,avx512cd,avx512bw,avx512vl")
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define DB double
#define LD long double
#define ST string
#define BS bitset
#define PA pair<LL... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define _USE_MATH_DEFINES
#define _MATH_DEFINES_DEFINED
using namespace __gnu_pbds;
using namespace std;
template<class T> using oset =tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
#d... |
#include<iostream>
#include<bits/stdc++.h>
#define m_p make_pair
#define fi first
#define se second
#define pb push_back
typedef long long ll;
#define f(i,n) for(ll i=0;i<n;i++)
#define f1(i,n) for(ll i=1;i<=n;i++)
#define crap ios_base::sync_with_stdio(0); cin.tie(0);cout.tie(0)
using namespace std;
#define INF 1000... | #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdlib>
#include<queue>
#include<set>
#include<cstdio>
#include<map>
#include<cassert>
using namespace std;
#define ll long long
#define reps(i, a, b) for(int i = a; i < b; i++)
#define rreps(i, a, b) for(int i = a-1; i >= b; i--)
#def... |
#include <bits/stdc++.h>
using namespace std;
const int N=2e5+10;
int A[N];
int main()
{
int n;
cin>>n;
for(int i=0; i<n; i++)
cin>>A[i];
int ans = 1<<30;
for(int bit=0; bit< (1<<(n-1)); bit++)
{
int o = 0, x = 0;
for(int j=0; j<n; j++)
{
o |= A[j];
if(bit>>j & 1 || j == n-1)
x ^= o, o = 0... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define f1 first
#define s2 second
#define fastio ios :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define debug(x) cerr << "[" << #x << "]: " << x << "\n";
using ll = long long;
using ld = long double;
using ii = pair<int, in... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
main()
{
int a[3];
cin>>a[0]>>a[1]>>a[2];
sort(a,a+3);
cout<<(a[2]+a[1]);
}
| #include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<util... |
#define rep(i, n) for (int i = 0; i < n; i++)
#define All(a) a.begin(), a.end()
#define us unordered_set
#define eb emplace_back
#define pb push_back
#define ll long long
#define vt vector
#define mod 1000000007
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vt<vt<int>> c(n, ... | #include <bits/stdc++.h>
//#include <chrono>
//#pragma GCC optimize("O3")
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 ve... |
#include <iostream>
#include <cmath>
#include <vector>
#include <cstdio>
#include <iomanip>
#include <algorithm>
#include <algorithm>
using namespace std;
int main() {
int n,m,q;
cin>>n>>m>>q;
vector<pair<int,int>> cargos_base;
for(int i=0;i<n;i++){
int buf_w,buf_v;
cin>>buf_w>>buf_v;
std::pair<int,int> p ... | #include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
typedef long long ll;
typedef long double ld;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define mod 1000000007
#define pii pair<ll,ll>
#define inf 1000000000000000000
#define bpc(x) __... |
#include <bits/stdc++.h>
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int t;
std::cin >> t;
while (t--) {
int n;
std::cin >> n;
std::vector<int> a(n);
for (int i = 0; i < n; ++i) std::cin >> a[i];
if (n % 2 == 1) {
st... | #include<bits/stdc++.h>
using namespace std;
const long long int MOD = 998244353;
void solve() {
int n; cin >> n;
vector<int> a(n);
long long int sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
if (sum % 2) {
cout << 0;
return;
}
vector<long l... |
#include <iostream>
#include <bits/stdc++.h>
#include <string>
#include <algorithm>
#include <cmath>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int) n ; i++)
int main(){
int a,b,c;
cin >> a >> b >> c;
int min = a;
if(b < min) min = b;
if(c < min) min = c;
... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a[4] = {0};
for(int i=0;i<3;i++) cin >> a[i];
sort(a+0,a+3);
cout << a[2] + a[1];
} |
/*
Created by: Amit Kumar at 22:29 on 16 Mar 21
*/
#include <bits/stdc++.h>
#ifdef LOCAL
#include "debug.h"
#else
#define db(...)
#endif
using namespace std;
#define ll long long
#define mod 1000000007
#define S(x, n) memset(x, n, sizeof(x));
#define pb(x) push_back(x)
#define all(x) x.begin(), x.end()
#define NIL -1... | /*
Author: Nguyen Tan Bao
Status:
Idea:
*/
#include <bits/stdc++.h>
#define FI first
#define SE second
#define ALL(a) a.begin(), a.end()
#define SZ(a) int((a).size())
#define MS(s, n) memset(s, n, sizeof(s))
#define FOR(i,a,b) for (int i = (a); i <= (b); i++)
#define FORE(i,a,b) for (int i = (a); i >= (b);... |
#include <bits/stdc++.h>
#include <iostream>
#include <limits>
#include <numeric>
#include <type_traits>
#include <bitset>
using namespace std;
#define rep(i,n,m) for(ll (i)=(n);(i)<(m);(i)++)
#define rrep(i,n,m) for(ll (i)=(n);(i)>(m);(i)--)
using ll = long long;
const ll mod = 998244353;
void bitadd(ll a,ll w, v... | #include <iostream>
const int M = 998244353;
int dp[3005][3005];
int main()
{
int n, m, i, j, k;
while (scanf("%d%d", &n, &m) == 2)
{
// dp[i][j] different ways of collecting total value j with i things
// dp[i][j] = dp[i][j*2] + dp[i-1][j*2-1*2] + ... + dp[0][j*2-i*2]
dp[0][0] = 1;
for (i=1; i<=n; i++)
... |
#include <iostream>
#include <utility>
#include <algorithm>
#include <unordered_map>
using namespace std;
int main(void)
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
unordered_map<int, pair<int, int>> dp;
int N, K;
cin >> N >> K;
while (K > 0)
{
if (dp.find(N) != dp.end())
N ... | #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>
#i... |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define sz size()
#define ll long long
#define all(_v) _v.begin(), _v.end()
#define pii pair <int, int>
#define pll pair <ll, ll>
#define pvllvll pair <vector <ll>, vector <ll> >
#define ld long doub... | #include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(false); cin.tie(NULL);
#define ll long long
#define min3(a,b,c) min(min((a),(b)),(c))
#define min4(a,b,c,d) min(min((a),(b)),min((c),(d)))
#define max3(a,b,c) max(max((a),(b)),(c))
#define max4(a,b,c,d) max(max((a),(b)),max((c),(d)))
#define S second
#def... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int Mxn = 1e5;
int a[Mxn], n;
void solve() {
ll N;
cin >> N;
for (ll i = 1; i <= 100000; ++i) {
if ((i * i + i) >= 2 * N) {
cout << i ;
return;
}
}
}
int main() {
int t = 1;
//cin >> t;
while (t--) {
solve();
}
} | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define test int x; cin>>x; while(x--)
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define f(i,a,b) for(int i = a; i < b; i++)
#define fe(i,a,b) for(int i = a; i <= b; i++)
#d... |
// KNOW NOTHING!
#include <bits/stdc++.h>
#define ll long long int
#define F(i,j,k,in) for(int i=j;i<k;i+=in)
#define DF(i,j,k,in) for(int i=j;i>=k;i-=in)
#define feach(it,l) for (auto it = l.begin(); it != l.end(); ++it)
#define fall(a) a.begin(),a.end()
#define sz(x) (int)x.size()
#define szs(x) (int)x.length()
#defi... | #include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iostream>
#include <iostream>
#include <fstream>
#include <numeric>
#include <cstring>
#include <cassert>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <cmath>
#include <set>
#include <map>
#include <functi... |
#include <bits/stdc++.h>
#define all(n) (n).begin(), (n).end()
#define se second
#define fi first
#define pb push_back
#define mp make_pair
#define sqr(n) (n)*(n)
#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 IOS ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(n... | /*
In the name of ALLAH
Author : Raashid Anwar
*/
#include <bits/stdc++.h>
using namespace std;
#define int int64_t
const int M1 = 998244353;
const int M2 = 1000000007;
mt19937 rng((uint64_t)chrono::steady_clock::now().time_since_epoch().count());
void solve() {
int n;
cin >> n;
vector <int> l(n), r(... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define repA(i, a, n) for(int i = a; i <= (n); ++i)
#define repD(i, a, n) for(int i = a; i >= (n); --i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define fill(a) memset... | #include<bits/stdc++.h>
#define pi 3.141592653589793238
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define MOD 1000000007
#define INF 999999999999999999
#define pb push_back
#define ff first
#define ss second
#define mt make_tuple
#define ll long long
#defin... |
#include<bits/stdc++.h>
using namespace std;
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')';}
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_... | // first second push_back unordered return continue break vector visited check flag bool while iterator begin end lower_bound upper_bound temp true false ll_MAX ll_MIN insert erase clear pop push compare ll64_MAX ll64_MIN reverse replace stringstream string::npos length substr front priority_queue
#include<bits/stdc... |
#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 ... | #pragma GCC optimize("Ofast")
#if 1
#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 = ... |
#include<bits/stdc++.h>
using namespace std;
#define int int64_t
const int MOD = 998244353;
const int N = 5005;
int P[N][N];
int power(int x, int y) {
if (P[x][y] != -1) return P[x][y];
if (y < 0) return 0;
int u = x;
int v = y;
int res = 1;
while (y) {
if (y % 2) res = res * x % MOD... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
using ll = long long;
constexpr int P = 1000000007;
char s[2000][2001];
int a[2000][2000];
int b[2000][2000];
int main() {
ios::sync_with_stdio(false);
cin.t... |
#include <bits/stdc++.h>
#include<sstream>
#include<string>
#include<vector>
#include <set>
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define pb push_back
#define mp make_pair
#define ll long long
#define lb lower_bound
#define ub upper_bound
#define endl "\n"
#define ff first
#define s... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n); i >= 0; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 25;
const int MOD = 1e9+7;
int x[10];
int main() {
string s;
cin >> s;
deque<char> d;
i... |
#include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define rrep(i, n) for (int i = (int)n-1; i >= 0; --i)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pai... | #include <bits/stdc++.h>
#define rep(a,n) for (int a = 0; a < (n); ++a)
using namespace std;
using ll = long long;
ll t,n;
ll f(ll A){
return (100+t)*A/100;
}
bool check(ll x){
if(f(x)-x<=n)return true;
else return false;
}
ll BinarySearch(){
ll ok = 0;
ll ng = 1e16;
while(abs(ok-ng)>1){
ll mid = (ok+ng)/2;... |
#include <bits/stdc++.h>
#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++)
typedef long long ll;
using namespace std;
int main() {
int N, D, H;
cin >> N >> D >> H;
double ans = 0.0;
rep(i, N) {
int d, h;
cin >> d >> h;
ans = max(ans, h ... | #include<bits/stdc++.h>
using namespace std;
#define int double
int32_t main(){
int n,d,h;cin>>n>>d>>h;
vector<pair<int,int>>v;
for(long long i=0;i<n;i++){
int a,b;cin>>a>>b;
v.push_back(make_pair(a,b));
}
int minval=INT_MAX;
for(long long i=0;i<n;i++){
minval=min... |
#include<bits/stdc++.h>
using namespace std;
const int mn=2e5+7,mod=1e9+7;
char s[mn];
int a[mn],k,vis[20];
long long f[mn][20];
int main()
{
scanf("%s",s+1);
scanf("%d",&k);
int n=strlen(s+1);
for(int i=1;i<=n;++i) {
if(s[i]>='A') a[i]=s[i]-'A'+10;
else a[i]=s[i]-'0';
}
f[1][1... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
using namespace std;
const int MOD = 1000000007;
vector<long long> fac, finv, inv;
void InitializeCombination(int COMMAX){
fac.push_back(1LL);
fac.push_back(1LL);
finv.push_back(1LL);
finv.push_back(1LL);
... |
#include<bits/stdc++.h>
#define int long long
#define x first
#define y second
#define mp make_pair
#define pb push_back
#define endl "\n"
using namespace std;
const int max_n = 1010;
const int max_k = 405;
const int Mod = 1e9+7;
const int inf = 2e18;
int n,m;
int a[max_n],b[max_n];
int dp[max_n][max_n];
int solve(... | #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 ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <typename T>
using dijkstra = priority_... |
#include <bits/stdc++.h>
using namespace std;
typedef long double ld;
const long long inf = 1100000000000000000;
#define maxn 1000005
#define mod 1000000007 //998244353
#define int long long
#define PB push_back
#define F first
#define S second
#define vi vector<int>
#define rep(i,a,b) for( int i = a; i < b; i++ )... | /*input
10 3
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<long long, null_type, less_equal<long long>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#pragma GCC optimize("unroll-loop... |
/* Author VS_CODE */
#include<bits/stdc++.h>
#define fr first
#define sc second
#define pb emplace_back
using namespace std;
void online()
{
#ifndef ONLINE_JUDGE
freopen("input","r",stdin);
freopen("output","w",stdout);
#endif
}
/* CODE STARTS HERE */
const int N = 2e5+7;
int ans=0;
void solve()
{
int n;
cin... | /*
I love the sound you make when you shut up.
*/
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace __gnu_pbds;
/*-------typedefs------*/
template<class T> using or... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
int N, M;
cin >> N >> M;
vector<i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define endl '\n'
#define all(x) (x).begin(),(x).end()
const int INF=1000000000+5;
const int N=1e5+5;
const ll oo=1e18+5;
const ll mod=1e9+7;
map<int,pair<int,int>> get(int n,int L){
vector<int> v{0};
for(int i=1;i<=n... |
#include<bits/stdc++.h>
#define I return
#define LOVE 0
#define TIANYUAN ;
using namespace std;
const int N=1000007;
int n,q;
char s[N];
int a[N],b[N];
int t;
bool flag=false;
int main()
{
cin>>n;
scanf("%s",s);
for(int i=1;i<=n;i++)
{
a[i]=i;
b[i]=n+i;
}
cin>>q;
for(int i=1;i<=q;i++)
{
cin>>t;
int x... | #include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define mp make_pair
#define pb push_back
#define pll pair<LL,LL>
#define pii pair<int,int>
#define y second
#define x first
#define LL long long
#de... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = (2e5) + 5;
ll a[N];
ll ac[N];
ll ac2[N];
multiset<ll> ms;
multiset<ll> :: iterator it;
int n;
int main() {
ios::sync_with_stdio(!cin.tie(0));
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
ac[0] = a[0];
for (int ... | /*
Problem name: -
Difficulty level: -
Techniques: -
Hints: -
Written by Thalyson
*/
#include <bits/stdc++.h>
using namespace std;
#define vi vector< int >
#define vii vector< pair<int,int> >
#define vvi vector<vector< int > >
#define vvii vector<vector< pair<int,int> > >
#define int int64_t
#define ... |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
#include <iomanip>
#include <climits>
#include <functional>
#include <cassert>
using namespace std;
typedef long long ll;
typedef pair<int,int>... | #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 ... |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <unordered_map>
#include <cstdlib>
#include <numeric>
#include <set>
using namespace std;
int main () {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
sort(A.begin(), A.end());
string ans = "Yes";
for (int i = 0; i ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(intt i=0;i<(intt)(n);i++)
#define repm(i,n) for(intt i=(intt)(n)-1;i>=0;i--)
#define rept(i,n) for(intt i=1;i<(intt)(n);i++)
#define reptm(i,n) for(intt i=(intt)(n);i>0;i--)
#define all(x) (x).begin(),(x).end()
#define siz(s) (s).size()
#define fof(i,a,... |
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <deque>
#include <set>
#include <sstream>
#include <stack>
#include <... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int ans = 0;
vector<vector<int>> point(n, vector<int>(2));
for (int i=0; i<n; i++){
cin >> point[i][0] >> point[i][1];
}
for (int j=0; j<n; j++){
for (int k=j+1; k<n; k++){
for (int l=0; l<n; l++){
if (... |
#include<bits/stdc++.h>
using namespace std;
using ll = int64_t;
using P = pair<int,int>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define INF 1e17
class Prime {
// nไปฅไธใฎ็ด ๆฐใๅๆใใ
public:
const int n;
vector<bool> is_prime;
vector<int> primes;
Prime(int size) : n(size), is_prime(n+1, true) {
is_prim... | #include<algorithm>
#include<cstdio>
#include<map>
typedef long long ll;
std::map<ll,ll>mp;
ll n,k;
ll now;
bool looped;
int zc[18],zcnt;
ll get(ll x,bool rev){
zcnt=0;
while(x){
zc[++zcnt]=x%10;
x/=10;
}
std::sort(zc+1,zc+zcnt+1);
if(rev)std::reverse(zc+1,zc+zcnt+1);
ll res=0;
for(int i=zcnt;i;i--)res=(res<... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) (v).begin(), (v).end()
using ll = long long;
constexpr int INF = 1e9;
constexpr long long LINF = 1e18;
constexpr long long MOD = 1e9 + 7;
template <typename T1, typename T2>
inline void chmax(T1 &a, T2 b) ... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,m;
scanf("%d%d",&n,&m);
if(m==0){
for(int i=1;i<=n;i++)printf("%d %d\n",2*i,2*i+1);
}
else if(m==n||m==-n||m==n-1||m==1-n)printf("-1");
else{
int k=5e7;
if(m>=0){
printf("%d %d\n",1,k);
for(int i=1;i<=1+m;i++)printf("%d %d\n",i<<1,i<<1|1);... |
//#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... | #include<bits/stdc++.h>
using namespace std ;
#define fast_io ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define debug(x) cerr << #x << " -> " << x << "\n"
#define here cerr << "here\n"
#define MP make_pair
#define F firs... |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <unordered_set>
#include <vector>
#define REP(i, n) for(int i = 0; i < n; ++i)
using namespace std;
using LLONG = long long;
const LLONG MOD = 100000... | //#include <atcoder/maxflow.hpp>
#include <memory>
#include <iostream>
#include <map>
#include <list>
#include <set>
#include <algorithm>
#include <vector>
#include <sstream>
#include <string>
#include <functional>
#include <queue>
#include <deque>
#include <stack>
#include <limits>
#include <unordered_map>
#include <u... |
#include<bits/stdc++.h>
using namespace std;
void solve()
{
int a,b;
cin>>a>>b;
cout<<(2*a+100)-b;
}
int main()
{
// int tc;
// cin>>tc;
// while(tc--)
// {
// solve();
// }
solve();
} | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define ull unsigned long long
#define ll long long
#define M 998244353
#define pb push_back
#define p_q priority_queue
#define pii pair<ll,ll>
#define vi vector<ll>
#define vii ... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep3(i,m,n) for(int (i)=m;(i)<=(n);(i)++)
#define rep3rev(i,m,n) for(int (i)=m;(i)>=(n);(i)--)
#define all(a) (a.begin()),(a.end())
#define rall(a) (a.rbegin()),(a.rend())
#define fi first
#define se second
#define pb p... | #pragma GCC optimize("Ofast")
//#pragma GCC target ("sse4")
//https://atcoder.jp/contests/abc191/submissions/19973170
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#inclu... |
#include<bits/stdc++.h>
#define ll long long
#define mp make_pair
#define fi first
#define se second
#define pii pair<int,int>
#define pb push_back
using namespace std;
int t;
int l,r;
int main(){
scanf("%d",&t);
while(t--){
scanf("%d %d",&l,&r);
int ed=r-l;
ll ans=0;
if(ed>=l) ans+=(ll)(r-l*2+2)*(r-l*2+1)/2;... | #include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define f(i,j,n) for(long long i = j ; i < n ; ++i)
#define ones(x) __builtin_popcount(x)
#define endl '\n'
using namespace std;
//using names... |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e2 + 10;
int n, x[maxn], y[maxn], fa[maxn];
double l, r = 100, ans;
int find(int x) {
if (x == fa[x]) return x; else return fa[x] = find(fa[x]);
}
void merge(int x, int y) {
int kk = find(x), cc = find(y);
if (kk != cc) fa[cc] = kk;
}
bool check(double ... | //
// main.cpp
//
#include <algorithm>
#include <array>
#include <assert.h>
#include <complex>
#include <iomanip>
#include <iostream>
#include <limits>
#include <inttypes.h>
#include <map>
#include <math.h>
#include <memory>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stdio.h>
#inclu... |
#include <bits/stdc++.h>
//#include <atcoder/modint>
//#include <atcoder/math>
//#include <boost/multiprecision/cpp_int.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("O3")
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPP(i, n) for(int i = 1; i <= n;... | //REMEMBERING THE PAST , CAN AVOID REPEAT THE SAME
#include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define inf 10000000000000000
typedef long long ll;
#define mp make_pair
#define f first
#define s second
// DP o Trees::http://cfrp.azurewebsites.net/blog/entry/20935
ll GCD(ll a,ll b){
ll maxi=... |
#include <iostream>
using namespace std;
int main(){
int n,m;
cin >> n >> m;
cout << (m % n? "No":"Yes") << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int n;
string s;
int solve();
int main() {
cin >> n >> s;
cout << solve() << endl;
return 0;
}
int solve() {
if (s[0] != s[n - 1]) return 1;
for (int i = 2; i < n; ++i)
if (s[0] != s[i - 1] && s[0] != s[i]) return 2;
return -1;
} |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FILL0(x) memset(x, 0, sizeof(x))
#define FILL1(x) memset(x, -1, sizeof(x))
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
template <class T>
bool chmax(T &a, const T &b)
{
if (a < b)
{
a = b;
... | #pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<iostream>
#include<cstdint>
#include<cstddef>
#include<vector>
//#include<atcoder/all>
//using namespace atcoder;
using namespace std;
using i32 = int_fast32_t;
using i64 = int_fast64_t;
using usize = uint_fast64_t;
temp... |
#include<bits/stdc++.h>
using namespace std;
int a,b,ans;
int main() {
scanf("%d %d",&a,&b);
for(int i=1;i<=200000;i++) {
int k=a/i,now;
if(a%i==0) now=i*k;
else now=i*(k+1);
if(a<=now&&now<=b&&a<=now+i&&now+i<=b) ans=i;
}
printf("%d\n",ans);
} | // Author : Jad Isaac
// ID: jadDebugs
// TASK: -----
// LANG: C++
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f first
#define s second
#define pii pair<int, int>
int getMaxGCD(vector<int> arr, int n) {
int high = 0;
for (int i = 0; i < n; i++)
high = ... |
#include <bits/stdc++.h>
using namespace std;
void solve(vector<int64_t> p) {
const int64_t N = p.size();
vector<int64_t> ans;
while (true) {
int64_t target = 0;
while (target < N && p[target] == target) {
//ใใงใซๆด้ ๆธใฟใ ใฃใใ็ตใใ
target++;
continue;
}
... | #include<bits/stdc++.h>
#define mx(a) *max_element(all(a))
#define mn(a) *min_element(all(a))
#define int long long int
#define pb push_back
#define mpp make_pair
#define F first
#define S second
#define vec vector <int>
#define pr vector<pair<int,int>>
#define vecv vector <vec>
#define vecs vector <string>
#defin... |
#include <bits/stdc++.h>
#define pb push_back
#define sz size()
using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
typedef vector <int> vi;
typedef vector <long long> vll;
const int MOD = 1e9 + 7;
const int maxn = 2e5 + 7;
bool cmp(pii a, pii b){
if(a.first > b.first)return true;
else i... | #include <bits/stdc++.h>
using ull = unsigned long long int;
using ll = long long;
using ld = long double;
using pii = std::pair<int,int>;
using pll = std::pair<ll, ll>;
using vi = std::vector<int> ;
using vvi = std::vector<vi> ;
using vll = std::vector<ll>;
using vvll = std::vector<vll>;
using vd = std::vector<double... |
#include <iostream>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
cout << (a+b)/2 << " " << (a-b)/2 << "\n";
}
| /*
ใใใๅ
ฅใใฆๅฎ่ก
g++ code.cpp
./a.out
*/
#include <iostream>
#include <cstdio>
#include <stdio.h>
#include <vector>
#include <string>
#include <cstring>
#include <queue>
#include <deque>
#include <stack>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i=0; i<(n); i++)
#define rep2(i,n) for (int i=0; i<(n)-1; i++)
using ll = long long;
using P = pair<int,int>;
int main() {
int t; cin >> t;
rep(i,t) {
ll n; cin >> n;
if(n%4 == 0) cout << "Even" << endl;
else if(n%4 == 2) cout << "S... | #define _USE_MATH_DEFINES
#include<iostream>
#include<iomanip>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<climits>
#include<bitset>
#include<unordered_map>
#include<unordered_set>
#include<random>
#include<list>
#include<fun... |
/* ุจูุณูู
ู ุงููููููู ุงูุฑููุญูู
ูููฐูู ุงูุฑููุญููู
ู
( ุฅููู ุงููุญูููู
ู ุฅููููุง ููููููู )
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<pair<int,int> > vpii;
typedef unsigned long long ull;
typed... | #include <bits/stdc++.h>
#define pb push_back
#define x first
#define y second
#define pdd pair<double,double>
#define pii pair<int,int>
#define pll pair<LL,LL>
#define mp make_pair
#define LL long long
#define ULL unsigned long long
#define sqr(x) ((x)*(x))
#define pi acosl(-1)
#define MEM(x) memset(x,0,sizeof(x))
#de... |
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define sz(a) ((int)a.size())
#define re return
#define all(a) a.begin(),a.end()
#define int long long
#define Type int
#define rept(i,a,b) for(int i=(a);i<(b);i++)
#define rep(i,a) rept(i,0,a)
using namespace std;
const int dx[4]={-1,1,0,0};
const int ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define endl "\n"
void solve(){
ll n,c;
cin>>n>>c;
vector<pair<ll,ll>> arr;
for(ll i=0;i<n;i++){
ll a,b,k;
cin>>a>>b>>k;
arr.push_back({a,k});
arr.push_back({b+1,-k});
}
so... |
#include <bits/stdc++.h>
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define ps(x, y) fixed << setprecision(y) << x
#define int long long
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef vector<pii> vp;
// Global
const int INF = 1e18;
void solve() {
int n;
... | //Coded By Vishal Mourya - The Legendary Coder
#include<bits/stdc++.h>
#define ll long long int
#define vec vector<ll>
#define f(var,a,b) for(ll var = a ; var < b ; var++ )
#define fr(var,a,b) for(ll var = a ; var > b ; var-- )
#define fasthoja ios_base::sync_with_stdio(false); cin.tie(NULL);
using namespace std;
int m... |
#define _CRT_SECURE_NO_DEPRECATE
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include "bits/stdc++.h"
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
//using namespace __gnu_pbds;
#define int long long int
#define SYNC std::ios_base::sync_with_stdio(0);ci... | #include<bits/stdc++.h>
using namespace std;
bool _DD = false;
#define _D(a)if(_DD)cout<<#a<<':'<<a<<" | ";
#define DBG(a){_D(a);if(_DD)cout<<'\n';}
#define DBG2(a,b){_D(a);_D(b);if(_DD)cout<<'\n';}
#define DBG3(a,b,c){_D(a);_D(b);_D(c);if(_DD)cout<<'\n';}
#define DBG4(a,b,c,d){_D(a);_D(b);_D(c);_D(d);if(_DD)cout<<'\n'... |
#include <bits/stdc++.h>
namespace {
using namespace std;
#define int long long
template<typename T>
inline bool whitespace(const vector<T> &) { return false; }
template<typename T>
inline bool whitespace(const T &) { return true; }
inline bool whitespace(const char) { return false; }
t... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef pair<int, int> P;
const int INF = 5e6;
int di[4] = {1, 0, -1, 0};
int dj[4] = {0, 1, 0, -1};
int main() {
int h, w;
cin >> h >> w;
vector<string> s(h);
rep(i,h) cin >> s[i];
// vector dist(h, vector(w,... |
/*
author: Taka007
2021.04.11 start
*/
#include<bits/stdc++.h>
#include<iostream>
#include<math.h>
using namespace std;
int64_t Fac(int k) // Definition of "Factorial"
{
return(k==0 ? 1 : k*Fac(k-1));
}
int sum(int l) // Definition of "Sum total"
{
return l*(l+1)/2;
}... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
#define ll long long
using namespace std;
using P = pair<int, int>;
int main(){
int n;
cin >> n;
if(n==1) cout << 0 << endl;
else{
cout << n-1 << endl;
}
} |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
//template
#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define ALL(v) (v).begin(),(v).end()
using ll=long long int;
const int inf = 0x3fffffff; const ll INF = 0x1fffffffffffffff; const double eps=1e-12;
template<typename T>inline bool ch... | #include<bits/stdc++.h>
using namespace std;
using ll = long long int;
using lc = complex<double>;
template<class T>bool chmin(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
int main(void) {
constexpr ll MOD = 1e9 + 7;
constexpr double PI = acos(-1);
cout << fixed << setprecision(32);
ci... |
#include <iostream>
#include <iomanip>
#include <cctype>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#define _GLIBCXX_DEBUG
#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... | // #define _GLIBCXX_DEBUG
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <l... |
#include <stdio.h>
int main(void) {
int n, i;
scanf("%d", &n);
for (i = 1; i <= n; ++i) {
printf("%d %d\n",((i << 1) - 1) % n + 1, (i << 1) % n + 1);
}
return 0;
} | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
//optimal subsequences-2 technocup round-3 2020
using namespace std;
using namespace __gnu_pbds;
const int N=2e5+10;
//#define d double
#define F first
#define S second
#define ll long long int
#define FastIO ios_base:... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define F first
#define S second
#define pii pair<int,int>
#define all(a) a.begin(),a.end()
int bp(int x, int n){
int res = 1;
while(n){
if(n&1) res = res * x;
x *= x; n >>= 1;
}
return res;
}
void solve(){
int n; cin >> n;
for(int i = 1; bp... | //#include "bits/stdc++.h"
#define _USE_MATH_DEFINES
#include<cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <algorithm>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <array>
#include <unordered_map>
#include<unordered_set>
#include <numeric... |
#include <bits/stdc++.h>
#define fi first
#define se second
#define DB double
#define U unsigned
#define P std::pair
#define LL long long
#define LD long double
#define pb emplace_back
#define MP std::make_pair
#define SZ(x) ((int)x.size())
#define all(x) x.begin(),x.end()
#define CLR(i,a) memset(i,a,sizeof(i))
#defin... | #include <bits/stdc++.h>
using namespace std;
#define finish(x) return cout << x << endl, 0
#define ll long long
const int N = 200001;
int n, k;
vector <int> v[N];
pair <int, int> dfs(int node, int pnode, int f){
int cnt = 0;
int neg = 0, pos = 0;
for(auto &i : v[node]){
if(i == pnode) continue;
... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
cout << 100*(1.0-(double)B/A) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
cin>>t;
ll sum=0;
while (t--)
{
ll a, b;
cin>>a>>b;
ll s1=0, s2=0;
if(a!=1)
s1=(a*(a-1))/2;
s2=(b*(b... |
#include<bits/stdc++.h>
using namespace std;
string b[100000];
int n,a[100000],c[10000],m;
int main(){
cin>>n;
for(int i=1;i<=n;i++){
cin>>b[i];
cin>>a[i];
c[i]=a[i];
}
sort(c,c+n);
for(int j=1;j<=n;j++){
if(c[n-2]==a[j]){
m=j;
}
}
cout<<b[m]<<endl;;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define reps(i, a, n) for (int i = (a); i < (n); ++i)
#define rep(i, n) reps(i, 0, n)
#define deps(i, a, n) for (int i = (a); i >= (n); --i)
#define dep(i, n) deps(i, n, 0)
signed main(void)
{
int n; cin >> n;
int ans[3000] = {6, 10, 15};
int i = 3;
reps (j, 16, 100000... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve() {
vector<vector<int> > v;
for (int i = 0; 8 * i < 1000; i++) {
vector<int> temp(10, 0);
int cnt = 3, cur = 8 * i;
while (cnt)
temp[cur % 10]++, cur /= 10, cnt--;
v.push_back(temp);
}
string s;
cin >> s;
if (s.size() < 3) ... | #pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("inline")
// #include<bits/stdc++.h>
#include<iostream>
#include<string>
using namespace std;
string dfs(int n,string s){
if(n == 1)return s;
while(n%3!=1){
string t;
for(int i=1;i<n... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=5e3+5;
const int mod=998244353;
int n,m;
int dp[15][N];
int fac[N],invf[N];
inline int po(int x,int k){
int ret=1;
while(k){
if(k&1) ret=1ll*ret*x%mod;
x=1ll*x*x%mod;
k>>=1;
}
return ret;
}
inline int C(int x,int k){
if(x<k) retur... | #include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
typedef long long ll;
typedef long double ld;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define mod 998244353
#define inf 1000000000000000
#define autoit(x,it) for(auto it = x.begin()... |
// I SELL YOU...!
#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
#include<queue>
#include<chrono>
#include<iomanip>
#include<map>
#include<set>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using TP = tuple<ll,ll,ll>;
void init_io(){
cin.tie(0);
ios::sync_with_stdi... | #include <iostream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <utility>
#include <algorithm>
#include <cmath>
#include <climits>
#include <iomanip>
#include <queue>
#include <stack>
#include <ctype.h>
using namespace std;
typedef long long ll;
const int INF = (1<<30)-1;
const ll LINF... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pii pair<int, int>
#define vi vector<int>
const int mod = 1e9 + 7;
//const int mod = 998244353;
const int inf = 1e9;
int main() {
ios::sync_with_stdio(false); cin.tie(nullptr);
int m, h;
cin >> m >> h;
if (h % m) cout << "No\n"... | #include <iostream>
#include <stdio.h>
#include <bits/stdc++.h>
#include <queue>
#include <math.h>
#include <bitset>
#define INF 100000000000
#define N 200000
#define ll long long
using namespace std;
int main(){
int n,w;
cin>>n>>w;
int ans = n / w;
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define cm (1 << 17)
char cn[cm], *ci = cn + cm, ct;
inline char getcha() {
if (ci - cn == cm) {
fread(cn, 1, cm, stdin);
ci = cn;
}
return *ci++;
}
inline int getint() {
int A = 0;
while ((ct = getcha()) >= '0') A = A * 10 + ct - '0';
ret... | // 4-10-2020
// FUN WITH CODE -> GON
// Don't be frustrated
// codeforces
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define nes ios_base :: sync_with_stdio(0); cin.tie(0); cout<<fixed; cout.precision(20);
#define f4(i,k,n) for(int i=k;i<n;++i)
#define pii pair<int,int>
#define pll pair<ll,ll>
... |
#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 watch(x) cout<<(#x)<<"="<<(x)<<'\n'
#define mset(d,val) memset(d,val,sizeof(d))
#define setp(x) cout<<fixed<<setprecision(x)
#define forn(i,a,b) for(int i=(a);... | /* in the name of Anton */
/*
Compete against Yourself.
Author - Aryan (@aryanc403)
Atcoder library - https://atcoder.github.io/ac-library/production/document_en/
*/
#ifdef ARYANC403
#include <header.h>
#else
#pragma GCC optimize ("Ofast")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.