code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 32
101M
|
|---|---|---|---|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
const int INF = 1001001001;
int main(){
int n;
cin >> n;
vector<double> V(n);
rep(i,n) cin >> V.at(i);
sort(V.begin(),V.end());
double ans = (V.at(0) + V.at(1)) / 2;
for(int i = 2;i < n;i++) ans = (ans + V.at(i)) / 2;
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (long long i = 0; i < (n); ++i)
#define DIV 1000000007
ll N;
int main(){
cin >> N;
vector<double> vec(N);
rep(i, N) cin >> vec[i];
sort(vec.begin(), vec.end());
double cur = vec[0];
for(ll i = 1; i < N; i++) {
cur = (cur + vec[i])/2.0;
}
printf("%.20f\n", cur);
} | 1 | 91,356,150 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
string S;
int w;
cin >> S >> w;
for (int i = 0; i < S.length(); i += w) {
cout << S[i];
}
cout << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define blank(ans) cout << (ans) << " ";
#define mp(p, q) make_pair(p, q)
#define mt(p, q, r) make_tuple(p, q, r)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef string str;
typedef vector<ll> vll;
typedef vector<ld> vd;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<str> vs;
typedef vector<vector<ll>> vvll;
typedef vector<vector<ld>> vvd;
typedef vector<vector<bool>> vvb;
typedef vector<vector<char>> vvc;
typedef vector<vector<str>> vvs;
typedef vector<pair<ll, ll>> vpll;
typedef vector<tuple<ll, ll, ll>> vtlll;
const ld PI = acos(-1.0);
const ll MAX = 9000000000000000000;
const ll MIN = -9000000000000000000;
const ld DMAX = 4500;
const ld DMIN = -4500;
const ll MOD = 1000000007;
template <typename T>
void fin(T a)
{
cout << a << endl;
exit(0);
}
bool IsPrime(ll num)
{
if (num < 2)
return false;
else if (num == 2)
return true;
else if (num % 2 == 0)
return false;
ld sqrtNum = sqrt(num);
for (ll i = 3; i <= sqrtNum; i += 2)
{
if (num % i == 0)
return false;
}
return true;
}
void Main()
{
str s; ll w; cin >> s >> w;
rep(i, s.size())
{
if(i % w == 0) cout << s[i];
}
cout << endl;
}
int main()
{
ifstream in("text.txt");
cin.rdbuf(in.rdbuf());
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(20);
Main();
return 0;
} | 1 | 69,227,181 |
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
int main(void) {
vector<int> vec;
int n_data, in;
for (;;) {
scanf("%d", &n_data);
if (n_data == 0)
return 0;
for (int i = 0; i < n_data; ++i) {
scanf ("%d", &in);
vec.push_back(in);
}
sort(vec.begin(), vec.end());
int ave = 0;
for (auto it = vec.begin() + 1; it < vec.end() - 1; ++it)
ave += *it;
printf("%d\n", ave / (n_data - 2));
vec.clear();
}
} | #include <bits/stdc++.h>
#define int long long
#define main signed main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecision(n)
#define stlice(from, to) substr(from, (to) - (from) + 1)
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
using namespace std;
using pii = pair<int, int>;
using vi = vector<int>;
using vd = vector<double>;
using vc = vector<char>;
using vb = vector<bool>;
using vs = vector<string>;
using vpii = vector<pii>;
using vvi = vector<vi>;
using vvb = vector<vb>;
using vvpii = vector<vpii>;
template<typename A> using fn = function<A>;
constexpr int INF = sizeof(int) == sizeof(long long) ? 1000000000000000000LL : 1000000000;
constexpr int MOD = 1000000007;
constexpr double PI = acos(-1);
template<typename A, typename B> bool cmin(A &a, const B &b) { return a > b ? (a = b, true) : false; }
template<typename A, typename B> bool cmax(A &a, const B &b) { return a < b ? (a = b, true) : false; }
constexpr bool odd(const int &n) { return n & 1; }
constexpr bool even(const int &n) { return !odd(n); }
template<typename V> constexpr typename V::value_type sum(const V &v) { return accumulate(all(v), 0); }
void solve();
main { solve(); return 0; }
void solve() {
int n;
while(cin >> n, n) {
vi v(n);
rep(i, n) cin >> v[i];
sort(all(v));
int s = accumulate(v.begin() + 1, v.end() - 1, 0);
cout << s / (n - 2) << endl;
}
} | 1 | 52,685,706 |
#include<bits/stdc++.h>
#define int ll
#define f first
#define sz(a) ((int)(a).size())
#define s second
#define all(v) v.begin(),v.end()
#define pii pair<int,int>
#define vpii vector<pii>
#define eb emplace_back
#define pb push_back
#define fo(i,n) for(int i=0;i<n;i++)
#define Fo(i,k,n) for(int i=k;i<n;i++)
#define vi vector<int>
using namespace std;
using ll = long long;
using lld = long double;
const int oo = 0x3f3f3f3f;
const ll MOD = 1000000007;
const int N = 1e5 + 10;
int hit[N + 2];
signed main(){
#ifndef ONLINE_JUDGE
#endif
ios_base::sync_with_stdio(0);cin.tie(0);
int n , x , m;
cin >> n >> x >> m;
int f = x;
hit[f] = 1;
vi before_cycle , cycle;
int ss = f;
for(int i = 1 ; i < n ; i++){
f = (f * f) % m;
if(hit[f] == 0)
ss += f;
if(f == 0){
cout << ss << '\n';
return 0;
}
if(hit[f] == 3)
break;
hit[f]++;
if(hit[f] == 2)
cycle.pb(f);
}
int ans = 0;
for(int i = 0 ; i < m ; i++)
if(hit[i] == 1)
ans += i , before_cycle.pb(i);
int sum = 0;
for(int i : cycle)
sum += i;
int numOfHits = cycle.size();
n -= before_cycle.size();
n = max(n , 0LL);
if(numOfHits)
ans += sum * (n / numOfHits) , n %= numOfHits;
for(int i = 0 ; i < n ; i++)
ans += (long long)cycle[i];
cout << ans << '\n';
return 0;
} | #include <bits/stdc++.h>
#define int long long
#define zmrl(x) (int)((x).size())
#define ahen(x) (x).begin(), (x).end()
#define pb push_back
#define fi first
#define se second
using namespace std;
using pii = pair<int, int>;
signed main() {
ios_base::sync_with_stdio(false); cin.tie(NULL);
int n,x,m; cin>>n>>x>>m;
int psum[100100]; psum[0] = 0;
set<pii> s;
s.insert({psum[1] = x, 1});
for (int i=2; i<=n; i++) {
x=x*x%m;
if (!x) {
cout << psum[i-1] << '\n';
return 0;
}
auto it = s.lower_bound({x, 0});
if (it->fi == x) {
int len = i-it->se;
int q = (n-i+1) / len, r = (n-i+1) % len;
cout << psum[i-1] + (psum[i-1]-psum[it->se-1])*q + psum[it->se-1+r] - psum[it->se-1] << '\n';
return 0;
}
psum[i] = psum[i-1] + x;
s.insert({x, i});
}
cout << psum[n] << '\n';
return 0;
} | 1 | 71,891,020 |
#include <cmath>
#include <cstdio>
int main() {
int a, b, C;
scanf("%d%d%d", &a, &b, &C);
const double PI = 3.141592653589;
double S = a * b * sin(C * PI / 180) / 2;
double L = a + b + sqrt(a * a + b * b - 2 * a * b * cos(C * PI / 180));
double h = S * 2 / a;
printf("%f %f %f\n", S, L, h);
return 0;
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <cmath>
#include <string>
#include <sstream>
#include <iomanip>
#include <complex>
using namespace std;
#define ll long long
#define vvi vector< vector<int> >
#define vi vector<int>
#define All(X) X.begin(),X.end()
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define pb push_back
#define pii pair<int,int>
#define mp make_pair
#define shosu(X) setprecision(X) << fixed
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
int main(){
long double a,b,c;
cin >> a >> b >> c;
c = M_PI *c / 180;
cout << shosu(20) << a*b*sin(c)/2<< endl;;
long double tmp = sqrt(a*a+b*b-2*a*b*cos(c));
cout << a+b+tmp << endl;;
cout << b*sin(c) << endl;
} | 1 | 42,461,521 |
#include <bits/stdc++.h>
using namespace std;
int main(){
cin.sync_with_stdio(false);
const static int MOD = (int)1e9+7;
int n, m; cin >> n >> m;
vector<string>grid(n);
vector<vector<int>>dp(n, vector<int>(m,0));
for(int i = 0; i < n; i++){
cin>>grid[i];
}
dp[n-1][m-1] = 1;
for(int i = n-2; i >= 0; i--){
if(grid[i][m-1] == '.'){
dp[i][m-1] = dp[i+1][m-1];
}
}
for(int i = m-2; i >= 0; i--){
if(grid[n-1][i] == '.'){
dp[n-1][i] = dp[n-1][i+1];
}
}
for(int i = n-2; i >= 0; i--){
for(int j = m-2; j >= 0; j--){
if(grid[i][j] == '.'){
dp[i][j] = (dp[i+1][j]+dp[i][j+1])%MOD;
}
}
}
cout<<dp[0][0]<<endl;
} | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
ll int gcd (ll int a,ll int b) { return b ? gcd (b, a % b) : a; }
ll int mod = 1e9+7;
int main()
{
ll int n,m;
cin>>n>>m;
int a[n][m];
for (int i = 0; i < n; ++i)
{
for(int j=0;j<m;j++)
{
char x; cin>>x;
if(x=='.')
a[i][j]=1;
else
a[i][j]=-1;
}
}
if(a[0][0]==-1)
return 0;
int dp[n][m];
memset(dp,0,sizeof(dp));
for (int i = 0; i < n; ++i)
{
if(a[i][0]!=-1)
dp[i][0]=1;
else
break;
}
for (int i = 0; i < m; ++i)
{
if(a[0][i]!=-1)
dp[0][i]=1;
else
break;
}
for(int i=1;i<n;i++)
{
for(int j=1;j<m;j++)
{
if(a[i][j-1]!=-1)
dp[i][j]+=dp[i][j-1];
if(a[i-1][j]!=-1)
dp[i][j]+=dp[i-1][j];
dp[i][j] = dp[i][j] % mod ;
}
}
cout<<dp[n-1][m-1]<<"\n";
} | 1 | 75,197,104 |
#include <bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define MAXX 500005
#define PI 3.14159265358979323846264338327950
#define PB push_back
#define PF push_front
#define F first
#define S second
#define fixx(n) fixed << setprecision(n)
#define ll long long
#define mod 1000000007
int main()
{
FAST;
int n, k;
cin >> n >> k;
int a[k+5];
int x = 0;
for(int i = 0 ;i < k; i ++){
cin >> a[i];
x += a[i];
}
if(x >= n){
cout << "Yes";
}
else{
cout << "No";
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long;
const int INF = 1001001001;
const ll INF_LL = 1001001001001001001LL;
int main(void){
int h,n; cin >> h >> n;
vector<int> a(n);
rep(i,n) cin >> a[i];
sort(a.begin(),a.end());
rep(i,n){
h-=a[i];
}
bool flag = false;
if(h<=0) flag = true;
if(flag) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | 1 | 44,133,672 |
#include<bits/stdc++.h>
#define rep(i, n) for(int i=0; i<int(n); i++)
using namespace std;
int main(){
int H, W, d; cin >> H >> W >> d;
string c = "RYGB";
if(d%2==0){
rep(i, H){
rep(j, W) cout << c[2*(((i+j)/d)%2) + ((i-j+2000*d)/d)%2];
cout << "\n";
}
}else{
rep(i, H){
rep(j, W) cout << c[(i+j)%2];
cout << "\n";
}
}
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define mk make_pair
using namespace std;
const int N = 5e2 + 5;
int n, m, d, ans[N][N + N];
int main() {
cin >> n >> m >> d;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
int x = i + j;
int y = i - j + m;
x /= d; y /= d;
x &= 1; y &= 1;
ans[i][j] = x + (y << 1);
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
if (ans[i][j] == 0) printf("R");
if (ans[i][j] == 1) printf("Y");
if (ans[i][j] == 2) printf("G");
if (ans[i][j] == 3) printf("B");
}
printf("\n");
}
} | 1 | 12,961,438 |
#include <iostream>
#include <cmath>
#include <iomanip>
using namespace std;
int main(){
double N, K;
int n;
cin >> N >> K;
double exp = 0;
for (n =1 ;n<=N;n++){
exp += pow(0.5, fmax(0,ceil(log2(K/n))));
}
std::cout << std::fixed;
std::cout << std::setprecision(12);
std::cout << (exp/N) <<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0;i<int(N);++i)
#define rep1(i,N) for(int i=1;i<int(N);++i)
#define all(a) (a).begin(),(a).end()
#define print(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<_<<", "; cerr<<"]"<<endl; }
#define printpair(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<"{"<<_.first<<","<<_.second<<"}"<<", "; cerr<<"]"<<endl; }
#define dump(x) cerr<<#x<<": "<<x<<endl;
#define bit(k) (1LL<<(k))
typedef long long ll;
typedef pair<int, int> i_i;
typedef pair<ll, ll> l_l;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;
template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 >& p) {
os << "{" <<p.first << ", " << p.second << "}";
return os;
}
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
const int INF = (ll)1e9;
const ll INFLL = (ll)1e18+1;
const ll MOD = (ll)1e9+7;
const double PI = acos(-1.0);
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
long double N, K;
cin >> N >> K;
vector<ll> cnt(N+1,0);
for(ll i = 1; i <= N; i++){
ll tmp = i;
while(tmp < K){
tmp <<= 1;
cnt[i]++;
}
}
ll maxx = *max_element(all(cnt));
if(maxx == 0){
cout << 1 << endl;
return 0;
}
long double ans = 0;
for(int i = 1; i <= N; i++){
ans += bit(maxx - cnt[i]);
}
ans /= bit(maxx);
ans /= N;
cout << ans << endl;
} | 1 | 76,585,956 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
string S;
cin >> N >> S;
vector<int> T;
for (int i = 0; i < N; ++i) {
T.push_back(S[i] - '0');
}
int cnt = 0;
for(int n = 0; n < 1000; ++n) {
int t = n / 100;
int m = (n - (100 * t)) / 10;
int b = n - (100*t) - (10*m);
bool ok1 = false;
bool ok2 = false;
bool ok3 = false;
int i1 = 0;
int i2 = 0;
for(int i = 0; i < N; ++i) {
if(T[i] == t) {
ok1 = true;
i1 = i;
break;
}
}
if(ok1) {
for(int i = i1+1; i < N; ++i) {
if(T[i] == m) {
ok2 = true;
i2 = i;
break;
}
}
}
if(ok2) {
for(int i = i2+1; i < N; ++i) {
if(T[i] == b) {
ok3 = true;
break;
}
}
}
if(ok1 && ok2 && ok3) {
++cnt;
}
}
cout << cnt << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;
#define int ll
const int INF=(int)2e18;
const int MOD = 1000000007;
const int PEG = 998244353;
long double pie=acos(-1);
typedef vector< int > vi;
typedef vector< string > vs;
typedef vector< vi > vvi;
typedef pair< int, int > pii;
typedef vector< pii > vpii;
#define X first
#define Y second
#define pb push_back
#define sz(a) (ll)(a).size()
#define all(a) (a).begin(),(a).end()
#define F(i,a,b) for(ll i=a;i<=b;i++)
#define RF(i,a,b) for(ll i=a;i>=b;i--)
#define Fo(i,a,b,j) for(ll i=a;i<=b;i+=j)
#define RFo(i,a,b,j) for(ll i=a;i>=b;i-=j)
#define in(a,n) F(i,0,n-1)cin>>a[i]
#define in1(a,n) F(i,1,n)cin>>a[i]
#define out(a,n) F(i,0,n-1)cout<<a[i]<<" "
#define out1(a,n) F(i,1,n)cout<<a[i]<<" "
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define popcount __builtin_popcountll
#define pfy cout<<"YES"
#define pfn cout<<"NO"
#define pfn1 cout<<"-1"
#define pf1 cout<<"1"
#define nl cout<<"\n"
#define watch(x) cout<<#x<<" is "<<x<<"\n"
#define dbg(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>void __f(const char* name,Arg1&& arg1);
template <typename Arg1,typename... Args>void __f(const char* names,Arg1&& arg1,Args&&... args);
ll binpow(ll x,ll y,ll p);
signed main()
{
#ifndef ONLINE_JUDGE
#endif
fast;
int n;
cin>>n;
string s;
cin>>s;
int ans=0;
F(i,0,999)
{
string tt=to_string(i);
tt="00"+tt;
tt=tt.substr(sz(tt)-3,3);
int cur=0;
F(i,0,n-1)
{
if(s[i]==tt[cur])
{
cur++;
if(cur==3)break;
}
}
if(cur==3)ans++;
}
cout<<ans;
return 0;
}
ll binpow(ll x, ll y, ll p)
{
ll res = 1;
x = x % p;
while (y > 0)
{
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
template <typename Arg1>
void __f(const char *name, Arg1 &&arg1)
{
std::cout << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&... args)
{
const char *comma = strchr(names + 1, ',');
std::cout.write(names, comma - names) << " : " << arg1 << "\n";
__f(comma + 1, args...);
} | 1 | 43,470,571 |
#include <iostream>
#include <cmath>
using namespace std;
int main(){
int N;
cin >> N;
int c[N], flg=0;
for (int i = 0; i < N; i++){
c[i] = 0;
}
for (int i = 0; i < N; i++){
int tmp;
cin >> tmp;
if (i==0 && tmp==0){
flg = 1;
}
c[tmp] += 1;
}
if (c[0]==1 && flg == 1) {
unsigned long long ans = 1, tmp = 1;
unsigned long long t = 998244353;
for (int i = 2; i < N; i++){
if (c[i-1] == 0 && c[i] > 0){
ans = 0;
break;
}else if(c[i] == 0){
continue;
}
tmp = c[i-1];
for (int j = 2; j <= c[i]; j++){
tmp = tmp % t;
tmp = tmp * (c[i-1] % t);
}
ans = ans % t;
tmp = tmp % t;
ans *= tmp;
ans %= t;
}
printf("%llu\n", ans);
}else{
printf("0\n");
}
} | #include <bits/stdc++.h>
typedef long long ll;
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++)
#define invrepr(i,a,b) for(int i=b-1;i>=a;i--)
#define invrep(i,n) invrepr(i,0,n)
#define repitr(itr,a) for(auto itr=a.begin();itr!=a.end();++itr)
#define P pair<int,int>
const int MOD=998244353;
const ll INF=2e15;
const double PI=acos(-1);
vector<pair<ll,ll>> vectorCnt(vector<ll> a) {
sort(a.begin(),a.end());
int n=a.size();
vector<pair<ll,ll>> b;
ll cnt=1;
rep(i,n-1) {
if (a[i+1]!=a[i]) {
b.push_back(make_pair(a[i],cnt));
cnt=1;
} else {
++cnt;
}
}
b.push_back(make_pair(a[n-1],cnt));
return b;
}
ll binary_power(ll a, ll n) {
if (n==0) return 1;
ll k=binary_power(a,n/2);
if (n%2==0) return (k*k)%MOD;
else return (((k*k)%MOD)*a)%MOD;
}
int main() {
ios_base::sync_with_stdio(false);
int n;
cin >> n;
vector<ll> d(n);
bool invalid=0;
rep(i,n) {
cin >> d[i];
if (i==0 && d[i]!=0) invalid=1;
if (i>0 && d[i]==0) invalid=1;
}
sort(d.begin(),d.end());
vector<pair<ll,ll>> p=vectorCnt(d);
int m=p.size();
ll ans=1;
repr(i,1,m-1) {
ans=(ans*binary_power(p[i].second,p[i+1].second))%MOD;
if (p[i].first+1!=p[i+1].first) invalid=1;
}
if (!invalid) cout << ans << endl;
else cout << 0 << endl;
return 0;
} | 1 | 88,952,462 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, r; cin >> n >> r;
cout << (n < 10 ? r + 100 * (10 - n) : r) << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define len(x) (int)(x.size())
#define all(vs) vs.begin(), vs.end()
using ii = pair<int, int>;
using ll = long long;
int32_t main(){
ios::sync_with_stdio(0);
int n, r;
cin >> n >> r;
if(n>=10)
cout << r << endl;
else
cout << max(0, int(r+(100*(10-n)))) << endl;
} | 1 | 17,145,962 |
#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(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
int n;
cin >> n;
int s, a, cnt = 0;
cin >> s;
rep(i, n - 1) {
cin >> a;
if (a == s) {
s = a + 10001 + cnt;
cnt++;
}
else s = a;
}
cout << cnt << endl;
return 0;
} | #include <iostream>
using ll = long long;
#define MIN(a, b) (((a) < (b)) ? (a) : (b))
#define MAX(a, b) (((a) < (b)) ? (b) : (a))
int const nmax = 100;
int v[1 + nmax];
int main() {
int n;
std::cin >> n;
for(int i = 1;i <= n; i++)
std::cin >> v[i];
int result = 0, sum = 0;
for(int i = 1;i <= n; i++){
if(v[i] == v[i - 1])
sum++;
else {
result += sum / 2;
sum = 1;
}
}
result += sum / 2;
std::cout << result;
} | 1 | 13,427,365 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int64_t l0=2,l1=1,l2;
if ( N == 1 ) {
cout << l1;
} else {
for (int i = 2; i <= N; i++) {
l2 = l1 + l0;
l0 = l1;
l1 = l2;
}
cout << l2;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n;
cin >> n;
vector<int64_t> L(86+1);
L[0] = 2;
L[1] = 1;
for (int i=2; i<86+1; i++) L[i] = L[i-1] + L[i-2];
cout << L[n] << endl;
} | 1 | 90,801,131 |
#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;
int main()
{
int H,N,P,s=0;
cin>>H>>N;
for(int i=1;i<=N;i++)
{
cin>>P;
s=s+P;
}
if(s>=H)
{
cout<<"Yes";
}
else
{
cout<<"No";
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
long h,n;
cin >> h >> n;
long a[n];
long summ = 0;
for(int i=0;i<n;i++){
cin >> a[i];
summ += a[i];
}
if( h <= summ)cout<<"Yes"<<endl;
else cout<<"No"<<endl;
} | 1 | 93,462,957 |
#include<bits/stdc++.h>
#include<iostream>
#include<string>
#include<cmath>
#include<cstdio>
#include<cctype>
#include<cstring>
#include<iomanip>
#include<cstdlib>
#include<ctime>
#include<set>
#include<map>
#include<utility>
#include<queue>
#include<vector>
#include<stack>
#include<sstream>
#include<algorithm>
#define rep(i,n) for(int i=0;i<n;i++)
#define m_p make_pair
#define pb push_back
#define fr first
#define se second
#define forn(i,a,n) for(int i=a;i<n;i++)
#define foreach(i,c) for(__typeof(c.begin())i=(c.begin());i!=(c).end();i++)
#define pii pair<int,int>
#define vi vector<int>
#define ll long long
#define sz(s) s.size()
#define all(s) s.begin(),s.end()
#define zero(x) memset(x,0,sizeof(x))
#define vii vector<pair<int,int> >
#define mpis map<int,string>
#define mpii map<int,int>
#define mpsi map<string,int>
#define re return
#define mod 1000000007
using namespace std;
long long get(){
char c=getchar();
long long x=0LL;
while(c<'0'||c>'9')
c=getchar();
while(c>='0'&&c<='9'){
x*=10LL;
x+=(c-'0');
c=getchar();
}
return x;
}
int n;
ll a[100001],b[100001],sa,sb;
priority_queue<ll> pq;
int main(){
ios::sync_with_stdio(0);
cin>>n;
rep(i,n){
cin>>a[i];
sa+=a[i];
}
rep(i,n){
cin>>b[i];
sb+=b[i];
}
if(sa<sb){
cout<<-1;
re 0;
}
int ans=0;
ll m=0;
rep(i,n){
if(a[i]<b[i])
ans++,m+=b[i]-a[i];
else
pq.push(a[i]-b[i]);
}
while(m){
ans++;
ll p=pq.top();
pq.pop();
m=max(0ll,m-p);
}
cout<<ans;
re 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
#include <climits>
#include <iomanip>
using namespace std;
typedef long long ll;
int main(){
ll n;
cin >> n;
vector<ll> a(n);
vector<ll> b(n);
for(int i = 0;i < n;i++)cin >> a[i];
for(int i = 0;i < n;i++)cin >> b[i];
ll res = 0;
vector<int> add;
ll tarinai = 0;
for(int i = 0;i < n;i++){
if(a[i] > b[i])add.push_back(a[i] - b[i]);
else if(a[i] < b[i])res++,tarinai += b[i] - a[i];
}
sort(add.begin(),add.end());
for(int i = add.size() - 1;i >= 0;i--){
if(tarinai > 0)tarinai -= add[i],res++;
else break;
}
if(tarinai > 0)res = -1;
cout << res << endl;
return 0;
} | 1 | 76,945,716 |
#include<math.h>
#include <bits/stdc++.h>
#include <algorithm>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define ll long long int
#define py printf("Yes\n")
#define pn printf("No\n")
#define in cin>>
using namespace std;
const int INF = 1001001001;
int main()
{
int n,d,x,ans=0;
in n>>d>>x;
vector<int> a(n);
rep(i,n)in a[i];
rep(i,n)
{
rep(j,d)
{
int hako=a[i]*j+1;
if(hako<=d)ans++;
}
}
cout<<ans+x<<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<double> vd;
typedef vector<ll> vl;
typedef vector<string> vs;
#define fo(i, a, b) for (int i = a; i < b; i++)
#define re(i, n) fo(i, 0, n)
#define pb push_back
#define mp make_pair
#define all(s) s.begin(), s.end()
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { ll g = gcd(a, b); return a / g * b; }
int main()
{
int n, d, x;
cin >> n >> d >> x;
vi a(n);
re(i, n) {
cin >> a[i];
}
int s = 0;
re(i, n) {
s += (d - 1) / a[i] + 1;
}
cout << s + x << endl;
return 0;
} | 1 | 61,412,359 |
#include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(c) begin(c),end(c)
const int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
const int MOD = (int)(1e9) + 7;
const double PI = acos(-1);
const double EPS = 1e-9;
template<class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; }
template<class T> bool chmin(T &a, const T &b) { if (a > b) { a = b; return true; } return false; }
struct DisjointSet {
vector<int>p, rank;
DisjointSet(int n) {
p.resize(n);
rank.assign(n, 0);
rep(i, 0, n)p[i] = i;
}
int root(int x) {
if (x != p[x])p[x] = root(p[x]);
return p[x];
}
int same(int x, int y) {
return root(x) == root(y);
}
void unite(int x, int y) {
if (same(x, y))return;
x = root(x), y = root(y);
if (rank[x] < rank[y])p[x] = y;
else {
p[y] = x;
if (rank[x] == rank[y])rank[x]++;
}
}
};
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, q; cin >> n >> q;
DisjointSet uf(n);
rep(i, 0, q) {
int com, x, y; cin >> com >> x >> y;
if (com)cout << uf.same(x, y) << endl;
else uf.unite(x, y);
}
return 0;
} | #include <iostream>
using namespace std;
int P[10000+10];
int n,q,p,num1,num2;
int root(int a){
if (P[a] == a) return a;
return (P[a] = root(P[a]));
}
bool same(int a, int b){
return root(a)==root(b);
}
void unite(int a, int b){
P[root(a)] = root(b);
}
int main() {
cin >> n >> q;
for (int i=1; i<=n; i++){
P[i] = i;
}
for (int x=1; x<=q; x++){
cin >> p >> num1 >> num2;
if (p==0){
unite(num1, num2);
}else{
cout << same(num1, num2) << endl;
}
}
} | 1 | 100,281,694 |
#include<iostream>
#include<math.h>
#include<iomanip>
using namespace std;
int main()
{
double a, b, C;
cin >> a >> b >> C;
double S, L, h,r;
r = C*3.14159265359/ 180;
S = a*b*sin(r) / 2;
L = sqrt(pow(a, 2) + pow(b, 2) - 2 * a*b*cos(r))+a+b;
h = S * 2 / a;
cout << setprecision(10);
cout << S << endl; cout << setprecision(10);
cout << L << endl; cout << setprecision(10);
cout<< h << endl;
return 0;
} | #include <iostream>
#include<cmath>
#include<iomanip>
using namespace std;
int main()
{
double a,b,c;
double p=3.1415926535;
cin >> a >> b >> c;
cout << fixed << setprecision(7) << a*b*sin(c*p/180)/2 << endl;
cout << fixed << setprecision(7) << a+b+sqrt(pow(a,2)+pow(b,2)-2*a*b*cos(c*p/180)) << endl;
cout << fixed << setprecision(7) << a*b*sin(c*p/180)/a << endl;
return 0;
} | 1 | 88,076,855 |
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define IOS ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define MOD 1000000007
#define MOD2 998244353
#define pb emplace_back
#define mp make_pair
#define all(v) v.begin(),v.end()
#define sz(x) (ll)x.size()
#define F first
#define S second
#define FOR(i,a,b) for(ll i=a;i<=b;++i)
#define ROF(i,a,b) for(ll i=a;i>=b;--i)
#define trace(x) cerr<<#x<<": "<<x<<'\n';
typedef long long ll;
using namespace std;
using namespace __gnu_pbds;
#define T int
#define ordered_set tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>
auto clk=clock();
ll mexp(ll a, ll b, ll m){
ll ans=1;
a%=m;
while(b){
if(b&1) ans=ans*a%m;
b>>=1;
a=a*a%m;
}
return ans;
}
int main(){
IOS
srand(chrono::high_resolution_clock::now().time_since_epoch().count());
int q;
cin >> q;
while(q--){
ll a, b;
cin >> a >> b;
if((a == b) || (abs(a - b) == 1)){
cout << 2 * min(a,b) - 2 << endl;
}
else{
ll c = sqrt(a * b);
if(c * c == a * b){
c--;
}
if(c * (c + 1) >= a* b){
cout << 2 * c - 2 << endl;
}
else{
cout << 2 * c - 1 << endl;
}
}
}
cerr<<endl<<endl<<"Time: "<<fixed<<setprecision(12)<<(long double)(clock()-clk)/CLOCKS_PER_SEC<<" ms"<<endl<<endl;
return 0;
} | #include<iostream>
#include<cmath>
#include<cstdio>
using namespace std;
int q;
typedef long long LL;
LL LLsqrt(LL x){
LL L=0,R=1e9,mid,ans=-1;
while (L<=R){
mid=(L+R)>>1;
if (mid*mid<=x)
L=mid+1,ans=mid;
else
R=mid-1;
}
return ans;
}
int main()
{
long long a,b;
scanf("%d",&q);
while(q--)
{
long long ans=0;
scanf("%lld%lld",&a,&b);
long long c=a*b-1;
long long p=LLsqrt(c);
ans+=2*p;
if(a!=b)
ans--;
if(p)
if(p==c/p)
ans--;
printf("%lld\n",ans);
}
} | 1 | 52,734,164 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> d(1e5+1);
rep(i,n) {
int x;
cin >> x;
d[x]++;
}
int ans = 0;
int sum = 0;
for (int i = 1; i <= 1e5; i++) {
sum += d[i];
if (sum == n-sum) ans++;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long INF = 1LL << 60;
int main(){
int N;
cin >> N;
vector<int> V(N);
for(int i=0; i<N; i++) cin >> V[i];
sort(V.begin(), V.end());
cout << V[N/2] - V[N/2 - 1] << endl;
} | 1 | 93,092,362 |
#include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<string>
#include<unordered_map>
#include<set>
using namespace std;
#define intmax INT_MAX
#define lmax LONG_MAX
#define uintmax UINT_MAX
#define ulmax ULONG_MAX
#define llmax LLONG_MAX
#define ll long long
#define rep(i,a,N) for((i)=(a);(i)<(N);(i)++)
#define rrp(i,N,a) for((i)=(N)-1;(i)>=(a);(i)--)
#define llfor ll i,j,k
#define sc(a) cin>>a
#define pr(a) cout<<a<<endl
#define pY puts("YES")
#define pN puts("NO")
#define py puts("Yes")
#define pn puts("No")
#define pnn printf("\n")
#define sort(a) sort(a.begin(),a.end())
#define push(a,b) (a).push_back(b)
#define llvec vector<vector<ll>>
#define charvec vector<vector<char>>
#define sizeoof(a,b) (a,vector<ll>(b))
#define llpvec vector<pair<ll,ll>>
ll cei(ll x,ll y){ll ans=x/y;if(x%y!=0)ans++;return ans;}
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;}
ll llpow(ll x,ll n){ll i,ans=1;rep(i,0,n)ans*=x;return ans;}
ll fact(ll x){ll i,ans=1;rep(i,0,x)ans*=(x-i);return ans;}
ll ncr(ll n,ll r){return fact(n)/fact(r)/fact(n-r);}
ll npr(ll n,ll r){return fact(n)/fact(n-r);}
bool prime(ll a){if(a<=1)return false;ll i;for(i=2;i*i<=a;i++){if(a%i==0)return false;}return true;}
llfor;
int main(){
ll n,k;
sc(n);sc(k);
ll ans=n-k+1;
pr(ans);
return 0;} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#define all(x) (x).begin(), (x).end()
#define endl '\n'
#define fsp(x) cout << fixed << setprecision(x)
const ll inf = LLONG_MAX;
const long double pi = M_PI;
void Yes() {cout << "Yes" << endl;}
void No() {cout << "No" << endl;}
void YES() {cout << "YES" << endl;}
void NO() {cout << "NO" << endl;}
int main() {
ll n, k;
cin >> n >> k;
cout << n - k + 1 << endl;
} | 1 | 61,808,959 |
#include <iostream>
#include <cassert>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <cctype>
#include <cmath>
#include <ctime>
#include <queue>
#include <set>
#include <map>
#include <stack>
#include <string>
#include <bitset>
#include <vector>
#include <complex>
#include <algorithm>
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<int,int> pii;
typedef vector<int> vi;
#define de(x) cout << #x << "=" << x << endl
#define rep(i,a,b) for(int i=a;i<(b);++i)
#define per(i,a,b) for(int i=(b)-1;i>=(a);--i)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define fi first
#define se second
int n , A , B;
int main(){
scanf("%d%d%d",&n,&A,&B);
if(A + B - 1 <= n && n <= 1ll * A * B) {
int s = 1 , remain = n - A - B + 1;
vi v;
auto add = [&](int from,int to) {
per(i,from,to) v.pb(i);
};
add(s , s + B);
s += B;
rep(i,1,A) {
int inc = min(remain , B - 1);
remain -= inc;
add(s , s + 1 + inc);
s += 1 + inc;
}
rep(i,0,sz(v)) printf("%d%c",v[i]," \n"[i+1==sz(v)]);
} else
puts("-1");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int A[300005];
void solve(int L, int lim, int a, int b)
{
if(lim == 0)
return;
a = min(a, lim - b + 1);
for(int i=lim-a+1; i<=lim; i++)
A[i] = L++;
solve(L, lim-a, a, b-1);
}
int main() {
ios::sync_with_stdio(0);
cin.tie(NULL), cout.tie(NULL);
int n, a, b;
cin >> n >> a >> b;
if(1LL * a * b < n || a + b > n + 1)
{
cout << -1 << "\n";
return 0;
}
solve(1, n, a, b);
for(int i=1; i<=n; i++)
cout << A[i] << " ";
return 0;
} | 1 | 44,004,592 |
#include <bits/stdc++.h>
#include <climits>
#include <sstream>
using namespace std;
long long modpow(long long a,long long n,long long mod){
long long res = 1;
while(n > 0){
if(n&1)res = res*a%mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
int main(){
int N;
cin >> N;
int D[N];
long long mod = 998244353;
map<long long,int> d;
for(int i = 0; i < N;i++){
cin >> D[i];
d[D[i]]++;
}
long long ans = 1;
bool flag = false;
for(int i = N -1; i >= 1;i--){
if(d[i]!=0)flag = true;
if(flag&&d[i]==0){
cout << 0 << endl;
return 0;
}
}
if(d[0]!=1){
cout << 0 << endl;
return 0;
}
if(D[0]!= 0){
cout << 0 << endl;
return 0;
}
for(int i = 1; i <N;i++){
ans *= modpow(d[i-1],d[i],mod);
ans %= mod;
}
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int (i) = 0; (i) < (n); (i)++)
#define repn(i, n) for(int (i) = 1; (i) <= (n); (i)++)
#define repr(i, n) for(int (i) = (n-1); (i) >= 0; (i)--)
#define all(x) (x).begin(), (x).end()
#define lint long long
#define ulint unsigned long long
#define fi first
#define se second
typedef pair<lint, lint> P;
const lint MOD = 1e9+7;
const lint MOD9 = 998244353;
const lint INF = MOD * MOD;
const int MAX = 100005;
long long modpow(long long a, long long n) {
long long res = 1;
while (n > 0) {
if (n & 1) res = res * a % MOD9;
a = a * a % MOD9;
n >>= 1;
}
return res;
}
int main(){
int n; cin >> n;
vector<lint> vec(MAX);
rep(i, n-1) vec[i] = 0;
lint d_max = 0;
rep(i, n){
lint d; cin >> d;
if((i == 0 && d != 0) || (i != 0 && d == 0)){
cout << 0 << endl;
return 0;
}
if(d > d_max) d_max = d;
vec[d]++;
}
lint ans = 1;
repn(i, d_max-1){
lint p = modpow(vec[i], vec[i+1]);
ans = (ans * p) % MOD9;
}
cout << ans << endl;
} | 1 | 56,552,352 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i=0; i<(n); ++i)
#define REPR(i,n,m) for (int i=(n); i>=(m); --i)
using namespace std;
using LL = long long;
using LD = long double;
using PLL = pair<long long, long long>;
using PLD = pair<long double, long double>;
using VLL = vector<long long>;
using VLD = vector<long double>;
using VPLL = vector<PLL>;
using VPLD = vector<PLD>;
const int INF = numeric_limits<int>::max();
const unsigned long long int ULLINF = numeric_limits<unsigned long long int>::max();
const long long mod = 1000000007;
int main() {
LL s;
cin >> s;
VLL v(2001,0);
v[0] = 1;
v[1] = 0;
v[2] = 0;
v[3] = 1;
for (LL i=4; i<=2000; i++) {
v[i] = (v[i-1] + v[i-3])%mod;
}
cout << v[s] << endl;
} | #include <iostream>
#include<unordered_map>
#include<bits/stdc++.h>
using namespace std;
long long int power(long long int x, long long int y, long long int p)
{
long long int res = 1;
x = x % p;
if (x == 0) return 0;
while (y > 0)
{
if (y & 1)
res = (res*x) % p;
y = y>>1;
x = (x*x) % p;
}
return res;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
t=1;
while(t--)
{
long long int sum;
cin>>sum;
long long int p=1e9+7;
long long int arr[2005]={0};
for(int i=3;i<=sum;i++)
{
arr[i]=1;
}
for(int i=4;i<=sum;i++)
{
for(int j=3;j<=i;j++)
{
arr[i]+=arr[i-j]%p;
arr[i]%=p;
}
}
cout<<arr[sum]<<endl;
}
return 0;
} | 1 | 586,230 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
int ma = a[n - 1], res = a[0];
for (int i = 0; i < n - 1; i++) {
if (min(abs(a[i] - ma / 2), abs(a[i] - (ma + 1) / 2)) < min(abs(res - ma / 2), abs(res - (ma + 1) / 2))) {
res = a[i];
}
}
cout << ma << ' ' << res << '\n';
} | #define _USE_MATH_DEFINES
#include<iostream>
#include<string>
#include<queue>
#include<cmath>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<random>
#include<functional>
#include<algorithm>
#include<stack>
#include<cstdio>
#include<bitset>
#include<unordered_map>
#include<climits>
#include<fstream>
using namespace std;
typedef long long ll;
typedef long double ld;
#define all(a) (a).begin(),(a).end()
#define EPS (1e-5)
#define bit(n,k) ((n>>k)&1)
const ll Mod = 1000000007;
const ll mod = 998244353;
struct H {
ll x, y;
bool operator<(const H& b) const {
if (x != b.x) return x < b.x;
return y < b.y;
}
bool operator>(const H & b) const {
if (x != b.x) return x > b.x;
return y > b.y;
}
bool operator==(const H & b) const { return x == b.x && y == b.y; }
bool operator!=(const H & b) const { return (*this) != b; }
};
struct P {
ll pos, cost;
bool operator<(const P& b) const { return cost < b.cost; }
bool operator>(const P& b) const { return cost > b.cost; }
};
struct B {
ll to, cost;
};
struct E {
ll from, to, cost;
bool operator<(const E& b) const { return cost < b.cost; }
bool operator>(const E& b) const { return cost > b.cost; }
};
template<typename T, typename U>
void chmin(T & a, U b) {
if (a > b) a = b;
}
template<typename T, typename U>
void chmax(T & a, U b) {
if (a < b) a = b;
}
template<typename T>
T max_0(T a) {
if (a < 0) return 0;
return a;
}
template<typename T>
T min_0(T a) {
if (a > 0) return 0;
return a;
}
ll read() {
ll u;
ll k = scanf("%lld", &u);
return u;
}
ll gcd(ll i, ll j) {
if (i > j) swap(i, j);
if (i == 0) return j;
return gcd(j % i, i);
}
ll mod_pow(ll x, ll n, ll p) {
ll res = 1;
while (n > 0) {
if (n & 1) res = res * x % p;
x = x * x % p;
n >>= 1;
}
return res;
}
const ll Inf = 3023372036854775807;
const int inf = 1500000000;
#define int long long
int n;
int a[200000];
signed main() {
cin >> n;
int ma = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
ma = max(a[i], ma);
}
int res = 0;
for (int i = 0; i < n; i++) {
if (abs(ma / 2. - a[i]) < abs(ma / 2. - res)) {
res = a[i];
}
}
cout << ma << " " << res << endl;
} | 1 | 54,986,267 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define rep2(i,a,n) for(int i=(a); i<(n); i++)
#define all(vec) vec.begin(),vec.end()
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
int main(){
int A, B, C; cin >> A >> B >> C;
if(C >= A && C <= B) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | #include <iostream>
#include <set>
#include <queue>
#include <vector>
#include <algorithm>
#include <math.h>
#include <cmath>
#include <string>
#include <cstring>
#include <climits>
#include <sstream>
#include <iomanip>
#include <map>
#include <stack>
#include <tuple>
#include <numeric>
#include <assert.h>
#include <functional>
#include <unordered_map>
using namespace std;
#define REP(i, n) for (int (i) = 0 ; (i) < (int)(n) ; ++(i))
#define REPN(i, m, n) for (int (i) = m ; (i) < (int)(n) ; ++(i))
#define INF 2e9
#define MOD (1000 * 1000 * 1000 + 7)
#define Ceil(x, n) (((((x))+((n)-1))/n))
#define CeilN(x, n) (((((x))+((n)-1))/n)*n)
#define FloorN(x, n) ((x)-(x)%(n))
#define IsOdd(x) (((x)&0x01UL) == 0x01UL)
#define IsEven(x) (!IsOdd((x)))
#define BitSetV(Val,Bit) ((Val) |= (Bit))
#define BitTstV(Val,Bit) ((Val) & (Bit))
#define ArrayLength(x) (sizeof( x ) / sizeof( x[ 0 ]))
#define MAX_QWORD ((QWORD)0xFFFFFFFFFFFFFFFF)
#define M_PI 3.14159265358979323846
typedef long long ll;
typedef unsigned long long int QWORD;
typedef pair<ll, ll> P;
int main()
{
int A, B, C;
cin >> A >> B >> C;
if (A <= C && C <= B) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | 1 | 22,970,568 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define RREP(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define INF 1000000000000
typedef long long ll;
int main()
{
ll n, m, min, minNum;
pair<ll, ll> minP;
cin >> n >> m;
vector<pair<ll, ll>> stu(n);
vector<pair<ll, ll>> p(m);
REP(i, n)
{
cin >> stu[i].first >> stu[i].second;
}
REP(i, m)
{
cin >> p[i].first >> p[i].second;
}
REP(i, n)
{
min = abs(stu[i].first - p[0].first) + abs(stu[i].second - p[0].second);
minP.first = p[0].first;
minP.second = p[0].second;
minNum = 1;
REP(j, m)
{
if (min > (abs(stu[i].first - p[j].first) + abs(stu[i].second - p[j].second)))
{
min = abs(stu[i].first - p[j].first) + abs(stu[i].second - p[j].second);
minP.first = p[j].first;
minP.second = p[j].second;
minNum = j + 1;
}
else if (min == (abs(stu[i].first - p[j].first) + abs(stu[i].second - p[j].second)))
{
if (p[j].first < minP.first || p[j].second < minP.second)
{
minP.first = p[j].first;
minP.second = p[j].second;
min = abs(stu[i].first - p[j].first) + abs(stu[i].second - p[j].second);
minNum = j + 1;
}
}
}
cout << minNum << endl;
}
} | #include<bits/stdc++.h>
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define ford(i, n) for (int i = (int)(n) - 1; i >= 0; --i)
#define fore(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
using namespace std;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector<vi> vvi;
typedef long long i64;
typedef vector<i64> vi64;
typedef vector<vi64> vvi64;
typedef pair<i64, i64> pi64;
typedef double ld;
int main(){
ios_base::sync_with_stdio(0);
int n,m;
cin>>n>>m;
vpi c(n), p(m);
forn(i,n){
int x,y;
cin>>x>>y;
c[i] = mp(x,y);
}
forn(i,m){
int x,y;
cin>>x>>y;
p[i] = mp(x,y);
}
forn(i,n){
int mindis = INT_MAX, id=0;
forn(j,m){
int dis = abs(c[i].fi-p[j].fi) + abs(c[i].se-p[j].se);
if(dis<mindis){
mindis = dis;
id=j;
}
}
cout<<id+1<<endl;
}
return 0;
} | 1 | 46,959,212 |
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#define l(i,a,b) for(auto i=a;i<b;i++)
#define lr(i,a,b) for(auto i=a;i>=b;i--)
#define ll long long
#define lli long long int
#define ld long double
#define vec vector<int>
#define mii map<ll,ll>
#define vl vector<long long>
#define se set <long long int>
#define pi pair<long long,long long>
#define pb push_back
#define mp make_pair
#define ft first
#define sd second
#define all(v) v.begin(), v.end()
#define in(x) cin>>x
#define o(x) cout<<x
#define SYNC ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define PI 3.14159265359
using namespace std;
const int MAX = 1e6 + 5;
int factorial[MAX];
bool ok=false;
void fac(ll k)
{
if(ok)
{
return;
}
for(ll i=1; i<=sqrt(k); i++)
{
if(k%i==0)
{
ll a = k/i;
ll b = i;
if(a==b)
{
b=1;
}
if(a!=1)
{
if(factorial[a])
{
ok=true;
return;
}
factorial[a]++;
}
if(b!=1)
{
if(factorial[b])
{
ok=true;
return;
}
factorial[b]++;
}
}
}
}
int main()
{
SYNC
ll n; in(n);
vl v(n);
l(i,0,n)
{
in(v[i]);
}
ll check = v[0];
l(i,1,n)
{
fac(v[i]);
check = __gcd(check,v[i]);
}
if(!ok)
{
o("pairwise coprime");
}
else if(check==1)
o("setwise coprime");
else
o("not coprime");
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define INF 1000000001
#define MR 1000000
vector<ll> PN_chk(MR+1,1);
void init_eratosthenes(){
PN_chk[0]=0;PN_chk[1]=0;
for(int i=2;i<=sqrt(MR)+1;i++){
if(PN_chk[i]==1) {
for(int j=2;j<=MR/i;j++){
PN_chk[j*i]=i;
}
}
}
}
vector<ll> prime;
void prime_factorize(ll n){
if(n<=1) return;
if(PN_chk[n]==1){
prime.push_back(n);
return;
}
prime.push_back(PN_chk[n]);
prime_factorize(ll(n/PN_chk[n]));
}
ll gcd(ll a, ll b){
if (a%b == 0) return(b);
else return(gcd(b, a%b));
}
ll lcm(ll a, ll b){
return a * b / gcd(a, b);
}
int main() {
init_eratosthenes();
int n;cin >> n;
vector<int> s(1000001);
bool pairwise=true;
vector<ll> a(n);for(int i=0;i<n;i++) cin >> a[i];
for(int i = 0; i < n; i++) {
prime_factorize(a[i]);
for(int j = 0; j < prime.size(); j++) {
if(s[prime[j]]==0) s[prime[j]]=i;
else if(s[prime[j]]!=i){
pairwise=false;
}
}
vector<ll> x;
prime=x;
}
if(pairwise==true){
cout << "pairwise coprime" << endl;
return 0;
}
else{
ll p=a[0];
for(int i = 1; i < n; i++) {
p = gcd(p,a[i]);
}
if(p==1){
cout << "setwise coprime" << endl;
}
else{
cout << "not coprime" << endl;
}
}
return 0;
} | 1 | 4,737,527 |
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
int main(){
int n,l;
cin>>n>>l;
vector<string>s(n);
for(int i=0;i<n;i++){
cin>>s[i];
}
sort(s.begin(),s.end());
for(int i=0;i<n;i++){
cout<<s[i];
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
#ifndef ONLINE_JUDGE
#endif
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, l;
cin >> n >> l;
vector <string> s(n);
for(int i = 0; i < n; i++){
cin >> s[i];
}
sort(s.begin(), s.end());
string ans = "";
for(int i = 0; i < n; i++){
ans += s[i];
}
cout << ans << "\n";
return 0;
} | 1 | 8,766,619 |
#include <bits/stdc++.h>
using namespace std;
int sumNum(string n){
int sum=0;
for(int i=0;i<=n.size();i++){
sum+=atoi(n.substr(i,1).c_str());
}
return sum;
}
int main(){
ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
int i=0;
while(true){
string n;
cin>>n;
if(n=="0"){
break;
}
cout<<sumNum(n)<<endl;
}
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main()
{
string str;
int num = 0;
int sum;
int i;
while (1)
{
sum = 0;
getline(cin, str);
if (str[0] == '0')
break;
else{
for (i = 0; i < str.length(); i++)
{
num = str[i] - '0';
sum += num;
}
cout << sum << endl;
}
}
return 0;
} | 1 | 70,629,524 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
vector<ll> v(k, 0);
ll ans = 0;
for (int i = 1; i <= n; i++) v[i%k]++;
for (int a = 1; a <= n; a++) {
int b = (k - a) % k;
if (b < 0) b += k;
if (b * 2 % k != 0) continue;
ans += v[b] * v[b];
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REPR(i,n) for(int i=n; i>-1; --i)
#define ALL(a) (a).begin(),(a).end()
#define FILL(a,n,x); REP(i,(n)){ (a)[i]=(x); }
#define CINA(a,n); REP(i,(n)){ cin >> (a)[i]; }
#define FILL2(a,n,m,x); REP(i,(n)){ REP(j,(m)){(a)[i][j]=(x);} }
#define CINA2(a,n,m); REP(i,(n)){ REP(j,(m)){cin >> (a)[i][j];} }
#define Liny "Yes\n"
#define Linn "No\n"
#define LINY "YES\n"
#define LINN "NO\n"
int keta(ll x){ if(x<10){return 1;} else{return keta(x/10) + 1;}}
int keta_wa(ll x){ if(x<10){return x;} else{return keta_wa(x/10) + x%10;} }
int ctoi(char c){ return ( (c>='0' && c<='9')? c - '0': 0 );}
int __stoi(string s){ return atoi(s.c_str()); }
ll sum(ll a[],ll N){ return accumulate(a,a+N,0LL);}
ll gcd(ll a,ll b){if(a<b)swap(a,b); return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){if(a<b){swap(a,b);} return a/gcd(a,b)*b;}
template<class T> void chmax(T& a, T b){ if(a<b){a=b;} }
template<class T> void chmin(T& a, T b){ if(a>b){a=b;} }
template<class T> bool isIn(T a,vector<T> v){ for(T x:v){ if(a==x){return true;}} return false;}
string strReplace(string s,string target, string replacement){
if (!target.empty()) {
std::string::size_type pos = 0;
while ((pos = s.find(target, pos)) != std::string::npos) {
s.replace(pos, target.length(), replacement);
pos += replacement.length();
}
}
return s;
}
const ll MOD = 1e9+7;
#define pii pair<int,int>
#define pll pair<ll,ll>
#define MP make_pair
bool DEBUG = 0;
template<class T> void dprint(T s){
if(DEBUG){ cout << s << "\n"; }
}
struct edge{
int u,v,w;
};
int main(int argc, char *argv[]){
if(argc>1 && argv[1][0]=='D'){ DEBUG = 1;}
ll N,K; cin>>N>>K;
ll n = N/K;
ll ans = n*n*n;
if(K%2==0){
ll m = (N+K/2)/K;
ans += m*m*m;
dprint(m);
}
cout << ans << "\n";
} | 1 | 35,613,175 |
#include <bits/stdc++.h>
#include <cmath>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define sz(x) ll(x.size())
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 10e15;
const ll MINF = -10e10;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
typedef priority_queue<P, vector<P>, greater<P>> PQ_ASK;
const int mod = 1000000007;
int main() {
int n;
cin >> n;
vector<P> reds(n);
vector<P> blues(n);
rep(i, n) {
int a, b;
cin >> a >> b;
P p(a, b);
reds[i] = p;
}
rep(i, n) {
int a, b;
cin >> a >> b;
P p(a, b);
blues[i] = p;
}
sort(blues.begin(), blues.end());
sort(reds.begin(), reds.end(), [](P i, P j) {
return i.second > j.second;
});
set<int> red_used;
int ans = 0;
for (P blue : blues) {
for (int i = 0; i < n; i++) {
P red = reds[i];
if (blue.first <= red.first || blue.second <= red.second) continue;
if (red_used.find(i) != red_used.end()) continue;
red_used.insert(i);
ans++;
break;
}
}
cout << ans << endl;
} | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
struct pos{
int x;
int y;
};
int main(){
int N;
vector<pair<pos, bool>> R, B;
cin >> N;
R.resize(N);
B.resize(N);
for (int i = 0; i < N; i++){
int a, b;
cin >> a >> b;
pos p = {a, b};
R[i] = make_pair(p, false);
}
for (int i = 0; i < N; i++)
{
int c, d;
cin >> c >> d;
pos p = {c, d};
B[i] = make_pair(p, false);
}
sort(B.begin(), B.end(), [](const pair<pos, bool> &m, const pair<pos, bool> &n) { return m.first.x < n.first.x; });
sort(R.begin(), R.end(), [](const pair<pos, bool> &m, const pair<pos, bool> &n) { return m.first.y > n.first.y; });
int count = 0;
for (int i = 0; i < N; i++){
pos b = B[i].first;
for (int j = 0; j < N; j++){
if((R[j].first.y < b.y) && (R[j].first.x < b.x) && !R[j].second){
count++;
R[j].second = true;
break;
}
}
}
cout << count << endl;
} | 1 | 75,051,725 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <vector>
#include <math.h>
#include <string>
#include <string.h>
#include <stack>
#include <algorithm>
#include <stdio.h>
#include <functional>
using namespace std;
int main()
{
int h, w;
while (cin >> h >> w)
{
if (h == 0 && w == 0)
{
break;
}
for (int i = 0; i < w; i++)
{
cout << '#';
}
cout << endl;
for (int i = 1; i < h - 1; i++)
{
cout << '#';
for (int j = 1; j < w - 1; j++)
{
cout << '.';
}
cout << '#' << endl;
}
for (int i = 0; i < w; i++)
{
cout << '#';
}
cout << endl << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int h, w;
while ((cin >> h >> w), h != 0 || w != 0) {
for (int x = 0; x < w; ++x) {
cout << "#";
}
cout << endl;
for (int y = 1; y < h - 1; ++y) {
cout << "#";
for (int x = 1; x < w - 1; ++x) {
cout << ".";
}
cout << "#" << endl;
}
for (int x = 0; x < w; ++x) {
cout << "#";
}
cout << endl << endl;
}
return 0;
} | 1 | 99,975,604 |
#include <iostream>
#include <string>
#include <cstring>
#include <stack>
#include <queue>
#include <cctype>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <stdlib.h>
#include <tuple>
#include <iomanip>
#include <iterator>
#include <stdio.h>
#include <fstream>
#include <time.h>
#include <bit>
#include <bitset>
#include <cstdint>
using namespace std;
const double PI = 3.14159265358979323846;
const long long int MOD = 1000000000 + 7;
struct UnionFind {
vector<int> parent;
UnionFind(int N) : parent(N) {
for (int i = 0; i < N; i++) {
parent[i] = -1;
}
}
int root(int i) {
if (parent[i] < 0) {
return i;
}
return (parent[i] = root(parent[i]));
}
bool unite(int from, int to) {
int rx = root(from);
int ry = root(to);
if (rx != ry) {
parent[ry] += parent[rx];
parent[rx] = ry;
return true;
}
else {
return false;
}
}
bool same(int x, int y) {
return root(x) == root(y);
}
int treeSize(int x) {
return -parent[root(x)];
}
};
long long int modpow(long long int base, long long int pow, long long int mod) {
if (pow == 1) {
return base;
}
else if (pow == 0) {
return 1;
}
if (pow % 2 == 0) {
auto temp = modpow(base, pow / 2, mod);
return (temp * temp) % mod;
}
else {
return (base * modpow(base, pow - 1, mod)) % mod;
}
}
long long int moddiv(long long int X, long long int Y, long long int mod) {
auto fermatDiv = modpow(Y, mod - 2, mod);
return (X * fermatDiv) % mod;
}
long long modCombination(long long left, long long right, long long int mod) {
long long answer = 1;
if (left > right) {
for (long long i = 0; i < right; i++) {
answer = (answer * (left - i)) % mod;
answer = moddiv(answer, (i + 1), mod);
}
}
return answer;
}
bool IsPrime(long long N) {
if (N == 1) {
return false;
}
for (long long i = 2; i * i <= N; i++) {
if (N % i == 0) {
return false;
}
}
return true;
}
vector<pair<long long, long long> > prime_factorize(long long N) {
vector<pair<long long, long long> > res;
for (long long a = 2; a * a <= N; ++a) {
if (N % a != 0) continue;
long long ex = 0;
while (N % a == 0) {
++ex;
N /= a;
}
res.push_back({ a, ex });
}
if (N != 1) res.push_back({ N, 1 });
return res;
}
map<long long, set<long long>> cache;
set<long long> enum_divisors(long long N) {
set<long long> res;
for (long long i = 1; i * i <= N; ++i) {
if (N % i == 0) {
res.insert(i);
if (cache.count(N / i) > 0) {
auto copy = cache[N / i];
auto copy2 = cache[N / i];
for (auto v : res) {
if (v != 1) {
for (auto itr = copy2.begin(); itr != copy2.end(); itr++) {
copy.insert(*itr * v);
}
break;
}
}
cache[N] = copy;
return copy;
}
if (N / i != i) res.insert(N / i);
}
}
cache[N] = res;
return res;
}
long long euclid(long long a, long long b) {
if (a > b) {
long long temp = b;
b = a;
a = temp;
}
if (b % a == 0) {
return a;
}
else {
return euclid(a, b - a);
}
}
long long gcd(long long a, long long b) {
if (b > a) {
long long temp = b;
b = a;
a = temp;
}
long long c = a % b;
if (c == 0) {
return b;
}
else {
return gcd(b, c);
}
}
struct Edge {
int to;
int cost;
public:Edge(int _to, int _cost) {
to = _to;
cost = _cost;
}
};
int main() {
int N, M;
cin >> N >> M;
vector<vector<Edge>> edges(N + 1, vector<Edge>());
for (int i = 0; i < M; i++) {
int a, b, c;
cin >> a >> b >> c;
edges[a].emplace_back(b, c);
edges[b].emplace_back(a, c);
}
vector<vector<int>> d(N + 1, vector<int>(N + 1));
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= N; j++) {
d[i][j] = 10000000;
if (i == j) {
d[i][j] = 0;
}
}
}
int answer = 0;
for (int s = 1; s <= N; s++) {
priority_queue <pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> q;
q.emplace(0, s);
while (!q.empty()) {
auto pair = q.top();
q.pop();
int v = pair.second;
if (d[s][v] < pair.first) {
continue;
}
for (auto e : edges[v]) {
if (d[s][e.to] > d[s][v] + e.cost) {
d[s][e.to] = d[s][v] + e.cost;
q.emplace(d[s][e.to], e.to);
}
}
}
for (auto e : edges[s]) {
if (e.cost > d[s][e.to]) {
answer++;
}
}
}
cout << answer / 2 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
struct edge {
int u, v, w;
edge() {}
edge(int u, int v, int w):
u(u), v(v), w(w) {}
};
void chmin(int &a, int b) {
if (a > b) a = b;
}
void solve() {
int n, m;
cin >> n >> m;
vector<edge> edges;
vector<vector<int>> dist(n + 1, vector<int>(n + 1, 2e9));
for (int i = 1; i <= m; i++) {
int u, v, w;
cin >> u >> v >> w;
dist[u][v] = dist[v][u] = w;
edges.push_back(edge(u, v, w));
}
for (int k = 1; k <= n; k++)
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) {
chmin(dist[i][j], dist[i][k] + dist[k][j]);
}
int ans = 0;
for (auto &i : edges) {
if (dist[i.u][i.v] < i.w) ans++;
}
cout << ans << '\n';
}
signed main() {
#ifdef _DEBUG
#endif
ios::sync_with_stdio(0); cin.tie(0);
int T = 1;
while (T--) solve();
} | 1 | 74,581,629 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> p;
#define MOD 1000000007
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N, D, A;
cin >> N >> D >> A;
vector<p> k(N);
vector<ll> s(N);
ll S = 0;
for(int i = 0; i < N; i++) {
ll X, H;
cin >> X >> H;
k[i] = make_pair(X, H);
}
sort(k.begin(), k.end());
vector<ll> x(N);
vector<ll> h(N);
for(int i = 0; i < N; i++) {
x[i] = k[i].first;
h[i] = k[i].second;
}
ll ans = 0;
for(int i = 0; i < N; i++) {
h[i] -= S;
if(h[i] > 0) {
ll a = h[i] / A;
if(a * A < h[i]) {
a++;
}
ans += a;
S += a * A;
ll pos = upper_bound(x.begin(), x.end(), x[i] + 2 * D) - x.begin() - 1;
s[pos] += a * A;
}
S -= s[i];
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n;
ll d, a;
cin >> n >> d >> a;
vector<P> p(n);
rep(i, n){
cin >> p[i].first >> p[i].second;
}
sort(p.begin(), p.end());
d = d*2;
ll tot = 0;
queue<pair<ll, ll>> q;
ll ans = 0;
rep(i, n){
ll x = p[i].first;
ll h = p[i].second;
while(q.size() && q.front().first < x){
tot -= q.front().second;
q.pop();
}
h -= tot;
if(h>0){
ll num = (h+a-1) / a;
ans += num;
ll damage = num * a;
tot += damage;
q.emplace(x+d, damage);
}
}
cout << ans << endl;
return 0;
} | 1 | 65,585,872 |
#include "bits/stdc++.h"
using namespace std;
#define int long long
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define RREP(i, n) for (int i = (int)n - 1; i >= 0; --i)
#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)
#define RFOR(i, s, n) for (int i = (int)n - 1; i >= s; --i)
#define ALL(a) a.begin(), a.end()
#define IN(a, x, b) (a <= x && x < b)
template<class T>inline void out(T t){cout << t << "\n";}
template<class T,class... Ts>inline void out(T t,Ts... ts){cout << t << " ";out(ts...);}
template<class T>inline bool CHMIN(T&a,T b){if(a > b){a = b;return true;}return false;}
template<class T>inline bool CHMAX(T&a,T b){if(a < b){a = b;return true;}return false;}
constexpr int INF = 1e18;
signed main(){
int N;
cin >> N;
vector<vector<int>>g(N);
int ans = 0;
REP(i, N) {
ans += (i + 1) * (N - i);
}
REP(i, N - 1) {
int a, b;
cin >> a >> b;
a--;b--;
ans -= (min(a, b) + 1) * (N - max(a, b));
}
out(ans);
} | #include <bits/stdc++.h>
using namespace std;
int main(void)
{
int n;
cin >> n;
long long nodes = 0;
long long edges = 0;
for (int i = 0; i < n - 1; i++)
{
int u, v;
cin >> u >> v;
if (u > v) swap(u, v);
edges += (long long)u * (n - v + 1);
}
for (int i = 0; i < n; i++) nodes += (long long)(i + 1) * (n - i);
cout << nodes - edges << endl;
return (0);
} | 1 | 93,066,939 |
#include <iostream>
#include <iomanip>
#include <utility>
#include <cmath>
#include <random>
#include <vector>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <algorithm>
using namespace std;
#define rep(i,n) for(int i = 0; i<n; ++i)
#define REP(i,n) for(int i = 1; i<=n; ++i)
#define all(x) begin(x),end(x)
#define show(obj) {for(auto x:obj)cout<<x<<' ';cout<<endl;}
#define line "----------"
typedef long long ll;
typedef pair<int,int> ip;
typedef pair<ll,ll> lp;
const int inf = 1001001000;
const ll INF = 1LL<<60;
const int MOD = (int)1e9 + 7;
int main(){
int A,B,K; cin>>A>>B>>K;
rep(i,K){
if(i % 2 == 0){
A /= 2;
B += A;
}else{
B /= 2;
A += B;
}
}
cout<<A<<' '<<B<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
long long A,B,K;
cin >> A >> B >> K;
for(int i=0;i<K;i++){
if(i%2==0){
if(A%2==1){
A--;
}
B+=A/2;
A/=2;
}
else{
if(B%2==1){
B--;
}
A+=B/2;
B/=2;
}
}
cout << A << " " << B << endl;
} | 1 | 74,477,709 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using P = pair<int, int>;
const int inf=1e9+7;
const ll INF=1e18;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
int main() {
int a,b,c,d;
cin>>a>>b>>c>>d;
bool ok=false;
if(abs(a-c)<=d)ok=true;
if(abs(a-b)<=d &&abs(b-c)<=d) ok=true;
if(ok)cout<<"Yes"<<endl;
else{
cout<<"No"<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A,B,C,D;
cin >> A >> B >> C >> D;
if(max(A,C)-min(A,C)<=D || (max(A,B)-min(A,B)<=D && max(B,C)-min(B,C)<=D)){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
} | 1 | 83,965,832 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll large = 1000000000;
int main()
{
ll s;
cin >> s;
ll x1 = 1e9;
if(s > large)
{
if(s%x1 == 0)
cout << x1 << " 0 0 " << s/x1 << " 0 0\n";
else
cout << x1 << " 0 " << s%x1 << " " << 1 + s/x1 << " " << "0 1\n";
}
else
{
cout << s << " 0 0 1 0 0\n";
}
} | #include<bits/stdc++.h>
#define SZ(x) ((int)x.size())
#define uni(x) sort(all(x)),x.resize(unique(all(x))-x.begin());
#define GETPOS(c,x) (lower_bound(all(c),x)-c.begin())
#define lown1(x,val) low(in(x),val)-x
#define lowm1(x,val) low(im(x),val)-x
#define low1(x,nums,val) low(x+1,x+nums+1,val)-x
#define mst(x,val) memset((x),val,sizeof((x)))
#define ls rt<<1
#define rs rt<<1|1
#define lson rt<<1,l,M
#define rson rt<<1|1,M+1,r
#define PI acos(-1)
#define MM int M=(l+r)>>1;
#define fu(i,r,t) for(int i=r;i<=t;i++)
#define fd(i,r,t) for(int i=r;i>=t;i--)
#define fh(i,be,e) for(int i=head[be];~i;i=e[i].next)
#define fa(i,V) for(auto i:V)
#define far(i,V) for(auto &i:V)
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define lcm(a,b) ((a)*(b))/__gcd(a,b)
#define cp(i,ans) printf("%.if",ans);
#define cpp(i,ans) cout<<setprecision(i)<<fixed<<ans<<endl;
#define ppb pop_back
#define ppf pop_front
#define pb push_back
#define pf push_front
#define pq priority_queue
#define lowbit(x) ((x)&(-x))
#define all(V) V.begin(),V.end()
#define ms multiset
#define mod(x) (((x)<0)?(x)%mo_num+mo_num:(x)%mo_num)
#define vc vector
#define vct vector<int>
#define out(i) cout<<(i)<<endl;
#define fi first
#define se second
#define fun(i) fu(i,1,n)
#define fut(i) fu(i,1,t)
#define fum(i) fu(i,1,m)
#define ld long double
#define umap unordered_map
#define Umap unordered_map<int,int>
#define P pair<int,int>
#define SET set<int>
#define mk make_tuple
#define eps 1e-6
#define endl '\n'
#define low lower_bound
#define upp upper_bound
#define yn(key) out(key?"YES":"NO")
#define in(i) i+1,i+1+n
#define im(i) i+1,i+1+m
#define ik(i,k) i+1,i+1+k
#define bffs(i) __builtin_ffs(i)
#define bcount(i) __builtin_popcount(i)
#define bone(i) ((1<<i)-1)
#define db double
#define ll long long
#define got(container,num) get<num-1>(container)
#define int long long
#define print(a,n) fun(i)cout<<a[i]<<(i!=n?' ':endl);
#define outcase(x) cout<<"Case #"<<(++case_of_T)<<": "<<x<<endl;
#define ptcase(x) printf("Case #%d: %d\n",++case_of_T,x);
#define plcase(x) printf("Case #%lld: %lld\n",++case_of_T,x);
using namespace std;
const int INF=LLONG_MAX/4,SINF=0x3f3f3f3f,Lim=1<<20,MINF=LLONG_MAX;
const int dx[]={0,0,-1,1},dy[]={-1,1,0,0};
const int maxn=1e6+1e5;
int mo_num=1e9+7;
int n,m,t,a[maxn],b[maxn],ans,case_of_T;
const int N=1e9;
void solve()
{
cin>>n;
int A=n/N,B=n%N;
cout<<0<<" "<<0<<" ";
if(!B)
{
cout<<N<<" "<<0<<" "<<0<<" "<<A;
}else{
A++;
B-=N;
cout<<A<<" "<<1<<" "<<-B<<" "<<N;
}
return ;
}
main()
{
IOS
int T=1;
while(T--)solve();
return 0;
} | 1 | 27,789,653 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n;
cin >> n;
int64_t num = 0, ans = 1000000000001;
for(int i=1; i<=sqrt(n); i++) {
if(n%i==0) num = (i-1)+(n/i-1);
ans = min(num, ans);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
using namespace std;
#define int long long
int n;
vector <int> v;
void check(int a, int b) {
if (a*b == n) v.push_back(a+b-2);
}
int32_t main() {
ios_base::sync_with_stdio(0); cin.tie(0);
cin >> n;
for(int i = 1; i <= sqrt(n); ++i) {
check(i, n/i);
}
cout << *min_element(v.begin(), v.end());
} | 1 | 91,652,010 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int n;
cin >> n;
vector<int> a(100005);
rep(i,n){
int x;
cin >> x;
a[x]++;
}
int ans = 0;
rep(i,100000){
int cnt = 0;
rep(j,3) cnt += a[i+j];
ans = max(ans, cnt);
}
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline")
#pragma GCC option("arch=native","tune=native","no-zero-upper")
#pragma GCC target("avx2")
#define int long long
#define f first
#define s second
#define db(x) cerr << #x << ": " << (x) << '\n';
#define pb push_back
#define lb lower_bound
#define up upper_bound
#define all(x) x.begin() , x.end()
#define rall(x) x.rbegin() , x.rend()
#define enl '\n'
#define vi vector<int>
#define sz(a) int((a).size())
#define rep(i,n) for(int i=0;i<(n);i++)
#define repi(i,n) for(int i=(1);i<=(n);i++)
typedef pair<int,int> ii;
typedef long double ld;
typedef unsigned long long ull;
const int maxn = 200005;
const int mod = 1000000007;
const ld eps = 1e-9;
const int inf = ((1ll<<31ll)-1ll);
const int INF = 2000000000000000000ll;
const ld pi = acos(-1);
#define lg2(x) 31 - __builtin_clz(x)
#define lgx(x,b) ( log(x) / log(b) )
int qpow(int b,int e){
if( !e ) return 1;
if( e & 1 ) return qpow(b,e-1) * b % mod;
int pwur = qpow(b,e>>1);
return (pwur * pwur) % mod;
}
int modinv(int x){
return qpow(x,mod-2);
}
int32_t main(){
ios_base::sync_with_stdio(0); cin.tie(0);
cout.setf(ios::fixed); cout.precision(0);
srand(time(NULL));
int n;
cin>>n;
vi v(100005);
rep(i,n){
int x;
cin>>x;
if(x!=0)v[x-1]++;
v[x]++;
v[x+1]++;
}
sort(rall(v));
cout<<v[0]<<enl;
return 0;
} | 1 | 48,865,785 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s, key = "keyence";
cin >> s;
int n = s.size(), i = 0, now = 0;
while (s[i] == key[now]) {
if (now == 6) {
cout << "YES" << endl;
return 0;
} else {
i++;
now++;
}
}
if (s.substr(n - 7 + i) == key.substr(now))
cout << "YES" << endl;
else
cout << "NO" << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, s, e) for (int i = (int)(s); i <= (int)(e); i++)
#define printYesNo(is_ok) puts(is_ok ? "Yes" : "No");
#define SORT(v) sort(v.begin(), v.end());
#define RSORT(v) sort(v.rbegin(), v.rend());
#define REVERSE(v) reverse(v.begin(), v.end());
template <typename T>
void printlnVector(T v)
{
rep(i, v.size())
{
cout << v[i] << endl;
}
}
template <typename T>
void printVector(T v)
{
rep(i, v.size())
{
cout << v[i] << " ";
}
cout << endl;
}
int main()
{
string S;
cin >> S;
bool is_ok = false;
rep(i, S.size())
{
rep(j, S.size())
{
string temp = S.substr(0, i - 1);
temp += S.substr(j, S.size());
if (temp == "keyence")
is_ok = true;
}
}
if (is_ok)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | 1 | 65,721,464 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int ans=0,mini=0;
int a;
for(int i=0;i<n;i++){
cin>>a;
if(a>=mini){
ans++;
mini=a;
}
}
cout<<ans<<endl;
} | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#define rep(i,n) for (int i = 0; i < n; ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int N;
cin >> N;
vector<int> H(N);
rep(i,N) cin >> H[i];
int ans = 1;
for (int i = 1; i < N; ++i) {
bool ok = true;
for (int j = 0; j < i; ++j) {
if (H[j] > H[i]) ok = false;
}
if (ok) ++ans;
}
cout << ans << endl;
return 0;
} | 1 | 58,981,353 |
#include <assert.h>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <algorithm>
#include <numeric>
#include <functional>
#include <iostream>
#include <string>
#include <array>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <complex>
#include <bitset>
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define DEBUG(vec) for (auto v : vec) { cout << v << " "; } cout << endl;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll X, Y;
cin >> X >> Y;
if (abs(X - Y) > 1) {
cout << "Alice" << endl;
} else {
cout << "Brown" << endl;
}
return 0;
} | #define _USE_MATH_DEFINES
#include<iomanip>
#include<cmath>
#include<iostream>
#include<fstream>
#include<vector>
#include<algorithm>
#include<numeric>
#include<bitset>
#include<map>
#include<unordered_map>
#include<set>
#include<unordered_set>
#include<queue>
#include<deque>
#include<stack>
using namespace std;
typedef long long ll;
#define repi(i,a,b) for(ll i = (ll)(a) ; i < (ll)(b) ; i++)
#define repd(i,a,b) for(ll i = (ll)(a) ; i > (ll)(b) ; i--)
#define rd(x) cin >> x
#define wr(x) cout << x
#define wrln(x) cout << x << endl
const ll MAX_10p5 = 100010;
const ll MAX_10p9 = 1000000010;
const ll MAX_10p18 = 1000000000000000010;
const ll MOD = 1000000007;
const ll m4x[4] = { 1,0,-1,0 };
const ll m4y[4] = { 0,1,0,-1 };
const ll m8x[8] = { 1,1,0,-1,-1,-1,0,1 };
const ll m8y[8] = { 0,1,1,1,0,-1,-1,-1 };
const ll m9x[9] = { 1,1,0,-1,-1,-1,0,1,0 };
const ll m9y[9] = { 0,1,1,1,0,-1,-1,-1,0 };
struct edge {
ll from, to, cost;
bool operator<(const edge& right) const {
return cost < right.cost;
}
};
struct point {
ll x, y;
bool operator<(const point& right) const {
return x == right.x ? y < right.y : x < right.x;
}
};
int main() {
ll x, y;
cin >> x >> y;
if (x - 1 <= y && x + 1 >= y) wrln("Brown");
else wrln("Alice");
return 0;
} | 1 | 8,143,081 |
#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 PP = pair<int,pair<int,int>>;
using T = tuple<string,int,int>;
const string EMP = " ";
const ll INF = 1LL<<60;
const ll MOD = 1000000007;
const double PI = acos(-1);
int main(){
int n,m; cin >> n >> m;
vector<int> h(n);
for(int i = 0; i < n; i++) cin >> h[i];
vector<bool> chk(n, true);
for(int i = 0; i < m; i++){
int a,b; cin >> a >> b;
a--; b--;
if(h[a] <= h[b]) chk[a] = false;
if(h[b] <= h[a]) chk[b] = false;
}
int ans = 0;
for(int i = 0; i < n; i++){
if(chk[i]) ans++;
}
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
#define ll long long int
using namespace std;
ll a[200010], ans;
bool visited[200010];
int main()
{
int i, v, u, edges, nodes;
cin >> nodes >> edges;
for(i=1;i<=nodes;i++)
{
cin >> a[i];
visited[i] = true;
}
for(i=1;i<=edges;i++)
{
cin >> u >> v;
if(a[u]==a[v])
{
visited[u] = false;
visited[v] = false;
}
else if(a[u]>a[v])
{
visited[v] = false;
}
else{
visited[u] = false;
}
}
for(i=1;i<=nodes;i++)
ans += visited[i];
cout << ans << endl;
return 0;
} | 1 | 16,801,737 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string str;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector <pii> vpii;
typedef vector <pll> vpll;
typedef map <str,int> mapsi;
typedef map <str,int> :: iterator mapsitr;
typedef map <int , int> mint;
typedef map <ll , ll> mll;
typedef set <int> si;
typedef set <ll> sll;
typedef si :: iterator sitr;
typedef si :: reverse_iterator rsitr;
typedef sll :: iterator sltr;
typedef sll :: reverse_iterator rsltr;
#define mset multiset
typedef mset <int> msi;
typedef mset <ll> msll;
typedef msi :: iterator msitr;
typedef msi :: reverse_iterator msritr;
typedef msll :: iterator msltr;
typedef msll :: reverse_iterator mslritr;
#define mp make_pair
#define pb push_back
#define pob pop_back
#define pf push_front
#define pof pop_front
#define fi first
#define se second
#define fs first.second
#define ss second.second
#define ff first.first
#define sf second.first
#define newl '\n'
char to_upper (char x){
if( 97 <= int(x) && int(x) <= 126)return char(x-32);
else if( 65 <= int(x) && int(x) <= 90)return x;
}
char to_lower (char x){
if( 97 <= int(x) && int(x) <= 126)return x;
else if( 65 <= int(x) && int(x) <= 90)return char(x+32);
}
int numerize (char x){
if(48 <= int(x) && int(x) <= 57)return int(x-'0');
else if( 97 <= int(x) && int(x) <= 126)return int(x-96);
else if( 65 <= int(x) && int(x) <= 90)return int(x-64);
}
ll n,z,w,a[3000];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin>>n>>z>>w;
for(int i=1;i<=n;i++)cin>>a[i];
ll ans = abs(w-a[n]);
if(n>1)ans = max(ans, abs(a[n] - a[n-1]));
cout<<ans<<newl;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair<ll,ll> ii;
typedef vector<int> vi;
typedef long double ld;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
const long long mod = 1000000007;
const long long inf = 1e18;
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
int n,z,w;
cin>>n>>z>>w;
vi v;
for(int i=0;i<n;i++){
int k;
cin>>k;
v.pb(k);
}
if(n==1){
cout<<abs(v[0]-w)<<endl;
}
else{
cout<<max(abs(v[n-1]-v[n-2]),abs(v[n-1]-w));
}
return 0;
} | 1 | 83,620,116 |
#include <bits/stdc++.h>
#define endl "\n"
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
#define uniq(v) v.erase(unique(v.begin(),v.end()),v.end())
#define lb(v,x) (lower_bound(v.begin(),v.end(),x)-v.begin())
#define ub(v,x) (upper_bound(v.begin(),v.end(),x)-v.begin())
using Pair = pair<ll,pair<int,int>>;
#define pq priority_queue<Pair, vector<Pair>, greater<Pair>>
const ll mod=1000000007;
const ld pi=acos(-1.0);
const ll INF = 1LL<<61;
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; }
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(){
cin.tie(0);
ios::sync_with_stdio(false);
ll a,b;
cin>>a>>b;
cout << lcm(a,b) << endl;
} | #include<bits/stdc++.h>
#include<numeric>
#include<cassert>
#define ll long long int
#define CON 100010
const long long mod=1e9+7;
const int INF=1001001001;
using namespace std;
ll gcd(ll a,ll b)
{
ll r=a%b;
if(r==0)
{
return b;
}
return gcd(b,r);
}
ll lcm(ll num,ll gcd)
{
return num/gcd;
}
int main()
{
ll a,b;
cin>>a>>b;
ll com=a*b;
ll mul=gcd(max(a,b),min(a,b));
ll ans=lcm(com,mul);
cout<<ans<<endl;
return 0;
} | 1 | 14,107,474 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
vector<string> ss(n);
for (auto &&s : ss)
{
cin >> s;
}
int m;
cin >> m;
vector<string> ts(m);
for (auto &&t : ts)
{
cin >> t;
}
set<string> st;
for (auto &&s : ss)
{
st.insert(s);
}
for (auto &&t : ts)
{
st.insert(t);
}
map<string, int> g, l;
for (auto &&s : ss)
{
g[s]++;
}
for (auto &&t : ts)
{
l[t]++;
}
int ans = 0;
for (auto &&u : st)
{
ans = max(ans, g[u] - l[u]);
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <string.h>
#include <string>
#include <algorithm>
#include <math.h>
using namespace std;
void b_two_colors_card_game(void) {
int n, m;
string s[100];
string t[100];
cin >> n;
for (int i = 0; i < n; i++) cin >> s[i];
cin >> m;
for (int i = 0; i < m; i++) cin >> t[i];
string s_merge[100];
int s_cnt[100] = { 0 };
bool detect = false;
int max = 0;
for (int i = 0; i < n; i++) {
if (s[i] == "None") continue;
else {
s_cnt[i]++;
for (int j = i+1; j < n; j++) {
if (s[i] == s[j]) {
s_cnt[i]++;
s[j] = "None";
}
}
for (int k = 0; k < m; k++) {
if (s[i] == t[k]) s_cnt[i]--;
}
}
if (s_cnt[i] > max) max = s_cnt[i];
}
cout << max << endl;
}
int main()
{
b_two_colors_card_game();
return 0;
} | 1 | 66,603,566 |
#include<bits/stdc++.h>
using namespace std;
const int MAXN = 3e5 + 5;
typedef long long ll;
template <typename T> void chkmax(T &x, T y) {x = max(x, y); }
template <typename T> void chkmin(T &x, T y) {x = min(x, y); }
template <typename T> void read(T &x) {
x = 0; int f = 1;
char c = getchar();
for (; !isdigit(c); c = getchar()) if (c == '-') f = -f;
for (; isdigit(c); c = getchar()) x = x * 10 + c - '0';
x *= f;
}
int get(int h, int m) {
return h * 60 + m;
}
int main() {
int h1, m1, h2, m2, k;
read(h1), read(m1), read(h2), read(m2), read(k);
cout << get(h2, m2) - get(h1, m1) - k << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define watch(x) cerr << (#x) << ": " << (x) << endl
typedef long long LL;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int ha, ma, hb, mb, k; cin >> ha >> ma >> hb >> mb >> k;
int a = ha*60 + ma, b = hb*60 + mb;
int ans = (b-a) - k;
cout << ans << '\n';
return 0;
} | 1 | 64,032,347 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll mod = 1e9+7;
int main(){
double t,x;
cin >> t >> x;
cout << t/x << endl;
return 0;
} | #include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <ctype.h>
#include <math.h>
#include <stack>
#include <string>
#include <string.h>
using namespace std;
double PI = 3.1415926535897932;
long mod = 1000000007;
const long INF = (1<<30);
int main() {
double t,x;
cin >> t >> x;
cout << t/x << endl;
} | 1 | 12,712,354 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string a,b;
int i,j,k,l1,l2;
cin>>a>>b;
l1=a.size();
l2=b.size();
int ar[l2+1][l1+1];
for(i=0;i<=l2;i++){
for(j=0;j<=l1;j++){
if(i==0){
ar[i][j]=j;
}
else if(j==0){ar[i][j]=i;}
else if(b[i-1]==a[j-1]){ar[i][j]=ar[i-1][j-1];}
else{ ar[i][j]=1+min(min(ar[i][j-1],ar[i-1][j]),ar[i-1][j-1]);}
}
}
cout<<ar[l2][l1]<<endl;
} | #include<bits/stdc++.h>
using namespace std;
const int INF=1001001001;
string S,T;
int dp[1001][1001];
int main(){
cin>>S>>T;
for(int i=0;i<=S.size();i++)for(int j=0;j<=T.size();j++)dp[i][j]=INF;
for(int i=0;i<=T.size();i++)dp[0][i]=i;
for(int i=0;i<=S.size();i++)dp[i][0]=i;
for(int i=0;i<S.size();i++){
for(int j=0;j<T.size();j++){
dp[i+1][j+1]=min(dp[i][j],min(dp[i+1][j],dp[i][j+1]))+1;
if(S[i]==T[j])dp[i+1][j+1]=min(dp[i+1][j+1],dp[i][j]);
}
}
cout<<dp[S.size()][T.size()]<<endl;
return 0;
} | 1 | 52,076,727 |
#include<bits/stdc++.h>
#define rep(i,N) for(ll (i)=0;(i)<(N);(i)++)
#define chmax(x,y) x=max(x,y)
#define chmin(x,y) x=min(x,y)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int mod = 1000000007;
int main() {
ll a, b, c, k;
cin >> a >> b >> c >> k;
ll diff = a - b;
if (k % 2) diff = -diff;
cout << diff << endl;
} | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <limits>
using namespace std;
long long INF = (1LL<<62);
int main(int argc, char* argv[]){
cin.tie(0);
ios::sync_with_stdio(false);
long long A, B, C, K;
cin >> A >> B >> C >> K;
long long ans = 0;
if((K % 2) == 1){
ans = B - A;
}
else{
ans = A -B;
}
printf("%lld\n", ans);
return 0;
} | 1 | 26,108,396 |
#include<bits/stdc++.h>
using namespace std;
#define lli long long int
#define pb push_back
#define fi first
#define se second
#define MOD 1000000007
const int maxn= 100010;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int p=0,q=0,r=0;
cin>>p>>q>>r;
cout<<min({p+q,p+r,q+r})<<endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
int ans=max({a,b,c});
cout<<a+b+c-ans<<endl;
} | 1 | 40,201,235 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1000000007;
#define REP(i, n) for (ll i = 0; i < (n); i++)
#define REP2(i, x, n) for (ll i = x; i < (n); i++)
const long long INF = numeric_limits<long long>::max();
int main() {
ll N, T;
cin >> N >> T;
vector<ll> times(N);
for (ll i = 0; i < N; ++i) {
cin >> times[i];
}
ll sum = T;
for (ll i = 0; i < N - 1; ++i) {
ll next = times[i] + T;
if (next > times[i + 1]) {
sum += T - (next - times[i + 1]);
} else {
sum += T;
}
}
cout << sum << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
int main(){
int N,T;
cin >> N >> T;
vector<int> t(N);
for(int i = 0; i < N; i++){
cin >> t[i];
}
ll ans = 0;
for(int i = 1; i < N; i++){
int gap = t[i] - t[i-1];
if(gap >= T){
ans += T;
}else{
ans += gap;
}
}
ans += T;
cout << ans << endl;
} | 1 | 22,584,780 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int64_t> L(N+1);
L[0] = 2;
L[1] = 1;
for(int i = 2; i < N+1; i++){
L[i] = L[i-1] + L[i-2];
}
cout << L[N];
} | #include <iostream>
#include <stdio.h>
#define MAX_N 64
using namespace std;
int64_t L[MAX_N]{};
int64_t f(int i) {
if (i == 0) {
return 2;
}
if (i == 1) {
return 1;
}
if (L[i] == 0) {
L[i] = f(i - 1) + f(i - 2);
}
return L[i];
}
int main() {
int N;
cin >> N;
printf("%lld\n", f(N));
} | 1 | 70,058,300 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e16;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (ll)(n); i++)
int main() {
ll n, h; cin >> n >> h;
vector <pair <ll, ll>> a(n, pair <ll, ll> ());
vector <pair <ll, ll>> b(n, pair <ll, ll> ());
rep(i, n) {
cin >> a.at(i).first >> b.at(i).first;
a.at(i).second = i; b.at(i).second = i;
}
sort(a.begin(), a.end());
sort(b.begin(), b.end());
ll tmp_a = a.at(n-1).first, tmp_loc = a.at(n-1).second, tmp_b;
rep(i, n) {
if (b.at(i).second == tmp_loc) {
tmp_b = b.at(i).first;
break;
}
}
ll res = 0;
for (ll i = n-1; i >= 0; i--) {
if (b.at(i).second != tmp_loc) {
if (b.at(i).first > tmp_a) {
h -= b.at(i).first;
res++;
}
}
if (h>0 && h-tmp_b<=0) {
h = 0;
res++;
}
if (h <= 0) break;
}
if (h > 0) {
h -= tmp_b;
res++;
if (h > 0) {
if (h%tmp_a) res += h/tmp_a+1;
else res += h/tmp_a;
}
}
cout << res << endl;
} | #include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n, h;
cin >> n >> h;
vector<int> a(n), b(n);
rep(i,n) cin >> a[i] >> b[i];
sort(a.rbegin(), a.rend());
sort(b.rbegin(), b.rend());
int ans = 0, idx = 0;
while(h > 0 && idx < n && a[0] < b[idx]){
h -= b[idx++];
++ans;
}
if(h > 0) ans += (h + a[0] - 1) / a[0];
cout << ans << endl;
return 0;
} | 1 | 70,350,117 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
const int INF = 1001001001;
int a[12][12];
int main() {
int N;
cin>>N;
for(int i=0;i<100;i++){
for(int j=0;j<100;j++){
if(4*i+7*j==N){cout<<"Yes"<<endl;return 0;}
}
}
cout<<"No"<<endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n;
cin>>n;
for (int i = 0; i <= n; i+=4) if ((n-i)%7==0) {puts("Yes");return 0;}
puts("No");
} | 1 | 6,729,075 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
int ma = 0;
int cnt = 0;
int prev = a.at(0);
for (int i = 1; i < n; i++) {
if (prev >= a.at(i)) {
cnt++;
}
else {
ma = max(ma, cnt);
cnt = 0;
}
prev = a.at(i);
}
cout << max(ma, cnt) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
#define INF 1000000007
#define mod 1005
#define ll long long int
const double mx = 2e6 + 5 ;
void solve()
{
int n, maxCnt = 0;
cin>>n;
vector<int> v(n);
REP(i,n)
cin>>v[i];
int i = 0;
while(i<n)
{
int cnt = 0;
while(i+1<n && v[i]>=v[i+1])
{
i++;
cnt++;
}
maxCnt = max(maxCnt, cnt);
i++;
}
cout<<maxCnt<<"\n";
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t = 1;
while(t--)
{
solve();
}
return 0;
} | 1 | 36,433,003 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int h1, m1, h2, m2, k; cin >> h1 >> m1 >> h2 >> m2 >> k;
int sum = 0;
if (h2 < h1) {
h2 += 24;
}
sum += (60 * h2 + m2) - (60 * h1 + m1) - k;
cout << sum << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int a,b,c,d,k,x=0;
cin>>a>>b>>c>>d>>k;
if(d>b)
{
d-=b;
b=0;
x+=(c-a)*60;
x+=d;
x-=k;
}
else if(b>d)
{
b-=d;
d=0;
x=60-b;
c--;
x+=(c-a)*60;
x-=k;
}
else
{
x+=(c-a)*60;
x-=k;
}
cout<<x<<endl;
return 0;
} | 1 | 46,370,061 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<int, int>;
int N, A[3];
vector<int> l;
vector<int> p;
int dfs(int i = 0) {
int ret = INT32_MAX;
if (i == N) {
int use = 0;
int sm[3] = {0};
rep(i, N) {
if (p[i] != 3) {
sm[p[i]] += l[i];
use++;
}
}
ret = (use - 3) * 10;
rep(i, 3) {
if (sm[i] == 0) return INT32_MAX;
ret += abs(sm[i] - A[i]);
}
return ret;
}
p[i] = 0;
ret = min(ret, dfs(i + 1));
p[i] = 1;
ret = min(ret, dfs(i + 1));
p[i] = 2;
ret = min(ret, dfs(i + 1));
p[i] = 3;
ret = min(ret, dfs(i + 1));
return ret;
}
int main() {
cin >> N >> A[0] >> A[1] >> A[2];
l.resize(N);
rep(i, N) cin >> l[i];
p.resize(N);
cout << dfs(0) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using i64 = int_fast64_t;
#define INF ((i64)(1e18))
#define MOD ((i64)(1e9+7))
#define REP(i, n) for(i64 i = 0; i < (n); i++)
#define RREP(i, n) for(i64 i = (n)-1; i >= 0; i--)
#define RANGE(i, a, b) for(i64 i = (a); i < (b); i++)
#define RRANGE(i, a, b) for(i64 i = (b)-1; i >= (a); i--)
#define ALL(v) (v).begin(), (v).end()
#define SIZE(v) ((i64)(v).size())
template<class T> inline void chmax(T &a, const T &b) { if (a < b) a = b; }
template<class T> inline void chmin(T &a, const T &b) { if (a > b) a = b; }
int main() {
i64 n, a, b, c;
cin >> n >> a >> b >> c;
vector<i64> l(n);
REP(i, n) cin >> l.at(i);
sort(ALL(l));
i64 ans = INF;
do {
RANGE(i, 0, n-2) {
RANGE(j, i+1, n-1) {
RANGE(k, j+1, n) {
i64 sum1 = 0, sum2 = 0, sum3 = 0;
RANGE(ii, 0, i+1) sum1 += l[ii];
RANGE(jj, i+1, j+1) sum2 += l[jj];
RANGE(kk, j+1, k+1) sum3 += l[kk];
chmin(ans, abs(a-sum1)+abs(b-sum2)+abs(c-sum3)+10*(k+1)-30);
}
}
}
} while (next_permutation(ALL(l)));
cout << ans << endl;
return 0;
} | 1 | 45,515,086 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <bitset>
#include <queue>
#include <stack>
#include <sstream>
#include <cstring>
#include <numeric>
#include <ctime>
#include <cassert>
#include <unordered_set>
#include<unordered_map>
#include <random>
#include <valarray>
#define MOD 1000000007
#define re return
#define fi first
#define se second
#define mp make_pair
#define pb emplace_back
#define all(x) x.begin(), x.end()
#define sz(x) ((int)(x).size())
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define y0 y32479
#define y1 y95874
#define next next239
#define prev prev239
#define fill(x, y) memset(x, y, sizeof(x))
#define sqr(x) ((x) * (x))
#define sqrt(x) sqrt(abs(x))
#define unq(x) (x.resize(unique(all(x)) - x.begin()))
#define ba back()
#define popcount __builtin_popcountll
#define fastIO() \
{ \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0); \
}
#define in(x) \
int x; \
cin >> x;
#define in1(x) \
int x; \
cin >> x; \
x--;
#define inll(x) \
ll x; \
cin >> x;
#define ins(x) \
string x; \
cin >> x;
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<string> vs;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef pair<double, double> pdd;
typedef long double LD;
typedef double D;
void Solve()
{
ll n,m;
cin>>n>>m;
if((n+m)>16 || n>8 || m>8 )
{
cout<<":("<<endl;
}
else
{
cout<<"Yay!"<<"\n";
}
}
int main()
{
fastIO();
int t;
t=1;
while (t--)
{
Solve();
}
return 0;
} | #include <iostream>
using namespace std;
int main()
{
int n, m; cin >> n >> m;
if (n <= 8 && m <= 8) cout << "Yay!";
else cout << ":("; return 0;
} | 1 | 94,285,437 |
#include<bits/stdc++.h>
#define watch(x) cout << (#x) << " is " << (x) << endl
typedef long long ll;
using namespace std;
int static fast = [](){
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0); return 0;
}();
void dfs(vector<int>& perm, int state, int pre, ll sum, ll& ans,
vector<vector<ll>>& adj) {
if (state == (1 << perm.size())-1) {
ans = min(ans, sum);
return;
}
for(int i = 0; i < perm.size(); i++) {
if (((state >> i) & 1) == 0) {
state |= (1 << i);
dfs(perm, state, perm[i], sum+adj[pre][perm[i]], ans, adj);
state ^= (1 << i);
}
}
}
int main() {
int n, m, r;
int a, b, c;
cin >> n >> m >> r;
vector<vector<ll>> adj(n+1, vector<ll>(n+1, 1e7));
vector<int> perm(r, 0);
for(int& val: perm)
cin >> val;
for(int i = 0; i < m; i++) {
cin >> a >> b >> c;
adj[a][b] = adj[b][a] = min(adj[a][b], ll(c));
}
for(int i = 1; i <= n; i++)
adj[i][i] = 0;
for(int k = 1; k <= n; k++) {
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= n; j++) {
if (adj[i][k] + adj[k][j] < adj[i][j])
adj[i][j] = adj[i][k] + adj[k][j];
}
}
}
ll ans = INT_MAX;
int state = 0;
for(int i = 0; i < perm.size(); i++) {
state |= (1 << i);
dfs(perm, state, perm[i], 0LL, ans, adj);
state ^= (1 << i);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
void warshall_floyd(int N, vector<vector<int>> &G, int INF) {
rep(k, N) rep(i, N) {
if (G[i][k] == INF) continue;
rep(j, N) {
if (G[i][j] > G[i][k] + G[k][j]) {
G[i][j] = G[i][k] + G[k][j];
}
}
}
}
int main() {
int N, M, R;
cin >> N >> M >> R;
vector<int> r(R);
rep(i, R) cin >> r[i];
rep(i, R) r[i]--;
sort(r.begin(), r.end());
int INF = 1 << 30;
vector<vector<int>> G(N, vector<int>(N, INF));
int A, B, C;
rep(i, M) {
cin >> A >> B >> C;
A--; B--;
G[A][B] = C;
G[B][A] = C;
}
warshall_floyd(N, G, INF);
int cost, ans = INF;
do {
cost = 0;
rep(i, R - 1) cost += G[r[i]][r[i + 1]];
ans = min(ans, cost);
} while (next_permutation(r.begin(), r.end()));
cout << ans << endl;
return 0;
} | 1 | 60,705,964 |
#include <bits/stdc++.h>
using namespace std;
#define Hello ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl '\n'
#define ll long long
int main()
{
Hello
int n;
cin >> n;
int arr[n + 5];
for(int i = 0; i < n; i++) cin >> arr[i];
int search = 1, cntr = 0;
for(int i = 0; i < n; i++){
if(arr[i] == search) search ++;
else cntr++;
}
if(search == 1 && cntr) cout << -1;
else cout << cntr;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int (i) = 0; (i) < (n); i++)
#define ll long long
using namespace std;
int main() {
ll N;
cin >> N;
vector<ll>A(N);
rep(i,N){
cin >> A[i];
}
ll j = 1;
rep(i,N){
if(A[i] == j){
j++;
}
}
if(j == 1){
cout << "-1";
}
else{
cout << N - j + 1;
}
} | 1 | 43,942,411 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A,B,C,D;
cin >> A >> B >> C >> D;
int Left_plate = A+B;
int Right_plate = C+D;
if (Left_plate > Right_plate){
cout << "Left" << endl;
}
else if (Left_plate < Right_plate){
cout << "Right" << endl;
}
else {
cout << "Balanced" << endl;
}
} | #include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;++i)
#include<string>
#include<vector>
using namespace std;
typedef long long ll;
typedef pair<int, int>P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int g[15][15];
const int INF = 1001001001;
const int dx[4] = { -1,0,1,0 };
const int dy[4] = { 0,-1,0,1 };
ll gcd(ll x, ll y) {
return y ? gcd(y, x % y) : x;
}
ll lcm(ll x, ll y) {
if (x == 0 || y == 0)return 0;
return (x / gcd(x, y) * y);
}
vector<pair<ll, int>>factorize(ll n) {
vector<pair<ll, int>>res;
for (ll i = 2;i * i <= n;++i) {
if (n % i)continue;
res.emplace_back(i, 0);
while (n % i == 0) {
n /= i;
res.back().second++;
}
}
if (n != 1)res.emplace_back(n, 1);
return res;
}
vector<ll>relation[20], money(20, 1);
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
if (a + b > c + d)puts("Left");
else if (a + b < c + d)puts("Right");
else {
puts("Balanced");
}
return 0;
} | 1 | 94,709,045 |
#include <bits/stdc++.h>
using namespace std;
#define d(x) cerr << #x ":" << x << endl;
#define dd(x, y) cerr << "(" #x "," #y "):(" << x << "," << y << ")" << endl
#define rep(i, n) for (int i = (int)(0); i < (int)(n); i++)
#define repp(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define all(v) v.begin(), v.end()
#define dump(v) \
cerr << #v ":[ "; \
for (auto macro_vi : v) { \
cerr << macro_vi << " "; \
} \
cerr << "]" << endl;
#define ddump(v) \
cerr << #v ":" << endl; \
for (auto macro_row : v) { \
cerr << "["; \
for (auto macro__vi : macro_row) { \
cerr << macro__vi << " "; \
} \
cerr << "]" << endl; \
}
using lint = long long;
const int INF = 1e9;
const lint LINF = 1e18;
const lint MOD = 1e9 + 7;
const double EPS = 1e-10;
int main() {
int N;
cin >> N;
vector<lint> a(N, 0);
rep(i, N) cin >> a[i];
vector<lint> mi(0);
for (int i = 0; i < N; i++) {
int idx = lower_bound(mi.begin(), mi.end(), a[i]) - mi.begin();
if (idx == mi.size())
mi.push_back(a[i]);
else
mi[idx] = a[i];
}
cout << mi.size() << endl;
return 0;
} | #include <iostream>
#include <algorithm>
using namespace std;
long n, m = 1;
long a[100001], b[100001];
const long INF = 1000000001;
int main()
{
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for(int i = 0; i < n + 1; i++)
b[i] = INF;
for (int i = 0; i < n; i++)
*lower_bound(b, b + n, a[i]) = a[i];
cout << lower_bound(b, b + n, INF) - b << endl;
return 0;
} | 1 | 95,466,756 |
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <cmath>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
int mod = (int) 1e9 + 7;
int main(){
long a, b, c, k;
cin >> a >> b >> c >> k;
if(k <= a){
cout << k << "\n";
return 0;
} else if(k <= a + b){
cout << a << "\n";
return 0;
} else {
cout << (2 * a - k + b) << "\n";
return 0;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x, y) cout << #x << "=" << x << ", " << #y << "=" << y << endl
void solve() {
ll a, b, c, k;
cin >> a >> b >> c >> k;
if ((a + b) >= k) {
cout << ((k >= a) ? a : k) << '\n';
return;
}
ll ans = a - (k - (a + b));
cout << ans << '\n';
}
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
ll test = 1;
while (test--) {
solve();
}
return 0;
} | 1 | 31,772,321 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int SUM(int n){
int sum = 0;
while(n>0){
sum += n%10;
n /= 10;
}
return sum;
}
int main(){
int a,b,n;
cin >> n >> a >> b;
int sum = 0;
int num;
for(int i = 1; i <= n; i++){
num = SUM(i);
if(a <= num && num <= b) sum += i;
}
cout << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
int x = 0;
for (int i = 1; i < N+1; i++) {
int y = 0;
y = i/10000 + (i/1000 - i/10000 * 10) +
(i/100 - i/1000 * 10) + (i/10 - i/100 *10) +
(i - i/10 * 10);
if (y >= A && y <= B)
x += i;
}
cout << x << endl;
} | 1 | 63,461,827 |
#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++)
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
const long long INF = 1LL << 60;
#define PI 3.14159265359
bool dp[100100];
template<typename T>
void remove(std::vector<T>& vector, unsigned int index)
{
vector.erase(vector.begin() + index);
}
int main(){
long long A,B,K;
cin >> A >> B >> K;
if( A <= K ){
K -= A;
B = max((long long) 0,B-K);
cout << 0 <<" " << B <<endl;
}
else{
A -= K;
cout << A << " " << B << endl;
}
} | #include <iostream>
#include <algorithm>
using namespace std;
int main(){
long a, b, k;
cin >> a >> b >> k;
if(a < k) {
b = max(b-(k-a), 0L);
a = 0;
} else {
a = a - k;
}
cout << a << " " << b << endl;
return 0;
} | 1 | 23,585,704 |
#include <iostream>
using namespace std;
int main(void){
string a,b;
cin>>a>>b;
if(a==b){
cout<<"H"<<endl;
}
else if(a=="D"&&b=="H"){
cout<<"D"<<endl;
}
else if(a=="H"&&b=="D"){
cout<<"D"<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#define all(x) (x).begin(), (x).end()
#define endl '\n'
const ll inf = LLONG_MAX;
const long double pi = M_PI;
void Yes() {cout << "Yes" << endl;}
void No() {cout << "No" << endl;}
void YES() {cout << "YES" << endl;}
void NO() {cout << "NO" << endl;}
int main() {
char a, b;
cin >> a >> b;
if (a == b) cout << 'H' << endl;
else cout << 'D' << endl;
} | 1 | 66,622,594 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <functional>
#include <bitset>
using namespace std;
int main()
{
int N,M,X,Y;
cin >> N >> M >> X >> Y;
vector<int> x(N),y(M);
for (int i = 0; i < N; i++) cin >> x[i];
for (int j = 0; j < M; j++) cin >> y[j];
sort(x.begin(), x.end());
sort(y.begin(), y.end());
if(x[N - 1] < y[0] && X < y[0] && Y >= y[0])
{
cout << "No War" << endl;
}
else
{
cout << "War" << endl;
}
} | #include<bits/stdc++.h>
using namespace std;
int n,m,i,j,a,b,c,d,x=0,y=200;
int main()
{
cin>>n>>m>>a>>b;
a+=100;b+=100;
for(;i<n;i++)cin>>c,x=max(x,c+100);
for(i=0;i<m;i++)cin>>d,y=min(y,d+100);
if(min(y,b)-max(x,a)>0)cout<<"No War";
else cout<<"War";
} | 1 | 28,576,283 |
#include<iostream>
#include<vector>
int main(void){
int h, w;
std::cin >> h >> w;
std::vector<std::string> s(h);
for(int i = 0; i < h; i++){
std::cin >> s[i];
}
std::vector<std::vector<int>> da(h, std::vector<int>(w));
for(int i = 0; i < h; i++){
int cnt = 0;
int start = 0;
for(int j = 0; j < w; j++){
if(s[i][j] == '#'){
for(int k = start; k < j; k++){
da[i][k] += cnt;
}
start = j+1;
cnt = 0;
continue;
}else{
cnt++;
if(j == w - 1){
for(int k = start; k <= j; k++){
da[i][k] += cnt;
}
}
}
}
}
for(int i = 0; i < w; i++){
int cnt = 0;
int start = 0;
for(int j = 0; j < h; j++){
if(s[j][i] == '#'){
for(int k = start; k < j; k++){
da[k][i] += cnt;
}
start = j + 1;
cnt = 0;
continue;
}else{
cnt++;
if(j == h - 1){
for(int k = start; k <= j; k++){
da[k][i] += cnt;
}
}
}
}
}
int max = 0;
for(int i = 0; i < h; i++){
for(int j = 0; j < w; j++){
max = std::max(max, da[i][j]);
}
}
std::cout << max - 1<< std::endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
const int M = 1e7;
int si[] = {-1, 0, 1, 0};
int sj[] = {0, -1, 0, 1};
int main(){
int h, w;
cin >> h >> w;
vector<string> s(h);
rep(i,h) cin >> s[i];
vector<vector<int>> l(h,vector<int>(w,0)), r(h,vector<int>(w,0));
vector<vector<int>> t(h,vector<int>(w,0)), b(h,vector<int>(w,0));
rep(i,h) {
int c = 0;
rep(j,w) {
if (s[i][j] == '#') {
l[i][j] = 0;
c = 0;
} else {
l[i][j] = c;
c++;
}
}
}
rep(i,h) {
int c = 0;
rep(j,w) {
if (s[i][w-j-1] == '#') {
r[i][w-j-1] = 0;
c = 0;
} else {
r[i][w-j-1] = c;
c++;
}
}
}
rep(j,w) {
int c = 0;
rep(i,h) {
if (s[i][j] == '#') {
t[i][j] = 0;
c = 0;
} else {
t[i][j] = c;
c++;
}
}
}
rep(j,w) {
int c = 0;
rep(i,h) {
if (s[h-i-1][j] == '#') {
b[h-i-1][j] = 0;
c = 0;
} else {
b[h-i-1][j] = c;
c++;
}
}
}
int ans = 0;
rep(i,h) rep(j,w) {
if (s[i][j] != '#') ans = max(ans, t[i][j]+b[i][j]+l[i][j]+r[i][j]+1);
}
cout << ans << endl;
return 0;
} | 1 | 73,524,392 |
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
int main()
{
ll n,i,j,k,c=1,x=1,t;
string s;
cin>>s;
for(i=0;i<s.size();i++)
if(s[i]=='7')
{
cout<<"Yes";return 0;
}
cout<<"No";
} | #include <stdio.h>
int main() {
int n;
scanf("%d", &n);
bool t = false;
while (n) {
if (n % 10 == 7) t = true;
n /= 10;
}
printf("%s\n", t?"Yes":"No");
return 0;
} | 1 | 29,928,445 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
int n, k;
cin >> n >> k;
vector<int> a(200000);
int nums = 0;
for (int i=0; i<n; i++) {
int num;
cin >> num;
a.at(num-1)++;
}
sort(a.begin(), a.end());
for (int i=0; i<a.size(); i++) {
if (a.at(i) != 0) nums++;
}
int index = 0;
int ans = 0;
while (nums > k) {
if (a.at(index) == 0) {
index++;
continue;
}
nums--;
ans += a.at(index);
index++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
using P = pair<ll, ll>;
using V = vector<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 rep2(i, m, n) for(ll i=m;i<(ll)(n);i++)
#define rrep(i, n, m) for(ll i=n;i>=(ll)(m);i--)
#define ALL(obj) (obj).begin(), (obj).end()
#define MOD 1000000007
#define INF 1000000000
void solve_abc_c() {
ll n, k;
ll ans = 0;
cin >> n >> k;
map<ll, ll> m;
V a(n);
rep(i, n) {
cin >> a[i];
m[a[i]]++;
}
V val;
for (auto p : m) {
val.push_back(p.second);
}
sort(ALL(val));
rep(i, m.size() - k) {
ans += val[i];
}
cout << ans << "\n";
}
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
solve_abc_c();
return 0;
} | 1 | 75,472,140 |
#include <bits/stdc++.h>
#define REP(i, e) for(int (i) = 0; (i) < (e); ++(i))
#define FOR(i, b, e) for(int (i) = (b); (i) < (e); ++(i))
#define ALL(c) (c).begin(), (c).end()
#define PRINT(x) cout << (x) << "\n"
using namespace std;
using ll = long long; using pint = pair<int, int>; using pll = pair<ll, ll>;
template<typename T> auto compare = [](T x, T y) -> bool{return (x < y);};
const int MOD = 1000000007;
int N, M, R, A[40000], B[40000], r[10];
ll C[40000], dist[201][201];
ll ans = LONG_LONG_MAX / 2;
void floyd(){
REP(k, N){
REP(i, N){
REP(j, N){
dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
}
}
}
}
void solve(int depth, int index, int state, ll value){
if(depth == R){
ans = min(ans, value);
}
REP(i, R){
if((1 << i) & state) continue;
solve(depth + 1, r[i], state | (1 << i), value + dist[index][r[i]]);
}
}
signed main(){
cin >> N >> M >> R;
REP(i, R){
cin >> r[i];
r[i]--;
}
REP(i, N) REP(j, N) dist[i][j] = LONG_LONG_MAX / 2;
REP(i, M){
cin >> A[i] >> B[i] >> C[i];
A[i]--; B[i]--;
dist[A[i]][B[i]] = dist[B[i]][A[i]] = C[i];
}
floyd();
REP(i, R) solve(1, r[i], 1 << i, 0);
PRINT(ans);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long LL;
typedef long double ld;
typedef vector<ll>VI;
typedef pair<ll,ll>P;
#define VV(T) vector<vector<T>>
#define sz(x) int(x.size())
#define PI 3.1415926535897932384626433832795
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
#define reprev(i,n) for (ll i=(ll)n-1;i>=0;i--)
#define ALL(a) (a).begin(),(a).end()
#define rALL(a) (a).rbegin(),(a).rend()
#define c_max(a, b) (((ll)a)>((ll)b)?(a):(b))
#define c_min(a,b) (((ll)a)<((ll)b)?(a):(b))
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define vmax(v) *max_element(ALL(v))
#define vmin(v) *min_element(ALL(v))
#define $(x) {cout<<#x<<" = " <<(x)<<endl;}
#define fi first
#define se second
#define MAX 100100
#define MAX2 200100
#define MAX6 1001001
#define MAX7 10010010
#define SENTINEL 2000000000
#define INF 1<<30
#define INFTY 1LL<<61
#define MAX_INT INT_MAX
#define Endl '\n'
#define CLR(mat) memset(mat, 0, sizeof(mat))
inline ll GCD(ll a,ll b){return b?GCD(b,a%b):a;}
inline ll lcm(ll a,ll b){return a*b/GCD(a,b);}
template<class T> bool contain(const std::string& s, const T& v) {
return s.find(v) != std::string::npos;
}
const int MOD = 1000000007;
const int MAX_V=210;
ll d[MAX_V][MAX_V];
int V;
void worshall_floyd(){
for(int k=0;k<V;k++){
for(int i=0;i<V;i++){
for(int j=0;j<V;j++)d[i][j]=min(d[i][j],d[i][k]+d[k][j]);
}
}
}
int main(){
int n,m,r;
cin>>n>>m>>r;
V=n;
VI R(r);
rep(i,r){cin>>R[i];R[i]--;}
sort(ALL(R));
rep(i,n)rep(j,n)d[i][j]=INFTY;
rep(i,n)d[i][i]=0;
rep(i,m){
ll a,b,c;cin>>a>>b>>c;
a--;b--;
d[a][b]=c;
d[b][a]=c;
}
worshall_floyd();
ll ans=INFTY;
do{
ll sum=0;
rep(i,r-1)sum+=d[R[i]][R[i+1]];
chmin(ans,sum);
}while(std::next_permutation(ALL(R)));
cout<<ans<<endl;
} | 1 | 33,208,609 |
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <complex>
#include <cstring>
#include <cstdlib>
#include <string>
#include <cmath>
#include <map>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)n;++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()
const int INF = 1<<29;
int main() {
int n;
while(cin >> n, n) {
map<char, char> mp;
REP(i,n) {
char a,b;
cin >> a >> b;
mp[a] = b;
}
int m;
cin >> m;
string s;
REP(i,m) {
char a;
cin >> a;
if (mp[a])
s += mp[a];
else
s += a;
}
cout << s << endl;
}
} | #include<iostream>
#include<vector>
#include<utility>
#include<algorithm>
using namespace std;
int main() {
int n;
while (true) {
cin >> n;
if (n == 0) {
break;
}
vector<pair<char, char>> table(n);
for (auto& temp : table) {
cin >> temp.first >> temp.second;
}
int m;
cin >> m;
for (int i = 0; i < m; ++i) {
char temp;
cin >> temp;
auto it = find_if(table.begin(), table.end(), [temp](pair<char, char> a) {return a.first == temp;});
if (it == table.end()) {
cout << temp;
}
else {
cout << it->second;
}
}
cout << endl;
}
return 0;
} | 1 | 1,337,570 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#define MOD 1000000007
typedef long long ll;
using namespace std;
int main(){
int W,H;
cin>>W>>H;
vector<pair<ll,bool>> v;
for(int i=0;i<W;i++){
ll p;
cin>>p;
v.push_back(make_pair(p,true));
}
for(int i=0;i<H;i++){
ll q;
cin>>q;
v.push_back(make_pair(q,false));
}
sort(v.begin(),v.end());
ll ans=0;
ll w=W+1,h=H+1;
for(int i=0;i<v.size();i++){
if(v[i].second==true){
ans=ans+h*v[i].first;
w--;
}else{
ans=ans+w*v[i].first;
h--;
}
}
cout<<ans<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
int main(){
ll W,H; cin >> W >> H;
priority_queue<P,vector<P> ,greater<P>> Q;
for(ll i = 0; i < W; i++){
ll p; cin >> p;
Q.push({p,0});
}
for(ll j = 0; j < H; j++){
ll q; cin >> q;
Q.push({q,1});
}
ll ans = 0;
ll cnt = 0;
ll a = W+1,b = H+1;
while( cnt <= (W+1)*(H+1)-1 && !Q.empty()){
P p = Q.top(); Q.pop();
if( p.second == 1){ ans += p.first*a; cnt += a; b--;}
else{ ans += p.first*b; cnt += b; a--;}
}
cout << ans << endl;
return 0;
} | 1 | 59,914,467 |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int a;
int b;
int c;
void input() {
cin >> a;
cin >> b;
cin >> c;
}
int main() {
input();
if(a < b && b < c){
cout << "Yes" << endl;
} else{
cout << "No" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
cout<<((a<b&&b<c)?"Yes\n":"No\n");
} | 1 | 90,695,927 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define MOD 1000000007
#define ll long long
#define int long long
#define INF 1e18
#define ar array
#define MAX 1000004
#define wt(x) int x;cin>>x;while(x--)
typedef tree<pair<int,int>,null_type,less<pair<int,int>>,rb_tree_tag,tree_order_statistics_node_update> pbds;
void c_p_c(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input1.txt","r",stdin);
freopen("output1.txt","w",stdout);
#endif
}
ll power(ll a,ll b,int mod){
a=a%mod;
if(a==0){
return 1;
}
ll res=1;
while(b){
if(b&1){
res=(res*a)%mod;
}
b>>=1;
a=(a*a)%mod;
}
return res;
}
int32_t main() {
c_p_c();
int h1,m1,h2,m2,k;
cin>>h1>>m1>>h2>>m2>>k;
int tot1=(h1*60)+m1;
int tot2=(h2*60)+m2;
int rem=tot2-k;
cout<<abs(tot1-rem)<<"\n";
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <math.h>
#define ll long long int
#define mod 1000000007
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
int t;
if(a == c)
t = abs(b - d);
else if(a > c){
if(b >= d)
t = (24 - (a - c))*60 + (b - d);
else
t = (24 - ((a - 1) - c))*60 + 60 - (d - b);
}
else if( c > a){
if(d >= b)
t = (c -a)*60 + d -b;
else
t = (c - 1 - a)*60 + 60 - (b - d);
}
cout << t - e ;
} | 1 | 65,541,141 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=105+5,M=1e6+5,inf=0x3f3f3f3f,mod=1e9+7;
#define mst(a) memset(a,0,sizeof a)
#define lx x<<1
#define rx x<<1|1
#define reg register
#define PII pair<int,int>
#define fi first
#define se second
int a[N];
int main(){
int n;
cin>>n;
for(int i=1;i<=n;i++) scanf("%d",&a[i]);
int ans=1e9;
for(int i=-100;i<=100;i++){
int sum=0;
for(int j=1;j<=n;j++){
sum+=(i-a[j])*(i-a[j]);
}
ans=min(ans,sum);
}
cout<<ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
using vi = vector<int64_t>;
using vvi = vector<vi>;
using ll = int64_t;
using P = pair<ll,ll>;
ll INF = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
vi a(n);
rep(i,n) cin >> a.at(i);
ll res = INF;
for(ll i=-100; i<=100; i++){
ll pres = 0;
rep(j,n){
pres += (a.at(j)-i)*(a.at(j)-i);
}
res = min(res,pres);
}
cout << res << endl;
} | 1 | 69,816,315 |
#include <stdio.h>
int main (){
char name1[105];
char name2[105];
scanf("%s%s",&name1,&name2);
printf("%s%s\n",name2,name1);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (long long i = 0; i < N; i++)
using ll = long long;
void solve(std::string S, std::string T) { cout << T + S << endl; }
int main() {
std::string S;
std::cin >> S;
std::string T;
std::cin >> T;
solve(S, T);
return 0;
} | 1 | 49,577,111 |
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#include<algorithm>
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
ll gcd(ll a,ll b){
if(b == 0) return a;
return gcd(b , a % b);
}
const ll MOD = 1000000007;
const ll MAX = 2000001;
ll mod(ll a){
return a % MOD;
}
ll lcm(ll a,ll b){
return (a*b)/gcd(a,b);
}
ll fac[MAX], finv[MAX], inv[MAX];
void nCrprep() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll nCr(ll n, ll r){
if (n < r) return 0;
if (n < 0 || r < 0) return 0;
return fac[n] * (finv[r] * finv[n - r] % MOD) % MOD;
}
ll nCrcheep(ll n,ll r){
if(r == 0) return 1;
else if(r == 1) return n;
else return nCrcheep(n-1,r-1)*n/r;
}
vector<pair<ll,ll>> prime_factorize(ll n){
vector<pair<ll,ll>> res;
for(ll i=2; i*i <= n; i++){
if(n % i != 0) continue;
ll ex = 0;
while(n % i == 0){
ex++;
n /= i;
}
res.push_back({i,ex});
}
if(n != 1) res.push_back({n,1});
return res;
}
int main(){
ll n; cin >> n;
vl sum(n+1);
rep(i,n){
ll x; cin >> x;
sum[i+1] = sum[i] + x;
}
ll ans = 1e10;
for(ll i=1; i <= n; i++){
ans = min(ans,abs(sum[n]-2*sum[i]));
}
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(12);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";newl;
#define all(x) (x).begin(),(x).end()
#define mset(x,val) memset(x,val,sizeof(x))
#define newl cout<<"\n"
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define dline cerr<<"
#define deb1(x) cerr<<#x<<" = "<<x<<'\n';
#define deb2(x,y) cerr<<'['<<#x<<','<<#y<<"] = "<<'['<<x<<','<<y<<']'<<'\n';
#define deb3(x,y,z) cerr<<'['<<#x<<','<<#y<<','<<#z<<"] = "<<'['<<x<<','<<y<<','<<z<<']'<<'\n';
typedef long long ll;
typedef long double ld;
typedef vector<ll> vll;
typedef pair<ll , ll> pll;
typedef pair<ld, ld> pld;
typedef unordered_map<ll, ll> um;
typedef vector<pll> vpll;
const ll MAX5 = 1e+5 + 7;
const ll MAX7 = 1e+7 + 7;
const ll MAXN = MAX7;
const ll INF = 0x7f7f7f7f7f7f7f7f;
const int INFi = 0x7f7f7f7f;
const ll MOD = 1e+9 + 7;
int dx4[] = {0, 1, 0, -1}, dy4[] = {1, 0, -1, 0};
ll T = 1;
ll n, m, x, y, q, k;
string s, t;
bool comp(pll &a , pll &b) {
if(a.s == b.s) return a.f > b.f;
return a.s > b.s;
}
void MAIN() {
cin>>n;
vll a(n),pre(n),suf(n);
for(ll i=0;i<n;i++) {
cin>>a[i];
}
pre[0] = a[0];
suf[n-1] = a[n-1];
for(ll i=1;i<n;i++) pre[i] = pre[i-1] + a[i];
for(ll i=n-2;i>=0;i--) suf[i] = suf[i+1] + a[i];
ll mini = INF;
for(ll i=0;i<n-1;i++) {
mini = min(mini, abs(pre[i] - suf[i+1]));
}
cout<<mini;
}
int main() {
fastio; randomINT;
while (T--) {
MAIN();
}
return 0;
} | 1 | 9,432,421 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define printVec(v) printf("{"); for (const auto& i : v) { std::cout << i << ", "; } printf("}\n");
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
using namespace std;
using P = pair<int,int>;
using ll = long long;
const ll INF = 1LL<<60;
const double PI = 3.1415926535897932;
const int MOD = 1e9 + 7;
int main() {
int l, r;
cin >> l >> r;
ll ans = INF;
if (r - l + 1 >= 2019) {
cout << 0 << endl;
return 0;
} else {
for (ll i = l; i <= r - 1; i++) {
for (ll j = i + 1; j <= r; j++) {
ans = min(ans, i * j % 2019);
}
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define FOR(i,a,b) for(int i=(a); i<=(b); i++)
#define rep(i,n) for(int i = 0; i < (n); i++)
#define loop(k) rep(author_is_masa,k)
#define chmin(a,b) if((a)>(b)) (a)=(b);
#define chmax(a,b) if((a)<(b)) (a)=(b);
#define vi vector<int>
#define pii pair<int,int>
#define all(v) (v).begin(),(v).end()
#define allr(v) (v).rbegin(),(v).rend()
#define pb push_back
#define pf push_front
int gcd(int a,int b){
while(min(a,b)>0){if(a<b)swap(a,b);a%=b;}return max(a,b);
}
int dx[]={1,0,-1,0,1,-1,-1,1};
int dy[]={0,1,0,-1,1,1,-1,-1};
const int MOD = 1e9+7;
const long long INF = 1e18+10;
signed main(){
int l,r;
cin>>l>>r;
int ans=INF;
if(l/2019+1==(r+2018)/2019){
for(int i=l;i<r;i++){
for(int j=i+1;j<=r;j++){
chmin(ans,(i*j)%2019);
}
}
cout<<ans<<endl;
}else{
cout<<0<<endl;
}
return 0;
} | 1 | 51,832,314 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
int N;
double sum_A = 0,sum_B = 1;
cin >> N;
int data[N];
for(int i=0;i<N;i++){
cin >> data[i];
sum_B *= data[i];
}
for(int i=0;i<N;i++){
sum_A += (sum_B / data[i]);
}
printf("%.16f\n",1 / (sum_A / sum_B));
} | #include <stdio.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <cmath>
#include <string>
#include<math.h>
#include<sstream>
#define rep(i,n) for(int i=0;i<n;i++)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define Cout(s) cout<<s<<endl
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
string Yes(bool b) { if (b) { return "Yes"; } else { return "No"; } }
string YES(bool b) { if (b) { return "YES"; } else { return "NO"; } }
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
int a = 1, b = 0, c, d, n, k = 0, ans = 0;
string s, t;
int mod = 1000000007;
int main()
{
int n; cin >> n;
vector<double> a(n); rep(i, n)cin >> a[i];
int LCM=1;
rep(i, n) { LCM = lcm(LCM, a[i]); }
double sum = 0; rep(i, n) { sum += LCM / a[i]; }
printf("%.8f\n", LCM/sum);
return 0;
} | 1 | 70,808,881 |
#include <iostream>
#include <string>
#include <algorithm>
#include <ctime>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <cassert>
#include <bitset>
#include <list>
#include <cstdio>
#include <stdio.h>
#include <string.h>
#include <limits.h>
#include <math.h>
#include <cmath>
#include <tuple>
#include <cassert>
#include <array>
#include <iomanip>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using ti = tuple<int, int, int>;
#define REP(i,m,n) for(int i=(m); i<(n); i++)
#define RREP(i,n,m) for(int i=(n);i>=(m); i--)
#define pb push_back
#define mp make_pair
#define debug(x) cerr << #x << ": " << x << endl
const double eps=1e-14;
const int mod = 1e9 + 7;
const int inf = ((1<<30)-1);
const ll linf = (1LL<<60);
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
int a[n];
REP(i,0,n) cin >> a[i];
REP(i,0,n) a[i] -= i+1;
sort(a,a+n);
int b = a[(n+1)/2-1];
ll ans = 0;
REP(i,0,n) ans += abs(a[i]-b);
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rep2(i,n) for(ll i=1;i<=(n);i++)
#define rep3(i,i0,n) for(ll i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
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; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}
#define all(x) x.begin(), x.end()
#define mp make_pair
bool compare(Pi a, Pi b) {
if(a.first != b.first){
return a.first < b.first;
}else{
return a.second < b.second;
}
}
bool In_map(ll y,ll x,ll h,ll w){
if(y<0 || x<0 || y>=h || x>=w){
return 0;
}else{
return 1;
}
}
const vector<ll> dx{1,0,-1,0};
const vector<ll> dy{0,1,0,-1};
int main() {
ll N;
cin >>N;
vector<ll>A(N);
vector<ll>B(N);
ll sum=0;
rep(i,N){
cin>>A[i];
B[i]=A[i]-i-1;
}
sort(all(B));
ll ans1 = 0;
ll b1 = B[N/2];
rep(i,N){
ans1+=abs(A[i]-b1-i-1);
}
cout << ans1 << endl;
return 0;
} | 1 | 22,248,948 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int n;
while(cin >> n, n != 0) {
vector<int> v(n);
for(int i = 0; i < n; ++i) {
cin >> v[i];
}
sort(v.begin(), v.end());
int ans = 0;
for(int i = 1; i < n - 1; ++i) {
ans += v[i];
}
cout << ans / (n - 2) << endl;
}
return 0;
} | #include <iostream>
#include <algorithm>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
int t[n];
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> t[i];
sum += t[i];
}
sort(t, t + n);
cout << (sum - t[0] - t[n - 1]) / (n - 2) << endl;
}
} | 1 | 95,693,578 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define rep2(i,n) for(int i=0;i<=n;i++)
#define repr(i,a,n) for(int i=a;i<n;i++)
#define all(a) a.begin(),a.end()
#define P pair<long long,long long>
#define uni(e) e.erase(unique(e.begin(),e.end()),e.end())
#define double long double
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int INF=1e10;
int MOD=1e9+7;
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void noyes(T b){if(b)out("no");else out("yes");}
template<class T> void NoYes(T b){if(b)out("No");else out("Yes");}
template<class T> void NOYES(T b){if(b)out("NO");else out("YES");}
int keta(int a){
double b=a;
b=log10(b);
int c=b;
return c+1;
}
int kurai(int a,int b){
int m=pow(10,b),n=pow(10,b-1);
return (a%m)/n;
}
int ketawa(int a){
int k=0;
rep(i,keta(a)){
k+=kurai(a,i+1);
}
return k;
}
int gcd(int a,int b){
if(a%b==0)
return b;
return gcd(b,a%b);
}
int lcm(int a,int b){
return a/gcd(a,b)*b;
}
int mid(int a,int b,int c){
vector<int> k(3);
k[0]=a;k[1]=b;k[2]=c;
sort(all(k));
return k[1];
}
bool sosuu(int a){
bool b=1;
if(a<=1)
return 0;
else{
rep1(i,sqrt(a)-1){
if(a%(i+1)==0)
b=0;
}
return b;
}
}
int modpow(int a,int b,int m=MOD){
if(!b)return 1; if(b&1)return modpow(a,b-1,m)*a%m;
int memo = modpow(a,b>>1,m);
return memo*memo%m;
}
int fact_mod(int n) {
int f=1;
for(int i=2;i<n+1;i++) f=f*(i%MOD)% MOD;
return f;
}
int mod_pow(int x,int n) {
int res=1;
while(n>0){
if(n&1) res=(res*x)%MOD;
x=(x*x)%MOD;
n>>=1;
}
return res;
}
int c_mod(int n, int r) {
if(r>n-r) r=n-r;
if(r==0) return 1;
int a=1;
rep(i,r)
a=a*((n-i)%MOD)%MOD;
int b=mod_pow(fact_mod(r), MOD-2);
return (a%MOD)*(b%MOD)%MOD;
}
signed main(){
vector<double> a(5);
rep(i,5)
cin>>a[i];
int b=0;
rep(i,5){
a[i]/=10;
b+=ceil(a[i])*10;
a[i]*=10;
}
int c=INF;
vector<int> d(5);
rep(i,5){
d[i]=a[i];
}
rep(i,5){
if(!(d[i]%10==0))
c=min(c,d[i]%10);
}
if(c==INF){
c=0;
b+=10;
}
b+=c;
b-=10;
out(b);
} | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
int64_t MOD=1000000007;
int main() {
int ans=0;
vector<int> S;
for(int i=0;i<5;i++){
int a;
cin>>a;
if(a%10!=0){
S.push_back(a%10);
a+=10-(a%10);
}
ans+=a;
a%=10;
}
if(S.size()!=0){
sort(S.begin(),S.end());
cout<<ans-10+S.at(0);
}
else cout<<ans;
} | 1 | 26,378,834 |
#include <bits/stdc++.h>
typedef long long ll;
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++)
#define invrepr(i,a,b) for(int i=b-1;i>=a;i--)
#define invrep(i,n) invrepr(i,0,n)
#define repitr(itr,a) for(auto itr=a.begin();itr!=a.end();++itr)
#define P pair<int,ll>
const ll MOD=998244353;
const int INF=1e9;
const double PI=acos(-1);
int main() {
ios_base::sync_with_stdio(false);
int d;
cin >> d;
cout << "Christmas";
rep(i,25-d) cout << " Eve";
cout << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<int(n);i++)
#define rep1(i,n) for(int i=1;i<=int(n);i++)
#define per(i,n) for(int i=int(n)-1;i>=0;i--)
#define per1(i,n) for(int i=int(n);i>0;i--)
#define foreach(i,n) for(auto &&i:n)
#define all(x) (x).begin(),(x).end()
#define SORT(x) sort(all(x))
#define GSORT(x) sort(all(x), greater<int>())
#define REV(x) reverse(all(x))
#define MAX(x) *max_element(all(x))
#define MIN(x) *min_element(all(x))
#define LOWitr(x, n) lower_bound(all(x), n)
#define UPRitr(x, n) upper_bound(all(x), n)
#define cii(x) int x;cin >> x
#define cill(x) LL x;cin >> x
#define cis(x) string x;cin >> x
#define co(x) cout << x << endl
#define dump(x) cout << #x << " = " << (x) << endl
#define truecheck assert
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define fastcin() cin.tie(0);ios::sync_with_stdio(false)
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef long long int64;
template<class T,class U>bool chmax(T &a, const U &b) { if (a<b) { a=b; return true; } return false; }
template<class T,class U>bool chmin(T &a, const U &b) { if (b<a) { a=b; return true; } return false; }
const int INF = 1e9, MOD = 1e9 + 7;
const LL LLINF = 1e16;
int main() {
fastcin();
cout << fixed << setprecision(10);
cii(d);
string ans;
if (d==25)
ans = "Christmas";
if (d==24)
ans = "Christmas Eve";
if (d==23)
ans = "Christmas Eve Eve";
if (d==22)
ans = "Christmas Eve Eve Eve";
co(ans);
return 0;
} | 1 | 68,714,469 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MAX = (int)(1e5 + 5);
const ll INF = (ll)(1e10 + 5);
const int MAX_M = (int)(2e5 + 5);
int m;
ll d[MAX_M];
ll c[MAX_M];
int main(void) {
scanf("%d", &m);
for (int i = 0; i < m; ++i) {
scanf("%lld %lld", &(d[i]), &(c[i]));
}
ll whole = 0LL;
for (int i = 0; i < m; ++i) {
whole += d[i] * c[i];
}
ll digit = 0LL;
for (int i = 0; i < m; ++i) {
digit += c[i];
}
ll ans = (digit - 1LL) + (whole - 1LL) / 9LL;
printf("%lld\n", ans);
return 0;
} | #include <iostream>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
ll s=0, t=0;
for(int i=0; i<n; i++) {
ll x,y;
cin >> x >> y;
s += x*y;
t += y;
}
ll k=s%9;
if(k==0) k=9;
cout << t-1+(s-k)/9 << endl;
} | 1 | 38,315,837 |
#include <cmath>
#include <cstdio>
#include <cctype>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#define N 200005
#define gc getchar
using namespace std;
inline int rd() {
int x = 0;
bool f = 0;
char c = gc();
while (!isdigit(c)) {
if (c == '-') f = 1;
c = gc();
}
while (isdigit(c)) {
x = x * 10 + (c ^ 48);
c = gc();
}
return f ? -x : x;
}
int n, tot, hd[N];
struct edge {int to, nxt;} e[N << 1];
inline void add(int u, int v) {
e[++tot].to = u; e[tot].nxt = hd[v]; hd[v] = tot;
e[++tot].to = v; e[tot].nxt = hd[u]; hd[u] = tot;
}
int dfs(int u, int fa) {
int len = 0;
for (int i = hd[u], v; i; i = e[i].nxt)
if ((v = e[i].to) != fa) len = len ^ (dfs(v, u) + 1);
return len;
}
int main() {
n = rd();
for (int i = 1; i < n; ++i) add(rd(), rd());
puts(dfs(1, 0) ? "Alice" : "Bob");
return 0;
} | #include<cstdio>
#include<algorithm>
using namespace std;
#define MAXN 100010
int Adj[MAXN],V[MAXN*2],nxt[MAXN*2],c,n;
void AddEdge(int u,int v)
{
c++;V[c]=v,nxt[c]=Adj[u];Adj[u]=c;
}
int dfs(int u,int p)
{
int ret=0;
for(int i=Adj[u];i;i=nxt[i])
if(V[i]!=p)
{
ret^=dfs(V[i],u)+1;
}
return ret;
}
int main()
{
scanf("%d",&n);
for(int i=1;i<n;i++)
{
int u,v;
scanf("%d%d",&u,&v);
AddEdge(u,v);
AddEdge(v,u);
}
int ans=dfs(1,0);
if(ans) printf("Alice\n");
else printf("Bob\n");
} | 1 | 100,299,725 |
#include<iostream>
using namespace std;
long long rgb_triplets(int n, string s) {
if(n<3)
return 0;
long long r_count = 0;
long long g_count = 0;
long long b_count = 0;
for(int i=0;i<n;i++) {
if(s[i] == 'R')
r_count++;
if(s[i] == 'G')
g_count++;
if(s[i] == 'B')
b_count++;
}
long long ans = r_count * g_count * b_count;
for(long long i=0;i<n-1;i++) {
for(long long k=i+1;k<n;k++) {
if((k+i) % 2 != 0)
continue;
long long j = (k+i) / 2;
if(s[i] != s[j] && s[j] != s[k] && s[i] != s[k])
ans--;
}
}
return ans;
}
int main() {
int n;
string s;
cin >> n;
cin >> s;
cout << rgb_triplets(n, s);
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i,a,b) for(ll i=a;(i)<(b);++(i))
#define RFOR(i,a,b) for(ll i=a;(i)>=(b);--(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 UNIQ(v) sort(ALL(v)); v.erase(unique(ALL(v)), v.end())
#define BIT(n) (1LL<<(n))
#define DEBUG(a) cerr << #a << " = " << a << endl
const double PI = acos(-1);
const int inf = 1001001001;
const int mod = (int)1e9+7;
int dy[] = {0, 0, 1, -1};
int dx[] = {1, -1, 0, 0};
int main() {
int N;
string S;
cin >> N >> S;
ll R = 0, G = 0, B = 0;
REP(i, N) {
if (S[i] == 'R') ++R;
if (S[i] == 'G') ++G;
if (S[i] == 'B') ++B;
}
ll ans = R*G*B;
REP (i, N) {
FOR (j, i, N) {
int k = 2 * j - i;
if (k < N) {
if (S[i] == S[j]) continue;
if (S[j] == S[k]) continue;
if (S[i] == S[k]) continue;
ans--;
}
}
}
cout << ans << endl;
} | 1 | 15,834,344 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, a, b) for(int i = a, i##_len = (b); i < i##_len; ++i)
int main()
{
int N,A,B;
scanf("%d %d %d", &N, &A, &B);
int num[3] = {0,0,0};
for(int i = 0; i < N; ++i) {
int p;
scanf("%d", &p);
if(p <= A) ++num[0];
else if(p <= B) ++num[1];
else ++num[2];
}
int res = min(num[0], min(num[1], num[2]));
printf("%d\n", res);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int a[100500];
int main(){
int n, b, c, sum = 0, m = 0, l = 0, k = 0;
cin >> n >> b >> c;
for(int i = 0;i < n;i++){
cin >> a[i];
}
for(int i = 0;i < n;i++){
if (a[i] <= b){
m++;
}
else if (a[i] > b && a[i] <= c){
l++;
}
else if(a[i] > c){
k++;
}
}
cout << min(m, min(k, l));
return 0;
} | 1 | 86,054,989 |
#include <bits/stdc++.h>
using namespace std;
#define db(x) cerr << #x << "=" << x << endl
#define db2(x, y) cerr << #x << "=" << x << "," << #y << "=" << y << endl
#define db3(x, y, z) cerr << #x << "=" << x << "," << #y << "=" << y << "," << #z << "=" << z << endl
#define dbv(v) cerr << #v << "="; for (auto _x : v) cerr << _x << ", "; cerr << endl
#define dba(a, n) cerr << #a << "="; for (int _i = 0; _i < (n); ++_i) cerr << a[_i] << ", "; cerr << endl
template <typename A, typename B>
ostream& operator<<(ostream& os, const pair<A, B>& x) {
return os << "(" << x.first << "," << x.second << ")";
}
typedef long long ll;
typedef long double ld;
int main() {
int a, b, c, k, need = 0;
scanf("%d%d%d%d", &a, &b, &c, &k);
while (b <= a) {
b *= 2;
++need;
}
while (c <= b) {
c *= 2;
++need;
}
printf(need <= k ? "Yes\n" : "No\n");
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
int a,b,c,k;
int main(void){
cin>>a>>b>>c>>k;
while(k--){
if(a>=b){
b=b*2;
}else if(b>=c){
c=c*2;
}
}
if(a<b&&b<c){
cout<<"Yes"<<endl;
}else{
cout<<"No"<<endl;
}
} | 1 | 61,546,320 |
#include <bits/stdc++.h>
using namespace std;
#include<cstdlib>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
typedef long long ll;
int main(){
int n,y;
cin >> n >> y;
rep(i,n+1){
rep(j,n-i+1){
int k = n-i-j;
if(k<0)continue;
if(10000*i+5000*j+1000*k==y) {
cout << i << " " << j << " " << k;
return 0;
}
}
}
cout << "-1 -1 -1";
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n, y;
cin >> n >> y;
y /= 1000;
rep(i,y) rep(j,y) {
int k = y - (10 * i + 5 * j);
if (0 <= k && i+j+k == n) {
printf("%d %d %d\n", i, j, k);
return 0;
}
}
cout << "-1 -1 -1" << endl;
return 0;
} | 1 | 93,510,057 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define ll long long
#define _GLIBCXX_DEBUG
const ll MOD = 1000000007;
const ll Mod = 998244353;
const int MAX = 510000;
const double PI = 3.14159265358979;
const vector<int> dx = {1, 0};
const vector<int> dy = {0, 1};
ll gcd(ll m, ll n) {
if (n==0) return abs(m);
else return gcd(n, m%n);
}
int main() {
int N, K;
cin >> N >> K;
vector<int> A(N);
for (int i=0; i<N; i++) cin >> A[i];
ll g = A[0];
for (int i=1; i<N; i++) g = gcd(g, A[i]);
if (K%g!=0) {
cout << "IMPOSSIBLE" << endl;
return 0;
}
if (K>*max_element(A.begin(), A.end())) {
cout << "IMPOSSIBLE" << endl;
return 0;
}
cout << "POSSIBLE" << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
long long g=0,n,a,mx=0,k;
cin>>n>>k;
for(int i=0;i<n;i++){
cin>>a;
mx=max(mx,a);
g=__gcd(g,a);
}
if(k>mx){
cout<<"IMPOSSIBLE";
}
else{
if(k%g==0){
cout<<"POSSIBLE";
}
else{
cout<<"IMPOSSIBLE";
}
}
} | 1 | 49,786,212 |
#include <iostream>
#include <vector>
#include <string>
using namespace std;
int main() {
int h, w; cin >> h >> w;
vector<string> s(h);
for (int i = 0; i < h; i++)
cin >> s[i];
vector<vector<int> > a(h, vector<int>(w, 0)), b(h, vector<int>(w, 0)), c(h, vector<int>(w, 0)), d(h, vector<int>(w, 0));
for (int i = 0; i < h; i++) {
for (int j = 1; j < w; j++) {
if (s[i][j-1] == '.')
a[i][j] = a[i][j-1]+1;
}
}
for (int i = 0; i < h; i++) {
for (int j = w-2; j >= 0; j--) {
if (s[i][j+1] == '.')
b[i][j] = b[i][j+1] + 1;
}
}
for (int i = 1; i < h; i++) {
for (int j = 0; j < w; j++) {
if (s[i-1][j] == '.')
c[i][j] = c[i-1][j] + 1;
}
}
for (int i = h-2; i >= 0; i--) {
for (int j = 0; j < w; j++) {
if (s[i+1][j] == '.')
d[i][j] = d[i+1][j] + 1;
}
}
long long ans = 0;
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
if (s[i][j] == '.')
ans = max(ans, (long long)(a[i][j]+b[i][j]+c[i][j]+d[i][j]+1));
}
}
cout << ans << endl;
return 0;
} | #include<iostream>
#include<iomanip>
#include<cstdio>
#include<algorithm>
#include<cassert>
#include<cmath>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<queue>
#include<stack>
#include <cstring>
#include <functional>
using namespace std;
#define MOD 1000000007
#define MOD2 998244353
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long Int;
typedef pair<Int, Int> P;
const int N = 1000006;
int h, w;
char g[2222][2222];
int tate[2222][2222];
int yoko[2222][2222];
void solve()
{
cin >> h >> w;
for (int i = 0; i < h; i++)
for (int j = 0; j < w; j++) {
cin >> g[i][j];
if (g[i][j] == '.') {
tate[i][j] = 1;
yoko[i][j] = 1;
}
}
for (int i = 0; i < h; i++) {
for (int j = 1; j < w; j++) {
if (yoko[i][j] != 0) yoko[i][j] += yoko[i][j - 1];
}
for (int j = w-2; j >=0 ; j--) {
if (yoko[i][j] != 0 && yoko[i][j] < yoko[i][j + 1]) yoko[i][j] = yoko[i][j + 1];
}
}
for (int j = 0; j < w; j++) {
for (int i = 1; i < h; i++) {
if (tate[i][j] != 0) tate[i][j] += tate[i - 1][j];
}
for (int i = h-2; i >= 0; i--) {
if (tate[i][j] != 0 && tate[i][j] < tate[i+1][j]) tate[i][j] = tate[i + 1][j];
}
}
int ans = 0;
for (int i = 0; i < h; i++)
for (int j = 0; j < w; j++) {
if (g[i][j] == '.') {
ans = max(ans, tate[i][j] + yoko[i][j]);
}
}
cout << ans-1 << endl;
}
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(13);
solve();
return 0;
} | 1 | 50,617,299 |
#include <stdio.h>
int main(){
int a,ap;
scanf("%d %d", &a, &ap);
ap += (a*3);
printf("%d", ap/2);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main () {
int a, p;
cin >> a >> p;
a *= 3;
int ans = (a + p) / 2;
cout << ans << endl;
} | 1 | 93,850,865 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(){
int n,k;
cin>>n>>k;
vector<int> d(k);
vector<vector<int>> a(k, vector<int>(n));
rep(i,k){
cin>>d[i];
rep(j,d[i]) cin>>a[i][j];
}
int ans=n;
for(int l=1; l<=n; l++){
bool have = false;
rep(i,k)rep(j,n){
if(l==a[i][j]) have = true;
}
if(have) ans--;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
int main() {
ll N,K;
cin>>N>>K;
vector<bool> vec(N,false);
for (ll i=0;i<K;i++) {
ll d;
cin>>d;
for(ll i=0;i<d;i++) {
ll A;
cin>>A;
vec[A-1]=true;
}
}
ll count=0;
for(auto x:vec) {
if(!x) {
count++;
}
}
cout<<count<<endl;
} | 1 | 11,091,291 |
#include<bits/stdc++.h>
using namespace std;
int sm(const string &s){
int n=s.length(),buf=1,res=0;
for(int i=0;i<n;++i){
if(s[i]>='0' && s[i]<='9'){
buf=s[i]-'0';
continue;
}
else if(s[i]=='m')res+=1000*buf;
else if(s[i]=='c')res+=100*buf;
else if(s[i]=='x')res+=10*buf;
else if(s[i]=='i')res+=buf;
buf=1;
}
return res;
}
string ms(int n){
string res;
int m,c,x,i;
m=n/1000;
n-=m*1000;
c=n/100;
n-=c*100;
x=n/10;
n-=x*10;
i=n;
if(m>=1){
if(m>1)res+='0'+m;
res+='m';
}
if(c>=1){
if(c>1)res+='0'+c;
res+='c';
}
if(x>=1){
if(x>1)res+='0'+x;
res+='x';
}
if(i>=1){
if(i>1)res+='0'+i;
res+='i';
}
return res;
}
int main(){
int n;
cin>>n;
for(int i=0;i<n;++i){
string s1,s2;
cin>>s1>>s2;
cout<<ms(sm(s1)+sm(s2))<<endl;
}
} | #include <iostream>
int mcxi2int(std::string s) {
int ret = 0;
int tmp = 1;
for (int i = 0; i < s.size(); i++) {
switch (s[i]) {
default: {
tmp = s[i] - '0';
break;
}
case 'm': { ret += tmp * 1000, tmp = 1; break; }
case 'c': { ret += tmp * 100, tmp = 1; break; }
case 'x': { ret += tmp * 10, tmp = 1; break; }
case 'i': { ret += tmp * 1, tmp = 1; break; }
}
}
return ret;
}
std::string int2mcxi(int n) {
char s[16];
int count = 0;
if (n / 1000 > 0) {
if (n / 1000 != 1) {
s[count++] = n / 1000 + '0';
}
s[count++] = 'm';
n -= (n / 1000) * 1000;
}
if (n / 100 > 0) {
if (n / 100 != 1) {
s[count++] = n / 100 + '0';
}
s[count++] = 'c';
n -= (n / 100) * 100;
}
if (n / 10 > 0) {
if (n / 10 != 1) {
s[count++] = n / 10 + '0';
}
s[count++] = 'x';
n -= (n / 10) * 10;
}
if (n > 0) {
if (n != 1) {
s[count++] = n + '0';
}
s[count++] = 'i';
}
s[count] = '\0';
return s;
}
int main() {
int n;
std::cin >> n;
while (n--) {
std::string inputs[2];
std::cin >> inputs[0] >> inputs[1];
int sum = mcxi2int(inputs[0]) + mcxi2int(inputs[1]);
std::cout << int2mcxi(sum) << std::endl;
}
return 0;
} | 1 | 9,241,084 |
#include <bits/stdc++.h>
using namespace std;
#define MIN(a, b) ((a) <= (b) ? (a) : (b))
#define MAX(a, b) ((a) > (b) ? (a) : (b))
void search(int n,int m,char**field){
}
int main(){
int n,k,ans;
cin >> n >> k;
ans = n - k + 1;
cout << ans << endl;
} | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
constexpr int inf = 0x3f3f3f3f;
constexpr ll linf = 0x3f3f3f3f3f3f3f3fLL;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int n, k; cin >> n >> k;
cout << n - k + 1 << endl;
return 0;
} | 1 | 32,824,370 |