code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 137
101M
|
|---|---|---|---|
#include<iostream>
#include <algorithm>
#include<string>
#include <numeric>
#include<math.h>
#include <bits/stdc++.h>
using namespace std;
int main(void) {
string s;
cin>>s;
if(s=="111")s="999";
else if(s=="119")s="991";
else if(s=="191")s="919";
else if(s=="199")s="911";
else if(s=="911")s="199";
else if(s=="919")s="191";
else if(s=="991")s="119";
else if(s=="999")s="111";
cout<<s<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define INF 9223372036854775807
#define all(x) (x).begin(), (x).end()
ll ts = 1000000007;
int main() {
string n;
cin >> n;
REP(i, 3) {
if (n[i] == '1') {
n[i] = '9';
} else if (n[i] == '9') {
n[i] = '1';
}
}
cout << n << endl;
} | 1 | 94,179,527 |
#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 MOD = 1e9 + 7;
const int INF = 2147483647;
int h,n;
ll dp[10010];
int main(){
cin >> h >> n;
vector<ll> a(n);
vector<ll> b(n);
rep(i,n){
cin >> a[i] >> b[i];
}
ll nin = INF;
rep(i,n){
nin = min(nin,a[i]);
}
rep(i,10010){
dp[i] = INF;
}
dp[0] = 0;
for(int i=1;i<10010;i++){
for(int j=0;j<n;j++){
if(i-a[j]>=0&&dp[i]>dp[i-a[j]]+b[j]){
for(int k=0;k<=i;k++){
dp[k] = min(dp[k],dp[i-a[j]]+b[j]);
}
}
}
}
ll ans = dp[h];
ll ans2 = dp[4000];
cout << dp[h] << endl;
return 0;
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int n;
ll damage[1005];
ll cost[1005];
ll memo[1005][10005];
ll dp(int i, int h){
if (memo[i][h] != -1) return memo[i][h];
ll ans = 1'000'000'000;
if (damage[i] >= h) {ans = min(ans, cost[i]);}
else { ans = min(ans, cost[i] + dp(i, h-damage[i]));}
if (i < (n-1)) ans = min(ans, dp(i+1,h));
memo[i][h] = ans;
return ans;
}
int main(){
memset(memo, -1, sizeof memo);
int h;
cin >> h >> n;
for (int i = 0; i < n; i++){ cin >> damage[i] >> cost[i]; }
cout << dp(0,h) << endl;
} | 1 | 55,456,587 |
#include <iostream>
#include <vector>
#include <deque>
#include <algorithm>
#include <numeric>
#include <string>
#include <cstring>
#include <list>
#include <unordered_set>
#include <tuple>
#include <cmath>
#include <limits>
#include <type_traits>
#include <iomanip>
#include <map>
#include <unordered_map>
#include <queue>
#include <stack>
#include <set>
#include <bitset>
#include <regex>
#include <random>
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n)for(ll i=0;i<n;++i)
#define exout(x) printf("%.10f\n", x)
const double pi = acos(-1.0);
const ll MOD = 1000000007;
const ll INF = 1e18;
const ll MAX_N = 201010;
ll fac[MAX_N], finv[MAX_N], inv[MAX_N];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX_N; 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;
}
}
long long COM(ll n, ll k) {
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
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);
}
ll dx[4] = { 0,0,-1,1 };
ll dy[4] = { -1,1,0,0 };
char notes[110][10];
ll treasure[3030][3030];
ll dp[3030][3030][4];
int main() {
ll n;
cin >> n;
vector<ll>a(n), b(n);
vector<pair<ll, ll>>res;
rep(i, n) {
cin >> a[i] >> b[i];
res.push_back(make_pair(a[i] + b[i], i));
}
sort(res.rbegin(), res.rend());
ll ans = 0;
rep(i, n) {
ll target = res[i].second;
if (i % 2 == 0) {
ans += a[target];
}
else {
ans -= b[target];
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
long n;
cin >> n;
vector<tuple<long,long,long>> c;
rep(i,n){
long a,b;
cin >> a >> b;
c.push_back(make_tuple(a+b,a,b));
}
sort(c.begin(),c.end());
reverse(c.begin(),c.end());
long t =0,a=0,flag = 1;
for(auto i:c){
long x,y,z;
tie(x,y,z) = i;
if(flag%2) t += y;
else a += z;
flag++;
}
cout << t-a << endl;
} | 1 | 30,230,085 |
#include <bits/stdc++.h>
#define pi 3.14159
using namespace std;
int main()
{
int i,n;
string s,t;
cin>>s;
n=s.length();
for(i=0;i<n;i++)
{
if(s[i]=='0')
t.push_back('0');
if(s[i]=='1')
t.push_back('1');
if(s[i]=='B')
{
if(t.length()>0)
t.pop_back();
}
}
cout<<t<<endl;
} | #include<cstdio>
#include<iostream>
using namespace std;
int main() {
string s, t;
cin >> s;
for(int i = 0; i < s.length(); ++i) {
if(s[i] == '0') t += '0';
else if(s[i] == '1') t += '1';
else if(s[i] == 'B') {
if(t.length()) t.erase(t.end()-1);
}
}
cout << t << '\n';
return 0;
} | 1 | 14,291,534 |
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
int n, s;
const int MAX_N = 1000;
int a[10] = { 0,1,2,3,4,5,6,7,8,9 };
int counter;
void solve(int i, int SUM, int use)
{
if (i == 10) {
if (SUM == s && use == n) {
counter++;
}
}
if (i <= 9) {
solve(i + 1, SUM, use);
solve(i + 1, SUM + a[i], use + 1);
}
}
int main()
{
while (true) {
cin >> n >> s;
if (n == 0 && s == 0) {
break;
}
counter = 0;
solve(0, 0, 0);
cout << counter << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int n, s;
int Comb(int N, int start, int s)
{
int ret = 0;
if (s < 0)
return 0;
if (N == n)
if (start == s)
return 1;
else
return 0;
for (int i = start + 1; i <= 9; ++i)
ret += Comb(N + 1, i, s - start);
return ret;
}
int main(){
vector<int> RET;
while (cin >> n >> s && (n != 0 || s != 0))
{
int ret = 0;
for (int i = 0; i <= 9; ++i)
ret += Comb(1, i, s);
RET.push_back(ret);
}
for (int i = 0; i < RET.size(); i++) {
cout << RET[i] << endl;
}
return 0;
} | 1 | 21,862,969 |
#include <iostream>
#include <string>
using namespace std;
int main(){
string str, d;
int a, b, n;
cin >> str >> n;
for(int i = 0; i < n; i++){
cin >> d >> a >> b;
string p;
if(d == "print"){
for(int j = a; j <= b; j++){
cout << str[j];
}
cout << endl;
}
else if(d == "reverse"){
p = str;
for(int j = 0; j <= b - a; j++){
str[a + j] = p[b - j];
}
}
else if(d == "replace"){
cin >> p;
for(int j = 0; j <= b - a; j++){
str[a + j] = p[j];
}
}
}
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
string str;
cin >> str;
int q;
cin >> q;
string order, x;
int a, b;
for(int i=0; i<q; i++) {
cin >> order;
cin >> a >> b;
if(order == "replace") {
cin >> x;
for(int j=0; j<x.length(); j++) {
str[a + j] = x[j];
}
} else if(order == "reverse") {
for(int j=0; j<(b-a+1)/2; j++) {
char temp;
temp = str[a + j];
str[a + j] = str[b - j];
str[b - j] = temp;
}
} else {
for(int j=0; j<(b-a+1); j++) {
cout << str[a + j];
}
cout << endl;
}
}
} | 1 | 88,810,341 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int N = 1e6 + 34;
int main()
{
ll c = 1000;
int n;
cin >> n;
vector<ll> a(n);
for (int i = 0; i < n; i++)
{
cin >> a[i];
}
for (int i = 0; i + 1 < n; i++)
{
if (a[i] < a[i + 1])
{
ll cnt = c / a[i];
c -= cnt * a[i];
c += cnt * a[i + 1];
}
}
cout << c;
} | #include <iostream>
#include <cstdio>
#include <vector>
#include <iomanip>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <map>
#include <set>
#include <cmath>
using namespace std;
using VLL = vector <long long>;
int main() {
const int INF = 1000000;
int N;
cin >> N;
VLL dp(N+1);
VLL price(N+1);
dp[0] = 1000;
price[0] = INF;
for (int d = 1; d <= N; ++d) {
cin >> price[d];
for (int pd = 0; pd < d; ++pd) {
dp[d] = max(dp[d], dp[pd]);
long long minP = INF;
for (int i = pd; i < d; ++i) {
minP = min(minP, price[i]);
}
long long allIn = dp[pd] / minP;
long long remainder = dp[pd] % minP;
dp[d] = max(dp[d], allIn * price[d] + remainder);
}
}
cout << dp[N] << endl;
return 0;
} | 1 | 91,481,439 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int _max(int x, int y) {return x > y ? x : y;}
int _min(int x, int y) {return x < y ? x : y;}
const int N = 200001;
int read() {
int s = 0, f = 1; char ch = getchar();
while(ch < '0' || ch > '9') {if(ch == '-') f = -1; ch = getchar();}
while(ch >= '0' && ch <= '9') s = s * 10 + ch - '0', ch = getchar();
return s * f;
}
void put(int x) {
if(x < 0) x = -x, putchar('-');
if(x >= 10) put(x / 10);
putchar(x % 10 + '0');
}
int A[N], B[N];
int main() {
int n = read();
LL ans = 0, zz = 1e9 + 1;
int cc = 0;
for(int i = 1; i <= n; i++) {
A[i] = read(), B[i] = read();
if(A[i] == B[i]) cc++;
ans += B[i];
if(A[i] > B[i]) zz = _min(zz, B[i]);
} if(zz == 1e9 + 1 || ans == 0) ans = 0;
else ans = ans - zz;
printf("%lld\n", ans);
return 0;
} | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <random>
#include <tuple>
#include <iomanip>
#include <cstring>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
#define rep(i, n) for(ll i = 0; i < (n); i++)
#define revrep(i, n) for(ll i = (n-1); i >= 0; i--)
#define pb push_back
#define f first
#define s second
const ll INFL = 1LL << 60;
const int INF = 1 << 30;
ll MOD = 1000000007;
vector<ll> dy = {0, 0, 1, -1, 1, 1, -1, -1, 0};
vector<ll> dx = {1, -1, 0, 0, 1, -1, 1, -1, 0};
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll pow_long(ll x, ll k){
ll res = 1;
while(k > 0){
if(k % 2) res *= x;
x *= x;
k /= 2;
}
return res;
}
ll pow_mod(ll x, ll k){
x %= MOD; x += MOD; x %= MOD;
ll res = 1;
while(k > 0){
if(k % 2){
res *= x; res %= MOD;
}
x *= x; x %= MOD;
k /= 2;
}
return res;
}
ll inverse(ll x){return pow_mod(x, MOD - 2);};
ll gcd(ll a, ll b){
if(b == 0) return a;
return gcd(b, a % b);
}
ll lcm(ll x, ll y){return x / gcd(x, y) * y;};
ll kai_mod(ll x){
if(x == 0) return 1;
return x * kai_mod(x-1) % MOD;
}
const int MAXcomb = 200010;
ll fac[MAXcomb], finv[MAXcomb], inv[MAXcomb];
void COMinit(){
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for(int i = 2; i < MAXcomb; 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 comb(int n, int k){
if(n < k) return 0;
if(n < 0 || k < 0) return 0;
return fac[n] * finv[k] % MOD * finv[n-k] % MOD;
}
int main(){
ll N;
cin >> N;
ll m = INFL;
ll ans = 0;
ll cnt = 0;
vector<ll> A(N), B(N);
rep(i, N){
cin >> A[i] >> B[i];
if(A[i] > B[i]) cnt++;
}
if(cnt == 0){
ans = 0;
}else if(cnt){
rep(i, N){
if(A[i] <= B[i]){
ans += A[i];
}else{
ans += A[i];
m = min(m, B[i]);
}
}
ans -= m;
}
cout << ans << endl;
} | 1 | 48,152,770 |
#include <iostream>
#include <string>
using namespace std;
int n;
string f[100];
int main() {
while (cin >> n) {
if (!n) break;
int ans = 0;
for (int i = 0; i < n; i++) cin >> f[i];
for (int i = 0; i < n / 2; i++) {
if (f[2 * i][0] != f[2 * i + 1][0]) { ans++; }
}
cout << ans << endl;
}
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int n,l,r,hantei,count;
string s;
while(1){
l = r = hantei = count = 0;
cin >> n;
if(n == 0)break;
for(int i = 0;i < n;i++){
cin >> s;
if(s == "lu"){
l = 1;
}
else if(s == "ru"){
r = 1;
}
else if(s == "ld"){
l = 0;
}
else if(s == "rd"){
r = 0;
}
if(l == 1 && r == 1 && hantei == 0){
count++;
hantei = 1;
}
else if(l == 0 && r == 0 && hantei == 1){
count++;
hantei = 0;
}
}
cout << count << endl;
}
return 0;
} | 1 | 11,528,329 |
#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(){
string s;
cin >> s;
set<char> values;
rep(i,s.size()){
values.insert(s[i]);
}
if(values.size() == 26)
cout << "None" << endl;
else{
for(char c = 'a' ; c < 'z' +1; c++){
if(values.count(c)) continue;
else{
cout << c << endl;
return 0;
}
}
}
} | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define str to_string
#define endl "\n"
#define PI 3.141592653589
using namespace std;
using lint = long long;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v)
{o<<"{";for(int i=0;i<(int)v.size();i++)o<<(i>0?", ":"")<<v[i];o<<"}";return o;}
int main(){
vector<int> vec(26);
string s;cin>>s;
for(char c:s)vec[c-'a']++;
string ans="None";
for(int i=0;i<26;i++){
if(vec[i]==0){ans=char('a'+i);break;}
}
cout<<ans<<endl;
} | 1 | 32,888,269 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cstdio>
using namespace std;
template<class T>
struct LeftistHeap {
private:
struct node{
node *lch,*rch;
int s;
T val;
node(T val):val(val){ lch=rch=NULL; }
} *root;
public:
LeftistHeap(){root=NULL;}
node *meld(node *a,node *b){
if(!a || !b)return a?a:b;
if(a->val < b->val)swap(a,b);
a->rch=meld(a->rch,b);
if(!a->lch || a->lch->s < a->rch->s)swap(a->lch,a->rch);
a->s=(!a->rch?0:a->rch->s)+1;
return a;
}
void push(T x){ root=meld(root,new node(x)); }
void pop(){
node *tmp=root;
root=meld(root->rch,root->lch);
delete tmp;
}
T top(){ return root->val; }
bool empty(){ return !root; }
void clear(){ while(!empty())pop(); }
};
int main(void){
LeftistHeap<int> que;
char ch[10];
int k;
while(true){
scanf(" %s",ch);
if(ch[2]=='d')break;
if(ch[0]=='i'){
scanf("%d",&k);
que.push(k);
} else {
printf("%d\n",que.top());
que.pop();
}
}
return 0;
} | #include<functional>
#include<algorithm>
#include<iostream>
#include<string>
#include<cstring>
using namespace std;
int highest_pop(unsigned int b){
int res=0;
for(int i=4;i>=0;i--){
int shift=1<<i;
if(b>>shift){
b>>=shift;
res|=shift;
}
}
return res;
}
int highest_popll(unsigned long long b){
int res=0;
for(int i=5;i>=0;i--){
int shift=1<<i;
if(b>>shift){
b>>=shift;
res|=shift;
}
}
return res;
}
template<int U=31>
class MultiSet{
unsigned int summary;
MultiSet<U-5> *ch[1<<5];
static int low_bits(unsigned int a){
return a&((1<<U-5)-1);
}
static int high_bits(unsigned int a){
return a>>(U-5);
}
static int index(unsigned int high,unsigned int low){
return high<<U-5|low;
}
public:
MultiSet():summary(0){
for(int i=0;i<(1<<5);i++)ch[i]=NULL;
}
~MultiSet(){clear();}
void clear(){
summary=0;
for(int i=0;i<(1<<5);i++){
delete ch[i];
ch[i]=NULL;
}
}
void insert(int v){
unsigned int high=high_bits(v);
summary|=1<<high;
if(!ch[high])ch[high]=new MultiSet<U-5>();
ch[high]->insert(low_bits(v));
}
bool erase(int v){
unsigned int high=high_bits(v);
if(!ch[high])return true;
if(!ch[high]->erase(low_bits(v))){
delete ch[high];
ch[high]=NULL;
return summary&=~(1<<high);
}
return true;
}
int nextvalue(int v)const{
unsigned int high=high_bits(v);
unsigned int low=low_bits(v);
int a;
if(ch[high] && (a=ch[high]->nextvalue(low))!=-1){
return index(high,a);
}else{
high=summary&~((1<<high)-1)&~(1<<high);
if(!high)return -1;
high=highest_pop(high&-high);
return index(high,ch[high]->min());
}
}
int prevvalue(int v)const{
unsigned int high=high_bits(v);
unsigned int low=low_bits(v);
int a;
if(ch[high] && (a=ch[high]->prevvalue(low))!=-1){
return index(high,a);
}else{
high=summary&((1<<high)-1);
if(!high)return -1;
high=highest_pop(high);
return index(high,ch[high]->max());
}
}
int min()const{
if(!summary)return -1;
unsigned int high=highest_pop(summary&-summary);
return index(high,ch[high]->min());
}
int max()const{
if(!summary)return -1;
unsigned int high=highest_pop(summary);
return index(high,ch[high]->max());
}
int count(int v)const{
unsigned int high=high_bits(v);
if(!ch[high])return 0;
return ch[high]->count(low_bits(v));
}
};
template<>
class MultiSet<6>{
unsigned long long summary;
int cnt[1<<6];
public:
MultiSet(){clear();}
void clear(){
summary=0;
memset(cnt,0,sizeof(cnt));
}
void insert(int v){
summary|=1ull<<v;
cnt[v]++;
}
bool erase(int v){
if(cnt[v])cnt[v]--;
if(cnt[v]==0)summary&=~(1ull<<v);
return summary;
}
int nextvalue(int v)const{
long long a=summary&~((1ull<<v)-1)&~(1ull<<v);
if(!a)return -1;
return highest_popll(a&-a);
}
int prevvalue(int v)const{
long long a=summary&((1ull<<v)-1);
if(!a)return -1;
return highest_popll(a);
}
int min()const{
if(!summary)return -1;
return highest_popll(summary&-summary);
}
int max()const{
if(!summary)return -1;
return highest_popll(summary);
}
int count(int v)const{
return cnt[v];
}
};
int main(){
MultiSet<> heap;
string s;
while(1){
cin>>s;
if(s=="end")break;
if(s=="insert"){
int n;
cin>>n;
heap.insert(n);
}else if(s=="extract"){
int a=heap.max();
cout<<a<<endl;
heap.erase(a);
}
}
return 0;
} | 1 | 20,738,565 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
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; }
using P=pair<long long,long long>;
#define rep(i,n) for(long long i=0; i<(long long)n; i++)
#define FOR(i,a,b) for(long long i=a; i<b; i++)
#define ll long long
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((long long)(x).size())
#define COUT(x) cout << x << endl
#define PB(x) push_back(x)
#define MP make_pair
#define vint vector<int>
#define vvint vector<vector<int>>
#define vstr vector<string>
#define SUM(x) accumulate(x.begin(),x.end(),0)
#define MAX(x) *max_element(x.begin(),x.end())
#define MIN(x) *min_element(x.begin(),x.end())
#define couty cout<<'Y'<<'e'<<'s'<<endl
#define coutn cout<<'N'<<'o'<<endl
#define coutY cout<<'Y'<<'E'<<'S'<<endl
#define coutN cout<<'N'<<'O'<<endl
#define yn(x) cout<<(x?"Yes":"No")<<endl
#define YN(x) cout<<(x?"YES":"NO")<<endl
long long gcd(long long a,long long b){return b?gcd(b,a%b):a;}
const long long dx[4]={1,0,-1,0};
const long long dy[4]={0,1,0,-1};
const long long INF = 1e12;
const long long MOD = 1e9+7;
signed main(){
int n,k; cin >> n >> k;
vector<P> p;
rep(i,n){
int a,b; cin >> a >> b;
p.PB(P(a,b));
}
sort(all(p));
int sum=0,res=0;
rep(i,n){
sum+=p[i].second;
if(sum>=k){
res=p[i].first;
break;
}
}
cout<<res<<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
ll n,k;
cin>>n>>k;
vector<ll> cnt(1e5+1);
for(int i=0;i<n;i++){
int a,b;
cin>>a>>b;
cnt[a]+=b;
}
for(int i=1;i<=1e5;i++){
if(k<=cnt[i]){
cout<<i<<endl;
break;
}
k-=cnt[i];
}
} | 1 | 52,286,967 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string O,E;
cin >> O >> E;
for(int i=0;i<O.size();++i){
cout << O.at(i);
if(i < E.size()) cout << E.at(i);
}
cout << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
string O, E;
cin >> O >> E;
int len = O.length() + E.length();
int oc = 0;
int ec = 0;
for (int i = 0; i < len; ++i) {
if ((i+1) % 2) {
cout << O[oc];
oc++;
}
else {
cout << E[ec];
ec++;
}
}
cout << endl;
} | 1 | 14,063,439 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,a,b) for(int i=(a);i<(b);i++)
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
using vint=vector<int>;
using pint=pair<int,int>;
using vpint=vector<pint>;
template<typename A,typename B>inline void chmin(A &a,B b){if(a>b)a=b;}
template<typename A,typename B>inline void chmax(A &a,B b){if(a<b)a=b;}
template<class A,class B>
ostream& operator<<(ostream& ost,const pair<A,B>&p){
ost<<"{"<<p.first<<","<<p.second<<"}";
return ost;
}
template<class T>
ostream& operator<<(ostream& ost,const vector<T>&v){
ost<<"{";
for(int i=0;i<v.size();i++){
if(i)ost<<",";
ost<<v[i];
}
ost<<"}";
return ost;
}
int quad(pint p){
if(p.fi>0&&p.se>=0)return 0;
if(p.se>0&&p.fi<=0)return 1;
if(p.fi<0&&p.se<=0)return 2;
return 3;
}
int dot(pint p,pint q){
return p.fi*q.fi+p.se*q.se;
}
int cross(pint p,pint q){
return p.fi*q.se-p.se*q.fi;
}
pint operator+(pint p,pint q){
return pint(p.fi+q.fi,p.se+q.se);
}
pint operator-(pint p,pint q){
return pint(p.fi-q.fi,p.se-q.se);
}
int norm(pint p){
return dot(p,p);
}
signed main(){
int N;
cin>>N;
vpint ps;
rep(i,N){
int x,y;
cin>>x>>y;
if(x||y)ps.eb(x,y);
}
N=ps.size();
sort(all(ps),[&](pint p,pint q){
if(quad(p)!=quad(q)){
return quad(p)<quad(q);
}
return cross(p,q)>0;
});
vpint ps_=ps;
ps.insert(ps.end(),all(ps_));
int ans=0;
rep(i,N){
pint sum;
rep(j,N){
sum=sum+ps[i+j];
chmax(ans,norm(sum));
}
}
printf("%.20Lf\n",sqrtl(1.0L*ans));
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 all(c) c.begin(),c.end()
#define pb push_back
#define fs first
#define sc second
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
using namespace std;
template<class S,class T> ostream& operator<<(ostream& o,const pair<S,T> &p){
return o<<"("<<p.fs<<","<<p.sc<<")";
}
template<class T> ostream& operator<<(ostream& o,const vector<T> &vc){
o<<"{";
for(const T& v:vc) o<<v<<",";
o<<"}";
return o;
}
using ll = long long;
template<class T> using V = vector<T>;
template<class T> using VV = vector<vector<T>>;
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n-1); }
#ifdef LOCAL
#define show(x) cerr << "LINE" << __LINE__ << " : " << #x << " = " << (x) << endl
#define dump(x) cerr << "LINE" << __LINE__ << " : " << #x << " = {"; \
for(auto v: x) cerr << v << ","; cerr << "}" << endl;
#else
#define show(x) true
#define dump(x) true
#endif
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
int N; cin >> N;
using P = pair<ll,ll>;
V<P> ps;
rep(i,N){
int x,y; cin >> x >> y;
if(x==0 && y==0) continue;
ps.emplace_back(x,y);
}
sort(all(ps),[&](P l,P r){
return atan2(l.fs,l.sc) < atan2(r.fs,r.sc);
});
ll mx = 0;
N = ps.size();
rep(l,N){
ll X=0,Y=0;
rep(i,N){
int j = (l+i)%N;
X += ps[j].fs, Y += ps[j].sc;
chmax(mx,X*X+Y*Y);
}
}
cout << sqrt(mx) << endl;
} | 1 | 6,621,543 |
#include <bits/stdc++.h>
using namespace std;
int main()
{int N; cin >> N;
vector<int> dp(N + 1, 1e7); dp[0] = 0;
for (int i = 0; i < N; ++i)
{for (auto j : {6, 9})
{for (auto k = 1; i + k <= N; k *= j) dp[i + k] = min(dp[i + k], dp[i] + 1);}}
cout << dp[N] << endl;} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
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 ll INF = 1LL << 60;
int main() {
int n;
cin >> n;
int ans = n;
rep(i, n + 1) {
int cnt = 0;
int t = i;
while (t) {
cnt += t % 6;
t /= 6;
}
t = n - i;
while (t) {
cnt += t % 9;
t /= 9;
}
ans = min(ans, cnt);
}
cout << ans << endl;
return 0;
} | 1 | 41,759,462 |
#include<bits/stdc++.h>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
double pai=3.141592653589;
int a,b,C;
double S,L,h,rad,cs;
scanf("%d %d %d",&a,&b,&C);
rad=C*pai/180;
cs=sqrt(a*a+b*b-2*a*b*cos(rad));
h=b*sin(rad);
printf("%.8lf\n%.8lf\n%.8lf\n",h*a/2,a+b+cs,h);
return 0;
} | #include <stdio.h>
#include <math.h>
int main(void)
{
double a,b,C,c;
double S,L,h;
double d;
double si,co;
double pai = 3.1415926;
scanf("%lf%lf%lf",&a,&b,&C);
c = C / 180 *pai;
si = sin(c);
co = cos(c);
h = b * si;
d = sqrt((a*a)+(b*b)-(2*a*b*co));
L = a+b+d;
S = (a * h) / 2;
printf("%f\n%f\n%f\n",S,L,h);
return(0);
} | 1 | 77,435,916 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
rep(i, n) a[i] = a[i] - (i + 1);
sort(a.begin(), a.end());
int b;
if (n % 2 == 0) {
b = a[n / 2 - 1];
} else {
b = a[(n +1) / 2-1];
}
long long int sum = 0;
rep(i, n) sum += abs(a[i] - b);
cout << sum << endl;
} | #include<iostream>
#include<algorithm>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
using namespace std;
typedef long long ll;
ll fabs(ll a){
if(a<0)return -a;
return a;
}
int main(){
int n;
cin>>n;
ll a[n];
rep(i,n){
cin>>a[i];
a[i]-=i;
}
sort(a,a+n);
ll ans=0;
rep(i,n)ans+=fabs(a[i]-a[n/2]);
cout<<ans<<endl;
return 0;
} | 1 | 18,017,303 |
#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 = 3;
vector<ll>A(N);
rep(i,N){
cin >> A[i];
}
sort(A.begin(),A.end(),greater<ll>());
cout << A[0]*10 + A[1] + A[2];
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for (int i = s; i < (int)(n); i++)
#define out(x) cout << x << endl
#define INF 1000000;
#include <map>
#include <math.h>
using ll = long long;
using namespace std;
ll n, k;
const ll mod = 1000000007;
int main(){
int a[3];
cin >> a[0] >> a[1] >> a[2];
sort(a, a+3);
int count;
count = 10*a[2]+a[1]+a[0];
out(count);
} | 1 | 61,814,317 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int x, y;
cin >> x >> y;
int ans;
ans = x + 0.5*y;
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
cout<<a+b/2<<endl;
} | 1 | 62,172,992 |
#include<bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
int n, m, d;
cin >> n >> m >> d;
vector<pair<int, int>> a(100010);
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
int x;
cin >> x;
a[x] = {i, j};
}
}
vector<vector<int>> g(d + 1);
for (int i = 1; i <= d; i++) {
g[i].push_back(0);
g[i].push_back(0);
for (int j = i + d; j <= 100000; j += d) {
g[i].push_back(abs(a[j].first - a[j - d].first) +
abs(a[j].second - a[j - d].second) + g[i].back()
);
}
}
int q;
cin >> q;
while (q-- > 0) {
int l, r;
cin >> l >> r;
int i = l % d;
if (i == 0) {
i = d;
cout << g[i][r / d] - g[i][l / d] << '\n';
} else {
cout << g[i][r / d + 1] - g[i][l / d + 1] << '\n';
}
}
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
using Graph = vector<vector<int>>;
#define MOD 1000000007
#define MOD2 998244353
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
ll dist[100010];
int l[100010], r[100010];
int main(){
int h, w, d;
cin >> h >> w >> d;
vector<P> b(h * w + 1);
rep(i, h){
rep(j, w){
int a;
cin >> a;
P p;
p = make_pair(j, i);
b[a] = p;
}
}
int q;
cin >> q;
rep(i, q) cin >> l[i] >> r[i];
for(int i = 1; i <= h * w; i++){
if (i <= d) dist[i] = 0;
else dist[i] = dist[i - d] + abs(b[i].first - b[i - d].first) + abs(b[i].second - b[i - d].second);
}
rep(i, q){
cout << dist[r[i]] - dist[l[i]] << endl;
}
return 0;
} | 1 | 34,979,135 |
#include "bits/stdc++.h"
using namespace std;
#define rep(i,n)for(int i=0;i<(int)(n);i++)
#define PI 3.141592653589793
int main()
{
long long int a, b;
cin >> a >> b;
long long int ans;
long long int i;
for (i = min(a, b); i <= a * b; i += min(a, b))
{
if (i % a == 0 && i % b == 0)
{
ans = i;
break;
}
}
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define all(x) x.begin(),x.end()
void solve()
{
ll a,b;
cin>>a>>b;
ll k=__gcd(a,b);
cout<<(a*b)/k<<endl;
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
solve();
return 0;
} | 1 | 94,592,131 |
#include <bits/stdc++.h>
#define ll long long
#define ulli unsigned long long int
#define ld long double
#define endl "\n"
using namespace std;
void solve() {
string s;
cin >> s;
if (s.size() < 2) {
cout << 0 << endl;
return;
}
int seen = 0;
ll ans = 0;
for (int i = 0; i < (int)s.size(); i++) {
if (s[i] == 'W') {
ans += i - seen;
seen++;
}
}
cout << ans << endl;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t = 1;
while (t--) {
solve();
}
cerr << "time taken : " << (float)clock() / CLOCKS_PER_SEC << " secs" << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <climits>
#include <functional>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
template<typename T> void print(T t) {cout << t << endl;}
int main() {
string S;
cin >> S;
ll ans = 0, prev=0;
vector<ll> v(S.size());
for (size_t i = 0; i < S.size(); i++) {
if (S[i] == 'B') v[i] = ++prev;
else ans += prev;
}
print(ans);
} | 1 | 88,437,149 |
#pragma region
#pragma GCC target("avx2")
#pragma GCC optimize("03")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std; typedef long double ld; typedef long long ll;
typedef unsigned long long ull;
#define endl "\n"
#define MP make_pair
#define FOR(i,a,b) for(int i=(a);i<=(b);i++)
#define FORR(x,arr) for(auto& x:arr)
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define VPII vector<PII>
#define VPLL vector<PLL>
#define FI first
#define SE second
#define ALL(x) (x).begin(), (x).end()
constexpr int INF=1<<30; constexpr ll LINF=1LL<<60; constexpr ll mod=1e9+7; constexpr int NIL = -1;
template<class T>inline bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>inline bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
#pragma endregion
ll n;
ll A,B,C;
ll L[10];
ll dfs(ll cur, ll a, ll b, ll c) {
if(cur == n) {
ll now = abs(a-A) + abs(b-B) + abs(c-C) - 30;
if(min(a, min(b,c)) > 0) return now;
else return LINF;
}
ll k0 = dfs(cur+1, a,b,c);
ll k1 = dfs(cur+1, a + L[cur], b, c) + 10;
ll k2 = dfs(cur+1, a, b+L[cur], c) + 10;
ll k3 = dfs(cur+1, a, b, c+L[cur]) + 10;
return min(k0, min(k2, min(k1, k3)));
}
int main(){
cin.tie(0); ios::sync_with_stdio(false);
cin >> n >> A >> B >> C;
FOR(i,0,n-1) {
cin >> L[i];
}
cout << dfs(0, 0, 0, 0) << endl;
return 0;
} | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const ll mod = 1000000007;
const ll INF = 1001001001;
const ll LINF = 1001001001001001001;
ll n ;
vector<ll> c(0);
vector<ll> mem;
vector<vector<ll>> place(200001,vector<ll>(0));
void prvec(vector<ll> vec){
ll n = vec.size();
cout << "------------------------------------\n" ;
rep(i,n) cout << i << " " << vec.at(i) << "\n";
cout << "------------------------------------\n" ;
}
void pr2d(vector<vector<ll>> vec){
ll h = vec.size();
ll w = vec.at(0).size();
cout << "------------------------------------\n" ;
rep(i,h){
rep(j,w){
cout << vec.at(i).at(j) << " ";
}
cout << "\n";
}
cout << "------------------------------------\n" ;
}
tuple<ll,ll,ll,ll,ll,ll> bamboocomb(ll x, vector<ll> length_list, ll number_of_bamboo){
ll fa = 0,fb = 0,fc = 0;
ll noca = -1, nocb = -1, nocc = -1;
bitset<16> bx(x);
for(ll i=0;i<number_of_bamboo;i++){
if(bx.test(2*i)){
if(bx.test(2*i+1)){
fc += length_list.at(i);
nocc++;
}else{
fa += length_list.at(i);
noca++;
}
}else{
if(bx.test(2*i+1)){
fb += length_list.at(i);
nocb++;
}
}
}
return make_tuple(fa,fb,fc,noca,nocb,nocc);
}
int main(){
ll n,a,b,c; cin >> n >> a >> b >> c;
vector<ll> l(n);
rep(i,n) cin >> l.at(i);
ll ans = INF;
for(ll i=0;i<(1<<(2*n));i++){
tuple<ll,ll,ll,ll,ll,ll> candidate = bamboocomb(i,l,n);
if(get<0>(candidate) * get<1>(candidate) * get<2>(candidate) == 0) continue;
ans = min(ans,10*get<3>(candidate)+abs(get<0>(candidate) - a) + 10*get<4>(candidate)+abs(get<1>(candidate) - b) + 10*get<5>(candidate) + abs(get<2>(candidate) - c));
}
cout << ans << endl;
} | 1 | 64,544,264 |
#include <iostream>
#include <vector>
typedef struct UNION_FIND{
std::vector<int> par;
UNION_FIND(int size) : par(size){
for(int i=0; i<size; ++i) par[i] = i;
}
int find(int x){
return ( (x == par[x]) ? x : (par[x] = find(par[x])) );
}
void unite(int x, int y){
x = find(x);
y = find(y);
if( x == y ) return;
par[y] = x;
}
bool same(int x, int y){
return ( find(x) == find(y) );
}
} UnionFind;
int n, q;
int c, x, y;
int main(void){
std::cin >> n >> q;
UnionFind uf(n);
for(int i=0; i<q; ++i){
std::cin >> c >> x >> y;
if(c == 0){
uf.unite(x,y);
}else{
if(uf.same(x,y)){
std::cout << "1\n";
}else{
std::cout << "0\n";
}
}
}
} | #include<iostream>
#define MAX 10000
using namespace std;
int etog[MAX];
int main() {
int i, j, n, q, com, x, y, tmpyg;
cin >> n >> q;
for (i = 0; i < n; i++) {
etog[i] = i;
}
for (i = 0; i < q; i++) {
cin >> com >> x >> y;
if (com == 0) {
tmpyg = etog[y];
for (j = 0; j < n; j++) {
if (etog[j] == tmpyg)etog[j] = etog[x];
}
} else {
if (etog[x] == etog[y])cout << 1 << endl;
else cout << 0 << endl;
}
}
return 0;
} | 1 | 56,102,732 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
long gcd(long a, long b)
{
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
int main()
{
int a ,b,k;
cin >> a >> b >> k;
int max = gcd(a, b);
int i = max;
int cnt = 0;
while (i > 0)
{
if (a % i == 0 && b % i == 0)
cnt++;
if (cnt == k)
break ;
i--;
}
cout << i << endl;
return (0);
} | #include <bits/stdc++.h>
using namespace std;
int main(void){
int a,b,k,min_num;
cin >> a >> b >> k;
min_num = min(a,b);
vector<int> vec{};
for(int i=1;i<=min_num;i++){
if(a%i == 0 && b%i == 0) vec.push_back(i);
}
sort(vec.begin(),vec.end(),greater<int>());
cout << vec[k-1] << endl;
} | 1 | 76,094,672 |
#include <iostream>
using namespace std;
int main () {
int a;
int b = 1;
cin >> a;
while (a > 0) {
cout << "Case" << " " << b << ":" << " " << a << endl;
b = b+1;
cin >> a;
}
return 0;
} | #include<iostream>
int main()
{
int i=1, in;
while(true)
{
std::cin >> in;
if(in == 0) break;
std::cout << "Case " << i << ": " << in << "\n";
i++;
}
return 0;
} | 1 | 39,975,252 |
#include "iostream"
#include "string"
int Dice[6];
class DiceMove
{
private:
public:
DiceMove(){}
void Move(char dir) {
int temp;
if (dir == 'N') {
temp = Dice[0];
Dice[0] = Dice[1];
Dice[1] = Dice[5];
Dice[5] = Dice[4];
Dice[4] = temp;
}
if (dir == 'S') {
temp = Dice[0];
Dice[0] = Dice[4];
Dice[4] = Dice[5];
Dice[5] = Dice[1];
Dice[1] = temp;
}
if (dir == 'E') {
temp = Dice[0];
Dice[0] = Dice[3];
Dice[3] = Dice[5];
Dice[5] = Dice[2];
Dice[2] = temp;
}
if (dir == 'W') {
temp = Dice[0];
Dice[0] = Dice[2];
Dice[2] = Dice[5];
Dice[5] = Dice[3];
Dice[3] = temp;
}
}
};
int main()
{
int n, fr, up, count = 0;
char dir;
DiceMove move;
std::string direction;
for (int i = 0; i < 6; i++)
std::cin >> Dice[i];
std::cin >> n;
for (int i = 0; i < n; i++) {
std::cin >> up >> fr;
while (1) {
if (Dice[1] == up && Dice[0] == fr) {
move.Move('W');
move.Move('W');
move.Move('N');
}
if (Dice[0] == up && Dice[1] == fr) break;
else {
if (count == 3) {
move.Move('W');
count = 0;
}
else {
move.Move('N');
count++;
}
}
}
std::cout << Dice[2] << std::endl;
count = 0;
}
return 0;
} | #include <stdio.h>
int face[7][7][4] = {
{{0},{0},{0},{0},{0},{0},{0}},
{{0},{0},{0,1,2,3},{0,1,3,5},{0,1,4,2},{0,1,5,4},{0}},
{{0},{0,2,1,4},{0},{0,2,3,1},{0,2,4,6},{0},{0,2,6,3}},
{{0},{0,3,1,2},{0,3,2,6},{0},{0},{0,3,5,1},{0,3,6,5}},
{{0},{0,4,1,5},{0,4,2,1},{0},{0},{0,4,5,6},{0,4,6,2}},
{{0},{0,5,1,3},{0},{0,5,3,6},{0,5,4,1},{0},{0,5,6,4}},
{{0},{0},{0,6,2,4},{0,6,3,2},{0,6,4,5},{0,6,5,3},{0}}};
int assign[7];
int main()
{
int q, i, t, f;
for (i = 1; i <= 6; i++) scanf("%d", assign+i);
scanf("%d", &q);
while (q--) {
scanf("%d%d", &t, &f);
for (i = 1; i <= 6; i++) {
if (assign[i] == t) t = i;
if (assign[i] == f) f = i;
}
printf("%d\n", assign[face[t][f][3]]);
}
return 0;
} | 1 | 74,624,540 |
#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()
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
void solve() {
ll k, a, b;
cin >> k >> a >> b;
if (a >= b - 2) {
cout << k + 1 << endl;
} else {
if (k <= a) {
cout << k + 1 << endl;
} else {
ll t = k - (a - 1);
ll ans = a;
if (t % 2 == 1) {
ans += 1;
t -= 1;
}
ans += ((t / 2) * (b - a));
cout << ans << endl;
}
}
}
int main() {
solve();
return 0;
} | #pragma region header
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cctype>
#include <assert.h>
#include <time.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#include <math.h>
#include <cstring>
#include <array>
#pragma region header
using namespace std;
using lint = long long;
using ld = long double;
using ulint = unsigned long long;
const int dx[] = { 1,0,-1,0 };
const int dy[] = { 0,1,0,-1 };
constexpr lint mod = 1000000007;
constexpr long double pi = 3.141592653589793238462643383279;
#pragma endregion
#define INF (lint)10000000000000000;
#define mod (int)1000000007
#pragma region header
template <class T, class U>
inline bool chmin(T& lhs, const U& rhs) {
if (lhs > rhs) {
lhs = rhs;
return 1;
}
return 0;
}
template <class T, class U>
inline bool chmax(T& lhs, const U& rhs) {
if (lhs < rhs) {
lhs = rhs;
return 1;
}
return 0;
}
#pragma endregion
#pragma endregion
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
long long k, a, b; cin >> k >> a >> b;
if (b - a <= 2) cout << k + 1 << endl;
else {
cout << a + (b - a) * ((k - a + 1) / 2) + (k - a + 1) % 2 << endl;
}
return 0;
} | 1 | 4,585,292 |
#include<bits/stdc++.h>
using namespace std;
string rever(string s) {
string t(s.rbegin(), s.rend());
return t;
}
int main() {
string s, t, a, b, x, y;
cin >> s;
int n = s.size();
t = rever(s);
a = s.substr(0, (n-1)/2);
b = rever(a);
x = s.substr((n+1)/2);
y = rever(x);
if (s==t && a==b && x==y) cout << "Yes" << endl;
else cout << "No" << endl;
} | #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("Ofast")
using namespace __gnu_pbds;
using namespace std;
#define int long long int
#define endl '\n'
#define mod 1000000007
#define inf 1e18
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
const int N = 300005;
void solve() {
string s; cin >> s;
string rev = s;
reverse(rev.begin(), rev.end());
if (s != rev) {
cout << "No\n";
return;
}
int n = s.length();
if (n == 1) {
cout << "Yes\n";
return;
}
string f = s.substr(0, n / 2);
string rf = f;
reverse(rf.begin(), rf.end());
if (f != rf) {
cout << "No\n";
return;
}
f = s.substr(1 + n / 2, n / 2);
rf = f;
reverse(rf.begin(), rf.end());
if (f != rf) {
cout << "No\n";
return;
}
cout << "Yes\n";
}
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
int t = 1, z = 1;
while (t--) {
solve();
}
return 0;
} | 1 | 87,484,423 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin>>n;
long long sum=0;
for(int i=1;i<n;i++){
sum+=i;
}
cout<<sum<<endl;
return 0;
} | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(void) {
int N;
scanf("%d", &N);
long ans = 0;
for (int i = 1; i <= N - 1; i++) {
ans += i;
}
printf("%ld", ans);
return 0;
} | 1 | 75,823,193 |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define Fast_IO ios::sync_with_stdio(false);
#define fir first
#define sec second
#define int long long
#define mod 998244353
inline int read()
{
char ch=getchar(); int nega=1; while(!isdigit(ch)) {if(ch=='-') nega=-1; ch=getchar();}
int ans=0; while(isdigit(ch)) {ans=ans*10+ch-48;ch=getchar();}
if(nega==-1) return -ans;
return ans;
}
typedef pair<int,int> pii;
#define N 100005
int d[N],cnt[N];
signed main()
{
#ifdef __LOCAL__
freopen("in.txt","r",stdin);
#endif
int n=read();
for(int i=1;i<=n;i++)
{
d[i]=read();
if(i==1)
{
if(d[i]!=0) return cout<<"0\n",0;
}
else
{
if(d[i]==0) return cout<<"0\n",0;
}
}
for(int i=1;i<=n;i++) cnt[d[i]]++;
int ans=1;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=cnt[i];j++) ans=ans*cnt[i-1]%mod;
}
cout<<ans<<endl;
#ifdef __LOCAL__
printf("Time Used : %d\n",clock());
#endif
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
using namespace std;
#define FAST ios_base :: sync_with_stdio(false); cin.tie(NULL);
#define endl "\n"
typedef long long int ll;
typedef unsigned long long int ull;
#define MOD 998244353
ll power(ll a , ll p)
{
ll result = 1;
while(p > 0)
{
if(p & 1)
result = ( (result%MOD) * (a%MOD) ) % MOD;
a = ( (a%MOD) * (a%MOD) ) % MOD;
p = p>>1;
}
return result;
}
int main()
{
FAST;
int n;
cin >> n;
ll arr[n];
for(int i=0 ; i<n ; i++)
cin >> arr[i];
if(arr[0] != 0)
{
cout << "0";
return 0;
}
ll count[n];
memset(count , 0 , sizeof(count));
for(int i=0 ; i<n ; i++)
count[arr[i]]++;
if(count[0] != 1)
{
cout << "0\n";
return 0;
}
ll tree = 1;
ll op = 1;
ll temp = n-1;
for(int i=1 ; i<n ; i++)
{
if(count[i] == 0)
{
if(temp == 0)
break;
cout << "0\n";
return 0;
}
temp -= count[i];
ll ans = power(op , count[i]);
tree = ((tree%MOD) * (ans%MOD))%MOD;
op = count[i];
}
cout << tree << "\n";
return 0;
} | 1 | 40,334,375 |
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define ll long long
#define vi vector<int>
#define pii pair<int,int>
#define F first
#define S second
#define pb push_back
#define forn(b) for(int i = 0; i < b; i++)
#define rforn(b) for(int i = b - 1 ;i >= 0; i--)
#define It(m) for(auto it = m.begin(); it != m.end(); it++)
#define N 500500
#define PI 3.14159265358979323846264338327950L
#define speed ios_base :: sync_with_stdio(0);cin.tie(0);cout.tie(0);
const ll mod = (ll)1e9 + 7;
int main(){
speed;
string s; cin >> s;
string ss = "";
for(int i = s.size() - 1; i >= 0; i--) {
ss += s[i];
if(ss == "maerd" || ss == "remaerd" || ss == "esare" || ss == "resare") {
ss = "";
}
}
if(ss.size() == 0) {
cout << "YES";
}
else {
cout << "NO";
}
return 0;
} | #include <bits/stdc++.h>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <cctype>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <functional>
using namespace std;
#define DEBUG(x) cout << '>' << #x << ':' << x << endl;
#define REP(i,n) for(int i=0;i<(n);i++)
#define FOR(i,a,b) for(int i=(a);i<=(b);i++)
#define FORD(i,a,b) for(int i=(a);i>=(b);i--)
inline bool EQ(double a, double b) { return fabs(a-b) < 1e-9; }
const int INF = 1<<29;
typedef long long int ll;
inline int two(int n) { return 1 << n; }
inline int test(int n, int b) { return (n>>b)&1; }
inline void set_bit(int & n, int b) { n |= two(b); }
inline void unset_bit(int & n, int b) { n &= ~two(b); }
inline int last_bit(int n) { return n & (-n); }
inline int ones(int n) { int res = 0; while(n && ++res) n-=n&(-n); return res; }
template<class T> void chmax(T & a, const T & b) { a = max(a, b); }
template<class T> void chmin(T & a, const T & b) { a = min(a, b); }
const int MOD=1000000007;
bool isPowerOfTwo (ll x)
{
return x && (!(x&(x-1)));
}
bool isPrime(int n)
{
if (n <= 1) return false;
if (n <= 3) return true;
if (n%2 == 0 || n%3 == 0) return false;
for (int i=5; i*i<=n; i=i+6)
if (n%i == 0 || n%(i+2) == 0)
return false;
return true;
}
int highestPowerof2(unsigned int n)
{
if (n < 1)
return 0;
int res = 1;
for (int i=0; i<8*sizeof(unsigned int); i++)
{
int curr = 1 << i;
if (curr > n)
break;
res = curr;
}
return res;
}
long long binpow(long long a, long long b) {
long long res = 1;
while (b > 0) {
if (b & 1)
res = res * a;
a = a * a;
b >>= 1;
}
return res;
}
const int dx[] = {1,0,-1,0,1,1,-1,-1};
const int dy[] = {0,-1,0,1,1,-1,-1,1};
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t=1;
while(t--)
{
string s;
cin>>s;
string a7="dreamer",b6="eraser",a5="erase",b5="dream";
reverse(s.begin(),s.end());
reverse(a7.begin(),a7.end());
reverse(b6.begin(),b6.end());
reverse(a5.begin(),a5.end());
reverse(b5.begin(),b5.end());
for(int i=0;i<s.size();)
{
if((i+4) >= s.length())
return cout<<"NO",0;
if(s.substr(i,7)!=a7 || (i+6)>=s.length())
{
if(s.substr(i,6)!=b6 || (i+5)>=s.length())
{
if(s.substr(i,5)!=a5 && s.substr(i,5)!=b5)
{
cout<<"NO";
return 0;
}
else
{
i+=5;
}
}
else
{
i+=6;
}
}
else
{
i+=7;
}
}
cout<<"YES";
}
return 0;
} | 1 | 79,930,756 |
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <deque>
#include <random>
#include <iomanip>
typedef long long int ll;
typedef long double ld;
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
const ll MOD=1000000007;
const ll MAX_N=500010;
const ll INF=999999999999;
char s[100][100];
int main(){
int a,b;
cin>>a>>b;
a--;
b--;
for(int i=0;i<50;i++){
for(int j=0;j<100;j++){
s[i][j]='#';
}
}
for(int i=50;i<100;i++){
for(int j=0;j<100;j++){
s[i][j]='.';
}
}
while(a){
for(int i=0;i<50;i+=2){
for(int j=0;j<50;j++){
s[i][2*j]='.';
a--;
if(a==0) break;
}
if(a==0) break;
}
if(a==0) break;
}
while(b){
for(int i=99;i>=50;i-=2){
for(int j=0;j<50;j++){
s[i][2*j]='#';
b--;
if(b==0) break;
}
if(b==0) break;
}
if(b==0) break;
}
cout<<100<<" "<<100<<endl;
for(int i=0;i<100;i++){
for(int j=0;j<100;j++){
cout<<s[i][j];
}
cout<<endl;
}
} | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for(ll i = 0; i < (n); i++)
#define Rep(i, n) for(ll i = 1; i < (n); i++)
#define ALL(a) (a).begin(),(a).end()
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define PI 3.14159265358979323846
ll fac[MAX], finv[MAX], inv[MAX];
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;
}
void COMinit() {
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 Len(ll n) {
ll s=0;
while(n!=0) s++, n/=10;
return s;
}
ll Sint(ll n) {
ll m=0,s=0,a=n;
while(a!=0) s++, a/=10;
for(ll i=s-1;i>=0;i--) m+=n/((ll)pow(10,i))-(n/((ll)pow(10,i+1)))*10;
return m;
}
ll Svec(vector<ll> v){
ll n=0;
for(ll i=0;i<v.size();i++) n+=v[i];
return n;
}
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;
}
ll Factorial(ll n){
ll m=1;
while(n>=1) m*=n,n--;
return m;
}
void runlength(string s,vector<pair<char,ll>> &p){
ll x=1;
if(s.size()==1){
p.push_back(pair<char,ll>(s[0],1));
}
for(ll i=0;i<s.size()-1;i++){
if(s[i]==s[i+1]){
x++;
if(i==s.size()-2){
p.push_back(pair<char,ll>(s[i],x));
}
}else{
p.push_back(pair<char,ll>(s[i],x));
x=1;
if(i==s.size()-2){
p.push_back(pair<char,ll>(s[s.size()-1],x));
}
}
}
}
ll COM(ll n,ll k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll modpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
string Toupper(string s){
string ans="";
rep(i,s.size()){
if('a'<=s[i] && s[i]<='z') ans+=(char)s[i]-32;
else ans+=s[i];
}
return ans;
}
string Tolower(string s){
string ans="";
rep(i,s.size()){
if('A'<=s[i] && s[i]<='Z') ans+=(char)s[i]+32;
else ans+=s[i];
}
return ans;
}
const int MAX_N=100010;
vector<bool> sieve_of_eratosthenes(){
vector<bool> isPrime(MAX_N+1,true);
for(int i=2;i<=MAX_N;i++){
if(isPrime[i]){
for(int j=2*i;j<=MAX_N;j+=i){
isPrime[j]=false;
}
}
}
return isPrime;
}
vector<pint> prime_factorize(ll n){
vector<pint> ans;
for(ll p=2;p<=sqrt(n);p++){
if(n%p!=0) continue;
ll cnt=0;
while(n%p==0){
n/=p;
cnt++;
}
ans.push_back(make_pair(p,cnt));
}
if(n!=1) ans.push_back(make_pair(n,1));
return ans;
}
int main() {
IOS;
ll w,b;
cin>>w>>b;w--;b--;
vector<string> v1;
vector<string> v2;
rep(i,50) v1.push_back("####################################################################################################");
rep(i,50) v2.push_back("....................................................................................................");
ll c=w/49;
ll d=w%49;
cout<<100<<' '<<100<<endl;
rep(i,c){
rep(j,49){
v1[2*i+1][2*j+1]='.';
}
}
rep(i,d){
v1[48][2*i+1]='.';
}
c=b/49;
d=b%49;
rep(i,c){
rep(j,49){
v2[2*i+1][2*j+1]='#';
}
}
rep(i,d){
v2[48][2*i+1]='#';
}
rep(i,50) cout<<v1[i]<<endl;
rep(i,50) cout<<v2[i]<<endl;
} | 1 | 64,455,475 |
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
int main() {
ll n,k,i,l,sum=0; cin>>n>>k; vector<ll>a;
if (k>=n) {cout<<0; return 0;}
for(i=0;i<n;i++)
{ cin>>l; a.pb(l); }
sort(a.begin(),a.end());
for(i=0;i<n-k;i++) {sum+=a[i];}
cout<<sum;
return 0;
} | #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;
const int INF = 1001001001;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
sort(h.begin(), h.end());
ll ans = 0;
rep(i, n - k) ans += h[i];
cout << ans << endl;
} | 1 | 20,782,249 |
#include <bits/stdc++.h>
using namespace std;
#define SPEED ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define ll long long
#define endl '\n'
#define vi vector<ll>
#define mii map<ll, ll>
#define pii pair<ll, ll>
#define pb push_back
#define fi first
#define se second
#define vvi vector<vi>
#define all(x) x.begin(), x.end()
const ll inf=0x3f3f3f3f3f3f3f3f;
const ll N = 1e6;
vi findDivisors()
{
ll n = N;
vi div(n + 1, 0);
for (ll i = 1; i <= n; i++) {
for (ll j = 1; j * i <= n; j++)
div[i * j]++;
}
return div;
}
int main() {
SPEED;
vi v = findDivisors();
ll n;
cin>>n;
ll ans = 0;
for(ll c = 1; c < n; c++) {
ans += v[c];
}
cout<<ans;
return 0;
} | #include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <deque>
#include <iomanip>
#include <fstream>
#include <climits>
using namespace std;
typedef long long ll;
typedef long double lld;
typedef unsigned long long ull;
int INF = INT_MAX;
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n;
cin>>n;
ll ans = 0;
for (int a = 1; a<=n;a++){
ans+= (n-1)/a;
}
cout<<ans<<"\n";
} | 1 | 45,365,446 |
#include <bits/stdc++.h>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FORR(i,a,b) for (int i=(a);i>=(b);i--)
#define pb push_back
#define pcnt __builtin_popcount
#define show(x) cout<<#x<<" = "<<x<<endl;
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define fi first
#define se second
#define rng(a) (a.begin()),(a.end())
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define sz(x) (int)(x).size()
#define mp make_pair
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef set<int> si;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pll> vpll;
typedef set<ll> sl;
typedef __int128_t lll;
typedef pair<lll,lll> plll;
typedef vector<lll> vlll;
template<typename T>string join(vector<T>&v)
{stringstream s;FOR(i,0,sz(v))s<<' '<<v[i];return s.str().substr(1);}
template<typename A, size_t N, typename T>void Fill(A (&array)[N], const T&v)
{fill((T*)array,(T*)(array+N),v);}
ll gcd(ll a,ll b){if(a>b)swap(a,b);for(;a>0;b%=a,swap(a,b));return b;}
int modpow(ll a,ll n,int m){if(a==0)return a;ll p=1;for(;n>0;n/=2,a=a*a%m)if(n&1)p=p*a%m;return(int)p;}
void dout(double d){printf("%.12f\n",d);}
const int iinf = 1e9;
const ll linf = 1e18;
const int mod = 1e9+7;
const double pi = acos(-1);
const double eps = 1e-10;
ll w, h, p;
vpll v;
main(){
cin.tie(0);
ios::sync_with_stdio(false);
cin >> w >> h;
FOR(i, 0, w){
cin >> p;
v.pb(mp(p, 0));
}
FOR(i, 0, h){
cin >> p;
v.pb(mp(p, 1));
}
ll ans = 0;
w++;
h++;
sort(rng(v));
for(pll p: v){
if(p.se){
ans += w * p.fi;
h--;
}else{
ans += h * p.fi;
w--;
}
}
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 | 93,946,307 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<long long>;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
constexpr long long mod = 1000000007;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vll a(n);
rep(i, n) cin >> a[i];
vll b(n + 1, 0);
b[0] = abs(a[0] - 0);
for (int i = 0; i < n - 1; i++) {
b[i + 1] = abs(a[i + 1] - a[i]);
}
b[n] = abs(0 - a[n - 1]);
ll sum = 0;
for (int i = 0; i <= n; i++) {
sum += b[i];
}
for (int i = 0; i < n; i++) {
ll t = sum - (b[i] + b[i + 1]);
if(i==0){
t += abs(0 - a[1]);
}else if(i==n-1){
t += abs(0 - a[n - 2]);
}else{
t += abs(a[i - 1] - a[i + 1]);
}
cout << t << endl;
}
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
using vvll = vector<vector<ll>>;
ll mod =1000000007;
template<typename TypeInt> string itob(const TypeInt v, int base){static const char table[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";string ret;static numeric_limits<TypeInt> t;TypeInt n = v;if (t.is_signed) {if (v < 0) n *= -1;}while (n >= base) {ret += table[n%base];n /= base;}ret += table[n];if (t.is_signed) {if (v < 0 && base == 10) ret += '-';}reverse(ret.begin(), ret.end());return ret;}
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; }
int ctoi(char c) {return c-'0';}
int gcd(ll a,ll b){return b?gcd(b,a%b):a;}
int lcm(ll a,ll b){return a*b/gcd(a,b);}
bool primecheck(ll n){if(n < 2) return false;else{for(int i = 2; i * i <= n; i++){if(n % i == 0) return false;}return true;}}
string reverserange(string s,ll a,ll b){reverse(s.begin()+a-1,s.begin()+b); return s;}
int main(){
int n;
cin >> n;
vector<int>a(n);
for(int i=0;i<n;i++){
cin >> a.at(i);}
ll che = abs(a.at(n-1))+abs(a.at(0));
for(int i=1;i<n;i++){
che+=abs(a.at(i-1)-a.at(i));
}
for(int i=0;i<n;i++){
if(i==0){
ll ans = che;
ans-=abs(a.at(i));
ans-=abs(a.at(i)-a.at(i+1));
ans+=abs(a.at(i+1));
cout <<ans<<endl;
continue;
}
if(i==n-1){
ll ans = che;
ans-=abs(a.at(i));
ans-=abs(a.at(i)-a.at(i-1));
ans+=abs(a.at(i-1));
cout<< ans<<endl;
continue;
}
ll ans = che;
ans-=abs(a.at(i)-a.at(i-1));
ans-=abs(a.at(i)-a.at(i+1));
ans+=abs(a.at(i-1)-a.at(i+1));
cout << ans<<endl;
}
} | 1 | 75,716,076 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main(){
int n; cin >> n;
int a[n], b[n];
priority_queue<P> pq;
rep(i, n){
cin >> a[i] >> b[i];
pq.push(make_pair(a[i] + b[i], i));
}
ll as = 0, bs = 0;
int cnt = 0;
while(pq.size() > 0){
if(cnt % 2 == 0) as += a[pq.top().second];
else bs += b[pq.top().second];
cnt++;
pq.pop();
}
cout << as - bs << endl;
return 0;
} | #include <bits/stdc++.h>
#define int long long
typedef long long ll;
using namespace std;
const ll MAXN = 200000;
ll N, ans=0, tmp=0;
vector<ll> A, B;
signed main(){
cin >> N;
for(int i=0;i<N;i++) {
ll a, b;
cin >> a >> b;
ans -= b;
A.push_back(a+b);
}
sort(A.begin(), A.end());
for(int i=A.size()-1;i>=0;i-=2) {
ans += A[i];
}
cout << ans << endl;
return 0;
} | 1 | 10,738,719 |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <ctime>
#include <bitset>
#include <complex>
#include <chrono>
#include <random>
#include <functional>
using namespace std;
#define int long long
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << max({a * c, a * d, b * c, b * d}) << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define ull unsigned long long int
#define pb push_back
#define xx first
#define yy second
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ull t;
t=1;
while(t--)
{
ll a,b,c,d;
cin>>a>>b>>c>>d;
ll A[2]={a,b},B[2]={c,d};
ll i,j,ans=-1*(1e18);
for(i=0;i<2;i++)
{
for(j=0;j<2;j++)
{
ll p=A[i]*B[j];
ans=max(ans,p);
}
}
cout<<ans;
}
} | 1 | 51,155,590 |
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
int main() {
int A, B, C;
cin >> A >> B >> C;
if ((A <= C)&&(C <= B)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #pragma region
#include <bits/stdc++.h>
using namespace std;
inline void ci(void){
return;
}
template <typename First, typename... Rest>
void ci(First& first, Rest&... rest){
cin >> first;
ci(rest...);
return;
}
inline void co(void){
cout << "\n";
return;
}
template <typename First, typename... Rest>
void co(First first, Rest... rest){
cout << first << " ";
co(rest...);
return;
}
#define ll long long
#define ld long double
#define st string
#define dl double
#define wh while
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define tp tuple
#define ft first
#define sc second
#define ve vector
#define tos to_string
#define len length
#define rt return 0
#define br break
#define con continue
#define lcm(n, m) (n * m / gcd(n, m))
#define np next_permutation
#define repi(i, m, n) for(int i=(int)(m);i<(int)(n);i++)
#define rep(i, n) repi(i, 0, n)
#define repill(i, m, n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define repll(i, n) repill(i, 0, n)
#define revi(i, m, n) for(int i=(int)(m);i>(int)(n);i--)
#define rev(i, n) revi(i, 0, n)
#define revill(i, m, n) for(ll i=(ll)(m);i>(ll)(n);i--)
#define revll(i, n) revill(i, 0, n)
#define sz(v) ((int)(v).size())
#define each(i, n) for(auto&& i: n)
#define all(n) (n.begin(), n.end())
#define allr(n) (n.rbegin(), n.rend())
#define sp(n) cout << fixed << setprecision(n)
#pragma endregion
int main() {
int A, B, C;
ci(A, B, C);
if(A <= C && C <= B){
co("Yes");
}
else{
co("No");
}
} | 1 | 7,444,335 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define For(i,n,k) for(int i=(n);i<(k);i++)
#define ALL(a) (a).begin(),(a).end()
void Main(){
int n;cin>>n;
vector<double> a(n);
For(i,0,n) cin>>a[i];
sort(ALL(a));
For(i,0,n-1) a[i+1]=(a[i]+a[i+1])/2;
cout<<fixed<<setprecision(8)<<a[n-1]<<endl;
}
int main(){
Main();
return 0;
} | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <bitset>
#include <string>
#include <cmath>
#include <complex>
#include <numeric>
#include <cassert>
#include <vector>
#include <array>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <utility>
#define int64 long long
#define uint64 unsigned long long
#define PI 3.1415926535897932384626433832795
#define coutfix(i) cout << fixed << setprecision(i)
using namespace std;
int main()
{
int64 nn;
cin >> nn;
vector<int64> vv(nn);
long double ans;
for(int64 ii = 0;ii < nn;ii++)
{
cin >> vv[ii];
}
sort(vv.begin(), vv.end());
ans = vv[0];
for(int64 ii = 1;ii < nn;ii++)
{
ans += vv[ii];
ans /= 2.0;
}
cout << ans << endl;
} | 1 | 1,500,120 |
#include <iostream>
#include <map>
#include <cstring>
struct card {
int number;
char suit;
int order;
};
void swap(int i, int j, card a[]) {
card tmp = a[i];
a[i] = a[j];
a[j] = tmp;
}
int main() {
int n;
std::cin >> n;
int orders[9];
for (int i=0; i<9; i++) {
orders[i] = 0;
}
card a[n];
for (int i=0; i<n; i++) {
std::cin >> a[i].suit >> a[i].number;
a[i].order = orders[a[i].number];
orders[a[i].number]++;
}
card b[n];
memcpy(b, a, n * sizeof(card));
for (int i=0; i<n; i++) {
for (int j=n-1; j>i; j--) {
if ( a[j-1].number > a[j].number ) {
swap(j, j-1, a);
}
}
}
for (int i=0; i<n-1; i++) {
std::cout << a[i].suit << a[i].number << " ";
}
std::cout << a[n-1].suit << a[n-1].number << std::endl;
int bubble_orders[9];
for (int i=0; i<9; i++) {
bubble_orders[i] = 0;
}
std::string str = "Stable";
for (int i=0; i<n; i++) {
if ( bubble_orders[a[i].number] > a[i].order ) {
str = "Not stable";
} else {
bubble_orders[a[i].number] = a[i].order;
}
}
std::cout << str << std::endl;
for (int i=0; i<n; i++) {
int mini = i;
for (int j=i+1; j<n; j++) {
if ( b[mini].number > b[j].number ) {
mini = j;
}
}
swap(mini, i, b);
}
for (int i=0; i<n-1; i++) {
std::cout << b[i].suit << b[i].number << " ";
}
std::cout << b[n-1].suit << b[n-1].number << std::endl;
int selection_orders[9];
for (int i=0; i<9; i++) {
selection_orders[i] = 0;
}
std::string str2 = "Stable";
for (int i=0; i<n; i++) {
if ( selection_orders[b[i].number] > b[i].order ) {
str2 = "Not stable";
} else {
selection_orders[b[i].number] = b[i].order;
}
}
std::cout << str2 << std::endl;
} | #include <iostream>
#include <string>
#include <vector>
using namespace std;
bool kansu( pair< string, long long int > p, pair< string, long long int > q ) {
if ( p.first[1] < q.first[1] ) return true;
return false;
}
void print( long long int n, vector< pair< string, long long int > > v ) {
bool f = true;
for ( long long int i = 0; i < n; i++ ) {
if ( i != 0 ) {
cout << " ";
if ( v[i-1].first[1] == v[i].first[1] && v[i-1].second > v[i].second ) f = false;
}
cout << v[i].first;
}
cout << endl;
if ( f == true ) {
cout << "Stable" << endl;
}else {
cout << "Not stable" << endl;
}
return;
}
void BubbleSort( long long int n, vector< pair< string, long long int > > v ) {
for ( long long int i = 0; i < n; i++ ) {
for ( long long int j = n - 1; j > i; j-- ) {
if ( kansu( v[j], v[j-1] ) == true ) swap( v[j], v[j-1] );
}
}
print( n, v );
return;
}
void SelectionSort( long long int n, vector< pair< string, long long int > > v ) {
for ( long long int i = 0; i < n; i++ ) {
long long int minj = i;
for ( long long int j = i; j < n; j++ ) {
if ( kansu( v[j], v[minj] ) == true ) minj = j;
}
swap( v[i], v[minj] );
}
print( n, v );
return;
}
int main() {
long long int n;
cin >> n;
vector< pair< string, long long int > > v;
for ( long long int i = 0; i < n; i++ ) {
string in;
cin >> in;
v.push_back( make_pair( in, i ) );
}
BubbleSort( n, v );
SelectionSort( n, v );
return 0;
} | 1 | 84,936,203 |
#include <bits/stdc++.h>
using namespace std;
long long INF = 10000000;
int main(){
int N, A, B, C;
cin >> N >> A >> B >> C;
vector<int> l(N);
for (int i = 0; i < N; i++){
cin >> l[i];
}
int ans = INF;
for (int i = 0; i < (1 << (N * 2)); i++){
int a = 0;
int b = 0;
int c = 0;
int tmp = 0;
for (int j = 0; j < N; j++){
if ((i >> (j * 2)) & 1){
if ((i >> (j * 2 + 1)) & 1){
if (a != 0){
tmp += 10;
}
a += l[j];
} else {
if (b != 0){
tmp += 10;
}
b += l[j];
}
} else {
if ((i >> (j * 2 + 1)) & 1){
if (c != 0){
tmp += 10;
}
c += l[j];
}
}
}
if (a != 0 && b != 0 && c != 0){
vector<int> L(3);
L[0] = a;
L[1] = b;
L[2] = c;
sort(L.begin(), L.end());
tmp += abs(L[0] - C);
tmp += abs(L[1] - B);
tmp += abs(L[2] - A);
ans = min(ans, tmp);
}
}
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
const int INF = 1e9;
int N, A, B, C;
vector<int> l;
int dfs(int i, int a, int b, int c) {
if (i == N) {
if (a == 0 || b == 0 || c == 0) return INF;
return abs(A - a) + abs(B - b) + abs(C - c);
}
int res = dfs(i+1, a, b, c);
res = min(res, dfs(i+1, a + l[i], b, c) + (a == 0 ? 0: 10));
res = min(res, dfs(i+1, a, b + l[i], c) + (b == 0 ? 0: 10));
res = min(res, dfs(i+1, a, b, c + l[i]) + (c == 0 ? 0: 10));
return res;
}
void solve() {
cin >> N >> A >> B >> C;
l.resize(N);
for (int i = 0; i < N; i++) cin >> l[i];
cout << dfs(0, 0, 0, 0) << endl;
}
int main() {
solve();
return 0;
} | 1 | 15,734,714 |
#include <algorithm>
#include <array>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <forward_list>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
const int N = 100;
const long double EPS = 1e-9;
using namespace std;
template <class T>
T gcd(T a, T b) {
if (b == 0) return a;
return gcd(b, a % b);
}
int arr[N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, m, total, nc;
cin >> n >> m;
total = 0;
for (int i = 0; i < n; ++i) {
cin >> arr[i];
total += arr[i];
}
double lim = (double)total / (4 * m);
nc = 0;
for (int i = 0; i < n; ++i) {
nc += (arr[i]-lim>=0);
}
if (nc >= m)
cout << "Yes" << '\n';
else
cout << "No" << '\n';
} | #include<iostream>
#include<algorithm>
#include<string>
#include<cmath>
using namespace std;
int main() {
int N, M;
float A[110];
float sum = 0;
int c = 0;
cin >> N >> M;
for(int i = 0; i < N; i++) {
cin >> A[i];
sum += A[i];
}
sort(A, A+N, greater<int>());
for(int i = 0; i < N; i++){
if(A[i] >= (float)sum/(4*M)) c++;
}
if(c >= M) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | 1 | 100,014,188 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string a,b;
cin >> a >> b;
if ( a=="H") {
cout << b << '\n';
} else {
cout << ( b=="H" ? "D" : "H" ) << '\n';
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
string a, b, ans="H";
cin >> a >> b;
if(a!=b) ans = "D";
cout << ans << endl;
} | 1 | 19,042,272 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int maxn = 2e5 + 10;
int arr[maxn];
signed main() {
int N;
cin >> N;
for (int i = 1; i <= N; ++i) {
cin >> arr[i];
}
int mx = arr[1], ans = 0;
for (int i = 2; i <= N; ++i) {
if (arr[i] > mx) {
mx = arr[i];
} else {
ans += mx - arr[i];
}
}
cout << ans << endl;
system("pause");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define int long long
const int N=1e9+7;
int32_t main()
{
IOS;
int n;
cin>>n;
int arr[n];
for(int i=0;i<n;i++)
{
cin>>arr[i];
}
int ans=0;
for(int i=1;i<n;i++)
{
if(arr[i]<arr[i-1])
{
ans=ans+abs(arr[i]-arr[i-1]);
arr[i]=arr[i-1];
}
}
cout<<ans;
} | 1 | 55,660,873 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const long long INF = 1e18;
# define len(x) ((int)(x).size())
# define rep(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
# define reps(i, n) for(int i=1, i##_len=(n); i<=i##_len; ++i)
# define rrep(i, n) for(int i=((int)(n)-1); i>=0; --i)
# define rreps(i, n) for(int i=((int)(n)); i>0; --i)
# define foreps(i, m, n) for(int i = m;i < n;i++)
# define ALL(x) (x).begin(), (x).end()
# define rall(x) (x).rbegin(), (x).rend()
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; }
int main() {
string str; cin >> str;
ll A = stoi(str) / 1000;
ll B = stoi(str) / 100 % 10;
ll C = stoi(str) / 10 % 10;
ll D = stoi(str) % 10;
vector<char> op1 = { '+', '-', '+', '-', '-', '+', '+', '-' };
vector<char> op2 = { '+', '-', '-', '+', '-', '+', '-', '+' };
vector<char> op3 = { '+', '-', '+', '-', '+', '-', '-', '+' };
rep(i, 8) {
if (op1[i] == '+') {
if (op2[i] == '+') {
if (op3[i] == '+') {
if (A + B + C + D == 7) {
cout << A << '+' << B << '+' << C << '+' << D << '=' << '7' << endl;
return 0;
}
} else {
if (A + B + C - D == 7) {
cout << A << '+' << B << '+' << C << '-' << D << '=' << '7' << endl;
return 0;
}
}
} else {
if (op3[i] == '+') {
if (A + B - C + D == 7) {
cout << A << '+' << B << '-' << C << '+' << D << '=' << '7' << endl;
return 0;
}
} else {
if (A + B - C - D == 7) {
cout << A << '+' << B << '-' << C << '-' << D << '=' << '7' << endl;
return 0;
}
}
}
} else {
if (op2[i] == '+') {
if (op3[i] == '+') {
if (A - B + C + D == 7) {
cout << A << '-' << B << '+' << C << '+' << D << '=' << '7' << endl;
return 0;
}
} else {
if (A - B + C - D == 7) {
cout << A << '-' << B << '+' << C << '-' << D << '=' << '7' << endl;
return 0;
}
}
} else {
if (op3[i] == '+') {
if (A - B - C + D == 7) {
cout << A << '-' << B << '-' << C << '+' << D << '=' << '7' << endl;
return 0;
}
} else {
if (A - B - C - D == 7) {
cout << A << '-' << B << '-' << C << '-' << D << '=' << '7' << 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;
void solve(std::string S){
char op[2] = {'+', '-'};
int ret = S[0]-'0';
for(int i=0; i<2; i++) {
int x = ret;
if(op[i]=='+') ret += (S[1]-'0');
else ret -= (S[1]-'0');
for(int j=0; j<2; j++) {
int x = ret;
if(op[j]=='+') ret += (S[2]-'0');
else ret -= (S[2]-'0');
for(int k=0; k<2; k++) {
int x = ret;
if(op[k]=='+') ret+= (S[3]-'0');
else ret -= (S[3]-'0');
if(ret == 7) {
std::cout << S[0]<<op[i]<<S[1]<<op[j]<<S[2]<<op[k]<<S[3]<<"=7"<< std::endl;
return;
}
ret = x;
}
ret = x;
}
ret = x;
}
}
int main(){
std::string ABCD;
std::cin >> ABCD;
solve(ABCD);
return 0;
} | 1 | 93,934,547 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define INF 1999999999
#define MODA 1000000007
#define PI 3.1415926535897932384626433
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n, a;
cin >> n >> a;
cout << n*n - a << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a = 0,b = 0,c = 0;
cin >> a >> b;
c = a * a - b;
cout << c << endl;
} | 1 | 47,963,033 |
#include <bits/stdc++.h>
using namespace std;
int cnt[26];
int main(){
string s;
cin>>s;
for(int i=0;i<s.size();i++)
cnt[s[i]-'a']++;
for(int i=0;i<26;i++)
if(cnt[i]>1){
cout<<"no"<<endl;
return 0;
}
cout<<"yes"<<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;
using P = pair<int,string>;
int main() {
string s;
cin >> s;
set<char> a;
rep(i,s.size()){
a.insert(s.at(i));
}
if(a.size() == s.size()) cout << "yes" << endl;
else cout << "no" << endl;
} | 1 | 1,475,260 |
#include <iostream>
#include <vector>
#include <cstdio>
using namespace std;
int main(void){
int height,width;
vector<int> vec_height,vec_width;
cin >> height >> width;
vec_height.push_back(height);
vec_width.push_back(width);
for(int i = 0;height + width;i++){
cin >> height >> width;
vec_height.push_back(height);
vec_width.push_back(width);
}
for(int i = 0;vec_height[i] + vec_width[i];i++){
for (int j=0;j < vec_height[i];j++){
for(int k=0;k < vec_width[i];k++)
printf("#");
printf("\n");
}
printf("\n");
}
} | #include <iostream>
#include <string>
using namespace std;
int row(int w);
int main() {
int h, w;
while(1) {
cin >> h >> w;
if((h + w) == 0) break;
for(int j = 0; j < h; j++) {
row(w);
}
cout << endl;
}
return 0;
}
int row(int w){
for(int i = 0; i < w; i++) {
cout << "#";
}
cout << endl;
return 0;
} | 1 | 74,708,701 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
int main() {
ll a,b,c;
cin>>a>>b>>c;
cout << c-min(a-b,c);
return 0;
} | #pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() {
cerr << endl;
}
template <typename H, typename... T>
void d_err(H h, T... t) {
cerr << h << " ";
d_err(t...);
}
template <typename T>
void print(T x) {
cout << x << endl;
}
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REVFOR(i, m, n) for (int i = (n - 1); i >= (m); --i)
#define REP(i, n) FOR(i, 0, n)
#define REVREP(i, n) REVFOR(i, 0, n)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define bcnt __builtin_popcountll
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<ll,ll> Pll;
typedef pair<int,int> Pin;
ll INF = 1e16;
int inf = 1e9;
ll MOD = 1e9+7;
int main(){
cin.tie(0);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(20);
int A, B, C;
cin >> A >>B >> C;
print(max(0, C - A + B));
} | 1 | 19,565,143 |
#include <bits/stdc++.h>
#include <random>
#include <time.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rep1(i,n) for (int i = 1; i <= (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using ull= unsigned long long;
const ll K_MAX=1e5+5;
const ll Lmax=ll(1e18);
const int Nmax=2e5+1;
const int Nd=61;
const int INF=1e5;
int main(){
int k,x;
cin>>k>>x;
if( k*500>=x){
cout<<"Yes";
}else{
cout<<"No";
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if(b <= a * 500){
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | 1 | 85,941,231 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
int a, b;
string s;
cin >> a >> b >> s;
for (int i=0; i<s.size(); i++){
if ((i==a && s[i]!='-') || (i!=a && !(0<=s[i]-'0' && s[i]-'0'<=9))){
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
} | #include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
#include <set>
#include <unordered_set>
#include <bitset>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define REP(i, n) for(size_t i = 0; i < (n); ++i)
int main()
{
int A, B;
string S;
cin >> A >> B >> S;
REP(i, A)
{
if (S[i] == '-')
{
cout << "No" << endl;
return 0;
}
}
if (S[A] != '-')
{
cout << "No" << endl;
return 0;
}
for (int i = A + 1; i < A + B + 1; ++i)
{
if (S[i] == '-')
{
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
} | 1 | 47,581,628 |
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define faster ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
typedef long long ll;
typedef vector<int> vi;;
typedef vector<ll> vll;
#define l() length()
#define sz() size()
#define b() begin()0
#define e() end()
#define all(x) x.begin(), x.end()
#define pb(i) push_back(i)
#define PB() pop_back()
typedef pair<int, int> pii;
typedef pair<ll,ll> pll;
#define mp make_pair
#define Fi first
#define Se second
const int maxx=100009;
void solve(){
int s;
cin>>s;
set<int> st;
st.insert(s);
int curr=s;
int i=1;
while(1){
i++;
curr=(curr&1)?3*curr+1:curr/2;
if(st.find(curr)!=st.end()){
cout<<i;
return ;
}
st.insert(curr);
}
}
int main() {
faster;
int t=1;
while(t-->0){
solve();
}
return 0;
} | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
int gcd(int a, int b) { return b != 0 ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
int main()
{
int N;
cin >> N;
vector<int> vec(10000010,0);
rep(i,10000000)
{
vec[N] ++;
if(vec[N]==2)
{
cout << i + 1 << endl;
return 0;
}
if(N%2==0)
{
N /= 2;
}
else
{
N *= 3;
N += 1;
}
}
return 0;
} | 1 | 9,096,951 |
#include <bits/stdc++.h>
using namespace std;
#define modulo 1000000007
#define mod(mod_x) ((((long long)mod_x+modulo))%modulo)
#define Inf 100000001
int main(){
int N;
cin>>N;
vector<int> A(N);
long long maxi;
long long ans = 0LL;
for(int i=0;i<N;i++){
cin>>A[i];
if(i==0)maxi = A[i];
else{
maxi = max(maxi,(long long)A[i]);
ans += abs(maxi-A[i]);
}
}
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll a[202020],n,ans;
int main(){
ios::sync_with_stdio(0);cin.tie(0);
cin>>n;
for(int i=0; i<n; i++){
cin>>a[i];
if(i){
if(a[i] < a[i-1]){
ans += a[i-1] - a[i];
a[i] = a[i-1];
}
}
}
cout<<ans<<'\n';
} | 1 | 54,105,110 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
vector<int>v;
int n,k,i,a,count=0;
cin>>n>>k;
for(i=0; i<n; i++)
{
cin>>a;
v.push_back(a);
}
for(i=0; i<n; i++)
{
if(v[i]>=k)
count++;
}
cout<<count<<endl;
return 0;
} | #include <bits/stdc++.h>
#define FASTIO ios::sync_with_stdio(false);cin.tie(0);
#define ADD +
#define SUBTRACT -
#define MULTIPLY *
#define DIVIDE /
#define MOD %
#define INCREMENT(x) ++x
#define DECREMENT(x) --x
#define in(a,b) cin>>a>>b;
#define out(a,b) cout<<a<<endl<<b<<endl;
#define scan(a) scanf("%d",&a);
#define print(a) printf("%d\n",a);
#define scanii(a,b) scanf("%d %d",&a,&b);
#define printii(a,b) printf("%d\n%d\n",a,b);
#define scaniii(a,b,c) scanf("%d %d %d",&a,&b,&c);
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define ll long long
#define ull unsigned long long
#define sll signed long long
#define pi acos(-1)
#define mod 1000000007
#define TRUE 1
#define FALSE 0
#define ZERO 0
#define MP make_pair
#define F first
#define S second
#define f1(i,a) for(int i=0;i<a;++i)
#define f2(i,a) for(int i=a-1;i>=0;--i)
#define en puts("");
#define elif else if
typedef ll int lli;
typedef sll int slli;
typedef ull int ulli;
const int sz=10000;
using namespace std;
int clue();
int result();
void show();
bool check(int n) {
for(int i=2;i*i<=n;++i) {
if(n%i==0)
return false;
}
return true;
}
bool cmp(int p,int q) {
return p>q;
}
int main() {
int t;
t=1;
while(t-->0) {
clue();
}
return 0;
}
int clue() {
int n,k;
cin>>n>>k;
int x;
int p=0;
f1(i,n) {
cin>>x;
if(x>=k)++p;
}
cout<<p<<endl;
return 0;
} | 1 | 28,462,452 |
#include <stdio.h>
int main(){
int N,M,Bilangan_Genap,Bilangan_Ganjil;
scanf("%d %d", &N,&M);
if (N==1 && M==1) {
printf("0\n");
}
else {
N=N-1;
M=M-1;
Bilangan_Genap=(N*(N+1))/2;
Bilangan_Ganjil=(M*(M+1)/2);
printf("%d\n",Bilangan_Genap+Bilangan_Ganjil);
}
return 0;
} | #include <bits/stdc++.h>
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++)
typedef long long ll;
int main() {
int n,m;
cin >> n >> m;
cout << n*(n-1)/2 + m*(m-1)/2;
} | 1 | 54,951,286 |
#include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
#include <functional>
#include <cmath>
#include <set>
#include <queue>
#include <deque>
#include <vector>
#include <climits>
#include <sstream>
#include <iomanip>
#include <map>
#include <stack>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
int main()
{
string s;
cin >> s;
vector<pair<char, int>> list;
for (auto i = 0; i < (int)s.length(); ++i)
{
if (s[i] != 'x')
{
list.push_back({ s[i], i });
}
}
auto valid = true;
auto len = (int)list.size();
for (auto i = 0; i < len / 2; ++i)
{
if (list[i].first != list[len - i - 1].first)
{
valid = false;
}
}
auto ans = -1;
if (valid)
{
ans = 0;
if (len > 0)
{
auto left = len / 2;
auto right = len / 2;
if (len % 2 == 0)
{
--left;
}
left = list[left].second;
right = list[right].second;
while (left >= 0 || right < (int)s.length())
{
if (left < 0)
{
++ans;
++right;
}
else if (right >= (int)s.length())
{
++ans;
--left;
}
else if (s[left] == s[right])
{
++right;
--left;
}
else if (s[left] == 'x')
{
--left;
++ans;
}
else
{
++right;
++ans;
}
}
}
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int solve(const string& s)
{
int l = 0;
int r = s.length() - 1;
int ans = 0;
while (l < r) {
if (s[l] == s[r]) {
++l;
--r;
}
else if (s[l] == 'x') {
++l;
++ans;
}
else if (s[r] == 'x') {
--r;
++ans;
}
else {
return -1;
}
}
return ans;
}
int main()
{
string s;
cin >> s;
cout << solve(s) << endl;
} | 1 | 13,517,171 |
#include <bits/stdc++.h>
using namespace std;
#define finish(x) return cout << x << endl, 0
#define ll long long
int n;
vector <ll> a;
ll calc(ll m){
ll ret = 0;
for(auto &i : a){
if((i + m) % (n + 1) == n) return -1;
ret += (i + m) / (n + 1);
}
return ret;
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
a.resize(n);
for(auto &i : a) cin >> i;
ll s = 0;
for(auto &i : a) s += i;
for(ll i = max(0LL, s - 100000) ; i <= s + 100000 ; i++){
if(calc(i) == i) finish(i);
}
} | #include <iostream>
#include <cstdio>
using namespace std;
typedef long long ll;
ll n;
ll a[55];
ll cnt;
int main()
{
scanf("%lld", &n);
for(ll i = 0; i < n; i++)
{
scanf("%lld", &a[i]);
}
while(1)
{
ll mx = -1, mi = 0;
for(ll i = 0; i < n; i++)
{
if(a[i] >= mx) mx = a[i], mi = i;
}
ll t = a[mi] / n;
if(t == 0) break;
a[mi] %= n;
for(ll i = 0; i < n; i++)
{
if(i == mi) continue;
a[i] += t;
}
cnt += t;
}
cout<<cnt<<endl;
return 0;
} | 1 | 11,939,101 |
#include <cstdio>
#include <iostream>
#include <iomanip>
#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <utility>
#include <cmath>
#include <climits>
#define ll long long int
#define pb push_back
#define mk make_pair
#define pq priority_queue
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
int main(int argc, char const* argv[])
{
int n;
cin >> n;
int k;
for(int i = 1; i < 1000; i++){
if(2 * n == i * (i + 1)){
k = i;
break;
}else if(2 * n < i * (i + 1)){
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
cout << k + 1 << endl;
vector<vector<int> > vec;
vec.resize(k + 1);
int fin = 1;
for(int i = 0; i < k; i++){
for(int j = 0; j < k - i; j++){
vec[i].pb(fin + j);
}
for(int j = 0; j < k - i; j++){
vec[j + i + 1].pb(fin + j);
}
fin = fin + k - i;
}
for(int i = 0; i < k + 1; i++){
cout << k << " ";
for(int j = 0; j < k; j++){
cout << vec[i][j];
if(j != k - 1)cout << " ";
}
cout << endl;
}
return 0;
} | #include<iostream>
#include<stdio.h>
#include<math.h>
#include<vector>
#include<array>
#include<list>
#include<string>
#include<map>
#include<stack>
#include<queue>
#include<algorithm>
#include<functional>
#include<memory>
using namespace std;
using ll = unsigned long long;
using vec = vector<int>;
using mat = vector<vec>;
int main()
{
int N;
cin >> N;
if (N == 1)
{
cout << "Yes" << endl;
cout << "2" << endl;
cout << "1 1" << endl;
cout << "1 1" << endl;
return 0;
}
int SNum = 3;
for (SNum = 3;; ++SNum)
{
if (SNum*(SNum - 1) / 2 == N)
{
break;
}
if (SNum*(SNum + 1) / 2 > 100000)
{
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
cout << SNum << endl;
mat E(SNum, vec(SNum));
int id = 1;
for (int i = 0; i < SNum; ++i)
{
for (int j = i+1; j < SNum; ++j)
{
if (i == j)continue;
E[i][j] = id;
E[j][i] = id;
id++;
}
}
for (int i = 0; i < SNum; ++i)
{
cout << SNum - 1 << " ";
for (int j = 0; j < SNum; ++j)
{
if (i == j)continue;
cout << E[i][j] << " ";
}
cout << endl;
}
return 0;
} | 1 | 13,801,055 |
#include <stdio.h>
#include<algorithm>
using namespace std;
const static int N = 36;
typedef struct{
int value;
char suit;
}card;
void print(card A[], int n) {
for(int i = 0; i < n; i++) {
if(i) printf(" ");
printf("%c%d", A[i].suit, A[i].value);
}
}
void swapCard(card A[], int index1, int index2) {
card temp = A[index1];
A[index1] = A[index2];
A[index2] = temp;
}
void bubbleSort(card A[], int n) {
for(int i = 0; i < n; i++) {
for(int j = n-1; j >= i+1; j--) {
if(A[j].value < A[j-1].value)
swapCard(A, j, j-1);
}
}
}
void selectionSort(card A[], int n) {
int i, j;
for(i = 0; i < n; i++) {
int mini = i;
for(j = i; j < n; j++) {
if(A[j].value < A[mini].value)
mini = j;
}
if(A[i].value != A[mini].value)
swapCard(A, i, mini);
}
}
bool isStable(card b[], card s[], int n) {
for(int i = 0; i < n; i++) {
if(b[i].suit != s[i].suit)
return false;
}
return true;
}
int main()
{
int n;
card A[N];
card b[N];
card s[N];
scanf("%d", &n);
for(int i = 0; i < n; i++) {
scanf(" %c%d", &A[i].suit, &A[i].value);
b[i] = A[i];
s[i] = A[i];
}
bubbleSort(b, n);
print(b, n);
printf("\nStable\n");
selectionSort(s, n);
print(s, n);
if(isStable(b, s, n))
printf("\nStable\n");
else
printf("\nNot stable\n");
return 0;
} | #include<iostream>
struct Card {char suit, value; };
void bubble(struct Card A[], int N) {
for (int i = 0; i < N; i++) {
for (int j = N - 1; j >= i; j--) {
if (A[j].value < A[j-1].value) {
Card t = A[j]; A[j] = A[j - 1]; A[j - 1] = t;
}
}
}
}
void selection(struct Card A[], int N) {
for (int i = 0; i < N; i++) {
int minj = i;
for (int j = i; j < N; j++) {
if (A[j].value < A[minj].value) {
minj = j;
}
}
Card t = A[i]; A[i] = A[minj]; A[minj] = t;
}
}
void print(struct Card A[], int N) {
for (int i = 0; i < N; i++) {
if (i > 0) {
std::cout << " ";
}
std::cout << A[i].suit << A[i].value;
}
std::cout << std::endl;
}
bool isStable(struct Card C1[], struct Card C2[], int N) {
for (int i = 0; i < N; i++) {
if(C1[i].suit != C2[i].suit) {
return false;
}
}
return true;
}
int main() {
Card C1[100], C2[100];
int N;
char ch;
std::cin >> N;
for (int i = 0; i < N; i++) {
std::cin >> C1[i].suit >> C1[i].value;
}
for (int i = 0; i < N; i++) {
C2[i] = C1[i];
}
bubble(C1, N);
selection(C2, N);
print(C1, N);
std::cout << "Stable" << std::endl;
print(C2, N);
if (isStable(C1, C2, N)) {
std::cout << "Stable" << std::endl;
} else {
std::cout << "Not stable" << std::endl;
}
return 0;
} | 1 | 75,918,945 |
#include <iostream>
#include <string>
#include <regex>
int main() {
std::string str;
std::cin >> str;
std::regex re(",+");
std::string format = " ";
std::cout << std::regex_replace(str, re, format) << std::endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
ll mm=1000000000;ll MM=mm+7;
#define rep(i, n) for(int i=0;i<n;i++)
#define PI 3.141592653589793
int main(){
string s;
cin >> s;
s.at(5)=' ';
s.at(13)=' ';
cout << s << endl;
} | 1 | 87,773,330 |
#define LOCAL
#undef _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false);cin.tie(0)
#define all(x) x.begin(), x.end()
#define ff first
#define ss second
#define LLINF 1e18
#define INF (int)1e9+1
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string& s) {
return '"' + s + '"';
}
string to_string(const char* s) {
return to_string((string)s);
}
string to_string(bool b) {
return (b ? "true" : "false");
}
string to_string(vector<bool> v) {
bool first = true;
string res = "{";
for (int i = 0; i < static_cast<int>(v.size()); i++) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(v[i]);
}
res += "}\n";
return res;
}
template <size_t N>
string to_string(bitset<N> v) {
string res = "";
for (size_t i = 0; i < N; i++) {
res += static_cast<char>('0' + v[i]);
}
return res;
}
template <typename A>
string to_string(A v) {
bool first = true;
string res = "{";
for (const auto& x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}\n";
return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
template <typename A, typename B, typename C, typename D, typename E>
string to_string(tuple<A, B, C, D, E> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + "," + to_string(get<4>(p)) + ")";
}
void debug_out() {
cerr << endl;
}
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#ifdef LOCAL
#define debug(...) cerr << "\n[" << #__VA_ARGS__ << "]:\n", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
using llong = long long;
using PII = pair<int, int>;
const llong MOD = 998244353LL;
int main() {
IOS;
string s1, s2; cin >> s1 >> s2;
int n1, n2; cin >> n1 >> n2;
string s; cin >> s;
if (s == s1) cout << n1 - 1 << " "<< n2;
else cout << n1 << " " << n2-1;
} | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
typedef long long ll;
int main(){
string s,t;
cin>>s>>t;
int a,b;
cin>>a>>b;
string k; cin>>k;
if(k==s) cout<<a-1<<" "<<b<<endl;
else cout<<a<<" "<<b-1<<endl;
} | 1 | 56,881,776 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x1,y1,x2,y2;
cin>>x1>>y1>>x2>>y2;
int xv=-(y2-y1);
int yv=x2-x1;
cout<<x2+xv<<' '<<y2+yv<<' '<<x1+xv<<' '<<y1+yv<<endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int a[4];rep(i,4)cin>>a[i];
cout<<a[2]+(a[1]-a[3])<<" "<<a[3]+(a[2]-a[0])<<" "<<a[0]+(a[1]-a[3])<<" "<<a[1]+(a[2]-a[0])<<endl;
return 0;
} | 1 | 34,570,297 |
#include<iostream>
using namespace std;
int main()
{
for(;;){
int n,ans=0;
cin >> n;
if(n==0)return 0;
n=1000-n;
while(n>=500){
n-=500;
ans++;
}
while(n>=100){
n-=100;
ans++;
}
while(n>=50){
n-=50;
ans++;
}
while(n>=10){
n-=10;
ans++;
}
while(n>=5){
n-=5;
ans++;
}
while(n>=1){
n-=1;
ans++;
}
cout<< ans << "\n";
}
} | #include <iostream>
using namespace std;
const int COINS[] = { 500, 100, 50, 10, 5, 1 };
int main(){
while(true){
int n;
cin >> n;
if(n == 0){ break; }
n = 1000 - n;
int answer = 0;
for(int i = 0; n > 0; i++){
while(n >= COINS[i]){
n -= COINS[i];
answer++;
}
}
printf("%d\n", answer);
}
return 0;
} | 1 | 33,460,426 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mod(n,k) ( ( ((n) % (k)) + (k) ) % (k))
#define forn(i,a,b) for(int i = a; i < b; i++)
#define forr(i,a,b) for(int i = a; i >= b; i--)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef long double ld;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
#define si cout << "Yes\n";
#define no cout << "No\n";
int solve(int r,int g,int b,int k){
if(g > r && b > g)return 1;
if(!k)return 0;
int res = 0;
res |= solve(r*2,g,b,k-1);
res |= solve(r,g*2,b,k-1);
res |= solve(r,g,b*2,k-1);
return res;
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
int r,g,b,k; cin >> r >> g >> b >> k;
int res = solve(r,g,b,k);
if(res){
si;
return 0;
}
no;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int A,B,C,K;
cin >> A >> B >> C >> K;
for(int i=0;i<K;i++){
if(B<=A){
B*=2;
}else if(C<=B){
C*=2;
}else{
cout << "Yes" << endl;
return 0;
}
}
if((B>A)&&(C>B)){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
return 0;
} | 1 | 50,645,570 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
int main() {
int N,s=0,t;
cin >> N;
vector<int> A(N+2);
A.at(0)=0, A.at(N+1)=0;
rep(i,N) {
cin >> A.at(i+1);
s += abs(A.at(i+1)-A.at(i));
}
s += abs(A.at(N+1)-A.at(N));
rep(i,N) {
t = abs(A.at(i+1)-A.at(i))+abs(A.at(i+2)-A.at(i+1))-abs(A.at(i+2)-A.at(i));
cout << s-t << endl;
}
} | #include<bits/stdc++.h>
using namespace std;
#define sz size()
#define mk make_pair
#define clr clear()
#define B begin()
#define E end()
#define EM empty()
#define mem(a,b) memset(a,b,sizeof(a))
#define rep(i,n) for(i=0;i<n;i++)
#define Rep(i,n) for(i=1;i<=n;i++)
#define all(cont) cont.begin(),cont.end()
#define pb push_back
string en="\n";
string t="hello";
#define sqr(a) ((a) * (a))
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL)
#define pi 3.1415926535897932384626433832795
#define vi vector<int>
#define vl vector<long long>
#define vs vector<string>
#define vp(vi,x) cin>>x; vi.pb(x);
#define LB(a,x) (lower_bound(aov(a),x)-a.begin())
#define UB(a,x) (upper_bound(aov(a),x)-a.begin())
typedef long long LL;
typedef unsigned long long ULL;
bool isVowel(char ch){ ch=toupper(ch); if(ch=='A'||ch=='U'||ch=='I'||ch=='O'||ch=='E') return true; return false;}
int toInt(string s){int sm;stringstream ss(s);ss>>sm;return sm;}
template<typename T>inline T gcd(T a,T b){if(a<0)return gcd(-a,b);if(b<0)return gcd(a,-b);return (b==0)?a:gcd(b,a%b);}
template<typename T>inline T lcm(T a,T b) {if(a<0)return lcm(-a,b);if(b<0)return lcm(a,-b);return a*(b/gcd(a,b));}
int main()
{
LL i,j,k,n,m,l,s=0,x,y,tc=1,c=0;
while(cin>>n)
{
vi a,aa;
l=0,s=0;
a.pb(0);
rep(i,n)
{
cin>>x;
a.pb(x);
l=abs(l-x);
s+=l;
l=x;
}
a.pb(0);
l=abs(l-0);
s+=l;
for(i=1;i<n+1;i++)
{
x=s-(abs(a[i]-a[i-1])+abs(a[i+1]-a[i]));
x+=abs(a[i+1]-a[i-1]);
cout<<x<<en;
}
}
} | 1 | 65,452,660 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n=0,m=0,l=0;
string s;
cin >> s;
for(int i=0;i<3;i++){
if(s.at(i)=='a'){
n++;
}
else if(s.at(i)=='b'){
m++;
}
else if(s.at(i)=='c'){
l++;
}
}
if(n==1&&m==1&&l==1){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main () {
string s;
cin >> s;
int a=s[0]+s[1]+s[2];
int b='a'+'b'+'c';
if(a==b) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | 1 | 84,785,177 |
#include <iostream>
using namespace std;
int main() {
int d, t, s;
cin >> d >> t >> s;
if (t * s >= d) {
cout << "Yes" << endl;
}else {
cout << "No" << endl;
}
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
float s,t,v;
cin>>s>>t>>v;
if((s/v)<=t)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
} | 1 | 36,988,885 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <map>
#include <queue>
static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using namespace std;
template<class T>
constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;
int main() {
int n;
cin >> n;
vector<ll> v(n);
for (auto &&i : v) scanf("%lld", &i);
ll ans = 0;
while(true){
ll sum = 0;
for (int i = 0; i < n; ++i) {
sum += v[i]/n;
}
if(sum == 0) break;
for (int i = 0; i < n; ++i) {
v[i] = sum - v[i]/n + v[i]%n;
}
ans += sum;
}
cout << ans << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); i++)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
using P = pair<int, int>;
const int INF = 1e9;
const long long LINF = 1e18;
const long long MOD = 1e9 + 7;
signed main(){
int n;
cin >> n;
ll a[n];
rep(i,n){
cin >> a[i];
}
auto isOK = [&](ll m){
for(ll i = max(0LL, m - n); i <= m; i++){
ll t[n];
rep(j,n){
t[j] = a[j] + i;
}
ll cnt = 0;
rep(j,n){
cnt += (t[j] - (n - 1) + n) / (n + 1);
}
if(cnt <= i) return true;
}
return false;
};
ll ng = -1, ok = LINF;
while(abs(ok - ng) > 1){
ll mid = (ok + ng) / 2;
if(isOK(mid)){
ok = mid;
}else{
ng = mid;
}
}
cout << ok << endl;
return 0;
} | 1 | 43,032,251 |
#include<iostream>
#include<string>
#include<vector>
#include<utility>
#include<algorithm>
#include<queue>
int main() {
int A, B, C, K;
std::cin >> A >> B >> C >> K;
int answer;
if (A >= K) answer = K;
else if (A + B >= K) answer = A;
else answer = A - (K - A - B);
std::cout << answer << std::endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using Graph = vector<vector<int>>;
int main(void)
{
ll a,b,c,k,sum=0;
cin >> a >> b >> c >> k;
while(k>0 && a>0)
{
sum++;
k--;
a--;
}
while(k>0 && b>0)
{
k--;
b--;
}
while(k>0 && c>0)
{
sum--;
k--;
c--;
}
cout << sum << endl;
return 0;
} | 1 | 86,815,386 |
#include <bits/stdc++.h>
#define rep(i,n) for (long long i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
const ll MOD = 1000000007;
int main(){
ll N,K,R,S,P,ans=0;
string T;
cin >> N >> K >> R >> S >> P >> T;
rep(i,K){
ll j=0;
while(i+j*K<N){
if(T.at(i+j*K)=='r'){
ans+=P;
}else if(T.at(i+j*K)=='s'){
ans+=R;
}else{
ans+=S;
}
if(i+(j+1)*K<N){
if(T.at(i+j*K)==T.at(i+(j+1)*K)){
j++;
}
}
j++;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i < n;i++)
using ll = long long;
int main(){
int n,k,r,s,p;
string t; cin >>n >>k >>r >>s >>p >>t;
rep(i,n-k) {
if(t[i]==t[i+k]) t[i+k]='*';
}
int ans = 0;
rep(i,n){
if(t[i]=='r') ans += p;
if(t[i]=='s') ans += r;
if(t[i]=='p') ans += s;
}
cout << ans << endl;
return 0;
} | 1 | 19,323,847 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using uint = unsigned int;
constexpr int64_t INF = static_cast<int64_t>(1) << 60;
int main()
{
uint N, K;
cin >> N >> K;
vector<int64_t> a(N);
for (int i = 0; i < N; ++i)
{
cin >> a[i];
}
int64_t min_yen = INF;
for (int i = 0; i < 1 << N; ++i)
{
if (__builtin_popcount(i) != K)
{
continue;
}
int64_t max_height = a[0];
int64_t yen = 0;
for (int j = 1; j < N; ++j)
{
if ((i & (1 << j)) != 0)
{
if (a[j] <= max_height)
{
yen += max_height - a[j] + 1;
++max_height;
}
else
{
max_height = a[j];
}
}
else
{
if (a[j] > max_height)
{
yen = INF;
break;
}
}
}
min_yen = min(yen, min_yen);
}
cout << min_yen << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int N, K; cin >> N >> K;
vector<ll> a(N);
for(int i = 0; i < N; i++){
cin >> a[i];
}
ll ans = 1e18;
for(int i = 0; i <1<<(N - 1); i++){
bitset<18> bit(i);
if(bit.count() != K-1)continue;
ll ans1 = 0;
ll bound = a[0];
for(int j = 0; j < N - 1; j++){
if(bit[j]){
if(bound >= a[j + 1]){
ans1 += bound - a[j + 1] + 1;
}
bound++;
}
bound = max(bound, a[j + 1]);
}
ans = min(ans, ans1);
}
cout << ans << endl;
return 0;
} | 1 | 45,432,756 |
#include <iostream>
#include <sstream>
#include <cstdio>
#include <stdlib.h>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
int k=10000;
int b[2000000];
void countingsort(int a[],int n){
int c[k+1],j;
for(int i=0;i<=k;i++)c[i]=0;
for(j=0;j<n;j++)
c[a[j]]++;
for(int i=0;i<=k;i++)c[i]=c[i]+c[i-1];
j--;
for(;j>-1;j--){
b[c[a[j]]] = a[j];
c[a[j]]--;
}
}
int main(){
int n,i;
cin>>n;
int a[n];
for(i=0;i<n;i++)cin>>a[i];
countingsort(a,n);
for(i=1;i<n;i++)cout<<b[i]<<" ";
cout<<b[i]<<endl;
return 0;
} | #include<iostream>
using namespace std;
int main(){
int n;
cin >> n;
int A[n+1] = {};
int B[n+1];
int C[10001] = {};
for(int i = 0; i < n; i++){
cin >> A[i+1];
C[A[i+1]]++;
}
for(int i = 1; i <= 10000; i++){
C[i] += C[i-1];
}
for(int i = n; i >= 1; i--){
B[C[A[i]]] = A[i];
C[A[i]]--;
}
for(int i = 1; i <= n; i++){
if(i != 1) cout << " ";
cout << B[i];
}
cout << endl;
return 0;
} | 1 | 42,339,047 |
#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ll long long
#define db double
#define el "\n"
#define ld long double
#define rep(i,n) for(int i=0;i<n;i++)
#define rev(i,n) for(int i=n;i>=0;i--)
#define rep_a(i,a,n) for(int i=a;i<n;i++)
#define tr(ds, it) for(auto it=ds.begin(); it!=ds.end(); it++)
#define rtr(ds, it) for(auto it=ds.rbegin(); it!=ds.rend(); it--)
#define all(ds) ds.begin(), ds.end()
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
typedef priority_queue <int> pq;
typedef vector< long long > vi;
typedef pair<long long, long long> ii;
#define o_set tree<ii, null_type,less<ii>, rb_tree_tag,tree_order_statistics_node_update>
#define Mod 1000000007
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int main()
{
fastio;
ll n, m;
cin >> n >> m;
int x = 2 * ((m + 1) / 2), y = 1, z = x + 1, w = 2 * m + 1;
while (y < x) {
cout << y << " " << x << "\n";
y++,x--;
}
while (z < w) {
cout << z << " " << w << "\n";
z++,w--;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int n, m;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n >> m;
int a = 1, b = n;
while(a < b && m) {
cout << a << " " << b << "\n";
++a; --b; --m;
if((n & 1 ^ 1) && n - b + a >= b - a && n - 2 * b + 2 * a <= 2) --b;
}
cout << flush;
return 0;
} | 1 | 62,341,769 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
const ll INF = 1ll << 62;
const double PI = 2 * asin(1);
void yes() {printf("yes\n");}
void no() {printf("no\n");}
void Yes() {printf("Yes\n");}
void No() {printf("No\n");}
void YES() {printf("YES\n");}
void NO() {printf("NO\n");}
int H, N;
int A[int(1e3+5)], B[int(1e3+5)];
int DP[int(1e3+5)][int(1e4+5)];
int main(){
cin >> H >> N;
for (int i = 1; i <= N; i++){
cin >> A[i] >> B[i];
}
fill((int*)DP, (int*)(DP + N + 1), 1e9);
DP[0][H] = 0;
for (int i = 1; i <= N; i++){
for (int j = H; j >= 0; j--){
DP[i][j] = DP[i-1][j];
}
for (int j = H; j >= 0; j--){
int next = max(j - A[i], 0);
DP[i][next] = min(DP[i][next], DP[i-1][j] + B[i]);
}
for (int j = H; j >= 0; j--){
int next = max(j - A[i], 0);
DP[i][next] = min(DP[i][next], DP[i][j] + B[i]);
}
}
cout << DP[N][0] << endl;
return 0;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
#define rep(i, s, n) for(int i = (int)(s); i < (int)(n); i++)
ll INF = 1ll << 60;
void llchmin(ll &a, ll b){
if(a > b)
a = b;
}
void llchmax(ll &a, ll b){
if(a < b)
a = b;
}
int main(){
int h, n;
cin >> h >> n;
vi a(n), b(n);
rep(i, 0, n){
cin >> a[i] >> b[i];
}
ll dp[20020];
rep(i, 0, 20020)
dp[i] = 0;
vector<bool> check(20020, false);
check[0] = true;
rep(i, 0, 10010){
if(check[i] == false)
continue;
rep(j, 0, n){
if(check[i+a[j]]){
llchmin(dp[i+a[j]], dp[i]+b[j]);
}
else{
dp[i+a[j]] = dp[i]+b[j];
check[i+a[j]] = true;
}
}
}
ll ans;
ans = -1;
rep(i, h, 20020){
if(check[i]){
if(ans == -1)
ans = dp[i];
else
llchmin(ans, dp[i]);
}
}
cout << ans << endl;
return 0;
} | 1 | 90,158,592 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int N, K; cin >> N >> K;
vector<ll> a(N);
for(int i = 0; i < N; i++){
cin >> a[i];
}
ll ans = 1e18;
for(int i = 0; i <1<<(N - 1); i++){
bitset<18> bit(i);
if(bit.count() != K-1)continue;
ll ans1 = 0;
ll bound = a[0];
for(int j = 0; j < N - 1; j++){
if(bit[j]){
if(bound >= a[j + 1]){
ans1 += bound - a[j + 1] + 1;
}
bound++;
}
bound = max(bound, a[j + 1]);
}
ans = min(ans, ans1);
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <bitset>
using namespace std;
const long long INF = 1LL<<60;
int main() {
int N, K; cin >> N >> K;
int A[N];
for (int i = 0; i < N; i++) cin >> A[i];
long long ans = INF;
for (int bit = 0; bit < (1<<N); bit++) {
int t = bitset<20>(bit).count();
if (t < K) continue;
long long cost = 0;
int highest = A[0];
for (int i = 1; i < N; i++) {
if (bit & (1<<i) && A[i] <= highest) {
cost += highest++ - A[i] + 1;
} else {
highest = max(highest, A[i]);
}
}
ans = min(ans, cost);
}
cout << ans << endl;
} | 1 | 26,443,940 |
#include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rrep(i, n) for(int i = (n-1); i >= 0; i--)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
const ll INF = 1LL<<60;
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 Graph = vector<vector<int>>;
typedef pair<int, int> P;
vector<ll> enum_divisors(ll N){
vector<ll> res;
for (ll i = 1; i * i <= N; ++i){
if (N % i == 0){
res.push_back(i);
if (N/i != i) res.push_back(N/i);
}
}
sort(res.begin(), res.end());
return res;
}
int digit(ll a){
int res = 0;
while(a > 0){
a /= 10;
res++;
}
return res;
}
int f(ll a, ll b){
return max(digit(a),digit(b));
}
int main(){
ll N; cin >> N;
vector<ll> divisors = enum_divisors(N);
int ans = 100000000;
for(auto divisor : divisors){
ll a = divisor;
ll b = N/divisor;
ans = min(ans, f(a,b));
}
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;int k(int64_t n){int c=0;while(n!=0){n/=10;c++;}return c;}int main(){int64_t n;cin>>n;vector<int> d;for(int64_t i=1;i<=sqrt(n);i++)if(n%i==0)d.push_back(i);cout<<k(n/d.back())<<endl;} | 1 | 6,936,415 |
#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 = (1<<30)-1;
const long long LINF = (1LL<<62)-1;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
using P = pair<int, int>;
void chmax(P &a, P b) {
if (a.first < b.first) {
a.second = max(a.first, b.second);
a.first = b.first;
}
else
a.second = max(a.second, b.first);
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(1<<n);
rep(i, 1<<n) cin >> a[i];
vector<vector<P>> dp(1<<n, vector<P>(n+1));
rep(i, 1<<n)
dp[i][0].first = a[i];
rep(j, n) {
rep(i, 1<<n) {
chmax(dp[i][j+1], dp[i][j]);
if (i>>j & 1)
chmax(dp[i][j+1], dp[i^1<<j][j]);
}
}
vector<int> res(1<<n);
for (int i = 1; i < 1<<n ; i++) {
res[i] = max(res[i-1], dp[i][n].first+dp[i][n].second);
cout << res[i] << '\n';
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
int n, a[1 << 18], mx1[1 << 18], mx2[1 << 18];
int main() {
scanf("%d", &n);
for (int i = 0; i < (1 << n); ++i) {
scanf("%d", &a[i]);
mx1[i] = a[i];
}
for (int j = 0; j < n; ++j) {
for (int K = 1; K < (1 << n); ++K) {
if (K >> j & 1) {
int P = K ^ (1 << j);
auto update = [&](int X) {
if (X >= mx2[K]) {
mx2[K] = X;
if (mx2[K] > mx1[K]) {
swap(mx1[K], mx2[K]);
}
}
};
update(mx1[P]);
update(mx2[P]);
}
}
}
int mx = 0;
for (int K = 1; K < (1 << n); ++K) {
mx = max(mx, mx1[K] + mx2[K]);
printf("%d\n", mx);
}
} | 1 | 87,092,556 |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<string>
using namespace std;
long long n,a,b,sum;
int main()
{
scanf("%lld",&n);
for(int i=1;i<=n;i++)
{
scanf("%lld%lld",&a,&b);
sum+=(b-a+1);
}
cout<<sum<<endl;
return 0;
} | #include <iostream>
using namespace std;
int main()
{
int N = 0, ans = 0;
cin >> N;
for (int i = 0; i < N; i++) {
int l, r;
cin >> r >> l;
if (r < l) {
ans = ans + (l - r) + 1;
}
else if (r == l) {
ans++;
}
}
cout << ans << endl;
} | 1 | 9,409,777 |
#include <iostream>
using namespace std;
long long int gcd(long long int x, long long int y)
{
if (x % y == 0) {
return y;
} else {
gcd(y, x%y);
}
}
int main()
{
long long int a,b,c,d;
cin >> a >> b >> c >> d;
long long int ans_a, ans_b;
long long int y = gcd(c, d);
ans_a = (a-1) - ((a-1)/c) - ((a-1)/d) + (a-1)/((c*d)/y);
ans_b = b - (b/c) - (b/d) + b/((c*d)/y);
cout << ans_b - ans_a << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
long lcd(long a, long b) {
long c = a * b / __gcd(a,b);
return c;
}
int main() {
long A,B,C,D; cin >> A >> B >> C >> D;
long a = B / C;
long b = B / D;
long c = B / lcd(C,D);
long d = (A - 1) / C;
long e = (A - 1) / D;
long f = (A - 1) / lcd(C,D);
long divB = B - a - b + c;
long divA = A - 1 - d - e + f;
long ans = divB - divA;
cout << ans << endl;
} | 1 | 67,739,075 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define show(x) {for(auto i: x){cout << i << " ";} cout << endl;}
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int P, Q, R;
cin >> P >> Q >> R;
int ans = P + Q + R - max({P, Q, R});
cout << ans << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void){
/*
int a, b;
cin >> a >> b ;
vector<int> vec(3);
cin >> vec.at(0) >> vec.at(1) >> vec.at(2) ;
sort(vec.begin(), vec.end());
/*
if( a < 6 ){
cout << 0 << endl;
} else if (a < 13){
cout << b / 2 << endl;
} else {
cout << b << endl;
}
cout << vec.at(0) + vec.at(1) << endl;
return 0;
} | 1 | 33,331,332 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<cmath>
using namespace std;
int main(){
int N;
cin >> N;
int A[200000];
int B[200000];
int restA[200000];
int restB[200000];
for(int i = 0; i < N + 1; i++){
cin >> A[i];
}
for(int i = 0; i < N; i++){
cin >> B[i];
}
for(int i = 0; i < N; i++){
restA[i] = A[i];
restB[i] = B[i];
}
long long counter = 0;
for(int i = 0; i < N; i++){
counter += min(restA[i] , B[i]);
restB[i] -= min(restA[i], B[i]);
counter += min(A[i + 1], restB[i]);
restA[i + 1] -= min(A[i + 1], restB[i]);
}
cout << counter << endl;
} | #include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
typedef long long ll;
typedef long double ld;
int main(){
ll n;
cin>>n;
vector<ll> a(n+1),b(n);
ll sum1=0;
REP(i,n+1){
cin>>a[i];
sum1+=a[i];
}
REP(j,n){
cin>>b[j];
}
REP(i,n){
if(a[i]-b[i]>0){
a[i]-=b[i];
}else{
if(a[i+1]-(b[i]-a[i])>0){
a[i+1]-=b[i]-a[i];
a[i]=0;
}else{
a[i]=0;
a[i+1]=0;
}
}
}
ll sum2=0;
REP(i,n+1){
sum2+=a[i];
}
cout<<sum1-sum2;
return 0;
} | 1 | 5,833,849 |
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
using namespace std;
int main() {
int a,b,c,d;
string s;
long long ans = 0;
cin >> a >> b;
ans = a*800 - (a/15)*200;
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int x,y;
x=n*800;
y=(n/15)*200;
cout<<(x-y);
return 0;
} | 1 | 11,471,766 |
#include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
using namespace std;
#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef long double ld;
const int inf=1e9+7;
const ll INF=1LL<<60 ;
const ll mod=1e9+7 ;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<int, int> P;
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(),c.end()
#define pb push_back
#define debug(x) cerr << #x << " = " << (x) << endl;
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 n, a, b;
void solve() {
cin >> n >> a >> b;
if(a + b - 1 > n || n > a * b) {
cout << -1 << endl;
return;
}
if(b == 1) {
rep(i, n) {
cout << i + 1 << " ";
}
return;
}
for(int i = n - a + 1; i <= n; ++ i) {
cout << i << " ";
}
int x = (n - a) / (b - 1);
int y = n - a - x * (b - 1);
int cur = n - a + 1;
rep(i, y) {
cur -= (x + 1);
rep(j, x + 1) {
cout << cur + j << " ";
}
}
rep(i, b - 1 - y) {
cur -= x;
rep(j, x) {
cout << cur + j << " ";
}
}
cout << endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
solve();
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define sz size()
#define pb(x) push_back(x)
#define bg begin()
#define ed end()
#define rep(i,n) for(ll i=0;i<n;i++)
#define rep1(i,n) for(ll i=1;i<=n;i++)
int main(){
ll N,A,B; cin>>N>>A>>B;
if(N<A+B-1 || A*B<N) cout<<-1;
else{
ll W=A*B-N;
ll X=(A!=1ll?W/(A-1):0ll);
ll Y=(A!=1ll?W%(A-1):0ll);
for(int i=1;i<=B;i++){
if(i<=X){
cout<<A*(B+1-i)-(A-1)-(W-i*(A-1))<<" ";
}
else if(i==X+1 && Y>0){
rep(j,A-Y){
cout<<A*(B+1-i)-(A-1)+j<<" ";
}
}
else{
rep(j,A){
cout<<A*(B+1-i)-(A-1)+j<<" ";
}
}
}
}
} | 1 | 98,682,010 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
if(n>=0&&n<1200)cout<<"ABC"<<endl;
if(n>=1200&&n<2800)cout<<"ARC"<<endl;
if(n>=2800&&n<=4208)cout<<"AGC"<<endl;
return 0;
} | #include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#include <cassert>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <functional>
#include <sstream>
using namespace std;
int main(int argc, char** argv) {
ios::sync_with_stdio(false);
cin.tie(0);
int r;
cin >> r;
if (r < 1200) {
cout << "ABC\n";
} else if (r < 2800) {
cout << "ARC\n";
} else {
cout << "AGC\n";
}
return 0;
} | 1 | 57,326,322 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double dd;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
const int mx=1e6+11;
const double PI = acos(-1);
#define MOD 1000000007
#define nl '\n'
#define pb push_back
#define F first
#define S second
#define I insert
#define mp make_pair
#define sz(x) x.size()
#define tt int t; cin>>t; while(t--)
#define lo(i,a,b) for(int i=a;i<b;i++)
#define rlo(i,n) for(int i=n-1;i>=0;i--)
#define be(a) (a).begin(),(a).end()
#define rbe(a) (a).rbegin(),(a).rend()
#define mem(a,b) memset(a,b,sizeof(a))
#define pr(a) {for(auto x:a)cout<<x<<" ";cout<<nl;}
#define su ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define file freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define frac cout.unsetf(ios::floatfield); cout.precision(10); cout.setf(ios::fixed,ios::floatfield);
#define dbg(args...) do {cerr << #args << " : "; faltu(args); } while(0)
void faltu () { cerr << endl;}
template < typename T, typename ... hello>void faltu( T arg, const hello &... rest) {cerr << arg << ' ';faltu(rest...);}
void f()
{
int a,b;
cin>>a>>b;
cout<<(a*b)-(a+b-1)<<nl;
}
int main()
{
su;
f();
return 0;
} | #include<bits/stdc++.h>
using namespace std;
signed main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int n,m;
cin>>n>>m;
cout<<(n-1)*(m-1);
return 0;
} | 1 | 32,755,779 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
#define DEBUG freopen("in.txt", "r", stdin);
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
const int N = 1e5 + 5;
int x, y, n, m, ans;
int a[N], root[N];
unordered_map<int, unordered_set<int>> mp;
int find_st(int x) {
if (root[x] == x) return x;
return root[x] = find_st(root[x]);
}
void union_st(int x, int y) {
if (root[x] != root[y])
root[root[x]] = root[y];
}
int main() {
cin >> n >> m;
for (int i = 1; i <= n; ++i) {
root[i] = i;
cin >> a[i];
}
for (int i = 0; i < m; ++i) {
cin >> x >> y;
if (find_st(a[x]) != find_st(a[y]))
union_st(a[x], a[y]);
}
for (int i = 1; i <= n; ++i) {
int r = find_st(i);
mp[r].insert(i);
}
for (int i = 1; i <= n; ++i) {
if (mp[find_st(a[i])].count(i))
++ans;
}
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
#define fi first
#define se second
#define ll long long
#define pb push_back
#define mp make_pair
#define mt make_tuple
using namespace std;
int niz[100010];
int mapa[100010];
int mark[100010];
vector<int> graf[100010];
void dfs(int x, int boja)
{
mark[x] = boja;
for(int i = 0; i < graf[x].size(); i++)
{
int cvor = graf[x][i];
if(mark[cvor] == 0) dfs(cvor, boja);
}
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, m;
cin >> n >> m;
for(int i = 1; i <= n; i++)
{
cin >> niz[i];
mapa[niz[i]] = i;
}
for(int i = 0; i < m; i++)
{
int a, b;
cin >> a >> b;
graf[a].pb(b);
graf[b].pb(a);
}
int boja = 1;
for(int i = 1; i <= n; i++)
{
if(mark[i] == 0)
{
dfs(i, boja);
boja++;
}
}
int res = 0;
for(int i = 1; i <= n; i++)
if(mark[mapa[i]] == mark[i]) res++;
cout << res;
return 0;
} | 1 | 36,606,217 |
#include <iostream>
#include <vector>
#include <iomanip>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main()
{
int N; cin >> N;
vector<int> t(N), v(N);
int T = 0;
REP(i, N) { cin >> t[i]; T += t[i]; }
REP(i, N) cin >> v[i];
vector<double> maxv(2*T + 1, 1e10);
maxv[0] = maxv[2*T] = 0;
int now = 0;
REP(i, N) {
for (int j = now; j <= now + 2*t[i]; j++) {
maxv[j] = min(maxv[j], (double)v[i]);
}
now += 2*t[i];
}
for (int i = 1; i <= 2*T; i++) {
maxv[i] = min(maxv[i], maxv[i-1] + 0.5);
}
for (int i = 2*T-1; i >= 0; i--) {
maxv[i] = min(maxv[i], maxv[i+1] + 0.5);
}
double ans = 0;
REP(i, 2*T) {
ans += (maxv[i] + maxv[i + 1])*0.25;
}
cout << fixed << setprecision(20) << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#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,n,m) for(int i=n;i<=(int)(m);i++)
#define RFOR(i,n,m) for(int i=(int)(n);i>=m;i--)
#define all(x) (x).begin(),(x).end()
#define sz(x) int(x.size())
#define get_unique(x) x.erase(std::unique(all(x)), x.end());
typedef long long ll;
const int INF = 1e9;
const ll MOD = 1e9+7;
const ll LINF = 1e18;
const double PI=acos(-1);
using namespace std;
vector<int> dx={1,0,-1,0};
vector<int> dy={0,1,0,-1};
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; }
template<class T>
vector<T> make_vec(size_t a){
return vector<T>(a);
}
template<class T, class... Ts>
auto make_vec(size_t a, Ts... ts){
return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
int main() {
cout<<fixed<<setprecision(10);
int n;
cin>>n;
vector<double> t(n+1),v(n+2);
rep(i,n) cin>>t[i+1];
rep(i,n) cin>>v[i+1];
rep(k,n) FOR(i,1,n) {
chmin(v[i],v[i+1]+t[i]);
chmin(v[i],v[i-1]+t[i]);
}
double ans=0;
FOR(i,1,n) {
if(v[i-1]<=v[i] && v[i]<=v[i+1]) {
ans+=v[i]*t[i]-pow((v[i]-v[i-1]),2)/2;
}
else if(v[i-1]>=v[i] && v[i]>=v[i+1]) {
ans+=v[i]*t[i]-pow((v[i]-v[i+1]),2)/2;
}
else if(v[i-1]<v[i] && v[i]>v[i+1]) {
double d=v[i+1]-v[i-1];
ans+=t[i]*(v[i-1]+t[i]/2+d/2)-(pow(t[i]/2+d/2,2)+pow(t[i]/2-d/2,2))/2-pow(max(0.0,v[i-1]+t[i]/2+d/2-v[i]),2);
}
else {
ans+=v[i]*t[i];
}
}
cout<<ans<<endl;
} | 1 | 67,482,096 |
#include<iostream>
#include<queue>
#include<vector>
#include<algorithm>
#include<set>
#include<tuple>
using namespace std;
typedef long long ll;
const ll MAX = 1000+1;
struct point
{
ll p, i, j, k;
point(ll p,ll i,ll j, ll k):p(p),i(i),j(j),k(k){}
bool operator< (const point &rhs)const
{
return p < rhs.p;
}
};
int main(){
ll x, y, z, k;
cin >> x >> y >> z >> k;
vector<ll> a(x), b(y), c(z);
for (ll i = 0; i < x; i++)
{
cin >> a[i];
}
for (ll i = 0; i < y; i++)
{
cin >> b[i];
}
for (ll i = 0; i < z; i++)
{
cin >> c[i];
}
sort(a.begin(), a.end(), greater<ll>());
sort(b.begin(), b.end(), greater<ll>());
sort(c.begin(), c.end(), greater<ll>());
priority_queue<point> pq;
set<tuple<ll,ll,ll>> s;
pq.push(point(a[0] + b[0] + c[0], 0, 0, 0));
s.insert(make_tuple(0, 0, 0));
for (ll l = 0; l < k; l++)
{
point p = pq.top();
ll i = p.i;
ll j = p.j;
ll k = p.k;
cout << p.p << endl;
pq.pop();
if(i+1<x &&s.find(make_tuple(i+1,j,k))==s.end())
{
pq.push(point(a[p.i + 1] + b[p.j] + c[p.k], p.i + 1, p.j, p.k));
s.insert(make_tuple(i+1,j,k));
}
if(j+1<y&&s.find(make_tuple(i,j+1,k))==s.end())
{
pq.push(point(a[p.i] + b[p.j + 1] + c[p.k], p.i, p.j + 1, p.k));
s.insert(make_tuple(i,j+1,k));
}
if(k+1<z&&s.find(make_tuple(i,j,k+1))==s.end())
{
pq.push(point(a[p.i] + b[p.j] + c[p.k + 1], p.i, p.j, p.k + 1));
s.insert(make_tuple(i,j,k+1));
}
}
return 0;
} | #include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define inputInt(a) int a; cin >> a;
#define inputInt2(a,b) int a; int b; cin >> a >> b;
#define inputInt3(a,b,c) int a; int b; int c; cin >> a >> b >> c;
#define inputLong(a) long a;cin >> a;
#define inputIntArray(a,N) int a[N];for(int i=0;i<N;i++){cin >> a[i];}
#define inputLongArray(a,N) long a[N];for(int i=0;i<N;i++){cin >> a[i];}
#define inputIntArray2(a,b,N) int a[N]; int b[N]; for(int i=0;i<N;i++){cin >> a[i] >> b[i];}
#define output(answer) cout << answer << endl;
#define fN(i,N) for(int i=0; i<N; i++)
#define fSE(i,s,e) for(int i=s; i<=e; i++)
#define ll long long
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define FOR(i,N) for(int i=0; i<N; i++)
#define cinv(v,N) vector<int> v(N); for(int i=0; i<N; i++){ cin >> v[i]; }
#define mt make_tuple
#define vll vector<long long int>
#define vvll vector<vector<long long int>>
#define all(v) (v).begin(),(v).end()
#define show(v) FOR(i,v.size()){ cout << v[i] << " "; } cout << endl;
#define showshow(v) FOR(i,v.size()){ FOR(j,v[i].size()){ cout << v[i][j] << " "; } cout << endl; }
const ll MOD = 1e9+7;
const ll MOD2 = 998244353;
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 LIMIT = 1e6;
vector<ll> FacMod(LIMIT), InvMod(LIMIT), FacInvMod(LIMIT);
const int dpComTableLIMIT = 3e3+1;
vector<vector<ll>> Com(dpComTableLIMIT,vector<ll>(dpComTableLIMIT,0));
const int ComKTableLIMIT = 1e7;
vector<ll> ComK(ComKTableLIMIT);
void DPComInit(){
for(int i=0; i<dpComTableLIMIT; i++){ Com[i][0] = 1; }
for(int i=1; i<dpComTableLIMIT; i++){
for(int j=1; j<dpComTableLIMIT; j++){
Com[i][j] = (Com[i-1][j-1]+Com[i-1][j])%MOD;
}
}
}
void ComKInit(ll N){
for(int i=0; i<=ComKTableLIMIT; i++){
if(0<i && i<=N/2){
ComK[i] = (ComK[i-1]*(N-i+1)/i)%MOD;
}else if(i==0){
ComK[i] = 1;
}else if(N/2<i && i<=N){
ComK[i] = ComK[N-i];
}else{
ComK[i] = -1;
}
}
}
void ComInit(){
FacMod[0] = FacMod[1] = 1;
InvMod[0] = 0; InvMod[1] = 1;
FacInvMod[0] = FacInvMod[1] = 1;
for(int i=2; i<LIMIT; i++){
FacMod[i] = FacMod[i-1]*i%MOD;
InvMod[i] = -InvMod[MOD%i]*(MOD/i)%MOD + MOD;
FacInvMod[i] = FacInvMod[i-1] * InvMod[i]%MOD;
}
}
ll ComMod(int n, int k){
if(n>=0 && k>=0 && n>=k){
return FacMod[n]*(FacInvMod[k]*FacInvMod[n-k]%MOD)%MOD;
}else{
return 0;
}
}
ll power(ll x, ll y){
if(y < 0){
return 0;
}else if(y == 0){
return 1LL;
}else if(y%2 == 0){
return power(x,y/2)*power(x,y/2);
}else{
return power(x,y-1)*x;
}
}
ll mpower(ll x, ll y, ll m){
if(y < 0){
return 0;
}else if(y == 0){
return 1LL;
}else if(y%2 == 0){
return mpower(x,y/2,m)*mpower(x,y/2,m)%m;
}else{
return mpower(x,y-1,m)*x%m;
}
}
bool compare_by_second(pair<ll,ll> a, pair<ll,ll> b){
return a.second != b.second ? a.second < b.second : a.first < b.first;
}
class UnionFind {
vector<int> parent;
vector<int> rank;
public:
UnionFind(int N);
int root(int x);
void unite(int x, int y);
bool isUnited(int x, int y);
int getRank(int x);
};
UnionFind::UnionFind(int N):parent(N),rank(N,1){
for(int i=0; i<N; i++){parent[i]=i;}
}
int UnionFind::root(int x){
if(parent[x] == x) return x;
return root(parent[x]);
}
void UnionFind::unite(int x, int y) {
int rx = root(x);
int ry = root(y);
if (rx == ry) return;
if(rank[x] >= rank[y]){parent[ry] = rx; rank[y]+=1;}
else{parent[rx] = ry; rank[x]+=1;}
}
bool UnionFind::isUnited(int x, int y) {
int rx = root(x);
int ry = root(y);
parent[x]=rx; parent[y]=ry;rank[x]=2;rank[y]=2;
return rx == ry;
}
int UnionFind::getRank(int x){
return rank[x];
}
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
ll X, Y, Z, K; cin >> X >> Y >> Z >> K;
vector<ll> a(X), b(Y), c(Z);
FOR(i,X){ cin >> a[i]; }
FOR(i,Y){ cin >> b[i]; }
FOR(i,X){ cin >> c[i]; }
sort(all(a),greater<ll>());
sort(all(b),greater<ll>());
sort(all(c),greater<ll>());
priority_queue<tuple<ll,ll,ll,ll>> pq;
pq.push(make_tuple(a[0]+b[0]+c[0],0,0,0));
set<tuple<ll,ll,ll>> s;
s.insert(make_tuple(0,0,0));
for(int num=0; num<K; num++){
tuple<ll,ll,ll,ll> t = pq.top(); pq.pop();
ll tmp = get<0>(t);
ll i = get<1>(t);
ll j = get<2>(t);
ll k = get<3>(t);
tuple<ll,ll,ll> ta = make_tuple(i+1,j,k);
tuple<ll,ll,ll> tb = make_tuple(i,j+1,k);
tuple<ll,ll,ll> tc = make_tuple(i,j,k+1);
if(i+1<=X-1 && s.find(ta) == s.end()){
s.insert(ta);
pq.push(make_tuple(a[i+1]+b[j]+c[k],i+1,j,k));
}
if(j+1<=Y-1 && s.find(tb) == s.end()){
s.insert(tb);
pq.push(make_tuple(a[i]+b[j+1]+c[k],i,j+1,k));
}
if(k+1<=Z-1 && s.find(tc) == s.end()){
s.insert(tc);
pq.push(make_tuple(a[i]+b[j]+c[k+1],i,j,k+1));
}
cout << tmp << endl;
}
return 0;
} | 1 | 51,594,887 |
#include<stdio.h>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<algorithm>
#include<cmath>
#include<bitset>
#define Vsort(a) sort(a.begin(), a.end())
#define Vreverse(a) reverse(a.begin(), a.end())
#define Srep(n) for(int i = 0; i < (n); i++)
#define Lrep(i,a,n) for(int i = (a); i < (n); i++)
#define Brep(n) for(int bit = 0; bit < (1<<n); bit++)
#define rep2nd(n,m) Srep(n) Lrep(j,0,m)
#define vi vector<int>
#define vi64 vector<int64_t>
#define vvi vector<vector<int>>
#define vvi64 vector<vector<int64_t>>
#define P pair<int,int>
#define F first
#define S second
using namespace std;
int main(){
int n,k,x,y,ans=0;
cin >> n >> k >> x >> y;
Srep(k){
ans += x;
n--;
if(n == 0){
cout << ans << endl;
return 0;
}
}
while(n > 0){
ans += y;
n--;
}
cout << ans << endl;
} | #include<bits/stdc++.h>
#define u64 uint64_t
#define ll long long
#define endl "\n"
#define PI acos(-1)
#define pi pair<ll,ll>
#define fi first
#define si second
#define mkp make_pair
#define pb push_back
#define clr(arr) memset(arr,0,sizeof(arr))
#define IOS ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
using namespace std;
deque<ll>dq;
map<ll,ll>mp;
set<ll>st;
vector<ll>vt;
ll mod=1e9+7;
const int N=1e6+5;
ll arr[N];
int main()
{
IOS;
ll n,m,x,y,z,i,j,k,p,f=0,tc,cnt=0,sum=0,mul=1,mi=1e18,ma=-1e18,a,b,c,d,sz;
string str;
char ch;
double db;
cin>>n>>k>>x>>y;
k=min(n,k);
sum+=x*k;
k=n-k;
if(n>k)
sum+=y*k;
cout<<sum<<endl;
return 0;
} | 1 | 39,551,301 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=(a);i<=(b);i++)
#define FORD(i,a,b) for(ll i=(a);i>=(b);i--)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define SUM(x) accumulate(ALL(x), 0)
#define print(x) cout << x;
#define println(x) cout << x << endl;
#define printd(x, f) cout << fixed << setprecision(f) << x << endl;
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define INF 1000000000000
#define MAXR 100000
#define PI acos(-1.0)
const long long MOD = 1000000007;
vll num(30, 0);
int main() {
int N; string S; cin >> N >> S;
for (auto c : S) num[c - 'a']++;
long long res = 1;
for (int i = 0; i < 26; ++i) {
res *= num[i] + 1;
res %= MOD;
}
cout << (res + MOD - 1) % MOD << endl;
} | #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 endl "\n"
using ll = long long;
using P = pair<int,int>;
using mp = map<int,int>;
const int MOD = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
int n;
cin >> n;
string s;
cin >> s;
vector<ll> cnt(26, 0);
rep(i, n){
cnt[s[i] - 'a']++;
}
ll ans = 1;
for (auto& p : cnt) {
ans *= p+1;
ans %= MOD;
}
ans--;
ans %= MOD;
cout << ans << endl;
return 0;
} | 1 | 64,552,730 |
#include<bits/stdc++.h>
using namespace std;
typedef long long llint;
typedef long double ld;
#define inf 1e18
#define mod 1000000007
#define sort(v) sort(v.begin(),v.end())
#define reverse(v) reverse(v.begin(),v.end())
#define count(v,x) count(v.begin(),v.end(),x)
#define find(v,x) find(v.begin(),v.end(),x)
priority_queue<llint,vector<llint>,greater<llint> > que;
priority_queue<llint> Que;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
int n;
string s;
void solve(){
cin >> n;
cin >> s;
int ans=0;
for(char v1='0';v1<='9';v1++){
for(char v2='0';v2<='9';v2++){
for(char v3='0';v3<='9';v3++){
string t;
t+=v1;
t+=v2;
t+=v3;
int p=0;
for(int l=0;l<n;l++){
if(s[l]==t[p])p++;
if(p==3)break;
}
if(p==3)ans++;
}
}
}
cout << ans << endl;
}
int main(){
solve();
return 0;
} | #include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
using namespace std;
#define ll long long
#define rep(i,n) for (ll i = 0; i < (n); i++)
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
#define FORR(i,a,b)for(ll i=(a);i<=(b);i++)
#define repR(i,n) for(ll i=n;i>=0;i--)
#define all(v)(v).begin(),(v).end()
#define rall(v)(v).rbegin(),(v).rend()
#define F first
#define S second
#define pb push_back
#define pu push
#define COUT(x) cout<<(x)<<"\n"
#define PQ priority_queue<ll>
#define PQR priority_queue<ll,vector<ll>,greater<ll>>
#define YES(n) cout << ((n) ? "YES\n" : "NO\n" )
#define Yes(n) cout << ((n) ? "Yes\n" : "No\n" )
#define mp make_pair
#define sz(x) (ll)(x).size()
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const ll MOD = 1000000007LL;
const ll INF = 1LL << 60;
using vll = vector<ll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvll = vector<vll>;
using vstr = vector<string>;
using vc = vector<char>;
using vvc = vector<vc>;
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;
}
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
ll dx[4]={0,1,0,-1};
ll dy[4]={1,0,-1,0};
int main(){
ll n;
cin>>n;
string s;
cin>>s;
ll ans=0;
rep(i,1000){
string sum="";
if(i<10) sum+="00";
else if(i<100) sum+="0";
sum+=to_string(i);
ll cu=0;
rep(j,n){
if(sum[cu]==s[j]){
cu++;
}
if(cu==3) break;
}
if(cu==3)ans++;
}
COUT(ans);
} | 1 | 84,341,646 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 1e16+7;
int mod = 1e9+7;
int dx[4] = {1,-1, 0, 0};
int dy[4] = {0, 0, 1,-1};
int dp[105][105][2];
signed main() {
int H,W;
cin >> H >> W;
vector<string>S(H);
for(int i = 0; i < H; i++) {
cin >> S[i];
}
for(int i = 0; i < 105; i++) {
for(int j = 0; j < 105; j++) {
for(int k = 0; k < 2; k++) {
dp[i][j][k] = INF;
}
}
}
if(S[0][0] == '#') {
dp[0][0][1] = 1;
}
else {
dp[0][0][0] = 0;
}
for(int i = 0; i < H; i++) {
for(int j = 0; j < W; j++) {
if(dp[i][j][0] != INF) {
if(i+1 < H) {
if(S[i+1][j] == '#') dp[i+1][j][1] = min(dp[i+1][j][1],dp[i][j][0]+1);
else dp[i+1][j][0] = min(dp[i+1][j][0],dp[i][j][0]);
}
if(j+1 < W) {
if(S[i][j+1] == '#') dp[i][j+1][1] = min(dp[i][j+1][1],dp[i][j][0]+1);
else dp[i][j+1][0] = min(dp[i][j+1][0],dp[i][j][0]);
}
}
if(dp[i][j][1] != INF) {
if(i+1 < H) {
if(S[i+1][j] == '#') dp[i+1][j][1] = min(dp[i+1][j][1],dp[i][j][1]);
else dp[i+1][j][0] = min(dp[i+1][j][0],dp[i][j][1]);
}
if(j+1 < W) {
if(S[i][j+1] == '#') dp[i][j+1][1] = min(dp[i][j+1][1],dp[i][j][1]);
else dp[i][j+1][0] = min(dp[i][j+1][0],dp[i][j][1]);
}
}
}
}
cout << min(dp[H-1][W-1][0],dp[H-1][W-1][1]) << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int h, w;
cin >> h >> w;
vector<string> m(h);
for (int i = 0; i < h; i++) cin >> m[i];
vector<vector<int>> a(h, vector<int>(w));
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
if (i == 0 && j == 0) {
if (m[i][j] == '#') a[0][0] = 1;
}
else if (i == 0) {
a[i][j] = a[i][j - 1];
if (m[i][j] != m[i][j - 1]) a[i][j]++;
}
else if (j == 0) {
a[i][j] = a[i - 1][j];
if (m[i][j] != m[i - 1][j]) a[i][j]++;
}
else{
int add1 = 0, add2 = 0;
if (m[i][j] != m[i][j - 1]) add1++;
if (m[i][j] != m[i - 1][j]) add2++;
a[i][j] = min(a[i][j-1] + add1, a[i - 1][j] + add2);
}
}
}
cout << (a[h - 1][w - 1] + 1) / 2 << endl;
return 0;
} | 1 | 57,052,244 |
#include <bits/stdc++.h>
using namespace std;
typedef unsigned int ui;
typedef long long ll;
typedef unsigned long long ull;
int main() {
int A, B, C;
cin >> A >> B >> C;
if(A == B && B == C)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
int i,j,cnt=0;
int a,b,c;
cin>>a>>b>>c;
if(a==b && b==c)cout<<"Yes";
else cout<<"No";
} | 1 | 51,581,932 |
#define dbg(...) fprintf(stderr,__VA_ARGS__)
#define dpr(x) cerr<<#x<<": "<<x<<endl;
#define dprc(c) do{cerr<<#c<<":";for(auto&_i:(c)){cerr<<" "<<_i;}cerr<<endl;}while(0)
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
int INF = 1e9+7;
#define all(c) (c).begin(), (c).end()
#define tr(i,c) for(auto i=(c).begin();i!=(c).end();i++)
#define rtr(i,c) for(auto i=(c).rbegin();i!=(c).rend();i++)
#define rep(i,b) for(auto i=0;i<(b);i++)
#define pb push_back
#define sz(c) int((c).size())
int main(int argc, char **argv)
{
int n;
list<int> L;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
int x;
char buf[128];
memset(buf, 0, 128);
scanf("%s", buf);
if (strcmp(buf, "insert") == 0) {
scanf("%d", &x);
L.push_front(x);
} else if (strcmp(buf, "delete") == 0) {
scanf("%d", &x);
auto k = find(all(L), x);
if (k != L.end()) L.erase(k);
} else if (strcmp(buf, "deleteFirst") == 0) {
L.pop_front();
} else if (strcmp(buf, "deleteLast") == 0) {
L.pop_back();
} else {
fprintf(stderr, "Unknown command: %s\n", buf);
return 1;
}
}
const char *sp = "";
for (auto& x:L) {
printf("%s%d", sp, x);
sp = " ";
}
putchar('\n');
return 0;
} | #include <iostream>
#include <list>
#include <algorithm>
using namespace std;
int using_stl()
{
int n;
list<int> L;
cin >> n;
char cmd[16];
int m = n;
while(m--)
{
cin >> cmd;
char c6 = cmd[6];
int num;
if (cmd[0]=='i')
{
cin >> num;
L.push_front(num);
}
else if (c6 == 'F')
{
L.erase(L.begin());
}
else if (c6 == 'L')
{
L.erase(--L.end());
}
else
{
cin >> num;
L.erase(find(L.begin(), L.end(), num));
}
}
bool first = true;
for (auto num : L)
{
if (first)
{
first = false;
}
else
{
cout << ' ';
}
cout << num;
}
cout << endl;
return 0;
}
int opt()
{
int n;
cin >> n;
int * L = new int[n];
int nl = 0;
int bl = 0;
char cmd[16];
int m = n;
while(m--)
{
cin >> cmd;
if (cmd[0]=='i')
{
cin >> L[nl++];
continue;
}
char c6 = cmd[6];
if (c6 == 'F')
{
for (int i=nl-1; i >= 0; i--)
{
if (L[i])
{
L[i] = 0;
nl = i;
break;
}
}
}
else if (c6 == 'L')
{
for (int i=bl; i <n; i++)
{
if (L[i])
{
L[i] = 0;
bl = i+1;
break;
}
}
}
else
{
int num;
cin >> num;
for (int i=nl-1; i >= 0; i--)
{
if (L[i] == num)
{
L[i] = 0;
break;
}
}
}
}
bool first = true;
for (int i=nl-1;i>=bl;i--)
{
if (L[i])
{
if (first)
{
first = false;
}
else
{
cout << ' ';
}
cout << L[i];
}
}
cout << endl;
return 0;
}
int main()
{
return opt();
} | 1 | 39,943,370 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
bool d = 1;
int cnt = 0;
int n = (int)s.size();
for (int i = 0; i < n; ++i) {
if (i != 0 && s[i] != 'C') {
if (s[i] - 'a' >= 0 && s[i] - 'a' < 26) {
continue;
} else {
d = 0;
}
}
if (s[i] == 'C') {
cnt++;
}
}
int ap = 0;
for (int i = 2; i <= n - 2; ++i) {
if (s[i] == 'C') ap++;
}
if (s[0] == 'A' && ap == 1 && d && cnt == 1) {
cout << "AC";
}else {
cout << "WA";
}
} | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
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() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
int n = (int)s.size();
if (s[0] != 'A') {
cout << "WA" << endl;
return 0;
}
int tc = 0;
int cok = false;
rep(i, 1, n) {
if (isupper(s[i]))
tc++;
if (i >= 2 && i <= n - 2) {
if (s[i] == 'C')
cok = true;
}
}
if (cok && tc == 1)
cout << "AC" << endl;
else
cout << "WA" << endl;
} | 1 | 31,265,305 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> pll;
const ll mod=1e9+7;
const ll inf=5e18;
int main() {
string o,e;
cin >> o >> e;
for(ll i=0;i<o.size()+e.size();i++) {
if(i%2) cout << e[i/2];
else cout << o[i/2];
}
cout << endl;
} | #include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i <(n); ++i)
#define REP2(i,x,n) for (int i = x; i <(n); ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
static const int INF = 1e9+7;
#define REP(i,n) for (int i = 0; i <(n); ++i)
#ifdef _DEBUG
#define debug(var) do{cout << #var << " :";view(var);}while(0)
#else
#define debug(...)
#endif
template<typename T> void view(T e){cout << e << endl;}
template<typename T> void view(const vector<T>& v){for(const auto& e : v){ cout << e << " "; } cout << endl;}
template<typename T> void view(const vector<vector<T> >& vv){ for(const auto& v : vv){ view(v); } }
int main(){
string o;
string e;
cin >> o >> e;
REP(i,e.size()){
cout << o[i];
cout << e[i];
}
if(o.size() - e.size()) cout << *o.rbegin() << endl;
else cout << endl;
return 0;
} | 1 | 64,018,273 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int yen;
int Max;
int Min;
cin >> yen;
Max = yen / 100;
Min = (yen % 100 + 4) / 5;
if(Min <= Max){
cout << 1;
}else{
cout << 0;
}
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define si(x) scanf("%d", &x)
#define sll(x) scanf("%lld", &x)
#define ssll(x,y) scanf("%lld %lld", &x ,&y)
#define sd(x) scanf("%lf", &x)
#define l0(i,n) for(ll i=0; i<n; i++)
#define MAX 100005
#define maxn 200002
#define pb push_back
#define mk make_pair
#define endl "\n"
#define INF 1000000000
#define MOD 1000000007
#define imie(...) "[" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
int main ()
{
ios::sync_with_stdio(0);
cin.tie(0);
int x;
cin >> x;
int ok = x/100;
for (int i=0 ; i<=ok ; i++)
{
int y = x-100*i;
if(i>=0 && y<=5*i)
{
cout << 1 << endl;
return 0;
}
}
cout << 0 << endl;
return 0;
} | 1 | 80,928,171 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define FORV(i,v) for(auto i=v.begin(); i!=v.end();i++)
#define ALL(v) (s).begin(), (s).end()
#define SORT(s) sort((s).begin(),(s).end())
#define SORTD(s) sort((s).rbegin(),(s).rend())
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define SZ(x) ((int)(x).size())
#define MEMSET(v, h) memset((v), h, sizeof(v))
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
string s;
cin>>s;
ll ans=0;
int ss[SZ(s)+1];
MEMSET(ss,0);
REP(i,SZ(s))
{
if(s[i]=='<')ss[i+1]=max(ss[i+1],ss[i]+1);
}
REPD(i,SZ(s))
{
if(s[i]=='>')ss[i]=max(ss[i],ss[i+1]+1);
}
REP(i,SZ(s)+1)ans+=ss[i];
cout<<ans<<endl;
return 0;
} | #include<bits/stdc++.h>
#include<string>
#include<vector>
using namespace std;
typedef pair<int, int>P;
typedef long long ll;
#define rep(i,n)for(ll i=0;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
#define re0 return 0
const ll mod = 1000000007;
const ll INF = 1e16;
const ll MAX_N = 100010;
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);
}
map<ll, ll>ins;
void facterize(ll n) {
ll a = 2;
while (n >= a * a) {
if (n % a == 0) {
ins[a]++;
ins[a] = ins[a] % 1000000007;
n /= a;
}
else {
a++;
}
}
ins[n]++;
}
int keta(int x) {
int y = 0;
while (x > 0) {
y++;
x /= 10;
}
return y;
}
ll dx[8] = { 0,0,-1,1 };
ll dy[8] = { -1,1,0,0 };
int main() {
string s;
cin >> s;
ll n = s.length() + 1;
vector<ll>a(n);
rep(i, n-1) {
if (s[i] == '<')a[i + 1] = max(a[i + 1], a[i] + 1);
}
for (ll i = n - 2;i >= 0;--i) {
if (s[i] == '>')a[i] = max(a[i], a[i + 1] + 1);
}
ll ans = 0;
rep(i, n) {
ans += a[i];
}
cout << ans << endl;
return 0;
} | 1 | 29,541,625 |
Subsets and Splits