code1
stringlengths 54
12k
| code2
stringlengths 66
12k
| similar
int64 0
1
| __index_level_0__
int64 24
101M
|
|---|---|---|---|
#include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<vector>
#include<cmath>
#include<cstring>
#include<cstdio>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define rp(a) while(a--)
#define pb push_back
#define mp make_pair
#define all(in) in.begin(),in.end()
const double PI=acos(-1);
const double EPS=1e-10;
using namespace std;
typedef long long ll;
typedef vector<int> vi;
int main(){
int n;
ll out=1;
cin>>n;
rep(i,n)out*=i+1;
cout<<out<<endl;
} | #include <iostream>
using namespace std;
typedef long long ll;
int main(){
int N;
cin>>N;
ll res=1;
for(int i=1;i<=N;i++){
res*=(ll)i;
}
cout<<res<<endl;
return 0;
} | 1 | 93,905,248 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
#define rep(i,n) for (ll i=0;i<(n);++i)
#define rep2(i,a,b) for (ll i=(a);i<(b);++i)
#define debug(x) cout << #x << '=' << x << endl
#define all(v) (v).begin(),(v).end()
const ll MOD=1e9+7;
const ll INF=1e9;
const ll IINF=1e18;
const double EPS=1e-8;
const double pi=acos(-1);
template<class T> inline bool chmin(T &a,T b){
if (a>b){a=b; return true;} return false;
}
template<class T> inline bool chmax(T &a,T b){
if (a<b){a=b; return true;} return false;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int lb=-1,ub=10,mid; char res; string ask;
while(ub-lb>1){
mid=(ub+lb)>>1;
cout << "? " << (int)pow(10,mid) << endl;
cin >> res;
(res=='Y'?lb:ub)=mid;
}
int digit=ub;
lb=0,ub=11;
while(ub-lb>1){
mid=(ub+lb)>>1;
cout << "? " << (int)pow(10,mid)-1 << endl;
cin >> res;
(res=='Y'?ub:lb)=mid;
}
if (digit==10&&ub!=10) digit=ub;
vector<int> ans(digit);
rep(i,digit){
lb=(i?-1:0),ub=10;
while(ub-lb>1){
mid=(ub+lb)>>1;
string ask="? ";
rep(j,i) ask+=(char)(ans[j]+'0');
ask+=(char)(mid+'0');
if (i==digit-1) ask+='0';
cout << ask << endl;
cin >> res;
((i<digit-1&&res=='Y')||(i==digit-1&&res!='Y')?lb:ub)=mid;
}
ans[i]=(i<digit-1?lb:ub);
}
string ret="! ";
rep(i,digit) ret+=(char)(ans[i]+'0');
cout << ret << endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int l=1,r=1e9,mid;
char s[5];
char Query(ll x){printf("? %lld\n",x);fflush(stdout);scanf("%s",s);return*s;}
void Answer(int x){printf("! %d\n",x);exit(0);}
void powten(){
int t=1;
while(true){
if(Query(t+1)=='Y')Answer(t);
t*=10;
}
exit(0);
}
int main(){
do{
if(l==r)powten();
}while(Query(l*=10)=='Y');
r=min(r,l-1),l/=10,mid=(l+r)>>1;
while(l<r){
if(Query(mid*10ll+9)=='Y')
r=mid;
else
l=mid+1;
mid=(l+r)>>1;
}
Answer(mid);
return 0;
} | 1 | 54,168,773 |
#include <vector>
#include <bitset>
#include <limits>
#include <iostream>
long long solve(int n, int k, const std::vector<long long> & a) {
long long cost { std::numeric_limits<long long>::max() };
for (int i = 0; i < (1 << n); ++i) {
const std::bitset<15> bits(i);
if (bits.count() < k) {
continue;
}
long long cur_cost { 0L };
long long height { 0L };
for (int j = 0; j < n; ++j) {
const bool can_build { ((i >> j) & 1) && (a[j] <= height) };
if (can_build) {
cur_cost += (height - a[j] + 1);
++height;
}
height = std::max(height, a[j]);
}
cost = std::min(cost, cur_cost);
}
return cost;
}
int main() {
int n;
int k;
std::cin >> n >> k;
const auto a = [&] {
std::vector<long long> v;
for (int i = 0; i < n; ++i) {
long long h;
std::cin >> h;
v.push_back(h);
}
return v;
}();
std::cout << solve(n, k, a) << std::endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define rrep(i,n) for (int i = 1; i <= (n); i++)
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<int,int>;
using Pl = pair<ll,ll>;
int main() {
int n,k; cin >> n >> k;
vector<ll> a(n);
vector<ll> v(n+1);
rep(i,n) {
cin >> a.at(i);
v.at(i+1) = a.at(i);
}
rep(i,n) {
v.at(i+1) = max(v.at(i), v.at(i+1));
}
ll ans = 1e18;
rep(bit, 1ll<<n) {
std::vector<ll> d;
rep(i,n) {
if (bit>>i&1) d.push_back(i);
}
if (d.size() != k) continue;
ll maxH = 0, cost = 0;
for (ll i : d) {
maxH = max(maxH, v[i]);
if (a[i] <= maxH) {
maxH++;
cost += maxH - a[i];
} else {
maxH = a[i];
}
}
ans = min(ans, cost);
}
cout << ans << endl;
} | 1 | 34,317,584 |
#include <stdio.h>
#define N (300010)
int n,a, b;
int ans[N];
int main(){
scanf("%d%d%d", &n, &a, &b);
if (a+b-1 > n || 1ll*a*b < n){
printf("-1\n");
return 0;
}
for (int t = 1; t <= b; ++t){
int c = n-1ll*t*a-(b-t-1);
if (c >= 1 && c <= a){
int cnt = n, pos = 0;
for (int i = 1; i <= t; ++i){
for (int j = a; j; --j){
ans[pos + j] = cnt--;
}
pos += a;
}
for (int i = 1; i <= b-t-1; ++i){
ans[++pos] = cnt--;
}
for (int i = c; i; --i){
ans[pos+i] = cnt--;
}
break;
}
}
for (int i = 1; i <= n; ++i){
printf("%d%c", ans[i], " \n"[i == n]);
}
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <random>
#include <ctime>
#include <map>
#include <queue>
using namespace std; using ll=long long; using P=pair<ll,ll>; const int INF=1e9; const ll LNF=1e18;
int main(){
int n,a,b; cin>>n>>a>>b;
int c[n]; for(int i=0;i<n;i++) c[i]=i+1;
if (n<a||n<b) {
cout<<-1<<endl;
return 0;
}
int ii=0, p=n, q=1;
reverse(c,c+b);
ii = b; p -= b-1; q = b;
while(ii < n && p > a) {
if (p-a >= b-1) {
if (ii+b > n) break;
reverse(c+ii,c+ii+b);
ii += b; p -= b-1;
} else {
if (ii+p-a+1 > n) break;
reverse(c+ii,c+ii+p-a+1);
ii += p-a; p -= p-a;
}
}
if (p != a || q != b) {
cout<<-1<<endl;
return 0;
} else {
for(int i=0;i<n;i++) {
cout<<c[i]<<" ";
} cout<<endl;
}
} | 1 | 38,158,666 |
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstdlib>
#include<cstring>
using namespace std;
inline int read()
{
int x=0,f=1;char ch=getchar();
while(ch<'0' || ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0' && ch<='9')x=x*10+ch-'0',ch=getchar();
return x*f;
}
int stack[20];
inline void write(int x)
{
if(x<0){putchar('-');x=-x;}
if(!x){putchar('0');return;}
int top=0;
while(x)stack[++top]=x%10,x/=10;
while(top)putchar(stack[top--]+'0');
}
inline void pr1(int x){write(x),putchar(' ');}
inline void pr2(int x){write(x),puts("");}
struct node
{
int x,y,next;
}a[200010];int len,last[100010];
inline void ins(int x,int y)
{
len++;
a[len].x=x;a[len].y=y;
a[len].next=last[x];last[x]=len;
}
int du[100010];
bool pd,id[100010];
inline void dfs(int x,int fa)
{
int cnt=0;
for(int k=last[x];k;k=a[k].next)
{
int y=a[k].y;
if(y==fa)continue;
dfs(y,x);
if(id[y])cnt++;
}
if(cnt>=2)pd=true;
if(!cnt)id[x]=1;
if(!cnt && !fa)pd=true;
}
int main()
{
int n=read();
for(int i=1;i<n;i++)
{
int x=read(),y=read();
ins(x,y),ins(y,x);du[x]++,du[y]++;
}
for(int i=1;i<=n;i++)if(du[i]>1){dfs(i,0);break;}
if(pd==true)puts("First");
else puts("Second");
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
typedef pair<int, int> P;
struct Graph
{
int n;
vector<vector<int>> g;
Graph(int n) : n(n){
g.resize(n);
}
void init(int n_){
n = n_;
g.resize(n_);
}
void add_edge(int from, int to){
g[from].push_back(to);
}
};
struct Tree
{
int n;
int root;
vector<vector<int>> t;
vector<int> par;
vector<int> dpt;
void init(Graph &g, int root_){
n = g.n;
root = root_;
t.resize(n);
par.resize(n);
dpt.resize(n);
fill(dpt.begin(), dpt.end(), -1);
queue<int> que;
par[root] = -1;
dpt[root] = 0;
que.push(root);
while(que.size()){
int pa = que.front();
que.pop();
for(int ch : g.g[pa]){
if(dpt[ch] == -1){
t[pa].push_back(ch);
par[ch] = pa;
dpt[ch] = dpt[pa] + 1;
que.push(ch);
}
}
}
}
Tree(){}
Tree(Graph &g, int root_){
init(g, root_);
}
};
int main()
{
int n;
cin >> n;
Graph g(n);
for(int i = 0; i < n - 1; i++){
int a, b;
cin >> a >> b;
a--; b--;
g.add_edge(a, b);
g.add_edge(b, a);
}
if(n == 2){
cout << "Second" << endl;
return 0;
}
Tree t(g, 0);
P p[100002];
for(int i = 0; i < n; i++) p[i] = P(t.dpt[i], i);
sort(p, p + n, greater<P>());
bool del[100002]{0};
for(int i = 0; i < n; i++){
int u = p[i].second;
int k = 0;
for(int v : t.t[u]){
if(!del[v]) k++;
del[v] = true;
}
if(k >= 2){
cout << "First" << endl;
return 0;
}
if(k == 1){
del[u] = true;
}
if(k == 0 && u == 0){
cout << "First" << endl;
return 0;
}
}
cout << "Second" << endl;
} | 1 | 87,287,077 |
#ifdef LOCAL
#endif
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<char> Vc;
typedef vector<P> VP;
typedef vector<vector<ll>> VV;
typedef vector<vector<int>> VVi;
typedef vector<vector<char>> VVc;
typedef vector<vector<vector<ll>>> VVV;
typedef vector<vector<vector<vector<ll>>>> VVVV;
#define REP(i, a, b) for(ll i=(a); i<(b); i++)
#define PER(i, a, b) for(ll i=(a); i>=(b); i--)
#define rep(i, n) REP(i, 0, n)
#define per(i, n) PER(i, n, 0)
const ll INF=1e18+18;
const ll MOD=1000000007;
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl;
#define YES(n) cout << ((n) ? "YES" : "NO") << endl;
#define ALL(v) v.begin(), v.end()
#define rALL(v) v.rbegin(), v.rend()
#define pb(x) push_back(x)
#define mp(a, b) make_pair(a,b)
#define Each(a,b) for(auto &a :b)
#define rEach(i, mp) for (auto i = mp.rbegin(); i != mp.rend(); ++i)
#ifdef LOCAL
#define dbg(x_) cerr << #x_ << ":" << x_ << endl;
#define dbgmap(mp) cerr << #mp << ":"<<endl; for (auto i = mp.begin(); i != mp.end(); ++i) { cerr << i->first <<":"<<i->second << endl;}
#define dbgset(st) cerr << #st << ":"<<endl; for (auto i = st.begin(); i != st.end(); ++i) { cerr << *i <<" ";}cerr<<endl;
#define dbgarr(n,m,arr) rep(i,n){rep(j,m){cerr<<arr[i][j]<<" ";}cerr<<endl;}
#define dbgdp(n,arr) rep(i,n){cerr<<arr[i]<<" ";}cerr<<endl;
#define dbgmint(n,arr) rep(i,n){cerr<<arr[i].x<<" ";}cerr<<endl;
#define dbgarrmint(n,m,arr) rep(i,n){rep(j,m){cerr<<arr[i][j].x<<" ";}cerr<<endl;}
#else
#define dbg(...)
#define dbgmap(...)
#define dbgset(...)
#define dbgarr(...)
#define dbgdp(...)
#define dbgmint(...)
#define dbgarrmint(...)
#endif
#define out(a) cout<<a<<endl
#define out2(a,b) cout<<a<<" "<<b<<endl
#define vout(v) rep(i,v.size()){cout<<v[i]<<" ";}cout<<endl
#define Uniq(v) v.erase(unique(v.begin(), v.end()), v.end())
#define fi first
#define se second
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
template<typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &p) { return s<<"("<<p.first<<", "<<p.second<<")"; }
template<typename T>istream& operator>>(istream&i,vector<T>&v)
{rep(j,v.size())i>>v[j];return i;}
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;
}
int solve(){
ll n,p;
cin>>n>>p;
string s;
cin>>s;
if(p==2||p==5){
ll ans = 0;
rep(i,n){
ll a = s[i]-'0';
if(a%p==0){
ans += i+1;
}
}
out(ans);
return 0;
}
reverse(ALL(s));
Vec v(n);
rep(i,n){
v[i] = s[i]-'0';
}
Vec sum(n+1);
Vec ten(n);
ten[0] = 1;
REP(i,1,n){
ten[i] = (ten[i-1]*10) % p;
}
rep(i,n) sum[i+1] = (v[i]*ten[i] + sum[i]) % p;
dbg(v);
dbg(sum);
map<ll,ll> mp;
ll ans = 0;
rep(i,n+1){
ans += mp[sum[i]];
mp[sum[i]]++;
}
out(ans);
return 0;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout<<std::setprecision(10);
solve();
} | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define eb emplace_back
#define mt make_tuple
#define all(x) (x).begin(), (x).end()
#define MOD 1000000007
typedef long long ll;
typedef pair <int, int> ii;
typedef pair <ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef long double ld;
ll INF=LLONG_MAX;
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
int n,p; string s;
cin >> n >> p >> s;
if(p==2||p==5){
ll ans = 0;
for(int i=0; i<n; i++)
if((s[i]-'0')%p==0)
ans+=i+1;
cout << ans << endl;
return 0;
}
map<int,int>mp;
mp[0]++;
ll now = 0, ten = 1;
ll ans = 0;
for(int i=n-1; i>=0; i--){
now = (now+(s[i]-'0')*ten)%p;
ans += mp[now];
mp[now]++;
ten = (ten*10)%p;
}
cout << ans << endl;
} | 1 | 78,417,120 |
#include <iostream>
#include <string>
#include <algorithm>
#include <math.h>
#include <vector>
#include <set>
#include <map>
using namespace std;
typedef long long LL;
static const double EPS = 1e-9;
#define FOR(i,k,n) for (int i=(k); i<(int)(n); ++i)
#define REP(i,n) FOR(i,0,n)
int main(void){
vector<int> count;
vector<string> word;
string tmp;
while(cin>>tmp){
if(find(word.begin(),word.end(),tmp) != word.end()){
int d = distance(word.begin(), find(word.begin(),word.end(),tmp));
count[d]++;
}else{
word.push_back(tmp);
count.push_back(1);
}
}
int maxn = 0,maxl = 0, mni, mli;
REP(i,count.size()){
if(count[i] > maxn) {
maxn = count[i];
mni = i;
}
if(word[i].size() > maxl){
maxl = word[i].size();
mli = i;
}
}
cout << word[mni] << " " << word[mli] << endl;
return 0;
} | #include<iostream>
#include<map>
using namespace std;
int main()
{
map<string,int> str;
map<string,int> :: iterator it;
string s,t1,t2;
int max1=0,max2=0;
while(cin >> s)
{
str[s]++;
if(s.size()>max1)
{
max1 = s.size();
t1 = s;
}
if(str[s]>max2)
{
max2 = str[s];
t2 = s;
}
}
cout << t2 << " " << t1 << "\n";
return 0;
} | 1 | 84,138,210 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
auto f = [](int x) {
cout << x << '\n';
cout << flush;
string s;
cin >> s;
if (s == "Vacant") {
exit(0);
} else if (s == "Male") {
return 0;
} else {
return 1;
}
};
int k = f(0);
int lo = 0, hi = N - 1;
while (lo <= hi) {
int mi = (lo + hi) / 2;
int t = f(mi);
if ((k == t && mi % 2 == 0) || (k != t && mi % 2 == 1)) {
lo = mi + 1;
} else {
hi = mi - 1;
}
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
int begin = 0;
int end = 2*N-2;
int query;
bool flag = true;
string S;
cout << 0 << endl;
fflush(stdout);
cin >> S;
if(S == "Vacant"){
flag = false;
}
while(flag){
string T;
query = (begin + end)/2;
if(query %2 != 0){
query++;
}
cout << query << endl;
cin >> T;
fflush(stdout);
if(T == "Vacant"){
flag = false;
break;
}
else if(S == T){
begin = query;
}
else if(S != T){
end = query;
}
if(end - begin == 2){
cout << begin + 1 << endl;
fflush(stdout);
flag = false;
}
}
} | 1 | 79,448,194 |
#include <iostream>
#include <ctype.h>
using namespace std;
int main(void){
char a;
cin >> a;
bool oomoji = isupper(a);
if(oomoji){
cout << "A" << endl;
}
else{
cout << "a" << endl;
}
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FAST ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define mp make_pair
#define pb push_back
#define lp(i,s,f) for(ll i = s; i < ll(f); i++)
#define inF freopen("input.in", "r", stdin);
#define outF freopen("output.in", "w", stdout);
#define endl '\n'
#define MOD 1000000007
#define mm(arr) memset(arr, 0, sizeof(arr))
int main(){
FAST
int t = 1;
while(t--){
char c;
cin >> c;
if(c > 'Z'){
cout << "a" << endl;
}
else{
cout << "A" << endl;
}
}
return 0;
} | 1 | 28,778,963 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
#include<set>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<pii,int> piii;
typedef pair<ll,ll> pll;
#define reps(i,f,n) for(int i = int(f); i <= int(n); i++)
#define rep(i,n) reps(i,0,int(n)-1)
#define rrep(i,n) for(int i = n-1; i >= 0; i--)
#define all(x) (x).begin(),(x).end()
#define X first
#define Y second
#define sz size()
#define eb emplace_back
int main(void){
int n;
while(cin >> n,n){
string s;
bool d = true;
bool r = true;
bool l = true;
int ans = 0;
rep(i,n){
cin >> s;
if(s == "lu"){
l = false;
}else if(s == "ld"){
l = true;
}else if(s == "ru"){
r = false;
}else if(s == "rd"){
r = true;
}
if(r == l && r != d){
d = !d;
ans++;
}
}
cout << ans << endl;
}
return 0;
} | #include<iostream>
#include<cstdio>
#include<bitset>
#include<algorithm>
#include<vector>
#include<list>
#include<queue>
#include<stack>
#include<string>
#include<string.h>
#include<cmath>
#include<utility>
#include<functional>
#include<map>
#include<set>
#include<cctype>
#include<fstream>
#define FOR(i, a, b) for( int i=(a);i<=(b);i++)
#define RFOR(i, a, b) for( int i=(a);i>=(b);i--)
#define LFOR(i, a, b) for( long long int i=(a);i<=(b);i++)
#define LRFOR(i, a, b) for(long long int i=(a);i>=(b);i--)
#define MOD 1000000007
#define INF 600000000
#define LINF 1000000000000000000
#define PI 3.14159265358979
using namespace std;
typedef long long int ll;
typedef pair< long long int, long long int> P;
int dy[5] = { 0,0,1,-1,0 };
int dx[5] = { 1,-1,0,0,0 };
int main(void) {
int n;
while (1) {
cin >> n;
if (n == 0) {
break;
}
int count = 0;
bool flag = false;
bool r = false;
bool l = false;
string f[151];
FOR(i, 1, n) {
cin >> f[i];
}
FOR(i, 1, n) {
if (f[i] == "lu") {
l = true;
if (flag == false && l == true && r == true) {
count++;
flag = true;
}
}
if (f[i] == "ru") {
r = true;
if (flag == false && l == true && r == true) {
count++;
flag = true;
}
}
if (f[i] == "ld") {
l = false;
if (flag == true && l == false && r == false) {
count++;
flag = false;
}
}
if (f[i] == "rd") {
r = false;
if (flag == true && l == false && r == false) {
count++;
flag = false;
}
}
}
cout << count << endl;
}
return 0;
} | 1 | 42,727,609 |
#include <iostream>
#include <vector>
int main(){
std::vector<int> vehicle_order;
int input_data;
while(std::cin >> input_data){
if(input_data == 0){
std::cout << vehicle_order.back() << std::endl;
vehicle_order.pop_back();
}else{
vehicle_order.push_back(input_data);
}
}
return 0;
} | #include <stdio.h>
int main() {
int temp[10];
int input;
int i = 0;
while(scanf("%d", &input) != EOF) {
if(input != 0) {
temp[i] = input;
i++;
}
else {
i--;
printf("%d\n", temp[i]);
}
}
return 0;
} | 1 | 86,034,077 |
#include <cstdio>
#include <cstring>
#define MAXN 100000000
int mins(int a,int b){
if(a<0)return b;
else if(b<0 || a<b)return a;
else return b;
}
int main(void){
int i=0,j=0,k=0;
int e=0;
scanf("%d",&e);
while(e!=0){
int gl[10][10]={0};
int ma=0;
for(i=0;i<10;i++){
for(j=0;j<10;j++){
gl[i][j]=MAXN;
}
}
for(i=0;i<e;i++){
scanf("%d%d",&j,&k);
if(ma<j || ma<k)ma=(j<k)?k:j;
scanf("%d",&(gl[j][k]));
gl[k][j]=gl[j][k];
}
for(i=0;i<=ma;i++){
gl[i][i]=0;
}
for(k=0;k<=ma;k++){
for(i=0;i<=ma;i++){
for(j=0;j<=ma;j++){
gl[i][j]=mins(gl[i][j],gl[i][k]+gl[k][j]);
}
}
}
int sum=0;
int summem=-1;
int mn=0;
for(i=0;i<=ma;i++){
for(j=0;j<=ma;j++){
sum+=gl[i][j];
}
if(summem==-1 || sum < summem){
summem=sum;
mn=i;
}
sum=0;
}
printf("%d\x0020%d\n",mn,summem);
scanf("%d",&e);
}
return 0;
} | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cctype>
#include <climits>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <list>
#include <queue>
#include <deque>
#include <algorithm>
#include <numeric>
#include <utility>
#include <complex>
#include <memory>
#include <functional>
using namespace std;
int main(){
int n;
while(cin>>n){
int ans=987654;
int cnt[2]={0};
int dp[11][11];
int memo[11]={};
for(int i=0;i<11;i++){
for(int j=0;j<11;j++){
dp[i][j]=987654;
}
}
if(n==0)break;
int a,b,c;
for(int i=0;i<n;i++){
cin>>a>>b>>c;
dp[a][b]=c;
dp[b][a]=c;
memo[a]++;
memo[b]++;
}
int N=0;
for(int i=0;i<10;i++){
if(memo[i]>0){
N++;
}
}
for(int m=0;m<N;m++){
for(int k=0;k<N;k++){
for(int i=0;i<N;i++){
for(int j=0;j<N;j++){
dp[i][j]=min(dp[i][j],dp[i][k]+dp[k][j]);
}
}
}
cnt[1]=0;
for(int i=0;i<N;i++){
cnt[1]+=dp[m][i];
}
cnt[1]-=dp[m][m];
if(ans>cnt[1]){
cnt[2]=m;
ans=cnt[1];
}
}
cout<<cnt[2]<<" "<<ans<<endl;
}
return 0;
} | 1 | 42,492 |
#include <cmath>
#include <vector>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 105;
const int M = 10005;
const long long lim = 2000000000;
const long long inf = 0x3f3f3f3f3f3f3f3f;
long long G[N][N];
long long min(int a, long long b)
{
return a < b ? a : b;
}
signed main(void)
{
int n, m; cin >> n >> m;
memset(G, 0x3f, sizeof(G));
for (int i = 0; i < N; ++i)G[i][i] = 0;
for (int i = 1; i <= m; ++i)
{
int x, y, w;
cin >> x >> y >> w;
G[x][y] = min(G[x][y], w);
}
for (int k = 0; k < n; ++k)
for (int i = 0; i < n; ++i)
for (int j = 0; j < n; ++j)
if (G[i][j] > G[i][k] + G[k][j])
G[i][j] = G[i][k] + G[k][j];
for (int i = 0; i < N; ++i)if (G[i][i] < 0)
return cout << "NEGATIVE CYCLE" << endl, 0;
for (int i = 0; i < n; ++i)
{
for (int j = 0; j < n - 1; ++j)
if (G[i][j] <= lim)
cout << G[i][j] << " ";
else cout << "INF ";
if (G[i][n - 1] <= lim)
cout << G[i][n - 1] << endl;
else cout << "INF" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i < (int)(b); i++)
#define rrep(i, a, b) for (int i = (a); i >= (int)(b); i--)
#define all(x) (x).begin(), (x).end()
using i32 = int32_t;
using i64 = int64_t;
using f32 = float;
using f64 = double;
using P = pair<int, int>;
template <class T>
bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
} else {
return false;
}
}
template <class T>
bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
} else {
return false;
}
}
template <class T>
void dump_vec(const vector<T>& v) {
auto len = v.size();
rep(i, 0, len) {
cout << v[i] << (i == (int)len - 1 ? "\n" : " ");
}
}
struct FastIO {
FastIO() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} FASTIO;
template <class T>
void warshall_floyd(vector<vector<T>>& mat, const T inf) {
const auto len = mat.size();
rep(i, 0, len) mat[i][i] = 0;
rep(k, 0, len) rep(i, 0, len) rep(j, 0, len) {
if (mat[i][k] == inf || mat[k][j] == inf) continue;
chmin(mat[i][j], mat[i][k] + mat[k][j]);
}
}
signed main() {
int V, E;
cin >> V >> E;
const auto inf = numeric_limits<i64>::max();
vector<vector<i64>> mat(V, vector<i64>(V, inf));
rep(i, 0, E) {
int u, v, w;
cin >> u >> v >> w;
mat[u][v] = w;
}
warshall_floyd(mat, inf);
rep(i, 0, V) {
if (mat[i][i] < 0) {
cout << "NEGATIVE CYCLE\n";
return 0;
}
}
rep(i, 0, V) rep(j, 0, V) {
auto w = mat[i][j];
if (w == inf)
cout << "INF";
else
cout << w;
cout << (j == V - 1 ? "\n" : " ");
}
} | 1 | 55,302,578 |
#include<iostream>
#include<cstdlib>
#include<utility>
#include<tuple>
#include<string>
#include<vector>
#include<numeric>
#include<algorithm>
#include<queue>
#include<deque>
#include<bitset>
#include<cmath>
#include<map>
#include<iomanip>
using namespace std;
using ll = long long int;
const ll mod = 1e9 + 7;
#define rep(i, a, b) for(int i = a; i < b; i++)
int gcd(int, int);
int main() {
int n, X;
cin >> n >> X;
vector<int> x(n);
rep(i, 0, n) {
cin >> x[i];
x[i] = abs(X - x[i]);
}
if (n == 1) {
cout << x[0] << endl;
return 0;
}
int ans = gcd(x[0], x[1]);
rep(i, 1, n) {
ans = gcd(ans, x[i]);
}
cout << ans << endl;
return 0;
}
int gcd(int m, int n) {
ll temp;
while (m % n != 0) {
temp = n;
n = m % n;
m = temp;
}
return n;
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using Map = map<ll,ll>;
using T = tuple<ll,ll,ll>;
using vvl = vector<vector<ll>>;
#define all(v) v.begin(), v.end()
#define print(v) cout<<v<<endl;
#define fi(v) get<0>(v)
#define se(v) get<1>(v)
#define th(v) get<2>(v)
template <typename T> bool chmax(T &a, const T &b){if (a<b){a=b;return 1;}return 0;}
template <typename T> bool chmin(T &a, const T &b){if (a>b){a=b;return 1;}return 0;}
const ll INF=1LL<<60;
const ll MOD=1000000007;
ll gcd(ll a,ll b) {
while(1) {
if(a < b) swap(a, b);
if(!b) break;
a %= b;
}
return a;
}
int main(){
ll N;
cin >> N;
ll X;
cin >> X;
vector<ll> x(N,0);
for(ll i=0;i<N;i++)cin>>x[i];
vector<ll> y(N,0);
for(ll i=0;i<N;i++)y[i]=llabs(x[i]-X);
ll ans=y[0];
for(ll i=0;i<N;i++){
ans=gcd(ans,y[i]);
}
print(ans)
return 0;
} | 1 | 36,453,112 |
#include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <functional>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <complex>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
long long n, x, m, i, j, k, ans, c, ct, a, ss;
cin >> n >> x >> m;
vector<long long> last(m, -1), s(m);
ans = 0;
ss = 0;
for (i = 1; i <= n; i++) {
if (i == 1) a = x;
else a = (a * a) % m;
ss += a;
if (last[a] == -1) {
last[a] = i;
ans += a;
s[a] = ss;
}
else {
c = i - last[a];
ct = (n - last[a]) / c;
ans = s[a] + ct * (ss - s[a]);
i = last[a] + ct * c;
for (j = i + 1; j <= n; j++) {
a = (a * a) % m;
ans += a;
}
break;
}
}
cout << ans << "\n";
return 0;
} | #include<bits/stdc++.h>
#define ll long long int
#define db long double
#define ull unsigned long long int
#define F first
#define S second
#define pb push_back
#define rep(i,a,b) for(ll i=a;i<=b;i++)
#define all(a) a.begin(),a.end()
#define Nmax 1000005
#define MOD 1000000007
#define MAXN 200005
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int tests=1;
while(tests--)
{
ll i,j,n,m,x;
cin>>n>>x>>m;
x%=m;
map<ll,ll>mpp;
mpp[x]=1;
vector<ll>v;
v.pb(0);
v.pb(x);
ll period=-1;
ll cnt=1;
while(true)
{
x*=x;
x%=m;
if(mpp.find(x)!=mpp.end())
{
period=v.size()-mpp[x];
break;
}
else
{
mpp[x]=v.size();
v.pb(x);
}
cnt++;
if(cnt==n) break;
}
if(period==-1)
{
ll ans=0;
for(auto x:v) {ans+=x;}
cout<<ans;
return 0;
}
vector<ll>c;
cnt=0;
ll persum=0;
while(cnt<period)
{
c.pb(v.back());
persum+=v.back();
v.pop_back();
cnt++;
}
ll ans=0;
n-=v.size()-1;
for(auto x:v) {ans+=x;}
ans+=((n/period)*(persum));
n%=period;
reverse(all(c));
rep(i,0,n-1)
{
ans+=c[i];
}
cout<<ans;
}
return 0;
} | 1 | 68,867,829 |
#include<stdio.h>
#include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <iomanip>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define ld long double
#define rep(a,t) for(int a=0;a<t;a++)
#define forever while(true)
#define Sort(a) sort(a.begin(),a.end())
#define Reverse(a) reverse(a.begin(),a.end())
#define pb push_back
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
ld x1, y1, x2, y2, x3, y3, x4, y4;
rep(i, n) {
cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> x4 >> y4;
if (x1 == x2 || x3 == x4) { if (x1 == x2 && x3 == x4) { cout << "YES" << endl; } else { cout << "NO" << endl; } continue; }
ld katamuki[2];
katamuki[0] = (y2 - y1) / (ld)(x2 - x1);
katamuki[1] = (y4 - y3) / (ld)(x4 - x3);
if (katamuki[0] == katamuki[1]) { cout << "YES" << endl; }
else { cout << "NO" << endl; }
}
return 0;
} | #include <iostream>
#include <cmath>
using namespace std;
int main() {
int n;
double x1, y1, x2, y2, x3, y3, x4, y4;
double da;
cin >> n;
for(int i = 0; i < n; i++) {
cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> x4 >> y4;
da = (y2 - y1) * (x4 - x3) - (y4 - y3) * (x2 - x1);
if(fabs(da) < 1e-10) { da = 0.0; }
if(da == 0.0) { cout << "YES" << endl; }
else { cout << "NO" << endl; }
}
return 0;
} | 1 | 76,956,303 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, s, n) for(int i = s; i < (int)n; i++)
#define per(i, n) for(int i = n; i >= 0; i--)
#define ROF(i, s, n) for(int i = s; i >= (int)n; i--)
#define FORIT(i, A) for (auto i : A)
#define PRINT(x) cout << (x) << "\n"
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define MP make_pair
#define EACH(i, n) for (__typeof((n).begin()) i = (n).begin(); i != (n).end(); ++i)
#define SZ(a) int((a).size())
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define CLR(a) memset((a), 0 ,sizeof(a))
#define NCLR(a) memset((a), -1 ,sizeof(a))
#define dump(x) cout << #x << " = " << (x) << "\n";
#define debug(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << "\n";
#define sq(n) (n) * (n)
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef priority_queue<int> maxpq;
typedef priority_queue< int, vector<int>, greater<int> > minpq;
typedef complex<double> P;
static const double EPS = 1e-10;
static const double PI = acos( -1.0 );
static const int mod = 1000000007;
static const int INF = 1 << 30;
static const LL LL_INF = 1152921504606846976;
static const int dx[] = { -1, 0, 1, 0, 1, -1, 1, -1 };
static const int dy[] = { 0, -1, 0, 1, 1, 1, -1, -1 };
bool collision_detection( double x1, double y1, double x2, double y2, double x3, double y3, double xp, double yp ) {
x2 -= x1;
x3 -= x1;
xp -= x1;
y2 -= y1;
y3 -= y1;
yp -= y1;
double t_size = fabs( ( x2 * y3 - y2 * x3 ) / 2 );
t_size -= fabs( ( x2 * yp - y2 * xp ) / 2 );
t_size -= fabs( ( x3 * yp - y3 * xp ) / 2 );
x2 -= xp;
x3 -= xp;
y2 -= yp;
y3 -= yp;
yp = xp = 0;
t_size -= fabs( ( x2 * y3 - y2 * x3 ) / 2 );
return fabs( t_size ) < 1e-10;
}
int main() {
double x1, y1, x2, y2, x3, y3, xp, yp;
while ( ~scanf( "%lf %lf %lf %lf %lf %lf %lf %lf", &x1, &y1, &x2, &y2, &x3, &y3, &xp, &yp ) ) {
printf( "%s\n", collision_detection( x1, y1, x2, y2, x3, y3, xp, yp ) ? "YES" : "NO" );
}
return 0;
} | #include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
struct Point {
double x, y;
};
double len(Point p1, Point p2) {
return sqrt((p1.x - p2.x)*(p1.x - p2.x) + (p1.y - p2.y)*(p1.y - p2.y));
}
double area(Point *points) {
double a = len(points[0], points[1]);
double b = len(points[1], points[2]);
double c = len(points[2], points[0]);
double s = (a + b + c) / 2;
return sqrt(s*(s - a)*(s - b)*(s - c));
}
int is_in(Point *points, Point search) {
double src = area(points);
double a, b, c;
swap(points[0], search);
a = area(points);
swap(points[0], search);
swap(points[1], search);
b = area(points);
swap(points[1], search);
swap(points[2], search);
c = area(points);
swap(points[2], search);
if (src - 1e-5 < a + b + c && a + b + c < src + 1e-5) {
return 1;
}
else {
return 0;
}
}
int main() {
while (1) {
Point points[3];
Point search;
for (int i = 0; i < 3; i++) {
if (!(cin >> points[i].x >> points[i].y)) {
return 0;
}
}
cin >> search.x >> search.y;
if (is_in(points, search) == 1) {
cout << "YES\n";
}
else {
cout << "NO\n";
}
}
return 0;
} | 1 | 85,638,153 |
#include<bits/stdc++.h>
#define rep(i,n) for(ll i = 0;i < n;++i)
#define all(v) v.begin(),v.end()
using namespace std;
using ll = long long;
typedef pair<int,int> P;
const int INF = 1001001001;
const long double PI = (acos(-1));
const int mod = 1e9+7;
const int vx[6] = {0,1,0,-1,1,-1};
const int vy[6] = {1,0,-1,0,1,1};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n,cc;
cin >> n >> cc;
vector<vector<int>> graph(n);
rep(i,n-1){
int x,y;
cin >> x >> y;
x--;y--;
graph[x].push_back(y);
graph[y].push_back(x);
}
vector<int> c(n,0);
rep(i,cc){
int p,x;
cin >> p >> x;
p--;
c[p] += x;
}
queue<int> q;
q.push(0);
vector<int> memo(n,-1);
while(!q.empty()){
int x = q.front();q.pop();
memo[x] = 1;
for(auto t : graph[x]){
if(t == 0) continue;
if(memo[t] != -1) continue;
c[t] += c[x];
q.push(t);
}
}
rep(i,n){
cout << c[i] << " ";
}
cout << endl;
return 0;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(a) (a).begin(),(a).end()
vector<bool> seen;
vector<int> counter;
template <typename T>
void cout_vector(vector<T> A)
{
for (T a : A)
cout << a << " ";
cout << endl;
}
void dfs(const Graph &G, int c, int p){
for (int j: G[c]){
if (j != p){
counter[j] += counter[c];
dfs(G, j, c);
}
}
}
int main()
{
int N, Q;
cin >> N >> Q;
seen.assign(N, false);
counter.assign(N, 0);
Graph G(N);
for (int i = 0; i < N - 1; i++)
{
int a, b;
cin >> a >> b;
a--;
b--;
G[a].push_back(b);
G[b].push_back(a);
}
for (int i = 0; i < Q; i++)
{
int p, x;
cin >> p >> x;
p--;
counter[p] += x;
}
dfs(G, 0, -1);
for (int n: counter){
cout << n << " ";
}
cout << "\n";
} | 1 | 59,368,176 |
#include <stdio.h>
int main(){
int a[10000],k,l;
l =0;
while(1){
scanf("%d",&k);
if(k == 0){
break;
}
a[l]=k;
l++;
}
for(k=0;k<l;k++){
printf("Case %d: %d\n",k+1,a[k]);
}
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int x,i=1;
while(cin>>x && x != 0)
cout<<"Case "<<i++<<": "<<x<<endl;
return 0;
} | 1 | 14,615,172 |
#include <iostream>
#include <cstdio>
#include <set>
using namespace std;
int main(void){
char s[13];
char b[7];
std::set<string> m;
int a;
scanf("%d",&a);
while(a--){
scanf("%s %s",b,s);
if(b[0]=='i')m.insert(s);
else{
if(m.find(s)!=m.end())cout<<"yes"<<endl;
else cout<<"no"<<endl;
}
}
return 0;
} | #include <iostream>
#include <cstring>
using namespace std;
static const int MAX = 1000003;
static const int STRLEN = 13;
static const int CMDLEN = 7;
static const int KEYLEN = 14;
char H[MAX][KEYLEN];
int h1(int key) {
return key % MAX;
}
int h2(int key) {
return 1 + (key % (MAX - 1));
}
int getChar(char c) {
if (c == 'A') return 1;
else if (c == 'C') return 2;
else if (c == 'G') return 3;
else if (c == 'T') return 4;
else return 0;
}
long long getKey(char str[]) {
long long sum = 0, p = 1;
for (int i = 0; i < strlen(str); i++) {
sum += p * (getChar(str[i]));
p *= 5;
}
return sum;
}
int find(char str[]) {
long long key, i = 0, h;
key = getKey(str);
while (1) {
h = (h1(key) + i * h2(key)) % MAX;
if (strcmp(H[h], str) == 0) {
return 1;
} else if (strlen(H[h]) == 0) {
return 0;
}
i++;
}
return 0;
}
int insert(char str[]) {
long long key, i = 0, h;
key = getKey(str);
while (1) {
h = (h1(key) + i * h2(key)) % MAX;
if (strcmp(H[h], str) == 0) {
return 1;
} else if (strlen(H[h]) == 0) {
strcpy(H[h], str);
return 0;
}
i++;
}
return 0;
}
int main (void) {
int n;
cin >> n;
for (int i = 0; i < MAX; i++) {
H[i][0] = '\0';
}
char str[STRLEN], cmd[CMDLEN];
for (int i = 0; i < n; i++) {
cin >> cmd >> str;
if (cmd[0] == 'i') {
insert(str);
} else if (cmd[0] == 'f') {
if (find(str)) {
cout << "yes" << endl;
} else {
cout << "no" << endl;
}
}
}
return 0;
} | 1 | 80,893,594 |
#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ll long long
#define db double
#define el "\n"
#define ld long double
#define rep(i,n) for(int i=0;i<n;i++)
#define rev(i,n) for(int i=n;i>=0;i--)
#define rep_a(i,a,n) for(int i=a;i<n;i++)
#define tr(ds, it) for(auto it=ds.begin(); it!=ds.end(); it++)
#define rtr(ds, it) for(auto it=ds.rbegin(); it!=ds.rend(); it--)
#define all(ds) ds.begin(), ds.end()
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
typedef priority_queue <int> pq;
typedef vector< long long > vi;
typedef pair<long long, long long> ii;
#define o_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update>
const ll mod = 1000000007;
ll po(ll x, ll n ){
ll ans=1;
while(n>0){
if(n&1) ans=(ans*x)%mod;
x=(x*x)%mod;
n/=2;
}
return ans;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int T=1;
while(T--){
ll n,k;
cin>>n>>k;
ll a[n];
rep(i,n) cin>>a[i];
ll p[n]={0};
p[0]=a[0];
rep_a(i,1,n) p[i]=p[i-1]+a[i];
ll d[n];
rep(i,n) d[i]=p[i]-i-1;
ll r[n+1];
r[0]=0;
rep(i,n) r[i+1]=d[i]%k;
map<ll,ll>m;
ll ans=0;
rep(i,min(k,n+1)){
m[r[i]]++;
}
tr(m,h){
ans+=((h->ss)*((h->ss)-1))/2;
}
rep_a(i,k,n+1){
m[r[i-k]]--;
if(m[r[i-k]]==0) m.erase(r[i-k]);
if(m.find(r[i])!=m.end()) ans+=m[r[i]];
m[r[i]]++;
}
cout<<ans<<el;
}
return 0;
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cstring>
#include <complex>
#include <stack>
#include <queue>
#include <unordered_map>
#include <set>
#include <deque>
#include <map>
#include<functional>
#define INF 1000000000
#define rep(i, a) for (int i = 0; i < (a); i++)
using namespace std;
using P = pair<long, long>;
const int MAX = 1000000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(int n, int k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
int main(){
long long n, k;
cin >> n >> k;
vector<long long> s;
s.push_back(0);
long long i;
for(i = 0; i < n; i++){
long long a;
cin >> a;
s.push_back(s[s.size()-1] + a);
}
for(i = 0; i < n+1; i++){
s[i] -= i;
s[i] %= k;
}
map<long long, long long> m;
for(i = 0; i < k; i++){
if(i < n+1) m[s[i]]++;
}
long long cnt = 0;
for(i = 0; i <= n; i++){
cnt += m[s[i]]-1;
m[s[i]]--;
if(i+k <= n){
m[s[i+k]]++;
}
}
cout << cnt << endl;
} | 1 | 41,483,912 |
#include <bits/stdc++.h>
#define mp make_pair
#define ff first
#define ss second
using namespace std;
using vi=vector<int>;
using pii=pair<int, int>;
using ull=unsigned long long;
using ll=long long;
int m[3][3];
bool ac[3][3];
bool verify()
{
for (int i = 0; i < 3; i++)
if (ac[i][0] == 1 && ac[i][1] == 1 && ac[i][2] == 1)
return true;
for (int i = 0; i < 3; i++)
if (ac[0][i] == 1 && ac[1][i] == 1 && ac[2][i] == 1)
return true;
if (ac[0][0] == 1 && ac[1][1] == 1 && ac[2][2] == 1)
return true;
if (ac[0][2] == 1 && ac[1][1] == 1 && ac[2][0] == 1)
return true;
return false;
}
void search(int n){
for (int i = 0; i < 3; i++)
for (int j = 0; j < 3; j++)
if (m[i][j] == n)
ac[i][j] = 1;
}
int main()
{
for (int i = 0; i < 3; i++)
for (int j = 0; j < 3; j++)
cin >> m[i][j];
int n; cin >> n;
for (int i = 0; i < n; i++){
int num;
cin >> num;
search(num);
}
if (verify())
cout << "Yes\n";
else
cout << "No\n";
} | #include<iostream>
using namespace std;
int main()
{
long long i,j,a[5][5],n,k,x,r[5]={0},c[5]={0},l,f=0,h=0,d=0;
for(i=1;i<=3;i++)
{
for(j=1;j<=3;j++)
{
cin>>a[i][j];
}
}
cin>>n;
for(k=1;k<=n;k++)
{
cin>>x;
for(i=1;i<=3;i++)
{
for(j=1;j<=3;j++)
{
if(a[i][j]==x)
{
r[i]=r[i]+1;
c[j]=c[j]+1;
if(i==j)
{
h++;
}
if((i==1&&j==3)||(i==2&&j==2)||(i==3&&j==1))
{
d++;
}
}
}
}
}
for(l=1;l<=3;l++)
{
if(r[l]==3||c[l]==3||h==3||d==3)
{
f++;
cout<<"Yes"<<endl;
break;
}
}
if(f==0)
{
cout<<"No"<<endl;
}
return 0;
} | 1 | 45,624,159 |
#include<math.h>
#include <bits/stdc++.h>
#include <algorithm>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define ll long long int
#define py printf("Yes\n")
#define pn printf("No\n")
#define in cin>>
using namespace std;
const int INF = 1001001001;
int main()
{
int n,d,x,ans=0;
in n>>d>>x;
vector<int> a(n);
rep(i,n)in a[i];
rep(i,n)
{
rep(j,d)
{
int hako=a[i]*j+1;
if(hako<=d)ans++;
}
}
cout<<ans+x<<endl;
} | #include <bits/stdc++.h>
using namespace std;
int n,x,a[150],d,sum,k,s;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
cin>>n>>d>>x;
for(int i=1;i<=n;i++){
cin>>a[i];
}
for(int i=1;i<=n;i++){
for(int j=1;j<=d;j++){
sum=0;
sum+=(j*a[i]+1);
if(sum<=d)k++;
}}
s+=k;
s+=n;
s+=x;
cout<<s;
return 0;} | 1 | 34,470,592 |
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
int main()
{
int a,m;
while(~scanf("%d",&a))
{
m=a/3;
printf("%d\n",m);
}
return 0;
} | #include<iostream>
#include<algorithm>
#include<functional>
#include<cmath>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<deque>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;
const double PI = 3.14159265358979323846264338327950288;
int main()
{
int N;
cin >> N;
cout << N / 3 << endl;
} | 1 | 100,107,793 |
#include <iostream>
#include <math.h>
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a,b;
cin>>a>>b;
if(a==b)
cout<<"Draw";
else if(a==1)
cout<<"Alice";
else if(b==1)
cout<<"Bob";
else if(a>b)
cout<<"Alice";
else if(b>a)
cout<<"Bob";
return 0;
} | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A == B) cout << "Draw" << endl;
else {
if (A == 1 || B == 1) cout << (A == 1 ? "Alice" : "Bob") << endl;
else cout << (A > B ? "Alice" : "Bob") << endl;
}
} | 1 | 11,000,701 |
#include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x) cout << x << endl;
#define println(x) cout << x << endl;
using namespace std;
int main()
{
ll w, h, x, y;
cin >> w >> h >> x >> y;
cout << (ld)(w * h) / 2 << " " << ((2 * x == w && 2 * y == h) ? 1 : 0) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define INF 100000000
#define rep(i,s,n) for (int i = (int)(s); i < (int)(n); i++)
#define repp(i,n,s) for (int i= (int)(n); i >= (int)(s); i--)
#define mp make_pair
ll mod = 1000000007;
ll mod2 = 998244353;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ld w,h;cin>>w>>h;
ld x,y;cin>>x>>y;
cout<<h*w/2<<endl;
int ans = (h/2==y && w/2==x)?1:0;
cout<<ans<<endl;
} | 1 | 58,017,328 |
#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; }
int main()
{
int h,w;
cin >> h >> w;
string s[h];
for (int i = 0; i < h; i++)
{
cin >> s[i];
}
vector<vector<int>> dp(h, vector<int>(w, INT_MAX - 100));
int dx[] = {0, 1, 0, -1};
int dy[] = {1, 0, -1, 0};
dp[0][0] = (s[0][0] == '#');
for (int i = 0; i < h; i++)
{
for (int j = 0; j < w; j++)
{
for (int k = 0; k < 2; k++)
{
if(0 <= i + dy[k] && i + dy[k] < h && 0 <= j + dx[k] && j + dx[k] < w)
{
if(s[i + dy[k]][j + dx[k]] == '#' && s[i][j] == '#')chmin(dp[i + dy[k]][j + dx[k]], dp[i][j]);
else if(s[i + dy[k]][j + dx[k]] == '#' && s[i][j] == '.')chmin(dp[i + dy[k]][j + dx[k]], dp[i][j] + 1);
else if(s[i + dy[k]][j + dx[k]] == '.' && s[i][j] == '#')chmin(dp[i + dy[k]][j + dx[k]], dp[i][j]);
else chmin(dp[i + dy[k]][j + dx[k]], dp[i][j]);
}
}
}
}
cout << dp[h - 1][w - 1] << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll, ll> Pll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repn(i, n) for (int i = 0; i <= (int)(n); i++)
#define srep(i, l, n) for (int i = l; i < (int)(n); i++)
#define srepn(i, l, n) for (int i = l; i <= (int)(n); i++)
#define pb push_back
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const int MOD = 1000000007;
const int INF = 1e9;
#define PI 3.14159265369;
int dx[4] = {1,-1,0,0};
int dy[4] = {0,0,1,-1};
int ddx[8] = {1,1,1,-1,-1,-1,0,0};
int ddy[8] = {0,1,-1,0,1,-1,1,-1};
void solve(){
int h, w;
cin >> h >> w;
char maze[h][w];
int dp[h+1][w+1];
for(int i = 0; i < h; i++){
for(int j = 0; j < w; j++){
cin >> maze[i][j];
dp[i][j] = INF;
}
}
dp[0][0] = 0;
for(int i = 0; i < h; i++){
for(int j = 0; j < w; j++){
if(i!=h-1)chmin(dp[i+1][j], dp[i][j]+(maze[i+1][j]!=maze[i][j]));
if(j!=w-1)chmin(dp[i][j+1], dp[i][j]+(maze[i][j+1]!=maze[i][j]));
}
}
int ans = dp[h-1][w-1]+(maze[0][0]=='#')+(maze[h-1][w-1]=='#');
cout << ans/2 << endl;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
solve();
} | 1 | 85,329,573 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int k, s, sum=0;
cin >> k >> s;
for(int x=0; x <= k; x++){
if(x > s) break;
for(int y=0; y <= k; y++){
if((x+y) > s) break;
if((s-(x+y)) <= k) sum++;
}
}
cout << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int k, s;
cin >> k >> s;
int answer = 0;
for (int x = 0; x <= k; x++) {
for (int y = 0; y <= k; y++) {
int z = s - x - y;
if (0 <= z && z <= k) answer++;
}
}
cout << answer;
} | 1 | 11,320,470 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,x) for(int i=0;i<x;i++)
#define put(ans) cout << ans << endl;
int main(){
map<int,int> ac;
map<int,int> wa;
int n,m;
cin >> n >> m;
rep(i,m){
int p;
string s;
cin >> p >> s;
if(s=="AC"){
ac[p]++;
}else{
if(!ac.count(p))
wa[p]++;
}
}
int ans_wa(0);
for(auto a : wa){
if(ac.count(a.first))
ans_wa += a.second;
}
cout << ac.size() << " " << ans_wa << endl;
return 0;
} | #include <bits/stdc++.h>
const double pi = 3.141592653589793238462643383279;
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
typedef pair<int, PII> TIII;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SQ(a) ((a)*(a))
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define FOR(i,s,n) for(int i=s;i<(int)n;++i)
#define REP(i,n) FOR(i,0,n)
#define MOD 1000000007
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
const double EPS = 1E-10;
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
const int MAX = 2000010;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(int n, int k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int N, M;
map<int, int> mp;
bool used[100010];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
cin >> N >> M;
int ac = 0, pena = 0;
REP(i,M){
int p;
string s;
cin >> p >> s;
if(!used[p] && s == "AC"){
pena += mp[p];
ac++;
used[p] = true;
}else{
mp[p]++;
}
}
cout << ac << " " << pena << endl;
return 0;
} | 1 | 82,078,708 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> cnt(n + 1);
for (int i = 2; i <= n; ++i) {
int p = i;
for (int j = 2; j * j <= p; ++j) {
while (p % j == 0) {
++cnt[j];
p /= j;
}
}
if (p > 1) {
++cnt[p];
}
}
vector<int> dp(76);
dp[1] = 1;
for (int i = 0; i <= n; ++i) {
vector<int> next(76);
for (int j = 0; j <= cnt[i]; ++j) {
for (int k = 1; (j + 1) * k < 76; ++k) {
next[(j + 1) * k] += dp[k];
}
}
dp = next;
}
cout << dp[75] << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;cin>>n;
map<int,int>a;
set<int>b;
for(int i=2;i<=n;++i){
int m=i;
for(int j=2;j*j<=m;++j){
if(m%j==0){
b.insert(j);
while(m%j==0){
m/=j;
a[j]++;
}
}
}
if(m!=1){a[m]++;b.insert(m);}
}
int c74=0,c24=0,c14=0,c4=0,c2=0;
for(auto x:b){
if(a[x]>=74)c74++;
else if(24<=a[x])c24++;
else if(14<=a[x])c14++;
else if(4<=a[x])c4++;
else if(2<=a[x])c2++;
}
int ans=0;
ans+=c74;
ans+=(c74+c24)*((c74+c24)-1)+(c74+c24)*(c14+c4+c2);
ans+=(c74+c24+c14)*(c74+c24+c14-1)+(c74+c24+c14)*c4;
ans+=(c74+c24+c14+c4)*(c74+c24+c14+c4-1)*(c74+c24+c14+c4-2)/2+(c74+c24+c14+c4)*(c74+c24+c14+c4-1)/2*c2;
cout<<ans<<endl;
} | 1 | 18,586,552 |
#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);}
int main(){
int n;
cin>> n;
vector<int> A(n) ;
rep(i,n) cin>> A[i] ;
int ans=0 ;
int k= 0;
rep(i,n-1){
if(A[i]!=A[i+1]){
ans+= (k+1)/2 ;
k=0 ;
}
else if(i==n-2){
ans+= (k+2)/2 ;
}
else
k++ ;
}
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define sz size
#define se second
#define fe first
#define mper make_pair
#define all(x) x.begin(), x.end()
#define mal ios_base::sync_with_stdio(NULL);cin.tie(NULL);cout.tie(NULL);
#define saken string
#define erba continue
#define vl vector<ll>
#define vi vector<int>
#define vli vector <pair <ll, int> >
#define vll vector <pair <ll, ll> >
using namespace std;
ll n, a[110];
int main(){
cin >> n;
for(int i = 1; i <= n; ++i) {
cin >> a[i];
}
ll ct = 1;
ll ans = 0;
for(int i = 2; i <= n; ++i) {
if(a[i] != a[i - 1]) {ans += ct / 2; ct = 1;}
else {ct++;}
}
ans += ct / 2;
cout << ans;
return 0;
} | 1 | 18,938,823 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); ++i)
#define cout(x) cout<<x<<endl
#define all(v) v.begin(), v.end()
using namespace std;
using vi = vector<int>;
using ll = long long;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
const ll inf = 1e18;
const int N = 2e5 + 10;
int main(){
int h,w;
cin >> h >> w;
vector<string> a(h);
rep(i,h) cin >> a[i];
string t;
rep(i,w) t += '.';
for(int i=0; i<h; ++i){
if(t == a[i]){
a.erase(a.begin()+i);
i = -1;
--h;
}
}
for(int j=0; j<w; ++j){
bool can = true;
for(int i=0; i<h; ++i){
if(a[i][j] != '.') can = false;
}
if(can){
for(int i=0; i<h; ++i) a[i].erase(j,1);
j = -1;
--w;
}
}
rep(i,h) cout(a[i]);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int w,h;
cin>>w>>h;
char g[w][h];
for(int i=0;i<w;i++)
for(int j=0;j<h;j++)
cin>>g[i][j];
int row_present[w]={0};
int col_present[h]={0};
for(int i=0;i<w;i++)
{
int c=0;
for(int j=0;j<h;j++)
{
if(g[i][j]=='.')
c++;
}
if(c==h) row_present[i]++;
}
for(int i=0;i<h;i++)
{
int c=0;
for(int j=0;j<w;j++)
{
if(g[j][i]=='.')
c++;
}
if(c==w) col_present[i]++;
}
for(int i=0;i<w;i++)
{
if(row_present[i]==0)
{
for(int j=0;j<h;j++)
{
if(col_present[j]==0)
cout<<g[i][j];
}
cout<<endl;
}
}
return 0;
} | 1 | 26,262,954 |
#include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define INF 999999999
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define SORT(c) sort((c).begin(),(c).end())
#define ALL(a) (a).begin(),(a).end()
typedef long long ll;
typedef pair<int,int> P;
typedef vector<int> Vi;
int a[100][100];
int main(){
FOR(i,1,10){
FOR(j,1,10){
printf("%dx%d=%d\n",i,j,i*j);
}
}
return 0;
} | #include "bits/stdc++.h"
#define debug(x) cout<<#x<<": "<<x<<endl
#define rep(i,n) for (int i=0;i<(n);i++)
#define FOR(i,a,b) for (int i=(a);i<=(b);i++)
#define all(a) (a).begin(),(a).end()
using namespace std;
typedef vector<int> VI;
typedef vector<vector<int>> VVI;
typedef long long ll;
void solve() {
#ifdef _WIN32
istream &cin = ifstream("input.txt");
#endif
for (int i = 1; i < 10; i++) {
for (int j = 1; j < 10; j++) {
cout << i << "x" << j << "=" << i * j << endl;
}
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
#ifdef _WIN32
system("PAUSE");
#endif
return 0;
} | 1 | 94,684,629 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> num(N);
for (int i = 0; i < N; i++) {
cin >> num.at(i);
}
sort(num.begin(), num.end());
vector<int> a(N);
int count = 0;
int check = num.at(0);
for(int i = 0; i < N; i++) {
if (num.at(i) == check) {
count++;
if (i == N - 1) {
a.at(i) = count;
}
}
else {
a.at(i) = count;
count = 1;
if (i == N - 1) {
a.at(0) = count;
}
check = num.at(i);
}
}
sort(a.begin(), a.end());
reverse(a.begin(), a.end());
int ans = 0;
for (int i = K; i < N; i++) {
ans += a.at(i);
}
cout << ans << endl;
} | #include<iostream>
#include<algorithm>
using namespace std;
int N_MAX = 200000;
int main()
{
int n,k,a,i,res=0;
int c[N_MAX];
cin >> n >> k;
fill(c,c+n,0);
for(i=0;i<n;i++){
cin >> a;
c[a-1]++;
}
sort(c,c+n,greater<int>());
for(i=0;i<k;i++)
res+=c[i];
res=n-res;
cout << res << endl;
return 0;
} | 1 | 80,616,755 |
#include<iostream>
#include<bits/stdc++.h>
#define ll long long int
#define pb push_back
#define mp make_pair
#define M 998244353
#define inarr(arr,n); for(ll i=0;i<n;i++) cin >> arr[i];
#define outarr(arr,n); for(ll i=0;i<n;i++) cout<<arr[i]<<" ";
#define ios ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
ll power(ll a,ll n)
{
if(n==0){
return 1;
}
ll p=power(a,n/2) % M;
p = (p * p) % M;
if (n%2==1)
{
p=(p*a)%M;
}
return p;
}
ll gcd(ll a, ll b)
{
if (a == 0)
return b;
return gcd(b % a, a);
}
int main(){
ios;
ll s,w;
cin>>s>>w;
if(w>=s){
cout<<"unsafe"<<endl;
}
else{
cout<<"safe"<<endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin >> n>> k;
if(n<=k)cout << "unsafe" <<endl;
else cout <<"safe" <<endl;
} | 1 | 18,343,547 |
#include<bits/stdc++.h>
using namespace std;
int main(void){
char b;
cin >> b;
if(b == 'A')
cout << "T" << "\n";
if(b == 'T')
cout << "A" << "\n";
if(b == 'C')
cout << "G" << "\n";
if(b == 'G')
cout << "C" << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{char b; cin >> b;
string s = "ACGT";
cout << "TGCA"[find(s.begin(), s.end(), b) - s.begin()] << endl;} | 1 | 71,752,768 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,k,n) for(int i = (k); i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define INF 114514810
#define ALL(a) (a).begin(),(a).end()
#define pb(x) push_back(x)
#define ms(m,v) memset(m,v,sizeof(m))
#define D10 fixed<<setprecision(10)
typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int, int> P;
typedef long long ll;
struct edge{ int from, to, cost; };
int main()
{
int n, m;
while (cin >> n >> m, n)
{
vector<P> v;
REP(i, n)
{
int a, b;
cin >> a >> b; v.push_back(P(b, a));
}
sort(ALL(v));
for (int i = n-1; i>=0&&m>0; i--)
{
if (v[i].second <= m)
{
m -= v[i].second;
v[i].second = 0;
}
else
{
v[i].second -= m;
m = 0;
}
}
int sum = 0;
REP(i, n) sum += v[i].first*v[i].second;
cout << sum << endl;
}
return 0;
} | #include<iostream>
#include<vector>
#include<algorithm>
#include<utility>
#include<string>
#include<cmath>
#include<cstring>
#include<queue>
#include<map>
#include<climits>
#include<set>
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long
#define pb(a) push_back(a)
using namespace std;
typedef pair<int, int> pii;
typedef long long int ll;
typedef pair<ll,ll> pll;
int dx[4] = {1,0,0,-1};
int dy[4] = {0,1,-1,0};
#define MOD 1000000007
#define ARRAY_MAX 100005
const int INF = 1e9+7;
int main(){
int n,m;
while(cin >> n >> m,n|m){
int cost = 0;
int dist = 0;
vector<pii> a(n);
for(int i = 0;i < n;i++){
cin >> a[i].second >> a[i].first;
cost += a[i].second * a[i].first;
dist += a[i].second;
}
int tmp = dist - m;
if(tmp <= 0){
cout << "0" << endl;
}else{
sort(a.begin(),a.end());
int cnt = 0;
int ans = 0;
for(int i = 0;i < n;i++){
if(cnt + a[i].second <= tmp){
ans += a[i].first * a[i].second;
cnt += a[i].second;
}else{
while(cnt < tmp){
ans += a[i].first;
cnt++;
}
}
}
cout << ans << endl;
}
a.shrink_to_fit();
}
return 0;
} | 1 | 50,050,309 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<int, int> P;
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define Z class
template <typename T>
T square(T x) { return x * x; }
#define chmax(x, y) (x = max(x, y))
#define chmin(x, y) (x = min(x, y))
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repd(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= (b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (b); i--)
#define FORA(i, I) for (const auto &i : I)
#define ALL(x) x.begin(), x.end()
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define isYES(x) printf("%s\n", (x) ? "YES" : "NO")
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define ln cout << '\n'
template <Z A>
void pr(A a)
{
cout << a;
ln;
}
template <Z A, Z B>
void pr(A a, B b)
{
cout << a << ' ';
}
int ans = 0;
bool check = 0;
string s, t;
int N = 3;
vector<int> v(N);
int a, b;
int x, y;
int main()
{
cin >> a >> b;
pr(a * (a - 1) / 2 + b * (b - 1) / 2);
} | #include <iostream>
using namespace std;
int N;
int M;
int main(){
cin >> N >> M;
cout << (N * (N - 1) / 2) + (M * (M - 1) / 2);
} | 1 | 11,887,900 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S.size() < 4) cout << "No" << endl;
else if (S.substr(0, 4) != "YAKI") cout << "No" << endl;
else cout << "Yes" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
bool flag = true;
string yaki = "YAKI";
if (S.size() < 4) {
flag = false;
} else {
for (int i; i < 4; i++) {
if (S.at(i) != yaki.at(i)) {
flag = false;
}
}
}
if (flag) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | 1 | 66,366,118 |
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdlib>
#include<queue>
#include<set>
#include<cstdio>
using namespace std;
#define ll long long
#define rep(i, n) for(int i = 0; i < n; i++)
#define P pair<int, int>
typedef vector<int> vec;
typedef vector<vec> mat;
const ll mod = 1000000007;
int main(){
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
rep(i, n) a[i]--;
vector<int> idx(n);
rep(i, n) idx[a[i]] = i;
ll ans = 0;
set<int> s;
for (int x = n - 1; x >= 0; x--){
int i = idx[x];
ll c = 0;
{
s.insert(i);
vector<int> l(2,-1);
vector<int> r(2, n);
{
auto it = s.find(i);
rep(j, 2){
if(it == s.begin()) break;
it--;
l[j] = *it;
}
}
{
auto it = s.find(i);
rep(j, 2){
it++;
if(it == s.end()) break;
r[j] = *it;
}
}
vector<int> ls(2);
ls[0] = i - l[0]; ls[1] = l[0] - l[1];
vector<int> rs(2);
rs[0] = r[0]-i; rs[1] = r[1] - r[0];
c = (ll)ls[0]*rs[1] + (ll)ls[1]*rs[0];
}
ans += c * (x + 1);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((ll)(x).size())
#define len(x) ((ll)(x).length())
#define endl "\n"
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
vector<pair<ll, ll>> vp(n);
rep(i, n) {
cin >> vp[i].first;
vp[i].second = i;
}
sort(rall(vp));
multiset<ll> idx;
idx.insert(-1);
idx.insert(-1);
idx.insert(n);
idx.insert(n);
ll ans = 0;
rep(i, n) {
ll p = vp[i].second;
ll v = vp[i].first;
idx.insert(p);
auto it = idx.lower_bound(p);
auto rin = it; rin++;
auto rout = rin; rout++;
auto lin = it; lin--;
auto lout = lin; lout--;
ll cnt = 0;
cnt += (*rin - p) * (*lin - *lout);
cnt += (p - *lin) * (*rout - *rin);
ans += cnt * v;
}
cout << ans << endl;
return 0;
} | 1 | 31,931,080 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, uint>;
const ll INF64 = 1LL << 60;
const int INF32 = 1 << 29;
const int MOD = 1000000007;
const int CASES = 2;
void solve(){
int N, K; cin >> N >> K;
vector<ll> A(N);
for(int i = 0; i < N ; ++i) cin >> A[i];
vector<ll> ands;
for(int i = 0; i < N ; ++i){
ll tmp = A[i];
ands.push_back(tmp);
for(int j = 1; i + j < N ; ++j){
tmp += A[i + j];
ands.push_back(tmp);
}
}
ll ans = 0;
for(ll i = 61; i >= 0; --i){
vector<ll> vec;
ll tmp = (1LL << i);
for(int j = 0; j < ands.size(); ++j){
if( (ands[j] & tmp) != 0){
vec.push_back(ands[j]);
}
}
if(vec.size() >= K){
ands = vec;
ans |= tmp;
}
}
cout << ans << '\n';
}
int main() {
#ifdef MYLOCAL
vector<string> filenames {"input1.txt", "input2.txt", "input3.txt"};
cout << "------------\n";
for(int i = 0; i < CASES; ++i){
ifstream in(filenames[i]);
cin.rdbuf(in.rdbuf());
solve();
cout << "------------\n";
}
#else
solve();
#endif
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int maxn = 1005;
LL sum[maxn];
LL v[maxn * (maxn - 1) / 2];
bool vis[maxn * (maxn - 1) / 2];
bitset<45> p[maxn * (maxn - 1) / 2];
LL num[50];
int main() {
int n, k;
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++) {
scanf("%lld", &sum[i]);
sum[i] += sum[i - 1];
}
int cnt = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= n; j++) {
v[++cnt] = sum[j] - sum[i];
LL m = v[cnt], g = 0;
while (m) {
if (m & 1){
p[cnt].set(g);
num[g]++;
}
m >>= 1;
g++;
}
}
}
for (int j = 44; j >= 0; j--) {
if(num[j] < k)
continue;
for (int i = 1; i <= cnt; i++) {
if (vis[i])
continue;
if (!p[i][j]) {
vis[i] = true;
for (int l = 0; l < 45; l++)
if(p[i][l])
num[l]--;
}
}
}
LL ans = (LL(1) << 45) - 1;
for (int i = 1; i <= cnt; i++) {
if(vis[i])
continue;
ans &= v[i];
k--;
if (k == 0)
break;
}
printf("%lld\n", ans);
return 0;
} | 1 | 54,698,991 |
#include <bits/stdc++.h>
#include <boost/range/adaptors.hpp>
#include <boost/range/irange.hpp>
using namespace std;
using namespace boost;
using namespace boost::adaptors;
int main() {
int64_t n, z, w;
cin >> n >> z >> w;
vector<int64_t> a(n + 1, w);
for (auto i : irange(0L, n)) {
cin >> a[i + 1];
}
vector<vector<int64_t>> score(2, vector<int64_t>(n + 1));
for (auto i : irange(1L, n + 1)) {
score[0][i] = score[1][i] = abs(a[n] - a[n - i]);
for (auto j : irange(1L, i)) {
score[0][i] = max(score[0][i], score[1][j]);
score[1][i] = min(score[1][i], score[0][j]);
}
}
cout << score[0][n] << endl;
} | #include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <stack>
#include<algorithm>
#include<sstream>
#include<iomanip>
using namespace std;
typedef long long ll;
const ll MOD_CONST = 1000000007;
const ll BIG_NUM = 1000000000000000000;
int main() {
int n, z, w;
cin >> n >> z >> w;
vector<int> a(n);
for (int i = 0; i < n;i++) {
cin >> a[i];
}
if (n == 1) {
cout << abs(a[0] - w) << endl;
}
else {
cout << max(abs(a[n - 1] - w), abs(a[n - 2] - a[n - 1])) << endl;
}
} | 1 | 46,550,954 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int n, num;
vector< int > a;
while( 1 ) {
cin >> n;
if( n == 0 ) break;
int Max = -100001;
a.push_back( 0 );
for( int i = 0; i < n; i++ ) {
cin >> num;
a.push_back( num );
}
for( int i = 1; i <= n; i++ ) {
a[i] = max( a[i], a[i] + a[i - 1] );
Max = max( Max, a[i] );
}
cout << Max << endl;
a.clear();
}
return 0;
} | #include <bits/stdc++.h>
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rep(i, n) REP (i, 0, n)
#define mset(a, n) memset(a, n, sizeof(a))
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef vector<pair<int, int> > vpii;
const int INF = 1000000000;
const int MOD = 1000000007;
const double EPS = 1e-8;
int main() {
int n;
while (cin >> n, n) {
int a[n], ans = -10000000;
rep (i, n) cin >> a[i];
int dp[n];
dp[0] = a[0];
REP (i, 1, n) {
dp[i] = max(dp[i - 1] + a[i], a[i]);
}
rep(i, n) {
ans = max(ans, dp[i]);
}
cout << ans << endl;
}
} | 1 | 25,746,532 |
#include<iostream>
#include<cstdio>
#include<vector>
#include<map>
#include<string>
#include<utility>
#include<algorithm>
#include<stack>
#include<queue>
#define numof(array) (sizeof (array) / sizeof *(array))
using namespace std;
#define INF (1 << 29)
static const int dx[] = {1, 0, -1, 0};
static const int dy[] = {0, 1, 0, -1};
#define MAX_H 1000
#define MAX_W 1000
int H, W, N;
char field[MAX_H][MAX_W];
int d[MAX_H][MAX_W];
typedef pair<int, int> P;
int bfs(const P start, const P goal)
{
queue<P> que;
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
d[i][j] = INF;
}
}
que.push(start);
d[start.second][start.first] = 0;
while (que.size()) {
P p = que.front();
que.pop();
if (p == goal) break;
for (int i = 0; i < 4; i++) {
int nx = p.first + dx[i];
int ny = p.second + dy[i];
if (0 <= nx && nx < W && 0 <= ny && ny < H && field[ny][nx] != 'X' && d[ny][nx] == INF) {
que.push(P(nx, ny));
d[ny][nx] = d[p.second][p.first] + 1;
}
}
}
return d[goal.second][goal.first];
}
int main(void)
{
cin >> H >> W >> N;
for (int y = 0; y < H; y++) {
for (int x = 0; x < W; x++) {
field[y][x] = 'X';
}
}
P zahyo[10];
for (int i = 0; i < 10; i++) {
zahyo[i] = P(-1, -1);
}
for (int y = 0; y < H; y++) {
for (int x = 0; x < W; x++) {
cin >> field[y][x];
if ('0' < field[y][x] && field[y][x] <= '9') {
zahyo[field[y][x] - '0'] = P(x, y);
}
if (field[y][x] == 'S') {
zahyo[0] = P(x, y);
}
}
}
int cnt = 0;
int answer = 0;
while (cnt < N) {
answer += bfs(zahyo[cnt], zahyo[cnt+1]);
cnt++;
}
cout << answer << endl;
return 0;
} | #include <iostream>
#include <queue>
#define MAX 1005
#define INF 100000000
using namespace std;
typedef struct{
int x;
int y;
int state;
} Mouse;
int H,W,N;
int start_x,start_y;
char ar[MAX][MAX];
int offset_x[4] = {1,0,-1,0};
int offset_y[4] = {0,1,0,-1};
int ans[MAX][MAX];
void init(){
for(int i = 0; i < H; i++)
for(int j = 0; j < W; j++)
ans[i][j] = -INF;
}
int bfs(int state){
Mouse m;
m.x = start_x;
m.y = start_y;
m.state = state;
init();
ans[start_y][start_x] = 0;
queue<Mouse> q;
q.push(m);
while(q.size()){
Mouse m1 = q.front();
q.pop();
for(int i = 0; i < 4; i++){
int dx = m1.x + offset_x[i];
int dy = m1.y + offset_y[i];
if(dx >= 0 && dx < W && dy >= 0 && dy < H && ar[dy][dx] != 'X' && ans[dy][dx] == -INF){
Mouse m2;
m2.x = dx;
m2.y = dy;
ans[dy][dx] = ans[m1.y][m1.x] + 1;
if(m1.state == (ar[dy][dx] - '0')){
ar[dy][dx] == '.';
start_x = dx;
start_y = dy;
return ans[dy][dx];
}else{
m2.state = m1.state;
}
q.push(m2);
}
}
}
}
int main(){
while(cin >> H >> W >> N){
for(int i = 0; i < H; i++){
cin >> ar[i];
for(int j = 0; j < W; j++){
if(ar[i][j] == 'S'){
start_y = i;
start_x = j;
}
}
}
int res = 0;
for(int i = 1; i <= N; i++)
res += bfs(i);
cout << res << endl;
}
return 0;
} | 1 | 85,977,344 |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#define MAX_VIL_NUM 10
using namespace std;
int main(void){
int n, a, b, c, i, j, con[MAX_VIL_NUM][MAX_VIL_NUM], used[MAX_VIL_NUM], distance[MAX_VIL_NUM], sum, ans_time, ans_vil, vil_num;
while(1){
scanf("%d",&n);
if(n == 0){
break;
}
vil_num = 0;
memset(con,-1,sizeof(con));
for(i = 0;i < n;i++){
scanf("%d%d%d",&a,&b,&c);
con[a][b] = c;
con[b][a] = c;
vil_num = max(vil_num,a + 1);
vil_num = max(vil_num,b + 1);
}
ans_time = -1;
for(i = 0;i < vil_num;i++){
memset(used,0,sizeof(used));
memset(distance,-1,sizeof(distance));
distance[i] = 0;
while(1){
int min_el = -1;
for(j = 0;j < vil_num;j++){
if(used[j] == 0 && distance[j] != -1 && (min_el == -1 || distance[min_el] > distance[j])){
min_el = j;
}
}
if(min_el == -1){
break;
}
for(j = 0;j < vil_num;j++){
if(con[min_el][j] != -1 && (distance[j] == -1 || distance[min_el] + con[min_el][j] < distance[j])){
distance[j] = distance[min_el] + con[min_el][j];
}
}
used[min_el] = 1;
}
sum = 0;
for(j = 0;j < vil_num;j++){
if(distance[j] != -1){
sum += distance[j];
}
}
if(ans_time == -1 || ans_time > sum){
ans_time = sum;
ans_vil = i;
}
}
printf("%d %d\n",ans_vil,ans_time);
}
return 0;
} | #include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int inf=0x3f3f3f3f;
int map[15][15];
void floyd(int n)
{
for(int i=0;i<n;++i)
{
for(int j=0;j<n;++j)
{
for(int k=0;k<n;++k)
{
map[j][k]=min(map[j][k],map[j][i]+map[i][k]);
}
}
}
}
void init(int n)
{
for(int i=0;i<n;++i)
{
for(int j=0;j<i;++j)
{
map[i][j]=map[j][i]=inf;
}
map[i][i]=0;
}
}
int main()
{
int n;
while(scanf("%d",&n),n)
{
init(15);int m=0;
for(int i=0;i<n;++i)
{
int a,b,c;
scanf("%d%d%d",&a,&b,&c);
map[a][b]=map[b][a]=min(map[a][b],c);
m=max(max(m,a),b);
}
floyd(m+1);
int ans=inf,res=0;
for(int i=0;i<=m;++i)
{
int p=0;
for(int j=0;j<=m;++j)
{
if(map[i][j]!=inf)
{
p+=map[i][j];
}
}
if(p<ans)
{
ans=p;res=i;
}
}
printf("%d %d\n",res,ans);
}
return 0;
} | 1 | 46,139,180 |
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main()
{
int N;
cin >> N;
vector<int> vec(N);
REP(i, N) {
cin >> vec[i];
}
int m = vec[0];
int ans = 0;
REP(i, vec.size()) {
if (vec[i] >= m) {
ans++;
}
m = max(m, vec[i]);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define INF 1000000000
int main() {
int n,ans=0,M=-1;
cin >> n;
vector<int> H(n);
rep(i,n) cin >> H.at(i);
rep(i,n){
ans += int(M<=H.at(i));
M = max(M,H.at(i));
}
cout << ans << endl;
} | 1 | 40,342,289 |
#include <iostream>
#include <cstring>
using namespace std;
int ans = 0, array[100],mini;
void BubbleSort(int A[], int n) {
for (int i = 0; i < n; i++) {
mini=i;
for (int j = i; j < n; j++) {
if (A[j]<A[mini])
mini = j;
}
swap(A[i],A[mini]);
if (i!=mini) ans++;
}
}
int main() {
int n;
cin >> n;
memset(array, 0, sizeof(array));
for (int i = 0; i < n; i++)
cin >> array[i];
BubbleSort(array, n);
for (int i = 0; i < n; i++) {
cout << array[i];
if (i != n - 1) cout << ' ';
}
cout << endl << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int A[100], N, times = 0;
void selectionSort(int A[], int N);
void print(int A[], int N);
int main()
{
cin >> N;
for (int i = 0; i < N; i++)
cin >> A[i];
selectionSort(A, N);
print(A, N);
}
void selectionSort(int A[], int N)
{
int temp = 0;
int minj;
for (int i = 0; i < N; i++)
{
minj = i;
for (int j = i; j < N; j++)
{
if (A[j] < A[minj])
minj = j;
}
temp = A[i];
A[i] = A[minj];
A[minj] = temp;
if (minj != i)
times++;
}
}
void print(int A[], int N)
{
for (int i = 0; i < N; i++)
{
cout << A[i];
if (i != N - 1)cout << " ";
}
cout << endl << times<<endl;
} | 1 | 10,599,474 |
#include <iostream>
int main() {
int n;
while (std::cin >> n) {
int c = 0;
for (int i = 0; i <= 9; i++)
for (int j = 0; j <= 9; j++)
for (int k = 0; k <= 9; k++)
for (int l = 0; l <= 9; l++)
if (i + j + k + l == n)
c++;
std::cout << c << std::endl;
}
} | #include<iostream>
using namespace std;
int main(){
int n;
int comb[4][51] = {0};
for(int i=0; i<10; i++){
comb[0][i] = 1;
}
for(int i=1; i<4; i++){
for(int j=0; j<9*i+10; j++){
for(int k=0; k<10; k++){
if(j-k>=0){
comb[i][j] += comb[i-1][j-k];
}
}
}
}
while(cin >> n){
cout << comb[3][n] << endl;
}
return 0;
} | 1 | 86,443,119 |
#include <iostream>
#include <vector>
#include <cmath>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <map>
using namespace std;
int main(int argc, const char * argv[]) {
int n;
cin >> n;
cout << ((n + 2 - 1) / 2) - 1 << endl;
return 0;
} | #include<iostream>
using namespace std;
int main()
{
int n;
cin>>n;
cout<<(n-1)/2;
} | 1 | 7,011,203 |
#include <stdio.h>
int main(void){
int hight = 0;
int width = 0;
int x = 0;
int y = 0;
int r = 0;
scanf("%d %d %d %d %d",&hight,&width,&x,&y,&r);
bool isYes = true;
if( (hight < (x+r)) || (width < (y+r)) || ((x-r) < 0) || ((y-r) < 0) ){
isYes = false;
}
if(isYes != false){
printf("Yes\n");
}else{
printf("No\n");
}
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <sstream>
#include <algorithm>
#include <stdio.h>
using namespace std;
int main()
{
string str;
getline(cin, str);
vector<string> vStr;
while (str.find(' ') != -1)
{
vStr.push_back(str.substr(0, str.find(' ')));
str.erase(0, str.find(' ') + 1);
}
vStr.push_back(str);
int W, H, x, y, r;
W = stoi(vStr[0]);
H = stoi(vStr[1]);
x = stoi(vStr[2]);
y = stoi(vStr[3]);
r = stoi(vStr[4]);
bool judge = true;
for (int i = -1; i < 2; i++)
{
if (x + i * r >= 0 && x + i * r <= W &&
y + i * r >= 0 && y + i * r <= H)
{
}
else
{
judge = false;
}
}
string ans;
judge ? ans = "Yes" : ans = "No";
cout << ans << endl;
return 0;
} | 1 | 10,119,632 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, const char *argv[]) {
int n, ans = 0;
cin >> n;
vector<string> vs(n);
int a_cnt, b_cnt, ba_cnt;
a_cnt = b_cnt = ba_cnt = 0;
for (int i = 0; i < n; i++) {
cin >> vs[i];
string &s = vs[i];
for (int i = 0; i < s.size() - 1; i++) {
if (s[i] == 'A' && s[i + 1] == 'B') {
ans++;
}
}
if (s.front() == 'B' && s.back() == 'A') {
ba_cnt++;
} else if (s.back() == 'A') {
a_cnt++;
} else if (s.front() == 'B') {
b_cnt++;
}
}
if (ba_cnt > 0) {
ans += ba_cnt - 1;
if (b_cnt > 0) {
ans++;
b_cnt--;
}
if (a_cnt > 0) {
ans++;
a_cnt--;
}
}
ans += min(a_cnt, b_cnt);
cout << ans << '\n';
return 0;
} | #ifdef LOCAL_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <iomanip>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <math.h>
#include <cmath>
#include <bitset>
using namespace std;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
const long long INF = 10010010010010;
const long long MOD = 1000000007;
typedef pair<int,int> P;
long long mod_pow(long long N, long long M) {
if (M == 0) return 1;
long long res = mod_pow((N * N) % MOD, M / 2);
if (M & 1) res = (res * N) % MOD;
return res %= MOD;
}
long long gcd(long long a, long long b) {
if (b == 0) return a;
else return gcd(b, a % b);
}
long long lcm(long long a, long long b) {
return a / gcd(a, b) * b ;
}
int main() {
int N;cin >> N;
vector<string> retu(N);
int A = 0,B = 0;
for(int i = 0;i<N;i++) cin >> retu.at(i);
int ans = 0;
int special = 0;
for(int i = 0;i<N;i++){
string T = retu.at(i);
for(int j = 0;j<T.size()-1;j++){
if(T.at(j) == 'A' && T.at(j+1) == 'B') ans++;
}
if(T.back() == 'A' && T.front() != 'B') A++;
if(T.front() == 'B' && T.back() != 'A') B++;
if(T.front() == 'B' && T.back() == 'A') special++;
}
if(N == 1){
cout << ans << endl;
return 0;
}
int bonus = min(A,B);
if(special == 0){
cout << ans + bonus << endl;
}
else{
if(A == 0 && B == 0){
cout << ans + special-1 << endl;
}
else{
cout << ans + bonus + special << endl;
}
}
} | 1 | 92,248,521 |
#include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <string.h>
#include <ctype.h>
#include <algorithm>
#include <math.h>
using namespace std;
int main() {
string s;
cin >> s;
if(s[5] != '0' || s[6] > '4')
cout << "TBD" << endl;
else cout << "Heisei" << endl;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <cassert>
using namespace std;
#define ll long long
#define loop(__x, __start, __end) for(int __x = __start; __x < __end; __x++)
template <class T> bool chmin(T &a, T b) { if (a > b) {a = b; return true; } return false; }
template <class T> bool chmax(T &a, T b) { if (a < b) {a = b; return true; } return false; }
string S;
void input() {
cin >> S;
}
void solve() {
int m = stoi(S.substr(5, 2));
int d = stoi(S.substr(8, 2));
if (m <= 4) {
cout << "Heisei" << endl;
return;
}
cout << "TBD" << endl;
}
int main() {
input();
solve();
return 0;
} | 1 | 77,072,847 |
#include <iostream>
#include <list>
using namespace std;
int main(void){
list<int> int_list;
int n;
cin >> n;
string str;
for(int i = 0; i < n; i++)
{
cin >> str;
if(str == "insert")
{
int x;
cin >> x;
int_list.push_front(x);
}
else if(str == "delete")
{
int x;
cin >> x;
for(auto itr = int_list.begin(); itr != int_list.end(); ++itr)
{
if(*itr == x)
{
int_list.erase(itr);
break;
}
}
}
else if(str == "deleteFirst")
{
int_list.pop_front();
}
else if(str == "deleteLast")
{
int_list.pop_back();
}
else
{
}
}
int count = 0;
for(auto x : int_list)
{
if(count != 0)
{
cout << " ";
}
cout << x;
count++;
}
cout << endl;
return 0;
} | #include <iostream>
using namespace std;
class Node {
friend class List;
private:
int num;
Node *prev;
Node *next;
public:
Node(int n, Node *x, Node *y);
};
class List{
private:
Node *head;
Node *tail;
public:
List();
void Insert(int x);
void Delete(int x);
void deleteFirst();
void deleteLast();
void Print();
};
Node::Node(int n, Node *x, Node *y) {
num = n;
prev = x;
next = y;
}
List::List() {
head = NULL;
tail = NULL;
}
void List::Insert(int x) {
if(head == NULL) {
head = new Node(x, NULL, head);
tail = head;
return;
}
Node *p = head;
head = new Node(x, NULL, head);
p->prev = head;
}
void List::Delete(int x) {
Node *p;
if(head == NULL)
return;
if(head->num == x) {
deleteFirst();
return;
}
for(p = head; p->num != x; p = p->next) {
if(p->next == NULL)
return;
}
if(p == tail) {
deleteLast();
return;
}
p->next->prev = p->prev;
p->prev->next = p->next;
delete p;
}
void List::deleteFirst() {
Node *p = head;
if(head == tail) {
head = NULL;
tail = NULL;
}
else
head = head->next;
delete p;
}
void List::deleteLast() {
Node *p = tail;
if(tail == head){
head = NULL;
tail = NULL;
}
else {
tail = tail->prev;
tail->next = NULL;
}
delete p;
}
void List::Print() {
for(Node *p = head; p != NULL; p=p->next) {
if(p != head)
printf(" ");
printf("%d", p->num);
}
printf("\n");
}
int main() {
List l;
int n, num;
char command[20];
scanf("%d", &n);
for(int i = 0; i < n; i++) {
scanf("%s", command);
if(command[0] == 'i') {
scanf("%d", &num);
l.Insert(num);
}
else if(command[0] == 'd') {
if (command[6] == 'F')
l.deleteFirst();
else if (command[6] == 'L')
l.deleteLast();
else {
scanf("%d", &num);
l.Delete(num);
}
}
}
l.Print();
return 0;
} | 1 | 37,860,651 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const long long INF=INT_MAX/4;
const long long MOD=998244353;
const double EPS=1e-14;
const bool DEBUG=false;
const string YES = "YES";
const string NO = "NO";
const string Yes = "Yes";
const string No = "No";
template<class T>
void debug(T head){
if(DEBUG){
cout<<head<<endl;
}
}
template <class Head, class... Body>
void debug(Head head, Body... body){
if(DEBUG){
cout<<head<<" ";
debug(body...);
}
}
void answer(ll N, vector<string> &s){
ll answer = 0;
ll x = 0, y = 0, z = 0;
for(auto ss : s){
int len = ss.length();
for(int i=0; i<len - 1; ++i){
if(ss.substr(i, 2) == "AB"){
answer++;
}
}
if(ss[0] == 'B' && ss[len - 1] == 'A'){
z++;
}else if(ss[0] == 'B'){
x++;
}else if(ss[len - 1] == 'A'){
y++;
}
}
debug(answer);
debug(x, y, z);
if(z>0){
answer += z-1;
if(x + y > 0){
answer++;
}
}
answer += min(x, y);
cout<<answer<<endl;
return;
}
int main(int argc, char* argv[]){
cin.tie(0);
ios::sync_with_stdio(0);
cout.precision(16);
ll N;
cin>>N;
vector<string> s(N);
for(auto &ss : s){
cin>>ss;
}
answer(N, s);
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vc = vector<char>;
using vb = vector<bool>;
using vs = vector<string>;
using vll = vector<long long>;
using vp = vector<pair<int, int>>;
using vvi = vector<vector<int>>;
using vvc = vector<vector<char>>;
using vvll = vector<vector<long long>>;
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 (b<a) {a=b; return 1;} return 0;}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
int ans = 0;
int enda = 0;
int beginb = 0;
int both = 0;
rep(i, n) {
string s;
cin >> s;
if (s.front() == 'B' && s.back() == 'A') both++;
else if (s.front() == 'B') beginb++;
else if (s.back() == 'A') enda++;
rep(j, sz(s) - 1) {
if (s[j] == 'A' && s[j+1] == 'B') ans++;
}
}
if (both > 0 && enda > 0 && beginb > 0) {
ans += both+1;
enda--; beginb--;
ans += min(enda, beginb);
} else if (both == 0) {
ans += min(enda, beginb);
} else if (both > 0 && enda == 0 && beginb == 0) {
ans += both-1;
} else {
ans += both;
}
cout << ans << endl;
} | 1 | 53,741,774 |
#include<bits/stdc++.h>
#include<cstring>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define umapii unordered_map<int,int>
#define ps(x,y) fixed<<setprecision(y)<<x
#define arr(a,n) int n;cin>>n;int a[n];for(int i=0;i<n;i++){cin>>a[i];}
#define outarr(a,n) for(int i=0;i<n;i++){cout<<a[i]<<" ";}
#define mod 1000000007
#define ff first
#define big 1e15
#define ss second
#define add push_back
#define remove pop_back
#define mapii map<int,int>
#define large *max_element
#define small *min_element
#define float double
#define pqi priority_queue<int>
#define mpqi priority_queue<int,vector<int>,greater<int>>
#define in(n) int n;cin>>n;
#define w(t) int t;cin>>t;while(t--)
#define vi vector<int>
#define vivi vector<vector<int>>
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>pbds;
int32_t main() {
#ifndef ONLINE_JUDGE
freopen("input1.txt", "r", stdin);
freopen("output3.txt", "w", stdout);
#endif
int n, k;
cin >> n >> k;
umapii m;
while (k--) {
in(d);
int a[d];
for (int i = 0; i < d; i++) {
cin >> a[i];
m[a[i]]++;
}
}
int count = 0;
for (int i = 1; i <= n; i++) {
if (!m.count(i) > 0) {
count++;
}
}
cout << count << endl;
} | #include<bits/stdc++.h>
#define rep(i,n) for (int i=0;i<(n);i++)
using namespace std;
using P = pair<int,int>;
using ll = long long;
using namespace std;
int main(void){
int n, k;
cin >> n >> k;
int d[k];
int a[k][n];
rep(i, k){
cin >> d[i];
rep(j, d[i]){
cin >> a[i][j];
}
}
int c[n];
rep(i, n){c[i] =0;}
rep(i, k){
rep(j, d[i]){
++c[a[i][j]-1];
}
}
int ans = 0;
rep(i, n){
if(c[i] == 0){++ans;}
}
cout << ans << endl;
return 0;
} | 1 | 80,787,895 |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define Red ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define rep(i, n) for(int i =0 ; i < n; ++i)
#define Rep(i,a,b) for(int i=a;i<=b;i++)
#define pii pair < int, int >
typedef vector<int> vi;
typedef long long ll;
const int mod =1e9+7;
const int N = (int)2e5 + 5;
int used[101];
void solve(){
int a,b,c,d;
cin>>a>>b>>c>>d;
for(int i=a;i<=b;i++){
used[i]++;
}
int cnt=0;
for(int i=c;i<=d;i++){
used[i]++;
if(used[i]==2)cnt++;
}
cout<<max(cnt-1,0);
}
int main(){
Red;
int t=1;
while(t--)
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
std::fill( (T*)array, (T*)(array+N), val );
}
ll gcd(ll a,ll b){
if (a%b == 0) return(b);
else return(gcd(b, a%b));
}
ll lcm(ll a, ll b){
return a*b/gcd(a, b);
}
int main()
{
cout << fixed << setprecision(15);
ll A, B, C, D;
cin >> A >> B >> C >> D;
cout << max(0LL, min(B,D) - max(A,C)) << endl;
return 0;
} | 1 | 31,041,820 |
#include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rrep(i, n) for(int i = 0; i <= (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1LL<<62;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T>
vector<T> make_vec(size_t a){
return vector<T>(a);
}
template<class T, class... Ts>
auto make_vec(size_t a, Ts... ts){
return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
const int MOD = 1000000007;
int main(){
int N; cin >> N;
vector<int> A(N);
rep(i,N) cin >> A[i];
vector<int> B(N);
rep(i,N){
B[i] = A[i] - (i+1);
}
sort(B.begin(), B.end());
ll ans = 0;
rep(i,N){
ans += abs(B[i]-B[N/2]);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i,n) for (int i = 0; i < (n); ++i)
int main() {
ll n;
cin >> n;
vector<ll> a(n);
rep(i, n) {
ll tmp_a = 0;
cin >> tmp_a;
a[i] = tmp_a - ( i + 1 );
}
sort(a.begin(), a.end());
ll b = 0;
if ( n & 1 ) {
b = a[n/2];
ll ans = 0;
for ( ll i = 0; i < n; i++ ) {
ans += abs(a[i] - b);
}
cout << ans << endl;
return 0;
}
else {
ll b1 = a[n/2];
ll b2 = a[n/2-1];
ll ans1 = 0;
ll ans2 = 0;
for ( ll i = 0; i < n; i++ ) {
ans1 += abs(a[i] - b1);
ans2 += abs(a[i] - b2);
}
cout << min(ans1, ans2) << endl;
return 0;
}
} | 1 | 86,956,820 |
#include <iostream>
#include <bitset>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <cmath>
#include <regex>
using namespace std;
using ll = long long int;
using dd = long double;
const ll MOD = 1e9 + 7;
vector<string> dfs(string s, ll depth, vector<char> symbol)
{
vector<string> ret;
if (depth == 0)
{
ret.push_back(s);
return ret;
}
for (ll i = 0; i < symbol.size(); i++)
{
auto vec = dfs(s + symbol[i], depth - 1, symbol);
for (auto &&e : vec)
{
ret.push_back(e);
}
}
return ret;
}
ll gcd(ll a, ll b)
{
if (a % b == 0)
{
return b;
}
return gcd(b, a % b);
}
int main()
{
ll R, G;
cin >> R >> G;
cout << (R + (G - R) * 2) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int R,G;
cin >> R >> G;
double x = 2 * G - R;
cout << x << endl;
} | 1 | 93,293,005 |
#include <iostream>
#include <vector>
using namespace std;
const int lim = 100005;
int main(){
int n;
cin >> n;
vector<int> a(lim, 0);
for(int i = 0; i < n; i++){
int a1;
cin >> a1;
a[a1]++;
}
for(int i = 0; i < lim; i++){
if(a[i] != 0){
a[i] = 2-a[i]%2;
}
}
int twonum = 0;
int ans = 0;
for(int i = 0; i < lim; i++){
if(a[i] == 2) twonum++;
if(a[i] != 0) ans++;
}
if(twonum % 2) ans--;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define max 100010
using namespace std;
int q_sort(int d[],int left,int right){
if(left >= right) return 0;
int pipot = d[(left+right)/2], l = left, r = right, tmp;
while(l<r){
while(d[l] < pipot) l++;
while(d[r] > pipot) r--;
if( l <= r){
tmp = d[l];
d[l] = d[r];
d[r] = tmp;
l++;
r--;
}
}
q_sort(d,left,r);
q_sort(d,l,right);
}
int main(void)
{
int n; cin>>n;
int a[n]; for(int i = 0; i < n; i++) cin>>a[i];
q_sort(a,0,n-1);
int syurui[max]; for(int i = 0; i < max; i++) syurui[i] = 0;
for(int i = 0; i < n; i++) syurui[a[i]]++;
int ans = 0;
for(int i = 0; i < max; i++){
if(syurui[i] != 0) ans++;
}
int two_num = 0, one_num = 0;
for(int i = 0; i < max; i++){
if(syurui[i] >= 2 && syurui[i] % 2 == 0){
syurui[i] = 2;
two_num++;
}
else if(syurui[i] > 2 && syurui[i] % 2 == 1) syurui[i] = 1;
}
if(two_num % 2 == 1) ans--;
cout<<ans<<endl;
return 0;
} | 1 | 22,995,127 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
string S;
cin >> S;
ll K;
cin >> K;
int N = S.length();
ll ans = 0;
vector<pair<char, ll>> a;
for (int i = 0; i < N-1; i++) {
ll temp = 0;
char x = S[i];
while (S[i] == S[i+1] && i < N-1) {
temp++;
i++;
}
a.push_back(make_pair(x, temp+1));
ans += (temp+1)/2;
}
if (N == 1) {
a.push_back(make_pair(S[0], 1));
}
if (a.size() == 1) {
ans = a.front().second*K/2;
} else {
ans *= K;
if (a.front().first == a.back().first) {
ans += ((a.front().second+a.back().second)/2 - a.front().second/2 - a.back().second/2) * (K - 1);
}
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
int main() {
string s;
ll k;
cin >> s >> k;
ll n = s.length();
if (n == 1) {
cout << k / 2 << endl;
return 0;
}
ll l = 0, r = 0;
for (int i = 0; i < n; i++) {
if (s[0] == s[i]) {
l++;
} else {
break;
}
}
if (l == n) {
cout << n * k / 2 << endl;
return 0;
}
for (int i = n - 1; i >= 0; i--) {
if (s[n - 1] == s[i]) {
r++;
} else {
break;
}
}
if (l + r == n) {
ll ans = l / 2 * k + r / 2 * k;
cout << ans << endl;
return 0;
}
ll ans = 0;
ll c = 1;
for (int i = l; i < n - r; i++) {
if (s[i] == s[i + 1]) {
c++;
} else {
ans += c / 2 * k;
c = 1;
}
}
ans += c / 2 * (k - 1);
if (s[0] == s[n - 1]) {
ans += l / 2 + (l + r) / 2 * (k - 1) + r / 2;
} else {
ans += l / 2 * k + r / 2 * k;
}
cout << ans << endl;
return 0;
} | 1 | 2,144,742 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int n,m,a,b;
cin>>n>>m;
bool ans[n]={};
for(int i=0;i<m;i++){
cin>>a>>b;
ans[a-1]=!ans[a-1];
ans[b-1]= !ans[b-1];
}
for(int i=0;i<n;i++){
if(ans[i]){
cout<<"NO"<<endl;
return 0;
}
}
cout<<"YES"<<endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i<(n); ++i)
#define repr(i, a, b) for (int i=a; i<(b); ++i)
#define reprev(i, n) for (int i=n-1; i>=0; --i)
#define reprrev(i, a, b) for (int i=b-1; i>=(a); --i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
cout << fixed << setprecision(10);
int N, M; cin >> N >> M;
vector<int> cnt(N);
rep(i, M) {
int a, b; cin >> a >> b;
a--; b--;
cnt[a] += 1;
cnt[b] += 1;
}
rep(i, N) {
if (cnt[i] % 2 == 1) {
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
return 0;
} | 1 | 76,071,522 |
#include <cstdio>
#include <stack>
using namespace std;
int main() {
stack<int> q;
while (true) {
int n;
if (scanf("%d", &n) == EOF)
break;
if (n) {
q.push(n);
} else {
printf("%d\n", q.top());
q.pop();
}
}
return 0;
} | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<cmath>
#include<sstream>
#include<stack>
using namespace std;
int main(){
stack<int> train;
int a;
while(cin>>a){
int now;
if(a==0){
now=train.top();
train.pop();
cout<<now<<endl;
}
else {
train.push(a);
}
}
return 0;
} | 1 | 10,352,522 |
#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--)
#define all(v) v.begin(),v.end()
using namespace std;
using ll = long long;
using P = pair<int,int>;
using vi = vector<int>;
using vvi = vector<vi>;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int h,w,a,b;
cin >> h >> w >> a >> b;
rep(i,h){
rep(j,w){
if((i<b)^(j<a))
cout<<1;
else
cout<<0;
}
cout<<endl;
}
} | #include <bits/stdc++.h>
#ifdef LOCAL_DEBUG
#define DEBUG 1
#define CERR if(DEBUG) cerr
#define MACRO(_1,_2,_3,_4,_5,_6,_7,_8,_9,_10,NAME,...) NAME
#define pr(...) CERR<<MACRO(__VA_ARGS__,pr10,pr9,pr8,pr7,pr6,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__)<<endl
#define pr1(a) (#a)<<"="<<(a)<<" "
#define pr2(a,b) pr1(a)<<pr1(b)
#define pr3(a,b,c) pr1(a)<<pr2(b,c)
#define pr4(a,b,c,d) pr1(a)<<pr3(b,c,d)
#define pr5(a,b,c,d,e) pr1(a)<<pr4(b,c,d,e)
#define pr6(a,b,c,d,e,f) pr1(a)<<pr5(b,c,d,e,f)
#define pr7(a,b,c,d,e,f,g) pr1(a)<<pr6(b,c,d,e,f,g)
#define pr8(a,b,c,d,e,f,g,h) pr1(a)<<pr7(b,c,d,e,f,g,h)
#define pr9(a,b,c,d,e,f,g,h,i) pr1(a)<<pr8(b,c,d,e,f,g,h,i)
#define pr10(a,b,c,d,e,f,g,h,i,j) pr1(a)<<pr9(b,c,d,e,f,g,h,i,j)
#define prArr(a){CERR<<(#a)<<"={";int i=0;for(auto t:(a))CERR<<(i++?", ":"")<<t;CERR<<"}"<<endl;}
#else
#define DEBUG 0
#define pr(...)
#define prArr(a)
#endif
using namespace std;
using Int = long long;
using _int = int;
using ll = long long;
using Double = long double;
const Int INF = (1LL<<60)+1e9;
const Int mod = (1e9)+7;
const Double EPS = 1e-8;
const Double PI = 6.0 * asin((Double)0.5);
using P = pair<Int,Int>;
template<class T> T Max(T &a,T b){return a=max(a,b);}
template<class T> T Min(T &a,T b){return a=min(a,b);}
template<class T1, class T2> ostream& operator<<(ostream& o,pair<T1,T2> p){return o<<"("<<p.first<<","<<p.second<<")";}
template<class T1, class T2, class T3> ostream& operator<<(ostream& o,tuple<T1,T2,T3> t){return o<<"("<<get<0>(t)<<","<<get<1>(t)<<","<<get<2>(t)<<")";}
template<class T1, class T2> istream& operator>>(istream& i,pair<T1,T2> &p){return i>>p.first>>p.second;}
template<class T> ostream& operator<<(ostream& o,vector<T> a){Int i=0;for(T t:a)o<<(i++?" ":"")<<t;return o;}
template<class T> istream& operator>>(istream& i,vector<T> &a){for(T &t:a)i>>t;return i;}
signed main(){
srand((unsigned)time(NULL));
cin.tie(0);
ios_base::sync_with_stdio(0);
cout << fixed << setprecision(12);
Int H, W, A, B;
cin>>H>>W>>A>>B;
vector<vector<Int> > ans(H, vector<Int>(W, 0));
for(Int i=0;i<H;i++)
for(Int j=0;j<A;j++) ans[i][j] = 1;
for(Int j=0;j<W;j++)
for(Int i=0;i<B;i++) ans[i][j] ^= 1;
for(Int i=0;i<H;i++){
for(Int j=0;j<W;j++) cout<<ans[i][j];
cout<<endl;
}
return 0;
} | 1 | 45,840,945 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
template <class T>
inline bool chmin(T &a, T b)
{
if (a > b)
{
a = b;
return true;
}
return false;
}
template <class T>
inline bool chmax(T &a, T b)
{
if (a < b)
{
a = b;
return true;
}
return false;
}
const long long INF = 1LL << 60;
int main()
{
ll n, m;
cin >> n >> m;
int a;
for (ll i = 0; i < m; i++)
{
cin >> a;
n -= a;
}
if (n < 0)
{
cout << -1 << endl;
}
else
{
cout << n << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<long long> vl;
typedef vector<vector<long long>> vvl;
typedef vector<char> vc;
typedef vector<vector<char>> vvc;
typedef vector<string> vs;
#define rep(i,n) for(ll i = 0; i < (ll) n; i++)
#define rep2(i,x,n) for(ll i = (ll) x; i < (ll) n; i++)
#define all(A) A.begin(), A.end()
void Yes(bool ans){cout << (ans? "Yes" : "No") << endl;}
void YES(bool ans){cout << (ans? "YES" : "NO") << endl;}
int main() {
ll n, m, sum = 0; cin >> n >> m;
vl a(m);
rep(i,m) {
cin >> a[i];
sum += a[i];
}
if(sum > n) cout << -1 << endl;
else cout << n - sum << endl;
} | 1 | 51,216,281 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, h, w;
cin >> n >> h >> w;
int ans = 0;
for(int i = 0; i < n; i++){
int a, b;
cin >> a >> b;
if(a < h) continue;
if(b < w) continue;
ans++;
}
cout << ans << endl;
} | #include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <limits>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define ArraySizeOf(array) (sizeof(array) / sizeof(array[0]))
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for(int i=1;i<n;i++)
#define rev(i,n) for(int i=n-1;i>=0;i--)
#define REV(i,n) for(int i=n-1;i>0;i--)
#define req(i,n,m) for(int i=n;i<m;i++)
#define REQ(i,n,m,l) for(int i=n;i<m;i+=l)
#define _GLIBCXX_DEBUG
int INF = 1e9 + 7;
unsigned NthDayOfWeekToDay(unsigned n, unsigned dow, unsigned dow1)
{
unsigned day;
if (dow < dow1) dow += 7;
day = dow - dow1;
day += 7 * n - 6;
return day;
}
signed gcd(int x, int y) {
if (y == 0)return x;
return gcd(y, x % y);
}
signed lcm(int x, int y) {
return x / gcd(x, y) * y;
}
unsigned DayToWeekNumber(unsigned day)
{
return (day - 1) / 7 + 1;
}
unsigned AnotherDayOfWeek(unsigned day, unsigned day0, unsigned dow0)
{
return (dow0 + 35 + day - day0) % 7;
}
using namespace std;
signed main() {
int N, H, W; cin >> N >> H >> W;
vector<int>A(N);
vector<int>B(N);
int ans = 0;
rep(i, N) {
cin >> A[i] >> B[i];
if (A[i] >= H && B[i] >= W)ans++;
}
cout << ans << endl;
} | 1 | 79,228,991 |
#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
using namespace std;
#define rip(i, n, s) for (int i = (s);i < ( int )( n ); i++)
#define all(a) (a).begin(), (a).end()
typedef long long ll;
int main(){
int n,k;
cin >> n >> k;
vector<ll> da(n);
rip(i,n,0){
cin >> da[i];
}
ll w=0,b=0;
rip(i,n,0){
if(da[i]>0){
w+=da[i];
b+=da[i];
}
}
rip(i,k,0){
if(da[i]>0){
w-=da[i];
}
else{
b+=da[i];
}
}
ll ans=max(b,w);
rip(i,n,k){
if(da[i]>0){
w-=da[i];
}
else{
b+=da[i];
}
if(da[i-k]>0){
w+=da[i-k];
}
else{
b-=da[i-k];
}
ans=max(ans,max(b,w));
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mp make_pair
#define pb push_back
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
ll n,k;
cin >> n >> k;
ll a[n];
ll psum[n+1];
ll msum[n+1];
ll ans=-1LL*1e15;
psum[0]=0;msum[0]=0;
rep(i,n){
cin >> a[i];
psum[i+1]=psum[i];
msum[i+1]=msum[i];
if(a[i]>0){
psum[i+1] +=a[i];
}
else msum[i+1]+=a[i];
}
rep(i,n-k+1){
ll t=psum[n];
ans=max(ans,t+msum[i+k]-msum[i]);
ans=max(ans,t-psum[i+k]+psum[i]);
}
cout << ans << endl;
return 0;
} | 1 | 28,398,445 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a, b;
cin>>a>>b;
if(b==1)
cout<<"0";
else
cout<<a-b;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n,k;
cin>>n>>k;
if(k==1)
{
cout<<"0"<<endl;
return 0;
}
int tmp = n - k;
cout<<tmp<<endl;
return 0;
} | 1 | 12,651,709 |
#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
int main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
int R; cin >> R;
if( R < 1200) cout << "ABC" << endl;
else if (R < 2800) cout << "ARC" << endl;
else cout << "AGC" << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n;cin>>n;
if(n>=2800)cout<<"AGC"<<endl;
else if(n>=1200)cout<<"ARC"<<endl;
else cout<<"ABC"<<endl;
return 0;
} | 1 | 12,188,247 |
#include <iostream>
#include <numeric>
#include <stdio.h>
#include <iomanip>
#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>
using namespace std;
using ll = long long;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
int Max(int(a), int(b), int(c)) {
return max(max(a, b), c);
}
int Min(int(a), int(b), int(c)) {
return min(min(a, b), c);
}
int main() {
int A, B;
cin >> A >> B;
char S = 'x';
if (A + B == 15) {
S = '+';
}
else if (A * B == 15) {
S = '*';
}
cout << S << endl;
} | #include<iostream>
#include<stdio.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include <cassert>
#include <cmath>
#include<cstdint>
#define INF 1e9
#define rep(i,n)for(int i=0;(i)<(int)(n);i++)
#define REP(i,a,b)for(int i=(int)(a);(i)<=(int)(b);i++)
#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;
#define vec(type,n) vector<type>(n)
#define vvec(m,n) vector<vector<int>> (int(m),vector<int>(n))
#define ALL(a) (a).begin(),(a).end()
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<ll, ll>;
int main(){
int a, b;
cin >> a >> b;
if(a * b == 15)cout << '*' << endl;
else if(a + b == 15)cout << '+' << endl;
else cout << 'x' << endl;
} | 1 | 63,153,091 |
#include<iostream>
int sum[2];
int main(){
for(int i=0;i<2;i++){
for(int j=0,a;j<4;j++){
std::cin>>a;
sum[i]+=a;
}
}
std::cout<<std::max(sum[0],sum[1])<<std::endl;
return 0;
} | #include<iostream>
using namespace std;
int main ()
{
int a=0,b=0;
for(int i=0;i<4;i++)
{
int q;
cin>>q;
a+=q;
}
for(int i=0;i<4;i++)
{
int q;
cin>>q;
b+=q;
}
if(a>b)cout<<a<<endl;
else cout<<b<<endl;
return 0;
} | 1 | 35,860,596 |
#include<iostream>
#include<string>
#include<map>
#include<algorithm>
using namespace std;
typedef long long ll;
const int Max = 1e3 + 7;
int ls1[Max], ls2[Max];
int n;
int main()
{
string s, t;
cin >> s >> t;
for (int i = 0; i <= s.size() - 1; i++)
{
ls1[i] = s[i] - 'a' + 1;
}
for (int i = 0; i <= t.size() - 1; i++)
{
ls2[i] = t[i] - 'a' + 1;
}
sort(ls1, ls1 + s.size());
sort(ls2, ls2 + t.size(),greater<int>());
int f =0;
for (int i = 0; i <= max(s.size(), t.size()) - 1; i++)
{
if (ls1[i] == ls2[i])continue;
if (ls1[i] < ls2[i])
{
f = 1;
break;
}
else
{
f = 0;
break;
}
}
if (f)cout << "Yes";
else cout << "No";
} | #include <stdio.h>
#include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <queue>
#include <map>
using namespace std;
#define print(x) cout<<(x)<<endl
#define prints(x, y) cout<<(x)<<" "<<(y)<<endl
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define ll long long int
#define pb push_back
int main() {
string s, t;
cin >> s >> t;
sort(s.begin(), s.end());
sort(t.rbegin(), t.rend());
if(s < t) print("Yes");
else print("No");
} | 1 | 91,764,936 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) (a).begin(),(a).end()
#define VI vector<int>
#define MOD 1000000007
typedef long long int ll;
const ll INF=(ll)1e19;
int main(){
int a,b;
cin >> a >> b;
cout << (a<=8 && b<=8 ? "Yay!" : ":(") << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main(){
ll A, B;
cin >> A >> B;
if (A <= 8 && B <= 8) printf("Yay!\n");
else printf(":(\n");
return 0;
} | 1 | 48,703,150 |
#include <bits/stdc++.h>
#define rep(i,n) for (int (i) = 0; (i) < (n); i++)
#define ll long long
using namespace std;
int main() {
ll N = 0, M = 0;
cin >> N >> M;
if(N*500 >= M){
cout << "Yes";
}
else{
cout << "No";
}
} | #include <iostream>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <cstring>
#include <climits>
using namespace std;
#define ll long long
#define FOR(i,n) for(int i=0;i<n;i++)
#define sz(x) (int)(x.size())
#define all(x) (x).begin(),(x).end()
template<typename tp> void read(tp &x) {cin >> x;}
template<typename tp, typename... Args> void read(tp& x, Args&... args) {read(x);read(args...);}
const int mxN = (int)1e5,INF = (int)1e9,MOD = (int)1e9+7;
void solve()
{
int k,x;
read(k,x);
cout << (k*500>=x?"Yes":"No");
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int test = 1;
while(test--)
solve();
return 0;
} | 1 | 66,506,697 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<math.h>
#include<queue>
#include<numeric>
#define all(x) (x).begin(),(x).end()
typedef long long ll;
using namespace std;
int main()
{
int N; cin >> N;
vector<int> c(N), s(N), f(N);
for(int i=0; i<N-1; i++) cin >> c[i] >> s[i] >> f[i];
for(int i=0; i<N; i++){
int t = 0;
for(int j=i; j<N-1; j++){
if(j == i) t += c[j] + s[j];
else{
if(t <= s[j]) t = c[j] + s[j];
else if(t%f[j] == 0) t += c[j];
else t += c[j] + f[j] - t%f[j];
}
}
cout << t << endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 100000000000000
int main(){
int n;cin>>n;
vector<int> c(n-1),s(n-1),f(n-1);
for(int i=0;i<n-1;i++){
cin>>c[i]>>s[i]>>f[i];
}
vector<int> ans(n,0);
for(int i=0;i<n;i++){
ans[i]=s[i]+c[i];
}
for(int i=0;i<n-2;i++){
for(int j=i+1;j<n-1;j++){
ans[i]=s[j]+max(0,(ans[i]-s[j]+f[j]-1)/f[j])*f[j];
ans[i]+=c[j];
}
}
for(int i=0;i<n-1;i++){
cout<<ans[i]<<endl;
}
cout<<0<<endl;
return 0;
} | 1 | 7,755,292 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <cmath>
#include <math.h>
using namespace std;
#define coYES cout << "YES" << endl
#define coNO cout << "NO" << endl
#define coYes cout << "Yes" << endl
#define coNo cout << "No" << endl
#define coyes cout << "yes" << endl
#define cono cout << "no" << endl
#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 Cinint(n) int n;\
cin >> n;
#define Cinvecint(a, n) vector<int> a(n);\
for (int i = 0; i < (int)(n); i++) {\
int num;\
cin >> num;\
a.at(i) = num;\
}
#define Cinstring(s) string s;\
cin >>s;
int main() {
double l;
cin >> l;
double hen = l/3;
printf("%.10lf\n", hen*hen*hen);
} | #include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
typedef long double ld;
const int inf=1e9+7;
const ll longinf=1LL<<60;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
#define F first
#define S second
constexpr char ln = '\n';
const int mx=100010;
const ll mod=1e9+7;
int main(){
ld n;
cin >> n;
n /= 3.0;
ld ans = n*n*n;
cout << fixed << setprecision(10) << ans << ln;
return 0;
} | 1 | 24,557,939 |
#include <iostream>
#include <vector>
#include <algorithm>
#define rep(i, n) for(int i = 0; i < (int)(n); ++i)
#define REP(i, n) for(int i = 1; i < (int)(n); ++i)
using namespace std;
int main() {
string S;
long long K;
cin >> S >> K;
vector<int> renzoku;
int cnt = 1;
REP(i, S.size()) {
if (S[i - 1] != S[i]) {
renzoku.push_back(cnt);
cnt = 1;
} else {
++cnt;
}
}
renzoku.push_back(cnt);
if (renzoku.size() == 1) {
cout << renzoku[0] * K / 2 << endl;
return 0;
}
long long ans = 0;
if (S[0] == S[S.size() - 1]) {
ans += renzoku[0] / 2;
ans += renzoku[renzoku.size() - 1] / 2;
ans += (renzoku[0] + renzoku[renzoku.size() - 1]) / 2 * (K - 1);
REP(i, renzoku.size() - 1) ans += renzoku[i] / 2 * K;
} else {
for (int x : renzoku) ans += x / 2 * K;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vll = vector<vl>;
using Pll = pair<ll, ll>;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(v) v.begin(), v.end()
#define sz(x) ((int) x.size())
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define F first
#define S second
const int MOD = 1e9+7;
const ll INF = 2e15;
template<class T> void print(const T& t){ cout << t << endl; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
int main(){
string s;
cin >> s;
ll k;
cin >> k;
bool z = true;
rep(i, sz(s) - 1){
if(s[i]!=s[i+1]){
z = false;
}
}
if(z){
print(k * sz(s) / 2);
return 0;
}
string ss = s + s;
string sss = s + s + s;
string ssss = s + s + s + s;
string sssss = s + s + s + s + s;
ll n = 0, m = 0, o = 0, u = 0, a = 0;
for (ll i = 1; i < sz(s); i++){
if(s[i]==s[i-1]){
s[i] = '*';
n++;
}
}
for (ll i = 1; i < sz(ss);i++){
if(ss[i]==ss[i-1]){
ss[i] = '*';
m++;
}
}
for (ll i = 1; i < sz(sss);i++){
if(sss[i]==sss[i-1]){
sss[i] = '*';
o++;
}
}
for (ll i = 1; i < sz(ssss);i++){
if(ssss[i]==ssss[i-1]){
ssss[i] = '*';
u++;
}
}
for (ll i = 1; i < sz(sssss);i++){
if(sssss[i]==sssss[i-1]){
sssss[i] = '*';
a++;
}
}
ll l = m - n;
ll p = o - m;
ll q = u - o;
ll b = a - u;
ll ans;
if(k==1){
ans = n;
}
else if(k==2){
ans = m;
}
else if(k==3){
ans = o;
}
else if(k==4){
ans = a;
}
else{
ans = a + b * (k - 5);
}
print(ans);
} | 1 | 4,501,759 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define FOR(i,b,e) for(int i=(b); i<=(int)(e); i++)
#define DEBUG 1
#if DEBUG
#define DUMP(a) REP(_i, a.size()) cout << a[_i] << (_i + 1 == a.size() ? "\n" : " ")
#define DUMP2D(b) REP(_j, b.size()) DUMP(b[_j]); cout << endl
#else
#define DUMP(a)
#define DUMP2D(b)
#endif
const int K_MAX = 1e5;
const int S_MAX = 9;
int K;
vector<vector<int>> dp;
int main() {
cin >> K;
dp = vector<vector<int>>(S_MAX + 1, vector<int>(10, 0));
REP(j, 10) dp[0][j] = 1;
REP(i, S_MAX) {
REP(j, 10) {
if (j > 0) dp[i + 1][j] += dp[i][j - 1];
dp[i + 1][j] += dp[i][j];
if (j < 9) dp[i + 1][j] += dp[i][j + 1];
}
}
int sum = 0;
int i = 0;
int j = 1;
while (i <= S_MAX) {
sum += dp[i][j];
if (sum >= K) break;
if (j < 9) {
j++;
} else {
i++;
j = 1;
}
}
string ans = "";
while (true) {
ans += ('0' + j);
if (i == 0) break;
K = dp[i][j] - (sum - K);
sum = 0;
int i2 = i - 1;
int j2;
for (j2 = max(j - 1, 0); j2 <= min(j + 1, 9); j2++) {
sum += dp[i2][j2];
if (sum >= K) break;
}
i = i2;
j = j2;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define ALL(c) (c).begin(), (c).end()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v.begin(), v.end(), x) != v.end())
using namespace std;
using ll = long long;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline void dump(vector<T> v) { for (auto& x : v) cerr << x << " "; cerr << endl; }
template<class T> inline void dump(vector<pair<T, T>> v) { for (auto& p : v) cerr << p.first << " " << p.second << endl; }
template<class T> inline void dump(vector<vector<T>> vv) { for (auto& v : vv) {for (auto& x : v) cerr << x << " "; cerr << endl;} }
constexpr int INF = 1e9 + 5;
constexpr long long INFLL = 1LL << 62;
constexpr double eps = (1e-9);
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll k;
cin >> k;
vector<ll> lu;
queue<ll> q;
for (int i = 1; i <= 9; i++) {
lu.push_back(i);
q.push(i);
}
while (lu.size() < k && !q.empty()) {
ll n = q.front(); q.pop();
ll b = n % 10;
ll ne = n * 10;
if (b != 0) {
lu.push_back(ne + b - 1LL);
q.push(ne + b - 1LL);
}
lu.push_back(ne + b);
q.push(ne + b);
if (b != 9) {
lu.push_back(ne + b + 1LL);
q.push(ne + b + 1LL);
}
}
cout << lu[k-1] << endl;
return 0;
} | 1 | 9,118,039 |
#include <iostream>
int main(void)
{
int w, h, x, y, r;
std::cin >> w;
std::cin >> h;
std::cin >> x;
std::cin >> y;
std::cin >> r;
if (x < r || x > w - r || y < r || y > h - r) {
std::cout << "No" << std::endl;
} else {
std::cout << "Yes" << std::endl;
}
return 0;
} | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cstring>
#include <climits>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<ll, int> ll_i;
typedef pair<double, int> d_i;
typedef pair<ll, ll> ll_ll;
typedef pair<double, double> d_d;
struct edge { int u, v; ll w; };
int MOD = 1000000007;
int main() {
int W, H, x, y, r;
cin >> W >> H >> x >> y >> r;
if (x - r >= 0 && y - r >= 0 && x + r <= W && y + r <= H)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | 1 | 81,080,510 |
#include <bits/stdc++.h>
#define rep(i,n) for(int64_t i=0;i < (int64_t)(n);i++)
using namespace std;
vector<vector<int>> fspattern;
vector<int> fspattern_draft;
int fspcnt = 0;
void setfspattern_core(int floor,int number,int degree){
if(floor==degree){
fspattern.at(fspcnt) = fspattern_draft;
fspcnt++;
}else{
rep(i,number){
fspattern_draft.at(floor) = i;
setfspattern_core(floor+1,number,degree);
}
}
}
void setfspattern(int number,int degree){
int64_t array_num = 1;
rep(i,degree){
array_num *= number;
}
fspattern = vector<vector<int>>(array_num,vector<int>(degree));
fspattern_draft = vector<int>(degree);
setfspattern_core(0,number,degree);
}
int main(){
vector<int> a(3);
cin >> a.at(0) >> a.at(1) >> a.at(2);
sort(a.begin(),a.end());
if(a.at(0) == a.at(1)){
cout << a.at(2) << endl;
}else{
cout << a.at(0) << endl;
}
} | #include<iostream>
using namespace std;
int main()
{
int a, b, c;
cin >> a >> b >> c;
if(a == b)
cout << c;
if(b == c)
cout << a;
if(a == c)
cout << b;
return 0;
} | 1 | 46,097,110 |
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <cmath>
#include <vector>
using namespace std;
int N;
vector < pair <int, int> > v;
long double maxAns;
inline bool cmp(const pair <int, int> A, const pair <int, int> B)
{
return atan2(A.second, A.first) < atan2(B.second, B.first);
}
int main()
{
cin >> N;
for(int i = 1; i <= N; i++)
{
int x, y;
cin >> x >> y;
v.push_back({x, y});
}
sort(v.begin(), v.end(), cmp);
for(int i = 0; i < N; i++)
v.push_back(v[i]);
for(int start = 0; start < N; start++)
{
long long x = 0LL, y = 0LL;
for(int l = 1; l <= N; l++)
{
x += 1LL * v[start + l - 1].first;
y += 1LL * v[start + l - 1].second;
maxAns = max(maxAns, sqrtl(1LL * x * x + y * y));
}
}
cout << fixed << setprecision(60) << maxAns << '\n';
return 0;
} | #include <iostream>
#include <iomanip>
#include <vector>
#include <set>
#include <string>
#include <queue>
#include <algorithm>
#include <map>
#include <cmath>
#include <numeric>
#include <list>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <tuple>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define show(a, n) rep(i,n) {cout<<a[i]<<' ';} cout<<endl;
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<long long, long long> pll;
const int INF = 1 << 30;
const long long INFL = 1LL << 62;
const int MOD = 1000000007;
const int MAX = 100000;
const int N = 100010;
typedef long double ld;
typedef tuple<ld, ld, ld> tup;
const ld pi = acos(-1);
int main() {
cout << fixed << setprecision(30);
int n;
cin >> n;
vector<tup> v;
rep(i, n) {
ld x, y, arg;
cin >> x >> y;
if(x == 0.0 && y >= 0.0) {
arg = pi / 2.0;
}
else if(x == 0.0 && y < 0.0) {
arg = -pi / 2.0;
}
else {
arg = atan(y / x);
if(x < 0.0) arg += pi;
}
v.push_back(tup(arg, x, y));
}
sort(v.begin(), v.end());
ld ans = 0.0;
for(int i = 0; i < n; i++) {
ld tmp_x = get<1>(v[i]);
ld tmp_y = get<2>(v[i]);
ans = max(sqrt(pow(tmp_x, 2.0) + pow(tmp_y, 2.0)), ans);
for(int j = 1; j <= n - 1; j++) {
tmp_x += get<1>(v[(i + j) % n]);
tmp_y += get<2>(v[(i + j) % n]);
ans = max(sqrt(pow(tmp_x, 2.0) + pow(tmp_y, 2.0)), ans);
}
}
cout << ans << endl;
} | 1 | 55,755,942 |
#include <iostream>
using namespace std;
int main() {
int count = 0;
int input;
while(1){
count++;
cin >> input;
if(input == 0){
break;
}
cout << "Case " << count << ": " << input << endl;
}
} | #include <stdio.h>
int main()
{
int a;
int b = 0;
while(1)
{
b++;
scanf("%d",&a);
if(a==0) break;
printf("Case %d: %d\n",b,a);
a = 0;
}
return 0;
} | 1 | 68,571,657 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define agewari(a, b) ((ll)a + ((ll)b - 1)) / b
const int MOD = 1000000007;
const long long INF = 1LL << 60;
using Graph = vector<vector<ll>>;
int main()
{
ll l, r;
cin >> l >> r;
if (r - l + 1 >= 2019)
{
cout << 0 << endl;
return 0;
}
ll ans = 2020;
for (int i = l; i < r; i++)
{
for (int j = i + 1; j <= r; j++)
{
ll t1 = i % 2019;
ll t2 = j % 2019;
ans = min((t1 * t2) % 2019, ans);
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const long long MX = 1e10 + 10;;
unsigned long long fac[1000010];
#include <math.h>
#define PI 3.14159265358979323846264338327950L
long long gcd(long long a, long long b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
long long lcm(long long a, long long b) {
return (a * b) / gcd(a, b);
}
long long digits(long long m) {
long long cnt = 0;
while (m) {
cnt++;
m /= 10;
}
return cnt;
}
unsigned long long power(unsigned long long x, unsigned long long y){
unsigned long long res = 1;
x = x % MOD;
while (y > 0) {
if (y & 1)
res = (res * x) % MOD;
y = y >> 1;
x = (x * x) % MOD;
}
return res;
}
unsigned long long modInverse(unsigned long long n) {
return power(n, MOD - 2);
}
int main() {
long long l, r;
cin >> l >> r;
if (r - l > 2020) {
cout << 0;
}
else {
long long ans = 2020;
for (long long i = l; i < r; i++) {
for (long long j = l + 1; j <= r; j++) {
ans = min(ans, ((i * j) % 2019));
}
}
cout << ans;
}
return 0;
} | 1 | 2,819,096 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
string s; cin >> s;
char B[26]{0};
for (int i = 0; i < s.size(); ++i)
B[s[i]-'a']++;
for (int i = 0; i < 26; ++i)
if (!B[i])
{
cout << char(97+i) << endl;
return 0;
}
cout << "None" << endl;
} | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,x) distance(c.begin(),lower_bound(all(c),x))
#define ub(c,x) distance(c.begin(),upper_bound(all(c),x))
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;}
const ll mod=1e9+7;
int main(){
vector<ll> a(26);
string s;
cin >> s;
ll n=s.length();
rep(i,n){
ll v=s[i]-'a';
a[v]++;
}
rep(i,26){
if(a[i]==0){
char c='a'+i;
cout << c << endl;
return 0;
}
}
cout << "None" << endl;
return 0;
} | 1 | 88,475,992 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cassert>
#include <string>
#include <cstring>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <algorithm>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
#define INF 922337203685477580
#define IINF (1<<21)
typedef long long ll;
ll dp[100100];
int N;
int main() {
cin >> N;
REP(i, N + 100) {
dp[i] = INF;
}
REP(_, N) {
ll in;
cin >> in;
*lower_bound(dp, dp + N, in) = in;
}
int cnt = 0;
REP(i, N) {
if (dp[i] < INF) cnt++;
}
cout << cnt << endl;
return 0;
} | #include<iostream>
#include<cstdio>
#include<vector>
#include<queue>
#include<map>
#include<string>
#include<algorithm>
#include<functional>
#define ll long long
#define inf 1999999999
#define pa pair<int,int>
using namespace std;
int nibun(int a[],int d,int l,int h){
if(h-l<=1 && a[h]>d) return l;
else if(h-l<=1) return h;
else{
int m=(l+h)/2;
if(a[m]>=d) nibun(a,d,l,m-1);
else nibun(a,d,m,h);
}
}
int main(){
int n,w;
int a[100010];
int dp[100010];
cin>>n;
for(int i=0;i<n+1;i++)dp[i]=inf;
dp[0]=-1;
for(int i=0;i<n;i++) cin>>a[i];
dp[1]=a[0];
int length=1;
for(int i=1;i<n;i++){
int k=nibun(dp,a[i],0,n+1);
if(dp[k]<a[i]) dp[k+1]=a[i];
if(dp[length+1]!=inf) length++;
}
cout<<length<<endl;
return 0;
} | 1 | 55,748,749 |
#include<iostream>
using namespace std;
void message(int, int, int);
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a < b)
{
if (b < c) message(a, b, c);
else
{
if (a < c) message(a, c, b);
else message(c, a, b);
}
}
else
{
if (a < c) message(b, a, c);
else
{
if (b < c) message(b, c, a);
else message(c, b, a);
}
}
return 0;
}
void message(int x, int y, int z) {
cout << x << " " << y << " " << z << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
vector<int> a(3);
std::cin >> a[0] >> a[1] >> a[2];
sort(a.begin(), a.end());
for (int i = 0; i < 3; i++) {
if(i != 2)std::cout << a[i] << " ";
else std::cout << a[i] << std::endl;
}
return 0;
} | 1 | 88,413,554 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
int N;
ll K;
vector<int> A, B;
void input() {
cin >> N >> K;
A = B = vector<int>(N);
rep(i, N) cin >> A[i] >> B[i];
}
int main() {
input();
vector<P> w;
rep(i, N) w.push_back(P(A[i], B[i]));
sort(w.begin(), w.end());
ll x = 0;
rep(i, N) {
x += w[i].second;
if (K <= x) {
cout << w[i].first << endl;
return 0;
}
}
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
struct Edge {
ll to;
ll cost;
};
int main() {
ll N, K;
cin >> N >> K;
vector<P> A(N);
REP(i, N) cin >> A[i].first >> A[i].second;
sort(A.begin(), A.end());
ll i = 0;
while(0<K){
K -= A[i].second;
if (K <= 0) break;
i++;
}
cout << A[i].first << endl;
} | 1 | 64,099,184 |
#include<bits/stdc++.h>
#define rep(i,m) for(long long i=0; i<m; i++)
#define per(i,m) for(long long i=m-1; i>=0; i--)
#define FOR(i,n,m) for(long long i=n; i<m; i++)
#define ROF(i,n,m) for(long long i=n-1; i>=m; i--)
#define all(x) (x).begin(),(x).end()
#define EPS (1e-7)
#define INF (1e18)
#define PI (acos(-1))
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
typedef pair<ll, ll> LP;
ll POW(ll x,ll n){
if(n==0)return 1;
if(n%2==0)return POW(x*x%MOD,n/2);
return x*POW(x,n-1)%MOD;
}
ll gcd(ll u, ll v) {
ll r;
while (0 != v) {
r = u % v; u = v; v = r;
}
return u;
}
ll KAI(ll m)
{
if(m<0) return 0;
if(m==0) return 1;
return m*KAI(m-1)%MOD;
}
ll extGCD(ll a, ll b, ll &x, ll &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
ll d = extGCD(b, a%b, y, x);
y -= a / b * x;
return d;
}
inline ll mod(ll a, ll m) {
return (a % m + m) % m;
}
ll modinv(ll a) {
ll x, y;
extGCD(a, MOD, x, y);
return mod(x, MOD);
}
ll COM(ll m,ll n)
{
if(m<n) return 0;
if(n<0) return 0;
if(n==0) return 1;
if(m==n) return 1;
return KAI(m)%MOD*modinv(KAI(n)%MOD*KAI(m-n)%MOD)%MOD;
}
ll DEC(ll x,ll m,ll n)
{
return x%POW(m,n+1)/POW(m,n);
}
ll keta(ll x,ll n)
{
if(x==0)return 0;
return keta(x/n,n)+1;
}
ll DIV(ll x,ll n)
{
if(x==0)return 0;
return x/n+DIV(x/n,n);
}
int main()
{
ll x,y;
cin >> x >> y;
if(x<=7&&y<=7){
if(x==y){printf("Brown");
return 0;
}
if((x==0&&y==1)||(x==1&&y==2)||(x==2&&y==3)||(x==2&&y==6)||(x==2&&y==7)||(x==3&&y==7)||(x==6&&y==7)||(x==1&&y==0)||(x==2&&y==1)||(x==3&&y==2)||(x==6&&y==2)||(x==7&&y==2)||(x==7&&y==3))
{printf("Brown");
return 0;
}
printf("Alice");
return 0;
}
if(x==y){printf("Brown");
return 0;
}
if(abs(x-y)==1){printf("Brown");
return 0;
}
printf("Alice");
return 0;
} | #include <iostream>
#include <cstdio>
using namespace std;
long long x, y;
int main()
{
cin >> x >> y;
cout << ((x - y) > 1 || (x - y) < -1 ? "Alice" : "Brown") << endl;
return 0;
} | 1 | 9,229,778 |
#include <bits/stdc++.h>
#define rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (int)(a) ; i < (int)(b) ; i++)
#define SZ(x) ((int)(x).size())
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
struct Vector{
double x, y;
};
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;
}
using namespace std;
int facctorial(int k){
int sum = 1;
for (int i = 1; i <= k; ++i)
{
sum *= i;
}
return sum;
}
int Combination(int n, int r) {
if ( r * 2 > n ) r = n - r;
int dividend = 1;
int divisor = 1;
for ( unsigned int i = 1; i <= r; ++i ) {
dividend *= (n-i+1);
divisor *= i;
}
return dividend / divisor;
}
int main()
{
int n,m, ans = 0;
cin >> n >> m;
if (n >= 2) ans += Combination(n, 2);
if (m >= 2) ans += Combination(m, 2);
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define reprrev(i,a,b) for(int i=b-1;i>=a;i--)
#define reprev(i,n) reprrev(i,0,n)
using ll = long long;
using ull = unsigned long long;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
const ll mod = 1e9+7;
void chmod(ll &M){
if(M >= mod) M %= mod;
else if(M < 0){
M += (abs(M)/mod + 1)*mod;
M %= mod;
}
}
ll modpow(ll x, ll n){
if(n==0) return 1;
ll res=modpow(x, n/2);
if(n%2==0) return res*res%mod;
else return res*res%mod*x%mod;
}
int getl(int i, int N) { return i==0? N-1:i-1; };
int getr(int i, int N) { return i==N-1? 0:i+1; };
long long GCD(long long a, long long b) {
if (b == 0) return a;
else return GCD(b, a % b);
}
using namespace std;
int main()
{
int N, M;
cin >> N >> M;
int sum_1 = 0;
int sum_2 = 0;
for(int i = 0; i < N; i++) { sum_1 += i; cerr << sum_1 << endl;}
for(int j = 0; j < M; j++) { sum_2 += j; cerr << sum_2 << endl;}
int ans = sum_1 + sum_2;
cout << ans << endl;
} | 1 | 94,866,290 |
#include<algorithm>
#include<iostream>
#include<string>
#include<cstdio>
#include<cmath>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define swap(a,b) tmp=ver[b], ver[b]=ver[a], ver[a]=tmp;
int main(){
double x1, y1, x2, y2, x3, y3, xp, yp;
double p, q, r;
while(cin>>x1>>y1>>x2>>y2>>x3>>y3>>xp>>yp){
p=(x2-x1)*(yp-y1)-(y2-y1)*(xp-x1);
q=(x3-x2)*(yp-y2)-(y3-y2)*(xp-x2);
r=(x1-x3)*(yp-y3)-(y1-y3)*(xp-x3);
if(p*q>0 && q*r>0 && r*p>0){
cout << "YES" << endl;
}
else {
cout << "NO" << endl;
}
}
return 0;
} | #include<iostream>
using namespace std;
int main(){
double x1, y1, x2, y2, x3, y3, px, py;
double det, s, t;
while(cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> px >> py){
det = ((x2 - x1) * (y3 - y1)) - ((x3 - x1) * (y2 - y1));
if(det == 0){
cerr << "行列式の値が0です" << endl;
return -1;
}
s = (((y3 - y1) * (px - x1)) + ((x1 - x3) * (py - y1))) / det;
t = (((y1 - y2) * (px - x1)) + ((x2 - x1) * (py - y1))) / det;
if((s > 0) && (s < 1) && (t > 0) && (t < 1) && ((s + t) < 1)){
cout << "YES" << endl;
}else{
cout << "NO" << endl;
}
}
return 0;
} | 1 | 10,171,059 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
int ans=1000;
cin>>s;
for(int i=0;i<s.size()-2;i++){
if(abs(753-((s[i]-'0')*100+(s[i+1]-'0')*10+s[i+2]-'0'))<ans){
ans=abs(753-((s[i]-'0')*100+(s[i+1]-'0')*10+s[i+2]-'0'));
}
}
cout<<ans<<endl;
return(0);
} | #include <bits/stdc++.h>
#include <string>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
string s;
std::cin >> s;
int minv = 1000;
for (int i = 0; i < s.size() - 2; ++i) {
minv = min(minv, abs(stoi(s.substr(i, 3)) - 753));
}
std::cout << minv << std::endl;
return 0;
} | 1 | 16,808,327 |
#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>;
template <class T>
inline bool chmin(T &a, T b)
{
if (a > b)
{
a = b;
return true;
}
return false;
}
const int INF = 1e9;
int main()
{
int n;
cin >> n;
vector<int> m;
m.push_back(1);
int x = 6;
while (n >= x)
{
if (n >= x)
m.push_back(x);
x *= 6;
}
x = 9;
while (n >= x)
{
if (n >= x)
m.push_back(x);
x *= 9;
}
vector<int> dp(n + 1, INF);
dp[0] = 0;
rep(yen, n + 1)
{
rep(i, m.size())
{
if (yen - m[i] >= 0)
chmin(dp[yen], dp[yen - m[i]] + 1);
}
}
cout << dp[n] << endl;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
template <typename T>
void print_vec(const vector<T>& v, bool is_reverse=false, int num=0){
if(num == 0) num = (int)v.size();
if(is_reverse) for(int i=num-1; i>=0; i--){ cout<<v[i]; if(i!=0) cout<<" ";}
else for(int i=0; i<num; i++){ cout<<v[i]; if(i!=num-1) cout<<" ";}
cout << endl;
}
template <typename T>
void print_pairvec(const vector<T> &v, int num=0){
if(num == 0) num = (int)v.size();
cout << endl;
for(int i=0; i<num; i++){ cout << v[i].first << " " << v[i].second << endl;}
}
template <typename TYPE>
void print_vec2(const vector<vector<TYPE>>& v){
cout << endl; cout << " ";
for(int i=0; i<v[0].size(); i++) cout << i << " ";
cout << endl;
for(int i=0; i<v.size(); i++){
cout << "i=" << i << ": ";
for(int j=0; j<v[i].size(); j++){
if(v[i][j] == 0) cout << "\x1B[0m" << v[i][j] << " ";
else cout << "\x1B[31m" << v[i][j] << " ";
}
cout << "\x1B[0m" << endl;
}
}
int chmin(int &a, int b){ return a = min(a, b); }
int main(){
int N;
cin >> N;
int ans = N;
for(int i=0; i<=N; i++){
int num6 = i;
int cnt = 0;
int pow6 = pow(6, 6);
while(num6 > 0){
int num = num6 / pow6;
num6 -= num* pow6;
pow6 /= 6;
cnt += num;
}
int num9 = N-i;
int pow9 = pow(9, 5);
while(pow9 > 0 ){
int num = num9 / pow9;
num9 -= num* pow9;
pow9 /= 9;
cnt += num;
}
ans = min(ans, cnt);
}
cout << ans << endl;
return 0;
} | 1 | 86,789,537 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long n,h,ans=0;
cin >> n >> h;
vector<long> a(n);
vector<long> b(n);
for(long i=0;i<n;i++) cin >> a[i] >> b[i];
sort(a.begin(),a.end());
sort(b.begin(),b.end());
for(long i=n-1;i>=0;i--) {
if(b[i]<a.back()) break;
ans++;
h-=b[i];
if(h<=0) break;
}
if(h>0) ans+=(h+a.back()-1)/a.back();
cout << ans << endl;
} | #pragma GCC diagnostic ignored "-Wunused-variable"
#include <bits/stdc++.h>
using namespace std;
#define BOOST
#ifdef BOOST
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/range/adaptor/reversed.hpp>
using namespace boost;
using ml = boost::multiprecision::cpp_int;
using md = boost::multiprecision::cpp_dec_float_100;
#define forir(i, ...) if(ll i=(ll)v.size())for(__VA_ARGS__)if(i--,1)
#define eachr(i, e, c) forir(i, auto &&e: adaptors::reverse(c))
#endif
using ll = long long;
using ld = long double;
using pll = pair<long long, long long>;
template <class T> using vt = vector<T>;
template <class T> using vvt = vector<vector<T>>;
template <class T> using vvvt = vector<vector<vector<T>>>;
#define all(c) (c).begin(), (c).end()
#define coutd cout << fixed << setprecision(10)
#define output(x) do{cout<<x;exit(0);}while(0)
#define rep(i, b, e) for (ll i = b; i < e; i++)
#define repr(i, b, e) for (ll i = b; e < i; i--)
#define fori(i, ...) if (ll i = -1) for(__VA_ARGS__) if (i++, 1)
#define each(i, e, c) fori (i, auto&& e: c)
#define llong_max 9223372036854775807
#define ldbl_max 1.79769e+308
#define pi 3.1415926535897932
auto Ceil = []
(auto x) { return (ll)ceil(x); };
auto Count = []
(auto b, auto e, auto x) { return (ll)count(b, e, x); };
auto CtoL = []
(auto c) { return (ll)c - (ll)'0'; };
auto LtoC = []
(auto n) { return (char)('0' + n); };
auto Pow = []
(auto a, auto b) { return (ll)pow(a, b); };
auto Pow2 = []
(auto n) { return (1LL << n); };
auto Pow10 = []
(auto n) { return (ll)pow(10, n); };
auto Size = []
(auto& c) { return (ll)(c).size(); };
auto Sum = []
(auto b, auto e) { return accumulate(b, e, 0LL); };
template <class T> void MakeVVT
(ll ys, ll xs, vvt<T>& v, T fill = T())
{
v.resize(ys); rep(y, 0, ys) v[y].resize(xs, fill);
}
template <class T> void MakeVVVT
(ll zs, ll ys, ll xs, vvvt<T>& v, T fill = T())
{
v.resize(zs); rep(z, 0, zs) MakeVVT(ys, xs, v[z], fill);
}
template <class T> void InputVT
(ll xs, vt<T>& v, T fix = T())
{
v.resize(xs); rep(i, 0, xs) { cin >> v[i]; v[i] += fix; }
}
template <class T> void InputVVT
(ll ys, ll xs, vvt<T>& v, T fix = T())
{
MakeVVT(ys, xs, v, fix);
rep(y, 0, ys) rep(x, 0, xs) { cin >> v[y][x]; v[y][x] += fix; }
}
template <class T> void InputVVVT
(ll zs, ll ys, ll xs, vvvt<T>& v, T fix = T())
{
v.resize(zs); rep(z, 0, zs) InputVVT(ys, xs, v[z], fix);
}
namespace NyaGadget {}
auto NyaaSort = [](const pll& l, const pll& r)
{
return l.second > r.second;
};
using namespace NyaGadget;
int main(void)
{
ll N, H; cin >> N >> H;
vt<pll> katana(N); each(i, e, katana) cin >> e.first >> e.second;
sort(all(katana), greater<pll>());
sort(katana.begin() + 1, katana.end(), NyaaSort);
ll ans = 0;
rep(i, 0, N)
{
if (katana[0].first < katana[i].second)
{
H -= katana[i].second;
++ans;
}
if (H <= 0) output(ans);
}
ans += Ceil((ld)H / (ld)katana[0].first);
cout << ans;
return 0;
} | 1 | 82,911,490 |
#include<bits/stdc++.h>
#include<math.h>
using namespace std;
#define rep(i,n) for (int i=0;i<n;i++)
int main(){
int N; int64_t K; cin >> N >> K;
vector<pair<int, int>> ab;
int a, b;
rep(i,N){
cin >> a >> b;
ab.push_back(make_pair(a,b));
}
sort(ab.begin(),ab.end());
int64_t sum=0;
rep(i,N){
sum += ab.at(i).second;
if (sum>=K){
cout << ab.at(i).first << endl;
break;
}
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
#define f first
#define s second
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define all(x) (x).begin(), (x).end()
#define rall(x) rbegin(x), rend(x)
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) FOR(i, 0, a)
#define ROF(i, a, b) for (int i = (b); i >= (a); i--)
#define R0F(i, a) ROF(i, 0, a-1)
#define trav(x, a) for (auto& x: a)
const int MX = 2e5+5;
const int MOD = 1e9+7;
const ll INF = 1061109567;
const ld EPS = 1e-9;
const ld PI = acos(-1);
struct Info {
ll a,b;
};
bool cmp(Info a, Info b) {
return a.a < b.a;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
ll N,K; cin >> N >> K;
vector<Info> v;
F0R(i,N) {
Info x; cin >> x.a >> x.b;
v.pb(x);
}
sort(all(v),cmp);
ll ac = 0;
F0R(i,N) {
if (ac+v[i].b >= K) {
cout << v[i].a << "\n";
exit(0);
}
ac += v[i].b;
}
cout << "-1\n";
} | 1 | 91,803,168 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
int inf = 10e17;
#define mod 1000000007
bool vis[200005];
vector<int> vec[2000005], v1;
int child[2000005];
int parent[2000005];
int div1[100005];
int min_indx[900005];
int count1 = 0;
int height = 0;
int max_indx[200005];
void dfs(int node)
{
vis[node] = 1;
min_indx[count1] = node;
max_indx[node] = min(max_indx[node], count1);
count1++;
child[node] = height++;
for (int i = 0; i < vec[node].size(); i++)
{
if (!vis[vec[node][i]])
{
dfs(vec[node][i]);
min_indx[count1] = node;
max_indx[node] = min(max_indx[node], count1);
count1++;
}
}
height--;
}
int MAXN = 200005;
int LOGMAXN = (int)log2(200005) + 1;
int M[200005][60];
void process2(int A[], int N)
{
int i, j;
for (i = 0; i < N; i++)
M[i][0] = i;
for (j = 1; 1 << j <= N; j++)
for (i = 0; i + (1 << j) - 1 < N; i++)
if (A[M[i][j - 1]] < A[M[i + (1 << (j - 1))][j - 1]])
M[i][j] = M[i][j - 1];
else
M[i][j] = M[i + (1 << (j - 1))][j - 1];
}
vector<int> vec1;
int lev[200005];
int dis[200005];
bool cmp(pair<int, int> &a,
pair<int, int> &b)
{
return a.second < b.second;
}
int32_t main()
{
int n, m;
cin >> n >> m;
if (n <= 8 && m <= 8)
cout << "Yay!"
<< "\n";
else
{
cout << ":("
<< "\n";
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int a, b;
cin >> a >> b;
if(a > 8 || b > 8){
cout << ":(";
}
else{
cout << "Yay!";
}
return 0;
} | 1 | 10,632,996 |
#include <iostream>
using namespace std;
int main (){
int a,b,c;
cin>>a>>b>>c;
if (a==b&a!=c){
cout<<c;
}
else if (a==c&a!=b){
cout<<b;
}
else if (b==a&b!=c){
cout<<c;
}
else if (b==c&b!=a){
cout<<a;
}
else if (c==a&c!=b){
cout<<b;
}
else if (c==b&c!=a){
cout<<a;
}
return 0;
} | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,x) distance(c.begin(),lower_bound(all(c),x))
#define ub(c,x) distance(c.begin(),upper_bound(all(c),x))
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;}
const ll mod=1e9+7;
int main(){
map<ll,ll> m;
rep(i,3){
ll a;
cin >> a;
m[a]++;
}
for(auto x:m){
if(x.se==1){
cout << x.fi << endl;
}
}
} | 1 | 92,263,882 |
#include <bits/stdc++.h>
using namespace std;
int bunbun(string s){
string t = s;
reverse(t.begin(), t.end());
return s == t;
}
int main() {
string S;
cin >> S;
int N = S.size();
bool a = true;
if (!bunbun(S)) a = false;
if (!bunbun(S.substr(0, S.size() / 2))) a = false;
cout << (a ? "Yes" : "No") << 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(void){
string s;
cin >> s;
int n = s.size();
bool ok = true;
int a = n / 2;
rep(i,a) if(s[i] != s[n-1-i]) ok = false;
int b = (n-1)/2;
int c = b / 2;
rep(i,c) if(s[i] != s[b-1-i]) ok = false;
int d = (n+3)/2;
int e = d / 2;
for(int i = d; i < e; i++){
if(s[i-1] != s[i+e-1]) ok = false;
}
if(ok) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | 1 | 14,020,935 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define P pair<ll, ll>
#define Graph vector<vector<ll>>
#define fi first
#define se second
constexpr ll mod = 1000000007;
constexpr ll INF = (1ll << 60);
constexpr double pi = 3.14159265358979323846;
template <typename T>
inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <typename T>
inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
ll a, b;
cin >> a >> b;
cout << (a + b + 1) / 2 << "\n";
return 0;
} | #include <iostream>
using namespace std;
int main(void){
int a,b,z;
cin>>a>>b;
z=a+b;
if(z%2==0){
cout<<z/2<<endl;
}
else if(z%2>0){
cout<<z/2+1<<endl;
}
else{
cout<<z/2<<endl;
}
} | 1 | 78,288,003 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, l;
cin >> n >> l;
vector< string > v(n);
for(int i = 0; i < n; ++i) cin >> v[i];
sort(v.begin(),v.end());
for(auto x: v) cout << x;
} | #include <bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define fo(i, n) for (i = 0; i < n; i++)
#define Fo(i, k, n) for (i = k; k < n ? i < n : i > n; k < n ? i += 1 : i -= 1)
#define ll long long
#define si(x) scanf("%d", &x)
#define sl(x) scanf("%lld", &x)
#define ss(s) scanf("%s", s)
#define pi(x) printf("%d\n", x)
#define pl(x) printf("%lld\n", x)
#define ps(s) printf("%s\n", s)
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << endl
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define clr(x) memset(x, 0, sizeof(x))
#define sortall(x) sort(all(x))
#define tr(it, a) for (auto it = a.begin(); it != a.end(); it++)
#define PI 3.1415926535897932384626
typedef pair<int, int> pii;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<char> vc;
typedef vector<vc> vcc;
typedef vector<pii> vpii;
typedef vector<pl> vpl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
mt19937_64 rang(chrono::high_resolution_clock::now().time_since_epoch().count());
int rng(int lim)
{
uniform_int_distribution<int> uid(0, lim - 1);
return uid(rang);
}
int mpow(int base, int exp);
void ipgraph(int n, int m);
void dfs(int u, int par);
const int mod = 1'000'000'007;
const int N = 3e5, M = N;
vi g[N];
int a[N];
void solve()
{
ll i, j, n, m;
cin >> n >> m;
vector<string> a(n, "");
fo(i, n)
{
cin >> a[i];
}
sort(all(a));
fo(i, n)
{
cout << a[i];
}
}
int main()
{
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
srand(chrono::high_resolution_clock::now().time_since_epoch().count());
int t = 1;
while (t--)
{
solve();
}
return 0;
}
int mpow(int base, int exp)
{
base %= mod;
int result = 1;
while (exp > 0)
{
if (exp & 1)
result = ((ll)result * base) % mod;
base = ((ll)base * base) % mod;
exp >>= 1;
}
return result;
}
void ipgraph(int n, int m)
{
int i, u, v;
while (m--)
{
cin >> u >> v;
u--, v--;
g[u].pb(v);
g[v].pb(u);
}
}
void dfs(int u, int par)
{
for (int v : g[u])
{
if (v == par)
continue;
dfs(v, u);
}
} | 1 | 37,868,135 |
#include <bits/stdc++.h>
#define INF 1e9
using namespace std;
#define REPR(i,n) for(int i=(n); i >= 0; --i)
#define FOR(i, m, n) for(int i = (m); i < (n); ++i)
#define REP(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define ALL(a) (a).begin(),(a).end()
#define endl "\n"
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
typedef long long ll;
void solve() {
string s;
int w;
cin >> s;
cin >> w;
REP(i,s.size()) if(i%w == 0) cout << s[i];
cout << endl;
}
int main() {
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define P pair<ll, ll>
#define Graph vector<vector<ll>>
#define fi first
#define se second
constexpr ll mod = 1000000007;
constexpr ll INF = (1ll << 60);
constexpr double pi = 3.14159265358979323846;
template <typename T>
inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <typename T>
inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
string S;
ll w;
cin >> S >> w;
for (ll i = 0; i < S.size(); i += w) {
cout << S[i];
}
cout << "\n";
return 0;
} | 1 | 98,099,937 |
#include<iostream>
using namespace std;
int main()
{
int n;
cin>>n;
long long ans=n-1;
ans=ans*(ans+1)/2;
cout<<ans;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define file() freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define tt int t; cin>>t; while(t--)
#define nl cout<<"\n";
#define sp cout<<" ";
#define rep(i, a, b) for(long long i=a; i<b; i++)
const int INF = 1e9 + 7;
const int MOD = 1e9 + 7;
double PI = 4*atan(1);
int main()
{
optimize();
ll n;
cin>> n;
cout << (n * (n-1))/2;
nl;
return 0;
} | 1 | 23,335,961 |