code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 137
101M
|
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i = 0;i < n;++i)
#define all(v) v.begin(), v.end()
template <typename T> bool chmax(T &a, const T& b){if(a < b){a = b;return true;}return false;}
template <typename T> bool chmin(T &a, const T& b){if(a > b){a = b;return true;}return false;}
using ll = long long;
int main()
{
ll i,j;
ll n,d,a;
cin >> n >> d >> a;
vector<pair<ll,ll>> x(n);
for(i = 0;i < n;++i){
cin >> x.at(i).first >> x.at(i).second;
}
sort(all(x));
ll ans = 0;
queue<pair<ll,ll>> que;
ll num = 0;
for(i = 0;i < n;++i){
while(!que.empty() && que.front().first < x.at(i).first){
num -= que.front().second;
que.pop();
}
x.at(i).second -= num;
if(x.at(i).second <= 0) continue;
ll tmp = ((x.at(i).second-1)/a+1)*a;
ans += tmp/a;
que.emplace(x.at(i).first + 2*d, tmp);
num += tmp;
}
cout << ans << endl;
return 0;
} | #include<iostream>
#include<algorithm>
#include<cmath>
#include<map>
#include<stdio.h>
#include<vector>
#include<queue>
#include<math.h>
#include<deque>
using namespace std;
#define int long long
#define rep(s,i,n) for(int i=s;i<n;i++)
#define c(n) cout<<n<<endl;
#define ic(n) int n;cin>>n;
#define sc(s) string s;cin>>s;
#define mod 1000000007
#define inf 1000000000000000007
#define f first
#define s second
#define mini(c,a,b) *min_element(c+a,c+b)
#define maxi(c,a,b) *max_element(c+a,c+b)
#define pi 3.141592653589793238462643383279
#define e_ 2.718281828459045235360287471352
#define P pair<int,int>
#define upp(a,n,x) upper_bound(a,a+n,x)-a;
#define low(a,n,x) lower_bound(a,a+n,x)-a;
#define UF UnionFind
int keta(int x) {
rep(0, i, 30) {
if (x < 10) {
return i + 1;
}
x = x / 10;
}
}
int gcd(int x, int y) {
if (x == 0 || y == 0)return x + y;
int aa = x, bb = y;
rep(0, i, 1000) {
aa = aa % bb;
if (aa == 0) {
return bb;
}
bb = bb % aa;
if (bb == 0) {
return aa;
}
}
}
int lcm(int x, int y) {
int aa = x, bb = y;
rep(0, i, 1000) {
aa = aa % bb;
if (aa == 0) {
return x / bb * y;
}
bb = bb % aa;
if (bb == 0) {
return x / aa * y;
}
}
}
bool p(int x) {
if (x == 1)return false;
rep(2, i, sqrt(x) + 1) {
if (x % i == 0 && x != i) {
return false;
}
}
return true;
}
int max(int a, int b) {
if (a >= b)return a;
else return b;
}
string maxst(string s, string t) {
int n = s.size();
int m = t.size();
if (n > m)return s;
else if (n < m)return t;
else {
rep(0, i, n) {
if (s[i] > t[i])return s;
if (s[i] < t[i])return t;
}
return s;
}
}
string minst(string s, string t) {
int n = s.size();
int m = t.size();
if (n < m)return s;
else if (n > m)return t;
else {
rep(0, i, n) {
if (s[i] < t[i])return s;
if (s[i] > t[i])return t;
}
return s;
}
}
string string_reverse(string s){
int n=s.size();
string t;
rep(0,i,n)t+=s[n-i-1];
return t;
}
int min(int a, int b) {
if (a >= b)return b;
else return a;
}
int n2[41];
int nis[41];
int nia[41];
int mody[41];
int nn;
int com(int n, int y) {
int ni = 1;
for (int i = 0;i < 41;i++) {
n2[i] = ni;
ni *= 2;
}
int bunsi = 1, bunbo = 1;
rep(0, i, y)bunsi = (bunsi * (n - i)) % mod;
rep(0, i, y)bunbo = (bunbo * (i + 1)) % mod;
mody[0] = bunbo;
rep(1, i, 41) {
bunbo = (bunbo * bunbo) % mod;
mody[i] = bunbo;
}
rep(0, i, 41)nis[i] = 0;
nn = mod - 2;
for (int i = 40;i >= 0;i -= 1) {
if (nn > n2[i]) {
nis[i]++;
nn -= n2[i];
}
}
nis[0]++;
rep(0, i, 41) {
if (nis[i] == 1) {
bunsi = (bunsi * mody[i]) % mod;
}
}
return bunsi;
}
int gyakugen(int n, int y) {
int ni = 1;
for (int i = 0;i < 41;i++) {
n2[i] = ni;
ni *= 2;
}
mody[0] = y;
rep(1, i, 41) {
y = (y * y) % mod;
mody[i] = y;
}
rep(0, i, 41)nis[i] = 0;
nn = mod - 2;
for (int i = 40;i >= 0;i -= 1) {
if (nn > n2[i]) {
nis[i]++;
nn -= n2[i];
}
}
nis[0]++;
rep(0, i, 41) {
if (nis[i] == 1) {
n = (n * mody[i]) % mod;
}
}
return n;
}
int yakuwa(int n) {
int sum = 0;
rep(1, i, sqrt(n + 1)) {
if (n % i == 0)sum += i + n / i;
if (i * i == n)sum -= i;
}
return sum;
}
int poow(int y, int n) {
if (n == 0)return 1;
n -= 1;
int ni = 1;
for (int i = 0;i < 41;i++) {
n2[i] = ni;
ni *= 2;
}
int yy = y;
mody[0] = yy;
rep(1, i, 41) {
yy = (yy * yy) % mod;
mody[i] = yy;
}
rep(0, i, 41)nis[i] = 0;
nn = n;
for (int i = 40;i >= 0;i -= 1) {
if (nn >= n2[i]) {
nis[i]++;
nn -= n2[i];
}
}
rep(0, i, 41) {
if (nis[i] == 1) {
y = (y * mody[i]) % mod;
}
}
return y;
}
int minpow(int x, int y) {
int sum = 1;
rep(0, i, y)sum *= x;
return sum;
}
int ketawa(int x, int sinsuu) {
int sum = 0;
rep(0, i, 100)sum += (x % poow(sinsuu, i + 1)) / (poow(sinsuu, i));
return sum;
}
int sankaku(int a) {
return a * (a + 1) / 2;
}
int sames(int a[1111111], int n) {
int ans = 0;
rep(0, i, n) {
if (a[i] == a[i + 1]) {
int j = i;
while (a[j + 1] == a[i] && j <= n - 2)j++;
ans += sankaku(j - i);
i = j;
}
}
return ans;
}
using Graph = vector<vector<int>>;
int oya[114514];
int depth[114514];
void dfs(const Graph& G, int v, int p, int d) {
depth[v] = d;
oya[v] = p;
for (auto nv : G[v]) {
if (nv == p) continue;
dfs(G, nv, v, d + 1);
}
}
int XOR(int a, int b) {
if (a == 0 || b == 0) {
return a + b;
}
int ni = 1;
rep(0, i, 41) {
n2[i] = ni;
ni *= 2;
}
rep(0, i, 41)nis[i] = 0;
for (int i = 40;i >= 0;i -= 1) {
if (a >= n2[i]) {
nis[i]++;
a -= n2[i];
}
if (b >= n2[i]) {
nis[i]++;
b -= n2[i];
}
}
int sum = 0;
rep(0, i, 41)sum += (nis[i] % 2 * n2[i]);
return sum;
}
struct UnionFind {
vector<int> par;
UnionFind(int N) : par(N) {
for (int i = 0; i < N; i++) par[i] = i;
}
int root(int x) {
if (par[x] == x) return x;
return par[x] = root(par[x]);
}
void unite(int x, int y) {
int rx = root(x);
int ry = root(y);
if (rx == ry) return;
par[rx] = ry;
}
bool same(int x, int y) {
int rx = root(x);
int ry = root(y);
return rx == ry;
}
};
P x[214514];
int h[214514];
int sum[214514];
signed main(){
ic(n) ic(d) ic(a)
rep(0,i,n){
cin>>x[i].f>>x[i].s;
x[i].s=(x[i].s-1)/a+1;
}
sort(x,x+n);
rep(0,i,n)h[i]=x[i].f;
sum[0]=0;
int ans=0;
rep(0,i,n){
int l=low(h,n,h[i]-d-d);
x[i].s=max(0,x[i].s-(sum[i]-sum[l]));
ans+=x[i].s;
sum[i+1]=sum[i]+x[i].s;
}
c(ans)
} | 1 | 44,743,372 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
string s;
cin >> s;
string ans = "";
rep(i, s.size()) {
if (i % 2 == 0) ans += s[i];
}
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(){
string s;
int i;
cin>>s;
string t;
for(i=0;i<s.size();i=2+i){
t=t+s[i];
}
cout<<t<<endl;
} | 1 | 14,920,997 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define _cin ios_base::sync_with_stdio(0); cin.tie(0);
#define READ freopen("input.txt", "r", stdin);
#define WRITE freopen("output.txt", "w", stdout);
#define endl "\n"
#define pb push_back
#define rep(i,a,b) for(ll i=a;i<b;++i)
#define repd(i,a,b) for(ll i=a;i>=b;--i)
#define mp make_pair
#define hell 1000000007
#define vvll vector<vector<ll> >
#define vll vector<ll>
#define mll map<ll,ll>
#define sz(x) (ll)x.size()
#define sll set<ll>
#define pll pair<ll,ll>
#define F first
#define S second
const ll MAX = 1000004;
const ll INF = 1e18L + 5;
int main() {
_cin
ll n, k;
cin >> n >> k;
ll a[n + 1];
rep(i, 1, n + 1) cin >> a[i];
ll dp[n + 1][k + 1];
dp[0][0] = 1;
rep(i, 1, k + 1) dp[0][i] = 0;
rep(i, 1, n + 1) {
vll sum(k + 1, 0);
sum[0] = dp[i - 1][0] ;
rep(j, 1, k + 1) sum[j] = (sum[j - 1] + dp[i - 1][j]) % hell ;
rep(j, 0, k + 1) {
if (j <= a[i]) {
dp[i][j] = sum[j];
} else {
ll s = (j - a[i] - 1);
dp[i][j] = (sum[j] - sum[s] + hell) % hell ;
}
}
sum.clear();
}
cout << dp[n][k] % hell << endl;
} | #include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define ppb pop_back
#define mii map<ll int,ll int>
#define msi map<string,ll int>
#define mis map<ll int, string>
#define rep(i,a,b) for(ll int i=a;i<b;i++)
#define mpi map<pair<ll int,ll int>,ll int>
#define pii pair<ll int,ll int>
#define vi vector<ll int>
#define vii vector<pair<ll int, ll int>>
#define vs vector<string>
#define all(a) (a).begin(),(a).end()
#define F first
#define S second
#define lbnd lower_bound
#define ubnd upper_bound
#define bs binary_search
#define mp make_pair
using namespace std;
#define N 1000000007
#define MAXN 200005
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cout.precision(15);
ll int n,k;
cin>>n>>k;
vi a(n);
rep(i,0,n)
cin>>a[i];
ll int dp[n+1][k+1];
rep(i,0,n+1)
{
rep(j,0,k+1)
{
if(i==0 && j==0)
{dp[i][j]=1;}
else if(j==0)
{dp[i][j]=1;}
else if(i==0)
{dp[i][j]=0;}
else
{
dp[i][j]=dp[i][j-1]+dp[i-1][j];
if(j>a[i-1])
dp[i][j]-=dp[i-1][j-a[i-1]-1];
dp[i][j]=(dp[i][j]+N)%N;
}}}
cout<<dp[n][k];
} | 1 | 46,964,093 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long A, B, out=1000000000000000, tmp=0,d_A=0, d_B=0;
for (long long i = 1; i*i<=n; i++) {
A = i;
B = n / A;
if (n != A * B) continue;
string A_t = to_string(A);
string B_t = to_string(B);
d_A = A_t.length();
d_B = B_t.length();
tmp = max(d_A, d_B);
out = min(out, tmp);
}
cout << out << 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>;
using vec = vector<ll>;
using vecp = vector<P>;
using mat = vector<vec>;
using matp = vector<vecp>;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define all(v) v.begin(), v.end()
ll digit(ll n){
ll i=1;
while(n/(ll)pow(10,i)>0){
i++;
}
return i;
}
int main(){
ll N,ans=INF;
cin >> N;
for(ll i=1;i*i<=N;i++){
if(N%i==0){
ans=min(ans,max(digit(i),digit(N/i)));
}
}
cout << ans << endl;
} | 1 | 5,971,544 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll MOD=1000000007;
const ll MOD2=998244353;
const double PI=3.14159265358979;
const ll INF= pow(10,18);
typedef pair<ll,ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define rep(i,n) FOR(i,0,n)
string abc="abcdefghijklmnopqrstuvwxyz";
string ABC="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
struct edge{ll to,cost;};
int main() {
string s,t;
cin >> s >> t;
cout << t << s << endl;
} | #include<stdio.h>
int main(){
char a[150];
char b[150];
scanf("%s",&a);
scanf("%s",&b);
printf("%s%s", b,a);
return 0;
} | 1 | 76,729,732 |
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define repi(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,a) repi(i,0,a)
#define repdi(i,a,b) for(ll i=(a)-1;i>=(b);--i)
#define repd(i,a) repdi(i,a,0)
#define itr(it,a) for( auto it = (a).begin(); it != (a).end(); ++it )
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define endl '\n'
#define debug(x) std::cerr << #x << " = " << (x) << endl;
using ll = long long;
using Pr = std::pair<ll, ll>;
constexpr ll INF = 1ll<<60;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class S, class T>
std::ostream& operator<< ( std::ostream& out, const std::pair<S,T>& a )
{ std::cout << '(' << a.first << ", " << a.second << ')'; return out; }
template<class T>
std::ostream &operator<< ( std::ostream& out, const std::vector<T>& a )
{ std::cout << '['; rep( i, a.size() ){ std::cout << a[i]; if( i != a.size()-1 ) std::cout << ", "; } std::cout << ']'; return out; }
ll N, K;
ll R, S, P;
std::string T;
std::string vs[100010];
ll win( char ch, ll l ) {
if( ch == 'r' ) {
return l == 2 ? P : 0;
} else if( ch == 's' ) {
return l == 0 ? R : 0;
} else {
return l == 1 ? S : 0;
}
}
int main() {
std::cin >> N >> K >> R >> S >> P >> T;
rep( i, N ) {
vs[i%K] += T[i];
}
ll ans = 0;
rep( i, K ) {
std::vector<std::vector<ll>> dp( vs[i].size()+10, std::vector<ll>( 3, 0 ) );
rep( j, vs[i].size() ) rep( k, 3 ) rep( l, 3 ) {
if( l == k )
continue;
chmax( dp[j+1][l], dp[j][k]+(win(vs[i][j], l) ? win(vs[i][j], l) : 0) );
}
ll ma = 0;
rep( k, 3 )
chmax( ma, dp[vs[i].size()][k] );
ans += ma;
}
std::cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,cc,n) for(int i=cc;i<=n;++i)
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int R, S, P;
cin >> R >> S >> P;
string T;
cin >> T;
auto to_score = [=](char c)
{
if (c == 'r') return P;
if (c == 's') return R;
return S;
};
vector<bool> skipped(N, false);
int score = 0;
rep(i,0,N-1)
{
if (i < K)
score += to_score(T[i]);
else
{
if (T[i] == T[i-K] && !skipped[i-K])
skipped[i] = true;
else
score += to_score(T[i]);
}
}
cout << score << endl;
return 0;
} | 1 | 28,533,093 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
for(int a=0; a<N; a++){
for(int b=0; b<N; b++){
int total = 4*a + 7*b;
if(total == N){
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No" << endl;
} | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1000000007
using namespace std;
int main(){
int n;
cin >> n;
int ans[110];
rep(i,110)ans[i] = 0;
rep(i,26){
rep(j,15){
if(i*4 + j*7 <= 100)ans[i*4+j*7] = 1;
}
}
if(ans[n] == 1)cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | 1 | 39,825,416 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define Scd(x) scanf("%d", &x)
#define Scd2(x,y) scanf("%lld%lld", &x, &y)
#define Scd3(x,y,z) scanf("%d%d%d", &x, &y, &z)
#define Scll(x) scanf("%llu", &x)
#define Scll2(x,y) scanf("%llu%llu", &x, &y)
#define Scll3(x,y,z) scanf("%llu%llu%llu", &x, &y, &z)
#define Scc(c) scanf("%c", &c);
#define Scs(s) scanf("%s", s);
#define Scstr(s) scanf("%s", &s);
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define Rep(x,y) for(int x = 0; x < y; x++)
#define Repe(x,y,z) for(int x = z; x < y; x++)
#define YesNo(a) (a)?printf("Yes\n"):printf("No\n");
int main() {
int n;
ll x[1000] = {},y[1000];
ll leng[1000];
Scd(n);
Rep(i,n){
Scd2(x[i],y[i]);
leng[i] = abs(x[i]) + abs(y[i]);
}
int odd = leng[0] % 2;
Rep(i,n){
if(leng[i] % 2 != odd){
printf ("%d\n", -1);
return 0;
}
}
int ans = 31;
ans += !odd;
printf ("%d\n", ans);
ans -= !odd;
if(!odd) printf ("%d ", 1);
ll longer[32] = {1};
Rep(i,ans){
printf("%lld", longer[i]);
if( i+1 != ans) {
printf (" ");
longer[i+1] = longer[i];
longer[i+1] *= 2;
}
}
printf ("\n");
ans += !odd;
ll pow31 = 1;
Rep(i,31) pow31*=2;
ll u[1000],v[1000];
Rep(i,n){
if(!odd) x[i]--;
u[i] = x[i] + y[i];
v[i] = x[i] - y[i];
u[i] = (u[i] + (pow31 - 1)) / 2;
v[i] = (v[i] + (pow31 - 1)) / 2;
ll xx = 0;
ll yy = 0;
Rep(j,ans){
if( !odd && j == 0) {printf ("R"); xx++ ;continue;}
if( u[i] % 2 && v[i] % 2){
printf ("R");
xx += longer[j-!odd];
}else if( u[i] % 2 == 0 && v[i] % 2){
printf ("D");
yy -= longer[j-!odd];
}else if( u[i] % 2 && v[i] % 2 == 0 ){
printf ("U");
yy += longer[j-!odd];
}else{
printf ("L");
xx -= longer[j-!odd];
}
u[i] /= 2;
v[i] /= 2;
}
printf ("\n");
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
int N;
ll X[1001],Y[1001],P[1001];
ll M;
ll V[40];
void solve() {
int i,j,k,l,r,x,y; string s;
cin>>N;
FOR(i,N) {
cin>>X[i]>>Y[i];
P[i]=(abs(X[i])+abs(Y[i]))%2;
if(P[i]!=P[0]) return _P("-1\n");
}
M=32;
FOR(i,32) {
V[i]=1LL<<(31-i);
}
if(P[0]==0) V[M++]=1;
cout<<M<<endl;
FOR(i,M) {
cout<<V[i]<<" ";
}
cout<<endl;
FOR(i,N) {
string S;
FOR(j,M) {
if(abs(X[i])>=abs(Y[i])) {
if(X[i]>=0) {
S+='R';
X[i]-=V[j];
}
else {
S+='L';
X[i]+=V[j];
}
}
else {
if(Y[i]>=0) {
S+='U';
Y[i]-=V[j];
}
else {
S+='D';
Y[i]+=V[j];
}
}
}
cout<<S<<endl;
}
}
int main(int argc,char** argv){
string s;int i;
if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
cout.tie(0); solve(); return 0;
} | 1 | 100,910,021 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main(){
int A,B;
cin>>A>>B;
if(A!=1&&B!=1){
if(A>B){cout<<"Alice"<<endl;}
else if(A<B){cout<<"Bob"<<endl;}
else{cout<<"Draw"<<endl;}}
else{if(A==1&&B!=1){cout<<"Alice"<<endl;}
else if(A!=1&&B==1){cout<<"Bob"<<endl;}
else if(A==1&&B==1){cout<<"Draw"<<endl;}}
return 0;
} | #include <iostream>
#include <iomanip>
#include <utility>
#include <cmath>
#include <random>
#include <vector>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <algorithm>
using namespace std;
#define rep(i,n) for(int i = 0; i<n; ++i)
#define REP(i,n) for(int i = 1; i<=n; ++i)
#define all(x) begin(x),end(x)
#define show(obj) {for(auto x:obj)cout<<x<<' ';cout<<endl;}
#define line "----------"
typedef long long ll;
typedef pair<int,int> P;
const int inf = 1001001000;
const ll INF = 1LL<<60;
const ll MOD = 1e9 + 7;
int main(){
int a,b;cin>>a>>b;
if(a == 1)a = 14;
if(b == 1)b = 14;
if(a>b){
cout<<"Alice"<<endl;
}else if(a == b){
cout<<"Draw"<<endl;
}else{
cout<<"Bob"<<endl;
}
return 0;
} | 1 | 78,098,382 |
#define TEMPLATE_USED
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll,ll> pl;
typedef vector<pl> vp;
const ll INF=1001001001;
const ll LINF=1001001001001001001;
const ll D4[]={0,1,0,-1,0};
const ll D8[]={0,1,1,0,-1,-1,1,-1,0};
#define _overload3(_1,_2,_3,name,...) name
#define _rep2(i,n) for(ll i=0;i<(n);++i)
#define _rep3(i,a,b) for(ll i=(ll)(a);i<(ll)(b);++i)
#define rep(...) _overload3(__VA_ARGS__,_rep3,_rep2)(__VA_ARGS__)
#define _repe2(i,n) for(ll i=0;i<=(ll)(n);++i)
#define _repe3(i,a,b) for(ll i=(ll)(a);i<=(ll)(b);++i)
#define repe(...) _overload3(__VA_ARGS__,_repe3,_repe2)(__VA_ARGS__)
#define _rrep2(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define _rrep3(i,a,b) for(ll i=(ll)(b)-1;i>=(ll)(a);i--)
#define rrep(...) _overload3(__VA_ARGS__,_rrep3,_rrep2)(__VA_ARGS__)
#define _rrepe2(i,n) for(ll i=(ll)(n);i>=0;i--)
#define _rrepe3(i,a,b) for(ll i=(ll)(b);i>=(ll)(a);i--)
#define rrepe(...) _overload3(__VA_ARGS__,_rrepe3,_rrepe2)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
template<class T>
bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}return 0;}
template<class T>
bool chmin(T &a,const T &b){if(b<a){a=b;return 1;}return 0;}
template<class T>
using pq=priority_queue<T,vector<T>,greater<T>>;
vl H;
vl M;
ll K;
void solve();
int main(){
cin.tie(0);
ios::sync_with_stdio(0);
H = vl(2);
M = vl(2);
for(int i = 0; i < 2; ++i){
cin >> H[i];
cin >> M[i];
}
cin >> K;
solve();
}
void solve(){
ll t=H[1]*60+M[1]-(H[0]*60+M[0]);
cout<<t-K<<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, ll> Pil;
int H1, M1, H2, M2, K;
int main() {
cin >> H1 >> M1 >> H2 >> M2 >> K;
int wake = (H2 - H1) * 60 + (M2 - M1);
cout << wake - K << endl;
return 0;
} | 1 | 65,204,109 |
#include <bits/stdc++.h>
#define int long long
using namespace std;
class UnionFind {
private:
vector<int> data;
bool isSame(int x, int y) { return find(x) == find(y); }
bool doUnite(int x, int y) {
x = find(x), y = find(y);
if (x == y)
return (false);
if (data[x] > data[y])
swap(x, y);
data[x] += data[y];
data[y] = x;
return (true);
}
int getFind(int k) {
if (data[k] < 0)
return (k);
return (data[k] = find(data[k]));
}
int getSize(int k) { return (-data[find(k)]); }
public:
UnionFind(int N) { data.resize(N, -1); }
int same(int x, int y) { return isSame(x, y); }
bool unite(int x, int y) { return doUnite(x, y); }
int find(int k) { return getFind(k); }
int size(int k) { return getSize(k); }
};
signed main() {
int N, M;
cin >> N >> M;
UnionFind uf(N);
for (int i = 0; i < M; i++) {
int a, b;
cin >> a >> b;
a--;
b--;
uf.unite(a, b);
}
map<int, int> mp;
for (int i = 0; i < N; i++) {
mp[uf.find(i)]++;
}
int mx = 1;
for (int i = 0; i < N; i++) {
mx = max(mx, mp[i]);
}
cout << mx << endl;
return 0;
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <queue>
using namespace std;
const int dx[4] = { 1,0,-1,0 };
const int dy[4] = { 0,-1,0,1 };
const int LIT = 1e9 + 7;
int n, m;
vector<int> Map[200001];
set<pair<int, int>> s;
void solve() {
cin >> n >> m;
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
if (a > b) swap(a, b);
if (s.count({ a,b }) == 0) {
s.insert({ a,b });
Map[a].push_back(b);
Map[b].push_back(a);
}
}
vector<bool> bfs_visited(n + 1, false);
int ans = 0;
for (int i = 1; i <= n; i++) {
int cnt = 1;
if (!bfs_visited[i]) {
queue<int>q;
q.push(i);
bfs_visited[i] = true;
while (!q.empty()) {
int cur = q.front();
q.pop();
for (int j = 0; j < Map[cur].size(); j++) {
if (!bfs_visited[Map[cur][j]]) {
bfs_visited[Map[cur][j]] = true;
cnt++;
q.push(Map[cur][j]);
}
}
}
}
ans = max(ans, cnt);
}
cout << ans;
}
int main() {
cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(false);
solve();
return 0;
} | 1 | 81,649,706 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int r;
cin >> r;
cout << r * r << endl;
return 0;
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
#include <fstream>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
cout << n * n;
} | 1 | 19,914,435 |
#include "bits/stdc++.h"
#include <set>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define all(i) (i).begin(), (i).end()
#define rall(i) (i).begin(), (i).end(), greater<int>()
#define int long long
#define elif else if
#define eb emplace_back
#define pb push_back
#define mp make_pair
#define fst first
#define sec second
#define mod 1000000007
#define INF 10e10
template <typename T>
void print(T x)
{
std::cout << x << " ";
}
template <typename T>
void println(T x)
{
std::cout << x << "\n";
}
bool compare_by_b(pair<int, int> a, pair<int, int> b) {
if (a.second != b.second) {
return a.second < b.second;
}
else {
return a.first < b.first;
}
}
signed main(void) {
string s;
cin >> s;
int index = s.size();
while (true) {
if (index <= 0) {
print("YES");
return 0;
}
else if (s.substr(index - 5, 5) == "dream" || s.substr(index - 5, 5) == "erase") {
index -= 5;
}
else if (s.substr(index - 6, 6) == "eraser") {
index -= 6;
}
else if (s.substr(index - 7, 7) == "dreamer") {
index -= 7;
}
else {
print("NO");
return 0;
}
}
} | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main() {
string s;
cin >> s;
reverse(s.begin(), s.end());
string dream = "dream";
string dreamer = "dreamer";
string erase = "erase";
string eraser = "eraser";
reverse(dream.begin(), dream.end());
reverse(dreamer.begin(), dreamer.end());
reverse(erase.begin(), erase.end());
reverse(eraser.begin(), eraser.end());
int i;
for (i = 0; i < s.size(); i++) {
if (dream == s.substr(i,5)) {
i += 4;
continue;
}
else if (dreamer == s.substr(i,7)) {
i += 6;
continue;
}
else if (erase == s.substr(i,5)) {
i += 4;
continue;
}
else if (eraser == s.substr(i,6)) {
i += 5;
continue;
}
else {
break;
}
}
if (i == s.size()) cout << "YES" << endl;
else cout << "NO" << endl;
} | 1 | 3,856,283 |
#include <fstream>
#include <numeric>
#include <unordered_set>
#include <sstream>
#include <cassert>
#include <tuple>
#include <iomanip>
#include <random>
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <chrono>
#include <stack>
#include <string>
#include <bitset>
#include <unordered_map>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
using namespace std;
#define ll long long
const int N = (ll)(2e5) + 100;
int ptr = 0;
void solve() {
ll n,m;cin >> n >> m;
ll maxi = 0;
ll a[n + 1][3];
for (int i = 1;i <= n;i ++) {
for (int j = 0;j < 3;j ++) {
cin >> a[i][j];
}
}
ll res = 0;
for (int k = 0;k < 8;k ++) {
vector<ll> _sum;
for (int i = 1;i <= n;i ++) {
ll cur = 0;
for (int j = 0;j < 3;j ++) {
if (k & (1 << j)) cur += a[i][j];
else cur -= a[i][j];
}
_sum.push_back(cur);
}
ll now = 0;
sort(_sum.begin(), _sum.end());
reverse(_sum.begin(), _sum.end());
for (int i = 0;i < m;i ++) {
now += _sum[i];
}
res = max(res, now);
}
cout << res << "\n";
}
void test() {
}
int main() {
freopen("debug.txt", "w", stderr);
solve();
return 0;
} | #include <bits/stdc++.h>
#include<algorithm>
#define int long long
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1000000000000
signed main()
{
int n,k;
cin>>n>>k;
vector<int>x(n);
vector<int>y(n);
vector<int>z(n);
vector<int>s(n);
rep(i,n){
cin>>x[i]>>y[i]>>z[i];
}
int M=0;
for(int i=0;i<=7;i++){
int a,b,c;
a=i%2;
c=i/4;
b=(i-a-c*4)/2;
rep(i,n){
s[i]=x[i]*pow(-1,a)+y[i]*pow(-1,b)+z[i]*pow(-1,c);
}
sort(s.begin(),s.end());
int tmp=0;
for(int i=n-k;i<=n-1;i++){
tmp+=s[i];
}
M=max(M,tmp);
}
cout<<M;
} | 1 | 3,044,897 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#define int ll
typedef pair<int,int> pii;
#define fi first
#define se second
#define Sort(a) sort(a.begin(),a.end())
#define rep(i,n) for(int i = 0;i < (n) ; i++)
#define REP(i,n) for(int i = 0;i < (n) ; i++)
#define MP(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define INF LLONG_MAX/4
#define INTINF INT_MAX/2
#define all(x) (x).begin(),(x).end()
#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 true;}return false;}
template<class T> inline bool chmin(T &a, T b){if(a > b){a = b;return true;}return false;}
const int MOD = 1000000007;
signed main(){
int n;
cin >> n;
int a[100100] = {};
for(int i = 1;i <= n;i++)cin >> a[i];
int cnt = 0;
int c = 1;
rep(i,n+1){
c = a[c];
cnt++;
if(c == 2){
cout << cnt << endl;
return 0;
}
}
cout << -1 << endl;
return 0;
} | #include <iostream>
#include <vector>
#include <set>
#include <map>
#include <string>
#include <cstdio>
#include <cstdlib>
#include <climits>
#include <utility>
#include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
#include <iomanip>
using namespace std;
#define int long long
#define f(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) f(i,0,n)
#define csl ios_base::sync_with_stdio(false);cin.tie(NULL)
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vi vector<int>
#define mii map<int,int>
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
int32_t main()
{
csl;
int n;
cin >> n;
int arr[n];
for(int i=0;i<n;i++) cin >> arr[i];
bool v[n];
for(int i=0;i<n;i++) v[i]=false;
int count=0;
int i=0;
while(true)
{
if(i==1)
{
break;
}
if(v[i]==false)
{
v[i]=true;
count++;
i = arr[i]-1;
}
else
{
count=-1;
break;
}
}
cout << count << "\n";
} | 1 | 98,910,595 |
#include <bits/stdc++.h>
using namespace std;
#define MP make_pair
#define PB push_back
#define ALL(x) (x).begin(),(x).end()
#define REP(i,n) for(int i=0;i<(n);i++)
#define REP1(i,n) for(int i=1;i<(n);i++)
#define REP2(i,d,n) for(int i=(d);i<(n);i++)
#define RREP(i,n) for(int i=(n);i>=0;i--)
#define CLR(a) memset((a),0,sizeof(a))
#define MCLR(a) memset((a),-1,sizeof(a))
#define RANGE(x,y,maxX,maxY) (0 <= (x) && 0 <= (y) && (x) < (maxX) && (y) < (maxY))
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<int> VI;
typedef vector<VI > VVI;
typedef vector<string> VS;
typedef vector<LL> VLL;
typedef pair<int,int> PII;
const int INF = 0x3f3f3f3f;
const LL INFL = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-9;
const int DX[]={1,0,-1,0},DY[]={0,-1,0,1};
void solve(long long a, long long b){
cout << (a <= b ? "unsafe" : "safe") << endl;
}
int main(){
long long a;
scanf("%lld",&a);
long long b;
scanf("%lld",&b);
solve(a, b);
return 0;
} | #include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
typedef long long ll;
int main() {
int s,w; cin >> s >> w;
if (s <= w) cout << "unsafe\n";
else cout << "safe\n";
} | 1 | 47,240,278 |
#include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <ctype.h>
#include <math.h>
using namespace std;
int main ()
{
int x;
cin >> x;
if(x==25)
{
cout << "Christmas" << endl;
}
else if(x==24)
{
cout << "Christmas Eve" << endl;
}
else if(x==23)
{
cout << "Christmas Eve Eve" << endl;
}
else
{
cout << "Christmas Eve Eve Eve" << endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
string k[30];
k[25] = "Christmas";
k[24] = "Christmas Eve";
k[23] = "Christmas Eve Eve";
k[22] = "Christmas Eve Eve Eve";
int d;
cin>>d;
cout<<k[d]<<endl;
} | 1 | 51,350,458 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int _ = 2003;
int X[_] , Y[_] , len[_] , N , M , all , sum;
void work(int p , int q){
int x = p + q , y = p - q , nposx = (all + x) / 2 , nposy = (all + y) / 2;
for(int i = 0 ; i < M ; ++i){
int flgx = (nposx >> i & 1) || nposx == all , flgy = (nposy >> i & 1) || nposy == all;
switch(flgx * 2 + flgy){
case 3: putchar('R'); break;
case 2: putchar('U'); break;
case 1: putchar('D'); break;
case 0: putchar('L'); break;
}
}
}
signed main(){
cin >> N;
for(int i = 1 ; i <= N ; ++i){
cin >> X[i] >> Y[i]; all = max(all , max(abs(X[i] + Y[i]) , abs(X[i] - Y[i])));
if(i != 1 && ((X[i] + Y[i] + X[i - 1] + Y[i - 1]) & 1)){puts("-1"); return 0;}
}
int sum = 0; for(int i = 0 ; sum <= all ; ++i) sum += (len[++M] = 1 << i);
if((all - sum) & 1){len[++M] = 1; ++sum;}
all = sum; printf("%lld\n" , M);
for(int i = 1 ; i <= M ; ++i) printf("%lld " , len[i]);
putchar('\n'); for(int i = 1 ; i <= N ; ++i , putchar('\n')) work(X[i] , Y[i]);
return 0;
} | #include <cstdio>
typedef long long ll;
const int MAXN = 1000;
ll X[MAXN + 5], Y[MAXN + 5]; int N;
ll abs(ll x) {
return x >= 0 ? x : -x;
}
int main() {
scanf("%d", &N);
for(int i=1;i<=N;i++)
scanf("%lld%lld", &X[i], &Y[i]);
int type = ((X[1] + Y[1]) & 1);
for(int i=1;i<=N;i++) {
if( type != ((X[i] + Y[i]) & 1) ) {
type = -1;
break;
}
}
if( type == -1 ) {
puts("-1");
return 0;
}
else if( type == 0 ) {
printf("%d\n%d", 40, 1);
for(int i=0;i<39;i++)
printf(" %lld", (1LL<<i));
puts("");
for(int i=1;i<=N;i++) {
putchar('L'), X[i]++;
for(int j=0;j<38;j++) {
ll t1 = (1LL << j), t2 = (1LL << (j + 1)), t3 = (1LL << (j + 2));
if( abs(X[i] % t2) == t1 ) {
if( abs(Y[i] % t3) + abs((X[i] + t1) % t3) == t2 )
putchar('L'), X[i] += t1;
else putchar('R'), X[i] -= t1;
}
else {
if( abs(X[i] % t3) + abs((Y[i] + t1) % t3) == t2 )
putchar('D'), Y[i] += t1;
else putchar('U'), Y[i] -= t1;
}
}
ll t1 = (1LL << 38), t2 = (1LL << 39), t3 = (1LL << 40);
if( abs(X[i] % t2) == t1 ) {
if( abs(Y[i] % t3) + abs((X[i] + t1) % t3) == t2 )
puts("R"), X[i] -= t1;
else puts("L"), X[i] += t1;
}
else {
if( abs(X[i] % t3) + abs((Y[i] + t1) % t3) == t2 )
puts("U"), Y[i] -= t1;
else puts("D"), Y[i] += t1;
}
}
}
else {
printf("%d\n", 40);
for(int i=0;i<40;i++)
printf("%lld ", (1LL<<i));
puts("");
for(int i=1;i<=N;i++) {
for(int j=0;j<39;j++) {
ll t1 = (1LL << j), t2 = (1LL << (j + 1)), t3 = (1LL << (j + 2));
if( abs(X[i] % t2) == t1 ) {
if( abs(Y[i] % t3) + abs((X[i] + t1) % t3) == t2 )
putchar('L'), X[i] += t1;
else putchar('R'), X[i] -= t1;
}
else {
if( abs(X[i] % t3) + abs((Y[i] + t1) % t3) == t2 )
putchar('D'), Y[i] += t1;
else putchar('U'), Y[i] -= t1;
}
}
ll t1 = (1LL << 39), t2 = (1LL << 40), t3 = (1LL << 41);
if( abs(X[i] % t2) == t1 ) {
if( abs(Y[i] % t3) + abs((X[i] + t1) % t3) == t2 )
puts("R"), X[i] -= t1;
else puts("L"), X[i] += t1;
}
else {
if( abs(X[i] % t3) + abs((Y[i] + t1) % t3) == t2 )
puts("U"), Y[i] -= t1;
else puts("D"), Y[i] += t1;
}
}
}
} | 1 | 56,992,900 |
#include <iostream>
#include <algorithm>
using namespace std;
long long s[4];
int main(int argc, char** argv) {
long long a,b,c,d;
cin>>a>>b>>c>>d;
s[0]=a*c;
s[1]=a*d;
s[2]=b*c;
s[3]=b*d;
sort(s,s+4);
cout<<s[3];
return 0;
} | #include<bits/stdc++.h>
#define ls ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long
#define __ <<" "<<
#define loop(m,n) for(m=0;m<n;m++)
#define rloop(m,n) for(m=n-1;m>=0;m--)
#define case(z) "Case " << z++ << ": "
#define yes cout << "YES" << endl
#define no cout << "NO" << endl
#define newline cout<<endl
#define quit return 0
using namespace std;
int power(int x, unsigned int y, int p)
{
int res = 1;
x = x % p;
while (y > 0)
{
if (y & 1)
res = (res*x) % p;
y = y>>1;
x = (x*x) % p;
}
return res;
}
bool miillerTest(int d, int n)
{
int a = 2 + rand() % (n - 4);
int x = power(a, d, n);
if (x == 1 || x == n-1)
return true;
while (d != n-1)
{
x = (x * x) % n;
d *= 2;
if (x == 1) return false;
if (x == n-1) return true;
}
return false;
}
bool isprime(int n, int k)
{
if (n <= 1 || n == 4) return false;
if (n <= 3) return true;
int d = n - 1;
while (d % 2 == 0)
d /= 2;
for (int i = 0; i < k; i++)
if (!miillerTest(d, n))
return false;
return true;
}
int main()
{
ls
ll int a,b,c,d,sum=1;
cin >> a >> b >> c >> d ;
sum=b*d;
if(sum<a*d) sum=a*d;
if(sum<a*c) sum=a*c;
if(sum<b*c) sum=b*c;
cout << sum ;
quit;
} | 1 | 54,807,784 |
#include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
#include <functional>
#include <cmath>
#include <set>
#include <queue>
#include <deque>
#include <vector>
#include <climits>
#include <sstream>
#include <iomanip>
#include <map>
#include <stack>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
ll func(ll n)
{
auto temp = (n + 1) / 2 % 2;
if (n % 2 == 0)
{
temp ^= n;
}
return temp;
}
int main()
{
ll A, B;
cin >> A >> B;
cout << (func(A - 1) ^ func(B)) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1999999999
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define MODA 1000000007
int main() {
ll ans = 0;
ll tmp;
ll a[2];
cin >> a[0] >> a[1];
a[1]++;
ll x[2];
REP(i,40){
REP(j, 2){
ll sh = a[j] / ((ll)1 << (i+1));
ll mo = a[j] % ((ll)1 << (i+1));
x[j] = sh * ((ll)1 << (i));
x[j] %= 2;
tmp = max((ll)0, mo - ((ll)1 << (i)));
x[j] += tmp;
x[j] %= 2;
}
ans += (x[0] ^ x[1]) * ((ll)1 << (i));
}
cout << ans << endl;
} | 1 | 24,110,207 |
#include <iostream>
#include <string>
using namespace std;
int main(){
string t,h ;
int n,tl,hl,tp,hp;
tp=0;
hp=0;
cin >> n;
for(int i = 0; i< n; ++i){
cin >> t >> h;
tl = t.size();
hl = h.size();
for(int j=0; j < tl && j < hl;j++){
if(t[j] > h[j]){
tp += 3;
break;
}
else if(t[j]<h[j]){
hp +=3;
break;
}
else
if(j==tl-1 || j ==hl-1){
if(tl==hl){
tp+=1;
hp+=1;
}
else if (tl > hl){
tp+=3;
}
else{
hp+=3;
}
}
}
}
cout << tp <<" "<< hp <<endl;
return 0;
} | #include<iostream>
#include<string>
using namespace std;
int main(){
int n, a = 0, b = 0;
string s1, s2;
cin >> n;
for( int i = 0; i < n; i++){
cin >> s1 >> s2;
if( s1 == s2){
a += 1;
b += 1;
} else if( s1 > s2){
a += 3;
} else if( s1 < s2){
b += 3;
}
}
cout << a << " " << b << endl;
return 0;
} | 1 | 92,243,172 |
#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using P=pair<ll,ll>;
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=998244353;
int 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(5);}} __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; }
int main(){
ll n;
cin>>n;
bool able=false;
V<ll> a(n);
for(int i=0;i<n;i++){
cin>>a[i];
if(a[i]>=n)able=true;
}
if(!able){
cout<<0<<"\n";
return 0;
}
ll bfo=0,inc=0;
ll ans=0;
while(1){
bfo=inc;
inc=0;
able=false;
for(int i=0;i<n;i++){
if(bfo+a[i]>=n){
able=true;
ll d=(bfo+a[i])/n;
inc+=d;
a[i]=(bfo+a[i])%n;
a[i]-=d;
}else{
a[i]+=bfo;
}
}
ans+=inc;
if(!able)break;
}
cout<<ans<<"\n";
} | #include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <algorithm>
#include <set>
#include <map>
#define vv(a, b, c, d) vector<vector<d> >(a, vector<d>(b, c))
#define vvi std::vector<std::vector<int> >
#define vvl std::vector<std::vector<ll> >
#define MODs 1000000007;
typedef unsigned long long int ll;
using namespace std;
int main(int argc, char const *argv[]) {
ll N, S=0, ans = 0;
std::cin >> N;
bool flag = false;
std::vector<ll> A(N);
for(int i=0;i<N;i++){
std::cin >> A[i];
if(A[i]>10000) {
flag = true;
ll tmp = A[i];
if(A[i]>=51*(N+1))A[i] = (A[i]%(51*(N+1))==0?(51*(N+1)):A[i]%(51*(N+1)));
S+=tmp-A[i];
}
}
if(flag){
while(true){
ll ma=N-1, mai=-1;
for(int i=0;i<N;i++) if(ma<A[i]) ma=A[i], mai=i;
if(mai==-1) break;
ans++;
for(ll i=0;i<N;i++) {
if(i==mai) A[i]-=N;
else A[i]++;
}
}
std::cout << S + ans << '\n';
}else{
while(true){
ll ma=N-1, mai=-1;
for(ll i=0;i<N;i++) if(ma<A[i]) ma=A[i], mai=i;
if(mai==-1) break;
ans++;
for(ll i=0;i<N;i++) {
if(i==mai) A[i]-=N;
else A[i]++;
}
}
std::cout << ans << '\n';
}
return 0;
} | 1 | 100,434,811 |
#include<iostream>
#include<vector>
#include<string>
using namespace std;
int main() {
int n;
while (cin >> n){
if (n == 0)break;
vector<pair<char, char> >l;
string s;
for (int i = 0; i < n; i++){
pair<char, char>c;
cin >> c.first >> c.second;
l.push_back(c);
}
cin >> n;
for (int i = 0; i < n; i++){
char c; cin >> c;
for (int i = 0; i < l.size(); i++){
if (c==l[i].first){
c = l[i].second;
goto h;
}
}
h:
s += c;
}
cout << s << endl;
}
} | #include<bits/stdc++.h>
using namespace std;
map<char,char> ma;
int main(){
ios_base::sync_with_stdio(false);
int n,m;
char a,b;
while(1){
cin >> n;
if(n==0) break;
for(int i=0;i<n;i++){
cin >> a >> b;
ma[a]=b;
}
cin >> m;
char temp;
for(int i=0;i<m;i++){
cin >> temp;
if(ma[temp]!=0){
cout << ma[temp];
}else{
cout << temp;
}
}
cout << endl;
ma.clear();
}
return 0;
} | 1 | 95,990,216 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep1(i, n) for (ll i = 1; i <= (ll)(n); i++)
#define INF 10000000000
#define MOD 1000000007
using ll = long long;
using Graph = vector<vector<ll>>;
ll dp[100100][2];
vector<ll> dist;
ll rec(int v, int color, const Graph &G){
if(dp[v][color]!=-1) return dp[v][color];
ll res = 1;
for(auto nv : G[v]){
ll tmp = 0;
if(dist[nv]==dist[v]+1){
if(!color) (tmp += rec(nv,1,G)) %= MOD;
(tmp += rec(nv,0,G)) %= MOD;
tmp %= MOD;
if(tmp!=0) (res *= tmp) %= MOD;
}
}
res %= MOD;
return dp[v][color] = res;
}
int main(){
int N; cin>>N;
dist.resize(N,-1);
Graph G(N);
rep(i,N-1){
int x,y; cin>>x>>y;
x--;y--;
G[x].push_back(y); G[y].push_back(x);
}
queue<int> Q;
dist[0] = 0;
Q.push(0);
while(!Q.empty()){
ll v = Q.front(); Q.pop();
for(auto nv: G[v]){
if(dist[nv]!=-1) continue;
dist[nv] = dist[v] + 1;
Q.push(nv);
}
}
rep(i,100100)rep(j,2)dp[i][j] = -1;
ll res = rec(0,0,G);
res += rec(0,1,G);
res %= MOD;
cout<<res<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int,int>
#define mii map<pii,int>
#define all(a) (a).begin(),(a).end()
#define f first
#define s second
#define sz(x) (int)x.size()
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rep0(a,n) for(int i=0;i<n;i++)cin>>a[i]
#define si(x) cin>>x
#define sii(x,y) cin>>x>>y
#define siii(x,y,z) cin>>x>>y>>z
#define ahell 998244353
#define hell 1000000007
#define N 1000001
#define fl 1.0000000000
#define cntbit(a) __builtin_popcountl(a)
#define ios ios_base::sync_with_stdio(false); cin.tie(NULL);
using namespace std;
vector<int>adj[100005];
int dp[2][100005];
void func(int v,int parent)
{
int flg=0,t1=1,t2=1;
for(auto x:adj[v])
{
if(x!=parent)
{
flg++;
func(x,v);
}
}
for(auto x:adj[v])
{
if(x!=parent)
{
t1*=(dp[1][x]);
t1%=hell;
t2*=(dp[0][x]+dp[1][x]);
t2%=hell;
}
}
dp[0][v]=t1;
dp[1][v]=t2;
return;
}
main()
{
ios
int n,m,i;
int j;
int u,v,q;
int test=1;
while(test--)
{
cin>>n;
int x[n],y[n];
for(i=0;i<n-1;i++)
{
cin>>x[i]>>y[i];
adj[x[i]].push_back(y[i]);
adj[y[i]].push_back(x[i]);
}
func(1,0);
cout<<(dp[0][1]+dp[1][1])%hell;
}
} | 1 | 22,744,433 |
#include <bits/stdc++.h>
using namespace std;
int main(){int a,b; cin>>a>>b; cout<<(a-2)/(b-1)+1;} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);
typedef vector<int> vec;
ll mod_pow(ll a, ll n, ll m) {
ll res = 1;
while (n) {
if (n & 1)res = res * a%m;
a = a * a%m; n >>= 1;
}
return res;
}
struct modint {
ll n;
modint() :n(0) { ; }
modint(ll m) :n(m) {
if (n >= mod)n %= mod;
else if (n < 0)n = (n%mod + mod) % mod;
}
operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
if (n == 0)return modint(1);
modint res = (a*a) ^ (n / 2);
if (n % 2)res = res * a;
return res;
}
ll inv(ll a, ll p) {
return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
const int max_n = 1 << 18;
modint fact[max_n], factinv[max_n];
void init_f() {
fact[0] = modint(1);
for (int i = 0; i < max_n - 1; i++) {
fact[i + 1] = fact[i] * modint(i + 1);
}
factinv[max_n - 1] = modint(1) / fact[max_n - 1];
for (int i = max_n - 2; i >= 0; i--) {
factinv[i] = factinv[i + 1] * modint(i + 1);
}
}
modint comb(int a, int b) {
if (a < 0 || b < 0 || a < b)return 0;
return fact[a] * factinv[b] * factinv[a - b];
}
using mP = pair<modint, modint>;
int dx[4] = { 0,1,0,-1 };
int dy[4] = { 1,0,-1,0 };
void solve() {
int N, K; cin >> N >> K;
vec a(N); rep(i, N) cin >> a[i];
cout << (N-1 + K-2)/(K-1) << endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
solve();
return 0;
} | 1 | 21,720,388 |
#include <iostream>
const int MAXN = (int)1e6 + 1;
int count[MAXN];
int solve(int n) {
int ans = 0;
for (int i = 2; i < MAXN; ++i) {
int num_of_mul = 0;
for (int j = i; j < MAXN; j += i) {
num_of_mul += count[j];
}
if (num_of_mul == n) return 2;
if (num_of_mul > 1) ans = 1;
}
return ans;
}
int main() {
int n;
std::cin >> n;
for (int i = 0, in; i < n; ++i) {
std::cin >> in;
++count[in];
}
int ans = solve(n);
if (ans == 0) {
std::cout << "pairwise coprime" << std::endl;
} else if (ans == 1) {
std::cout << "setwise coprime" << std::endl;
} else {
std::cout << "not coprime" << std::endl;
}
return 0;
} | #include <bits/stdc++.h>
#define endl "\n"
#define ll long long
using namespace std;
int sp[int(1e6)+1];
int main(){
cin.tie(0) -> sync_with_stdio(0);
int n;
cin >> n;
int a[n];
for(int i = 0; i < n; i++)
cin >> a[i];
int gcd = a[0];
for(int i = 1; i < n; i++)
gcd = __gcd(gcd, a[i]);
if(gcd > 1){
cout << "not coprime" << endl;
return 0;
}
memset(sp, 0, sizeof(sp));
for(int i = 2; i < int(1e6)+1; i++)
if(!sp[i])
for(int j = i; j < int(1e6)+1; j+=i)
if(!sp[j])
sp[j] = i;
bool primes[int(1e6)];
memset(primes, 0, sizeof(primes));
for(int i = 0; i < n; i++){
int ai = a[i];
while(ai != 1){
int spi = sp[ai];
if(primes[spi]){
cout << "setwise coprime" << endl;
return 0;
}
primes[spi] = 1;
while(ai % spi == 0)
ai /= spi;
}
}
cout << "pairwise coprime" << endl;
return 0;
} | 1 | 1,083,151 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i < (n);i++)
using ll = long long;
const ll MOD=1000000007;
const long long INF = 1LL << 60;
const double pi=acos(-1.0);
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; }
vector<vector<ll>> Comtable;
ll C(ll n,ll r)
{
if(n==r) return 1;
if(r==0) return 1;
if(Comtable.at(n).at(r)>0) return Comtable.at(n).at(r);
Comtable.at(n).at(r)=C(n-1,r)+C(n-1,r-1);
return Comtable.at(n).at(r);
}
int main()
{
ll N,P; cin>>N>>P;
ll num0=0,num1=0;
rep(i,N)
{
ll A; cin>>A;
A%=2;
if(A==0) num0++;
else num1++;
}
ll hoge=0;
Comtable=vector<vector<ll>>(51,vector<ll>(51,0));
for(int r=P;r<=num1;r+=2)
{
hoge+=C(num1,r);
}
cout<<(ll)pow(2,num0)*hoge<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main(){
int n,p;
ll ans;
cin >> n >> p;
int odd=0,even=0;
rep(i,n){
int a;
cin >> a;
if(a%2 == 0) even++;
else odd++;
}
if(odd == 0){
if(p == 0) ans = pow(2,n);
else ans = 0;
}
else{
ans = pow(2,n-1);
}
cout << ans << endl;
return 0;
} | 1 | 21,297,795 |
#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(){
ll r,d,x;cin>>r>>d>>x;
for(int i=1;i<=10;i++){
ll ans;
ans=r*x-d;
cout<<ans<<endl;
x=ans;
}
} | #include <bits/stdc++.h>
using namespace std;
#define endl '\n';
int main()
{
int xi, r, d, x2000, aux;
aux = 0;
xi = 0;
cin >> r >> d >> x2000;
while(aux < 10){
xi = r * x2000 - d;
x2000 = xi;
cout << xi << endl;
aux++;
}
} | 1 | 42,792,077 |
#include <iostream>
#include <string>
#include <cmath>
using namespace std;
int main()
{
string a ;
getline(cin,a);
cout << 100*(58 - a[0]) + 10*(58 - a[1]) + 58 - a[2];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll, ll> Pll;
#define rep(i,n) for(int (i) = 0; (i) < (int)(n); (i)++)
#define debug(var) do{std::cout << #var << " : ";view(var);}while(0)
template<typename T> void view(T e){std::cout << e << std::endl;}
template<typename T> void view(const std::vector<T>& v){for(const auto& e : v){ std::cout << e << " "; } std::cout << std::endl;}
template<typename T> void view(const std::vector<std::vector<T> >& vv){ for(const auto& v : vv){ view(v); } }
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
void Yes(){cout << "Yes" << endl;}
void No(){cout << "No" << endl;}
void YES(){cout << "YES" << endl;}
void NO(){cout << "NO" << endl;}
void err() {cout << -1 << endl;}
#define all(x) (x.begin(), x.end())
const int MOD = 1000000007;
const int INF = 1e9;
#define PI acos(-1);
int dx[4] = {1,-1,0,0};
int dy[4] = {0,0,1,-1};
int ddx[8] = {1,1,1,-1,-1,-1,0,0};
int ddy[8] = {0,1,-1,0,1,-1,1,-1};
int main(){
string s;
cin >> s;
for(int i = 0; i < 3; i++) {
if(s[i] == '1') s[i] = '9';
else s[i] = '1';
}
cout << s << endl;
} | 1 | 2,913,746 |
#include<bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define all(v) (v).begin(),(v).end()
using namespace std;
using ll=long long;
using pii=pair<int, int>;
using vi=vector<int>;
const ll INF=1LL<<60;
const int MOD=1e9+7;
vector<vi> G;
vector<bool> visit;
vi cnt;
void dfs(int v, int sum){
visit[v]=true;
for(auto nv : G[v]){
if(visit[nv]) continue;
dfs(nv, sum+cnt[v]);
}
cnt[v]+=sum;
}
int main(){
int N, Q; cin >> N >> Q;
G.resize(N);
visit.assign(N, 0);
cnt.resize(N, 0);
for(int i=0; i<N-1; i++){
int a, b; cin >> a >> b;
a--, b--;
G[a].push_back(b);
G[b].push_back(a);
}
for(int i=0; i<Q; i++){
int p, x; cin >> p >> x;
cnt[p-1]+=x;
}
dfs(0, 0);
for(int i=0; i<N; i++){
if(i != 0) cout << " ";
cout << cnt[i];
}
cout << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using namespace std;
template <typename T> using vec = std::vector<T>;
int main() {
int N, Q;
cin >> N >> Q;
vec<vec<int>> G(N,vec<int>());
rep(i, N-1) {
int a,b;
cin >> a >> b;
--a,--b;
G[a].push_back(b);
G[b].push_back(a);
}
vec<ll> p(N);
rep(i, Q) {
int index,x;
cin >> index >> x;
--index;
p[index] += x;
}
function<void(int,int)> dfs = [&](int now, int par){
if(par != -1) p[now]+=p[par];
for(auto e:G[now]){
if(e == par) continue;
dfs(e,now);
}
};
dfs(0,-1);
rep(i,N) {
cout << p[i] << " ";
}
cout << endl;
} | 1 | 20,259,574 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int H,W;
cin >> H >> W;
char pixel_org[H][W];
for(int i=0; i<H; i++)
for(int j=0; j<W; j++)
cin >> pixel_org[i][j];
cout << endl;
for(int i=0; i<H; i++)
{
for(int j=0; j<W; j++)
{
cout << pixel_org[i][j];
}
cout << endl;
for(int j=0; j<W; j++)
{
cout << pixel_org[i][j];
}
cout << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int H, W;
cin >> H >> W;
string C[H];
for (int i=0; i<H; i++)
cin >> C[i];
for (int i=0; i<H; i++) {
cout << C[i] << endl;
cout << C[i] << endl;
}
return 0;
} | 1 | 53,353,294 |
#include <cstdio>
#include <stack>
using namespace std;
int n;
stack<int> st;
int main() {
while (1) {
if (scanf("%d", &n) != 1) break;
if (n == 0) {
printf("%d\n", st.top());
st.pop();
} else {
st.push(n);
}
}
} | #include <cstdio>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <cstring>
#include <vector>
#include <map>
#include <utility>
#include <complex>
#include <stack>
using namespace std;
typedef complex<double> P;
int main(){
stack<int> d;
int x;
while(cin>>x){
if(x == 0){
cout << d.top() << endl;
d.pop();
}else {
d.push(x);
}
}
return 0;
} | 1 | 94,262,807 |
#include <iostream>
using namespace std;int main(){long long n,i;cin>>n;for(i=n;i>1;n*=--i);cout<<n<<endl;} | #include <iostream>
using namespace std;
long long fact(int n);
int main ()
{
int n;
cin >> n;
cout << fact(n) << endl;
return 0;
}
long long fact(int n)
{
if(n == 1) return 1;
else if(n == 0) return 0;
return (n * fact(n - 1));
} | 1 | 78,894,708 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <list>
#include <utility>
#include <tuple>
#include <cstdio>
#include <set>
#include <queue>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <cmath>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
using namespace std;
const long long INF = 1LL << 60;
typedef long long ll;
int main() {
ll Q,H,S,D,N;
cin >> Q >> H >> S >> D >> N;
H = min(H,2*Q);
S = min(S,2*H);
ll ans;
if(D > S*2){
ans = N * S;
}
else{
ans = (N/2)*D + (N%2)*S;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll q,h,s,d;
ll n;
cin >> q >> h >> s >> d >> n;
ll ans = 0;
ans += (n/2)*(min({8*q,4*h,2*s,d}));
n -= (n/2)*2;
ans += (n/1)*(min({4*q,2*h,s}));
cout << ans << endl;
} | 1 | 73,641,915 |
#include <iostream>
using namespace std ;
int main(){
int x , y , number[101] , i , j , k , cn= 0 ;
while ( 1 ){
cn = 0 ;
cin >> x >> y ;
if ( x + y == 0 ) break ;
for ( i = 1 ; i<=x ; i ++ ){
number[i] = i ;
}
for ( i = 1 ; i <= x ; i ++ ){
for ( j = i + 1 ; j <= x ; j ++ ){
for ( k = j + 1 ; k <= x ; k ++ ){
if ( number[i] + number[j] + number[k] == y ){
cn ++ ;
}
}
}
}
cout << cn << endl ;
}
} | #include<iostream>
using namespace std;
int count(int n, int x){
int cnt = 0;
for (int i = 1; i <= n-2; i++) {
for (int j = i+1; j <= n-1; j++) {
for (int k = j+1; k <= n; k++) {
if (i < j && j < k && i + j + k == x) cnt++;
}
}
}
return cnt;
}
int main(){
while(1){
int n, x;
cin >> n >> x;
if (n == 0 && x == 0) break;
cout << count(n, x) << endl;
}
return 0;
} | 1 | 60,554,934 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,K;
cin >> N >> K;
vector<int> data(N);
for(int i=0;i < N;i++){
cin >> data.at(i);
}
if(N%(K-1) == 0){
if(K == 2){
cout << N-1;
}
else{
cout << N/(K-1);
}
}
else if(N%(K-1) == 1){
cout << N/(K-1);
}
else{
cout << N/(K-1)+1;
}
} | #include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vi vector<int>
#define mii map<int,int>
#define pqb priority_queue<int>
#define pqs priority_queue<int,vi,greater<int> >
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define inf 1e18
#define ps(x,y) fixed<<setprecision(y)<<x
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void c_p_c()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
int32_t main()
{
int n,k,pos = -1;
cin >> n >> k;
int a[n];
for(int i=0;i<n;i++)
{
cin >> a[i];
}
if(k >= n)
{
cout<<1<<endl;
}
else
{
n--,k--;
cout<<ceil(n/(k*1.0))<<endl;
}
return 0;
} | 1 | 11,954,721 |
#include "bits/stdc++.h"
#include <set>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define all(i) (i).begin(), (i).end()
#define rall(i) (i).begin(), (i).end(), greater<int>()
#define int long long
#define elif else if
#define eb emplace_back
#define pb push_back
#define mp make_pair
#define fst first
#define sec second
#define mod 1000000007
#define INF 10e10
template <typename T>
void print(T x)
{
std::cout << x << " ";
}
template <typename T>
void println(T x)
{
std::cout << x << "\n";
}
signed main(void) {
int a, b, c;
cin >> a >> b >> c;
int ans = INF;
ans = min(ans, (abs(b - a) + abs(c - b)));
ans = min(ans, (abs(c - b) + abs(a - c)));
ans = min(ans, (abs(a - c) + abs(b - a)));
print(ans);
} | #include<bits/stdc++.h>
using namespace std;
#define int long long int
int32_t main()
{
vector<int> v(3,0);
for(int i=0;i<3;i++)
cin>>v[i];
cout<<*max_element(v.begin(),v.end()) - *min_element(v.begin(),v.end())<<endl;
} | 1 | 78,811,483 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
int main() {
int n,k,r,s,p;
cin >> n >> k >> r >> s >> p;
string t;
cin >> t;
int ans = 0;
for (int i = 0; i < n; i++) {
if(i - k >= 0 && t[i] == t[i - k]) {
t[i] = '?';
continue;
}
if(t[i] == 'r') ans += p;
if(t[i] == 's') ans += r;
if(t[i] == 'p') ans += s;
}
cout << ans << '\n';
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> P;
typedef pair<int,int> Pi;
#define rep(i,n) for(ll i=0;i<n;i++)
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define fi first
#define se second
#define endl "\n"
template<typename T> inline bool chmax(T &a, T b){if(a<b){a=b;return true;}return false;}
template<typename T> inline bool chmin(T &a, T b){if(a>b){a=b;return true;}return false;}
template<typename T> ostream& operator<<(ostream& s,const complex<T>& d) {return s<<"("<<d.real()<<", "<<d.imag()<< ")";}
template<typename T1, typename T2> ostream& operator<<(ostream& s,const pair<T1,T2>& d) {return s<<"("<<d.first<<", "<<d.second<<")";}
template<typename T> ostream& operator<<(ostream& s, const vector<T>& d){int len=d.size();rep(i,len){s<<d[i];if(i<len-1) s<<" ";}return s;}
template<typename T> ostream& operator<<(ostream& s,const vector<vector<T>>& d){int len=d.size();rep(i,len){s<<d[i]<<endl;}return s;}
template<typename T> ostream& operator<<(ostream& s,const set<T>& v){s<<"{ ";for(auto itr=v.begin();itr!=v.end();++itr) {if (itr!=v.begin()) {s<< ", ";}s<<(*itr);}s<<" }";return s;}
template<typename T> ostream& operator<<(ostream& s,const multiset<T>& v){s<<"{ ";for(auto itr=v.begin();itr!=v.end();++itr) {if (itr!=v.begin()) {s<< ", ";}s<<(*itr);}s<<" }";return s;}
template<typename T1, typename T2> ostream& operator<<(ostream& s,const map<T1,T2>& m){s<<"{"<<endl;for(auto itr=m.begin();itr!=m.end();++itr){s<<" "<<(*itr).first<<" : "<<(*itr).second<<endl;}s<<"}"<<endl;return s;}
const ll mod=1e9+7;
const ll inf=1e17;
const int INF=1e9;
const double EPS=1e-10;
const double PI=acos(-1);
int main(){
cin.tie(0);ios::sync_with_stdio(false);
ll n,k,r,s,p;
cin>>n>>k>>r>>s>>p;
string t;
cin>>t;
ll ans=0;
vector<int> used(n);
rep(i,n){
if(t[i]=='r'){
if(i<=k-1) used[i]=0;
else{
if(used[i-k]==0) used[i]=-1;
else used[i]=0;
}
if(used[i]==0){
ans+=p;
}
}else if(t[i]=='s'){
if(i<=k-1) used[i]=1;
else{
if(used[i-k]==1) used[i]=-1;
else used[i]=1;
}
if(used[i]==1){
ans+=r;
}
}else{
if(i<=k-1) used[i]=2;
else{
if(used[i-k]==2) used[i]=-1;
else used[i]=2;
}
if(used[i]==2){
ans+=s;
}
}
}
cout<<ans<<endl;
} | 1 | 40,979,974 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vc = vector<char>;
using vb = vector<bool>;
using vs = vector<string>;
using vll = vector<long long>;
using vp = vector<pair<int, int>>;
using vvi = vector<vector<int>>;
using vvc = vector<vector<char>>;
using vvll = vector<vector<long long>>;
template<class T> inline bool chmax(T &a, T b) { if (a<b) {a=b; return 1;} return 0;}
template<class T> inline bool chmin(T &a, T b) { if (b<a) {a=b; return 1;} return 0;}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
ll ans = k;
rep(i, n-1) {
ans *= k-1;
}
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
lli n, k;
int main(void){
cin >> n >> k;
lli ans = k;
n--;
while(n--) ans*=k-1;
cout << ans << endl;
return 0;
} | 1 | 50,813,779 |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int mat[101][101];
int main(int argc,char* argv[]){
memset(mat,0,sizeof(mat));
int n,v,cnt,x;
cin>>n;
for(int i=0;i<n;i++){
cin>>v>>cnt;
for(int j=0;j<cnt;j++){
cin>>x;
mat[v][x]=1;
}
}
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
cout<<mat[i][j];
if(j!=n)
cout<<" ";
}
cout<<endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int m[101][101]={},n,k,v,i,j,u;
cin>>n;
for(i=1;i<=n;i++){
cin>>u>>k;
for(j=0;j<k;j++)cin>>v,m[u][v]=1;
}
for(i=1;i<=n;i++){
for(j=1;j<n;j++)cout<<m[i][j]<<" ";
cout<<m[i][j]<<endl;
}
return 0;
} | 1 | 16,652,188 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
std::vector<int> a;
for (int i = 1; i <= n; i++) {
int k;
cin >> k;
a.push_back(k - i);
}
partial_sort(a.begin(), a.begin() + (n + 1) / 2, a.end());
long sumu = 0;
long sumd = 0;
for (int i = 0; i < a.size(); i++) {
sumu += abs(a[i] - a[n / 2]);
sumd += abs(a[i] - a[(n - 1) / 2]);
}
cout << min(sumu, sumd) << endl;
} | #include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <deque>
#include <random>
#include <iomanip>
typedef long long int ll;
typedef long double ld;
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
const ll MOD=1000000007;
const ll MAX_N=500010;
const ll INF=999999999999;
int main(){
int n;
cin>>n;
vector<ll> a(n);
ll ave=0;
for(int i=0;i<n;i++){
ll x;
cin>>x;
a[i]=x-i-1;
}
sort(a.begin(),a.end());
ll l=a[n/2];
ll r=INF;
if(n>1) r=a[n/2+1];
ll ans=0;
ll sub=0;
for(int i=0;i<n;i++){
ans+=abs(a[i]-l);
sub+=abs(a[i]-r);
}
ans=min(ans,sub);
cout<<ans<<endl;
} | 1 | 73,179,209 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
int main(){
int k,n;
cin >> k >> n;
vector<int> a(n);
rep(i,n) cin >> a[i];
sort(a.begin(),a.end());
int len = 0;
for(int i=1; i<n; i++){
len = max(len,a[i]-a[i-1]);
}
len = max(len,k-a[n-1]+a[0]);
cout << k-len << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define arep(x,n) for (int x: n)
using namespace std;
int main()
{
int k, n; cin >> k >> n;
vector<int> a(n); rep(i,n) cin >> a.at(i);
int ans = k;
rep(i, n) {
int p1,p2;
if(i == 0) p1 = a.at(n-1) - a.at(0);
else p1 = k - (a.at(i) - a.at(i-1));
if(i == n-1) p2 = k - (a.at(i) - a.at(i-1));
else p2 = k - (a.at(i+1) - a.at(i));
int tmp = min(p1,p2);
ans = min(ans, tmp);
}
cout << ans << endl;
} | 1 | 8,253,822 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n) ; ++i)
#define FOR(i,a,b) for(int i = (a); i < (b); ++i)
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define emb emplace_back
#define fcout cout << fixed << setprecision(15)
using namespace std;
using ll = long long;
using P = pair<int,int>;
template<typename T> void pv(vector<T> vec) {
cout << "[";
for(auto& v : vec) { cout << v << ","; }
cout << "]" << endl;
}
template<>
void pv(vector<P> vec) {
cout << "[";
for(auto& v : vec) {
cout << "<" << v.fi << ","<< v.se << ">" << ",";
}
cout << "]" << endl;
}
int main() {
int r;
cin >> r;
string ans;
if(r < 1200)ans = "ABC";
else if (r < 2800) ans = "ARC";
else ans = "AGC";
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#include <string>
#include <cstring>
#include <algorithm>
#include <math.h>
#include <map>
#include <bitset>
#include <cmath>
#include <set>
#include <utility>
#include <sstream>
#define INF 1000000000000
#define MOD 1000000007
using namespace std;
typedef long long ll;
int main(){
ll N;
cin >> N;
if(N < 1200)
cout << "ABC" << endl;
else if(N < 2800)
cout << "ARC" << endl;
else
cout << "AGC" << endl;
} | 1 | 56,114,136 |
#include<iostream>
using namespace std;
string map[21];
int sx,sy,ans,x,y;
void search(int xx,int yy){
ans++;
map[yy][xx]='#';
if(xx<x-1&&map[yy][xx+1]=='.')search(xx+1,yy);
if(xx>0&&map[yy][xx-1]=='.')search(xx-1,yy);
if(yy<y-1&&map[yy+1][xx]=='.')search(xx,yy+1);
if(yy>0&&map[yy-1][xx]=='.')search(xx,yy-1);
}
int main(){
while(cin>>x>>y,x||y){
ans=0;
for(int i=0;i<y;i++)cin>>map[i];
for(int i=0;i<y;i++){
for(int j=0;j<x;j++){
if(map[i][j]=='@')sy=i,sx=j;
}
}
search(sx,sy);
cout<<ans<<endl;
}
} | #include <iostream>
#include <cstdio>
#include <string>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
typedef long long ll;
const ll MAX_W = 20, MAX_H = 20;
int tiles[MAX_H][MAX_W];
int d[4][2] = {{-1, 0}, {0, -1}, {0, 1}, {1, 0}};
void dfs(ll x, ll y, ll w, ll h) {
tiles[y][x] = 0;
rep(i, 4) {
int dx = d[i][0];
int dy = d[i][1];
if (x + dx < 0 || x + dx >= w) continue;
if (y + dy < 0 || y + dy >= h) continue;
if (tiles[y + dy][x + dx] == -1) {
dfs(x + dx, y + dy, w, h);
}
}
}
int main() {
while(true) {
ll w, h;
cin >> w >> h;
if (w == 0 && h == 0) break;
string line;
int startX;
int startY;
rep(i, h) {
cin >> line;
rep(j, w) {
if (line[j] == '.') {
tiles[i][j] = -1;
} else if (line[j] == '#') {
tiles[i][j] = 1;
} else {
tiles[i][j] = -1;
startX = j;
startY = i;
}
}
}
dfs(startX, startY, w, h);
ll cnt = 0;
rep(i, h) {
rep(j, w) {
if (tiles[i][j] == 0) ++cnt;
}
}
cout << cnt << endl;
}
return 0;
} | 1 | 58,740,960 |
#include "bits/stdc++.h"
using namespace std;
int main(){
int X,Y;
cin >> X >>Y;
int ans;
ans = X + Y/2;
cout << ans;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main()
{
int X, Y;
cin >> X >> Y;
cout << X + Y/2 << endl;
return 0;
} | 1 | 23,821,773 |
#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)
const ll mod = 1000000007;
const ll INF = 9223372036854775807;
#define Sort(a) sort(a.begin(), a.end())
#define Reverse(a) reverse(a.begin(), a.end())
#define Pi acos(-1)
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
cout << setprecision(15) << fixed;
ll s;
cin >> s;
ll x1 = 0;
ll y1 = 0;
ll x2 = 1000000000;
ll y2 = 1;
ll y3 = s/1000000000 + 1;
if (s % 1000000000 == 0) {
y3--;
}
ll x3 = 1000000000*y3 - s;
cout << x1 << ' ' << y1 << ' ' << x2 << ' ' << y2 << ' ' << x3 << ' ' << y3 << ' ' << '\n';
} | #include<cstdio>
#include<algorithm>
#include<iostream>
#include<vector>
#include<set>
#include<map>
#include<cmath>
using namespace std;
#define ll long long
#define db double
int main()
{
ll x1=0,y1=0;
ll x3=1000000000;
ll x2=1,y2=0,y3=0;
ll s;
scanf("%lld",&s);
y2=(s/x3)+1;
if(y2>1000000000)y2=1000000000;
y3=y2*x3-s;
printf("%lld %lld %lld %lld %lld %lld",x1,y1,x2,y2,x3,y3);
return 0;
} | 1 | 67,290,289 |
#include <bits/stdc++.h>
#include <set>
using namespace std;
using pii = pair<int,int>;
using pll = pair<long long, long long>;
const long long INF = 1<<29;
const int MOD = 1000000007;
long long ruizyou(long long m,long long n){
if(m == 0)return 0;
if(m == 1)return 1;
long long ans = 1;
long long tmp = m;
for(int i=0;i<=30;i++){
if(n & (1<<i)){
ans *= tmp;
ans %= MOD;
}
tmp *= tmp;
tmp %= MOD;
}
return ans;
}
long long kaizyou(long long x){
if(x == 0)return 1;
return x * kaizyou(x-1) % MOD;
}
long long comb(long long x,long long y){
long long bunsi = kaizyou(x);
long long bunbo = kaizyou(x-y) * kaizyou(y) % MOD;
return bunsi * ruizyou(bunbo,MOD-2) % MOD;
}
struct unionfind{
vector<int> par;
vector<vector<int>> children;
vector<int> hukasa;
vector<int> kazu;
unionfind(int n){
par = vector<int>(n);
hukasa = vector<int>(n,0);
kazu = vector<int>(n,1);
for(int i=0;i<n;i++){
par.at(i) = i;
}
}
int root(int x){
if(par.at(x) == x)return x;
return root(par.at(x));
}
void unite(int x,int y){
int rx = root(x);
int ry = root(y);
if(rx == ry)return;
if(hukasa.at(rx) >= hukasa.at(ry)){
par.at(ry) = rx;
hukasa.at(rx) = max(hukasa.at(ry) + 1,hukasa.at(rx));
kazu.at(rx) += kazu.at(ry);
}
else{
par.at(rx) = ry;
kazu.at(ry) += kazu.at(rx);
}
}
void newkazu(){
int n = kazu.size();
for(int i=0;i<n;i++){
kazu.at(i) = kazu.at(root(i));
}
}
bool same(int x,int y){
return root(x) == root(y);
}
};
int ctoi(char a){
return a - '0';
}
long long gcd(long long a,long long b){
long long c = max(a,b);
long long d = min(a,b);
if(d % c == 0)return c;
return gcd(c,d%c);
}
long long lcm(long long a,long long b){
return a * b / gcd(a,b);
}
void hukasa(vector<vector<int>> s,vector<vector<int>> table,int &ans,pii frm,int n,int m){
int x,y;
tie(x,y) = frm;
set<pii> se;
if(x-1 >= 0)se.insert(pii(x-1,y));
if(x+1 < n)se.insert(pii(x+1,y));
if(y-1 >= 0)se.insert(pii(x,y-1));
if(y+1 < m)se.insert(pii(x,y+1));
for(auto t:se){
int tx,ty;
tie(tx,ty) = t;
if(s.at(tx).at(ty) && table.at(tx).at(ty) == -1){
table.at(tx).at(ty) = table.at(x).at(y) + 1;
ans = max(ans,table.at(tx).at(ty));
hukasa(s,table,ans,t,n,m);
table.at(tx).at(ty) = -1;
}
}
}
void daiku(int frm,vector<vector<pii>> g,vector<int> &cost,int n){
priority_queue<pii,vector<pii>,greater<pii>> q;
q.push(pii(cost.at(frm),frm));
vector<bool> kakutei(n,false);
while(!q.empty()){
pii now = q.top();
q.pop();
int n1,n2;
tie(n1,n2) = now;
if(kakutei.at(n2))continue;
kakutei.at(n2) = true;
for(auto t:g.at(n2)){
int tx,ty;
tie(tx,ty) = t;
if(cost.at(tx) > n1 + ty){
cost.at(tx) = n1 + ty;
q.push(pii(cost.at(tx),tx));
}
}
}
}
int main(){
int n,m,x;
cin >> n >> m >> x;
vector<int> c(n);
vector<vector<int>> a(n,vector<int>(m));
for(int i=0;i<n;i++){
cin >> c.at(i);
for(int j=0;j<m;j++){
cin >> a.at(i).at(j);
}
}
int ans = INF;
for(int i=0;i<(1<<n);i++){
vector<long long> tmp(m,0);
int sum = 0;
for(int j=0;j<n;j++){
if(i & (1<<j)){
sum += c.at(j);
for(int k=0;k<m;k++){
tmp.at(k) += a.at(j).at(k);
}
}
}
bool flag = true;
for(int j=0;j<m;j++){
if(tmp.at(j) < x)flag = false;
}
if(flag)ans = min(ans,sum);
}
if(ans == INF)cout << -1 << endl;
else cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
int n, m, x;
vector<int> c;
vector<vector<int>> a;
vector<int> sum;
bool ok() {
rep(i, m) if (sum[i] < x) return false;
return true;
}
int dfs(int i=0, int co=0) {
if (i == n) {
if (ok()) {
return co;
}
else {
return INF;
}
}
int n1, n2;
n1 = dfs(i+1, co);
rep(j, m) sum[j] += a[i][j];
n2 = dfs(i+1, co+c[i]);
int res = min(n1, n2);
rep(j, m) sum[j] -= a[i][j];
return res;
}
int main() {
cin >> n >> m >> x;
c.resize(n);
a.resize(n, vector<int>(m));
rep(i, n) {
cin >> c[i];
rep(j, m) cin >> a[i][j];
}
sum.resize(m, 0);
int ans = dfs();
if (ans == INF) cout << -1 << endl;
else cout << ans << endl;
return 0;
} | 1 | 58,734,179 |
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main()
{
char ch;
cin>>ch;
if(ch>='A' && ch<='Z')
cout<<"A";
else
cout<<"a";
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); ++i)
#define MOD 1000000007
using namespace std;
using ll = long long;
int main() {
char s;
cin >> s;
if('a'<=s && s<='z') cout << 'a' << endl;
else cout << 'A' << endl;;
return 0;
} | 1 | 72,374,798 |
#include<iostream>
#include<string>
using namespace std;
int main(){
int n;
int m;
char data[5000][2];
string s;
while(true){
cin>>n;
if(n==0)break;
string str;
for(int i=0;i<n;i++){
cin>>data[i][0]>>data[i][1];
}
cin>>m;
for(int i=0;i<m;i++){
cin>>s;
str=str+s;
}
for(int i=0;i<str.size();i++){
for(int j=0;j<n;j++){
if(data[j][0]==str[i]){
str[i]=data[j][1];
break;
}
}
}
cout<<str<<endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main(){
int n,i,tail;
char s;
char dic[256];
while(cin>>n,n){
for(i=0;i<256;i++) dic[i]=i;
while(n--){
cin>>s;
cin>>dic[(int)s];
}
cin>>n;
while(n--){
cin>>s;
cout<<dic[(int)s];
}
cout<<endl;
}
} | 1 | 68,846,226 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
long long int dist[200005];
long long int visited[200005];
int main()
{
ll n,m;
cin >> n >> m;
vector< vector <ll > >adj(n);
for(ll i=0;i<n-1;i++)
{
ll x,y;
cin >> x >> y;
x--;
y--;
adj[x].push_back(y);
adj[y].push_back(x);
}
queue <ll > q;
for(ll i=0;i<m;i++)
{
ll temp,val;
cin >> temp>>val;
temp--;
dist[temp]+= val;
}
q.push(0);
while(!q.empty())
{
long long int f=q.front();
q.pop();
visited[f]=1;
for(long long int i=0;i<adj[f].size();i++)
{
if(visited[adj[f][i]]==0)
{
dist[adj[f][i]]+=dist[f];
q.push(adj[f][i]);
}
}
}
for(long long int i=0;i<n;i++)
{
cout << dist[i]<<" ";
}
} | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<cstdio>
#include<queue>
#include<deque>
#include<map>
#include<stack>
#include<set>
#include<tuple>
using namespace std;
typedef pair<int,int> ii;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef unsigned long long int ull;
const int INF=1e9;
const ll MOD=1e9+7;
int dy[]={1,0,-1,0};
int dx[]={0,1,0,-1};
const int MAXN=2e5;
int n,q;
vector<vector<int> > G(MAXN);
vector<bool> visited(MAXN,false);
vector<int> cnt(MAXN,0);
void dfs(int u){
visited[u]=true;
for(auto v:G[u]){
if(!visited[v]){
cnt[v]+=cnt[u];
dfs(v);
}
}
return ;
}
int main(){
cin>>n>>q;
for(int i=0;i<n-1;i++){
int a,b;cin>>a>>b;
a--;b--;
G[a].emplace_back(b);
G[b].emplace_back(a);
}
for(int i=0;i<q;i++){
int p,x;cin>>p>>x;
p--;
cnt[p]+=x;
}
dfs(0);
for(int i=0;i<n;i++){
cout<<cnt[i];
if(i!=n-1) cout<<' ';
}
cout<<endl;
return 0;
} | 1 | 79,074,622 |
#include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;
const ll mod=1000000007;
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
double n,m,d;
cin>>n>>m>>d;
doublecout(((d)?2:1)*(m-1)*(n-d)/(n*n));
return 0;
} | #include<bits/stdc++.h>
#define rep(i,n,m) for(int i = (n); i <(m); i++)
#define rrep(i,n,m) for(int i = (n) - 1; i >=(m); i--)
#define pvec(vec) {for (auto v: vec) cout << v << ' '; cout << endl;}
#define pivec(vec) {rep(i, 0, vec.size()) cout << i << ':' << vec[i] << ' '; cout << endl;}
using namespace std;
using ll = long long;
int main()
{
ll range, array_size, diff;
cin >> range >> array_size >> diff;
double ans = 0;
if (diff == 0)
ans = (double) 1/ range * (array_size - 1);
else
ans = (double) 2 * (range - diff) / (range * range) * (array_size - 1);
printf("%.10f\n", ans);
return 0;
} | 1 | 30,789,404 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
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 lcm(int a, int b) { return a * b / gcd(a, b); }
int main() {
ll A, B, C, D;
cin >> A >> B >> C >> D;
ll g = lcm(C, D);
ll cnt_B = B / C + B / D - B / g;
ll cnt_A = (A-1) / C + (A-1) / D - (A-1) / g;
cout << B-A+1-cnt_B + cnt_A << endl;
return 0;
} | #include <vector>
#include <set>
#include <map>
#include <array>
#include <iostream>
#include <cstdio>
#include <cstdint>
#include <algorithm>
#include <numeric>
#include <bitset>
#include <iomanip>
using ll = long long;
using namespace std;
#define rep(i,n) for(ll i=0;i<(n);++i)
#define outD(fpv) cout << setprecision(20) << fpv << endl;
inline void yes(bool cond) { cond ? puts("Yes") : puts("No"); }
inline void YES(bool cond) { cond ? puts("YES") : puts("NO"); }
template<typename Type> inline void chmin(Type& a, Type b) { if (a > b) a = b; }
template<typename Type> inline void chmax(Type& a, Type b) { if (a < b) a = b; }
template<typename Arr, typename Type> inline void fill(Arr& arr, Type v) { std::fill(arr.begin(), arr.end(), v); }
template<typename Type> inline void sort(Type& arr) { std::sort(arr.begin(), arr.end()); }
template<typename Type> inline Type nth(vector<Type>& arr, size_t pos) { std::nth_element(arr.begin(), arr.begin() + pos, arr.end()); return arr[pos]; }
template<typename Type> inline void unique(Type& arr) { sort(arr); arr.erase(unique(arr.begin(), arr.end()), arr.end()); }
constexpr ll INF_I = std::numeric_limits<ll>::max();
constexpr ll BIGP = 1000000007L;
constexpr double INF_F = std::numeric_limits<float>::infinity();
constexpr double PI = 3.14159265358979323846L;
int main()
{
cin.tie(0); ios::sync_with_stdio(false);
ll A, B, C, D;
cin >> A >> B >> C >> D;
ll E = lcm(C, D);
ll ac = (A-1) / C;
ll bc = (B) / C;
ll ad = (A-1) / D;
ll bd = (B) / D;
ll ae = (A-1) / E;
ll be = (B) / E;
const auto f = [C, D, E](ll x)
{
ll c = x / C;
ll d = x / D;
ll e = x / E;
return x - c - d + e;
};
ll ans = f(B) - f(A - 1);
cout << ans;
return 0;
} | 1 | 9,411,026 |
#include<bits/stdc++.h>
using namespace std;
int n,a[104],num[104],flag=0;
int main(){
cin>>n;int maxx=0;
for(int i=1;i<=n;i++){
cin>>a[i];
maxx=max(maxx,a[i]);
num[a[i]]++;
}
for(int i=maxx;i>maxx/2;i--){
if(num[i]<2){
flag=1;
break;
}num[i]-=2;
}
if((maxx&1)==0){
if(num[maxx>>1]) num[maxx>>1]--;
else flag=1;
}
if(flag) cout<<"Impossible";
else{
for(int i=1;i<=(maxx+1)/2;i++){
if(num[i]){cout<<"Impossible";return 0;}
}
cout<<"Possible";
}
} | #pragma GCC optimize("Ofast", "unroll-loops")
#include <bits/stdc++.h>
using namespace std;
int N;
vector<int> a;
void input() {
cin >> N;
a.resize(N);
for (int i = 0; i < N; ++i)
cin >> a[i];
}
void solve() {
input();
int d = 0;
for (auto ai : a)
d = max(d, ai);
map<int, int> cnt;
for (auto ai : a)
++cnt[ai];
for (int i = d; i >= (d + 1) / 2; --i) {
if (d % 2 == 0 && i == d / 2)
--cnt[i];
else
cnt[i] -= 2;
if (cnt[i] < 0) {
cout << "Impossible" << endl;
return;
}
}
for (auto& e : cnt) {
if (e.second > 0 && e.first <= (d + 1) / 2) {
cout << "Impossible" << endl;
return;
}
}
cout << "Possible" << endl;
return;
}
int main() {
solve();
} | 1 | 12,908,793 |
#include <algorithm>
#include <cassert>
#include <climits>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
const int INF = 1e9;
const long long LINF = 1e18;
template <class T>
T gcd(T a, T b) {
if (a < b) {
swap(a, b);
}
T r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
template <class T>
T lcm(const T& a, const T& b) {
T n = gcd<T>(a, b);
if (a > b) {
return (a / n) * b;
} else {
return a * (b / n);
}
}
int main() {
int N;
cin >> N;
vector<long long> T(N);
for (int i = 0; i < N; i++) {
cin >> T[i];
}
long long ans = T[0];
for (int i = 1; i < N; i++) {
ans = lcm(ans, T[i]);
}
cout << ans << endl;
return 0;
} | #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++)
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 / gcd(a, b)* 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() {
ll n;
cin >> n;
vector<ll>a(n);
rep(i,n) cin >> a.at(i);
ll num = 1;
rep(i,n){
num = lcm(a.at(i),num );
}
cout << num << endl;
} | 1 | 5,028,014 |
#include <iostream>
#include <vector>
#include <cmath>
#include <climits>
#include <algorithm>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; ++i) {
cin >> h[i];
}
vector<int> dp(n + 1, INT_MAX);
dp[0] = 0;
for (int i = 0; i < n; ++i) {
if (i + 1 < n) {
dp[i+1] = min(dp[i+1], dp[i] + abs(h[i] - h[i+1]));
}
if (i + 2 < n) {
dp[i+2] = min(dp[i+2], dp[i] + abs(h[i] - h[i+2]));
}
}
cout << dp[n-1] << '\n';
return 0;
} | #include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ff first
#define ss second
#define MP make_pair
#define mset(x,a) memset(x,a,sizeof(x))
#define max3(x,y,z) max(x,max(y,z))
#define min3(x,y,z) min(x,min(y,z))
#define sqr(a) (a)*(a)
#define all(x) (x).begin(), (x).end()
#define f(i, n) for (int i = 0; i < n; i++)
#define f1(i, n) for (int i = 1; i <= n; i++)
#define loop(i,a,b) for (int i = a; i < b; i++)
#define bloop(i,a,b) for (int i = a ; i>=b;i--)
#define vvll vector<vector<ll>>
#define vll vector<ll>
#define pll pair<ll,ll>
#define vpll vector<pll>
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define cases ll t;cin >> t;while(t--)
#define rr return 0
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define deb(a) std::cerr<<#a<<"="<<(a)<<"\n"
#define deb2(a,b) std::cerr<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<"\n"
#define deb3(a,b,c) std::cerr<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<"\n"
const int MOD = 1000 * 1000 * 1000 + 7;
ll getRes(ll arr[], ll n)
{
ll dp[n+ 1] = { 0 };
dp[0] = 0;
dp[1] = 0;
dp[2] = abs(arr[1] - arr[0]);
for (ll i = 3; i <= n; i++)
{
dp[i] = min(dp[i - 1] + abs(arr[i - 1] - arr[i - 2]), dp[i - 2] + abs(arr[i - 1] - arr[i - 3]));
}
return dp[n];
}
void solve()
{
ll n;
cin >> n;
ll arr[100001];
f(i, n)
cin >> arr[i];
if (n < 2)
{
cout << 0 << "\n";
return;
}
ll res = getRes(arr, n);
cout << res << "\n";
}
int main()
{
fast;
ll t = 1;
while (t--)
{
solve();
}
rr;
} | 1 | 99,905,426 |
#include<bits/stdc++.h>
#include <array>
using namespace std;
using ULL = unsigned long long;
using UL = unsigned;
using LL = long long;
#define rep(i, n) for(UL i = 0; i < (n); i++)
struct Problem {
void Solve() {
UL N; cin >> N;
UL A, B; cin >> A >> B;
vector<UL> P(N); rep(i, N) cin >> P[i];
UL S[3] = {};
rep(i, N) {
if (P[i] <= A) S[0]++;
else if (P[i] > B) S[2]++;
else S[1]++;
}
UL ans = min(S[0], min(S[1], S[2]));
cout << ans << endl;
}
Problem();
};
int main() {
unique_ptr<Problem> p(new Problem());
p->Solve();
return 0;
}
Problem::Problem() {
cout << fixed << setprecision(10);
} | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
void solve(){
int lacnt=0,lbcnt=0,gbcnt=0;
int n;
cin>>n;
int a,b;
cin>>a>>b;
vector<int>p(n);
for(int i=0; i<n; i++)cin>>p[i];
for(int i=0; i<n; i++){
if(p[i]<=a){
lacnt+=1;
}
else if(p[i]<=b){
lbcnt+=1;
}
else{
gbcnt+=1;
}
}
cout<<min(lacnt, min(lbcnt, gbcnt))<<endl;
}
signed main(){
solve();
} | 1 | 69,740,303 |
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base ::sync_with_stdio(0);
cin.tie(0);
int a, b; cin >> a >> b;
if (a <= b) {
string res = "", c;
c = to_string(a);
while (b--) res += c;
cout << res;
} else {
string res = "", c;
c = to_string(b);
while (a--) {
res += c;
}
cout << res;
}
return 0;
} | #include <iostream>
#include <cstdlib>
#include <climits>
#include <cmath>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <string>
#include <deque>
#define INF_INT (INT_MAX / 2)
#define INF_LONG (LONG_MAX / 2)
#define DEBUG false
using namespace std;
const int MAX = 100001;
const int MOD = 1000000007;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ll, int> pli;
typedef pair<int, ll> pil;
int ceil(int x, int y) { return (x % y == 0) ? x / y : x / y + 1; }
int gcd(int x, int y) { return y ? gcd(y, x % y) : x; }
int lcm(int x, int y) { return x / gcd(x, y) * y; }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b;
cin >> a >> b;
string s, t;
for(int i = 0; i < b; i++){
s += to_string(a);
}
for(int i = 0; i < a; i++){
t += to_string(b);
}
if(s < t){
cout << s << endl;
} else {
cout << t << endl;
}
return 0;
} | 1 | 93,639,442 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define pb push_back
#define sz(x) (int)(x).size()
#define PQ(T) priority_queue<T, v(T), greater<T>>
#define bn(x) ((1 << x) - 1)
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
const int mod = 1000000007;
int main(){
int h, w;
cin >> h >> w;
vector<string> s(h);
rep(i, h) cin >> s[i];
vvi dp(h, vi(w, 0));
int ans=0;
rep(i, h)rep(j, w){
if(i==0&&j==0){
if(s[0][0]=='#') ans++;
continue;
}
int up = INF;
int left = INF;
if(i!=0){
up = dp[i-1][j];
if(s[i-1][j]=='.' && s[i][j]=='#') up+=1000;
else up++;
}
if(j!=0){
left = dp[i][j-1];
if(s[i][j-1]=='.' && s[i][j]=='#') left+=1000;
else left++;
}
dp[i][j] = min(up, left);
}
ans += dp[h-1][w-1]/1000;
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0; i<(long long)(n); i++)
#define REP(i, k, n) for(long long i=(long long)(k); i<(long long)(n); i++)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define PQ(T) priority_queue<T>
#define PQS(T) priority_queue<T, vector<T>, greater<T> >
#define deci cout << fixed << setprecision(15);
typedef long long ll;
const ll inf = 1020304050607080910;
const ll mod = 1000000007;
typedef pair<ll, ll> P;
typedef pair<ll, P> PP;
template<class T> bool chmin(T&x,T y){if(x>y){x=y;return true;}return false;}
template<class T> bool chmax(T&x,T y){if(x<y){x=y;return true;}return false;}
ll gcd(ll x,ll y){if(x>y)swap(x, y);while(x!=0){y%=x;swap(x, y);}return y;}
ll mpow(ll x,ll r){if(r==0)return 1;if(r%2==1){return x*mpow(x,r-1)%mod;}else{ll aa=mpow(x,r/2);return aa*aa%mod;}}
int main(){
int H, W; cin >> H >> W;
char s[H][W];
rep(i, H)rep(j, W) cin >> s[i][j];
int dp[H][W];
if(s[H-1][W-1] == '#') dp[H-1][W-1] = 2;
else dp[H-1][W-1] = 0;
for(int i=H-1; i>=0; i--){
for(int j=W-1; j>=0; j--){
if(i+j==H+W-2) continue;
if(i==H-1){
if(s[i][j] == '#' && s[i][j+1] == '.') dp[i][j] = dp[i][j+1] + 2;
else dp[i][j] = dp[i][j+1];
}else if(j==W-1){
if(s[i][j] == '#' && s[i+1][j] == '.') dp[i][j] = dp[i+1][j] + 2;
else dp[i][j] = dp[i+1][j];
}else{
dp[i][j] = 1e9;
if(s[i][j] == '#' && s[i+1][j] == '.') chmin(dp[i][j], dp[i+1][j]+2);
else chmin(dp[i][j], dp[i+1][j]);
if(s[i][j] == '#' && s[i][j+1] == '.') chmin(dp[i][j], dp[i][j+1]+2);
else chmin(dp[i][j], dp[i][j+1]);
}
}
}
cout << dp[0][0]/2 << endl;
return 0;
} | 1 | 85,577,913 |
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#include<bits/stdc++.h>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
#define pf printf
#define sf(a) scanf("%d",&a)
#define sfl(a) scanf("%lld",&a)
#define sff(a,b) scanf("%d %d",&a,&b)
#define sffl(a,b) scanf("%lld %lld",&a,&b)
#define sfff(a,b,c) scanf("%d %d %d",&a,&b,&c)
#define sfffl(a,b,c) scanf("%lld %lld %lld",&a,&b,&c)
#define sffff(a,b,c,d) scanf("%d %d %d %d",&a,&b,&c,&d)
#define sffffl(a,b,c,d) scanf("%lld %lld %lld %lld",&a,&b,&c,&d)
#define sfffff(a,b,c,d,e) scanf("%d %d %d %d %d",&a,&b,&c,&d,&e)
#define sfffffl(a,b,c,d,e) scanf("%lld %lld %lld %lld %lld",&a,&b,&c,&d,&e)
#define sfc(a) scanf("%c",&a)
#define pii pair<int,int>
#define ms(a,b) memset(a,b,sizeof(a))
#define pb(a) push_back(a)
#define pbp(a,b) push_back({a,b})
#define db double
#define ft float
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define ff first
#define ss second
#define sz(x) x.size()
#define all(x) x.begin(),x.end()
#define CIN ios_base::sync_with_stdio(0); cin.tie(0)
#define max3(a, b, c) max(a, b) > max(b, c) ? max(a, b) : max(b, c)
#define min3(a, b, c) min(a, b) < min(b, c) ? min(a, b) : min(b, c)
#define for0(i,n) for(int i=0;i<n;i++)
#define for1(i,n) for(int i=1;i<=n;i++)
#define forrev(i,n) for(int i=n-1; i>=0; i--)
#define forab(i,a,b) for(int i=a;i<=b;i++)
#define forba(i,b,a) for(int i=b;i>=a;i--)
#define stlloop(x) for(__typeof(x.begin()) it=x.begin();it!=x.end();it++)
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) ((a)*((b)/gcd(a,b)))
#define case1(z) cout<<"Case "<<z<<": "
#define case2(z) printf("Case %d: ",z)
#define PI acos(-1)
#define valid(tx,ty) tx>=0 && tx<row && ty>=0 && ty<col
#define intlim 2147483648
#define N 200007
#define inf 100000008
#define mod 1000000007
int main()
{
string g;
cin>>g;
if(g[0]=='R' && g[1]=='R' && g[2]=='R')
cout<<3<<endl;
else if(g[0]=='R' && g[1]=='R')
cout<<2<<endl;
else if(g[1]=='R' && g[2]=='R')
cout<<2<<endl;
else if(g[0]=='R')
cout<<1<<endl;
else if(g[1]=='R')
cout<<1<<endl;
else if(g[2]=='R')
cout<<1<<endl;
else if(g[0]!='R' && g[1]!='R' && g[2]!='R')
cout<<0<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
int ans=0,cnt=0;
for(int i=0;i<s.size();i++){
if(s.at(i)=='R'){
cnt++;
if(ans<cnt)ans=cnt;
}else{cnt=0;}
}
cout << ans << endl;
return 0;
} | 1 | 83,800,254 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef pair<int, int> PII;
#define int long long
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define rrep(i, n) for (int i = (n); i >= 0; --i)
void Main()
{
int n, k;
cin >> n >> k;
VI V(n);
rep(i, n)
cin >> V.at(i);
int sum;
sum = 0;
rrep(i, n - 1)
{
rrep(j, i - 1)
{
if (V.at(j) > V.at(i))
sum++;
}
}
sort(V.begin(), V.end());
int x;
x = 0;
rep(i, n - 1)
{
auto itr = upper_bound(V.begin(), V.end(), V.at(i));
int a = V.end() - itr;
x += a;
}
int f;
f = k * (k - 1) / 2 % MOD;
cout << ((f * x) % MOD + (sum * k) % MOD) % MOD << endl;
}
int32_t main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(15);
Main();
} | #include <algorithm>
#include <array>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#include <cassert>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
const int64_t kMOD = 1000000007;
int main() {
int N, K;
cin >> N >> K;
vector<int> A(N);
rep(i, N) {
cin >> A[i];
}
int64_t inner = 0;
for(int i=0; i<N-1; ++i) {
for(int j=i+1; j<N; ++j) {
if(A[i] > A[j]) {
inner++;
}
}
}
int64_t outer = 0;
sort(A.rbegin(), A.rend());
for(int i=0; i<N-1; ++i) {
for(int j=i+1; j<N; ++j) {
if(A[i] > A[j]) {
outer++;
}
}
}
inner *= K;
inner %= kMOD;
#if 1
if(K % 2 == 0) {
outer *= K / 2;
outer %= kMOD;
outer *= K - 1;
outer %= kMOD;
} else {
outer *= (K-1) / 2;
outer %= kMOD;
outer *= K;
outer %= kMOD;
}
#else
inner = inner * K;
inner %= kMOD;
outer *= K-1;
outer %= kMOD;
outer *= K;
outer %= kMOD;
outer /= 2;
#endif
cout << (inner + outer) % kMOD << endl;
return 0;
} | 1 | 60,326,453 |
#include <iostream>
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <cctype>
#include <string>
#include <map>
#include <set>
#include <math.h>
#include <cmath>
#define ll long long
using namespace std;
int main(){
int N, a;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++){
cin >> a;
vec.at(i) = a;
}
sort(vec.rbegin(), vec.rend());
int half = vec.size()/2 -1;
cout << vec.at(half) - vec.at(half+1) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
const ll mod = 1000000007;
int main() {
int n;
cin >> n;
vector<int> d(n);
rep(i,n) cin >> d[i];
sort(d.begin(), d.end());
int m = n / 2;
cout << d[m] - d[m - 1] << endl;
return 0;
} | 1 | 38,400,525 |
#include <bits/stdc++.h>
#define rep3(i, s, n, a) for (int i = (s); i < (int)(n); i += a)
#define rep2(i, s, n) rep3(i, s, n, 1)
#define rep(i, n) rep2(i, 0, n)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
int main(){
int n;
cin >> n;
vector<int> h;
rep(i, n){
int x;
cin >> x;
h.push_back(x);
}
h.push_back(0);
int now, top, ans=0;
vector<int> res;
res.push_back(0);
rep(i, n+1){
now = res.back();
while (now > h[i]) {
res.pop_back();
top = res.back();
ans += now - max(top, h[i]);
now = top;
}
if (now < h[i]) {
res.push_back(h[i]);
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
int h[n];
int mx = 0;
for (int i = 0; i < n; i++) {
cin >> h[i];
mx = max(mx, h[i]);
}
int ans = 0;
for (int i = mx; i >= 1; i--) {
int idx = 0;
while (idx < n) {
if (h[idx] == 0) {
idx++;
} else {
ans++;
while (idx < n && h[idx] > 0) {
idx++;
}
}
}
for (int j = 0; j < n; j++) {
if (h[j]) h[j]--;
}
}
cout << ans << endl;
return 0;
} | 1 | 2,472,415 |
#include <bits/stdc++.h>
using namespace std;
bool draw(vector<string> &map, int i, int j){
if (i-1 >= 0){
if (map.at(i-1).at(j) == '#'){
return false;
}
}
if (i+1 <= map.size()-1){
if (map.at(i+1).at(j) == '#'){
return false;
}
}
if (j-1 >= 0){
if (map.at(i).at(j-1) == '#'){
return false;
}
}
if (j+1 <= map.at(0).size()-1){
if (map.at(i).at(j+1) == '#'){
return false;
}
}
return true;
}
int main(){
int h, w;
cin >> h >> w;
vector<string> map(h);
for (int i = 0; i<h; i++){
cin >> map.at(i);
}
for (int i = 0; i<h; i++){
for (int j = 0; j<w; j++){
if (map.at(i).at(j) == '#'){
if (draw(map, i, j)){
cout << "No" << endl;
return 0;
}
}
}
}
cout << "Yes" << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
int main(){
int H,W;cin>>H>>W;
vector<string>field(H);
vector<int>dx={-1,0,1,0};
vector<int>dy={0,1,0,-1};
bool flag2=true;
rep(i,H){
cin>>field.at(i);
}
rep(i,H){
rep(j,W){
bool flag=true;
if(field.at(i).at(j)=='#'){
flag=false;
rep(k,4){
int ny=i+dy[k]; int nx=j+dx[k];
if(ny>=H||ny<0||nx>=W||nx<0){
continue;
}
if(field.at(ny).at(nx)=='#'){
flag=true;
}
}
}
if(flag==false){
flag2=false;
}
}
}
if(flag2){
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<endl;
}
} | 1 | 22,359,742 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define INF 1000000007
int main() {
string s;cin >> s;
int z=0,one=0;
for(int i = 0; i < s.size(); i++) {
if(s[i]=='0') z++;
else one++;
}
cout << 2*min(z,one) << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for(long long int i = 0; i < n; i++)
#define _rep(i, m, n) for(long long int i = m; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll mod = 1000000007;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int dh[8] = {0, 0, 1, 1, 1, -1, -1, -1};
const int dw[8] = {1, -1, 0, 1, -1, 0, 1, -1};
ll gcd(ll A, ll B){
if(B == 0)return A;
return gcd(B, A % B);
}
ll lcm(ll A, ll B){
return A * (B / gcd(A, B));
}
using Edge = pair<int,int>;
using Graph = vector<vector<Edge>>;
Graph G;
int main(){
string s; cin >> s;
int n = s.size();
int r = 0;
rep(i, n){
if(s[i] == '0') r++;
}
cout << n - abs(n - 2 * r) << endl;
} | 1 | 38,283,347 |
#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;
const double pi = acos(-1.0);
int main() {
string s; cin >> s;
ll ans = 0;
rep(i, s.size()-1) if(s[i] != s[i+1]) ans++;
cout << ans << endl;
} | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<deque>
#include<functional>
#include<iterator>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<utility>
using namespace std;
typedef long long ll;
#define a first
#define b second
#define sz(x) (ll)((x).size())
#define pb push_back
#define mp make_pair
#define bg begin()
#define ed end()
#define all(x) (x).bg,(x).ed
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rep1(i,n) for(ll i=1;i<=(n);i++)
#define rrep(i,n) for(ll i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(ll i=(n);i>=1;i--)
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
const ll MOD=1000000007;
const ll INF=1000000000000000;
template<class T> inline bool chmin(T& a, T b){if(a>b){a=b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b){if(a<b){a=b;return true;}return false;}
ll maxx(ll x,ll y,ll z){return max(max(x,y),z);}
ll minn(ll x,ll y,ll z){return min(min(x,y),z);}
ll gcd(ll x,ll y){if(x%y==0) return y;else return gcd(y,x%y);}
ll lcm(ll x,ll y){return x*(y/gcd(x,y));}
ll digsz(ll x){if(x==0) return 1;else{ll ans=0;while(x){x/=10;ans++;}return ans;}}
ll digsum(ll x){ll sum=0;while(x){sum+=x%10;x/=10;}return sum;}
vector<ll> pw2(62,1);vector<ll> pw10(19,1);
int main(){
{rep1(i,61) pw2[i]=2*pw2[i-1];}
{rep1(i,18) pw10[i]=10*pw10[i-1];}
string s; cin>>s;
ll ans=0;
rep(i,sz(s)-1){
if(s[i]!=s[i+1]) ans++;
}
cout<<ans<<endl;
} | 1 | 16,357,798 |
#include <bits/stdc++.h>
using namespace std;
#define forn(i,m,n) for(ll i=m;i<n;i++)
#define vv vector
#define vi vv<int>
#define ii pair<int,int>
#define vii vv<ii>
#define mp make_pair
#define pb push_back
#define PI 3.141592653589
#define ll long long
#define pll pair<ll,ll>
#define vl vv<ll>
#define ff first
#define ss second
#define MOD 1000000007
bool is_prime[1000001];
vi prime;
void sieve(int n)
{
memset(is_prime,true,sizeof(is_prime));
for(int i=2;i*i<=n;i++)
{
if(is_prime[i])
{
for(int j=i*i;j<=n;j+=i)
{
is_prime[j]=false;
}
}
}
forn(i,2,n+1)
{
if(is_prime[i])
prime.pb(i);
}
}
ll ex(ll a,ll b)
{
ll res=1;
a=a%MOD;
while(b)
{
if(b%2){res=(res*a)%MOD;b--;}
b/=2;
a=(a*a)%MOD;
}
return res;
}
ll fermat_inv(ll a){ return ex(a,MOD-2); }
ll max(ll a,ll b){ return a>b?a:b; }
ll min(ll a,ll b){ return a<b?a:b; }
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int te=1;
while(te--)
{
ll n,k;
cin>>n>>k;
ll a[n];
forn(i,0,n)
cin>>a[i];
ll dp[n+1][k+1];
forn(i,0,k+1)
dp[0][i]=0;
dp[0][0]=1;
forn(i,1,n+1)
{
for(ll j=k;j>=0;j--)
{
if(j==k)
dp[i][j]=0;
else
dp[i][j]=dp[i][j+1];
dp[i][j]+=dp[i-1][j-min(a[i-1],j)];
if(j!=k)
dp[i][j]-=dp[i-1][j+1];
dp[i][j]=(dp[i][j]+MOD)%MOD;
}
}
cout<<dp[n][k];
}
} | #include<bits/stdc++.h>
#define M 1000000007
#define pb push_back
#define ll long long int
using namespace std;
int main()
{
int n,k;
cin>>n>>k;
int a[n];
int i,j;
for(i=0;i<n;i++)
cin>>a[i];
ll dp[n][k+1];
ll prefsum[k+1];
for(i=0;i<n;i++)
{
for(j=0;j<=k;j++)
{
if(i==0)
{
dp[i][j] = (j<=a[i]);
}
else
{
dp[i][j] = prefsum[j]-((j-a[i]-1>=0)?prefsum[j-a[i]-1]:0);
dp[i][j] = (dp[i][j]+M)%M;
}
}
prefsum[0] = dp[i][0];
for(int k1 = 1;k1<=k;k1++)
prefsum[k1] = (prefsum[k1-1]+dp[i][k1])%M;
}
cout<<dp[n-1][k];
return 0;
} | 1 | 34,414,559 |
#include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main() {
string s, t;
cin >> s >> t;
sort(s.begin(), s.end());
bool ok = true;
vector<bool> used((int)t.size(), false);
rep(i, (int)s.size()) {
bool flg1 = false;
bool flg2 = false;
rep(j, (int)t.size()) {
if (s[i] < t[j]) {
flg1 = true;
}
else if (!flg2 && s[i] == t[j] && !used[j]) {
flg2 = true;
used[j] = true;
}
}
if (flg1) {
cout << "Yes" << endl;
return 0;
}
else if (!flg2) {
cout << "No" << endl;
return 0;
}
}
rep(i, (int)t.size()) {
if (!used[i]) {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
return 0;
} | #define _GIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(void) {
string s, t;
cin >> s >> t;
sort(s.begin(), s.end());
sort(t.rbegin(), t.rend());
if (s < t) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | 1 | 3,196,352 |
#include<bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(),v.end()
#define puts(i) cout << i << endl
#define INF INT_MAX
#define INFL LLONG_MAX
typedef long long ll;
using namespace std;
int main(){
int n; cin >> n;
vector<int> w(n);
int sum1 = 0;
rep(i,n){
cin >> w.at(i);
sum1 += w.at(i);
}
int ans = INF,sum2 = 0;
rep(i,n){
sum2 += w.at(i);
sum1 -= w.at(i);
ans = min(ans,abs(sum2-sum1));
}
cout << ans << endl;
} | #pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define PI 3.141592
#define all(a) (a).begin(), (a).end()
int main(){
int N;
cin >> N;
vector<int> W(N);
for(int i = 0; i < N; i++) cin >> W[i];
int right = 0;
for(int i = 0; i < N; i++) right += W[i];
int dist = 1000000;
int left = 0;
for(int i = 0; i < N; i++){
left += W[i];
right -= W[i];
dist = min(dist, abs(left-right));
}
cout << dist << endl;
} | 1 | 45,654,749 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)n; ++i)
#define FOR(i, a, b) for(int i = a; i < (int)b; ++i)
using ll = long long;
const int Inf = 100100100;
const double EPS = 1e-9;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int r, d, x;
cin >> r >> d >> x;
rep (i, 10) {
x = x * r - d;
cout << x << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
int main(){
int r,d,x; cin>>r>>d>>x;
ll op = x*1ll;
for(int i=0; i<10; i++){
op = r*op-d;
cout<<op<<endl;
}
return 0;
} | 1 | 79,915,806 |
#include<iostream>
using namespace std;
#define MAX 1000000
bool prime[MAX];
int countPrime(int n){
if(n < 2) return 0;
if(n == 2) return 1;
int ret = 0;
for(int i = 0; i < MAX; i++){
prime[i] = true;
}
for(int i = 2; i * i <= n; i++){
if(prime[i]){
for(int j = i*i; j <= n; j += i){
prime[j] = false;
}
}
}
for(int i = 2; i <= n; i++){
if(prime[i]) ret++;
}
return ret;
}
int main(){
int n;
while(cin >> n){
cout << countPrime(n) << endl;
}
} | #include <cmath>
#include <iostream>
using namespace std;
bool prime_check(int n)
{
if (n == 1)
{
return false;
}
else if (n == 2)
{
return true;
}
else
{
for (int i = 2; i <= sqrt(n); i++)
{
if (n % i == 0)
{
return false;
}
}
}
return true;
}
int main()
{
int n, c;
bool isprime[1000000];
for (int i = 1; i < 1000000; i++)
{
if (prime_check(i) == true)
{
isprime[i] = true;
}
else
{
isprime[i] = false;
}
}
while (cin >> n)
{
c = 0;
for (int i = 2; i <= n; i++)
{
if (isprime[i] == true)
{
c++;
}
}
cout << c << endl;
}
} | 1 | 324,951 |
#include<bits/stdc++.h>
#define INF 100000000000000000
using namespace std;
int main()
{
long long Q,H,S,D;scanf("%lld %lld %lld %lld",&Q,&H,&S,&D);
H=min(Q*2,H);S=min(H*2,S);D=min(S*2,D);
long long N;scanf("%lld",&N);
printf("%lld",N/2*D+N%2*S);
} | #include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
ll a,b,c,d,n;
int main()
{
scanf("%lld%lld%lld%lld%lld",&a,&b,&c,&d,&n);
a=8ll*a;b=4ll*b;c=2ll*c;
if(a<=d||b<=d||c<=d)
{
a=min(a,min(b,c))/2ll;
printf("%lld\n",a*n);
return 0;
}
if(n%2==0)
{
printf("%lld\n",d*n/2ll);
return 0;
}
else
{
ll ans=d*(n/2ll);
ans+=min(a,min(b,c))/2;
printf("%lld\n",ans);
}
return 0;
} | 1 | 11,330,192 |
#include<bits/stdc++.h>
#define ll long long
#define pii pair<ll int,ll int>
#define PI 2*acos(0)
#define INF LONG_LONG_MAX
using namespace std;
const ll int p=998244353;
ll int mod(ll int a,ll int b)
{
ll int m=a%b;
if(m<0) m=(b<0)?(m-b):(m+b);
return m;
}
ll maxpow(ll n)
{
return (n & (~(n-1)));
}
bool isPrime(ll n)
{
if(n<2) return false;
if(n==2) return true;
if(n%2==0) return false;
for(ll i=3;i*i<=n;i+=2){
if(n%i==0) return false;
}
return true;
}
ll lcm(ll a,ll b)
{
ll ans=a*b;
return (ans/__gcd(a,b));
}
ll gcd(ll a,ll b,ll &x,ll &y)
{
if(b==0){
x=1;
y=0;
return a;
}
ll x1,y1;
ll d=gcd(b,mod(a,b),x1,y1);
x=y1;
y=x1-y1*(a/b);
return d;
}
ll abso(ll a)
{
if(a>=0) return a;
return -a;
}
ll div_count(ll n)
{
bool flag[n+1];
memset(flag,1,sizeof(flag));
for(int p=2;p*p<n;p++){
if(flag[p]){
for(int i=p*2;i<n;i+=p) flag[i]=false;
}
}
ll total=1;
for(int p=2;p<=n;p++){
if(flag[p]){
int cnt=0;
while(n%p==0){
n/=p;
cnt++;
}
total*=(cnt+1);
}
}
return total;
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin>>n;
int cnt=0,a,b;
for(a=1;a<=n-1;a++){
cnt+=(n-1)/a;
}
cout<<cnt;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
#define endl "\n"
#define sz(x) (int) (x.size())
#define all(v) v.begin(), v.end()
#define isOdd(n) (n&1)
#define pow(n, m) (ll)powl(n, m)
#define clr(x, val) memset(x, val, sizeof(x))
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef vector<int> vi;
int main()
{
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n; cin >> n;
ll c = 0;
for(int i = 1; i < n; i++){
ll k = i;
while(k < n) c++, k += i;
}
cout << c;
return 0;
} | 1 | 20,403,095 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i=0;i<n;++i)
#define rep2(i,i0,n) for(int i=i0;i<n;++i)
int main()
{
int n,k;
cin >> n >> k;
vector<pair<ll,int>> dt(n);
rep(i,n) cin >> dt[i].second >> dt[i].first;
sort(dt.begin(), dt.end(), greater<pair<ll,int>>());
queue<ll> q0;
queue<ll> q1;
unordered_map<int, int> mp;
ll tmp = 0;
rep(i,k) {
ll di = dt[i].first;
ll ti = dt[i].second;
tmp += di;
if(mp.count(ti) == 0) { mp[ti] = 1; }
else { ++mp[ti]; }
}
ll x = mp.size();
tmp += x*x;
ll ans = tmp;
for(int i=k-1;i>=0;--i) {
ll di = dt[i].first;
ll ti = dt[i].second;
if(mp[ti] > 1) {
q0.push(di);
--mp[ti];
}
}
rep2(i,k,n) {
ll di = dt[i].first;
ll ti = dt[i].second;
if(mp.count(ti) == 0) {
q1.push(di);
mp[ti] = 1;
}
}
while(!q0.empty() && !q1.empty()) {
tmp = tmp - q0.front() + q1.front() + 2*x + 1;
ans = max(ans, tmp);
q0.pop(); q1.pop();
++x;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define rep1(i,n) for(int i=1;i<=(int)n;i++)
#define rep2(i,j,n) for(int j=i;j<n;j++)
#define rep3(i,j,n) for(int j=i;j<=n;j++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define sp(n) cout << fixed << setprecision(n)
typedef long long ll;
using namespace std;
int main(void){
int n,k;cin>>n>>k;
map<ll,ll> mp;
priority_queue<pair<ll,ll>> que;
priority_queue<pair<ll,ll>, vector<pair<ll,ll>>, greater<pair<ll,ll>> > que2;
rep(i,n){
ll x,t;cin>>x>>t;
que.push({t,x});
}
ll res1=0,st=0;
rep(i,k){
auto p=que.top();que.pop();
ll t=p.second,d=p.first;
res1+=d;
if(mp[t]!=0){
mp[t]++;
que2.push({d,t});
}else{
mp[t]++;
}
}
st=mp.size();
ll res=res1+st*st;
while(que.size()&&que2.size()){
auto p=que.top();que.pop();
ll t=p.second,d=p.first;
if(mp[t]!=0)continue;
auto p2=que2.top();que2.pop();
ll t2=p2.second,d2=p2.first;
st++;
mp[t]--;
mp[t2]++;
res1+=(d-d2);
res=max(res,res1+st*st);
}
cout<<res<<endl;
} | 1 | 82,523,236 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using ll = long long;
int main(void){
int R;
cin>>R;
if(R<1200){
cout<<"ABC"<<endl;
}
else if(R<2800){
cout<<"ARC"<<endl;
}
else{
cout<<"AGC"<<endl;
}
} | #include "bits/stdc++.h"
#define rep(i, j) for (int i = 0; i < j; i++)
using namespace std;
using ll = long long;
int gcd(int x, int y);
const int INF = 1001001001;
int main() {
int r;
cin >> r;
if (r < 1200)
cout << "ABC" << endl;
else if (r < 2800)
cout << "ARC" << endl;
else
cout << "AGC" << endl;
return 0;
}
int gcd(int x, int y) {
int num[3];
num[0] = (x > y) ? x : y;
num[1] = (x <= y) ? x : y;
num[2] = num[0] % num[1];
while (num[2]) {
num[0] = num[1];
num[1] = num[2];
num[2] = num[0] % num[1];
}
return num[1];
} | 1 | 50,253,222 |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
typedef long long ll;
const ll LIM = 1e10;
vector<ll> a(100010);
bool check(int key,int index){
if(a[index]>=key)return true;
else return false;
}
int binary_search(int key){
int ok,ng;
ok=a.size();
ng=-1;
while(abs(ok-ng)!=1){
int mid = (ok+ng)/2;
if(check(key,mid)){
ok = mid;
}else ng = mid;
}
return ok;
}
int main(){
int n;
cin >> n;
a.resize(n);
fill(a.begin(),a.end(),LIM);
int i;
for(i=0;i<n;i++){
ll x;
cin >> x;
int p=binary_search(x);
a[p] = x;
}
for(i=0;i<n;i++){
if(a[i]==LIM)break;
}
cout << i << endl;
return 0;
} | #include <iostream>
#include <cstdio>
using namespace std;
int n, a;
int main() {
cin >> n;
int dp[n];
fill(dp, dp+n, 1001001001);
for (int i = 0; i < n; i++) {
scanf("%d", &a);
*lower_bound(dp, dp+n, a) = a;
}
printf("%d\n", (int)(lower_bound(dp, dp+n, 1001001001)-dp));
} | 1 | 66,902,363 |
#include<iostream>
#include<algorithm>
using namespace std;
int main (void)
{
string s;
cin>>s;
int n,i;
n=s.size();
for(i=0;i<n/2;i++)
{
if(s[i]!=s[n-1-i]){cout<<"No"<<endl;return 0;}
}
n=n/2;
for(i=0;i<n/2;i++)
{
if(s[i]!=s[n-1-i]){cout<<"No"<<endl;return 0;}
}
cout<<"Yes"<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define all(v) (v).begin(), (v).end()
#define int long long
#define sz(v) (int)(v).size()
#define mod 1000000007
void solve() {
string str; cin >> str;
bool b1= 1, b2= 1;
int n= str.size();
for (int i= 0; i< n/ 2; i++) {
if (str[i]!= str[n/ 2- 1- i]) b1= 0;
}
for (int i= n/ 2+ 1; i< n; i++) {
if (str[i]!= str[n- 1- i]) b1= 0;
}
if (b1&& b2) cout << "Yes\n";
else cout << "No\n";
}
int32_t main(){
ios::sync_with_stdio(0), cin.tie(NULL), cout.tie(NULL);
int T= 1;
while ( T-- ) solve();
return 0;
} | 1 | 35,536,472 |
#define _USE_MATH_DEFINES
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll LINF = 1e18;
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#define prev asdprev
#define MP make_pair
#define F first
#define S second
#define PB push_back
#define dump(x) cout << #x << " = " << (x) << endl;
#define SZ(x) ((ll)(x).size())
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
#define RFOR(i, a, b) for (ll i = (a); i >= (b); i--)
#define ps(s) cout << #s << endl;
#define pv(v) cout << (v) << endl;
#define pvd(v) cout << setprecision(16) << (v) << endl;
#define ALL(a) (a).begin(),(a).end()
#define RANGE(a, left, right) (a).begin()+(left),(a).begin()+(right)
int main() {
string s;
cin >> s;
int len = s.size();
int bcnt = 0;
int lastw = 0;
ll res = 0;
FOR(i, 0, len - 1) {
if (s[i] == 'B') {
bcnt++;
}
else {
lastw += bcnt;
bcnt = 0;
res += lastw;
}
}
pv(res)
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<ll,ll>;
const ll mod = 1e9+7;
#define ALL(x) (x).begin(),(x).end()
#define pow(x,y) modpow(x,y)
#define REP(i,n) for(ll (i)=0;(i)<(n);(i)++)
#define REPS(i,n) for(ll (i)=1;(i)<=(n);(i)++)
#define RREP(i,n) for(ll (i)=(n-1);(i)>=0;(i)--)
#define RREPS(i,n) for(ll (i)=(n);(i)>0;(i)--)
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define UNIQUE(v) v.erase(unique(ALL(v)),v.end());
template<class T> inline void chmin(T& a, T b){
if (a > b){
a = b;
}
}
template<class T> inline void chmax(T& a, T b){
if (a < b){
a = b;
}
}
signed main(){
cin.tie(0);
ios::sync_with_stdio(false);
cout<<fixed<<setprecision(10);
string S;
cin >> S;
reverse(ALL(S));
ll count = 0;
int where = 0;
REP(i,S.size()){
if(S[i] == 'B'){
count += i - where;
where++;
}
}
cout << count << "\n";
} | 1 | 47,278,208 |
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep2(i, m, n) for(int i = (int)(m); i < (int)(n); i++)
#define rep_inv(i, n, m) for(int i = (int)(n); i > (int)(m); i--)
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vc = vector<char>;
using vvl = vector<vl>;
using vvc = vector<vc>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
int main(){
string s;
cin >> s;
for(int i = 0; i <= s.size() - 1; i += 2){
cout << s[i];
}
cout << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
string s;
cin>>s;
for(int i=0;i<s.size();i+=2) {
cout<<s[i];
}
return 0;
} | 1 | 79,870,854 |
#include <bits/stdc++.h>
using namespace std;
#define pi acos(-1)
#define IOS ios_base::sync_with_stdio(0); cin.tie(); cout.tie();
#define fi first
#define se second
#define pf push_front
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define debug(x) cerr<<#x<<": "<<(x)<<'\n'
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
const ll mod = 1e9 + 7;
const ll inf = 0x3f3f3f3f;
const ll nax = 0;
int main(){
IOS
int ans=0, x;
cin >> x;
int ba=0;
while(1){
if((ba%360==0) && ans>0){
break;
}
ans++;
ba=(ba+x)%360;
}
cout << ans << '\n';
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int x;
cin>>x;
for(int i=1;i<=360;i++){
if(x*i%360==0){
cout<<i<<endl;
return 0;
}
}
} | 1 | 77,604,675 |
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define FORD(i, a, b) for (int i = (a); i >= (b); --i)
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define maxc 1000000007
#define maxn 100005
#define maxm 1000006
#define pii pair <int,int>
#define Task ""
template <typename T> inline void read(T &x){char c;bool nega=0;while((!isdigit(c=getchar()))&&(c!='-'));if(c=='-'){nega=1;c=getchar();}x=c-48;while(isdigit(c=getchar())) x=x*10+c-48;if(nega) x=-x;}
template <typename T> inline void writep(T x){if(x>9) writep(x/10);putchar(x%10+48);}
template <typename T> inline void write(T x){if(x<0){putchar('-');x=-x;}writep(x);putchar(' ');}
template <typename T> inline void writeln(T x){write(x);putchar('\n');}
using namespace std;
int n,gt[maxn << 1],ans,cur;
int main()
{
ios_base::sync_with_stdio(NULL);cin.tie(NULL);cout.tie(NULL);
cin >> n;
n <<= 1;
gt[0] = 1;
FOR(i,1,n) gt[i] = (1ll*gt[i-1]*i) % maxc;
ans = gt[n / 2];
FOR(i,1,n)
{
int x;
char c;
cin >> c;
x = (c == 'W');
if (x)
{
if (cur & 1)
{
++cur;
}
else
{
ans = (1ll*ans*cur) % maxc;
--cur;
}
}
else
{
if (cur & 1)
{
ans = (1ll*ans*cur) % maxc;
--cur;
}
else
{
++cur;
}
}
}
if (cur) ans = 0;
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl
using ll = long long;
const ll mod = 1e9+7;
const int maxn = 1e6 + 5;
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int n;
cin>>n;
n *= 2;
string s;
cin>>s;
vector<int> a(n, 0);
for (int i=0; i<n; i++) {
if (s[i]=='B') a[i]=1;
}
ll open = 0;
ll ans = 1;
for (int i=0; i<n; i++) {
if ((a[i]+open)%2==0) {
ans=ans*open%mod;
open--;
} else {
open++;
}
if (open<0 || open>n) out(0);
}
if (open != 0) out(0);
n /= 2;
for (int i=1; i<=n; i++) {
ans=ans*i%mod;
}
cout<<ans<<endl;
return 0;
} | 1 | 66,248,382 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
long long N;cin>>N;
long long ans=0;
for(long long i=1;i<N;i++){
ans+=i;
}
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
#define DAU ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define PLEC exit(0);
using namespace std;
long long n, res;
int main() {
DAU
cin >> n;
res = n * (n - 1) / 2;
cout << res;
PLEC
} | 1 | 78,592,839 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N;
cin >> A >> B;
int a, b = 0;
vector<int> P(N);
for(int i = 0; i < N; i++) {
cin >> P.at(i);
}
for(int i = 0; i < N; i++) {
if(P.at(i) <= A) {
a++;
}
}
for(int i = 0; i < N; i++) {
if(P.at(i) >= B+1) {
b++;
}
}
cout << min(a,min(b,N-a-b)) << endl;
} | #include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
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(){
cin.tie(0);
ios::sync_with_stdio(false);
int n, a, b;
cin >> n >> a >> b;
int c = 0, d = 0, e = 0;
rep(i,n){
int p;
cin >> p;
if(p <= a) ++c;
else if(p <= b) ++d;
else ++e;
}
int ans = min({c, d, e});
cout << ans << endl;
return 0;
} | 1 | 55,723,737 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <cmath>
#include <string>
#include <cstring>
#include <sstream>
#include <iomanip>
using namespace std;
#define ll long long
#define vvi vector< vector<int> >
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define All(X) (X).begin(),(X).end()
ll int INF = 10000000023;
int main(){
int n;
int a[100000];
ll int dp[100010];
cin >> n;
REP(i,n) cin >> a[i];
REP(i, n+1) dp[i] = INF;
REP(i,n){
int j = 0;
ll int* p = lower_bound(dp, dp + n, a[i]);
*p = a[i];
}
ll int* p = lower_bound(dp, dp + n, INF);
cout << p - dp << endl;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
const int INF = 1000000010;
void Main() {
int n;
cin >> n;
vector<int> a(n, 0);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
vector<int> dp(n, INF);
for (int i = 0; i < n; ++i) {
auto it = lower_bound(dp.begin(), dp.end(), a[i]);
*it = a[i];
}
int ans = distance(dp.begin(), lower_bound(dp.begin(), dp.end(), INF));
cout << ans << endl;
}
int main() {
std::cout << std::fixed << std::setprecision(15);
Main();
return 0;
} | 1 | 16,110,160 |
#include<iostream>
#include<algorithm>
using namespace std;
int a[100010],ans;
int main()
{
int n;
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>a[i];
}
sort(a+1,a+n+1);
for(int i=2;i<=n;i++)
{
if(a[i]==a[i-1])
{
ans++;
}
}
if(ans%2)
{
ans++;
}
cout<<n-ans<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, s = 0, d = 0, v[100000];
cin >> n;
int a[n];
for (int i = 0; i < 100000; i++) v[i] = 0;
for (int i = 0; i < n; i++)
{
cin >> a[i];
v[a[i] - 1]++;
}
for (int i = 0; i < 100000; i++)
{
if (v[i] != 0)
{
d++;
s += (v[i] - 1);
}
}
cout << d - s % 2;
} | 1 | 82,807,565 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,p,q,r;
cin >> p >> q >> r;
if(p>=q && p>=r)
{
a = q + r;
}
if(q>=p && q>=r)
{
a = p + r;
}
if(r>=p && r>=q)
{
a = p + q;
}
cout << a;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i, s, n) for (int i = (s); i < (n); i++)
#ifdef LOCAL
#define INPUT_FILE \
ifstream in("atcoder-problems/abc129_a.txt"); \
cin.rdbuf(in.rdbuf());
#define print_vec(v) \
rep(l, v.size()) { cout << v[l] << " "; } \
cout << endl;
#else
#define INPUT_FILE
#define print_vec(v)
#endif
#define CIN_OPTIMIZE \
cin.tie(0); \
ios::sync_with_stdio(false);
typedef pair<int, int> P;
typedef long long ll;
typedef pair<ll, ll> pl;
const int INF = 100100100;
const ll LINF = 1e18+100;
const int MOD = 1e9 + 7;
int main() {
INPUT_FILE CIN_OPTIMIZE;
vector<int> c(3);
rep(i, 3) { cin >> c[i]; }
sort(c.begin(), c.end());
cout << c[0] + c[1] << endl;
} | 1 | 52,522,304 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int MAX_N = 100005;
ll A[MAX_N],B[MAX_N];
map<ll,ll> C;
int main()
{
int N;
ll M;
cin >> N >> M;
rep(i,N)
{
cin >> A[i];
A[i] %= M;
}
B[0] = 0;
rep(i,N)
{
B[i+1] = (B[i] + A[i]) % M;
}
ll ans = 0;
C[B[0]]++;
rep(i,N)
{
ans += C[B[i+1]];
C[B[i+1]]++;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define ll long long
#define ld long double
#define rep(i, n) for(ll i = 0; i < n; ++i)
#define rep2(i, a, b) for(ll i = a; i <= b; ++i)
#define rrep(i, a, b) for(ll i = a; i >= b; --i)
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define vi vector<int>
#define vll vector<ll>
#define vpi vector<pii>
#define vpll vector<pll>
#define all(a) a.begin(), a.end()
#define endl '\n'
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
const int MOD=1e9+7;
const ll INF=1e18;
const double PI=acos(-1);
int dx[8] = {1,0,-1,0,1,1,-1,-1};
int dy[8] = {0,1,0,-1,-1,1,1,-1};
int ddx[5] = {2,1,0,-1,-2};
int ddy[5] = {2,1,0,-1,-2};
const int MAX=510000;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<int> a(n);
rep(i,n) cin >> a[i];
vector<ll> s(n+1);
rep(i,n) s[i+1] = s[i] + a[i];
map<ll,ll>mp;
rep(i,n+1){
ll x = s[i];
x %= m;
mp[x]++;
}
ll ans = 0;
for(auto p:mp){
ans += p.second*(p.second-1)/2;
}
cout << ans << endl;
return 0;
} | 1 | 57,961,745 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <ctime>
#include <queue>
#include <map>
#include <set>
#include <tuple>
#include <functional>
#include <cassert>
#include <bitset>
#include <numeric>
using namespace std;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define ALL(x) (x).begin(),(x).end()
#define RALL(x) (x).rbegin(),(x).rend()
#define SIZE(x) (int)(x).size()
#define SIZEL(x) (ll)(x).size()
#define MSG(a) cout << #a << " " << a << endl;
using ll = long long;
using ld = long double;
using Graph = vector<vector<int>>;
const double PI = 3.14159265358979323846;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
ll gcd(ll x, ll y) { return (x % y)? gcd(y, x % y): y; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
int main()
{
string s,t;
cin >> s >> t;
int slen = s.size();
int tlen = t.size();
int maxIdx = -1;
REP(i, slen-tlen+1){
bool contains = true;
REP(j, tlen){
if (s[i+j] == t[j] || s[i+j]=='?') continue;
contains = false;
break;
}
if (contains) maxIdx=i;
}
if (maxIdx>=0) {
REP(i,tlen) s[maxIdx+i] = t[i];
REP(i,slen){
if (s[i]=='?') s[i]='a';
}
cout << s << endl;
}else{
cout << "UNRESTORABLE" << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(10);
string S, T; cin >> S >> T;
int N = S.size();
int M = T.size();
if (N < M) {
cout << "UNRESTORABLE\n";
return 0;
}
bool T_found = false;
for (int i = N - M; 0 <= i; i--) {
bool found = true;
rep(j, M) {
if (S[i + j] == '?') continue;
if (S[i + j] != T[j]) {
found = false;
break;
}
}
if (found) {
T_found = true;
rep(j, M) S[i + j] = T[j];
break;
}
}
if (!T_found) {
cout << "UNRESTORABLE\n";
return 0;
}
rep(i, N) {
if (S[i] == '?') S[i] = 'a';
}
cout << S << '\n';
return 0;
} | 1 | 93,567,401 |
#include <iostream>
#include <cstdio>
using namespace std;
typedef long long ll;
ll n, b, ca, cb, a[10005];
int main() {
ll i;
cin >> n;
for(i=0; i<n; i++) scanf("%lld", &a[i]);
for(i=0; i<n; i++) {
scanf("%lld", &b);
if(b < a[i]) ca += a[i]- b;
else if(b > a[i]) cb += b-a[i] >> 1;
}
puts(cb>=ca ? "Yes" : "No");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i, to) for (li i = 0; i < ((li)(to)); i++)
#define repp(i, start, to) for (li i = (li)(start); i < ((li)(to)); i++)
li a[10100];
li b[10100];
li n;
inline bool check() {
cin >> n;
li sa = 0;
rep(i, n) {
cin >> a[i];
sa += a[i];
}
li sb = 0;
rep(i, n) {
cin >> b[i];
sb += b[i];
}
if (sa > sb) {
return false;
}
li num = sb - sa;
li num1 = num;
rep(i, n) {
if (a[i] < b[i]) {
li cnt = (b[i] - a[i] + 1) / 2;
a[i] += cnt * 2;
num1 -= cnt;
}
}
if (num1 < 0) {
return false;
}
a[0] += num1 * 2;
li num2 = num;
rep(i, n) {
if (a[i] > b[i]) {
num2 -= (a[i] - b[i]);
}
}
return num2 == 0;
}
int main() {
cout << (check() ? "Yes" : "No") << endl;
return 0;
} | 1 | 44,719,183 |
#include<bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define loop(i,n)for(i=0;i<n;i++)
#define INF 1000000000
using ll = long long int;
typedef pair<int,int> pii;
typedef vector<pii> vii;
typedef vector<int> vi;
#define MAX 100005
int main()
{
IOS;
ll n;cin>>n;
ll ar[n];
ll count = 0;ll mi;
for(ll i=0;i<n;i++)
{
ll x;cin>>x;
if(i==0)mi = x;
else if(x>mi)count++;
else mi = x;
}
cout<<n-count<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; ++i)
int main() {
int n;
cin >> n;
queue<int> que;
rep(i, n) {
int p;
cin >> p;
if(i == 0) que.push(p);
else {
if(que.back() > p) que.push(p);
}
}
cout << que.size() << endl;
} | 1 | 92,954,460 |
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
int main() {
ll X,t;
cin>>X>>t;
if(X>t) {
cout<<X-t<<endl;
return 0;
}
cout<<0<<endl;
} | #include"bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
int x, t;
cin >> x >> t;
if (x > t) {
cout << x - t << endl;
}
else {
cout << 0 << endl;
}
return 0;
} | 1 | 30,648,882 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vpi vector<pii>
#define vpll vector<pll>
#define endl '\n'
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define em emplace
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rep2(i, n, m) for (ll i = n; i <= m; ++i)
#define rep3(i, n, m) for (ll i = n; i >= m; --i)
#define all(v) v.begin(), v.end()
#define si(v) int(v.size())
#define UNIQUE(v) sort(all(v)), v.erase(unique(all(v)),v.end())
const ll mod = 1e9 + 7;
const ll infll = (1LL << 62) - 1;
const ll inf = (1LL << 30) - 1;
template<class S, class T> inline bool chmax(S &a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class S, class T> inline bool chmin(S &a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T> using pq = priority_queue<T>;
template<class T> using pqg = priority_queue<T, vector<T>, greater<T>>;
signed main()
{
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cout << fixed << setprecision(15);
int x; cin >> x;
if (x < 600) cout << 8 << endl;
else if (x < 800) cout << 7 << endl;
else if (x < 1000) cout << 6 << endl;
else if (x < 1200) cout << 5 << endl;
else if (x < 1400) cout << 4 << endl;
else if (x < 1600) cout << 3 << endl;
else if (x < 1800) cout << 2 << endl;
else if (x < 2000) cout << 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define REP(i, n) for(int i = 0; i < (n); ++i)
#define REPr(i, n) for(int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for(int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for(int i = (n); i >= (m); --i)
#define MP make_pair
#define SIN(x, S) (S.count(x) != 0)
#define M0(x) memset(x, 0, sizeof(x))
#define FILL(x, y) memset(x, y, sizeof(x))
#define MM(x) memset(x, -1, sizeof(x))
#define ALL(x) (x).begin(), (x).end()
#define DB(x) cerr << #x << " = " << x << endl
#define DB2(x, y) \
cerr << "(" << #x << ", " << #y << ") = (" << x << ", " << y << ")\n";
#define DEBUG \
int x12345; \
cin >> x12345;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef long long ll;
typedef long long integer;
const long long MOD = 1e9 + 7;
template <class T> inline bool chmin(T &a, T b) {
if(a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
int main() {
int X;
cin >> X;
int rank = 8;
if (X >= 600) rank = 7;
if (X >= 800) rank = 6;
if (X >= 1000) rank = 5;
if (X >= 1200) rank = 4;
if (X >= 1400) rank = 3;
if (X >= 1600) rank = 2;
if (X >= 1800) rank = 1;
cout << rank << endl;
} | 1 | 60,436,735 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
typedef pair<int,int> P;
using ll = long long;
const int INF=1e9;
int main(){
int n,m;
vector<int> mp[100005];
vector<int> ans(100005,-1);
cin>>n>>m;
vector<int> dist(n,INF);
rep(i,m){
int a,b;
cin>>a>>b;
a--;b--;
mp[a].push_back(b);
mp[b].push_back(a);
}
dist[0]=0;
ans[0]=0;
queue<int> que;
que.push(0);
while(!que.empty()){
int q=que.front();que.pop();
for(auto u:mp[q]){
if(dist[u]!=INF) continue;
dist[u]=dist[q]+1;
que.push(u);
ans[u]=q;
}
}
cout<<"Yes"<<endl;
for(int i=1;i<n;i++) cout<<ans[i]+1<<endl;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VLL = vector<LL>;
using VVLL = vector<VLL>;
using VS = vector<string>;
using PII = pair<int,int>;
using VP = vector<PII>;
using VB = vector<bool>;
using VVB = vector<VB>;
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define RREP(i,m,n) for(int i=(m);i>=(n);i--)
int main(){
int n,m;
cin >> n >> m;
VI a(m),b(m),sign(n+1,-1);
VVI g(n+1, VI());
REP(i,0,m){
cin >> a[i] >> b[i];
g[a[i]].push_back(b[i]);
g[b[i]].push_back(a[i]);
}
queue<PII> q;
q.push(make_pair(1,0));
while(!q.empty()){
PII cur = q.front();
q.pop();
int x = cur.first;
int y = cur.second;
for(int z : g[x]){
if(sign[z] == -1){
q.push(make_pair(z,x));
sign[z] = x;
}
}
}
cout << "Yes" << endl;
REP(i,2,n+1){
cout << sign[i] << endl;
}
return 0;
} | 1 | 74,675,613 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int A,B;
cin >> A >> B;A --;B --;
bool b[50][100],w[50][100];
fill(b[0],b[50],false);
fill(w[0],w[50],false);
for(int j = 0;j < 50;j += 2){
for(int i = 0;i < 100;i += 2){
if(A==0&&B==0) break;
if(B>0){b[j][i]=true;B --;}
if(A>0){w[j+1][i]=true;A --;}
}
if(A==0&&B==0) break;
}
cout << 100 << " " << 100 << endl;
for(int j = 0;j < 50;j ++){
for(int i = 0;i < 100;i ++){
if(b[j][i]) cout << '#';
else cout << '.';
}
cout << endl;
}
for(int j = 0;j < 50;j ++){
for(int i = 0;i < 100;i ++){
if(w[j][i]) cout << '.';
else cout << '#';
}
cout << endl;
}
return 0;
} | #include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
#include <functional>
#include <cmath>
#include <set>
#include <queue>
#include <vector>
#include <climits>
#include <sstream>
#include <iomanip>
#include <map>
using namespace std;
int main()
{
int A, B;
cin >> A >> B;
vector<string> mat;
for (auto i = 0; i < 100; ++i)
{
if (i < 50)
{
mat.push_back(string(100, '.'));
}
else
{
mat.push_back(string(100, '#'));
}
}
for (auto i = 0; i < 50; i += 2)
{
if (B - 1 <= 0)
{
break;
}
for (auto j = 0; j < 100; j += 2)
{
mat[i][j] = '#';
--B;
if (B - 1 <= 0)
{
break;
}
}
}
for (auto i = 0; i < 50; i += 2)
{
if (A - 1 <= 0)
{
break;
}
for (auto j = 0; j < 100; j += 2)
{
mat[99 - i][j] = '.';
--A;
if (A - 1 <= 0)
{
break;
}
}
}
cout << 100 << " " << 100 << endl;
for (auto i = 0; i < 100; ++i)
{
cout << mat[i] << endl;
}
return 0;
} | 1 | 6,162,237 |
#include<bits/stdc++.h>
using namespace std;
void AC(){cout<<"AC\n";exit(0);}
void WA(){cout<<"WA\n";exit(0);}
signed main()
{
ios::sync_with_stdio(0);
cin.tie(0);
string s;
cin>>s;
if(s[0]!='A'||s[1]=='C'||s[s.size()-1]=='C')WA();
int C=0;
for(int i=1;i<s.size();i++)
{
if(isupper(s[i])&&s[i]!='C')WA();
if(i!=1&&s[i]=='C')C++;
if(C>1)WA();
}
if(!C)WA();
AC();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S; cin >> S;
int cnt = 0;
if (S.at(0) != 'A') {
cout << "WA" << endl;
return 0;
}
for (int i = 1; i < S.size(); i++) {
if (S.at(i) > 96) continue;
else if (i >= 2 && i <= S.size() - 2) {
if (S.at(i) == 'C') cnt++;
} else {
cout << "WA" << endl;
return 0;
}
}
if (cnt == 1) {
cout << "AC" << endl;
} else cout << "WA" << endl;
} | 1 | 94,617,612 |
#include <iostream>
#include <vector>
#include <utility>
#include <string>
#include <algorithm>
#include <numeric>
using namespace std;
int main() {
int n,count=0;
bool left = true, right = true, all = true;
vector<string> v;
for (;;) {
cin >> n;
if (n == 0)break;
v.resize(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
for (int i = 0; i < n; i++) {
if (v[i] == "lu") left = false;
if (v[i] == "ru") right = false;
if (v[i] == "ld") left = true;
if (v[i] == "rd") right = true;
if (all == true) {
if (left == false && right == false) {
count++;
all = false;
}
}
else {
if (left == true && right == true) {
count++;
all = true;
}
}
}
cout << count << endl;
count = 0;
left = true; right = true; all = true;
}
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
while(cin >> N, N){
int cnt = 0;
string s;
bool l = false, r = false, a = true, b = false;
for(int i = 0 ; i < N ; i++){
cin >> s;
if(s == "lu"){
if(r && a) cnt++, a = false, b = true;
l = true;
}else if(s == "ru"){
if(l && a) cnt++, a = false, b = true;
r = true;
}else if(s == "ld"){
if(!r && b) cnt++, a = true, b = false;
l = false;
}else{
if(!l && b) cnt++, a = true, b = false;
r = false;
}
}
cout << cnt << endl;
}
return 0;
} | 1 | 74,357,118 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define ll long long
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define sz(a) ll((a).size())
#define all(a) (a).begin(), (a).end()
#define REP(i,n) for(int i=0;i<(n);++i)
#define REPD(i,n) for(int i=(n)-1;i>=0;--i)
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define FORD(i,a,b) for(int i=(a);i>=(b);--i)
const ll MOD = 1E9+7;
const ll INF = 1E18;
const double EPS = 1E-9;
const double PI = atan(1.0) * 4.0;
template<class T> T getbit(T s, int i) {return s>>i&1;}
template<class T> void flipbit(T& s, int i) {s^=(1LL<<i);}
constexpr int cntbit(ll x) {return __builtin_popcountll(x);}
constexpr int lg2(ll x) {return __lg(x);}
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count());
ll fpow(ll a,ll p){ll res=1LL;while(p){if(p&1LL) res=res*a%MOD;a=a*a%MOD;p>>=1LL;} return res;}
int main() {
ios_base::sync_with_stdio(0);cin.tie(0);
ll res=0;
int n;cin>>n;
ll best=INF;
REP(i,n){
ll a,b;
cin>>a>>b;
res+=a;
if(a>b) best=min(best,b);
}
if(best==INF) exit(puts("0\n")*0);
cout<<res-best<<'\n';
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define all(x) (x).begin(),(x).end()
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VLL;
typedef vector<VLL> VVLL;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
inline ll toLL(string s) {ll v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
VLL a(n),b(n);
rep(i,n) cin >> a[i] >> b[i];
int cnt = 0;
rep(i,n){
if(a[i] - b[i] == 0) cnt++;
}
if(cnt == n){
cout << 0 << endl;
return 0;
}
ll ans = 0;
ll m = 1e9;
rep(i,n){
ans += a[i];
if( a[i] > b[i] ) m = min<ll>(m,b[i]);
}
cout << ans-m << endl;
return 0;
} | 1 | 29,382,356 |
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <set>
#include <map>
using namespace std;
long cnt[300000];
long sum[300001];
long cumsum[300001];
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout << setprecision(10) << fixed;
long N;
cin >> N;
for(long i = 0; i < N; i++){
long a;
cin >> a;
a--;
cnt[a]++;
}
sort(cnt, cnt+N);
for(long i = 0; i < N; i++){
if(i == 0) cumsum[i] = cnt[i];
else cumsum[i] = cumsum[i-1]+cnt[i];
}
cout << N << endl;
for(long i = 2; i <= N; i++){
long l = 0;
long r = N;
while(r-l > 1){
long c = (l+r)/2;
long *p = upper_bound(cnt, cnt+N, c);
long m = p-cnt;
long t = cumsum[m-1]+c*(N-m);
if(t >= c*i) l = c;
else r = c;
}
cout << l << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int n;
const int maxn = 3e5+5;
int sum[maxn];
int fuck[maxn];
int main()
{
scanf("%d", &n);
memset(sum,0,sizeof(sum));
memset(fuck,0,sizeof(fuck));
for(int i=1;i<=n;i++){
int x;
scanf("%d",&x);
sum[x]++;
fuck[sum[x]]++;
}
for(int i=1;i<=n;i++)
fuck[i]+=fuck[i-1];
int now = n;
for(int i=1;i<=n;i++){
while(fuck[now]<i*now){
now--;
}
printf("%d\n", now);
}
return 0;
} | 1 | 95,098,904 |
#include<bits/stdc++.h>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
double pai=3.141592653589;
int m,h,l;
char s[200];
string ans,tmp1,tmp2;
for(;;){
scanf("%s",&s);
tmp1=s;
if(tmp1=="-"){
break;
}
scanf("%d",&m);
l=tmp1.length();
for(int i=0;i<m;i++){
scanf("%d",&h);
ans="";
ans.assign(tmp1,h,l-h+1);
tmp2.assign(tmp1,0,h);
ans+=tmp2;
tmp1=ans;
}
printf("%s\n",ans.c_str());
}
return 0;
} | #include<iostream>
#include<string>
#include<cctype>
using namespace std;
string shuffle(string str, int h){
string str1 = str.substr(0,h);
string str2 = str.substr(h, str.size()-h);
return str2 + str1;
}
int main(){
string card;
int i, h;
while(1){
cin>>card;
if (card=="-") break;
cin>>i;
for(int k=0; k<i; k++){
cin>>h;
card=shuffle(card,h);
}
cout<<card<<endl;
}
return 0;
} | 1 | 91,752,066 |
#include <iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<iomanip>
#include<sstream>
#include<cmath>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define req(i,n) for(long long int i = 1;i <= n; i++)
#define rrep(i,n) for(int i = n -1;i >= 0;i--)
typedef long long int ll;
typedef long double ld;
const ll inf = (1LL << 60);
const int MOD = 1000000007;
template<typename A, size_t N, typename T>
void Fill(A(&array)[N], const T & val) {
std::fill((T*)array, (T*)(array + N), val);
}
int main() {
int n; cin >> n; vector<ll> c(n), s(n), f(n);
rep(i, n - 1) cin >> c[i] >> s[i] >> f[i];
rep(i, n) {
int t = 0;
for (int j = i; j < n - 1;j++) {
if (t < s[j]) t = s[j];
else if (t % f[j] == 0);
else t = t + f[j] - (t % f[j]);
t += c[j];
}
cout << t << endl;
}
} | #include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
const double PI = 3.14159265358979;
void solve()
{
int n;
cin >> n;
int now = 0;
vector<int> ans(n, 0);
int c, s, f;
for(int i = 0; i < n - 1; ++i)
{
cin >> c >> s >> f;
for(int j = 0; j <= i; ++j)
{
ans[j] = max(ans[j], s);
if (ans[j] % f > 0) ans[j] += f - (ans[j] % f);
ans[j] += c;
}
}
for(const auto& a : ans)
{
cout << a << endl;
}
}
int main()
{
fastio;
solve();
return 0;
} | 1 | 31,960,895 |
#include <iostream>
#include <vector>
#include<algorithm>
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 ans = 0;
for(int i = 0;i < n;i++){
if(i == a[a[i] - 1] - 1)ans++;
}
ans /= 2;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
#define VL vector<ll>
#define VS vector<string>
#define VB vector<bool>
#define VP vector<pair<ll,ll>>
#define VVL vector<vector<ll>>
#define VVP vector<vector<pair<ll,ll>>>
#define PL pair<ll,ll>
#define ALL(v) (v).begin(), (v).end()
ll d1[4] = {1, -1, 0, 0};
ll d2[4] = {0, 0, 1, -1};
int main(){
ll N;
cin >> N;
VL d(N);
rep(i, 0, N){
ll a;
cin >> a;
a--;
d[i] = a;
}
VB seen(N, false);
ll ans = 0;
rep(i, 0, N){
if(d[d[i]] == i){
if(!seen[i]){
ans++;
seen[d[i]] = true;
}
}
}
cout << ans << endl;
return 0;
} | 1 | 54,272,923 |
Subsets and Splits