code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
//#pragma GCC target("avx,avx2,fma")
#define m_p make_pair
#define f first
#define s second
#define vec vector
#define sz(x) (int)x.size()
#define pw(x) (1LL<<x)
#define all(x) x.begin(),x.end()
#d... | #include<bits/stdc++.h>
using namespace std;
//-std=c++11
// #define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* name... |
#pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<cstdio>
#include<cstring>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<vector<int>> to(N);
for (int e = 0; e < N - 1; e++) {
int u, v;
cin >> u >> v;
u--, v--;
to[u].push_back(v), to[v].push_back(u);
}
int ng = -1, ok = N;
while (ok - ng >... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<char> vc;
typedef queue<ll> ql;
typedef deque<ll> dql;
typedef priority_queue<ll> pql;
typedef set<ll> sl;
typedef pair<ll, ll> pl;
ty... | #include <iostream>
#include <vector>
#include <numeric>
#include <algorithm>
#include <functional>
#include <bitset>
#ifdef VS
#define __builtin_clz(v) __lzcnt(v)
#endif
constexpr int MAXN = 18;
int n, m;
int gr[MAXN];
char dp[1 << MAXN];
std::bitset<1 << MAXN> may;
int32_t main() {
std::ios_base::sync_with_std... |
#include "iostream"
#include "algorithm"
#include "cstring"
#include "cstdio"
#include "cmath"
#include "vector"
#include "map"
#include "set"
#include "queue"
using namespace std;
#define MAXN 206
//#define int long long
#define rep(i, a, b) for (int i = (a), i##end = (b); i <= i##end; ++i)
#define per(i, a, b) for (i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define rep1(i,n) for(ll i=1;i<=(ll)(n);i++)
#define LOCAL 1;
#ifdef LOCAL
#define dbg(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl
#else
#define dbg(x) true
#endif
template<typename T>
ostream... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A;
cin >> A;
int B;
cin >> B;
int W;
cin >> W;
int i = 0;
int a = 0;
int c, d;
int w = W * 1000;
while (true) {
i++;
if (a == 0) {
if (A * i <= w && B * i >= w) {
a = 1;
c = i;
}
}
else if ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;//三年竞赛一场空，不开long long见祖宗
//typedef __int128 lll;
#define print(i) cout << "debug: " << i << endl
#define close() ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define mem(a, b) memset(a, b, sizeof(a))
#define pb(a) push_back(a)
#define x first
#defin... |
#include<bits/stdc++.h>
#define f first
#define int long long
#define s second
using namespace std;
const int N=2e5+5,mod=998244353;
int t,n,a[N];
string s;
main(){
cin>>n;
// t=1;
int ans=0,cur=0;
for(int i=1;i<=n;i++){
cin>>a[i];
}
sort(a+1,a+n+1);
for(int i=1;i<=n;i++){
ans += a[i]*((cur+a[i])%mod)%mod;... | #define _CRT_SECURE_NO_WARNINGS
#define fast ios::sync_with_stdio(false); cin.tie(0)
#define foru(i, k, n) for (ll i = k; i < n; i++)
#define ford(i, k, n) for (ll i = k; i >= n; i--)
#define pb push_back
#define ff first
#define ss second
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#i... |
#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>
#define endl '\n'
#define INF 0x3f3f3f3f
#define Inf 1000000000000000000LL
#define int long long
#define pb push_back
#define mp make_pair
#define F first
#define S second
using namespace std;
typedef pair<int,int>pii;
int n,m;
char a[510][510];
int cntr,cntb;
signed main(){
cin>>n>>m;
for(in... |
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
// Use g++ compiler for this include to work.
#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;
// Constants
#define INF 2e18
#define EPS 1e-9
#defin... | #include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<int,int> pi;
const int mod=1000000007;
inline int add(int x,int y)
{
return ((ll)x+y)%mod;
}
bool g[2005][2005];
int dp[2005][2005],lr[2005][2005],tb[2005][2005]... |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <bitset>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <cmath>
#include <time.h>
#include <random>
#include <string>
#include <cassert>
#include <vector>
#include <ostream>
#include <istream>
#include <stack>... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
int MOD;
class mint{
int x;
public:
mint():x(0){}
mint(long long y){ x=y%MOD; if(x<0) x+=MOD; }
mint& operator+=(const mint& m){ x+=m.x; if(x>=MOD) x-=MOD; return *this; }
mint& operator-=(const mint& m){ x-=m.x; if(x< 0) x... |
#include<bits/stdc++.h>
#include <iterator>
#include <iostream>
#include <numeric>
#include <math.h>
#define ll long long
#define ull long
#define mpa make_pair
#define pb push_back
#define ff first
#define pii pair<ll,ll>
#define dd double
#define trace(x) cerr << #x << " : " << x << endl
#define ss second
#define boo... | #include <iostream>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int N;
ll X;
cin >> N >> X;
vector<ll> V(N);
vector<ll> P(N);
for (int i = 0; i < N; ++i) {
cin >> V.at(i) >> P.at(i);
}
ll total = 0;
for (int i = 0; i < N; ++i) {
tot... |
#include <bits/stdc++.h>
int main() {
using namespace std;
cin.tie(nullptr)->sync_with_stdio(false);
int64_t a, b, c, d;
cin >> a >> b >> c >> d;
if (d * c - b > 0)
cout << (a + d * c - b - 1) / (d * c - b) << '\n';
else
cout << "-1\n";
}
| /**
* author: velengel
* created: 24.04.2021 21:04:04
**/
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; (i) < (int)(n); ++ (i))
using namespace std;
using ll = long long;
using P = pair<int, int>;
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
int mai... |
#include <iostream>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
if(a==b && b!=c){
cout<<c;
}
if(a==c && c!=b){
cout<<b;
}
if(b==c && c!=a){
cout<<a;
}
if(a==b && b==c){
cout<<a;
}
if(a!=b && b!=c && c!=a){
cout<<0;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<ll> vi;
typedef pair<ll,ll> pi;
#define forn(i,x,n) for(long long int i = x; i < n; ++i)
# define pb push_back
# define mp make_pair
struct node
{
char c;
ll v;
};
vector<ll> variable_list(10);
... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
long long N, p, q;
cin >> N;
p = 0;
q = N * (N - 1) * 0.5;
vector<int> A(N);
rep(i, N){
cin >> A.at(i);
}
sort(A.begin(), A.end());
rep(i, N - 1){
if(A.at(i) == A.at(i + 1)){
... | #include <bits/stdc++.h>
using namespace std;
#define FOR(x, a, b) for (int x = a; x <= b; x++)
#define FOD(x, a, b) for (int x = a; x >= b; x--)
#define REP(x, a, b) for (int x = a; x < b; x++)
#define RED(x, a, b) for (int x = a; x > b; x--)
void solve() {
int n, res = 0;
cin >> n;
vector<int> x(n), y(n... |
#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
template<class S, class T> inline S min_L(S a,T b){
return a<=b?a:b;
}
inline int my_getchar_unlocked(){
static char buf[1048576];
static int s = 1048576;
static int e = 1048576;
if(s == e && e == 1048576){
e = fread_unlocked(buf,... | #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>
using namespace std;
int main(){
int a,b;
cin >>a>>b;
vector<vector<char>> vec(a,vector<char>(b));
for(int i=0;i<a;i++){
for(int j=0;j<b;j++){
cin >>vec[i][j];
}
}
vector<int> x={-1,1,0,0};
vector<int> y={0,0,1,-1};
int ans=0;
for(int i=0;i<a;i++){
for(int j=0;... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const ll MOD = 1e9 + 7;
const int N = 2e3;
ll fastexpo(ll a, ll b) {
ll ret = 1;
while(b) {
if(b & 1) { ret = ret * a % MOD; }
a = a * a % MOD;
b >>= 1;
}
return ret;
}
int h, w, k;
string st[N + 5];
int h... |
#include <bits/stdc++.h>
using namespace std;
#define FAST_IO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define show(x) cerr << #x << " = " << x << '\n'
#define endl '\n'
typedef long long ll;
typedef unsigned long long ull;
const double EPS = 1e-10; // epsilon
const double PI = acos(-1);
const ll ... | #include <bits/stdc++.h>
using namespace std;
int main()
{
string x;
cin>>x;
int pos;
if(x.find(".")!=string::npos)
{
pos=x.find(".");
cout<<x.substr(0,pos);
}
else
cout<<x;
return 0;
} |
#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
inline void rd(int &x){
int k;
int m=0;
x=0;
for(;;){
k = getchar_unlocked();
if(k=='-'){
m=1;
break;
}
if('0'<=k&&k<='9'){
x=k-'0';
break;
}
}
for(;;){
k = getchar_unlocked();
if(... | #include <bits/stdc++.h>
using namespace std;
const long long mod1 = 1000000007;
using ll = long long;
using graph = vector<vector<int>>;
vector<ll> dx = {0,-1,0,1};
vector<ll> dy = {-1,0,1,0};
long long pow(long x,long n){
long long ans = 1;
while(n != 0){
long long a = x;
long long z = 1;
... |
#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>... | #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 L, R; cin >> L >> R;
vector<ll> cnt(R + 1, 0);
for (int i = R; i >= 2; i--) {
cnt[i] = R / i - (L - ... |
#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define DD double
#define Pb push_back
#define Bp pop_back
#define Pf push_front
#define Fp pop_front
#define Ub upper_bound
#define Lb lower_bound
#define Bs binary_search
#define In insert
#define Mp make_pair
#define All(x) x.begin(), x.end()
#defin... | #include <bits/stdc++.h>
/* #include <atcoder/all> */
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
using namespace std;
/* using namespace atcoder; */
using ll = long long;
usin... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INFint = 1e9+1;
const ll INFll = (ll)1e18+1;
const int MOD=1e9+7;
template <typename T>
struct SegmentTree {
int n;
vector<T> node;
using FX = function<T(T, T)>; // T•T -> T となる関数の型
FX fx;
const T ex; // 単位元(RMQの時はex=INFint)
// ... | // C++ program to show Segment Tree - XOR of range
#include<bits/stdc++.h>
using namespace std;
#define w(x) int x; cin>>x; while(x--)
#define nl "\n"
#define fr(i,t) for(int i=0;i<t;i++)
#define fr1(i,a,b) for(int i = a; i<b; i++)
#define frr(i,n) for(int i = n; i>=0; i--)
#... |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rep2(i,s,n) for (int i = (s); i < (int)(n); i++)
#define ALL(a) (a).begin(),(a).end()
#define PI 3.14159265358979
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 1e9+7LL;
vector<ll>... | /*
__
/\ \
_ __ ___ ___\ \ \/'\ ___ __ ___ ___ __
/\`'__\/ __`\ /'___\ \ , < / __`\ /'__`\ /' _ `\ /' _ `\ /'__`\
\ \ \//\ \L\ \/\ \__/\ \ \\`\ /\ \L\ \/\ \L\.\_/\ \/\ \/\ \/\ \/\ \L\.\_
\ \_\\ \____/\ \____\\ \_\ \_\ \____/\ \__/.\_\ \_\ \_\ ... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
cout << 2*a + 100 - b;
}
| #include <bits/stdc++.h>
#define endl "\n"
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef pair<ll, ll> PP;
#define rep(i, n) for(ll i = 0; i < ll(n); i++)
#define rrep(i, n) for(ll i = n - 1; i > -1; i--)
#define all(v) v.begin(), v.end()
#define pb push_back
#define fi first
#define se secon... |
/*
* ## ##### #### #### # # ####
* # # # # # # # # # # # #
* # # ##### # # # # # # #
* ###### # # # # # # ## # # #
* # # # # # # # # ## ## # #
* # # ##### #### #### # # ####
*/
#include <bits/stdc++.h>
us... | #include <iostream>
#include <iomanip>
#include <vector>
#include <set>
#include <string>
#include <queue>
#include <algorithm>
#include <map>
#include <cmath>
#include <numeric>
#include <list>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <tuple>
#include <deque>
#include <complex>... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define itn int
#define rep2(i,a,n) for(int i = (a);i < (n);i++)
#define rep(i,n) rep2(i,0,n)
int main(void){
string s,t;
cin >> s >> t;
if(s == "Y"){
if(t == "a")cout << "A";
else if(t == "b")cout << "B";
else cout ... | #include <cstdio>
#include <iostream>
#include <algorithm>
#include <cmath>
#define int long long
#define ll long long
using namespace std;
int n;ll k,s3[3000010],s2[3000010],f2[3000010],s[1000010];
void solve1(int sum,int fir,ll k)
{
ll sec=max(1ll,sum-fir-n)+k-1;
printf("%lld %lld %lld",fir,sec,sum-fir-sec);
exit(... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (int i = (s); i < (n); ++i)
#define rem(i, s, n) for (int i = (s); i >= (n); --i)
using ll = long long;
const int MOD = 1e9 + 7;
int main(){
int n, k, m; cin >> n >> k >> m;
vector<int> a(n); rep(i, 0, n) cin >> a[i];
int sum = accumul... | #include<iostream>
using namespace std;
int main(){
int n, k, m;
cin >> n >> k >> m;
int sum = 0;
for (int i = 0; i < n-1; i++)
{
int ai;
cin >> ai;
sum += ai;
}
int ans = n * m - sum;
if (ans <= k)
{
if(ans<0)
ans = 0;
cout << an... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
void solve()
{
ll r, x, y;
cin >> r >> x >> y;
double d = sqrt(x * x + y * y);
ll k = ceil(d / r);
if (d == r)
cout << "1";
else if (d <= 2 * r)
cout << "2";
else
cout << k;
}
int main()
{
i... | #include<bits/stdc++.h>
#pragma GCC optimize ("-O2")
using namespace std;
#define el "\n"
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vi ... |
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <iomanip>
#include <sstream>
#include <fstream>
#include <stdint.h>
#include <string.h>
#define _USE_MATH_DEFINES
#include <math.h>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#in... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define rrep(i, a, b) for (ll i = b - 1; a <= i; i--)
ll MOD = 1000000007;
ll N, M, Q, X[200010], Y[200010], op[200010][2], A[200010], B[200010];
ll c[200010][2], sign[200010][2];
bool swap_xy[200010];
... |
#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <climits>
#include <cmath>
#include <complex>
#include <functional>
#include <cassert>
#include <stack>
#include <numeric>
#include <iomanip>
#include <limits>
#include <random>
#include <unordered_map>
t... | #include <iostream>
#include <cstring>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <map>
#include <queue>
#include <deque>
#include <unordered_set>
#include <unordered_map>
#include <iomanip>
#include <utility>
#include <set>
const long long INF = 1LL<<60;
using ll = long long;
u... |
#include <bits/stdc++.h>
//#include <iostream>
//#include <vector>
//#include <string>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
const ll M = 998244353;
ll sum(ll mn, ll mx) {
return (mx - mn + 1)*(mn + mx) / 2;
}
int main() {
int t, l, r;
cin >> t;
rep(i, t) {
c... | /*
author : Aryan Agarwal, IIT KGP
created : 10-January-2021 18:43:37 IST
*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int mxn = 2e5;
const long long INF = 2e18;
const int32_t M = 1000000007; /*more than 1e9 */ /*7 + 1e9*/
// const int32_t M = 998244353; /*less than 1e9 */ /*... |
#include<bits/stdc++.h>
using namespace std;
#define SPEED ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define READ freopen("out.txt","r",stdin)
#define WRITE freopen("out.txt","w",stdout);
#define pb push_back
#define mem(arr,val) memset(arr,val,sizeof(arr))
#define sf(x) scanf("%d",&x)
#define sf2(x,y) s... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define FOR(i, j, k, in) for (ll i = j; i < k; i += in)
#define RFOR(i, j, k, in) for (ll i = j; i >= k; i -= in)
#define REP(i, j) FOR(i, 0, j, 1)
#define RREP(i, j) RFOR(i, j, 0, 1)
void add(vector<ll> &fw, ll index) ... |
#include <bits/stdc++.h>
using namespace std::literals::string_literals;
using i64 = std::int_fast64_t;
using std::cout;
using std::cerr;
using std::endl;
using std::cin;
#if defined(DONLINE_JUDGE)
#define NDEBUG
#elif defined(ONLINE_JUDGE)
#define NDEBUG
#endif
template<typename T> std::vector<T> make_v(size_t a){... | #include <bits/stdc++.h>
using namespace std;
#define fr(i,n) for(int i = 0; i<n; i++)
#define sz(v) (int)(v.size())
#define prin(a) cout << #a << " = " << a << endl
#define all(v) (v).begin(),(v).end()
#define rmax(a,b) a = max<ll>(a,b)
#define rmin(a,b) a = min<ll>(a,b)
typedef long long ll;
const int N = 110;
ll ... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define _GLIBCXX_DEBUG
ll gcd(ll x,ll y){
if(x<y)swap(x,y);
if(y==0)return x;
return gcd(y,x%y);
}
ll lcm(ll a,ll b){
return a*b/gcd(a,b);
}
int main() {
ll t,N;
cin>>t>>N;
int Q[200]={0};
for(int i=1;i<101;i++){
for(int j=1;j<=1... | #include<cstdio>
#define ll long long
ll t, n, ans;
int main(){
scanf("%lld%lld", &t, &n);
ans = 100*n/t;
if(100*n % t != 0) ans++;
ans = ans + ans*t/100;
printf("%lld", ans-1);
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define LL long long
#define READ(x) freopen(x,"r",stdin)
#define WRITE(x) freopen(x,"w",stdout)
#define BOOST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define pb push_back
#define mem(x,y) mems... |
#include<iostream>
using namespace std;
// {{{{{{{{{{{{{{{ SOLVER : SANGAM KUMAR }}}}}}}}}}}}}}}
#include<math.h>
#include<stdio.h>
#include <cstdlib>
#include <ctime>
#include<cmath>
#include<string.h>
#include<stdlib.h>
#include<bits/stdc++.h>
#define ll long long int
#define start ll _; cin>>_; whil... |
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define bg begin()
#define en end()
#define endl "\n"
#define vvl(n,m) vector<vector<ll> > a( n , vector<ll> (m))
#define fast ios_... | #include <stdio.h>
#include <algorithm>
#include <assert.h>
#include <cmath>
#include <deque>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vec... |
#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 <bits/stdc++.h>
#define REP(i, nn ) for(int i = 0 ; i < (int) nn; i++)
#define REPS(i, ss, nn ) for(int i = ss ; i < (int) nn; i++)
#define REV(i, ss, nn ) for(int i = ss ; i >= nn; i--)
#define deb(x) std::cout << #x << " " << x << endl;
#define debl(x) std::cout << #x << " " << x << " ";
#define all(x) x.beg... |
#include <bits/stdc++.h>
using namespace std;
void solve(){
int n, m;
cin>>n>>m;
vector<pair<int, int>> cond(m);
for(auto& [a, b] : cond)cin>>a>>b;
int k;
cin>>k;
vector<pair<int, int>> choice(k);
for(auto& [c , d] : choice) cin>>c>>d;
int ans = 0;
for(int bit=0;bit< 1 << k;bit++){
vector<bool> ba... | #include <bits/stdc++.h>
using namespace std;
// clang-format off
/* accelration */
// 高速バイナリ生成
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
// cin cout の結びつけ解除, stdioと同期しない(入出力非同期化)
// cとstdの入出力を混在させるとバグるので注意
struct Fast {Fast() {std::cin.tie(0); ios::sync_with_stdio(fals... |
#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 vector<int> vi;
typedef vector<ld> vd;
typedef vector<l... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int MAXN = 1e3 + 5;
const int MAXM = 1e3 + 5;
int fa[MAXN + MAXM];
inline void init(int n){ for(int i=1; i<=n; ++i) fa[i] = i;}
int find(int u){ return fa[u] == u? u: fa[u] = find(fa[u]);}
inline void connect(int u,int ... |
#include<bits/stdc++.h>
using ll = int_fast64_t;
using P = std::pair<ll,ll>;
using PP = std::pair<ll,P>;
#define REP(i,b,e) for(int i=b; i<e; i++)
#define PRINT(vec) {printf("[ ");for(auto &i:vec)printf("%ld ",i);puts("]");}
#define fi first
#define se second
const int MOD = 1e9+7;
int dx[] = {0, 1, 0, -1, 1, 1, -1, ... | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define ll long long int
#define sd(x) scanf("%lld",&x)
#define sdi(x) scanf("%d",&x)
#define sdc(c) scanf("%c",&c)
#define inf 1000000000000000000ll
#define pll pair<ll,ll>
#define pii pair<int,int>
#define fastio ios_base::sync_w... |
#include <iostream>
#include <climits>
using namespace std;
int main()
{
int N;
cin >> N;
int A[100];
int A_max = 0;
for (int i = 0; i < N; ++i) {
cin >> A[i];
A_max = max(A[i], A_max);
}
int max = 0;
int ans;
for (int k = 2; k <= A_max; ++k) {
int count = 0;
for (int i = 0; i < N; ++i) {
if (... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll N;
cin >> N;
ll p[N];
for(ll i = 0; i < N; i++){
cin >> p[i];
}
ll ans = 0;
ll t[210000];
for(ll i = 0; i < N; i++){
t[p[i]]++;
while (t[ans])
{
ans++;
... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
using Pll = pair<ll,ll>;
const ll INF = 1001001001;
void chmin(ll& a,ll b){if(a>b)a = b;}
int main(){
int n;
cin >> n;
vector<string> S(n);
... | #include <bits/stdc++.h>
using namespace std;
// template {{{
using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;
#define range(i, l, r) for (i64 i = (i64)(l); i < (i64)(r); (i) += 1)
#define rrange(i, l, r) for (i64 i = (i64)(r) - 1; i >= (i64)(l); (i) -= 1)
#define w... |
#include <bits/stdc++.h>
using namespace std;
struct s{
int value;
int idx;
}a[65538];
int main()
{
int n;
cin>>n;
n=pow(2,n);
for (int i=1;i<=n;i++)
{
cin>>a[i].value;
a[i].idx=i;
}
while(n>2)
{
for (int i=1;i<=n;i+=2)
{
if (a[i].value<a[i+1].valu... | //nik
#include <bits/stdc++.h>
#pragma GCC target("avx")
#pragma GCC optimize("Ofast")
#define reg register
#define FOR(a, b, c) for (a = b; a <=c; a++)
#define rFOR(a, b, c) for (a = b;a >= c; a--)
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define SORT(x) sort(all(x))
#define all(x) x.begin(), ... |
#include <iostream>
#include <iomanip>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <cstdio>
#include <utility>
#include <string>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <numeric>
using namespace std;
typedef u... | #include<iostream>
#include<algorithm>
#include<ctime>
#include<vector>
#include<string>
#include<cmath>
#include<map>
#include<iomanip>
#include<numeric>
#include<queue>
#include<deque>
#include<cfloat>
#include<functional>
#include<tuple>
#include<math.h>
#include<bitset>
#include<stack>
#include<set>
#include<random... |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b;
cin >> a >> b;
cout << max(0, (2 * (a) + 100) - b) << '\n';
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int a, b, c, mn;
cin >> a >> b >> c;
mn = min({a,b,c});
cout << a+b+c-mn << endl;
}
|
#include<bits/stdc++.h>
// #include<iostream>
// #include<algorithm>
// #include<vector>
// #include<set>
// #include<queue>
// #include<map>
using namespace std;
#define ll long long
#define ld long double
#define For(n) for(ll i=0;i<n;i++)
#define Forr(a,b) for(ll i=a;i<b;i++)
#define sortt(x) sort(x.begin(),x.en... | #include<bits/stdc++.h>
using namespace std;
using namespace std::chrono;
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long
#define rep(i,a,b) for(int i=a;i<b;i++)
#define repn(i,a,b) for(int i=a;i>=b;i--)
#define ff first
#define ss second
#define lb lower_bound
#define u... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=2e5+10;
int ans[N];
vector <int> g[N];
struct node{
int step;
int num;
}p;
int a[N];
int b[N];
int main()
{
int x,y,z;
cin>>x>>y>>z;
if(x==y)cout<<z;
else if(x==z) cout<<y;
else if(y==z) cout<<x;
else cout... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
char S, T; cin >> S >> T;
if(S == 'Y'){
char t = toupper(T);
cout << t << endl;
} else {
cout << T << endl;
}
return 0;
... |
#include <bits/stdc++.h>
using namespace std;
const int maxn=2e5+5;
char s[maxn];
int n,sum[maxn][30];
long long ans;
int book;
char ch;
int main() {
scanf("%s",s+1);
n=strlen(s+1);
book=n+1; ch='a'-1;
for(int i=1;i<=n;i++) {
for(int j=1;j<=26;j++) sum[i][j]=sum[i-1][j];
sum[i][(s[i]-'a'+1)]++;
}
for(int i... | #include <bits/stdc++.h>
#include <variant>
#define rep2(i,k,n) for(i64 i=(i64)(k);i<(i64)(n);i++)
#define rep(i,n) rep2(i,0,n)
#define all(x) begin(x),end(x)
#ifdef ENV_LOCAL
#define dump if (1) cerr
#else
#define dump if (0) cerr
#endif
using namespace std;
using namespace std::string_literals;
using i32 = int32... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 998244353;//1000000007;
constexpr long long INF = 1000000000 + 100;
constexpr long long LINF = 1000000000000000000 + 100;
constexpr double EPS = 1e-9;
#define ... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define FastIO cin.sync_with_stdio(false), cin.tie(nullptr)
#define pb push_back
#define fs first
#define sc second
#define mkp make_pair
#define endl '\n'
// IO
#define multitest signed __T; cin >> __T; while(__T--)
template<typename T>
void _read(T&... |
#include<bits/stdc++.h>
typedef long long LL;
typedef long double dl;
#define opt operator
#define pb push_back
#define pii std::pair<LL,LL>
const LL maxn=1e6+9,mod=998244353,inf=1e18;
LL Read(){
LL x(0),f(1); char c=getchar();
while(c<'0' || c>'9'){
if(c=='-') f=-1; c=getchar();
}
while(c>='0' && c<='9'){
x=(x... | #include<bits/stdc++.h>
using namespace std;
int main() {
long n,k,a;
cin>>n;
vector<long> vec(n);
for(long i=0; i<n; i++){
cin>>vec.at(i);
}
sort(vec.begin(),vec.end());
k=n/2;
a=vec.at(k);
double ans=0;
double b=a;
for(long i=0; i<n; i++){
ans+=vec.at(i)-min(vec.at(i),a);
}
ans=ans/n... |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define N 10100
#define MOD 998244353
#define ll long long
#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep2(i, a, b) for(int i = a; i <= b; ++i)
#define rep3(i, a, b) for(int i = a; i >= b; --i)
#define eb emplace_back
#define pb push_ba... | #include<bits/stdc++.h>
#define int long long
using namespace std;
const int mo=998244353;
int n,sum,ans;
int a[110],dp[110][110][10010],p[110];
signed main(){
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
sum+=a[i];
}
dp[0][0][0]=1;
for(int i=0;i<=n;i++)
for(int j=0;j<=i;j++)
for(int k=0;k<=n*100;k++){
d... |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
... | #include <iostream>
#include <map>
#include <vector>
#include <algorithm>
#include <set>
using namespace std;
using ll = long long;
map<ll, ll> freq;
set<ll> mex;
int n, m;
int main(){
ios::sync_with_stdio(0); cin.tie(0);
cin >> n >> m;
for(ll i = 0; i <= n; ++i)
mex.insert(i);
vector<ll> v... |
#include <iostream>
#include <vector>
#include <array>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <string>
#include <sstream>
#include <algorithm>
#include <random>
#include <cstdio>
#include <cstdlib>
#in... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod ll(1e9+7)
#define inv ll(500000004)
ll exp(ll a,ll b)
{
if(b==0)
return 1;
if(b%2==0){
return exp(a*a%mod,b/2);
}
return a*exp(a*a%mod,(b-1)/2)%mod;
}
int main()
{
int h,w;
cin>>h>>w;
int cnt=0;
vector<string>arr(h);
for(int i=0... |
/*
_/_/_/_/ _/_/_/_/_/ _/_/_/
_/ _/ _/ _/ _/
_/ _/ _/ _/ _/
_/ _/ _/ _/ _/
_/ _/ _/ _/ _/ _/
_/ _/ _/ _/ _/ _/_/
_/_/_/_/ _/_/ _/_/_/_/_/
_/_/_/_/ _/ _/ _/ _/
_/ _/ _/ _/ _/_/ _/_/
_/ _/ _/_/ ... | //#include<cstdio>
//#include<cassert>
//#include<iostream>
//#include<cstring>
//#include<algorithm>
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define MAX ((int)2e9 + 5)
#define MAXP ((int)2e5)
#define MAXL ((ll)1e18 + 5)
#define MAX_X ((ll)1e5 + 2)
#define pi ... |
#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 int long long int
#define mod 1000000007
#define string_mod 2549536629329_base_255
#define pb push_back
#define F first
#define S second
#define ff first
#defin... | #include <bits/stdc++.h>
#define FOR(i, m, n) for (ll i = m; i < (n); i++)
#define RFOR(i, m, n) for (ll i = (m - 1); i >= 0; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, n, 0)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
//#define print(ele) cout << (ele) << "\n"
#define pri... |
/*
Bismillahir rahmanir rahim
Name : Mir Rifat
Bsmrstu.
*/
#include <bits/stdc++.h>
using namespace std ;
typedef long long ll;
#define fastio ios_base::sync_with_stdio(false),cin.tie(NULL)
#define T int t,q; cin >> t; for(q=1;q<=t;q++)
#define Forn(i,n) for(int i=0;i<n;i++)
#... | #include <bits/stdc++.h>
using namespace std;
#define clr(a) memset(a, 0, sizeof(a))
#define full(a) memset(a, 0x3f, sizeof(a))
#define mset(a, b) memset(a, b, sizeof(a))
#define cpy(a,b) memcpy(a, b, sizeof(a))
#define fornext(x, i) for(signed i = hd[x], y = ver[i]; i; i = nxt[i], y = ver[i])
#define Rep(i, a, b) for(... |
//*
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//*/
#include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
// using namespace atcoder;
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<"... | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define reps(i, j, n) for (ll i = j; i < (n); ++i)
#define ALL(s) ((s).begin(), (s).end())
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
using namespace std;
typedef long long ll;
cons... |
#include <bits/stdc++.h>
using namespace std;
#define ull unsigned long long
#define MOD (int)(1e9+7)
#define MOD1 998244353
#define ceil(x, y) ((x)%(y))==0? ((x)/(y)) : ((x)/(y)+1)
#define FOR(i, N) for(int i = 0; i < N; ++i)
#define FOR1(i, N) for(int i = 1; i <= N; ++i)
#define vi vector <int>
#define pii pair <int,... | #include<bits/stdc++.h>
using namespace std;
int M, mod;
long long N;
int mul (int x, int y) {return 1LL * x * y % mod;}
int power (int a, long long b)
{
int p = 1;
for (int i=0; (1LL<<i) <= b; i++)
{
if (b & (1LL << i)) p = mul (p, a);
a = mul (a, a);
}
return p;
}
int main ()
... |
#include "bits/stdc++.h"
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
typedef long long ll;
typedef unsigned long long ull;
typedef string str;
typedef double db;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi... | #include <iostream>
#include <string>
using namespace std;
bool palind(string nb){
int i = 0;
int j = nb.size() - 1;
bool palind = true;
while (i <= j & palind == true){
if (nb[i] == nb[j]){
i += 1;
j -= 1;
}
else{
palind = false;
}
... |
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
//#include <fstream>
#include <string>
#include <math.h>
#include <set>
#include <string>
#include <bitset>
//#include <fstream>
//#include <stack>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typede... | // YATIN KWATRA
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ar array
#define sz(v) (int)(v.size())
#define inf 1e18
#define int... |
#include<bits/stdc++.h>
#include<algorithm>
#include<string.h>
#include<numeric>
#include<vector>
#include<math.h>
#include<map>
using namespace std;
#define dude ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define mesc(number,character) char f[number];memset(f,character,number);
#define mesi... | #include<bits/stdc++.h>
using namespace std;
const int maxn = 5010;
const int mod = 998244353;
int add (int x, int y) {return x + y >= mod ? x + y - mod : x + y;}
int sub (int x, int y) {return x - y < 0 ? x - y + mod : x - y;}
int mul (int x, int y) {return 1LL * x * y % mod;}
int qpm (int x, int y)
{
int r = 1;... |
//#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector")
#include <bits/stdc++.h>
#include<set>
#include <array>
using namespace std;
#define ll long long
#define endl '\n'
#define mod 998244353
#define pb push_back
#define ff first
#define ss second
#define con continue
#define ub upper_bound
#define lb lower_b... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(a) (a).begin(),(a).end()
#define sz(x) int(x.size())
using namespace std;
using ll = long long;
using P = pair<int,int>;
using T = tuple<int,int,int>;
using Graph = vector<vector<int>>;
template<class T> inline bool chmin(T& a, T b) { i... |
#include<cstdio>
#include<cmath>
#include<cstring>
#include<string>
#include<algorithm>
#include<queue>
#include<map>
#include<set>
#include<vector>
#include<functional>
#include <random>
#include<iostream>
#include<iomanip>
using namespace std;
int main() {
int N, M;
int state[1000];
cin >> N >> M;
for (int i = ... | #include<bits/stdc++.h>
#include<iostream>
#include<set>
#include<map>
#include<iterator>
#define ll long long
#define lli long long int
#define pb push_back
#define mp make_pair
#define RIP(i,n) for(ll i=0; i<n; i++)
#define F(i,a,b) for(int i=a; i<b; i+... |
#include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(f,c,...) (([&](decltype((c)) cccc) { return (f)(std::begin(cccc), std::end(cccc), ## __VA_ARGS__); })(c))
template <class T>
inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
... | #include<iostream>
#include<cstring>
#include<cassert>
#include<cmath>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<vector>
#include<time.h>
#include<bitset>
#include<cstdio>
#include<algorithm>
using namespace std;
#define REP(i,x,y) for(int i=x;i<=y;i++)
#define rep(i,n) REP(i,1,n)
#define rep... |
#include "bits/stdc++.h"
using namespace std;
// 定義
typedef long long ll;
typedef pair<ll, ll> P;
#define ALL(x) (x).begin(),(x).end()
#define REP(i, n) for(ll i = 0 ; i < (ll)n ; ++i)
#define REPN(i, m, n) for(ll i = m ; i < (ll)n ; ++i)
#define VL vector<ll>
#define... | #include<cstdio>
#include<functional>
#include<utility>
#include<algorithm>
#include<set>
using namespace std;
using ll = long long;
using ull = unsigned long long;
int main(){
int N, M;
scanf("%d %d", &N, &M);
pair<int, int> pawn[M];
for (unsigned i = 0; i < M; i++) scanf("%d %d", &pawn[i].first, &paw... |
#include <bits/stdc++.h>
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using namespace std;
using Graph = vector<vector<int>>;
using vst= vector<string>;
using vin= vector<int>;
using ll=long long;
using ull=unsigned long long;
using vll= vector<ll>;
using P=pair<int ,... | #include<iostream>
#include<algorithm>
#include<vector>
#include<cmath>
#include<string>
#include<set>
#define ll long long
using namespace std;
int main(){
int n,m;
cin>>n>>m;
vector<int> a(m),b(m);
for(int i=0;i<m;i++){
cin>>a[i]>>b[i];
}
int k;
cin>>k;
vector<int> c(k),d(k);
... |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, s, n) for (int i = (s); i < (n); ++i)
#define all(a) a.begin(), a.end()
#define len(x) (int)(x).size()
#define dup(x, y) (((x) + (y)-1) / (y))
#define pb push_back
#define Field(T) vector<vector<T>>
using namespace std;
using ll = long long;
usi... | #include<bits/stdc++.h>
#define ll long long int
#define dd double
using namespace std;
const ll MOD = 1e9 + 7;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin>>n;
ll sum=0;
ll i=0;
for(i=1;i<=n;i++){
sum=sum+i;
// cout<<sum<<endl;
if(sum>=n){
break;
}
}
cou... |
//#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector")
#include <bits/stdc++.h>
#include<set>
using namespace std;
#define ll long long
#define endl '\n'
#define pb push_back
#define ff first
#define ss second
#define si(x) int(x.size())
#define sum_all(a) ( accumulate ((a).begin(), (a).end(), 0ll))
#d... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
# define M_PI 3.14159265358979323846
const int M=1e9+7;
long long mod(long long x){
return ((x%M + M)%M);
}
... |
#include <bits/stdc++.h>
using namespace std;
struct DSU {
vector<int> ps;
DSU(int n): ps(n) {
iota(ps.begin(), ps.end(), 0);
}
int find(int i) {
if (ps[i] == i) {
return i;
}
return ps[i] = find(ps[i]);
}
bool merge(int i, int j) {
i = find(... | #include <bits/stdc++.h>
#define Ri register int
#define ll long long
#define db double
#define FOR(i, j, k) for(Ri i = j; i <= k; i++)
#define DEC(i, j, k) for(Ri i = j; i >= k; i--)
using namespace std;
const int maxn = 2e5 + 100;
int n;
vector<int> g[maxn];
int mx, xm;
int d[maxn];
inline void dfs(int u, int fa) {... |
#include <stdio.h>
#include <algorithm>
#include <map>
#include <vector>
struct segTree{
int value[800010];
void setValue(int ind ,int val, int l=1, int r=200000, int v=1)
{
if(l==r) value[v] = val;
else
{
int h = (l+r)/2;
if(ind<=h) setValue(ind,val,l,h,2*v);
else setValue(ind,val,h+1,r,2*v+1);
v... | #include <iostream>
#include <vector>
#include <deque>
#include <iomanip>
using namespace std;
using ll = int64_t;
using ld = double;
int main() {
ll n;
cin >> n;
vector<vector<ll>> E(n, vector<ll>{});
for(ll i=0; i<n; i++) {
string S;
cin >> S;
for(ll j=0; j<n; j++) {
if(S[j]=='1') {
... |
/**
* author: Taichicchi
* created: 17.04.2021 11:31:39
**/
#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() {
long double R, X, Y;
cin >> R >> X >> Y;
lo... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <utility>
#include <string>
#include <fstream>
#include <map>
#include <set>
#include <queue>
#include <memory.h>
using namespace std;
typedef vector<int> VI;
typedef pair<long long, long long> PI;
typedef vector<PI> VPI;
#define F... |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
int main() {
int n;
string s;
cin >> n >> s;
int ans = -1;
if (s[0] != s[n - 1]) ans = 1;
else {
for (int i = 1; i < n - 1; i++) {
... | #include<bits/stdc++.h>
using namespace std;
//#include <atcoder/modint>
//using namespace atcoder;
//using mint = modint998244353;
//using mint = modint1000000007;
#pragma region template
using ll = long long;
using PII = pair<int, int>;
using PLL = pair<ll, ll>;
template <class T> using V = vector<T>;
template <class... |
#include <bits/stdc++.h>
using namespace std;
// clang-format off
/* accelration */
// 高速バイナリ生成
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
// cin cout の結びつけ解除, stdioと同期しない(入出力非同期化)
// cとstdの入出力を混在させるとバグるので注意
struct Fast {Fast() {std::cin.tie(0); ios::sync_with_stdio(false... | #include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
int main(void)
{
int n=0;
int a[200000] = {};
// int counter[200000] = {};
long long count=0,temp_count=1;
int i=0,j=0;
cin >> n;
for (i=0;i<n;i++){
cin >> a[i];
}
for(i=0;i<n;i++){
... |
#include <bits/stdc++.h>
using namespace std;
using ull = unsigned long long;
int main(){
ull n,c=0;
cin >> n;
for(ull i=1;i<1000000;i++){
string s = to_string(i) + to_string(i);
if(stoull(s)<=n){
c++;
}
else{
break;
}
}
cout << c << endl;
return 0;
} | /*
* @Author: Luisvacson
* @LastEditors: Luisvacson
* @Descriptions: None
* @Date: 2021-03-20 20:06:05
* @LastEditTime: 2021-03-20 20:40:54
* @FilePath: \C++\Practice\ABC196C.cpp
*/
#include <bits/stdc++.h>
#define int long long
using namespace std;
int a[15], b[15];
string s;
signed main() {
cin >> s;
... |
#include<iostream>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>
#include<iomanip>
using namespace std;
int main(){
long double N,D,H,mini = 100000000,ans;
vector<long double> d,h;
cin >> N >> D >> H;
d.resize(N);
h.resize(N);
for(long long i = 0;i<N;i++){
cin >> d[i] >> h[i];
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define for_(i, a, b) for(int i = (a);i < (b);++i)
#define ford_(i, a, b) for(int i = (b)-1;i >= (a);--i)
#define rep(i, n) for_(i, 0, n)
#define repd(i, n) rfor_(i, 0, n)
int main(){
int n;
double d,h;
cin >> n >> d >> h;
vector<double> a(... |
//بسم الله الرحمن الرحيم
// -----> Author : N A Y E M
// -----> [ CSE-19 , CU ]
#include<bits/stdc++.h>
using namespace std ;
typedef long long ll;
typedef unsigned long long ull ;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int,int> pii;
t... | #pragma region header
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n)for(int i=0;i<(n);i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define int ll
#define each(i, a) for (auto &&i : (a))
using ll = long long;
using ld = long double;
using vi = v... |
#define DEBUG 0
#include <bits/stdc++.h>
#define all(v) (v).begin(), (v).end()
#define pb push_back
#define eb emplace_back
#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 REP(i, begin, end) for(int i = int(begin); i < int(end); i++)
#define UNIQUE(x) sort(all(x)), x.e... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template<class T,class U> using P = pair<T,U>;
template<class T> using vec = vector<T>;
template<class T> using vvec = vector<vec<T>>;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
int main(){
ll n; cin >> n;
for(int i = 1; i <= 1e6; i++){
... |
#include<ctime>
#include<queue>
#include<cstdio>
#include<cctype>
#include<cstring>
#define ll long long
const ll N=2e5+10;
using namespace std;
ll read() {
char c;
ll x=0,f=1;
while(!isdigit(c=getchar()))
f-=2*(c=='-');
while (isdigit(c)){
x=x*10+(c-48)*f;
c=getchar();
}
return x;
}
struct edge{
ll to,t,k... | #include <bits/stdc++.h>
using namespace std;
void DFS(int u, vector<set<int>>& edges, vector<set<int>>& to) {
while (!edges[u].empty()) {
int v = *(edges[u].begin());
// u -> v
edges[u].erase(v);
edges[v].erase(u);
to[u].insert(v);
DFS(v, edges, to);
}
retur... |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll I=1167167167167167167;
ll Q=1e9+7;
#define rep(i,a) for (ll i=0;i<a;i++)
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
temp... | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(),(x).end()
#define COUT(x) cout<<(x)<<"\n"
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define REP(i,n) for(int i=0;i<n;i++)
#define YES(x) cout<<(x?"YES":"NO")<<"\n"
#define Yes(x) cout<<(x?"Yes":"No")<<"\n"
#define dump(x) cout<... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int c; cin >> c;
cout << (c-1) / 100 + 1 << endl;
} | /*
ID: anonymo14
TASK: wormhole
LANG: C++
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int,int>> vpii;
typedef vector<pair<ll,ll>> vpll;
int solve() {//267
int num;
cin>>num... |
#include<bits/stdc++.h>
using namespace std;
const int maxn=5e5+5;
char s[maxn],t[2][maxn],st[maxn],k[maxn];
int n,C,tot,p[maxn],sum[maxn],top,K,cnt[2];
int main(){
scanf("%s",s+1);
n=strlen(s+1);
for(int i=1;i<=n;i++){
if(s[i]=='R')tot^=1,++C;
else{
t[tot][++cnt[tot]]=s[i];
}
}
if(C%2==0){
for(int i... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <string>
#include <stdlib.h>
#include <cmath>
#include <algorithm>
#include <numeric>
#include <climits>
#include <iomanip>
#include <deque>
#include <limits>
#include <map>
#include <set>
#include <functional>
using name... |
#include <bits/stdc++.h>
typedef long long ll;
const int N = 100;
const int S = N * N;
const int P = 998244353;
inline int norm(int x) {if (x >= P) x -= P; return x;}
inline int reduce(int x) {if (x < 0) x += P; return x;}
inline void add(int &x, int y) {if ((x += y) >= P) x -= P;}
inline void sub(int &x, int y) {if... | #include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>
#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x... |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long R,x,y;
cin>>R>>x>>y;
float D = sqrt(x*x+y*y);
if(D==R)
{
cout<<1<<endl;
}
else if(D<=R+R)
{
cout<<2<<endl;
}
else cout<<ceil(D/R)<<endl;
return 0;
} | #include <bits/stdc++.h>
typedef long long ll;
#define ALL(l) (l).begin(),(l).end()
#define rep(i,n) for(ll (i)=0;(i)<(n);(i)++)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
using namespace std;
//const ll mod = 998244353;
//const ll maxn = 1000000000;
//const ll mod = 1000000007;
//-----------------... |
/*
author : TAPAN SAVANI
codeforces : savanitapan2001
codechef : savanitapan17
*/
/*
------------------------------------------------------------------------
░██╗░░░░░░░██╗░█████╗░██████╗░██╗░░██╗ ██╗░░██╗░█████╗░██████╗░██████╗░
░██║░░██... |
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template <class c, class cmp = less<c> > using ordered_set = tree<c, null_type, cmp, rb_tree_tag, tree_order_statistics_node_update>;
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NU... |
#include "bits/stdc++.h"
#define int long
#define MOD 1000000007
#define PI 3.14159265359
#define fi first
#define se second
#define pb push_back
#define se second
#define vi vector<int>
#define vvi vector<vi>
#define len(x) (int)x.size()
#define pi pair<int,int>
#define vpi vector<pi>
#define maxheap priority_queue<in... | #include <iostream>
#include <map>
#include <vector>
class disjoint_set {
std::vector<int> parent;
public:
std::vector<std::map<int,int>> mp;
disjoint_set(int n): parent(n,-1), mp(n) {};
int find(int x) {
if (parent[x] < 0) return x;
return parent[x] = find(parent[x]);
}
void fu... |
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#define endl '\n';
#define sz(s) int(s.size())
#define all(v) ((v).begin()),((v).end())
#define allr(v) ((v).rbegin()), ((v).rend())
#define mem(x,y) memset(x,y,sizeof(x))
#define Ceil(x,y) ((x+y-1)/y)
typedef long long ll;
typedef double dl;
using namespace std... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (ll i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define sz(x) (int)(x).size()
#define pb push_back
using ll = long long;
using ld=lon... |
#include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<unordered_map>
#include<unordered_set>
#include<cstring>... | #include <bits/stdc++.h>
using namespace std;
// Compile with "(g++) -std=c++11 -Wall -Wextra -Wconversion -Wshadow -Dcychien"
#ifdef cychien
#define debug(...) do {\
fprintf(stderr, "%s - %d : (%s) = ", __PRETTY_FUNCTION__, __LINE__, #__VA_ARGS__);\
_DO(__VA_ARGS__);\
}while(0)
template<typename I> void _DO(I&&x... |
#include<bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/detail/standard_policies.hpp>
// using namespace __gnu_pbds;
#pragma GCC optimize("O3")
#ifdef LOCAL
#include "/Users/lbjlc/Desktop/coding/debug_utils.h"
#else
#define print(...) ;
#define printn(...) ;
#de... | #include<bits/stdc++.h>
using namespace std;
// #define LOCAL
typedef long long ll;
#ifdef LOCAL
constexpr int DEBUG = 1;
#else
constexpr int DEBUG = 0;
#endif
const int N = 505;
const int MOD = 998244353;
char s[N][N], t[N + N];
void solve() {
int n, m;
scanf("%d%d", &n, &m);
for(int i = 1; i <= ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double lf;
#define Rl(x) scanf ("%lld", &x)
#define Ri(x) scanf ("%d", &x)
#define Rf(x) scanf ("%lf", &x)
const int maxn = 2e5 + 5, mod = 998244353;
int n, m; LL a[maxn], tmp[maxn], ans[maxn];
inline void D(LL *a, LL *b) {
memset(tmp, 0, s... | #include<bits/stdc++.h>
using namespace std;
namespace IO
{
const int buf_size=1<<20;
char buf[buf_size],*S,*T;
inline char read_char()
{
if(S==T)
T=(S=buf)+fread(buf,1,buf_size,stdin);
return S!=T?*(S++):EOF;
}
bool flag_EOF;
inline int read_int()
{
c... |
#include <bits/stdc++.h>
/* #include <atcoder/lazysegtree> */
using namespace std;
/* using namespace atcoder; */
using pint = pair<int, int>;
using ll = long long;
using ull = unsigned long long;
using vint = vector<int>;
using vll = vector<long long>;
using pll = pair<ll, ll>;
#define FOR(i, begin, end) \
for (lo... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<int> a(n), t(n);
for (int i = 0; i < n; i++) cin >> a[i] >> t[i];
vector<long long> pref(n);
pref[0] = (t[0] == 1) * a[0];
for (int i = 1; i < n; i++) {
pref[i] = (t[i] == 1) ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
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 rep(i, n) for (int i = 0; i < (int)(... | #include <cstdio>
#include <climits>
#include <cmath>
#include <iostream>
#include <cstdio>
#include <climits>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <string>
#include <cstdio>
#include <climits>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <utility>
#i... |
#include<bits/stdc++.h>
#define ll long long
#define int ll
#define pb push_back
#define N 2003
#define f1 first
#define s2 second
#define PII pair<int,int>
using namespace std;
double dp[105][105][105];
int a,b,c,d,t;
string s;
double dpf(int a,int b,int c){
if(a==100 || b==100 ||c==100 )
return 0;
if(dp[... | #include<bits/stdc++.h>
using namespace std;
int H, W, A, B;
bool used[16][16];
int dfs(int x, int y, int a) {
if (H == y) return a == 0;
if (W == x) return dfs(0, y + 1, a);
if (used[y][x]) return dfs(x + 1, y, a);
int res = 0;
if (y + 1 < H && !used[y+1][x] && 0 < a) {
used[y][x] = ... |
#include <algorithm>
#include <array>
#include <cstdio>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define ll long long
#define INF 1LL << 33
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define SHOW(p) \
if (test) \
cout <<... | #include <bits/stdc++.h>
#define maxn 2086
using namespace std;
int n, m;
char s[maxn][maxn];
int fa[maxn], siz[maxn];
int find(int x){
return x == fa[x] ? x : fa[x] = find(fa[x]);
}
set<int> st[2];
int main(){
scanf("%d%d", &n, &m);
for(int i = 1;i <= n;i++) scanf("%s", s[i] + 1);
for(int i = 1;i <= n + m;i... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<double> x(N), y(N);
for (int i = 0; i < N; i++) {
cin >> x.at(i) >> y.at(i);
}
double a;
for (int i = 0; i < N - 1; i++) {
set<double> c;
for (int j = i + 1; j < N; j++) {
if (x.at(j) == x.at(i)) {
... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define out(x) cout << x << '\n'
#define lli long long int
#define uli unsigned long long int
#define rep(i, m, n) for (lli i = m; i < (n); i++)
#define repe(i, m, n) for (lli i = m; i <= (n); i++)
#define ALL(x) (x).begin(), (x).end()
#define ... |
#include<algorithm>
#include<cstdio>
#define ll long long
#define MaxN 200500
using namespace std;
const int mod=1000000007;
int n,a[MaxN];
int main()
{
scanf("%d",&n);
for (int i=1;i<=n;i++)scanf("%d",&a[i]);
sort(a+1,a+n+1);
ll ans=1;
for (int i=1;i<=n;i++)
ans=(ans*(a[i]-a[i-1]+1))%mod;
printf("%lld"... | #include <bits/stdc++.h>
#define rep(i, x, y) for (int i = x; i <= y; i++)
#define per(i, x, y) for (int i = x; i >= y; i--)
#define vi vector<int>
#define Go(i, x, v) for (int i = 0, x = (i == v.size() ? 0 : v[i]); i < v.size(); i++, x = (i == v.size() ? 0 : v[i]))
#define pb push_back
#define mkp make_pair
#define fi... |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
/* alias */
using ull = unsigned long long;
using ll = long long;
/* define short */
#define all(obj) (obj).begin(), (obj).end()
#define YESNO(bool) if(bool){cout<<"YES"<<endl;}else{... | #include <bits/stdc++.h>
using namespace std;
long long a, b, c;
int main() {
cin >> a >> b >> c;
c = c % 2 ? 1 : 2;
if (c == 1) {
if (a > b)
cout << '>';
if (a < b)
cout << '<';
if (a == b)
cout << '=';
}
else {
a *= a;
b *= b;
if (a > b)
cout << '>';
if (a < b)
cout... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vecll = vector<ll>;
using matll = vector<vector<ll>>;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
#define repitr(id, itr) for (auto& id : itr)
#define repr(i, a, b) for (ll i = ll(a); i < ll(b); i++)
#define reprs(i, a, b, s) for (ll i = ll... | #include <bits/stdc++.h>
using namespace std;
#define fast_io cin.tie(0);ios_base::sync_with_stdio(0);
string to_string(string s) { return '"' + s + '"';}
string to_string(char s) { return string(1, s);}
string to_string(const char* s) { return to_string((string) s);}
string to_string(bool b) { return (b ? "true" : "fa... |
#include<bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
int pt[n][2];
for(int i=0; i<n; i++) {
cin>>pt[i][0]>>pt[i][1];
}
int x1, y1, x2, y2, x3, y3;
for(int i=0; i<=n-3; i++) {
x1 = pt[i][0];
y1 = pt[i][1];
for(int j=i+1; j<=n-2; j++) {
x2 = pt[j][0];
y2 = pt[j][1];
for(int ... | #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)
#endif
#... |
#define MOD 1000000007
#pragma GCC target("popcnt")
#include <bits/stdc++.h>
#include <numeric>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int64_t n;
cin>>n;
array < in... | #include <bits/stdc++.h>
using namespace std;
int main(){
long long i,j,k,l,m,n,t,r,g,b1;
long long a[200010],b[200010],c[200010];
char ch;
cin>>n;
r=g=b1=0;
for(i=0;i<2*n;i++) {
cin>>k;
getchar();
ch=getchar();
if (ch=='R') {
a[r++]=k;
}
... |
#include <iostream>
#include<vector>
#include<algorithm>
#include<utility>
#include<math.h>
#include<iomanip>
#include<string>
#include <cassert>
#include <complex>
#include<math.h>
#include<bits/stdc++.h>
#define rep(s,i,n) for(int i = s;i < n;i++)
using namespace std;
typedef long long ll;
typedef long double ld... | #include <bits/stdc++.h>
#include<sstream>
#include<string>
#include<vector>
#include <set>
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define pb push_back
#define mp make_pair
#define ll long long
#define lb lower_bound
#define ub upper_bound
#define endl "\n"
#define ff first
#define s... |
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
typedef long long ll;
const int N = 15;
string s1, s2, s3;
string as;
int mp[128];
void get(string& s, ll& x) {
x = 0;
for (int i = 0; i < s.size(); ++i) x = x * 10 + mp[s[i]];
}
bool check() {
static ll x, y, z;
if (!... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < (t); ++i)
#define dsrep(i,t,s) for(int i = (t)-1; i >= (s); --i)
#define rng... |
#include <bits/stdc++.h>
#define endl '\n'
#define inf 0x3f3f3f3f
using namespace std;
using ll = long long int;
int main(){
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << min({a, b, c, d}) << endl;
}
// Author: bitbeast
// Practice more! | #include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1000000007;
typedef int64_t ll;
typedef uint64_t ull;
#define FOR(i, start, end) for(uint64_t i=start; i<end; i++)
#define REP(i, n) FOR(i, 0, n)
// 最大公約数gcd
// 最小公倍数lcm=m*n/gcd
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;
while (m % n !=... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.