code1
stringlengths 54
12k
| code2
stringlengths 66
12k
| similar
int64 0
1
| __index_level_0__
int64 24
101M
|
|---|---|---|---|
#include <iostream>
#include <unordered_map>
using namespace std;
unordered_map<int, int> h;
int fib(int n);
int fib(int n) {
if (h.count(n) != 0) {
return h[n];
}
int ret;
if (n == 0) {
ret = 1;
}
else if (n == 1) {
ret = 1;
}
else {
ret = fib(n-1) + fib(n-2);
}
h[n] = ret;
return ret;
}
int main () {
int n;
cin >> n;
cout << fib(n) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
long long int mod = 1e9+7;
typedef long long int lli;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<lli> vlli;
typedef vector<bool> vb;
long long int max(long long int a,long long int b){
if(a>b)
return a;
else
return b;
}
long long int min(long long int a,long long int b){
if(a<b)
return a;
else
return b;
}
long long int binpow(long long a, long long b, long long m) {
a %= m;
long long res = 1;
while (b > 0) {
if (b & 1)
res = res * a % m;
a = a * a % m;
b >>= 1;
}
return res;
}
long long binpow(long long a, long long b) {
if (b == 0)
return 1;
long long res = binpow(a, b / 2);
if (b % 2)
return res * res * a;
else
return res * res;
}
void solve(){
int x,y,a,b,c;
cin>>x>>y>>a>>b>>c;
vi p(a),q(b),r(c);
for(int i = 0;i<a;i++){
cin>>p[i];
}
for(int i = 0;i<b;i++){
cin>>q[i];
}
for(int i = 0;i<c;i++){
cin>>r[i];
}
priority_queue<lli,vector<lli>,greater<lli>> pq;
sort(p.rbegin(),p.rend());
sort(q.rbegin(),q.rend());
sort(r.rbegin(),r.rend());
for(int i = 0;i<x;i++){
pq.push(p[i]);
}
for(int i = 0;i<y;i++){
pq.push(q[i]);
}
lli ans = 0;
for(int i = 0;i<c;i++){
if(r[i]>pq.top()){
pq.pop();
ans+=r[i];
}
}
while(!pq.empty()){
ans+=pq.top();
pq.pop();
}
cout<<ans;
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int t = 1;
while(t--){
solve();
}
} | 0 | 44,463,921 |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
int main() {
vector<int> N(4);
rep(i, 4) {
cin >> N[i];
}
sort(N.begin(), N.end());
int x[4] = {1, 4, 7, 9};
rep(i, 4) {
if(N[i] != x[i]) {
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
return 0;
} | #include <iostream>
#include <stdio.h>
using namespace std;
class Dice{
public:
int value[6];
void roll(char _order) {
switch(_order) {
case 'N':
swap(value[4], value[0]);
swap(value[0], value[1]);
swap(value[1], value[5]);
break;
case 'E':
swap(value[2], value[0]);
swap(value[0], value[3]);
swap(value[3], value[5]);
break;
case 'S':
swap(value[1], value[0]);
swap(value[0], value[4]);
swap(value[4], value[5]);
break;
case 'W':
swap(value[0], value[2]);
swap(value[2], value[5]);
swap(value[5], value[3]);
break;
}
}
int right(int top, int front) {
int top_idx, front_idx;
for (int i=0;i<6;i++)
for (int j=0;j<6;j++)
if (i != j && value[i] == top && value[j] == front) {
top_idx = i;
front_idx = j;
}
switch (top_idx) {
case 0:
switch (front_idx) {
case 1: return value[2]; break;
case 2: return value[4]; break;
case 4: return value[3]; break;
case 3: return value[1]; break;
}
break;
case 1:
switch (front_idx) {
case 0: return value[3]; break;
case 3: return value[5]; break;
case 5: return value[2]; break;
case 2: return value[0]; break;
}
break;
case 2:
switch (front_idx) {
case 0: return value[1]; break;
case 1: return value[5]; break;
case 5: return value[4]; break;
case 4: return value[0]; break;
}
break;
case 3:
switch (front_idx) {
case 0: return value[4]; break;
case 4: return value[5]; break;
case 5: return value[1]; break;
case 1: return value[0]; break;
}
break;
case 4:
switch (front_idx) {
case 0: return value[2]; break;
case 2: return value[5]; break;
case 5: return value[3]; break;
case 3: return value[0]; break;
}
break;
case 5:
switch (front_idx) {
case 1: return value[3]; break;
case 3: return value[4]; break;
case 4: return value[2]; break;
case 2: return value[1]; break;
}
break;
}
}
};
int main() {
Dice dice;
int q;
for (int i=0;i<6;i++)
cin >> dice.value[i];
cin >> q;
for (int i=0;i<q;i++) {
int top, front;
cin >> top >> front;
cout << dice.right(top, front) << endl;
}
} | 0 | 65,780,902 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
vector<int> N, X;
for(;;){
int n, x;
cin >> n >> x;
if(n == 0 && x == 0) break;
N.push_back(n);
X.push_back(x);
}
for(int i = 0; i < N.size(); i++){
int ans = 0;
int n = N.at(i), x = X.at(i);
for(int j = 1; j <= n; j++){
for(int k = j+1; k <= n; k++){
for(int l = k+1; l <= n; l++){
if(j + k + l == x){
ans++;
}
}
}
}
cout << ans << endl;
}
} | #include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main() {
int N;
while(cin >> N, N) {
vector<int> scores;
int score;
for(int i=0; i < N; i++) {
cin >> score;
scores.push_back(score);
}
sort(scores.begin(), scores.end());
int sums = 0;
for(int i=1; i<scores.size()-1; i++) {
sums+=scores[i];
}
int ans = sums/(scores.size()-2);
cout << ans << endl;
}
return EXIT_SUCCESS;
} | 0 | 89,239,328 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <unordered_map>
#include <iomanip>
#include <cmath>
#include <tuple>
using namespace std;
using ll = long long;
#define rep(i, j, n) for(int i = j; i < (int)n; ++i)
#define rrep(i, j, n) for(int i = (int)n - 1; j <= i; --i)
constexpr ll MOD = 0x3b9aca07;
constexpr int INF = 0x3f3f3f3f;
constexpr ll INFL = 0x3f3f3f3f3f3f3f3fLL;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
int a, b; cin >> a >> b;
if (a <= 8 && b <= 8) cout << "Yay!";
else cout << ":(";
cout << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define all(v) (v).begin(),(v).end()
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int,int>
#define vii vector<pii>
#define MOD 1000000007
#define MOD2 998244353
#define MOD3 1000000009
#define PI acos(-1)
#define eps (1e-8)
#define INF (1e18)
#define FASTER ios_base::sync_with_stdio(0);cin.tie(0)
template<class A,class B>ostream&operator<<(ostream&out,const pair<A,B>&a){return out<<"("<<a.first<<","<<a.second<<")";}
template<class A>ostream&operator<<(ostream&out,const vector<A>&a){for(const A &it:a)out<<it<<" ";return out;}
template<class A,class B>istream&operator>>(istream&in,pair<A,B>&a){return in>>a.first>>a.second;}
template<class A>istream&operator>>(istream&in,vector<A>&a){for(A &i:a)in>>i;return in;}
int poww(const int &a,int b,const int &m=MOD){if(b==0)return 1;int x=poww(a,b/2,m);x=x*x%m;if(b&1)x=x*a%m;return x;}
int ceil(const int &a,const int &b){return (a+b-1)/b;}
signed main(){
FASTER;
int n,k;cin>>n>>k;
double ans=0;
for(int sc=1;sc<=n;sc++){
if(sc>n)break;
double lo=1.0/n;
int s=sc;
while(s<k){
s*=2;
lo*=(0.5);
}
ans+=lo;
}
cout<<fixed<<setprecision(9)<<ans;
} | 0 | 71,544,544 |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define maxn 1000005
#define fr(i,j,k) for(int i=j;i<k;i++)
#define f(n) fr(i,0,n)
#define f1(n) fr(i,1,n+1)
#define ms(i) memset(i,0,sizeof(i));
#define ms1(i) memset(i,-1,sizeof(i));
#define F first
#define S second
#define all(x) x.begin(), x.end()
const int mod = 998244353;
int pa[100005][18];
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vector<int>v(n);
for (auto &i : v) {
cin >> i;
}
int k;
cin >> k;
for (int i = 0 ; i < n ; i++) {
int l = i, r = n;
while (r - l > 1) {
int mid = (l + r) >> 1;
if (v[mid] - v[i] <= k) {
l = mid;
}
else {
r = mid;
}
}
pa[i][0] = l;
}
for (int i = 1 ; i < 18 ; i++) {
for (int j = 0 ; j < n ; j++) {
pa[j][i] = pa[pa[j][i - 1]][i - 1];
}
}
int t;
cin >> t;
while (t--) {
int x , y;
cin >> x >> y;
x--, y--;
if (x > y) {
swap(x, y);
}
int l = 0, r = n;
while (r - l > 1) {
int mid = (l + r) >> 1;
int tx = x;
for (int i = 0 ; i < 18 ; i++) {
if (mid & (1<<i)) {
tx = pa[tx][i];
}
}
if (tx >= y) {
r = mid;
}
else {
l = mid;
}
}
cout << r << '\n';
}
} | #include<iostream>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<vector>
#include<map>
#include<algorithm>
#define MAXN 100010
#define LL long long
using namespace std;
LL d[MAXN],dis[MAXN],siz[MAXN];
int n,cnt;
map<LL,int> mp;
struct Edge{int u,v;}E[MAXN];
int main(){
scanf("%d",&n);
for(int i=1;i<=n;i++) scanf("%lld",&d[i]);
for(int i=1;i<=n;i++) mp[d[i]]=i;
sort(d+1,d+n+1);
for(int i=1;i<=n;i++) siz[i]=1;
for(int i=n;i>1;i--){
int u=mp[d[i]];
LL d0=d[i]+2*siz[u]-n;
int v=mp[d0];
if(v){
siz[v]+=siz[u];
dis[v]+=(dis[u]+siz[u]);
E[++cnt].u=min(u,v);
E[cnt].v=max(u,v);
}
else{
puts("-1");
return 0;
}
}
if(dis[mp[d[1]]]!=d[1]){
puts("-1");
return 0;
}
for(int i=1;i<=cnt;i++) printf("%d %d\n",E[i].u,E[i].v);
return 0;
} | 0 | 37,143,649 |
#include <vector>
#include <iostream>
using namespace std;
#define INF 10000000
int main()
{
unsigned n, m; cin >> n >> m;
vector<int> d(m);
vector<int> dp(n + 1, INF);
for (vector<int>::size_type i = 0; i < m; i++)
{
cin >> d[i];
}
dp[0] = 0;
for (unsigned i = 1; i <= n; i++)
{
for (vector<int>::size_type j = 0; j < m; j++)
{
if (i >= d[j])
{
if (dp[i] >= dp[i - d[j]] + 1)
{
dp[i] = dp[i - d[j]] + 1;
}
}
}
}
cout << dp[n] << endl;
return 0;
} | #include <bits/stdc++.h>
#define __Imperial_Lord__ ONLINE_JUDGE
#define _cps CLOCKS_PER_SEC
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define clr(x) memset(x, 0, sizeof(x))
#define rep(i, l, r) for (long long i = (l); i < (long long)(r); i++)
#define repb(i, r, l) for (long long i = (r); i > (long long)(l); i--)
#define lowb(a, x) ( lower_bound((a).begin(), (a).end(), (x)) - (a).begin())
#define uppb(a, x) ( upper_bound((a).begin(), (a).end(), (x)) - (a).begin())
#define sum(a) ( accumulate ((a).begin(), (a).end(), 0ll))
#define high(x) __builtin_popcountll(x)
#define pb push_back
#define pf push_front
#define p0(a) cout << a << " "
#define p1(a) cout << a << endl
#define p2(a, b) cout << a << " " << b << endl
#define p3(a, b, c) cout << a << " " << b << " " << c <<endl
#define p4(a, b, c, d) cout << a << " " << b << " " << c << " " << d <<endl
#define exec cerr<<"Time taken : "<<(ld)(clock())/_cps<<"s"<<endl
#define mod1 998244353
#define mod 1000000007
#define pi 3.1415926535897932384
using namespace std;
typedef vector<long long> vl;
typedef vector<long double> vld;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector< pair<long long, long long> > vp;
typedef vector<tuple<long long , long long , long long> > vtup;
typedef deque <long long> dql;
typedef deque <char> dqc;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
const ll INF=1e18;
template<typename T> istream& operator>>(istream& is, vector<T>& v)
{
for (auto& i : v)
is >> i;
return is;
}
template<typename T>
ostream& operator<<(ostream& os, vector<T>& v)
{
for (auto& i : v)
os << i << ' ';
return os;
}
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
ll t=1;
while(t--)
{
ll a,b;
cin >> a >>b;
ll d=a*500;
if(d>=b) cout << "Yes" << endl;
else cout << "No" << endl;
}
exec;
} | 0 | 32,837,791 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = int64_t;
using pint = pair<ll, ll>;
int main()
{
ll n, d, a;
cin >> n >> d >> a;
vector<pint> xh(n);
rep(i, n) cin >> xh[i].first >> xh[i].second;
rep(i, n) xh[i].second = (xh[i].second % a == 0) ? xh[i].second / a : xh[i].second / a + 1;
sort(xh.begin(), xh.end());
vector<ll> pos;
vector<pint> num;
ll ans = 0;
rep(i, n)
{
ll &x = xh[i].first;
ll &h = xh[i].second;
ll l = upper_bound(pos.begin(), pos.end(), x - d - 1) - pos.begin();
if (l != (ll)pos.size())
{
h = h - (ans - num[l].second);
if (h <= 0)
continue;
}
pos.emplace_back(x + d);
ll tmp = ans;
ans += h;
num.emplace_back(pint(ans, tmp));
}
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define LL long long
int g[10][10], ans;
int main() {
ios::sync_with_stdio(0), cin.tie(0);
int n, m, x, y; cin >> n >> m;
while(m--) {
cin >> x >> y;
g[x][y]++, ++g[y][x];
}
vector<int> v(n);
for(int i = 0; i < n; i++) v[i] = i + 1;
do {
bool ok = 1;
for(int i = 1; i < n; i++) if(!g[v[i-1]][v[i]]) ok = 0;
ans += ok;
}
while(next_permutation(v.begin() + 1, v.end()));
cout << ans;
} | 0 | 82,243,592 |
#include<iostream>
int main(){
int a, b, c;
std::cin >> a >> b >> c;
if(c >= a && c <= b)
std::cout << "Yes" << std::endl;
else
std::cout << "No" << std::endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i,j,n) for(int i=(int)(j);i<(int)(n);i++)
#define REP(i,j,n) for(int i=(int)(j);i<=(int)(n);i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(),(a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<int,int>
#define priq priority_queue<int>
#define disup(A,key) distance(A.begin(),upper_bound(ALL(A),(int)(key)))
#define dislow(A,key) distance(A.begin(),lower_bound(ALL(A),(int)(key)))
#define tii tuple<int,int,int>
#define Priq priority_queue<int,vi,greater<int>>
#define pb push_back
#define mp make_pair
#define INF (1ll<<60)
signed main(){
int N,K; cin>>N>>K;
vi A(N);
rep(i,0,N) cin>>A[i];
vector<vector<bool>> dp(N+1,vector<bool>(K+1)),cp(N+1,vector<bool>(K+1));
dp[0][0]=1;
rep(i,0,N){
REP(j,0,K){
if(dp[i][j]){
dp[i+1][j]=1;
dp[i+1][min(j+A[i],K)]=1;
}
}
}
cp[N][0]=1;
rep(i,0,N){
int k=N-i;
REP(j,0,K){
if(cp[k][j]){
cp[k-1][j]=1;
cp[k-1][min(j+A[k-1],K)]=1;
}
}
}
int ans=0;
rep(i,0,N){
int sum=0;
int memo=K-1;
rep(j,0,K){
if(dp[i][j]){
for(memo;0<=memo;memo--){
if(cp[i+1][memo]&&memo+j<K){
sum=max(sum,memo+j);
break;
}
}
}
}
if(sum+A[i]<K) ans++;
}
cout<<ans<<endl;
} | 0 | 12,069,184 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(int argc, const char *argv[]) {
int n, m;
cin >> n >> m;
vector<ll> va(n);
for (int i = 0; i < n; ++i) {
cin >> va[i];
}
vector<ll> csum{0};
partial_sum(va.begin(), va.end(), back_inserter(csum));
map<ll, ll> cnts;
for (auto s : csum) {
cnts[s % m]++;
}
ll ans = 0;
for (auto &p : cnts) {
ans += (p.second * (p.second - 1)) / 2;
}
cout << ans << '\n';
return 0;
} | #include <stdio.h>
#include <string.h>
#include <limits.h>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <stack>
#include <queue>
typedef unsigned long long ULLONG;
typedef long long LLONG;
static const LLONG MOD_NUM = 1000000007;
template<class _T> static void getint(_T& a) {
const char* fmt = " %d";
if (sizeof(_T) == sizeof(long long)) {
fmt = " %lld";
}
if (scanf(fmt, &a) < 0) {
printf("g1int Error\n");
}
}
template<class _T> static void getint(_T& a, _T& b) {
const char* fmt = " %d %d";
if (sizeof(_T) == sizeof(long long)) {
fmt = " %lld %lld";
}
if (scanf(fmt, &a, &b) < 0) {
printf("g2int Error\n");
}
}
template<class _T> static void getint(_T& a, _T& b, _T& c) {
const char* fmt = " %d %d %d";
if (sizeof(_T) == sizeof(long long)) {
fmt = " %lld %lld %lld";
}
if (scanf(fmt, &a, &b, &c) < 0) {
printf("g3int Error\n");
}
}
static void ABC137D();
#if 1
int main()
{
ABC137D();
fflush(stdout);
return 0;
}
#endif
static void ABC137D()
{
int N, M;
getint(N, M);
std::vector<std::vector<int>> data(M + 1);
for (int i = 0; i < N; i++) {
int day, money;
getint(day, money);
if (day <= M) {
data[day].push_back(money);
}
}
std::vector<int> money(M + 1, 0);
std::priority_queue<int> pque;
for (int i = 0; i <= M; i++) {
for (auto it = data[i].begin(); it != data[i].end(); it++) {
pque.push(*it);
}
if (!pque.empty()) {
money[i] = pque.top(); pque.pop();
}
}
LLONG ans = 0;
for (int i = 0; i <= M; i++) {
ans += (LLONG)money[i];
}
printf("%lld\n", ans);
} | 0 | 88,127,198 |
#include <iostream>
#include <iomanip>
typedef long long ll;
using namespace std;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
#define repi(i, n, init) for(ll i=init;i<(n);i++)
ll gcd(ll a, ll b) {
if (b > a)swap(a, b);
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
int main() {
ll a, b, c, d;
cin >> a >> b >> c >> d;
ll cd = gcd(c, d);
cout << b - (a - 1)
- b / c + (a - 1) / c
- b / d + (a - 1) / d
+ b / (c * d / cd)
- (a - 1) / (c * d / cd) << endl;
return 0;
} | #include <algorithm>
#include <array>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define int long long
signed main() {
cin.tie(0);
ios::sync_with_stdio(0);
int n, m;
cin >> n >> m;
vector<int> a(n), b(n);
for (int i = 0; i < n; i++) cin >> a[i] >> b[i];
vector<pair<int, int>> shops(n);
for (int i = 0; i < n; i++) {
shops[i] = {a[i], b[i]};
}
sort(shops.begin(), shops.end());
int drinks_you_buy = m;
int money = 0;
for (int i = 0; i < n; i++) {
if (drinks_you_buy > shops[i].second) {
drinks_you_buy -= shops[i].second;
money += shops[i].first * shops[i].second;
} else {
money += shops[i].first * drinks_you_buy;
drinks_you_buy = 0;
break;
}
}
cout << money << endl;
} | 0 | 36,043,142 |
#include<iostream>
#include<map>
using namespace std;
int main(){
map<string,int> word;
string s,ss;
int a = 0,b = 0;
while(cin >>s) word[s]++;
for(map<string,int>::iterator it = word.begin(); it!=word.end(); it++){
if(a < it->second){a = it->second;ss = it->first;}
if(b < (it->first).size()){b = (it->first).size();s = (it->first);}
}
cout <<ss<<" "<<s<<endl;
return 0;
} | #include <bits/stdc++.h>
#define rr(i, b) for (int i = 0; i < int(b); i++)
#define vi(n, a) vector <int> a(n); rr(i, n) cin >> a[i]
#define pvec(a) rr(i, a.size()) cout << a[i] << " "; cout << endl
#define bug(x) cout << #x << " " << x << endl
#define ll long long
#define vii vector <int>
using namespace std;
void solve() {
int n;
cin >> n;
vi(n, a);
sort(a.begin(), a.end());
cout << abs(a[n/2 - 1] - a[n/2]) << endl;
}
int main(){
cin.tie(0);
ios_base::sync_with_stdio(false);
int t = 1;
while (t--) {
solve();
}
return 0;
} | 0 | 3,554,401 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD1 1000000007
#define MOD2 1000000009
#define FOR(a,b) for(ll i=a;i<b;i++)
#define endl "\n"
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin >> s;
int ans;
int sum = 0;
for (int i = 0; i < s.size(); i++)
sum += ((int)s[i] - 48) % 9;
if (sum % 9 == 0)
cout << "Yes\n";
else
cout << "No\n";
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ms(a,v) memset(a,v,sizeof a)
#define lll long long
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define Read freopen("input.txt", "r", stdin)
#define Write freopen("output.txt", "w", stdout)
#define INF 1e18
void solve()
{
int a,b;
cin>>a>>b;
if(b%2!=0) cout<<"No"<<endl;
else if(b%2==0&&b/2==a) cout<<"Yes"<<endl;
else if(b%4==0&&b/4==a) cout<<"Yes"<<endl;
else
{
int A=a;
int B=b;
while(1)
{
b-=4;
a--;
if(b%2==0&&b/2==a) { cout<<"Yes"<<endl; return; }
if(a<=0||b<=0) break;
}
while(1)
{
B-=2;
A--;
if(B%4==0&&B/4==A) { cout<<"Yes"<<endl; return; }
if(A<=0||B<=0) break;
}
cout<<"No"<<endl;
}
}
int main()
{
fast
#ifndef ONLINE_JUDGE
#endif
solve();
} | 0 | 14,869,380 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
#define all(x) x.begin(), x.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> pair;
const int inf = 1000000000;
const ll inff = 1000000000000000000;
int main(){
string s, t;
cin >> s >> t;
sort(all(s));
sort(all(t));
reverse(all(t));
if(s >= t) cout << "No" << endl;
else cout << "Yes" << 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;
const int INF = 1 << 30;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> dp(n + 1, INF);
rep(i, n) {
auto itr = lower_bound(dp.begin(), dp.end(), a[i]);
*itr = a[i];
}
cout << lower_bound(dp.begin(), dp.end(), INF) - dp.begin() << endl;
return 0;
} | 0 | 61,684,952 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <queue>
#include <stack>
#include <cstdlib>
#include <map>
#include <iomanip>
#include <set>
#include <stdio.h>
#include <ctype.h>
#include <random>
#include <string.h>
#include <cmath>
using namespace std;
#define pie 3.141592653589793238462643383279
#define mod 1000000007
#define int long long
#define P pair<int,int>
#define all(vec) vec.begin(),vec.end()
int gcd(int x, int y) {
if (y == 0)return x;
return gcd(y, x%y);
}
int lcm(int x, int y) {
return x / gcd(x, y)*y;
}
int kai(int x, int y) {
int res = 1;
for (int i = x - y + 1; i <= x; i++) {
res *= i; res %= mod;
}
return res;
}
int mod_pow(int x, int y, int m) {
int res = 1;
while (y > 0) {
if (y & 1) {
res = res * x % m;
}
x = x * x % m;
y >>= 1;
}
return res;
}
int comb(int x, int y) {
if (y > x)return 0;
return kai(x, y) * mod_pow(kai(y, y), mod - 2, mod) % mod;
}
int n;
vector<int> vec[100010];
bool bl[100010];
int cnt[100010];
queue<P> que;
signed main() {
cin >> n;
if (n % 2) {
cout << "First" << endl;
return 0;
}
for (int i = 0; i < n - 1; i++) {
int a, b; cin >> a >> b;
vec[a].push_back(b);
vec[b].push_back(a);
}
for (int i = 1; i <= n; i++)if ((int)vec[i].size() == 1) {
que.push(make_pair(vec[i][0], 0));
if (bl[vec[i][0]]) {
cout << "First" << endl;
return 0;
}
bl[vec[i][0]] = true;
}
while (!que.empty()) {
int v = que.front().first, p = que.front().second; que.pop();
for (int i = 0; i < (int)vec[v].size(); i++) {
if ((int)vec[vec[v][i]].size() != 2)continue;
for (int j = 0; j < 2; j++)if (v != vec[vec[v][i]][j]) {
if (vec[vec[v][i]][j] == p)continue;
if (bl[vec[vec[v][i]][j]]) {
cout << "First" << endl;
return 0;
}
bl[vec[vec[v][i]][j]] = true;
que.push(make_pair(vec[vec[v][i]][j], v));
}
}
}
for (int i = 1; i <= n; i++) {
if ((int)vec[i].size() <= 2)continue;
bool bl2 = true;
for (int j = 0; j < (int)vec[i].size(); j++)if (!bl[vec[i][j]])bl2 = false;
if (bl2) {
cout << "First" << endl;
return 0;
}
}
cout << "Second" << endl;
} | #include<iostream>
using namespace std;
#include<vector>
int main(){
while(1){
int n;
cin>>n;
if(n==0)break;
int ans=0;
int sta=0;
int l=0;
int r=0;
for(int i=0;i<n;i++){
string s;
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(sta==0&&l==1&&r==1){
ans++;
sta=1;
}else if(sta==1&&l==0&&r==0){
ans++;
sta=0;
}
}
cout<<ans<<endl;
}
return 0;
} | 0 | 87,100,283 |
#include<stdio.h>
#include<queue>
#include<assert.h>
#include<tuple>
#include<string>
#include<algorithm>
#include<iostream>
#include<map>
#include<string.h>
#include<vector>
#include<math.h>
#include<stdlib.h>
#include<set>
#include<ctype.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef tuple<int,int,int> t3;
const int MX = 100005;
const int MM = 1000000007;
int D[MX], O[MX];
int N, K, M;
vector<int> G[MX];
int vst[MX], C[MX];
bool dfs(int x){
if( vst[x] ) return true;
vst[x] = 1;
bool ch = 1;
for(int c : G[x]){
if( vst[c] && C[c] + C[x] != 1 ) ch = 0;
if( !vst[c] ) C[c] = !C[x];
ch &= dfs(c);
}
return ch;
}
int main()
{
int N, M;
scanf("%d%d", &N, &M);
for(int i = 1; i <= M; i++){
int a, b;
scanf("%d%d", &a, &b);
G[a].push_back(b);
G[b].push_back(a);
}
ll p = 0, q = 0, r = 0;
for(int i = 1; i <= N; i++){
if( vst[i] ) continue;
if( G[i].size() == 0 ) p++;
else if( dfs(i) ) q ++;
else r ++;
}
printf("%lld\n", 2*p*N - p*p + r*r + q*q*2 + q*r*2);
} | #include <bits/stdc++.h>
#include <boost/range/algorithm.hpp>
#include <boost/range/numeric.hpp>
#include <boost/integer/common_factor.hpp>
#include <boost/integer/common_factor_rt.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
using std::string;
using std::vector;
using std::set;
using std::multiset;
using std::unordered_set;
using std::map;
using std::multimap;
using std::unordered_map;
using std::pair;
using std::cin;
using std::cout;
using boost::multiprecision::cpp_int;
using cpp_dec_float_1000 = boost::multiprecision::number<boost::multiprecision::cpp_dec_float<1000, boost::int128_type>>;
typedef uintmax_t ull;
typedef intmax_t ll;
typedef uint64_t ul;
typedef uint32_t ui;
typedef uint8_t uc;
constexpr char CRLF = '\n';
constexpr char SPACE = ' ';
constexpr char VECTOR_COUT_SEPARATOR = SPACE;
constexpr ll INF = 1000'000'007;
constexpr int MOD = 1000'000'007;
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; }
template<class T> std::ostream& operator<< (std::ostream& os, const std::vector<T>& vc) { for(auto it = vc.begin(); it != vc.end(); ++it) { if (std::next(it) == vc.end()) os << *it; else os << *it << VECTOR_COUT_SEPARATOR; } return os; }
template<class T1, class T2> inline std::ostream & operator<< (std::ostream & os, const std::pair<T1, T2> & p) { return os << p.first << ' ' << p.second; }
template<class T> T modinv(T a, T m) { T b = m, u = 1, v = 0; while (b) { T t = a / b; a -= t * b; boost::swap(a, b); u -= t * v; boost::swap(u, v); } u %= m; if (u < 0) u += m; return u; }
template<class T> inline bool isSosuu(const T& n) { if (n == T(1)) { return false; } for (T i = 2; i*i <= n; ++i) { if (n % i == 0) { return false; } } return true; }
template<class T> vector<vector<T>> split (const vector<T>& S, T delim) { vector<vector<T>> ret{}; vector<T> buff{}; for (auto c : S) { if (c == delim) { if (!buff.empty()) ret.push_back(buff); buff.clear(); } else { buff.push_back(c); } } if (!buff.empty()) ret.push_back(buff); return ret; }
template<class T> inline void printYesNo(const T& t) { cout << (t ? "Yes" : "No") << CRLF; }
template<class T = int64_t> T modpow(T N, T P, T M) { T ret{1}; N %= M; while (P) { if (P & 0x01) { ret *= N; ret %= M; } P >>= 1; N *= N; N %= M; } return ret; }
int gErr = 0;
#define ASSERT(p) if(!(p)){ gErr = 1; }else{ ; }
struct Tmp
{
public:
int N;
Tmp(int N)
: N(N)
{}
};
void solve(void)
{
int N; cin >> N;
vector<cpp_int> A(N);
vector<cpp_int> B(N);
for (int i = 0; i < N; ++i) {
cin >> A[i] >> B[i];
}
cpp_int cnt{};
for (int i = N - 1; i >= 0; --i) {
auto a = cnt + A[i];
auto b = B[i];
b = (a + b - 1) / b * b;
auto c = b - a;
cnt += c;
}
cout << cnt << CRLF;
return;
}
int main(void)
{
std::ios_base::sync_with_stdio(false);
std::cin.tie(0);
solve();
return 0;
} | 0 | 69,596,955 |
#include<iostream>
#include<set>
#include <bitset>
#include<queue>
#include<vector>
#include<map>
#include<stack>
#include <cstdio>
#include<algorithm>
#include <sstream>
#include<string>
#include<string.h>
#include <cmath>
#include <iomanip>
#include <string>
#include<list>
#include <limits>
#include <numeric>
#include <type_traits>
#define int long long
#define ll long long
#define mod 1000000007
#define inf 1e17
#define rep(i,j,n) for(int i=j;i<n;i++)
#define P pair<int,int>
double pi = 3.141592653589793;
using namespace std;
signed main(){
int x,y;cin>>x>>y;
if(abs(x-y)<=1)cout<<"Brown"<<endl;
else cout<<"Alice"<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
ll mod=1e9+7;
#define PI 3.1415926535897932385
#define inf 9e18
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);
string char_to_str(char c){string tem(1,c);return tem;}
typedef pair<long long, long long> ii;
#define S second
#define F first
ll max(ll a,ll b){if(a>b){return a;}return b;}
ll min(ll a,ll b){if(a<b){return a;}return b;}
#define MAXN 200005
int main()
{
fastio;
string s;
cin>>s;
ll n = s.length();
ll ans=0;
ll white=0;
for (int i = n-1; i>=0; i--)
{
if(s[i]=='W'){
white++;
}
else{
ans+=white;
}
}
cout<<ans;
return 0;
} | 0 | 54,338,212 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define fi first
#define se second
const ll mod = 1e9+7;
const int N = 2e5+5;
void solve(){
int x,xx,y,yy;
cin>>x>>y>>xx>>yy;
int dx = xx-x;
int dy = yy-y;
cout<<xx-dy<<" "<<yy+dx<<" "<<x-dy<<" "<<y+dx<<endl;
}
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int t=1;
while(t--){
solve();
}
return 0;
} | #include <iostream>
using namespace std;
int main()
{
int d;
int area;
while (cin >> d) {
area = 0;
for (int i=0; i<(600/d); i++) {
area += i * i * d * d * d;
}
cout << area << endl;
}
return 0;
} | 0 | 10,454,549 |
#include<cstdio>
int main() {
int a,b,c,x,k;
k =0;
scanf ("%d %d %d",&a,&b,&c);
for (int x = a;x <= b;x++){
if (c % x == 0){
k = k + 1;
}
}
printf("%d\n",k);
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main()
{
int n;
cin >> n;
vector<int> a(n);
int num = 1;
vector<int> b;
rep(i, n)
{
cin >> a[i];
if (a[i] == num)
{
b.push_back(a[i]);
num++;
}
}
int ans = n - b.size();
if (b.size() > 0)
cout << ans << endl;
else
cout << -1 << endl;
return 0;
} | 0 | 40,177,420 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define rep(i,n) for(int i=0;i<n;i++)
#define mod 1000000007
int h,w;
string s[30][30];
signed main(){
cin>>h>>w;
rep(i,h){
rep(j,w){
cin>>s[i][j];
if(s[i][j]=="snuke"){
char c='A'+j;
cout<<c<<i+1<<endl;
return 0;
}
}
}
return 0;
} | #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);
ll n, m;
cin >> n >> m;
if (n >= 3 && m >= 3) {
cout << (n - 2) * (m - 2) << endl;
} else {
if (n == 2 || m == 2) {
cout << 0 << endl;
} else {
if (n == 1 && m == 1) {
cout << 1 << endl;
} else {
if (n < m) {
cout << max(m - 2, 0LL) << endl;
} else {
cout << max(n - 2, 0LL) << endl;
}
}
}
}
} | 0 | 98,948,024 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
for(int i=n;i<=999;i++){
if(i/100==(i/10)%10&&(i/10)%10==i%10){
cout<<i<<endl;
return 0;
}
}
return 0;
} | #include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<stack>
#include<queue>
#include<vector>
#include<cmath>
#include<utility>
#include<set>
#include<complex>
#define vi vector<int>
#define vvi vector<vector<int> >
#define ll long long int
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vb vector<bool>
#define vc vector<char>
#define vs vector<string>
#define ld long double
#define INF 1e9
#define EPS 0.0000000001
#define rep(i,n) for(int i=0;i<n;i++)
#define CC puts("-------ok--------");
#define all(in) in.begin(), in.end()
#define bv vector<bool>
using namespace std;
typedef pair<int, int> PI;
#define MAX 99999999
int main(){
int n;
while(cin>>n,n) {
vi v(n);rep(i,n)cin>>v[i];
sort(v.begin(), v.end());
int ans=INF;
for(int j=0; j<n-1;j++) ans=min(abs(v[j]-v[j+1]),ans);
cout<<ans<<endl;
}
} | 0 | 40,196,334 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
#define int long long
signed main() {
int n,m;
cin >> n >> m;
priority_queue<int> que;
rep(i,n) {
int a; cin >> a;
que.push(a);
}
while(m--) {
int v = que.top();
que.pop();
v/=2;
que.push(v);
}
int ans = 0;
while(!que.empty()) {
int v = que.top();
que.pop();
ans += v;
}
cout << ans << '\n';
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define all(x) (x).begin(),(x).end()
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={1,0,-1,0,1,1,-1,-1};
const ll dx[8]={0,-1,0,1,1,-1,1,-1};
using Graph = vector<vector<int>>;
double nCk(int n, int k) {
double res=1.0;
for(int i=0; i<n; i++){
res*=0.5;}
for(int i=0; i<k; i++){
res*=(double)(n-i);
res/=(double)(k-i);
}
return res;}
struct edge{ll to, cost;};
typedef pair<ll,ll> P;
struct graph{
ll V;
vector<vector<edge> > G;
vector<ll> d;
graph(ll n){
init(n);
}
void init(ll n){
V = n;
G.resize(V);
d.resize(V);
rep(i,V){
d[i] = INF;
}
}
void add_edge(ll s, ll t, ll cost){
edge e;
e.to = t, e.cost = cost;
G[s].push_back(e);
}
void dijkstra(ll s){
rep(i,V){
d[i] = INF;
}
d[s] = 0;
priority_queue<P,vector<P>, greater<P> > que;
que.push(P(0,s));
while(!que.empty()){
P p = que.top(); que.pop();
ll v = p.second;
if(d[v]<p.first) continue;
for(auto e : G[v]){
if(d[e.to]>d[v]+e.cost){
d[e.to] = d[v]+e.cost;
que.push(P(d[e.to],e.to));
}
}
}
}
};
int main(){
ll n; cin>>n;
ll a[n]={};
ll b[65]={};
rep(i,n){
cin>>a[i];}
ll ans = 0;
rep(i,n){
bitset<61> s(a[i]);
rep(j,61){
if(s.test(j))b[j]++;}
}
ll k = 1;
rep(i,61){
ll m = b[i]*(n-b[i]);
m%=MOD;
ans += m*k;
k*=2;
k%=MOD;
ans%=MOD;}
cout << ans << endl;} | 0 | 58,967,701 |
#include <bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
int a1 = 1;
int an = n;
int answer = ((a1 + an)*n)/2;
cout << answer << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define max(a,b) (((a) < (b)) ? (b) : (a))
#define abs(a) (((a) < 0) ? (-(a)) : (a))
int main(void) {
int64_t N,Z,W;
cin >> N >> Z >> W;
vector<int64_t> a(N);
for(int i=0;i<N;i++) {
cin >> a[i];
}
if(N == 1) {
cout << abs(W-a[0]) << "\n";
} else {
cout << max(abs(a[a.size()-1]-W),abs(a[a.size()-1]-a[a.size()-2])) << "\n";
}
return 0;
} | 0 | 27,332,109 |
#include <iostream>
#include <vector>
using value_t = std::size_t;
using values_t = std::vector<value_t>;
using dptbl_t = std::vector<std::size_t>;
static const std::size_t INFINITY = (1 << 29);
std::size_t coin_changing(const values_t& C, value_t n)
{
dptbl_t T(n + 1, INFINITY); T[0] = 0;
for (std::size_t i = 0, m = C.size(); i < m; i++) {
for (value_t j = C[i]; j <= n; j++) {
T[j] = std::min(T[j], T[j - C[i]] + 1);
}
}
return T[n];
}
int main()
{
using namespace std;
int n, m;
cin >> n >> m;
values_t C(m);
for (int i = 0; i < m; i++) { cin >> C[i]; }
cout << coin_changing(C, n) << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e6+10;
ll a[N],prime[N],vis[N];
int n,flag=0,k;
bool isprime[N];
void Prime()
{ memset(isprime,1,sizeof(isprime));
k=0;
prime[1]=0;
for(int i=2;i<N;i++){
if(isprime[i]){
prime[k++]=i;
for(int j=2;i*j<N;j++)
isprime[i*j]=0;
}
}
}
void solve(ll n){
for(int i=0;i<k&&prime[i]*prime[i]<=n;i++){
if(n%prime[i]==0){
if(vis[prime[i]]==0) vis[prime[i]]=1;
else{
flag=1;
return;
}
while(n%prime[i]==0){
n/=prime[i];
}
}
}
if(n>1){
if(vis[n]==0) vis[n]=1;
else{
flag=1;
return;
}
}
}
int main(){
std::ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
Prime();
cin>>n;
ll GCD=0;
for(int i=0;i<n;i++){
cin>>a[i];
if(!flag) solve(a[i]);
if(GCD==0) GCD=a[i];
else GCD=__gcd(GCD,a[i]);
}
if(!flag) cout<<"pairwise coprime"<<endl;
else if(flag&&GCD==1) cout<<"setwise coprime"<<endl;
else cout<<"not coprime"<<endl;
return 0;
} | 0 | 32,129,676 |
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define INF 1000000000000000000
typedef pair<ll, ll> pll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N; cin >> N;
set<int> se;
rep(i, N){
int a;
cin >> a;
se.insert(a);
}
if (se.size() == N){
cout << "YES" << endl;
}
else {
cout << "NO" << endl;
}
} | #include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(12);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";newl;
#define all(x) (x).begin(),(x).end()
#define mset(x,val) memset(x,val,sizeof(x))
#define newl cout<<"\n"
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define dline cerr<<"
#define deb1(x) cerr<<#x<<" = "<<x<<'\n';
#define deb2(x,y) cerr<<'['<<#x<<','<<#y<<"] = "<<'['<<x<<','<<y<<']'<<'\n';
#define deb3(x,y,z) cerr<<'['<<#x<<','<<#y<<','<<#z<<"] = "<<'['<<x<<','<<y<<','<<z<<']'<<'\n';
#define N 1000000007
typedef long long ll;
typedef long double ld;
typedef vector<ll> vll;
typedef pair<ll , ll> pll;
typedef pair<ld, ld> pld;
typedef unordered_map<ll, ll> um;
typedef vector<pll> vpll;
const ll MAX5 = 1e+5 + 7;
const ll MAX7 = 1e+7 + 7;
const ll MAXN = 4 * MAX5;
const ll INF = 0x7f7f7f7f7f7f7f7f;
const int INFi = 0x7f7f7f7f;
const ll MOD = 1e+9 + 7;
vll adj[MAXN]; ll visit[MAXN] = {};
int dx8[] = {0, 1, 1, 1, 0, -1, -1, -1}, dy8[] = {1, 1, 0, -1, -1, -1, 0, 1};
int dx4[] = {0, 1, 0, -1}, dy4[] = {1, 0, -1, 0};
ll t = 1;
ll n, x, k, q, m, y, r;
string s;
ll day[13] = {0,31,28,31,30,31,30,31,31,30,31,30,31};
void MAIN() {
cin >> n;
ll val = n%100;
ll turn = val/5 + (val%5 != 0);
if(n/100 < turn ) cout<<0;
else cout<<1;
}
int main() {
fastio; randomINT;
while (t--) {
MAIN();
}
return 0;
} | 0 | 73,825,843 |
#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 <list>
#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 endregion
string s;
lint k;
int main(void) {
cin >> s >> k;
if ((int)s.size() == 1) {
cout << (int)s.size() * k / 2 << endl; return 0;
}
for (int i = 0; i < (int)s.size() - 1; i++) {
if (s[i] != s[i + 1])
break;
if (i == (int)s.size() - 2) {
cout << (lint)s.size() * k / 2 << endl;
return 0;
}
}
if (s[0] != s[(int)s.size() - 1]) {
lint ans = 0;
int cnt = 1;
for (int i = 1; i < (int)s.size(); i++) {
if (s[i] == s[i - 1]) cnt++;
else {
ans += cnt / 2;
cnt = 1;
}
if (i == (int)s.size() - 1 && cnt != 1) ans += cnt / 2;
}
cout << ans * k << endl;
}
else {
lint a = 1;
lint b = 1;
for (int i = 1; i < (int)s.size(); i++) {
if (s[i] == s[i - 1]) a++;
else break;
}
for (int i = (int)s.size() - 1; i > 0; i--) {
if (s[i] == s[i - 1]) b++;
else break;
}
lint ans = 0;
lint cnt = 1;
for (int i = 1; i < (int)s.size(); i++) {
if (s[i] == s[i - 1]) cnt++;
else {
ans += cnt / 2;
cnt = 1;
}
if (i == (int)s.size() - 1 && cnt != 1) ans += cnt / 2;
}
cout << ans * k - ((a / 2ll + b / 2ll - (a + b) / 2ll) * (k - 1)) << endl;
return 0;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a;
scanf("%d",&a);int ar[a],c=1;
for(int i=0;i<a;i++)
scanf("%d",&ar[i]);
for(int i=1;i<a;i++)
ar[i]=min(ar[i],ar[i-1]);
for(int i=1;i<a;i++)
if(ar[i]!=ar[i-1])
++c;
printf("%d",c);
return 0;
} | 0 | 97,234,236 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll,ll> pll;
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ub upper_bound
#define lb lower_bound
#define asd cout << "ok" << endl;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define trav(it, m) for(auto it = m.begin(); it!= m.end(); it++)
const int MOD = 1e9 + 7;
const ll INF = 1e19;
const ld PI = acos((ld)-1);
const int MX = 2e5 +5;
const char nl = '\n';
int main(){
int n; cin >> n;
int a[n];
for(int i= 0; i < n; i++){
cin >> a[i];
}
int ans = 0;
for(int i = 0 ; i < n -1; i++){
for(int j = i+1; j < n; j++)
{
ans = max(ans, abs(a[j] - a[i]));
}
}
cout << ans << nl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define reps(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) reps(i,0,n)
#define all(x) (x).begin(),(x).end()
#define INF (1000000001)
#define MOD (1000000007)
#define PI (acos(-1))
int main(){
int N,K;
cin >> N >> K;
int a[100010];
rep(i,N){
cin >> a[i];
}
ll sum[100010],psum[100010];
sum[0] = a[0];
psum[0] = max(0,a[0]);
reps(i,1,N){
sum[i] = sum[i-1]+a[i];
psum[i] = psum[i-1]+max(0,a[i]);
}
ll ans = 0;
rep(i,N-K+1){
ll tmp;
if(i==0 || i==N-1){
if(i==0)tmp = max((ll)0,sum[K-1])+psum[N-1]-psum[K-1];
else tmp = psum[N-K-1]+max((ll)0,sum[N-1]-sum[N-K-1]);
}else{
tmp = psum[i-1]+max((ll)0,sum[i+K-1]-sum[i-1])+psum[N-1]-psum[i+K-1];
}
ans = max(ans,tmp);
}
cout << ans << endl;
} | 0 | 5,293,016 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
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 (a>b) { a=b; return 1; } return 0; }
#define rep(i, n) REP(i, 0, n)
#define rep_rev(i, n) for (int (i) = (int)(n) - 1 ; (i) >= 0 ; --(i))
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for(int i = x; i < n; i++)
#define all(x) (x).begin(),(x).end()
ll t1,t2,t3;
const ll mod = 998244353;
const int INF = 1e9;
const ll INFLONG = 1e18;
int main(){
ll n;
cin >> n;
vector<ll> vec(n);
rep(i,n){
cin >> vec[i];
}
ll sum = 1000;
rep(i,n-1){
if(vec[i+1] > vec[i]){
sum += sum / vec[i] * (vec[i+1] - vec[i]);
}
}
cout << sum << endl;
} | #define _CRT_SECURE_NO_WARNINGS
#include<cstdio>
#include<map>
#include<stdexcept>
template<typename T>
class union_find{
std::map<T, T> parent;
std::map<T, T> rank;
public:
void add(const T& t){ parent[t] = t; rank[t] = 0; }
const T& find(T t)const{
while (true){
typename std::map<T, T>::const_iterator it = parent.lower_bound(t);
if (t != it->second)t = it->second;
else return it->second;
}
}
void unite(T l, T r){
l = find(l);
r = find(r);
if (l == r)return;
if (rank[l] < rank[r])
parent[l] = r;
else{
parent[r] = l;
if (rank[l] == rank[r])++rank[l];
}
}
bool is_same(const T& l, const T& r)const{
return find(l) == find(r);
}
};
int n, q;
union_find<int> U;
int main(){
scanf("%d %d", &n, &q);
for (int i = 0; i < n; ++i)U.add(i);
for (int i = 0; i < q; ++i){
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
if (a == 0){
U.unite(b, c);
}
else {
printf("%d\n", int(U.is_same(b, c)));
}
}
return 0;
} | 0 | 54,581,453 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPLL(i, n) for (ll i = 0; i < (ll)(n); i++)
using namespace std;
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(a > b){a = b; return 1;}return 0;}
typedef long long ll;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int X, A; cin >> X >> A;
if(X < A){
cout << 0 << endl;
}else{
cout << 10 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pdd;
typedef vector<ll> vll;
#define ALL(a) a.begin(),a.end()
#define SZ(a) ((int)a.size())
#define FI first
#define SE second
#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 FOR(i,a,b) for(int i=(a);i<(b);i++)
#define PB push_back
#define EB emplace_back
#define MP(a,b) make_pair(a,b)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
#define Decimal fixed<<setprecision(20)
#define INF 1000000000
#define LLINF 1000000000000000000LL
const int inf = 1e9;
const ll linf = 1LL << 50;
const double eps = 1e-10;
const int MOD = 1e9 + 7;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n,a,b;
cin>> n>>a>>b;
vll p(n);
REP(i,n)cin>>p[i];
vll v(3);
REP(i,n){
if(p[i]<=a)
v[0]++;
if(a<p[i] && p[i]<=b)
v[1]++;
if(b<p[i])
v[2]++;
}
ll ans = min(v[2], min(v[1],v[0]));
cout<<ans<<endl;
} | 0 | 27,217,402 |
#include <iostream>
#include <cstdio>
using namespace std;
int main(){
int x, y;
while(1){
cin >> x >> y;
if (x == 0 && y == 0) break;
if(x < y) printf("%d %d\n", x, y);
else printf("%d %d\n", y, x);
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef pair<ii, int> ri3;
#define mp make_pair
#define pb push_back
#define fi first
#define sc second
#define SZ(x) (int)(x).size()
#define ALL(x) begin(x), end(x)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, a, b) for (int i = a; i <= b; ++i)
#define RFOR(i, a, b) for (int i = a; i >= b; --i)
const int MX_N = 1e5+5;
int N, L, T;
int X[MX_N], W[MX_N];
vector<int> dir[2];
int Y[MX_N];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> N >> L >> T;
FOR(i,0,N-1){
cin >> X[i] >> W[i];
Y[i] = ((X[i]+(W[i]==1?T:-T))%L + L)%L;
dir[W[i]-1].push_back(i);
}
sort(Y,Y+N);
int j = 0;
if (!dir[0].empty()) {
int a = dir[0][0], b = X[a];
for (int c : dir[1]) {
int d = X[c];
a += 2*(T/L);
if (2*(T%L) >= (d-b+L)%L) ++a;
if (2*(T%L) >= (d-b+L)%L + L) ++a;
a %= N;
}
b = (b+T)%L;
RFOR(i,N-1,0) if (Y[i] == b) {
j = (i-a+N)%N;
break;
}
} else {
int a = dir[1][0], b = ((X[a]-T)%L + L)%L;
FOR(i,0,N-1) if (Y[i] == b) {
j = (i-a+N)%N;
break;
}
}
FOR(i,j,N-1) cout << Y[i] << '\n';
FOR(i,0,j-1) cout << Y[i] << '\n';
} | 0 | 76,632,361 |
#include<bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#define REP(i, l, n) for(int i=(l), i##_len=(n); i<i##_len; ++i)
#define ALL(x) (x).begin(),(x).end()
#define pb push_back
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;}
char alpha[26] = {'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z'};
int dx[4] = {-1, 1, 0, 0};
int dy[4] = {0, 0, 1, -1};
int main(){
int a, b; cin >> a >> b;
if((a*b)%2 == 1){
cout << "Odd" << endl;
}else{
cout << "Even" << endl;
}
} | #include <iostream>
#include <cstring>
#include <map>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <set>
#include <vector>
#include <queue>
#include <list>
#include <numeric>
#include <stdio.h>
#include <string>
#include <cstdlib>
#include <math.h>
#include <stack>
#include <climits>
#include <bitset>
#include <utility>
using namespace std;
typedef long long ll;
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; }
ll gcd(ll x, ll y) {
ll tmp = 0;
if (x < y){
tmp=x;
x=y;
y=tmp;
}
while (y > 0) {
ll r = x % y;
x = y;
y = r;
}
return x;
}
ll lcm(ll x,ll y){
return x/gcd(x,y)*y;
}
const int MAX = 1e6+1;
const int MOD = 1e9+7;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int 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;
}
}
long long COM(int n, int k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll kaijo(ll k){
ll sum = 1;
for (ll i = 1; i <= k; ++i)
{
sum *= i;
sum%=1000000000+7;
}
return sum;
}
ll lmax(ll s,ll t){
if(s>t){
return s;
}
else{
return t;
}
}
ll lmin(ll s,ll t){
if(s<t){
return s;
}
else{
return t;
}
}
long long modpow(long long res,long long a, long long n, long long mod) {
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
vector<bool> IsPrime;
void sieve(size_t max){
if(max+1 > IsPrime.size()){
IsPrime.resize(max+1,true);
}
IsPrime[0] = false;
IsPrime[1] = false;
for(size_t i=2; i*i<=max; ++i)
if(IsPrime[i])
for(size_t j=2; i*j<=max; ++j)
IsPrime[i*j] = false;
}
int main(){
int n;
cin>>n;
int a[n],b[n];
vector<pair<pair<ll,int>,int> > v;
for(int i = 0; i < n; i++){
cin>>a[i]>>b[i];
ll x = a[i] + b[i];
v.push_back(make_pair(make_pair(x,a[i]),b[i]));
}
sort(v.begin(),v.end());
reverse(v.begin(),v.end());
ll takashi = 0;
ll aoki = 0;
for(int i = 0; i < n; i++){
if(i%2==0){
takashi+=v[i].first.second;
}
else{
aoki+=v[i].second;
}
}
cout<<takashi-aoki<<endl;
return 0;
} | 0 | 2,619,695 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,D;
cin >> N >> D;
vector<vector<int>> data(N, vector<int>(D));
for (int i = 0; i < N; i++) {
for (int j = 0; j < D; j++) {
cin >> data.at(i).at(j);
}
}
int d = 0;
int count = 0;
for (int i = 0; i < N-1; i++) {
for (int k = i+1; k < N; k++) {
for (int j = 0; j < D; j++) {
d += (data.at(k).at(j) - data.at(i).at(j))*(data.at(k).at(j) - data.at(i).at(j));
}
for (int l = 0; l < 128; l++) {
if (l*l == d){
count++;
break;
}
}
d = 0;
}
}
cout << count << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vec vector<int>
#define mii map<int,int>
#define pqb priority_queue<int>
#define inf 1e18
#define no_of_test(x) int x; cin>>x; while(x--)
const int mod = 1e9 + 7;
int32_t main()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
{
int n,k;
cin>>n>>k;
int a[n];
for(int i=0;i<n;i++)
{
cin>>a[i];
}
sort(a,a+n);
int sum=0;
for(int i=0;i<n-k;i++)
{
sum+=a[i];
}
cout<<sum<<'\n';
}
return 0;
} | 0 | 10,862,245 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const double pi = 3.1415926535897932384;
const int INF = 1000000000;
const ll LINF = 1000000000000000;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZABC";
const string abc = "abcdefghijklmnopqrstuvwxyzabc";
const ll MOD = 1000000007;
struct UnionFind {
vector<int> UF;
vector<int> SIZE;
UnionFind(int N) : UF(N), SIZE(N, 1) {
for(int i = 0; i < N; i++) {
UF.at(i) = i;
}
}
int root(int x) {
if (UF.at(x) == x) {
return x;
}
return UF.at(x) = root(UF.at(x));
}
void unite(int x, int y) {
int rx = root(x);
int ry = root(y);
if (rx == ry) {
return;
}
if (SIZE.at(rx) < SIZE.at(ry)) {
UF.at(rx) = ry;
SIZE.at(ry) += SIZE.at(rx);
SIZE.at(rx) = 0;
}
else {
UF.at(ry) = rx;
SIZE.at(rx) += SIZE.at(ry);
SIZE.at(ry) = 0;
}
}
bool same(int x, int y) {
int rx = root(x);
int ry = root(y);
return rx == ry;
}
int size(int x) {
return SIZE.at(root(x));
}
};
int ctoi(char c){
if (c == '0') {
return 0;
}
if (c == '1') {
return 1;
}
if (c == '2') {
return 2;
}
if (c == '3') {
return 3;
}
if (c == '4') {
return 4;
}
if (c == '5') {
return 5;
}
if (c == '6') {
return 6;
}
if (c == '7') {
return 7;
}
if (c == '8') {
return 8;
}
if (c == '9') {
return 9;
}
return -1;
}
char to_char(int i){
if (i == 0) {
return '0';
}
if (i == 1) {
return '1';
}
if (i == 2) {
return '2';
}
if (i == 3) {
return '3';
}
if (i == 4) {
return '4';
}
if (i == 5) {
return '5';
}
if (i == 6) {
return '6';
}
if (i == 7) {
return '7';
}
if (i == 8) {
return '8';
}
if (i == 9) {
return '9';
}
return ' ';
}
bool PN(int x) {
if (x <= 1) {
return false;
}
if (x == 2) {
return true;
}
for (int i = 2; i < sqrt(x) + 1; i++) {
if (x % i == 0) {
return false;
}
}
return true;
}
int main() {
cout << fixed << setprecision(16);
int N, M;
cin >> N >> M;
priority_queue<ll> A;
for (int i = 0; i < N; i++) {
int P;
cin >> P;
A.push(P);
}
for (int i = 0; i < M; i++) {
A.push(A.top() / 2);
A.pop();
}
ll ans = 0;
while (!A.empty()) {
ans += A.top();
A.pop();
}
cout << ans << endl;
} | #include<iostream>
#include<stdio.h>
#include<math.h>
using namespace std;
#define MAX 256
int main(void){
int n;
scanf("%d", &n);
int A[4][3][10] = { 0 };
int b, f, r, v;
for (int i = 0; i < n; i++){
scanf("%d%d%d%d", &b, &f, &r, &v);
A[b - 1][f - 1][r - 1] += v;
}
for (int i = 0; i < 4; i++){
for (int j = 0; j < 3; j++){
for (int k = 0; k < 10; k++){
printf(" %d", A[i][j][k]);
}
printf("\n");
}
if (i != 3){
for (int l = 0; l < 20; l++){
printf("#");
}
printf("\n");
}
}
return 0;
} | 0 | 82,428,025 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S,T;
cin>>S>>T;
cout<<T<<S;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n;
a = n / 1000;
b = n % 1000 / 100;
c = n % 1000 % 100 / 10;
d = n % 1000 % 100 % 10;
if (a == b) {
if (b == c) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
}
else if (b == c) {
if (c == d) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
}
else {
cout << "No" << endl;
}
} | 0 | 64,779,213 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int r;
double d;
cin >> r;
r = (3.14159265359)*r*r;
d = r/(3.14159265359*1);
cout << int(d)+1;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
typedef pair<int, int> P;
string s;
int main(){
cin >> s;
int n = s.size();
if(n == 26 && s == "zyxwvutsrqponmlkjihgfedcba"){
cout << -1 << endl;
}else if(n == 26){
string t = s;
next_permutation(s.begin(), s.end());
rep(i, n){
if(s.at(i) != t.at(i)){
s = s.substr(0, i + 1);
break;
}
}
cout << s << endl;
}else{
int memo[30];
rep(i, 30) memo[i] = 0;
rep(i, n){
memo[s.at(i) - 'a']++;
}
int c;
rep(i, 30){
if(memo[i] == 0){
c = 'a' + i;
break;
}
}
cout << s << (char)c << endl;
}
} | 0 | 36,191,963 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair<int, int>;
#define debug(var) cerr << "[" << #var << "] " << var << endl
#define chmin(x, y) x = min(x, y)
const ll mod = 1000000007;
const int dx[] = {-1,0,1,0};
const int dy[] = {0,-1,0,1};
int main(){
int n;
cin >> n;
int a;
cin >> a;
n %= 500;
string ans = "Yes";
if (n>a) ans = "No";
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<vector<int>> v(100010);
bool used[100010];
int dfs(int p){
used[p] = true;
int x = 0;
for(auto i:v[p]){
if(!used[i]){
x ^= dfs(i) + 1;
}
}
return x;
}
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(20);
int n;
cin>>n;
for(int i=1;i<n;i++){
int a,b; cin>>a>>b;
a--,b--;
v[a].push_back(b);
v[b].push_back(a);
}
ll ans = dfs(0);
if(ans){
cout << "Alice" << endl;
}
else cout << "Bob" << endl;
} | 0 | 87,209,352 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int k;
string s;
cin >> k >> s;
int size = s.size();
if(size <= k)
{
cout << s << "\n";
} else
{
cout << s.substr(0, k) + "..." << "\n";
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define F first
#define S second
#define pb push_back
#define mp make_pair
const int MOD = 1000000007;
const int N = 1e5 + 18;
int32_t main()
{
ios_base::sync_with_stdio(false); cin.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
#endif
int t = 1;
while (t--) {
string s, t;
cin >> s >> t;
int sum = 0;
for (int i = 0; i < min(s.size(), t.size()); i++) {
if (s[i] != t[i]) {
sum++;
}
}
cout << sum << endl;
}
return 0;
} | 0 | 78,126,730 |
#include <bits/stdc++.h>
#include <vector>
#include <iostream>
#include<algorithm>
#include<string>
#include <map>
#include <queue>
#include <stack>
#include<set>
#include<tuple>
#define DIV 1000000007
using namespace std;
using ll = long long;
using ldb = long double;
int main() {
ll N, K; cin >> N >> K;
ll tot = 0, ans = 0;
map<ll, int> mp;
mp[0]++;
queue<ll> qu;
qu.push(0);
for (ll i = 1; i <= N; i++) {
if (i >= K) {
mp[qu.front()]--;
qu.pop();
}
ll a; cin >> a; tot += a;
ll temp = (tot - i) % K;
ans += mp[temp];
mp[temp]++;
qu.push(temp);
}
cout << ans << endl;
} | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
#define ll long long
#define loop(i,n) for(int i=0; i<n; i++)
#define loop1(i,n) for(int i=1; i<=n; i++)
#define loopi(i,s,e) for(int i=s; i < e; i++)
#define loopiRev(i,s,e) for(int i=s; i >= e; i--)
#define PI 3.14159265359
#define x first
#define y second
#define point pair<double,double>
#define len(s) (int)s.length()
#define sz(v) (int)v.size()
#define all(a) a.begin(),a.end()
#define clr(x, val) memset((x), (val), sizeof(x))
void initialize(vector<int> &F, int n){
F = vector<int> (n+1, 0);
for(int i=2; i*i <= n; i++){
if(F[i] == 0)
for(int k=i*i; k <=n ; k+= i)
if(F[k] == 0) F[k] = i;
}
}
int l,n;
vector<int> cuts;
ll dp[1100][1100];
ll solve(int i, int j){
ll &ret= dp[i][j];
if(ret != -1)
return ret;
int cur= lower_bound(cuts.begin(), cuts.end(), i+1) - cuts.begin();
if(cur == cuts.size() || cuts[cur] >= j)
return ret= 0;
ret= 10000000;
while(cur < n && cuts[cur] < j){
ret = min(ret, solve(i, cuts[cur]) + solve(cuts[cur], j) + j - i);
cur++;
}
return ret;
}
int main() {
cin.tie(0);
cin.sync_with_stdio(0);
int a,b,c; cin>>a>>b>>c;
if(c >= a && c <= b)
cout<<"Yes";
else
cout<<"No";
} | 0 | 23,968,690 |
#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() {
ll a,b,c,d;
cin >> a >> b >> c >> d;
cout << min(a,b)+min(c,d) << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REPR(i,n) for(int i=n; i>-1; --i)
#define ALL(a) (a).begin(),(a).end()
#define INIT(a,n,x); REP(i,(n)){ (a)[i]=(x); }
#define CINA(a,n); REP(i,(n)){ cin >> (a)[i]; }
#define INIT2(a,n,m,x); REP(i,(n)){ REP(j,(m)){(a)[i][j]=(x);} }
#define CINA2(a,n,m); REP(i,(n)){ REP(j,(m)){cin >> (a)[i][j];} }
#define Liny "Yes\n"
#define Linn "No\n"
#define LINY "YES\n"
#define LINN "NO\n"
#define umap unordered_map
int keta(ll x){ if(x<10){return 1;} else{return keta(x/10) + 1;}}
int keta_wa(ll x){ if(x<10){return x;} else{return keta_wa(x/10) + x%10;} }
int ctoi(char c){ return ( (c>='0' && c<='9')? c - '0': 0 );}
ll sum(ll a[],ll N){ return accumulate(a,a+N,0LL);}
ll gcd(ll a,ll b){if(a<b)swap(a,b); return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){if(a<b){swap(a,b);} return a/gcd(a,b)*b;}
int main(){
string s; cin>>s;
string ans = "-1";
if(s.size()<26){
map<char,int> mp;
REP(i,s.size()){ ++mp[s[i]]; }
for(char c='a'; c<='z'; ++c){
if(mp[c]==0){ ans = s + (char)c; break;}
}
}else{
int i = 25;
int j = 25;
while(s[i-1]>s[i]){--i;}
while(s[i-1]>s[j]){--j;}
if(i>0){
ans = s.substr(0,i-1) + s[j];
}
}
cout << ans<< "\n";
} | 0 | 34,804,971 |
#include<iostream>
using namespace std;
long long factorial(long long n){
long long int ans;
if(n==0)
ans=1;
else
ans =n*factorial(n-1);
return ans;
}
int main(){
long long n=0;
cin>>n;
long long int ans=1;
ans=factorial(n);
cout<<ans<<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n, c, k;
cin >> n >> c >> k;
int a[n];
for (int i = 0; i < n; i++)
{
cin >> a[i];
}
sort(a, a + n);
int i = 0, bus = 0;
while (i < n)
{
int ptr = i + 1;
while (ptr < (i + c) && ptr < n)
{
if (a[ptr] > (a[i] + k))
break;
ptr++;
}
bus++;
i = ptr;
}
cout << bus << endl;
return 0;
} | 0 | 64,777,989 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
int n,m;
cin >> n >> m;
vector<vector<int>>v(m);
for(int i = 0; i < m; i++)
{
int k;
cin >> k;
v[i].resize(k);
for(int j = 0; j < k; j++)
{
cin >> v[i][j];
v[i][j]--;
}
sort(v[i].begin(),v[i].end());
}
vector<int>p(m);
for(int i = 0; i < m; i++) cin >> p[i];
int answer = 0;
for(int bit=0;bit<(1<<n);bit++)
{
vector<int>sum(m,0);
for(int i=0;i<n;i++)
{
if(bit&(1<<i))
{
for(int j = 0; j < m; j++)
{
if(binary_search(v[j].begin(),v[j].end(),i)) sum[j]++;
}
}
}
bool f = true;
for(int i = 0; i < m; i++) if(sum[i]%2 != p[i]) f = false;
if(f) answer++;
}
cout << answer << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={1,0,-1,0,1,1,-1,-1};
const ll dx[8]={0,-1,0,1,1,-1,1,-1};
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 main(){
ll k,a,b;cin >> k >> a >> b;
if(a>=b-2)cout << k+1 <<endl;
else{
ll t=k-(a-1);
if(t<0){
cout << k+1 <<endl;
}
else{
cout << a+(t/2)*(b-a)+(t%2) <<endl;
}
}
} | 0 | 84,701,917 |
#define _LIBCPP_DEBUG 0
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll MOD = 1e9 + 7;
int main(void){
ll N,K; cin>>N>>K;
ll ans = 0;
ans = (N/K) * (N/K) * (N/K);
ll tmp = (N/(K/2))-(N/K);
if(K%2==0) ans += tmp*tmp*tmp;
cout<<ans<<endl;
} | #include <iostream>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
while(1){
int n;
cin >> n;
if(n==0)break;
string s;
int r=0,l=0,sum=0,ans=0;
rep(i,n){
cin >> s;
if(s[0] == 'l'){
if(l) l=0;
else l=1;
}
if(s[0] == 'r'){
if(r) r=0;
else r=1;
}
if(sum == 0 && r+l == 2){
sum = 2;
ans++;
}
else if(sum == 2 && r+l==0){
sum = 0;
ans++;
}
}
cout << ans << endl;
}
} | 0 | 56,195,793 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, K;
string S;
cin >> N >> K;
cin >> S;
vector<int> one;
vector<int> zero;
bool counting_one = true;
int cnt = 0;
for (int i=0; i<N; i++) {
if (counting_one) {
if (S[i] == '1') {
cnt++;
} else {
one.push_back(cnt);
cnt = 0;
counting_one = false;
i--;
}
} else {
if (S[i] == '0') {
cnt++;
} else {
zero.push_back(cnt);
cnt = 0;
counting_one = true;
i--;
}
}
}
if (one.size() == 0 || zero.size() == 0) {
cout << N << endl;
return 0;
}
if (S[N-1] == '0') {
one.push_back(0);
zero.push_back(cnt);
} else {
one.push_back(cnt);
}
int t = one[0];
int l = 0;
int r = 1;
while(1) {
t += zero[r-1];
t += one[r];
if (r == one.size() - 1) break;
if (r == K) break;
r++;
}
int ans = 0;
while(1) {
ans = max(ans, t);
t -= one[l];
t -= zero[l];
l++;
if (r == one.size() - 1) break;
r++;
t += zero[r-1];
t += one[r];
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <tuple>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
#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 v[10] = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
int main() {
ll n, m;
cin >> n >> m;
vl a(m);
rep(i, m) {
cin >> a[i];
}
sort(rall(a));
vl dp(n+1, -INF);
dp[0] = 0;
exrep(i, 1, n) {
rep(j, m) {
if(i - v[a[j]] >= 0) {
chmax(dp[i], dp[i - v[a[j]]] + 1);
}
}
}
ll x = n;
rep(i, dp[n]) {
rep(j, m) {
if(x - v[a[j]] >= 0 && dp[x] == dp[x - v[a[j]]] + 1) {
cout << a[j];
x -= v[a[j]];
break;
}
}
}
cout << endl;
re0;
} | 0 | 56,435,317 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vll vector<ll>
#define vpii vector<pair<int,int>>
#define vpll vector<pair<ll,ll>>
#define fr(i,k,n) for (int i = k; i < n; ++i)
#define fri(i,k,n) for (int i = k; i >= n; --i)
#define INF (int)1e9
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define all(arr) arr.begin(),arr.end()
void boost(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
void solve(){
ll a,b,c,d;
cin>>a>>b>>c>>d;
ll a1=a*c,a2=b*d,a3=a*d,a4=b*c;
a1=max(a1,a2);
a2=max(a3,a4);
cout<<max(a1,a2)<<endl;
return;
}
int main()
{
boost();
int tc=1;
while(tc--)
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Pld = pair<ld, ld>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecD = vector<ld>;
using VecS = vector<string>;
template <typename T>
using Vec2 = vector<vector<T>>;
#define REP(i, m, n) for(ll i = (m); i < (n); ++i)
#define REPN(i, m, n) for(ll i = (m); i <= (n); ++i)
#define REPR(i, m, n) for(ll i = (m)-1; i >= (n); --i)
#define REPNR(i, m, n) for(ll i = (m); i >= (n); --i)
#define rep(i, n) REP(i, 0, n)
#define repn(i, n) REPN(i, 1, n)
#define repr(i, n) REPR(i, n, 0)
#define repnr(i, n) REPNR(i, n, 1)
#define all(s) (s).begin(), (s).end()
#define pb push_back
#define fs first
#define sc second
template <typename T>
bool chmax(T &a, const T b){if(a < b){a = b; return true;} return false;}
template <typename T>
bool chmin(T &a, const T b){if(a > b){a = b; return true;} return false;}
template <typename T>
ll pow2(const T n){return (1LL << n);}
template <typename T>
void cosp(const T n){cout << n << ' ';}
void co(void){cout << '\n';}
template <typename T>
void co(const T n){cout << n << '\n';}
template <typename T1, typename T2>
void co(pair<T1, T2> p){cout << p.fs << ' ' << p.sc << '\n';}
template <typename T>
void co(const vector<T> &v){for(T i : v) cosp(i); co();}
template <typename T>
void co(initializer_list<T> v){for(T i : v) cosp(i); co();}
void ce(void){cerr << '\n';}
template <typename T>
void ce(const T n){cerr << n << '\n';}
template <typename T>
void cesp(const T n){cerr << n << ' ';}
template <typename T>
void ce(initializer_list<T> v){for(T i : v) cesp(i); ce();}
void sonic(){ios::sync_with_stdio(false); cin.tie(0);}
void setp(const ll n){cout << fixed << setprecision(n);}
constexpr int INF = 1e9+1;
constexpr ll LINF = 1e18L+1;
constexpr ll MOD = 1e9L+7;
constexpr ld EPS = 1e-11;
const double PI = acos(-1);
int main(void){
ll n, m;
cin >> n >> m;
set<ll> st;
rep(i, m){
ll a;
cin >> a;
st.insert(a);
}
vector<ll> dp(n + 1);
dp[0] = 1;
repn(i, n){
if(st.find(i) != st.end()) continue;
dp[i] += dp[i - 1];
if(i > 1) dp[i] += dp[i - 2];
dp[i] %= MOD;
}
co(dp[n]);
return 0;
} | 0 | 40,571,638 |
#include<map>
#include<set>
#include<list>
#include<cmath>
#include<queue>
#include<stack>
#include<cstdio>
#include<vector>
#include<complex>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<numeric>
#include<sstream>
#include<iostream>
#include<algorithm>
#include<functional>
using namespace std;
int i=0,n=0,s=0,cnt=0,ans=0;
int combination(int a,int b,int c);
int combination(int a,int b,int c)
{
if(b == s && c == n){
ans++;
}
if(a == 10 || c == n){
return 0;
}
combination(a+1,b,c);
combination(a+1,b+a,c+1);
}
int main()
{
while(cin >> n >> s && n && s>=0){
ans=0;
combination(0,0,0);
cout << ans << endl;
}
} | #include <iostream>
#include <algorithm>
#include <climits>
#include <string>
#include <vector>
#include <cmath>
#include <queue>
using namespace std;
#define rep(i, n) for (int i=0; i<int(n); i++)
#define all(c) (c).begin(), (c).end()
#define MAX_W 1010
#define MAX_H 1010
int H, W, N;
char A[MAX_H][MAX_W];
vector<bool**> global;
pair<int, int> find_char(char c) {
rep(y, H) {
rep(x, W) {
if (A[y][x] == c) return make_pair(x, y);
}
}
return make_pair(-1, -1);
}
bool visited[MAX_W][MAX_H];
int bfs(int start_x, int start_y, int target_x, int target_y) {
queue<int> q;
rep(i, W) rep(j, H) visited[j][i] = false;
q.push(start_x); q.push(start_y); q.push(0);
while (!q.empty()) {
int x = q.front(); q.pop();
int y = q.front(); q.pop();
int dist = q.front(); q.pop();
char m = A[y][x];
if (x == target_x && y == target_y) return dist;
int dx[] = {0, 1, 0, -1};
int dy[] = {-1, 0, 1, 0};
rep(i, 4) {
int tx = x + dx[i];
int ty = y + dy[i];
if (tx >= 0 && tx < W && ty >= 0 && ty < H &&
A[ty][tx] != 'X' && !visited[ty][tx]) {
q.push(tx);
q.push(ty);
q.push(dist + 1);
visited[ty][tx] = true;
}
}
}
return INT_MIN;
}
int main() {
cin >> H >> W >> N;
rep(i, H) cin >> A[i];
auto pos_s = find_char('S');
int start_x = pos_s.first;
int start_y = pos_s.second;
int ans = 0;
for (int i=1; i<=N; i++) {
auto pos = find_char((char)((int)'0'+i));
int tx = pos.first;
int ty = pos.second;
ans += bfs(start_x, start_y, tx, ty);
start_x = tx;
start_y = ty;
}
cout << ans << "\n";
return 0;
} | 0 | 50,396,599 |
#include<algorithm>
#include<cstdio>
#include<vector>
#define ll long long
using namespace std;
vector<pair<ll, ll>> vt;
vector<pair<ll, ll>>vt1;
int main()
{
ll n;
scanf("%lld", &n);
ll sum = 0;
ll gap = 1234567890;
for (int i = 0; i < n; i++)
{
ll q, w;
scanf("%lld %lld", &q, &w);
sum += q;
if (q < w)
vt.push_back({ q,w });
else {
if (q > w)
gap = min(gap, w);
vt1.push_back({ w,q });
}
}
if (vt1.size() == n)
{
puts("0");
return 0;
}
sum -= gap;
printf("%lld\n", sum);
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1e9+7;
constexpr ll INF = 1ll<<60;
#define FOR(i,a,b) for (ll i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
int main(int argc, char **argv)
{
ll N; cin >> N;
vector<string> S(N);
REP(i, N) cin >> S[i];
ll res{0};
ll s_a{0}, s_b{0}, s_ab{0};
REP(i, N)
{
ll M= S[i].size();
string &s = S[i];
if (s.front() == 'B' && s.back() != 'A') ++s_b;
else if (s.back() == 'A' && s.front() != 'B') ++s_a;
else if (s.back() == 'A' && s.front() == 'B') ++s_ab;
for (ll k = 0; k < M-1;)
{
if (s[k] == 'A' && s[k+1] == 'B')
{
++res;
k+=2;
}
else
++k;
}
}
if (s_ab == 0)
std::cout << res + min(s_a, s_b) << std::endl;
else if (s_a + s_b > 0)
std::cout << res + min(s_a, s_b) + s_ab << std::endl;
else
std::cout << res + s_ab - 1 << std::endl;
} | 0 | 78,637,367 |
#include<bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; i++)
#define repo(i, n) for(int i=1; i<=n; i++)
#define INF 1001001001
#define INFll 100100100100100
#define PrintVec(x) for (auto elementPrintVec: x) { cout << elementPrintVec << " "; } cout << endl;
using namespace std;
using ull = unsigned long long;
using ll = long long;
using P = pair<int, int>;
const int mod = 1000000007;
ll func(ll a, ll b){
if(a==b){
return a;
} else if(b < a){
swap(a, b);
}
if(b%a==0){
return 2*a*(b/a)-a;
} else {
return 2*a*(b/a)+func(a, b%a);
}
}
int main(){
ll n, x;
cin >> n >> x;
cout << n+func(n-x, x) << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <tuple>
#include <utility>
#include <vector>
#define ll long long
#define itn int
#define endl '\n'
#define co(ans) cout<<ans<<endl
#define COYE cout<<"YES"<<endl
#define COYe cout<<"Yes"<<endl
#define COye cout<<"yes"<<endl
#define CONO cout<<"NO"<<endl
#define CONo cout<<"No"<<endl
#define COno cout<<"no"<<endl
#define FORE(i,a) for(auto &i:a)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define FFOR(i,a,b) for(int i=(a);i<=(b);++i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) FFOR(i,1,n)
#define PB push_back
#define MP make_pair
#define ALL(V) (V).begin(),(V).end()
#define SORT(V) sort((V).begin(),(V).end())
#define REVERSE(V) reverse((V).begin(),(V).end())
#define EACH(V,i) for(typeof((V).begin()) i=(V).begin();i!=(V).end();++i)
#define equals(a,b) (fabs((a)-(b))<EPS)
#define INF ((1LL<<62)-(1LL<<31))
#define EPS 1e-10
#define PI 3.141592653589793238
#define MOD 1000000007
#define MMOD 998244353
#define MAX 2010101
using namespace std;
using Edge=pair<ll,ll>;
using Graph=vector<vector<Edge>>;
inline int toInt(string s){int v;istringstream sin(s);sin>>v;return v;}
template<class T>inline string toString(T x){ostringstream sout;sout<<x;return sout.str();}
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;}
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int,int> PII;
typedef pair<ll,ll> PLL;
typedef long long LL;
const int dx[4]={0,1,0,-1},dy[4]={1,0,-1,0};
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
int main(){
ll N;
cin>>N;
Graph G(N+1);
REP(i,N-1){
ll A,B,C;
cin>>A>>B>>C;
G[A].PB(Edge(B,C));
G[B].PB(Edge(A,C));
}
ll Q,K;
cin>>Q>>K;
ll DIS[N+1];
RREP(i,N) DIS[i]=INF;
DIS[K]=0;
queue<ll> QQ;
QQ.push(K);
while(!QQ.empty()){
ll v=QQ.front();
QQ.pop();
FORE(nv,G[v]){
if(DIS[nv.first]<INF) continue;
DIS[nv.first]=DIS[v]+nv.second;
QQ.push(nv.first);
}
}
REP(i,Q){
ll X,Y;
cin>>X>>Y;
cout<<DIS[X]+DIS[Y]<<endl;
}
return 0;
} | 0 | 96,329,280 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
size_t s;
cin >> s;
vector<bool> a(1000000, false);
long long m = 1;
a[s] = true;
long long current = s;
while (true) {
current = (current % 2 == 0) ? (current / 2) : (3 * current + 1);
if (a[current]) {
break;
}
else {
a[current] = true;
++m;
}
}
cout << m + 1 << endl;
return EXIT_SUCCESS;
} | #include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;
class DisjointSet{
public :
vector<int> rank,p;
DisjointSet(){}
DisjointSet(int size)
{
rank.resize(size,0);
p.resize(size,0);
for(int i=0;i<size;i++)
makeSet(i);
}
void makeSet(int x)
{
p[x] = x;
rank[x] = 0;
}
bool same(int x,int y)
{
return findSet(x) == findSet(y);
}
void unite(int x,int y)
{
link(findSet(x),findSet(y));
}
void link(int x,int y)
{
if(rank[x] > rank[y])
{
p[y] = x;
}
else
{
p[x] = y;
if(rank[x] == rank[y])
rank[y]++;
}
}
int findSet(int x)
{
if(x!=p[x])
p[x] = findSet(p[x]);
return p[x];
}
};
int main()
{
int m,n;
int t,a,b;
scanf("%d%d",&m,&n);
DisjointSet ds = DisjointSet(m);
for(int i=1;i<=n;i++)
{
scanf("%d%d%d",&t,&a,&b);
if(t == 0)
ds.unite(a,b);
else
{
if(ds.same(a,b))
printf("1\n");
else
printf("0\n");
}
}
return 0;
} | 0 | 74,138,284 |
#include <bits/stdc++.h>
#define rep(i,k,n) for(int i=k;i<n;++i)
#define repe(i,k,n) for(int i=k;i<=n;++i)
typedef long long in;
using namespace std;
int main()
{
cin.tie(0);cout.tie(0);
ios::sync_with_stdio(false);
in h,w;
cin >> h >> w;
in blo = h*w;
if (h == 1 || w == 1) {
cout << 1;
return 0;
}
if (blo % 2 ==0){
cout << blo/2;
}else cout << (blo+1)/2 ;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> v(n);
for(int &e : v)
cin >> e;
vector<int> v2 = v;
sort(v2.rbegin(), v2.rend());
for(int &e : v)
cout << (e == v2[0] ? v2[1] : v2[0]) << '\n';
} | 0 | 23,114,573 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
string sam="abcdefghijklmnopqrstuvwxyz";
vector<int> num(26);
for(int i=0; i<s.size(); i++){
for(int j=0; j<26; j++){
if(s.at(i)==sam.at(j)){
num.at(j)++;
break;
}
}
}
bool judge=true;
for(int i=0; i<26; i++){
if(num.at(i)>=2){
judge=false;
break;
}
}
if(judge) cout << "yes" << endl;
else cout << "no" << endl;
} | #include "bits/stdc++.h"
using namespace std;
using ll=long long;
const int MOD=1e9+7;
const int MAX_N=1e5;
ll dp[MAX_N][2];
string L;
ll rec(int k=0,bool tight=true){
if(k==L.length()) return 1;
if(dp[k][tight]!=-1) return dp[k][tight];
else dp[k][tight]=0;
if(tight){
if(L[k]=='1'){
dp[k][tight]+=2*rec(k+1,true);
dp[k][tight]+=rec(k+1,false);
}else{
dp[k][tight]+=rec(k+1,true);
}
}else{
dp[k][tight]+=3*rec(k+1,false);
}
return dp[k][tight]%=MOD;
}
int main(){
cin>>L;
for(int i=0;i<L.length();++i) for(int j=0;j<2;++j) dp[i][j]=-1;
ll ans=rec();
ans%=MOD;
cout<<ans<<endl;
} | 0 | 70,847,139 |
#include<iostream>
#include<algorithm>
using namespace std;
int main (void)
{
long long int a,b,i;
string s;
cin>>a>>s;
b=(s[0]-'0')*100+(s[2]-'0')*10+s[3]-'0';
a=a*b/100;
cout<<a<<endl;
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define rep(i,x,y) for(ll i=x;i<y;i++)
#define irep(i,a) for(auto i = a.begin(); i != a.end(); ++i)
#define nvarep(n,a) ll n;cin>>n;vector<ll>a(n);rep(i,0,n)cin>>a[i]
#define vecrep(n,a,type) vector<type>a(n);rep(i,0,n)cin>>a[i]
#define lcm(a,b) (a/__gcd(a, b)*b)
#define range(a) (a).begin(),(a).end()
#define pb push_back
#define mp make_pair
#define nnn "\n"
#define spa " "
using p = pair<ll, string>;
using garph = vector<vector<ll>>;
const int inf = 2147483647;
const ll INF = 9223372036854775807;
signed main (){
int n;cin>>n;
if(n%2==1){
cout<<0<<nnn;
}else{
int ans = 0;
int go = 1;
rep(i,0,25){
ans+=n/(go*10);
go*=5;
}
cout<<ans<<nnn;
}
return 0;
} | 0 | 94,754,609 |
#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <map>
#include <set>
#include <tuple>
#include <bitset>
#include <cstdio>
#include <cmath>
#include <iomanip>
using namespace std;
using pii = pair<int, int>;
using ti = tuple<int, int, int>;
const double eps=1e-14;
const int mod = 1e9 + 7;
const int inf = ((1<<30));
const long long linf = (1LL<<60);
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n/2), b(n/2);
vector<int> ac(100001), bc(100001);
for(int i=0; i<n; i++)
{
if(i%2 == 0)
{
cin >> a.at(i/2);
ac.at(a.at(i/2))++;
}
else
{
cin >> b.at(i/2);
bc.at(b.at(i/2))++;
}
}
int maxa = 0, maxb = -1, maxa2 = 0, maxb2 = -1, ansa, ansb;
for(int i=1; i<100001; i++)
{
if(ac.at(i) > maxa)
{
maxa2 = maxa;
maxa = ac.at(i);
ansa = i;
}
else if(ac.at(i) > maxa2) maxa2 = ac.at(i);
if(bc.at(i) > maxb)
{
maxb2 = maxb;
maxb = bc.at(i);
ansb = i;
}
else if(bc.at(i) > maxb2) maxb2 = bc.at(i);
}
if(ansa != ansb) cout << n - maxa - maxb << endl;
else cout << min(n - maxa2 - maxb, n - maxa - maxb2) << endl;
return 0;
} | #include<iostream>
#include<iomanip>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<numeric>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define BIL ((ll)1e9)
#define MOD ((ll)1e9+7)
#define INF (1LL<<60)
#define inf (1<<29)
int main(int argc,char* argv[]){
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
int n;
cin >> n;
string s,t;
cin >> s >> t;
int ans=0;
for(int i=0;i<n;i++){
int count=0;
for(int j=0;i+j<n;j++){
if(s[i+j]==t[j])count++;
else{
count=0;
break;
}
}
if(count!=0){
ans=count;
break;
}
}
cout << s.size()+t.size()-ans << endl;
return 0;
} | 0 | 94,060,689 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define fo(a,b) for(int a=0;a<b;a++)
#define Sort(a) sort(a.begin(),a.end())
#define rev(a) reverse(a.begin(),a.end())
#define fi first
#define se second
#define co(a) cout<<a<<endl
#define sz size()
#define bgn begin()
#define en end()
#define pb(a) push_back(a)
#define pop pop_back
#define V vector
#define P pair
#define V2(a,b,c) V<V<int>> a(b,V<int>(c))
#define V2a(a,b,c,d) V<V<int>> a(b,V<int>(c,d))
#define incin(a) int a; cin>>a
#define yuko(a) setprecision(a)
template<class T>
void cou(vector<vector<T>> a){
int b=a.size();
int c=a[0].size();
fo(i,b){
fo(j,c){
cout<<a[i][j];
if(j==c-1)
cout<<endl;
else
cout<<' ';
}
}
}
int wari(int a,int b) {
if(a%b==0)
return a/b;
else
return a/b+1;
}
int keta(int a){
double b=a;
b=log10(b);
int c=b;
return c+1;
}
int souwa(int a){
return a*(a+1)/2;
}
int lcm(int a,int b){
int d=a,e=b,f;
if(a<b)
swap(a,b);
int c,m=1;
while(m){
c=a%b;
if(c==0){
f=b;
m--;
}
else{
a=b;
b=c;
}
}
return d*e/f;
}
int gcm(int a,int b){
int d=a,e=b,f;
if(a<b)
swap(a,b);
int c,m=1;
while(m){
c=a%b;
if(c==0){
f=b;
m--;
}
else{
a=b;
b=c;
}
}
return f;
}
bool prime(int a){
if(a<2)
return false;
else if(a==2)
return true;
else if(a%2==0)
return false;
double b=sqrt(a);
for(int i=3;i<=b;i+=2){
if(a%i==0){
return false;
}
}
return true;
}
struct Union{
vector<int> par;
Union(int n){
par= vector<int>(n, -1);
}
int find(int x){
if(par[x]<0)
return x;
else
return par[x]=find(par[x]);
}
bool same(int a,int b){
return find(a)==find(b);
}
int Size(int a){
return -par[find(a)];
}
void unite(int a,int b){
a=find(a);
b=find(b);
if(a==b)
return;
if(Size(b)>Size(a))
swap<int>(a,b);
par[a]+=par[b];
par[b]=a;
}
};
int ketas(int a){
string b=to_string(a);
int c=0;
fo(i,keta(a)){
c+=b[i]-'0';
}
return c;
}
signed 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>
#define dcout cout << fixed << setprecision(15)
#define rep(i, a) for(int i = 0; i < a; i++)
#define arep(i, x) for(auto i : x)
#define all(v) v.begin(), v.end()
#define int long long
#define F first
#define S second
#define VE vector<int>
#define pb(x) push_back(x)
using namespace std;
signed main() {
int n;
cin >> n;
VE a;
rep(i, n) {
int enter;
cin >> enter;
a.pb(enter);
}
int ans = 0;
rep(i, n - 1) {
if(a[i + 1] == a[i]) {
a[i + 1] = 10001;
ans++;
}
}
cout << ans << endl;
return 0;
} | 0 | 6,903,082 |
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int cnt[101];
fill(cnt,cnt+101,0);
int ans=0,i;
while(cin>>i)
{
cnt[i]++;
ans=max(ans,cnt[i]);
}
for (int i = 0; i < 101; ++i)
{
if(cnt[i]==ans) cout<<i<<endl;
}
return 0;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
#define irep(i, n) for (int64_t i = 0; i <= (int64_t)(n); i++)
#define rrep(i, n) for (int64_t i = (n)-1; i >= 0; i--)
#define rirep(i, n) for (int64_t i = n; i >= 0; i--)
template <int64_t MOD>
class Modint {
using Self = Modint<MOD>;
int64_t m_value;
public:
Modint(int64_t value) : m_value((value % MOD + MOD) % MOD) {}
Self pow(int64_t e) const {
if (e == 0) {
return (Self)1;
} else if (e % 2 == 0) {
return ((*this) * (*this)).pow(e / 2);
} else {
return (*this).pow(e - 1) * (*this);
}
}
Self inv() const { return pow(MOD - 2); }
Self& operator=(const Self& rh) {
m_value = rh.m_value;
return *this;
}
Self operator-() const { return Self(-m_value); }
Self operator+(const Self& other) const {
return Self(m_value + other.m_value);
}
Self operator-(const Self& other) const {
return Self(m_value - other.m_value);
}
Self operator*(const Self& other) const {
return Self(m_value * other.m_value);
}
Self operator/(const Self& other) const { return (*this) * other.inv(); }
Self& operator+=(const Self& rh) { return (*this) = (*this) + rh; }
Self& operator-=(const Self& rh) { return (*this) = (*this) - rh; }
Self& operator*=(const Self& rh) { return (*this) = (*this) * rh; }
int64_t value() const { return m_value; }
};
int main() {
int N;
cin >> N;
string s;
cin >> s;
vector<int> pos(26, 1);
for (char c : s) {
pos[c - 'a']++;
}
using Mint = Modint<1'000'000'007>;
Mint result = 1;
for (int p : pos) {
result *= p;
}
result -= 1;
cout << result.value() << endl;
return 0;
} | 0 | 70,556,000 |
#include<iostream>
#include<vector>
using namespace std;
void Change(int x, int y){
int z = y;
y = x;
x = z;
}
vector<int> Subvec(vector<int> X, int p, int l){
vector<int> Y;
for(int i = p; i < p+l; i++) Y.push_back(X[i]);
return Y;
}
vector<int> SelectionSort(vector<int> A, int i){
int N = A.size() - 1;
int j_0 = i;
for(int j = i; j < N; j++){
if(A[j] < A[j_0]) j_0 = j;
}
if(j_0 != i){
A[N]++;
int a = A[j_0];
A[j_0] = A[i];
A[i] = a;
}
return A;
}
void Output(vector<int> A){
int n = A.size() - 1;
for(int i = 0; i < n; i++) cout << A[i] << ' ';
cout << A[n] << endl;
}
int main(){
int N;
cin >> N;
vector<int> A;
for(int i = 0; i < N; i++){
int a;
cin >> a;
A.push_back(a);
}
A.push_back(0);
for(int i = 0; i < N; i++) A = SelectionSort(A, i);
Output(Subvec(A, 0, N));
cout << A[N] << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, s, n) for (int i = s; i < n; i++)
#define rp(i,n) for (int i=0;i<n;i++)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define all_acc(x) (x).begin(), (x).end(), 0LL
#define int long long
#define absSort(v) sort(a.begin(), a.end(), [](int i, int j) -> bool { return abs(i) < abs(j); });
using namespace std;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
using ll = long long;
double pi=3.14159265359;
void output_tate(vector<int> s){
int n = s.size();
for (int i = 0; i < n; i++){
cout << s[i]<<endl;
}
}
void output_yoko(vector<int> s){
int n = s.size();
for (int i = 0; i < n; i++){
if (i != 0)
cout << " ";
cout << s[i];
}
cout << endl;
}
int MOD = pow(10, 9) + 7;
int kaijou(int n){
if(n==0) return 1;
else{
return ((n%MOD)*(kaijou(n-1)%MOD))%MOD;
}
}
bool ispow(int n){
int rn=sqrt(n);
if(rn*rn==n) return true;
else return false;
}
signed main() {
string s; cin>>s;
if(s[0]=='7'||s[1]=='7'|s[2]=='7'){
cout<<"Yes"<<endl;
}else cout<<"No"<<endl;
} | 0 | 36,783,479 |
#include <iostream>
#include <vector>
#include <map>
#include <cstring>
#include <string>
#include <stack>
#include <queue>
#include <cmath>
#include <cstdlib>
#include <cstdio>
#include <algorithm>
#include <sstream>
#include <set>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define repp(i,k,n) for(int i=k;i<(int)n;i++)
#define rei(n) for(int i=0;i<(int)n;i++)
#define rel(n) for(int l=0;l<(int)n;l++)
#define all(s) s.begin(),s.end()
#define INT_MAX 2147483647
#define debug(x) cout<<#x<<": "<<x<<endl;
#define PI 2*acos(0,0)
#define pb push_back
#define inin(x) int x; cin>>x;
#define ll long long
#define pb push_back
typedef pair<int, int> pii;
typedef pair<int, pii> pipii;
int main()
{
int a = 0, b = 0;
rep(i, 4)
{
inin(x); a += x;
}
rep(i, 4)
{
inin(x); b += x;
}
cout << max(a, b) << endl;
} | #include <stdio.h>
#include <string.h>
int main(){
int lg;
scanf ("%d", &lg);
char word[lg+1];
int st1 = 0;
int st2 =lg/2;
int wall = st2-1;
scanf ("%s", word);
if (lg % 2 != 0){
printf ("No\n");
return 0;
}
for (int i=0; i<=wall; i++){
if (word[st1+i] == word[st2+i]){
continue;
}
else {
printf ("No\n");
return 0;
}
}
printf ("Yes\n");
return 0;
} | 0 | 35,349,907 |
#include <algorithm>
#include <iostream>
int main(void) {
int ary[5], i;
for (i = 0; i < 5; i++) {
std::cin >> ary[i];
}
std::sort(ary, ary + 5, std::greater<int>());
for (i = 0; i < 5; i++) {
std::cout << ary[i];
if (i == 4) {
std::cout << std::endl;
} else {
std::cout << " ";
}
}
return 0;
} | #define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cmath>
#include <bitset>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef tuple<ll, ll, ll> tl3;
const int BIG_NUM = 1e9;
const ll INF = 1000000000000000000;
const ll MOD = 1e9 + 7;
int main() {
int h, w;
cin >> h >> w;
vector<string> s(h + 1);
for (int i = 1; i <= h; i++) {
string si;
cin >> si;
s[i] = "#" + si;
}
s[0] = string('#', w + 1);
vector<vector<int>> dp(h + 1, vector<int>(w + 1, BIG_NUM));
dp[1][1] = 0;
if (s[1][1] == '#') {
dp[1][1]++;
}
for (int i = 1; i <= h; i++) {
for (int j = 1; j <= w; j++) {
int d1 = dp[i - 1][j];
if (s[i][j] == '#' && s[i - 1][j] == '.') {
d1++;
}
int d2 = dp[i][j - 1];
if (s[i][j] == '#' && s[i][j - 1] == '.') {
d2++;
}
dp[i][j] = min(dp[i][j], min(d1, d2));
}
}
cout << dp[h][w] << endl;
} | 0 | 57,356,596 |
#include <iostream>
int main() {
long n, min, max, sum = 0;
bool first = true;
std::cin >> n;
while (std::cin >> n) {
if (first) {
first = false;
min = max = n;
sum += n;
continue;
}
if (n < min) {
min = n;
}
if (n > max) {
max = n;
}
sum += n;
}
std::cout << min << ' ' << max << ' ' << sum << std::endl;
} | #include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<stack>
#include<queue>
#include<vector>
#include<cmath>
#include<utility>
#include<set>
#include<complex>
#include<map>
#define vi vector<int>
#define vvi vector<vector<int> >
#define ll long long int
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vb vector<bool>
#define vc vector<char>
#define vs vector<string>
#define ld long double
#define INF 1e9
#define EPS 0.0000000001
#define rep(i,n) for(int i=0;i<n;i++)
#define CC puts("-------ok--------");
#define all(in) in.begin(), in.end()
#define bv vector<bool>
using namespace std;
typedef pair<int, int> pii;
#define MAX 99999999
vector<vector<char> > v(2000,vc(2000));
vector<pii>u(1000);
int mx[]={0,0,1,-1};
int my[]={1,-1,0,0};
int h,w,n;
int bfs(pii st,pii g){
queue<pii>que;
vvi d(2000,vi(2000,INF));
que.push(st);
d[st.first][st.second]=0;
while(!que.empty()){
pii p=que.front(); que.pop();
if(p==g)break;
rep(i,4){
int ny=p.first+my[i]; int nx=p.second+mx[i];
pii np=pii(ny,nx);
if(0<=ny&&ny<h&&0<=nx&&nx<w&&d[ny][nx]==INF&&v[ny][nx]!='X')
{
d[ny][nx]=d[p.first][p.second]+1;
que.push(np);
}
}
}
return d[g.first][g.second];
}
int main(){
pii st;
cin>>h>>w>>n;
int ans=0;
rep(i,h)rep(j,w){
cin>>v[i][j];
if(v[i][j]=='S')st=pii(i,j);
else if(v[i][j]!='X'&&v[i][j]!='.'){
u[(v[i][j]-48)]=pii(i,j);
}
}
u[0]=st;
for(int i=0;i<n;i++){
ans+=bfs(u[i],u[i+1]);
}
cout<<ans<<endl;
} | 0 | 93,368,982 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i=0;i<n;i++)
#define ll long long
#define all(v) v.begin(), v.end()
#define INF 2030405060
int main()
{
int n,m;cin>>n>>m;
int i,j,k;
vector<int> s(m);
vector<int> t(m);
vector<int> d(m);
rep(i,m)cin>>s[i]>>t[i]>>d[i];
vector<vector<int>> g(n,vector<int>(n,INF));
rep(i,n)g[i][i]=0;
rep(i,m)
{
g[s[i]][t[i]]=d[i];
}
rep(k,n)
{
rep(i,n)
{
rep(j,n)
{
if(g[i][k]==INF||g[k][j]==INF)continue;
g[i][j]=min(g[i][j],g[i][k]+g[k][j]);
}
}
}
bool ch=false;
rep(i,n)
{
if(g[i][i]<0)
{
ch=true;
}
}
if(ch)cout<<"NEGATIVE CYCLE"<<endl;
else
{
rep(i,n)
{
rep(j,n)
{
if(j!=0)cout<<' ';
if(g[i][j]==INF)cout<<"INF";
else cout<<g[i][j];
}
cout<<endl;
}
}
} | #include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
typedef long long ll;
typedef long double ld;
#define pb push_back
#define mp make_pair
#define MOD 1000000007
#define INF 100000000000000
using namespace std;
int main()
{
FAST
ll n,k;
cin>>n>>k;
if(k == n)
{
cout<<0;
return 0;
}
ll arr[n];
for(ll i=0;i<n;i++)
cin>>arr[i];
ll dp[n][k+1];
for(ll i=0;i<n;i++)
for(ll j=0;j<k+1;j++)
dp[i][j] = INF;
dp[0][0] = arr[0];
for(ll i=1;i<n;i++)
{
if(i<=k)
dp[i][i] = arr[i];
for(ll j=i-1;j>-1;j--)
{
ll ct = i-1-j;
for(ll k1=0;k1<=k;k1++)
{
if(k1+ct>k)
continue;
ll temp = dp[j][k1];
if(arr[i]>arr[j])
temp+=arr[i]-arr[j];
dp[i][k1+ct] = min(dp[i][k1+ct],temp);
}
}
}
ll ans = INF;
for(ll i=0;i<n;i++)
{
for(ll j=0;j<=k;j++)
{
ll rem = n-1-i;
if(rem+j<=k)
ans = min(ans, dp[i][j]);
}
}
cout<<ans;
return 0;
} | 0 | 75,551,119 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL<<60;
const ll mod = 1e9+7;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s; cin >> s;
if(s[2]==s[3] && s[4]==s[5]) cout << "Yes" << "\n";
else cout << "No" << "\n";
return 0;
} | #include <iostream>
#include <array>
#include <algorithm>
#include <vector>
#include <bitset>
#include <set>
#include <unordered_set>
#include <cmath>
#include <complex>
#include <deque>
#include <iterator>
#include <numeric>
#include <map>
#include <unordered_map>
#include <queue>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <limits>
#include <iomanip>
#include <functional>
#include <cassert>
using namespace std;
using ll=long long;
template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;
using vll = V<ll>;
using vvll = V<vll>;
#define ALL(v) v.begin(),v.end()
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; }
#define DEBUG_VLL(vec) for(int sz=0;sz<int(vec.size());sz++) std::cerr<<vec[sz]<<(sz==vec.size()-1?'\n':' ');
const long long MOD = 1000000007;
const long long HIGHINF = (long long)1e18;
const int INF = (int)1e9;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll h, w; cin >> h >> w;
if (h == 1 || w == 1) cout << 1 << '\n';
else {
ll hw = h * w;
if (hw & 1) hw++;
hw /= 2;
cout << hw << '\n';
}
return 0;
} | 0 | 73,926,339 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define INF 100000000
#define rep(i,s,n) for (int i = (int)(s); i < (int)(n); i++)
#define mp make_pair
ll mod = 10e9+7;
ll mod2 = 998244353;
int main(){
int n,k;cin>>n>>k;
vector<int> a(n);
rep(i,0,n) cin>>a[i];
rep(i,0,k){
vector<int> base(n,0);
rep(j,0,n){
base[max(j-a[j],0)]++;
if (j+a[j]+1<n){
base[j+a[j]+1]--;
}
}
vector<int> b(n,0);
b[0] = base[0];
rep(i,1,n){
b[i]=b[i-1]+base[i];
}
if (a==b) break;
a = b;
}
rep(i,0,n){
cout<<a[i]<<endl;
}
} | #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<queue>
#include<cmath>
#include<cstdio>
#include<tuple>
#include<bitset>
#include<map>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
#define ALL(x) x.begin(),x.end()
using ll = long long;
using lint = long long;
typedef pair<int,int> P;
const lint inf=1e18+7;
const int MOD=1000000007;
signed main(){
lint l,r;cin>>l>>r;
if(r-l>=2019){
cout<<0<<"\n";
return 0;
}
l%=2019;r%=2019;
lint res=inf;
if(r<=l){
cout<<0<<"\n";
return 0;
}
for(int i=l;i<=r;++i){
for(int j=i+1;j<=r;++j){
res=min(res,(i*j)%2019);
}
}
cout<<res<<"\n";
return 0;
} | 0 | 42,619,022 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for(ll (i)=(m);(i)<(n);++(i))
#define REP(i, n) FOR(i,n,0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll) 1e15;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll A, B, C;
cin >> A >> B >> C;
ll mx = std::max({A, B, C});
ll ans = 0;
while (A + 2 <= mx) {
ans++;
A += 2;
}
while (B + 2 <= mx) {
ans++;
B += 2;
}
while (C + 2 <= mx) {
ans++;
C += 2;
}
ll n = 0;
if (A != mx)
n++;
if (B != mx)
n++;
if (C != mx)
n++;
if (n == 1)
ans += 2;
if (n == 2)
ans++;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
constexpr int DEBUG = 0;
struct Edge {
const int from, to;
Edge(int from, int to) : from(from), to(to) {}
};
vector<vector<Edge>> ReadUndirectedGraph(
int n, int m, bool is_one_indexed=false) {
vector<vector<Edge>> graph(n);
for (int i = 0; i < m; i++) {
int v1, v2;
cin >> v1 >> v2;
if (is_one_indexed) {
v1--;
v2--;
}
graph[v1].push_back(Edge(v1, v2));
graph[v2].push_back(Edge(v2, v1));
}
return graph;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int64> xs(n);
for (int i = 0; i < n; i++) {
cin >> xs[i];
}
auto graph = ReadUndirectedGraph(n, n - 1, true);
int r = -1;
for (int v = 0; v < n; v++) {
if (graph[v].size() >= 2) {
r = v;
break;
}
}
if (r == -1) {
if (n != 2) exit(1);
cout << ((xs[0] == xs[1]) ? "YES" : "NO") << endl;
return 0;
}
vector<int64> dp(n);
function<bool(int, int)> dfs_fn = [&](int v, int p) -> bool {
if (graph[v].size() == 1) {
dp[v] = xs[v];
return true;
}
int64 xc = 0;
int64 xv = xs[v];
for (const auto& e : graph[v]) {
if (e.to == p) continue;
if (!dfs_fn(e.to, v)) return false;
xc += dp[e.to];
}
int64 a = xc - xv;
int64 b = -xc + xv * 2;
if (a < 0 || b < 0) return false;
for (const auto& e : graph[v]) {
if (e.to == p) continue;
if (dp[e.to] > a + b) return false;
}
dp[v] = b;
if (p < 0) return b == 0;
return true;
};
bool ans = dfs_fn(r, -1);
cout << (ans ? "YES" : "NO") << endl;
} | 0 | 46,790,731 |
#include <iostream>
using namespace std;
int main(){
int a=100000,b=0,t;
cin>>t;
for(int k=0;k<t;k++){
b=a*1.05;
b=(b+999)/1000*1000;
a=b;
}
cout<<a<<endl;
} | #include <iostream>
#include <array>
#include <algorithm>
#include <vector>
#include <bitset>
#include <set>
#include <unordered_set>
#include <cmath>
#include <complex>
#include <deque>
#include <iterator>
#include <numeric>
#include <map>
#include <unordered_map>
#include <queue>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <limits>
#include <iomanip>
#include <functional>
#include <cassert>
using namespace std;
using ll=long long;
template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;
using vll = V<ll>;
using vvll = V<vll>;
#define ALL(v) v.begin(),v.end()
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; }
#define DEBUG_VLL(vec) for(int sz=0;sz<int(vec.size());sz++) std::cerr<<vec[sz]<<(sz==vec.size()-1?'\n':' ');
const long long MOD = 1000000007;
const long long HIGHINF = (long long)1e18;
const int INF = (int)1e9;
using PI = P<int, int>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int h, n; cin >> h >> n;
V<PI> ab(n);
for (int i = 0; i < n; i++) cin >> ab[i].first >> ab[i].second;
V< V<int> > dp(2, V<int>(h + 1, INF));
dp[0][0] = 0;
for (int i = 0; i < n; i++) {
dp[1] = V<int>(h + 1, INF);
for (int j = 0; j <= h; j++) {
chmin(dp[1][j], dp[0][j]);
chmin(dp[1][min(j + ab[i].first, h)], dp[1][j] + ab[i].second);
}
swap(dp[0], dp[1]);
}
cout << dp[0][h] << '\n';
return 0;
} | 0 | 15,794,527 |
#include<bits/stdc++.h>
#include<cmath>
#define pb push_back
#define ld long double
#define mp make_pair
#define vl vector<ll>
#define vd vector<double>
#define vld vector<long double>
#define ll long long int
#define pl pair<ll, ll>
#define all(a) a.begin(), a.end()
#define forr(i, n) for(ll i=0; i<n; i++)
#define forr1(i, n) for(ll i=1; i<=n; i++)
using namespace std;
const ld PI =3.1415926535897923846;
const ll MOD = 1e9+7;
const ll N=998244353;
void solve()
{
ll n;
cin>>n;
vl a(n);
map<ll, ll> mp1;
ll prod=0;
forr(i, n)
{
cin>>a[i];
mp1[a[i]]++;
}
map<ll, ll>:: iterator itr;
for(itr=mp1.begin(); itr!=mp1.end(); itr++)
{
ll x=itr->second;
prod+=x*(x-1)/2;
}
for(ll i=0; i<n; i++)
{
ll num=mp1[a[i]];
ll prod2=prod;
prod2-=(num*(num-1))/2;
num--;
prod2+=(num*(num-1))/2;
cout<<prod2<<endl;
}
}
int main()
{
ll test=1;
while(test--)
solve();
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#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 INF 1000000000000
#define MOD 1000000007
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0, a1, a2, a3, a4, x, ...) x
#define debug_1(x1) cout << #x1 << ": " << x1 << endl
#define debug_2(x1, x2) \
cout << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << endl
#define debug_3(x1, x2, x3) \
cout << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << ", " #x3 << ": " \
<< x3 << endl
#define debug_4(x1, x2, x3, x4) \
cout << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << ", " #x3 << ": " \
<< x3 << ", " #x4 << ": " << x4 << endl
#define debug_5(x1, x2, x3, x4, x5) \
cout << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << ", " #x3 << ": " \
<< x3 << ", " #x4 << ": " << x4 << ", " #x5 << ": " << x5 << endl
#ifdef _DEBUG
#define debug(...) \
CHOOSE((__VA_ARGS__, debug_5, debug_4, debug_3, debug_2, debug_1, ~)) \
(__VA_ARGS__)
#else
#define debug(...)
#endif
using namespace std;
using ll = long long;
int K;
template <class T>
void printVector(const vector<T>& v) {
for (auto value : v) {
cout << value << " ";
}
cout << endl;
}
void dfs(vector<ll>& A, ll val, int digit) {
A.push_back(val);
if (digit == 10) {
return;
}
for (ll v = -1; v <= 1; ++v) {
ll tail = (val % 10) + v;
if (0 > tail || tail > 9) continue;
ll nval = val * 10 + tail;
dfs(A, nval, digit + 1);
}
}
int main() {
vector<ll> A;
cin >> K;
reps(val, 9) { dfs(A, val, 1); }
sort(A.begin(), A.end());
cout << A[K - 1] << endl;
return 0;
} | 0 | 3,801,061 |
#include <bits/stdc++.h>
#define fastIO (cin.tie(0), cout.tie(0), ios::sync_with_stdio(false))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define precise(i) fixed << setprecision(i)
using ll = unsigned long long int;
using namespace std;
bool isdigit(char ch) {
return '0' <= ch && ch <= '9';
}
int main() {
fastIO;
int a, b;
cin >> a >> b;
string s;
cin >> s;
if ((int)s.size() != (a + b + 1)) {
cout << "No";
return 0;
}
for (int i = 0; i < a; i++) {
if (!isdigit(s.at(i))) {
cout << "No";
return 0;
}
}
if (s.at(a) != '-') {
cout << "No";
return 0;
}
for (int i = a + 1; i < a + b; i++) {
if (!isdigit(s.at(i))) {
cout << "No";
return 0;
}
}
cout << "Yes";
} | #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;
const ll INF = 10000000000000;
#define all(v) v.begin(), v.end()
int main(){
string S,T;
cin >> S;
T="keyence";
rep(i,7){
ll j=0,t=0;
while(j<i){
if(S.at(j)!=T.at(t)){
goto NEXT;
}else{
j++;
t++;
}
}
j+=S.size()-7;
while(j<S.size()){
if(S.at(j)!=T.at(t)){
goto NEXT;
}else{
j++;
t++;
}
}
cout << "YES" << endl;
return 0;
NEXT:
continue;
}
cout << "NO" << endl;
} | 0 | 5,858,815 |
# include <bits/stdc++.h>
# define rep(i, n) for(ll i = 0; i < (n); ++i)
# define reps(i, n) for(ll i=1, i##_len=(n); i<=i##_len; ++i)
# define rrep(i, n) for(ll i=((int)(n)-1); i>=0; --i)
# define rreps(i, n) for(ll i=((int)(n)); i>0; --i)
# define ll long long
# define ALL(x) (x).begin(), (x).end()
# define SZ(x) ((int)(x).size())
# define pb push_back
# define optimize_cin() cin.tie(0); ios::sync_with_stdio(false)
# define P pair<int, int>
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll lmax(ll a, ll b){if(a>= b) return a;return b;}
ll lmin(ll a, ll b){if(a>= b) return b;return a;}
int main() {
int n; cin >> n;
vector<int> p(n);
rep(i, n) cin >> p[i];
int ans = 0, mini = n;
rep(i, n){
if(i==0) {
++ans;
chmin(mini, p[i]);
}
else {
if(p[i] < mini){
++ans;
chmin(mini, p[i]);
}
}
}
cout << ans << endl;
} | #include <iostream>
#include <cstdio>
constexpr int MAX_SIZE = 250 + 1;
int heap[MAX_SIZE];
int parent(int i) {return i / 2;}
int left(int i) {return 2 * i;}
int right(int i) {return 2 * i + 1;}
int main() {
int n;
std::cin >> n;
for (int i = 1; i <= n; i++) {
std::cin >> heap[i];
}
for(int i = 1; i <= n; i++) {
std::printf("node %d: key = %d, ", i, heap[i]);
if (parent(i) > 0) std::printf("parent key = %d, ", heap[parent(i)]);
if (left(i) <= n) std::printf("left key = %d, ", heap[left(i)]);
if (right(i) <= n) std::printf("right key = %d, ", heap[right(i)]);
std::cout << std::endl;
}
} | 0 | 91,363,162 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v)
#define ALL(x) (x).begin(), (x).end()
#define PR(x) cout << (x) << endl
#define PS(x) cout << (x) << " "
#define SZ(x) ((ll)(x).size())
#define MAX(a,b) (((a)>(b))?(a):(b))
#define MIN(a,b) (((a)<(b))?(a):(b))
#define REV(x) reverse(ALL((x)))
#define ASC(x) sort(ALL((x)))
#define DESC(x) ASC((x)); REV((x))
#define pb push_back
#define eb emplace_back
int main()
{
ll X, Y, A, B, C;
cin >> X >> Y >> A >> B >> C;
vec P(A), Q(B), R(C);
REP(i,0,A) cin >> P[i];
REP(i,0,B) cin >> Q[i];
REP(i,0,C) cin >> R[i];
DESC(P); DESC(Q); ASC(R);
while(SZ(P) > X) P.pop_back();
while(SZ(Q) > Y) Q.pop_back();
REV(P); REV(Q);
ll x = 0, y = 0;
while(SZ(R) > 0) {
x = MIN(x,X-1);
y = MIN(y,Y-1);
ll p = P[x], q = Q[y];
ll r = R.back(); R.pop_back();
if(p <= q && q <= r) {
P[x] = r;
++x;
}
else if(p <= r && r <= q) {
P[x] = r;
++x;
}
else if(q <= p && p <= r) {
Q[y] = r;
++y;
}
else if(q <= r && r <= p) {
Q[y] = r;
++y;
}
}
ll sum = 0;
REP(i,0,X) sum += P[i];
REP(i,0,Y) sum += Q[i];
PR(sum);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define SZ(x) (int)(x.size())
#define REP(i, n) for(int i=0;i<(n);++i)
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define RREP(i, n) for(int i=(int)(n);i>=0;--i)
#define RFOR(i, a, b) for(int i=(int)(a);i>=(int)(b);--i)
#define ALL(a) (a).begin(),(a).end()
#define DUMP(x) cerr<<#x<<" = "<<(x)<<endl
#define DEBUG(x) cerr<<#x<<" = "<<(x)<<" (L"<<__LINE__<<")"<< endl;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using P = pair<int, int>;
const double eps = 1e-8;
const ll MOD = 1000000007;
const int INF = INT_MAX / 2;
const ll LINF = LLONG_MAX / 2;
template <typename T1, typename T2>
bool chmax(T1 &a, const T2 &b) {
if(a < b) {a = b; return true;}
return false;
}
template <typename T1, typename T2>
bool chmin(T1 &a, const T2 &b) {
if(a > b) {a = b; return true;}
return false;
}
template<typename T1, typename T2>
ostream& operator<<(ostream &os, const pair<T1, T2> p) {
os << p.first << ":" << p.second;
return os;
}
template<class T>
ostream &operator<<(ostream &os, const vector<T> &v) {
REP(i, SZ(v)) {
if(i) os << " ";
os << v[i];
}
return os;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
int n; cin >> n;
vll a(n);
ll su = 0;
ll sua = 0;
REP(i, n) {
cin >> a[i];
sua += a[i];
su += i+1;
}
if(sua % su) {
cout << "NO" << endl;
return 0;
}
ll k = sua / su;
vll b(n);
REP(i, n) {
b[i] = a[(i+1)%n] - a[i];
}
bool ok = true;
ll cnt = 0;
REP(i, n) {
ok &= b[i] <= k;
ok &= (k - b[i]) % n == 0;
cnt += (k - b[i]) / n;
}
ok &= cnt == k;
cout << (ok ? "YES" : "NO") << endl;
} | 0 | 30,130,263 |
#include <bits/stdc++.h>
using namespace std;
#define int int64_t
#define itn int
#define fi first
#define se second
signed main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int n,m,a;
int dp[1000000]={};
cin>>n>>m;
dp[0]=1;
dp[1]=1;
for(int i=0;i<m;i++){
cin>>a;
dp[a]=-1;
}
for(int i=2;i<=n;i++){
if(dp[i]!=-1){
if(dp[i-1]!=-1) dp[i]+=dp[i-1];
if(dp[i-2]!=-1) dp[i]+=dp[i-2];
dp[i]%=1000000007;
}
}
cout<<dp[n]<<"\n";
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using pint = pair<int, int>;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
const int MOD = 1000000009;
const long long INF = 1LL << 60;
int main() {
int N;
cin >> N;
vector<int> P(N);
for (int i = 0; i < N; ++i) cin >> P[i];
vector<int> Q(N);
for (int i = 0; i < N; ++i) cin >> Q[i];
vector<int> V(N);
for (int i = 0; i < N; ++i) V[i] = i+1;
int count = 0;
int a = 0;
int b = 0;
do {
++count;
if (V == P) a = count;
if (V == Q) b = count;
} while (next_permutation(V.begin(), V.end()));
cout << abs(a - b) << endl;
return 0;
} | 0 | 4,392,037 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int h,n;
int a;
cin>>h;
cin>>n;
for(int i=0; i<n; i++){
cin>>a;
h=h-a;
}
if(h>0)
cout<<"No";
else
cout<<"Yes";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int a, b;
cin >> a >> b;
if (a > b)
{
for (int i = 0; i < a; i++)
cout << b;
cout << endl;
}
else
{
for (int i = 0; i < b; i++)
cout << a;
cout << endl;
}
} | 0 | 28,913,217 |
#include<iostream>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if(a%b==0) cout<<'0';
else cout<<'1';
} | #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);
ll N;
cin >> N;
if (N&1) {
print(0);
return 0;
}
ll c2, c5;
ll b = 2;
while(N / b != 0) {
c2 += N / b;
b <<= 1;
}
b = 5;
while(N / b != 0) {
c5 += N / b / 2;
b *= 5;
}
print(min(c2, c5));
} | 0 | 2,121,423 |
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <cmath>
#include <vector>
#include <sstream>
#include <string>
#include <cstdio>
#include <stack>
#include <queue>
#include <list>
#include <numeric>
#include <fstream>
#include <cassert>
using namespace std;
#define TEST
#ifdef TEST
#define dout cout
#define din cin
#else
stringstream dummy;
#define dout dummy.str(""); dummy.clear(stringstream::goodbit); dummy
#endif
#ifdef OUTPUTFILE
#define dout outputfile
ofstream outputfile(OUTPUTFILE);
#define OutputFilePath "/Users/Nag/Documents/Prgm/Test/DerivedData/Test/Build/Products/Debug/output.txt"
#endif
#ifdef INPUTFILE
#define din inputfile
ifstream inputfile(INPUTFILE);
#endif
#define disp(A) dout << #A << " = " << (A) << endl
#define disP(A) dout << setw(3) << (A) << " "
#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define dispAll(A,n) dout << #A << " = "; rep(j, 0, (n)) {disP(A[j]);} dout << endl
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef unsigned long long ll;
const int INF = 1e9-1;
int N;
const int N_MAX = 100;
int m[N_MAX+2];
int dp[N_MAX][N_MAX];
int solve(int i, int j) {
if(i==j) return dp[i][j] = 0;
if(dp[i][j]!=INF) return dp[i][j];
int ans = INF;
rep(k,i,j) {
ans = min( ans, solve(i,k)+solve(k+1,j)+m[i]*m[k+1]*m[j+1] );
}
dp[i][j] = ans;
return ans;
}
int main() {
din >> N;
int r, c;
rep(i,0,N) {
cin >> r >> c;
if(i==0) m[i] = r, m[i+1] = c;
else m[i+1] = c;
}
rep(i,0,N) {
rep(j,0,N) {
dp[i][j] = INF;
}
}
dout<<solve(0,N-1)<<endl;
#ifdef INPUTFILE
inputfile.close();
#endif
#ifdef OUTPUTFILE
outputfile.close();
cout << "\"" << OutputFilePath << "\"" << endl;
#endif
return 0;
} | #include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
#define INF 0x3f3f3f3f
int map[15][15];
void floyd(int n)
{
for(int k=0;k<=n;k++)
{
for(int i=0;i<=n;i++)
{
for(int j=0;j<=n;j++)
{
map[i][j]=min(map[i][j],map[i][k]+map[k][j]);
}
}
}
}
int main()
{
int n,i,j,a,b,t;
while(scanf("%d",&n),n)
{
int m=0;
memset(map,INF,sizeof(map));
for(i=0;i<n;i++)
{
scanf("%d%d%d",&a,&b,&t);
map[a][b]=map[b][a]=min(map[a][b],t);
if(a>m) m=a;
if(b>m) m=b;
}
floyd(m);
int tmp=0,ans=INF,k;
for(i=0;i<=m;i++)
{
for(j=0;j<=m;j++)
{
if(i==j)
continue;
tmp+=map[i][j];
}
if(tmp<ans)
{
ans=tmp;
k=i;
}
tmp=0;
}
printf("%d %d\n",k,ans);
}
return 0;
} | 0 | 49,958,779 |
#include <climits>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
vector<vector<int>> G(N, vector<int>(N, INT_MAX));
rep(i, N) G[i][i] = 0;
vector<int> A(M);
vector<int> B(M);
vector<int> C(M);
rep(i, M) {
cin >> A[i] >> B[i] >> C[i];
--A[i];
--B[i];
G[A[i]][B[i]] = C[i];
G[B[i]][A[i]] = C[i];
}
rep(k, N) {
rep(i, N) {
rep(j, N) {
if (G[i][k] == INT_MAX || G[k][j] == INT_MAX) continue;
G[i][j] = min(G[i][j], G[i][k] + G[k][j]);
}
}
}
int answer = M;
for (int i = 0; i < M; ++i) {
for (int j = 0; j < N; ++j) {
if (G[j][A[i]] + C[i] == G[j][B[i]]) {
--answer;
break;
}
}
}
cout << answer << endl;
return 0;
} | #include <bits/stdc++.h>
#include <set>
using namespace std;
using pii = pair<int,int>;
using pll = pair<long long, long long>;
const long long INF = 1<<29;
const int MOD = 998244353;
long long ruizyou(long long m,long long n){
if(m == 0)return 0;
if(m == 1)return 1;
long long ans = 1;
long long tmp = m;
for(int i=0;i<=30;i++){
if(n & (1<<i)){
ans *= tmp;
ans %= MOD;
}
tmp *= tmp;
tmp %= MOD;
}
return ans;
}
long long kaizyou(long long x){
if(x == 0)return 1;
return x * kaizyou(x-1) % MOD;
}
long long comb(long long x,long long y){
long long bunsi = kaizyou(x);
long long bunbo = kaizyou(x-y) * kaizyou(y) % MOD;
return bunsi * ruizyou(bunbo,MOD-2) % MOD;
}
struct unionfind{
vector<int> par;
vector<vector<int>> children;
vector<int> hukasa;
vector<int> kazu;
unionfind(int n){
par = vector<int>(n);
hukasa = vector<int>(n,0);
kazu = vector<int>(n,1);
for(int i=0;i<n;i++){
par.at(i) = i;
}
}
int root(int x){
if(par.at(x) == x)return x;
return root(par.at(x));
}
void unite(int x,int y){
int rx = root(x);
int ry = root(y);
if(rx == ry)return;
if(hukasa.at(rx) >= hukasa.at(ry)){
par.at(ry) = rx;
hukasa.at(rx) = max(hukasa.at(ry) + 1,hukasa.at(rx));
kazu.at(rx) += kazu.at(ry);
}
else{
par.at(rx) = ry;
kazu.at(ry) += kazu.at(rx);
}
}
void newkazu(){
int n = kazu.size();
for(int i=0;i<n;i++){
kazu.at(i) = kazu.at(root(i));
}
}
bool same(int x,int y){
return root(x) == root(y);
}
};
int ctoi(char a){
return a - '0';
}
long long gcd(long long a,long long b){
long long c = max(a,b);
long long d = min(a,b);
if(d % c == 0)return c;
return gcd(c,d%c);
}
long long lcm(long long a,long long b){
return a * b / gcd(a,b);
}
int main(){
int n,m;
cin >> n >> m;
vector<vector<int>> s(m);
for(int i=0;i<m;i++){
int k;
cin >> k;
s.at(i) = vector<int>(k);
for(int j=0;j<k;j++){
cin >> s.at(i).at(j);
s.at(i).at(j)--;
}
}
vector<int> p(m);
for(int i=0;i<m;i++)cin >> p.at(i);
int ans = 0;
for(int i=0;i<(1<<n);i++){
bool flag = true;
for(int j=0;j<m;j++){
int tmp = 0;
for(int k=0;k<s.at(j).size();k++){
if(i & (1<<s.at(j).at(k)))tmp++;
}
if(tmp %2 != p.at(j))flag = false;
}
if(flag)ans++;
}
cout << ans << endl;
} | 0 | 70,344,638 |
#include <iostream>
using namespace std;
int main(){
int n;
cin >> n;
for(int i=0; i<n; i++){
int y, m, d;
cin >> y >> m >> d;
int ans = 0;
ans -= d-1;
if(y%3 == 0){
ans -= 20 * (m-1);
}else{
if(m%2 == 0){
ans -= 20 * (int)((m-1)/2+1);
ans -= 19 * (int)((m-1)/2);
}else{
ans -= 20 * (m-1)/2;
ans -= 19 * (m-1)/2;
}
}
ans += 10 * 20 * (999/3 - (y-1)/3);
ans += 5 * 39 * (999 - (y-1) - (999/3 - (y-1)/3));
cout << ans << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main(void){
int d,sum;
while(cin>>d){
sum=0;
for(int i=1 ;d*i <= 600-d;i++){
int f=d*i;
sum += f*f*d;
}
cout<<sum<<endl;
}
return 0;
} | 0 | 4,418,101 |
#include <iostream>
#include <cstdlib>
#include <time.h>
#include <algorithm>
#include <map>
#include <queue>
#include <stack>
#include <vector>
#include <array>
#include <string>
#include <iomanip>
#include <cstring>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define mp make_pair
#define F first
#define S second
using namespace std;
using namespace __gnu_pbds;
typedef long long int ll;
typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> ost;
const ll maxN = 1e7;
const ll INF = 1e17;
ll xs[] = {-1, 1, 0, 0};
ll ys[] = {0, 0, -1, 1};
int main(){
cin.sync_with_stdio(false);
cin.tie(0);
ll t;
cin >> t;
ll x, y, ans = 0;
while(t--){
cin >> x >> y;
ans += (y-x+1);
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) \
cerr << __LINE__ << ": " << #x << " = {"; \
for (long long hoge = 0; (hoge) < (n); ++(hoge)) \
cerr << ((hoge) ? "," : "") << x[hoge]; \
cerr << "}" << endl
#else
#define debug(x) (void(0))
#define debugArray(x, n) (void(0))
#endif
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
long long R, S, P;
cin >> R >> S >> P;
string T;
cin >> T;
auto score = [&](char c, int x) {
if (c == 'r' && x == 2) return P;
if (c == 's' && x == 0) return R;
if (c == 'p' && x == 1) return S;
return 0ll;
};
long long dp[K][3];
for (int i = 0; i < K; i++)
for (int j = 0; j < 3; j++) dp[i][j] = score(T[i], j);
for (int i = K; i < N; i++) {
long long tmp[3] = {0, 0, 0};
for (int j = 0; j < 3; j++)
for (int k = 0; k < 3; k++)
if (k != j) tmp[j] = max(tmp[j], dp[i % K][k] + score(T[i], j));
for (int j = 0; j < 3; j++) dp[i % K][j] = tmp[j];
}
long long ans = 0;
for (int i = 0; i < K; i++) ans += max({dp[i][0], dp[i][1], dp[i][2]});
cout << ans << '\n';
return 0;
} | 0 | 25,653,436 |
#include <iostream>
typedef long long ll;
using namespace std;
int main() {
string s; cin >> s;
ll k; scanf("%lld", &k);
ll ans;
if (s[0] != '1') ans = s[0] - '0';
else {
int cnt = 0;
while (s[0] == '1') {
s = s.substr(1, s.size() - 1);
++cnt;
}
if (cnt >= k) ans = 1;
else ans = s[0] - '0';
}
printf("%lld", ans);
return 0;
} | #include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long long ll;
typedef pair<ll, ll> PLL;
typedef vector<int> VI;
typedef vector<char> VC;
typedef vector<double> VD;
typedef vector<string> VS;
typedef vector<ll> VLL;
typedef vector<PLL> VP;
const static int INF = 1000000000;
const static int MOD = 1000000007;
const int dx[4]={1, 0, -1, 0};
const int dy[4]={0, 1, 0, -1};
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; }
#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 rept(i,m,n) for(ll i=m; i<n; i++)
#define stl_rep(itr, x) for (auto itr = x.begin(); itr != x.end(); ++itr)
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
#define PF push_front
#define PB push_back
#define SORT(V) sort((V).begin(), (V).end())
#define RVERSE(V) reverse((V).begin(), (V).end())
#define paired make_pair
#define PRINT(V) for(auto v : (V)) cout << v << " "
int ctoi(char c) { if (c >= '0' && c <= '9') { return c - '0'; } return 0; }
void cum_sum(int N,vector<double> a, vector<double> &s){ for(int i=0; i<N; i++){ s[i+1]=s[i]+a[i];}}
ll gcd(ll a,ll b){
if(b == 0) return a;
return gcd(b,a%b);
}
ll lcm(ll a,ll b){
ll g = gcd(a,b);
return a / g * b;
}
bool is_prime(long long n) {
if (n <= 1) return false;
for (long long p = 2; p * p <= n; ++p) {
if (n % p == 0) return false;
}
return true;
}
int getdigit(ll num){
unsigned digit=0;
while(num!=0){
num /= 10;
digit++;
}
return digit;
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int N;
cin >> N;
VLL A(N);
rep(i,N){
cin >> A[i];
A[i]=A[i]-(i+1);
}
sort(all(A));
ll key=0;
ll sum=0;
key=A[N/2];
rep(i,N){
sum+=abs(A[i]-key);
}
cout << sum << endl;
} | 0 | 72,802,632 |
#include<bits/stdc++.h>
using namespace std;
const int N=1e5+7;
int n , a[N][3] ,f[N][3] ;
int main()
{
cin >> n ;
for(int i=1 ; i<=n ; i++)
{
cin >> a[i][1] >> a[i][2] >> a[i][3];
}
f[1][1]=a[1][1];
f[1][2]=a[1][2];
f[1][3]=a[1][3];
for(int i=2 ; i<=n ; i++)
{
f[i][1]=max(f[i-1][2]+a[i][1] , f[i-1][3]+a[i][1]);
f[i][3]=max(f[i-1][2]+a[i][3] , f[i-1][1]+a[i][3]);
f[i][2]=max(f[i-1][1]+a[i][2] , f[i-1][3]+a[i][2]);
}
cout << max(f[n][1] , max(f[n][2] , f[n][3]));
} | #include <bits/stdc++.h>
using namespace std;
#define LL long long
#define ULL unsigned long long
#define PB push_back
#define MP make_pair
#define PII pair<int,int>
#define VI vector<int>
#define VPII vector<PII>
#define X first
#define Y second
#define IOS ios::sync_with_stdio(0);cin.tie(0);
#define IN freopen("in", "r", stdin);
#define OUT freopen("out", "w", stdout);
int main()
{
IOS;
char cc[2][2] = { { 'R', 'Y' }, { 'G', 'B' } };
int n, m, d;
cin>>n>>m>>d;
for (int j = 1; j <= n; ++ j)
{
for (int k = 1; k <= m; ++ k)
{
int jj = j + k;
int kk = n + m + j - k;
int x = jj / d % 2;
int y = kk / d % 2;
cout<<cc[x][y];
}
cout<<"\n";
}
cout<<flush;
return 0;
} | 0 | 13,333,210 |
#include<bits/stdc++.h>
#define ll long long
#define P pair<int,int>
#define PP pair<P,int>
using namespace std;
int n, m, ans;
vector<vector<int>> g(10);
void dfs(vector<int>v, int x){
if(v.size() == n)ans++;
for(auto i:g[x]){
bool had = false;
for(auto j:v){
if(i == j) had = true;
}
if(had) continue;
vector<int>u = v;
u.push_back(i);
dfs(u ,i);
}
}
int main(){
cin >> n >> m;
for(int i=0;i<m;i++){
int a, b;
cin >> a >> b;
a--;
b--;
g[a].push_back(b);
g[b].push_back(a);
}
ans = 0;
vector<int>v={0};
dfs(v, 0);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(int i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using vc = vector<char>;
using vb = vector<bool>;
using vd = vector<double>;
vi dir = {-1, 0, 1, 0, -1, -1, 1, 1, -1};
int main() {
string s;
cin >> s;
int n = s.size();
if(n < 26) {
vb k(26, false);
rep(i, n) k[s[i] - 'a'] = true;
cout << s;
rep(i, n + 1) {
if(!k[i]) {
cout << char('a' + i) << endl;
return 0;
}
}
}
string os = s;
do {
if(os == s) continue;
rep(i, n) {
cout << s[i];
if(os[i] != s[i]) return 0;
}
} while(next_permutation(all(s)));
cout << -1 << endl;
} | 0 | 93,293,878 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
ll GetDigit(ll num){ return log10(num)+1; }
int main()
{
ll r,d;
vector<ll> x(11);
cin >> r >> d >> x[0];
for (int i = 0; i <= 10; i++)
{
x[i+1] = r*x[i] - d;
}
for (int i = 1; i <= 10; i++)
{
cout << x[i] << endl;
}
return 0;
} | #pragma target("avx")
#include<bits/stdc++.h>
using ll = int_fast64_t;
using P = std::pair<ll,ll>;
using V = std::vector<ll>;
template<typename T> using pq = std::priority_queue<T>;
template<typename T> using rpq = std::priority_queue<T, std::vector<T>, std::greater<T>>;
#define REP(i,b,e) for(ll i=b; i<e; i++)
#define ALL(vec) vec.begin(),vec.end()
#define PRINT(vec) printf("[ ");for(auto &i:vec)printf("%ld ",i);puts("]");
#define SCAN(vec) for(auto &i:vec)scanf("%ld",&i)
#define fi first
#define se second
const int MOD = 1e9+7;
const ll INF = 1e18;
int dx[] = {0, 1, 0, -1, 1, 1, -1, -1}, dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
int main(){
int n;
scanf("%d", &n);
std::map<int,int> mp;
REP(x, 0, n+1){
int y = x;
for(int i=2; i*i<=y; i++){
while(y%i==0){
mp[i]++;
y /= i;
}
}
if(y>1) mp[y]++;
}
ll ans = 0;
int ar2=0, ov4=0;
for(auto p: mp){
if(p.se>=4) ov4++;
else if(p.se>=2) ar2++;
}
ans += ov4*(ov4-1)/2 * ar2;
ans += ov4*(ov4-1)/2 * (ov4-2);
int ov24 = ar2 = 0;
for(auto p:mp){
if(p.se>=24) ov24++;
else if(p.se>=2) ar2++;
}
ans += ov24*(ov24-1);
ans += ov24*ar2;
int ar4=0, ov14=0;
for(auto p:mp){
if(p.se>=14) ov14++;
else if(p.se>=4) ar4++;
}
ans += ov14*(ov14-1);
ans += ov14*ar4;
int ov74 = 0;
for(auto p:mp){
if(p.se>=74) ov74++;
}
ans += ov74;
printf("%ld\n", ans);
return 0;
} | 0 | 39,473,478 |
#include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) \
cerr << __LINE__ << ": " << #x << " = {"; \
for (long long hoge = 0; (hoge) < (n); ++(hoge)) \
cerr << ((hoge) ? "," : "") << x[hoge]; \
cerr << "}" << endl
#else
#define debug(x) (void(0))
#define debugArray(x, n) (void(0))
#endif
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int A, B, K;
cin >> A >> B >> K;
int g = __gcd(A, B);
for (int i = 0; i < K; i++, g--)
while (A % g || B % g) g--;
cout << g + 1 << '\n';
return 0;
} | #include <bits/stdc++.h>
#define INF 1000000000000000001
#define ll long long
#define pll pair<ll, ll>
using namespace std;
int main()
{
ll N, M;
cin >> N >> M;
ll ans = 0;
vector<ll> A(N + 1, 0);
for (ll i = 0; i < N; ++i)
{
ll a;
cin >> a;
A.at(i + 1) = (A.at(i) + a) % M;
}
sort(A.begin(), A.end());
ll cnt = 0;
ll before = -1;
for (ll i = 0; i < N + 1; ++i)
{
if (A.at(i) == before)
{
cnt += 1;
}
else
{
ans += (cnt - 1) * cnt / 2;
cnt = 1;
before = A.at(i);
}
}
ans += cnt * (cnt - 1) / 2;
cout << ans << endl;
} | 0 | 89,594,925 |
#include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
int main(){
cout << fixed << setprecision(10);
int n;
cin >> n;
vector<double> v(n);
rep(i,n) cin >> v[i];
double ans = 0;
rep(i,n){
ans += 1/v[i];
}
cout << 1/ans << endl;
return 0;
} | #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 = 0; i <= (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1LL<<62;
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; }
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...));
}
const int MOD = 1000000007;
ll gcd(ll x, ll y){
if (y==0) return x;
else return gcd(y, x%y);
}
int main(){
ll N, X; cin >> N >> X;
vector<ll> x(N);
rep(i,N) cin >> x[i];
vector<ll> diff(N);
rep(i,N){
diff[i] = abs(X-x[i]);
}
ll ans;
rep(i,N){
if (i == 0) ans = diff[i];
else ans = gcd(ans, diff[i]);
}
cout << ans << endl;
} | 0 | 27,014,614 |
#include <bits/stdc++.h>
#define newl "\n"
using namespace std;
using lli = long long int;
using vvint = vector <vector <int>>;
const int mod = 1e9 + 7;
const int N = 2e5 + 1;
void solve(){
int n,m;
cin >> n >> m;
vector <vector <pair <int,int>>> p(n + 1);
for(int i = 0;i < m;++i){
int P,Y;
cin >> P >> Y;
p[P].push_back({Y,i + 1});
}
vector <string> out(m + 1,"");
for(int i = 1;i <= n;++i){
sort(p[i].begin(),p[i].end());
for(int j = 0;j < (int)p[i].size();++j){
string i1 = to_string(i);
string ap = "";
for(int k= 0;k < 6 - (int)i1.length();++k){
ap = ap + "0";
}
reverse(i1.begin(),i1.end());
i1 = i1 + ap;
ap = "";
string j2 = to_string(j + 1);
for(int k = 0;k < 6 - (int)j2.length();++k){
ap = ap + "0";
}
reverse(j2.begin(),j2.end());
j2 = j2 + ap;
out[p[i][j].second] = j2 + i1;
reverse(out[p[i][j].second].begin(),out[p[i][j].second].end());
}
}
for(int i = 1;i <= m;++i) cout << out[i] << newl;
return;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout << fixed << setprecision(10);
#ifdef EXECUTE_LOCALLY
freopen("in.txt","r",stdin);
#endif
int t = 1;
while(t--) solve();
#ifdef EXECUTE_LOCALLY
cout << setprecision(3) << "program time: " << (double)clock() / CLOCKS_PER_SEC << newl;
#endif
return 0;
} | #include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <complex>
#include <string>
#include <sstream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <iostream>
#include <map>
#include <set>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define sz(x) ((int)(x).size())
#define fi first
#define sec second
#define EQ(a,b) (abs((a)-(b))<EPS)
ll num[100100];
int main()
{
while(1)
{
int n,k;
cin >> n >> k;
if(n==0&&k==0)break;
memset(num,0,sizeof(num));
for(int i=1;i<=n;i++)
{
int p;
cin >> p;
num[i]=p;
}
for(int i=2;i<=n;i++)
{
num[i]+=num[i-1];
}
ll ans=-INF;
for(int i=1;i<=n-k+1;i++)
{
ans=max(ans,num[i+k-1]-num[i-1]);
}
cout << ans << endl;
}
return 0;
} | 0 | 72,142,020 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define ll long long
#define P pair<int,int>
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(),v.end()
#define pb push_back
#define eb emplace_back
template<class T>void chmax(T &a,T b){if(a<b)a=b;}
template<class T>void chmin(T &a,T b){if(a>b)a=b;}
constexpr int INF=1000000000000000000;
constexpr int mod=1000000007;
constexpr double eps=1e-8;
const double pi=acos(-1);
int dx[]={0,1,0,-1},dy[]={1,0,-1,0};
int Random(int mi,int ma){
random_device rnd;
mt19937 mt(rnd());
uniform_int_distribution<int>engine(mi,ma);
return engine(mt);
}
int gcd(int a,int b){
if(b==0)return a;
return gcd(b,a%b);
}
int lcm(int a,int b){
return a/gcd(a,b)*b;
}
bool prime(int a){
if(a==1)return false;
for(int i=2;i*i<=a;i++){
if(a%i==0)return false;
}
return true;
}
int modpow(int a,int b){
if(b==0)return 1;
if(b%2)return modpow(a,b-1)*a%mod;
int memo=modpow(a,b/2);
return memo*memo%mod;
}
vector<int>kaijo,invkaijo;
void init_fact(int n){
kaijo.resize(n+1);
invkaijo.resize(n+1);
kaijo[0]=1;
for(int i=1;i<=n;i++){
kaijo[i]=kaijo[i-1]*i;
kaijo[i]%=mod;
}
rep(i,n+1)invkaijo[i]=modpow(kaijo[i],mod-2);
}
int comb(int a,int b){
if(a<b)return 0;
if(a<0||b<0)return 0;
return kaijo[a]*invkaijo[a-b]%mod*invkaijo[b]%mod;
}
int inv(int x){
x=modpow(x,mod-2);
return x;
}
int n,a[200010];
bool check(int x){
vector<P>v;
for(int i=1;i<n;i++){
if(a[i-1]>=a[i]){
if(x==1)return false;
while(!v.empty()&&v.back().fi>a[i])v.pop_back();
int pos=a[i];
bool updated=false;
while(!v.empty()){
if(v.back().fi!=pos){
v.pb({pos,1});
updated=true;
break;
}
if(v.back().se+1<x){
v.back().se++;
updated=true;
break;
}
pos--;
v.pop_back();
}
if(!updated){
if(pos==0)return false;
v.pb({pos,1});
}
}
}
return true;
}
signed main(){
cin.tie(0);ios::sync_with_stdio(false);
cin>>n;
rep(i,n)cin>>a[i];
int ok=n,ng=0;
while(ok-ng>1){
int mid=(ok+ng)/2;
if(check(mid))ok=mid;
else ng=mid;
}
cout<<ok<<endl;
return 0;
} | #include <iostream>
using namespace std;
int main(){
int a,b,c;
int h;
cin>>a>>b>>c;
if(a>b){
h=a;
a=b;
b=h;
}
if(b>c){
h=b;
b=c;
c=h;
}
if(a>c){
h=a;
a=c;
c=h;
}
if(a>b){
h=a;
a=b;
b=h;
}
cout<<a<<' '<<b<<' '<<c<<endl;
} | 0 | 62,690,321 |
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
int n, k;
cin >> n >> k;
vector<bool> sunuke(n, false);
for (int i = 0; i < k; i++)
{
int d;
cin >> d;
int candy;
for (int j = 0; j < d; j++)
{
cin >> candy; candy--;
sunuke[candy] = true;
}
}
int ans = 0;
for (int i = 0; i < n; i++) ans += (1 - sunuke[i]);
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define tpl tuple<int, int, int>
#define mt make_tuple
#define LIM 100000
int n, dp[LIM+5][4], vis[LIM+5][4];
vector<tpl> v;
int f(int pos, int k){
if(pos >= n) return 0;
if(vis[pos][k]) return dp[pos][k];
vis[pos][k] = 1;
int ans;
if(k == 0) ans = get<0>(v[pos]) + max(f(pos+1, 1), f(pos+1, 2));
else if(k == 1) ans = get<1>(v[pos]) + max(f(pos+1, 0), f(pos+1, 2));
else ans = get<2>(v[pos]) + max(f(pos+1, 0), f(pos+1, 1));
return dp[pos][k] = ans;
}
int main(){
scanf("%d", &n);
for(int i = 1; i <= n; i++){
int a, b, c; scanf("%d %d %d", &a, &b, &c);
v.push_back(mt(a, b, c));
}
int ans = f(0, 0);
memset(dp, 0, sizeof dp);
memset(vis, 0, sizeof vis);
ans = max(ans, f(0, 1));
memset(dp, 0, sizeof dp);
memset(vis, 0, sizeof vis);
ans = max(ans, f(0, 2));
printf("%d\n", ans);
} | 0 | 7,288,905 |
#include <iostream>
#include <algorithm>
#include<string.h>
using namespace std;
const int maxn = 2e5 + 10;
#define ll long long
ll a[200005];
ll b[200005], c[200005], d[200005], ans;
int upperbound(int l, int r, ll s){
while(l<r){
int m = (l+r)/2;
ll h = b[m] ^ b[s - 1];
if(c[m] - c[s - 1] - h <= 0)
l = m + 1;
else
r = m;
}
return l;
}
int main()
{
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
{
scanf("%d", &a[i]);
b[i] = a[i] ^ b[i - 1];
c[i] = a[i] + c[i - 1];
d[i] = c[i] - b[i];
}
c[n + 1] = 1e17;
for (int i = 1; i <= n; i++)
{
int x = upperbound(i, n + 1, i);
ans += x - i;
}
printf("%lld", ans);
} | #include <cstdio>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <iterator>
#include <cassert>
#include <numeric>
#include <functional>
#include <cassert>
#pragma warning(disable:4996)
typedef long long ll;
typedef unsigned long long ull;
#define MIN(a, b) ((a)>(b)? (b): (a))
#define MAX(a, b) ((a)<(b)? (b): (a))
#define LINF 9223300000000000000
#define LINF2 1223300000000000000
#define INF 2140000000
const long long MOD = 1000000007;
using namespace std;
ll dp[55][2];
void solve()
{
int n, p;
scanf("%d%d", &n, &p);
vector<int> a(n);
dp[0][0] = 1;
int i,k;
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
for (k = 0; k < 2; k++) {
dp[i + 1][k] += dp[i][k];
dp[i + 1][(k + a[i]) % 2] += dp[i][k];
}
}
printf("%lld\n", dp[n][p]);
return;
}
int main(int argc, char* argv[])
{
#if 1
solve();
#else
int T;
scanf("%d", &T);
int t;
for(t=0; t<T; t++) {
solve();
}
#endif
return 0;
} | 0 | 48,036,006 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n); i >= 0; i--)
#define REP(i, m, n) for (int i = (int)(m); i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
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; }
const long long INF = 1LL << 60;
int main(){
char c;
cin >> c;
if(c == 'a') cout << "vowel" << endl;
else if(c == 'e') cout << "vowel" << endl;
else if(c == 'i') cout << "vowel" << endl;
else if(c == 'o') cout << "vowel" << endl;
else if(c == 'u') cout << "vowel" << endl;
else cout << "consonant" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vb=vector<bool>;
using vvb=vector<vb>;
using vd=vector<double>;
using vvd=vector<vd>;
using vi=vector<int>;
using vvi=vector<vi>;
using vl=vector<ll>;
using vvl=vector<vl>;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
using tll=tuple<ll,ll>;
using tlll=tuple<ll,ll,ll>;
using vs=vector<string>;
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define rep(i,n) range(i,0,n)
#define rrep(i,n) for(ll i=(n)-1;i>=0;i--)
#define range(i,a,n) for(ll i=(a);i<(n);i++)
#define LINF ((ll)1ll<<60)
#define INF ((int)1<<30)
#define EPS (1e-9)
#define MOD (1000000007ll)
#define fcout(a) cout<<setprecision(a)<<fixed
#define fs first
#define sc second
#define PI 3.1415926535897932384
int dx[]={1,0,-1,0,1,-1,-1,1},dy[]={0,1,0,-1,1,1,-1,-1};
template<class T>bool chmax(T&a,T b){if(a<b){a=b; return true;}return false;}
template<class T>bool chmin(T&a,T b){if(a>b){a=b; return true;}return false;}
template<class S>S acm(vector<S>&a){return accumulate(all(a),S());}
template<class S>S max(vector<S>&a){return *max_element(all(a));}
template<class S>S min(vector<S>&a){return *min_element(all(a));}
void YN(bool b){cout<<(b?"YES":"NO")<<"\n";}
void Yn(bool b){cout<<(b?"Yes":"No")<<"\n";}
void yn(bool b){cout<<(b?"yes":"no")<<"\n";}
int sgn(const double&r){return (r>EPS)-(r<-EPS);}
int sgn(const double&a,const double&b){return sgn(a-b);}
ll max(int a,ll b){return max((ll)a,b);} ll max(ll a,int b){return max(a,(ll)b);}
template<class T>void puta(T&&t){cout<<t<<"\n";}
template<class H,class...T>void puta(H&&h,T&&...t){cout<<h<<' ';puta(t...);}
template<class S,class T>ostream&operator<<(ostream&os,pair<S,T>p){os<<"["<<p.first<<", "<<p.second<<"]";return os;};
template<class S>auto&operator<<(ostream&os,vector<S>t){bool a=1; for(auto s:t){os<<(a?"":" ")<<s;a=0;} return os;}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll k;
cin>>k;
queue<ll> q;
rep(i,9)q.push(i+1);
rep(i,k-1){
ll t=q.front();
q.pop();
ll end=t%10;
for(ll j=end-1;j<=end+1;j++){
if(j<0||9<j)continue;
q.push(t*10+j);
}
}
puta(q.front());
} | 0 | 43,879,010 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll, ll> Pll;
#define debug(var) do{std::cout << #var << " : ";view(var);}while(0)
template<typename T> void view(T e){std::cout << e << std::endl;}
template<typename T> void view(const std::vector<T>& v){for(const auto& e : v){ std::cout << e << " "; } std::cout << std::endl;}
template<typename T> void view(const std::vector<std::vector<T> >& vv){ for(const auto& v : vv){ view(v); } }
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; }
const int MOD = 1000000007;
const int INF = 1e9;
const int mod = 1000000007;
const int inf = 1e9;
#define PI acos(-1);
int dx[4] = {1,-1,0,0};
int dy[4] = {0,0,1,-1};
int ddx[8] = {1,1,1,-1,-1,-1,0,0};
int ddy[8] = {0,1,-1,0,1,-1,1,-1};
int main(){
int n;
map<int, int> mp;
cin >> n;
for(int i = 0; i < n; i++) {
int a;
cin >> a;
mp[a]++;
}
int ans = 0;
for(auto a : mp) {
if(a.second>=a.first) ans += a.second - a.first;
else ans += a.second;
}
cout << ans << endl;
} | #include <stdio.h>
#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
using std::cin;
using std::cout;
using std::endl;
using std::terminate;
using std::sort;
using std::find;
using std::vector;
template<class T> inline T min(T X, T Y) {
return X < Y ? X : Y;
}
template<class T> inline T abs(T X) {
return X > 0 ? X : -X;
}
void solve() {
int x, n; cin >> x >> n;
if (n == 0) {
cout << x << endl;
return ;
}
vector<int> p(n);
for (int i = 0; i < n; ++i) {
cin >> p[i];
}
sort(p.begin(), p.end());
int y = 102; int ans = 0;
for (int i = 0; i <= 101; ++i) {
auto it = find(p.begin(), p.end(), i);
if (it == p.end()) {
if (y > abs(x - i)) {
y = abs(x - i);
ans = i;
}
}
}
cout << ans << endl;
}
int main() {
#ifdef DEV
std::ifstream in("input");
cin.rdbuf(in.rdbuf());
int t; cin >> t;
for (int x = 1; x <= t; ++x) {
solve();
}
#else
solve();
#endif
return 0;
} | 0 | 25,812,855 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
int p = x2+(y1-y2);
int q = y2+(x2-x1);
int r = x1+(y1-y2);
int s = y1+(x2-x1);
cout << p << " " << q << " " << r << " " << s << endl;
} | #include<iostream>
using namespace std;
int main(void)
{
int noth,easu,n,i2,x,y,j1;
int road[18][18];
while(1){
cin>>easu>>noth;
if(easu==0&¬h==0)break;
j1=0;
cin>>n;
for(int i=1;i<=easu;i++){
for(int j=1;j<=noth;j++){
road[i][j]=-1;
}
}
for(int i=0;i<n;i++){
cin>>x>>y;
road[x][y]=0;
}
for(int i=1;i<=easu;i++){
i2=0;
for(int j=1;j<=noth;j++){
if(i2==1){
road[i][j]=0;
}
else if(j1==1&&j==1)road[i][j]=0;
else if(road[i][j]==0&&i==1)i2=1;
else if(road[i][j]==0&&j==1)j1=1;
else if(road[i][j]==-1&&(i==1||j==1))road[i][j]=1;
else if(road[i][j]==-1)road[i][j]=road[i-1][j]+road[i][j-1];
}
}
cout<<road[easu][noth]<<"\n";
}
} | 0 | 31,831,723 |
#include <vector>
#include <list>
#include <map>
#include <unordered_map>
#include <climits>
#include <set>
#include <unordered_set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <queue>
#include <random>
#include <complex>
#include <regex>
#include <locale>
#include <random>
#include <type_traits>
using namespace std;
#define SHOW_VECTOR(v) {std::cerr << #v << "\t:";for(const auto& xxx : v){std::cerr << xxx << " ";}std::cerr << "\n";}
#define SHOW_MAP(v){std::cerr << #v << endl; for(const auto& xxx: v){std::cerr << xxx.first << " " << xxx.second << "\n";}}
using LL = long long;
int main() {
int N;
cin >> N;
int sum = 0;
set<int> S;
for (int i = 1;; i++) {
sum += i;
S.insert(i);
if (sum >= N) {
int diff = sum - N;
if (diff)S.erase(S.find(diff));
for (auto x: S) cout << x << endl;
return 0;
}
}
return 0;
} | #include <bits/stdc++.h>
#define INF 5000000000000000000
#define ll long long
#define pll pair<ll, ll>
using namespace std;
int main()
{
ll N;
cin >> N;
vector<ll> A(N);
vector<ll> B(N);
ll a_sum = 0, b_sum = 0;
for (ll i = 0; i < N; ++i) {
cin >> A.at(i);
a_sum += A.at(i);
}
for (ll i = 0; i < N; ++i) {
ll b;
cin >> b;
B.at(i) = b;
b_sum += b;
}
if (a_sum < b_sum) {
cout << -1 << endl;
return 0;
}
ll ans = 0;
vector<bool> chage(N, false);
ll chage_num = 0;
for (ll i = 0; i < N; ++i) {
if (A.at(i) < B.at(i)) {
chage.at(i) = true;
chage_num += B.at(i) - A.at(i);
ans += 1;
}
}
vector<ll> can_chage;
for (ll i = 0; i < N; ++i) {
if (chage.at(i)) {
continue;
}
can_chage.push_back(A.at(i) - B.at(i));
}
sort(can_chage.begin(), can_chage.end());
reverse(can_chage.begin(), can_chage.end());
ll temp = 0;
for (ll i = 0; i < can_chage.size(); ++i) {
if (temp >= chage_num) {
break;
}
temp += can_chage.at(i);
ans += 1;
}
cout << ans << endl;
} | 0 | 50,064,201 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
int main() {
int k;
cin >> k;
queue<long int> q;
for(int i = 1; i <= 9; i++) {
q.push(i);
}
while(k > 1) {
for(int i = -1; i <= 1; i++) {
long int o = q.front() % 10 + i;
if(o >= 0 && o <= 9) {
q.push(q.front()*10 + o);
}
if(k == 0)
break;
}
q.pop();
k--;
}
cout << q.front() << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long
#define endl "\n"
#define all(v) v.begin(),v.end()
#define double long double
#define trace1(x) cerr<<#x<<": "<<x<<endl
#define trace2(x, y) cerr<<#x<<": "<<x<<" | "<<#y<<": "<<y<<endl
#define trace3(x, y, z) cerr<<#x<<":" <<x<<" | "<<#y<<": "<<y<<" | "<<#z<<": "<<z<<endl
#define trace4(a, b, c, d) cerr<<#a<<": "<<a<<" | "<<#b<<": "<<b<<" | "<<#c<<": "<<c<<" | "<<#d<<": "<<d<<endl
#define trace5(a, b, c, d, e) cerr<<#a<<": "<<a<<" | "<<#b<< ": "<<b<<" | "<<#c<<": "<<c<<" | "<<#d<<": "<<d<<" | "<<#e<< ": "<<e<<endl
#define trace6(a, b, c, d, e, f) cerr<<#a<<": "<<a<<" | "<<#b<<": "<<b<<" | "<<#c<<": "<<c<<" | "<<#d<<": "<<d<<" | "<<#e<< ": "<<e<<" | "<<#f<<": "<<f<<endl
#define cases int testcases;cin>>testcases; while(testcases--)
const int N = 200005;
int32_t main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
IOS
int n,k;
cin >> n >> k;
int dp[n+1][k+1];
for(int i = 1; i <= k; i++)
{
dp[1][i] = 1;
}
for(int i = 2; i <= n; i++)
{
int sum = 0;
for(int j = 1; j <= k; j++)
{
sum += dp[i-1][j];
}
for(int j = 1; j <= k; j++)
{
dp[i][j] = sum - dp[i-1][j];
}
}
int ans = 0;
for(int i = 1; i <= k; i++) ans += dp[n][i];
cout << ans;
return 0;
} | 0 | 36,854,421 |
#include<bits/stdc++.h>
#define watch(x) cout << (#x) << " is " << (x) << endl
typedef uint64_t ll;
using namespace std;
int static fast = [](){
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0); return 0;
}();
int main() {
int n, val, k;
cin >> n >> k;
ll acc = 0;
vector<ll> dp = {0};
for(int i = 0; i < n; i++) {
cin >> val;
acc += val;
dp.push_back(acc);
}
map<ll, int> cnt;
for(int i = 0; i < n; i++) {
for(int j = 0; j <= i; j++) {
cnt[dp[i+1]-dp[j]] += 1;
}
}
ll mx = cnt.rbegin()->first;
int nbit = 0;
while ((1LL<<nbit) < mx) {
nbit += 1;
}
ll ans = 0;
for(int b = nbit; b >= 0; b--) {
auto it = cnt.rbegin();
acc = 0;
map<ll, int> cnt3;
for(; it != cnt.rend(); ++it) {
if ((it->first >> b)&1) {
acc += it->second;
cnt3[it->first&((1ll<<b)-1)] += it->second;
} else {
break;
}
}
if (acc >= k) {
ans += (1ll << b);
} else {
for(; it != cnt.rend(); ++it) {
cnt3[it->first&((1ll<<b)-1)] += it->second;
}
}
cnt.swap(cnt3);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
int main(){
ll N;
cin >> N;
map<ll,ll> mp;
mp[0] = 1;
ll now = 0;
rep(i, 0, N){
ll a;
cin >> a;
now += a;
mp[now]++;
}
ll ans = 0;
for(auto p : mp){
ans += p.second * (p.second - 1) / 2;
}
cout << ans << endl;
return 0;
} | 0 | 28,986,186 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i,n) for(int i=0;i<n;i++)
template<typename T>
void chmax(T &a,T b){
if(a<b)a=b;
}
int ans=-1e18,v[5555],c[5555],used[5555];
signed main(){
int n,k;cin>>n>>k;
REP(i,n)cin>>v[i];
REP(i,n)cin>>c[i];
vector<vector<int>>w;
REP(i,n){
if(used[i])continue;
w.push_back(vector<int>(0));
int tmp=0,sum=0;
while(!used[i]){
used[i]=1;
w.back().push_back(c[i]);
sum+=c[i];
i=v[i]-1;
}
int K=k,S=w.back().size();
if(sum>0&&K/S>0)tmp+=(K/S-1)*sum;
if(K>S)K=K%S+S;
REP(j,S){
int tmp2=0;
REP(l,K){
tmp2+=w.back()[(j+l)%S];
chmax(ans,tmp+tmp2);
}
}
}
cout<<ans<<endl;
} | #include <iostream>
#include <string>
#include <stdio.h>
#include <cmath>
#include <cfloat>
#include <algorithm>
#include <functional>
#include <numeric>
#include <vector>
using namespace std;
const double PI=acos(-1);
int main(){
int a, b, m;
cin >> a >> b >> m;
vector<int> aa(a), bb(b);
int am = 999999, bm = 999999;
for(int i = 0; i < a; i++){
cin >> aa[i];
am = min(am, aa[i]);
}
for(int i = 0; i < b; i++){
cin >> bb[i];
bm = min(bm, bb[i]);
}
int mi = am + bm;
for(int i = 0; i < m; i++){
int xx, yy, c;
cin >> xx >> yy >> c;
mi = min(mi, aa[xx-1]+bb[yy-1]-c);
}
cout << mi << endl;
return 0;
} | 0 | 17,709,102 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#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(0);
int n,k,tmp=0,ans=0;cin>>n>>k;
string s;cin>>s;
bool flag;if(s[0]=='1')flag=true;else flag=false;
for(int i=0;i<n;i++){
if(flag){
if(s[i]=='1')tmp++;
else{
vec.pb(tmp);tmp=1;flag=false;
}
}
else{
if(s[i]=='0')tmp++;
else{
vec.pb(tmp);tmp=1;flag=true;
}
}
}
vec.pb(tmp);
tmp=0;int sz=vec.size();
if(s[0]=='1'){
if(vec.size()/2<=k)ans=n;
else{
for(int i=0;i<2*k+1;i++)tmp+=vec[i];
ans=max(ans,tmp);
int pt=2*k+1;
while(pt+1<sz){
tmp-=vec[pt-2*k-1]+vec[pt-2*k];
tmp+=vec[pt]+vec[pt+1];
ans=max(ans,tmp);
pt+=2;
}
if(s[n-1]=='0'){
tmp-=vec[pt-2*k-1]+vec[pt-2*k];
tmp+=vec[pt];
ans=max(ans,tmp);
}
}
}
else{
if((vec.size()+1)/2<=k)ans=n;
else{
for(int i=0;i<2*k;i++)tmp+=vec[i];
ans=max(ans,tmp);
int pt=2*k;
bool fi=true;
while(pt+1<sz){
if(fi){
tmp-=vec[0];
fi=false;
}
else{tmp-=vec[pt-2*k]+vec[pt-2*k-1];}
tmp+=vec[pt]+vec[pt+1];
ans=max(ans,tmp);
pt+=2;
}
if(s[n-1]=='0'){
tmp-=vec[pt-2*k];
if(pt-2*k-1>=0)tmp-=vec[pt-2*k-1];
tmp+=vec[pt];
ans=max(ans,tmp);
}
}
}
cout<<ans<<endl;
} | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <utility>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
#define all(x) x.begin(), x.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> pair;
const int inf = 1000000000;
int main(){
int n;
cin >>n;
vector<int> h(n);
rep(i, n) cin >> h[i];
reverse(all(h));
int ans = 0;
int val = 0;
for (int i = 1; i < n; i++) {
if (h[i-1] <= h[i]) val++;
else val = 0;
ans = max(ans, val);
}
cout << ans << endl;
return 0;
} | 0 | 77,778,210 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
typedef long double ld;
const int inf=1e9+7;
const ll longinf=1LL<<60;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
#define F first
#define S second
const int mx=200010;
const ll mod=1e9+7;
int main(){
ll a,b,c;
cin >> a >> b >> c;
cout << (a+b>=c?"Yes":"No")<< endl;
return 0;
} | #include <iostream>
#include <string>
#include <stack>
using namespace std;
int main( void )
{
string in;
while(getline(cin, in), in[0] != '.') {
stack<char> st;
bool hit = true;
int len = in.size();
for(int i=0; i < len; ++i) {
if(in[i] == '(' || in[i] == '[') {
st.push(in[i]);
}
else if(in[i] == ')') {
if(st.empty()) {
hit = false;
}
else {
if(st.top() != '(') hit = false;
st.pop();
}
}
else if(in[i] == ']') {
if(st.empty()) {
hit = false;
}
else {
if(st.top() != '[') hit = false;
st.pop();
}
}
}
if(st.size() == 0 && hit)
cout << "yes" << endl;
else
cout << "no" << endl;
}
} | 0 | 8,118,273 |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define endl "\n"
#define pb push_back
#define PI 3.1415926535897932384626433832795l
#define F first
#define S second
#define mp make_pair
#define f(i,n) for(int i=0;i<n;i++)
#define fastio ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define gcd(a,b) __gcd((a),(b))
#define fill(a,value) memset(a,value,sizeof(a));
#define minn(v) *min_element(v.begin(), v.end());
#define maxx(v) *max_element(v.begin(), v.end());
#define print(x) cout<<(x)<<endl;
#define sum(v)+x accumulate(v.begin(), v.end(),x);
typedef pair<int,int> pii;
typedef vector<int> vi;
signed main()
{
fastio;
cout << fixed << setprecision(12);
int n;
cin>>n;
vi a(n);
f(i,n)cin>>a[i];
int ans=0;
for(int i=0;i<n-1;i++)
{
for(int j=i+1;j<n;j++)
{
ans+=a[i]*a[j];
}
}
print(ans)
return 0;
} | #include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <algorithm>
#include <complex>
#include <array>
#include <iomanip>
using namespace std;
#define REP(i,n) for(int i=0; i<n; ++i)
#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 ALL(c) (c).begin(), (c).end()
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<long double> VD;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef vector<VD> VVD;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;
template<typename T> void chmin(T &a, T b) { if (a > b) a = b; }
template<typename T> void chmax(T &a, T b) { if (a < b) a = b; }
int in() { int x; scanf("%d", &x); return x; }
ll lin() { ll x; scanf("%lld", &x); return x; }
#define INF 1LL<<60
int main() {
ll n, m, v, p;
cin >> n >> m >> v >> p;
vector<ll> A(n);
REP(i, n) cin >> A[i];
sort(A.rbegin(), A.rend());
int lb = 0, ub = n;
while(ub > lb+1) {
int x = (lb + ub) / 2;
ll tmp = m * ((p - 1) + (n - 1 - x));
FOR(i, p-1, x-1) {
tmp += A[x] + m - A[i];
}
if(x <= p - 1) {
lb = x;
}
else if((A[x] + m < A[p-1]) || (tmp < m * (v - 1) )) {
ub = x;
} else {
lb = x;
}
}
cout << lb + 1 << endl;
return 0;
} | 0 | 82,634,445 |
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0;i < (int)n;i++)
#define repb(i, n) for(int i = (int)n;i >= 0;i--)
#define reps(i, m, n) for(int i = (int)m;i < (int)n;i++)
#define repsb(i, m, n) for(int i = (int)m;i >= (int)n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define pb(a) push_back(a)
#define INF 999999999999999999
using namespace std;
int dy[]={0, 0, 1, -1, 0};
int dx[]={1, -1, 0, 0, 0};
using namespace std;
std::vector<int> v;
int main(int argc, char const *argv[]) {
int x,y,mini,maxi;
while (true){
cin>>x>>y;
if(x==0&&y==0) return 0;
maxi=max(x,y);
mini=min(x,y);
cout<<mini<<" "<<maxi<<endl;
}
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=0; i<=n; i++)
#define repr(i, n) for(int i=n; i>0; i--)
#define REPR(i, n) for(int i=n; i>=0; i--)
#define FOR(i, a, b) for(int i=a; i<b; i++)
#define ALL(v) v.begin(),v.end()
#define pb push_back
#define eb emplace_back
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, ll> pil;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LLINF = 1e18;
const ll MOD = 1e9+7;
template<class T> void puts(T x) { std::cout << x << std::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; }
ll minArea(ll a, ll b, ll c) {
return min(a, min(b, c));
}
ll maxArea(ll a, ll b, ll c) {
return max(a, max(b, c));
}
int main() {
ll H, W; cin >> H >> W;
ll ans = LLINF;
for (ll ah = 1; ah < H; ah++) {
ll bh = (H - ah) / 2;
ll ch = H - ah - bh;
chmin(ans, W*maxArea(ah,bh,ch) - W*(minArea(ah,bh,ch)));
}
for (ll ah = 1; ah < H; ah++) {
ll bh = H - ah;
ll bw = W / 2;
ll cw = W - bw;
chmin(ans, maxArea(ah*W, bh*bw, bh*cw) - minArea(ah*W, bh*bw, bh*cw));
}
swap(H, W);
for (ll ah = 1; ah < H; ah++) {
ll bh = (H - ah) / 2;
ll ch = H - ah - bh;
chmin(ans, W*maxArea(ah,bh,ch) - W*(minArea(ah,bh,ch)));
}
for (ll ah = 1; ah < H; ah++) {
ll bh = H - ah;
ll bw = W / 2;
ll cw = W - bw;
chmin(ans, maxArea(ah*W, bh*bw, bh*cw) - minArea(ah*W, bh*bw, bh*cw));
}
cout << ans << endl;
} | 0 | 41,687,515 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A,B;
cin >> A >> B;
vector<vector<int>> data(1000, vector<int>(3,0));
for (int i = 0; i < 1000; i++) {
for (int j = 0; j < 3; j++) {
if (j == 0){
data.at(i).at(j) = i+1;
}
else if (j == 1){
data.at(i).at(j) = (i+1)*8/100;
}
else {
data.at(i).at(j) = (i+1)/10;
}
}
}
for (int i = 0; i < 1000; i++) {
if (A == data.at(i).at(1) && B == data.at(i).at(2)){
cout << i + 1 << endl;
break;
}
else if (i == 999){
cout << -1 << endl;
}
}
} | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define repLRE(i, l, r) for (ll i = (l); i <= (r); ++i)
#define rrepLRE(i, l, r) for (ll i = (l); i >= (r); --i)
#define Sort(v) sort(v.begin(), v.end())
#define rSort(v) sort(v.rbegin(), v.rend())
#define Reverse(v) reverse(v.begin(), v.end())
#define Lower_bound(v, x) \
distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) \
distance(v.begin(), upper_bound(v.begin(), v.end(), x))
using ll = long long;
using ull = unsigned long long;
using P = pair<ll, ll>;
using T = tuple<ll, ll, ll>;
using vll = vector<ll>;
using vP = vector<P>;
using vT = vector<T>;
using vvll = vector<vector<ll>>;
using vvP = vector<vector<P>>;
using dqll = deque<ll>;
ll dx[9] = {-1, 1, 0, 0, -1, -1, 1, 1, 0};
ll dy[9] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
const ll INF = 1LL << 50;
int main() {
cout << fixed << setprecision(15);
string s;
cin >> s;
ll n = s.size();
vll cnt(26, 0);
for (char c : s) cnt[c - 'a']++;
ll kif = n * (n - 1) / 2 + 1;
rep(i, 26) kif -= cnt[i] * (cnt[i] - 1) / 2;
cout << kif << endl;
return 0;
} | 0 | 59,415,537 |
#include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main() {
int n;
cin >> n;
vector<int> p(n), q(n);
rep(i, n) cin >> p[i];
rep(i, n) cin >> q[i];
vector<int> base(n);
rep(i, n) base[i] = i + 1;
int cnt = 1;
int a = 0;
int b = 0;
do {
bool ok = true;
rep(i, n) {
if (base[i] != p[i]) {
ok = false;
break;
}
}
if (ok) a = cnt;
ok = true;
rep(i, n) {
if (base[i] != q[i]) {
ok = false;
break;
}
}
if (ok) b = cnt;
++cnt;
} while(next_permutation(base.begin(), base.end()));
cout << abs(a - b) << endl;
return 0;
} | #include <stdio.h>
int main() {
int t,zero = 0,flag = 0;
scanf("%d",&t);
long long int n,max = 1e18,sum = 1;
for(int i=0;i<t;i++){
scanf("%lld",&n);
n>max ? flag = 1 : flag;
sum *= n;
n==0 ? zero = 1 : max /= n;
}
if(zero ==1){
puts("0");
}
else{
flag==1 ? puts("-1") : printf("%lld\n",sum);
}
return 0;
} | 0 | 50,308,442 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <numeric>
#include <cmath>
#include <iomanip>
#include <cassert>
using namespace std;
typedef long long ll;
#define pb push_back
#define rep(i, n) for(int i=0;i<(n);i++)
#define REP(i, n) for(int i=1;i<=(n);i++)
#define P pair<int,int>
int mx8[] = {0, 0, 1, -1, -1, 1, -1, 1};
int my8[] = {-1, 1, 0, 0, -1, -1, 1, 1};
int mx4[] = {1, -1, 0, 0};
int my4[] = {0, 0, -1, 1};
const int MOD = 1000000007;
int main() {
ios::sync_with_stdio(false);
ll n; cin >> n;
ll ans = 0;
ll N = n;
for(ll i = 2; i*i<=n; ++i)
{
int k = 0;
while(N%i==0)
{
N /= i;
k++;
}
ans += floor((-1 + sqrt(1+8*k)) / 2);
}
if(N > 1) ans += 1;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll MOD = 1000000007;
ll count_dup(string s){
ll a = 0;
for (int i = 0,j=0; i < s.size(); i=j)
{
while (j < s.size() && s[i] == s[j])j++;
a += (j-i)/2;
}
return a;
}
int main()
{
string s;
ll k;
cin >> s >> k;
bool is_same = true;
for (int i = 1; i < s.size(); i++) if (s[0] != s[i]) is_same = false;
if (is_same)
{
cout << (s.size() * k) / 2 << endl;
return 0;
}
ll a = count_dup(s);
ll aa = count_dup(s+s);
ll d = aa - a;
cout << a + (k - 1) * d << endl;
} | 0 | 46,987,952 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<deque>
#include<functional>
#include<iterator>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<utility>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define a first
#define b second
#define sz(x) (ll)((x).size())
#define pb push_back
#define mp make_pair
#define bg begin()
#define ed end()
#define all(x) (x).bg,(x).ed
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rep1(i,n) for(ll i=1;i<=(n);i++)
#define rrep(i,n) for(ll i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(ll i=(n);i>=1;i--)
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
const ll MOD=998244353;
const ll INF=1000000000000000;
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;}
ll maxx(ll x,ll y,ll z){return max(max(x,y),z);}
ll minn(ll x,ll y,ll z){return min(min(x,y),z);}
ll gcd(ll x,ll y){if(x%y==0) return y;else return gcd(y,x%y);}
ll lcm(ll x,ll y){return x*(y/gcd(x,y));}
ll digsz(ll x){if(x==0) return 1;else{ll ans=0;while(x){x/=10;ans++;}return ans;}}
ll digsum(ll x){ll sum=0;while(x){sum+=x%10;x/=10;}return sum;}
ll mod_pow(ll x,ll n,ll mod){ll res=1;while(n>0){if(n&1) res=res*x%mod;x=x*x%mod;n>>=1;}return res;}
vector<ll> pw2(62,1);vector<ll> pw10(19,1);
ll high_order_bit(ll n){ll tmp=1,i=-1;while(tmp<=n){tmp*=2;i++;}if(n==0) return 0;else return i;}
vector<ll> binary_expansion(ll n){vector<ll> B(high_order_bit(n)+1);ll tmp=n;for(ll i=high_order_bit(n);i>=0;i--){B[i]=tmp/pw2[i];tmp%=pw2[i];}return B;}
vector<ll> divisor(ll x){vector<ll> div;for(ll i=1;i*i<=x;i++){if(i*i!=x && x%i==0){div.pb(i);div.pb(x/i);}else if(x%i==0) div.pb(i);}sort(all(div));return div;}
vector<ll> vectorprime(ll x){vector<bool> is_prime(x+1);vector<ll> prime;rep(i,x+1) is_prime[i]=true;is_prime[0]=is_prime[1]=false;for(ll i=2;i<=x;i++){if(is_prime[i]){prime.pb(i);}for(int j=i*2;j<=x;j+=i) is_prime[j]=false;}return prime;}
map<ll,ll> prime_factor(ll x){map<ll,ll> m;ll sq=(ll)sqrt(x) + 1;vector<ll> v_prime=vectorprime(sq);ll tmp=x;rep(i,sz(v_prime)){ll count=0;while(tmp % v_prime[i] == 0){tmp /= v_prime[i];count++;}if(count != 0) m[v_prime[i]]=count;if(tmp==1) break;}if(tmp != 1) m[tmp]=1;return m;}
ll fac[500001],finv[500001],inv[500001],dx[9]={0,0,1,-1,1,1,-1,-1,0},dy[9]={1,-1,0,0,1,-1,1,-1,0};
void table(){fac[0]=fac[1]=1;finv[0]=finv[1]=1;inv[1]=1;for(ll i=2;i<500001;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 dev(long long a,long long b){return (a*inv[b])%MOD;}
ll comb(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 perm(ll n,ll k){if(n<k) return 0;if(n<0 || k<0) return 0;return (fac[k]*comb(n,k))%MOD;}
int main(){
{table();}
{rep1(i,61) pw2[i]=2*pw2[i-1];}
{rep1(i,18) pw10[i]=10*pw10[i-1];}
ll K; cin>>K;
if(K<=9){
cout<<K<<endl;
return 0;
}
queue<P> que;
rep1(i,9) que.push(P(i,i));
ll cnt=9;
while(1){
P tmp=que.front(); que.pop();
ll last=tmp.a%10;
if(last==0){
que.push(P(tmp.a*10+last,++cnt));
if(cnt==K){
cout<<tmp.a*10+last<<endl;
return 0;
}
que.push(P(tmp.a*10+last+1,++cnt));
if(cnt==K){
cout<<tmp.a*10+last+1<<endl;
return 0;
}
}
else if(last==9){
que.push(P(tmp.a*10+last-1,++cnt));
if(cnt==K){
cout<<tmp.a*10+last-1<<endl;
return 0;
}
que.push(P(tmp.a*10+last,++cnt));
if(cnt==K){
cout<<tmp.a*10+last<<endl;
return 0;
}
}
else{
que.push(P(tmp.a*10+last-1,++cnt));
if(cnt==K){
cout<<tmp.a*10+last-1<<endl;
return 0;
}
que.push(P(tmp.a*10+last,++cnt));
if(cnt==K){
cout<<tmp.a*10+last<<endl;
return 0;
}
que.push(P(tmp.a*10+last+1,++cnt));
if(cnt==K){
cout<<tmp.a*10+last+1<<endl;
return 0;
}
}
}
} | #include <iostream>
#include <algorithm>
using namespace std;
struct Card
{
int num;
char type;
};
void trace(int n, Card c[])
{
for (int i = 0; i < n; ++i)
{
cout << c[i].type << c[i].num;
if (i < n - 1)
{
cout << " ";
}
}
cout << endl;
}
void bubbleSort(int n, Card c[])
{
for (int i = 0; i < n; ++i)
{
for (int j = n - 1; j > i; j--)
{
if (c[j].num < c[j - 1].num)
{
swap(c[j], c[j - 1]);
}
}
}
return;
}
void selectionSort(int n, Card c[])
{
int min = 0;
for (int i = 0; i < n; ++i)
{
min = i;
for (int j = i; j < n; ++j)
{
if (c[j].num < c[min].num)
{
min = j;
}
}
if (i != min)
{
swap(c[i], c[min]);
}
}
return;
}
int main(int argc, char const *argv[])
{
int n = 0;
cin >> n;
Card c1[n], c2[n];
for (int i = 0; i < n; ++i)
{
cin >> c1[i].type >> c1[i].num;
c2[i] = c1[i];
}
bubbleSort(n, c1);
selectionSort(n, c2);
trace(n, c1);
cout << "Stable" << endl;
trace(n, c2);
for (int i = 0; i < n; ++i)
{
if (c1[i].type != c2[i].type)
{
cout << "Not stable" << endl;
return 0;
}
}
cout << "Stable" << endl;
return 0;
} | 0 | 38,064,500 |
#include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define repr(i, a, n) for (ll i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll l, r;
cin >> l >> r;
int ans = 1e15;
rep(i, l, min(l + 2020, r)) {
rep(j, l + 1, min(l + 2020, r + 1)) {
int x = i % 2019;
int y = j % 2019;
ans = min(ans, (x * y) % 2019);
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
# define M_PI 3.14159265358979323846
const int M=1e9+7;
long long mod(long long x){
return ((x%M + M)%M);
}
long long add(long long a, long long b){
return mod(mod(a)+mod(b));
}
long long mul(long long a, long long b){
return mod(mod(a)*mod(b));
}
ll modPow(ll a, ll b){
if(b==0)
return 1LL;
if(b==1)
return a%M;
ll res=1;
while(b){
if(b%2==1)
res=mul(res,a);
a=mul(a,a);
b=b/2;
}
return res;
}
void solve (){
int n;
cin>>n;
vector<int>a(n);
for(int i=0;i<n;i++){
int x;
cin>>x;
--x;
a[x]=i+1;
}
for(auto i : a)
cout<<i<<" ";
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cout<<fixed;
cout<<setprecision(10);
int t=1;
for(int i=1;i<=t;i++){
solve();
}
return 0;
} | 0 | 69,651,179 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
sort(v.begin(), v.end());
double value = v[0];
for (int i = 1; i < n; i++) {
value = (value + v[i]) / 2;
}
cout << setprecision(20) << value << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<vector<int>> data(3, vector<int>(3));
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3; j++) {
cin >> data.at(i).at(j);
}
}
int N;
cin >> N;
vector<int> b(N);
for (int i = 0; i < N; i++)
cin >> b.at(i);
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3; j++) {
for (int k = 0; k < N; k++) {
if(b.at(k) == data.at(i).at(j))
data.at(i).at(j) = 0;
}
}
}
bool bingo = false;
for (int i = 0; i < 3; i++) {
if(data.at(i).at(0) == 0 && data.at(i).at(1) == 0 && data.at(i).at(2) == 0)
bingo = true;
}
for (int i = 0; i < 3; i++) {
if(data.at(0).at(i) == 0 && data.at(1).at(i) == 0 && data.at(2).at(i) == 0)
bingo = true;
}
if(data.at(0).at(0) == 0 && data.at(1).at(1) == 0 && data.at(2).at(2) == 0)
bingo = true;
if(data.at(0).at(2) == 0 && data.at(1).at(1) == 0 && data.at(2).at(0) == 0)
bingo = true;
if(bingo)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | 0 | 51,907,066 |