code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 32
101M
|
|---|---|---|---|
#include <bits/stdc++.h>
#include<iostream>
#include<vector>
#include<map>
#include<math.h>
#include<algorithm>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n-1); i > -1; i--)
#define rrep2(i,n,a) for(int i = (int)(n); i >= (int)(a); i--)
#define fi first
#define se second
using namespace std;
using ll = long long;
using v_int = vector<int>;
using v2_int = vector<v_int>;
using v_ll = vector<ll>;
using v2_ll = vector<v_ll>;
using v_string = vector<string>;
using v_bool = vector<bool>;
using v2_bool = vector<v_bool>;
using pii = pair<int, int>;
using mii = map<int, int>;
const double PI = 3.1415926535897932;
const int INF = (int)2e9;
const ll LINF = (ll)2e18;
const ll MOD = 1000000007;
const int dc[8] = {1, -1, 0, 0, 1, -1, 1, -1};
const int dr[8] = {0, 0, 1, -1, 1, 1, -1, -1};
template<typename T, typename U> inline
ostream& operator<<(ostream &o, pair<T,U> &p) {
return o << "{" << p.first << "," << p.second << "}";
}
template<typename T> inline
istream& operator>>(istream &is, vector<T> &vec) {
for(auto &v : vec) { is >> v; }
return is;
}
template<typename T> inline
ostream& operator<<(ostream &os, vector<T> &vec) {
for(auto &v : vec) { os << v << ",";}
return os;
}
template<typename T> inline
ostream& operator<<(ostream &os, vector<vector<T> > &mat) {
for(auto &row : mat) { os << row << endl; }
return os;
}
template<typename T> inline
void chmin(T &a, T b) { a = min(a, b); }
template<typename T> inline
void chmax(T &a, T b) { a = max(a, b); }
int main(void)
{
string s, t;
cin >> s >> t;
int ans = 0;
rep(i,3) {
if(s[i]==t[i]) { ans++; }
}
cout << ans << endl;
return 0;
}
|
#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;
const ll INF = (1LL<<32);
vector<vector<ll> > d;
void warshall_floyd(int n){
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
if(d[j][i] == INF) continue;
for(int k = 0; k < n; k++){
if(d[i][k] == INF) continue;
d[j][k] = min(d[j][k], d[j][i] + d[i][k]);
}
}
}
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int N, M; cin >> N >> M;
vector<vector<ll> > G(N, vector<ll>(N, INF));
d.assign(N, vector<ll>(N, INF));
REP(i, M){
ll a, b, c; cin >> a >> b >> c; a--; b--;
G[a][b] = c;
G[b][a] = c;
}
d = G;
warshall_floyd(N);
int ans = 0;
for(int i = 0; i < N-1; i++){
for(int j = i+1; j < N; j++){
if(G[i][j] != INF && G[i][j] > d[i][j]) ans++;
}
}
cout << ans << endl;
}
| 0 | 9,366,210 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define vc vector<char>
#define ii pair<int,int>
#define fi first
#define sc second
#define stoi stoll
#define all(x) (x).begin(),(x).end()
#define get_bit(x, k) ((x >> k) & 1)
void MAIN() {
string s;
cin >> s;
set<char> d;
for (char c = 'a'; c <= 'z'; c++) d.insert(c);
for (auto &i : s) d.erase(i);
if (d.size()) {
s += *d.begin();
cout << s << '\n';
return;
}
set<char> g;
while (s.size()) {
char c = s.back();
s.pop_back();
auto it = g.upper_bound(c);
if (it != g.end()) {
s += *it;
cout << s << '\n';
return;
}
g.insert(c);
}
cout << -1 << '\n';
}
signed main() {
ios::sync_with_stdio(0); cin.tie(0);
int T = 1;
while (T--) MAIN();
}
|
#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;
vector<int> a(n);
rep(i, n) cin >> a[i];
int l = 0;
int r = 0;
int sum = a[0];
int xo = a[0];
ll ans = 0;
while (r<n) {
if (sum==xo) {
ans += (r-l+1);
r++;
sum += a[r];
xo ^= a[r];
}
else {
sum -= a[l];
xo ^= a[l];
l++;
}
}
cout << ans << endl;
return 0;
}
| 0 | 70,506,906 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i <= (n); i++)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
using ll = long long;
template <class T>
using Grid = vector<vector<T>>;
ll gcd(ll a, ll b) {
return b ? gcd(b, a % b) : a;
}
ll lcm(ll a, ll b) {
return a / gcd(a, b) * b;
}
ll ord(ll N, ll p) {
ll res = 0;
while (N % p == 0) {
res++;
N /= p;
}
return res;
}
int main() {
int N, M;
cin >> N >> M;
int a;
cin >> a;
a /= 2;
int x = ord(a, 2);
rep(i, N - 1) {
int b;
cin >> b;
b /= 2;
if (ord(b, 2) != x) {
cout << 0 << endl;
return 0;
}
a = lcm(a, b);
if (a > M) {
cout << 0 << endl;
return 0;
}
}
ll ans = 0;
for (int i = 1; a * i <= M; i += 2) {
ans++;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int h[100];
cin >> n;
for (int i = 0; i < n; i++) cin >> h[i];
int ans = 0;
while (true) {
if (*max_element(h, h + n) == 0) break;
int i = 0;
while (i < n) {
if (h[i] == 0) i++;
else {
ans++;
while (i < n && h[i] > 0) {
h[i]--;
i++;
}
}
}
}
cout << ans << endl;
}
| 0 | 62,716,124 |
#include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++i)
#define sqrep(i,cc,n) for(long long i=cc;i*i<=n;++i)
#define rrep(i,cc,n) for(long i=cc;i>n;--i)
#define pii pair<int, int>
#define pll pair<long long, long long>
using ll = long long;
const vector<int> dx = {1, 0, -1, 0};
const vector<int> dy = {0, 1, 0, -1};
const ll inf = 1001001001;
const ll e9 = 1000000000;
const ll mod = 1000000007;
int main(){
int n;
ll k;
cin >> n >> k;
ll sum=0;
vector<ll>cnt(100000);
rep(i, 0, n){
int a, b;
cin >> a >> b;
a--;
cnt[a] += b;
}
rep(i, 0, 100000){
sum += cnt[i];
if(sum >= k){
cout << i+1 << endl;
return 0;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pi 3.14159265359
#define inf 2147483647
#define INF 9223372036854775807
#define mod 1000000007
#define mod2 998244353
#define Graph vector<vector<int>>
int main() {
int N, D, X; cin >> N >> D >> X;
vector<int> A(N);
for (int i = 0; i < N; i++) cin >> A.at(i);
int ans = X, day;
for (int i = 0; i < N; i++) {
day = 1;
while (day <= D) {
ans ++;
day += A.at(i);
}
}
cout << ans << endl;
return 0;
}
| 0 | 80,439,380 |
#include <bits/stdc++.h>
#define rep(i,cc,n) for(int i=cc;i<=n;++i)
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> S;
rep(i,0,M-1) {
int k;
cin >> k;
vector<int> s(k);
rep(j,0,k-1) {
cin >> s[j];
--s[j];
}
sort(s.begin(), s.end());
S.push_back(s);
}
vector<int> P(M);
rep(i,0,M-1) {
cin >> P[i];
}
int ans = 0;
for (int i = 0; i < (1 << N); ++i) {
vector<int> switches;
for (int j = 0; j < N; ++j) {
if (i & (1 << j)) {
switches.push_back(j);
}
}
sort(switches.begin(), switches.end());
bool ok = true;
for (int j = 0; j < M; ++j) {
vector<int> s = S[j];
vector<int> v;
set_intersection(switches.begin(), switches.end(), s.begin(), s.end(), back_inserter(v));
if (v.size() % 2 != P[j])
ok = false;
}
if (ok)
ans++;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a), i##end = (b); i <= i##end; ++i)
#define per(i, a, b) for (int i = (a), i##end = (b); i >= i##end; --i)
namespace IO {
#define gc getchar()
template <typename T>
inline void read(T& x) {
x = 0; bool f = 1; char ch;
for (ch = gc; ch < '0' || '9' < ch; ch = gc) if (ch == '-') f ^= 1;
for (; '0' <= ch && ch <= '9'; ch = gc) x = (x << 3) + (x << 1) + (ch ^ 48);
x = f ? x : -x;
}
#undef gc
}
typedef long long ll;
const int MAXN = 2e5 + 10;
int n;
ll ans;
int main() {
IO::read(n);
rep(i, 1, n) ans += 1ll * (n - i + 2) * (n - i + 1) / 2;
rep(i, 1, n - 1) {
int a, b;
IO::read(a), IO::read(b);
if (a > b) swap(a, b);
ans -= 1ll * a * (n - b + 1);
}
printf("%lld\n", ans);
return 0;
}
| 0 | 97,884,612 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int k;cin>>k;
int a,b;cin>>a>>b;
int x=0;
for(int i=a;i<=b;i++)if(i%k==0)x=1;
if(x==0)cout<<"NG"<<endl;
else cout<<"OK"<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#define FOR(i,n,j) for(int i=(j);i<(n);++i)
#define ssort(n) sort((n).begin(),(n).end())
#define rsort(n) sort((n).begin(),(n).end(),greater<int>())
using ll=long long;
using ld=long double;
typedef pair<int,int> P;
typedef pair<P,int> COST;
#define repl(i,n) for(ll i=0;i<(n);++i)
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
using Graf=vector<vector<char>>;
int main()
{
int h,w;
cin >> h >> w;
Graf g(h+1,vector<char>(w+1));
rep(i,h){
rep(j,w){
cin >> g[i][j];
}
}
int count;
rep(i,h){
count=0;
rep(j,w){
if(g[i][j]=='#'){
break;
}
count++;
}
if(count==w){
g[i][w]='1';
}else{
g[i][w]='0';
}
}
rep(j,w){
count=0;
rep(i,h){
if(g[i][j]=='#'){
break;
}
count++;
}
if(count==h){
g[h][j]='1';
}else{
g[h][j]='0';
}
}
rep(i,h){
if(g[i][w]=='0'){
rep(j,w){
if(g[h][j]=='0'){
cout << g[i][j];
}
}
cout << endl;
}
}
}
| 0 | 172,199 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int inf=100100100;
int main() {
int h,n;
cin >> h >> n;
vector<int> a(n),b(n);
for(int i=0;i<n;i++){
cin >> a.at(i) >> b.at(i);
}
vector<int> dp(h+1,inf);
dp.at(0) = 0;
for(int i=0;i<n;i++){
for(int j=0;j<=h;j++){
int tmp = min(h,j+a.at(i));
dp.at(tmp) = min(dp.at(tmp),dp.at(j)+b.at(i));
}
}
cout << dp.at(h) << endl;
return(0);
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
const int INF=1e9+7;
const ll LINF=9223372036854775807;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld EPS = 1e-10;
int ii() { int x; if (scanf("%d", &x)==1) return x; else return 0; }
long long il() { long long x; if (scanf("%lld", &x)==1) return x; else return 0; }
string is() { string x; cin >> x; return x; }
char ic() { char x; cin >> x; return x; }
void oi(int x) { printf("%d ", x); }
void ol(long long x) { printf("%lld ", x); }
void od_nosp(double x) { printf("%.15f", x); }
void od(double x) { printf("%.15f ", x); }
void os(const string &s) { printf("%s ", s.c_str()); }
void oc(const char &c) { printf("%c ", c); }
#define o_map(v){cerr << #v << endl; for(const auto& xxx: v){cout << xxx.first << " " << xxx.second << "\n";}}
void br() { putchar('\n'); }
#define begin_end(a) a.begin(),a.end()
#define REP(i,m,n) for(ll i=(ll)(m) ; i < (ll)(n) ; i++ )
#define DREP(i,m,n) for(ll i=(ll)(m) ; i > (ll)(n) ; i-- )
#define rep(i,n) REP(i,0,n)
#define m_p(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 p_b push_back
#define SZ(x) ((int)(x).size)
template<typename T1, typename T2> ostream& operator<<(ostream& s, const pair<T1, T2>& p) {return s << "(" << p.first << " " << p.second << ")";}
template<typename T> ostream& operator<<(ostream& s, const vector<T>& v) {
int len = v.size();
for (int i = 0; i < len; ++i) {
s << v[i]; if (i < len - 1) s << " ";
}
return s;
}
template<typename T> ostream& operator<<(ostream& s, const vector< vector<T> >& vv) {
int len = vv.size();
for (int i = 0; i < len; ++i) {
s << vv[i] << endl;
}
return s;
}
template<typename T>
bool chmax(T& a, T b){return (a = max(a, b)) == b;}
template<typename T>
bool chmin(T& a, T b){return (a = min(a, b)) == b;}
vector<int> dx_4 = {1, 0, -1, 0};
vector<int> dy_4 = {0, 1, 0, -1};
int main(){
ll H, W, D;
cin >> H >> W >> D;
vector<vector<pll> > table(D, vector<pll>(H*W/D + 1, m_p(0, 0)) );
rep(h, H) rep(w, W){
ll a = il();
ll m = a % D;
ll q = a / D;
table[m][q].first = h + 1;
table[m][q].second = w + 1;
}
vector<vector<ll> > cumsum(D, vector<ll>() );
rep(a, H*W+1){
ll m = a % D;
ll q = a / D;
if (q == 0){
cumsum[m].p_b(0);
}
else{
ll distance = abs(table[m][q].first - table[m][q-1].first) + abs(table[m][q].second - table[m][q-1].second);
cumsum[m].p_b( cumsum[m][q-1] + distance);
}
}
ll Q = il();
rep(i, Q){
ll l = il();
ll r = il();
ll lm = l % D;
ll lq = l / D;
ll rm = r % D;
ll rq = r / D;
cout << cumsum[rm][rq] - cumsum[lm][lq] << endl;
}
}
| 0 | 21,602,250 |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> x(3); cin >> x[0] >> x[1] >> x[2];
sort(x.begin(), x.end());
cout << x[2] * 10 + x[1] + x[0] << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define FF(i,a,b) for(int i=a;i<b;i++)
#define BF(i,a,b) for(int i=a;i>=b;i--)
#define vi vector<int>
#define MAP map<int,int>
#define pb push_back
#define MP make_pair
#define F first
#define S second
#define pi pair<int,int>
#define all(v) v.begin(),v.end()
#define PIE 3.1415926535897932384626433832795
#define print0(a) cout<<a<<"\n"
#define print1(a) cout<<a<<' '
#define print2(a,b) cout<<a<<" "<<b<<" ";
#define print3(a,b,c) cout<<a<<" "<<b<<" "<<c<<" ";
#define print4(a,b,c,d) cout<<a<<" "<<b<<" "<<c<<" "<<d<<" ";
#define FastIO ios::sync_with_stdio(0); cin.tie(0);cout.tie(0)
const int mod = 1e9+7;
const int N = 2e5+10;
const int inf = 1e18;
vector<int> g[N];
int h,w;
template <typename A>istream& operator>>(istream& input,vector<A>& x) {for(auto& i:x)input>>i;return input;}
template<typename A>ostream& operator<<(ostream& output,vector<A>& x) {for(auto& i:x)output<<i<<' ';return output;}
template<class t,class u> void chmax(t&a,u b){if(a<b)a=b;}
template<class t,class u> void chmin(t&a,u b){if(b<a)a=b;}
int add(int a, int b){return (a%mod + b%mod + mod)%mod;}
int sub(int a, int b){return (a%mod - b%mod + mod)%mod;}
int mul(int a, int b){return ((a%mod)*(b%mod) + mod)%mod;}
int Power(int a,int b)
{
int res=1;
while(b)
{
if(b&1)res*=a;
a*=a;
b>>=1;
}
return res;
}
int PowerMod(int a,int b)
{
int res=1;
while(b)
{
if(b&1)
{
res=mul(res,a);
}
a=mul(a,a);
b>>=1;
}
return res;
}
signed main()
{
FastIO;
int T=1;
while(T--)
{
int n,k;
cin>>n>>k;
vi a(n);
cin>>a;
vi dis(n,0);
int ans = 0;
int cnt=0;
FF(i,0,n)
{
FF(j,i+1,n)
{
if(a[j]<a[i])cnt++;
}
}
ans=cnt*k;
ans%=mod;
FF(i,0,n)
{
FF(j,0,n)
{
if(a[j]<a[i])dis[i]++;
}
}
FF(i,0,n)
{
int d = dis[i];
int val = (k*(k-1));
val%=mod;
val*=d;
val%=mod;
val*=PowerMod(2,mod-2);
val%=mod;
ans+=val;
ans%=mod;
}
cout<<ans<<"\n";
}
}
| 0 | 89,352,591 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int r;
cin >> r;
if(r<1200) cout << "ABC" << endl;
if(r>=1200 && r<2800) cout << "ARC" << endl;
if(r>=2800) cout << "AGC" << endl;
}
|
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int A, B, C, D;
cin >> A >> B >> C >> D;
if (A + B > C + D) {
printf("Left\n");
} else if (A + B < C + D) {
printf("Right\n");
} else {
printf("Balanced\n");
}
}
| 0 | 95,090,891 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,M;
cin >> N >> M;
if (M == 1){
cout << 1 << ' ' << 2 << endl;
return 0;
}
if (N % 2 == 1){
for (int i = 0; i < M; i++) {
cout << i+1 << ' ' << M*2 - i << endl;
}
}
else {
for (int i = 0; i < (M+1)/2; i++) {
cout << i+1 << ' ' << N/2 - i << endl;
}
for (int i = 0; i < M/2; i++) {
cout << N/2 + i + 2 << ' ' << N - i << endl;
}
}
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const ll INF = 1e12;
const int MOD = 1000000007;
int main() {
int n;
cin >> n;
vector<ll> a(n);
rep(i,n) cin >> a.at(i);
ll ans = 0;
int before = 0;
rep(i,n){
if( before == 1 && a[i] > 0) {ans ++; a[i] --;}
ans += a[i]/2;
before = a[i]%2;
}
cout << ans << endl;
return 0;
}
| 0 | 73,448,276 |
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
int g[b][a+1],v;
for(int i=0;i<b;i++){
cin >> v;
for(int j=0;j<a+1;j++){
if(i==0){
g[i][j]=j/v;
}
else{
if(j-v<0)g[i][j]=g[i-1][j];
else g[i][j]=min(g[i-1][j],g[i][j-v]+1);
}
}
}
cout << g[b-1][a] << endl;
return 0;
}
|
#define rep(i, n) for (int i = 0; i < (n); i++)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
int main() {
int N, M;
cin >> N >> M;
vector<string> A(N), B(M);
rep(i, N) cin >> A.at(i);
rep(i, M) cin >> B.at(i);
bool exist = false;
rep(i, N - M + 1) {
rep(j, N - M + 1) {
bool isSame = true;
rep(k, M) {
rep(l, M) {
if (A.at(i + k).at(j + l) != B.at(k).at(l)) isSame = false;
}
}
if (isSame) exist = true;
}
}
string ans = exist ? "Yes" : "No";
cout << ans << endl;
return 0;
}
| 0 | 85,770,676 |
#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++)
#define NMAX 2010
const ll mod = 1000000000 + 7;
ll n, m;
ll dp[NMAX][NMAX];
ll s[NMAX], t[NMAX];
void init() {
rep(i, 0, NMAX) {
rep(j, 0, NMAX) dp[i][j] = 0;
}
}
int main(){
cin >> n >> m;
rep(i, 0, n) cin >> s[i];
rep(i, 0, m) cin >> t[i];
init();
rep(i, 1, n+1) {
rep(j, 1, m+1) {
if(s[i-1] == t[j-1]) dp[i][j] = dp[i-1][j-1] + 1;
dp[i][j] += (dp[i-1][j] + dp[i][j-1] - dp[i-1][j-1]) % mod;
dp[i][j] += mod;
dp[i][j] %= mod;
}
}
cout << (dp[n][m]+1) % mod << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
#define endl '\n'
#define all(a, n) for (int i = 0; i < n; i++) cout << a[i] << " "; cout << endl;
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
const ll MAXN = 1e6 + 10;
const ll INF = 8e18;
const ll MOD = 1e9 + 7;
int main() {
IOS ;
int a, b , c ;
cin >> a >> b >> c ;
if(c - a + b < 0 || c == 0)cout << 0 ;
else cout << c-a+b ;
return 0 ;
}
| 0 | 62,695,792 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
ll INF = 1000000009;
int main()
{
ll h,w;
cin >> h >> w;
if (h % 3 == 0 || w % 3 == 0)
{
cout << 0 << "\n";
}
else
{
ll ans = INF * INF;
for (ll i = 1; i < h; i++)
{
ll x1 = i*w;
ll x2 = (h - i) * (w / 2);
ll x3 = (h - i) * (w - w / 2);
ll y2 = (h - i) / 2 * w;
ll y3 = ((h - i) - (h - i) / 2) * w;
ans = min(ans, max(x1, max(x3, x2)) - min(x1, min(x3, x2)));
ans = min(ans, max(x1, max(y3, y2)) - min(x1, min(y3, y2)));
}
for (ll i = 1; i < w; i++)
{
ll x1 = i * h;
ll x2 = (w - i) * (h / 2);
ll x3 = (w - i) * (h - h / 2);
ll y2 = (w - i) / 2 * h;
ll y3 = ((w - i) - (w - i) / 2) * h;
ans = min(ans, max(x1, max(x3, x2)) - min(x1, min(x3, x2)));
ans = min(ans, max(x1, max(y3, y2)) - min(x1, min(y3, y2)));
}
cout << ans << "\n";
}
}
|
#pragma region template
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vld = vector<ld>;
using vvld = vector<vld>;
using vvvld = vector<vvld>;
using vs = vector<string>;
using pll = pair<ll, ll>;
using vp = vector<pll>;
template <typename T>
using pqrev = priority_queue<T, vector<T>, greater<T>>;
#define rep(i, n) for (ll i = 0, i##_end = (n); i < i##_end; i++)
#define repb(i, n) for (ll i = (n)-1; i >= 0; i--)
#define repr(i, a, b) for (ll i = (a), i##_end = (b); i < i##_end; i++)
#define reprb(i, a, b) for (ll i = (b)-1, i##_end = (a); i >= i##_end; i--)
#define ALL(a) (a).begin(), (a).end()
#define SZ(x) ((ll)(x).size())
constexpr ll MOD = 1e9 + 7;
/*/
constexpr ll MOD = 998244353;
constexpr ll INF = 1e+18;
constexpr ld EPS = 1e-12L;
constexpr ld PI = 3.14159265358979323846L;
constexpr ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
constexpr ll LCM(ll a, ll b) { return a / GCD(a, b) * b; }
template <typename S, typename T>
inline bool chmax(S &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <typename S, typename T>
inline bool chmin(S &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
#ifdef OJ_LOCAL
#include "dump.hpp"
#else
#define dump(...) ((void)0)
#endif
template <typename T>
bool print_(const T &a) {
cout << a;
return true;
}
template <typename T>
bool print_(const vector<T> &vec) {
for (auto &a : vec) {
cout << a;
if (&a != &vec.back()) {
cout << " ";
}
}
return false;
}
template <typename T>
bool print_(const vector<vector<T>> &vv) {
for (auto &v : vv) {
for (auto &a : v) {
cout << a;
if (&a != &v.back()) {
cout << " ";
}
}
if (&v != &vv.back()) {
cout << "\n";
}
}
return false;
}
void print() { cout << "\n"; }
template <typename Head, typename... Tail>
void print(Head &&head, Tail &&... tail) {
bool f = print_(head);
if (sizeof...(tail) != 0) {
cout << (f ? " " : "\n");
}
print(forward<Tail>(tail)...);
}
#pragma endregion
void Pr(bool f){
cout << (f ? "Yes" : "No") << '\n';
exit(0);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
ll a, b, c, k;
cin >> a >> b >> c >> k;
ll d = 0;
while(a >= b){
b *= 2;
d++;
}
while(b >= c){
c *= 2;
d++;
}
Pr(d <= k);
}
| 0 | 53,341,484 |
#define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <bitset>
#include <utility>
#include <numeric>
#include <iterator>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ldouble = long double;
const ll inf = 1ll << 60;
const ll mod = (ll)1e9 + 7;
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define print(s) cout << s;
#define println(s) cout << s << endl;
#define printd(s) cout << fixed << setprecision(10) << s << endl;
int main()
{
vector<string> a(3);
string res = "YES";
for (ll i = 0; i < 3; i++)
{
cin >> a[i];
if (i > 0)
{
if (a[i - 1].back() != a[i].front())
{
res = "NO";
}
}
}
println(res);
}
|
#include <bits/stdc++.h>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<string.h>
using namespace std;
#define pb push_back
#define all(v) v. begin(),v. end()
#define rep(i,n,v) for(i=n;i<v;i++)
#define per(i,n,v) for(i=n;i>v;i--)
#define ff first
#define ss second
#define pp pair<ll,ll>
#define ll long long
#define endl '\n'
void solve()
{
ll n, a,m=0,b=1, c,k=0, i, j,l=1e9+7;
string s, r, y;
cin>>s;
sort(s.begin(),s. end());
char e='a';
rep(j,0,26) {
k=0;
rep(i,0,s.length())
{
if(s[i]==e) {k=1;break;}
}
if(!k) {
cout<<e;return;}
e++;
}
cout<<"None";
}
int main()
{
ios_base::sync_with_stdio(false);
cin. tie(0);cout. tie(0);
ll t=1;
while(t--)
{
solve();
}
return 0;
}
| 0 | 14,370,703 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
while(1) {
string s = to_string(n);
if (s[0]==s[1] && s[1]==s[2]) {
cout << n << endl;
return 0;
}
n++;
}
}
|
#include <iostream>
#include <string>
#include <algorithm>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
int co[2020][2020] = { 0 };
int co1[2020][2020] = { 0 };
int main() {
int h, w;
cin >> h >> w;
string s[2020];
for (int i = 0; i < h; i++) {
cin >> s[i];
}
for (int i = 0; i < h; i++) {
int c = 0;
for (int j = 0; j < w; j++) {
if (s[i][j] == '.') {
c++;
}
else {
c = 0;
}
co[i][j] = c;
}
for (int j = w - 2; j >= 0; j--){
if (co[i][j] != 0 && co[i][j + 1] != 0) {
co[i][j] = co[i][j + 1];
}
}
}
for (int i = 0; i < w; i++) {
int c = 0;
for (int j = 0; j < h; j++) {
if (s[j][i] == '.') {
c++;
}
else {
c = 0;
}
co1[j][i] = c;
}
for (int j = h - 2; j >= 0; j--) {
if (co1[j][i] != 0 && co1[j + 1][i] != 0) {
co1[j][i] = co1[j + 1][i];
}
}
}
int ans = 0;
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
if (co[i][j] + co1[i][j] - 1 > ans) {
ans = co[i][j] + co1[i][j] - 1;
}
}
}
cout << ans << endl;
return 0;
}
| 0 | 49,076,870 |
#include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
#define ld long double
#define ll long long
#define mod 1000000007
#define IINF INT_MAX
#define INF 1LL << 30
int main() {
int n, k; cin >> n >> k;
int ans = 0;
for(int i = 0; i < n; i++){
int h; cin >> h;
if(k <= h) ans++;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(int)(n); i<i##_len; i++)
#define reps(i,n) for(int i=1 , i##_len=(int)(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 all(x) (x).begin(), (x).end()
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define solve(a) ((a)?"Yes":"No")
typedef vector<long long> V;
typedef vector<V> VV;
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 INFLL = 1LL<<62;
const int INF = 1<<30;
const double PI=acos(-1);
ll mod=1000000000+7;
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
ll lensum(ll n){
ll res=n*(n+1);
return(((res%mod)*modinv(2,mod))%mod);
}
int main(){
int n,k;
ll ans=0LL;
cin >>n>>k;
vector<int>a(n,0);
vector<pair<int,int>>touth(n,pair<int,int>(0,0));
rep(i,n){
cin>>a[i];
}
for(int i=0;i<n;i++){
for(int j=i+1;j<n;j++){
if(a[i] >a[j]){
touth[i].F++;
}else if(a[i] <a[j]){
touth[j].S++;
}
}
}
for(int i=0;i<n;i++){
ans+=(touth[i].F*lensum(k));
ans%=mod;
ans += (touth[i].S * lensum(k-1));
ans %= mod;
}
cout<<ans<<endl;
}
| 0 | 45,736,977 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#define all(x) (x).begin(), (x).end()
#define endl '\n'
#define fsp(x) cout << fixed << setprecision(x)
const ll inf = LLONG_MAX;
const long double pi = M_PI;
void Yes() {cout << "Yes" << endl;}
void No() {cout << "No" << endl;}
void YES() {cout << "YES" << endl;}
void NO() {cout << "NO" << endl;}
int main() {
ll a, b, c;
cin >> a >> b >> c;
if (a == b && b == c) Yes();
else No();
}
|
#include <bits/stdc++.h>
#include <iostream>
#define ll long long
#define map unordered_map
#define set unordered_set
#define l_l pair<ll, ll>
#define vll vector<ll>
#define mll map<ll, ll>
using namespace std;
const ll MOD = 1000000007LL;
const ll INF = (1LL << 60LL);
vector<l_l> calc(vector<ll> list) {
mll m;
for (ll i = 0; i < list.size(); i++) {
auto v = list[i];
m[v] += 1;
}
vector<l_l> r;
auto ite = m.begin();
for (; ite != end(m); ite++) {
ll key = (*ite).first;
ll val = (*ite).second;
r.emplace_back(make_pair(val, key));
}
return r;
}
int main() {
ll N;
scanf("%lld", &N);
vector<ll> list0;
vector<ll> list1;
for (ll i = 0; i < N; i++) {
ll v;
scanf("%lld", &v);
if (i % 2 == 0) {
list0.emplace_back(v);
} else {
list1.emplace_back(v);
}
}
vector<l_l> m0 = calc(list0);
vector<l_l> m1 = calc(list1);
sort(m0.rbegin(), m0.rend());
sort(m1.rbegin(), m1.rend());
if (N == 2) {
if (list0[0] == list1[0]) {
cout << (1) << endl;
} else {
cout << (0) << endl;
}
return 0;
}
ll ans = INF;
for (ll i0 = 0; i0 < 2; i0++) {
if (i0 >= m0.size()) {
continue;
}
for (ll i1 = 0; i1 < 2; i1++) {
if (i1 >= m1.size()) {
continue;
}
ll cnt0 = m0[i0].first;
ll cnt1 = m1[i1].first;
ll a;
if (m0[i0].second == m1[i1].second) {
a = min((N / 2 - cnt0 + N / 2), (N / 2 - cnt1 + N / 2));
} else {
ll change0 = N / 2 - cnt0;
ll change1 = N / 2 - cnt1;
a = change0 + change1;
}
ans = min(ans, a);
}
}
cout << (ans) << endl;
}
| 0 | 65,729,238 |
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
string to_string(string s) { return '"' + s + '"'; }
string to_string(const char* s) { return to_string(string(s)); }
string to_string(bool b) { return to_string(int(b)); }
string to_string(char b) { return "'" + string(1, b) + "'"; }
template <typename A, typename B>
string to_string(pair<A, B> p) { return "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; }
template <typename A>
string to_string(A v) {
string res = "{";
for (const auto& x : v) res += (res == "{" ? "" : ", ") + to_string(x);
return res + "}";
}
void debug() { cerr << endl; }
template <typename Head, typename... Tail>
void debug(Head H, Tail... T) {
cerr << " " << to_string(H);
debug(T...);
}
#define db(...) cerr << "[" << #__VA_ARGS__ << "]:", debug(__VA_ARGS__)
#else
#define db(...) 42
#endif
typedef long long ll;
typedef long double ld;
int main() {
ll n;
scanf("%lld", &n);
int x, m;
scanf("%d%d", &x, &m);
vector<int> used(m);
vector<ll> sum(m);
int a = x;
ll s = 0;
bool proc = false;
for (ll i = 1; i <= n;) {
if (used[a] && !proc) {
ll cycleSum = s - sum[a];
int cycleLen = i - used[a];
ll rounds = (n - i - 1) / cycleLen;
s += rounds * cycleSum;
i += rounds * cycleLen;
proc = true;
continue;
}
used[a] = i;
sum[a] = s;
s += a;
a = (ll)a * a % m;
++i;
}
printf("%lld\n", s);
}
|
#include<bits/stdc++.h>
using namespace std;
int x,y,a,b,c;
int main(){
cin>>x>>y>>a>>b>>c;
priority_queue<int,vector<int>,greater<int> >pq_a;
priority_queue<int,vector<int>,greater<int> >pq_b;
priority_queue<int,vector<int>,less<int> >pq_c;
while(a--){
int a;
cin>>a;
pq_a.push(a);
}
while(b--){
int a;
cin>>a;
pq_b.push(a);
}
while(c--){
int a;
cin>>a;
pq_c.push(a);
}
while(pq_a.size()>x) pq_a.pop();
while(pq_b.size()>y) pq_b.pop();
while(pq_c.size()){
int curr = pq_c.top();
pq_c.pop();
if(curr<=pq_a.top() && curr<=pq_b.top()) break;
if(pq_a.top()>pq_b.top()){
pq_b.pop();
pq_b.push(curr);
}
else{
pq_a.pop();
pq_a.push(curr);
}
}
long long ret = 0;
while(pq_a.size()){
ret+=pq_a.top();
pq_a.pop();
}
while(pq_b.size()){
ret+=pq_b.top();
pq_b.pop();
}
cout<<ret;
}
| 0 | 45,910,284 |
#include <iostream>
using namespace std;
int main() {
int length;
cin >> length;
long sum=0;
int max, min;
for(int i=0; i<length; i++){
int num;
cin >> num;
sum+=num;
if(i==0){max=num; min=num;}
else{
if(num>max){max=num;}
if(num<min){min=num;}
}
}
cout << min << " " << max << " " << sum << endl;
return 0;
}
|
#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 <functional>
#include <ctime>
#include <cmath>
#include <limits>
#include <numeric>
#include <type_traits>
#include <iomanip>
#include <float.h>
#include <math.h>
using namespace std;
using ll = long long;
unsigned euclidean_gcd(unsigned a, unsigned b) {
if (a < b) return euclidean_gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
ll ll_gcd(ll a, ll b) {
if (a < b) return ll_gcd(b, a);
ll r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
struct UnionFind {
vector <ll> par;
vector <ll> siz;
UnionFind(ll sz_) : par(sz_), siz(sz_, 1LL) {
for (ll i = 0; i < sz_; ++i) par[i] = i;
}
void init(ll sz_) {
par.resize(sz_);
siz.assign(sz_, 1LL);
for (ll i = 0; i < sz_; ++i) par[i] = i;
}
ll root(ll x) {
while (par[x] != x) {
x = par[x] = par[par[x]];
}
return x;
}
bool merge(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y) return false;
if (siz[x] < siz[y]) swap(x, y);
siz[x] += siz[y];
par[y] = x;
return true;
}
bool issame(ll x, ll y) {
return root(x) == root(y);
}
ll size(ll x) {
return siz[root(x)];
}
};
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
long long modinv(long long a, long long mod) {
return modpow(a, mod - 2, mod);
}
vector<int> tpsort(vector<vector<int>>& G) {
int V = G.size();
vector<int> sorted_vertices;
queue<int> que;
vector<int> indegree(V);
for (int i = 0; i < V; i++) {
for (int j = 0; j < G[i].size(); j++) {
indegree[G[i][j]]++;
}
}
for (int i = 0; i < V; i++) {
if (indegree[i] == 0) {
que.push(i);
}
}
while (que.empty() == false) {
int v = que.front();
que.pop();
for (int i = 0; i < G[v].size(); i++) {
int u = G[v][i];
indegree[u] -= 1;
if (indegree[u] == 0) que.push(u);
}
sorted_vertices.push_back(v);
}
return sorted_vertices;
}
struct Point
{
double x;
double y;
};
struct LineSegment
{
Point start;
Point end;
};
double tenkyori(const LineSegment& line, const Point& point)
{
double x0 = point.x, y0 = point.y;
double x1 = line.start.x, y1 = line.start.y;
double x2 = line.end.x, y2 = line.end.y;
double a = x2 - x1;
double b = y2 - y1;
double a2 = a * a;
double b2 = b * b;
double r2 = a2 + b2;
double tt = -(a * (x1 - x0) + b * (y1 - y0));
if (tt < 0)
return sqrt((x1 - x0) * (x1 - x0) + (y1 - y0) * (y1 - y0));
else if (tt > r2)
return sqrt((x2 - x0) * (x2 - x0) + (y2 - y0) * (y2 - y0));
double f1 = a * (y1 - y0) - b * (x1 - x0);
return sqrt((f1 * f1) / r2);
}
int main() {
ll n;
cin >> n;
vector<ll>z(n);
for (int i = 0; i < n; i++) {
cin >> z[i];
}
for (int i = 0; i < (n+1)/2; i++) {
cout << z[n - i*2-1] << " ";
}
for (int i = 0; i < n / 2; i++) {
cout << z[n-(n/2-i)*2] << " ";
}
cout << endl;
}
| 0 | 37,752,968 |
#include<vector>
#include<iostream>
#include<string>
#include<algorithm>
#include<math.h>
#include<map>
#include<functional>
#include<queue>
#include<stack>
#include<string.h>
#include<list>
#define ll long long int
#define MOD 1000000007LL
using namespace std;
int main() {
int n;
cin>>n;
int sum=0;
int j;
for(int i=1;i<=n;i++){
sum+=i;
if(sum>=n){
j=i;
break;
}
}
for(int i=1;i<=j;i++){
if(i!=sum-n){
cout<<i<<endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
ll N,L;
ll A[100000];
int main(){
cin >> N >> L;
for(int i=0;i<N;i++) cin >> A[i];
ll ind = -1;
for(int i=0;i<N-1;i++){
if(A[i] + A[i+1] >= L) ind = i+1;
}
if(ind < 0){
cout << "Impossible" << endl;
}else{
cout << "Possible" << endl;
for(int i=1;i<ind;i++){
cout << i << endl;
}
for(int i=N-1;i>=ind;i--){
cout << i << endl;
}
}
return 0;
}
| 0 | 87,890,983 |
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
double m = (double)(a[n-1]+1)/2;
double d = a[n-1];
int res;
for (int i = 0; i < n-1; i++) {
if (abs(a[i]-m)<d) {
res = i;
d = abs(a[i]-m);
}
}
cout << a[n-1] << " " << a[res] << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
ll t[100010];
int main(){
ll n, c, k;
cin >> n >> c >> k;
rep(i, n) cin >> t[i];
sort(t, t + n);
ll cnt = 0;
ll head = t[0];
ll ans = 1;
int i = 0;
while(i < n){
if (head + k >= t[i] && cnt < c){
cnt++;
i++;
}
else if (head + k < t[i] || cnt >= c){
ans ++;
cnt = 1;
head = t[i];
i++;
}
}
cout << ans << endl;
return 0;
}
| 0 | 13,777,520 |
#include<iostream>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
if(a==b){
cout << "a == b\n";
}else if(a<b){
cout << "a < b\n";
}else{
cout << "a > b\n";
}
return 0;
}
|
#include <iostream>
#include <queue>
using namespace std;
struct locate{
int x;
int y;
};
char graph[20][20];
int cou = 0;
int H,W;
void bfs(locate z){
queue<locate> Q;
locate u;
locate v;
Q.push(z);
while(!Q.empty()){
u = Q.front();Q.pop();
if(u.y < H - 1){
if(graph[u.y + 1][u.x] == '.' && graph[u.y + 1][u.x] != 'N'){
graph[u.y + 1][u.x] = 'N';
cou++;
v.y = u.y + 1;
v.x = u.x;
Q.push(v);
}
}
if(u.x < W - 1){
if(graph[u.y][u.x + 1] == '.' && graph[u.y][u.x + 1] != 'N'){
graph[u.y][u.x + 1] = 'N';
cou++;
v.x = u.x + 1;
v.y = u.y;
Q.push(v);
}
}
if(u.y > 0){
if(graph[u.y - 1][u.x] == '.' && graph[u.y - 1][u.x] != 'N'){
graph[u.y - 1][u.x] = 'N';
cou++;
v.x = u.x;
v.y = u.y - 1;
Q.push(v);
}
}
if(u.x > 0){
if(graph[u.y][u.x - 1] == '.' && graph[u.y][u.x - 1] != 'N'){
graph[u.y][u.x - 1] = 'N';
cou++;
v.x = u.x - 1;
v.y = u.y;
Q.push(v);
}
}
}
}
int main(){
int a1,a2;
locate a;
while(1){
cin >> W >> H;
if(W == 0 && H == 0) break;
for(int i = 0; i< H ;i++){
for(int j = 0; j < W; j++){
cin >> graph[i][j];
if(graph[i][j] == '@'){
a1 = i;
a2 = j;
}
}
}
a.y = a1;
a.x = a2;
bfs(a);
cout << cou+1 << endl;
cou = 0;
for(int i = 0;i < H ;i++){
for(int j = 0;j < W; j++){
graph[i][j] = 'N';
}
}
cou = 0;
}
return 0;
}
| 0 | 17,384,349 |
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#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 rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define resort(v) sort((v).rbegin(), (v).rend())
#define vi vector<int>
#define vvi vector<vector<int>>
#define vc vector<char>
#define vvc vector<vector<char>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
using ll = long long;
using P = pair<int, int>;
int dx[] = {1,0,-1,0};
int dy[] = {0,1,0,-1};
constexpr ll mod = 1e9+7;
constexpr ll inf = INT32_MAX/2;
constexpr ll INF = LLONG_MAX/2;
constexpr long double eps = DBL_EPSILON;
constexpr long double pi = 3.141592653589793238462643383279;
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 fact(int i) {
if (i == 0) return 1;
return (fact(i - 1)) * i % mod;
}
ll gcd(ll a, ll b) {
if(b == 0) return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
return a / gcd(a, b) * b ;
}
int keta(ll n) {
if(n == 0) return 1;
int count = 0;
while(n != 0) {
n /= 10;
count++;
}
return count;
}
ll ketasum(ll n) {
ll sum = 0;
while(n != 0) {
sum += n % 10;
n /= 10;
}
return sum;
}
signed main() {
int x,y,a,b,c;cin >> x >> y >> a >> b >> c;
vector<P> v;
rep(i, a) {
int k;cin >> k;
v.pb({k,0});
}
rep(i, b) {
int k;cin >> k;
v.pb({k,1});
}
rep(i, c) {
int k;cin >> k;
v.pb({k,2});
}
resort(v);
int count = 0;
int sum = 0;
int i = 0;
while(x+y-count>0) {
if(v[i].second==0) {
if(x) {
sum+=v[i].first;
x--;
}
}
else if(v[i].second==1) {
if(y) {
sum+=v[i].first;
y--;
}
}
else {
sum+=v[i].first;
count++;
}
i++;
}
cout << sum << endl;
return 0;
}
|
#include <iostream>
#include<algorithm>
#include<string>
#include <cmath>
#include <vector>
#include <map>
#include <cstdio>
#include <iomanip>
#include<set>
#include <numeric>
#pragma region Macros
#define int long long
#define double long double
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;
#define rep(i,n) for(int i=0;i<n;i++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define REP(i,n) for(int i=1;i<=n;i++)
#define LAST(x) x[x.size()-1]
#define ALL(x) (x).begin(),(x).end()
#define swap(a,b) (a += b,b = a - b,a -= b)
#define DIVCEIL(a,b) ((a+b-1)/b)
int intpow(int a, int n) {
rep(i, n - 1)
a *= a;
return a;
}
int MODPOW(int a, int n, int mod) {
int ans = 1;
while (n > 0) {
if (n & 1)
ans = ans * a % mod;
a = a * a % mod;
n >>= 1;
}
return ans;
}
int FACT(int a) {
if (a == 0)
return 1;
else
return a * FACT(a - 1);
}
int MODFACT(int a, int mod) {
if (a == 0)
return 1;
else
return (a * FACT(a - 1)) % mod;
}
int nPr(int n, int r) {
int s = n - r + 1;
int sum = 1;
for (int i = s; i <= n; i++)
sum *= i;
return sum;
}
int MODnPr(int n, int r, int mod) {
int s = n - r + 1;
int sum = 1;
for (int i = s; i <= n; i++) {
sum *= i;
sum = sum % MOD;
}
return sum;
}
int nCr2(int n, int r) {
return FACT(n) / (FACT(r) * FACT(n - r));
}
int GCD(int a, int b)
{
if (a < b)
swap(a, b);
if (b == 0)
return a;
if (a % b == 0)
return b;
return GCD(b, a % b);
}
int LCM(int a, int b)
{
return a * b / GCD(a, b);
}
int NUMOFDIV(int n) {
int ans = 0;
REP(i, n) {
if (n % i == 0)
ans++;
}
return ans;
}
int CEIL1(int n) {
return (n + 9) / 10 * 10;
}
int DIGIT(int n, int k) {
rep(i, k - 1)
n /= 10;
return n % 10;
}
int DIGITSUM(int n) {
int sum = 0, dig;
while (n) {
dig = n % 10;
sum += dig;
n /= 10;
}
return sum;
}
int DIVTIME(int n, int k) {
int div = 0;
while (n % k == 0) {
div++;
n /= k;
}
return div;
}
int binary(int n) {
int ans = 0;
for (int i = 0; n > 0; i++) {
ans += n % 2 * intpow(10, i);
n /= 2;
}
return ans;
}
double LOG(int a, int b) {
return log(b) / log(a);
}
inline bool BETWEEN(int x, int min, int max) {
if (min <= x && x <= max)
return true;
else
return false;
}
inline bool between(int x, int min, int max) {
if (min < x && x < max)
return true;
else
return false;
}
inline bool PRIMEOR(int x) {
if (x == 1)
return false;
if (x == 2)
return true;
if (x % 2 == 0)
return false;
double sqrtx = sqrt(x);
for (int i = 3; i <= sqrtx; i += 2) {
if (x % i == 0)
return false;
}
return true;
}
bool SQRTOR(int n) {
if (sqrt(n) == (int)sqrt(n))
return true;
else
return false;
}
using namespace std;
#pragma endregion
signed main() {
int N,cou=0,ans=0;
string x;
cin >> N;
vector<string>s(N);
vector<int>t(N);
rep(i, N)
cin >> s[i] >> t[i];
cin >> x;
rep(i, N) {
if (cou > 0)
ans += t[i];
if (x == s[i])
cou++;
}
cout << ans << endl;
}
| 0 | 88,689,185 |
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <unordered_map>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 10;
#define dbg(x1) cout<<#x1<<" = "<<(x1)<<endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<(x1)<<" "<<#x2<<" = "<<(x2)<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<(x1)<<" "<<#x2<<" = "<<(x2)<<" "<<#x3<<" = "<<(x3)<<endl
char str[maxn];
int ans[maxn];
int main() {
int n;scanf("%d",&n);
scanf("%s",str);
bool isok = false;
for(int i=1;i<=2;i++)
{
for(int j=1;j<=2;j++)
{
memset(ans, 0, sizeof(ans));
ans[n - 1]=i,ans[0]=j;
for (int k = 0; k < n - 2; k++) {
int pre = (k - 1 + n) % n;
int nxt = (k + 1) % n;
if (ans[k] == 1) {
if (str[k] == 'o') {
ans[nxt] = ans[pre];
} else {
ans[nxt] = 3 - ans[pre];
}
} else {
if (str[k] == 'x') {
ans[nxt] = ans[pre];
} else {
ans[nxt] = 3 - ans[pre];
}
}
}
bool success = true;
for (int k = 0; k < n; k++) {
int pre = (k - 1 + n) % n;
int nxt = (k + 1) % n;
if (ans[k] == 1) {
if (str[k] == 'o' && ans[pre] == ans[nxt]) ;
else if (str[k] == 'x' && ans[pre] == 3 - ans[nxt]) ;
else {
success = false;
break;
}
} else {
if (str[k] == 'x' && ans[pre] == ans[nxt]) ;
else if (str[k] == 'o' && ans[pre] == 3 - ans[nxt]) ;
else {
success = false;
break;
}
}
}
if (success) {
isok = true;
break;
}
}
if (isok) break;
}
if (!isok) return 0 * puts("-1");
else {
for (int i = 0; i < n; i++) {
if (ans[i] == 1) printf("S");
else printf("W");
}
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
while (!(H == 0 && W == 0)) {
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
cout << "#";
}
cout << endl;
}
cout << endl;
cin >> H >> W;
}
return 0;
}
| 0 | 65,943,535 |
#include<iostream>
using namespace std;
int main()
{
char S[100],T[100];
cin>>S>>T;
cout<<T<<S<<endl;
return 0;
}
|
#pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <bitset>
#include <utility>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <string>
#include <ctime>
#include <cctype>
#include <cstdlib>
#include <numeric>
#define IINF 1000000000
#define INF 9223372036854775807
#define MOD 998244353
#define mod 1000000007
#define INT_MAX_ 2147483647
#define EPS (1e-10)
#define REP(i, a, n) fo-r (ll i = a; i < (ll)(n); i++)
#define REPE(i, a, n) for (ll i = a; i <= (ll)(n); i++)
#define rep(i,n)for (ll i = 0; i < (ll)(n); i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define Endl endl
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define mmax(x,y)(x>y?x:y)
#define mmin(x,y)(x<y?x:y)
#define chmax(x,y) x=mmax(x,y)
#define chmin(x,y) x=mmin(x,y)
#define all(x) (x).begin(),(x).end()
#define siz(x) (ll)(x).size()
#define PI acos(-1.0)
#define me memset
#define bit(n,k) ((n>>k)&1)
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
typedef pair<int,int>Pin;
typedef pair<ll,ll>Pll;
template<class T> using V=vector<T>;
template<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T> >;
long long GCD(long long a, long long b) {return b?GCD(b,a%b):a;}
long long LCM(long long a, long long b) {return a/GCD(a,b)*b;}
int dx[4]={-1,0,1,0};
int dy[4]={0,-1,0,1};
int ddx[8]={-1,0,1,0,1,1,-1,-1};
int ddy[8]={0,-1,0,1,1,-1,1,-1};
ll cmp1(pair<ll,ll> a,pair<ll,ll> b){
if(a.se!=b.se)
return a.se<b.se;
else
return a.fi>b.fi;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;cin>>n;
cout<<(n-2)*180<<endl;
return 0;
}
| 0 | 8,056,016 |
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
using namespace std;
using ll = long long;
const ll MOD = 1000000007LL;
const double PI = 3.14159265358979;
void solve()
{
int n;
double x;
string u;
cin >> n;
double ans = 0;
for(int i = 0; i < n; ++i)
{
cin >> x >> u;
ans += (u == "JPY" ? x : x * 380000.0);
}
printf("%.7f\n", ans);
}
int main()
{
fastio;
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define FOR(i, a, b) for (int i = a; i <= (b); i++)
#define ROF(i, a, b) for (int i = a; i >= (b); i--)
using pii = pair<int, int>; using vpii = vector<pii>;
using vi = vector<int>; using vvi = vector<vi>;
using ll = long long;
using pll = pair<ll, ll>; using vpll = vector<pll>;
using vll = vector<ll>; using vvll = vector<vll>;
int main() {
int n, m; cin >> n >> m;
vi cnt(n + 2);
FOR(i, 1, m) {
int l, r; cin >> l >> r;
cnt[l]++, cnt[r + 1]--;
}
int ans = 0;
FOR(i, 1, n) {
cnt[i] += cnt[i - 1];
if (cnt[i] == m) ans++;
}
cout << ans << endl;
}
| 0 | 24,655,048 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define size_of_array(array) (sizeof(array)/sizeof(array[0]))
#define MAX 100005
#define NIL -1
using ll =long long;
using namespace std;
using Graph=vector<vector<int>>;
using Field=vector<vector<char>>;
using P =pair<int,int>;
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T> inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
const ll mod=1000000007;
int main(){
ll n;
cin>>n;
vector<ll> a(n);
rep(i,n)cin>>a[i];
ll ans=0;
rep(i,60){
int x=0;
rep(j,n){
if((a[j]>>i)&1)++x;
}
ll sum=x*(n-x)%mod;
rep(j,i){
sum=sum*2%mod;
}
ans+=sum%mod;
}
cout<<ans%mod<<endl;
}
|
#include <bits/stdc++.h>
#define REP(i, e) for(int (i) = 0; (i) < (e); ++(i))
#define FOR(i, b, e) for(int (i) = (b); (i) < (e); ++(i))
#define ALL(c) (c).begin(), (c).end()
#define PRINT(x) cout << (x) << "\n"
using namespace std;
using ll = long long; using pint = pair<int, int>; using pll = pair<ll, ll>;
const long long MOD = 1000000007;
ll N;
string s[100010];
map<string, ll> mp;
signed main(){
cin >> N;
REP(i, N){
cin >> s[i];
sort(ALL(s[i]));
mp[s[i]]++;
}
ll ans = 0;
for(auto p : mp){
ll n = p.second;
ans += n * (n - 1) / 2;
}
PRINT(ans);
return 0;
}
| 0 | 95,911,863 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pa pair<int, int>
#define pal pair<long long, long long>
#define pali pair<long long, int>
#define pad pair<double, double>
#define pb push_back
#define mp make_pair
#define COUT(v) \
for (int64_t i = 0; i < (v).size(); ++i) \
{ \
cout << v.at(i) << endl; \
}
#define REP(i, n) for (int64_t i = 0; i < n; ++i)
#define FOR(i, r, n) for (int64_t i = (r); i < n; ++i)
#define VIN(v) \
for (int64_t i = 0; i < (v).size(); ++i) \
{ \
cin >> (v).at(i); \
}
typedef vector<bool> bvec;
typedef vector<int> ivec;
typedef vector<long long> lvec;
typedef vector<double> dvec;
typedef vector<pa> pavec;
typedef vector<pali> palivec;
typedef vector<pal> palvec;
typedef vector<vector<bool> > bmat;
typedef vector<vector<int> > imat;
typedef vector<vector<long long> > lmat;
typedef vector<string> svec;
typedef vector<vector<string> > smat;
const ll infll = (1LL << 60) - 1;
const int inf = (1 << 30) - 1;
const ll MOD = 1000000007;
ll gcd(ll x, ll y)
{
ll r = x % y;
if (r == 0)
return y;
else
return gcd(y, r);
}
ll lcm(ll x, ll y)
{
return x * y / gcd(x, y);
}
lvec mfactor(ll n)
{
bvec ip(n, true);
lvec mf(n, -1);
ip[0] = false;
ip[1] = false;
mf[0] = 0;
mf[1] = 1;
REP(i, n)
{
if (ip[i])
{
mf[i] = i;
for (ll j = i * i; j < n; j += i)
{
ip[j] = false;
if (mf[j] == -1)
mf[j] = i;
}
}
}
return mf;
}
palivec get_prime(ll n, const lvec &mf)
{
palivec plist;
while (n != 1)
{
int cnt = 0;
ll m = mf[n];
while (mf[n] == m)
{
cnt++;
n /= m;
}
plist.pb(pali(m, cnt));
}
return plist;
}
void COMinit(int m, lvec &fac, lvec &finv)
{
lvec inv(m);
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < m; 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 pow_mod(ll a, ll n)
{
ll x = 1;
while (n > 0)
{
if (n & 1)
{
x = x * a % MOD;
}
a = a * a % MOD;
n >>= 1;
}
return x;
}
ll pow_mod2(ll a, ll n)
{
ll x = 1;
while (n > 0)
{
if (n & 1)
{
x = x * a;
}
a = a * a;
n >>= 1;
}
return x;
}
ll COM(int n, int k, const lvec &fac, const lvec &finv)
{
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return (fac[n] * (finv[k] * finv[n - k] % MOD)) % MOD;
}
ll modinv(ll a, ll m)
{
ll b = m, u = 1, v = 0;
while (b)
{
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
class UnionFind {
public:
vector <ll> par;
vector <ll> siz;
UnionFind(ll sz_): par(sz_), siz(sz_, 1LL) {
for (ll i = 0; i < sz_; ++i) par[i] = i;
}
void init(ll sz_) {
par.resize(sz_);
siz.assign(sz_, 1LL);
for (ll i = 0; i < sz_; ++i) par[i] = i;
}
ll root(ll x) {
while (par[x] != x) {
x = par[x] = par[par[x]];
}
return x;
}
bool merge(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y) return false;
if (siz[x] < siz[y]) swap(x, y);
siz[x] += siz[y];
par[y] = x;
return true;
}
bool issame(ll x, ll y) {
return root(x) == root(y);
}
ll size(ll x) {
return siz[root(x)];
}
};
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
ll n, m;
cin >> n >> m;
bmat adj(n, bvec(n, false));
lvec p(n);
for (int i=0; i<m; i++){
ll a, b;
cin >> a >> b;
--a, --b;
adj[a][b] = true;
adj[b][a] = true;
}
for (int i=0; i<n; i++){
p[i] = i;
}
ll ans = 0;
function<void(int, bvec&)> dfs = [&](int d, bvec &t){
if(d==n){
bool flg = true;
for (int i=1; i<n; i++){
if(!adj[p[i-1]][p[i]]){
flg = false;
break;
}
}
if(flg)++ans;
return;
}
for (int i=1; i<n; i++){
if(t[i]) continue;
p[d] = i;
t[i] = true;
dfs(d+1, t);
t[i] = false;
}
};
bvec t(n, false);
dfs(1, t);
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
int main() {
int n;
cin>>n;
vector<int> d(n);
rep(i,n){
cin>>d[i];
}
long ans=0;
rep(i,n){
for(int k=i+1;k<n;k++){
ans=ans+(d[i]*d[k]);
}
}
cout<<ans<<endl;
}
| 0 | 66,598,875 |
#include<bits/stdc++.h>
using namespace std;
#define MAX 35000
#define MOD 1000000007
#define PI 3.14159265359
#define makefast__ ios_base::sync_with_stdio(false);
using ll=long long int ;
using dl =double;
const int N = 2e5 + 10;
ll aarray[300000+10];
ll magic[101][101];
vector<ll>primes;
bool prime[1000001];
ll chkbit(ll n,ll k)
{
return n&(1LL<<k);
}
int main()
{
makefast__
string str;
ll a,b,c,d,e,f,x,y,k,t,A=0,mod,B=0,L,j,i,l,r,m,n,C=0,ans=0,sum=0,sum1=0;
vector<ll>v,v1;
queue<ll>qu;
cin>>n;
for(i=0; i<n; i++)
cin>>aarray[i];
for(i=0; i<64; i++)
{
ll cnt=0;
for(j=0; j<n; j++)
{
if(chkbit(aarray[j],i))
cnt++;
}
ll ad=((cnt*(n-cnt))%MOD)*((1LL<<i)%MOD);
ans=(ans+ad)%MOD;
}
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int m, nmin, nmax;
while( cin >> m >> nmin >> nmax, m || nmin || nmax ) {
vector<int>P( m );
for( size_t i = 0; i < m; i++ ) {
cin >> P[i];
}
int ans = 0;
int sub = 0;
for( size_t i = nmin; i <= nmax; i++ ) {
if( sub <= P[i - 1] - P[i] ) {
sub = P[i - 1] - P[i];
ans = i;
}
}
cout << ans << endl;
}
}
| 0 | 26,838,215 |
#include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x) cerr << #x << " = " << (x) << endl;
#define INF 2000000000
#define mod 1000000007
#define INF2 1000000000000000000
#define int long long
signed main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
int sum = 0;
int a[100010];
rep(i, N) cin >> a[i];
rep(i, N) {
sum += max(0LL, a[i]);
}
int ans = 0;
int tmp1 = 0, tmp2 = 0;
rep(i, K) {
tmp1 -= max(0LL, a[i]);
tmp2 += a[i];
}
rep(i, N - K + 1) {
ans = max(ans, sum + tmp1 + max(0LL, tmp2));
tmp1 += max(0LL, a[i]);
tmp1 -= max(0LL, a[K + i]);
tmp2 -= a[i];
tmp2 += a[K + i];
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
long long k;
cin >> k;
long long a[50];
for (int i = 0; i < k % 50; i++) {
a[i] = k / 50 + 100 - k % 50;
}
for (int i = k % 50; i < 50; i++) {
a[i] = k / 50 + 49 - k % 50;
}
cout << 50 << '\n';
for (auto i : a) {
cout << i << ' ';
}
return 0;
}
| 0 | 69,677,265 |
#include<iostream>
int main(){
std::string s; std::cin >> s;
int diff=1e4;
for(int i=0; i<s.size()-2; ++i){
int num=std::stoi(s.substr(i,3));
num = std::abs(num-753);
diff = std::min(diff,num);
}
std::cout << diff << std::endl;
return 0;
}
|
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#include<algorithm>
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
ll gcd(ll a,ll b){
if(b == 0) return a;
return gcd(b , a % b);
}
ll mod(ll a){
return (a % 1000000007);
}
ll lcm(ll a,ll b){
return (a*b)/gcd(a,b);
}
ll nCr(ll n,ll r){
if(r == 1) return n;
else if(r == 0) return 1;
else return nCr(n-1,r-1)*n/r;
}
int main(){
ll n; string s; cin >> s; n = s.size(); vl num(n+1);
if(s[0] == '<') num[0] = 0;
for(ll i=0; i < n; i++){
if(s[i] == '>' && s[i+1] == '<'){
num[i+1] = 0;
}
else if(s[i] == '<'){
num[i+1] = num[i] + 1;
}
}
for(ll i=n-1; i >= 0; i--){
if(s[i] == '>'){
if(num[i] <= num[i+1] + 1) num[i] = num[i+1] + 1;
}
}
ll ans = 0;
rep(i,n+1){
ans += num[i];
}
cout << ans << endl;
}
| 0 | 65,352,669 |
#include <bits/stdc++.h>
#include <cstdlib>
#include <cmath>
#define rep(i,n) for (long long i=0; i < (n); ++i)
#define rep2(i,n,m) for(long long i=n;i<=m;i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
const ll INF=1e18 ;
inline void chmax(ll& a,ll b){a=max(a,b);}
inline void chmin(ll& a,ll b){a=min(a,b);}
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,x ;
cin>> n>>x ;
ll k=gcd(n,x) ;
cout <<3*n-3*k<<endl ;
return 0;
}
|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
vector<int> a(3);
for (int i = 0; i < 3; i++)
cin >> a.at(i);
if (a.at(0) != a.at(1))
cout << (a.at(0) == a.at(2) ? a.at(1) : a.at(0)) << endl;
else
cout << a.at(2) << endl;
}
| 0 | 39,017,117 |
#include <iostream>
using namespace std;
int main(){
int n;
while(cin >> n, n){
int a[5000], ans = -100001;
for(int i = 0; i < n; i++) cin >> a[i];
for(int i = 0; i < n; i++){
int sum = 0;
for(int j = i; j < n; j++){
sum += a[j];
ans = max(ans, sum);
}
}
cout << ans << endl;
}
return 0;
}
|
#include<iostream>
#include<algorithm>
#include<string>
#include<cmath>
#include<vector>
#include<map>
using namespace std;
int main() {
int n; cin >> n;
vector<int>b(n-1);
vector <int>a(n);
for(int i = 0; i < n-1; i++) cin >> b[i];
a[0] = b[0];
a[1] = b[0];
for(int i = 1; i < n-1; i++){
a[i+1] = b[i];
if(b[i] < max(a[i+1], a[i])){
a[i] = b[i];
}
}
int sum = 0;
for(int i = 0; i < n; i++){
sum += a[i];
}
cout << sum << endl;
return 0;
}
| 0 | 16,175,796 |
#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 <functional>
#include <ctime>
#include <cmath>
#include <limits>
#include <numeric>
#include <type_traits>
#include <iomanip>
#include <float.h>
#include <math.h>
using namespace std;
using ll = long long;
unsigned euclidean_gcd(unsigned a, unsigned b) {
if (a < b) return euclidean_gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
class UnionFind {
public:
vector <ll> par;
vector <ll> siz;
UnionFind(ll sz_) : par(sz_), siz(sz_, 1LL) {
for (ll i = 0; i < sz_; ++i) par[i] = i;
}
void init(ll sz_) {
par.resize(sz_);
siz.assign(sz_, 1LL);
for (ll i = 0; i < sz_; ++i) par[i] = i;
}
ll root(ll x) {
while (par[x] != x) {
x = par[x] = par[par[x]];
}
return x;
}
bool merge(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y) return false;
if (siz[x] < siz[y]) swap(x, y);
siz[x] += siz[y];
par[y] = x;
return true;
}
bool issame(ll x, ll y) {
return root(x) == root(y);
}
ll size(ll x) {
return siz[root(x)];
}
};
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
long long modinv(long long a, long long mod) {
return modpow(a, mod - 2, mod);
}
int main() {
string a;
cin >> a;
if (a.size() < 4)cout << "No" << endl;
else if (a[0] == 'Y' && a[1] == 'A' && a[2] == 'K' && a[3] == 'I')cout << "Yes" << endl;
else cout << "No" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i <= (n); i++)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
using ll = long long;
template <class T>
using Grid = vector<vector<T>>;
int main() {
ll N, K;
cin >> N >> K;
double ans = 0;
for (int i = 1; i <= N; i++) {
int res = i;
double p = 1.0 / N;
while (res < K) {
res *= 2;
p *= 0.5;
}
ans += p;
}
printf("%.12f\n", ans);
}
| 0 | 40,854,907 |
#include<stdio.h>
#include<iostream>
using namespace std;
int main() {
int x, y;
int F[50];
F[0] = F[1] = 1;
for ( int i = 2; i < 50; i++ ) F[i] = F[i-1] + F[i-2];
cin >> x;
cout << F[x] << endl;
return 0;
}
|
#include<cstdio>
using namespace std;
int main(void){
int heaps[250]={0};
int heap_size=0;
scanf("%d",&heap_size);
int i=0;
for(i=0;i<heap_size;i++){
scanf("%d",&(heaps[i]));
}
for(i=0;i<heap_size;i++){
printf("node\x0020%d:\x0020",i+1);
printf("key\x0020=\x0020%d,\x0020",heaps[i]);
if(i!=0){
printf("parent\x0020key\x0020=\x0020%d,\x0020",heaps[(i+1)/2-1]);
}
if(2*(i+1)<=heap_size){
printf("left\x0020key\x0020=\x0020%d,\x0020",heaps[(i+1)*2-1]);
if(2*(i+1)+1<=heap_size){
printf("right\x0020key\x0020=\x0020%d,\x0020",heaps[(i+1)*2]);
}
}
printf("\n");
}
return 0;
}
| 0 | 5,673,650 |
#include<stdio.h>
int main()
{
int a,b;
scanf("%d%d",&a,&b);
if((a*b)%2==0)printf("Even\n");
else
printf("Odd\n");
}
|
#include "bits/stdc++.h"
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP0(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REP1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
typedef long long LL;
typedef pair<int, int> pii;
const int INTINF = 1e9;
const LL LLINF = 1e18;
void solve()
{
LL ans = LLINF;
LL H;
cin >> H;
LL W;
cin >> W;
{
LL p1_w = (W + 1) / 3;
LL p2_w = (W - p1_w) / 2;
LL p3_w = W - p1_w - p2_w;
LL min_w = min(min(p1_w, p2_w), p3_w);
LL max_w = max(max(p1_w, p2_w), p3_w);
ans = min_w ? min(ans, H * (max_w - min_w)) : ans;
}
{
LL p1_w = (W + 1) / 3;
LL p2_h = H / 2;
LL p2_w = W - p1_w;
LL p3_h = H - p2_h;
LL p1 = p1_w * H;
LL p2 = p2_h * p2_w;
LL p3 = p3_h * p2_w;
LL p_min = min(min(p1, p2), p3);
LL p_max = max(max(p1, p2), p3);
ans = p_min ? min(ans, p_max - p_min) : ans;
}
{
LL p1_h = (H + 1) / 3;
LL p2_h = (H - p1_h) / 2;
LL p3_h = H - p1_h - p2_h;
LL min_h = min(min(p1_h, p2_h), p3_h);
LL max_h = max(max(p1_h, p2_h), p3_h);
ans = min_h ? min(ans, W * (max_h - min_h)) : ans;
}
{
LL p1_h = (H + 1) / 3;
LL p2_w = W / 2;
LL p2_h = H - p1_h;
LL p3_w = W - p2_w;
LL p1 = p1_h * W;
LL p2 = p2_h * p2_w;
LL p3 = p2_h * p3_w;
LL p_min = min(min(p1, p2), p3);
LL p_max = max(max(p1, p2), p3);
ans = p_min ? min(ans, p_max - p_min) : ans;
}
cout << ans << endl;
}
int main(int argc, char const *argv[])
{
cin.tie(0);
ios::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(10);
solve();
return 0;
}
| 0 | 22,627,120 |
#include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include<climits>
using namespace std;
#define REP(i,s,e) for((i)=(s);(i)<(e);(i)++)
#define RREP(i,s,e) for((i)=((s)-1);(i)>=(e);(i)--)
#define FOR(i,n) for((i)=(0);(i)<(n);(i)++)
#define RFOR(i,n) for((i)=((n)-1);(i)>=(0);(i)--)
#define MOD 1000000007
int main(){
int N;
cin>>N;
int X[100];
for(int i=0;i<N;i++){
cin>>X[i];
}
int mn=INT_MAX;
for(int i=-10;i<=110;i++){
int p=i;
int sum=0;
for(int j=0;j<N;j++){
sum+=(p-X[j])*(p-X[j]);
}
mn=min(sum,mn);
}
cout<<mn<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<ll(n);i++)
int main() {
ll n;
cin >> n;
vector<ll> a(n+1), b(n+1, 0);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
ll ans = 0;
ll c;
for (ll i = n; i >= 1; i--) {
c = min(b[i], a[i]);
ans += c;
b[i] -= c;
a[i] -= c;
c = min(b[i - 1], a[i]);
ans += c;
b[i - 1] -= c;
a[i] -= c;
}
c = min(b[0], a[0]);
ans += c;
b[0] -= c;
a[0] -= c;
cout << ans << endl;
return 0;
}
| 0 | 27,555,546 |
#include <bits/stdc++.h>
using namespace std;
using dou =long double;
string yes="yes";
string Yes="Yes";
string YES="YES";
string no="no";
string No="No";
string NO="NO";
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(int i = 0; i < (int)(n); i++)
#define brep(n) for(int bit=0;bit<(1<<n);bit++)
#define erep(i,container) for (auto i : container)
#define irep(i, n) for(int i = n-1; i >= (int)0; i--)
#define rrep(i,m,n) for(ll i = m; i < (ll)(n); i++)
#define reprep(i,j,h,w) rep(i,h)rep(j,w)
#define all(x) (x).begin(),(x).end()
#define VEC(type,name,n) std::vector<type> name(n);rep(i,n)std::cin >> name[i];
#define pb push_back
#define pf push_front
#define query int qq;std::cin >> qq;rep(qqq,qq)
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define itn int
#define mp make_pair
#define sum(a) accumulate(all(a),0ll)
#define keta fixed<<setprecision
#define vvector(name,typ,m,n,a)vector<vector<typ> > name(m,vector<typ> (n,a))
#define vvvector(name,t,l,m,n,a) vector<vector<vector<t> > > name(l, vector<vector<t> >(m, vector<t>(n,a)));
#define vvvvector(name,t,k,l,m,n,a) vector<vector<vector<vector<t> > > > name(k,vector<vector<vector<t> > >(l, vector<vector<t> >(m, vector<t>(n,a)) ));
#define case std::cout <<"Case #" <<qqq+1<<": "
#define res resize
#define as assign
#define ffor for(;;)
#define ppri(a,b) std::cout << a<<" "<<b << std::endl
#define pppri(a,b,c) std::cout << a<<" "<<b <<" "<< c<<std::endl
#define aall(x,n) (x).begin(),(x).begin()+(n)
#define ssum(a) accumulate(a,0ll)
#define gre(n) greater<n>()
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;
const int INF = 1000000000;
const ll INF64 = 922337203685477580ll;
const ll MOD = 1000000007ll;
const dou pi=3.141592653589793;
std::vector<vector<ll>> d;
void warshall_floyd(int n) {
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
for (int k = 0; k < n; k++)
d[j][k] = min(d[j][k], d[j][i] + d[i][k]);
}
int main(){
int v,e;
std::cin >> v>>e;
d.resize(v);
rep(i,v){
d[i].resize(v);
}
reprep(i,j,v,v)d[i][j]=INF64;
rep(i,v)d[i][i]=0;
rep(i,e){
int a,b,c;
std::cin >> a>>b>>c;
d[a][b]=c;
}
warshall_floyd(v);
reprep(i,j,v,v){
if(d[i][j]+d[j][i]<0){
std::cout << "NEGATIVE CYCLE" << std::endl;
exit(0);
}
}
rep(i,v){
rep(j,v){
if(d[i][j]<=INF64/10)std::cout << d[i][j] <<((j==v-1)?"":" ");
else std::cout << "INF" <<((j==v-1)?"":" ");
}
std::cout << std::endl;
}
}
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <time.h>
#define ll long long
#define double long double
#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 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 ALL(V) (V).begin(),(V).end()
#define SORT(V) sort((V).begin(),(V).end())
#define REVERSE(V) reverse((V).begin(),(V).end())
#define INF ((1LL<<62)-(1LL<<31))
#define EPS 1e-10
#define PI 3.141592653589793238
#define MOD 1000000007
#define MAX 5100000
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 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;}
bool CAN=true;
using namespace std;
int main(){
ll x,y;
cin>>x>>y;
ll d=abs(y)-abs(x);
ll ans=0;
if(d>=0){
ans+=abs(d);
if(x<0)ans++;
if(y<0)ans++;
}
else {
ans+=abs(d);
if(x>0)ans++;
if(y>0)ans++;
}
cout <<ans <<endl;
return 0;
}
| 0 | 90,677,581 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = s; i < (int)(n); i++)
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long long;
using pii = pair<int, int>;
void solve()
{
int y, m, d;
char c1, c2;
cin >> y >> c1 >> m >> c2 >> d;
cerr << y << m << d << endl;
if ((m < 4) || (m == 4 && d <= 30))
cout << "Heisei" << endl;
else
cout << "TBD" << endl;
}
int main(void)
{
ios::sync_with_stdio(0);
cin.tie(0);
solve();
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n; string s; cin >> n >> s;
ll r_cnt = 0;
ll g_cnt = 0;
ll b_cnt = 0;
for (int i = 0; i < n; i++) {
if (s[i] == 'R') r_cnt++;
if (s[i] == 'G') g_cnt++;
if (s[i] == 'B') b_cnt++;
}
ll tmp = 0;
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j < n; j++) {
int k = 2 * j - i;
if (n <= k) continue;
if (s[i] != s[j] && s[j] != s[k] && s[k] != s[i]) {
tmp++;
}
}
}
ll ans = r_cnt * g_cnt * b_cnt - tmp;
cout << ans << endl;
return 0;
}
| 0 | 92,458,641 |
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
void Input(int*,int*);
int Calc(int*,int*);
void Output(int*,int*,int*);
int main(int argc,char* argv[]){
int n,count=0;
int arr[100];
Input(&n,arr);
count=Calc(&n,arr);
Output(&n,&count,arr);
return 0;
}
void Input(int *pn,int *arr){
cin>>*pn;
for(int i=0;i<*pn;i++)
cin>>*arr++;
}
int Calc(int *pn,int *arr){
int count=0,now;
for(int i=0;i<*pn;i++){
now=i;
for(int j=i+1;j<*pn;j++){
if(arr[now]>arr[j])
now=j;
}
if(arr[i]!=arr[now]) count++;
swap(arr[i],arr[now]);
}
return count;
}
void Output(int *pn,int *pcount,int *arr){
printf("%d",*arr++);
for(int i=1;i<*pn;i++)
printf(" %d",*arr++);
puts("");
printf("%d\n",*pcount);
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int>pii;
const int mod = 1e9+7;
long double PI = acosl(-1);
const ll infl = 3e18+100;
const int inf = 1e8+100;
const int nmax = 1e5+5;
const int MAXLG = log2(nmax)+1;
int main(){
ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
ll n,k;
cin>>n>>k;
vector<int>v(n);
for(int &x : v) cin>>x;
ll ans = 0;
for(int i=0; i<n; i++) for(int j=0; j<n; j++)if(v[i]>v[j]){
if(i<j){
ans = (ans + k*(k+1)/2 % mod) % mod;
}
else{
ans = (ans + k*(k-1)/2 % mod) % mod;
}
}
cout<<ans<<endl;
}
| 0 | 68,172,535 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
const ll INF = 1ll << 62;
const double PI = 2 * asin(1);
void yes() {printf("yes\n");}
void no() {printf("no\n");}
void Yes() {printf("Yes\n");}
void No() {printf("No\n");}
void YES() {printf("YES\n");}
void NO() {printf("NO\n");}
string S; ll K;
vector <pair<char, ll>> P;
int main(){
cin >> S >> K;
ll cnt = 1;
for (int i = 1; i < S.length(); i++){
if (S[i] == S[i-1]){
cnt++;
}else{
P.push_back({S[i-1], cnt});
cnt = 1;
}
}
P.push_back({S[S.length()-1], cnt});
int V = P.size();
if (V == 1){
ll ans = S.length();
cout << ans * K / 2 << endl;
return 0;
}
if (P[0].fi != P[V-1].fi){
ll ans = 0;
for (int i = 0; i < V; i++){
ans += P[i].se / 2;
}
cout << ans * K << endl;
return 0;
}
ll ans = 0;
for (int i = 1; i < V-1; i++){
ans += P[i].se/ 2;
}
ans *= K;
ans += (P[0].se + P[V-1].se) / 2 * (K-1);
ans += P[0].se / 2 + P[V-1].se / 2;
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std ;
typedef pair<int,int> pii ;
int a = 0 ;
int b = 0 ;
int n = 0 ;
int dp[16][16] = {1} ;
vector<pii> construct ;
int inf = pow(10,9) ;
int solve()
{
for ( int i = 0 ; i < 16 ; i++ )
{
for ( int j = 0 ; j < 16 ; j++ )
{
dp[i][j] = 0 ;
}
}
for ( int i = 0 ; i < construct.size() ; i++ )
{
dp[ construct[i].first - 1 ][ construct[i].second - 1 ] = inf ;
}
construct.clear() ;
dp[0][0] = 1 ;
for ( int i = 0 ; i < a ; i++ )
{
for ( int j = 0 ; j < b ; j++ )
{
if ( dp[i][j] == inf ) continue ;
if ( i < a - 1 )
{
if ( dp[ i + 1 ][j] != inf )
{
dp[ i + 1 ][j] += dp[i][j] ;
}
}
if ( j < b - 1 )
{
if ( dp[i][ j + 1 ] != inf )
{
dp[i][ j + 1 ] += dp[i][j] ;
}
}
}
}
return dp[ a - 1 ][ b - 1 ] ;
}
int main()
{
while (1)
{
cin >> a >> b ;
if ( !a && !b ) break ;
cin >> n ;
for ( int i = 0 ; i < n ; i++ )
{
int x, y ;
cin >> x >> y ;
construct.push_back( pii(x,y) ) ;
}
printf("%d\n", solve()) ;
}
return 0 ;
}
| 0 | 97,117,361 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll x,y;
cin>>x>>y;
int ans=0;
if(x%y==0){
ans=-1;
}
ll n=1000000000000000000;
for(ll i=x;i<n;i+=x){
if(i%y==0){
;
}
else{
ans=i;
break;
}
if(ans){
break;
}
}
if(ans){
cout<<ans<<endl;
}
else{
cout<<-1<<endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int q,h,s,d;
long long n;
cin >> q >> h >> s >> d >> n;
n=n*4;
map<int,int> price;
price[q*8]=1;
price[h*4]=2;
price[s*2]=4;
price[d]=8;
long long ans = 0;
for(auto p:price){
int cost = p.first;
int volume = p.second;
ans += cost*volume/8*(n/volume);
n -= (n/volume)*volume;
if(n==0) break;
}
cout << ans << endl;
}
| 0 | 4,866,833 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock()/CLOCKS_PER_SEC
signed main() {
#ifdef HOME
freopen("input.txt", "r", stdin);
#else
#define endl '\n'
ios_base::sync_with_stdio(0); cin.tie(0);
#endif
int n;
cin >> n;
vector <int> a(n), b(n);
for (int i = 0; i < n; ++i) {
cin >> a[i] >> b[i];
}
int ans = 0;
for (int i = n - 1; i >= 0; --i) {
a[i] += ans;
int w = (a[i] + b[i] - 1) / b[i] * b[i] - a[i];
ans += w;
}
cout << ans << endl;
}
|
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define F first
#define S second
#define Tsetso ios_base::sync_with_stdio(0) ; cin.tie(0) ;
using namespace std;
const ll N = 2e5+10, inf = 1e3+5, mod = 1e9+7, NN = 1e5+10;
int a;
int main()
{
Tsetso ;
int n, k ;
cin >> n >> k ;
map < int, int > mp ;
set < int > s ;
for ( int i = 0 ; i < n ; i++)
{
cin >> a;
s.insert(a);
mp[a]++ ;
}
vector < int> v ;
for (auto i : s )
v.push_back(mp[i]);
sort(v.begin(),v.end());
if ( v.size() <= k)
return cout << 0 , 0 ;
int ans = 0;
for ( int i = 0 ; i< v.size()-k ;i++)
ans += v[i] ;
cout << ans ;
}
| 0 | 17,747,403 |
#include<iostream>
#include<vector>
#define INF 1000000
using namespace std;
int main(){
int x, n;
cin >> x >> n;
vector<int> p(n);
int i, plus, minus;
for(i=0;i<n;i++){
cin >> p.at(i);
}
int ans=INF;
int count = 0;
while(1){
minus=INF;
plus=INF;
for(i=0;i<n;i++){
if(p.at(i)==x-count){
minus = p.at(i);
}
if(p.at(i)==x+count){
plus = p.at(i);
}
}
if(minus==INF){
ans=x-count;
break;
}
if(plus==INF){
ans=x+count;
break;
}
count++;
}
cout << ans << endl;
}
|
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define rep(i,n) for(int i = 0; i < ((int)(n)); i++)
int main() {
ll N, M; cin >> N >> M;
ll res = 0;
if (N * 2 <= M) {
res += N;
M -= 2 * N;
N = 0;
res += M/4;
} else {
res += M/2;
}
cout << res << endl;
}
| 0 | 14,792,985 |
#include<iostream>
#include<string>
using namespace std;
int main(){
long long a=100000;
int n;
cin>>n;
for(int i=0;i<n;i++){
a*=1.05;
if(a%1000==0)
a-=1000;
a/=1000;
a*=1000;
a+=1000;
}
cout<<a<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define pi acos(-1)
#define IOS ios_base::sync_with_stdio(0); cin.tie(); cout.tie();
#define ff first
#define ss second
#define pb push_back
#define debug(val) cerr << "The value of " << #val << " is = " << val << '\n';
typedef long long ll;
typedef unsigned long long ull;
const ll mod = 1e9 + 7;
const ll inf = 0x3f3f3f3f;
const ll mininf = -922337203685477;
const ll nax = 0;
int n, b[105];
ll sums=0;
int main(){
IOS
cin >> n;
for(int i=1;i<n;i++){
cin >> b[i];
}
for(int i=1;i<=n;i++){
if(i==1){
sums+=b[i];
}
else if(i!=n){
sums+=min(b[i], b[i-1]);
}
else{
sums+=b[i-1];
}
}
cout << sums << '\n';
}
| 0 | 24,155,343 |
#include <iostream>
using namespace std;
int main() {
while ( true ) {
int N, M, P;
cin >> N >> M >> P;
if ( N == 0 ) break;
int sum = 0, hit;
for ( int i = 1; i <= N; i++ ) {
int val;
cin >> val;
sum += val;
if ( i == M ) {
hit = val;
}
}
const int ans = ( hit == 0 ? 0 : sum * ( 100 - P ) / hit );
cout << ans << endl;
}
}
|
#include <iostream>
#include <bitset>
#include <vector>
#include <string>
#include <sstream>
#include <algorithm>
#include <set>
#include <map>
#include <stack>
#include <cmath>
#include <regex>
#include <iomanip>
#include <climits>
#include <utility>
#include <queue>
using namespace std;
using ll = long long int;
using dd = long double;
const ll MOD = 1e9 + 7;
const dd PI = 3.1415926435;
class UnionFind
{
public:
UnionFind(int N) : par(N)
{
for (ll i = 0; i < N; i++)
{
par[i] = i;
}
}
int root(int x)
{
if (par[x] == x)
return x;
return par[x] = root(par[x]);
}
void unite(int x, int y)
{
int rx = root(x);
int ry = root(y);
if (rx == ry)
return;
par[rx] = ry;
}
bool same(int x, int y)
{
int rx = root(x);
int ry = root(y);
return rx == ry;
}
private:
vector<int> par;
};
ll gcd(ll a, ll b)
{
if (a % b == 0)
{
return b;
}
return gcd(b, a % b);
}
ll fact(ll n)
{
if (n == 0)
{
return 1;
}
if (n == 1)
{
return 1;
}
return n * fact(n - 1) % MOD;
}
ll pow_fast(ll n, ll k)
{
if (k == 0)
{
return 1;
}
if (k == 1)
{
return n;
}
if (k % 2 == 0)
{
ll tmp = pow_fast(n, k / 2LL);
return tmp * tmp % MOD;
}
else
{
ll tmp = pow_fast(n, k / 2LL);
tmp *= tmp;
tmp %= MOD;
return tmp * n % MOD;
}
}
map<ll, ll> sosuu(ll n)
{
map<ll, ll> res;
for (ll i = 2; i * i <= n; i++)
{
while (n % i == 0)
{
res[i] += 1;
n /= i;
}
}
if (n != 1)
{
res[n] += 1;
}
return res;
}
struct Dish
{
ll time;
ll taste;
};
int main()
{
ll N;
cin >> N;
ll D, X;
cin >> D >> X;
ll sum = 0;
for (ll i = 0; i < N; i++)
{
ll ai;
cin >> ai;
sum += ((D - 1) / ai + 1);
}
cout << (sum + X) << endl;
}
| 0 | 24,605,682 |
#include <bits/stdc++.h>
#define BPhuong ""
#define maxn 100005
#define maxm
#define fi(i,a,b) for(int i = a; i<= b; i++)
#define fid(i,a,b) for(int i = a; i>= b; i--)
#define se second
#define f first
#define ll long long
#define pii pair<int, int>
#define pb push_back
#define bit(x, i) ((x>>i)&1)
#define oo 1e9
struct data{
int x, y, z;
};
using namespace std;
int n, pa[maxn], mod;
ll l[maxn][2];
vector <int> a[maxn];
void dfs(int u)
{
l[u][1] = 1;
l[u][0] = 1;
for(int i = 0; i < a[u].size(); i++)
{
int v = a[u][i];
if(pa[u] != v)
{
pa[v] = u;
dfs(v);
l[u][0] *= ( (l[v][1] + l[v][0]) % mod );
l[u][1] *= l[v][0];
l[u][0] %= mod;
l[u][1] %= mod;
}
}
}
void nhap(){
ios_base::sync_with_stdio(0);
cin.tie(NULL);cout.tie(NULL);
cin >> n;
mod = 1e9 + 7;
fi(i, 1, n-1)
{
int u, v;
cin >> u >> v;
a[u].pb(v);
a[v].pb(u);
}
}
void xuli(){
dfs(1);
cout << ( l[1][0] + l[1][1]) % mod;
}
int main(){
nhap();
xuli();
}
|
#include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1000000007;
typedef int64_t ll;
typedef uint64_t ull;
#define FOR(i, start, end) for(uint64_t i=start; i<end; i++)
#define REP(i, n) FOR(i, 0, n)
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;
while (m % n != 0){
temp = n;
n = m % n;
m = temp;
}
return n;
}
uint64_t lcm(uint64_t m, uint64_t n) {
uint64_t g = gcd(m,n);
if(m%g==0) return (m/g)*n;
if(n%g==0) return (n/g)*m;
return (m*n)/gcd(m,n);
}
void comb(vector<vector <uint64_t> > &v){
for(uint64_t i = 0;i <v.size(); i++){
v[i][0]=1;
v[i][i]=1;
}
for(uint64_t k = 1;k <v.size();k++){
for(uint64_t j = 1;j<k;j++){
v[k][j]=(v[k-1][j-1]+v[k-1][j]);
}
}
}
bool is_product_overflow(uint64_t a, uint64_t b) {
uint64_t prod = a * b;
return (prod / b != a);
}
void primeFactorization(uint64_t a, list<uint64_t> &factors){
long i,sq;
if(a%2==0){
factors.push_back(2);
primeFactorization(a/2,factors);
return;
}
sq = sqrt(a);
for(i=3;i<=sq;i+=2){
if(a%i==0){
factors.push_back(i);
primeFactorization(a/i,factors);
return;
}
}
if(a!=1){
factors.push_back(a);
}
}
int64_t modinv(int64_t a, int64_t m) {
int64_t b = m, u = 1, v = 0;
while (b) {
int64_t t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
signed main() {
int n,m;
cin >> n >> m;
int graph[8][8] = {};
int a,b;
for(int i=0;i<m;i++){
cin >> a >> b; a--;b--;
graph[a][b] = 1;
graph[b][a] = 1;
}
vector<int> path;
for(int i=1;i<n;i++){
path.push_back(i);
}
int count = 0;
do{
if(graph[0][path[0]]==0){
continue;
}
bool found = true;
for(int i=1;i<n-1;i++){
if(graph[path[i]][path[i-1]]==0){
found = false;
break;
}
}
if(found){
count++;
}
}while(next_permutation(path.begin(),path.end()));
cout << count << endl;
return 0;
}
| 0 | 22,021,480 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string a, b, c;
cin >> a >> b >> c;
if(*(a.end()-1) == *(b.begin()) && *(b.end()-1) == *(c.begin()))
printf("YES\n");
else printf("NO\n");
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, n) FOR(i, 0, n)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define ALLR(obj) (obj).rbegin(), (obj).rend()
#define DIV(a, b) ((a - 1) / b + 1)
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, Q;
cin >> N >> Q;
vector<vector<int>> G(N + 1);
REP(i, N - 1) {
int a, b;
cin >> a >> b;
G[a].emplace_back(b);
G[b].emplace_back(a);
}
vector<int> ans(N + 1);
while (Q--) {
int p, q;
cin >> p >> q;
ans[p] += q;
}
queue<int> que;
que.push(1);
bitset<200001> bs;
bs.set(1);
while (!que.empty()) {
int t = que.front();
que.pop();
for (auto &x : G[t]) {
if (!bs[x]) {
bs.set(x);
ans[x] += ans[t];
que.push(x);
}
}
}
FOR(i, 1, N + 1) { cout << ans[i] << (i == N ? "\n" : " "); }
return 0;
}
| 0 | 37,681,510 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;
template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (int i=(int)from; i<(int)to; i++)
#define all(vec) vec.begin(), vec.end()
#define rep(i,N) repr(i,0,N)
#define per(i,N) for (int i=(int)N-1; i>=0; i--)
const ll MOD = pow(10,9)+7;
const ll LLINF = pow(2,61)-1;
const int INF = pow(2,30)-1;
vector<ll> fac;
void c_fac(int x=pow(10,6)+10) { fac.resize(x,true); rep(i,x) fac[i] = i ? (fac[i-1]*i)%MOD : 1; }
ll inv(ll a, ll m=MOD) { ll b = m, x = 1, y = 0; while (b!=0) { int d = a/b; a -= b*d; swap(a,b); x -= y*d; swap(x,y); } return (x+m)%m; }
ll nck(ll n, ll k) { return fac[n]*inv(fac[k]*fac[n-k]%MOD)%MOD; }
ll gcd(ll a, ll b) { if (a<b) swap(a,b); return b==0 ? a : gcd(b, a%b); }
ll lcm(ll a, ll b) { return a/gcd(a,b)*b; }
int main() {
ll dig = 1;
char response = ' ';
while (response!='N'&&dig<powl(10,10)) {
dig *= 10;
cout << "? " << dig << endl;
cin >> response;
}
ll result = 0;
if (dig!=powl(10,10)) {
ll l = dig/100, r = dig/10-1;
while (l!=r) {
ll mid = (l+r+1)/2;
cout << "? " << mid << endl;
cin >> response;
if (response=='Y') l = mid;
else r = mid-1;
}
ll d10 = l*10, d1 = 10;
response = ' ';
while (response!='N'&&d1>0) {
d1--;
cout << "? " << (d10+(d1-1))*10 << endl;
cin >> response;
}
result = d10+d1;
}
else {
ll now = 1;
response = ' ';
while (response!='Y') {
now *= 10;
cout << "? " << now-1 << endl;
cin >> response;
}
result = now/10;
}
cout << "! " << result << endl;
return 0;
}
|
#include<iostream>
#include<string.h>
using namespace std;
long long sin[100001];
int main(){
while(1){
memset(sin,0,sizeof(sin));
int n,k;
int i,j,max=0,x;
cin>>n>>k;
if(n==0&&k==0)break;
for(i=0;i<n;i++){
cin>>sin[i];
}
for(i=0;i<n-k+1;i++){
x=0;
for(j=0;j<k;j++){
x+=sin[i+j];
}
if(max<x)max=x;
}
cout<<max<<endl;
}
}
| 0 | 40,676,655 |
#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
int main(){
string str, order, p, print_str;
int ordr_num, start, end;
cin >> str;
cin >> ordr_num;
for(int i=0;i<ordr_num;i++){
cin>>order;
if(order == "replace"){
cin >> start >> end >> p;
str.erase(start, end - start + 1);
str.insert(start, p, 0, end - start + 1);
}else if(order == "reverse"){
cin >> start >> end;
reverse(str.begin()+start, str.begin()+end+1);
}else if(order == "print"){
cin >> start >> end;
print_str = str.substr(start, end - start + 1);
cout << print_str << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(int)(n); i<i##_len; i++)
#define reps(i,n) for(int i=1 , i##_len=(int)(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 repi(i,x) for(auto i=(x).begin(),i##_fin=(x).end();i!=i##_fin;i++)
#define all(x) (x).begin(), (x).end()
#define input(array) repi(array##_itr, array) { cin >> *(array##_itr); }
#define F first
#define S second
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
string solve(bool a) { return ((a) ? ">" : "<"); }
typedef vector<int> Vi;
typedef vector<Vi> VVi;
typedef pair<int , int> Pi;
typedef vector<Pi> VPi;
typedef vector<long long> V;
typedef vector<V> VV;
typedef pair<long long , long long> P;
typedef vector<P> VP;
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 INFLL = 1LL<<60;
const int INF = 1<<30;
const double PI=acos(-1);
int main(){
char x,y;
int ans=0;
cin >>x>>y;
if (x == y) {
cout << "=" << endl;
return 0;
} else {
cout << solve(x > y) << endl;
}
}
| 0 | 82,438,316 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<long long,long long> pll;
#define ep emplace_back
#define pb push_back
#define mp make_pair
#define rep(i,n) for(int i=0;i<(n);++i)
#define all(v) v.begin(), v.end()
#define revall(v) v.rbegin(), v.rend()
constexpr int mod=1000000007;
constexpr int mod1=998244353;
vector<int> dx={0,1,0,-1},dy={-1,0,1,0};
bool inside(int y,int x,int h,int w){ if(y<h && y>=0 && x<w && x>=0) 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> inline bool chmax(T& a, T b){ if(a < b){ a = b; return true; } return false; }
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n,z,w;cin >> n >> z >> w;
vector<int> a(n);
rep(i,n) cin >> a.at(i);
if(n == 1){
cout << abs(a.at(0) - w) << endl;
return 0;
}
int ans = max(abs(a.at(n - 1) - w), abs(a.at(n - 2) - a.at(n - 1)));
cout << ans << endl;
}
|
#include "bits/stdc++.h"
#define rep(i,b) for(ll i=0;i<b;i++)
#define ll long long
using namespace std;
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vvvl vector<vector<vector<ll>>>
#define debug(x) cerr<<#x<<" "<<x<<'\n';
bool cmp(pair<ll,ll> a, pair<ll,ll> b) { return a.second > b.second; }
ll mod = 1e9+7;
signed main() {
ll n; cin>>n;
vector<pair<ll,ll>>a(n),b(n);
rep(i,n)cin>>a[i].first>>a[i].second;
rep(i,n)cin>>b[i].first>>b[i].second;
sort(a.begin(),a.end(),cmp);
sort(b.begin(),b.end());
rep(i, n) {
int bx = b[i].first, by = b[i].second;
rep(i,a.size()){
int ax=a[i].first,ay=a[i].second;
if(ax<bx&&ay<by){
a.erase(a.begin()+i);
break;
}
}
}
cout << n-a.size() << endl;
}
| 0 | 23,604,416 |
#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(){
int x;cin>>x;
int l=360/__gcd(x,360)*x;
int ans=l/x;
cout<<ans<<endl;
}
|
#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 MAX 5100000
using namespace std;
using Edge=pair<ll,ll>;
using Graph=vector<vector<int>>;
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<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
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;}
ll power(ll a,ll b){
ll res=1;
while(b>0){
if(b&1) res=res*a%MOD;
a=a*a%MOD;
b>>=1;
}
return res;
}
int main(){
ll N,K,ans=0;
cin>>N>>K;
ll CNT[K+1];
RREP(i,K) CNT[i]=0;
for(ll i=K; i>0; --i){
ll cnt=0;
cnt+=power(K/i,N);
for(ll j=2; j<=K/i; ++j){
cnt-=CNT[j*i];
}
cnt%=MOD;
if(cnt<0) cnt+=MOD;
CNT[i]=cnt;
ans+=i*CNT[i];
ans%=MOD;
}
co(ans);
return 0;
}
| 0 | 5,196,659 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
int main() {
int n;
while (cin >> n) {
if (n == 0) {
break;
}
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
int ans = a[1] - a[0];
for (int i = 0; i < n - 1; i++) {
ans = min(ans, a[i + 1] - a[i]);
}
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void debug() {cout<<endl;}
template<typename T,typename... Args>
void debug(T x,Args... args) {cout<<x<<" ";debug(args...);}
#define forn(i,a,b) for(int i=a;i<b;++i)
#define SZ(x) int(x.size())
#define pb push_back
#define F first
#define S second
#define endl "\n"
typedef long long ll;
typedef pair<int, int> pii;
int main() {
ios::sync_with_stdio(0); cin.tie(0);
int a, b, k;
cin >> a >> b >> k;
int g = __gcd(a, b);
vector<int> ans;
forn(i, 1, g+1) {
if (g%i == 0) {
ans.pb(i);
}
}
cout << ans[SZ(ans)-k] << endl;
}
| 0 | 36,907,588 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
using namespace std;
int main() {
int n,m;
cin>>n>>m;
int a[m],total=0;
rep(i,m){
cin>>a[i];
total+=a[i];
}
if(total>n) cout<<"-1"<<endl;
else cout<<n-total<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define MOD 1000000007
#define PI 3.1415926535
int main(void)
{
ll q, h, s, d, n;
cin >> q >> h >> s >> d >> n;
n *= 4;
ll DP[9] = {};
DP[0] = 0;
DP[1] = q;
for (int i = 2; i <= 8; i++){
if (i < 4){
DP[i] = min(DP[i - 1] + q, DP[i - 2] + h);
continue;
}
if (i < 8)
{
DP[i] = min(DP[i - 1] + q, DP[i - 2] + h);
DP[i] = min(DP[i], DP[i - 4] + s);
continue;
}
DP[i] = min(DP[i - 1] + q, DP[i - 2] + h);
DP[i] = min(DP[i], DP[i - 4] + s);
DP[i] = min(DP[i], DP[i - 8] + d);
}
ll ans = DP[8] * (n / 8) + DP[n % 8];
cout << ans << endl;
return 0;
}
| 0 | 48,730,190 |
#include <iostream>
#include <array>
#include <algorithm>
#include <vector>
#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>
const int INF = 1e9;
int main() {
std::cin.tie(0);
std::ios::sync_with_stdio(false);
int k;
std::cin >> k;
std::vector< std::vector< std::pair<int, int> > > edges(k);
for (int i = 0; i < k; i++) {
edges[i].emplace_back((i + 1) % k, 1);
if (i != 10 * i % k) edges[i].emplace_back(10 * i % k, 0);
}
std::deque<int> deq;
std::vector<int> d(k, INF);
d[1] = 0;
deq.emplace_back(1);
while (!deq.empty()) {
int v = deq.front(); deq.pop_front();
for (std::pair<int, int> e: edges[v]) {
if (d[e.first] > d[v] + e.second) {
d[e.first] = d[v] + e.second;
if (e.second == 0) deq.emplace_front(e.first);
else deq.emplace_back(e.first);
}
}
}
std::cout << d[0] + 1 << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
ll ans;
ll mi = 1e18;
int main() {
cin >> n;
bool f = 1;
for (int i = 0; i < n; i++) {
ll a,b;
cin >> a >> b;
ans += a;
if (a != b) f = 0;
if (a > b) mi = min(mi, b);
}
if (f) {
cout << 0 << endl;
return 0;
}
cout << ans - mi << endl;
return 0;
}
| 0 | 38,474,524 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef double db;
typedef vector <ll> vll;
typedef pair <ll, ll> pll;
#define pb push_back
#define mp make_pair
#define MAX 1000000
#define mod 1000000007
#define all(_) _.begin(), _.end()
#define F first
#define S second
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
int main()
{
ios_base :: sync_with_stdio(false);
cin.tie(NULL), cout.tie(NULL);
ll n, i, ans = 0, u, v;
cin >> n;
for(i = 1; i <= n; i++)
ans += i * (n - i + 1);
for(i = 0; i < n - 1; i++)
{
cin >> u >> v;
if(u > v)
swap(u, v);
ans -= u * (n - v + 1);
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define vii vector<int>
#define pii pair<int,int>
#define pll pair<long long,long long>
#define pdd pair<double,double>
#define pldld pair<long long double, long long double>
#define ff first
#define ss second
#define pb push_back
#define read freopen("alu.txt","r",stdin);
#define write freopen("vorta.txt","w",stdout);
#define fastio ios::sync_with_stdio(false); cin.tie(NULL);
#define PI 2*acos(0.0)
#define eps 1e-11
#define DEBUG(x) cerr << #x << " = " << x << endl
const int MAX = 2e5 + 5, MOD = 1e9 + 7 , MAXLG = log2(MAX)+1;
const ll inf = 1e18 + 5;
int arr[MAX];
int main(){
fastio;
int n;
cin >> n;
vector<int> a(n+5), b(n+5);
int gap = n+5;
for(int i=1; i<=n; i++) a[i] = gap * i;
for(int i=n; i>0; i--) b[i] = gap * (n-i+1);
int inc = 1;
for(int i=0; i<n; i++){
int p;
cin >> p;
b[p] += inc;
inc++;
}
for(int i=1; i<=n; i++) cout << a[i] << " ";
cout << "\n";
for(int i=1; i<=n; i++) cout << b[i] << " ";
cout << "\n";
}
| 0 | 63,750,380 |
#include <cstdio>
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#define rep(i,n) for (int i=0;i<n;i++)
using ll = long long;
using namespace std;
void solve(){
}
int main (){
ios::sync_with_stdio(0);
cin.tie(0);
ll n,y;
cin >> n >> y;
y/=1000;
for(ll i=0;i<=n;i++){
for(ll j=0;j<=n;j++){
if(n-i-j<0) continue;
if(10*i + 5*j + (n-i-j) == y){
cout << i << " " << j << " " << n-i-j << endl;
return 0;
}
}
}
cout << -1 << " " << -1 << " " << -1 << endl;
return 0;
}
|
#include <iostream>
#include <vector>
int main(){
using namespace std;
int h,w,i,j,k;
vector<int> v;
h = 1;
w = 1;
while(h!=0||w!=0){
cin >> h >> w;
if(h==0&&w==0){
break;
}
v.push_back(h);
v.push_back(w);
}
int size = v.size();
for(i=0;i<(size/2);i++){
h = v[2*i];
w = v[2*i+1];
for(j=0;j<h;j++){
for(k=0;k<w;k++){
cout << "#";
}
cout << endl;
}
cout << endl;
}
return 0;
}
| 0 | 59,326,769 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (int i = int(n); i >= 0; i--)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define repic(i, a, b) for (int i = int(a); i <= int(b); i++)
#define each(x, y) for (auto &x : y)
#define all(a) (a).begin(), (a).end()
#define bit32(x) (1 << (x))
#define bit64(x) (1ll << (x))
using namespace std;
using i32 = int;
using i64 = long long;
using f80 = long double;
using vi32 = vector<i32>;
using vi64 = vector<i64>;
using vf80 = vector<f80>;
using vstr = vector<string>;
inline void yes() { cout << "Yes" << '\n'; exit(0); }
inline void no() { cout << "No" << '\n'; exit(0); }
inline i64 gcd(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); if (a % b == 0) return b; return gcd(b, a % b); }
inline i64 lcm(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); return a / gcd(a, b) * b; }
template <typename T> class pqasc : public priority_queue<T, vector<T>, greater<T>> {};
template <typename T> class pqdesc : public priority_queue<T, vector<T>, less<T>> {};
template <typename T> inline void amax(T &x, T y) { if (x < y) x = y; }
template <typename T> inline void amin(T &x, T y) { if (x > y) x = y; }
template <typename T> inline T exp(T x, i64 n, T e = 1) { T r = e; while (n > 0) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; }
template <typename T> istream& operator>>(istream &is, vector<T> &v) { each(x, v) is >> x; return is; }
template <typename T> ostream& operator<<(ostream &os, vector<T> &v) { rep(i, v.size()) { if (i) os << ' '; os << v[i]; } return os; }
void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(16); solve(); return 0; }
vstr memo;
int n;
bool rec(int l, int r) {
string ls, rs;
if (memo[l] != "") {
ls = memo[l];
} else {
cout << l << endl;
cin >> ls;
memo[l] = ls;
if (ls[0] == 'V') return true;
}
if (memo[r] != "") {
rs = memo[r];
} else {
cout << r << endl;
cin >> rs;
memo[r] = rs;
if (rs[0] == 'V') return true;
}
if (((r - l) % 2 == 1) && ls != rs ||
((r - l) % 2 == 0) && ls == rs) {
return false;
}
if (rec(l, (l + r) / 2)) return true;
if (rec((l + r) / 2, r)) return true;
return false;
}
void solve() {
cin >> n;
memo.assign(n, "");
rec(0, n - 1);
}
|
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <queue>
#include <algorithm>
#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;
int main(void) {
int n;
map<char, char> m;
while (cin >> n && n > 0) {
m.clear();
REP(i, n) {
char c1, c2;
cin >> c1 >> c2;
m[c1] = c2;
}
cin >> n;
REP(i, n) {
char c;
cin >> c;
if (m.find(c) == m.end())
cout << c;
else
cout << m[c];
}
cout << endl;
}
return 0;
}
| 0 | 99,685,884 |
#include <stdio.h>
int main(void){
int a,b,d,r;
double f;
scanf("%d %d\n", &a, &b);
d = a/b;
r = a%b;
f = 1.0 * a/b ;
printf("%d ",d);
printf("%d ",r);
printf("%.8lf\n",f);
return 0;
}
|
#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
using namespace std;
const long MOD = 1000000007;
typedef pair<int, int> P;
typedef long long ll;
int main(){
int N, D, A;
cin >> N >> D >> A;
int X[N], H[N];
P p[N];
for(int i=0; i<N; i++){
int a, b;
cin >> a >> b;
p[i] = P(a, b);
}
sort(p, p+N);
for(int i=0; i<N; i++){
X[i] = p[i].first;
H[i] = p[i].second;
}
ll ans = 0;
int sum[N+1];
fill(sum ,sum+N+1, 0);
for(int i=1; i<=N; i++){
sum[i] += sum[i-1];
if(H[i-1] <= sum[i]) continue;
int rest = H[i-1] - sum[i];
int cnt;
if(rest%A == 0) cnt = rest / A;
else cnt = rest/A + 1;
ans = ans + cnt;
sum[i] += A*cnt;
int right = lower_bound(X, X+N, X[i-1]+2*D+1) - X;
sum[right+1] -= A*cnt;
}
cout << ans << endl;
return 0;
}
| 0 | 7,254,502 |
#include <bits/stdc++.h>
#define INF 1000000001
using namespace std;
int main()
{
int n;
cin.sync_with_stdio(false);
cin >> n;
vector<int> dp(n + 1, INF);
for (int i = 0, a; i < n; i++) {
cin >> a;
*lower_bound(dp.begin(), dp.end(), a) = a;
}
cout << lower_bound(dp.begin(), dp.end(), INF) - dp.begin() << endl;
return 0;
}
|
#include<iostream>
#include<algorithm>
#include<numeric>
int const num[9] = {1, 7, 4, 5, 3, 2, 9, 6, 8};
int const cnt[9] = {2, 3, 4, 5, 5, 5, 6, 6, 7};
int const MAXN = 10000;
int n[6], c[6], M, N;
bool use[6];
int count[6], ctmp[6], ix[6], maxv;
void search(int nn, int m) {
if(m == M && nn > 0) return;
if(nn > 0) {
for(int i = 0; i*c[m] <= nn; ++i) {
ctmp[m] = i;
search(nn - i*c[m], m+1);
}
return;
}
int res = 0;
for(int i = 0; i < M; ++i) for(int j = 0; j < ctmp[ix[i]]; ++j) {
res = res*10 + n[ix[i]];
}
if(res > maxv) {
maxv = res;
std::copy(ctmp, ctmp+M, count);
}
}
void calc() { maxv = 0; search(N, 0); }
int main() {
std::cin >> N >> M;
std::fill(use, use+6, false);
std::fill(n, n+6, 0);
for(int i = 0; i < M; ++i) {
int a;
std::cin >> a;
switch(a) {
case 1:
use[0] = true; n[0] = a; break;
case 7:
use[1] = true; n[1] = a; break;
case 4:
use[2] = true; n[2] = a; break;
case 2: case 3: case 5:
use[3] = true; n[3] = std::max(n[3], a); break;
case 6: case 9:
use[4] = true; n[4] = std::max(n[4], a); break;
case 8:
use[5] = true; n[5] = a;
}
}
M = 0;
for(int i = 0; i < 6; ++i) if(use[i]) {
n[M] = n[i];
c[M] = i+2;
++M;
}
int k = 0;
if(N > (c[0]-1)*6) {
k = (N - (c[0]-1)*6)/c[0];
N -= k*c[0];
}
std::iota(ix, ix+M, 0);
std::sort(ix, ix+M, [](int l, int r){ return n[l] > n[r]; });
calc();
count[0] += k;
for(int i = 0; i < M; ++i) {
char ch = '0' + n[ix[i]];
for(int j = 0; j < count[ix[i]]; ++j) std::cout << ch;
}
std::cout << std::endl;
return 0;
}
| 0 | 15,421,563 |
#include <iostream>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <string>
using namespace std;
int main() {
int a[5];
for(int i= 0;i<5;i++) cin >>a[i];
int sai = 10;
int soko = 0;
for(int i= 0;i<5;i++){
if(a[i]%10 == 0)continue;
if(a[i]%10 <= sai){
sai = a[i]%10;
soko = i;
}
}
for(int i = 0;i<5;i++){
if(i == soko) continue;
if(a[i]%10 == 0) continue;
a[i] += 10-a[i]%10;
}
int g = 0;
for(int i= 0;i<5;i++) g+= a[i];
cout<<g;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
vector<ll> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int i = 1; i <= N; i++) {
A[i] -= i;
}
sort(A.begin(), A.end());
ll x = A[N/2];
ll ans = 0;
for (int i = 0; i < N; i++) {
ans += abs(A[i]-x);
}
cout << ans << endl;
}
| 0 | 8,327,652 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
using namespace std;
int main(){
int n,k;
cin >> n >> k;
vector<int> d(n);
rep(i,k){
int m;
cin >> m;
rep(j,m){
int a;
cin >> a;
d[a-1] = 1;
}
}
int ans = 0;
rep(i,n)if(d[i] == 0)ans++;
cout << ans << endl;
return 0;
}
|
const int isDebugMode = 0;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<long long, long long> P;
struct edge{long long to,cost;};
const int inf = 1 << 27;
const long long INF = 1LL << 60;
const int COMBMAX = 1001001;
const long long MOD = 1000000007;
const long long dy[] = {-1, 0, 0, 1};
const long long dx[] = {0, -1, 1, 0};
string abc = "abcdefghijklmnopqrstuvwxyz";
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define eachdo(v, e) for (const auto &e : (v))
#define all(v) (v).begin(), (v).end()
#define lower_index(v, e) (long long)distance((v).begin(), lower_bound((v).begin(), (v).end(), e))
#define upper_index(v, e) (long long)distance((v).begin(), upper_bound((v).begin(), (v).end(), e))
long long mpow(long long a, long long n, long long mod = MOD){long long res = 1; while(n > 0){if(n & 1)res = res * a % mod; a = a * a % mod; n >>= 1;} return res;}
void pt(){cout << endl; return;}
template<class Head> void pt(Head&& head){cout << head; pt(); return;}
template<class Head, class... Tail> void pt(Head&& head, Tail&&... tail){cout << head << " "; pt(forward<Tail>(tail)...);}
void dpt(){if(!isDebugMode) return; cout << endl; return;}
template<class Head> void dpt(Head&& head){if(!isDebugMode) return; cout << head; pt(); return;}
template<class Head, class... Tail> void dpt(Head&& head, Tail&&... tail){if(!isDebugMode) return; cout << head << " "; pt(forward<Tail>(tail)...);}
template<class T> void debug(T v){if(!isDebugMode) return; rep(i, v.size()) cout << v[i] << " " ; cout << endl;}
template<class T> void debug2(T v){if(!isDebugMode) return; rep(i, v.size()){rep(j, v[i].size()) cout << v[i][j] << " " ; cout << endl;}}
template<class T1, class T2> inline bool chmin(T1 &a, T2 b){if(a > b){a = b; return true;} return false;}
template<class T1, class T2> inline bool chmax(T1 &a, T2 b){if(a < b){a = b; return true;} return false;}
template<class T1, class T2> long long gcd(T1 a, T2 b){return a % b ? gcd(b , a % b) : b;}
template<class T1, class T2> void reduce(T1 &a, T2 &b){ll g = gcd(a, b); a /= g; b /= g; return;}
bool valid(long long H, long long W, long long h, long long w) { return 0 <= h && h < H && 0 <= w && w < W; }
int main(){
string S; cin >> S;
string cba = abc;
reverse(all(cba));
if (S == cba){
pt(-1);
return 0;
}
if(S.size() == 26){
for(ll i = 25; 0 < i; i--){
if(S[i] - 'a' > S[i - 1] - 'a'){
ll lim = S[i - 1] - 'a';
ll cnt = INF;
for(ll j = i; j < 26; j++){
if(lim < S[j] - 'a') chmin(cnt, S[j] - 'a');
}
S[i - 1] = abc[cnt];
pt(S.substr(0, i));
return 0;
}
}
}else{
for(auto e : abc){
if(find(all(S), e) == S.end()){
S += e;
pt(S);
return 0;
}
}
}
return 0;
}
| 0 | 28,824,569 |
#include "bits/stdc++.h"
using namespace std;
#define Would
#define you
#define all(n) n.begin(),n.end()
const long long INF = 1e18;
const long long MOD = 1e9 + 7;
const double pi = acos(-1);
const int SIZE = 1 << 17;
int dx[] = { 1,0,-1,0 }, dy[] = { 0,1,0,-1 }, alp[30];
long long fac[200005], finv[200005], inv[200005];
vector<long long>dij;
struct edge { long long to, cost; };
vector<vector<edge> >G;
long long mod_pow(long long a, long long b) {
long long res = 1, mul = a;
for (int i = 0; i < 31; ++i) {
if (b >> i & 1) {
res *= mul;
res %= MOD;
}
mul = (mul * mul) % MOD;
}
return res;
}
void addedge(int from, int to, int cost) {
G[from].push_back({ to,cost });
G[to].push_back({ from,cost });
}
int main() {
vector<int>v;
for (int i = 0; i < 5; ++i) {
int n;
cin >> n;
v.push_back(n);
}
sort(v.rbegin(), v.rend());
for (int i = 0; i < v.size(); ++i) {
cout << v[i];
if (i != v.size() - 1) { cout << " "; }
}
cout << endl;
}
|
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
int main() {
int N;
cin >> N;
string S;
cin >> S;
int ans = 0;
for (int ii = 0; ii < 10; ++ii){
for (int jj = 0; jj < 10; ++jj){
for (int kk = 0; kk < 10; ++kk){
vector <int> v;
v.push_back(ii);
v.push_back(jj);
v.push_back(kk);
int idx = 0;
for (int ss = 0; ss < N; ++ss){
int num = S[ss] - '0';
if (v[idx]==num){
idx++;
if (idx==3){
break;
}
}
}
if (idx==3){
ans++;
}
}
}
}
cout << ans << "\n";
return 0;
}
| 0 | 77,965,772 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <string>
#include <math.h>
#define ll long long
#define vl vector<ll>
#define vvl vector<vector<ll> >
#define vvvl vector<vector<vector<ll> > >
#define vd vector<double>
#define vvd vector<vector<double> >
#define vvvd vector<vector<vector<double> > >
#define mod 1000000007
using namespace std;
int main(){
ll n, k; cin >> n >> k;
ll ans = 0, e = 0,o = 0;
for (ll i = k % 2 ? 2 : 1; (i*k)/2 <= n; i+= k % 2 ? 2 : 1){
if (i % 2) o++;
else e++;
}cout << (ll)(pow(o, 3) + pow(e, 3)) << endl;
return 0;
}
|
#include <stdio.h>
#define mod 1000000007
typedef long long ll;
int main(void) {
ll i, j, n, ans = 1;
scanf("%lld", &n);
ll t[n], a[n];
bool bt[n], ba[n];
for(i = 0; i < n; ++i) scanf("%lld", &t[i]), bt[i] = false;
for(i = 0; i < n; ++i) scanf("%lld", &a[i]), ba[i] = false;
bt[0] = ba[n - 1] = true;
for(i = 1; i < n; ++i) if(t[i] != t[i - 1]) bt[i] = true;
for(i = n - 2; i >= 0; --i) if(a[i] != a[i + 1]) ba[i] = true;
for(i = 0; i < n; ++i) {
if(bt[i] && ba[i]) {
if(a[i] != t[i]) ans = 0;
} else if(bt[i]) {
if(t[i] > a[i]) ans = 0;
} else if(ba[i]) {
if(a[i] > t[i]) ans = 0;
} else {
ans *= a[i] < t[i] ? a[i] : t[i];
}
ans %= mod;
}
printf("%lld", ans);
return 0;
}
| 0 | 36,203,686 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define FOR(i,a,n) for(ll i=a;i<(ll)(n);i++)
int main(){
int N;
cin>>N;
int h[N];
rep(i, N) cin>>h[i];
int max = h[0];
int min = h[0];
int count = 0;
FOR(i, 1, N){
max = std::max(max, h[i]);
min = std::min(min, h[i]);
if(h[i-1] == h[i]) h[i-1] = max;
if(i < N-1 && h[i-1] > h[i] && h[i] < h[i+1]){
count += max - h[i];
max = h[i];
min = h[i];
}
if(i == N-1){
count += max;
}
}
if(N == 1) count = h[0];
cout << count << endl;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int n;
cin >> n;
vector<int> h(n+1);
rep(i,n) cin >> h[i+1];
vector<int> dp(n+1,0);
for(int i = 1; i <= n; i++){
if(i==1){
dp[i] = 0;
continue;
}
if(i==2){
dp[i] = abs(h[i] - h[i - 1]);
continue;
}
int cost1 = dp[i-1] + abs(h[i] - h[i-1]);
int cost2 = dp[i-2] + abs(h[i] - h[i-2]);
dp[i] = min(cost1,cost2);
}
cout << dp[n] << endl;
return 0;
}
| 0 | 24,186,997 |
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <list>
#include <set>
#include <map>
#include <bitset>
using namespace std;
int main() {
int N; cin >> N;
vector<int> v;
for (int i = 0; i < N; i++) {
int a; cin >> a; v.push_back(a);
}
sort(v.begin(), v.end(), greater<int>());
int length = v[0];
int* count = new int[length + 1];
for (int i = 0; i <= length; i++) {
count[i] = 0;
}
for (auto itr = v.begin(); itr != v.end(); itr++) {
count[*itr]++;
}
if (length % 2 == 0) {
for (int i = length; i > length / 2; i--) {
if (count[i] < 2) { cout << "Impossible" << endl; return 0; }
}
if (count[length / 2] != 1) { cout << "Impossible" << endl; return 0; }
}
else {
for (int i = length; i * 2 > length + 2; i--) {
if (count[i] < 2) { cout << "Impossible" << endl; return 0; }
}
if (count[(length + 1) / 2] != 2) { cout << "Impossible" << endl; return 0; }
}
cout << "Possible" << endl;
return 0;
}
|
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<map>
#include<unordered_map>
#include<set>
#include<bitset>
using namespace std;
#define REP(i,m,n) for(int i=(int)m ; i < (int) n ; i++ )
#define rep(i,n) REP(i,0,n)
typedef long long ll;
typedef pair<int,int> pint;
typedef pair<ll,int> pli;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
const ll mod=1e9+7 ;
const ll mod2=1e9+9 ;
int dx[4]={1,0,-1,0} , dy[4]={0,1,0,-1} ;
int main(){
ll h,w;
cin>>h>>w;
vector<pli> v;
rep(i,h){
ll x;cin>>x;
v.push_back({x,0});
}
rep(i,w){
ll x;cin>>x;
v.push_back({x,1});
}
h++;w++;
sort(v.begin(),v.end());
ll ans=0;
for(auto x:v){
if(x.second){
ans+=h*x.first;
w--;
}
else {
ans+=w*x.first;
h--;
}
}
cout<<ans<<endl;
return 0;
}
| 0 | 22,557,463 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
int main(){
int a,b,c;
cin >> a >> b >> c;
cout << max(max(a,b),c)*10 + a + b + c - max(max(a,b),c) << endl;
return 0;
}
|
#include <cstdio>
#define MAX 10
int* sort(int* array);
int main(){
int array[MAX];
for(int i = 0; i < MAX; i++){
array[i] = 0;
scanf("%d", &array[i]);
}
sort(array);
for(int i = MAX - 1; i > 6; i--){
printf("%d\n", array[i]);
}
return 0;
}
int* sort(int* array){
int temp = 0;
for(int i = 0; i < MAX; i++){
for(int j = 0; j < MAX - i - 1; j++){
if(array[j] > array[j + 1]){
temp = array[j];
array[j] = array[j + 1];
array[j + 1] = temp;
}
}
}
return array;
}
| 0 | 90,274,964 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep2(i,s,n) for(int i=(int)(s);i<(int)(n);i++)
typedef long long ll;
const int INF = 1e+9+7;
const int H_MAX = 510;
const int W_MAX = 510;
int H,W;
vector<vector<int>> a(H_MAX,vector<int>(W_MAX,0));
int main(){
string S,T;
cin >> S >> T;
vector<int> cnt_s(26),cnt_t(26);
rep(i,S.size()){
cnt_s[S[i]-'a']++;
cnt_t[T[i]-'a']++;
}
sort(cnt_s.begin(),cnt_s.end());
sort(cnt_t.begin(),cnt_t.end());
rep(i,26){
if(cnt_s[i]!=cnt_t[i]){
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
}
|
#include <iostream>
#include <vector>
#include <set>
#include <string>
#include <algorithm>
#include <queue>
#include <utility>
#include <climits>
#include <bitset>
#include <cmath>
#include <map>
#define MOD 1000000007
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef vector<vl> vvl;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<ll, ll> pll;
typedef pair<int, int> pi;
typedef vector<pll> vpl;
typedef vector<pi> vpi;
typedef queue<ll> ql;
typedef queue<int> qi;
template <class T>
void printv(vector<T> vc)
{
for (auto e : vc)
cout << e << " ";
cout << endl;
}
template <class T>
void printvv(vector<T> vvc)
{
for (auto vc : vvc)
{
for (auto e : vc)
cout << e << " ";
cout << endl;
}
}
template <class T>
void printvp(vector<pair<T, T> > vp)
{
for (auto pT : vp)
cout << pT.first << " " << pT.second << endl;
}
int main() {
string s;
cin >> s;
reverse(s.begin(), s.end());
vs v = {"dream", "dreamer", "erase", "eraser"};
for (int i = 0; i < v.size(); ++i) {
reverse(v[i].begin(), v[i].end());
}
auto a = true;
for (int i = 0; i < s.size();) {
auto b = false;
for (int j = 0; j < v.size(); ++j) {
const auto target = v[j];
if (s.substr(i, target.size()) == target) {
i += target.size();
b = true;
}
}
if (!b) {
a = false;
break;
}
}
cout << (a ? "YES" : "NO") << endl;
return 0;
}
| 0 | 61,539,483 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int,int>
#define pdi pair<db,int>
#define mp make_pair
#define pb push_back
#define enter putchar('\n')
#define space putchar(' ')
#define eps 1e-8
#define mo 974711
#define MAXN 100005
using namespace std;
typedef long long int64;
typedef double db;
template<class T>
void read(T &res) {
res = 0;char c = getchar();T f = 1;
while(c < '0' || c > '9') {
if(c == '-') f = -1;
c = getchar();
}
while(c >= '0' && c <= '9') {
res = res * 10 + c - '0';
c = getchar();
}
res *= f;
}
template<class T>
void out(T x) {
if(x < 0) {x = -x;putchar('-');}
if(x >= 10) {
out(x / 10);
}
putchar('0' + x % 10);
}
int N,x,y,s,t;
char str[8005];
vector<int> dir[2];
bitset<16005> f[2];
bool cmp(int a,int b) {
return a > b;
}
void Solve() {
scanf("%s",str + 1);read(x);read(y);
N = strlen(str + 1);
int d = 0;
s = 0,t = 0;
int p = 1;
while(p <= N && str[p] == 'F') {++s;++p;}
int cnt = 0;
for(int i = p ; i <= N ; ++i) {
if(str[i] == 'T') {
if(cnt) dir[d].pb(cnt);
d ^= 1;cnt = 0;
}
else {++cnt;}
}
if(cnt) dir[d].pb(cnt);
if(abs(s - x) > N) {puts("No");return;}
int cur = 0;
f[cur].reset();
f[cur][8000] = 1;
for(auto k : dir[0]) {
f[cur ^ 1].reset();
f[cur ^ 1] = (f[cur] << k) | (f[cur] >> k);
cur ^= 1;
}
if(!f[cur][8000 + abs(s - x)]) {puts("No");return;}
cur = 0;
f[cur].reset();
f[cur][8000] = 1;
for(auto k : dir[1]) {
f[cur ^ 1].reset();
f[cur ^ 1] = (f[cur] << k) | (f[cur] >> k);
cur ^= 1;
}
if(!f[cur][8000 + abs(t - y)]) {puts("No");return;}
puts("Yes");
}
int main() {
#ifdef ivorysi
freopen("f1.in","r",stdin);
#endif
Solve();
}
|
#include <bits/stdc++.h>
#define all(v) (v).begin(), (v).end()
#define sz(x) ((int)(x).size())
using namespace std;
using ll = long long;
using pp = pair<int, int>;
const int INF = 1e9;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
vector<int> A(N);
for (int i = 0; i < N; i++) cin >> A[i];
vector<ll> ruiseki(N + 1);
vector<ll> NaM_r(N + 1);
for (int i = 0; i < N; i++) {
ruiseki[i + 1] = ruiseki[i] + A[i];
NaM_r[i + 1] = NaM_r[i] + max(A[i], 0);
}
ll ans = -INF;
for (int i = 0; i + K <= N; i++) {
ll tmp = NaM_r[N];
tmp += max(ruiseki[i + K] - ruiseki[i], 0LL);
tmp -= NaM_r[i + K] - NaM_r[i];
ans = max(tmp, ans);
}
cout << ans << endl;
}
| 0 | 59,548,573 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define ios ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
void solve(void)
{
string o, e;
cin >> o >> e;
string ans = "";
rep(i, o.length())
{
ans += o[i];
if (i < e.length())
ans += e[i];
}
cout << ans << endl;
}
int main(void)
{
solve();
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1 << 30;
const int NIL = -1;
const int MAX = 10000;
const int mod = 1000000007;
const double pi = 3.141592653589;
int cntDivisor(int x) {
int ret = 0;
for (int i = 1; i * i <= x; i++) {
if (x % i == 0) {
ret++;
if (i * i != x) ret++;
}
}
return ret;
}
int main(){
int n;
cin >> n;
int ans = 0;
for (int i = 105; i <= n; i+=2) ans += (cntDivisor(i) == 8);
cout << ans << '\n';
}
| 0 | 39,855,247 |
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#ifdef __GXX_EXPERIMENTAL_CXX0X__
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#ifdef __GXX_EXPERIMENTAL_CXX0X__
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#endif
using namespace std;
int main ()
{
vector<vector<int>>data;
int A , B , N;
while( cin >> A >> B ,A||B)
{
cin >> N;
data.resize ( A + 1 );
for( size_t i = 0; i < A + 1; i++ )
{
data[i].resize ( B + 1 );
}
for( size_t i = 0; i < N; i++ )
{
int a , b;
cin >> a >> b;
data[a][b] = -1;
}
data[0][1] = 1;
for( size_t i = 1; i < A + 1; i++ )
{
for( size_t j = 1; j < B + 1; j++ )
{
if( data[i][j] != -1 )
data[i][j] = max ( data[i][j - 1] , 0 ) + max ( data[i - 1][j] , 0 );
}
}
cout << data[A][B] << endl;
data.clear ();
}
return 0;
}
|
#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
int main()
{
string ans = "NO";
int a, b, c;
cin >> a >> b >> c;
for (int i = i; i <= b; ++i)
{
int t = a * i;
if (t % b == c)
{
ans = "YES";
}
}
cout << ans << endl;
}
| 0 | 71,122,707 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int n;
ll a[200000], ans = (1L << 62), X, x;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
scanf("%ld", &a[i]);
X += a[i];
}
for (int i = 0; i < n - 1; i++) {
x += a[i];
ans = min(ans, abs(X - x - x));
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
map<ll, ll>a;
for (int i = 0; i < n; i++) {
ll x;
cin >> x;
if (a.count(x))a.at(x)++;
else a[x] = 1;
}
ll ans = 0;
for (auto b : a) {
if (b.first < b.second)ans += b.second - b.first;
else if (b.first > b.second)ans += b.second;
}
cout << ans << endl;
}
| 0 | 47,843,327 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int H, W;
cin >> H >> W;
vector<string> C(H);
for (int i = 0; i < H; ++i) {
cin >> C.at(i);
}
for (int i = 1; i <= H * 2; ++i) {
cout << C.at(((i + 1) / 2) - 1) << endl;
}
return 0;
}
|
#include<cstdio>
#include<algorithm>
#include<iostream>
using namespace std;
long long a,b,n;
int main()
{
scanf("%lld%lld%lld",&n,&a,&b);
if(a*b<n||a+b-1>n){printf("-1\n");return 0;}
while(n>0)
{
long long x=min(a,n-b+1);
for(long long i=1;i<=x;i++)
printf("%d ",n-x+i);
n-=x;
b--;
}
}
| 0 | 16,606,346 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin>>N;
vector<int>vec(N);
for(int i=0;i<N;i++){
cin >>vec.at(i);
}
int count=0;
for(int i=0;i<N;i++){
if(vec.at(vec.at(i)-1)==i+1){
count++;
}
}
cout<<count/2<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for (int i = 0; i< (n); ++i)
const long long INF = 1LL<<58;
template<class T> bool chmin(T &a, T b){
if(a>b) {
a = b;
return true;
}
return false;
}
template<class T> void chmax(T &a, T b){ if(a<b) a = b; }
template<class T> int former(const vector<T> &v, T x){
return upper_bound(v.begin(), v.end(), x) - v.begin() -1;
}
template<class T> int latter(const vector<T> &v, T x){
return lower_bound(v.begin(), v.end(), x) - v.begin();
}
int GCD(int a, int b) { return b ? GCD(b, a%b) : a; }
using Data = pair<ll, vector<int>>;
int main() {
ll X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<ll> A(X), B(Y), C(Z);
rep(i,X) cin >> A[i];
rep(i,Y) cin >> B[i];
rep(i,Z) cin >> C[i];
sort(A.begin(),A.end(), greater<ll>());
sort(B.begin(),B.end(), greater<ll>());
sort(C.begin(),C.end(), greater<ll>());
priority_queue<Data> que;
set<Data> se;
Data insert;
insert = make_pair(A[0] + B[0] + C[0], vector<int>({0, 0, 0}));
que.push(insert);
rep(i,K){
auto c = que.top();que.pop();
cout << c.first << endl;
if (c.second[0] + 1 < X) {
ll sum = c.first - A[c.second[0]] + A[c.second[0] + 1];
auto num = c.second;
num[0]++;
auto d = Data(sum, num);
if (!se.count(d)) se.insert(d), que.push(d);
}
if (c.second[1] + 1 < Y) {
ll sum = c.first - B[c.second[1]] + B[c.second[1] + 1];
auto num = c.second;
num[1]++;
auto d = Data(sum, num);
if (!se.count(d)) se.insert(d), que.push(d);
}
if (c.second[2] + 1 < Z) {
ll sum = c.first - C[c.second[2]] + C[c.second[2] + 1];
auto num = c.second;
num[2]++;
auto d = Data(sum, num);
if (!se.count(d)) se.insert(d), que.push(d);
}
}
}
| 0 | 19,063,751 |
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define F first
#define S second
using namespace std;
typedef pair<int,int> P;
const int MOD=1000000007;
int INF=100100100100100;
int n;
string s[10010];
int a[10010];
signed main(){
int ans=0;
int A=0,B=0;
bool flag=false;
cin>>n;
rep(i,n){
cin>>s[i];
a[i]=s[i].length();
rep(j,a[i]-1){
if(s[i][j]=='A' && s[i][j+1]=='B')ans++;
}
if(s[i][0]=='B')B++;
if(s[i][a[i]-1]=='A')A++;
if((s[i][0]=='B')^(s[i][a[i]-1]=='A')==1)flag=true;
}
ans+=min(A,B);
if(!flag && A+B>0)ans--;
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fr first
#define sec second
#define rep(i,n) for(i=0;i<n;i++)
#define vi vector <int>
#define vc vector <char>
#define vl vector <ll>
#define vb vector <bool>
#define pb push_back
#define M 1000000007
#define ios ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define open freopen("input.txt","r",stdin);
#define close freopen("output.txt","w",stdout);
#define M_PI 3.14159265358979323846
#define pp pair<int,int>
#define nn 100003
#define MM 1000000000
#define MN 1000000000000000000
int main()
{
ios;
ll n,k,i,j,x,ans=0;
cin>>n>>k;
ll d;
map <ll,vl> m;
for(i=1;i<=k;i++)
{
cin>>d;
rep(j,d)
{
cin>>x;
m[x].pb(i);
}
}
for(i=1;i<=n;i++)
{
if(m.find(i)==m.end())
ans++;
}
cout<<ans;
return 0;
}
| 0 | 20,968,511 |
#include<cstdio>
#include<algorithm>
using namespace std;
int main(){
int n;
while(scanf("%d",&n),n){
int stage[100000] = {0};
for(int i = 1;i <= n; i++){
scanf("%d",&stage[i]);
}
int x = 0;
int ans = -1000000;
for(int i = 1;i <= n; i++){
for(int j = i;j <= n; j++){
x += stage[j];
ans = max(ans,x);
}
x = 0;
}
printf("%d\n",ans);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using vst=vector<string>;
using P = pair<ll,ll>;
const int inf=1e9+7;
const ll INF=9e18;
template <typename T> bool chmin(T &a, const T& b){if(a > b){a = b;return true;}return false;}
template <typename T> bool chmax(T &a, const T& b){if(a < b){a = b;return true;}return false;}
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
const int dx[4] = { 1, 0, -1, 0 };
const int dy[4] = { 0, 1, 0, -1 };
int main(){cout<<fixed<<setprecision(20);
string s;
cin>>s;
int n=s.size();
rep(i,0,n-1){
if(s[i]==s[i+1]){
cout<<i+1<<" "<<i+2<<endl;
return 0;
}
}
rep(i,0,n-2){
if(s[i]==s[i+2]){
cout<<i+1<<" "<<i+3<<endl;
return 0;
}
}
cout<<-1<<" "<<-1<<endl;
}
| 0 | 46,600,911 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair<ll,ll> ii;
typedef vector<int> vi;
typedef long double ld;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
const long long mod = 1000000007;
const long long inf = 1e18;
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
int n,z,w;
cin>>n>>z>>w;
vi v;
for(int i=0;i<n;i++){
int k;
cin>>k;
v.pb(k);
}
if(n==1){
cout<<abs(v[0]-w)<<endl;
}
else{
cout<<max(abs(v[n-1]-v[n-2]),abs(v[n-1]-w));
}
return 0;
}
|
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int main() {
int n, yy;
cin >> n >> yy;
yy /= 1000;
int x = -1, y = -1, z = -1;
for (int i = 0; 4 * i <= yy - n; i++) {
int t = yy - n - 4 * i;
if (t >= 0 && t % 9 == 0 && n - t / 9 - i >= 0) {
x = t / 9;
y = i;
z = n - x - y;
break;
}
}
cout << x << " " << y << " " << z << endl;
}
| 0 | 54,399,424 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fastio ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define gcd(a,b) __gcd((a),(b))
#define lcm(a,b) ((a)*(b))/gcd((a),(b))
const int maxn = 1e9 + 5;
#define INF 100000000000
const int MOD = 1e9+7;
const double PI = 3.14159265358979323846264338;
const int MAXN = 201+5;
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
fastio
ll n;
cin >> n;
ll a[n];
for(ll i=0; i<n; i++){
cin >> a[i];
}
ll ans = 1;
ll mini = a[0];
for(ll i=1; i<n; i++){
if(mini>a[i]){
ans++;
mini=a[i];
}
}
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define ssrep(i, s, t) for (int i = s; i <= t; ++i)
#define rng(a) a.begin(), a.end()
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define chmax(x, y) (x = max(x, y))
#define chmin(x, y) (x = min(x, y))
using pi = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using ld = long double;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "{";
rep(i, (int)v.size()) {
if (i)
os << ",";
os << v[i];
}
os << "}";
return os;
}
template <typename T, size_t S> void printArray(const T (&array)[S]) {
for (auto val : array)
std::cout << val << ", ";
std::cout << "\n";
}
const int mod = 1e9 + 7;
const int inf = 1e9 + 5;
struct Edge {
int to, c;
};
vector<vector<Edge>> graph;
vector<ll> cost;
void dfs(int d, ll c, int p) {
cost[d] = c;
for (auto &edge : graph[d]) {
if (edge.to == p) continue;
dfs(edge.to, c+edge.c, d);
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << std::setprecision(10);
int n; std::cin >> n;
graph.resize(n);
cost.resize(n);
rep(i, n-1) {
int a, b, c; std::cin >> a >> b >> c;
a--, b--;
graph[a].pb({b, c}), graph[b].pb({a, c});
}
int q, k; std::cin >> q >> k;
k--;
dfs(k, 0, -1);
rep(i, q) {
int x, y; std::cin >> x >> y;
x--, y--;
std::cout << cost[x] + cost[y] << "\n";
}
}
| 0 | 55,861,099 |
#include <iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
string s, t; cin >> s >> t;
int S; S = s.size();
string T;T= t.erase(S);
if (s == T) { cout << "Yes" << endl; }
else { cout << "No" << endl; }
}
|
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define REP(i,x,n) for(int i = (x); i < (n); ++i)
#define ll long long
#define P pair<ll,ll>
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
const ll mod = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1);
int main(void)
{
ll n, cnt=0;
string s;
cin >> n >> s;
rep(i,1000){
ll num[3] = {i/100, (i/10)%10, i%10};
ll id = 0;
rep(j,n){
if(s[j] == num[id] + '0') id++;
if(id == 3) break;
}
if(id == 3) cnt++;
}
cout << cnt << endl;
return 0;
}
| 0 | 26,191,625 |
#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 L;
cin >> L;
double V = pow(L / 3.0, 3.0);
cout << fixed << setprecision(8) << V << endl;
}
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<long> H(N);
for (int i = 0; i < N; ++i) cin >> H[i];
int cnt = 0;
int tmp_cnt = 0;
for (int i = 1; i < N; ++i) {
if (H[i - 1] >= H[i]) {
tmp_cnt++;
cnt = max(tmp_cnt, cnt);
} else
tmp_cnt = 0;
}
cout << cnt << endl;
return 0;
}
| 0 | 25,950,578 |
#include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<cmath>
#include<cstring>
#include<set>
#include<climits>
using namespace std;
#define intmax INT_MAX
#define lmax LONG_MAX
#define uintmax UINT_MAX
#define ulmax ULONG_MAX
#define llmax LLONG_MAX
#define ll long long
#define rep(i,a,N) for((i)=(a);(i)<(N);(i)++)
#define rrp(i,N,a) for((i)=(N)-1;(i)>=(a);(i)--)
#define llfor ll i,j
#define sc(a) cin>>a
#define pr(a) cout<<a<<endl
#define pY puts("YES")
#define pN puts("NO")
#define py puts("Yes")
#define pn puts("No")
#define pnn printf("\n")
#define all(a) a.begin(),a.end()
#define push(a,b) (a).push_back(b)
#define llvec vector<vector<ll>>
#define charvec vector<vector<char>>
#define size(a,b) (a,vector<ll>(b))
#define llpvec vector<pair<ll,ll>>
const double pi=acos(-1);
ll cei(ll x,ll y){ll ans=x/y;if(x%y!=0)ans++;return ans;}
ll gcd(ll x,ll y){return y?gcd(y,x%y):x;}
ll lcm(ll x,ll y){return x/gcd(x,y)*y;}
ll llpow(ll x,ll n){ll i,ans=1;rep(i,0,n)ans*=x;return ans;}
ll fact(ll x){ll i,ans=1;rep(i,0,x)ans*=(x-i);return ans;}
ll ncr(ll n,ll r){return fact(n)/fact(r)/fact(n-r);}
ll npr(ll n,ll r){return fact(n)/fact(n-r);}
bool prime(ll a){if(a<=1)return false;ll i;for(i=2;i*i<=a;i++){if(a%i==0)return false;}return true;}
ll fib(ll x){ll i,fibo[x+10];fibo[0]=1;fibo[1]=1;fibo[2]=1;rep(i,3,x+1)fibo[i]=fibo[i-1]+fibo[i-2];return fibo[x];}
ll dig(ll n){ll d=0,i=0;while(n/10>0){i++;d++;}return d;}
const int dx[4]={1,0,-1,0};const int dy[4]={0,1,0,-1};
llfor;
int main(){
ll n,k;
cin>>n;
k=(ll)sqrt(n)+(ll)1;
if(k>1000000000)k--;
ll c=k*k-n;
printf("0 0 %lld %lld %lld 1\n",c,k,k);
return 0;}
|
#define long_enable
#include <iostream>
#include <algorithm>
#include <cstring>
#include <numeric>
#include <iomanip>
#include <sstream>
#include <vector>
#include <queue>
#include <set>
#include <map>
using namespace std;
#ifdef stream_enable
#define cin sss
#endif
#ifdef long_enable
typedef long long int ll;
#else
typedef int ll;
#endif
typedef pair<ll, ll> pii;
typedef pair<pii, ll> ppi;
typedef pair<ll, pii> pip;
typedef vector<ll> vi;
typedef vector<pii> vpii;
const ll MOD = 1000000007;
const long long BIG = 1446803456761533460;
const int Big = 336860180;
#define F first
#define S second
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define debug(x) cout << #x << " -> " << (x) << endl
#define debug2(x, y) cout << #x << ' ' << #y << " -> " << (x) << ' ' << (y) << endl
#define debug3(x, y, z) cout << #x << ' ' << #y << ' ' << #z << " -> " << (x) << ' ' << (y) << ' ' << (z) << endl
#define debug4(x, y, z, t) cout << #x << ' ' << #y << ' ' << #z << ' ' << #t << " -> " << (x) << ' ' << (y) << ' ' << (z) << ' ' << (t) << endl
#define debugp(x) cout << #x << " -> " << "(" << (x).F << ", " << (x).S << ")" << endl
#define debuga(x, n) cout << #x << " -> "; fori (i1_da, n) { cout << (x)[i1_da] << ' '; } cout << endl
#define debugap(x, n) cout << #x << " ->\n"; fori (i1_dap, n) { cout << "(" << (x)[i1_dap].F << ", " << (x)[i1_dap].S << ")\n"; } cout << endl
#define debugaa(x, n, m) cout << #x << " ->\n"; fori (i1_daa, n) { fori (i2_daa, m) { cout << (x)[i1_daa][i2_daa] << ' '; } cout << '\n'; } cout << endl
#define debugav(x, n) cout << #x << " ->\n"; fori (i1_dav, n) { fori (i2_dav, (x)[i1_dav].size()) { cout << (x)[i1_dav][i2_dav] << ' '; } cout << '\n'; } cout << endl
#define debugia(x, n) cout << #x << " ->\n"; fori (i1_dia, n) { cout << i1_dia << " : " << (x)[i1_dia] << '\n'; } cout << endl
#define forifrom(i, s, n) for(ll i = (s); i < (n); ++i)
#define forirto(i, n, e) for(ll i = (n) - 1; i >= (e); --i)
#define fori(i, n) forifrom (i, 0, n)
#define forir(i, n) forirto (i, n, 0)
#define smin(a, b) a = min(a, (b))
#define smax(a, b) a = max(a, (b))
#define Add(a, b) a = ((a) + (b)) % MOD
#define Mul(a, b) a = (1LL * (a) * (b)) % MOD
stringstream sss;
const ll maxn = 100010;
ll n;
vi g[maxn];
ll cnt[maxn];
void dfs(ll x, ll par) {
for (auto y : g[x]) if (y != par) {
dfs(y, x);
if (cnt[y] == 0) ++cnt[x];
}
if (cnt[x] >= 2) {
cout << "First\n";
exit(0);
}
}
void MAIN() {
cin >> n;
fori (i, n - 1) {
ll a, b; cin >> a >> b; --a, --b;
g[a].eb(b), g[b].eb(a);
}
dfs(0, 0);
if (cnt[0] == 0) cout << "First\n";
else cout << "Second\n";
}
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cout << fixed << setprecision(10);
sss << R"(
)";
MAIN();
return 0;
}
| 0 | 16,975,699 |
#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()
{
vector<int> a(5);
rep(i, 5) cin >> a[i];
int mx = 0, ans = 0;
rep(i, 5)
{
ans += a[i];
int x = a[i] % 10;
if (x == 0)
continue;
x = 10 - x;
ans += x;
mx = max(mx, x);
}
ans -= mx;
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,a,b) for(ll i=ll(a);i<ll(b);i++)
#define irep(i,a,b) for(ll i=ll(a);i>=ll(b);i--)
#define pb push_back
#define mp make_pair
#define F .first
#define S .second
using ll=long long;
using ld=long double;
using namespace std;
const ll mod=1e9+7;
int main(){
ll n,tmp=0,c=0,c2=0,x1=0,x2=0,ans=0;
cin>>n;
priority_queue<ll> q;
rep(i,0,n){cin>>tmp;q.push(tmp);}
bool p=true;
while(p){
c=q.top()+ans;
x1=q.top();
if(c<n){p=false;break;}
else {
ll sub =ceil(((ld)c-n+1)/n);
ans+=sub;
q.push(x1-sub*n-sub);
q.pop();
}
}
cout<<ans<<endl;
}
| 0 | 86,980,744 |
#include<iostream>
#include<string>
using namespace std;
int main(){
long long a,b;
string s,s2;
cin >> s;
while(s.size() > 1){
s = s.erase(s.size() - 1);
if(s.substr(0, s.size() / 2) == s.substr(s.size() / 2)){
break;
}
}
cout << s.size() << endl;
}
|
#include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define PI acos(-1)
#define pcnt __builtin_popcountll
#define rng(a) a.begin(), a.end()
#define sz(x) (int)(x).size()
#define v(T) vector<T>
#define vv(T) v(v(T))
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
template<typename T>inline istream& operator>>(istream&i,v(T)&v)
{rep(j,sz(v))i>>v[j];return i;}
template<typename T1,typename T2>inline istream& operator>>(istream&i,pair<T1,T2>&v)
{return i>>v.fi>>v.se;}
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; }
ll INF = 1001001001;
ll LINF = 1001001001001001001ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, m;
cin>>n>>m;
vl as(n);
rep(i, m) {
ll v1, v2;
cin>>v1>>v2; v1--; v2--;
if (v1 == 0) as[v2]++;
else if (v2 == 0) as[v1]++;
else {
as[v1]++;
as[v2]++;
}
}
rep(i, n) {
if (as[i] % 2) {
cout<<"NO"<<endl;
return 0;
}
}
cout<<"YES"<<endl;
}
| 0 | 43,920,691 |
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int heap[n + 1];
for (int i = 1; i <= n; i++) {
cin >> heap[i];
}
for (int i = 1; i <= n; i++) {
cout << "node " << i << ": key = " << heap[i] << ", ";
if (i != 1) {
cout << "parent key = " << heap[i / 2] << ", ";
}
if (i * 2 <= n) {
cout << "left key = " << heap[i * 2] << ", ";
}
if (i * 2 + 1 <= n) {
cout << "right key = " << heap[i * 2 + 1] << ", ";
}
cout << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#define rep2(x,fr,to) for(int (x)=(fr);(x)<(to);(x)++)
#define rep(x,to) for(int (x)=0;(x)<(to);(x)++)
#define repr(x,fr,to) for(int (x)=(fr);(x)>=(to);(x)--)
#define all(c) (c).begin(),(c).end()
#define sz(v) (int)(v).size()
using namespace std;
typedef long long ll; typedef vector<int> VI; typedef pair<int,int> pii;
const int MD = (int)1e9 + 7; typedef vector<ll> VL;
void dbg(){ cerr << "\n"; } template <class T, class ...T2>
void dbg(const T& fst, const T2&...rst){ cerr << fst << ": "; dbg(rst...); }
template <class T, class T2> void amin(T& a,T2 b){ if(a > b) a = b;}
int main()
{
cin.tie(0); ios_base::sync_with_stdio(false);
int h, w;
cin >>h >>w;
if(h%3==0 || w%3==0){puts("0"); return 0;}
auto cker=[](ll hh, ll ww) ->ll{
ll ans = hh%3? ww : 0;
rep2(i, 1, hh){
ll a = i *ww;
ll wb = ww /2;
ll b = (hh-i)*wb;
ll c = (hh-i)*(ww-wb);
if(a<=0 || b<=0 || c<=0) continue;
ll cnd = max({a,b,c}) - min({a,b,c});
ans = min(ans, cnd);
}
return ans;
};
cout << min(cker(h,w), cker(w,h)) <<"\n";
return 0;
}
| 0 | 11,198,919 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> ai;
int res = 0;
for(int i = 0; i < N; i++) {
int temp;
cin >> temp;
ai.push_back(temp);
}
for(int i = 0; i < N; i++) {
if(ai[i] > 0 && (i + 1) == ai[ai[i] - 1]) {
ai[ai[i] - 1] = -1;
res++;
}
}
cout << res;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
#define rep(i,n) for(ll i = 0;i < (ll)n;i++)
#define ALL(x) (x).begin(),(x).end()
#define MOD 1000000007
int main(){
ll n,c,k;
cin >> n >> c >> k;
priority_queue<ll,vector<ll>,greater<ll>> que;
vector<ll> t(n);
rep(i,n)cin >> t[i];
sort(ALL(t));
ll res = 0;
ll hu = 0;
rep(i,n){
if(que.empty()){
que.push(t[i]);
hu++;
continue;
}
ll cnt = 0;
while(!que.empty()){
ll tt = que.top();que.pop();
if(tt+k < t[i])cnt++;
else {
que.push(tt);
break;
}
}
if(cnt == 0){
que.push(t[i]);
hu++;
continue;
}
res += (cnt+c-1)/c;
hu -= cnt;
if((cnt%c) != 0)hu = max(hu-(c-cnt%c),0ll);
while(que.size() != hu)que.pop();
que.push(t[i]);
hu++;
}
res += (hu+c-1)/c;
cout << res << endl;
return 0;
}
| 0 | 28,190,827 |
#include <bits/stdc++.h>
#define int long long
#pragma GCC optimize("O3,Ofast,no-stack-protector,unroll-loops,fast-math")
#pragma GCC target("avx,avx2,sse")
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int x, y, a, b, c;
cin >> x >> y >> a >> b >> c;
vector<pair<int, int>> apples;
for (int i = 0; i < a; i++) {
int x;
cin >> x;
apples.push_back({x, 0});
}
for (int i = 0; i < b; i++) {
int x;
cin >> x;
apples.push_back({x, 1});
}
for (int i = 0; i < c; i++) {
int x;
cin >> x;
apples.push_back({x, 2});
}
sort(apples.begin(), apples.end());
int tot = 0;
int sp = 0;
for (int i = apples.size() - 1; i >= 0; i--) {
if (x + y - sp == 0) break;
if (apples[i].second == 0) {
if (x > 0) {
x--;
tot += apples[i].first;
}
} else if (apples[i].second == 1) {
if (y > 0) {
y--;
tot += apples[i].first;
}
} else {
sp++;
tot += apples[i].first;
}
}
cout << tot << '\n';
fflush(stdout);
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(long long int (i)=0;(i)<(int)(n);(i)++)
#define rrep(i,a,b) for(long long int i=(a);i<(b);i++)
#define rrrep(i,a,b) for(long long int i=(a);i>=(b);i--)
#define all(v) (v).begin(), (v).end()
#define pb(q) push_back(q)
#define Abs(a,b) max(a,b)-min(a,b)
#define YES(condition) if(condition){cout << "YES" << endl;}else{cout << "NO" << endl;}
#define Yes(condition) if(condition){cout << "Yes" << endl;}else{cout << "No" << endl;}
#define Cout(x) cout<<(x)<<endl
#define POSSIBLE(condition) if(condition){cout << "POSSIBLE" << endl;}else{cout << "IMPOSSIBLE" << endl;}
#define Possible(condition) if(condition){cout << "Possible" << endl;}else{cout << "Impossible" << endl;}
#define possible(condition) if(condition){cout << "possible" << endl;}else{cout << "impossible" << endl;}
#define Size(n) (n).size()
typedef long long ll;
using namespace std;
const int INF = 1e9,MOD = 1e9 + 7,ohara = 1e6;
const ll LINF = 1e18;
long long int n,cnt=0,ans=0,a,b,c,d,cmp,cmpp,m,h,w,x,y,sum=0,pos;
int dy[]={1,0,-1,0};
int dx[]={0,1,0,-1};
string alph("abcdefghijklmnopqrstuvwxyz"),s;
bool fl=true;
struct edge{int to,cost;};
int main(void){
cin.tie(0);
ios::sync_with_stdio(false);
cin>>n;
ll flags;
rrep(i,1,n+1){
sum+=i;
if(sum>=n){
flags=i;
if(sum==n){
rrep(j,1,flags+1){
Cout(j);
}
return 0;
}
break;
}
}
sum=0;
rrrep(i,flags,1){
sum+=i;
Cout(i);
if(n-sum<=i-1){
if(n-sum==0)return 0;
Cout(n-sum);
return 0;
}
}
return 0;
}
| 0 | 61,790,656 |
#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
#include "numeric"
#include "cassert"
#include "ctime"
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i,n) for(int i = 0; i < n; i++)
const int INF = 1001001001;
int main() {
string o, e;
cin >> o >> e;
int n = o.size();
int m = e.size();
if ((n+m) % 2 == 0) {
rep(i, n) cout << o[i] << e[i];
cout << endl;
}
else {
rep(i, m) cout << o[i] << e[i];
cout << o[n - 1] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#include <algorithm>
#define rep(i,n) for(int i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
const int mod= 1e+9+7;
const int MAX=1000010;
ll 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;
}
}
ll C(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;
}
int main(){
ll x,y; cin>>x>>y;
if(2*x-y<0||2*y-x<0||(2*x-y)%3!=0||(2*y-x)%3!=0){
cout<<0<<endl;
return 0;
}
ll n=(2*x-y)/3,m=(2*y-x)/3;
COMinit();
ll ans=C(n+m,n);
cout<<ans<<endl;
}
| 0 | 12,292,488 |
#include<iostream>
#include<string>
#include<vector>
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define repa(i, s, n) for(int i = s; i < (int)n; i++)
#define MOD 1000000007
using namespace std;
using ll = long long;
typedef vector<int> vi;
signed main() {
ll n, y;
cin >> n >> y;
rep(i, n+1){
rep(j, n+1){
if(i + j > n) break;
int k = n - i - j;
if(10000*i + 5000*j + 1000*k == y){
printf("%d %d %d\n", i, j, k);
return 0;
}
}
}
cout << "-1 -1 -1" << endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <set>
#include <algorithm>
#include <array>
#include <complex>
#include <utility>
#include <map>
int needleX[4] = { -1,0,1,0 };
int needleY[4] = { 0,1,0,-1 };
int main(void) {
int n;
std::cin >> n;
std::vector<int> p(100+1);
for (int i = 1; i <= n; i++) {
std::cin >> p[i-1] >> p[i];
}
int m[100 + 1][100 + 1];
for (int i = 1; i <= n; i++) {
m[i][i] = 0;
}
for (int l = 2; l <=n; l++) {
for (int i = 1; i <= n-l+1; i++) {
int j = i + l - 1;
m[i][j] = (1<<21);
for (int k = i ; k <= j - 1;k++) {
m[i][j] = std::min(m[i][j], m[i][k] + m[k + 1][j] + p[i - 1] * p[k] * p[j]);
}
}
}
std::cout << m[1][n] << std::endl;
return 0;
}
| 0 | 66,404,747 |
#include <stdio.h>
int main ()
{
int K,A,B;
scanf("%d%d%d",&K,&A,&B);
if((B/K)*K<A){
printf("NG\n");
}
else{
printf("OK\n");
}
return 0;
}
|
#include <iostream>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
void solve(long long N, std::vector<long double> x, std::vector<std::string> u){
long double ans = 0.0;
REP(i, N) {
if (u[i] == "JPY") ans += x[i];
else ans += x[i] * 380000.0;
}
printf("%.5Lf\n", ans);
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
long long N;
cin >> N;
std::vector<long double> x(N);
std::vector<std::string> u(N);
for(int i = 0 ; i < N ; i++){
cin >> x[i];
std::cin >> u[i];
}
solve(N, std::move(x), std::move(u));
return 0;
}
| 0 | 3,867,384 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s; cin >> s;
int diff = 1000;
for(int i=0; i<s.size()-2; i++) {
int x;
x = (int)(s[i]-'0')*100+(int)(s[i+1]-'0')*10+(int)(s[i+2]-'0');
diff = min(diff, abs(x-753));
}
cout << diff << endl;
return 0;
}
|
#include <iostream>
using namespace std;
#define MAX_N (1000000)
bool is_prime[MAX_N];
int sum[MAX_N + 1];
int main()
{
int n;
for (int i = 0; i < MAX_N; i++){
is_prime[i] = true;
}
is_prime[0] = false;
is_prime[1] = false;
for (int i = 4; i < MAX_N; i += 2){
is_prime[i] = false;
}
for (int i = 3; i * i < MAX_N; i += 2){
for (int j = i + i; j < MAX_N; j += i){
is_prime[j] = false;
}
}
sum[0] = 0;
for (int i = 0; i < MAX_N; i++){
sum[i + 1] = sum[i] + is_prime[i];
}
while (cin >> n){
cout << sum[n + 1] << endl;
}
}
| 0 | 42,683,447 |
#include <iostream>
#include <climits>
#define MAX 101
#define INF LLONG_MAX
using namespace std;
long long m[MAX][MAX];
long long p[MAX];
int main(){
int n; cin >> n;
cin >> p[0];
for(int i=1;i<=n-1;i++){
cin >> p[i];
int x; cin >> x;
}
cin >> p[n];
for(int i=1;i<=n;i++) m[i][i]=0;
for(int l=2;l<=n;l++){
for(int i=1;i<=n-l+1;i++){
int j=i+l-1;
m[i][j]=INF;
for(int k=i;k<=j-1;k++){
m[i][j]=min(m[i][j],m[i][k]+m[k+1][j]+p[i-1]*p[k]*p[j]);
}
}
}
cout << m[1][n] << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int>pint;
typedef vector<int>vint;
typedef vector<pint>vpint;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,f,n) for(int i=(f);i<(n);i++)
#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)
template<class T,class U>void chmin(T &t,U f){if(t>f)t=f;}
template<class T,class U>void chmax(T &t,U f){if(t<f)t=f;}
int N;
vector<string>A;
vector<string>BubbleSort(vector<string>&A){
vector<string>B=A;
rep(i,N){
for(int j=N-1;j>0;j--){
if(B[j][1]<B[j-1][1])swap(B[j],B[j-1]);
}
}
return B;
}
vector<string>SelectionSort(vector<string>&A){
vector<string>B=A;
rep(i,N){
int mi=i;
for(int j=i+1;j<N;j++)if(B[mi][1]>B[j][1])mi=j;
swap(B[i],B[mi]);
}
return B;
}
bool isStable(vector<string>&A,vector<string>&B){
rep(i,B.size()){
for(int j=i+1;j<N;j++){
if(B[i][1]!=B[j][1])continue;
int x,y;
rep(k,A.size()){
if(A[k]==B[i])x=k;
else if(A[k]==B[j])y=k;
}
if(x>y)return false;
}
}
return true;
}
signed main(){
cin>>N;
rep(i,N){
string s;cin>>s;A.pb(s);
}
vector<string>B=BubbleSort(A),S=SelectionSort(A);
rep(i,B.size()){
if(i)cout<<" ";
cout<<B[i];
}cout<<endl;
if(isStable(A,B))cout<<"Stable"<<endl;
else cout<<"Not stable"<<endl;
rep(i,S.size()){
if(i)cout<<" ";
cout<<S[i];
}cout<<endl;
if(isStable(A,S))cout<<"Stable"<<endl;
else cout<<"Not stable"<<endl;
return 0;
}
| 0 | 62,149,720 |
#include<iostream>
#include<string>
int main () {
int n;
std::cin >> n;
std::string s, t;
std::cin >> s >> t;
std::string ans = "";
for (int i = 0; i < n; i++) {
ans += s[i];
ans += t[i];
}
std::cout << ans << std::endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i,l,r) for (int i = (l); i < (r); ++i)
#define REP(i,n) FOR(i,0,n)
#define SORT(c) sort((c).begin(), (c).end())
#define RSORT(c) sort((c).rbegin(), (c).rend())
#define SZ(c) ((int)(c).size())
#define debug(x) cerr << #x << " = " << (x) << '\n';
using P = pair<int,int>;
using VS = vector<string>;
using VI = vector<int>;
using VVI = vector<VI>;
const double EPS = 1e-10;
const double PI = acos(-1.0);
const ll MOD = 1e+9 + 7;
const int MAX_N = 1e+5;
VI dp(MAX_N, 0);
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(10);
int N, K; cin >> N >> K;
VI h(N); REP(i,N) cin >> h[i];
FOR(i,1,N) {
dp[i] = dp[i-1] + abs(h[i] - h[i-1]);
FOR(j,2,K+1) {
if (i-j < 0) continue;
dp[i] = min(dp[i], dp[i-j] + abs(h[i] - h[i-j]));
}
}
cout << dp[N-1] << '\n';
return 0;
}
| 0 | 65,994,573 |
#include <bits/stdc++.h>
#include <iostream>
#define ll long long
#define map unordered_map
#define set unordered_set
#define pll pair<ll, ll>
#define vll vector<ll>
#define mll map<ll, ll>
using namespace std;
const ll MOD = 1000000007LL;
const ll INF = (1LL << 60LL);
int main() {
ll N, X, T;
scanf("%lld %lld %lld", &N, &X, &T);
ll ans = (N + X - 1) / X * T;
cout << ans << endl;
}
|
#include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <stack>
#include <tuple>
#include <map>
#include <set>
#include <algorithm>
#include <utility>
#include <cmath>
#include <complex>
#include <cassert>
#define rep(i, x) for (int i = 0; i < (x); ++i)
#define rng(i, x, y) for (int i = (x); i < (y); ++i)
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
using namespace std;
using ll = long long;
constexpr int inf = 1001001001;
constexpr ll INF = 3003003003003003003;
template <typename T> inline bool chmin(T &x, const T &y) {if (x > y) {x = y; return 1;} return 0;}
template <typename T> inline bool chmax(T &x, const T &y) {if (x < y) {x = y; return 1;} return 0;}
void solve();
int main() {
solve();
return 0;
}
void solve() {
int h, w;
cin >> h >> w;
rep(i, h) rep(j, w) {
string s;
cin >> s;
if (s == "snuke") {
cout << (char)('A' + j) << i + 1 << "\n";
}
}
return;
}
| 0 | 6,933,201 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main(){
int n,k;
cin >>n >>k;
cout << n-k+1 << endl;
return 0;
}
|
#include <sstream>
#include <iostream>
#include <vector>
#include <string>
using namespace std;
int selection_sort(vector<int> &list) {
int count = 0;
for (int i = 0; i < list.size(); ++i) {
int mini = i;
for (int j = i + 1; j < list.size(); ++j) {
if (list[j] < list[mini]) {
mini = j;
}
}
if (mini != i) {
count++;
int tmp = list[mini];
list[mini] = list[i];
list[i] = tmp;
}
}
return count;
}
int main() {
int N;
cin >> N;
cin.ignore();
string str;
getline(cin, str);
string tmp;
vector<int> v;
istringstream istr(str);
while (getline(istr, tmp, ' ')) {
v.push_back(stoi(tmp));
}
int count = selection_sort(v);
for (auto iter = v.begin(); iter != v.end() - 1; ++iter) {
cout << *iter << " ";
}
cout << v.back() << endl;
cout << count << endl;
}
| 0 | 44,206,038 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, k;
ll A[200005], S[200005];
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> A[i];
A[i]--;
S[i + 1] = (S[i] + A[i] + k) % k;
}
ll ans = 0;
map<int, int> mp;
for(int i = 0; i <= n; i++){
if (i - k >= 0) mp[S[i - k]]--;
ans += mp[S[i]];
mp[S[i]]++;
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const long long INF= 1e+18+1;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll> >vvl;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> T;
const ll MOD=1000000007LL;
string abc="abcdefghijklmnopqrstuvwxyz";
string ABC="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int main(){
string s;cin>>s;
string t="";
ll n=s.size();
rep(i,n){
if(s[i]!='x')t+=s[i];
}
string u=t;
reverse(u.begin(),u.end());
if(u!=t){
cout<<-1<<endl;
return 0;
}
ll k=t.size();
string res=s;
reverse(res.begin(),res.end());
ll a=0;
ll b=0;
ll ans=0;
ll j=-1,i=-1;
ll cnta=0,cntb=0;
while(true){
cnta=0;
cntb=0;
i++;j++;
while(i<n&&s[i]!=u[a]){
cnta++;i++;
}
while(j<n&&res[j]!=u[b]){
cntb++;j++;
}
a++;b++;
ans+=abs(cnta-cntb);
if(a>=(k+1)/2)break;
}
cout<<ans<<endl;
}
| 0 | 77,596,306 |
#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 x,a;
cin >> x >> a;
if(x<a) cout << 0 << endl;
else if(x>=a) cout << 10 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
while(getline(cin, s)) {
if(s == ".") break;
vector<int> v(2);
vector<int> tmp[2];
bool f = true;
for(auto& c: s) {
if(c == '(') {
v[0]++;
tmp[0].push_back(v[1]);
}
if(c == ')') {
if(v[0] == 0 || tmp[0].back() != v[1]) {
f = false;
break;
}
else {
v[0]--;
tmp[0].pop_back();
}
}
if(c == '[') {
v[1]++;
tmp[1].push_back(v[0]);
}
if(c == ']') {
if(v[1] == 0 || tmp[1].back() != v[0]) {
f = false;
break;
}
else {
v[1]--;
tmp[1].pop_back();
}
}
}
if(v[0] != 0 || v[1] != 0) f = false;
cout << (f ? "yes" : "no") << endl;
}
}
| 0 | 35,681,527 |
#include <iostream>
#include <map>
#include <unordered_map>
#include <set>
#include <utility>
#include <stack>
#include <cstdio>
#include <string>
#include <cmath>
#include <cstring>
#include <vector>
#include <queue>
#include <algorithm>
#include <iterator>
#include <sstream>
#define popcount(x) __builtin_popcount(x)
#define oddparity(x) __builtin_parity(x)
#define clz(x) __builtin_clz(x)
#define ctz(x) __builtin_ctz(x)
#define sf scanf
#define pf printf
#define ll long long int
using namespace std;
bool flag;
int i, j, n, f, b;
string x, s;
int main()
{
sf("%d", &n);
cin >> x;
s = x;
for (i = n-1; i >= 0; i--) {
if (s[i] == '1') continue;
else if (s[i] == '(') b++;
else {
flag = false;
for (j = i-1; j >= 0; j--) {
if (s[j] == '(') {
s[j] = '1';
flag = true;
break;
}
}
if (flag == false) f++;
}
}
s = "";
while (f--) s += '(';
s += x;
while (b--) s += ')';
cout << s << endl;
return 0;
}
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <queue>
#include<limits.h>
#include<iomanip>
#define rep(i, n) for(int i = 0; i < n; i++)
#define REP(i, m, n) for(int i = m; i < n; i++)
#define ALL(v) v.begin(),v.end()
#define RALL(v) v.rbegin(),v.rend()
#define check(v) rep(i,v.size()) cout << v[i] << " ";\
cout << endl
#define INF 1e8
typedef long long ll;
using namespace std;
int main() {
int n; cin >> n;
int a, b; cin >> a >> b;
int fi=0, se=0, th=0;
rep(i,n){
int num; cin >> num;
if(num<=a) fi++;
else if(num<=b) se++;
else th++;
}
cout << min({fi,se,th}) << endl;
return 0;
}
| 0 | 71,860,620 |
#include <cstdio>
#include <iostream>
#include <set>
#define debug(...) fprintf(stderr,__VA_ARGS__)
#define fi first
#define se second
using namespace std;
inline char nc()
{
static char buf[100000],*l=buf,*r=buf;
return l==r&&(r=(l=buf)+fread(buf,1,100000,stdin),l==r)?EOF:*l++;
}
template<class T> void read(T &x)
{
x=0; int f=1,ch=nc();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=nc();}
while(ch>='0'&&ch<='9'){x=x*10-'0'+ch;ch=nc();}
x*=f;
}
typedef pair<int,int> pii;
const int maxn=2e5+50;
int n,a[maxn];
set<pii> s;
bool check(int c)
{
s.clear();
for(int i=2;i<=n;++i)
{
if(a[i]<=a[i-1])
{
while(s.size()&&s.rbegin()->fi>a[i]) s.erase(*s.rbegin());
int x=a[i];
while(true)
{
set<pii>::iterator it=s.lower_bound(make_pair(x,0));
int y=0; if(it!=s.end()&&it->fi==x) y=it->se,s.erase(it);
if(++y==c)
{
if(x==1) return 0;
--x; continue;
}
s.insert(make_pair(x,y));
break;
}
}
}
return 1;
}
int main()
{
read(n);
for(int i=1;i<=n;++i) read(a[i]);
int l=1,r=n,an=-1;
while(l<=r)
{
int mid=(l+r)>>1;
if(check(mid)) r=mid-1,an=mid;
else l=mid+1;
}
printf("%d\n",an);
return 0;
}
|
#include <iostream>
#include <iomanip>
#include <utility>
#include <cmath>
#include <random>
#include <vector>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <algorithm>
using namespace std;
#define rep(i,n) for(int i = 0; i<n; ++i)
#define REP(i,n) for(int i = 1; i<=n; ++i)
#define all(x) begin(x),end(x)
#define show(obj) {for(auto x:obj)cout<<x<<' ';cout<<endl;}
#define line "----------"
typedef long long ll;
typedef pair<int,int> ip;
typedef pair<ll,ll> lp;
const int inf = 1001001000;
const ll INF = 1LL<<60;
const int MOD = (int)1e9 + 7;
int main(){
int N,K; cin>>N>>K;
cout<<N%K<<endl;
return 0;
}
| 0 | 87,852,741 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
using ll = long long;
#define int long long
using P = pair<int,int>;
signed main(){
int n;cin>> n;
int h[n];
rep(i,n)cin >> h[i];
int ans = 0;
int nh = 1;
rep(d,100){
int f = 0;
rep(i,n){
if(h[i] > 0){
h[i]--;
f = 1;
}
else if(f){
ans++;
f = 0;
}
}
if(f)ans++;
}
cout << ans;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c,k,ans=0;
cin>>a>>b>>c>>k;
if(a<=k)
{
ans=a;
k-=a;
}
else
{
ans=k;
k=0;
}
if(b<=k)
k-=b;
else
k=0;
cout<<ans-k<<endl;
}
| 0 | 19,025,040 |
#include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL -1
using namespace std;
const int64_t MOD = 1e9 + 7;
int main() {
string O, E;
cin >> O >> E;
int len = O.size();
string S;
for (int i = 0; i < len; i++) {
S += O.at(i);
if (i < E.size()) S += E.at(i);
}
cout << S << endl;
}
|
#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()
typedef pair<int,int> P;
#define INF 10000000
int main()
{
int h,w;cin>>h>>w;
vector<vector<char>> a(h,vector<char>(w));
int i,j;
rep(i,h)rep(j,w)cin>>a[i][j];
vector<vector<int>> mins(h,vector<int>(w,INF));
queue<P> q;
rep(i,h)rep(j,w)
{
if(a[i][j]=='#')
{
mins[i][j]=0;
q.push({i,j});
}
}
queue<P> q2;
vector<int> dh={0,1,0,-1};
vector<int> dw={1,0,-1,0};
while(!q.empty())
{
while(!q.empty())
{
P nowp=q.front();
q.pop();
int ni=nowp.first;
int nj=nowp.second;
rep(i,4)
{
int toi=ni+dh[i];
int toj=nj+dw[i];
if(toi<0||toi>=h||toj<0||toj>=w)continue;
if(mins[toi][toj]==INF)
{
mins[toi][toj]=mins[ni][nj]+1;
q2.push({toi,toj});
}
}
}
while(!q2.empty())
{
q.push(q2.front());
q2.pop();
}
}
int ans=0;
rep(i,h)rep(j,w)ans=max(ans,mins[i][j]);
cout<<ans<<endl;
}
| 0 | 34,824,662 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.