code_file1 stringlengths 87 4k | code_file2 stringlengths 85 4k |
|---|---|
#include <algorithm>
#include <cassert>
#include <cstdint>
#include <iostream>
#include <map>
#include <vector>
#define REP_(i, a_, b_, a, b, ...) \
for (int i = (a), lim##i = (b); i < lim##i; i++)
#define REP(i, ...) REP_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define ALL(obj) obj.begin(), obj.end()
using n... | // #include<vector>
// #include<iostream>
// #include<stdio.h>
// #include<string>
// #include<algorithm>
#include<bits/stdc++.h>
using namespace std;
int main() {
int a,b;
cin >> a >> b;
if ( b >= 8 && a+b >= 15) {
cout << 1 << endl;
return 0;
}
if ( b >= 3 && a+b >= 10) {
cout << 2 << endl;
return 0;
}... |
#include<bits/stdc++.h>
#define pb push_back
#define pl pair<ll,ll>
#define pll pair<ll,pair<ll,ll>>
#define ll long long
#define vl vector<ll>
#define fastio ios_base::sync_with_stdio(false); ... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... |
#include <cmath>
#include <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 LL = long long;
constexpr LL mod = 998244353;
LL power(LL a, LL r){
LL res = 1;
for(; r; r >>= 1, a = a * a % mod)
if(r & 1) res = res * a % mod;
return res;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
LL N, M, K, ans = ... |
//PochurSolveKortaHobaa
#include<bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int a,b,c;
cin>>a>>b>>c;
if(c==0){
while(1){
a--;
if(a<=0){
cout<<"Aoki";
break;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1000000000
#define endl "\n"
#define all(s) s.begin(),s.end()
#define pb push_back
#define pi 3.1415926536
#define dig(a) fixed<<setprecision(a)
#define fast() ios_base::sync_with_stdio(false); cin.tie(NULL);
const int M = 1e9+7;
const int ... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,srt,end) for(ll i = (srt); i < (ll)(end); i++)
ll MOD=1000000007;
ll mod=998244353;
int inf=1000001000;
ll INF=1e18+5;
//cout << std::fixed << std::setprecision(15) << y << endl;
// For debug
// Ref: https://qiita.com/ysuzuki19/items/d89... | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
constexpr lint inf = 1LL << 60;
constexpr lint mod = 1000000007;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int x;
cin >> x;
cout << 100 - x % 100 << endl;
return 0;
} |
#include <bits/stdc++.h>
#define se second
#define sz(x) (int)(x.size())
#define ll long long
#define rep(i,x,y) for(int i = x; i <= y; ++i)
#define repr(i,x,y) for(int i = x; i >= y; --i)
#define pb push_back
#define mp make_pair
#define fi first
#define ull unsigned ll
#define pi 3.14159265358979
using name... | /* ** *** In the name of God *** ** */
// Only Haider is Amir al-Momenin
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll maxn = 2e5 + 10;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int a,b,c;
cin >> a >> b >> c;
if (a * a + b * b < c * c) cout << "Yes";
else ... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
using Graph = vector<vector<int>>;
const long long INF = 1LL << 60... | #include <bits/stdc++.h>
using namespace std;
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
typedef pair<ll,ll> P;
#define mod 1000000007
ll gcd(ll x,ll y) {return y ? gcd(y,x%y) : x;}
ll lcm(ll x,ll y) {return x/gcd(x,y)*y;}
int main(){
ll ... |
#include<bits/stdc++.h>
#include <stdio.h>
#include <algorithm>
#define all(x) x.begin(),x.end()
#define sc(x) scanf("%d",&x)
#define scl(x) scanf("%lld",&x)
#define LL long long
#define LD long double
#define pb push_back
#define F first
#define S second
const double PI=3.1415926535897932384626433;
const int KL=1e6... | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define f first
#define s second
#define fast ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#define int long long
#define endl "\n"
int solve(){
int N,tot=0,sq=0;
cin >> N;
vector<int> A(N),... |
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<sstream>
#include<cstring>
#include<cstdio>
#include<string>
#include<deque>
#include<cmath>
#include<queue>
#include<set>
#include<map>
using namespace std;
struct Dog {
int pos;
long long cute;
int type; //0--R, 1--G, 2--B
bool isUsed;
};
std::v... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#define rep(i,n) for(int i =0;i<(n);++i)
using namespace std;
using ll = long long;
struct DataType {
ll val;
char col;
};
constexpr ll ll_max {1001001001001001};
int main(int argc, char** argv) {
int n; cin >> n;
std::vec... |
#include<bits/stdc++.h>
// #include<atcoder/all>
// #include<boost/multiprecision/cpp_int.hpp>
using namespace std;
// using namespace atcoder;
// using bint = boost::multiprecision::cpp_int;
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
#define rep(i,n) for(ll i = 0;i < (ll)n;i++)
#de... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
int n = s.size();
vector<char> cs(n*2+1,'0');
int l = n-1;
int r = n;
int nl = 0;
for (int i=0;i<n;i++) {
if (s[i] == 'R') {
nl = 1-nl;
continue;
}
if (nl... |
#include<bits/stdc++.h>
using namespace std;
signed main()
{
int n,sum=0;
cin>>n;
int arr1[n];
int arr2[n];
for(int i=0;i<n;i++)
{
cin>>arr1[i];
}
for(int i=0;i<n;i++)
{
cin>>arr2[i];
}
for(int i=0;i<n;i++)
{
sum+=arr1[i]*arr2[i];
}
if(sum==0)cout<<"Yes"<<endl;
else cout<... | #include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <math.h>
#include <vector>
using namespace std;
using ll = long long;
using Graph = vector<vector<int> >;
#define INF 500010
int main(){
int n, A[INF], B[INF], C[INF];
cin>>n;
for(int i=1;i<=n;i++) cin>>A[i];
for(int... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;
template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (ll i=(ll)from; i<(ll)to; i++)
#define all(vec) vec.begin(), vec.en... | #pragma region Macros
#include <bits/stdc++.h>
#if defined(LOCAL) || defined(ONLINE_JUDGE) || defined(_DEBUG)
#include <atcoder/all>
#endif
using namespace std;
#define REP(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REPR(i, n) for(int i=(n); i>=0; --i)
#define FOR(i, n, m) for(int i=(m), i##_len=(n); i<i##... |
#include<bits/stdc++.h>
typedef long long ll;
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define last freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define fr first
#define sc second
#define lcm(a,b) (a*b)/__gcd(a,b)
#d... | #include<bits/stdc++.h>
using namespace std;
//#define pb push_back
//typedef long long ll;
int main()
{
int n,x;
cin>>n>>x;
string s;
cin>>s;
for(int i=0;i<n;i++)
{
if(s[i]=='o')x++;
else if(x>0)x--;
}
cout<<x<<endl;
return 0;
}
|
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<stdio.h>
using ll=long long;
constexpr int mod=1000000007;
int N,M,K,inv[2000000]={1,1};
int main(){
for(int i=2;i<2000000;++i)inv[i]=ll(inv[mod%i])*(mod-mod/i)%mod;
for(int i=2;i<2000000;++i)inv[i]=ll(inv[i])*inv[i-... | #include <bits/stdc++.h>
#include <random>
#include <chrono>
using namespace std;
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef ... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
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;}
int dx[4]={0,1,0,-1}, dy[4]={1,0,... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 998244353;
const int N = 505;
int m, n;
char A[N][N];
struct Data
{
int r,c;
} F[N][N];
int poww[1005];
Data combine(Data X, Data Y)
{
if(X.r > Y.r) swap(X, Y);
if(X.r + X.c < Y.r) return {-1,-1};
X.c -= Y.r - X.r;
return {Y.r,min(X.c, Y... |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 7;
int n, m;
string a[2005];
int hor[2005], ver[2005], diag[5005];
int dp[2005][2005];
int offset(int x) {
return x + 2500;
}
int add(int x, int y) {
return ((long long) (x + y)) % INF;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(ll i = 0; i < (ll)(n); i++)
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 1e18;
const ll MOD = 1000000007;
int N, M;
void dfs(int t, vector<P> &V, set<int> &checked, vector<vector<int>> &G) {
for(auto &i : G[t]) {
if(checked.... |
#include <bits/stdc++.h>
#define int long long int
using namespace std;
signed main(){
ios::sync_with_stdio(0);
cin.tie(NULL); cout.tie(NULL);
int a , b;
cin>>a>>b;
cout<<(a+b)/2<<" "<<(a-b)/2<<"\n";
}
| #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdlib>
#include<queue>
#include<set>
#include<cstdio>
#include<map>
#include<cassert>
using namespace std;
#define ll long long
#define reps(i, a, b) for(int i = a; i < b; i++)
#define rreps(i, a, b) for(int i = a-1; i >= b; i--)
#def... |
#include<iostream>
#include<algorithm>
#include<cstring>
#define debug(a) cout<<#a<<" = "<<a<<endl
using namespace std;
typedef long long ll;
const int N = 5010;
const int MOD = 998244353;
int n , m;
ll C[N];
ll f[N];
ll Q_power(ll a ,ll b){
ll res = 1;
while(b){
if(b & 1) res = res * a % MOD;
... | #include<cstdio>
#include<algorithm>
#include<cstring>
#define ll long long
#define fo(i,x,y) for(ll i=x;i<=y;i++)
#define fd(i,x,y) for(ll i=x;i>=y;i--)
using namespace std;
const int N=5010,M=5010;
const int E=17;
const ll mod=998244353;
ll n,m,i,j,k,tot,ans,s,t,x,y,z;
ll f[E][M];
ll e[E];
ll jie[M],ny[M];
voi... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int mod=998244353;
signed main(){
int a,b,c;
cin>>a>>b>>c;
a=a*(a+1)/2; b=b*(b+1)/2; c=c*(c+1)/2;
a%=mod;b%=mod;c%=mod;
cout<<a*b%mod*c%mod;
return 0;
} | #include <bits/stdc++.h>
using namespace std ;
const int N = 105 ;
double dp[N][N][N] ;
double solve(int a, int b, int c){
if(a == 100 || b == 100 || c == 100){
return 0 ;
}
if(dp[a][b][c]){
return dp[a][b][c] ;
}else{
int num = a+b+c ;
double ans = 1.0 + (double)(1.0*a/num)*solve(a+1, b,c) + (doub... |
#include "bits/stdc++.h"
using namespace std;
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
s... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;
template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (ll i=(ll)from; i<(ll)to; i++)
#define all(vec) vec.begin(), vec.en... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
ll MOD = 1000000000 + 7;
int main() {
string s, t = "";
bool rev = false;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'R') {
rev = !rev;
continue;
}
... | #include<bits/stdc++.h>
using namespace std;
#define gc() getchar()
#define pc(a) putchar(a)
#define int long long
#define inf (1ll<<60)
inline int read()
{
int x=0,f=1;
char c=gc();
while(c<'0'||c>'9')
{
if(c=='-') f=-f;
c=gc();
}
while(c>='0'&&c<='9') x=x*10+c-'0',c=gc();
// ... |
/****Bismillahir rahmanir rahim****/
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<double> vd;
#define All(a) a.begin(),a.end()
template <typename T>
void get_vect... | /*
______________________ _______ _______ _______ _______
( ____ \__ __( __ \ ( ____ | ___ | ____ ( ___ )
| ( \/ ) ( | ( \ ) | ( )| ( ) | ( \/ ( ) |
| (_____ | | | | ) | | (____)| (___) | (_____| (___) |
(_____ ) | | | | | | | __) ___ (_____ ) ___ |
) | |... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<ll(n);i++)
#define REP(i,k,n) for(ll i=k;i<ll(n);i++)
#define all(a) a.begin(),a.end()
#define eb 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 secon... | #include<iostream>
#include<iterator>
#include<algorithm>
#include<climits>
#include<map>
#include<set>
#include<cmath>
#include<numeric>
#include<string>
#include<sstream>
#include<cstdio>
#include<vector>
#include<bitset>
// #include <atcoder/segtree>
#define ll long long
using namespace std;
int main()
{
ll n,... |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <limits>
#include <iomanip>
#include <vector>
#include <cstring>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
typedef long long ll;
typedef long double ld;
#define r... | #include <bits/stdc++.h>
#include <strings.h>
using namespace std;
int main(){
string question, no_rev;
char this_char, prev_char;
int i = 0, rev;
cin >> question;
rev = -1;
while((this_char = question[i++]) != '\0'){
if(thi... |
#include <bits/stdc++.h> //
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
typedef pair<LL, LL> pll;
typedef pair<string, string> pss;
typedef vector<LL> vi;
typedef vector<vi> vvi;
typedef vector<pii> vii;
typedef vector<LL> vl;
typedef vector<vl> vvl;
double EPS = 1e-9;
LL INF = 60;
long lon... | #include<bits/stdc++.h>
using namespace std;
int main(){
int A,B;
cin >> A >> B;
cout << (A+B)/2 << " " << (A-B)/2 << endl;
} |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define re register
#define pb push_back
#define fi first
#define se second
const int N=1e7+10;
const int mod7=1e9+7;
const int mod=998244353;
const int M=1e7;
const double pi=acos(-1);
void read(int &a)
{
a=0;int d=1;char ch;
while(ch=getchar()... | #include <bits/stdc++.h>
#define REP(i, a, b) for (int i = a; i <= b; ++i)
#define ll long long
#define N 100010
using namespace std;
int n, cnt;
bool f;
char ch, a[N], b[N];
inline int read(){
int s = 0, w = 1;
char ch = getchar();
for (; ch < '0' || ch > '9'; w *= ch == '-' ? -1 : 1, ch = getchar());
for (; ch ... |
#include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
// using namespace atcoder;
#define int long long
signed main(){
// cout << fixed << setprecision(10) << flush;
int N, K;
cin >> N >> K;
int ijk_sum;
int num = 0;
auto num_s = [&](int s){
if(s < 3) return 0LL;
... | #include <cstdio>
#include <algorithm>
using namespace std;
long long dp[4][3000005];
int ans[4];
int main()
{
int n,st;
long long k,sum,now;
int all;
scanf("%d%lld",&n,&k);
dp[0][0]=1;
for(int i=1;i<=3;i++)
{
sum=0;
for(int j=0;j<=i*n;j++)
{
dp[i][j]=sum;... |
#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
template<class S, class T> inline S max_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 <iostream>
#include <cstdio>
#include <vector>
#include <iomanip>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <map>
#include <set>
#include <cmath>
using namespace std;
string toBase(long long M, long long b) {
string s;
while (M) {
long long maxVal = min(9... |
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <stdio.h>
#include <math.h>
#include <iomanip>
#include <queue>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double lld;
#define rep(i,n) for(int i = 0; i < (n); i++)
#define pb push_back
#d... | #include <cmath>
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,a,b) for(int i=a; i<b; ++i)
#define all(x) x.begin(),x.end()
const long long INF=1e18;
const int32_t M=1e9+7;
const int32_t MM=998244353;
int digits (int a1)
{
int a=a1;
int x = 0;
while(a!=0){
a/=10... |
#include<iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int main(){
string A, B;
cin >> A >> B;
int nA=0, nB=0;
for(int i=0;i<3;i++){
nA += A[i]-'0';
nB += B[i]-'... | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define ll long long
#define ld long double
#define rep(i,n) for (ll i = 0;i<(n);++i)
#define all(v) v.begin(),v.end()
template <typename T>bool chmax(T &a, const T& b) {if (a < b) {a = b;return true;}return false;}
template <typename T>bool chmin(T &a, c... |
#include <bits/stdc++.h>
#define int long long
using namespace std;
int n, m;
signed main() {
cin >> n >> m;
// for(int i = 1; i <= n; )
if(m == 0) {
for(int k = 1, i = 1; i <= n; ++i, k += 2) {
cout << k << ' ' << k + 1 << endl;
}
return 0;
}
if(m > 0 && m < n - 1) {
int mx = 0;
for(int i = n - m - 1 ... | //#pragma GCC optimize ("O2")
//#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i ... |
#include <sys/time.h>
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <utility>
#include <cmath>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <deque>
#include <utility>
#include <cctype>
using namespace std;
using ll = long long;
us... |
#include "bits/stdc++.h"
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ub upper_bound
#define lb lower_bound
#define isrt insert
#define clr clear
#define rsz resize
#define ff first
#define s... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define FOR(i, n) for(int (i)=0; (i)<(n); (i)++)
#define FOR1(i, n) for(int (i)=1; (i)<=(n); (i)++)
#define FORI(i, n) for(int (i)=n-1; (i)>=0; (i)--)
template<class T, class U> void umin(T& x, const U& y){ x = min(x, (T)y)... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a) for(int i = 0; i < (int) a; i++)
#define PB push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define F first
#define S second
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
int main(){
ios::sy... |
#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 x, y, z; cin >> x >> y >> z;
cout << (y * z + x - 1) / x - 1 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,srt,end) for(ll i = (srt); i < (ll)(end); i++)
//ll MOD=1000000007;
//ll mod=998244353;
//int inf=1000001000;
//ll INF=1e18+5;
//cout << std::fixed << std::setprecision(15) << y << endl;
// For debug
// Ref: https://qiita.com/ysuzuki19/i... |
// #pragma GCC optimize("Ofast,unroll-loops")
// #pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define dd double
#define ld long double
#define sl(n) scanf("%lld", &n)
#define si(n) scanf("%d", &n)
#define sd(n) scanf("%lf", &n)
#d... | #include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <stack>
#include <cassert>
#include <map>
#include <numeric>
#include <cstring>
#include <set>
#include <ctime>
#include <queue>
#include <cmath>
#include <iomanip>
#include <iterator>
using namespace std;
class InputReader {
publi... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(v) v.begin(), v.end()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repr(i, n) for (ll i = (n-1); i >= 0; i--)
#define Rep(n) for (ll _ = 0; _ < (ll)(n); _++)
template <class S>S sum(vector<S>& a) {return accumulate(all(a), S(... | /*
少加头文件，爆零两行泪
DP后效性，爆零两行泪
文件读入错，爆零两行泪
文件名写错，爆零两行泪
调完不编译，爆零两行泪
结论不证明，爆零两行泪
数组没开够，爆零两行泪
ll开 int，爆零两行泪
dp 没初值，爆零两行泪
深搜没边界，爆零两行泪
广搜忘出队，爆零两行泪
模数没看清，爆零两行泪
越界不特判，爆零两行泪
多测不清空，爆零两行泪
空间胡乱开，爆零两行泪
无向变有向，爆零两行泪
调试忘删除，爆零两行泪
文件不保存，爆零两行泪
题目提交错，爆零两行泪
*/
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#define ll long long
#define... |
#include <iostream>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
#include <cstring>
#include <cmath>
#include <stack>
#include <iomanip>
#include <tuple>
#include <functional>
#include <cfloat>
#include <map>
#include <set>
#include <arr... | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define ins insert
#define ull unsigned long long
#define rep(i, begin, end... |
#include<bits/stdc++.h>
using namespace std;
int n,m;
int main(){
cin>>n>>m;
cout<<n*(1+m)*m/2+m*(1+n)*n/2*100;
}
| #include <iostream>
using namespace std;
typedef long long int ll;
int main(void){
ll n, k;
cin >> n >> k;
ll ans = 0;
for (int i=0; i<n; i++) {
for (int j=0; j<k; j++) {
ans += 100*(i+1) + j+1;
}
}
cout << ans << endl;
return 0;
}
|
#include<algorithm>
#include<iostream>
#include<vector>
#include<string>
#include<queue>
#define rep(i, start, end) for (int i = (int)start; i < (int)end; ++i)
#define rrep(i, start, end) for (int i = (int)start - 1; i >= (int)end; --i)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
te... | #include "bits/stdc++.h"
using namespace std;
#define ll long long
const int inf = 1e3+10;
const int row[]={1,-1,0,0},col[]={0,0,1,-1};
int main()
{
int h,w;
cin>>h>>w;
string ab[h];
int st=0,st1=0,gi,gj;
vector <pair<int,int> > v[26];
int alphavis[26];
memset(alphavis,0,sizeof(alphavis));
for (int i = 0; i < ... |
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define drep(i,j,n) for(int i=0;i<(int)(n-1);i++)for(int j=i+1;j<(int)(n);j++)
#define trep(i,j,k,n) for(int i=0;i<(int)(n-2);i++)for(int j=i+1;j<(int)(n-1);j++)for(int k=j+1;k<(i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int N; cin >> N;
double x0,y0,xN2,yN2;
cin >> x0 >> y0;
cin >> xN2 >> yN2;
// 中心座標を求める
double xc = (x0 + xN2) / 2.0;
double yc = (y0 + yN2) / 2.0;
// 回転させる必要がある角度は360/N度
double degree = 360.0 / N;
... |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,x,y;
cin>>a>>b>>x>>y;
if (a<=b)
cout<<(b-a)*min(y,2*x)+x;
else
cout<<(a-b-1)*min(y,2*x)+x;
return 0;
}
| #include <stdio.h>
#include <math.h>
#define PI 3.1415926535
int main()
{
int a;
scanf("%d",&a);
int x1,y1,x2,y2;
scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
double xr = (double)(x1+x2)/2;
double yr = (double)(y1+y2)/2;
double xvec = x1 - xr;
double yvec = y1 - yr;
double xvec2 = cos(2*PI/a) * xvec - sin(2*PI/a) * y... |
// author: Halit
#include <bits/stdc++.h>
int main() {
int n;
std::cin >> n;
std::vector<int> a(n);
for (int& el : a) {
std::cin >> el;
}
constexpr double eps = 0.0000001;
auto check = [&](double x) {
long double compute = 0;
for (int a_i : a) {
compute += x + a_i - std::min(double(a_... | #include<cstdio>
#include<cstring>
#include<algorithm>
#include<map>
#include<math.h>
#include<iostream>
#include<cmath>
#include<queue>
#include<vector>
#define IOS ios::sync_with_stdio(false);cin.tie();cout.tie(0)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pll;
c... |
#include<bits/stdc++.h>
using namespace std;
void leftrotate(string &s, int d)
{
reverse(s.begin(), s.begin()+d);
reverse(s.begin()+d, s.end());
reverse(s.begin(), s.end());
}
int main(){
string s;
cin>>s;
leftrotate(s, 1);
cout << s << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin>>n;
++n;
// long long a=109109109109109109;
// long long b=109109108641970782;
// long long c=467138327;
// long double x=sqrt(1+8*n);
// long long d=(x+1.0)/2.0;
// cout<<n-d+1;
long long i=1;
whil... |
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#define pb push_back
#define mpr make_pair
#define pii pair<int, int>
#define ll long long
#define dl long double
#define all(arr) arr.begin(), arr.end()
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#de... | #include<bits/stdc++.h>
using namespace std;
#define fastio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define MOD 1000000007
#define MOD1 998244353
#define INF 1e18
#define nline "\n"
//#define pb push_back
//#define ppb pop_back
//#define mp make_pair
//#define ff first
//#define ss second
#d... |
#include <bits/stdc++.h>
#define lg long long int
#define loop(i, s, e) for (lg i = s; i <= e; i++)
#define iloop(i, s, e) for (lg i = e; i >= s; i--)
#define pb push_back
#define mp make_pair
#define mod 1000000007
using namespace std;
lg min(lg a, lg b)
{
return a < b ? a : b;
}
lg max(lg a, lg b)
{
return a > b ?... | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define all(x) (x).begin(),(x).end()
#define uniq(v) (v).erase(unique(all... |
#include <bits/stdc++.h>
using namespace std;
const int md = 998244353;
int n, m, i, j, r;
char s[505][505], c[1010];
void solve() {
scanf("%d%d", &n, &m);
for (i = 0; i < n; i++) {
scanf("%s", s[i]);
for (j = 0; j < m; j++) if (s[i][j] != '.') {
if (c[i + j] != 0 && c[i + j] != ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mxn = 500+10;
const int mod = 998244353;
ll powmod(ll a, ll b) {
ll ret = 1;
while(b) {
if(b&1ll) ret*=a, ret%=mod;
a*=a; a%=mod; b>>=1;
}
return ret;
}
map<char, int> diag[2*mxn];
signed main() {
ios_base::sync_with_stdio(0); cin... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string T;
cin >> N >> T;
auto solve = [&]() -> long long {
long long V = 10000000000LL;
if (T == "0") return V;
else if (T == "1") return V * 2;
if (T.size() >= 1 && T.substr(0, 1) == "0") T = T.substr(1)... | #include<cstdio>
int main(){
unsigned N;
scanf("%u\n", &N);
bool T[N];
char tmp;
for (unsigned i = 0; i < N; i++){
scanf("%c", &tmp);
T[i] = tmp == '1';
}
unsigned long long answer = 0;
bool flag = true;
for (unsigned i = 0; i < N; i++){
if(T[i] ^ (i%3 != 2))... |
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define ll long long
#define io ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
ll M=1e9+7;
void cal(vector<ll>&v){
v[0]=1;
ll b=2;
for(ll i=1;i<=4000000;i++){
v[i]=b*v[i-1];
v[i]%=M;
}
return ;
}
int main(){
io;
l... | #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 <unordered_map>
#include <set>
#include <unordered_set>
#include <cmath>
#include <algorithm>
#include <climits>
#include <iomanip>
#define endl "\n"
#define debug(x) cout << #x << " : " << x << endl;
#define debug2(x, y) cout << #x << " : " << x << ", " <<... | /*
CODE TEMPLATE APRATIM
*/
#include <bits/stdc++.h>
#pragma optimize("O3")
using namespace std;
#define fio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define ll long long int
#define veci vector<ll>
#define it map<string, vv>::iterator
#define MOD 1000000007
#define N (ll)3e+5
#define test int... |
#include<bits/stdc++.h>
using namespace std;
#define fi(a,b) for(int i=a;i<b;i++)
#define fj(a,b) for(int j=a;j<b;j++)
#define ff first
#define ss second
#define ll long long
#define ld long double
#define ull unsigned long long
#define bp(x) __builtin_popcount(x)
#define pr(x) for(auto it: x) cout<<... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
#define pb push_back
#define ld long double
#define f first
#define s second
#define in insert
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define speed io... |
#include <iostream>
#include <numeric>
#include <vector>
#include <algorithm>
#include <iostream>
#include <functional>
#include <cstdlib>
#include <cmath>
#include <utility>
#include <cmath>
#include <list>
#include <iterator>
static int check7(int base, int chk)
{
while(1){
if((chk % base) == 7){
... | /*
Name: Rishad Nur;
BRUR, CSE,
mail: rishad.nur007@gmail.com;
*/
#include<bits/stdc++.h>
using namespace std;
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
long long int n,m,i,j,k,l,x=0,y,a,sum=0,b;
cin>>n>>m>>l;
sum=... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define maxn 100005
ll dp[105][maxn] , n, arr[105] , zog , vag;
ll solve(ll pos , ll sum)
{
if(sum>vag)return 0LL;
if(pos == n+1)
{
return sum;
}
if(dp[pos][sum]!=-1)return dp[pos][sum];
ll ans1 = 0 , ans2 = 0;
if(... | #include<bits/stdc++.h>
using namespace std;
#define I inline int
#define V inline void
#define ll long long int
#define isnum(ch) ('0'<=ch&&ch<='9')
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define ROF(i,a,b) for(int i=a;i>=b;i--)
#define REP(u) for(int i=h[u],v;v=e[i].t,i;i=e[i].n)
#define gc (_op==_ed&&(_ed=(_op=_bu... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define Rep(i,j,n) for(int i = j; i < (int)(n); i++)
using Graph = vector<vector<int>>;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main(){
int n; cin >> n;
vector<pa... | #include <bits/stdc++.h>
#define int long long
#define mod 1000000007
#define read(a) for(auto &x : a) cin >> x
#define all(a) a.begin(), a.end()
#define write(a) for(auto x : a) cout << x << " ";cout << endl
#define heap priority_queue<pair<int, int>, vector<pair<int, int>>, cmp>
using namespace std;
#ifndef ONLINE_... |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long t;cin>>t;
while(t--){
long long l,r;cin>>l>>r;
if(l*2ll>r)cout<<0<<endl;
else{
long long d=r-l;
long long f=d-l+1;
long long g=f*(f+1);
long long h=g/2;
cout<<h<<endl;
}
}
} | #include <bits/stdc++.h>
using namespace std ;
#define i64 int64_t // typecast using i64(x)
#define int int64_t
#define ld long double
#define f(i,a,b) for(int i = int(a); i < int(b); ++i)
#define endl '\n'
#define PQ priority_queue
#define LB lower_bound
#define UB upper_bound
#define fr first
#define sc second
... |
#include <bits/stdc++.h>
using namespace std;
#define il inline
#define re register
#define Rep(i, s, e) for (re int i = s; i <= e; ++i)
#define Dep(i, s, e) for (re int i = s; i >= e; --i)
#define file(a) freopen(#a".in", "r", stdin), freopen(#a".out", "w", stdout)
const int N = 200010;
il int read() {
int x =... | #include<bits/stdc++.h>
using namespace std;
#define vec vector<int>
#define vecp vector<pair<int,int>>
#define ll long long
#define ull unsigned long long
#define pb push_back
#define fi first
#define se second
#define fr1(i,a,b) for(int i=a;i<b;i++)
#define fr2(i,a,b) for(int i=a;i>=b;i--)
#define fr3(i,a,b) for(int ... |
const long long MOD = 1e9 + 7;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vector<int> > vvi;
typedef vector<ll> vll;
typedef complex<double> c... | #include<bits/stdc++.h>
#include <cstdlib>
#define ll long long int
#define ve vector<int>
#define vl vector<long long int>
#define vd vector<double>
#define vs vector<string>
#define vve vector<vector<int>>
#define all(a) a.begin(),a.end()
using namespace std;
const int MAX = 510000;
const int MOD = 1000000007;
int ... |
#include <bits/stdc++.h>
#define ll long long
#define inf 0x3f3f3f3f
#define pii pair<int, int>
#define int long long
using namespace std;
const int maxn = 3e5+10;
template <typename _tp>
inline void read(_tp& x) {
char ch = getchar(), sgn = 0;
while (ch ^ '-' && !isdigit(ch)) ch = getchar();
if (ch == '-... | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<bitset>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<iomanip>
#include<cmath>
#include<cstring>
#include<functional>
#include<cstdio>
#include<cstdlib>
#include<numeric>
using namesp... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define pll pair<ll,ll>
#define ff first
#define ss second
#define pb push_back
#define endl "\n"
const ll maxn=3e3+10;
const ll mod =1e9+7 ;
const ll base=3e18;
ll cnt[maxn];
ll f[maxn];
ll dp[maxn];
int main()
{
... | #include <bits/stdc++.h>
#define ms(a,b) memset(a, b, sizeof(a))
#define rep(a,b,c) for(int a = (int)(b); a < (int)(c); a++)
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define m_p(a,b) make_pair(a, b)
#define lson l,mid,o << 1
#define rson mid + 1,r,o << 1 | 1
#define ls o << 1
#defi... |
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> //required
#include <ext/pb_ds/tree_policy.hpp> //required
// template starts
using namespace __gnu_pbds; //required
using namespace std;
template <typename T> using ordered_set = tree<... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repp(i, st, en) for (ll i = (ll)st; i < (ll)(en); i++)
#define repm(i, st, en) for (ll i = (ll)st; i >= (ll)(en); i--)
#define all(v) v.begin(), v.end()
ll op... |
#include <bits/stdc++.h>
#include <cstdlib>
#define rep(i, n) for (int i = 0; i < n; i++)
#define YesNo(T) if(T){cout << "Yes" << endl;}else{cout << "No" << endl;}
using namespace std;
typedef long long ll;
int main()
{
int n, s, d;
cin >> n >> s >> d;
vector<int> x(n), y(n);
rep(i, n) cin>>x[i] >> y... | /** Seek God..Trust God..Praise God..**/
#include<bits/stdc++.h>
using namespace std;
#define fRead(x) freopen("x.txt","r",stdin)
#define fWrite(x) freopen ("x.txt","w",stdout)
#define mt make_tuple
#define ld long double
#define ll long long
#define ull ... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(... | #include <iostream>
#include <string>
#include <vector>
#include <cmath>
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;
int main(){
int a, b, c;
cin >> a >> b >> c;
if(a*a + b*b < c*c){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}... |
#include<bits/stdc++.h>
using namespace std;
#define Mod(x) (x>=P)&&(x-=P)
#define rep(i,a,b) for(ll i=a,i##end=b;i<=i##end;++i)
#define drep(i,a,b) for(ll i=a,i##end=b;i>=i##end;--i)
#define erep(i,a) for(ll i=hd[a];i;i=nxt[i])
typedef long long ll;
void Max(ll &x,ll y){x<y&&(x=y);}
void Min(ll &x,ll y){x>y&&(x=y);}... | //include <atcoder>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <tuple>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#define flush fflush(stdout)
#define endl '\n'
#define all... |
#include <bits/stdc++.h>
#include<cmath>
#include<string>
#define pb push_back
#define x first
#define y second
#define fast ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define all(x) x.begin(),x.end()
#define int long long
#define ll long long
using namespace std;
void __print(int x) {cerr << x;}
void __print(lo... | #include <bits/stdc++.h>
#include <unistd.h>
#define rep(i,j,n) for(i=j;i<n;i++)
#define repi(i,j,n) for(i=j;i>n;i--)
#define pie 3.141592653589793238
#define ll long long
#define ld long double
#define vll vector<ll>
#define pll pair<ll,ll>
#define vpll vector<pll>
#define pb push_back
#define F first
#define S secon... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define each(e, v) for(auto &e: v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x)... | /*** author: yuji9511 ***/
#include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
using namespace std;
using ll = long long;
using lpair = pair<ll, 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);i>=(n);i--)
#define prin... |
#include<bits/stdc++.h>
#define ll long long
#define rep(i,a,b) for(int i=a;a<b?i<b:i>b;a<b?i+=1:i-=1)
#define f first
#define s second
#define pb push_back
#define tc int t;cin>>t;while(t--)
#define mp make_pair
using namespace std;
long long countConsecutive(long long N)
{
long long count = 0;
for (long long ... | #include<iostream>
#include<cstdio>
#include<stack>
#include<queue>
#include<algorithm>
#include<string>
#include<set>
#include<map>
#include<vector>
#include<math.h>
#include<stdio.h>
#include<tuple>
#include<string.h>
#include <numeric>
#include<unordered_map>
using namespace std;
#define sim template < class c
#de... |
#include <bits/stdc++.h>
using namespace std;
const int MX = 1e5 +5;
int N, zeroNum = 0;
double ans = 0;
int main(){
cin.tie(nullptr), ios::sync_with_stdio(false);
cin >> N;
for(int i = 1; i < N; i++) ans += ((double)N / (double)i);
cout.precision(9);
cout << fixed << ans;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string S; cin >> S;
int cnt = 0;
for (int i = 0; i < 9; i++) {
if (S.substr(i, 4) == "ZONe") cnt++;
}
cout << cnt << endl;
} |
#ifdef LOGX
#define _GLIBCXX_DEBUG
#endif
#include <bits/extc++.h>
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
/*---------macro---------*/
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = s; i < (int)(n); i++)
#define ALL(a) a.begin(),a.end()
#define ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
ll ans = 0;
vector<ll> v(2 * n);
for (int i = 0; i < 2 * n; i++) {
cin >> v.at(i);
ans += v.at(i);
}
priority_queue<ll, vector<ll>, greater<l... |
#include <bits/stdc++.h>
#define forn(i,n) for(int i=0;i<(int)n;i++)
#define ce(e,i,n) cout<<e<<" \n"[i==(int)n-1];
using namespace std;
int main() {
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
// = 0 - [i] {} '\n' p _ ? ^
int n;
long long c,x,y,z;;
cin>>n>>c;
vector<pair<long long,long long>>a;
fo... | #include <bits/stdc++.h>
#define sz(v) ((int)(v).size())
#define all(v) ((v).begin()),((v).end())
#define allr(v) ((v).rbegin()),((v).rend())
#define pb push_back
#define mp make_pair
#define Y imag()
#define X real()
#define clr(v,d) memset( v, d ,sizeof(... |
// Problem : B - Achieve the Goal
// Contest : AtCoder - AtCoder Beginner Contest 151
// URL : https://atcoder.jp/contests/abc151/tasks/abc151_b
// 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... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
const long long MOD = 1000000007;
int main(){
int a,b,c;
cin >> a >> b >> c;
int ans=21-a-b-c;
cout << ans << endl;
}
|
#include<bits/stdc++.h>
#define g return
using namespace std;int M,h=1e9,n,k,l=-1,r=1e6,a,b,i=1;vector<vector<int>> v;struct d{int m,s,f;};d x(int o,int p=h){if(v[o].size()==1&&o)g{0,-1,0};int t=h,s=-h,c=0,f=0;for(int& e:v[o])if(p-e){auto [j,y,z]=x(e,o);t=min(t,y);s=max(s,y);f|=z,c+=j;}t=abs(t);if(o){if(t<=s&&f){if(s)g... | #include <bits/stdc++.h>
#define fi first
#define se second
#define DB double
#define U unsigned
#define P std::pair
#define LL long long
#define LD long double
#define pb emplace_back
#define MP std::make_pair
#define SZ(x) ((int)x.size())
#define all(x) x.begin(),x.end()
#define CLR(i,a) memset(i,a,sizeof(i))
#defin... |
/*************************************************************************
> File Name: 1.cpp
> Author: Knowledge_llz
> Mail: 925538513@qq.com
> Blog: https://www.cnblogs.com/Knowledge-Pig/
> Created Time: 2021/4/10 19:57:22
************************************************************************/
#include<bit... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define fore(i_in,a) for (auto& i_in: a)
#define sz(x) (int)x.... |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long int N,M;
cin >> N >> M;
vector<pair<long long int,long long int>> vec(M);
for(int i=0;i<M;i++){
long long int X,Y;
cin >> X >> Y;
vec[i] = make_pair(X,Y);
}
sort(vec.begin(),vec.end());
map<long long int,vector<int>> Map;
fo... | #include <bits/stdc++.h>
using namespace std;
#define ln '\n'
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define FOR(i, a, b) for (int i = (a); i <= (int)(b); ++i)
#define FORR(i, a, b) for (int i = (a); i >= (int)(b); --i)
#define ALL(c) (c).begin(), (c).end()
typedef long long ll;
typedef vector<int> VI;
... |
#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T> using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// macros
#define int long long
#define ll long long ... | #include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x.size())
#define pll pair<ll, ll>
#define vi vector<int>
#define vll vector<ll>
#define INF (1 << 30)
#define MOD 1000000007
#define ld long double
#define tc ll tt; cin >> tt; while(tt--)
#define fi... |
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; ++i)
using namespace std;
using LLONG = long long;
LLONG K, N, M;
vector<LLONG> As, Bs;
bool CanDo(const LLONG x)
{
vector<LLONG> Ls(K), Rs(K);
REP(i, K)
{
LLONG Ai = As[i];
Ls[i] = (M * Ai - x + N - 1) / N;
Rs[i] = (M * Ai + x) / N;
}
LLONG s... | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define drep(i,j,n) for(int i=0;i<(int)(n-1);i++)for(int j=i+1;j<(int)(n);j++)
#define trep(i,j,k,n) for(int i=0;i<(int)(n-2);i++)for(int j=i+1;j<(int)(n-1);j++)for(int k=j+1;k<(i... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long int n,k;
cin >> n >> k;
for(int i=0; i<k; i++) {
if(n%200==0) n/=200;
else {
n*=1000;
n+=200;
}
}
cout << n << endl;
}
| //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <algorithm>
#define rep(i,n) for(int i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
//using Graph = vector<vector<pair<ll,ll>>>;
const int mod =1e+9+7;
const int dy[4]={0,1,0,-1... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef vector<vector<long long>> VVL;
typedef pair<int,int> P;
typedef tuple<int,int,int> tpl;
#define ALL(a) (a).begin(),(a).end()
#define SORT(c) sort((c).begin(),(c).e... | #include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int n,a[100005],vis[100005],f[100005];
bool check(int x,int y)
{
if(vis[x]==2||vis[y]==1) return 0;
if(vis[x]&&a[x]&&a[x]!=y) return 0;
if(vis[y]&&a[y]&&a[y]!=x) return 0;
if(vis[y]&&vis[x]&&!a[x]) return 0;
return 1;
}
int main()
{
scanf... |
#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;
const int INF = 1e9;
int n, m, k;
vector<int> adj[100005];
int dist[18][100005];
int arr[18];
void bfs(int idx){
... | #include <bits/stdc++.h>
// clang-format off
using namespace std; using ll = int64_t; using ull = uint64_t; using pll = pair<ll,ll>; const ll INF = 4e18;
void print0() {}
template<typename Head,typename... Tail> void print0(Head head,Tail... tail){cout<<fixed<<setprecision(15)<<head;print0(tail...);}
void print() { pri... |
#include <iostream>
#include <math.h>
#include <vector>
#include <string>
#include <numeric>
#include <unordered_set>
#include <iomanip>
#include <algorithm>
using namespace std;
int main(){
string s;
cin >> s;
string t;
bool reverse_judge=false;
for(int i=0;i<s.size();i++){
if(s[i]=='R'){
... | // FIRST THINK THEN CODE.
#include<iostream>
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<pll, null_type,less<>, rb_tree_tag,tree_order_statistics_node_update>
#define ll long long
#de... |
#include <bits/stdc++.h>
using namespace std;
const int N=2e5+2;
queue<int>q[N];
long long ans=0;
int n,a[N],b[N],c[N],f[N];
void add(int x,int y)
{
while(x)
{
f[x]+=y;
x^=x&-x;
}
}
int qry(int x)
{
int res=0;
while(x<=n)
{
res+=f[x];
x+=x&-x;
}
return res;
}
int main()
{
scanf("%d",&n);
for(int i=1;i... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define vi vector<int>
#define vvi vector<vector<int>>
#define mii map<int,int>
#define pii pair<int,int>
#define ff first
#define ss second
#define ce cout << endl ;
#define pb push_back
#define mkp make_pair
#define py cout << "YES" << endl ;
... |
#include<iostream>
#include<string>
int main() {
char S, T;
std::cin >> S;
std::cin >> T;
if (S == 'Y') T = std::toupper(T);
std::cout << T << std::endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using int128 = __int128_t;
using int64 = long long;
using int32 = int;
using uint128 = __uint128_t;
using uint64 = unsigned long long;
using uint32 = unsigned int;
#define ALL(obj) (obj).begin(),(obj).end()
template<class T> using priority_queue_reverse = priority_q... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define pii pair<long long,long long>
#define mp make_pair
#define pb push_back
#define WTF puts("wtf")
string s[3];
ll to[26],p[10];
void solve()
{
cin>>s[0]>>s[1]>>s[2];
ll cnt=0;
for(ll i=0;i<3;i++)
{
for(ll j=... | #include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
typedef long long LL;
const int N = 200010;
vector<char> v;
int find(char c)
{
return lower_bound(v.begin(), v.end(), c) - v.begin();
}
vector<int> g[3];
int num[10];
bool dfs(int u, int state)
{
... |
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5+5;
ll b,c,ans,t1,t2,t3,t4;
int main(){
cin>>b>>c;
if(c==1){
if(b==0){
cout<<"1\n";
return 0;
}else{
cout<<"2\n";
return 0;
}
}
t1=b-c/2;
t2=b+c/2-1;
t3=-b-(c-1)/2;
t4=-b+(c-1)/2;
if(t2<t3||t4<t1){
ans=... |
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdlib>
#include<queue>
#include<set>
#include<cstdio>
#include<map>
#include<cassert>
using namespace std;
#define ll long long
#define reps(i, a, b) for(int i = a; i < b; i++)
#define rreps(i, a, b) for(int i = a-1; i >= b; i--)
#def... | #include <bits/stdc++.h>
using namespace std;
double dp[105][105][105];
int main() {
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
for (int i = 99; i >= 0; i--) {
for (int j = 99; j >= 0; j--) {
for (int k = 99; k >= 0; k--) {
int tot = i + j + k;
dp[i][j][k] = (1.0 * i / tot) * (dp[i + 1][j][k] + 1) +... |
#include"bits/stdc++.h"
using namespace std;
#define ll long long
#define endl "\n"
#define fastio ios_base::sync_with_stdio(false)
const int lmt=3e5+100;
ll a[lmt],n,pre[lmt];
int main(){
fastio;
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
a[i]=(i%2)?a[i]:-a[i];
}
for(int i=1;i<=n;i++){
pre[i]=pre[i-1]+a... | #include<bits/stdc++.h>
using namespace std;
typedef int64_t ll;
typedef long double ld;
const ll MOD=1000000007;
const ll MODA=998244353;
ll vx[4]={0,1,0,-1};
ll vy[4]={1,0,-1,0};
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
long long gcd(long long a,long long b){
ll gcdmax=max(a,b);
ll gcdmin=min(a,b);
whi... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define bug(x) cout << #x << " >>>>>>> " << x << '\n'
#define _ << " , " <<
#define Max(a, b) (a > b ? a : b)
#define Min(a, b) (a < b ? a : b)
#define ii pair<int, int>
#define fi first
#define se second
#define UNTIL(t) while (clock() < (t) * CLOCK... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define vlli vector<ll>
#define vi vector<int>
#define vs vector<string>
#define vplli vector< pair< ll,ll> >
#define plli pair< ll,l... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pi;
struct edge{ll b,c,d;};
int n;
vector<edge>graph[100005];
vector<int>g[100005];
bool v[100005];
void dfs(int cur){
v[cur] = 1;
for(int nxt:g[cur]){
if(!v[nxt]) dfs(nxt);
}
}
ll ternary(ll t,ll d){
ll h = sqrt(d);
ll ret = ... | #ifdef MY_LOCAL
#define MY_NAMESPACE(ns) namespace ns {
#define MY_NAMESPACE_ }
#define MY_DEBUG(s) s
#define MY_IS_DEBUG (true)
#else
#define MY_NAMESPACE(ns)
#define MY_NAMESPACE_
#define MY_DEBUG(s)
#define MY_IS_DEBUG (false)
#endif
#include <algorithm>
#include <bitset>
#include <cmath>
#in... |
#include<bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define ll long long
#define ld long double
#define pb push_back
#define FR first
#define SC second
#define MOD 1000000007
#define LLMN LLONG_MIN
#define LLMX LLONG_MAX
#define LDMX LDBL_MAX
#define LDMN LDBL_MIN
#define MAX 1000010
#def... | #include <bits/stdc++.h>
#include <cstdlib>
#include <math.h>
#include <string>
#include <time.h>
using ld = long double;
using ull = unsigned long long;
using ll = long long;
using namespace std;
int main() {
//始点(r1, c1)、終点(r2, c2)
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
int r = r2 - r1;
... |
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
#define pri(str) cout << str << endl
using ll = long long;
using P = pair<int, int>;
const ll MX = 1e18;
const long double PI = acos(-1);
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 1e5 + 10;
int a[N], b[N], cnt[N], cnt2[N];
//map<int, int> mp, mp2;
int main(){
ios_base ::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", s... |
#include <iostream>
#include <string>
using namespace std;
int main(){
long long t, n, max, flag = 0, i, ans;
cin >> t >> n;
max = 100 * n / t + 1;
i = max;
while (flag == 0){
if ((100 + t) * i / 100 - ((100 + t) * (i - 1) / 100) == 2){
ans = (100 + t) * i / 100 - 1;
flag = 1;
}
i--;... | using namespace std;
#include <bits/stdc++.h>
#define ll long long
ll t,n;
int main(){
scanf("%lld%lld",&t,&n);
ll c=0;
for (int i=1;i<=100;++i)
c+=max((t+100)*i/100-(t+100)*(i-1)/100-1,0ll);
ll d=(n-1)/c;
n-=d*c;
for (ll i=d*100+1;i;++i){
ll tmp=max((t+100)*i/100-(t+100)*(i-1)/100-1,0ll);;
// printf("%lld %... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A,B;cin>>A>>B;
if(A>B){
cout<<(A-B)/2+B<<" "<<(A-B)/2<<endl;
}
else{
cout<<(B-A)/2+A<<" "<<((B-A)/2)-((B-A)/2)*2<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define input_output freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
template <typename Arg1>
void prn(Arg1&& arg1) { cout<<arg1<<"\n";}
temp... |
//Let's join Kaede Takagaki Fan Club !!
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cassert>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <fun... | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
long long n, c;
cin >> n >> c;
vector<long long> ai(n), bi(n), ci(n);
for (int i = 0; i < n; i++) {
cin >> ai[i] >> bi[i] >> ci[i];
}
map<long long, long long> m;
for (int ... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int count_all_str;
string search_str;
string tmp;
string new_str;
cin >> count_all_str >> search_str;
for(int i = 1;i <= count_all_str;i++){
cin >> tmp;
if(tmp != search_str){
new_str += tmp;
new_s... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
using P = pair<int,int>;
using ll = long long;
int main() {
int n,x;
cin >> n >> x;
int a[n];
rep(i,n){
cin >> a[i];
}
vector<int> ans;
rep(i,n){
if(a[i]!=x){
ans.push... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,S,D;
int A=0;
vector<int> X(N);
vector<int> Y(N);
vector<int> CX(N);
vector<int> CY(N);
cin >> N >> S >> D;
for (int i=0; i<N; i++){
cin >> X.at(i) >> Y.at(i);
}
for (int i=0; i<N; i++){
CX.at(i) =... | #include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(),v.end()
#define MP make_pair
#define MT make_tuple
typedef int64_t ll;
#define PA pair<ll,ll>
#define TU tuple<ll,ll,ll>
#define vi vector<ll>
#define vii vector<vector<ll> >
#define rep(i,n) for(ll (i)=0; (i)<(ll)(n); (i)++)
#define rep2(i,m,n) for... |
#include<bits/stdc++.h>
using namespace std;
#define en '\n'
#define endl '\n'
#define ll long long signed
#define pb push_back
#define append push_back
#define all(v) (v).begin(),(v).end()
#define FOR(i,a,b,k) for(int i=a; k>0?i<b:i>b; i+=k)
#define fori(a) for(int i=0; i<a; i++)
#define forj(a) fo... | #include <cstdio>
#include <cstdlib>
using namespace std;
#define ll long long
const ll MAXN = 400011;
struct fhqTreap {
ll tot, rt;
ll val[MAXN], sum[MAXN], sz[MAXN], ls[MAXN], rs[MAXN], rd[MAXN];
void pushup(ll u) {sz[u] = sz[ls[u]] + sz[rs[u]] + 1; sum[u] = sum[ls[u]] + sum[rs[u]] + val[u];}
void split(ll u, ... |
#include "bits/stdc++.h"
#define MOD 1000000007
#define rep(i, n) for(ll i=0; i < (n); i++)
#define rrep(i, n) for(ll i=(n)-1; i >=0; i--)
#define ALL(v) v.begin(),v.end()
#define rALL(v) v.rbegin(),v.rend()
#define FOR(i, j, k) for(ll i=j;i<k;i++)
#define debug_print(var) cerr << #var << "=" << var <<endl;
#define DU... | #include<bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define ll long long
#define PI 3.1415926535897932384626
#define si(x) scanf("%d", &x)
#define sl(x) scanf("%lld", &x)
#define ss(s) scanf("%s", s)
#define pi(x) printf("%d\n", x)
#define pl(x) printf("%lld\n", x)
#define ps(s) printf("%s\n", s)
#... |
#include <bits/stdc++.h>
#include <vector>
#include <iostream>
#include<algorithm>
#include<string>
#include <map>
#include <queue>
#include <stack>
#include<set>
#include<tuple>
#include<time.h>
#include<list>
#define DIV 998244353
using namespace std;
using ll = long long;
using ldb = long double;
int main() {
str... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); ++i)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
bool ans = true;
int ok[200][200] = {};
vector<int> a(n), b(n);
vector<int> h(n * 2);
rep(i, n) {
cin >> a[i] >> b[i];
a[i... |
#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 Grid= vector<string>;
using vin= vector<int>;
using ll=long long;
using ull=unsigned long long;
using vll= vector<ll>;
using vbl=vector<... | #include <bits/stdc++.h>
using namespace std;
const int N = 2010;
int X[N], Y[N];
int main() {
int n; scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d%d", &X[i], &Y[i]);
int res = 0;
for (int i = 1; i <= n; i++)
for (int j = i + 1; j <= n; j++) if (X[i] != X[j]) {
double k ... |
//
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma")
//#pragma GCC optimization ("unroll-loops")
//
//#pragma GCC optimize(3,"Ofast","inline")
//#include<unordered_map>
//#include<unordered_set>
#include<cstdio>
#include<iostream>
#include<cmath>
#include<functional>
#include<cstring>
#include<string... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define PI 2*acos(0.0)
using namespace std;
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int main()
{
optimize();
ll n;
cin >> n;
ll m=pow(2,n);
ll ar[m];
for(int i=0; i<m; i++)
... |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
using namespace std;
typedef long long ll;
int main() {
char s,t;
cin >> s>> t;
char ans;
if (s == 'Y') {
ans = t - ('a' - 'A');
cout << ans << endl;
}
if(s == 'N')
cout << t << endl;
return 0;
} |
// #pragma GCC optimize("O3")
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimization ("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <array>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <... |
#include <queue>
#include <vector>
#include <iostream>
#include <utility>
using namespace std;
using ll = int64_t;
using pll = pair<ll,ll>;
int main() {
ll a,b,X,Y;
cin >> a >> b >> X >> Y;
a--; b--;
// 0-99: A
// 100-199: B
vector<vector<pll>> E(200, vector<pll>{});
for(ll i=0; i<100; i++) {
E[i].pu... | #include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
int main(){
int a, b, x, y;
cin >> a >> b >> x >> y;
int ans = 0;
if(a == b){
printf("%d\n",x);
}else if(a < b){
ans += x;
ans += min(2 * x, y) * (b - a);
printf("%d\n",ans);
}else{
ans += x;
ans += min(2 * x, y) * (a - b - 1);... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.