code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 2
101M
|
|---|---|---|---|
# include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template<class T>constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template<class T>constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char>T_char TL(T_char cX) { return tolower(cX); };
template <typename T_char>T_char TU(T_char cX) { return toupper(cX); };
const int vy[] = { -1, -1, -1, 0, 1, 1, 1, 0 }, vx[] = { -1, 0, 1, 1, 1, 0, -1, -1 };
const int dx[4] = { -1,0,1,0 }, dy[4] = { 0,-1,0,1 };
int popcnt(unsigned long long n) { int cnt = 0; for (int i = 0; i < 64; i++)if ((n >> i) & 1)cnt++; return cnt; }
int d_sum(LL n) { int ret = 0; while (n > 0) { ret += n % 10; n /= 10; }return ret; }
int d_cnt(LL n) { int ret = 0; while (n > 0) { ret++; n /= 10; }return ret; }
LL gcd(LL a, LL b) { if (b == 0)return a; return gcd(b, a%b); };
LL lcm(LL a, LL b) { LL g = gcd(a, b); return a / g*b; };
# define ALL(qpqpq) (qpqpq).begin(),(qpqpq).end()
# define UNIQUE(wpwpw) (wpwpw).erase(unique(ALL((wpwpw))),(wpwpw).end())
# define LOWER(epepe) transform(ALL((epepe)),(epepe).begin(),TL<char>)
# define UPPER(rprpr) transform(ALL((rprpr)),(rprpr).begin(),TU<char>)
# define FOR(i,tptpt,ypypy) for(LL i=(tptpt);i<(ypypy);i++)
# define REP(i,upupu) FOR(i,0,upupu)
# define INIT std::ios::sync_with_stdio(false);std::cin.tie(0)
# pragma warning(disable:4996)
LL x, y;
int main() {
cin >> x >> y;
cout << (abs(x - y) >= 2 ? "Alice" : "Brown") << endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define pi pair<ll,ll>
#define pii pair<ll,pi>
#define pb push_back
#define mk make_pair
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll x, y;
cin >> x >> y;
if (abs(x - y) <= 1)
cout << "Brown" << endl;
else
cout << "Alice" << endl;
} | 1 | 11,067,804 |
#include <cstdio>
#include <iostream>
#include <cstring>
#include <vector>
using namespace std;
vector<pair<int, int>> fVec, tVec;
vector<int> dirVec[2];
int e[5], memo[8001][16004], result[5];
char s[8005];
void func(int dir, int tidx, int hap, int fidx)
{
if(result[dir] == 1)
{
return;
}
if(tidx == dirVec[dir].size())
{
if(hap == e[dir])
{
result[dir] = 1;
}
return;
}
int &ret = memo[tidx][hap + 8001];
if(ret != 0)
{
return;
}
ret = 1;
int nextHap = 0;
for(int i = fidx; i < fVec.size(); i++)
{
if(fVec[i].first > dirVec[dir][tidx])
{
nextHap = fVec[i].second;
fidx = i;
break;
}
}
func(dir, tidx + 1, hap + nextHap, fidx + 1);
func(dir, tidx + 1, hap - nextHap, fidx + 1);
return;
}
int main()
{
int length;
scanf("%s %d %d", s, &e[0], &e[1]);
length = strlen(s);
int count = 1;
for(int i = 0; i < length; i++)
{
if(s[i] != s[i + 1])
{
if(s[i] == 'T')
{
tVec.push_back({i, count});
}
else
{
fVec.push_back({i, count});
}
count = 0;
}
count++;
}
if(tVec.size() == 0)
{
if(e[1] == 0 && fVec[0].second == e[0])
{
printf("Yes");
}
else
{
printf("No");
}
return 0;
}
if(fVec.size() == 0)
{
if(e[0] == 0 && e[1] == 0)
{
printf("Yes");
}
else
{
printf("No");
}
return 0;
}
int flag = 0;
for(int i = 0; i < tVec.size(); i++)
{
if(tVec[i].second % 2 != 0)
{
flag = !flag;
}
dirVec[flag].push_back(tVec[i].first);
}
int startHap = 0, startF = 0;
if(fVec[0].first < tVec[0].first)
{
startHap = fVec[0].second;
startF = 1;
}
func(0, 0, startHap, startF);
memset(memo, 0, sizeof memo);
func(1, 0, 0, 0);
result[0] + result[1] == 2 ? printf("Yes") : printf("No");
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define fi first
#define se second
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
template<class T, class S> void cmin(T &a, const S &b) { if (a > b)a = b; }
template<class T, class S> void cmax(T &a, const S &b) { if (a < b)a = b; }
template<class A>void PR(A a,ll n){rep(i,n){if(i)cout<<' ';cout<<a[i];}cout << "\n";}
ld PI=3.14159265358979323846;
int main(){
string s;
ll x,y;
cin >> s >> x >> y;
map<ll,ll> LX, LY;
LX[0] = 1;
LY[0] = 1;
vector<ll> v,h;
ll N = s.size();
ll cnt = 0;
bool st = 0;
bool init = 1;
rep(i,N){
map<ll,ll> tm;
if(s[i] == 'T'){
if(st==0){
for(auto&e:LX){
tm[e.fi+cnt] = 1;
if(init)continue;
tm[e.fi-cnt] = 1;
}
LX = tm;
h.push_back(cnt);
init = 0;
}else{
for(auto&e:LY){
tm[e.fi+cnt] = 1;
tm[e.fi-cnt] = 1;
}
LY = tm;
v.push_back(cnt);
}
st = !st;
cnt = 0;
}else{
cnt++;
}
}
if(cnt > 0){
map<ll,ll> tm;
if(st==0){
for(auto&e:LX){
tm[e.fi+cnt] = 1;
if(init)continue;
tm[e.fi-cnt] = 1;
}
LX = tm;
h.push_back(cnt);
}else{
for(auto&e:LY){
tm[e.fi+cnt] = 1;
tm[e.fi-cnt] = 1;
}
LY = tm;
v.push_back(cnt);
}
}
if(LX[x]&&LY[y]){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
} | 1 | 30,581,215 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1LL << 60;
ll N;
vector<ll> a;
int main() {
cin >> N;
a.resize(N);
rep(i, N) cin >> a[i];
map<P, ll> mp;
rep(i, N) {
if (i + 1 > a[i]) {
mp[P(a[i], i + 1)]++;
} else {
mp[P(i + 1, a[i])]++;
}
}
ll ans = 0;
for (auto v : mp) {
if (v.second == 2) {
ans++;
}
}
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
int n; cin >> n;
vector<int> a(n); for(int i = 0; i < n; i++){cin >> a[i]; a[i]--;}
int cnt = 0;
for(int i = 0; i < n; i++) {
if(a[a[i]] == i)cnt++;
}
cout << cnt / 2 << endl;
} | 1 | 82,559,210 |
#include <bits/stdc++.h>
using namespace std;
long long n, r = 1;
int main() {
cin >> n;
for (long long i = 2; i <= n; ++i) r *= i;
cout << r << '\n';
} | #include <bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
int main() {
int n;
cin >> n;
int64_t a = 1;
int x = n;
for (int i = 0; i < n; i++) {
a *= x;
x--;
}
cout << a << endl;
} | 1 | 41,285,878 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fi first
#define se second
#define pb push_back
#define debug(x) cerr << #x << ": " << x << endl
#define debug_vec(v) cerr << #v << ":"; rep(i, v.size()) cerr << " " << v[i]; cerr<<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; }
const int INF = (1<<30) - 1;
const ll LINF = (1LL<<60) - 1;
void solve() {
string s, t;
cin >> s >> t;
int cnt = 0;
rep(i, s.size()) {
if (s[i] != t[i]) cnt++;
}
cout << cnt << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define rep(i,n) for(ll i=0;i<(n);i++)
#define init(a,i) for(int k=0;k<(i);k++)(a)[k]=0
#define in(a,i) for(int k=0;k<(i);k++)cin>>(a)[k]
#define all(a) (a).begin(),(a).end()
#define el(a) (a).end()-(a).begin()
#define mod 1000000007
#define inf 2147483647
#define range(x,a,b) (a)<=x&&x<=(b)
int main(){
string s,t;
int count=0;
cin>>s>>t;
rep(i,s.size()){
if(s[i]==t[i])count++;
}
cout<<s.size()-count;
return 0;
} | 1 | 22,706,026 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)n;i++)
using Graph = vector<vector<int> >;
using GraphC = vector<vector<char> >;
typedef pair<int, int> P;
const int MAX_N = 10000;
const int MAX_L = 100000000;
const int MAX_SQRT_B = 10000;
const int INF = 1000000000;
typedef int64_t ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int main() {
ll H, W;
cin >> H >> W;
ll cost = H * W;
if (cost % 2 == 1) {
cost++;
}
if (H == 1 || W == 1) {
cout << 1 << endl;
return 0;
}
cout << cost / 2 << endl;
} | #include "bits/stdc++.h"
using namespace std;
void Main() {
long long H, W;
cin >> H >> W;
if (H == 1 || W == 1) {
cout << 1 << endl;
return;
}
long long ans = 0;
if (W % 2 == 0) {
ans = H * (W / 2);
}
else {
if (H % 2 == 0) {
ans = W * (H / 2);
}
else {
ans = W * (H - 1) / 2;
ans += (W + 1) / 2;
}
}
cout << ans << endl;
}
int main() {
std::cout << std::fixed << std::setprecision(15);
Main();
return 0;
} | 1 | 33,211,497 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define fi first
#define se second
const int N = 3e2+6;
const int mod = 1e9+7;
const int inf = 1e8;
int g[N][N];
int edg[N*10][3];
void solve(){
int n,m;
cin>>n>>m;
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
g[i][j] = inf;
}
g[i][i] = 0;
}
for(int i=0;i<m;i++){
int x,y,z;
cin>>x>>y>>z;
edg[i][0] = x;
edg[i][1] = y;
edg[i][2] = z;
g[x][y] = g[y][x] = z;
}
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
for(int k=1;k<=n;k++){
g[k][j] = min(g[k][j],g[k][i]+g[i][j]);
}
}
}
int ans = 0;
for(int i=0;i<m;i++){
int x,y,z;
x = edg[i][0];
y = edg[i][1];
z = edg[i][2];
int shrt = 1;
for(int j=1;j<=n;j++){
for(int k=1;k<=n;k++){
if(g[j][k]==int(g[j][x]+z+g[y][k]))shrt = 0;
if(g[j][k]==int(g[j][y]+z+g[x][k]))shrt = 0;
}
}
ans+=shrt;
}
cout<<ans<<endl;
}
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int t=1;
while(t--)solve();
return 0;
} | #pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
typedef unsigned long long int ull;
typedef pair<ll,ll> P;
template<class T> using V=vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
const ll inf=(1e18);
const ll mod=1000000007;
ll gcd(ll a,ll b) {return b ? gcd(b,a%b):a;}
ll lcm(ll c,ll d){return c/gcd(c,d)*d;}
struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
struct edge{
ll to,cost;
};
V<V<edge>> graph;
V<V<bool>> used;
V<ll> d1;
int n,m;
void dijkstra(ll s){
d1.resize(n);
for(int i=0;i<n;i++)d1[i]=inf;
d1[s]=0;
priority_queue<P,vector<P>,greater<P>> q;
q.push(P(0,s));
while(!q.empty()){
P a=q.top();
q.pop();
if(d1[a.se]<a.fi)continue;
for(int i=0;i<graph[a.se].size();i++){
edge e=graph[a.se][i];
if(d1[e.to]>d1[a.se]+e.cost){
d1[e.to]=d1[a.se]+e.cost;
q.push(P(d1[e.to],e.to));
}
}
}
q.push(P(0,s));
while(!q.empty()){
P a=q.top();
q.pop();
if(d1[a.se]<a.fi)continue;
for(int i=0;i<graph[a.se].size();i++){
edge e=graph[a.se][i];
if(d1[e.to]==d1[a.se]+e.cost){
used[a.se][e.to]=false;
used[e.to][a.se]=false;
q.push(P(d1[e.to],e.to));
}
}
}
return;
}
int main(){
cin>>n>>m;
used.assign(n,V<bool>(n,false));
graph.resize(n);
for(int i=0;i<m;i++){
ll a,b,c;
cin>>a>>b>>c;
a--;b--;
graph[a].push_back(edge{b,c});
graph[b].push_back(edge{a,c});
used[a][b]=true;
used[b][a]=true;
}
int ans=0;
for(int i=0;i<n;i++)dijkstra(i);
for(int i=0;i<n;i++){
for(int j=i+1;j<n;j++)if(used[i][j])ans++;
}
cout<<ans<<endl;
} | 1 | 26,987,884 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define endl '\n'
#define pb push_back
#define fi first
#define se second
#define all(c) (c).begin(),(c).end()
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef vector<int> vi;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define TRACE
#ifndef ONLINE_JUDGE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
cerr << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
const char* comma = strchr(names + 1, ',');cerr.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
}
#else
#define trace(...)
#endif
const ll inf = 2e18;
const int mod = 1e9 + 7;
const int N = 2e5 + 10;
signed main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n;
cin >> n;
vector<pii> v(n - 1);
for(int i = 0; i < n - 1; i++) {
cin >> v[i].fi >> v[i].se;
if(v[i].fi > v[i].se) {
swap(v[i].fi, v[i].se);
}
}
int ans = 0;
for(int i = 1; i <= n; i++) {
ans += i * (n - i + 1);
}
for(int i = 0; i < n - 1; i++) {
ans -= (v[i].fi) * (n - v[i].se + 1);
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define MAX 2000009
#define MOD 1000000007
#define endl '\n'
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
cout << fixed << setprecision(15);
#ifndef ONLINE_JUDGE
freopen("../input.txt", "r", stdin);
freopen("../output.txt", "w", stdout);
#endif
ll n;
cin>>n;
ll ans=0;
for(ll i=1;i<=n;i++){
ans+=(i*(i+1))/2;
}
for(ll i=1;i<=n-1;i++){
ll a,b;
cin>>a>>b;
if(a>b){
swap(a,b);
}
ans-=(a*(n-b+1));
}
cout<<ans<<endl;
return 0;
} | 1 | 12,356,003 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pdd;
typedef vector<ll> vll;
#define ALL(a) a.begin(),a.end()
#define SZ(a) ((int)a.size())
#define FI first
#define SE second
#define REP(i,n) for(int i=0;i<((int)n);i++)
#define REP1(i,n) for(int i=1;i<((int)n);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define PB push_back
#define EB emplace_back
#define MP(a,b) make_pair(a,b)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
#define Decimal fixed<<setprecision(20)
#define INF 1000000000
#define LLINF 1000000000000000000LL
const int inf = 1e9;
const ll linf = 1LL << 50;
const double eps = 1e-10;
const int MOD = 1e9 + 7;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin>>n;
n*=2;
vll a(n);
REP(i,n)
cin>>a[i];
sort(a.begin(), a.end());
ll sum = 0;
REP(i,n){
if(i%2==0)
sum += a[i];
}
cout<<sum<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define SZ(x) ((int)(x).size())
#define FOR(it,c) for ( __typeof((c).begin()) it=(c).begin(); it!=(c).end(); it++ )
using namespace std;
typedef pair<int,int> PII;
#define FF first
#define SS second
#define MP make_pair
#define PB push_back
#define M 1000000007
#define MM 998244353
#define SZ(a) int((a).size())
using ll = long long;
using VI = vector<int>;
using PII = pair<int, int>;
using PLL = pair<ll, ll>;
using VLL = vector<ll>;
using ld = long double;
int gcd(int a, int b)
{
if (b == 0)
return a;
return gcd(b, a % b);
}
const int MX = 2e5+10;
const int MX2 = 1e6+5;
ll INF= 4 * (ll)1e18;
int mx = 2 * (ll)1e9 + 10;
int main(int argc, const char * argv[]) {
ios_base::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
int n;
cin >> n;
vector<int> a(2*n);
for(int i = 0; i < 2 *n; ++i) cin >> a[i];
sort(a.begin(),a.end());
int ans= 0;
for (int i=2*n - 2; i >= 0; i-=2) {
ans = ans + a[i];
}
cout << ans << endl;
return 0;
} | 1 | 88,137,306 |
#include <bits/stdc++.h>
#define REP(i, n) for(int (i)=0;(i)<(n);++(i))
#define REPV(iter, v) for(auto (iter)=(v).begin(); (iter)!=(v).end();++(iter))
#define ALL(v) (v).begin(),(v).end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
int main()
{
ll Q, H, S, D, N;
cin >> Q >> H >> S >> D;
cin >> N;
ll minPriceS, minPriceD;
minPriceS = min(4 * Q, min(2 * H, S));
minPriceD = min(2 * minPriceS, D);
ll ans = (N / 2) * minPriceD + (N % 2) * minPriceS;
cout << ans << endl;
} | #include<bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define bit(n,k) (((ll)n>>(ll)k)&1)
const long long INF= 1e+18+1;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll> >vvl;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> T;
const ll MOD=1000000007LL;
string abc="abcdefghijklmnopqrstuvwxyz";
string ABC="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
vl dx={-1,-1,-1,0,0,1,1,1};
vl dy={1,-1,0,1,-1,1,0,-1};
int main(){
ll q,h,s,d;
cin>>q>>h>>s>>d;
ll n;cin>>n;
h=min(h,2*q);
s=min(s,2*h);
d=min(d,2*s);
cout<<n/2*d+n%2*s<<endl;
} | 1 | 11,950,083 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using Graph=vector<vector<int>>;
int main(){
int N;
cin>>N;
cout<<N/3<<endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define zero_pad(num) setfill('0') << std::right << setw(num)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
cout << n / 3 << endl;
} | 1 | 87,995,934 |
#include <iostream>
#include <iomanip>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b;
double ans, ra, rb;
string dolphinManJotaro;
cout << 1 * (a % b != 0);
return 0;
} | #include <iostream>
#include <algorithm>
#include <iomanip>
using namespace std;
using ll = long long;
#define pi 3.1415926
int x[3];
int main(){
int n, k;
cin >> n >> k;
if(n%k == 0)
cout << "0";
else
cout << "1";
} | 1 | 23,849,273 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
int main() {
int n;cin>>n;
int a[4];
rep(i,4){
a[3-i]=n%10;
n/=10;
}
int ans = 7 - a[0];
char s1,s2,s3;
rep(i,2){
rep(j,2){
rep(k,2){
int tmp = 0;
if(i==0){
tmp+=a[1];
s1 = '+';
}
else {
tmp-=a[1];
s1 = '-';
}
if(j==0){
tmp+=a[2];
s2 = '+';
}
else {
tmp-=a[2];
s2 = '-';
}
if(k==0){
tmp+=a[3];
s3 = '+';
}
else {
tmp-=a[3];
s3 = '-';
}
if(tmp==ans){
cout<<a[0]<<s1<<a[1]<<s2<<a[2]<<s3<<a[3]<<"=7"<<endl;
return 0;
}
else tmp = 0;
}
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#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 ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int main() {
string N; cin >> N;
vector<int> A(4,0);
REP(i,4){
A[i] = N[i]-'0';
}
REP(i,2){
REP(j,2){
REP(k,2){
int num = A[0];
num += (i==1?A[1]:-A[1]);
num += (j==1?A[2]:-A[2]);
num += (k==1?A[3]:-A[3]);
if(num==7){
cout << A[0];
cout << (i==1?"+":"-");
cout << A[1];
cout << (j==1?"+":"-");
cout << A[2];
cout << (k==1?"+":"-");
cout << A[3];
cout << "=7" << endl;
return 0;
}
}
}
}
return 0;
} | 1 | 87,309,601 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 200100;
int N;
int arr[MAXN];
int main()
{
ios_base::sync_with_stdio(0);
ll ctot = 0;
cin >> N;
for (int i = 0; i < N; i++)
{
cin >> arr[i];
ctot += arr[i];
}
ll ans = 1e18, mtot = 0;
for (int i = 0; i < N - 1; i++)
{
mtot += arr[i];
ans = min (ans, abs (ctot - 2 * mtot));
}
cout << ans << "\n";
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
typedef long long ll;
#define INF 1e9
int main(){
int n; cin >> n;
vector<int> a(n);
ll lsum = 0, rsum = 0;
rep(i,n) {
cin >> a[i];
rsum += a[i];
}
lsum += a[0];
rsum -= a[0];
ll ans = INF;
for(int i=1; i<n-1; i++){
lsum += a[i];
rsum -= a[i];
ans = min(ans, abs(lsum-rsum));
}
if(ans == INF) ans = abs(lsum-rsum);
cout << ans << endl;
} | 1 | 51,222,003 |
#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
using namespace std;
#define ll long long
#define rep(i,n) for (ll i = 0; i < (n); i++)
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
#define FORR(i,a,b)for(ll i=(a);i<=(b);i++)
#define repR(i,n) for(ll i=n;i>=0;i--)
#define all(v)(v).begin(),(v).end()
#define rall(v)(v).rbegin(),(v).rend()
#define F first
#define S second
#define pb push_back
#define pu push
#define COUT(x) cout<<(x)<<"\n"
#define PQ priority_queue<ll>
#define PQR priority_queue<ll,vector<ll>,greater<ll>>
#define YES(n) cout << ((n) ? "YES\n" : "NO\n" )
#define Yes(n) cout << ((n) ? "Yes\n" : "No\n" )
#define mp make_pair
#define sz(x) (ll)(x).size()
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const ll MOD = 1000000007LL;
const ll INF = 1LL << 60;
using vll = vector<ll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvll = vector<vll>;
using vstr = vector<string>;
using vc = vector<char>;
using vvc = vector<vc>;
template<class T> inline bool chmax(T& a, T b) {
if (a < b) { a = b; return true; } return false;
}
template<class T> inline bool chmin(T& a, T b) {
if (a > b) { a = b; return true; } return false;
}
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
ll dx[4]={0,1,0,-1};
ll dy[4]={1,0,-1,0};
vector<ll> res(0);
void yakusuu(ll n){
for(ll i=1;i*i<=n;i++){
if(n%i==0){
res.pb(i);
if(i!=n/i) res.pb(n/i);
}
}
return ;
}
int main(){
ll n;
cin>>n;
ll ans=0;
vll a(0,0);
rep(i,n+1){
if(i%2){
yakusuu(i);
if(sz(res)==8)ans++;
res=a;
}
}
COUT(ans);
} | #include <stdio.h>
int n;
int cnt_div(int x){
int cnt = 2;
for(int i=3;i<x;i+=2){
if(x%i==0) cnt ++;
}
return cnt;
}
int main(){
int cnt = 0;
scanf("%d",&n);
for(int i=1;i<=n;i+=2){
if(cnt_div(i)==8){
cnt++;
}
}
printf("%d\n",cnt);
} | 1 | 58,144,143 |
#include "bits/stdc++.h"
using namespace std;
long long a[200001];
int main()
{
int n;
long long mi = 1ll << 62;
scanf("%d", &n);
for(int i = 1; i <= n; ++i)
{
scanf("%lld", &a[i]);
a[i] += a[i - 1];
}
for(int i = 1; i < n; ++i)
{
mi = min(mi, abs(a[n] - a[i] - (a[i] - a[0])));
}
printf("%lld\n", mi);
} | #include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
using namespace std;
int main(void){
int n;
cin >> n;
long long int num[n];
long long int sum[n];
long long int ans = 10000000000000;
for(int i = 0; i < n; i++){
cin >> num[i];
if(i==0) sum[i]=num[i];
else sum[i]=sum[i-1]+num[i];
}
for(int i = 0; i < n-1; i++)
ans = min(ans, abs(sum[i]-(sum[n-1]-sum[i])));
cout << ans << endl;
return 0;
} | 1 | 63,237,356 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
ll GetDigit(ll num){ return log10(num)+1; }
int main()
{
vector<int> alpha(26);
string s;
cin >> s;
rep(i, s.length()){
alpha[(int)s[i]-97]++;
}
rep(i,26){
if(alpha[i] > 1){
cout << "no" << endl;
return 0;
}
}
cout << "yes" << endl;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair< int, int > pii;
typedef pair< pii, int > ppi;
#define fill(a,b) memset(a,b,sizeof(a))
#define all(v) (v).begin(),(v).end()
#define sp(k) cout<<setprecision(k)<<fixed;
#define rep(i,a) for(int i=0;i<a;i++)
#define rep1(i,a,b) for(int i=(a);i<=(b);++i)
#define irep(i,b,a) for(int i=(b);i>=(a);--i)
#define minv(v) *min_element(all(v))
#define maxv(v) *max_element(all(v))
#define unq(v) sort(all(v)),(v).erase(unique(all(v)),(v).end())
#define _ ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl "\n"
#define sqr(a) ((a)*(a))
#define sz(a) int(a.size())
#define ff first
#define ss second
#define pb push_back
const double pi = acos(-1.0);
const int mod = 1000000007;
const int inf = 0x3f3f3f3f;
const int maxn = 2000100;
int main(){
_
string s;
cin >> s;
sort(all(s));
for(int i = 0; i<sz(s)-1; i++){
if(s[i]==s[i+1]){
cout<<"no"<<endl;
return 0;
}
}
cout<< "yes" <<endl;
return 0;
} | 1 | 54,552,341 |
#include <bits/stdc++.h>
#define cinf(n,x) for(int i=0;i<(n);i++)cin>>x[i];
#define ft first
#define sc second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(),(v).end()
#define LB(a,x) lb(all(a),x)-a.begin()
#define UB(a,x) ub(all(a),x)-a.begin()
#define mod 1000000007
#define FS fixed<<setprecision(15)
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i=0;i<n;i++)
const double pi=3.141592653589793;
template<class T> using V=vector<T>;
using Graph = vector<vector<int>>;
using P=pair<int,int>;
typedef unsigned long long ull;
typedef long double ldouble;
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 ll INF=1e18;
int main(){
cin.tie(0);ios::sync_with_stdio(false);
int h,w;
cin>>h>>w;
char s[h][w];
queue<pair<P,int>> que;
rep(i,h){
rep(j,w){
cin>>s[i][j];
if(s[i][j]=='#')que.push(make_pair(make_pair(i,j),0));
}
}
int ans=0;
while(!que.empty()){
pair<P,int> p=que.front();
que.pop();
chmax(ans,p.sc);
int i=p.ft.ft;
int j=p.ft.sc;
for(int x=-1;x<=1;x++){
for(int y=-1;y<=1;y++){
if(abs(x+y)==1&&0<=i+x&&i+x<h&&0<=j+y&&j+y<w){
if(s[i+x][j+y]=='.'){
que.push(make_pair(make_pair(i+x,y+j),p.sc+1));
s[i+x][j+y]='#';
}
}
}
}
}
cout<<ans<<endl;
} | #include <iostream>
#include <iomanip>
#include <math.h>
#include <algorithm>
#include <functional>
#include <string>
#include <vector>
#include <cstring>
#include <set>
#include <map>
#include <queue>
#include <utility>
#include <limits.h>
using namespace std;
typedef long long LL;
#define rep(i,n) for (int i = 0; i < int(n); ++i)
template<class T> inline bool chmax(T& a, T b) { bool ret = (a < b); if (ret) { a = b; } return ret; }
template<class T> inline bool chmin(T& a, T b) { bool ret = (b < a); if (ret) { a = b; } return ret; }
#define dump(c) { for (auto it = c.begin(); it != c.end(); ++it) if (it == c.begin()) cout << *it; else cout << ' ' << *it; cout << endl; }
#define dumpMap(m) { for (auto it: m) cout << it.first << "=>" << it.second << ' '; }
const int INF = 1e9;
const LL INFL = 1e18;
const int MOD = 1000000007;
int dx[] = { 0, -1, 1, 0 };
int dy[] = { -1, 0, 0, 1 };
int main()
{
cin.tie(0);
ios::sync_with_stdio(0);
int h, w;
cin >> h >> w;
vector<string> a(h);
rep(i, h) cin >> a[i];
queue<pair<int, int>> q;
int white = h * w;
rep(y, h) rep(x, w) {
if (a[y][x] == '#') {
q.emplace(y, x);
--white;
}
}
int ans = 0;
while (0 < white && !q.empty()) {
queue<pair<int, int>> nq;
++ans;
while (!q.empty()) {
int cy = q.front().first;
int cx = q.front().second;
rep(i, 4) {
int y = cy + dy[i];
int x = cx + dx[i];
if (0 <= x && x < w && 0 <= y && y < h && a[y][x] == '.') {
a[y][x] = '#';
nq.emplace(y, x);
--white;
}
}
q.pop();
}
q.swap(nq);
}
cout << ans << endl;
return 0;
} | 1 | 6,919,456 |
#include <bits/stdc++.h>
using namespace std;
#define fastIO ios::sync_with_stdio(false);cout.tie(0);cin.tie(0);
#define endl '\n'
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define MP make_pair
#define inf INT_MAX
#define minf INT_MIN
typedef long long int lli;
ofstream outfile;
ifstream infile;
lli upper, lower, mid, ans;
void binsearch(lli l, lli u)
{
char deci;
if( l == u)
{
ans = l;
return;
}
lli mid = (l + u)/2;
cout << "? "<< (mid*10) << "\n";
fflush(stdout);
cin >> deci;
if( deci == 'Y')
{
binsearch(l, mid);
}
else
{
binsearch(mid+1, u);
}
}
int main()
{
infile.open("input.txt");
outfile.open("output.txt");
char deci;
lli x = 1, checker = 10000000000;
cout << "? "<< checker <<"\n";
fflush(stdout);
cin >> deci;
if( deci == 'Y')
{
while(checker)
{
cout << "? "<< (checker*2)<< "\n";
fflush(stdout);
cin >> deci;
if(deci == 'N')
break;
checker /= 10;
}
if( checker)
cout << "! "<< (checker*10)<< "\n";
else
cout << "! 1\n";
fflush(stdout);
return 0;
}
else
{
while(true)
{
cout << "? "<< x<< "\n";;
fflush(stdout);
cin >> deci;
if( deci == 'N')
break;
x *= 10;
}
upper = x-1;
lower = x/10+1;
binsearch(lower, upper);
cout << "! "<< ans << "\n";
fflush(stdout);
return 0;
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vs = vector<string>;
using pll = pair<ll, ll>;
using vp = vector<pll>;
#define rep(i, n) for(ll i = 0; i < (n); i++)
#define repr(i, a, b) for(ll i = (a); i < (b); i++)
#define ALL(a) (a).begin(), (a).end()
#define SZ(x) ((ll)(x).size())
const ll MOD = 1000000007;
const ll INF = 100000000000000000LL;
inline ll GCD(ll a, ll b){ return b?GCD(b, a % b):a; }
inline ll LCM(ll a, ll b){ return a/GCD(a, b)*b; }
inline ll powint(ll x, ll y){ ll r=1; while(y){ if(y&1) r*=x; x*=x; y>>=1; } return r; }
inline ll powmod(ll x, ll y, ll m = MOD){ ll r=1; while(y){ if(y&1) r*=x; x*=x; r%=m; x%=m; y>>=1; } return r; }
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; }
#ifdef OJ_LOCAL
#include "dump.hpp"
#else
#define dump(...) ((void)0)
#endif
bool q(ll n){
cout << "? " << n << endl;
char ans;
cin >> ans;
return ans=='Y';
}
bool nq(ll n){
cout << "? " << n << endl;
char ans;
cin >> ans;
return ans=='N';
}
void qd(ll n){
cout << "! " << n << endl;
exit(0);
}
ll BS(ll lb, ll ub, function<bool(ll)> f){
lb--;
while(ub - lb > 1){
ll mid = (lb + ub) / 2;
if(f(mid)){
ub = mid;
}else{
lb = mid;
}
}
return ub;
}
int main(){
ll ans = 0;
ll first_y = BS(1e9, 1e10-1, q);
dump(first_y);
if(first_y == (ll)1e9){
ans = 1;
while(nq(ans*10-1)){
ans *= 10;
}
qd(ans);
}else{
ans = first_y;
while(ans % 10 == 0){
ans /= 10;
}
ll r = 1;
while(r < ans){
r *= 10;
}
while(q(r)){
r *= 10;
ans *= 10;
}
qd(ans);
}
return 0;
} | 1 | 77,567,289 |
#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; }
template <class T>
T GCD(T a, T b)
{
T r;
while (a)
r = b, b = a, a = r % a;
return b;
}
template <class T>
T LCM(T a, T b) { return a / GCD(a, b) * b; }
#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, c, d, n;
int x, y;
char ch;
int main()
{
cin >> a >> b >> c >> d;
if (abs(a - c) <= d||(abs(a - b) <= d && abs(b - c) <= d ))
Yes();
else
No();
} | #include <bits/stdc++.h>
#define pb push_back
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,n,s) for(int i=(s);i<(n);i++)
#define rrep(i,n) for(int i=(n-1);i>=0;i--)
#define rreps(i,n,s) for(int i=s;i>=n;i--)
#define MOD 1000000007
using ll = long long;
using namespace std;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int a,b,c,d;
cin>>a>>b>>c>>d;
if((abs(a-b)<=d&&(abs(b-c))<=d)||abs(a-c)<=d){
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<endl;
}
return 0;
} | 1 | 32,548,098 |
#include<stdio.h>
#include<algorithm>
#include<string.h>
using namespace std;
main()
{
int height[10];
int i,j;
for(i=0;i<10;i++)
{
scanf("%d",&height[i]);
}
sort(height, height+10);
for(j=0;j<3;j++)
{
printf("%d\n",height[9-j]);
}
return 0;
} | #include<iostream>
#include<algorithm>
using namespace std;
int main(){
int data[10];
for(int i=0;i<10;i++){
cin >>data[i];}
sort(data,data+10);
for(int i=9;i>6;i--){
cout <<data[i]<<endl;}
return 0;
} | 1 | 31,092,368 |
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstring>
#include<queue>
#include<tuple>
#include<utility>
#include<map>
#include<math.h>
#include<iomanip>
#include<stdio.h>
#include<stdlib.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define range(a) a.begin(), a.end()
#define endl "\n"
#define Yes() cout << "Yes" << endl
#define No() cout << "No" << endl
#define MP make_pair
using Graph = vector<vector<int>>;
const unsigned long long mod = 1e9 + 7;
const long long INF = 1LL<<60;
const int dx[4]={1,0,-1,0};
const int dy[4]={0,1,0,-1};
void chmin(long long &a, long long b) { if (a > b) a = b; }
void chmax(long long &a, long long b) { if (a < b) a = b; }
int main(void){
ios::sync_with_stdio(0);
cin.tie(0);
int N, K, count=0;
cin >> N >> K;
FOR(i, 0, N){
int h;
cin >> h;
if(h>=K)
count++;
}
cout << count << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, k, ct = 0;
cin >> n >> k;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
if (x >= k) {
ct++;
}
}
cout << ct;
} | 1 | 2,455,621 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const ll MOD = 1e9+7;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
const ld EPS = 1e-10;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};
struct ANT
{
int st;
int en;
int go;
};
struct CRASH
{
int no0;
int no1;
int t;
};
int main(){
int n,l,t;
cin>>n>>l>>t;
vector<ANT> ant(n);
vector<int> enpos(n);
int x,w;
int cnt=0;
rep(i,n){
cin>>x>>w;
int go=w==1? go=1 : go=-1;
int st=x;
int en=(x+t*go);
while(en<0){
en+=l;
cnt--;
}
while(en>l){
en-=l;
cnt++;
}
ant[i]={st,en,go};
enpos[i]=en;
}
sort(enpos.begin(),enpos.end());
cnt=(cnt%n+n)%n;
rotate(enpos.begin(),enpos.begin()+cnt,enpos.end());
rep(i,n) cout<<enpos[i]<<endl;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9 + 10;
int dx[5] = {0, 0, 1, -1, 0}, dy[5] = {1, -1, 0, 0, 0};
const double EPS = 1e-10;
bool cmp(P a, P b) { return a.second < b.second; }
int n, L, T;
int x[100010], w[100010];
int main(void){
cin>>n>>L>>T;
for (int i = 0; i < n; i++) cin>>x[i]>>w[i];
vector<ll> tmp(n);
for (int i = 0; i < n; i++) {
if (w[i] == 1) tmp[i] = (x[i] + T) % L;
else tmp[i] = ((x[i] - T) % L + L) % L;
}
sort(tmp.begin(), tmp.end());
ll cnt = 0;
for (int i = 0; i < n; i++) {
if (w[i] == 1) cnt -= (T - (L - x[i]) + L) / L;
else cnt += (T - (x[i] + 1) + L) / L;
}
cnt = (cnt % n + n) % n;
vector<ll> res(n);
for (int i = 0; i < n; i++) res[(i + cnt) % n] = tmp[i];
for (int i = 0; i < n; i++) cout<< res[i] <<endl;
return 0;
} | 1 | 78,159,219 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
string s, t;
cin >> n >> s >> t;
int ans;
bool sum = true;
if (s.size() <= t.size()) {
for (int i = 0; i < s.size(); i++) {
string st = s.substr(0, i) + t;
if (st.substr(0, s.size()) == s && st.substr(st.size() - t.size()) == t) {
ans = st.size();
sum = false;
break;
}
}
if (sum) {
ans = s.size() + t.size();
}
} else {
for (int i = 0; i < t.size(); i++) {
string st = s + t.substr(t.size() - i);
if (st.substr(0, s.size()) == s && st.substr(st.size() - t.size()) == t) {
ans = st.size();
sum = false;
break;
}
}
if (sum) {
ans = s.size() + t.size();
}
}
cout << ans << endl;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vecll vector<long long>
#define vec2ll vector<vector<long long>>
#define vecbool vector<bool>
#define vecpairll vector<pair<long long,long long>>
#define forll(s,a,b) for(long long s = a;s < b;s++)
#define forllde(s,a) for(long long s = a;s > 0;s--)
int main()
{
ll n, p;
string s, t;
cin >> n >> s >> t;
forll(i, 0, t.size()){
if(t.substr(0, t.size()-i) == s.substr(i)){
p = i;
break;
}
}
cout << s.size() + p << endl;
} | 1 | 15,570,671 |
#include <algorithm>
#include <bitset>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <math.h>
#include <stdio.h>
using namespace std;
#define PI acos(-1.0)
#define Pi 3.141592653589793
#define EPS (1e-7)
#define INF (0x3f3f3f3f)
#define nn '\n'
#define pb push_back
#define ull unsigned long long
#define ll long long
#define MOD 1000000007
#define sz(a) int((a).size())
#define space " "
#define All(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (int i = 0; i < n; i++)
#define Cini(a) \
int a; \
cin >> a;
#define Cinii(a, b) \
int a, b; \
cin >> a >> b;
#define Ciniii(a, b, c) \
int a, b, c; \
cin >> a >> b >> c;
#define Cins(s) \
string s; \
cin >> s;
#define Cinss(s1, s2) \
string s1, s2; \
cin >> s1 >> s2;
#define Cinc(c) \
char c; \
cin >> c;
#define deb(x) cout << #x << ": " << x << endl
#define deb2(x, y) cout << #x << ": " << x << '\t' << #y << ": " << y << endl;
#define deb3(x, y, z) \
cout << #x << ": " << x << '\t' << #y << ": " << y << '\t' << #z << ": " \
<< z << endl;
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
#define int long long
signed main(void) {
cin.sync_with_stdio(false);
cin.tie(0);
Cini(N);
Cins(S);
Cini(K);
rep(i,N)if(S[i]!=S[K-1])S[i]='*';
cout << S << nn;
return 0;
} | #include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#ifdef DEBUG
#define show(...) cerr << #__VA_ARGS__ << " = ", debug(__VA_ARGS__);
#else
#define show(...) 42
#endif
using namespace std;
using ll = long long;
using pii = pair<int, int>;
template <typename T, typename S>
ostream& operator<<(ostream& os, pair<T, S> a) {
os << '(' << a.first << ',' << a.second << ')';
return os;
}
template <typename T>
ostream& operator<<(ostream& os, vector<T> v) {
for (auto x : v) os << x << ' ';
return os;
}
void debug() {
cerr << '\n';
}
template <typename H, typename... T>
void debug(H a, T... b) {
cerr << a;
if (sizeof...(b)) cerr << ", ";
debug(b...);
}
int main(){
int n;
string s;
cin >> n >> s;
int k;
cin >> k;
k--;
rep(i,n){
if(s[i] != s[k])cout << "*";
else cout << s[i];
}
cout << endl;
} | 1 | 45,460,945 |
#include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INF INT_MAX
#define INFLL LLONG_MAX
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define per(i, n) for(ll i=((ll)(n))-1; i>=0; i--)
#define perf(i, n) for(ll i=((ll)(n)); i>0; i--)
#define all(v) v.begin(), v.end()
#define endl "\n"
#define vi vector<ll>
#define vvi vector<vector<ll>>
#define Yes() cout << "Yes" << endl
#define YES() cout << "YES" << endl
#define No() cout << "No" << endl
#define NO() cout << "NO" << endl
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; }
using namespace std;
ll f(ll n){ return (n%2 == 0) ? n/2 : 3*n+1; }
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(10);
map<ll, ll> mp;
ll s; cin >> s; mp[s]++;
ll cnt = 1;
for(;mp[s]<2;cnt++) s = f(s), mp[s]++;
cout << cnt << endl;
} | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ld long double
#define al(a) (a).begin(),(a).end()
#define mk make_pair
#define check cout<<"?"<<endl;
ll MOD=1000000007;
ll mod=998244353;
int inf=1000001000;
ll INF=1e18+5;
int main(){
int s,cnt=1; cin>>s;
set<int> st;
while(1){
st.insert(s);
cnt++;
if(s%2) s=3*s+1;
else s/=2;
if(st.count(s)){
cout<<cnt<<endl;
return 0;
}
}
} | 1 | 41,873,918 |
#include <bits/stdc++.h>
#define eb emplace_back
using namespace std;
bitset<8055> TX, TY;
char A[8055];
vector<int> XV, YV;
int N, X, Y, DX, DY;
int main() {
scanf(" %s%d%d", A, &X, &Y);
N = strlen(A);
int i = 0;
for(; i < N && 'F' == A[i]; i++) X--;
for(int c = 0; i < N; i++) {
if('T' == A[i]) {
if(DX) {
XV.eb(DX);
DX = 0;
}
if(DY) {
YV.eb(DY);
DY = 0;
}
c ^= 1;
}
if('F' == A[i]) (c ? DY : DX)++;
}
if(DX) {
XV.eb(DX);
DX = 0;
}
if(DY) {
YV.eb(DY);
DY = 0;
}
X = abs(X); Y = abs(Y);
TX[0] = TY[0] = true;
for(int v : XV) {
TX = (TX<<v) | (TX>>v);
}
for(int v : YV) {
TY = (TY<<v) | (TY>>v);
}
puts(TX[X] && TY[Y] ? "Yes" : "No");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int N = 8100;
const int LIM = N<<1;
bool dp[2][2][LIM];
void solve() {
string s; cin >> s;
int ta[2];
cin >> ta[0] >> ta[1];
s += "T";
vector<int> a[2];
int dir = 0;
int len = 0;
int n = s.size();
int i = 0;
while (s[i]!='T') {
len++; i++;
}
dp[0][0][N+len] = true;
dp[1][0][N] = true;
len=0;
for (; i < n; i++) {
if (s[i] != 'T') len++;
else {
if (len) a[dir].emplace_back(len);
dir ^= 1;
len = 0;
}
}
bool res = true;
for (int i = 0; i < 2; i++) {
int n = a[i].size();
int crt = 0;
for (int j = 0; j < n; j++) {
int nxt = crt^1;
for (int k = 0; k < LIM; k++) {
dp[i][nxt][k] = false;
}
int ds = a[i][j];
for (int k = 0; k < LIM; k++) {
if (k+ds < LIM) dp[i][nxt][k+ds] |= dp[i][crt][k];
if (k-ds >= 0) dp[i][nxt][k-ds] |= dp[i][crt][k];
}
crt ^= 1;
}
res &= dp[i][crt][N+ta[i]];
}
cout << (res?"Yes":"No");
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
cout << endl;
} | 1 | 86,591,053 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string s;
bool flag;
int ans = 0;
cin >> s;
for (int i = 1; i < s.size(); i++)
{
if ((s.size() - i) % 2 == 1)
continue;
flag = true;
for (int j = 0; j < (s.size() - i) / 2; j++)
{
if (s[j] != s[(s.size() - i) / 2 + j])
{
flag = false;
break;
}
}
if (flag)
{
ans = s.size() - i;
break;
}
}
cout << ans << endl;
} | #include <iostream>
#include <cstdint>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unordered_set>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpii;
typedef vector<vector<int>> vvi;
typedef vector<vector<char>> vvc;
typedef vector<vector<string>> vvs;
typedef vector<vector<ll>> vvll;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rrep(i, n) for (ll i = 1; i <= (n); ++i)
#define irep(it, stl) for (auto it = stl.begin(); it != stl.end(); it++)
#define drep(i, n) for (ll i = (n)-1; i >= 0; --i)
#define mes(a) cout << (a) << endl
#define dmes(a, b) cout << (a) << " " << (b) << endl
#define re0 return 0
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define rSort(a) sort(a.rbegin(), a.rend())
#define Rev(a) reverse(a.begin(), a.end())
#define MATHPI acos(-1)
#define itn int
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
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;
}
struct io
{
io()
{
ios::sync_with_stdio(false);
cin.tie(0);
}
};
const int INF = INT_MAX;
const ll LLINF = 1LL << 60;
const ll MOD = 1000000007;
const double EPS = 1e-19;
ll gcd(ll a, ll b) {
return b ? gcd(b, a%b) : a;
}
signed main() {
string s;
cin >> s;
ll len = (ll)s.size();
ll r = 0;
for (ll i = len-2; i > 0; i -= 2) {
bool flg = true;
rep(j, i/2) {
if (s[j] != s[j+(i/2)]) flg = false;
}
if(flg) r = max (r, i);
}
mes(r);
} | 1 | 90,424,935 |
#include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define x first
#define y second
#define mk(a,b) make_pair(a,b)
#define rr return 0
#define sqr(a) ((a)*(a))
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()
using namespace std;
using namespace __gnu_cxx;
using namespace __gnu_pbds;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template<class value, class cmp = less<value> >
using ordered_set = tree<value, null_type, cmp, rb_tree_tag, tree_order_statistics_node_update>;
template<class value, class cmp = less_equal<value> >
using ordered_multiset = tree<value, null_type, cmp, rb_tree_tag, tree_order_statistics_node_update>;
template<class key, class value, class cmp = less<key> >
using ordered_map = tree<key, value, cmp, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
inline int randll(int l = INT_MIN, int r = INT_MAX) {
return uniform_int_distribution<int>(l, r)(rng);
}
const int INF = 1e9, MOD = 1e9 + 7;
const ll LINF = 1e18;
const int dx[] = {0, 0, 1, -1}, dy[] = {1, -1, 0, 0};
inline bool inside (int x, int y, int n, int m) {
return 0 <= x && 0 <= y && x < n && y < m;
}
template<class T> bool umin (T &a, T b) {return a > b ? (a = b, true) : false; }
template<class T> bool umax (T &a, T b) {return a < b ? (a = b, true) : false; }
main()
{
ios::sync_with_stdio(0);
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string s, t;
cin >> t >> s;
cout << s << t << '\n';
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define _GLIBCXX_DEBUG
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define rep(i,n) FOR(i,0,n)
const ll INF = 9223372036854775807;
int main() {
string x,y;cin >> x >> y;
cout << y << x << endl;
} | 1 | 92,188,550 |
#include <bits/stdc++.h>
using namespace std;
#define vt vector
#define sz(x) int((x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define fi first
#define se second
using ll = long long;
using pii = pair<int, int>;
int n;
int findP(vt<int>& a) {
vt<int> t(sz(a));
iota(all(t), 1);
int cnt = 0;
for (; t != a; cnt++, next_permutation(all(t)));
return cnt;
}
void solve() {
int n;
cin >> n;
vt<int> a(n), b(n);
for (int &i : a) cin >> i;
for (int &i : b) cin >> i;
cout << abs(findP(a) - findP(b));
}
int main() {
ios::sync_with_stdio(0), cin.tie(0);
int tcs = 1;
for (int tc = 1; tc <= tcs; tc++) {
solve();
}
} | #include<bits/stdc++.h>
using namespace std;
int f(int curr,string&a){
if(curr>=a.length()-2) return 0;
if(a[curr]!='A') return f(curr+1,a);
if(a[curr+1]=='B' && a[curr+2]=='C') return 1+f(curr+3,a);
return f(curr+1,a);
}
int main(){
int n;
cin>>n;
vector<int>origin(n);
vector<int>permu_a(n);
vector<int>permu_b(n);
for(int i=0; i<n; i++) origin[i] = i+1;
for(int i=0; i<n; i++) cin>>permu_a[i];
for(int i=0; i<n; i++) cin>>permu_b[i];
int curr = 1;
int lexi_a=0;
int lexi_b=0;
do{
bool match = true;
for(int i=0; i<n; i++){
if(permu_a[i]!=origin[i]) match = false;
}
if(match) lexi_a = curr;
match = true;
for(int i=0; i<n; i++){
if(permu_b[i]!=origin[i]) match = false;
}
if(match) lexi_b = curr;
curr++;
if(lexi_a && lexi_b) break;
}while(next_permutation(origin.begin(),origin.end()));
cout<<abs(lexi_a-lexi_b);
} | 1 | 90,517,538 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <cstring>
#include <cctype>
#include <cmath>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <list>
#include <stdio.h>
#include <string.h>
#include <cstdlib>
#include <math.h>
#define INF 2000000000
using namespace std;
int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
#define ll long long
#define PL pair<long long, long long>
#define P pair<int,int>
#define mk make_pair
#define en endl;
#define WHITE 0
#define BLACK 2
#define GRAY 1
#define RE return 0;
int main(){
while(1){
ll a,b,n;
cin>>b>>a;
if(a==0&&b==0) break;
bool con[20][20];
cin>>n;
for(int i=0; i<=20; i++){
for(int j=0; j<=20; j++){
con[i][j]=false;
}
}
for(int i=0; i<n; i++){
int c,d;
cin>>c>>d;
con[c][d]=true;
}
ll ans=0;
queue<P> michi;
michi.push(mk(1,1));
while(!michi.empty()){
P p=michi.front(); michi.pop();
for(int i=0; i<2; i++){
int x=p.first+dx[i],y=p.second+dy[i];
if(x==b&&y==a) ans++;
if(!con[x][y]&&x<=b&&y<=a){
michi.push(mk(x,y));
}
}
}
cout<<ans<<en
}
RE
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int a, b;
while (cin >> a >> b, a){
int n;
cin >> n;
int d[32][32] = {0};
for (int i = 0; i < n; i++){
int x, y;
cin >> x >> y;
d[x][y] = -1;
}
d[1][1] = 1;
for (int i = 1; i < a + 1; i++){
for (int j = 1; j < b + 1; j++){
d[i][j] = (d[i][j] == -1 ? 0 : d[i][j] + d[i - 1][j] + d[i][j - 1]);
}
}
cout << d[a][b] << endl;
}
} | 1 | 40,959,431 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair<int, int>;
#define debug(var) cerr << "[" << #var << "] " << var << endl
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
const ll mod = 1000000007;
const int dx[] = {-1,0,1,0};
const int dy[] = {0,-1,0,1};
int main(){
int n;
string s;
cin >> n >> s;
string ans = "";
vector<int> v(n);
int z = 0;
rep(i, n) {
if (i==0) {
if (s[i]=='(') v[i] = 1;
else v[i] = -1;
}
else {
if (s[i]=='(') v[i] = v[i-1] + 1;
else v[i] = v[i-1] - 1;
}
chmin(z, v[i]);
}
rep(i, abs(z)) cout << '(';
cout << s;
rep(i, v[n-1]+abs(z)) cout << ')';
cout << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const int inf = 1e9;
const ll INF = 1e18;
const double pi = 3.14159265358979323846;
#define rep(i,n) for(ll i=0;i<n;i++)
int main(){
int n;cin>>n;
string s;cin>>s;
int l[n+1]={},r[n+1]={};
rep(i,n){
if(s[i]=='(') l[i+1]=l[i]+1;
else l[i+1]=max(0,l[i]-1);
}
for(int i=n-1;i>=0;i--){
if(s[i]==')') r[i]=r[i+1]+1;
else r[i]=max(r[i+1]-1,0);
}
while(r[0]){
cout<<'(';
r[0]--;
}
cout<<s;
while(l[n]){
cout<<')';
l[n]--;
}
cout<<"\n";
} | 1 | 90,504,649 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define rep11(i, n) for (int i = 1; i < (int)(n); ++i)
#define repo(i, o, n) for (int i = o; i < (int)(n); ++i)
#define repm(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define pb(n) push_back(n)
#define mp make_pair
#define MOD 1002000007
#define INF LONG_LONG_MAX
typedef pair<int, int> P;
int main(){
string d;
cin>>d;
if(d=="25"){
cout<<"Christmas"<<endl;
}
else if(d=="24"){
cout<<"Christmas Eve"<<endl;
}
else if(d=="23"){
cout<<"Christmas Eve Eve"<<endl;
}
else if(d=="22"){
cout<<"Christmas Eve Eve Eve"<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main(void)
{
int d;
cin >> d;
string ans = "Christmas";
if(d < 25)
ans += " Eve";
if (d < 24)
ans += " Eve";
if (d < 23)
ans += " Eve";
cout << ans << endl;
} | 1 | 11,533,536 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPS(I, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
using ll = long long;
int main() {
int a,b,c,d,e,f,g = 0;
int aa,bb,cc,dd,ee;
int ans = 0;
cin >> a >> b >> c >> d >> e;
aa = a % 10;
if(aa == 0){
ans += a;
a = 0;
}
bb = b % 10;
if(bb == 0){
ans += b;
b = 0;
}
cc = c % 10;
if(cc == 0){
ans += c;
c = 0;
}
dd = d % 10;
if(dd == 0){
ans += d;
d = 0;
}
ee = e % 10;
if(ee == 0){
ans += e;
e = 0;
}
f = min({(aa+9)%10,(bb+9)%10,(cc+9)%10,(dd+9)%10,(ee+9)%10});
f++;
if(aa == f){
ans += (a+b+c+d+e);
ans += ((10-bb)%10+(10-cc)%10+(10-dd)%10+(10-ee)%10);
}
else if(bb == f){
ans += (a+b+c+d+e);
ans += ((10-aa)%10+(10-cc)%10+(10-dd)%10+(10-ee)%10);
}
else if(cc == f){
ans += (a+b+c+d+e);
ans += ((10-aa)%10+(10-bb)%10+(10-dd)%10+(10-ee)%10);
}
else if(dd == f){
ans += (a+b+c+d+e);
ans += ((10-aa)%10+(10-bb)%10+(10-cc)%10+(10-ee)%10);
}
else if(ee == f){
ans += (a+b+c+d+e);
ans += ((10-aa)%10+(10-bb)%10+(10-cc)%10+(10-dd)%10);
}
cout << ans << endl;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
vector<int> times(5);
vector<int> dist(5);
int t = 0;
int tmp = 0;
int i = 0;
while(cin >> tmp) {
times[i] = tmp;
int count = 0;
while(!(tmp % 10 == 0)) {
tmp ++;
count ++;
}
dist[i] = count;
i ++;
if(i >= 5) {
break;
}
}
int loop = 0;
while(1) {
loop ++;
int min = dist[0];
int id = 0;
for(int i = 1; i < 5; i++) {
if(min > dist[i]) {
min = dist[i];
id = i;
}
}
t += times[id];
if(loop == 5) {
break;
}
t += dist[id];
dist[id] = 10;
}
cout << t << endl;
} | 1 | 13,785,305 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <queue>
#include <vector>
#include <algorithm>
#include <math.h>
#include <map>
#include <list>
#include <iomanip>
#include <queue>
#include <cmath>
#include <numeric>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
const long long mod = 1e9 + 7;
int main() {
ll N, M, K;
cin >> N >> M >> K;
ll tmp = 0;
bool ans = false;
rep(i, N + 1) {
rep(j, M + 1) {
ll z = 0;
tmp = i * (M - j) + j * (N - i);
if (tmp == K) {
ans = true;
break;
}
}
}
if (ans) {
cout << "Yes";
}
else {
cout << "No";
}
return 0;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define FAST std::ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define DECIMAL(n) std::cout << std::fixed;std::cout << std::setprecision(n);
#define hell 1000000007
#define narak 998244353
#define PI 3.14159265358979323844
#define mp make_pair
#define eb emplace_back
#define pb push_back
#define fi first
#define se second
#define all(v) v.begin(), v.end()
#define endl "\n"
#define sqr(a) (a)*(a)
#define __lcm(m,n) m*(n/__gcd(m,n))
#define inputarr(a,n) for(int xxx=0;xxx<n;++xxx) cin>>(a)[xxx]
#define sz(a) (int)a.size()
#define sl(a) (int)a.length()
#define display(x) for(auto &a:x) cout<<a<<" ";cout<<endl
#define debug cerr<<"bhau"<<endl
#define between(n,a,b) (a<=n&&n<=b)
#define elasped_time 1.0 * clock() / CLOCKS_PER_SEC
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
std::cerr << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
const char* comma = strchr(names + 1, ',');std::cerr.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
}
template<typename T, typename U> static inline void amin(T &x, U y) {
if (y < x)
x = y;
}
template<typename T, typename U> static inline void amax(T &x, U y) {
if (x < y)
x = y;
}
template<typename T,typename U> std::ostream& operator<<(std::ostream& out, std::pair<T,U> a) {
out<<a.fi<<" "<<a.se;
return out;
}
template<typename T,typename U> std::istream& operator>>(std::istream& in, std::pair<T,U> &a) {
in>>a.fi>>a.se;
return in;
}
inline long long toint(const std::string &s) {std::stringstream ss; ss << s; long long x; ss >> x; return x;}
inline std::string tostring(long long number) {std::stringstream ss; ss << number; return ss.str();}
inline std::string tobin(long long x) {return std::bitset<63>(x).to_string();}
std::mt19937_64 rng(std::chrono::steady_clock::now().time_since_epoch().count());
#define ll long long
#define pii std::pair<int, int>
#define vi vector<int>
#define vvi vector<vi >
#define vii vector<pii >
#define point complex<ll>
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
using namespace std;
using namespace __gnu_pbds;
#define int long long
void meowmeow321()
{
int n,m,k;
cin>>n>>m>>k;
for (int i = 0; i <= n; ++i) {
for (int j = 0; j <= m; ++j) {
int cnt=i*m + j*n - 2*(i*j);
if(cnt==k){
cout<<"Yes\n";return;
}
}
}
cout<<"No\n";
}
signed main()
{
FAST;
int testcases=1;
for(int i=0;i<testcases;++i)
{
meowmeow321();
}
cerr<<endl<<"Time Elasped : "<<elasped_time<<endl;
return 0;
} | 1 | 53,567,570 |
#include <bits/stdc++.h>
#include <string>
#include <cstring>
#include <algorithm>
#include <math.h>
#include <map>
#include <bitset>
#include <cmath>
#include <set>
#include <utility>
#define INF 1000000000000
#define MOD 1000000007
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
int main(){
ll N,ans;
cin >> N;
ans = N * (N -1) / 2;
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ll n,p,m,i,j,sum=0;
cin>>n;
sum=(n*(n-1))/2;
cout<<sum<<endl;
} | 1 | 19,791,606 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int INF = 1000000009;
int main()
{
int x,y;
cin >> x >> y;
int ans = 0;
if( 0 <= x && 0 <= y){
if(x <= y){
ans += abs(y-x);
}else{
ans +=min(abs(-x-y)+1,abs(y-x)+2);
}
}else if (0 <= x && y < 0){
ans += abs(-x - y);
ans += 1;
}else if (x < 0 && 0 <= y){
ans += min(y-x,abs(-x - y)+1);
}else{
if(x <= y){
ans += abs(y - x);
}else{
ans += abs(y - x);
ans += 2;
}
}
cout << ans << endl;
} | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <queue>
#include <stack>
#include <cstdlib>
#include <map>
#include <iomanip>
#include <set>
#include <stdio.h>
#include <ctype.h>
#include <random>
#include <string.h>
#include <cmath>
#include <unordered_map>
#include <cstdio>
using namespace std;
#define pie 3.141592653589793238462643383279
#define mod 1000000007
#define int long long
#define P pair<int,int>
#define all(vec) vec.begin(),vec.end()
int gcd(int x, int y) {
if (y == 0)return x;
return gcd(y, x%y);
}
int lcm(int x, int y) {
return x / gcd(x, y)*y;
}
int kai(int x, int y) {
int res = 1;
for (int i = x - y + 1; i <= x; i++) {
res *= i; res %= mod;
}
return res;
}
int mod_pow(int x, int y, int m) {
int res = 1;
while (y > 0) {
if (y & 1) {
res = res * x % m;
}
x = x * x % m;
y >>= 1;
}
return res;
}
int comb(int x, int y) {
if (y > x)return 0;
return kai(x, y) * mod_pow(kai(y, y), mod - 2, mod) % mod;
}
int x, y;
signed main() {
cin >> x >> y;
if (x == 0) {
if (x < y)cout << y - x << endl;
else cout << x - y + 1 << endl;
}
else if (y == 0) {
if (x < y)cout << y - x << endl;
else cout << x - y + 1 << endl;
}
else if (x <= 0 && y <= 0) {
if (x < y)cout << y - x << endl;
else cout << x - y + 2 << endl;
}
else if (0 <= x && 0 <= y) {
if (x < y)cout << y - x << endl;
else cout << x - y + 2 << endl;
}
else cout << 1 + abs(abs(x) - abs(y)) << endl;
} | 1 | 73,278,415 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
char n='0';
int cnt=0,ans=0;
for(int i=0;i<s.size();i++){
if(cnt==0){
n=s.at(i);
cnt++;
}else{
if(n==s.at(i)){
cnt++;
}else{
cnt--;
ans+=2;
}
}
}
cout << ans << endl;
return 0;
} | #include <stdio.h>
#include <iostream>
#include <iomanip>
#include <vector>
#include <cstdlib>
#include <cmath>
#include <numeric>
#include <algorithm>
#include <sstream>
#include <string>
#include <map>
#include <set>
#include <stack>
using namespace std;
#define rep(i, n) for (int i=0; i<int(n); i++)
int main() {
string s;
cin >> s;
stack<char> st;
int res = 0;
for (int i=0; i<s.size(); i++) {
if (st.empty()) {
st.push(s[i]);
continue;
}
if (st.top()!=s[i]) {
st.pop();
res += 2;
}
else st.push(s[i]);
}
cout << res << endl;
} | 1 | 71,225,895 |
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using ll = long long;
using namespace std;
int main() {
int p, q, r;
cin >> p >> q >> r;
int ans = 1000;
ans = min(ans, p + q);
ans = min(ans, q + r);
ans = min(ans, r + p);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
int main(){
int A, B, C;
cin >> A >> B >> C;
vector<int> vec;
vec.push_back(A);
vec.push_back(B);
vec.push_back(C);
int min = 100000;
for (int i = 0; i < vec.size(); i++){
for (int j = i + 1; j < vec.size(); j++){
if (min > vec.at(i) + vec.at(j)){
min = vec.at(i) + vec.at(j);
}
}
}
cout << min << endl;
} | 1 | 1,356,110 |
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <utility>
#include <string>
using namespace std;
const int inf = 1e9;
vector<vector<int>> warshall_floyd(vector<vector<int>> dist) {
int n = dist.size();
for (int k = 0; k < n; k++) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
}
}
}
return dist;
}
int main() {
int n, m, a, b, c;
cin >> n >> m;
vector<vector<int>> dist(n, vector<int>(n, inf));
for (int i = 0; i < m; i++) {
cin >> a >> b >> c;
a--;
b--;
dist[a][b] = c;
dist[b][a] = c;
}
for (int i = 0; i < n; i++) {
dist[i][i] = 0;
}
int ans = 0;
auto dist2 = warshall_floyd(dist);
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (dist[i][j] != inf && dist[i][j] != dist2[i][j]) {
ans++;
}
}
}
ans /= 2;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
struct dat {
int a,b,c;
};
int G[100][100];
int main() {
int n,m; cin >> n >> m;
for(int i=0;i<n;++i)
for(int j=0;j<n;++j)
G[i][j]=1e9;
for(int i=0;i<n;++i) G[i][i]=0;
vector<dat> abc(m);
for(auto &e:abc) {
cin >> e.a >> e.b >> e.c;
--e.a; --e.b;
G[e.a][e.b]=G[e.b][e.a]=e.c;
}
for(int k=0;k<n;++k)
for(int i=0;i<n;++i)
for(int j=0;j<n;++j)
G[i][j]=min(G[i][j],G[i][k]+G[k][j]);
int ans=0;
for(auto e:abc)
if(G[e.a][e.b]<e.c) ++ans;
cout << ans << endl;
return 0;
} | 1 | 13,197,634 |
#include<bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int a,b,c;
cin>>a>>b>>c;
if(c>a && c<b)
cout<<"Yes";
else if(c==a && c==b && a==b)
cout<<"Yes";
else
cout<<"No";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios_base::sync_with_stdio(0);cin.tie(0);
int a,b,c;
cin>>a>>b>>c;
cout<<(a<=c&&c<=b?"Yes\n":"No\n");
} | 1 | 34,308,880 |
#include <iostream>
#include <cstdio>
using namespace std;
int n, m, s;
int main()
{
int i;
cin >> n >> m;
for (s = 1, i = 0; i < n; s *= 2, i++);
s--;
if (s < m || n == 1 && m == 1) {
cout << -1;
return 0;
}
if (n == 1 && m == 0) {
cout << "0 1 1 0";
return 0;
}
cout << m << " ";
for (i = 0; i <= s; i++) {
if (i == m) continue;
printf("%d ", i);
}
cout << m << " ";
for (i = s; i >= 0; i--) {
if (i != m) printf("%d ", i);
}
return 0;
} | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unordered_set>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef vector<pair<int,int> > vpii;
typedef vector<vector<int> > vvi;
typedef vector<vector<char> > vvc;
typedef vector<vector<string> > vvs;
typedef vector<vector<ll> > vvll;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define irep(it, stl) for(auto it = stl.begin(); it != stl.end(); it++)
#define drep(i,n) for(int i = (n) - 1; i >= 0; --i)
#define fin(ans) cout << (ans) << '\n'
#define STI(s) atoi(s.c_str())
#define mp(p,q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define Rort(a) sort(a.rbegin(), a.rend())
#define MATHPI acos(-1)
#define itn int;
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
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;}
struct io{io(){ios::sync_with_stdio(false);cin.tie(0);}};
const int INF = INT_MAX;
const ll LLINF = 1LL<<60;
const ll MOD = 1000000007;
const double EPS = 1e-9;
int main(void) {
int n,k;
cin>>n>>k;
int Xor=0;
rep(i,pow(2,n)-1)Xor^=i;
if(n==0){
if(k==0)cout<<0<<" "<<0<<endl;
else fin(-1);
}
else if(n==1){
if(k==0)cout<<"0 0 1 1"<<endl;
else fin(-1);
}
else if(n>=2 && k<=pow(2,n)-1) {
rep(i,pow(2,n)){
if(i==k)continue;
cout<<i<<" ";
}
cout<<k<<" ";
drep(i,pow(2,n)){
if(i==k)continue;
cout<<i<<" ";
}
cout<<k<<endl;
}
else {
fin(-1);
}
} | 1 | 37,906,571 |
#include <bits/stdc++.h>
using namespace std;
int N,Q;
int main()
{
cin >> N >> Q;
vector<vector<long>> data(N);
for(int i=0;i<N;i++)
{
int a;
long b;
cin >> a;
cin >> b;
data[a-1].push_back(b);
}
for(int i=0;i<N;i++)
{
if(data[i].size() == 0)
{
data[i].push_back(INT_MIN);
}
else
{
sort(data[i].begin(),data[i].end(),std::greater<long>());
}
}
sort(data.begin(),data.end(),std::greater<vector<long>>());
vector<pair<long,int>> check;
int p = N;
for(int i=0;i<N;i++)
{
if(data[i][0] <0)
{
p = i;
break;
}
else
{
for(int j = 0;j<data[i].size();j++)
{
check.push_back(make_pair(data[i][j],i));
}
}
}
sort(check.begin(),check.end());
reverse(check.begin(),check.end());
vector<long> ans(Q,0);
vector<int> used(p,0);
long tt=0;
for(int i = 0;i<Q;i++)
{
tt += check[i].first;
used[check[i].second]++;
}
int kx = 0;
for(int i = 0;i<p;i++)
{
if(used[i] > 0)
{
kx++;
}
}
ans[kx-1] = tt + (long)kx*(long)kx;
vector<bool> nonu(Q,true);
for(int i = kx;i<p;i++)
{
long temp = 0;
for(int j = 0;j<Q;j++)
{
if(used[check[Q-j-1].second] > 1 && nonu[Q-j-1])
{
used[check[Q-j-1].second]--;
temp =check[Q-j-1].first;
nonu[Q-j-1] = false;
break;
}
}
if(temp == 0)
{
break;
}
long temp2 = 0;
for(int j = Q;j<N;j++)
{
if(used[check[j].second] == 0)
{
used[check[j].second]++;
temp2 = check[j].first;
break;
}
}
ans[i] = ans[i-1] - temp + temp2 + 2*i + 1;
}
sort(ans.begin(),ans.end(),std::greater<long>());
cout << ans[0] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(ll i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using vc = vector<char>;
using vb = vector<bool>;
using vd = vector<double>;
vi dir = {-1, 0, 1, 0, -1, -1, 1, 1, -1};
int main() {
ll n, k;
cin >> n >> k;
vector<P> p(n);
rep(i, n) cin >> p[i].second >> p[i].first;
sort(all(p), greater<P>());
set<ll> type;
priority_queue<ll, vl, greater<ll>> q;
ll base = 0;
rep(i, k) {
if(type.count(p[i].second))
q.push(p[i].first);
else
type.insert(p[i].second);
base += p[i].first;
}
ll ans = base + type.size() * type.size();
rep2(i, k, n) {
if(q.empty()) break;
if(type.count(p[i].second)) continue;
type.insert(p[i].second);
base += p[i].first;
ll mn = q.top();
q.pop();
base -= mn;
ans = max(ans, base + ll(type.size() * type.size()));
}
cout << ans << endl;
} | 1 | 3,163,833 |
#include<cstdio>
int main(){
int h,w;
scanf("%d %d", &h, &w);
while(h && h){
for(int i = 0; i < h ; i++){
for(int j = 0; j < w; j++){
if(i * j && ((i - h + 1) * (j - w + 1)))
{
printf(".");
}else{
printf("#");
}
}
printf("\n");
}
printf("\n");
scanf("%d %d", &h, &w);
}
} | #include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int main(){
int h, w;
while (cin >> h >> w) {
if (h == 0 && w == 0) {
break;
}
string top_bottom;
top_bottom.resize(w, '#');
string left_right;
left_right.resize(w);
left_right[0] = '#';
*(left_right.end() - 1) = '#';
fill(left_right.begin() + 1, left_right.end() - 1, '.');
cout << top_bottom << endl;
for (int i = 1; i < h - 1; ++i) {
cout << left_right << endl;
}
cout << top_bottom << endl << endl;
}
return 0;
} | 1 | 38,924,869 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MOD 1000000007
int main()
{
string L; cin >> L;
int len = L.size();
vector<int> x3(len);
x3[0] = 1;
for (int i = 1; i < x3.size(); i++) {
x3[i] = (ll)x3[i-1] * 3 % MOD;
}
ll ans_eq = 1, ans_lt = 0;
for (int i = 0; i < len; i++) {
if (L[i] == '1') {
ans_lt = (ans_lt + (ans_eq * x3[len - i - 1] % MOD)) % MOD;
ans_eq = (ans_eq * 2) % MOD;
}
}
ll ans = (ans_eq + ans_lt) % MOD;
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1000000007;
int main()
{
string a;
cin >> a;
for(auto &i : a)i -= '0';
int n = a.size();
vector<vector<ll>> dp(n + 1, vector<ll>(2));
dp[0][0] = 1;
for(int i = 0; i < n; i++){
for(int j = 0; j <= 1; j++){
for(int k = 0; k <= (j ? 1 : a[i]); k++){
if(k){
dp[i + 1][j || (k < a[i])] += dp[i][j] * 2;
}else{
dp[i + 1][j || k < (a[i])] += dp[i][j];
}
dp[i + 1][j || (k < a[i])] %= mod;
}
}
}
cout << (dp[n][0] + dp[n][1]) % mod << endl;
} | 1 | 74,308,497 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, k, r, s, p; string t;
cin >> n >> k >> r >> s >> p >> t;
vector<int> f(t.size(), 0);
for(int i=0; i+k<t.size(); ++i){
if(t[i]==t[i+k]){t[i+k] = 1-t[i];}
}
int res = 0;
for(int i=0; i<t.size(); ++i){
if(t[i]=='r'){
if(f[i]==1){continue;}
else{res += p;}
}
else if(t[i]=='s'){
if(f[i]==1){continue;}
else{res += r;}
}
else if(t[i]=='p'){
if(f[i]==1){continue;}
else{res += s;}
}
}
cout << res << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define loop(i, a, n) for(int i = (a); i < (n); i++)
#ifdef _DEBUG
#define dd(x) cout << #x << " : " << x << endl
#else
#define dd(x)
#endif
using namespace std;
using ll = int64_t;
char get_best_action(char tc) {
if(tc == 'r') {
return 'p';
} else if(tc == 's') {
return 'r';
} else {
return 's';
}
}
int main(){
int n, k; cin >> n >> k;
int r, s, p; cin >> r >> s >> p;
string t; cin >> t;
string h = "";
int ans = 0;
int tsize = t.size();
rep(i, tsize) {
char tc = get_best_action(t[i]);
if(i < k) {
h += tc;
if(tc == 'p') ans += p;
else if(tc == 's') ans += s;
else ans += r;
} else {
if(h[i-k] == tc) {
if(i+k < tsize) {
char tc2 = get_best_action(t[i+k]);
if(tc == 'p' && tc2 == 'p') h += 's';
else if(tc == 'p' && tc2 == 'r') h += 's';
else if(tc == 'p' && tc2 == 's') h += 'r';
else if(tc == 's' && tc2 == 's') h += 'r';
else if(tc == 's' && tc2 == 'r') h += 'p';
else if(tc == 's' && tc2 == 'p') h += 'r';
else if(tc == 'r' && tc2 == 'r') h += 'p';
else if(tc == 'r' && tc2 == 'p') h += 's';
else if(tc == 'r' && tc2 == 's') h += 'p';
} else {
if(tc == 'p') h += 's';
else if(tc == 's') h += 'r';
else h += 'p';
}
} else {
h += tc;
if(tc == 'p') ans += p;
else if(tc == 's') ans += s;
else ans += r;
}
}
}
cout << ans << endl;
return 0;
} | 1 | 96,905,410 |
#include<iostream>
using namespace std;
int main(void)
{
int n,m;
m=100000;
cin>>n;
for(int i=0;i<n;i++)
{
m=m*21;
if(m%20000==0)m=m/20;
else
{
m=m/20000;
m=m*1000+1000;
}
}
cout<<m<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
double n,i,tmp;
double ans=100000;
cin>>n;
while(n--){
ans *= 1.05;
ans = ceil(ans/1000.0)*1000.0;
}
printf("%.f\n", ans);
return 0;
} | 1 | 11,376,314 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int R,G = 48;
cin >> R;
cin >> G;
G = (G - R) + G;
cout << G << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
double a,b;
cin >> a >> b;
cout << b-a+b << endl;
} | 1 | 61,769,903 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)n; i++)
using namespace std;
int main() {
int n, m, X, Y;
cin >> n >> m >> X >> Y;
vector<int> x(n);
vector<int> y(m);
rep(i,n) cin >> x[i];
rep(i,m) cin >> y[i];
for (int z = (X+1); z <= Y; z++) {
bool ok = true;
rep(i,n) if (x[i] >= z) ok = false;
if (ok) {
rep(i,m) if (y[i] < z) ok = false;
}
if (ok) {cout << "No War" << endl; return 0;}
}
cout << "War" << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, m, X, Y;
cin >> n >> m >> X >> Y;
int mxx = X, mny = Y;
for (int i = 0; i < n; ++i) {
int x;
cin >> x;
mxx = max(mxx, x);
}
for (int j = 0; j < m; ++j) {
int y;
cin >> y;
mny = min(mny, y);
}
puts(mxx<mny?"No War":"War");
} | 1 | 5,229,353 |
#include <iostream>
#include <string>
using namespace std;
int main()
{
int X;
cin >> X;
int result = 0;
if (400 <= X && X <= 599) {
result = 8;
}
else if (600 <= X && X <= 799) {
result = 7;
}
else if (800 <= X && X <= 999) {
result = 6;
}
else if (1000 <= X && X <= 1199) {
result = 5;
}
else if (1200 <= X && X <= 1399) {
result = 4;
}
else if (1400 <= X && X <= 1599) {
result = 3;
}
else if (1600 <= X && X <= 1799) {
result = 2;
}
else if (1800 <= X && X <= 1999) {
result = 1;
}
cout << result;
return 0;
} | #include <algorithm>
#include <bitset>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#include <cctype>
#include <cmath>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define blank(ans) cout << (ans) << " ";
#define mp(p, q) make_pair(p, q)
#define mt(p, q, r) make_tuple(p, q, r)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef string str;
typedef vector<ll> vll;
typedef vector<ld> vd;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<str> vs;
typedef vector<vector<ll>> vvll;
typedef vector<vector<ld>> vvd;
typedef vector<vector<bool>> vvb;
typedef vector<vector<char>> vvc;
typedef vector<vector<str>> vvs;
typedef vector<pair<ll, ll>> vpll;
typedef vector<tuple<ll, ll, ll>> vtlll;
const ld PI = acos(-1.0);
const ll MAX = 9000000000000000000;
const ll MIN = -9000000000000000000;
const ld DMAX = 4500;
const ld DMIN = -4500;
const ll MOD = 1000000007;
template <typename T>
void fin(T a)
{
cout << a << endl;
exit(0);
}
void Main()
{
ll x; cin >> x;
ll ans = 8, Max = 600;
while(1)
{
if(x < Max) fin(ans); Max += 200; ans--;
}
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(4);
Main();
return 0;
} | 1 | 37,015,970 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n;
cin >> n;
vector<double> v(n);
rep(i, n) cin >> v[i];
sort(v.begin(), v.end());
double now = v[0];
for (int i = 1; i < n; ++i) now = (now + v[i]) / 2;
printf("%.6f\n", now);
return 0;
} | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define con_input(v) for(auto it=v.begin();it!=v.end();it++){cin>>*it;}
#define con_debug(v) for(auto it=v.begin();it!=v.end();it++){cerr<<*it<<" ";}cerr<<endl;
using namespace std;
struct point{int x;int y;};
int i,j,k,count1=0,count2=0;
int main(){
int n;
cin>>n;
vector<double> vec(n);
con_input(vec);
sort(all(vec));
double ans=0;
for(i=0;i<n;i++){
if(i==0)ans=vec[i];
else {
ans=(ans+vec[i])/2;
}
}
printf("%.8lf\n",ans);
} | 1 | 90,645,977 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1LL << 60;
ll X, Y, Z, K;
vector<ll> A, B, C;
int main() {
cin >> X >> Y >> Z >> K;
A.resize(X);
B.resize(Y);
C.resize(Z);
rep(i, X) cin >> A[i];
rep(i, Y) cin >> B[i];
rep(i, Z) cin >> C[i];
sort(A.rbegin(), A.rend());
sort(B.rbegin(), B.rend());
sort(C.rbegin(), C.rend());
vector<ll> v;
rep(i, A.size()) {
rep(j, B.size()) {
v.push_back(A[i] + B[j]);
}
}
sort(v.rbegin(), v.rend());
vector<ll> v2;
ll target = min((ll)3000, (ll)v.size());
rep(i, target) {
rep(j, C.size()) {
v2.push_back(v[i] + C[j]);
}
}
sort(v2.rbegin(), v2.rend());
rep(i, K) {
cout << v2[i] << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0; i<(n); i++)
#define REP2(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
const long long INF = numeric_limits<long long>::max();
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 X, Y, Z, K;
cin >> X >> Y >> Z >> K;
long long A[X], B[Y], C[Z];
REP(i, X) cin >> A[i];
REP(i, Y) cin >> B[i];
REP(i, Z) cin >> C[i];
sort(A, A+X);
sort(B, B+Y);
sort(C, C+Z);
priority_queue<pair<long long, tuple<int, int, int>>> q;
q.push(make_pair(A[X-1]+B[Y-1]+C[Z-1], make_tuple(X-1, Y-1, Z-1)));
pair<long long, tuple<int, int, int>> pr;
int cursol_A;
int cursol_B;
int cursol_C;
set<tuple<int, int, int>> seen;
REP(i, K) {
while (true) {
pair<long long, tuple<int, int, int>> pr = q.top(); q.pop();
int& cursol_A = get<0>(pr.second);
int& cursol_B = get<1>(pr.second);
int& cursol_C = get<2>(pr.second);
if (seen.count(make_tuple(cursol_A, cursol_B, cursol_C)) == 0) {
cout << pr.first << endl;
seen.insert(make_tuple(cursol_A, cursol_B, cursol_C));
if(cursol_A >= 1) q.push(make_pair((A[cursol_A-1] + B[cursol_B] + C[cursol_C]), make_tuple(cursol_A-1, cursol_B, cursol_C)));
if(cursol_B >= 1) q.push(make_pair((A[cursol_A] + B[cursol_B-1] + C[cursol_C]), make_tuple(cursol_A, cursol_B-1, cursol_C)));
if(cursol_C >= 1) q.push(make_pair((A[cursol_A] + B[cursol_B] + C[cursol_C-1]), make_tuple(cursol_A, cursol_B, cursol_C-1)));
break;
}
}
}
return 0;
} | 1 | 16,519,090 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long N, A, B, X=0;
cin >> N >> A >> B;
X = N/(A+B) * A;
if (N%(A+B) >= A) {
X += A;
}
else {
X += N%(A+B);
}
cout << X << endl;
} | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main()
{
ll a,b,c;
cin>>a>>b>>c;
ll ans=b*((a)/(b+c)),d;
d=(a%(c+b));
if(d<=b)ans+=d;
else ans+=b;
cout<<ans;
} | 1 | 45,673,342 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MM = 1000000000;
const int MOD = MM + 7;
const int MAX = 510000;
#define rep(i, n) for(ll i=0; i<n; i++)
#define Rep(i, j, n) for(ll i=j; i<n; i++)
#define all(vec) vec.begin(), vec.end()
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 ll INF = 1LL << 60;
int main() {
int n, m, x; cin >> n >> m >> x;
ll ans = INF;
vector<int> c(n);
vector<vector<int>> a(n, vector<int>(m));
rep(i, n) {
cin >> c[i];
rep(j, m) cin >> a[i][j];
}
rep(i, (1<<n)) {
ll tmp = 0;
ll sum[m] = {0};
rep(j, n) {
if(i & (1<<j)) {
tmp += c[j];
rep(k, m) sum[k] += a[j][k];
}
}
bool fl = 0;
rep(j, m) if(sum[j] < x) fl = 1;
if(fl) continue;
chmin(ans, tmp);
}
cout << (ans == INF ? -1 : ans) << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const long long INF = 1LL<<60;
int main() {
int64_t N,M,X,ans=INF;
cin>>N>>M>>X;
vector<int64_t> C(N);
vector<vector<int64_t>> A(N,vector<int64_t>(M));
rep(i,N){
cin>>C.at(i);
rep(j,M){
cin>>A.at(i).at(j);
}
}
for(int i=0;i<(1<<12);i++){
bitset<12> s(i);
bool finish=true;
int64_t total=0;
vector<int64_t> score(M,0);
rep(j,N){
if(s.test(j)){
rep(k,M){
score.at(k)+=A.at(j).at(k);
}
total+=C.at(j);
}
}
rep(j,M){
if(score.at(j)<X) finish=false;
}
if(finish) ans=min(ans,total);
}
if(ans==INF) cout<<-1;
else cout<<ans;
} | 1 | 13,152,676 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const double EPS = 1e-10;
const int INF = 1e9;
const ll LINF = 1e15;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
vector<vector<int>> to;
vector<vector<ll>> cost;
int main() {
int n;
cin >> n;
to.resize(n);
cost.resize(n);
rep(i,n-1) {
int a, b, c;
cin >> a >> b >> c;
a--, b--;
to[a].push_back(b);
to[b].push_back(a);
cost[a].push_back(c);
cost[b].push_back(c);
}
int q, k;
cin >> q >> k;
k--;
vector<int> x(q), y(q);
rep(i,q) {
cin >> x[i] >> y[i];
x[i]--, y[i]--;
}
vector<ll> dist(n, LINF);
dist[k] = 0;
queue<int> que;
que.push(k);
while(!que.empty()) {
int x = que.front(); que.pop();
for (int j = 0; j < (int) to[x].size(); j++) {
int nx = to[x][j];
if (dist[nx] != LINF) continue;
dist[nx] = dist[x] + cost[x][j];
que.push(nx);
}
}
rep(i,q) {
cout << dist[x[i]] + dist[y[i]] << endl;
}
} | #include<bits/stdc++.h>
#define lli long long int
#define rep(i,n) for(lli i=0; i<n; i++)
#define loop(i, j, n) for(lli i=j; i<n; i++)
#define all(x) (x).begin(), (x).end()
#define Max(a, b) ((a) > (b) ? (a) : (b))
#define Min(a, b) ((a) < (b) ? (a) : (b))
constexpr int INF = 0x3f3f3f3f;
const long long mod=1e9+7;
const double PI = acos(-1);
using namespace std;
using Graph = vector<vector<lli>>;
using P = pair<int, int>;
typedef struct {
lli to;
lli cost;
}edge;
vector<vector<edge>> G(100010);
vector<lli> dist(100010, 0);
lli K;
int main(){
lli n, Q;
queue<lli> q;
cin >> n;
rep(i,n-1){
lli a, b, c;
cin >> a >> b >> c;
G[a].push_back({b, c});
G[b].push_back({a, c});
}
cin >> Q >> K;
q.push(K);
while(!q.empty()){
int v = q.front();
q.pop();
for(const auto& x : G[v]){
if(dist[x.to] > 0 || x.to == K) continue;
dist[x.to] = dist[v] + x.cost;
q.push(x.to);
}
}
rep(i,Q){
lli x, y;
cin >> x >> y;
cout << dist[x]+dist[y] << endl;
}
return 0;
} | 1 | 45,217,169 |
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <queue>
#include <numeric>
#include <string>
#include <string.h>
#include <map>
#include <set>
#include <functional>
#include <complex>
using namespace std;
const int INF = (1<<30) - 1;
map<char, int> table = {
{'m', 1000},
{'c', 100},
{'x', 10},
{'i', 1}
};
int to_int(string s){
int i = 0;
int sum = 0;
while(i<s.length()){
int d = 1;
if('0'<=s[i] && s[i]<='9'){
d = s[i]-'0';
i++;
}
sum += d*table[s[i++]];
}
return sum;
}
string to_mcxi(int a){
string s = "mcxi";
string res = "";
for(char c: s){
int d = a / table[c];
a -= d * table[c];
if(1<d)
res += d+'0';
if(0<d)
res += c;
}
return res;
}
int main(){
int T;
cin >> T;
while(T--){
string a, b;
cin >> a >> b;
cout << to_mcxi(to_int(a)+to_int(b)) << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int ans=0;
string s;
const double eps=1e-9;
typedef vector<int> vi;
typedef long long ll;
typedef pair<string,string> pss;
vector<pss> vpss;
int main(void)
{
int n;
cin >> n;
for(int i=0;i<n;i++)
{
string tmp1,tmp2;
cin >> tmp1 >> tmp2;
vpss.push_back(pss(tmp1,tmp2));
}
for(int i=0;i<n;i++)
{
int ans=0;
int num=1;
string num1=vpss[i].first;
string num2=vpss[i].second;
for(int j=0;j<num1.size();j++)
{
if(num1[j]=='m')
{
ans+=1000*num;
num=1;
}
else if(num1[j]=='c')
{
ans+=100*num;
num=1;
}
else if(num1[j]=='x')
{
ans+=10*num;
num=1;
}
else if(num1[j]=='i')
{
ans+=num;
num=1;
}
else
{
num=(int)(num1[j]-'0');
}
}
for(int j=0;j<num2.size();j++)
{
if(num2[j]=='m')
{
ans+=1000*num;
num=1;
}
else if(num2[j]=='c')
{
ans+=100*num;
num=1;
}
else if(num2[j]=='x')
{
ans+=10*num;
num=1;
}
else if(num2[j]=='i')
{
ans+=num;
num=1;
}
else
{
num=(int)(num2[j]-'0');
}
}
int tho=ans/1000;
ans%=1000;
int hun=ans/100;
ans%=100;
int ten=ans/10;
ans%=10;
int one=ans;
string mcxi="";
if(tho>0)
{
if(tho>1)
{
mcxi+=to_string(tho);
}
mcxi+='m';
}
if(hun>0)
{
if(hun>1)
{
mcxi+=to_string(hun);
}
mcxi+='c';
}
if(ten>0)
{
if(ten>1)
{
mcxi+=to_string(ten);
}
mcxi+='x';
}
if(one>0)
{
if(one>1)
{
mcxi+=to_string(one);
}
mcxi+='i';
}
cout << mcxi << endl;
}
return 0;
} | 1 | 3,751,808 |
#include<bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<n;i++)
int main(){
int n,ans=0;
cin>>n;
vector<int> h(n);
REP(i,n){cin>>h[i];}
int t=0;
REP(i,n-1){
if(h[i]>=h[i+1])t++;
else t=0;
ans=max(t,ans);
}
cout<<ans<<endl;
} | #include<bits/stdc++.h>
using namespace std;
int main() {
cout.tie(0)->sync_with_stdio(0);
int N; cin >> N;
vector<int> heights(N);
for (int i = 0; i < N; ++i) cin >> heights[i];
int res = 0;
for (int i = 0, j = 0; i < N; i = j) {
while(j < N && (i == j || heights[j] <= heights[j-1])) ++j;
res = max(res, j - i - 1);
}
cout << res << '\n';
} | 1 | 30,494,194 |
#include <iostream>
#include <vector>
using namespace std;
int main(void){
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) cin >> A[i];
long long money = 1000;
for (int i = 1; i < N; i++) {
if (A[i - 1] < A[i]) {
money = money / A[i - 1] * A[i] + money % A[i - 1];
}
}
cout << money << endl;
} | #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 reps(i,a,b) for(int i= a; i < b; 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.at(i);
ll m = 1000;
ll k = 0;
rep(i, n) {
if (i) {
if (vec.at(i-1) < vec.at(i)) {
m += k * vec.at(i);
k = 0;
}
}
if (i != n - 1) {
if (vec.at(i+1) > vec.at(i)) {
k += m / vec.at(i);
m %= vec.at(i);
}
}
}
cout << m << endl;
return 0;
} | 1 | 77,822,456 |
#include<bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define ll long long
#define rep(i,n) for(int i = 0; i < int(n); i++)
#define vi vector<int>
#define INF (1<<30)-1
using namespace std;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template<class T> inline bool chmax(T &a, const T &b){ if(a<b) { a=b; return 1; } return 0; }
template<class T> inline bool chmin(T &a, const T &b){ if(b<a) { a=b; return 1; } return 0; }
int main(){
cin.tie(0), ios::sync_with_stdio(false);
int n,m; cin >> n >> m;
vi p(m),y(m);
map<int,map<int,int>> mp;
rep(i,m){
cin >> p[i] >> y[i];
mp[p[i]][y[i]];
}
for(auto &x : mp){
int cnt = 1;
for(auto &y : x.second) y.second = cnt++;
}
rep(i,m){
cout << setw(6) << setfill('0') << p[i];
cout << setw(6) << setfill('0') << mp[p[i]][y[i]];
cout << endl;
}
cout << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int mod = 1e9+7;
string solve(int n){
string s;
s = "000000";
for(int i = 0; i < 6; i++){
s[5-i] = '0'+n%10;
n /= 10;
}
return s;
}
int main(){
int n,m;
cin >> n >> m;
vector<map<int,int>> mp(n+1);
for(int i = 0; i < m; i++){
int p,y;
cin >> p >> y;
mp[p][y] = i;
}
vector<string> ans(m);
for(int i = 1; i <= n; i++){
int j = 1;
for(auto r:mp[i]){
string ken = solve(i);
string num = solve(j);
ans[r.second] = ken+num;
j++;
}
}
for(int i = 0; i < m; i++){
cout << ans[i] << endl;
}
} | 1 | 18,898,746 |
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
int cost[12][12];
int n,a,b,c;
int s,min_cost;
int main(){
while(scanf("%d",&n),n!=0){
memset(cost,255,sizeof(cost));
for(int i=0;i<n;i++){
scanf("%d %d %d",&a,&b,&c);
cost[a][b]= (cost[a][b]==-1) ? c : min(cost[a][b],c);
cost[b][a]=cost[a][b];
}
for(int i=0;i<=10;i++)
cost[i][i]=0;
for(int k=0;k<=10;k++)
for(int i=0;i<=10;i++)
for(int j=0;j<=10;j++)
if(cost[i][k]!=-1&&cost[k][j]!=-1){
cost[i][j]= (cost[i][j]==-1) ? cost[i][k]+cost[k][j] : min(cost[i][j],cost[i][k]+cost[k][j]);
cost[j][i]=cost[i][j];
}
s=-1;min_cost=-1;
for(int i=0;i<=10;i++){
int temp=0;
for(int j=0;j<=10;j++)
temp= (cost[i][j]==-1) ? temp : temp+cost[i][j];
if(s==-1||temp<min_cost&&temp>0){
min_cost=temp;
s=i;
}
}
printf("%d %d\n",s,min_cost);
}
return 0;
} | #include <stdio.h>
#include <iostream>
#include <algorithm>
using namespace std;
const int INF=999999;
const int maxx=11;
int ma[maxx][maxx];
int n,m;
void init()
{
for(int i=0;i<maxx;i++)
for(int j=0;j<maxx;j++)
if(i!=j)
ma[i][j]=INF;
}
int main()
{
while(~scanf("%d",&n)&&n)
{
init();
m=0;
for(int i=0;i<n;i++)
{
int a,b,c;
scanf("%d %d %d",&a,&b,&c);
ma[a][b]=ma[b][a]=c;
m=max(m,max(a,b)+1);
}
for(int i=0;i<m;i++)
for(int j=0;j<m;j++)
for(int k=0;k<m;k++)
ma[j][k]=min(ma[j][k],ma[j][i]+ma[i][k]);
int ans=INF;int k;
for(int i=0;i<m;i++)
{
int sum=0;
for(int j=0;j<m;j++)
if(ma[i][j]!=INF)
sum+=ma[i][j];
if(sum<ans)
{
k=i;
ans=sum;
}
}
printf("%d %d\n",k,ans);
}
} | 1 | 28,921,705 |
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
#include<cmath>
#include<map>
using namespace std;
typedef long long LL;
const int N = 1e5+10;
inline LL read()
{
register LL x = 0 , f = 0; register char c = getchar();
while(c < '0' || c > '9') f |= c == '-' , c = getchar();
while(c >= '0' && c <= '9') x = (x << 3) + (x << 1) + c - '0' , c = getchar();
return f ? -x : x;
}
int n;
LL d[N];
int eu[N] , ev[N] , siz[N];
vector<int> G[N];
map<LL , int> mp;
struct node
{
LL d;
int id;
}p[N];
inline bool cmp(const node &A , const node &B) { return A.d > B.d; }
void dfs1(int x , int dep , int rot)
{
siz[x] = 1; d[rot] += dep;
for(int i = 0 ; i < G[x].size() ; ++i) dfs1(G[x][i] , dep + 1 , rot) , siz[x] += siz[G[x][i]];
return ;
}
void dfs2(int x)
{
for(int i = 0 ; i < G[x].size() ; ++i)
{
d[G[x][i]] = d[x] + n - 2 * siz[G[x][i]];
dfs2(G[x][i]);
}
return ;
}
int main()
{
n = read();
for(int i = 1 ; i <= n ; ++i) p[i].d = read() , p[i].id = i , mp[p[i].d] = i;
LL sum = 0;
for(int i = 1 ; i <= n ; ++i) sum += p[i].d;
if(sum & 1) { puts("-1"); return 0; }
sort(p + 1 , p + 1 + n , cmp);
for(int i = 1 ; i <= n ; ++i) siz[i] = 1;
for(int i = 1 ; i < n ; ++i)
{
LL fa_d = p[i].d - n + 2 * siz[p[i].id];
if(!mp.count(fa_d)) { puts("-1"); return 0; }
ev[i] = p[i].id; eu[i] = mp[fa_d]; siz[eu[i]] += siz[ev[i]];
}
for(int i = 1 ; i < n ; ++i) G[eu[i]].push_back(ev[i]);
dfs1(p[n].id , 0 , p[n].id); dfs2(p[n].id);
for(int i = 1 ; i <= n ; ++i) if(d[p[i].id] != p[i].d) { puts("-1"); return 0; }
for(int i = 1 ; i < n ; ++i) cout << eu[i] << ' ' << ev[i] << '\n';
return 0;
} | #include <algorithm>
#include <cstdio>
#include <cstring>
#define int long long
#define Accepted 0;
const int Maxv = 100010;
int d[Maxv], d1[Maxv], u[Maxv], ghostfly233[Maxv], siz[Maxv], cnt, n;
inline int GldHkkowoSearch(int x) {
int tmp = std::lower_bound(d + 1, d + n + 1, x) - d;
if (d[tmp] != x) {
puts("-1");
exit(0);
}
return tmp;
}
signed main() {
scanf("%lld", &n);
for (int i = 1; i <= n; i++) {
scanf("%lld", &d[i]);
d1[i] = d[i];
}
std::sort(d + 1, d + n + 1);
for (int i = 1; i <= n; i++)
ghostfly233[GldHkkowoSearch(d1[i])] = i;
for (int i = 1; i <= n; i++)
siz[i] = 1;
for (int i = n; i > 1; i--) {
u[i] = GldHkkowoSearch(d[i] - n + (siz[i] << 1));
siz[ u[i] ] += siz[i];
cnt += siz[i];
}
if (cnt != d[1]) {
puts("-1");
return 0;
}
for (int i = 2; i <= n; i++)
printf("%lld %lld\n", ghostfly233[i], ghostfly233[ u[i] ]);
return Accepted;
} | 1 | 79,403,624 |
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <string>
#include <vector>
#include <math.h>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#define PI 3.14159265359
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pai;
typedef pair<ll, ll> pal;
const int MOD = 1e9+7;
const ll LLINF = 1e18;
int main(){
int a, b;
cin >> a >> b;
string s;
cin >> s;
for (int i = 0; i < a; i++){
if (s[i] == '-'){
cout << "No" << endl;
return 0;
}
}
if (s[a] != '-'){
cout << "No" << endl;
return 0;
}
for (int i = a+1; i <= a+b+1; i++){
if (s[i] == '-'){
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define fast std::ios::sync_with_stdio(false);cin.tie(0); cout.tie(0);
int main()
{
fast;
ll t=1;
while(t--)
{
ll a,b;
cin>>a>>b;
string s;cin>>s;
if(s.length()!=a+b+1)
cout<<"No\n";
else if(s[a]!='-')
cout<<"No\n";
else {
ll i,f=0;
for( i=0;i<a;i++)
{if(s[i]>='0'&&s[i]<='9')
continue;
else
{f=1;break;}
}
for(i=a+1;i<a+b+1;i++)
{if(s[i]>='0'&&s[i]<='9')
continue;
else
{f=1;break;}
}
if(f)
cout<<"No\n";
else
cout<<"Yes\n";
}
}
} | 1 | 89,598,537 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
template<class T> using vt = vector<T>;
template<class T> using vvt = vector<vt<T>>;
template<class T> using ttt = tuple<T,T>;
using tii = tuple<int,int>;
using vi = vector<int>;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define pb push_back
#define mt make_tuple
#define ALL(a) (a).begin(),(a).end()
#define FST first
#define SEC second
#define DEB cerr<<"!"<<endl
#define SHOW(a,b) cerr<<(a)<<" "<<(b)<<endl
#define DIV int(1e9+7)
const int INF = (INT_MAX/2);
const ll LLINF = (LLONG_MAX/2);
const double eps = 1e-8;
inline ll pow(ll x,ll n,ll m){ll r=1;while(n>0){if((n&1)==1)r=r*x%m;x=x*x%m;n>>=1;}return r%m;}
inline ll lcm(ll d1, ll d2){return d1 / __gcd(d1, d2) * d2;}
int main(){
int n; cin >> n;
vi in(n);
rep(i,n) cin >> in[i];
int now_pos = 0;
ll ans = 0;
for(int k = 1;now_pos != n;){
if(now_pos == 0){
ans += in[now_pos] - 1;
now_pos++;
k++;
}else if(in[now_pos] < k){
now_pos++;
}else if(in[now_pos] == k){
k++; now_pos++;
}else{
ans += (in[now_pos]-1)/k;
now_pos++;
}
}
cout << ans << endl;
} | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(a);i>(b);i--)
#define ALL(v) (v).begin(),(v).end()
typedef long long int ll;
const int inf = 0x3fffffff; const ll INF = 0x1fffffffffffffff; const double eps=1e-12;
void tostr(ll x,string& res){while(x)res+=('0'+(x%10)),x/=10; reverse(ALL(res)); return;}
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 n; scanf("%d",&n);
vector<int> a(n); rep(i,0,n)scanf("%d",&a[i]);
int p=1; ll res=a[0]-1;
rep(i,1,n){
if(a[i]==p+1)p++;
else if(a[i]>p+1)res+=(a[i]-1)/(p+1);
}
printf("%lld\n",res);
return 0;
} | 1 | 65,066,502 |
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#include<algorithm>
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
ll gcd(ll a,ll b){
if(b == 0) return a;
return gcd(b , a % b);
}
const ll MOD = 998244353;
const ll MAX = 200001;
ll mod(ll a){
return a % MOD;
}
ll lcm(ll a,ll b){
return (a*b)/gcd(a,b);
}
ll fac[MAX], finv[MAX], inv[MAX];
void nCrprep() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll nCr(ll n, ll r){
if (n < r) return 0;
if (n < 0 || r < 0) return 0;
return fac[n] * (finv[r] * finv[n - r] % MOD) % MOD;
}
int main(){
ll n,m; cin >> n >> m; ll nowsum = 0; ll cnt = 0;
map<ll,ll> summod;
summod[0]++;
rep(i,n){
ll x; cin >> x;
nowsum += x;
nowsum %= m;
summod[nowsum]++;
}
for(auto p : summod){
ll x = p.second;
cnt += x*(x-1)/2;
}
cout << cnt << endl;
} | #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 N, M;
cin >> N >> M;
map<ll, ll> C;
vector<ll> A(N);
REP(i, N){
cin >> A[i];
}
vector<ll> B(N);
REP(i, N){
if(i == 0){
B[i] = A[i];
}
else{
B[i] = B[i-1] + A[i];
}
C[B[i]%M]++;
}
ll ans = 0;
for(auto c: C){
ans += (c.second*(c.second-1)/2);
if(c.first == 0){
ans += c.second;
}
}
cout << ans << endl;
return 0;
} | 1 | 2,247,359 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> v;
map<int,int> cnt;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
v.push_back(a);
cnt[a]++;
}
sort(v.begin(), v.end());
reverse(v.begin(), v.end());
for (int i = v[0]; i >= (v[0] + 3) / 2; i--) {
if (cnt[i] < 2) {
cout << "Impossible" << endl;
return 0;
}
}
for (int i = (v[0] - 1) / 2; i >= 1; i--) {
if (cnt[i] != 0) {
cout << "Impossible" << endl;
return 0;
}
}
if (v[0] & 1) {
if (cnt[(v[0] + 1) / 2] != 2) {
cout << "Impossible" << endl;
return 0;
}
} else {
if (cnt[(v[0] + 1) / 2] != 1) {
cout << "Impossible" << endl;
return 0;
}
}
cout << "Possible" << endl;
return 0;
} | #include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
#define MOD 1000000007
#define MAX 510000
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
ll gcd(ll x, ll y) {
if (x == 0) return y;
return gcd(y%x, x);
}
ll lcm(ll x, ll y) { return x * y / gcd(x, y); }
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
ll fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll COM(int n, int k) {
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll com(ll n,ll m){
if(n<=0 || m<=0 || n==m){
return 1;
}
if(n<m){
return 0;
}
ll k=1;
for(ll i=1;i<=m;i++){
k*=(n-i+1);
k%=MOD;
k*=modinv(i,MOD);
k%=MOD;
}
return k;
}
int main() {
int n;
cin>>n;
int a[n];
for(int i=0;i<=n-1;i++){
cin>>a[i];
}
sort(a,a+n,greater<int>());
int k[201];
for(int i=1;i<=200;i++){
k[i]=0;
}
int s;
if(a[0]%2){
s=(a[0]+1)/2;
for(int i=s;i<=a[0];i++){
k[i]=2;
}
}
if(a[0]%2==0){
s=a[0]/2;
for(int i=s;i<=a[0];i++){
if(i==s){k[s]=1;}
else{k[i]=2;}
}
}
for(int i=0;i<=n-1;i++){
if(a[i]<s){
cout<<"Impossible"<<endl;
return 0;}
if(a[0]%2==0){
int q=0;
for(int k=0;k<=n-1;k++){
if(a[k]==s) q++;
}
if(q>=2){
cout<<"Impossible"<<endl;
return 0;
}
}
if(a[0]%2==1){
int q=0;
for(int k=0;k<=n-1;k++){
if(a[k]==s) q++;
}
if(q>=3){
cout<<"Impossible"<<endl;
return 0;
}
}
}
for(int i=1;i<=200;i++){
if(k[i]){
for(int j=0;j<=n-1;j++){
if(a[j]==i){
a[j]=0;
k[i]--;
break;
}
}
}
if(k[i]){
for(int j=0;j<=n-1;j++){
if(a[j]==i){
a[j]=0;
k[i]--;
break;
}
}
}
}
for(int i=1;i<=200;i++){
if(k[i]){
cout<<"Impossible"<<endl;
return 0;
}
}
cout<<"Possible"<<endl;
return 0;
} | 1 | 23,114,282 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int a, b;
cin >> a >> b;
if (a + b == 15)
cout << '+';
else if (a * b == 15)
cout << '*';
else
cout << 'x';
cout << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ll long long
#define all(a) (a).begin(),(a).end()
#define mk make_pair
ll MOD=1000000007;
ll mod=998244353;
int inf=1000001000;
ll INF=10000000000000000;
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 | 40,839,739 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,k;
while(true){
cin>>n>>k;
if(n==0)break;
vector<int> a(n+1,0);
for (int i = 1; i <= n; ++i) {
cin>>a[i];
a[i]+=a[i-1];
}
int ans=0;
for (int i = 0; i+k < n; ++i) {
ans=max(ans,a[i+k]-a[i]);
}
cout<<ans<<endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n, k;
while (cin >> n >> k, n || k){
int a[100010], num;
for (int i = 0; i < n; i++){
cin >> num;
if (i == 0) a[i] = num;
else a[i] = a[i - 1] + num;
}
int res = 0;
for (int i = k; i < n; i++){
res = max(res, a[i] - a[i - k]);
}
cout << res << '\n';
}
} | 1 | 90,084,120 |
#include <bits/stdc++.h>
#include<iostream>
#include<vector>
#include<map>
#include<math.h>
#define irep(i,n) for(int i = 0; i < (int)(n); i++)
#define irep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define irrep(i,n) for(int i = (int)(n-1); i > -1; i--)
#define irrep2(i,n,a) for(int i = (int)(n); i >= (int)(a); i--)
#define fi first
#define se second
using namespace std;
using ll = long long;
using v_int = vector<int>;
using v2_int = vector<v_int>;
using v_ll = vector<ll>;
using v2_ll = vector<v_ll>;
using v_string = vector<string>;
using v_bool = vector<bool>;
using v2_bool = vector<v_bool>;
using pii = pair<int, int>;
using mii = map<int, int>;
const double PI = 3.1415926535897932;
const int INF = (int)2e9;
const ll LINF = (ll)2e18;
const ll MOD = 1000000007;
const int dc[8] = {1, -1, 0, 0, 1, -1, 1, -1};
const int dr[8] = {0, 0, 1, -1, 1, 1, -1, -1};
template<typename T, typename U> inline
ostream& operator<<(ostream &o, pair<T,U> &p) {
return o << "{" << p.first << "," << p.second << "}";
}
template<typename T> inline
istream& operator>>(istream &is, vector<T> &vec) {
for(auto &v : vec) { is >> v; }
return is;
}
template<typename T> inline
ostream& operator<<(ostream &os, vector<T> &vec) {
for(auto &v : vec) { os << v << ",";}
return os;
}
template<typename T> inline
ostream& operator<<(ostream &os, vector<vector<T> > &mat) {
for(auto &row : mat) { os << row << endl; }
return os;
}
template<typename T> inline
void chmin(T &a, T b) { a = min(a, b); }
template<typename T> inline
void chmax(T &a, T b) { a = max(a, b); }
int main(void)
{
int n, q;
cin >> n >> q;
v2_int g(n);
irep(i, n-1) {
int a, b;
cin >> a >> b;
g[a-1].push_back(b-1);
g[b-1].push_back(a-1);
}
v_ll dist(n, 0);
irep(i, q) {
int p, x;
cin >> p >> x;
dist[p-1] += x;
}
queue<int> que;
que.push(0);
v_bool used(n,false);
used[0] = true;
while(que.size()) {
int now = que.front(); que.pop();
for(auto node : g[now]) {
if(used[node]) { continue; }
dist[node] += dist[now];
used[node] = true;
que.push(node);
}
}
irep(i,n) {
cout << dist[i] << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for (long long i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
const ll MOD = 1000000007;
const ll INF = 10000000000000;
#define all(v) v.begin(), v.end()
void no_cost_graphmake(ll E,vector<vector<ll>> &G){
rep(i,E){
ll a,b;
cin >> a >> b;
G.at(a-1).push_back(b-1);
G.at(b-1).push_back(a-1);
}
}
int main(){
ll N,Q;
cin >> N >> Q;
vector<vector<ll>> G(N,vector<ll>(0));
no_cost_graphmake(N-1,G);
vector<ll> A(N,0);
rep(i,Q){
ll p,x;
cin >> p >> x;
A.at(p-1)+=x;
}
queue<ll> Queue;
vector<ll> U(N,0);
Queue.push(0);
U.at(0)=1;
while(!Queue.empty()){
ll i=Queue.front();
Queue.pop();
rep(j,G.at(i).size()){
if(U.at(G.at(i).at(j))==0){
A.at(G.at(i).at(j))+=A.at(i);
Queue.push(G.at(i).at(j));
U.at(G.at(i).at(j))=1;
}
}
}
rep(i,N){
cout << A.at(i) << " ";
}
cout << endl;
} | 1 | 34,118,036 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <map>
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e6+5;
int a[MAXN]={0};
map<int,int>mm;
int solve(int n){
if(mm[n]>1||(mm[1]&&n!=1))
return 0;
for(int i=2;i*i<=n;++i){
if(n%i==0){
mm[n]--;
if(mm[n/i]||mm[i]){
mm[n]++;
return 0;
}
mm[n]++;
}
}
return 1;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
for(int i=0;i<n;i++){
cin >> a[i];
mm[a[i]]++;
}
int ans = 0;
for(int i=0;i<n;i++){
ans+=solve(a[i]);
}
cout <<ans << endl;
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
using namespace std;
typedef long long ll;
int main(){
ll N;
cin >> N;
ll a[N];
for(ll i=0;i<N;i++){
cin >> a[i];
}
sort(a,a+N);
bool s[a[N-1]+1];
for(ll i=1;i<a[N-1]+1;i++){
s[i] = true;
}
ll ans = 0;
for(ll i=0;i<N;i++){
if(i < N-1 && a[i]==a[i+1]){
s[a[i]] = false;
}
if(s[a[i]]) ans++;
ll j=1;
while(a[i]*j<=a[N-1]){
s[a[i]*j] = false;
j++;
}
}
cout << ans << endl;
} | 1 | 56,677,013 |
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <vector>
#include <numeric>
#include <set>
#include <cstdlib>
#include <queue>
#include <map>
using namespace std;
typedef long long llint;
typedef long double ld;
#define inf 1e18
#define mod 1000000007
priority_queue<llint,vector<llint>,greater<llint>> que;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
llint n,a,b;
void solve(){
cin >> n;
int a[n];
for(int i=0;i<n;i++)cin >> a[i];
int ans=0;
int m=n+1;
for(int i=1;i<n;i++){
if(a[i]==a[i-1]){
a[i]=m;
m++;
ans++;
}
}
cout << ans << endl;
}
int main(int argc, char *argv[]) {
solve();
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,i,count=0;
cin >> n;
vector<int> a(n);
for(i=0;i<n;i++){
cin >> a.at(i);
}
for(i=0;i<n-1;i++){
if(a.at(i)==a.at(i+1)){a.at(i+1)=0;count++;}
}
cout << count << endl;
return 0;
} | 1 | 59,960,113 |
#include<iostream>
using namespace std;
int main( ){
int n,Y,M,D,sum,i;
cin>>n;
for(i=0;i<n;i++){
sum=0;
cin>>Y>>M>>D;
sum+=(Y-1)*195+(Y-1)/3*5;
sum+=(M-1)*20-(M-1)/2+D;
if(Y%3==0)sum+=(M-1)/2;
sum=196470-sum;
cout<<sum+1<<endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int get_days(int Y, int M, int D){
int sum = 0;
for(int i = 1; i < Y; i++){
for(int j = 1 ; j <= 10; j++){
if(i % 3 == 0 || j % 2 == 1) sum += 20;
else sum += 19;
}
}
for(int j = 1; j < M; j++){
if(Y % 3 == 0 || j % 2 == 1) sum += 20;
else sum += 19;
}
sum += D;
return sum;
}
int main(){
int n;
cin >> n;
while(n--){
int Y, M, D;
cin >> Y >> M >> D;
cout << get_days( 1000, 1, 1) - get_days( Y, M, D) << endl;
}
} | 1 | 15,945,661 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
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 int NIL = -1;
const int INF = (1<<21);
const long long MOD = 1e9+7;
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
int main() {
int N, K; cin >> N >> K;
vector<int> v(N);
for (int i = 0; i < N; ++i) cin >> v[i];
int ans = 0;
for (int l = 0; l <= K; ++l) {
for (int r = 0; l + r <= K; ++r) {
if (l + r > N) continue;
int d = K - (l + r);
vector<int> s;
int now = 0;
for (int i = 0; i < l; ++i) {
now += v[i];
s.push_back(v[i]);
}
for (int i = N-1; i >= N-r; i--) {
now += v[i];
s.push_back(v[i]);
}
sort(s.begin(), s.end());
for (int i = 0; i < d; ++i) {
if (i >= s.size()) break;
if (s[i] > 0) break;
now -= s[i];
}
ans = max(now, ans);
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int inf = 1e9 + 7;
const ll longinf = 5LL << 60;
const ll mod = 1e9 + 7;
int main() {
int N, K;
cin >> N >> K;
int V[N];
for(int i = 0; i < N; i++) cin >> V[i];
ll ans = 0, limit = min(N, K);
for(int i = 0; i <= limit; i++) {
for(int j = 0; i + j <= limit; j++) {
vector<int> v;
for(int a = 0; a < i; a++) v.push_back(V[a]);
for(int a = 0; a < j; a++) v.push_back(V[N - 1 - a]);
ll sum = accumulate(v.begin(), v.end(), 0LL);
sort(v.begin(), v.end());
for(int a = 0; a < min(K - i - j, (int)(v.size())); a++)
if(v[a] >= 0)
break;
else
sum -= v[a];
ans = max(ans, sum);
}
}
cout << ans << "\n";
return 0;
} | 1 | 58,327,281 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#define RREP(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define RREPS(i, x) for (int i = ((int)(x)); i > 0; i--)
#define INF 2147483647
#define LLINF 9223372036854775807LL
#define vi vector<int>
#define vvi vector<vector<int>>
#define vvvi vector<vector<vector<int>>>
#define pi pair<int, int>
#define ALL(a) (a).begin(), (a).end()
#define BIT(n) (1LL << (n))
int dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
int dy[8] = {0, 1, 0, -1, 1, -1, 1, -1};
int main(){
int K; cin>>K;
string S; cin>>S;
if(S.size() <= K){
cout<<S<<endl;
}else{
REP(i,K){
cout<<S.at(i);
}
cout<<"..."<<endl;
}
} | #include <iostream>
#include <string>
#include <stdlib.h>
using namespace std;
int main(){
int K;
string S;
cin>>K>>S;
if(S.size()<=K){
cout<<S<<endl;
}else{
cout<<S.erase(K)<<"..."<<endl;
}
return 0;
} | 1 | 96,609,783 |
#include<iostream>
#include<algorithm>
using namespace std;
struct Mat {
int row;
int col;
};
long mcm(Mat* M, int n) {
long dp[101][101];
for(int i=2; i<=n; i++) {
for(int j=0; j<=n-i; j++) {
dp[i][j] = 99999999999L;
for(int k=1; k<i; k++) {
dp[i][j] = min(dp[k][j]+dp[i-k][j+k]+M[j].row*M[j+k].row*M[j+i-1].col, dp[i][j]);
}
}
}
return dp[n][0];
}
long dpR[101][101];
long mcmRec(Mat* M, int l, int r) {
if(r - l < 2) return 0;
if(dpR[l][r] == 0) {
dpR[l][r] = 9999999999L;
for(int i=1; i<r-l; i++) {
dpR[l][r] = min(mcmRec(M,l,l+i)+mcmRec(M,l+i,r)+M[l].row*M[l+i].row*M[r-1].col, dpR[l][r]);
}
}
return dpR[l][r];
}
int main() {
int n;
Mat M[100];
cin >> n;
for(int i=0; i<n; i++) {
cin >> M[i].row >> M[i].col;
}
long ans = mcmRec(M, 0, n);
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<ll> r(100);
vector<ll> c(100);
vector<vector<ll>> dp(101, vector<ll>(101,-1));
ll solve(ll a, ll b)
{
if(dp.at(a).at(b) != -1){
return dp.at(a).at(b);
}
if(b-a == 1){
return dp.at(a).at(b) = 0;
}else if(b-a == 2){
return dp.at(a).at(b) = r.at(a)*c.at(a)*c.at(b-1);
}else{
vector<ll> tmp;
ll i;
for(i = a+1;i <= b-1;++i){
ll tmp1 = solve(a, i);
ll tmp2 = solve(i, b);
tmp.push_back(tmp1 + tmp2 + r.at(a)*r.at(i)*c.at(b-1));
}
sort(tmp.begin(), tmp.end());
return dp.at(a).at(b) = tmp.front();
}
}
int main()
{
ll i,j;
ll n;
cin >> n;
for(i = 0;i < n;++i){
cin >> r.at(i) >> c.at(i);
}
ll ans = solve(0,n);
cout << ans << endl;
return 0;
} | 1 | 38,136,953 |
#include<iostream>
int main(){
int i,n,m;
for(i=0;i<3000;i++){
std::cin>> n>> m;
if(n==0&&m==0) break;
if(n>=m){
std::cout<< m<< " "<< n<< std::endl;
}else{
std::cout<< n<< " "<< m<< std::endl;
}
}
return 0;
} | #include <iostream>
int main() {
int x, y;
do {
std::cin >> x >> y;
if (x != 0 || y != 0) {
if (x < y) {
std::cout << x << " " << y << std::endl;
} else {
std::cout << y << " " << x << std::endl;
}
}
} while (x != 0 || y != 0);
} | 1 | 65,625,320 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <string>
#include <iomanip>
#include <map>
#include <set>
#include <cmath>
#include <cstdio>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define FOR(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
#define All(v) (v).begin(),(v).end()
typedef long long ll;
const ll INF = 1e16;
int main(){
int N;cin >> N;
vector<int> a(N);
rep(i,N)cin >> a[i];
vector<ll> sum(N+1);
for(int i=0;i<N;i++){
sum[i+1] = sum[i]+a[i];
}
ll res = INF;
for(int i=1;i<N;i++){
res = min(res,abs(sum[i]-(sum[N]-sum[i])));
}
cout << res << endl;
return 0;
} | #include <bits/stdc++.h>
#define int long long
using namespace std;
int a[200010];
signed main()
{
ios::sync_with_stdio(0);
int n;cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];a[i]+=a[i-1];
}
int ans=1e18;
for(int i=1;i<n;i++)ans=min(ans,abs(a[i]-a[n]+a[i]));
cout<<ans<<endl;
} | 1 | 7,862,151 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
#define INF 200000000000
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}
#define all(x) x.begin(), x.end()
bool compare(pair<int, int> a, pair<int, int> b) {
if(a.first != b.first){
return a.first < b.first;
}else{
return a.second < b.second;
}
}
int main() {
ll N;
cin >>N;
vector<ll> a(N);
rep(i,N){
cin >> a[i];
}
ll now =1;
ll ans = 0;
rep(i,N){
if(a[i] == now){
now++;
}else{
ans++;
}
}
if(ans == N){
ans = -1;
}
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define endl '\n'
#define rep(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(),v.end()
#define F first
#define S second
#define debug1(a) cout<<#a<<" "<<(a)<<endl;
#define debug2(a,b) cout<<#a<<" "<<(a)<<" "<<#b<<" "<<(b)<<endl;
#define debug3(a,b,c) cout<<#a<<" "<<(a)<<" "<<#b<<" "<<(b)<<" "#c<<" "<<(c)<<endl;
typedef long double ld;
void solve()
{
ll n;
cin >> n;
vector<ll> arr(n);
vector<ll> res;
rep(i, n)
{
cin >> arr[i];
}
ll j = 1;
for (int i = 0; i < n; i++)
{
if (arr[i] == j)
{
res.push_back((i + 1));
j++;
}
}
if (res.size() == 0)
{
for (int i = 0; i < n; i++)
{
if (arr[i] != (i + 1))
{
cout << -1 << endl;
return;
}
}
cout << 0 << endl;
}
else
{
ll sum = res[0] - 1;
for (int i = 1; i < res.size(); i++)
{
sum += (res[i] - res[i - 1] - 1);
}
if (res[res.size() - 1] != n)
{
sum += n - res[res.size() - 1];
}
if (sum > n - 1)
{
cout << -1 << endl;
return;
}
cout << sum << endl;
}
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
t = 1;
while (t--)
{
solve();
}
} | 1 | 90,676,292 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b;
string s;
string ans = "Yes";
cin >> a >> b >> s;
if (s[a] != '-'){
ans = "No";
}
for (int i=0;i<a+b+1;i++){
if (s[i] == '-' && i != a){
ans = "No";
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
const int inf = 1001001001;
int main(){
int a,b;
string s;
cin >> a >> b >> s;
string t = "0123456789";
bool flag = 1;
for(int i = 0; i < s.size(); i++){
if(i == a){
if(s[i] != '-') {
flag = 0;
break;
}
}
else{
bool flag2 = 0;
for(int j = 0; j < 10; j++){
if(s[i] == t[j]) flag2 = 1;
}
if(!flag2){
flag = 0;
break;
}
}
}
if(flag) cout << "Yes" << endl;
else cout << "No" << endl;
} | 1 | 23,583,828 |
#include <iostream>
#include <vector>
typedef long long LL;
using namespace std;
int main(){
LL n;
cin >> n;
vector<vector<LL>> a_bin(n+1,vector<LL>(20, 0));
vector<LL> a(n);
for(LL i=0; i<n; i++){
cin >> a[i];
}
LL tmp;
for(LL i=1; i<=n; i++){
tmp=a[i-1];
for(LL j=0; j<20; j++){
a_bin[i][j]=tmp%2;
a_bin[i][j]+=a_bin[i-1][j];
tmp/=2;
}
}
LL end_point=1;
LL ans=0;
for(LL i=0; i<=n; i++){
while(true){
bool is_ok=true;
for(LL j=0; j<20; j++){
if(a_bin[end_point][j]-a_bin[i][j]>1){
is_ok=false;
}
}
if(is_ok==false){
ans+=(end_point-1-i);
break;
}else if(end_point==n){
ans+=end_point-i;
break;
}else{
end_point++;
}
}
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <vector>
#include <set>
using namespace std;
int main(){
int N;
cin >> N;
vector<long long> a(N);
for(int i=0; i<N; ++i) cin >> a[i];
long long sum = 0;
long long xorsum = 0;
long long res = 0;
int right = 0;
for(int left=0; left<N; ++left){
while(right <N && ((right == left) || (sum+a[right]) == (xorsum ^ a[right]) ) ){
sum += a[right];
xorsum = xorsum^a[right];
right++;
}
res += right - left;
sum -= a[left];
xorsum = xorsum^a[left];
}
cout << res << endl;
} | 1 | 36,672,808 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define all(a) a.begin(), a.end()
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<ll,ll> P;
#define rep(i,a,b) for(int i=a ; i<b ; i++)
#define qrep(que, ite) for(auto ite=begin(que) ; ite!=end(que) ; ite++)
const int max_n = 1e5;
const ll mod = 1e9+7;
const ll INF = 1LL<<60;
const int inf = 1<<30;
typedef long double ld;
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 dx[4] = {0,0,1,-1};
int dy[4] = {1,-1,0,0};
ll mo = 998244353;
ll jou(ll n, ll x){
ll res = 1;
while(n){
if(n & 1) res = res*x % mo;
x = x*x % mo;
n >>= 1;
}
return res;
}
int main(){
int n; cin >> n;
vector<int> v(n), a(n,0);
int ma = 0;
rep(i,0,n){
cin >> v[i];
a[v[i]]++;
ma = max(ma, v[i]);
}
ll ans = 1;
rep(i,0,ma){
if(!a[i] || !a[i+1]||a[0]!=1||v[0]!=0){
cout << 0 << endl;
return 0;
}
ans *= jou(a[i+1], a[i]);
ans %= mo;
}
cout << ans << endl;
return 0;
} | #define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <queue>
#include <vector>
#include <algorithm>
#include <math.h>
#include <map>
#include <list>
#include <iomanip>
#include <queue>
#include <cmath>
#include <numeric>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
typedef pair<ll, ll> p;
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 long long mod = 1e9 + 7;
ll gcd(ll a, ll b);
ll lcm(ll a, ll b);
int main() {
ll N;
cin >> N;
vector<ll> cnt(N, 0);
ll T = 0, tmp, D = 998244353;
bool flag = true;
cin >> tmp;
if (tmp != 0) {
flag = false;
}
rep(i, N - 1) {
cin >> tmp;
if (tmp == 0) flag = false;
T = max(T, tmp);
cnt[tmp]++;
}
ll ans = 1;
if (flag) {
repl(i, 2, T + 1) {
rep(j, cnt[i]) {
ans *= cnt[i - 1];
if (ans > D) ans %= D;
}
}
}
else {
ans = 0;
}
cout << ans;
}
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);
} | 1 | 10,513,503 |
#include <bits/stdc++.h>
#define int long long
using namespace std;
main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
int e = (c*d)/__gcd(c, d),
cnt_a = (a-1)/c + (a-1)/d - (a-1)/e,
cnt_b = b/c + b/d - b/e;
cout << b-a+1-cnt_b+cnt_a;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <map>
#include <queue>
#include <random>
#include <iomanip>
#include <iterator>
#include <utility>
typedef long long ll;
typedef unsigned long long ull;
int main() {
ull a, b, c, d, n, c_r, d_r;
std::cin >> a >> b >> c >> d;
c_r = c;
d_r = d;
if (c < d) {
std::swap(c, d);
std::swap(c_r, d_r);
}
for (int i = 0; i < c; ++i) {
n = c % d;
c = d;
if (n == 0) {
break;
}
d = n;
}
a -= 1;
std::cout << (b - (b / c_r) - (b / d_r) + (b / (c_r * d_r / d))) - (a - (a / c_r) - (a / d_r) + (a / (c_r * d_r / d))) << std::endl;
} | 1 | 64,153,399 |
#include <bits/stdc++.h>
using namespace std;
#define repex(i, a, b, c) for(int i = a; i < b; i += c)
#define repx(i, a, b) repex(i, a, b, 1)
#define rep(i, n) repx(i, 0, n)
#define repr(i, a, b) for(int i = a; i >= b; i--)
int main(){
int N, A, B;
scanf("%d %d %d", &N, &A, &B);
int ans = 0, a = 0, b = 0, c = 0, p;
rep(i, N){
scanf("%d", &p);
if(p <= A) a++;
if(p >= A + 1 && p <= B) b++;
if(p >= B + 1) c++;
}
printf("%d\n", min({a, b, c}));
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define INF 1e9
#define LLINF 1e18
#define pi 3.14159265358979323
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int gcd(int a, int b) {
if(a % b == 0) {
return b;
}
else {
return(gcd(b, a % b));
}
}
int main() {
int n, a, b;
int x = 0;
int y = 0, z = 0;
cin >> n >> a >> b;
vector<int> p(n);
rep(i, n) {
cin >> p.at(i);
if (p.at(i) <= a) x++;
else if (p.at(i) <= b) y++;
else z++;
}
cout << min(x, min(y, z)) << endl;
} | 1 | 71,650,279 |
#include <cstdio>
#include <algorithm>
#include <iostream>
using namespace std;
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
typedef long long ll;
const ll LIMIT = 1000000000000000000LL;
int main(void) {
int n;
scanf("%d", &n);
ll r = 1;
bool over = false;
REP(i, n) {
ll a;
scanf("%lld", &a);
if(a == 0) {
r = 0;
break;
}
if(r > LIMIT / a) {
over = true;
} else {
r *= a;
}
}
if(r != 0 && over) {
r = -1;
}
cout << r << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
int n; cin >> n;
ll ans = 1, maxvalue = 1e18;
double t = 1;
for (int i = 0; i < n; ++i)
{
ll a; cin >> a;
ans *= a;
t *= a;
}
if (ans > maxvalue || t > maxvalue)
cout << -1 << endl;
else
cout << ans << endl;
} | 1 | 20,295,203 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define all(a) (a).begin(), (a).end()
int main() {
int a, b;
cin >> a >> b;
cout << (a + b + 1) / 2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b;
float c;
int x;
cin >> a >> b;
c=(a+b)/2;
if((a+b)%2==0){
x=c;
cout << x << endl;
}else{
x=(a+b)/2+1;
cout << x << endl;
}
} | 1 | 35,158,521 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define ll long long
#define all(v) v.begin(), v.end()
int main()
{
int n;cin>>n;
vector<int> primes(n+1,0);
int i,j,k;
for(i=2;i<=n;i++)
{
int left=i;
for(j=2;j*j<=i;j++)
{
while(left%j==0)
{
primes[j]++;
left/=j;
}
}
if(left!=1)primes[left]++;
}
int ans=0;
for(i=2;i<=n;i++)if(primes[i]>=74)ans++;
for(i=2;i<=n;i++)
{
for(j=2;j<=n;j++)
{
if(i==j)continue;
if(primes[i]>=2&&primes[j]>=24)ans++;
if(primes[i]>=4&&primes[j]>=14)ans++;
}
}
for(i=2;i<=n;i++)
{
for(j=2;j<=n;j++)
{
for(k=j+1;k<=n;k++)
{
if(i==j||i==k||j==k)continue;
if(primes[i]>=2&&primes[j]>=4&&primes[k]>=4)ans++;
}
}
}
cout<<ans<<endl;
} | #include <bits/stdc++.h>
using namespace std;
map<int,int> res;
void prime_factor(int n){
for(int i=2;i*i<=n;i++){
while(n%i==0){
++res[i];
n/=i;
}
}
if(n!=1){
res[n]++;
}
}
int main(){
int N;
cin >> N;
for(int i=1;i<=N;i++){
prime_factor(i);
}
int over2=0,over4=0,over14=0,over24=0,over74=0;
for(int i=2;i<=N;i++){
if(74<=res[i]){
over2++;
over4++;
over14++;
over24++;
over74++;
}else if(24<=res[i]){
over2++;
over4++;
over14++;
over24++;
}else if(14<=res[i]){
over2++;
over4++;
over14++;
}else if(4<=res[i]){
over2++;
over4++;
}else if(2<=res[i]){
over2++;
}
}
cout << over74 + over14*(over4-1) + over24*(over2-1) + over4*(over4-1)*(over2-2)/2 << endl;
} | 1 | 26,986,517 |
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#endif
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main()
{
int n;
cin >> n;
int count = 0;
if (n < 10)
{
count = n;
}
else if (n < 100)
{
count = 9;
}
else if (n < 1000)
{
count = 9;
count += n - 99;
}
else if (n < 10000)
{
count = 9;
count += 999 - 99;
}
else if (n < 100000)
{
count = 909;
count += n - 9999;
}
else
count = 90909;
cout << count << endl;
return 0;
} | #include <iostream>
#include <algorithm>
using namespace std;
string st;
int const nmax = 50;
int barby[1 + nmax];
int main() {
long long n, bees, ans = 0, ogn;
long long popo = 1;
cin >> n;
ogn = n;
ans = 0;
bees = 0;
while(n > 0){
bees++;
if(bees % 2 == 1){
if(ogn >= popo * 10){
ans += popo * 9;
}else{
ans += ogn - popo + 1;
}
}
n /= 10;
popo *= 10;
}
cout << ans;
return 0;
} | 1 | 83,306,439 |
#include <bits/stdc++.h>
#define pb push_back
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,n,s) for(int i=(s);i<(n);i++)
#define rrep(i,n) for(int i=(n-1);i>=0;i--)
#define rreps(i,n,s) for(int i=s;i>=n;i--)
#define MOD 1000000007
using ll = long long;
using namespace std;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int a,b,c,d;
cin>>a>>b>>c>>d;
if((abs(a-b)<=d&&(abs(b-c))<=d)||abs(a-c)<=d){
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<endl;
}
return 0;
} | #include <iostream>
#include<algorithm>
#include<string>
#include <cmath>
#include <vector>
#include <map>
#include <cstdio>
#pragma region Macros
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<=n;i++)
#define int long long
#define all(x) (x).begin(),(x).end()
#define swap(a,b) (a += b,b = a - b,a -= b)
#define ceil(a,b) ((a+b-1)/b)
int gcd(int a, int b)
{
if (a < b)
swap(a, b);
if (b == 0)
return a;
if (a % b == 0)
return b;
return gcd(b, a % b);
}
int lcm(int a, int b)
{
return a * b / gcd(a, b);
}
using namespace std;
#pragma endregion
signed main() {
int A,B,C,D;
cin >> A >> B >> C >>D;
if (abs(A-C)<=D || (abs(A-B)<=D && abs(B-C) <= D))
cout << "Yes";
else
cout << "No";
} | 1 | 89,710,643 |
#include<bits/stdc++.h>
using namespace std;
main(){
string s; cin>>s;
int cnt=0, ans=0;
for(int i=0; i<s.length(); i++){
if(s[i]=='R') cnt++;
else{
ans = max(ans, cnt);
cnt=0;
}
}
ans = max(ans,cnt);
cout<<ans;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, ns, ne) for (int i = ns; i < ne; ++i)
string s;
void input() { cin >> s; }
void solve() {
int ans = 0, cnt = 0;
rep(i, 0, 3) {
if (s[i] == 'R')
cnt++;
else
cnt = 0;
ans = max(ans, cnt);
}
cout << ans << endl;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
input();
solve();
getchar();
} | 1 | 56,633,878 |
#include <bits/stdc++.h>
#define se second
#define sz(x) (int)(x.size())
#define ll long long
#define rep(i,x,y) for(int i = x; i <= y; ++i)
#define repr(i,x,y) for(int i = x; i >= y; --i)
#define pb push_back
#define mp make_pair
#define fi first
#define ull unsigned ll
#define pi 3.14159265358979
using namespace std;
const int N = (int)(1e6) + 322;
const ll INF = 2e18 + 17;
const int inf = 2e9;
const int mod = 1000000007;
const double eps = 1e-9;
int gcd(int a, int b) { return b ? gcd (b, a % b) : a; }
int nbr_bits(int a){
return log2(a)+1;
}
int binpow(int a, int n, int mod) {
int res = 1;
while (n) {
if (n & 1) {
res *= a;
res %= mod;
}
a *= a;
a %= mod;
n >>= 1;
}
return res;
}
int fastpow(int a, int n, int mod) {
if(n==0)
return 1;
if(n%2==0){
int res = fastpow(a,n/2,mod);
res*=res;
res%=mod;
return res;
}
int res = (fastpow(a,n-1,mod)*a)%mod;
return res;
}
signed main()
{
int n, k;
cin >> n >> k;
int sum = n*3 + k;
cout << sum / 2 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int A,P;
int x = 0;
cin >> A >> P;
x = (A*3 + P)/2;
cout << x <<endl;
return 0;
} | 1 | 18,454,910 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 60;
int h, w, dirx[4] = {1, -1, 0, 0}, diry[4] = {0, 0, 1, -1};
string s[maxn];
bool check;
int main(){
cin >> h >> w;
for(int i=0; i<h; i++)
cin >> s[i];
for(int i=0; i<h; i++){
for(int j=0, temp; j<w; j++){
if(s[i][j] == '.'){
continue;
}
check = false;
for(int k=0, x, y; k<4; k++){
x = dirx[k]+j;
y = diry[k]+i;
if(x<0||x>=w||y<0||y>=h){
continue;
}
if(s[y][x] == '#'){
check = true;
}
}
if(!check){
cout << "No" << endl;
return 0;
}
}
}
cout << "Yes" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
int main() {
int h,w;
cin >> h >> w;
vector<vector<char>>s(55,vector<char>(55));
for(int i=1;i<=h;i++){
for(int j=1;j<=w;j++){
cin >> s[i][j];
}
}
bool judge = true;
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
if(s[i][j]=='#'&&s[i+1][j]!='#'&&s[i-1][j]!='#'&&s[i][j-1]!='#'&&s[i][j+1]!='#') judge=false;
}
}
if(judge) cout << "Yes" << endl;
else cout << "No" << endl;
} | 1 | 15,759,235 |
#include<stdio.h>
int main() {
int x, a, b;
scanf("%d %d %d", &x, &a, &b);
if (b <= a)
printf("delicious");
else if (b <= a + x)
printf("safe");
else
printf("dangerous");
return 0;
} | #include<iostream>
int main(){
int X, A, B;
std::cin >> X >> A >> B;
if(A >= B){
std::cout << "delicious" << std::endl;
}else{
if(A + X >= B){
std::cout << "safe" << std::endl;
}else{
std::cout << "dangerous" << std::endl;
}
}
return 0;
} | 1 | 70,998,852 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long INF = 1LL << 60;
int gcd(int a, int b) {
if(a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
int main() {
string S;
cin >> S;
int zero_count = count(S.begin(), S.end(), '0');
int one_count = count(S.begin(), S.end(), '1');
int m = min(zero_count, one_count);
cout << m * 2 << endl;
} | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main() {
string s;
cin >> s;
int red, blue;
red = count(s.begin(), s.end(), '0');
blue = count(s.begin(), s.end(), '1');
cout << min(red, blue) * 2 << endl;
} | 1 | 5,676,058 |
#include <iostream>
#include <string>
int main() {
std::string str1,str2;
int n;
int A[1001][1001];
std::cin>>n;
for(int i=0;i<n;i++){
std::cin>>str1;
std::cin>>str2;
for(int j=0;j<1001;j++){
for(int k=0;k<1001;k++){
A[j][k]=0;
}
}
for(int j=1;j<=str1.size();j++){
for(int k=1;k<=str2.size();k++){
if(str1[j-1]==str2[k-1]){
A[j][k]=A[j-1][k-1]+1;
}else{
if(A[j-1][k]>A[j][k-1]){
A[j][k]=A[j-1][k];
}else{
A[j][k]=A[j][k-1];
}
}
}
}
std::cout<<A[str1.size()][str2.size()]<<"\n";
}
return 0;
} | #include<iostream>
#include<algorithm>
#include<string>
using namespace std;
int lcs(string s, string t){
int a[s.size()+1][t.size()+1];
for(int i=0;i<s.size()+1;i++) a[i][0]=0;
for(int i=0;i<t.size()+1;i++) a[0][i]=0;
for(int i=1;i<s.size()+1;i++){
for(int j=1;j<t.size()+1;j++){
if(s[i-1]==t[j-1]) a[i][j] = a[i-1][j-1]+1;
else a[i][j] = max(a[i-1][j], a[i][j-1]);
}
}
return a[s.size()][t.size()];
}
int main(){
string s,t;
int n;
cin>>n;
for(int i=0;i<n;i++){
cin>>s>>t;
cout<<lcs(s,t)<<endl;
}
return 0;
} | 1 | 62,581,486 |
#include<bits/stdc++.h>
using namespace std;
vector<int>v[200004];
int main()
{
int n,x;
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>x;
v[x].push_back(i);
}
int cnt=0,prev=-1;
for(int i=1;i<=200000;i++)
{
if(v[i].size()==0) break;
sort(v[i].begin(),v[i].end());
int X=upper_bound(v[i].begin(),v[i].end(),prev)-v[i].begin();
if(X>=v[i].size()) break;
int num=v[i][X];
if(num>prev) { prev=num; cnt++; }
else break;
}
if(prev==-1) cout<<-1<<endl;
else cout<<n-cnt<<endl;
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll n;
cin >> n;
vector<ll> a(n);
for(ll i=0; i<n; i++) cin >> a[i];
int num = 1;
for(ll i=0; i<n; i++){
if(num==a[i]){
num++;
}
}
if(num==1) cout << -1 << endl;
else cout << n-num+1 << endl;
return 0;
} | 1 | 23,660,589 |
#pragma GCC optimize ("O3")
#pragma GCC optimize("unroll-loops")
#include"bits/stdc++.h"
using namespace std;
using ld=long double;
int32_t main()
{
int n,k;
cin>>n>>k;
ld ans=0;
int cur;int tm;
for(int i=1;i<=n;i++)
{
cur=i;tm=0;
while(cur<k)
{
cur*=2;
tm++;
}
ans+=(1/(ld)(1LL<<tm));
}
ans*=(1/(ld)n);
cout<<fixed<<setprecision(12)<<ans;
} | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int 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 kan_hyaku(int n){
int kurai = 0;
for(int i=0;i<3;i++){
kurai = n%10;
n /=10;
}
return kurai;
}
int kan_ju(int n){
int kurai = 0;
for(int i=0;i<2;i++){
kurai = n%10;
n /=10;
}
return kurai;
}
int kan_ichi(int n){
int kurai = 0;
for(int i=0;i<1;i++){
kurai = n%10;
n /=10;
}
return kurai;
}
int keta(int n){
int wa = 1;
while(n>0){
wa *=10;
n--;
}
return wa;
}
double kan_half(int n){
double wa = 1;
while(n>0){
wa *= 0.5;
n--;
}
return wa;
}
int main() {
double n;
int k;
cin >> n >> k;
double sum = 0;
for(int i=1;i<=n;i++){
int count = 0;
int num = i;
for(;;){
if(k <= num) break;
num *= 2;
count ++;
}
double s = 1/n * kan_half(count);
sum += s;
}
cout << fixed << setprecision(20)<< sum << endl;
} | 1 | 94,409,993 |
#include "bits/stdc++.h"
#define ll long long
#define int ll
#define fi first
#define si second
#define mp make_pair
#define pb push_back
#define pi pair<ll,ll>
#define clr(x) memset(x,0,sizeof(x));
#define f(i,l,r) for(int i=l;i<=r;i++)
#define rf(i,r,l) for(int i=r;i>=l;i--)
#define done(i) cout<<"done = "<<i<<endl;
#define show(x,y) cout<<x<<" : ";for(auto z:y)cout<<z<<" ";cout<<endl;
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
const ll inf=1e18;
const int mod=1e9+7;
const int M=100005;
main()
{
fast
int m,k;
cin>>m>>k;
int val=(1LL<<m)-1;
if(k>val)
{
cout<<"-1"<<endl;
return 0;
}
if(k==0)
{
f(i,0,val)
{
cout<<i<<" ";
if(i==val)cout<<i;
else cout<<i<<" ";
}
cout<<endl;
return 0;
}
if(m==1)
{
cout<<"-1"<<endl;
return 0;
}
f(i,0,val)
{
if(i!=k)cout<<i<<" ";
}
cout<<k;
rf(i,val,0)
{
if(i!=k)cout<<" "<<i;
}
cout<<" "<<k<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int n,k;
int main(){
cin>>n>>k;
if(n==1){
cout<<(k==0?"0 0 1 1\n":"-1\n");
return 0;
}
if(1<<n<=k){
cout<<-1<<endl;
return 0;
}
for(int i=0;i<1<<n;i++)if(i!=k)cout<<i<<" ";
cout<<k<<" ";
for(int i=(1<<n)-1;i>=0;i--)if(i!=k)cout<<i<<" ";
cout<<k<<endl;
} | 1 | 19,082,787 |
#include <iostream>
#include <cmath>
#include <stdint.h>
#include <iomanip>
#include <vector>
#include <queue>
using namespace std;
#define int long long
#define INF 1001001001
int32_t main() {
double L;
cin >> L;
double ans = L/3;
ans= ans* ans*ans;
cout << fixed << setprecision(12) << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double L; cin >> L;
cout << setprecision(7) << L/3 * L/3 * L/3 << endl;
} | 1 | 85,905,346 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 2e5 + 5;
std::vector<int> dp1(110);
std::vector<int> dp2(110);
int main(){
int n;
cin>>n;
int a[n];
for(int i=1;i<=n;i++){
cin>>a[i];
}
for(int i=1;i<=n;i++){
dp1[i] = dp1[i-1]+a[i];
}
for(int i=n;i>=1;i--){
dp2[i] = dp2[i+1]+a[i];
}
int mx = 1000;
for(int i=1;i<n;i++){
mx = min(mx,abs(dp1[i] - dp2[i+1]));
}
cout<<mx<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int n;
cin >>n;
vector<int> w(n);
for(int i = 0; i< n; i++)cin >> w[i];
vector<int> a(n);
int t;
a[0] = w[0];
for(int i = 1; i<n;i++) a[i] += a[i-1]+w[i];
int ans =100100 ;
for(int t=0; t< n-1;t++){
ans = min(ans, abs(a[t] -(a[n-1]-a[t])));
}
cout << ans << endl;
return 0;
} | 1 | 37,893,291 |
#include<bits/stdc++.h>
#define REP(i,n) for(int i=0;i<n;i++)
#define LOOP(i,x,n) for(int i=x;i<n;i++)
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define MP make_pair
#define FR first
#define SC second
#define int long long
using namespace std;
const int MOD=1000000007;
const int INF=1000000009;
signed main(){
int n;
while(cin>>n,n){
string s="";
REP(i,n){
string t;
cin>>t;
s+=t;
}
int ans=0;
if(s.size()<=2)cout<<0<<endl;
else{
REP(i,s.size()-3){
string t=s.substr(i,2);
string u=s.substr(i+2,2);
if((t=="lu"&&u=="ru")||(t=="ru"&&u=="lu"))ans++;
if((t=="ld"&&u=="rd")||(t=="rd"&&u=="ld"))ans++;
}
cout<<ans<<endl;
}
}
return 0;
} | #include<stdio.h>
#include<iostream>
#include<list>
#include<map>
#include<math.h>
#include<vector>
#include<algorithm>
#include<string.h>
#include<iomanip>
#define range(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,b) range(i,0,b)
#define debug(x) cout << "debug" << x << endl;
using namespace std;
int main(){
int n;
while(cin >> n, n){
int leg[2] = {0};
int ans = 0;
bool ground = true;
rep(i, n){
string inp;
cin >> inp;
if(inp == "lu"){
leg[0]++;
}else if(inp == "ru"){
leg[1]++;
}else if(inp == "ld"){
leg[0]--;
}else if(inp == "rd"){
leg[1]--;
}
if(ground == true && leg[0] == 1 && leg[1] == 1){
ans++;
ground = false;
}else if(ground == false && leg[0] == 0 && leg[1] == 0){
ans++;
ground = true;
}
}
cout << ans << endl;
}
} | 1 | 34,313,620 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll n;cin>>n;
ll ans=0;
ll now=1;
for(ll i=0;i<n;i++){
ll a;cin>>a;
if(i==0){
ans+=a-1;
now++;
continue;
}
if(a==now){
now++;
continue;
}
if(a%now==0){
ans+=a/now-1;
}
else{
ans+=a/now;
}
}
cout<<ans<<endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main () {
ios_base::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
int n;
cin >> n;
vector < int > a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
ll ans = a[0] - 1;
int mx = 2;
for (int i = 1; i < n; i++) {
if (a[i] == mx) mx++;
else if (a[i] > mx) {
ans += (a[i] - 1) / mx;
}
}
cout << ans << '\n';
} | 1 | 87,358,709 |
Subsets and Splits