code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
#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 fi first
#define se second
#define Mp make_pair
#define pb push_back
using ll = long long;
using db = double;
using pii = pair<int, int>;
using vi = vector<int>;
mt19937 mrand(time(0));
ll get(ll r) { return ((ll)mrand() * mrand() % r + r) % r; }
ll get(ll l, ll r)... |
#include <bits/stdc++.h>
#define int long long int
#define all(x) x.begin(), x.end()
#define send ios_base::sync_with_stdio(false);
#define help cin.tie(NULL)
#define inf (int)(1e17+1)
#define mod (int)(1e9+7)
#define N (int)(2e5+5)
#define fi first
#define se second
#define endl "\n"
#define double long double
#define... | #include <bits/stdc++.h>
#pragma region my_template
struct Rep {
struct I {
int i;
void operator++() { ++i; }
int operator*() const { return i; }
bool operator!=(I o) const { return i < *o; }
};
const int l_, r_;
Rep(int l, int r) : l_(l), r_(r) {}
Rep(int n) : Rep(0, n) {}
I begin() const... |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
int a[200010];
int t[200010];
int q;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a[i] >> t[i];
}
cin >> q;
long ub = 1000000000;
long lb = -ub;
long offset = 0;
for (int i = 0; i < n; ++i) {
if (t[i] ... | /*** author: yuji9511 ***/
#include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
using namespace std;
using ll = long long;
using lpair = pair<ll, ll>;
using vll = vector<ll>;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i=(m);i<(n);i++)
#define rrep(i,m,n) for(ll i=(m);... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define endl '\n'
#define pb push_back
#define sz(c) (ll)c.size()
#define mp make_pair
#define all(v) v.begin(),v.end()
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define F first
#define S second
#define M 1000000007
#define PI 3.... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,n,m) for(int i=(int)(n); i<=(int)(m); i++)
#define RFOR(i,n,m) for(int i=(int)(n); i>=(int)(m); i--)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define RITR(x,c) for(__typeof(c.rbegin()) x=c.rbegin();x!=c.rend... |
#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<class T> using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define pb push_back
#define N 100012
#define ll long long
#d... | /* Clearink */
#include <cstdio>
inline void wint ( int x ) {
if ( 9 < x ) wint ( x / 10 );
putchar ( x % 10 ^ '0' );
}
const int MAXN = 100;
int N, K, M, f[MAXN + 1][MAXN * ( MAXN / 2 + 1 ) * ( MAXN >> 1 ) / 2 + 5];
inline void addeq ( int& a, const int b ) { ( a += b ) < M ? 0 : a -= M; }
inline void initDP ()... |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;++i)
#define rrep(i,n) for(int i=n-1;i>=0;--i)
#define yesno(flg) if(flg){cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}
#define MAX_N 1002
#define i197 1000000007
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P1;
typedef pair<ll,int>Pli;
typedef pa... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
const int INF = 1001001;
int main() {
int n;
cin >> n;
vector<string> s(n);
map<string,int> mp;
rep(i,n) {
cin >> s[i];
mp[s[i]] = 1;
}
for(auto iter = mp.b... |
#include <iostream>
#include <stdio.h>
#include <cstring>
#include <cstdio>
#include <math.h>
#include <algorithm>
#include <vector>
#include <string>
#include <stdlib.h>
#include <queue>
#include <stack>
#include <utility>
#include <fstream>
//#include <random>
#include <map>
//#include <unordered_map>
#include <cstdl... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for(int i=0; i<n; i++)
#define REPi(i, a, b) for(int i=int(a); i<int(b); i++)
#define MEMS(a,b) memset(a,b,sizeof(a))
#define mp make_pair
#define MOD(a, m) ((a % m + m) % m)
template<class T>bool chm... |
#include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<unordered_map>
#include<math.h>
using namespace std;
typedef long long ll;
#define int long long
typedef vector<int> VI;
typedef pair<int, int> pii;
typedef vector<pii> VP;
type... | #include<iostream>
using namespace std;
typedef long long ll;
int MOD = 998244353;
ll ksm(ll a,ll b,ll mod){
ll ans = 1;
while(b>0){
if(b&1) ans = ans * a % mod;
a = a * a % mod;
b >>=1;
}
return ans;
}
int main(){
ll N,M,K;
cin >> N >> M >> K;
ll ans = 0;
for(int... |
#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;
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
typedef long long int ll... | #include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 4000000000000000000 //オーバーフローに注意
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
#define SIZE 200005
enum Which{
COUNT,
VAL,
};
enum Type{
A,
B,
};
struct Qu... |
#include <bits/stdc++.h>
using namespace std;
template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl
using ll = long long;
const int maxn = 1e6 + 5;
ll pw(ll x, ll y, ll mod) {
ll res=1;
while (y) {
if (y%2) res=res*x%mod;
x=x*x%mod;y... | #include<cstdio>
#include<iostream>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<queue>
#include<map>
#include<set>
#define ri register int
const int N = 1e6 + 618;
using namespace std;
int v,t,s,d;
int main(){
scanf("%d%d%d%d",&v,&t,&s,&d);
if(d < v * t||d > v * s) printf("Yes");
else
printf("No... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define DEBUG(x) cout << '>' << #x << ':' << x << endl;
#define REP(i,n) for(ll i=0;i<(n);i++)
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
#define FORC(i,a,b,c) for(ll i=(a);i<(b);i+=(c))
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define f... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll B, C;
cin >> B >> C;
ll ans;
ll k = C / 2;
int r = C % 2;
if (C == 0) {
ans = 1;
} else if (B == 0) {
ans = C;
} else if (C == 1) {
ans = 2;
} else if (B > 0) {
if... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 2e5 + 50;
int mod = 998244353;
vector<int> g[N];
int ans;
int vis[N];
void dfs(int node) {
vis[node] = 1;
for (auto to: g[node]) {
if (vis[to] == 1)
ans++;
else if (vis[to] == 0) {
dfs(to... | #include <bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template<typename T> using Graph = vector<vector<T>>;
template<typename T> using Spacial = vector<vector<vector<T>>>;
... |
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeo... | #include <bits/stdc++.h>
using namespace std;
#define debug(x) cerr << #x << " = " << x << endl
#define boost ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); \
stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, ... |
#include <bits/stdc++.h>
#include <complex>
#define X real()
#define Y imag()
using namespace std;
typedef long long ll;
typedef complex<double> point;
#define INF numeric_limits<int>::max()
//Graphs
class AdjGraph{
ll V;
list<ll> *l;
vector<ll> checker;
vector<bool> visited;
public:
AdjGraph(ll Vert){
... | #include <iostream>
int main() {
double x, y, z;
scanf("%lf %lf %lf", &x, &y, &z);
// y/x > z/?
int answer = 0;
for (int v = 0; v < 1e9; ++v) {
if (x/y >= z/v) {
break;
} else {
answer = v;
}
}
std::cout << answer;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
const int maxn=200005;
int n,ql,qr,lst,s,t;
vector<int>edge[maxn];
int dist[maxn],par[maxn],dep[maxn],que[maxn],ans[maxn];
bool bad[maxn];
void bfs(int s){
for(int i=1;i<=n;i++)dist[i]=-1;
dist[s]=0;
ql=1;qr=0;
que[++qr]=s;
while(ql<=qr){
int x=que[ql++];
for(int ... | #include<bits/stdc++.h>
using namespace std;
#define FOR(i, x, y) for(int i = (x); i < (y); ++i)
#define REP(i, x, y) for(int i = (x); i <= (y); ++i)
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#define PB push_back
#define MP make_pair
#define PH push
#define fst first
#define snd second
typedef long long ll;
t... |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;
#define MP make_pair
#define PB push_back
#define X first
#define Y second
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define RFOR(i, b, a) for(int i = (b) - 1; i >= (a); --i)
#define ALL... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <climits>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DEBUG 1
using namespace std;
constexpr int kMod = 1000000007;
typedef long lo... |
#include<bits/stdc++.h>
using namespace std;
template<class T>
istream& operator >>(istream& is, vector<T>& v){
for(auto&& elem:v)cin >> elem;
return is;
}
template<class T>
ostream& operator <<(ostream& os, const vector<T>& v){
if(!v.empty()){
for(int i=0, size=v.size(); i<size-1; ++i)os << v[i] << " ";
os<<... | #include <iostream>
#include <algorithm>
#include <numeric>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <iomanip>
#include <functional>
#include <bitset>
#include <limits>
#include <cstdio>
#include <cmath>
#include <cassert>
#include <ra... |
#include <bits/stdc++.h>
using namespace std;
const int N = 200005;
int n, m, fa[N], ans[N], vis[N];
vector<pair<int, int> > G[N];
int Find(int x) {
return fa[x] == x ? x : fa[x] = Find(fa[x]);
}
void dfs(int u, int lst) {
for (auto &e : G[u]) {
int v = e.first;
if (v == lst) continue;
if (ans[u] == e.second) a... | /* by Hyperhydrochloric Acid */
#include <bits/stdc++.h>
using namespace std;
#define SZ(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define loop(i, n) for(int i = 0; i < (n); ++i)
#define cont(i, n) for(int i = 1; i <= (n); ++i)
#define circ(i, a, b) fo... |
#include <bits/stdc++.h>
using namespace std;
#define ii pair<int,int>
#define fi first
#define se second
#define ld long double
#define vi vector<int>
#define all(x) x.begin(),x.end()
#define sz(x) (int)x.size()
#define eb emplace_back
const int mxn = 1e5+5;
void multi(int64_t &a, int64_t b, const int64_t &MOD){
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(a) a.begin(),a.end()
#define P pair<int,int>
#define Pll pair<long,long>
#define mp make_pair
#define INF 1000000001
#define INFl 1000000000000000001
#define ll long long
using namespace std;
struct edge{long to,cost,k;};
int ... |
#include <bits/stdc++.h>
using namespace std;
/* overload to_string */
template <typename A, typename B>string to_string(pair<A, B> p);template <typename A, typename B, typename C>string to_string(tuple<A, B, C> p);template <typename A, typename B, typename C, typename D>string to_string(tuple<A, B, C, D> p);string t... | #include <iostream>
using namespace std;
int main() {
int a,b,c;
cin>>a>>b>>c;
if(a==b){
cout<<c;
}
else if(b==c){
cout<<a;
}
else if(a==c){
cout<<b;
}
else{
cout<<"0";
}
} |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define int long long
#define pb push_back
#define pii pair<int,int>
#define gok ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
const ll mod = 1e9 + 7,mxn=2e5 + 5;
signed main(){
gok
int n,m;
cin>>n>>m;
int gr[n][m];
int mi=1e9;
for(... | #include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#define ll long long
using namespace std;
int main() {
int n, q;
cin >> n >> q;
vector<ll> a;
for(int i = 0; i < n; ++i) {ll x; cin >> x; a.push_back(x);}
sort(a.begin(), a.end());
//for (int i = 0; i < n; ++i) cout << a[i] << " ";
//cout ... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
int main() {
int X, Y, Z;
cin >> X >> Y >> Z;
int ans = 0;
if(Y*Z % X == 0) ans = Y*Z/X - 1;
else ans = Y*Z/X;
cout << ans << endl;
} | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rrep(i,n) for(int i=((n)-1);i>=0;--i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
#define mod 1000000007
using namespace std;
typede... |
#include <algorithm>
#include <cstdio>
#include <vector>
#include <stack>
using namespace std;
bool mark[400000];
char s[400001];
int main()
{
int N;
scanf("%d", &N);
vector<pair<int, int>> v;
for (int i = 0; i < 2 * N; i++) {
int x;
scanf("%d", &x);
v.emplace_back(x, i);
... | #include<bits/stdc++.h>
#define ll long long
#define fi first
#define se second
using namespace std;
const int N = 2e5 + 5;
int mod = 998244353;
int main(){
ios::sync_with_stdio(0), cin.tie(0);
int n;
cin >> n;
n *= 2;
int a[n], tag[n];
vector<pair<int, int>> v;
for (int i = 0; i < n; i++) c... |
#include<bits/stdc++.h>
using namespace std;
#define I(X) scanf("%d",&(X))
#define II(X, Y) scanf("%d%d",&(X),&(Y))
#define III(X,Y,Z) scanf("%d%d%d",&(X),&(Y),&(Z))
#define IL(X) scanf("%lld",&(X))
#define IIL(X, Y) scanf("%lld%lld",&(X),&(Y))
#define pb ... | #define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#incl... |
#include "bits/stdc++.h"
using namespace std;
#define _ ios_base::sync_with_stdio(0);cin.tie(0);
#define endl '\n'
#define debug(x) cerr << #x << " == " << (x) << '\n';
#define all(X) begin(X), end(X)
#define size(X) (int)std::size(X)
using ll = long long;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3... | #include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
#define LL long long
#define mem(s, v) memset(s, v, sizeof s)
#define FILEIN(s) freopen(s".in", "r", stdin)
#define FILEOUT(s) freopen(s".out", "w", stdout)
inline LL read(void) {
LL x = 0, f = 1; char ch = getchar();
while (ch < '0' || ... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define reps(i, s, n) for (int i = (s); i < (int)(n); ++i)
#define ZERO {puts("0"); return 0;}
#define NO {puts("No"); return 0;}
#define ALL(obj) begin(obj), end(obj)
#define pb push_back
#define v... | #include <bits/stdc++.h>
using namespace std;
int main()
{
long double r,x,y;
long double d;
cin>>r>>x>>y;
d=sqrt((x*x)+(y*y));
if(d==r)
cout<<1;
else
if(d<=(2*r))
cout<<2;
else
cout<<ceil(d/r);
return 0;
} |
/*
ID: gurban1
LANG: C++
TASK:
*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int maxn=5e3+5;
const int mod=998244353;
int n,m;
ll f[maxn],inv[maxn];
ll dp[maxn][maxn];
ll binmod(ll a,ll b) {if(b==0)return 1;ll x=binmod(a*a%mod,b>>1);return b&1?x*a%mod:x;}
ll choose(int a,int b){
ret... | #include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define chmin(a,b) a=min(a,b)
#define chmax(a,b) a=max(a,b)
#define mod 1000000007
#define ad(a,b) a=(a+b)%mod;
ll po(ll x,ll y){
ll res=1;
for(;y;y>>=1){
if(y&1)r... |
#include <bits/stdc++.h>
#include <iostream>
#include <set>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int max(ll a, ll b) {
if (a > b) return a;
return b;
}
int min(ll a, ll b) {
if (a < b) return a;
return b;
}
int main() {
ll a,b,c... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int A,B,C;cin>>A>>B>>C;int s[4];
A%=10;
B%=4;
s[1]=A;s[2]=(A*A)%10;s[3]=s[2]*A%10;s[0]=s[3]*A%10;
if(B==0||B==1)cout<<s[B];
else if(B==2){
if(C==1)cout<<s[2];
else cout<<s[0];
}
else{
if(C%2==0)cout<<s[1];
... |
#pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x)... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(ll i = 0; i < (n); ++i)
#define repA(i, a, n) for(ll i = a; i < (n); ++i)
#define repD(i, a, n) for(ll i = a; i > (n); --i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (long long) (x).size()
#define fill(a) memse... |
#include <iostream>
#include <fstream>
#include <string>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <cmath>
#include <functional>
#include <utility>
#include <tuple>
#include <numeric>
#include <queue>
#include <cstring... | #include<bits/stdc++.h>
#define Pair pair<ll,int>
#define ar array
#define ll long long
#define ull unsigned long long
#define pb push_back
using namespace std ;
const ll LLMAX = 9223372036854775807;
int main(){
ll n;
cin>>n;
ll cur_low = n;
ll num_len = 1;
ll sum = n;
ll res = 0;
while... |
#include <stdio.h>
#include <iostream>
int main(){
int n;
int *a;
int max1_i=0;
int max2_i=0;
std::cin >> n;
a = new(int[2<<(n-1)]);
int max1 = 0;
int max2 = 0;
for (int i=0; i< (2<<(n-1)); i++) {
std::cin >> a[i];
if (n >= 2) {
if (i< (2<<(n-2))) {
if (max1... | #include<bits/stdc++.h>
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
#define fast_az_fuk ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ll long long
#define ull unsigned ll
#define ld long double
#define pb push_back
#define pf push_front
#define dll deque<... |
#include <cstdio>
#include <algorithm>
#define int long long
const int N = 200005;
int n, x[N], y[N], o[N], pp[N], p, qth, q, m;
struct ABC{
int k, co, b;
}dx, dy;
struct AandB{
int A, B, id;
}qu[N];
struct Anss{
int x, y, id;
}ans[N];
bool cmp(AandB x, AandB y){ return x.A < y.A; }
bool cmp2(Anss x, Anss y... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=2e5+5,M=2e4+5,inf=0x3f3f3f3f,mod=1e9+7;
#define mst(a,b) memset(a,b,sizeof a)
#define PII pair<int,int>
#define fi first
#define se second
#define pb push_back
int n,x[N],y[N],m,q;
ll fx[N],fy[N],px[N],py[N];
int jg[N];
int main(){
scanf("... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
vector <int> graf[200005];
int in[200005];
int out[200005];
int tjm;
vector <int> vec[500005];
void dfs(int v, int d){
in[v] = ++tjm;
vec[d].push_back(in[v]);
for(auto c : graf[v]) dfs(c, d+1);
out[v] = ++tj... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int maxn = 200005;
vector<int> G[maxn];
vector<P> g[maxn];
struct node
{
int u, d;
} arr[maxn];
int siz[maxn], hson[maxn], ans[maxn], d[maxn], d1[maxn];
int dfs0(int u, int f, int t)
{
siz[u] = 1;
d[u] = t;
... |
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int maxn = 200005;
int tree[maxn], hm[maxn], wm[maxn];
vector<int> vec[maxn];
void add(int k, int v) {
k++;
for (int i = k; i < maxn; i+=i&-i) tree[i] += v;
}
int qry(int k) {
k++;
int res = 0;
for (int i = k; i >= 1; i-=i&... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define rsort(a) {sort(all(a));reverse(all(a));}
#define pb emplace_back
#define eb emplace_back
#define lb(v,k) (lower_bou... |
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#pragma GCC optimize ("-O3")
using namespace std;
void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long ... | #include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <set>
#include <queue>
#include <cmath>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<long long> vll;
typedef vector<vector<long long>> vvll;
typed... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[311111];
ll sum[311111];
int main(){
int n;
while(scanf("%d",&n)!=EOF){
double ans = 0;
for(int i = 1 ; i <= n ; i++){
ans += (1.0/i)*n;
}
printf("%.6f\n",ans-1);
}
return 0;
} | #ifdef __LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
template<typename T> bool chmax(T &a,T b) {if(a<b) {a=b; return true;} return false;}
template<typename T> bool chmin(T &a,T b) {if(a>b) {a=b; return true;} return false;}
#define itn int
#define fi first
#define se second
#def... |
#include<bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#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 fo(i,n) for(ll i=0;i<n;i++)
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ull unsigned long long
#define lld long double
#define... | //
#include <iostream>
using namespace std;
int main() {
short A, B, C; cin >> A >> B >> C;
cout << max(A+B, max(A+C, B+C)) << "\n";
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define intt long long int
#define intu unsigned long long int
#define vi vector<intt>
#define ii pair<int,int>
#define pb push_back
//#define mp make_pair
#define ff first
#define ss second
#define fast_io ios::sync_with_stdio(0);cin.tie(NULL);std::cout.tie(NULL);
# define ... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <queue>
#include <deque>
#include <bitset>
#include <iterator>
#include <list>
#include <stack>
#include <map>
#include <set>
#include <functional>
#include <numeric>
#include <utility>
#include <climits>
#include <... |
#include <iostream>
#include <cmath>
#include <climits>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <stack>
#include <bitset>
#include <functional>
#include <random>
#include <casser... | #include "bits/stdc++.h"
//#include "atcoder/all"
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
//const bool debug = false;
#define rep(i, n... |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <math.h>
#include <queue>
#include <numeric>
#include <iomanip>
using namespace std;
using ll = long long;
#define For(i,a,b) for(ll i=(a);i<(ll)(b);i++)
#define rFor(i,a,b) for(ll i=(a);i>=(ll)(b);i--)
#define co(a) cout<<a<<endl
#... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define pb emplace_back
#define lb(v,k) (lower_bound(all(v),(k))-v.begin())
#define ub(v,k) (upper_bound(all(v),(k))-v.begin())
#define fi first
#define se ... |
#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 123;
const int mod = 998244353;
int n, m;
int a[N];
int main () {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
for(int i = 1; i <= n; i++) {
a[i] = a[i - 1];
int j = i;
bool ok = 1;
while(j > 1) {
ok &= ((j % 10)... | #include <bits/stdc++.h>
#include <unordered_set>
using namespace std;
#define printclock cerr << "Time : " << 1000 * (ld)clock() / (ld)CLOCKS_PER_SEC << "ms\n";
#define deb3(x, y, z) cout << #x << ": " << x << " | " << #y << ": " << y << " | " << #z << ": " << z << endl
#define deb4(x, y, z, w) cout << #x << ": " << x... |
#define ll long long
#include <bits/stdc++.h>
using namespace std;
vector<pair<int,int> > a[100005];
ll dp[20][500000];
ll n,c;
ll rec(ll i,ll mask){
ll j,k,s=0,p;
if(dp[i][mask]!=-1) return dp[i][mask];
for(j=0;j<a[i-1].size();j++){
p=0;
for(k=0;k<18;k++){
if(mask>>k&1){
... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define sz(a) a.size()
#define re return
#define all(a) a.begin(),a.end()
#define Type int
#define rept(i,a,b) for(int i=(a);i<(b);i++)
#define rep(i,a) rept(i,0,a)
#define fi first
#define se second
#define ii pair<int,int>
//#define
using namespace s... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const long long INF = 1LL << 60;
template <typename T>
void chmin(T& a, T b) {
if(a > b) {
a = b;
}
}
template <typename T>
void chmax(T& a, T b) {
if(a < b) {
a = b;
}
}
int main() {... | #include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <algorithm>
#include <math.h>
#include <iomanip>
#include <sstream>
#define INF 1000000009
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using p = pair<int, int>;
int main() {
int n;
... |
# include <bits/stdc++.h>
# define N 100010
char s[N];
int main() {
int n,i,las=0;
scanf("%d%s",&n,s+1);
if(s[1]!=s[n]) puts("1");
else {
for(i=2;i<n-1;i++) {
if(s[i]!=s[1] && s[i+1]!=s[1]) break;
}
if(i<n-1) puts("2");
else puts("-1");
}
return 0;
} | #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>
using namespace std;
typedef long long ll;
#define min(x,y) ((x)<(y)?(x):(y))
#define max(x,y) ((x)<(y)?(y):(x))
ll comb(ll n, ll k){
if (k == 0 || k == n) return 1;
if (k == 1 || k == n-1) return n;
return comb(n-1,k)+comb(n-1,k-1);
}
int main(){
ll n,k;cin >> n >> k;--k;
... | #include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#pragma GCC optimize ("-O3")
using namespace std;
void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long ... |
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i = (a); i <= (b); i++)
#define rng(a) a.begin(), a.end()
#define ina(n,a) cin >> n; for(int i = 1; i <= n; i++) cin >> a[i]
#define sz(x) (int)(x).size()
#define se second
#define fi first
#define prev coyhhhhhhyoc
#define next sdNNNmNNNNNNNmd... | #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 <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... | // clang-format off
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define mp make_pair
#define fst first
#define snd second
#define forn(i,n) for (int i = 0; i < int(n); i++)
#define forn1(i,n) for (int i = 1; i <= int(n); i++)
#define popcnt __builtin_popcount... |
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <vector>
#include <map>
#include <queue>
#include <set>
#include <cmath>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <sstream>
#include <iomanip>
using namespace std;
using VI = vector <int>;
using VV... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll n, k;
cin >> n >> k;
vector<vector<ll>> a(n, vector<ll>(n));
rep(i, n) rep(j, n) cin >> a[i][j];
ll ng = -1;
ll ok = 10e10;
while (a... |
#include <iostream>
#include <climits>
#include<vector>
#include <stack>
#include <queue>
#include <string>
#include <utility>
#include <string.h>
#include <iomanip>
#include <stdlib.h>
#include <algorithm>
#include<cmath>
#include <limits>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const int ... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
using vi = vector<int64_t>;
using vvi = vector<vi>;
using pii = pair<int64_t, int64_t>;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int ans = 0;
... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<ll>;
using vvi = vector<vi>;
using ii = pair<ll, ll>;
using vii = vector<ii>;
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << endl
#define all(x) x.begin(), x.end()
... | /**
* created: 21/03/2021, 13:15:10
**/
#include <bits/stdc++.h>
using namespace std;
const int max_n = 100111, inf = 1000111222;
int n, dp[max_n];
vector<int> all[max_n];
int main() {
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
scanf("%d", &n);
for (int i = 1; i < m... |
#include <iostream>
using namespace std;
int main(void) {
int n, w, ans;
cin >> n >> w;
ans = n/w;
cout << ans << endl;
}
| #include <bits/stdc++.h>
#include <numeric>
#define REP(i, n) for (int i = 0; i < (int)(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 < (int)(b); i++)
#define ALL(v) (v).begin(), (v).end()
#define MIN(v) *min_element((v).begin(), (v).end())
#define MAX(v) ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
#define ALL(x) (x).begin(),(x).end()
const ll zero = 0;
const ll one = 1;
const ll INF = 9223372036854775807; //10^18
const int inINF = 2147483647; //10^9
const ll MO... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n, d, h;
double max_hi = 0;
cin >> n >> d >> h;
vector<vector<int>> object(n, vector<int>(2));
for (int i = 0; i < n; i++)
cin >> object.at(i).at(0) >> object.at(i).at(1);
for (int i = 0; i < n; i++){
double tmp;
tmp = object.at(i).a... |
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define _overload(_1, _2, _3, _4, name, ...) name
#define _rep1(Itr, N) _rep3(Itr, 0, N, 1)
#define _rep2(Itr, A, B) _rep3(Itr, A, B, 1)
#define _rep3(Itr, A, B, S) for(i64 (Itr) = A; (Itr) < B; (Itr) += S)
#define repeat(...) _overload(__VA_ARGS__, _rep3... | #include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#pragma GCC optimize ("-O3")
using namespace std;
void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long ... |
#include<bits/stdc++.h>
#define ll long long int
#define mk make_pair
#define pb push_back
#define INF (ll)1e18
#define pii pair<ll,ll>
#define mod 998244353
#define f(i,a,b) for(ll i=a;i<b;i++)
#define fb(i,a,b) for(ll i=a;i>b;i--)
#define ff first
#define ss second
#define srt(v) if(!v.empty())sort(v.begin(),v.end()... | #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<n; i++)
#define all(vec) vec.begin(), vec.end()
#define pcnt __builtin_popcount
int main() {
int N,M;
cin >> N >> M;
vector<vector<P>> ps(N+1);
rep(i, M) {
int x,y,z;
cin >> x ... |
#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;
typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;
#define MP make_pair
#define PB push_back
#define X first
#define Y second
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define RFOR(i, b, a) for(int i = (b) - 1; i >= (a); --i)
#define ALL... |
#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);
int a,b;
cin >> a >> b;
cout << (abs(a-b)<3 ? "Yes" : "No");
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define REP(i,a,b) for(inti=a;i<=b;i++)
#define MOD 1000000007
typedef long long int ll;
typedef vector<int>vi;
typedef pair<int,int>pi;
int sum(int a)
{
int ans =0;
while(a)
{
a... |
#include<cstdio>
#include<cstdlib>
#include<cctype>
#include<cstring>
#include<queue>
#include<algorithm>
using namespace std;
typedef long long ll;
const int N=5e5+500;
ll inf=1e18;
int gti(void)
{
char c=getchar();
int ret=0,st=1;
for (;c!='-'&&!isdigit(c);c=getchar());
if (c=='-') st=-1,c=getchar();
for (;isdi... | #pragma region Region_1
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (ll i = s; i < t; ++i)
#define rng(a) a.begiGn(), a.end()
#define rrng(a) a.rbegin(), a.rend()
using ll = long long;
using P... |
#include <bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define MAXX 100005
#define PI 3.14159265358979323846264338327950
#define PB push_back
#define F first
#define S second
#define fixx(n) fixed << setprecision(n)
#define ll long long
cons... | #define _DEBUG
//ヘッダー
#include<bits/stdc++.h>
using namespace std;
//型定義
typedef long long ll;
//定数
const ll INF=1e+18;
const int MOD=1e+9+7;
//デバッグ
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0,a1,a2,a3,a4,x,...) x
#define debug1(x1) cout<<#x1<<": "<<x1<<endl
#define debug2(x1,x2) cout<<#x1<<": "<<x1<<", "#x2<<": ... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, e, p) for (ll i = (ll)s; i < (ll)e; i += p)
#define ALL(vec) vec.begin(), vec.end()
int main(){
int n;
cin >> n;
vector<ll> a(n), b(n);
rep (i, 0, n, 1){
cin >> a[i];
}
rep (i, 0, n, 1){
cin >... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
template<typename T1,typename T2> bool chmin(T1 &a,T2 b){if(a<=b)return 0; a=b; return 1;}
template<typename T1,typename T2> bool chmax(T1 &a,T2 b){if(a>b)return 0; a=b; return 1;}
#define bitUP(x,a) ((x>>a)&1)
int dx[4]={0,1,0,-1}, dy[4]={1,0,-1,0... |
#include <bits/stdc++.h>
// clang-format off
using namespace std; using ll=long long; using ull=unsigned long long; using pll=pair<ll,ll>; const ll INF=4e18;
void print0(){}; template<typename H,typename... T> void print0(H h,T... t){cout<<h;print0(t...);}
void print(){print0("\n");}; template<typename H,typename... T>... | /* bimillahir rahmanir rahim...
* AUTHOR
* mubin_akib */
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair <int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define endl '\n'
#define tc int t; cin>>t; while(t--)
#define shweta ios_base::sync_with_stdio(false); cin.tie(NULL);
#define fl for(int i=0;i<n;i++)
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define MOD 1000000007
#... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin>>n;
ll arr[n];
map<ll,ll> m;
for(ll i =0 ;i<n;i++){
cin>>arr[i];
m[arr[i]]++;
}
ll ans = 0;
for(ll i =0 ;i<n;i++){
... |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
long long n;
cin >> n;
char digits[19];
sprintf(digits, "%lld", n);
int len = strlen(digits);
int lim = 1 << len;
int ans = INT_MAX;
for (int i = 1; i <= lim; ++i) {
int cur = 0, cnt = len;
for (int j = 0; ... | #include<bits/stdc++.h>
#include <iostream>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define repd(i, n) for(int i = 0; i <= (n); ++i)
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<int, int>;
using Pll = pair<long long, long long>;
template<class T>bool chmax(T &a, co... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int a[5];
ll sum=0;
while(cin>>a[1]>>a[2]>>a[3]>>a[4])
{
sum=a[1]+a[2]+a[3]+a[4];
int flag=0;
for(int i=1;i<=4;i++)
{
if(sum-a[i]==a[i])
{
flag=1;
break;
}
}
if(!flag)
{
for(int i=1;i<=3;i++)
{
f... | #include <bits/stdc++.h>
#define rep(i, n) for (lli i = 0; i < (n); i++)
#define rrep(i, n) for (lli i = (n)-1; i >= 0; i--)
#define vall(x) (x).begin(), (x).end()
using namespace std;
namespace atcoder {}
using namespace atcoder;
using lli = long long int;
void YESNO(bool), YesNo(bool);
template <class T1, class T2> b... |
// atcoder/arc105/C/main.cpp
// author: @___Johniel
// github: https://github.com/johniel/
#include <bits/stdc++.h>
#define each(i, c) for (auto& i : c)
#define unless(cond) if (!(cond))
using namespace std;
template<typename P, typename Q> ostream& operator << (ostream& os, pair<P, Q> p) { os << "(" << p.first << ... | #include<iostream>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define int long long
using namespace std;
int c[502][502],a[502],b[502];
signed main(){
ios::sync_with_stdio(false);
int n; cin>>n;
rep(i,1,n)rep(j,1,n)cin>>c[i][j];
bool flag=true;
rep(i,1,n){rep(j,2,n){
if(i==1)a[j]=c[i][j]-c... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n, k;
cin >> n >> k;
while (k--) {
if (n % 200 == 0) {
n /= 200;
} else {
n = 1000 * n + 200;
}
}
cout << n << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
template <typename T, size_t size>
ostream &operator<<(ostream &os, const array<T, size> &arr)
{
os << '{';
string sep;
for (const auto &x : arr)
os << sep << x, sep = ", ";
return os << '}';
}
template <class T>
ostream &operator<<(ostream &os, vect... |
#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>
#... | #include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
using ll = long long;
using lint = long long;
typedef vector<long long> vint;
typedef pair<long long, long long> pint;
#define INF INT32_MAX / 2
#define INF64 INT64_MAX / 2
#define EPS 0.001
#define EPS14 1.0E-14
#define REP(i, n) for (ll i = 0; i < n;... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n; cin>>n;
int a[n];
for(int i=0;i<n;i++){
cin>>a[i];
}
int k = *max_element(a,a+n);
int H[k]={0};
for(int i=0;i<n;i++){
++H[a[i]];
}
int f=0;
for(int i=0;i<k;i++){
if(H[i]>1){
... | #include<bits/stdc++.h>
using namespace std;
void output(vector<int> &a){
cout << a.size();
for(auto &nx : a){
cout << ' ' << nx;
}
cout << '\n';
}
int main(){
int n;
cin >> n;
vector<int> a(n);
for(auto &nx : a){cin >> nx;}
vector<vector<int>> bk(200,vector<int>(0));
int cnt=min(n,8);
... |
#include <cstdio>
#define N 400010
#define mo 3
#define ll long long
#define fo(x, a, b) for (int x = (a); x <= (b); x++)
#define fd(x, a, b) for (int x = (a); x >= (b); x--)
using namespace std;
int n, a[N]; char s[N];
ll ans = 0;
ll ksm(ll x, int y) {
ll s = 1;
while (y) {
if (y & 1) s = s * x % mo;
x = x * x ... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
void debug_out(){
cerr << endl;
}
template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T){
cerr << " " << to_string(H);
debug_out(T...);
}
#ifdef local
#define debug(...) cerr<<"["<<#__VA_ARGS__<<"]:",debug_out(__VA_ARG... |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s;
int i;
cin>>s;
s[3]=s[0];
for(i=1;i<4;i++)
{
cout<<s[i];
}
cout<<endl;
return 0;
} | #include <iostream>
#include <vector>
#include <string>
#include <unordered_map>
#include <bitset>
using namespace std;
int main(void) {
int price;
// input
cin >> price;
int p = price * 1.08;
if (206 > p) {
cout << "Yay!" << endl;
} else if(206 == p){
cout << "so-so" << endl;
}else{
cout ... |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define FOR(i,f,n) for(int i=f;i<n;i++)
#define FORI(i,f,n) for(int i=f;i>=n;i--)
#define sz(a) ((int)(a).size())
#define ff first
#define ss second
#define all(a) (a).begin(),(a).end()
#define alli(a) (a).rbegin(),(a).rend()
#define approx(a) fixed<<... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define mii map <int, int>
#define mll map <ll, ll>
#define pii pair <int, int>
#define pll pair <ll, ll>
#define vi vector <int>
#define vd vector <double>
#define vll vector <ll>
#define fi first
#define se second
#define si set... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define rep1(i,n) for(int i=1;i<=(int)n;i++)
#define sp(n) cout << fixed << setprecision(n)
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... | #include<bits/stdc++.h>
#define pb push_back
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(0);
#define all(v) (v).begin(),(v).end()
#define vll vector<ll>
#define xfor(arr) for(auto& x : arr)
#define input(arr) xfor(arr) cin >> x;
#define output(arr) xfor(arr) cout << x << ' '; cout << '\n';
#d... |
#include<bits/stdc++.h>
#define N 200000
#define LL long long
using namespace std;
LL a,b,c;
const LL mod=998244353;
inline LL qr()
{
char a=0;LL x=0,w=1;
while(a<'0'||a>'9'){if(a=='-')w=-1;a=getchar();}
while(a<='9'&&a>='0'){x=(x<<3)+(x<<1)+(a^48);a=getchar();}
return x*w;
}
inline LL poww(LL a,LL b)
{
if(a==0... | #include <bits/stdc++.h>
#define all(A) begin(A), end(A)
#define rall(A) rbegin(A), rend(A)
#define sz(A) int(A.size())
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
typedef vector <int> vi;
typedef vector <... |
//#define NDEBUG
#include <algorithm>
#include <cstddef>
#include <cstdint>
#include <iostream>
#include <utility>
#include <vector>
namespace n91 {
using i32 = std::int32_t;
using i64 = std::int64_t;
using u32 = std::uint32_t;
using u64 = std::uint64_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;
stru... | #include <bits/stdc++.h>
using namespace std;
int n, a[300005];
int bit[300005];
void update(int x) {
for (int i = x; i <= n; i += (i & (-i))) {
bit[i]++;
}
}
int query(int x) {
int tot = 0;
for (int i = x; i >= 1; i -= (i & (-i))) {
tot += bit[i];
}
return tot;
}
int main()... |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
int ans=0;
for(int i=0;i<10000;i++){
vector<int> tmp(10);
int a=i/1000,b=(i-a*1000)/100,c=(i-a*1000-b*100)/10,d=i%10;
if(s[a]=='x'||s[b]=='x'||s[c]=='x'||s[d]=='x')continue;
tmp.at(a)++;tmp.at(b)++... | #include <bits/stdc++.h>
using namespace std;
#define MS(a, b) memset(a, b, sizeof(a))
#define REP(a, b, c) for (register int a = b, _n = c; a <= _n; ++a)
#define DREP(a, b, c) for (register int a = b, _n = c; a >= _n; --a)
#define FOR(a, b, c) for (register int a = b, _n = c; a < _n; ++a)
#define EREP(a, b) for (reg... |
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define reps(i, n) for(int i=1, i##_len=(n); i<=i##_len; ++i)
#define rrep(i, n) for(int i=((int)(n)-1); i>=0; --i)
#define rreps(i, n) for(int i=((int)(n)); i>0; --i)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
using ll... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
int A[N];
for(int i=0;i<N;i++){
cin >> A[i];
}
int ans=0;
for(int i=0;i<N;i++){
for(int j=A[i];j>10;j--){
ans++;
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b;
double c;
cin >> a >> b;
c = a-b;
c = c/a;
cout << c * 100 << endl;
} | #include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
// #pragma GCC optimize("O2")
typedef long long int ll;
typedef long double ld;
typedef map <ll,ll> mm;
typedef vector <ll> mv;
typedef pair <ll,ll> mp;
typedef set <l... |
#include<bits/stdc++.h>
#define ll long long int
#define mk make_pair
#define pb push_back
#define INF (ll)1e18
#define pii pair<ll,ll>
#define mod 1000000007 //998244353
#define f(i,a,b) for(ll i=a;i<b;i++)
#define fb(i,a,b) for(ll i=a;i>b;i--)
#define ff first
#define ss second
#define srt(v) if(!v.empty())sort(v.be... |
// Problem : A - ReLU
// Contest : AtCoder - AtCoder Beginner Contest 183
// URL : https://atcoder.jp/contests/abc183/tasks/abc183_a
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#inclu... |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;cin>>n; int t=n;
int x = n/100;
if(x*100 < t){
cout<<x+1<<"\n";
}
else{
cout<<x<<"\n";
}
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int (i) = 0; (i) < (n); ++(i))
#define REPR(i, n) for(int (i) = (n); (i) >= 0; (i)--)
#define FOR(i, m, n) for(int (i) = (m); (i) < (n); ++(i))
#define INF 2e9
#define ALL(v) v.begin(), v.end()
#define DEBUG(x) cerr << "\033[33m(line:" << __LINE__ << ... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int Q = 1000;
while(Q--){
int sx, sy, tx, ty;
cin >> sx >> sy >> tx >> ty;
string ans;
if(sx > tx){
for(int i = sx;i > tx;i--){
ans.push_back('U');
}
}
if(sx < tx... | #include <bits/stdc++.h>
using namespace std;
// (i,j) i:上下 j:左右
#define NSIZE (30) // node数
#define ESIZE (29) // edge数
#define TEST_NUM (1000)
bool LOCAL_TEST=false; // 提出時はfalseに変更
bool DB_PRINT=false;
int h[NSIZE][ESIZE]; // h[i:上下][j:左右]
int v[ESIZE][NSIZE]; // v[i:上下][j:左右]
int si[TEST_NUM];
int sj[TEST_NUM];
in... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
void solve(){
ll n;
cin>>n;
ll ans=0;
if(n>=1000)ans+=(n-999);
//cout<<ans<<" ";
if(n>=1000000)ans+=(n-999999);
if(n>=1000000000)ans+=(n-999999999);
if(n>=1000000000000)ans+=(n-999999999999);
if(n==1e15)ans+=1;
//if(n>=1000000000000000)ans+=n=9... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <string>
#include <set>
#include <vector>
#include <cmath>
#include <map>
#include <algorithm>
#include <stack>
#include <queue>
#define pb push_back
#define pob pop_back
#define pll pair <long long, long long>
#define pld pair <long double, long dou... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
void solve(){
int n; cin >> n;
vector<ll> a,b;
for (int i=0; i<n; i++){
ll x; cin >> x;
a.push_back(x);
}
for (int i=0; i<n; i++){
ll x; cin >> x;
b.push_back(x);
}
ll dot = 0;
for (int i=0; i<n; i++){
dot... | /*
* author :Sadik Hassan(_sad_)
*
*/
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ld = long double;
#define nl "\n"
#define pb push_back
... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,n,m) for(int i=(int)(n); i<=(int)(m); i++)
#define RFOR(i,n,m) for(int i=(int)(n); i>=(int)(m); i--)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define RITR(x,c) for(__typeof(c.rbegin()) x=c.rbegin();x!=c.rend... | #include<iostream>
#include<cstdio>
#include<ctime>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<string>
#include<vector>
#include<iomanip>
#include<fstream>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<algorithm>
#include<sstream>
using namespace std;
#define sync std::ios::sync... |
#include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < n; i++)
#define ALL(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
int main() {
int N; cin >> N;
vector<string> S(N);
REP(i, 0, N) cin >> S[i];
vector<vector<bool>> d(N, vector<bool>(N, false));
... | #include <bits/stdc++.h>
typedef double D;
typedef long long int LL;
typedef long double LD;
#define OR ||
#define AND &&
#define nl '\n'
#define ff first
#define ss second
#define S string
#define inf INT_MAX
#defi... |
// Problem: C - Squared Error
// Contest: AtCoder - AtCoder Beginner Contest 194
// URL: https://atcoder.jp/contests/abc194/tasks/abc194_c
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
// Parsed on: 10-03-2021 21:39:49 IST (UTC+05:30)
// Author: Kapil Choudhary
// *****************************************************... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pi;
typedef complex <double> cp;
#define debug(a) cout<<#a<<":"<<a<<endl;
#define fr freopen("in.txt","r",stdin);
#define Fill(x,a) memset(x,a,sizeof(x))
#define cpy(a,b) memcpy(a,b,sizeof(a))
const double PI = acos(-1);
const ll IN... |
//
// Created on 2021/03/20.
//
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint>... | #include <iostream>
using namespace std;
int ri(){
int n = 0;
scanf("%d", &n);
return n;
}
int main(){
int min, max;
int a=ri();
int b=ri();
int c=ri();
int d=ri();
if(a<b) max=b;
else max = a;
if(c>d) min=d;
else min = c;
max -= min;
printf("%d", max);
... |
#include <iostream>
#include <vector>
#include <cmath>
#include <unordered_set>
#include <algorithm>
using namespace std;
typedef long long ll;
vector<vector<pair<int, ll>>> adj;
vector<ll> dist;
const int MOD = 1e9 + 7;
int modadd(int a, int b) {
return (a % MOD + b % MOD) % MOD;
}
int modmul(int a, int b) {
retu... | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
int main(){
int n =0 , m =0 ;
cin >> n >> m;
int s =0 , s2=0;
vector<pair<int , int > > ar;
for(int i=0;i<m;i++){
cin >> s >> s2;
ar.emplace_back(s ,s2 );
}
int k =0 ;
cin >> k;
vector< pair<int , i... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define reps(i,s,n) for(int i=(s); i<(n); i++)
#define all(v) v.begin(),v.end()
#define outve(v) for(auto i : v) cout << i << " ";cout << endl
#define outmat(v) for(auto i : v){for(auto j : i) cout << j << " ";cout << endl;}
#define in(n,v) for(int i=0;... | #include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<map>
#include<stack>
#include<queue>
#include<ctime>
#include<vector>
#include<set>
#include<cstdlib>
#include<utility>
using namespace std;
const int mod=998244353;
int f[17][5000+5],c[5000+5][5000+5];
void add(int &x,in... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define P pair<ll, ll>
#define Graph vector<vector<ll>>
#define fi first
#define se second
#define vvvll vector<vector<vector<ll>>>
#define vvll vector<vector<ll>>
#define vll vector<ll>
#define pqll priorit... | #include <bits/stdc++.h>
using namespace std;
#define deb(k) cerr << #k << ": " << k << "\n";
#define size(a) (int)a.size()
#define fastcin cin.tie(0)->sync_with_stdio(0);
#define st first
#define nd second
#define pb push_back
#define mk make_pair
#define int long long
typedef long double ldbl;
typedef double dbl;
typ... |
#include <bits/stdc++.h>
using namespace std;
// #include <atcoder/all>
// using namespace atcoder;
// using mint = modint1000000007;
// using mint2 = modint998244353;
typedef int64_t Int;
#define all(x) (x).begin(), (x).end()
const double EPS = 1e-10;
const Int INF = 1e18;
const int inf = 1e9;
const Int mod = 1e9+... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> V(N, 0);
for (int i = 0; i < N; i++) {
int A;
cin >> A;
V.at(A)++;
}
int ans = 0, X = V.at(0);
for (int i = 0; i < N; i++) {
X = min(K,min(X, V.at(i)));
ans += X;
}
cout << ans << endl;... |
#include <iostream>
#include <string>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
using namespace std;
int main()
{
int N;
cin >> N;
int ans = (N - 1) / 100 + 1;
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
#define ll long long
#define ld long double
#define pb push_back
#define all(v) ((v).begin()),((v).end())
#define rep(i, val, n) for(int i = val; i < (n); i++)
#define repr(i, val, n) for(int i = n - 1; i >= val; i--)
using namespace std;
const ll mod = 1e9 + 7;
const ll inf = 2e18 + 100;
const... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define deb(x) cout << #x << " " << x << endl;
#define mod 1000000007
#define fast std::ios::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
#define endl "\n"
const ll INF = 1e18;
const ll NEGINF = -1 * INF;
/*NOTES: Take care of ll vs int
... | #include<stdio.h>
#include<iostream>
#include<string.h>
#include<algorithm>
#include<queue>
#include<stack>
#include<math.h>
#include<map>
typedef long long int ll;
using namespace std;
#define maxn 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f
const int mm=2e5+100;
int main()
{
ll i,j,a,b,c;
cin>>a>>b>>c;
... |
//! 尺卂乃卂.卂ﾌ乇乇ㄒ
#include<bits/stdc++.h>
//#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace std;
//Using namespace __gnu_pbds;
//typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> Ordered_set;
#define ll long long
#define int long long
#define ld... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, n) for (ll i = s; i < (ll)(n); i++)
int main() {
ll K, N, M;
cin >> K >> N >> M;
vector<ll> A(K);
vector<ll> B(K);
// lib priority queue 使い方
// l が既存, r が new element. new element の優先度が高い時は true を返すようにする
auto c = [](pai... |
#include<bits/stdc++.h>
using namespace std;
#define loop(i,n) for(int i=0;i<n;i++)
#define loop1(i,n) for(int i=1;i<=n;i++)
#define rloop(i,n) for(int i=n-1;i>=0;i--)
#define in cin>>
#define ou cout<<
#define nl cout<<endl;
#define yes cout<<"YES"<<endl;
#define no cout<<"NO"<<endl;
void solve()
{
int a,b;
c... | #include <iostream>
using namespace std;
int main(){ int x,y;
cin>>x>>y;
if(x==y){cout<<x;}
else if(x==0&&y==1){cout<<2;}
else if(x==0&&y==2){cout<<1;}
else if(x==1&&y==0){cout<<2;}
else if(x==1&&y==2){cout<<0;}
else if(x==2&&y==0){cout<<1;}
else if(x==2&&y==1){cout<<0;}
return 0;
} |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#if 0 //B
#include <iomanip>
#endif
using namespace std;
long long int T[8][8];
int N, K;
int root[9] = { -1,-1,-1,-1,-1,-1,-1,-1,-1 }; // 通る経路。
bool isVisited[8] = { false,false, false, false, false, false, false, false };
int counter = 0... | // #pragma GCC optimise ("O1")
#include<bits/stdc++.h>
using namespace std;
#define ll int
#define rep(i,j,n) for(ll i=j;i<n;i++)
#define scn(a) scanf("%d",&a)
#define scns(a,b) scanf("%d %d",&a,&b)
#define print(a) printf("%0.10lf",a)
#define vec vector<ll>
#define pb push_b... |
//int max = 2 147 483 647 (2^31-1)
//ll max = 9 223 372 036 854 775 807 (2^63-1)
#include<bits/stdc++.h>
using namespace std;
#define forn(i,n) for(int i=0;i<n;i++)
#define mp make_pair
#define f first
#define s second
#define pb push_back
#define MOD 1000000007
typedef long long ll;
typedef long double ld;
typedef v... | using namespace std;
#include<string>
#include<cmath>
#include<list>
#include<queue>
#include <map>
#include <unordered_map>
#include <set>
#define ll long long
#define ld long double
#define ull unsigned long long
#define ml map<ll,ll>
#define pb push_back
#define mp make_pair
#define ppl pair<ll,ll>
#define F first
#... |
// Problem: C - Squared Error
// Contest: AtCoder - AtCoder Beginner Contest 194
// URL: https://atcoder.jp/contests/abc194/tasks/abc194_c
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
#include <bits/stdc++.h>
using namespace std;
using l = long;
using ll = long long;
using ld = long double;
using db = double;
usin... | #include <bits/stdc++.h>
//#define IHAVEGIRLFRIEND
#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector,fast-math")
#pragma GCC target("sse,sse2,sse3,sse4,ssse3,popcnt,abm,mmx,avx,avx2,tune=native")
#define PB emplace_back
#define MP make_pair
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 200 + 10;
int c[8];
int main(){
ios_base::sync_with_stdio(false);
int tc;
cin >> tc;
while (tc --){
string s;
cin >> s;
if (s > "atcoder"){
cout << 0 << '\n';
continue;
}
bool found = 0;
for (int i = 0; i < s.si... | #include <bits/stdc++.h>
using namespace std;
string s;
string x = "atcoder";
int aduEgal(int poz)
{
if(s[poz] == x[poz])
return 0;
for(int i = poz + 1; i < s.size(); i ++)
{
if(x[poz] == s[i])
{
for(int j = i; j > poz; j --)
s[j] = s[j - 1];
... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int t;
ll n, s, k;
ll powmod (ll a, ll b) {
if (b == 0) return 1;
if (b == 1) return a % n;
ll tmp = powmod(a, b / 2);
tmp = (tmp * tmp) % n;
if (b & 1) return (tmp * a) % n;
return tmp;
}
ll phi (ll x) {
ll res = x;
for (ll i = 2; i * ... | #include <map>
#include <set>
#include <list>
#include <cmath>
#include <deque>
#include <stack>
#include <queue>
#include <array>
#include <bitset>
#include <cstdio>
#include <string>
#include <vector>
#include <random>
#include <chrono>
#include <utility>
#include <numeric>
#include <cstdlib>
#include <cstring>
#incl... |
//------------------------------------------
// C++ templete
//------------------------------------------
#include <bits/stdc++.h>
#define int long long
using namespace std;
//type
//------------------------------------------
using ll=long long;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
using vi=vector<int>;
us... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
int a[100010];
int main() {
int... |
#include <algorithm>
#include <iostream>
#include <cstdint>
int main() {
int N, K;
std::cin >> N >> K;
std::int64_t sum = 0;
for (int ab = 2; ab <= 2 * N; ++ab) {
const int cd = ab - K;
if (cd < 2 || cd > 2 * N) continue;
sum += std::min<std::int64_t>(ab - 1, 2 * N - ab + 1) * std::min<std::int64_t... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
using vi = vector<int64_t>;
using vvi = vector<vi>;
using ll = int64_t;
using P = pair<ll,ll>;
ll INF = 1000000007;
// ll INF = 9223372036854775807;
// ll INF = 998244353;
int main() {
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.