code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
//#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>
using namespace std;
#define int long long int
int fun(int a)
{
int ret=0;
while(a>0)
{
ret+=a%10;
a=a/10;
}
return ret
;}
main()
{
int n;
cin>>n;
float x[n],y[n];
for(int i=0;i<n;i++)
{
cin>>x[i]>>y[i];
}
int cou=0;
for(int i=0;i<n;i++)
{
for(int j=i+1;j<n;j++)
{
float num=(y[... |
#include <iostream>
#include <cmath>
#include <string>
#include <array>
#include <queue>
using namespace std;
#define ll long long int
int max(int a, int b){
if (a<=b)
{
return b;
}
else{
return a;
}
}
void solve(){
ll n;
cin>>n;
ll a[n];
ll p[n];
ll maxv... | //
//#ifdef ONLINE_JUDGE
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("O2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
//////
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
//#endif
#include <bits/stdc++.h>
#include <utility>
#define all(x) (x).begin(), (x).end()
#... |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define debug(var) do{cout << #var << " : "; view(var);}while(0)
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;ret... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define vi vector<int>
#define pi pair<int, int>
#define vpi vector<pair<int, int> >
#define REP(i,a,b) for (int i = a; i <= b; i++)
const int mod = 1e9 + 7;
const int INF =... |
#include <bits/stdc++.h>
#define lowbit(x) ((x) & (-x))
using namespace std;
typedef long long LL;
const int N = 200005;
int n, e;
int a[N], b[N], c[N], d[N * 4];
LL m, f[N * 4];
void init() {
memset(f, 0, sizeof(f));
}
void add(int p, int val) {
for (; p < e; p += lowbit(p)) f[p] += val;
}
LL cal... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define pb push_back
#define vi vector<int>
#define all(a) (a).begin(),(a).end()
#define F first
#define S second
#define endl "\n"
#define fast i... |
#include <iostream>
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main(){
int n;cin>>n;
int a[n],b[n],c[n],d[n],e[n];
for(int i=0;i<n;i++){
cin>>a[i]>>b[i]>>c[i]>>d[i]>>e[i];
}
int minn=0;int maxx=1e9;int ans=0;
while(minn<=maxx){
int midd=minn+(maxx-minn)/2;
/*int c... | #include <bits/stdc++.h>
using namespace std;
#define mem(a) memset(a, 0, sizeof(a))
#define dbg(x) cout << #x << " = " << x << endl
#define fi(i, l, r) for (int i = l; i < r; i++)
#define cd(a) scanf("%d", &a)
typedef long long ll;
map<ll, bool> mp; //防止重复计算
int main()
{
ll n, s = 0;
cin >> n;
ll k = sqrt(... |
#include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ALL(x) x.begin(), x.end()
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = m... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define pii pair<int, int>
const int N = 1e5 + 5;
signed main () {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<pii> vx, vy, v;
for (int i = 0; i < n; i++) {
int x, y;... |
#include <bits/stdc++.h>
using Int = long long; // clang-format off
#define REP_(i, a_, b_, a, b, ...) for (Int i = (a), lim##i = (b); i < lim##i; i++)
#define REP(i, ...) REP_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define ALL(v) std::begin(v), std::end(v)
struct SetupIO { SetupIO() { std::cin.tie(nullptr), std... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
constexpr ll MOD = 1000000007;
#ifndef ONLINE_JUDGE
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " (" << x.first << " : "... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
using Graph = vector<vector<int>>;
struct Edge {
int to;
int cost;
Edge(int t, int c) : to(t), cost(c) {}
};
using edge = struct {
long long to;
long long cost;
};
template <class T>
inline bool chmax(T& a, T... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void dfs(int i, int p, vector<int> &colors, vector<vector<int>> &adj_list, set<int> &used_color, vector<bool> &ans) {
bool add_color;
if (used_color.count(colors[i])) {
add_color = false;
ans[i] = false;
} else {
add_color = true;
... |
#pragma region templates
//#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;
t... | #include<bits/stdc++.h>
#define ll long long
typedef unsigned long long ull;
using namespace std;
const int Max=1e6+20;
const int Maxn=1e7+20;
const int mod=1e9+7;
const int c=231;
inline int read()
{
int f=1,x=0;char ch;
do{ch=getchar();if(ch=='-')f=-1;}
while(ch<'0'||ch>'9');
do{x=x*10+ch-'0';ch=getc... |
#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;
int main(){
int n;
cin >> n;
vector<int> a(n);
rep(i,n) cin >> a[i];
int ans = 0;
rep(i,n){
... | #include <bits/stdc++.h>
using namespace std;
using namespace chrono;
#define fast_IO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long
#define rep(i,a,b) for (int i = a; i < b; i++)
#define rev(i,n) for(int i=n-1;i>=0;i--)
#define pii ... |
#include<bits/stdc++.h>
using namespace std;
long double a,b;
int main(){
cin>>a>>b;
cout<<fixed<<setprecision(20)<<100*(a-b)/a;
}/*
00100001000010000100
*/ | #include<iostream>
using namespace std;
int main()
{
float A, B, C;
float D;
cin >> A >> B;
C = A-B;
D = (C/A)*100.0;
if(A > B)
cout << D;
else
return -1;
return 0;
}
|
#include <bits/stdc++.h>
#define index(i, n) for (long long i = 0; i < n; i++)
#define index1(i, n) for (long long i = 1; i <= n; i++)
#define range(i, a, b) for (long long i = a; i < b; i++)
#define indexD(i, n) for (long long i = n - 1; i >= 0; i--)
#define index1D(i, n) for (long long i = n; i >= 1; i--)
#define ra... | #include<bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
#define dbg(x...) do{cout << "\033[32;1m" << #x << "->" ; err(x);} while(0)
void err(){cout << "\033[39;0m" << endl;}
template<template<typename...> class T,typename t,typename... A>
void err(T<t> a,A... x){for (auto v:a) cout << v << ' '; err(x...);}
te... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N; cin >> N;
bool A[110][110] = {};
for(int i = 0; i < N; i++){
for(int j = 0; j < N; j++){
char c; cin >> c; A[i][j] = c - '0';
}
}
double ans = 0;
for(int i = 0; i < N; i++){
bool ok[110] = {};
ok[i] = true;
queue<int> que;
que... | #pragma GCC optimize ("Ofast")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i=(a); i<(b); i++)
#define FORD(i, a, b) for (int i=(a); i>(b); i--)
#define PPC(x) __builtin_popcount(x)
#define MSB(x) (63 - __builtin_clzll(x))
#define SZ(x) ((int)(x).size())
#define HASK(S, x) (S.find(x)... |
#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#define int long long
#define rep(i, n) for(i = 0; i < n; i++)
using namespace std;
int n, m;
int a[2000... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
set<int> getFactors(ll n) {
set<int> st;
for (ll i = 1; i * i <= n; ++i) {
if (n % i == 0) {
st.insert(i);
st.insert(n / i);
}
}
return st;
}
void solve() {
int N, M; cin >> N >> M;
vect... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(var, begin, end) for (int var = (begin); var <= (end); var++)
#define RFOR(var, begin, end) for (int var = (begin); var >= (end); var--)
#define REP(var, length) FOR(var, 0, length - 1)
#define RREP(var, length) RFOR(var, length - 1, 0)
#de... | #include<bits/stdc++.h>
using namespace std;
#define int long long
inline void solve()
{
int L,R;
cin>>L>>R;
if (2*L>R) cout<<0<<endl;
else cout<<(R-2ll*L+1ll)*(R-2ll*L+2ll)/2ll<<endl;
}
signed main()
{
ios::sync_with_stdio(false); cout.tie(NULL);
int t;
cin>>t;
for (int i=1;i<=t;i++) solve();
} |
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<ll>;
using vi2 = vector<vector<ll>>;
using vl = vector<ll>;
using vl2 = vector<vector<ll>>;
using vb = vector<bool>;
using vb2 = vector<vector<... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define MOD 1000000007
int main() {
ll x, y;
cin >> x >> ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> P;
typedef vector<ll> VI;
typedef vector<VI> VVI;
#define REP(i,n) for(int i=0;i<(n);i++)
#define ALL(v) v.begin(),v.end()
constexpr ll MOD=1000000007;
constexpr ll INF=2e18;
struct Ad{ll x, y, r, num;};
struct Recang{
ll x... | /*
これを入れて実行
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>
#define ll long long
#define min(x,y) x<y?x:y
#define max(x,y) x>y?x:y
using namespace std;
int main()
{
ll n,k;
cin >> n>>k;
while (k--)
{
if(n%200==0)
{
n=n/200;
}
else
{
n = (n*1000)+200;
}
}
... | /**
* author: Taichicchi
* created: 13.04.2021 21:52:36
**/
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
int M, H;
cin >> M >> H;
cout << ((H % M ==... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int mod = 200;
int n; cin >> n;
vector<int> a(n);
for(int i = 0; i < n; i++){
int ai; cin >> ai;
ai %= mod;
a[i] = ai;
}
vector<vector<uint>> b(200);
n = min(8,n);
for(uint i = 1; i < (1<<n); i++){
... | #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<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define ll long long
#define ff first
#define ss second
#define pi ... |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
#define rep(i,n) for(int i=0;i<n;i++)
using P=pair<int,int>;
int n;
string s,t;
bool bo(){
int s1=0,t1=0;
rep(i,n){
if(s[i]=='1') s1++;
if(t[i]=='1') t1++;
}
return (s1==t1);
}
int main(){
cin >> n >> s >> t;
... | #include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < (int)(n); i++)
#define ALL(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
using ll = long long;
int main() {
int K; string S, T; cin >> K >> S >> T;
vector<ll> cards(10, K), scards(10, 0), tcards(10, 0);
for (auto c : S) {... |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, N) for(int i = 0; i< N; i++)
typedef long long ll;
int main() {
int n, m; cin >> n >> m;
vector<int> h(n), w(m);
rep(i, n) cin >> h[i];
rep(i, m) cin >> w[i];
sort(h.begin(), h.end());
sort(w.begin(), w.end());
//左詰での身長差の累積和と右詰での累積... | #include <bits/stdc++.h>
typedef long long LL;
#define lowbit(x) (x & (-x))
const LL inf = 1e17+9;
const LL mod = 1e9+7;
const LL maxn = 2e5+8;
LL n, m, h[maxn], w[maxn], sa[maxn], sb[maxn];
void solve() {
LL i, j, ans = inf;
scanf("%lld%lld", &n, &m);
for (i = 1; i <= n; i++) scanf("%lld", &h[i]);
... |
#include <bits/stdc++.h>
//#include<boost/multiprecision/cpp_int.hpp>
//#include<boost/multiprecision/cpp_dec_float.hpp>
//#include <atcoder/all>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a; i >-1; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define... | #include <bits/stdc++.h>
using namespace std;
#define fo(i, x, y) for (int i = (x); i <= (y); ++i)
#define fd(i, x, y) for (int i = (x); i >= (y); --i)
const int maxn = 2e5 + 5, inf = 1e9;
struct edge{int to; edge *nxt;} *arc[maxn], pool[maxn << 1], *pt = pool;
int n, k, len, cnt;
int mi[maxn], mx[maxn];
int getint... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i=0; i<(ll)(n); i++)
#define rev_rep(i, n) for (ll i=(n); i > 0; i--)
#define REP(i, n) for (ll i=1; i<=(ll)(n); i++)
#define FOR(i, n, m) for (ll i=(n); i<=(ll)(m); i++)
#define rev_FOR(i, n, m) for (ll i=(n); i<=(ll)(m); i--)
#define ll long long... | #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;
#define forr(i,a,n) for(long long int i=a; i<n; i++)
#define loop(i,a,n) for(long long int i=a; i>=n; i--)
int main()
{
ios_base :: sync_with_stdio(false),cin.tie(NULL);
long long int a, b, ans=0;
cin>>a>>b;
string s="";
forr(i, 0, a)
s+=(i+'0');
long lon... | #include <bits/stdc++.h>
#include <algorithm>
using namespace std;
int main(){
int n,k;
cin >> n >> k;
vector<vector<int>> T(n, vector<int>(n));
for(int i=0; i<n; i++){
for(int j=0; j<n; j++){
cin >> T[i][j];
}
}
vector<int> index;
for(int i=0; i<n; i++)index.push_back(i);
int ans = 0;
do{
int tim... |
#pragma region head
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using pi = pair<int, int>;
using pll = pair<ll,ll>;
template <class T> using vv = vector<vector<T>>;
#define _roverload(_a1,_a2,_a3,name,...) name
... | #include<bits/stdc++.h>
#include<iostream>
#include<vector>
#include<algorithm>
#include<set>
#include<iomanip>
#include<queue>
#include<cmath>
#include<stack>
#include<map>
#define ll long long
#define skip cin>>ws;
#define vll vector<ll>
#define vi ... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int k;
cin >> k;
long long ans = 0;
for (int i = 1; i <= k; i++) {
for (int j = 1; j <= k / i; j++) {
for (int l = 1; l <= k / (i * j); l++) {
ans++;
}
}
}
cout << ans << endl;
... | // C++(GCC 9.2.1)
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define repex(i, a, b, c) for(int i = a; i < b; i += c)
#define repx(i, a, b) repex(i, a, b, 1)
#define rep(i, n) repx(i, 0, n)
#define repr(i, a, b) for(int i = a; i >= b; i--)
LL g[202020], p[202020];
int main(){
// 1. 入力情... |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <utility>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <cstdio>
#include <limits>
#include <numeric>
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
using namespace... | #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<iostream>
#define ll long long
using namespace std;
ll T,X,Y,P,Q,a,b,c,k1,k2,tans;
ll exgcd(ll a,ll b,ll &x,ll &y) {
if(!b) {
x=1,y=0;
return a;
}
int t=exgcd(b,a%b,y,x);
y-=a/b*x;
return t;
}
int main() {
cin>>T;
while(T--) {
cin>>X>>Y>>P>>Q;
a=2*X+2*Y,b=P+Q;
tans=5e18;
for(int q=0; q<Q; q+... | #include<bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define fbo find_by_order
#define ook order_of_key
#define fi first
#define se second
#define long long long
#define mul(a, b) ((a*b)%MOD)
#define add(a, b) (... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a < b) {
for (int i = 1; i <= b; i++) {
cout << -i << " ";
}
for (int i = 1; i < a; i++) {
cout << i << " ";
}
a--;
cout << (b*(b+1)-a*(a+1))/2 << endl;
}
else {
for (int i = 1; i ... | #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<iostream>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
cout<<(a+b)/2<<" "<<(a-b)/2<<endl;
return 0;
} | /*ABIDSTIC*/
#include <bits/stdc++.h>
/*---------------------------------PB_DS---------------------------------*/
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// #define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_nod... |
/**
* Made by: Diego Briaares
* At: 06.03.2021 16:16:56
**/
#include <bits/stdc++.h>
using namespace std;
void optimize() {
ios_base::sync_with_stdio(0);
cin.tie(0);
}
int main () {
optimize();
int n;
cin >> n;
vector<pair<int, int>> emp(n);
int ans = 1e9;
for (int i = 0; i < n; i++) {
... | #include <cmath>
#include <deque>
#include <algorithm>
#include <iterator>
#include <list>
#include <tuple>
#include <map>
#include <unordered_map>
#include <queue>
#include <set>
#include <unordered_set>
#include <stack>
#include <string>
#include <vector>
#include <fstream>
#include <iostream>
#include <functional>
#... |
//selem
#include <bits/stdc++.h>
//void IO() {freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);}
using namespace std;typedef long long ll;
#define all(x) begin(x), end(x)
#define pb push_back
typedef pair<ll,ll> pll;;typedef map<ll, ll> mll;
typedef vector<pll> vpll;
typedef vector<ll> vll;
int Arr[1... | #line 1 "main.cpp"
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; (i) < (int)(n); ++ (i))
#define rep3(i, m, n) for (int i = (m); (i) < (int)(n); ++ (i))
#define repr(i, n) for (int i = (int)(n) - 1; (i) >= 0; -- (i))
#define rep3r(i, m, n) for (int i = (int)(n) - 1; (i) >= (int)(m); -- (i))
#define ALL(x) ... |
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#include<iostream>
using namespace std;
#define int long long int
#define double long double
#define all(x) (x).begin(), (x).end()
#define RemoveDuplicates(a) a.resize(unique(all(a))-a.begin())
#define Debug(x) cerr<<"["<<#x<<": "<<x<<"]"
#define endl '\n'
void s... | #include <bits/stdc++.h>
using namespace std;
// #define LOCAL // 提出時はコメントアウト
#define DEBUG_
typedef long long ll;
const double EPS = 1e-9;
const ll INF = ((1LL<<62)-(1LL<<31));
typedef vector<ll> vecl;
typedef pair<ll, ll> pairl;
template<typename T> using uset = unordered_set<T>;
template<typename T, typename U> usi... |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<algorithm>
#include<queue>
#include<vector>
#include<stack>
#include<map>
#include<set>
#define mod 1000000007
#define ll long long
using namespace std;
const int maxx=600010;
ll t,n,m;
ll ans=0,total=0,sum=0,cnt=0,l=1,r=1;... | #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;
typedef tree<pair<int, int>,null_type,less<pair<int, int... |
/*ver 7*/
#include <bits/stdc++.h>
using namespace std;
void init() {cin.tie(0);ios::sync_with_stdio(false);cout << fixed << setprecision(15);}
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vd = vector<ld>;
using vs = vector<string>;
using vb = vector<bool>;
using vvl = vector<vector<ll>>;
... | #include <bits/stdc++.h>
using int32 = int;
using int64 = long long;
using namespace std;
class Solution
{
#define int int64
#define sfor(i, n) for (int i = 1; i <= n; ++i)
#define tfor(i, n) for (int i = 0; i < n; ++i)
int x, y, r, res = 0;
void SHURU()
{
double a, b, c;
cin >> a >> b >>... |
#include<iostream>
using namespace std;
int main(){
int a,b,x,y,ans;
cin>>a>>b>>x>>y;
if(a>b)
if(2*x<y)
ans=2*x*(a-b)-x;
else
ans=x+y*(a-b-1);
else
if(2*x<y)
ans=2*x*(b-a)+x;
else
ans=x+y*(b-a);
cout<<ans;
} | #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;
signe... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define int long long
const int N = (int) 2e6 + 7;
int n, k, a[N];
vector<int> p[N];
signed main() {
ios::sync_with_stdio(0); cin.tie(0);
cin >> n >> k;
for (int i = 0; i <= n; i++) p[i].push_back(0);
for (int i = 1... | #include<bits/stdc++.h>
using namespace std;
#define gc c=getchar()
#define r(x) read(x)
#define ll long long
#define db double
template<typename T>
inline void read(T&x){
x=0;T k=1;char gc;
while(!isdigit(c)){if(c=='-')k=-1;gc;}
while(isdigit(c)){x=x*10+c-'0';gc;}x*=k;
}
ll n,k;
inline ll calc(ll x){
... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int64_t MOD=1000000007;
const long long INF = 1LL<<60;
void YN(bool x){
if(x) cout<<"Yes";
else cout<<"No";
}
int main() {
bool f=false;
string S;cin>>S;
int s=S.size();
vector<int> C(10,0);
rep(i,s) C[S[i]-... | //#pragma GCC optimize ("O2")
//#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i ... |
#include <bits/stdc++.h>
#include <cstdlib>
#include <cmath>
#include <algorithm>
using namespace std;
using ll = long long;
using P = pair<int,int>;
using Graph= vector<vector<int>>;
#define rep(i,n) for (ll i=0; i < (n); ++i)
#define rep2(i,n,m) for(ll i=n;i<=m;i++)
#define rep3(i,n,m) for(ll i=n;i>=m;i--)
#define p... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr char newl = '\n';
ll dp[100][200000 + 10];
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n, K;
ll m;
cin >> n >> K >> m;
int lim_sum = (n - 1) / 2;
lim_sum = lim_sum * (lim_sum + 1) / 2 * K... |
#include<iostream>
#include<algorithm>
using namespace std;
struct qwe{
int t,i;
}a[1005],b[1005];
int n;
bool cmp(qwe a,qwe b){
return a.t<b.t;
}
int main()
{
cin>>n;
for(int i=0;i<n;i++) cin>>a[i].t>>b[i].t,a[i].i=b[i].i=i;;
sort(a,a+n,cmp);
sort(b,b+n,cmp);
if(a[0].i!=b[0].i) cout<<max(a[... | #include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define LL long long
#define ULL unsigned long long
const LL INF = 1LL<<62;
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 <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;++i)
#define repn(i,n) for(int i=1;i<=n;++i)
#define LL long long
#define pii pair <int,int>
#define fi first
#define se second
#define pb push_back
#define mpr make_pair
using namespace std;
const LL MOD=1e9+7;
int n,m,a[20][20],ok[300000],dp[300000];
int ... | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define all(x) (x).begin(),(x).end()
#define uniq(v) (v).erase(unique(all... |
#include<bits/stdc++.h>
using namespace std;
#define Y cout<<"YES"<<endl;
#define N cout<<"NO"<<endl;
#define tc int t; cin>>t; while(t--)
#define eki int n; cin>>n;
#define loop for(int i=0; i<n; i++)
#define mem(a,b) memset(a, b, sizeof(a) )
const int mx=1e4+123;
int main(){
int a, b, c;
cin>>a>>b>>c;
... | /*بِسْمِ اللَّهِ الرَّحْمَنِ الرَّحِيم*/
#include <iostream>
using namespace std;
int main()
{
int arr[3];
for(int i=0; i<3; i++)
{
cin>>arr[i];
}
if(arr[0] == arr[1] && arr[1] == arr[2]){
cout<<"Yes"<<endl;
return 0;
}
if((arr[0]+arr[1] == 2*arr[2]) || (arr[0]+arr[2] == 2*arr[1]) || (arr[1]+a... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pl pair<ll,ll>
#define pll pair<ll,pl>
#define pi pair<int,int>
ll mod = 1e9+7;
const int MAXM = 200050;
void solve(int test)
{
string s;
cin>>s;
if(s[0] == s[1] && s[1] == s[2])
cout<<"Won\n";
else
cout<<... | #pragma region Macros
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP2(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; ++i)
#define REP3(i, l, r) for (int i = (l), i##_len = (int)(r); i < i##_len; ++i)
#define GET_MACRO_REP(_1, _2, _3, NAME, ...) NAME
#define REP(...) GET_MACRO_... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define F(i,a,b) for(int i=(int)(a);i<=(int)(b);i++)
#define R(i,b,a) for(int i=(int)(b);i>=(int)(a);i--)
#define endl "\n"
#define ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define out(x) cout<<x<<endl,exit(0)
#define pii pair<int,int>
#defin... | #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 ll long long
#define X first
#define Y second
#define all(x) x.begin(), x.end()
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_st... |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <stdio.h>
#include <... |
//Shrey Dubey
#include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<unordered_map>
#include<vector>
#include<set>
#include<list>
#include<iomanip>
#include<queue>
#include<stack>
#include <math.h>
#include<climits>
#include<bitset>
#include<cstring>
#include<numeric>
#include<array>
using... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define MS(x) memset((x), -1, sizeof((x)))
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
#define MOD 998244353
templat... | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <queue>
#include <iomanip>
#include <random>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
ll po(ll a, ll b) {
ll c = 1;
while (b) {
if (b % 2) c =... |
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#define gp __gnu_pbds
#define iset(T) gp::tree<T,gp::null_type,less<T>,gp::rb_tree_tag,gp::tree_order_statistics_node_update>
using namespace std;
#define SQ(x) ((x)*(x))
#define u unsigned
#define ull unsigned long long
#define ll long long
#define ld... | #include<iostream>
using namespace std;
int n,a[100020],b[100020],s=0;
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>a[i];
}
for(int i=1;i<=n;i++)
{
cin>>b[i];
s+=a[i]*b[i];
}
cout<<(s?"No":"Yes")<<endl;
return 0;
} |
// ______ ______ ______
// .-----..-----..-----..-----.| __||__ || __ |
// | || _ || || _ || __ || __|| __ |
// |__|__||___ ||__|__||___ ||______||______||______|
// |_____| |_____|
//
# include <bits/stdc++.h>
# define rep(i,n) for(int i=0, i##_l... | #include<bits/stdc++.h>
typedef long long ll;
using namespace std;
void prince()
{
#ifndef ONLINE_JUDGE
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
}
int main() {
prince();
ll n;
cin>>n;
... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,(n)-1,0)
#define all(v) v.begin(), v.end()
#define endk '\n'
co... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
long long sum=0,sum2=0,maxx=0;
for(int i=1;i<=n;i++)
{
long long x;
cin >> x;
sum+=x;
sum2+=sum;
maxx=max(maxx,x);
cout << sum2+maxx*i << '\n';
}
}
|
#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<cmath>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<numeric>
#include<functional>
#include<algorithm>
#include<bitset>
#include<t... | #include <bits/stdc++.h>
#include <string>
#define rep(i,n) for(int i=0;i < (n);i++)
#define rep2(i, s, n) for (int i = (s); i < (n); i++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define fi first
#define se second
#define pb push_back
#define ALL(a) (a).begin(),(a).end()
typedef long long ll;
typedef unsigned long ... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned ll;
using ld = long double;
using pi = pair<int, int>;
using pii = pair<ll, ll>;
using vi = vector<int>;
using vii = vector<ll>;
using vip = vector<pair<int, int>>;
const int MAX_N = 1e5 + 1;
const ll mod = 1e9 + 7;
const ll ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define d(x) cout<<x<<" "
#define nl cout<<endl
#define rep(var,init_val,final_val) for(int var = init_val; var < final_val; ++var)
#define tt ll t;cin>>t;while(t--)
#defin... |
#include <bits/stdc++.h>
using namespace std;
const int N = 100 + 9;
const int N2 = 10000 + 9;
char s[N];
int a[N], b[N2][N];
bool check(int k, int n) {
for (int i = 0; i <= n; ++i) {
int p = a[i] / k, q = a[i] % k;
for (int j = 1; j <= q; ++j) {
b[j][i] = p + 1;
}
fo... | /*
* * * * * * * * * * * * * * * * * *
*
* @author: Xingjian Bai
* @date: 2021-04-10 13:03:21
* @description:
*
*
* @notes:
* g++ -fsanitize=address -ftrapv
* * * * * * * * * * * * * * * * * */
#include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#defi... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> PP;
//#define MOD 1000000007
#define MOD 998244353
#define INF 2305843009213693951
//#define INF 810114514
#define PI 3.141592653589
#define setdouble setprecision
#define REP(i,n) for(ll i=0;i<(n);++i)
#define OREP(i,n) for(ll i=1;... | #include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout << (#x) << " is " << (x) << endl
#define debug cout << "hi" << endl
#define maxn 3e5+50
using namespace std;
typedef long long ll;
typedef unsi... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<n; i++)
#define reps(i,s,n) for(int i=s; i<n; i++)
#define per(i,n) for(int i=n-1; i>=0; i--)
#define pers(i,n,s) for(int i=n-1; i>=s; i--)
#define all(v) v.begin(),v.end()
#define fi first
#define se second
#define pb push_back
#define si(v) int(v.size())
#defin... | #include<bits/stdc++.h>
using namespace std;
#define int long long
int h,w,m;
int mh=9999999,ml=9999999;
int blockx[200001],blocky[200001];
int xw[200001],yw[200001];
int a[1000001];
struct node
{
int val,pos;
}ww[200001];
void add(int x,int v)
{
while(x<=200000)
{
a[x]+=v;
x+=x&-x;
}
}
int find(int x)
{
int ... |
#include<bits/stdc++.h>
using namespace std;
#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
typedef __int128 ll;
typedef long double ld;
typedef pair<ll,ll> p2;
#define sz(a) ll(a.size())
std::ostream&
operator<<( std::ostream& dest, __int128_t value )
{
std::ostream::sentry s( dest );
if ( s )... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
using namespace std;
using ll = long long int;
using P = pair<int, int>;
int main(){
string x;
ll m;
cin >> x;
reverse(x.begin(), x.end());
cin >> m;
int basemin = 0;
... |
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
constexpr long long INFLL = 1e18;
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
... | #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;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int getRand(int l, int r)
{
uniform_int_distribution<int> uid(l, r);
return uid(rng);... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=1e5+5;
int a[N],b[N];
int c[N],d[N];
signed main(){
int n;
cin>>n;
for(int i=1;i<=n;++i)
cin>>a[i];
for(int i=1;i<=n;++i)
cin>>b[i];
int sum=0,ans=0,m=(n>>1);
for(int i=1;i<=n;++i){
sum+=a[i];
b[i]-=a[i];
if(i&1) c[(i+1)/2]=b... | #include <bits/stdc++.h>
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef unsigned long long llu;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<int, pii> piii;
typedef pair<ll, ll> pll;
typedef pair<ll, int> pli;
typedef... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
int solve()
{
int h, w, di[4] = {0, 1, 0, -1}, dj[4] = {1, 0, -1, 0};
char c;
cin >> h >> w;
vector<vector<pair<int, int>>> alphabet(26);
vector<vector<char>> grid(h, vector<char>(w));
vector<vector<bool>>... | #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... |
#include "bits/stdc++.h"
using namespace std;
const int MOD = 1e9 + 7;
typedef long long lint;
#define int lint
const int INF = __LONG_LONG_MAX__;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, k, n) for (int i = (k); i < (int)(n); ++i
signed main()
{
int n,m;
cin>>n>>m;
vector<int> H(n);
... | #include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define umap unordered_map
#define mod 1000000007
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define MN(a,b,c) min(a,min(b,c))
#define MX(a,b,c) max(a,max(b,c))
#define pr1 ... |
#pragma GCC optimize("O3")
//#pragma GCC target("avx2")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ld> vld;
typedef pair<int,int> Pin;
typedef long long ll;
ll INF = 3e18;
int in... | #include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#include <complex>
... |
#pragma region head
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using pi = pair<int, int>;
using pll = pair<ll, ll>;
template <class T>
using vv = vector<vector<T>>;
#define _roverload(_a1, _a2, _a3, name, ...) name
#define _rep(i, n) repi(i, 0, n)... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int x,y;
cin>>x>>y;
int a,b;
a=(x+y)/2;
b=(x-y)/2;
cout<<a<<" "<<b<<endl;
return 0;
}
|
#include<bits/stdc++.h>
#define For(i,j,k) for (int i=(int)(j);i<=(int)(k);i++)
#define Rep(i,j,k) for (int i=(int)(j);i>=(int)(k);i--)
#define pii pair<int,int>
#define fi first
#define se second
#define PB push_back
#define ll long long
#define ull unsigned long long
#define y1 orzkcz
using namespace std;
const int N... | /*input
10 1000000000
65110170 68805223 123016442 275946481 661490312 760727752 764540566 929355340 930658577 947099792
1 2 123016442 661490311 929355337 930658574 999999997 999999998 999999999 1000000000
*/
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
using namespace std;
typedef l... |
/**
Bismillahir Rahmanir Raheem
Author:Refatul Fahad
Bangabandhu Sheikh Mujibur Rahman Science & Technology University, Gopalganj-8100.
**/
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define ff first
#define ss second
#define pb push_back
#define vi vecto... | #include <bits/stdc++.h>
using namespace std;
int main(){
vector<int> A(3);
for(int i=0;i<3;i++) cin >> A.at(i);
sort(A.begin(),A.end());
if(A.at(2) - A.at(1) == A.at(1) - A.at(0)){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
//cout << A.at(1) << endl;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long lint;
#define rep(i,n) for(lint (i)=0;(i)<(n);(i)++)
#define repp(i,m,n) for(lint (i)=(m);(i)<(n);(i)++)
#define repm(i,n) for(lint (i)=(n-1);(i)>=0;(i)--)
#define INF (1ll<<60)
#define all(x) (x).begin(),(x).end()
const lint MOD =1000000007;
//const lint ... | ///Bishmillahir Rahmanir Rahim,In the name of Almighty Allah(swt)
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define lop(i,n) for(i=0;i<n;i++)
#define lop1(i,n) for(i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define pi 3.14159265358979323846
#de... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
// 与えられた値を記録する
// Xは18桁を超えるのでstring型としておく
// Mは9桁を超え、18桁を超えないのでint64_t型としておく
string X; cin >> X; int64_t M; cin >> M;
// Xが1桁の場合は概算時に面倒なので先に算出してしまう(面倒な理由は後述)
if (X.size() == 1) {
// Xが1桁の場合は得... | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
const int maxN = 1e6 + 10;
int n;
string s;
int a[maxN];
vector<int> v[maxN];
unsigned long long m;
int main()
{
cin>>s;
cin>>m;
assert(s[0] > '0');
if (s.size() == 1)
{
if (s[0] -'0' <= m) printf("1\n"); else
printf("0\n");
return ... |
#include<bits/stdc++.h>
using namespace std;
inline int read()
{
int w=1,x=0;char f=getchar();
while(!isdigit(f) && f!='-') f=getchar();
if(f=='-') {w=-1;f=getchar();}
while(isdigit(f)) {x=(x<<3)+(x<<1)+f-48;f=getchar();}
return w*x;
}
int a,b,ans;
int main()
{
a=read();b=read();
ans=2*a+100-b;
printf("%d\n",... | #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;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
#ifndef ONLINE_JUDGE
freopen("input.in", "r", stdin);
freopen("output.in", "w", stdout);
#endif
int n, m;
cin >> n >> m;
vector<vector<int>> g(n);
for (int i = 0; i < m; i++) {
int a, b; cin >> a >> b;... | #include <iostream>
#include <bitset>
#define REP(i, n) for (int i = 0; i < (n); i++)
std::bitset<2000> d[2000];
int n, m, a, b, res;
int main() {
std::cin >> n >> m;
REP(i, n)
d[i][i] = 1;
REP(i, m) {
std::cin >> a >> b;
d[--a][--b] = 1;
}
REP(i, n) REP(j, n) if (d[j][i]... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
typedef tuple<int, int, int, int> T;
vector<T> a( n );
for( int i = 0; i < n; i++ ) {
int x, y, r;
cin >> x >> y >> r;
a[i] = T( x, y, r, i );
}
sort( a.begin(), a.end() );
vector<T> ans( n );
for( int i = 0; i < n; 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 ll long long
#define maxN 100000 + 5
#define IO ios::sync_with_stdio(0);cin.tie(0)
#define endl '\n'
#define x first
#define y second
#define pii pair<int, int>
#define pll pair<ll int, ll int>
#define sz(s) (int)s.size()
using namespace std;
pll finda(pll a) {
ll int tmp = a.y/2;
... | #include <bits/stdc++.h>
#define FASTIO
using namespace std;
using ll = long long;
using Vi = std::vector<int>;
using Vl = std::vector<ll>;
using Pii = std::pair<int, int>;
using Pll = std::pair<ll, ll>;
constexpr int I_INF = std::numeric_limits<int>::max();
constexpr ll L_INF = std::numeric_limits<ll>::max();
templ... |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... | #include<bits/stdc++.h>
using namespace std;
const int N = 3e5+10;
int n;
long long a[N],s[N];
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
{
scanf("%lld",&a[i]);
s[i]=s[i-1]+a[i];
}
long long ans = 0;
for(int i=1;i<=n;i++) ans += (n - 1) * a[i] * a[i];
for(int i=1;i<=n;i++) ans -= 2 * a[i] * (s[n] - s[i]... |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rrep(i,n) for(int i=(n)-1; i>=0; i--)
#define FOR(i,a,b) for(int i=(a); i<(b); i++)
#define RFOR(i,a,b) for(int i=(b-1); i>=(a); i--)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define UNIQUE(v) v.... | //#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
//#include<ctime>
//#include<algorithm>//next_permutation
#define rep(i,n) for (ll i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
u... |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
vector<long long> ans;
for (long long i = 1; i * i <= n; i++) {
if (n % i == 0) {
ans.emplace_back(i);
if (n != i * i) ans.emplace_back(n / i);
}
}
sort(ans.begin(), ans.end(... | #include <bits/stdc++.h>
using namespace std;
#define sz(x) (int)(x).size()
#define yn {puts("Yes");}else{puts("No");}
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
bool isi(const string&s){for(int l=0,r=sz(s)-1;l<r;++l,--r)if(s[l]!=s[r])return false;return true;}
int main() {
int a;
cin>> a;
cout<<100-(a... |
#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>
//#include <atcoder/all>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i)
#define pb push_back
#define eb emplac... |
//always use
#include <bits/stdc++.h>
using namespace std;
#define forn(i, n) for(int i=0; i<n; i++)
#define mp make_pair
#define pb push_back
#define f first
#define s second
typedef long long ll;
#define MOD 1000000007
#define HASHMOD 1275341791
//2 147 483 647 (2^31-1) int max
//9 223 372 036 854 775 807 (2^63-1) ll... | #include <bits/stdc++.h>
#define rep(a,n) for (ll a = 0; a < (n); ++a)
using namespace std;
//using namespace atcoder;
using ll = long long;
typedef pair<ll,ll> P;
typedef pair<ll,P> PP;
typedef vector<vector<int> > Graph;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
temp... |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 200005;
const int maxk = 302;
const long long mod = 998244353;
long long add_mod (long long a, long long b) {
return (a + b) % mod;
}
long long sub_mod (long long a, long long b) {
return (a + mod - b) % mod;
}
long long mul_mod (long long a, long lon... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author aajisaka
*/
#include<bits/stdc++.h>
using namespace std;
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T... |
///****In the name of ALLAH, most Gracious, most Compassionate****//
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
#define ALL(a) a.begin(), a.end()
#define FastIO... | /* B */
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
const int N = 3e5 + 10;
int n, m, a[N], s[N];
ll solve(void)
{
int num = m;
ll res = 0;
for (int k = 1; k <= n; ++k) s[a[k]]++;
for (int k = 0; k <= n; ++k) {
if (s[k] >= num) continue;
res += (ll)(num - s... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
void read (int &x) {
char ch = getchar(); x = 0; int f = 0;
while (!isdigit(ch)) { if (ch == '-') f = 1; ch = getchar(); }
while (isdigit(ch)) x = x * 10 + ch - 48, ch = getchar();
if (f) x = -x;
}
int n, x, y, f[200], s[200], tp;
int r... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(v) (v).begin(),(v).end()
using pii = pair<int, int>;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
int main() {
ll N = 0;
cin >> N;
set<ll> A;
ll t;
ll x = 1000000000000;
for(ll i = 0; i < N; i++) {
cin >> t;
A.insert(t);
x = min(x, t);
}
while(A.size() != 1) {
... | #include<iostream>
#include<bits/stdc++.h>
#include<climits>
#define PI 3.14159265358979323846264338327950L
#define ll long long
#define db double
using namespace std;
const int MOD = 1e9+7;
void go(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout<<fixed;
cout<<setprecision(20);
#ifndef ONLINE_JUDGE
... |
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <functional>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <bitset>
#include <math.h>
#include <random>
#include <chrono>
#include <assert.h>
using namespace std ;
using... | #include <iostream>
#include <string>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <math.h>
#include <cassert>
#define rep(i,n) for(int i = 0; i < n; ++i )
#define irep(i,n) for(int i = n-1; i >= 0; --i )
using namespace std;
using ll = long long;
using... |
#include<bits/stdc++.h>
using namespace std;
#define lop(i,n) for(ll i=0;i<n;i++)
#define lop1(i,n) for(ll i=1;i<=n;i++)
#define lopr(i,n) for(ll i=n-1;i>=0;i--)
#define ll long long int
#define pb push_back
#define all(v) v.begin(),v.end()
#define IOS ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define endl '... | #include<bits/stdc++.h>
using namespace std;
#define LL long long
int n;
LL m,f[202][202][202],a[2020];
#define INF (1LL<<60)
int main(){
scanf("%d%lld",&n,&m);
for (int i=1; i<=n; i++) scanf("%lld",&a[i]);
LL ans = m;
for (int mod=1; mod<=n; mod++){
memset(f, -1, sizeof(f));
f[0][0][0] = 0;
for (int i=0; i... |
#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<cmath>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<numeric>
#include<functional>
#include<algorithm>
#include<bitset>
#include<t... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rrep(i, n) for(int i = 1; i <= (int)(n); i++)
#define drep(i, n) for(int i = (n)-1; i >= 0; i--)
#define ALL(x) (x).begin(), (x).end()
#define dup(x,y) (((x)+(y)-1)/(y))
using namespace std;
typedef long long ll;
typedef pair<int, int>... |
#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
// #pragma GCC optimize("O2")
typedef long long int ll;
typedef long double ld;
typedef map <ll,ll> mm;
typedef vector <ll> mv;
typedef pair <ll,ll> mp;
typedef set <l... | #include<iostream>
#include<math.h>
#include<algorithm>
#include<stdint.h>
#include<vector>
#include<deque>
#include<stack>
#include<functional>
#include<string>
#include<numeric>
#include<cstring>
#include<random>
#include<array>
#include<fstream>
#include<iomanip>
#include<list>
#include<set>
#include<map>
#include<u... |
#include<iostream>
#include<vector>
#include<cstring>
#include<map>
#include<bitset>
#include<assert.h>
#include<algorithm>
#include<iomanip>
#include<cmath>
#include<set>
#include<queue>
#include<sstream>
#include<unordered_map>
#include<unordered_set>
#include<chrono>
#include<stack>
#include<deque>
#include<random>
... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define fi first
#define se second
const int N = 2e5 + 5;
const int INF = 2e9;
const ll LINF = 9e18;
struct query {
int T, X, Y;
};
int n, m, q;
int a[N], b[N];
ll tree[4][N << 2];
// 0 = Sum_A, 1 = Sum_B, 2 = Freq_A, 3 = Freq_B
void update(int... |
#include <bits/stdc++.h>
using namespace std;
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T> using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define oset_find(k) find_by_order(k)
#define oset_o... | #include<bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define ll long long
#define all(x) (x).begin(), (x).end()
#define ff first
#define ss second
void input(int *arr, int n){
for(int i=0; i<n; ++i) cin >> arr[i];
}
void input(vector<int>&arr, int... |
#include <bits/stdc++.h>
#include <unistd.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using ll = long long;
using ld = long double;
#define all(s) (s).begin(),(s).end()
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define rep(i, n) rep2(i, 0, ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=(1<<20);
bool vis[80];
int prime[25],cnt;
ll dp[N];
void init(){
int maxn=72;
cnt=0;
for(int i=2;i<=maxn;i++){
if(!vis[i])
prime[++cnt]=i;
for(int j=1;j<=cnt&&prime[j]*i<=maxn;j++){
vis[i... |
#include <stdio.h>
#include<algorithm>
#include <math.h>
#include<iostream>
#include <stack>
#include<string.h>
#include<vector>
using namespace std;
int main()
{
long long int n,x;
string a;
cin>>n>>x;
cin>>a;
// scanf("%s",a);
for( int i=0;i<n;i++){
if(a[i]=='o'){
x++;
}
else {
if(x>0){
x--;
}... | #include<bits/stdc++.h>
/*#include<boost/multiprecision/cpp_int.hpp>
using boost :: multiprecision::cpp_int;*/
#define ll long long int
#define mod 1000007
using namespace std;
/*int gcd(int a, int b)
{
if (a == 0)
return b;
return gcd(b % a, a);
}*/
void solve()
{
char s[3];
char k;
cin >> s;
k = s[0]... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template<class T> using vc = vector<T>;
template<class T> using vvc = vector<vector<T>>;
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#defin... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=(a),i##end=(b);i<=i##end;++i)
#define per(i,a,b) for(int i=(a),i##end=(b);i>=i##end;--i)
mt19937 Rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
template<typename T>void chkmax(T&x,T y){if(x<y)x=y;}
template<typename T>voi... |
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
//#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define black_tree tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_stat... | #include<bits/stdc++.h>
using namespace std;
#define speed ios_base::sync_with_stdio;cin.tie(nullptr);cin.tie(nullptr);
typedef long long int ll;
#define t int t;cin>>t;while(t--)
#define For(n) for(int i=0;i<n;i++)
#define ne(a) int a;cin>>a;
bool great(pair<int,int>a,pair<int,int>b)
{
return (a.first<b.first);
}
tem... |
#include <bits/stdc++.h>
#include <vector>
#include <iostream>
#include<algorithm>
#include<string>
#include <map>
#include <queue>
#include <stack>
#include<set>
#include<tuple>
#include<time.h>
#include<list>
#define DIV 1000000007
using namespace std;
using ll = long long;
using ldb = long double;
vector<int> par;... | #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; return 1; } return 0; }
template<... |
#include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define sz(v) (v).size()
#define all(v) (v).begin(),(v).end()
#define REP(i,a,b) for(int (i)=(a);(i)<(b);(i)++)
#define rep(i,a,b) fo... | #include <bits/stdc++.h>
#define pb push_back
#define fst first
#define snd second
#define fore(i,a,b) for(int i=a,ggdem=b;i<ggdem;++i)
#define SZ(x) ((int)x.size())
#define ALL(x) x.begin(),x.end()
#define mset(a,v) memset((a),(v),sizeof(a))
#define FIN ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
using namespace st... |
#include<bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
const ll MOD=1e9+7;
const ll MOD2=998244353;
const ll N=2e5+5;
const ld pi=3.14159265359;
const ll INF=(1LL<<60);
#define SQ(i) ((i)*(i))
#define RE... | #include <bits/stdc++.h>
using namespace std;
template <class A, class B> bool cmin(A& a, B b) { return a > b && (a = b, true); }
template <class A, class B> bool cmax(A& a, B b) { return a < b && (a = b, true); }
signed main() {
cin.tie(nullptr)->sync_with_stdio(false);
int L;
cin >> L;
vector<vector<long>... |
#include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1e9 + 7;
const int64_t MOD2 = 998244353;
const int INF = 2e9;
const long long inf = 1LL<<62;
template<int MOD> struct ModInt {
static const int Mod = MOD; unsigned x; ModInt() : x(0) { }
ModInt(signed sig) { x = sig < 0 ? sig % MOD + MOD : sig ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll ;
typedef pair <int, int > pii ;
typedef vector <int> vi ;
#define umap unordered_map
// #define endl '\n'
#define vec vector
#define all(v) (v).begin() , (v).end()
#define sumof(v) accumulate(all(v), 0LL, plus<ll>())
#define ma... |
#include<iostream>
#include<cstring>
#define debug(a) cout<<#a<<" = "<<a<<endl
using namespace std;
typedef long long ll;
using PII = pair<int,int>;
const int N = 2e5 + 10 , inf = 1e9;
int he[N << 1] ,nex[N << 1] , v[N << 1] , idex;
void add(int a,int b){
nex[idex] = he[a];
v[idex] = b;
he[a] = idex ++;
}... | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> pii;
#define ll long long
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define ALL(v) v.begin(), v.end()
#define FOR(a, b, c) for (int(a) = (b); (a) < (c); ++(a))
#define FORN(a, b, c) for (int(... |
// ＵＴＦ−８
#include<bits/stdc++.h>
using namespace std;
using ll = long long int;
using lc = complex<ll>;
/* #include<atcoder/all> */
/* using namespace atcoder; */
template<class T>bool chmax(T &a, const T &b) { return (a<b ? (a=b,1) : 0); }
template<class T>bool chmin(T &a, const T &b) { return (a>b ? (a=b,1) : 0);... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);i++)
#define N 60
#define INF 1000000005
#define INFLL (ll)1000000000000000005
#define PI 3.1415926535897
typedef long long ll;
#define ALL(v) (v).begin(),(v).end()
#define SZ(x) int(x.size())
#define IN(a) cin>>(a)
#define OUT(a) cout<<(a... |
#include <bits/stdc++.h>
using namespace std;
set<string> st;
void solve1()
{
vector<string> print;
string s;
int cnt = 0;
for (auto iter = st.begin(); iter != st.end(); iter++) {
s += *iter;
if (cnt == 20) break;
if (s.length() > 18) {
while (s.length() > 20) {
s.pop_back();
}
print.push_back(... | #include<iostream>
#include<string.h>
#include<string>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<bitset>
#include<math.h>
#include<stack>
#include<queue>
#include<set>
#include<map>
using namespace std;
typedef long long ll;
typedef long double db;
typedef unsigned long long ull;
typedef vector<in... |
//Bismillah Hir Rehmanir Rahim
//Allah knows best
#include<bits/stdc++.h>
using namespace std;
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <iomanip>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <que... | #pragma GCC target("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
#define DEBUG
#ifdef DEBUG
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << '(' << ... |
#include <bits/stdc++.h>
#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define vvi vector < vi >
#define pii pair<int,int>
#define pll pair<long long, long long>
#define inf 1000000000000000001
#define mod 1000000007
#define all(c) c.begin(),c.end()
#define mp(x,y) make_pair(x,y)
#define mem(a,... | #include "bits/stdc++.h"
using namespace std;
#define all(x) (xi).begin(), (x).end()
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define un_map unordered_map
#define rep(i,a,n) for (int i = a; i < n; ++i)
#define rrep(i,a,n) for (int i = a; i >= n; --i)
#define irep(i,a,n,inc) for (int i = a; i < n... |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int n; cin>> n;
cout << n - 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
#define debug(output) if(debugFlag)cout<<#output<<"= "<<output<<endl
using lint = long long;
typedef pair<int,int> P;
const bool debugFlag=true;
const lint linf=1e18+7;
const lint inf=1e9+7;
cons... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define ff first
#define ss second
int main(void){
// Your code here!
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll i,ans,m,n,s;
ans=INT_MAX;
cin >> n >> m;
ll a[n],c[n];
vector<ll> v(n),b(m);
for(i=0;i<n;i++)
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
void chmin(ll& a, ll b) {
if (a > b) a = b;
}
int main() {
int N, M;
cin >> N >> M;
ll H[N];
rep(i, N) {
cin >> H[i];
}
sort(H, H+N);
vector<ll> left(N/2), right(N/2);
rep(i, ... |
#include<stdio.h>
#include<algorithm>
#include<random>
#include<queue>
#include<map>
#include<time.h>
#include<string>
using namespace std;
using lld = long long int;
using pii = pair<int, int>;
using pll = pair<lld, lld>;
using pli = pair<lld, int>;
using pil = pair<int, lld>;
using lf = double;
int n, m;
int lv[2000... | // Created by ash_98
#include<bits/stdc++.h>
using namespace std;
#define Gene template< class
#define Rics printer& operator,
Gene c> struct rge{c b, e;};
Gene c> rge<c> range(c i, c j){ return {i, j};}
struct printer{
~printer(){cerr<<endl;}
Gene c >Rics(c x){ cerr<<boolalpha<<x; return *this;}
Rics(str... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.