code_file1 stringlengths 87 4k | code_file2 stringlengths 85 4k |
|---|---|
// Its just opening , middle game and end game
#include<bits/stdc++.h>
using namespace std ;
#define F first
#define S second
int MOD = 998244353 ;
int mod = 1e9 + 7 ;
int inf = 1e9 ;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
vector<int> a(2005) ;
vector<int> all_divisors ;
signed ... | #include <bits/stdc++.h>
//#include <atcoder/lazysegtree>
//#include <atcoder/segtree>
#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(n) for(ll i = 0; i < (n); ++i)
#define rep2(i, n) for(ll i = 0; i < (n); ++i)
#define rep3(i, a, b) for(ll i = (a); i < (b); ++i)
#define rep4(i, a, b, c) for(ll i = (a);... |
#include<iostream>
using namespace std;
void solve(){
int A, B;
cin >> A >> B;
int X = int((A+B) / 2);
int Y = A - X;
cout << X << " " << Y << endl;
}
int main(){
solve();
cin.get();
}
| #include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define LL long long
#define ULL unsigned long long
const LL INF = 1LL<<59;
const double PI = 2.0 * acos(0.0);
typedef pair<int,int> pii;
typedef pair<LL,LL> pll;
typedef vector<int> vi;
typedef vector<LL> vl;
typedef vector<pii> vii;
typedef ve... |
//競技プログラミング用のテンプレート
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <string>
#include <math.h>
#include <stack>
#include <limits>
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define repr(i, n) for(int i = n - 1; i >= 0; i--)
using namespace std;
//エイリ... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
LL n, rem[20], len, num, ans;
bool fla[20], fla1;
vector<int> v;
inline LL read() {
LL x = 0;
bool f = 0;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
f = 1;
c = getchar();
}
while (c <= '9' && c >= '0') {
x = (x << 1) ... |
#include <bits/stdc++.h>
using namespace std;
int main() {
double r, x, y, l2;
std::cin >> r >> x >> y;
l2 = (x * x) + (y * y);
double l;
l = pow(l2, 0.5);
double a = l / r;
int inta = (int)a;
if (a < 1) {
std::cout << 2 << '\n';
}
else if (a == (double)inta) {
... | #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... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define int long long
//# define int int64_t
#define pb push_back
//std::cin.ignore(std::numeric_limits<std::streamsize>::max(), '\n'); //used to take input a line after taking input a variable
//#define first fi
//#define second se
#define gok ios_base:... |
/** Fucc 😕
- doanphuc : /
* author: doanphuc. *
**/
#include <bits/stdc++.h>
#define TASK ""
#define inpf freopen(TASK".inp", "r", stdin)
#define outf freopen(TASK".out", "w", stdout)
template<class T> T gcd(T a, T b) { T r; while (b != 0) { r = a % b; a = b; b = r; } return a; }
template<class T> T lcm(T a, T ... |
#include <bits/stdc++.h>
#define rep(i,n) for (long long i = 0; i < (n); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
struct Input{
int n;
struct Data
{
int x, y, r;
};
Input(){}
vector<Data> data;
void in(){
cin >> n;
data.res... | //雪花飄飄北風嘯嘯
//天地一片蒼茫
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
#define se seco... |
#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>
#define INF 10000000000000
using namespace std;
typedef long long ll;
const int maxn=3e5+5;
ll n,m,s,t;
struct op{
ll v;
ll w,k;
ll next;
}e[maxn*2];
ll head[maxn*2],cnt;
void add(int u,int v,ll w,ll k){
e[++cnt]={v,w,k,head[u]};
head[u]=cnt;
}
ll dis[maxn];
ll vis[maxn];
st... |
/*
{
######################
# Author #
# Gary #
# 2020 #
######################
*/
//#pragma GCC target ("avx2")
//#pragma GCC optimization ("O3")
//#pragma GCC optimization ("unroll-loops")
#pragma GCC optimize(2)
#include<bits/stdc++.h>
#define rb(a,b,c) for(int a=b;a<=c;++a)
#... | #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++)
#define all(v) v.begin(), v.end()
#define sz(v) v.size()
#define INF 100000000000000 //10^14
template <typename T>
bool chmax(T &a, const T& b) ... |
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("fast-math")
#pragma GCC optimize("trapv")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree... | #include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 123;
const int mod = 998244353;
#define int long long
int t[N * 4];
void upd(int v, int tl, int tr, int pos, int val) {
if(tl == tr) {
t[v] += val;
t[v] = max(t[v], 0LL);
return;
}
int tm = (tl + tr) / 2;
if(pos <= tm)
upd(v + v, tl, tm... |
#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 MV 200001
#define LMV 21
#define ff first
#define ss second
#define pb push_back
#define eb emplace_back
#define emp emplace
#define mp make_pair
#define ins in... | #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<ll, ll>;
const ll INF = ll(1e18) + 5;
ll dp[int(1e5) * 2 + 5][2];
// Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can r... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<int,int>;
static const int mod1 = 998244353;
static const int mod2 = 1000000007;
int main() {
string s;
cin >> s;
int size=s.size();
rep(i,size) {
if(i%2==0) {
if('a'<=s[i... | #include <bits/stdc++.h>
#include <cassert>
#define rep(i, N) for (int i = 0; i < (N); ++i)
#define rep2(i, a, b) for (ll i = a; i <= b; ++i)
#define rep3(i, a, b) for (ll i = a; i >= b; --i)
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(c) begin(c), end(c)
#define ok() put... |
//#include <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>
#includ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, l, n) for (int i = (int)(l); i < (int)(n); i++)
#define drep(i, n, l) for (int i = (int)(n); i > (int)(l); i--)
#define INF INT_MAX
#define INFF (pow(2,64))
#define def (200007)
#define MOD (1000000007)
typedef int64_t intt;
typedef vector<int> veci;
typedef ... |
#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long int ll;
#define fast ios_base::sync_with_stdio(0), cin.tie(NULL), cout.tie(NULL)
#define endl "\n"
#define ii pair<ll,ll>
#define ic pair<char,ll>
#define pb push_back
#define vi vector<ll>
#define popb pop_back
#define pf push_front
#define popf p... | //
// main.cpp
// 1014 . 打地鼠
//
// Created by Paul Liao on 2021/5/6.
//
#include <iostream>
#include<map>
#define ll long long
#define AC ios::sync_with_stdio(0);cin.tie(0)
#define endl "\n";
#define FOR(i,a,b) for(int i=a;i<b;i++)
using namespace std;
ll x[20],MOD=1e9+7,haha[2]={(ll)1e9+7,(ll)1e9+9};
ll fpow(ll x,... |
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
#define fr(i, a, b) for (ll i = a; i < b; i++)
#define rf(i, a, b) for (ll i = a; i >= b; i--)
typedef std::vector<long long> vi;
#define F first
#define S second
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0)... | #include <chrono>
#include <thread>
#include<bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define T top()
#define E end()
#define PS push
#define Q queue
#define PP pop()
#define L0 (LL)0
#define V vector
#define ST stack
#... |
//#include<cstdio>
//#include<cassert>
//#include<iostream>
//#include<cstring>
//#include<algorithm>
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define MAX ((int)2e9 + 5)
#define MAXP ((int)1e5 + 5)
#define MAXL ((ll)1e18 + 5)
#define MAX_X ((int)2001)
#define M... | #include<bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
int N; cin>>N;
vector<pair<int,int>> A(2*N);
for(int i=0;i<2*N;i++){
cin>>A[i].first; A[i].second=i;
}
sort(A.begin(),A.end());
vector<int> B(2*N);
for(int i=0;i<N;i++) B[A[i].second]=1;
string C(2*N,'(');
stack<pair... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<vector<pair<int, long long int>>> G(N);
for (int i = 0; i < N - 1; i++) {
int u, v;
long long int w;
cin >> u >> v >> w;
u--;
v--;
pair<int, long long int> p = make_pair(v, w), q = make_pair(u, w);
G.... | // execute g++ main.cpp -std=c++14 -I C:\Users\naoya\Desktop\code\Atcoder
#include<bits/stdc++.h>
//#include<atcoder/all>
typedef long long ll;
typedef long double ld;
using namespace std;
//using namespace atcoder;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
//ordered_set 重複不可
#include <ext/pb_ds/assoc_con... |
#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#def... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long int ;
using P = pair<ll,ll>;
using Graph= vector<vector<ll>>;
struct edge{ll to ; ll cost ;} ;
using graph =vector<vector<edge>> ;
#define rep(i,n) for (ll i=0; i < (n); ++i)
#define rep2(i,n,m) for(ll i=n;i<=m;i++)
#defin... |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
#define quick ios_base::sync_with_stdio(false); cin.tie(0);cout.tie(0);
#define s(x) sort(x.begin(),x.end())
#define sr(x) sort(x.begin(),x.end(),greater<ll>())
#define v1 vector<ll>
#define p1 pair<ll,ll>
#define m1 map<ll,ll>
#define ff first
#defi... | #include<bits/stdc++.h>
using namespace std;
#define sf scanf
#define pf printf
const int high=1e3+5;
int main()
{
string s, ans="";
while(cin >> s)
{
int len = s.length();
for(int i=1; i<len; i++)
{
ans += s[i];
}
ans+=s[0];
cout << ans << ... |
#include<iostream>
#include<string>
#include<stdio.h>
using namespace std;
int main()
{
int h, w, x, y, c = 0;
cin >> h >> w >> x >> y;
x--;
y--;
string *a = new string[h];
for (int i = 0; i < h; i++)
cin >> a[i];
if (a[x][y] == '.')
c++;
for (int j = x - 1; j >= 0; j--)
if (a[j][y] == '.')
c++;
el... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int H, W, X, Y;
cin >> H >> W >> X >> Y;
vector<vector<char>> mas(H, vector<char>(W));
for (int i=0;i<H;i++) {
for (int j=0;j<W;j++) {
cin >> mas.at(i).at(j);
}
}
int ans = 0;
for (int i=0;;i++) {
if (X-1<... |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
using P=pair<ll,ll>;
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
ll n,k;
cin >> n >> k;
vector<P> a(n);
rep(i,n) cin >> a[i].first >> a[i].second;
sort(a.begin(),a.end());
ll x=0,ans;
rep(i,n){
if(k<a[i].... | #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define pb(a) push_back(a)
#define vll vector<ll>
#define loop(i, n) for(ll i=1;i<=n;i++)
#define loop0(i, n) for(ll i=0;i<n;i++)
#define in(i) scanf("%lld", &i);
#define out(i) printf("%lld", i)
#define pll pair<ll, ll>
#define vpll vector<pair<l... |
#include<bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define pii pair<int,int>
#define fastIO ios_bas... | #include<bits/stdc++.h>
using namespace std;
#define f(i,a,b) for(register int i=a;i<=b;++i)
#define ll long long
#define N 200005
#define se second
#define fi first
#define pb push_back
#define mp make_pair
inline ll read(){ll x;scanf("%lld",&x);return x;}
vector<ll>eg[N];
ll d[N],edge[N][3],deep[N];
void dfs(int s,i... |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#include <chrono>
#define int long long
#define ld long double
#define db double
#define endl "\n"
#define pb push_back
#define mp make_pair
#define all(x) x.begin(), x.end()
using namespace ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b;
cin >> a >> b;
int array[a];
for(int i = 0;i < a;i++){
cin >> array[i];
}
for(int i = 0;i < a;i++){
if(array[i] == b) continue;
else cout << array[i] << " " ;
}
}
|
// Problem : D - Takahashi Unevolved
// Contest : AtCoder - AtCoder Beginner Contest 180
// URL : https://atcoder.jp/contests/abc180/tasks/abc180_d
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include<bits/stdc++.h>
using namespace std;
typedef long... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define ld long double
// g++ -std=c++17 -Wshadow -Wall -g -fsanitize=address -fsanitize=undefined -D_GLIBCXX_DEBUG -o
int main(){
ll x,y,a,b;
cin>>x>>y>>a>>b;
// ll xd=x+b;
ll exp=0;
while(x*a<=x+b && (x*a>0)){
x*=a;
... |
#include<bits/stdc++.h>
using namespace std;
int n,k;
long long s;
void solve(){
cin>>n>>k;
if(k<0)k=-k;
for(int i=1;i<=2*n-k;++i){
if(n<k+i){
if(n>i){
s+=1ll*(2*n-k-i)*i;
}
else{
s+=1ll*(2*n-k-i)*(2*n-i);
}
}
else{
s+=1ll*(k+i)*(i);
}
}
cout<<s<<"\n";
}
int main(){
solve();
return... | #include <algorithm>
#include <iostream>
#include <iomanip>
#include <numeric>
#include <cassert>
#include <vector>
#include <random>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
//#include <atcoder/all>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll ;
typedef pair<int,int> P ;
#define rep(i,n) for(int i = 0 ; i < n ; i++)
int main(){
string x ;
cin >> x ;
rep(i, x.size()){
if(x[i] != '.') cout << x[i] ;
else break ;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<char> c;
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s.at(i) == '.') break;
c.push_back(s.at(i));
}
for (int i = 0; i < c.size(); i++) {
cout << c.at(i);
}
cout << endl;
return... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,M,Q;
cin >> N >> M >> Q;
vector<pair<int, int>> vec;
for (int i = 0; i < N; i++) {
int w,v;
cin >> w >> v;
vec.push_back(make_pair(v , w));
}
vector<int> X;
for (int i = 0; i < M; i++) {
int a;
cin >> a;
X.push_ba... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
#define P pair<ll,int>
#define PI 3.141592653589793
#define pb push_back
const int INF = 1001001001;
const ll MX = 1e18;
const int mod = 998244353;
template<class T> inline bool chmax(T& a, T b) {
if ... |
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
int main()
{
cin.tie(0);
ios_base::sync_with_stdio(0);
int n; cin>>n;
vector<ll> v(n), w(n+1);
rep(i,n) cin>>v[i];
w[0] = 0;
rep(i,n)
if (i % 2)
w[i+1] = w[i] + v[i];
else
w[i+1] = w[i] - v[i];
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
constexpr bool typetest = 0;
constexpr int N = 3e5 + 5;
int n;
ll a[N];
void Read()
{
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> a[i],
a[i] = a[i - 1] + ((i & 1) ... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repk(i, k, n) for (int i = k; i < n; i++)
using namespace std;
using ll = long long;
int main (){
int n;
cin >> n;
ll ans = -1;
rep(i, n){
ll a, p, x;
cin >> a >> p >> x;
if(x - a > 0){
i... | #include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho10
#define ll long long
#define double long double
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define aint(a) (a).begin(), (a).end()
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define pi pair
#define rc(s) return cout<<s,... |
#ifdef DEBUG
#define _GLIBCXX_DEBUG
#endif
//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long ll;
const int maxN = 205;
bool can[maxN];
int n;
int a[maxN], b[maxN];
void bad() {
cout << "No";
exit(0);
}
bool was[maxN];
int par[maxN];
bool le[maxN... | #include <stdio.h>
#include <algorithm>
#include <set>
#include <tuple>
#include <queue>
#include <vector>
using namespace std;
using ll = unsigned long long;
using pii = pair<int, int>;
int n, m, a[10000], b[10000], c[200], d[10000], v[200];
vector<pii> e[200];
void dfs(int x, int p) {
if (v[x])
return;
v[x] = 1;... |
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <string.h>
#include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#include <bits/stdc++.h>
using namespace std;
const double TL = 1.5 * CLOCKS_PER_SEC;
mt19937 rng((unsigned int) chro... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
typedef long long ll;
const ll INF = (1LL << 62) - (1LL << 31); /*オーバーフローしない程度に大きい数*/
const ll MOD = 1000000007;
using namespace std;
int main() {
#ifdef LOCAL
std::ifstream in("... |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll ,ll> pll;
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define all(X) (X).begin(), (X).end()
#define REP(i,x,y) for(ll i = x;i <= y;++i)
#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x... |
#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <utility>
using ll = long long;
//#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
using namespace std;
ll n;
ll sum = 0;
ll m;
ll k;
ll minV;
int main() {
vector<ll> v;
... | // Problem: C - Many Segments
// Contest: AtCoder - AtCoder Beginner Contest 207
// URL: https://atcoder.jp/contests/abc207/tasks/abc207_c
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include "bits/stdc++.h"
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/p... |
#include <bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define fo(i, n) for (i = 0; i < n; i++)
#define Fo(i, k, n) for (i = k; k < n ? i < n : i > n; k < n ? i += 1 : i -= 1)
#define ll long long
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x, y) cout << #x << "=" << x << "," << #y << ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int INF = 2000000000;
const int MOD = 1e9 + 7;
const int MAX = 30;
vector<vector<ll>> dp(MAX+1,vector<ll>(MAX+1));
string solve(int a,int b, ll k){
if(a == 0) retu... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll mod = 1e9 + 7;
ll ans = 0;
ll get(map<ll, ll> &parent, ll a)
{
return parent[a] = (parent[a] == a) ? a : get(parent, parent[a]);
}
void merge(map<ll, ll> &parent, map<ll, ll> &rank, ll a, ll b)
{
a = get(pare... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define ff first
#define ss second
#define pii pair <int,int>
#define pll pair <ll,ll>
#define testcase() int t; cin>>t; while(t--)
#define forn(i,n) for(int i=0;i<n;i++)
#define forn1(i,n)... |
//#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... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
#include <iostream>
#include <fstream>
#include <iostream>
#include <limits.h>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#incl... |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for(int i=a;i<=b;i++)
using LL = long long;
const int Nmax=109;
const LL INF=1e18+9;
int N,r;
LL X,A[Nmax],dp[Nmax][Nmax][Nmax],ans=INF;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
cin>>N>>X;
REP(i,1,N) cin>>A[i];
REP(MOD,... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
typedef long long LL;
int n, m, k;
int st[N];
long double a[N], b[N], suma[N], sumb[N];
int main() {
cin >> n >> m >> k;
for (int i = 0; i < k; i++) {
int x;
cin >> x;
st[x] = 1;
}
for (int i = n - 1; i >= 0; ... |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#ifdef ENABLE_DEBUG
#define dump(a) cerr<<#a<<"="<<(a)<<endl
#define dumparr(a,n) cerr<<#a<<"["<<(n)<<"]="<<(a[n])<<endl
#else
#define dump(a)
#define dumparr(a,n)
#e... | #include <iostream>
#include <array>
#include <algorithm>
#include <vector>
#include <bitset>
#include <set>
#include <unordered_set>
#include <cmath>
#include <complex>
#include <deque>
#include <iterator>
#include <numeric>
#include <map>
#include <unordered_map>
#include <queue>
#include <stack>
#include <string>
#i... |
//#include <atcoder/all>
//using namespace atcoder;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for(int i=0; i<n; i++)
#define REPR(i, n) for(int i=n-1; i>=0; i--)
#define FOR(i, m, n) for(int i=m; i<n; i++)
#define ALL(v) v.begin(), v.end()
#define bit(n) (1LL<<(n))
#define FI... | //c++ テンプレ
#include<bits/stdc++.h>
using namespace std;
typedef long long llint;
typedef long double ld;
#define inf 1e18
#define mod 1000000007
#define sort(v) sort(v.begin(),v.end())
#define reverse(v) reverse(v.begin(),v.end())
#define rep(i,a,n) for(int i=a;i<n;i++)
priority_queue<llint,vector<llint>,greater<l... |
#include <iostream>
#include <cmath>
#include <vector>
#include <cstring>
#include <algorithm>
#include <queue>
#include <unordered_map>
using namespace std;
#define int long long
#define pii pair<long long, long long>
const double pi = acos(-1);
const int maxn = 3e5 + 5;
const int mod = 1000000007;
int32_t main()
{
... | #include <cstdio>
#include <iostream>
#include <cstring>
#include <cmath>
#include <algorithm>
inline int read() {
int x = 0, f = 1; char ch = getchar();
while(ch > '9' || ch < '0') { if(ch == '-') f = -1; ch = getchar(); }
do x = x * 10 + ch - 48, ch = getchar(); while(ch >= '0' && ch <= '9');
return x * f;
}
in... |
#include <cstdio>
#include <algorithm>
#define N 200010
using namespace std;
long long n,k,cur=0;
struct node{
long long a,b;
bool operator<(const node x)const{
return a<x.a;
}
}c[N];
int main(){
scanf("%lld%lld",&n,&k);
for(int i=1;i<=n;i++)
scanf("%lld%lld",&c[i].a,&c[i].b);
sort(c+1,c+1+n);
for(int i=1;i<... | //Radhe Radhe
#include<bits/stdc++.h>
#define FASTIO_ ios_base:: sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define mod 1000000007
#define ll long long
#define ld long double
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define en '\n'
#define itr(i,n) for(ll i=0; i<n; i++)
#d... |
//doit4von
//LLJW
//999
#include<bits/stdc++.h>
using namespace std;
const int N=1e6+5;
const long long mod=pow(10,9)+7;
typedef long long ll;
#define pb push_back
#define vi vector<int>
#define sz(x) (int)(x).size()
void google(int tc)
{
cout<<"Case #"<<tc<<": ";
}
ll convert(string z)
{
ll ans=0;
int ... | /* Vineeth Kada */
#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef unsigned long long ull;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
#define F first
#define S second
#define PB push_back
#define rep(i,a,b) for(int i=a; i<=b; i++)
#define rrep(i,a,b) for(int i=... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
const int maxn = 1e5 + 233;
int c[maxn], d[maxn];
int main(){
vector<int> a, b;
scanf("%d", &n);
ll res = 0;
for(int i = 1; i <= n; i++){
scanf("%d", &c[i]);
res += c[i];
}
for(int i = 1; i <= n; i++){
scanf("%d", &d[i]);
if(i &... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair < int , int > pii;
#define mpr make_pair
#define FS first
#define SC second
#define PB push_back
template < typename T > void UMAX(T &a,T b){a=(a>b?a:b);}
template < typename T > void UMIN(T &a,T b){a=(a<b?a:b);}
LL readint(){
char c=getc... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
int n,m,t;
while(scanf("%d%d",&n,&m)!=EOF)
{
n+=m;
if(n>=15&&m>=8)t=1;
else if(n>=10&&m>=3)t=2;
else if(n>=3)t=3;
else t=4;
printf("%d\n",t);
}
}
| #include <iostream>
using namespace std;
int a,b,c,d,e;
int main(void){
cin>>a>>b>>c>>d;
if((a+b+c+d)%2==1){cout<<"No"<<endl;return 0;}
e=(a+b+c+d)/2;
if(a+b==e)cout<<"Yes"<<endl;
else if(a+c==e)cout<<"Yes"<<endl;
else if(a+d==e)cout<<"Yes"<<endl;
else if(b+c==e)cout<<"Yes"<<endl;
else i... |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int N, M;
cin >> N >> M;
vector<array<int, 3>> A(M);
for (int i = 0; i < M; i++) {
cin >> A[i][0] >> A[i][1] >> A[i][2];
}
vector<int64_t> dp(1<<N);
dp[0] = 1;
for (int i = 0... | #include <bits/stdc++.h>
#define rep(i, n) for (auto i = 0; i < n; ++i)
#define ALL(a) a.begin(), a.end()
using namespace std;
using ll = long long int;
const int MOD_NUM = 1e9 + 7;
int main() {
// Input
int N, Q;
string S;
cin >> N >> S >> Q;
vector<int> T(Q), A(Q), B(Q);
rep(i, Q) cin >> ... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll inf = (1ll << 63) - 1;
array<ll, 3> egcd(ll a, ll b) {
ll s0 = 1, t0 = 0, s1 = 0, t1 = 1;
while (b) {
ll d = a / b;
tie(a, b) = make_pair(b, a % b);
tie(s0, s1) = make_pair(s1, s0 - d * s1);
tie(t0, ... | #include <iostream>
#include <sstream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <memory>
#include <complex>
#include <numeric>
#include <cstdio>
#include <iomanip>
#include <random>
#define REP(i,m,n) for(int i=in... |
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define st first
#define nd second
#define pii pair<int,int>
#define piii pair<int,pii>
#define sp " "
#define nl "\n"
#define all(x) x.begin(),x.end()
#define fastio() ios_base::sync_with_stdio(0);cin.tie(0);
#define ll long long
#define int ll
using... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#ifndef _LOCAL
int main() {
string s;
cin >> s;
ll ans = 0ll;
vector<bool> must(10, false);
vector<bool> must_not(10, false);
for(int i = 0; i < 10; i++) {
if(s[i] == 'o') {
must[i] = true;
} else if... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(long long i=(long long)(a);i<(long long)(b);i++)
#define ALL(a) (a).begin(),(a).end()
typedef long long ll;
typedef pair<ll,ll> P;
ll a[5151],t[5155],c[5151],g[5151];
int main(){
ll n;
string s;
cin>>n>>s;
rep(i,0,n){
if(s[i... | #pragma GCC optimize("O2")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define FAST_IO ios_base::sync_with_stdio(0); cin.tie(nullptr)
#define FOR(i, a, b) for(int i = (a); i <= (b); i++)
#define REP(n) FOR(O, 1, (n))
#define pb push_back
#define f first
#define s second
typedef... |
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <tuple>
template <class E> struct FenwickTree {
int _n;
std::vector<E> data;
FenwickTree(int n) : _n(n), data(n) { }
void add(int p, E x) {
++p;
while (p <= _n) {
data[p - 1] += x;
p +... | #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>
#define rep(i,n) for (int i=0; i<(n); ++i)
#define sz(x) int(x.size())
// #define show(x) {for(auto i:x){cout << i << " ";} cout << endl;}
#define isin(x,l,r) ((l)<=(x) && (x)<(r))
using namespace std;
using ll=long long;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
template<typename T>bool ... | ///In the name of GOD
//#pragma GCC optimize("O2")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MXN = 5000 + 10;
ll k, n;
ll ans;
vector<string> ANS;
string t, one;
void Print(){
cout << ans << '\n';
for(auto X : ANS){
cout << X << '\n';
}
exit(0);
}
string Rev(co... |
#define _USE_MATH_DEFINES
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <deque>
#include <queue>
#include <set>
#include <functional>
#include <cmath>
#include <set>
#include <map>
#include <limits>
//マクロ
#define REP(i,n) for(int i=0; i<(int)(n); ++i)
#define... | #include <iostream>
#include <cstdlib>
#include <cmath>
#include <iomanip>
#include <limits>
using namespace std;
int main() {
long long N; cin >> N;
long long x[N];
for (int i = 0; i < N; i++) cin >> x[i];
long long ans1 = 0;
for (int i = 0; i < N; i++) ans1 += abs(x[i]);
double ans2 = 0;
for (int i ... |
#include <functional>
#include <ios>
#include <numeric>
#include <ostream>
#include <string>
#include <valarray>
// #pragma GCC optimize("Ofast")
// #pragma GCC target("avx,avx2,fma")
// #pragma GCC target("popcnt")
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include<bits/stdc++.h>
#incl... | #include<bits/stdc++.h>
#include<algorithm>
#include<cmath>
#include<climits>
using namespace std;
typedef long long int lli;
typedef vector<int> vi;
typedef vector<long long int> vlli;
typedef pair<int,int> pii;
typedef pair<long long int,long long int> plli;
typedef vector< vi > vvi ;
typedef vector< vlli > vvlli ;
... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define per(i, a, b) for (int i = a; i >= b; i--)
const int inf = 0x3f3f3f3f;
const int mod = 1e9 + 7;
typedef long long LL;
typedef pair <int, int> P;
const int N = 2e5 + 5;
int n, a[N], b[N], c[N];
LL ans, res;
int main(... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
#define F first
#define S second
#define pll pair<ll, ll>
#define all(v) (v).begin(), (v).end()
#define decimal(n) cout << fixed << setpr... |
// Problem: B - ARC Wrecker
// Contest: AtCoder - AtCoder Regular Contest 117
// URL: https://atcoder.jp/contests/arc117/tasks/arc117_b
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __g... | #include<bits/stdc++.h>
using namespace std;
#define INF 1234567890
#define ll long long
#define MOD 1000000007
int T;
int N;
int main()
{
ios::sync_with_stdio(0); cin.tie(0);
cin.exceptions(ios::badbit | ios::failbit);
cin >> N;
vector<int> A(N);
for(int i=0; i<N; i++)
cin >> A[i];
A.push_back(0);
sort(A.b... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll n, m;
cin >> n >> m;
vector<pair<ll,ll>> As(n);
vector<ll> A(n);
vector<vector<ll>> g(n, vector<ll>(0));
for(ll i=0; i<n; i++){
ll a;
cin >> a;
As.at(i).first = a;
As.at(i).second = i;
A.at(i) = a;
}
... | #include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef long double LD;
typedef pair<LL,LL> pii;
typedef pair<LL,pii> ppi;
typedef pair<pii,pii> ppp;
#define FOR(i, n) for(int i = 1; i<=n; i++)
#define F0R(i, n) for(int i = 0; i<n; i++)
#define mp make_pair
#define pb push_back
#define f first
#defin... |
#include <bits/stdc++.h>
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
#ifndef ONLINE_JUDGE
#define _GLIBCXX_DEBUG
#endif
#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 Clear(a) a = decltype(a)()
#define all(a) a.begin(),a... | //clear adj and visited vector declared globally after each test case
//check for long long overflow
//while adding and subs check if mod becomes -ve
//while using an integer directly in a builtin function add ll
//Mod wale question mein last mein if dalo ie. Ans<0 then ans+=mod;
//Dont keep array name as size or any o... |
#include <bits/stdc++.h>
#include <cassert>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
/*
struct Edge
{
int to;
int weight;
Edge(int t, int w) : to(t), weight(w) {}
};
using Graph = vector<vector<Edge>>;
*/
using Graph = vector<vector... | #include <bits/stdc++.h>
#include <string>
#include <cstring>
#include <algorithm>
#include <math.h>
#include <map>
#include <bitset>
#include <cmath>
#include <set>
#include <utility>
#include <sstream>
#define INF 1000000000000
#define MOD 1000000007 //10^9+7:合同式の法
using namespace std;
typedef long long ll;
/*
0のア... |
#include <iostream>
#include <cstring>
using namespace std;
typedef long long ll;
const int N=20,M=210;
int l;
ll dp[N][M];
ll dfs(int p,int s){
if(s>l) return 0;
if(p==13){
if(s==l) return 1;
return 0;
}
if(dp[p][s]!=-1) return dp[p][s];
ll ans=0;
ans+=dfs(p,s+1);
ans+=dfs(p... | #include "bits/stdc++.h"
using namespace std;
#define endl "\n"
using ll = long long;
const int MOD = 1e9 + 7;
ll binomialCoeff(ll n, ll k)
{
ll res = 1;
// Since C(n, k) = C(n, n-k)
if (k > n - k)
k = n - k;
// Calculate value of
// [n * (n-1) *---* (n-k+1)] / [k * (k-1) *----* 1]
for (ll i = 0; i < k; ++i)... |
#include<bits/stdc++.h>
using namespace std;
#define fastIO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define int long long int
#define fi first
#define se second
#define pub push_back
#define pi pair<int,int>
#define all(v) (v).begin(), (v).end()
#define rep(i, l, r) for(int i=(int)(l);i<(int)(r);... | #include<iostream>
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<pll, null_type,less<>, rb_tree_tag,tree_order_statistics_node_update>
#define ll long long
#define FOR(i,a,b) for(ll i=a;i... |
#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>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
//indexed set is using "int" here--------- use ll ...
// typedef tree <int,null_type,less <int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
typedef long long int ll;
typedef long do... |
//#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 <iostream>
#include <string>
#include <vector>
#include <stdio.h>
#include <math.h>
using namespace std;
int main(void){
int N;
int maxA = 1;
scanf("%d\n", &N);
vector<long long> a(N), b(N), c(N);
for(int i=0; i<N; i++){
scanf("%lld", &a[i]);
}
for(int i=0; i<N; i... |
// $%D%$.$%M%$.$%Y%$
// $%h%$:$%m%$:$%s%$
#pragma GCC optimize("O3")
#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 IOS ios::sync_with_stdio(false); cin.tie(0)
#define ll long long
#define ld long double... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constex... |
/*
#pragma GCC optimize(2)
#pragma GCC optimize(3,"Ofast","inline")
*/
#include<bits/stdc++.h>
#define ALL(x) (x).begin(),(x).end()
#define ll long long
#define db long double
#define ull unsigned long long
#define pii_ pair<int,int>
#define mp_ make_pair
#define pb push_back
#define fi first
#define se second
#define ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = a; i < b; ++i)
int debug = 0;
const int N = 2e5, K = 18, inf = 1e9;
int n, m, k, ans, c[K], dp[K][1 << K], dist[K][K], d[N];
vector <int> g[N];
bool belong(int x, int mask) {
return (mask >> x) & 1;
}
void bfs(int id) {
int start... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using LL = long long;
using P = pair<int,int>;
using vv = vector<vector<int>>;
const int INF = (int)1e9;
const LL LINF = (LL)1e18;
const int query = 1000;
const int grid_size = 30;
const int grid_total = grid_size * grid_s... | #include <bits/stdc++.h>
using namespace std;
int main() {
double a, b, c, d;
cin >> a >> c >> b >> d;
cout << fixed << setprecision(10);
cout << c * (b-a) / (c+d) + a << endl;
} |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
using namespace __gnu_pbds;
using namespace std;
#define int long long
#define endl "\n"
#define deb(x) cout<<#x<<" "<<x<<endl;
#define sc(ar,n) for(int pen=0;pen<n;pen++){ cin>>ar... | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n)... |
#include<ctime>
#include<cstdio>
#include<cctype>
using namespace std;
const int N=1e3+7;
int read() {
char c;
int x=0,f=1;
while(!isdigit(c=getchar()))
f-=2*(c=='-');
while (isdigit(c)){
x=x*10+(c-48)*f;
c=getchar();
}
return x;
}
int n,m,a[N],b[N];
int main() {
#ifndef ONLINE_JUDGE
freopen("B.in","r",st... | #include<bits/stdc++.h>
using namespace std;
using u64 = uint_least64_t;
using s64 = int_least64_t;
using ll = uint_least64_t;
int main(){
int n,m;
cin >> n >> m;
vector<int> a(n+m),b(m);
for (int i = 0; i < n; i++){
cin >> a[i];
}
for (int i = 0; i < m; i++){
cin >> a[n+i];
}
sort(a.begin(), a.end(... |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cctype>
#define N 201000
template<typename T> inline void read(T &x) {
x = 0; char c = getchar(); bool flag = false;
while (!isdigit(c)) { if (c == '-') flag = true; c = getchar(); }
while (isdigit(c)) x = x * 10 + (c ^ 48), c = ... | #include<bits/stdc++.h>
#define int long long
#define ld long double
#define fi first
#define se second
#define vll vector<int>
#define pii pair<int,int>
#define pb push_back
#define sz(v) (int)(v).size()
#define inf (int)(1e18)
#define md (int)(998244353)
#define all(v) (v).begin(),(v).end()
#define rep(i,a,b) for(int... |
#include <iostream>
#include <string>
using namespace std;
int main()
{
int n,x;
cin>>n>>x;
string s;
for(int i=0;i<n;i++){
cin>>s;
if(s[i]=='o'){
x=x+1;
}
else{
if(x>0){
x=x-1;
}
}
}
cout<<x<<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);cin.tie(NULL);
int n,x;
string s;
cin>>n>>x>>s;
for(auto i=0;i<n;i++){
if(x<=0){
if(s[i]=='o'){
x++;
}else continue;
}else{
if(s[i]=='o')x++;
else x--;
... |
#include<iostream>
#include<cmath>
using namespace std;
int main(){
long long a[4];
for(int i=0;i<4;i++)
cin>>a[i];
if(a[1]==a[3]&&a[2]==a[0])
cout<<"0";
else if(a[0]+a[1]==a[2]+a[3])
cout<<"1";
else if(a[0]-a[1]==a[2]-a[3])
cout<<"1";
else if(abs(a[0]-a[2])+abs(a[1]-a[3])<=3)
cout<<"1";
else if((a[0]+... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define NOT_FOUND -1
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int main() {
int N;
cin >> N;
if(N % 2) {
cout << "Black" << endl;
} else {
cout << "White" << en... |
#include <bits/stdc++.h>
#include <fstream>
#define ll long long
#define pi pair<int,int>
#define pll pair<long,long>
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define vvvvi vector<vvvi>
#define vc vector<char>
#define vll vector<long long>
#define vpi vector<pi>
#define vpll vector<pll... | #include<bits/stdc++.h>
#define io ios_base::sync_with_stdio(false); cin.tie(NULL)
#define nl "\n"
#define fr first
#define sc second
#define MP make_pair
#define pb push_back
#define VI vector<int>
#define VII vector<ll>
#define MAP map <ll,ll>
#define PI pair < int , int >
#define sz(v) (int)(v).size()
#define all(v... |
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;
template<class T>
struct graph{
struct edge{
int to;
T cost;
edge(int to, T cost) : to(to), cost(cost){}
bool operator<(const edge& r)const { return cost < r.cost; }
};
int V;
... | #include <iostream>
#include <vector>
#include <queue>
using namespace std;
typedef long long ll;
ll d[20][200010],dp[1<<20][20];
vector<int> G[100010];
queue<pair<int,int>> que;
void bfs(int s,int t){
que.push({0,s});
while(que.size()){
pair<int,int> p = que.front();
que.pop();
if(d[t]... |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const long long N=2e6+6;
ll a[N],b[N];
long long n,m,q,ans;
struct segment {
long long siz[N<<2],sum[N],ls[N<<2],rs[N<<2],cnt=0,root=0;
void change(ll l,ll r,ll &p,ll x,ll k) {
if(!p) p=++cnt;
if(l==r) {
sum[p]+=k*x;
siz[p]+=k;
return;
}... | #include<bits/stdc++.h>
#define int long long
using namespace std;
const int P=1e9+7,N=4e5+5;
int A[N],B[N],b[N],T[N],X[N],Y[N],ans,len;
struct BIT{
int t[N],sum;
void add(int i,int k) {
sum+=k;
for(;i<=len;i+=(i&-i))t[i]+=k;
}
int qry(int i) {
int res=0;
for(;i>0;i-=(i&-i))res+=t[i];
return res;
}
}T1,T... |
#pragma GCC optimize ("Ofast,unroll-loops")
#pragma GCC optimize("no-stack-protector,fast-math")
#include <bits/stdc++.h>
using namespace std;
constexpr int N = 2e6+7;
constexpr int M = 998244353;
#define fastio ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#define int long long
#define pii pair<int, int>
#... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
int main() {
ll N, K;
ll mod;
cin >> N >> K >> mod;
ll MX = 500000;
vector<vector<ll>> dp(N, vector<ll>(MX, 0));
dp[0][0] = 1;
for (int i = 1; i < N; i++) {
for (int j = 0; j < i; j++) {
... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using pii = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
void chmin(int &ret, const int &tg) {
if (tg < ret) ret = tg;
}
void chmax(int &ret, const int &tg) {
if ... | //IQ134高知能系Vtuberの高井茅乃です。
//Twitter: https://twitter.com/takaichino
//YouTube: https://www.youtube.com/channel/UCTOxnI3eOI_o1HRgzq-LEZw
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF INT_MAX
#define LLINF LLONG_MAX
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<... |
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
long long a[200010],b[200010];
int n,m;
int main(){
scanf("%d%d",&n,&m);
for(int i=1;i<=n;++i) scanf("%lld",&a[i]);
for(int i=1;i<=m;++i) scanf("%lld",&b[i]);
sort(a+1,a+1+n);
sort(b+1,b+1+m);
long long l=0,r=0;
for(int i=n;i>=2;i-... | #include <iostream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <utility>
#include <algorithm>
#include <cmath>
#include <climits>
#include <iomanip>
#include <queue>
#include <stack>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < n; i++)
int main() {
... |
#include <bitset>
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <limits>
#include <iomanip>
#include <stack>
#include <algorithm>
#include <iostream>
#include <string>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <math.h>
using namespace std;
typed... | #include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define pb push_back
#define fastio ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define ll long long
#define all(v) v.begin(),v.end()
ll sum[1000000+10]={};
int main()
{
ll n, a , b, i, j;
ll total=0,l,r;
sum[0]... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vb = vector<bool>;
using vc = vector<char>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvl = ... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int mod =1e9+7;
int n;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin>>n;
if(n%2)
cout<<"Black\n";
else
cout<<"White\n";
return 0;
}
|
///Bismillahir Rahmanir Rahim
#include "bits/stdc++.h"
#define ll long long
#define int ll
#define fi first
#define si ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
//素数判定 O√N
bool is_prime(long long x)
{
assert(0<=x);
if(x<2)
{
return false;
}
for(long long i=2;i*i<=x;i++)
{
if(x%i==0)
{
return false;
}
}
return true;
}
template<class T> void chmin(T& a,T b){
if(a>b){
... |
#include"bits/stdc++.h"
using namespace std;
#define ri register int
#define ll long long
#define N 2010
int n,a[N],mn=0x3f3f3f3f;
inline int get_gcd(int x,int y){
return !y?x:get_gcd(y,x%y);
}
unordered_map<int,int>vis;
int main(){
ios::sync_with_stdio(false);
cin>>n;
for(ri i=1;i<=n;++i){
cin>... | #include <cstdio>
#include <cmath>
#include <iostream>
#include <set>
#include <algorithm>
#include <vector>
#include <map>
#include <cassert>
#include <string>
#include <cstring>
#include <queue>
using namespace std;
#define rep(i,a,b) for(int i = a; i < b; i++)
#define S(x) scanf("%d",&x)
#define S2(x,y) scanf("%d%... |
#include <bits/stdc++.h>
using namespace std;
#define END '\n'
#define int long long
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ss second
#define bug(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define loop(i, a, b) for(int i = (a); i < (b); i++)
#define loopb(i, b, a) for(int ... | #include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
// using namespace atcoder;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = "... |
#include <bits/stdc++.h>
#define ms(a,b) memset(a, b, sizeof(a))
#define rep(a,b,c) for(int a = (int)(b); a < (int)(c); a++)
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define m_p(a,b) make_pair(a, b)
#define lson l,mid,o << 1
#define rson mid + 1,r,o << 1 | 1
#define ls o << 1
#defi... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,s,t) for(int i = (int)(s); i < (int)(t); i++)
int main(){
int n;
cin >> n;
vector<ll> a(n);
rep(i,0,n) cin >> a[i];
vector<ll> aa(n);
rep(i,0,n) aa[i] = a[i]*a[i];
vector<ll> aarec(n);
aarec[0] = aa[0];
... |
#include <iostream>
using namespace std;
int main() {
int a,b,c;
cin>>a>>b>>c;
cout<<a-b+c;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define MAX 100
#define THOU 1000
#define FIVEMAX 100000
#define NINEMAX 1000000000
#define TWEMAX 1000000000000
#define rep(i,n) for (int i=0;i<n;i++)
#define drep(i,n) for(int i=n-1;i>=0;i--)
#define arep(i,a,n) for(int i=a;i<n;i++)
#define darep(i,a,n... |
#include <cstdio>
#include <cstring>
#include <algorithm>
#define reg register
typedef long long ll;
const int N=1400;
ll f[N]={0,1},n,x,y;
ll g[N][2];
int st[N],opt[N],tot,top;
ll R()
{
reg ll x=0; reg bool f=0; reg char ch=getchar();
for(;ch<48||ch>57;ch=getchar()) f|=(ch=='-');
for(;ch>=48&&ch<=57;ch=getchar()) x... |
/**
* Coded by : lucky_21
* --------Lokesh Singh
**/
#include<bits/stdc++.h>
using namespace std;
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T> using oset=tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_upd... |
#include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } retu... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define pi 3.141592653589793238
#define rep(i,a,b) for (int i = a; i <= b; i++)
#define zip(i,a,b) for(int i=a;i<b;i++)
#define rzip(i,a,b) for(int i=a;i... |
#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 ulli unsigned long long int
using namespace std;
int main()
{
ulli n,k;
cin>>n>>k;
vector<pair<ulli,ulli>>v;
for(int i = 0;i<n;i++)
{
ulli a,b;
cin>>a>>b;
v.push_back({a,b});
}
sort(v.begin(),v.end());
for(int i = 0;i<n;i++)
{
... |
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int MAXN = 510;
int A[MAXN];
int32_t main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int T;
cin >> T;
while(T--)
{
int N;
cin >> N;
for(int i = 1 ; i <= N ; i++)
{
cin >> A[i];
}
... | #include <cstdio>
#include <cstring>
#include <cmath>
#include <cassert>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <iostream>
#include <numeric>
/* debug macros */
#ifdef WAFDAYO
#define DBG_LINE() {std::cerr<<"\e[2m[L"<<__LINE__<<... |
#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,... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define forn(i,x,n) for(int i = x; i < n; ++i)
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int n,m,s,g;
cin>>n>>m;
vector<int> dist(n*m);
vector<bool> done(n*m,false);
vector<vector<int>> adj(n*m);
unordered_map<char,vect... |
#include <bits/stdc++.h>
using namespace std;
long long i,j,p,l,t;
long long c[234567],a[213167],b[211167],d,e[234567],tt=0,k=0,y,z,n=0,x;
char m;
string q,w,s;
int main(){
cin >>t>>l>>p;
cout<<t+l+p-min(t,min(l,p));
} | #include <bits/stdc++.h>
using namespace std;
int main(void)
{
long long x,y;
cin >> x >> y;
long long a[3]={0};
if(x==y) cout<<x<<endl;
else
{
a[x]++;
a[y]++;
for(long long i=0;i<3;i++)
{
if(a[i]==0) cout<<i<<endl;
}
}
return 0;
} |
/** Fucc :/
- doanphuc : /
** author: doanphuc. **
**/
#include <bits/stdc++.h>
#define TASK ""
#define inpf freopen(TASK".inp", "r", stdin)
#define outf freopen(TASK".out", "w", stdout)
#define FOR(i,x,y) for(int i = x; i <= y ; i ++)
#define FORT(i,x,y) for(int i = x; i < y ; i ++)
#define FORD(i,x,y) for(int i = x... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std; using ll = long long;
using ull = unsigned long long; using P = pair<int, int>;
const int INF = 1e9; const int MOD = 1000000007;
const int dx[] = {-1,0,1,0}; const int dy[] = {0,-1,0,1};
// const int dx[] = {-1,-1,-1, 0, 0, 1, ... |
#include<bits/stdc++.h>
using namespace std;
int h,w,a,b;
int ans;
void dfs(int i,int bit,int a,int b){
if(i==h*w){
ans++;
return;
}
if(bit&(1<<i)){
dfs(i+1,bit,a,b);
return;
}
if(b){
dfs(i+1,bit|1<<i,a,b-1);
}
if(a){
if(i%w!=w-1&&(~bit&1<<(i+1))){
dfs(i+1,bit|1<<i|1<<(i+1),a-1,b);
}
if(i+w<h... | // execute g++ main.cpp -std=c++14 -I C:\Users\naoya\Desktop\code\Atcoder
#include<bits/stdc++.h>
//#include<atcoder/all>
typedef long long ll;
typedef long double ld;
using namespace std;
//using namespace atcoder;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
//ordered_set 重複不可
#include <ext/pb_ds/assoc_con... |
//---Vaidik Patel---//
//-------------------Proud to be Indian--------------------------------//
#include<bits/stdc++.h>
using namespace std;
#include<ext/pb_ds/assoc_container.hpp> // include the associative containers or group of templates such as set,multi multimap, map etc.
#include<ext/pb_ds/tree_policy.hpp> // in... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define u unsigned
#define ull unsigned long long
#define ld long double
#define pb push_back
#define fasterInOut ios::sync_with_stdio(false); cin.tie(0);
#define pi acos(-1)
#define f(i,a,b) for(int i=(a);i<=(b);i++)
#define fr(i,a,b) for(int i=(a);i>=(... |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for(int i = (j); i < (int)(n); i++)
#define print(s) cout << s << endl
#define SIZE(s) long long(s.size())
using Graph = vector<vector<int>>;
using ll = long long;
int main(){
int a, b, c; cin >> a >> b >> c;
if(a == b) print(c);
else if(b == c)... | /*
／＞ フ
| _ _|
／`ミ _x 彡
/ |
/ ヽ ?
／￣| | | |
| (￣ヽ＿_ヽ_)_)
＼二つ
*/
#pragma GCC optimize("Ofast","inline","-ffast-math")
#pragma GCC target("avx,sse2,sse3,sse4,mmx")
#include<bits/stdc++.h>
#define int long long
#define pb push_back
#define pf push_front
#define F first
#define S s... |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define forn(i,x,n) for(int i = x; i < n; ++i)
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int n,m,s,g;
cin>>n>>m;
vector<int> dist(n*m);
vector<bool> done(n*m,false);
vector<vector<int>> adj(n*m);
unordered_map<char,vect... | #include "bits/stdc++.h"
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
// #pragma GCC optimization ("O3")
// #pragma GCC optimization ("unroll-loops")
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
//#include <boost/multiprecision/cp... |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
// #include <boost/multiprecision/cpp_int.hpp>
// using namespace boost::multiprecision;
// using cint = cpp_int;
#define fastio \
std::cin.tie(nullptr); \
std::ios::sync_with_stdio(false);
using ll = long long;
using ld = long double;
#define... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define pii pair<int,int>
#define all(v) v.begin(),v.end()
#define pb push_back
#define ff first
#define ss second
#define max(a,b) (a>b ? a:b)
#define min(a,b) (a<b ? a:b)
void solve(){
int r,x,y;
cin>>r>>x>>y;
int ans=1;... |
#include <bits/stdc++.h>
using namespace std;
#define ios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl '\n'
#define ll long long
#define ding cerr<<endl<<"Time: "<<(clock()*1000./CLOCKS_PER_SEC)<<" ms"<<endl;
const int maxn=2e5+10;
int siz[maxn],dfn[maxn],rdfn[maxn],tot,totd,n;
vector<int> yuan[maxn],cu... | //بسم الله الرحمن الرحيم
// -----> Author : N A Y E M
// -----> [ CSE-19 , CU ]
#include<bits/stdc++.h>
using namespace std ;
typedef long long ll;
typedef unsigned long long ull ;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int,int> pii;
t... |
#include <bits/stdc++.h>
using namespace std;
#define eb emplace_back
using ll = long long;
const int inf = 1e9+5;
const ll INF = 1e18+5;
const int nax = 2e5+500;
void out(vector<int> &a) {
cout << a.size();
for(int z: a) {
cout <<" "<< z;
}
cout <<"\n";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<cmath>
#include<queue>
#include<stack>
#include<deque>
#include<list>
#include<bitset>
#include<sstream>
using namespace std;
using ll = long long;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define REP(i, n) for(int i = 0;... |
#include <bits/stdc++.h>
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(), (x).end()
#define ll long long
using namespace std;
const int MAX = 5e5+50;
char s[MAX], t[MAX];
int n;
vector<int> a, b;
int main() {
scanf("%d%s%s", &n, s + 1, t + 1);
for (int i = 1; i <= n; i++) {
if (s[i] == '0') a.emplace_b... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define deb(x) cerr << #x << ":" << x << "\n"
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pi;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <e... |
#include <bits/stdc++.h>
using namespace std;
int N, vis[10005];
int main () {
#ifndef ONLINE_JUDGE
freopen("cpp.in", "r", stdin);
#endif
cin >> N;
if (N == 3) return puts("6 10 15") & 0;
for (int i = 6; i <= 10000; i += 6) vis[i] = 1;
for (int i = 10; i <= 10000; i += 10) vis[i] = 1;
for (int i = 15; i <= 100... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 10009;
int n, a[N], tot;
int main() {
cin >> n;
for(int i = 6; i < 10000; i ++) {
if(i == 12) continue;
if(i % 6 == 0 || i % 10 == 0 || i % 15 == 0)
a[tot ++] = i;
}
for(int i = 0; i < n; i ... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
int ... | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << (a+b) / 2 << ' ' << (a-b) / 2 << endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define ll long long
#define ld long double
#define test ll t=0;cin>>t; while(t--)
#define loop(i,a,b) for(i=a;i<=b;i++)
#define loopr(i,a,b) for(i=a;i>=b;i--)
#define lb lower_bound
#define ub upper_bound
#defin... | #include<bits/stdc++.h>
using namespace std;
#define stop exit(0)
#define pb push_back
#define skip continue
#define ll long long
ll a,b,c,d=0,e=0,i,f=0,g=0,j,k=0,l=0,r,z,m,h,p[200001],mod=1000000007,mod1=998244353;
string t,x,q,s;
long long df[101];
//double ;
vector<ll>v,u,w;
vector<ll>dv[101];
//vector<string>;
set<... |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
typedef pair<int, LL> PIL;
const int N = 1e5 + 10, M = 3e5 + 10;
const int inf = 0x3f3f3f3f;
const LL INF = 0x3f3f3f3f3f3f3f3f;
#define x first
#define y second
const int mod = 1e9 + 7;
#define gcd __gcd
void solve() {
LL ... | #include <bits/stdc++.h>
#include <string>
typedef long long ll;
typedef long double ldb;
typedef double db;
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define pf push_front
#define ins insert
#define mp make_pair
#define len(s) s.length()
#define forp(i, a, b) for (ll i = a; i <= ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.