code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 2
101M
|
|---|---|---|---|
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <map>
#include <utility>
#define rep(i,j,k) for(int i = j; i <= k; i++)
#define dow(i,j,k) for(int i = j; i >= k; i--)
using namespace std;
const int N = 2e5 + 100;
int n, a[N];
vector<pair<int,int> > mp;
bool check(int index) {
mp.clear();
mp.push_back(make_pair(0,0));
int sz = 0, p;
for (int i = 2; i <= n; i++) {
if (a[i] > a[i-1]) continue;
while (mp[sz].first > a[i]) mp.pop_back(), sz--;
for (p = a[i]; p; p--) {
if (mp[sz].first < p) mp.push_back(make_pair(p,0)), sz++;
if (++mp[sz].second == index) mp.pop_back(), sz--;
else break;
}
if (!p) return 0;
}
return 1;
}
int main() {
ios::sync_with_stdio(0);
cin >> n;
int flag = 1;
rep(i,1,n) cin >> a[i];
rep(i,2,n) flag &= (a[i] > a[i - 1]);
if (flag) {
cout << 1 << endl;
return 0;
}
int l = 2, r = n;
while (l < r) {
int mid = l + r >> 1;
if (check(mid)) r = mid;
else l = mid + 1;
}
cout << l << endl;
} | #include<cstdio>
#include<map>
int n,a[200100],ans;
bool bo=true;
std::map<int,int> mp;
bool check(int x){
mp.clear();
for(int i=2;i<=n;i++)
if(a[i-1]>=a[i]){
while(!mp.empty()){
int maxn=mp.rbegin()->first;
if(maxn>a[i])mp.erase(maxn);
else break;
}
int j=a[i];
while(mp[j]+1==x)
mp.erase(j),j--;
if(j==0)return false;
mp[j]++;
}
return true;
}
int main(){
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%d",&a[i]);
if(a[i]<=a[i-1])bo=false;
}
if(bo)return puts("1"),0;
int L=2,R=n;
while(L<=R){
int mid=(L+R)/2;
if(check(mid))ans=mid,R=mid-1;
else L=mid+1;
}
printf("%d\n",ans);
} | 1 | 49,946,784 |
#pragma GCC optimize("O3")
#pragma GCC optimize("fast-math")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define int long long
string per(int n) {
string s;
if (n == 0) {
s += '0';
return s;
}
while (n > 0) {
if (n % 2) s += '1';
else s += '0';
n /= 2;
}
return s;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n; cin >> n;
vector<int> vec(n), f(23, 0);
for (int i = 0; i < n; ++i) cin >> vec[i];
int l = 0, r = 0, ans = 0;
while (l < n) {
if (r == n) {
ans += r - l;
l++;
continue;
}
while (true) {
if (r == n) break;
string s = per(vec[r]);
bool flag = true;
for (int i = 0; i < s.size(); ++i) {
if (s[i] == '1' && f[i] == 1) {
flag = false;
break;
}
}
if (!flag) break;
for (int i = 0; i < s.size(); ++i) {
if (s[i] == '1') f[i] += 1;
}
r++;
}
ans += r - l;
string s = per(vec[l]);
for (int i = 0; i < s.size(); ++i) {
if (s[i] == '1') f[i]--;
}
l++;
}
cout << ans;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) ((int)(x).size())
#define pb push_back
using ll = long long;
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}
int main(){
int N; cin >> N;
vector<ll> A(N); rep(i,N) cin >> A[i];
vector<ll> ss(N+1,0);
rep(i,N) ss[i+1] = ss[i] + A[i];
vector<ll> xs(N+1,0);
rep(i,N) xs[i+1] = xs[i] ^ A[i];
ll ans = 0;
int r=1;
for(int l=0;l<N;l++){
ll p = ss[r]-ss[l];
ll x = xs[r]^xs[l];
for(;r<=N;r++){
if(r==N){
ll w = r-l;
ans += w*(w+1)/2;
l=1e9;
break;
}
p += A[r];
x ^= A[r];
if(p!=x){
ll w = r-l;
ans += w;
break;
}
}
}
cout << ans << endl;
return 0;
} | 1 | 8,080,138 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
#define ote(x) cout<<(x)<<endl
#define all(x) (x).begin(),(x).end()
#define rp(i,s,e) for(int i=(s);i<(e);++i)
template<class T> T in(){T x;cin>>x;return x;}
int main(){
int N; cin>>N;
vector<string> S(N);
vector<int> T(N);
int allT = 0;
rp(i,0,N){
string s;int t;
cin>>s>>t;
S[i] = s;
T[i] = t;
allT += t;
}
string X;cin>>X;
int ans = 0;
rp(i,0,N){
ans += T[i];
if(S[i] == X){
ote(allT-ans);
return 0;
}
}
} | #include<cstdio>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<stack>
#include<vector>
#include<queue>
#include<bitset>
using namespace std;
#define LL long long
#define DB double
#define MOD 998244353
#define Pr pair<DB,int>
#define X first
#define Y second
#define MAXN 50
#define INF 20000000000000000LL
#define mem(x,p) memset(x,p,sizeof(x))
LL read(){
LL x=0,F=1;char c=getchar();
while(c<'0'||c>'9'){if(c=='-')F=-1;c=getchar();}
while(c>='0'&&c<='9'){x=(x<<3)+(x<<1)+c-'0';c=getchar();}
return x*F;
}
int add(int a,int b){return (a+b>=MOD)?a+b-MOD:a+b;}
int dec(int a,int b){return (a-b<0)?a-b+MOD:a-b;}
int mul(int a,int b){return 1LL*a*b%MOD;}
int n,t[MAXN+5],F,res;
string s[MAXN+5],x;
int main()
{
n=read();
for(int i=1;i<=n;i++)
cin>>s[i],t[i]=read();
cin>>x;
for(int i=1;i<=n;i++){
if(F)res+=t[i];
if(x==s[i])F=1;
}
printf("%d\n",res);
} | 1 | 37,750,012 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <queue>
#include <deque>
#include <bitset>
#include <iterator>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <functional>
#include <numeric>
#include <utility>
#include <limits>
#include <time.h>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
using namespace std;
#define FOR(i,n) for(int i = 0; i < n; i++)
#define FORa(i,a,b) for(int i = a; i < b; i++)
#define pb(x) push_back(x)
#define mp(a, b) make_pair(a, b)
#define F first
#define S second
#define SORT(a,n) sort(begin(a), begin(a) + n)
#define VSORT(v) sort(v.begin(), v.end())
#define MAX 1000000
#define ll long long
#define LOW(s) transform(s.begin(),s.end(),s.begin(),::tolower)
#define UP(s) transform(s.begin(),s.end(),s.begin(),::toupper)
int main() {
string s, t;
int out = 0;
cin >> s >> t;
FOR(i, (int)s.size()) {
if(s[i] != t[i]) out++;
}
cout << out << endl;
return 0;
} | #include <iostream>
using namespace std;
int min(int x, int y, int z)
{
return min(min(x, y), z);
}
int dp(string x,string y, int m)
{
int count(0);
for (int i = 0; i <= m; i++) {
if (x[i] != y[i]) count++;
}
return count;
}
int main()
{
string x,y;
cin>>x>>y;
cout<<dp(x,y,x.length());
} | 1 | 83,359,109 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
typedef long long int ll;
int main()
{
string s;
ll k;
cin >> s >> k;
int n = s.size();
vector<int> cnt = {1};
for(int i = 1; i < n; i++)
{
if(s[i] == s[i - 1])
{
cnt.back()++;
}
else
{
cnt.emplace_back(1);
}
}
if((int)cnt.size() == 1)
{
k *= cnt[0];
cout << k / 2 << endl;
return 0;
}
if(s[0] != s[n - 1] || k == 1)
{
ll a = 0;
for(auto x : cnt)
{
a += x / 2;
}
cout << k * a << endl;
}
else
{
ll a = 0, ans = 0;
for(int i = 0; i < cnt.size(); i++)
{
ans += cnt[i] / 2;
}
cnt[0] += cnt.back();
for(int i = 0; i + 1 < cnt.size(); i++)
{
a += cnt[i] / 2;
}
ans += (k - 1) * a;
cout << ans << endl;
}
return 0;
} | #include <bits/stdc++.h>
typedef long long ll;
const int N = 105;
char s[N];
int k, n, tot, len[N];
ll ans;
int main()
{
bool is = 1;
scanf("%s%d", s + 1, &k); n = strlen(s + 1);
for (int i = 1; i <= n; i++) if (s[i] != s[1]) is = 0;
if (is) return std::cout << 1ll * n * k / 2 << std::endl, 0;
for (int i = 1, c = 1; i <= n; i++)
if (s[i] != s[i + 1]) len[++tot] = c, c = 1; else c++;
if (s[1] != s[n])
{
for (int i = 1; i <= tot; i++) ans += len[i] >> 1;
return std::cout << ans * k << std::endl, 0;
}
for (int i = 2; i < tot; i++) ans += len[i] >> 1; ans *= k;
return std::cout << ans + 1ll * (k - 1) * (len[1] + len[tot] >> 1)
+ (len[1] >> 1) + (len[tot] >> 1) << std::endl, 0;
} | 1 | 100,595,782 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A,B;
string S;
cin >> A >> B >> S;
bool f=1;
for (int i = 0; i < A+B+1; i++)
{
if(i==A)
{
if(S[i]!='-') f=0;
continue;
}
if(isdigit(S[i]));
else f=0;
}
if(f) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | #include<iostream>
#include<string>
using namespace std;
int main ()
{
int a, b, k = 0, t = 0;
cin >> a >> b;
string s;
cin >> s;
if(s[a] == '-')
{
s.erase (a,1);
for(int i = 0; i < a + b; i++)
{
if(s[i] == '0' + 0 || s[i] == '0' + 1 || s[i] == '0' + 2 ||
s[i] == '0' + 3 || s[i] == '0' + 4 || s[i] == '0' + 5 ||
s[i] == '0' + 6 || s[i] == '0' + 7 || s[i] == '0' + 8 || s[i] == '0' + 9)
k++;
else
t++;
}
if(t == 0)
cout << "Yes";
else cout << "No";
}
else
cout << "No";
return 0;
} | 1 | 66,514,904 |
#include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
int main(){
int W,H,x,y;
scanf("%d %d %d %d",&W,&H,&x,&y);
printf("%.15lf %d\n",((double)W*(double)H)/2.0,2*x == W && 2*y == H);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++i)
#define sqrep(i,cc,n) for(long long i=cc;i*i<=n;++i)
#define rrep(i,cc,n) for(long i=cc;i>n;--i)
#define pii pair<int, int>
#define pll pair<long long, long long>
using ll = long long;
const vector<int> dx = {1, 0, -1, 0};
const vector<int> dy = {0, 1, 0, -1};
const ll inf = 1001001001;
const ll e9 = 1000000000;
const ll mod = 1000000007;
int main(){
int w, h, x, y;
cin >> w >> h >> x >> y;
double s = (double)(h)*w/2;
if(w==2*x && h==2*y){
cout << fixed << setprecision(10) << s << " " << 1 << endl;
}else{
cout << fixed << setprecision(10) << s << " " << 0 << endl;
}
} | 1 | 74,795,483 |
#include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < n; i++)
#define ALL(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
int main() {
int N; cin >> N;
vector<ll> X(N);
REP(i, 0, N) cin >> X[i];
int L; cin >> L;
int k = 1; while ((1 << k) < N) k++;
int next[k][N] = {};
REP(i, 0, N) {
int idx = upper_bound(ALL(X), X[i] + L) - X.begin() - 1;
next[0][i] = idx;
}
REP(i, 0, k - 1) {
REP(j, 0, N) {
if (next[i][j] < 0) {
next[i + 1][j] = -1;
} else {
next[i + 1][j] = next[i][next[i][j]];
}
}
}
int Q; cin >> Q;
while (Q--) {
int a, b; cin >> a >> b; a--; b--;
if (a > b) swap(a, b);
int ans = 0;
for (int i = k - 1; i >= 0; i--) {
if (next[i][a] < b) {
ans += (1 << i);
a = next[i][a];
}
}
cout << ans + 1 << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) (v).begin(), (v).end()
using ll = long long;
constexpr int INF = 1e9;
constexpr long long LINF = 1e18;
constexpr long long MOD = 1e9 + 7;
#define MAX 20
signed main() {
int n;
cin >> n;
int x[n + 2];
for (int i = 1; i <= n; i++) {
cin >> x[i];
}
x[0] = x[1] - 1;
x[n + 1] = x[n] + 1;
n += 2;
int l, q;
cin >> l >> q;
int a[q], b[q];
rep(i, q) {
cin >> a[i] >> b[i];
}
int dp[n][MAX + 1], dpr[n][MAX + 1];
rep(i, n) {
dp[i][0] = upper_bound(x, x + n, x[i] + l) - x - 1;
}
for (int i = n - 1; i >= 0; i--) {
dpr[i][0] = lower_bound(x, x + n, x[i] - l) - x;
}
for (int i = 0; i < MAX; i++) {
for (int j = 0; j < n; j++) {
dp[j][i + 1] = dp[dp[j][i]][i];
}
}
for (int i = 0; i < MAX; i++) {
for (int j = 0; j < n; j++) {
dpr[j][i + 1] = dpr[dpr[j][i]][i];
}
}
rep(i, q) {
int ans = 0;
int cur = a[i];
if (a[i] < b[i]) {
while (cur < b[i]) {
int j;
for (j = 0; j <= MAX; j++) {
if (b[i] < dp[cur][j]) break;
}
if (j) j--;
cur = dp[cur][j];
ans += 1 << j;
}
} else {
while (b[i] < cur) {
int j;
for (j = 0; j <= MAX; j++) {
if (dpr[cur][j] < b[i]) break;
}
if (j) j--;
cur = dpr[cur][j];
ans += 1 << j;
}
}
cout << ans << endl;
}
return 0;
} | 1 | 40,106,692 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define rrep(i,n) for(int i=1;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int inf = 1001001001;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<vector<ll>> a(n, vector<ll>(3));
rep(i, n)rep(j, 3) cin >> a[i][j];
ll ans = -inf;
rep(bit, (1 << 3)) {
vector<ll> now(n);
rep(i, n) {
ll cnt = 0;
rep(j, 3) {
if (bit & (1 << j)) cnt += a[i][j];
else cnt -= a[i][j];
}
now[i] = cnt;
}
sort(rall(now));
ll tmp = 0;
rep(i, m) tmp += now[i];
ans = max(ans, tmp);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long n,m,ans=0;
cin >> n >> m;
vector<vector<long>> p(n,vector<long>(3));
for(long i=0;i<n;i++) cin >> p[i][0] >> p[i][1] >> p[i][2];
for(long i=0;i<8;i++) {
vector<long> psum(n);
for(long j=0;j<n;j++) {
if(i&1) psum[j]+=p[j][0];
else psum[j]-=p[j][0];
if(i&2) psum[j]+=p[j][1];
else psum[j]-=p[j][1];
if(i&4) psum[j]+=p[j][2];
else psum[j]-=p[j][2];
}
sort(psum.begin(),psum.end());
reverse(psum.begin(),psum.end());
long a=0;
for(long j=0;j<m;j++) a+=psum[j];
ans=max(ans,a);
}
cout << ans << endl;
} | 1 | 75,607,921 |
#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
#define REP(i, n) rep(i, 0, n)
#define repb(i, a, b) for(int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define int long long
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
typedef pair<int, int> P;
const int mod = 1000000007;
const int INF = 1e12;
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
map<string, int> mp;
rep(i, 0, n){
string s, t;
cin >> s >> t;
if(s == "insert"){
mp[t]++;
}else{
if(mp[t] != 0) cout << "yes" << endl;
else cout << "no" << endl;
}
}
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <string>
using namespace std;
int solve(){
string c, s;
map<string, bool> mp;
int n;
cin >> n;
for (int i = 0; i < n; i++){
cin >> c >> s;
if (c == "insert") mp[s] = true;
else {
if (mp[s]) cout << "yes" << endl;
else cout << "no" << endl;
}
}
}
signed main(){
solve();
} | 1 | 38,093,447 |
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define vl vector
#define pb push_back
#define ff first
#define ss second
using namespace std;
int main()
{
ll n,m,i,a=0,b=0,k,t,j;
cin>>n;
if(n%2) cout<<"0";
else
{
a=5*2;
ll ans=0;
while(a<=n)
{
ans+=n/a;
a*=5;
}
cout<<ans;
}
} | #include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long long ll;
typedef pair<ll, ll> PLL;
typedef vector<int> VI;
typedef vector<char> VC;
typedef vector<double> VD;
typedef vector<string> VS;
typedef vector<ll> VLL;
typedef vector<PLL> VP;
const static int INF = 1000000000;
const static int MOD = 1000000007;
const int dx[4]={1, 0, -1, 0};
const int dy[4]={0, 1, 0, -1};
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
#define rep(i,n) for (ll i=0; i<(ll)(n); i++)
#define repd(i,n) for (ll i=n-1; i>=0; i--)
#define rept(i,m,n) for(ll i=m; i<n; i++)
#define stl_rep(itr, x) for (auto itr = x.begin(); itr != x.end(); ++itr)
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
#define PF push_front
#define PB push_back
#define SORT(V) sort((V).begin(), (V).end())
#define RVERSE(V) reverse((V).begin(), (V).end())
#define paired make_pair
#define PRINT(V) for(auto v : (V)) cout << v << " "
int ctoi(char c) { if (c >= '0' && c <= '9') { return c - '0'; } return 0; }
void cum_sum(int N,vector<double> a, vector<double> &s){ for(int i=0; i<N; i++){ s[i+1]=s[i]+a[i];}}
ll gcd(ll a,ll b){
if(b == 0) return a;
return gcd(b,a%b);
}
ll lcm(ll a,ll b){
ll g = gcd(a,b);
return a / g * b;
}
bool is_prime(long long n) {
if (n <= 1) return false;
for (long long p = 2; p * p <= n; ++p) {
if (n % p == 0) return false;
}
return true;
}
int getdigit(ll num){
unsigned digit=0;
while(num!=0){
num /= 10;
digit++;
}
return digit;
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll N;
ll ans=0;
cin >> N;
if(N%2!=0){
cout << 0 << endl;
return 0;
}
else{
ll re=10;
while(re<=N){
ans+=N/re;
re*=5;
}
}
cout << ans << endl;
} | 1 | 58,829,223 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(aaa) aaa.begin(), aaa.end()
const int N = 1e5 + 5;
int a[N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
int ans = a[n - 1] - a[0];
for (int i = 1; i + 1 < n; i++) {
ans += abs(a[i]);
}
cout << ans << "\n";
int anime = a[0];
for (int i = 1; i + 1 < n; i++) {
if (a[i] > 0) {
cout << anime << " " << a[i] << "\n";
anime -= a[i];
}
}
cout << a[n - 1] << " " << anime << "\n";
anime = a[n - 1] - anime;
for (int i = 1; i + 1 < n; i++) {
if (a[i] <= 0) {
cout << anime << " " << a[i] << "\n";
anime -= a[i];
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> an(N);
for (int i = 0; i < N; i++) {
cin >> an[i];
}
sort(an.begin(), an.end());
int ans = 0;
for (int i = 0; i < N; i++) {
if (i == 0 && an[i] > 0) ans -= an[0];
else if (i == N-1 && an[i] < 0) ans += an[N-1];
else ans += abs(an[i]);
}
cout << ans << endl;
for (int i = N-2; an[i] >= 0 && i > 0; i--) {
cout << an[0] << " " << an[i] << endl;
an[0] -= an[i];
}
for (int i = 1; an[i] < 0 && i < N-1; i++) {
cout << an[N-1] << " " << an[i] << endl;
an[N-1] -= an[i];
}
cout << an[N-1] << " " << an[0] << endl;
} | 1 | 94,848,004 |
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
string words[4] = { "dream", "dreamer", "erase", "eraser" };
reverse(S.begin(), S.end());
for (int i = 0; i < 4; i++) {
reverse(words[i].begin(), words[i].end());
}
for (int i = 0; i < S.size();) {
bool flag = false;
for (int j = 0; j < 4; j++) {
string w = words[j];
if (S.substr(i, w.size()) == w) {
flag = true;
i += w.size();
break;
}
}
if (!flag) {
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
reverse(s.begin(), s.end());
string data[] = {"dream", "dreamer", "erase", "eraser"};
for(int i = 0 ; i < 4 ; i++){
reverse(data[i].begin(), data[i].end());
}
int now = 0;
while(1){
bool flag = false;
for(int i = 0 ; i < 4 ; i++){
if(s.substr(now, data[i].size()) == data[i]){
flag = true;
now += data[i].size();
break;
}
}
if(now >= s.size()){
cout << "YES" << endl;
return 0;
}
if(!flag){
cout << "NO" << endl;
return 0;
}
}
} | 1 | 53,040,578 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1001001001;
int main(){
string s; cin >> s;
for(int i = 0; i < s.size() - 2; i++){
if(s[i] == s[i+1] || s[i] == s[i+2] || s[i+1] == s[i+2]){
cout << i+1 << " " << i + 3 << endl;
return 0;
}
}
if(s.size() == 2){
if(s[0] == s[1]){
cout << 1 << " " << 2 << endl;
return 0;
}
}
cout << -1 << " " << -1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
void fast(){
cin.tie(0);
cin.sync_with_stdio(0);
}
int main()
{
fast();
string s;
cin>>s;
if(s.size()==2&&s[1]==s[0]){cout<<"1 2";return 0;}
for(int i=0;i<s.size()-2;i++){
int freq[130]={};
for(int j=i;j<i+3;j++){
freq[s[j]]++;
if(j==i+2){for(int k=97;k<=122;k++){
if(freq[k]>=2){cout<<i+1<<" "<<j+1;return 0;}
}
}
}
}
cout<<"-1 -1";
return 0;
} | 1 | 76,897,928 |
#include<iostream>
using namespace std;
int main()
{
int a, b;
cin >> a>>b;
if (a < b){
cout << "a < b\n";
}
else if(a > b){
cout << "a > b\n";
}
else if (a = b){
cout << "a == b\n";
}
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
string op;
if(a == b)
op = " == ";
else if(a > b)
op = " > ";
else
op = " < ";
cout << "a" << op << "b" << endl;
return 0;
} | 1 | 15,810,382 |
#include "bits/stdc++.h"
#include "math.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<int> vin;
typedef pair<ll,ll> P;
typedef vector<P> vp;
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
#define drep(i,a,b) for(ll i=(a);i>=(b);--i)
#define SIZE(a) int((a).size())
#define out(a) cout<<(a)<<endl;
const int INF=INT_MAX;
const int MAX = 510000;
const ll MOD = 1000000007;
ll roundd(ll x,ll n){
if(x>n){return x%n;}
else if(x<0){return x%n+n;}
else return x;
}
bool isprime(ll n){
if(n==1)return false;
for (ll i = 2; i * i <= n; i++) {
if(n%i==0)return false;
}
return true;
}
int main(){
ll n;cin>>n;
vll a(n);
rep(i,0,n){
cin>>a[i];
}
sort(a.begin(),a.end());
vb dp(a[n-1]+1,true);
vll cnt(a[n-1]+1,0);
ll ans=0;
rep(i,0,n){
for(int j=a[i]*2;j<=a[n-1];j+=a[i]){
dp[j]=false;
}
cnt[a[i]]++;
}
rep(i,0,n){
if(dp[a[i]]&&cnt[a[i]]==1)ans++;
}
cout<<ans<<endl;
} | #include <iostream>
using namespace std;
int n,a[1000010];
int st[1000010];
int main(){
scanf("%d",&n);
for(int i=1;i<=n;++i)
scanf("%d",&a[i]),st[a[i]]++;
int cnt=n;
for(int i=1;i<=n;++i){
for(int j=1;j*j<=a[i];++j){
if(a[i]%j==0){
int x=a[i]/j,y=j;
if(st[x]&&(x!=a[i]||st[x]>1)){
cnt--;
break;
}
if(st[y]&&(y!=a[i]||st[y]>1)){
cnt--;
break;
}
}
}
}
cout<<cnt<<endl;
return 0;
} | 1 | 100,538,129 |
#include <iostream>
using namespace std;
typedef unsigned long long ull;
ull fact (int n) {
if (n < 2) return 1;
else return (ull)n * fact(n - 1);
}
int main (void) {
int n;
cin >> n;
cout << fact(n) << endl;
return 0;
} | #include <iostream>
using namespace std;
int main( void )
{
while ( !cin.eof() )
{
int n;
cin >> n;
if ( cin.eof() )
break;
long long f = 1;
for ( int i = 2; i <= n; i++ )
{
f *= i;
}
cout << f << endl;
}
} | 1 | 30,292,844 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
int main(){
int n,d;
cin>>n>>d;
int x[n][d];
int cnt=0;
rep(i,n)rep(j,d)cin>>x[i][j];
int ians=0;
double fans=0;
for(int i=0;i<n-1;i++){
for(int j=i+1;j<n;j++){
for(int k=0;k<d;k++){
ians+=(x[i][k]-x[j][k])*(x[i][k]-x[j][k]);
fans+=(x[i][k]-x[j][k])*(x[i][k]-x[j][k]);
}
ians=sqrt(ians);
fans=sqrt(fans);
if(ians==fans)cnt++;
ians=0;
fans=0;
}
}
cout<<cnt<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, D;
cin >> N >> D;
vector<vector<int>> X(N, vector<int>(D));
for (int i = 0; i < N; i++) {
for (int j = 0; j < D; j++) {
cin >> X.at(i).at(j);
}
}
int ans = 0;
for (int i = 0; i < N; i++) {
for (int j = i + 1; j < N; j++) {
int64_t memo = 0;
for (int k = 0; k < D; k++) {
memo += (X.at(i).at(k) - X.at(j).at(k)) * (X.at(i).at(k) - X.at(j).at(k));
}
int a = sqrt(memo);
if (sqrt(memo) == a) {
ans++;
}
}
}
cout << ans << endl;
} | 1 | 76,854,291 |
#include <iostream>
using namespace std;
int main(){
int ans = 100000;
int n;
cin >> n;
for(int i=0;i<n;i++){
ans += ans*0.05;
if(ans%1000!=0)
ans = ans-ans%1000 + 1000;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
int debt = 100000;
scanf("%d", &n);
for (int i = 0; i < n; i++){
debt = debt / 100 * 105;
if (debt % 1000 != 0){
debt = (debt / 1000 + 1) * 1000;
}
}
printf("%d\n", debt);
return (0);
} | 1 | 49,432,643 |
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
#include <numeric>
#include <functional>
#include <sstream>
#include <iostream>
#include <iomanip>
#define _USE_MATH_DEFINES
#include <cmath>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cfloat>
#include <cmath>
#include <ctime>
#include <cassert>
#include <cctype>
#include <cstdio>
#include <cassert>
using namespace std;
#define EPS 1e-12
#define ull unsigned long long
#define ll long long
#define VI vector<ll>
#define PII pair<ll, ll>
#define VVI vector<vector<ll> >
#define VVVI vector<vector<vector<ll>>>
#define VVVVI vector<vector<vector<vector<ll>>>>
#define REP(i,n) for(ll i=0,_n=(n);(i)<(ll)_n;++i)
#define REPR(i,n) for(ll i=(ll)(n)-1;0<=(i);--i)
#define RANGE(i,a,b) for(ll i=(ll)a,_b=(ll)(b);(i)<_b;++i)
#define RANGER(i,a,b) for(ll i=(ll)(b)-1,_a=(ll)(a);(_a)<=i;--i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()
#define ALLR(c) (c).rbegin(), (c).rend()
#define PB push_back
#define MP(a, b) make_pair(a, b)
#define POPCOUNT __builtin_popcount
#define POPCOUNTLL __builtin_popcountll
#define CLEAR(table, v) memset(table, v, sizeof(table));
#define UNIFORM_DOUBLE(a, b) (((b-a)*(double)rand()/RAND_MAX)+a)
#define UNIFORM_LL(a, b) (ll)UNIFORM_DOUBLE(a, b)
#define IN(v, lo, hi) ((lo)<=(v) && (v)<(hi))
#define DD(v) cout<<#v<<": "<<v<<endl
#define FI first
#define SE second
template <typename T0, typename T1> std::ostream& operator<<(std::ostream& os, const map<T0, T1>& v) { for( typename map<T0, T1>::const_iterator p = v.begin(); p!=v.end(); p++ ){os << p->first << ": " << p->second << " ";} return os; }
template <typename T0, typename T1> std::ostream& operator<<(std::ostream& os, const pair<T0, T1>& v) { os << v.first << ": " << v.second << " "; return os; }
template <typename T> std::ostream& operator<<(std::ostream& os, const vector<T>& v) { for( int i = 0; i < (int)v.size(); i++ ) { os << v[i] << " "; } return os; }
template <typename T> std::ostream& operator<<(std::ostream& os, const set<T>& v) { vector<T> tmp(v.begin(), v.end()); os << tmp; return os; }
template <typename T> std::ostream& operator<<(std::ostream& os, const deque<T>& v) { vector<T> tmp(v.begin(), v.end()); os << tmp; return os; }
template <typename T> std::ostream& operator<<(std::ostream& os, const vector<vector<T> >& v) { for( int i = 0; i < (int)v.size(); i++ ) { os << v[i] << endl; } return os; }
template<typename T>void maxUpdate(T& a, T b) {a = max(a, b);}
template<typename T>void minUpdate(T& a, T b) {a = min(a, b);}
string YN(bool v) { return v ? "Yes":"No"; }
#define INF (1LL<<60)
VI d;
vector<vector<PII>> g;
void dfs(ll prev, ll cur) {
REP(i, g[cur].size()) if(g[cur][i].FI!=prev) {
ll ne = g[cur][i].FI;
d[ne] = d[cur] + g[cur][i].SE;
dfs(cur, ne);
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N,Q,K,a,b,c,x,y;
while(cin>>N) {
g = vector<vector<PII>>(N);
d = VI(N);
REP(i, N-1) {
cin>>a>>b>>c;
a--;b--;
g[a].PB(MP(b, c));
g[b].PB(MP(a, c));
}
cin>>Q>>K;
K--;
dfs(-1, K);
REP(i, Q) {
cin>>x>>y;
x--;y--;
cout<<d[x]+d[y]<<endl;
}
}
return 0;
} | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <functional>
#include <bitset>
#include <numeric>
#include <complex>
#include <iomanip>
#include <cassert>
#include <random>
int main() {
int n; std::cin >> n;
std::vector<std::vector<int>> edg(n);
std::vector<std::vector<long long>> cost(n);
for (int i = 0; i < n - 1; i++) {
int a, b, c; std::cin >> a >> b >> c;
a--; b--;
edg[a].push_back(b);
edg[b].push_back(a);
cost[a].push_back(c);
cost[b].push_back(c);
}
int q, k; std::cin >> q >> k;
k--;
std::vector<long long> dist(n, 1e18);
std::priority_queue<std::pair<long long, int>> que;
que.emplace(0, k);
dist[k] = 0;
while (!que.empty()) {
int pos = que.top().second;
que.pop();
for (int i = 0; i < (int)edg[pos].size(); i++) {
int u = edg[pos][i];
long long c = cost[pos][i];
if (dist[u] <= dist[pos] + c) continue;
dist[u] = dist[pos] + c;
que.emplace(-dist[u], u);
}
}
while (q--) {
int x, y; std::cin >> x >> y;
x--; y--;
std::cout << dist[x] + dist[y] << std::endl;
}
return 0;
} | 1 | 27,757,511 |
#include <iostream>
using namespace std;
int main(){
int n,k,max,buf,*a;
while(1){
cin >> n >> k;
if(n || k){
max = buf = 0;
a = new int[n];
for(int i = 0; i < n; i++){
cin >> a[i];
}
for(int i = 0; i < k-1; i++){
buf += a[i];
}
for(int i = k-1; i < n; i++){
buf += a[i];
max = (max < buf)?buf:max;
buf -= a[i-k+1];
}
cout << max << endl;
}else{
break;
}
}
return 0;
} | #define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
#define DBG 1
#define dump(o) if(DBG){cerr<<#o<<" "<<o<<endl;}
#define dumpc(o) if(DBG){cerr<<#o; for(auto &e:(o))cerr<<" "<<e;cerr<<endl;}
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define each(it,c) for(auto it=(c).begin();it!=(c).end();it++)
#define all(c) c.begin(),c.end()
const int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
const int MOD = (int)(1e9 + 7);
const double EPS = 1e-10;
signed main() {
int n, k;
while (cin >> n >> k, n || k) {
vector<int>v(n + 1, 0);
rep(i, 1, n + 1)cin >> v[i];
rep(i, 1, n + 1)v[i] += v[i - 1];
int ans(-INF);
for (int i = k; i < v.size(); i++) {
ans = max(ans, v[i] - v[i - k]);
}
cout << ans << endl;
}
return 0;
} | 1 | 1,494,996 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<ll> vl;
typedef pair<ll,ll> pll;
#define MOD 1000000007
#define INF 1000000000
#define mp make_pair
#define pb push_back
#define ss second
#define ff first
#define endl '\n'
#define pl cout<<endl;
void fast() { ios_base::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL); }
const long long INFll=1ll*INF*INF;
const long double PI=3.141592653589793238462643383279502884197169399375105820974944;
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define gcd(a,b) __gcd((a),(b))
#define lcm(a,b) ((a)*(b))/gcd((a),(b))
#define debug(x) cout << x << endl;
#define sz(a) int((a).size())
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
long long genrand(long long L,long long R)
{
return uniform_int_distribution<long long>(L, R)(rng);
}
int mul(int a, int b,int mod = MOD) {
return int(a * 1ll * b % mod);
}
int norm(int a,int mod = MOD) {
while(a >= mod) a -= mod;
while(a < 0) a += mod;
return a;
}
int powmod(int x,int y,int mod = MOD){
int res = 1;
while(y>0)
{
if(y&1)
res = mul(res,x,mod);
x = mul(x,x,mod);
y=y>>1;
}
return res;
}
int inv(int a,int mod = MOD) {
return powmod(a, mod - 2);
}
int main() {
fast();
int n; cin>>n;
int a[n+1];
for(int i = 1; i<=n; i++){
cin>>a[i];
}
int l; cin>>l;
int dp[n+1][31];
for(int j = 0; j<=30; j++){
for(int i = 1;i<=n;i++){
if(j==0){
dp[i][j] = (upper_bound(a+1, a+n+1, a[i]+l) - a) - 1;
}
else{
dp[i][j] = dp[dp[i][j-1]][j-1];
}
}
}
int q; cin>>q;
while(q--){
int a,b; cin>>a>>b;
if(a>b){
swap(a,b);
}
int ans = 0;
while(true){
int j;
for(j = 0;j<=30;j++){
if(dp[a][j]>=b){
break;
}
}
if(j==0){
ans++;
break;
}
ans += (1<<(j-1));
a = dp[a][j-1];
}
cout<<ans<<endl;
}
return 0;
} | #include<iostream>
#include<algorithm>
using namespace std;
#define df 0
int lg(int n){
int cnt=1;
while(n){
cnt++;
n/=2;
}
return cnt;
}
int main(){
if(df) printf("*debug mode*\n");
int n; cin >> n;
int x[n];
for(auto& a:x){
cin >> a;
}
int l,q; cin >> l >> q;
int lmax=lg(n);
int dbl[n][lmax];
for(int i=0;i<n;i++){
dbl[i][0]=upper_bound(x,x+n,x[i]+l)-x-1;
if(df)printf("[%d] ",dbl[i][0]);
}
for(int j=1;j<lmax;j++){
if(df)printf("\n");
for(int i=0;i<n;i++){
dbl[i][j]=dbl[dbl[i][j-1]][j-1];
if(df)printf("[%d] ",dbl[i][j]);
}
}
for(int i=0;i<q;i++){
int a, b; cin >> a >> b; a--; b--; if(a>b)swap(a,b);
int day=0;
for(int i=lmax-1;i>=0;i--){
if(dbl[a][i]>=b)continue;
day+=1<<i;
a=dbl[a][i];
}
while(a<b){
a=dbl[a][0];
day++;
}
printf("%d\n",day);
}
if(df)printf("%d",lg(100000));
} | 1 | 13,340,947 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for (ll i = 0; i < (n); ++i)
void solve(long long N, std::vector<std::string> S){
ll ans = 0;
REP(B, N){
vector<string> T;
REP(i, N){
T.push_back(
S.at(i).substr(N - B, B) +
S.at(i).substr(0, N - B)
);
}
ll ok_flg = true;
for(ll i = 0; i < N && ok_flg; ++i){
for(ll j = i + 1; j < N && ok_flg; ++j){
if(T.at(i).at(j) != T.at(j).at(i)){
ok_flg = false;
}
}
}
ans += ok_flg;
}
cout << N * ans << endl;
}
int main(){
long long N;
scanf("%lld",&N);
std::vector<std::string> S(N);
for(int i = 0 ; i < N ; i++){
std::cin >> S[i];
}
solve(N, std::move(S));
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
#define rep(i,n) for (ll i=0;i<n;++i)
#define rep2(i,a,b) for (ll i=a;i<b;++i)
const ll MOD=1000000007;
const ll INF=1e9;
const ll IINF=1e18;
const double EPS=1e-8;
const double pi=acos(-1);
template<class T> inline bool chmin(T &a,T b){
if (a>b){
a=b;
return true;
}
return false;
}
template<class T> inline bool chmax(T &a,T b){
if (a<b){
a=b;
return true;
}
return false;
}
int main(){
int N;
cin >> N;
vector<string> S(N);
rep(i,N){
cin >> S[i];
}
ll ans=0;
rep(i,N){
bool sym=true;
rep(j,N){
rep(k,N){
if (S[j][k]!=S[k][j]){
sym=false;
}
}
}
if (sym){
ans+=N-i;
}
rep(j,N){
char s=S[j][0];
rep(k,N){
if (k!=N-1){
S[j][k]=S[j][k+1];
}
else {
S[j][k]=s;
}
}
}
}
rep(i,N){
bool sym=true;
rep(j,N){
rep(k,N){
if (S[j][k]!=S[k][j]){
sym=false;
}
}
}
if (sym&&i!=0){
ans+=N-i;
}
rep(j,N){
char s=S[0][j];
rep(k,N){
if (k!=N-1){
S[k][j]=S[k+1][j];
}
else {
S[k][j]=s;
}
}
}
}
cout << ans << endl;
} | 1 | 23,828,494 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll MOD = 1e9+7;
const ll INF = 1ll<<60;
#define FOR(i,a,b) for (ll i=(a);i<(ll)(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
int main(int argc, char **argv)
{
ll x, y, z, k; cin >> x >> y >> z >> k;
vector<ll> va(x), vb(y), vc(z);
REP(i, x) cin >> va[i];
REP(i, y) cin >> vb[i];
REP(i, z) cin >> vc[i];
sort(ALL(va), greater<ll>());
sort(ALL(vb), greater<ll>());
sort(ALL(vc), greater<ll>());
vector<ll> res;
REP(a, x)REP(b, y)
REP(c, z)
if ((a+1)*(b+1)*(c+1) <= k) res.push_back(va[a]+vb[b]+vc[c]);
else break;
sort(ALL(res), greater<ll>());
REP(i, k) std::cout << res[i] << std::endl;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(long long i=0;i<n;++i)
#define P pair<ll,ll>
#define Graph vector<vector<ll>>
#define fi first
#define se second
constexpr ll INF=(1ll<<60);
constexpr ll mod=1000000007;
constexpr double pi=3.14159265358979323846;
template<typename T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<typename T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int main(){
ll X,Y,Z,K;cin>>X>>Y>>Z>>K;
vector<ll> A(X),B(Y),C(Z),ans;
rep(i,X){
cin>>A[i];
}
rep(i,Y){
cin>>B[i];
}
rep(i,Z){
cin>>C[i];
}
sort(A.begin(),A.end(),greater<ll>());
sort(B.begin(),B.end(),greater<ll>());
sort(C.begin(),C.end(),greater<ll>());
vector<ll> vecab;
rep(i,X){
rep(j,Y){
vecab.push_back(A[i]+B[j]);
}
}
sort(vecab.begin(),vecab.end(),greater<ll>());
rep(i,min(K,X*Y)){
rep(j,Z){
ans.push_back(vecab[i]+C[j]);
}
}
sort(ans.begin(),ans.end(),greater<ll>());
rep(i,K){
cout<<ans[i]<<endl;
}
return 0;
} | 1 | 53,017,992 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <map>
#include <utility>
#define rep(i,j,k) for(int i = j; i <= k; i++)
#define dow(i,j,k) for(int i = j; i >= k; i--)
using namespace std;
const int N = 2e5 + 100;
int n, a[N];
vector<pair<int,int> > mp;
bool check(int index) {
mp.clear();
mp.push_back(make_pair(0,0));
int sz = 0, p;
for (int i = 2; i <= n; i++) {
if (a[i] > a[i-1]) continue;
while (mp[sz].first > a[i]) mp.pop_back(), sz--;
for (p = a[i]; p; p--) {
if (mp[sz].first < p) mp.push_back(make_pair(p,0)), sz++;
if (++mp[sz].second == index) mp.pop_back(), sz--;
else break;
}
if (!p) return 0;
}
return 1;
}
int main() {
ios::sync_with_stdio(0);
cin >> n;
int flag = 1;
rep(i,1,n) cin >> a[i];
rep(i,2,n) flag &= (a[i] > a[i - 1]);
if (flag) {
cout << 1 << endl;
return 0;
}
int l = 2, r = n;
while (l < r) {
int mid = l + r >> 1;
if (check(mid)) r = mid;
else l = mid + 1;
}
cout << l << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define TRACE(x) cerr << #x << " :: " << x << endl
#define _ << " " <<
#define SZ(x) (int)(x).size()
#define ALL(x) (x).begin(),(x).end()
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define RFOR(i,a,b) for (int i=(a);i>=(b);--i)
using ii=pair<int,int>;
const int mxN = 2e5+5;
int N, A[mxN];
ii stk[mxN]; int tp;
inline bool check(int C) {
if (C == 0) return 0;
stk[0] = ii(0,0); tp = 1;
A[0] = 0;
FOR(i,1,N){
if (A[i] > A[i-1]) {
stk[tp++] = ii(A[i],0);
} else {
while (tp > 1 && stk[tp-2].first >= A[i]) --tp;
stk[tp-1].first = A[i];
RFOR(j,tp-1,0){
if (j == 0) return 0;
if (++stk[j].second == C) {
stk[j].second = 0;
} else {
if (stk[j-1].first+1 < stk[j].first) {
RFOR(k,tp-1,j) stk[k+1] = stk[k];
++tp;
stk[j] = ii(stk[j+1].first-1,stk[j+1].second-1);
}
break;
}
}
}
}
return 1;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> N;
FOR(i,1,N){
cin >> A[i];
}
int lo = 0, hi = N;
while (hi-lo > 1) {
int mid = (lo+hi)/2;
if (check(mid)) hi = mid;
else lo = mid;
}
cout << hi << '\n';
} | 1 | 78,837,614 |
#include <bits/stdc++.h>
#define int long long
#define debug(...) fprintf(stderr, __VA_ARGS__)
using namespace std;
typedef long long ll;
const int N = 10005;
inline int input() {
int x; char ch; while (!isdigit(ch = getchar()));
for (x = ch ^ 48; isdigit(ch = getchar()); x = x * 10 + (ch ^ 48));
return x;
}
inline void chkmin(int &x, int y) { x = x < y ? x : y; }
template <class T> T sqr(T x) { return x * x; }
int n;
int x[N], y[N];
int d[1000];
bool flag;
int dis(int xa, int ya, int xb, int yb) {
return abs(xa - xb) + abs(ya - yb);
}
signed main() {
#ifdef local
freopen("in", "r", stdin);
freopen("out", "w", stdout);
#endif
ios::sync_with_stdio(false);
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> x[i] >> y[i];
flag = abs(x[1] + y[1]) & 1;
for (int i = 1; i <= n; ++i)
if ((abs(x[i] + y[i]) & 1) != flag)
return puts("-1"), 0;
puts(flag ? "31" : "32");
for (int i = 1; i <= 31; ++i)
printf("%lld ", d[i] = 1 << (31 - i));
if (!flag) printf("%lld\n", d[32] = 1);
else putchar('\n');
for (int i = 1; i <= n; ++i) {
int xd = 0, yd = 0;
if (!flag) xd = 1;
for (int j = 1; j <= 31; ++j) {
char ch; int Dis = LLONG_MAX;
if (dis(xd + d[j], yd, x[i], y[i]) < Dis)
Dis = dis(xd + d[j], yd, x[i], y[i]), ch = 'R';
if (dis(xd - d[j], yd, x[i], y[i]) < Dis)
Dis = dis(xd - d[j], yd, x[i], y[i]), ch = 'L';
if (dis(xd, yd + d[j], x[i], y[i]) < Dis)
Dis = dis(xd, yd + d[j], x[i], y[i]), ch = 'U';
if (dis(xd, yd - d[j], x[i], y[i]) < Dis)
Dis = dis(xd, yd - d[j], x[i], y[i]), ch = 'D';
if (ch == 'R') xd += d[j];
if (ch == 'L') xd -= d[j];
if (ch == 'U') yd += d[j];
if (ch == 'D') yd -= d[j];
putchar(ch);
}
if (xd != x[i] || yd != y[i]) return 1;
if (!flag) putchar('R');
putchar('\n');
}
return 0;
} | #include <stdio.h>
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#pragma warning(disable:4996)
#pragma comment(linker, "/STACK:336777216")
using namespace std;
#define mp make_pair
#define Fi first
#define Se second
#define pb(x) push_back(x)
#define szz(x) ((int)(x).size())
#define rep(i, n) for(int i=0;i<n;i++)
#define all(x) (x).begin(), (x).end()
#define ldb ldouble
typedef tuple<int, int, int> t3;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
typedef pair <ll, int> pli;
typedef pair <db, db> pdd;
int IT_MAX = 1 << 19;
const ll MOD = 100000007;
const int INF = 0x3f3f3f3f;
const ll LL_INF = 0x3f3f3f3f3f3f3f3f;
const db PI = acos(-1);
const db ERR = 1e-10;
ll myrem(ll x) {
return (x % 2 + 2) % 2;
}
ll in[1050][2];
int main() {
int N, i, j;
scanf("%d", &N);
for (i = 1; i <= N; i++) scanf("%lld %lld", &in[i][0], &in[i][1]);
ll c = myrem(in[1][0] + in[1][1]);
for (i = 2; i <= N; i++) if (myrem(in[i][0] + in[i][1]) != c) return !printf("-1\n");
if (c == 1) {
printf("33\n");
for (ll i = 0; i <= 32; i++) printf("%lld ", 1ll << i);
printf("\n");
}
else {
printf("34\n1 ");
for (ll i = 0; i <= 32; i++) printf("%lld ", 1ll << i);
printf("\n");
}
for (i = 1; i <= N; i++) {
ll x = in[i][0], y = in[i][1];
x *= -1, y *= -1;
if (c == 0) {
printf("R");
x++;
}
for (ll j = 0; j <= 31; j++) {
if (x % 2) {
if (myrem((x + 1) / 2) != myrem(y / 2)) {
x++;
printf("R");
}
else {
x--;
printf("L");
}
}
else {
if (myrem(x / 2) != myrem((y + 1) / 2)) {
y++;
printf("U");
}
else {
y--;
printf("D");
}
}
x /= 2, y /= 2;
}
if (x == -1) printf("R");
else if (x == 1) printf("L");
else if (y == -1) printf("U");
else printf("D");
printf("\n");
}
return 0;
} | 1 | 4,381,458 |
#include<stdio.h>
#include<algorithm>
using namespace std;
int a[200000];
int main()
{
int i,n,flag=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
sort(a,a+n);
for(i=0;i<n-1;i++)
{
if(a[i]==a[i+1])
{
flag=1;
break;
}
}
if(flag==1)
{
printf("NO\n");
}
else
{
printf("YES\n");
}
return 0;
} | #include <iostream>
#include <fstream>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <string>
#include <cmath>
#include <cassert>
#include <ctime>
#include <algorithm>
#include <sstream>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <cstdlib>
#include <cstdio>
#include <iterator>
#include <functional>
#include <bitset>
#include <iterator>
typedef long long ll;
typedef long double ld;
using namespace std;
typedef pair<int,int> pii;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
const int MAXN = 2e5+50;
#define max(a,b) (a>b?a:b)
#define min(a,b) (a<b?a:b)
#define f first
#define s second
#define rep(i,l,r) for(int i=l;i<=r;++i)
#define per(i,r,l) for(int i=r;i>=l;--i)
#define rep0(i,l,r) for(int i=l;i<r;++i
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
int lcm(int a, int b) { return a * (b / gcd(a, b)); }
int solve(){
int n;
cin>>n;
vector<int> vec(n);
for(int i=0;i<n;++i)
cin>>vec[i];
set<int> st;
for(int i=0;i<vec.size();++i){
if(st.find(vec[i])==st.end()){
st.insert(vec[i]);
}
else
return 1;
}
return 0;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
if(solve()==1)
cout<<"NO"<<endl;
else
cout<<"YES"<<endl;
} | 1 | 73,448,121 |
#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#include <math.h>
#include <iomanip>
#include <limits>
#include <list>
#include <queue>
#include <tuple>
#include <map>
#include <stack>
#include <set>
using namespace std;
#define MOD (long long int)(1e9+7)
#define ll long long int
#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define reps(i,n) for(int i=1; i<=(int)(n); i++)
#define REP(i,n) for(int i=n-1; i>=0; i--)
#define REPS(i,n) for(int i=n; i>0; i--)
#define INF (int)(1123456789)
#define LINF (long long int)(112345678901234567)
#define chmax(a, b) a = (((a)<(b)) ? (b) : (a))
#define chmin(a, b) a = (((a)>(b)) ? (b) : (a))
#define all(v) v.begin(), v.end()
const int N = 1234567;
ll mpow(ll a, ll b){
if(b==0) return 1;
else if(b%2==0){ll memo = mpow(a,b/2); return memo*memo%MOD;}
else return mpow(a,b-1) * a % MOD;
}
ll gcd(ll a, ll b){
if(b==0) return a;
else return gcd(b, a%b);
}
vector<ll> kaijo_memo;
ll kaijo(ll n){
if(kaijo_memo.size() > n) return kaijo_memo[n];
if(kaijo_memo.size() == 0) kaijo_memo.push_back(1);
while(kaijo_memo.size() <= n) kaijo_memo.push_back(kaijo_memo[kaijo_memo.size()-1] * kaijo_memo.size() % MOD);
return kaijo_memo[n];
}
ll nCr(ll n, ll r){
if(n < r || r < 0) return 0;
ll ret = 1;
ret *= kaijo(n); ret %= MOD;
ret *= mpow(kaijo(r), MOD-2); ret %= MOD;
ret *= mpow(kaijo(n-r), MOD-2); ret %= MOD;
return ret;
}
int main(void){
int n;cin>>n;
vector<int> A;
vector<pair<int,int>> B;
rep(i,n){
int a;cin>>a;
A.push_back(a);
B.push_back({a,i});
}
sort(all(A));
sort(all(B));
int max = A.back();
int max_i = B.back().second;
int ans_i = 0;
int ans_r = 0;
rep(i,n){
if(min(max-A[i], A[i]) > ans_r){
ans_r = min(max-A[i], A[i]);
ans_i = i;
}
}
cout<<max<<" "<<A[ans_i]<<endl;
return 0;
} | #include<iostream>
#include<algorithm>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for(int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
int b = a[0];
for (int i = 1; i < n-1; i++ ) {
if (abs(a[i] * 2 - a[n-1]) < abs(b * 2 - a[n-1])) {
b = a[i];
}
}
cout << a[n-1] << " " << b << endl;
return 0;
} | 1 | 57,046,403 |
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int main() {
char ch;
char ring[200],search[100],change[100];
scanf("%s %s",ring , search);
strcpy(change, ring);
strcat(ring, change);
if ( strstr(ring, search) == NULL ) printf("No\n");
else printf("Yes\n");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
int main()
{
char p[128] = { '\0' }, s[128] = { '\0' };
fscanf(stdin, "%s", s);
fscanf(stdin, "%s", p);
string ss = string(s) + string(s), pp(p);
string ans = "No";
if (ss.find(p, 0) != string::npos) {
ans = "Yes";
}
fprintf(stdout, "%s\n", ans.c_str());
return 0;
} | 1 | 90,237,486 |
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<stack>
#include<algorithm>
#include<iostream>
#include<cmath>
using namespace std;
typedef struct st
{
double x;
double y;
}st_Coordinate;
int n;
void Koch_curve(st_Coordinate p1, st_Coordinate p2, int n);
int main(void)
{
st_Coordinate st_start, st_end;
st_start.x = 0; st_start.y = 0;
st_end.x = 100; st_end.y = 0;
scanf("%d", &n);
if( n > 0 )
{
Koch_curve(st_start, st_end, 0);
printf("%lf %lf\n", st_end.x, st_end.y);
}
else
{
printf("%lf %lf\n", st_start.x, st_start.y);
printf("%lf %lf\n", st_end.x, st_end.y);
}
return 0;
}
void Koch_curve(st_Coordinate p1, st_Coordinate p2, int count)
{
double split_x, split_y;
st_Coordinate s, t, u;
if( count == n )
{
return;
}
count++;
split_x = ( p2.x - p1.x ) / 3.0;
split_y = ( p2.y - p1.y ) / 3.0;
s.x = p1.x + split_x;
s.y = p1.y + split_y;
t.x = p2.x - split_x;
t.y = p2.y - split_y;
u.x = ( cos( M_PI / 3.0 ) * ( t.x - s.x ) )
+ ( ( -1 ) * sin( M_PI / 3.0 ) * ( t.y - s.y ) ) + s.x;
u.y = ( sin( M_PI / 3.0 ) * ( t.x - s.x ) )
+ ( cos( M_PI / 3.0 ) * ( t.y - s.y ) ) + s.y;
if( count < n )
{
Koch_curve(p1, s, count);
Koch_curve(s, u, count);
Koch_curve(u, t, count);
Koch_curve(t, p2, count);
}
else
{
printf("%lf %lf\n", p1.x, p1.y);
printf("%lf %lf\n", s.x, s.y);
printf("%lf %lf\n", u.x, u.y);
printf("%lf %lf\n", t.x, t.y);
}
return;
} | #include<stdio.h>
#include<iostream>
#include<math.h>
using namespace std;
const double PI = 3.1415926535;
const double th = 60 * PI / 180;
class p
{
public:
double x;
double y;
void print();
};
void p::print()
{
printf("%.8f %.8f\n", x, y);
}
void koch(int d, p p1, p p2)
{
if (d == 0)return;
p s, u, t;
s.x = (2 * p1.x + p2.x) / 3;
s.y = (2 * p1.y + p2.y) / 3;
t.x = (p1.x + 2 * p2.x) / 3;
t.y = (p1.y + 2 * p2.y) / 3;
u.x = (t.x - s.x)*cos(th) - (t.y - s.y)*sin(th) + s.x;
u.y = (t.x - s.x)*sin(th) + (t.y - s.y)*cos(th) + s.y;
koch(d - 1, p1, s);
s.print();
koch(d - 1, s, u);
u.print();
koch(d - 1, u, t);
t.print();
koch(d - 1, t, p2);
}
int main()
{
int d;
p f, l;
cin >> d;
f.x = f.y = l.y = 0;
l.x = 100;
f.print();
koch(d, f, l);
l.print();
return 0;
} | 1 | 60,208,582 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
std::fill( (T*)array, (T*)(array+N), val );
}
ll gcd(ll a,ll b){
if (a%b == 0) return(b);
else return(gcd(b, a%b));
}
ll lcm(ll a, ll b){
return a*b/gcd(a, b);
}
int main()
{
cout << fixed << setprecision(15);
string S, T;
cin >> S >> T;
reverse(S.begin(), S.end());
if(S == T){
cout << "YES" << endl;
}
else{
cout << "NO" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define ALL(x) x.begin(),x.end()
#define get_tp(t,i) get<i>(t)
#define len(x) (ll)(x.size())
#define ub(a,x) (upper_bound(ALL(a),x)-a.begin())
#define lb(a,x) (lower_bound(ALL(a),x)-a.begin())
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<long long,long long> pllll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef priority_queue<ll, vector<ll>, greater<ll> > gpq;
typedef priority_queue<ll> pq;
const int MOD=1000000007;
const long double PI=3.1415926535897932;
int main(){
string R,G;cin>>R>>G;
cout<<((R[0]==G[2] && R[1]==G[1] && R[2]==G[0])?"YES":"NO")<<endl;
} | 1 | 51,055,510 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
struct edge{ll to,cost;};
const int inf = 1<<27;
const ll INF = 1LL<<60;
const int COMBMAX = 1001001;
const ll MOD = 1000000007;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define eachdo(v, e) for(const auto& e : (v))
#define all(v) (v).begin(), (v).end()
#define lower_index(v, e) (ll)distance((v).begin(), lower_bound((v).begin(), (v).end(), e))
#define upper_index(v, e) (ll)distance((v).begin(), upper_bound((v).begin(), (v).end(), e))
ll mpow(ll a, ll n, ll mod = MOD){ll res = 1; while(n > 0){if(n & 1)res = res * a % mod; a = a * a % mod; n >>= 1;} return res;}
void YesNo(bool j){cout << (j ? "Yes" : "No") << endl; return;}
void yesno(bool j){cout << (j ? "yes" : "no") << endl; return;}
template<class Head> void pt(Head&& head){cout << head << endl; return;}
template<class Head, class... Tail> void pt(Head&& head, Tail&&... tail){cout << head << " "; pt(forward<Tail>(tail)...);}
template<class T> void debug(T v){rep(i, v.size()) cout << v[i] << " " ; cout << endl;}
template<class T> void debug2(T v){rep(i, v.size()){rep(j, v[i].size()) cout << v[i][j] << " " ; cout << endl;}}
template<class T1, class T2> ll bcount(T1 v, T2 a){return upper_index(v, a) - lower_index(v, a);}
template<class T1, class T2> inline bool chmin(T1 &a, T2 b){if(a > b){a = b; return true;} return false;}
template<class T1, class T2> inline bool chmax(T1 &a, T2 b){if(a < b){a = b; return true;} return false;}
int main(){
ll N, K; cin >> N >> K;
vector<ll> a(N + 1);
rep(i, N) cin >> a[i + 1];
rep(i, N) a[i + 1] += a[i];
vector<ll> s;
rep(i, N + 1) rep(j, i) s.emplace_back(a[i] - a[j]);
N = (N * (N + 1)) / 2;
ll ans = 0;
for(int i = 60; 0 <= i; --i){
vector<bool> store(N, false);
ll cnt = 0;
rep(j, N){
if (s[j] >> i & 1LL){
cnt++;
store[j] = true;
}
}
if (K <= cnt){
ans += (1LL << i);
rep(j, N) if(!store[j]) s[j] = 0;
}
}
pt(ans);
return 0;
} | #include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <queue>
#define MOD (1000000007l)
#define rep(i, n) for(long i = 0; i < (n); i++)
using namespace std;
void solve() {
long N, K;
cin >> N >> K;
vector<long> a(N);
rep (i, N) cin >> a[i];
vector<long> acc(N+1, 0);
rep (i, N) acc[i+1] = acc[i] + a[i];
vector<long> beauty;
for (long i = 0; i < acc.size(); i++)
for (long j = i+1; j < acc.size(); j++)
beauty.push_back(acc[j] - acc[i]);
for (long i = 1l << 40; i > 0; i >>= 1) {
vector<long> foo;
for (auto it: beauty) if (it & i) foo.push_back(it);
if (foo.size() >= K) beauty = foo;
}
long ans = beauty[0];
for (auto it: beauty) ans &= it;
cout << ans << endl;
}
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
cout.precision(12);
solve();
return 0;
} | 1 | 40,676,198 |
#include <bits/stdc++.h>
#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 all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define limit(x,l,r) max(l,min(x,r))
#define lims(x,l,r) (x = max(l,min(x,r)))
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
#define show(x) cout << #x << " = " << (x) << endl
#define show2(x,y) cout << #x << " = " << (x) << ", " << #y << " = " << (y) << endl
#define show3(x,y,z) cout << #x << " = " << (x) << ", " << #y << " = " << (y) << ", " << #z << " = " << (z) << endl
#define showv(v) rep(i,v.size()) printf("%d%c", v[i], i==v.size()-1?'\n':' ')
#define showv2(v) rep(j,v.size()) showv(v[j])
#define showt(t,n) rep(i,n) printf("%d%c", t[i], i==n-1?'\n':' ')
#define showt2(t,r,c) rep(j,r) showt(t[j],c)
#define showvp(p) rep(i,p.size()) printf("%d %d\n", p[i].first, p[i].second)
#define printv(v) rep(i,v.size()) printf("%d\n", v[i])
#define printt(t,n) rep(i,n) printf("%d\n", t[i])
#define incl(v,x) (find(all(v),x)!=v.end())
#define incls(s,c) (s.find(c)!=string::npos)
#define lb(a,x) distance((a).begin(),lower_bound(all(a),(x)))
#define ub(a,x) distance((a).begin(),upper_bound(all(a),(x)))
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define bit(n,k) ((n>>k)&1)
#define bn(x) ((1<<x)-1)
#define dup(x,y) (((x)+(y)-1)/(y))
#define newline puts("")
#define uni(x) x.erase(unique(all(x)),x.end())
#define SP << " " <<
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vc = vector<char>;
using vvc = vector<vc>;
using vs = vector<string>;
using vb = vector<bool>;
using vvb = vector<vb>;
using P = pair<int, int>;
using T = tuple<int, int, int>;
using vp = vector<P>;
using vt = vector<T>;
const int mod = 1000000007;
const double EPS = 1e-9;
const int INF = (1<<30)-1;
const ll LINF = (1LL<<62)-1;
#define dame { puts("No"); return 0;}
#define yn {puts("Yes");}else{puts("No");}
#define YN {puts("YES");}else{puts("NO");}
inline int in() { int x; cin >> x; return x;}
inline ll lin() { ll x; cin >> x; return x;}
inline char chin() { char x; cin >> x; return x;}
inline string stin() { string x; cin >> x; return x;}
inline double din() { double x; cin >> x; return x;}
template<typename T>inline ll suma(const vector<T>& a) { ll res(0); for (auto&& x : a) res += x; return res;}
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; }
char itoa(int n) { return n + '0';}
ll gcd(ll a, ll b) { return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
const int dy[4] = {0, -1, 0, 1};
const int dx[4] = {1, 0, -1, 0};
int main () {
int n, k;
cin >> n >> k;
vi p(n), c(n);
rep(i,n) cin >> p[i], p[i]--;
rep(i,n) cin >> c[i];
ll ans = -LINF;
rep(si,n) {
int x = si;
vi s;
ll tot = 0;
while (1) {
x = p[x];
s.pb(c[x]);
tot += c[x];
if (x == si) break;
}
int l = s.size();
ll t = 0;
rep(i,l) {
t += s[i];
if (i+1 > k) break;
ll now = t;
if (tot > 0) {
ll e = (k-(i+1))/l;
now += tot*e;
}
chmax(ans, now);
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for(int i = 0; i < (int)(n); i++)
#define IN(type, n) type n; cin >> n
ll solve(int N, int K, vector<int> P, vector<int>C) {
vector<vector<int> > loops = {};
vector<ll> sum = {};
bitset<5000> flag_check;
ll max_score = LLONG_MIN;
REP (i, N) {
if (flag_check[i]) continue;
int next = P.at(i) - 1;
ll tmp_sum = 0;
vector<int> tmp_vec = {};
while (true) {
if (flag_check[next]) break;
flag_check.set(next);
tmp_vec.push_back(next);
tmp_sum += C.at(next);
next = P.at(next) - 1;
}
loops.push_back(tmp_vec);
sum.push_back(tmp_sum);
}
REP (i, loops.size()) {
vector<int> v = loops.at(i);
int size = v.size();
ll max_all = LLONG_MIN;
ll max_limit = LLONG_MIN;
REP (j, size) {
ll tmp_sum = 0;
int next = v.at(j);
REP (k, size) {
tmp_sum += C.at(next);
if (k < K % size) {
max_limit = max(max_limit, tmp_sum);
}
max_all = max(max_all, tmp_sum);
next = P.at(next) - 1;
}
}
ll sum_v = sum.at(i);
ll max_v;
if (sum_v > 0) {
max_v = max(sum_v * (K / size) + max_limit, sum_v * (K / size - 1) + max_all);
} else {
max_v = max(max_limit, max_all);
}
max_score = max(max_score, max_v);
}
return max_score;
}
int main() {
IN(int, N);
IN(int, K);
vector<int> P(N);
vector<int> C(N);
vector<int> sumv(N);
long long sum = 0;
REP(i, N) {
cin >> P.at(i);
}
REP(i, N) {
cin >> C.at(i);
sum += C.at(i);
}
cout << solve(N, K, P, C) << endl;;
return 0;
} | 1 | 22,177,652 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vll = vector<long long>;
using vvi = vector<vector<int>>;
template<class T> inline bool chmax(T &a, T b) { if (a<b) {a=b; return 1;} return 0;}
template<class T> inline bool chmin(T &a, T b) { if (b<a) {a=b; return 1;} return 0;}
vector<ll> enum_div(ll n) {
vector<ll> result;
for (ll i = 1; i*i <= n; i++) {
if (n % i == 0) {
result.push_back(i);
if (i*i != n) {
result.push_back(n/i);
}
}
}
return result;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
cin >> n;
vll div = enum_div(n);
ll ans = 0;
rep(i, div.size()) {
ll m = div[i]-1;
if (m == 0) continue;
if (n / m == n % m) ans += m;
}
cout << ans << endl;
} | #include<stdio.h>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
template<class T> inline T sqr(T x) {return x*x;}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
const double EPS = 1e-10;
const double PI = acos(-1.0);
#define CLR(a) memset((a), 0 ,sizeof(a))
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
void solve(long long N, std::vector<long long> A, std::vector<long long> K){
}
int main(){
LL N;
LL ans=0;
cin>>N;
for(LL i=1; i <= sqrt(N); i++){
if(N%i==0){
LL m = N/i;
m=max((LL)1, m-1);
if(N/m == N%m){
ans+=m;
}
}
}
cout<<ans<<endl;
} | 1 | 11,811,418 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0) , cin.tie(0) , cout.tie(0);
#ifdef LOCAL
freopen("input.in" , "r" , stdin);
#endif
int n;
string s;
cin >> n >> s;
int R = 0 , G = 0 , B = 0;
for (char &c : s) {
R += c == 'R';
G += c == 'G';
B += c == 'B';
}
long long ans = 1ll * R * G * B;
for (int i = 0 ;i < n ;i++) {
for (int j = i + 1 ;j < n ;j++) {
if (s[i] == s[j]) continue;
int d = j - i;
if (j + d >= n) continue;
ans -= s[j + d] != s[i] && s[j + d] != s[j];
}
}
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int64_t N, ans = 0;
cin >> N;
string S;
cin >> S;
vector<int> R(N + 1, 0), G(N + 1, 0), B(N + 1, 0);
for (int i = 0; i < N; i++)
{
if (S[i] == 'R')
R[i + 1]++;
else if (S[i] == 'G')
G[i + 1]++;
else
B[i + 1]++;
R[i + 1] += R[i];
G[i + 1] += G[i];
B[i + 1] += B[i];
}
for (int i = 0; i < N - 2; i++)
{
for (int k = i + 2; k < N; k++)
{
if (S[i] == S[k])
continue;
int j = (k + i) / 2;
if (S[i] != 'R' && S[k] != 'R')
{
ans += R[k] - R[i];
if (j - i == k - j && S[j] == 'R')
{
ans--;
}
}
else if (S[i] != 'G' && S[k] != 'G')
{
ans += G[k] - G[i];
if (j - i == k - j && S[j] == 'G')
{
ans--;
}
}
else
{
ans += B[k] - B[i];
if (j - i == k - j && S[j] == 'B')
{
ans--;
}
}
}
}
cout << ans << endl;
} | 1 | 67,516,596 |
#include <iostream>
using namespace std;
int main() {
int k, s;
cin >> k >> s;
int count = 0;
for (int x = 0; x <= k; x++) {
if (x > s) continue;
int ypz = s - x;
if (ypz < k)
count += (ypz + 1);
else if (ypz >= k && ypz <= 2 * k)
count += (k - (ypz - k) + 1);
else
count += 0;
}
cout << count << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int x,y,z;
int main() {
cin >> x >> y;
for (int i = 0; i <= x; i++) {
int tmp = y-i;
if (tmp >= 0) {
z += max(0, min(tmp+1, x-(tmp-x)+1));
}
}
cout << z << "\n";
} | 1 | 60,306,669 |
#include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#include <unistd.h>
#include <stdio.h>
#define rep(i,x) for(ll i = 0;i<x;i++)
#define all(a) (a).begin(),(a).end()
using ll = long long;
using ld = long double;
using namespace std;
using dou = double;
const ll INF = 1LL << 60;
const ll mod = 1000000007;
typedef pair<ll,ll> P;
using graph = vector<vector<ll>>;
template<class T> inline bool chmax(T& a, T b){if(a < b){a = b; return true;}return false;}
template<class T> inline bool chmin(T& a, T b){if(a > b){a = b; return true;}return false;}
ll gcd(ll a,ll b){
if(a < b)swap(a,b);
if(a % b == 0)return b;
else return gcd(b,a%b);
}
bool isp(ll n){
bool res = true;
if(n == 1)return false;
else{
for(ll i = 2;i * i <= n;i++){
if(n % i == 0){
res = false;
break;
}
}
return res;
}
}
int main(){
string S ;
cin >> S;
if(S.substr(0,4) == "YAKI" && S.size() >= 4)cout << "Yes" << endl;
else cout << "No" << endl;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using ll = long long;
using P =pair<int,int>;
int main() {
string S;
cin>>S;
if(S.size()>=4){
if(S.at(0)=='Y'){
if(S.at(1)=='A'){
if(S.at(2)=='K'){
if(S.at(3)=='I'){
cout<<"Yes"<<endl;
return 0;
}
}
}
}
}else{
cout<<"No"<<endl;
return 0;
}
cout<<"No"<<endl;
return 0;} | 1 | 45,700,088 |
#include "bits/stdc++.h"
using namespace std;
#define ll long long
#define rep(i,n) for(int i = 0;i < (n); i++)
#define LM 1000000000000000000
int main() {
int n;
ll ans = 1;
int chk = 0;
ll buf;
cin >> n;
vector<ll> a(n);
rep(i, n) {
cin >> a[i];
if (a[i] == 0)chk = 1;
}
if (chk == 0) {
rep(i, n) {
if (a[i] > LM / ans) {
ans = -1;
break;
}
ans *= a[i];
}
}
else ans = 0;
if (ans > LM)ans = -1;
cout << ans << endl;
return 0;
} | #include<iostream>
#include<iomanip>
#include<ios>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<string>
#include<algorithm>
#include<utility>
#include<math.h>
#include<cstdlib>
#define rep(i, n) for(int i=0;i<n;i++)
#define repb(i, a, b) for(int i=a;i<b;i++)
#define MAX_N 10000
using namespace std;
typedef pair<int, int> P;
typedef long long int ll;
const int INF = 1<<30;
const ll MOD = ll(1e9+7);
int main(){
int n;cin>>n;
ll ans=1LL;
bool inf=false;
rep(i, n){
ll a;cin>>a;
if(a==0LL){cout<<0<<endl;return 0;}
ll d=ll(1e18)/ans;
if(d<a){inf=true;ans=1LL;}
ans*=a;
}
cout<<(inf?-1:ans)<<endl;
} | 1 | 16,820,555 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 100000000;
#define rep1(i, n) for (ll i=0; i<(n); i++)
#define rep2(i, k, n) for (ll i=k; i<(n); i++)
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() {
string s;
cin >> s;
ll n = s.size();
ll ans = 0;
rep1(i, n-1) if (s[i]!=s[i+1]) ans++;
cout << ans << endl;
} | #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
char current = S[0];
int cnt = 0;
for (const char &c : S) {
if (current != c) {
cnt++;
current = c;
}
}
cout << cnt << endl;
} | 1 | 67,300,798 |
#include <iostream>
#include <string>
#include <vector>
int sum_digits(std::string s) {
int sum = 0;
for (int i = 0; i < s.length(); i++) {
sum += s[i] - '0';
}
return sum;
}
int main() {
std::ios::sync_with_stdio(false);
std::vector<int> sums;
std::string s;
while (true) {
std::cin >> s;
if (s == "0") break;
sums.push_back( sum_digits(s) );
}
for (int i = 0; i < sums.size(); i++) {
std::cout << sums[i] << "\n";
}
return 0;
} | #include <iostream>
int main(void) {
std::string x;
std::cin >> x;
while(x != "0") {
int sum = 0;
for (int i = 0; i < x.size(); i++) {
sum += x[i] - '0';
}
std::cout << sum << std::endl;
std::cin >> x;
}
return 0;
} | 1 | 30,914,836 |
#include<bits/stdc++.h>
#define range(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,b) for(int i = 0; i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define show(x) cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
const int INF = 2000000000;
using namespace std;
int main(){
int n, m, c[21];
cin >> n >> m;
rep(i,m){ cin >> c[i]; }
sort(c, c + m, greater<int>());
int dp[50005];
rep(i,50005) dp[i] = INF;
dp[0] = 0;
rep(i,m){
rep(j,n + 1){
if(j + c[i] <= n){
dp[j + c[i]] = min(dp[j + c[i]], dp[j] + 1);
}
}
}
cout << dp[n] << endl;
} | #include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(c) begin(c),end(c)
const int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
const int MOD = (int)(1e9) + 7;
const double PI = acos(-1);
const double EPS = 1e-9;
template<class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; }
template<class T> bool chmin(T &a, const T &b) { if (a > b) { a = b; return true; } return false; }
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M; cin >> N >> M;
vector<int> coins(M+1); rep(i, 1, M+1) { cin >> coins[i]; }
vector<vector<int>>dp(M + 1, vector<int>(N + 1, INF));
rep(i, 1, M + 1)rep(j, 0, N + 1) {
if (j == 0)dp[i][j] = 0;
else {
dp[i][j] = dp[i - 1][j];
if (j - coins[i] >= 0)chmin(dp[i][j], dp[i][j - coins[i]]+1);
}
}
cout << dp[M][N] << endl;
return 0;
} | 1 | 88,230,113 |
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
int main() {
int N;
cin >> N;
vector<int> P(N);
vector<int> Q(N);
for(int i = 0; i < N; i++) cin >> P.at(i);
for(int i = 0; i < N; i++) cin >> Q.at(i);
vector<int> kaijou(N+1, 1);
for(int i = 1; i < N+1; i++) kaijou.at(i) = kaijou.at(i-1) * i;
vector<int> temp(N+1);
for(int i = 0; i < N+1; i++) temp.at(i) = i;
int num, cnt = 0, cnt_2 = 0;
for(int i = 0; i < N-2; i++){
for(int j = 1; j <= N-i; j++){
if(P.at(i) == temp.at(j)){
num = j;
temp.at(j) = 1000;
break;
}
}
cnt += (num-1) * kaijou.at(N-1-i) + 1;
sort(temp.begin(), temp.end());
}
if(P.at(N-2) > P.at(N-1)) cnt++;
for(int i = 0; i < N+1; i++) temp.at(i) = i;
for(int i = 0; i < N-2; i++){
for(int j = 1; j <= N-i; j++){
if(Q.at(i) == temp.at(j)){
num = j;
temp.at(j) = 1000;
break;
}
}
cnt_2 += (num-1) * kaijou.at(N-1-i) + 1;
sort(temp.begin(), temp.end());
}
if(Q.at(N-2) > Q.at(N-1)) cnt_2++;
cout << max(cnt, cnt_2) - min(cnt, cnt_2) << endl;
} | #include <bits/stdc++.h>
#define rep(i, to) for (int i = 0; i < (to); i++)
#define rrep(i, to) for (int i = to - 1; i >= 0; i--)
#define repf(i, from, to) for (int i = (from); i < (to); i++)
#define all(v) v.begin(), v.end()
#define unless(cond) if (!(cond))
using namespace std;
using ll = long long;
template <typename T>
using V = vector<T>;
template <typename T, typename U>
using P = pair<T, U>;
int main() {
int n;
V<int> p;
V<int> q;
cin >> n;
p.resize(n);
q.resize(n);
rep(i, n) {
cin >> p[i];
}
rep(i, n) {
cin >> q[i];
}
V<int> perm(n, 0);
rep(i, n) {
perm[i] = i + 1;
}
bool find_p = false;
bool find_q = false;
int a, b;
int count = 0;
do {
count++;
if(perm == p && !find_p) {
a = count;
}
if(perm == q && !find_q) {
b = count;
}
} while(next_permutation(all(perm)));
cout << abs(a - b) << endl;
} | 1 | 46,791,642 |
#include<bits/stdc++.h>
typedef long long ll;
typedef std::pair<ll, ll> P;
#define rep(i,n) for(int i = 0; i < int(n); i++)
using namespace std;
template<class T> inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
ll xor_of (ll c) {
ll bits = 0;
c++;
for (ll i = 0; (1LL << i) <= c; i++) {
ll loop = (1LL << (i + 1));
ll d = c / loop;
ll ones = loop / 2 * d;
ll r = c % loop;
ll loop2 = (1LL << i);
if (r > loop2) {
ones += r - loop2;
}
ones %= 2;
if (ones) {
bits |= (1LL << i);
}
}
return bits;
}
int main() {
ll a, b;
cin >> a >> b;
ll xa = xor_of(a-1);
ll xb = xor_of(b);
cout << (xa ^ xb) << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#define DF(x) x.erase(x.begin())
#define ALL(x) x.begin(), x.end()
#define SORT(x) sort(ALL(x))
#define REVERSE(x) reverse(ALL(x))
#ifdef _DEBUG
#define debug(x) cout << "[debug] " << #x << ": " << x << endl
#else
#define debug(x)
#endif
using namespace std;
using ll = long long;
using ld = long double;
using vll = vector<ll>;
using P = pair<ll, ll>;
constexpr ll INF = 0x3f3f3f3f3f3f3f3f;
constexpr double PI = 3.141592653589793238462643383279;
ll getDigit(ll x) {
return x == 0 ? 1 : log10(x) + 1;
}
ll gcd(ll x, ll y) {
return y ? gcd(y, x % y) : x;
}
ll lcm(ll a, ll b) {
return a / gcd(a, b) * b;
}
vector<P> factorize(ll n) {
vector<P> result;
for (ll i = 2; i * i <= n; ++i) {
if (n % i == 0) {
result.pb({i, 0});
while (n % i == 0) {
n /= i;
result.back().second++;
}
}
}
if (n != 1) {
result.pb({n, 1});
}
return result;
}
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;
}
template <typename T>
void debugV(const vector<T> v) {
#ifdef _DEBUG
rep(i, v.size()) {
cout << i << ":" << v[i] << " ";
}
cout << endl;
#else
(void)v;
#endif
}
signed main() {
ll A, B;
cin >> A >> B;
if (A == B) {
COUT(A);
return 0;
}
if (A % 2 == 0 && B % 2 == 1) {
ll a = A / 2;
ll b = B / 2 + 1;
ll kosu = b - a;
if (kosu % 2 == 0) {
COUT(0);
} else {
COUT(1);
}
return 0;
}
if (A % 2 == 0 && B % 2 == 0) {
ll a = A / 2;
ll b = B / 2;
ll kosu = b - a;
if (kosu % 2 == 0) {
COUT(B ^ 0);
} else {
COUT(B ^ 1);
}
return 0;
}
if (A % 2 == 1 && B % 2 == 1) {
ll a = A / 2;
ll b = B / 2 + 1;
ll kosu = b - a;
if (kosu % 2 - 1 == 0) {
COUT(A ^ 0);
} else {
COUT(A ^ 1);
}
return 0;
}
if (A % 2 == 1 && B % 2 == 0) {
ll a = A / 2;
ll b = B / 2;
ll kosu = b - a;
if (kosu % 2 - 1 == 0) {
COUT(A ^ B ^ 0);
} else {
COUT(A ^ B ^ 1);
}
return 0;
}
return 0;
} | 1 | 1,353,361 |
#include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
lli n, m;
int main(void){
cin >> n >> m;
lli c = 1;
rep(i, m) c*=2;
cout << c*(1900*m+100*(n-m)) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,M,X;
cin >> N >> M;
X = (1900 * M + 100 * (N-M))*pow(2,M);
cout << X;
} | 1 | 17,844,405 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <string.h>
#include <string>
using namespace std;
int main()
{
int n, d, x;
cin >> n >> d >> x;
int a[n];
for (int i=0; i<n; i++) {
cin >> a[i];
}
int choco = 0;
for (int i=0; i<n; i++) {
int tmp = 1;
while (true) {
if (tmp > d) break;
choco++;
tmp += a[i];
}
}
cout << choco+x << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n,d,x;
cin>>n>>d>>x;
vector<int> A(n);
for(int i=0;i<n;i++){
cin>>A.at(i);
}
int sum=0;
for(int i=0;i<n;i++){
int eating_day=0;
for(int j=0;j<d;j++){
if(j==0){
sum++;
eating_day=A.at(i)+1;
}
else if(j==eating_day-1){
sum++;
eating_day+=A.at(i);
}
}
}
cout<<sum+x<<endl;
return 0;
} | 1 | 38,697,119 |
#include "bits/stdc++.h"
using namespace std;
typedef long long int ll;
typedef pair<ll, ll > pi;
typedef pair<pair<ll, ll >, ll > pii;
vector<ll > vec;
vector<vector<ll > > vec2;
ll MOD = 1000000007;
ll INF = 1145141919454519;
ll ans = INF;
void solv(ll H, ll W){
for(ll i = 1; i < W; i++){
ll a = i * H;
ll b = H/2*(W-i);
ll c = H * W - a - b;
ans = min(ans, abs(max(max(a, b), c)-min(min(a, b), c)));
ll d = (W-i)/2 * H;
ll e = H * W - a - d;
ans = min(ans, abs(max(max(a, d), e)-min(min(a, d), e)));
}
}
int main() {
ll H, W;
cin >> H >> W;
if(H % 3 == 0 || W % 3 == 0){
cout << 0 << endl;
return 0;
}
solv(H, W);
swap(H, W);
solv(H, W);
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
#define INF __INT32_MAX__
#define LINF __LONG_LONG_MAX__
ll check(ll x, ll y) {
ll ans = LINF;
if (x >= 3) {
for (int i = 1; i <= x - 2; i++) {
ll a = i * y;
ll b = ((x - i) / 2) * y;
ll c = ((x - i) - (x - i) / 2) * y;
ll d = min(a, min(b, c));
ll e = max(a, max(b, c));
ans = min(ans, e - d);
}
}
for (int i = 1; i <= x - 1; i++) {
ll a = i * y;
ll b = (x - i) * (y / 2);
ll c = (x - i) * ( y - (y / 2));
ll d = min(a, min(b, c));
ll e = max(a, max(b, c));
ans = min(ans, e - d);
}
return ans;
}
int main() {
ll H, W;
cin >> H >> W;
cout << min(check(H, W), check(W, H)) << endl;
} | 1 | 72,784,419 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
int main() {
ll a[32]={1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
ll n;
cin>>n;
n--;
cout <<a[n];
return 0;
} | #include <stdio.h>
#include <string.h>
int main() {
int arr[100]={1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int n;
scanf("%d", &n);
printf("%d\n", arr[n-1]);
} | 1 | 40,347,211 |
#include <iostream>
using namespace std;
int main() {
int n; cin >> n;
int ans = 100000;
int tmp;
for (int i=0; i<n; i++) {
ans *= 1.05;
tmp = ans / 1000 * 1000;
if (tmp != ans) ans = tmp + 1000;
}
cout << ans << endl;
return 0;
} | #include<stdio.h>
int main(void)
{
int a,s,d,f,g,i;
s=100000;
scanf("%d",&a);
for(i=1;i<=a+1;i++){
s=s+d;
d=(s/100)*5;
if(d%1000!=0){
g=d/1000;
d=(g+1)*1000;
}
}
printf("%d\n",s);
return 0;
} | 1 | 30,481,698 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<pair<int,int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
#define PUB push_back
#define PO pop
#define POF pop_front
#define POB pop_back
#define REP(i,a,b) for(int i=a; i<=b; i++)
#define MOD 1000000007
void solve(int test_case) {
int n;
cin>>n;
cout<<((n+1)/2)-1;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int t=1;
REP(i,1,t) {
solve(i);
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll mod=1000000007;
const int MAX_N = 1000;
double nCk(int n, int k) {
double res=1.0;
for(int i=0; i<n; i++){
res*=0.5;}
for(int i=0; i<k; i++){
res*=(double)(n-i);
res/=(double)(k-i);
}
return res;}
int main() {
ll n;
cin>>n;
cout <<(n-1)/2<< endl;
return 0;} | 1 | 33,631,570 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
using Graph = vector<vector<ll>>;
using P = pair<int,int>;
#define MOD 1000000007
#define INF 1000000
#define PI 3.14159265358979323846264338327950L
#define MAX_N 200010
#define lb lower_bound
ll max3(ll a,ll b,ll c)
{
return max(max(a,b),c);
}
int main()
{
ll X,Y,A,B,C;
cin>>X>>Y>>A>>B>>C;
ll pp,qq,rr;
priority_queue<ll, vector<ll>> p;
priority_queue<ll, vector<ll>> q;
priority_queue<ll, vector<ll>> r;
for (int i=0;i<A;i++)
{
cin>>pp;
p.push(pp);
}
for (int i=0;i<B;i++)
{
cin>>qq;
q.push(qq);
}
for (int i=0;i<C;i++)
{
cin>>rr;
r.push(rr);
}
ll ans = 0;
ll i=0;
ll j=0;
ll k=0;
while (k<X+Y)
{
pp=p.top();
qq=q.top();
rr=r.top();
if (p.empty() || i>=X) pp = -1;
if (q.empty() || j>=Y) qq = -1;
if (r.empty()) rr = -1;
if (i<X && pp==max3(pp,qq,rr))
{
ans += pp;
p.pop();
i++;
}
else if (j<Y && qq==max3(pp,qq,rr))
{
ans += qq;
q.pop();
j++;
}
else if (rr==max3(pp,qq,rr))
{
ans += rr;
r.pop();
}
k++;
}
cout<<ans<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#include <boost/multiprecision/cpp_int.hpp>
using boost::multiprecision::cpp_int;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = vector<string>;
using vld = vector<ld>;
using vvld = vector<vld>;
typedef pair<ll, ll> P;
#define bit(n) (1LL << (n))
#define all(v) v.begin(), v.end()
#define rep(i, n) for (ll i = 0; i < n; i++)
#define REP(i, n) for (ll i = 1; i < n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORm(i, m) for (auto i = m.begin(); i != m.end(); i++)
template <class T>
inline void chmax(T& a, T b) {
a = std::max(a, b);
}
template <class T>
inline void chmin(T& a, T b) {
a = std::min(a, b);
}
#define mod (ll)(1e9 + 7)
const long long INF = 1LL << 60;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
ll x, y, a, b, c;
cin >> x >> y >> a >> b >> c;
vll p(a), q(b), r(c);
rep(i, a) cin >> p[i];
rep(i, b) cin >> q[i];
rep(i, c) cin >> r[i];
sort(all(p));
sort(all(q));
reverse(all(p));
reverse(all(q));
priority_queue<ll> qp, qq, qr;
rep(i, min(a, x)) qp.push(p[i]);
rep(i, min(b, y)) qq.push(q[i]);
rep(i, c) qr.push(r[i]);
qp.push(0);
qq.push(0);
qr.push(0);
ll ans = 0;
rep(i, x + y) {
ll mx = 0;
chmax(mx, qp.top());
chmax(mx, qq.top());
chmax(mx, qr.top());
ans += mx;
if (mx == qp.top())
qp.pop();
else if (mx == qq.top())
qq.pop();
else
qr.pop();
}
cout << ans << endl;
return 0;
} | 1 | 17,151,804 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <algorithm>
#include <cmath>
#include <cstring>
using namespace std;
#define REP(i,n) for(int i = 0; i < n; i++)
#define RREP(i,n) for(int i = n - 1; i >= 0; i--)
#define ALL(v) v.begin(),v.end()
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define UNIQUE(v) do{sort(v.begin(), v.end()); v.erase( unique(v.begin(), v.end()), v.end() );} while(0)
#define y0 y3487465
#define y1 y8687969
#define m0(x) memset(x,0,sizeof(x))
#define m1(x) memset(x,63,sizeof(x))
typedef long long ll;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pi> vpi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
double EPS = 1e-9;
int INFi = 1000000005;
long long INFll = 1000000000000000005ll;
double PI = acos(-1);
int dirx[8] = {-1,0,0,1,-1,-1,1,1};
int diry[8] = {0,1,-1,0,-1,1,-1,1};
ll MOD = 1000000007;
const int MAX_N = 200000;
ll fact[MAX_N + 1], fact_inv[MAX_N + 1];
ll mod_pow(ll x, ll n, ll p) {
if(n == 0) return 1;
ll res = mod_pow(x * x % p, n / 2, p);
if(n & 1) res = res * x % p;
return res;
}
void init(ll n, ll p) {
fact[0] = 1;
for(int i = 0; i < n; i++) {
fact[i + 1] = fact[i] * (i + 1) % p;
}
fact_inv[n] = mod_pow(fact[n], p - 2, p);
for(int i = n - 1; i >= 0; i--) {
fact_inv[i] = fact_inv[i + 1] * (i + 1) % p;
}
}
ll mod_nck(ll n, ll k, ll p) {
if(k > n) return 0;
return (fact[n] * fact_inv[k]) % p * fact_inv[n-k] % p;
}
int n;
int a[MAX_N];
int main(){
cin >> n;
REP(i, n + 1) cin >> a[i];
int b[n + 1];
REP(i, n + 1) {
b[i] = 0;
}
int db = 0, l, r;
REP(i, n + 1) {
b[a[i]]++;
if(b[a[i]] == 2) {
db = a[i];
r = i;
break;
}
}
REP(i, n + 1) {
if(a[i] == db) {
l = i;
break;
}
}
init(n + 1, MOD);
REP(i, n + 1) {
cout << (mod_nck(n + 1, i + 1, MOD) - mod_nck(l + n - r, i, MOD) + MOD) % MOD << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1; finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(int n, int k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
int n;
cin>>n;
int a[n+1];
int p, q;
map<int, int> m;
for (int i=0; i<=n; i++) {
cin>>a[i];
if (m[a[i]] > 0) {
p = m[a[i]] - 1;
q = i;
}
m[a[i]] = i+1;
}
COMinit();
for (int i=1; i<=n+1; i++) {
long long ans = COM(n+1, i);
ans -= COM(n+p-q, i-1);
ans = (ans + MOD) % MOD;
cout<<ans<<endl;
}
} | 1 | 65,829,828 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i )
using namespace std;
typedef long long ll;
int main(){
int N;cin >> N;
vector<int> num_list(N);
int count = 0;
int min = 0;
rep(i,N){
int tmp;
cin >> tmp;
num_list.push_back(tmp);
if (count == 0){
min = tmp;
count++;
continue;
}
if (tmp <= min){
min = tmp;
count++;
}
}
cout << count << endl;
return 0;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define leading zero str.erase(0, min(str.find_first_not_of('0'), str.size()-1));
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
string text="abcdefghijklmnopqrstuvwxyz";
const int maxn=1e6+7;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin>>n;
vector<int>v;
for(int i=0;i<n;i++){
int x;
cin>>x;
v.push_back(x);
}
set<int>s;
int cnt=0;
s.insert(v[0]);
for(int i=1;i<n;i++){
if(*s.begin()>=v[i])cnt++;
s.insert(v[i]);
}
cout<<cnt+1<<endl;
} | 1 | 71,329,118 |
#include <iostream>
#include <string>
#include <cstring>
#include <vector>
#include <algorithm>
#include <set>
#include <stack>
#include <deque>
#include <cmath>
#include <map>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; i++)
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
int main() {
ll n, h, w;
cin >> n >> h >> w;
ll ans = 0;
rep(i, n) {
ll a, b;
cin >> a >> b;
if (h <= a && w <= b) ans++;
}
cout << ans << endl;
} | #include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef long double ld;
const int inf=1e9+7;
const ll INF=1LL<<60 ;
const ll mod=1e9+7 ;
#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++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<int, int> P;
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(),c.end()
#define pb push_back
#define debug(x) cerr << #x << " = " << (x) << endl;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
void solve() {
int n, h, w; cin >> n >> h >> w;
vector<int> a(n), b(n);
rep(i, n) {
cin >> a[i] >> b[i];
}
int ans = 0;
rep(i, n) {
if(a[i] >= h && b[i] >= w) {
++ ans;
}
}
cout << ans << endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
solve();
return 0;
} | 1 | 62,052,902 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
using ll = long long;
using P = pair<int, int>;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(v) v.begin(), v.end()
#define sz(x) ((int) x.size())
#define pb push_back
#define mp make_pair
#define F first
#define S second
const int MOD = 1000000007;
template<class T> void print(const T& t){ cout << t << endl; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int main(){
vector<char> s(10);
rep(i,10){
cin >> s[i];
}
if(s[5]=='1'){
print("TBD");
}
else{
if(s[6]!='1'&&s[6]!='2'&&s[6]!='3'&&s[6]!='4'){
print("TBD");
}
else{
print("Heisei");
}
}
} | #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <utility>
#include <cmath>
#include <tuple>
#include <queue>
#include <bitset>
#include <set>
#include <map>
#include <list>
using ll = long long;
using ld = long double;
using namespace std;
const int INF = 1e9+100;
const ll INF64 = 7e18l;
const int mod = 1000000007;
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define ALL(a) (a).begin(), (a).end()
#define FIN ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int main(){
FIN;
char c;
string s;
int y=0,m=0;
for(int i=3;i>=0;i--){
cin >> c;
s = c;
y += pow(10,i) * stoi(s);
}
if(y < 2019){ cout << "Heisei" << endl; return 0;}
if(y > 2019){ cout << "TBD" << endl; return 0;}
cin >> c;
for(int i=1;i>=0;i--){
cin >> c;
s = c;
m += pow(10,i) * stoi(s);
}
if(m <= 4){cout << "Heisei" << endl; return 0;}
else {cout << "TBD" << endl; return 0;}
return 0;
} | 1 | 20,737,287 |
#include<cstdio>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
int main(){
int n; scanf("%d",&n);
rep(_,n){
int y,m,d; scanf("%d%d%d",&y,&m,&d);
int ans=0;
for(;y<1000;ans++){
if(d<(y%3==0||m%2==1?20:19)) d++;
else if(m<10) d=1, m++;
else d=1, m=1, y++;
}
printf("%d\n",ans);
}
return 0;
} | #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<climits>
#include<iostream>
#include<algorithm>
#include<stack>
#include<queue>
#include<vector>
#include<list>
#include<map>
#include<set>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);i++)
#define MAX_n 105
int n;
int Y[MAX_n],M[MAX_n],D[MAX_n];
void input(){
cin>>n;
REP(i,n) cin>>Y[i]>>M[i]>>D[i];
}
void solve(){
REP(i,n){
int keika=0;
for(int j=1;j<Y[i];j++){
if(j%3==0) keika+=200;
else keika+=(20*5+19*5);
}
for(int j=1;j<M[i];j++){
if(Y[i]%3==0)keika+=20;
else if(j%2==0)keika+=19;
else keika+=20;
}
keika+=D[i]-1;
cout<<196470-keika<<endl;
}
}
int main(){
input();
solve();
return 0;
} | 1 | 43,061,263 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
#include<cmath>
using namespace std;
using ll = long long;
int main(){
ll k,a,b;cin>>k>>a>>b;
ll ans=1;
ll coin=0;
if(b-a>1){
for(ll i=0;i<k;i++){
if(coin>0){
ans+=b;
coin--;
}
else if(i!=k-1&&ans>=a){
ans-=a;
coin++;
}
else ans++;
}
}
else ans += k;
cout<<ans<<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll k, a, b; cin >> k >> a >> b;
ll ans = 0;
if (a + 1 < b) {
ll quo = k / (a + 1);
ll mod = k % (a + 1);
if (quo == 0) {
ans = 1;
ans += k;
}
else {
k -= a + 1;
ans = b;
ll quo2 = k / 2;
ll mod2 = k % 2;
ans -= quo2 * a;
ans += quo2 * b;
ans += mod2;
}
}
else {
ans = 1;
ans += k;
}
cout << ans << endl;
return 0;
} | 1 | 70,620,366 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
string char_to_string(char val) {
return string(1, val);
}
int char_to_int(char val) {
return val - '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;
}
int main() {
int a, b; cin >> a >> b;
if((a * b) % 2 == 0) cout << "Even" << endl;
else cout << "Odd" << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
if(a*b%2==0){
cout<<"Even";
return 0;
}
cout<<"Odd";
} | 1 | 9,872,419 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
char c;
cin>>c ;
if(c>='A'&&c<='Z')
{
cout<<"A";
}else
cout<<"a";
} | #include <bits/stdc++.h>
using namespace std;
#define forn for (ll i = 0; i < n; i++)
#define form for (ll j = 0; j < m; j++)
#define NO cout << "NO\n";
#define YES cout << "YES\n";
#define pb push_back
#define mp make_pair
#define rep(i,a,b) for (ll i = a; i < b; i++)
typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll, ll> pi;
ll gcd(ll a, ll b){
ll r;
while (b != 0){
r = a % b;
a = b;
b = r;
}
return a;
}
ll *calc_z(string s){
ll n = s.size();
ll *z = new ll[n] {0};
ll l = 0, r = 0;
for (ll i = 1; i < n; i++){
if (r >= i) z[i] = min(z[i-l], r-i+1);
while (z[i]+i < n && s[z[i]] == s[z[i]+i]) z[i]++;
if (i + z[i] - 1 > r){
l = i;
r = i+z[i]-1;
}
}
return z;
}
ll find_lower(ll *a, ll n, ll v){
ll l = -1, r = n;
while (r>l+1){
ll m = (l+r)/2;
if (a[m] >= v) r = m;
else l = m;
}
if (r == n) return n-1;
if (a[r] == v) return r;
return r == 0 ? 0 : r-1;
}
ll *num;
void init(){
}
void solve(){
char c;
cin >> c;
if (c >= 'a' && c <= 'z') cout << 'a' << "\n";
else cout << "A\n";
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
solve();
return 0;
} | 1 | 86,174,975 |
#include <bits/stdc++.h>
using namespace std;
int v[100002];
int n, maxx, sol;
int main()
{
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> v[i];
maxx = max(maxx, v[i]);
}
int p = 1;
while (v[p] != maxx)
p++;
v[p] = -1;
int nr1, nr2;
if (maxx & 1)
nr1 = maxx / 2, nr2 = maxx / 2 + 1;
else
nr1 = nr2 = maxx / 2;
int dist = maxx + 2;
for (int i = 1; i <= n; i++) {
if (v[i] != -1) {
int t = min(abs(v[i] - nr1), abs(v[i] - nr2));
if (dist > t) {
dist = t;
sol = v[i];
}
}
}
cout << maxx << " " << sol;
return 0;
} | #include <iostream>
#include <cstdio>
using namespace std;
int n, mx, m, x, i, j, t, a[100005];
int main()
{
cin >> n;
for (i = 0; i < n; i++) {
scanf ("%d", &a[i]);
mx = max(mx, a[i]);
}
for (i = 0; i < n; i++) {
t = min(a[i], mx - a[i]);
if (t > m) {
m = t;
x = a[i];
}
}
cout << mx << " " << x;
return 0;
} | 1 | 22,582,787 |
#include <bits/stdc++.h>
#define irep(i,n) for(int i = 0; i < (int)(n); i++)
#define irep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define irrep(i,n) for(int i = (int)(n-1); i > -1; i--)
#define irrep2(i,n,a) for(int i = (int)(n); i >= (int)(a); i--)
#define fi first
#define se second
using ll = long long;
using v_int = std::vector<int>;
using v2_int = std::vector<v_int>;
using v_ll = std::vector<ll>;
using v2_ll = std::vector<v_ll>;
using v_string = std::vector<std::string>;
using v_bool = std::vector<bool>;
using v2_bool = std::vector<v_bool>;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;
using mii = std::map<int, int>;
using mll = std::map<ll, ll>;
const double PI = 3.1415926535897932;
const int INF = 2*(int)1e9;
const ll LINF = (ll)1e18;
const ll MOD = 1000000007;
const int dc[8] = {1, -1, 0, 0, 1, -1, 1, -1};
const int dr[8] = {0, 0, 1, -1, 1, 1, -1, -1};
using namespace std;
template<typename T, typename U> inline
ostream& operator<<(ostream &o, pair<T,U> &p)
{
return o << "{" << p.first << "," << p.second << "}";
}
template<typename T, typename U, typename V> inline
ostream& operator<<(ostream &o, tuple<T,U,V> &p)
{
return o << "{" << get<0>(p) << "," << get<1>(p) << "," << get<2>(p) << "}";
}
template<typename T> inline
istream& operator>>(istream &is, vector<T> &v)
{
int len = (int)v.size();
for(int i = 0; i < len; i++) {
is >> v[i];
}
return is;
}
template<typename T> inline
ostream& operator<<(ostream &os, vector<T> &v)
{
int len = (int)v.size();
for(int i = 0; i < len; i++) {
os << v[i];
if(i != len-1) { os << ","; }
}
return os;
}
template<typename T> inline
void chmin(T &a, T b) { a = min(a, b); }
template<typename T> inline
void chmax(T &a, T b) { a = max(a, b); }
ll solve(ll n, ll m)
{
if(m==0) { return 0; }
if(n%m == n/m) {
return m;
} else {
return 0;
}
}
ll getSum(ll n)
{
ll ans = 0;
for(ll i = 1; i * i <= n; i++) {
if(n % i == 0) {
ans += solve(n, i-1);
if(i * i != n) ans += solve(n, n/i-1);
}
}
return ans;
}
int main(void)
{
ll n;
cin >> n;
cout << getSum(n) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define ll long long
#define _GLIBCXX_DEBUG
const ll MOD = 1000000007;
const int MAX = 510000;
vector<ll> enum_div(ll n){
vector<ll> ret;
for (ll i=1; i*i<=n; i++){
if (n%i==0){
ret.push_back(i);
if (i!=1&&i*i!=n) ret.push_back(n/i);
}
}
return ret;
}
int main() {
ll N;
cin >> N;
vector<ll> div = enum_div(N);
if (N!=1) div.push_back(N);
for (int i=1; i<(int)div.size(); i++) div[i]--;
ll res = 0;
for (int i=1; i<(int)div.size(); i++) {
if (N/div[i]==N%div[i]) res += div[i];
}
cout << res << endl;
return 0;
} | 1 | 83,946,345 |
#include<bits/stdc++.h>
using namespace std;
int n,f[100010],p;
vector<int> a[100010];
inline void dfs(int i,int j)
{
int k;
for(k=0;k<a[i].size();k++)
if(a[i][k]!=j)
{
dfs(a[i][k],i);
if(!f[a[i][k]])
if(!f[i])
f[i]=1;
else
p=1;
}
}
int main()
{
int i,j,k;
scanf("%d",&n);
for(i=1;i<n;i++)
{
scanf("%d%d",&j,&k);
a[j].push_back(k);
a[k].push_back(j);
}
dfs(1,0);
if(p || !f[1])
printf("First\n");
else
printf("Second\n");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int N = 1 * 100 * 1000 + 1;
int n, sz[N];
vector <int> adj[N];
bool dfs(int u, int par) {
int odd = 0, res = 0;
sz[u] = 1;
for (auto v: adj[u])
if (v ^ par) {
res |= dfs(v, u);
sz[u] += sz[v];
odd += (sz[v] & 1);
}
return (res | (odd > 1));
}
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin >> n;
for (int i = 1, u, v; i < n; i++) {
cin >> u >> v;
adj[--u].push_back(--v);
adj[v].push_back(u);
}
if (n & 1 || dfs(0, -1))
return cout << "First\n", 0;
cout << "Second\n";
} | 1 | 14,396,821 |
#include <bits/stdc++.h>
#define rep(i,n) for(long long i = 0; i < (n) ; ++i)
#define orep(i,n) for(long long i = 1; i <= (n); ++i)
#define drep(i,n) for(long long i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for(long long i = (s); i < (t); ++i)
#define rng(x) (x).begin(),(x).end()
#define rrng(a) (a).rbegin(),(a).rend()
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
#define ru(x,y) (((x)+(y)-1)/(y))
#define fi first
#define se second
#define eb emplace_back
#define fcout cout << fixed << setprecision(15)
using namespace std;
using ll = long long;
using P = pair<int,int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vp = vector<P>;
using vl = vector<ll>;
template<typename T> void Yes(T flag) {
cout << (flag ? "Yes" : "No") << endl;
}
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;
}
template<typename T> void pv2(vector<vector<T>> vec) {
for(auto& v : vec) pv(v);
}
ll g(ll n,ll p) {
if(n == 0) return 0;
return n / p + g(n/p,p);
}
int main() {
ll n;cin >> n;
if(n%2==1) {
cout << 0 << endl;
return 0;
}
n /= 2;
cout << g(n,5) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
long long n;
cin >> n;
if(n & 1) {
cout << 0;
exit(0);
}
n /= 2;
long long c = 0;
while(n) {
c += n / 5;
n /= 5;
}
cout << c;
return 0;
} | 1 | 36,980,779 |
#pragma region header
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <limits>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#include <math.h>
#pragma region header
using namespace std;
using ll = long long;
using vl = vector<long long>;
using vvl = vector<vector<long long>>;
using vvi = vector<vector<int>>;
using Graph = vvi;
using vs = vector<string>;
using vc = vector<char>;
using vcc = vector<vector<char>>;
using vm = vector<short>;
using vmm = vector<vector<short>>;
using pii = pair<int, int>;
using psi = pair<string, int>;
using ld = long double;
using ull = unsigned long long;
using ui = unsigned int;
using qul = queue<ll>;
using pql = priority_queue<ll>;
using kaage = priority_queue<int, vector<int>, greater<int>>;
int dx[] = { 1,0,-1,0 };
int dy[] = { 0,1,0,-1 };
constexpr ll mod = 1e9 + 7;
constexpr long double pi = 3.141592653589793238462643383279;
#pragma endregion
#define rep(i, n) for(ll i = 0; i < n; i++)
#define REP(i, n) for(ll i = 1; i <= n; i++)
#pragma region header
ll gcd(ll a, ll b)
{
if (a % b == 0)
{
return(b);
}
else
{
return(gcd(b, a % b));
}
}
ll lcm(ll a, ll b)
{
return a * b / gcd(a, b);
}
ll box(double a)
{
ll b = a;
return b;
}
ll fff(double a)
{
ll b = a + 0.5;
return b;
}
ll mch(ll n) {
if (n == 1) return 1;
else return n * mch(n - 1);
}
bool prime(ll a)
{
if (a < 2) return false;
else if (a == 2) return true;
else if (a % 2 == 0) return false;
double m = sqrt(a);
for (int i = 3; i <= m; i += 2)
{
if (a % i == 0)
{
return false;
}
}
return true;
}
ll modpow(ll a, ll n, ll mod) {
ll hi = 1;
while (n > 0) {
if (n & 1) hi = hi * a % mod;
a = a * a % mod;
n >>= 1;
}
return hi;
}
ll mg(ll a, ll mod) {
return modpow(a, mod - 2, mod);
}
ll num(ll a) {
string s = to_string(a);
ll sum = 0;
for (int j = 0; j < s.size(); ++j) {
sum += s[j] - '0';
}
return sum;
}
#pragma endregion
#pragma endregion
#pragma region header
#pragma endregion
ll dp[100005] = { 0 };
int main() {
ll n; cin >> n;
ll m; cin >> m;
set<ll> d;
for (int i = 0; i < m; i++) {
ll a; cin >> a;
d.insert(a);
}
dp[0] = 1;
if (d.count(1) != 1) dp[1] = 1;
else dp[1] = 0;
for (int i = 2; i <= n; i++) {
if (d.count(i)) dp[i] = 0;
else dp[i] = (dp[i - 1] + dp[i - 2]) % 1000000007;
}
cout << dp[n] << endl;
return 0;
} | # include <bits/stdc++.h>
# define rep(i, n) for(ll i = 0; i < (n); ++i)
# define reps(i, n) for(ll i=1, i##_len=(n); i<=i##_len; ++i)
# define rrep(i, n) for(ll i=((int)(n)-1); i>=0; --i)
# define rreps(i, n) for(ll i=((int)(n)); i>0; --i)
# define ll long long
# define ALL(x) (x).begin(), (x).end()
# define SZ(x) ((int)(x).size())
# define pb push_back
# define optimize_cin() cin.tie(0); ios::sync_with_stdio(false)
# define P pair<int, int>
# define mp make_pair
# define x first
# define y second
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
static const ll mod = 1000000007LL;
int dp[100010];
int main() {
int n, m; cin >> n >> m;
vector<bool> a(n + 1, true);
rep(i, n) {
int x; cin >> x;
a[x] = false;
}
dp[0] = 1;
if(!a[1] && !a[2]) {
cout << 0 << endl;
return 0;
}
rep(i, n + 1){
if(a[i+1]) dp[i+1] = (dp[i+1] + dp[i]) % mod;
if(a[i+2]) dp[i+2] = (dp[i+2] + dp[i]) % mod;
}
cout << dp[n] << endl;
} | 1 | 78,706,347 |
#include<bits/stdc++.h>
using namespace std;
string t[]={"qazwsxedcrfvtgb","yhnujmikolp"};
int tp(string s){
int rl,cnt=0;
for(int i=0;i<2;++i)
if(t[i].find(s[0])!=string::npos) rl=i;
for(int i=1;i<s.size();++i)
for(int j=0;j<2;++j)
if(t[j].find(s[i])!=string::npos)
if(j!=rl) cnt++, rl=j;
return cnt;
}
int main(){
string s;
while(cin>>s, s!="#"){
cout<<tp(s)<<endl;
}
return 0;
} | #include<cstdio>
using namespace std;
char right[12] = "yhnujmikolp";
bool check(char c) {
for (int i = 0; i < 11; i++) if (right[i] == c) return true;
return false;
}
int main() {
char s[50];
while (1) {
scanf("%s", s);
if (s[0] == '#') break;
int counter = 0;
bool now = check(s[0]);
for (int i = 1; s[i] != 0; i++) {
if (now != check(s[i])) {
now = check(s[i]);
counter++;
}
}
printf("%d\n", counter);
}
} | 1 | 17,681,106 |
#include <bits/stdc++.h>
#define uint uint64_t
#define mx 100001
#define ll long long int
#define ull unsigned long long int
#define pii pair<int, int>
#define pll pair<long long int, long long int>
#define mp make_pair
#define pb push_back
#define inf INT_MAX
#define pi acos(-1)
#define eps 1e-8
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) (a * b) / __gcd(a, b)
#define input(ara, n) \
for (int i = 0; i < n; i++) \
scanf("%d", &ara[i])
#define inputl(ara, n) \
for (long long int i = 0; i < n; i++) \
scanf("%lld", &ara[i])
#define pf(a) printf("%d\n", a);
#define pfl(a) printf("%lld\n", a);
#define pfi(a) printf("%d ", a);
#define pfll(a) printf("%lld ", a);
#define sc(a) scanf("%d", &a)
#define scc(a, b) scanf("%d %d", &a, &b)
#define sccdbl(a, b) scanf("%lf %lf", &a, &b)
#define sccc(a, b, c) scanf("%d %d %d", &a, &b, &c)
#define scccdbl(a, b, c) scanf("%lf %lf %lf", &a, &b, &c)
#define scl(a) scanf("%lld", &a)
#define sccl(a, b) scanf("%lld %lld", &a, &b)
#define scccl(a, b, c) scanf("%lld %lld %lld", &a, &b, &c)
using namespace std;
int main()
{
ll n, sum = 0;
scl(n);
ll ara[n + 1], ar[n];
inputl(ara, n + 1);
inputl(ar, n);
for (ll i = 0; i < n; i++)
{
if (ar[i] >= ara[i])
{
sum += ara[i];
ar[i] -= ara[i];
if (i + 1 <= n && ar[i] >= ara[i + 1])
{
sum += ara[i + 1];
ara[i + 1] = 0;
}
else if (i + 1 <= n && ar[i] < ara[i + 1])
{
sum += ar[i];
ara[i + 1] -= ar[i];
}
}
else
{
sum += ar[i];
}
}
pfl(sum);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<long long> a(n + 1);
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
long long ans = 0;
for (int i = 0; i < n; i++) {
long long b; cin >> b;
ans += min (a[i], b);
b -= min (b , a[i]);
ans += min (a[i + 1], b);
a[i + 1] = max (0ll, a[i + 1] - b);
}
cout << ans;
return 0;
} | 1 | 55,977,315 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (long long i = 0; i < N; i++)
using ll = long long;
void solve(long long N, std::string S) {
char before = S[0];
ll ans = 1;
for (ll i = 1; i < N; i++) {
if (S[i] != before) {
ans++;
}
before = S[i];
}
cout << ans << endl;
}
int main() {
long long N;
scanf("%lld", &N);
std::string S;
std::cin >> S;
solve(N, S);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n,ans;
string s;
cin >> n >> s;
ans = n;
for(int i=1;i<n;i++)
{
if(s.at(i-1)==s.at(i))
{
ans--;
}
}
cout << ans << endl;
} | 1 | 97,072,493 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vc = vector<char>;
using vb = vector<bool>;
using vs = vector<string>;
using vll = vector<long long>;
using vp = vector<pair<int, int>>;
using vvi = vector<vector<int>>;
using vvc = vector<vector<char>>;
using vvll = vector<vector<long long>>;
template<class T> inline bool chmax(T &a, T b) { if (a<b) {a=b; return 1;} return 0;}
template<class T> inline bool chmin(T &a, T b) { if (b<a) {a=b; return 1;} return 0;}
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
int n = sz(s);
vvi dp(n+1, vi(2, 0));
dp[0][0] = 1;
rep(i, n) {
{
if (s[i] == '0') {
dp[i+1][0] = dp[i][0];
dp[i+1][1] = dp[i][1];
} else {
dp[i+1][1] = (dp[i][0] + dp[i][1]) % mod;
}
}
{
if (s[i] == '0') {
dp[i+1][1] += dp[i][1] * 2 % mod;
dp[i+1][1] %= mod;
} else {
dp[i+1][0] += dp[i][0] * 2 % mod;
dp[i+1][0] %= mod;
dp[i+1][1] += dp[i][1] * 2 % mod;
dp[i+1][1] %= mod;
}
}
}
int ans = (dp[n][0] + dp[n][1]) % mod;
cout << ans << endl;
} | #include<bits/stdc++.h>
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define MOD 1000000007
#define int long long
#define pii pair<int,int>
#define vi vector<int>
using namespace std;
const int N = 1e5 + 10;
string s;
int dp[N][2];
int modpow(int a, int b, int mod){
int res = 1;
a %= mod;
while(b > 0){
if(b&1)
res = (res*a)%mod;
a = (a*a)%mod;
b >>= 1;
}
return res;
}
int solve(int cur, int flag){
if(cur == -1){
return 1;
}
if(dp[cur][flag] != -1)
return dp[cur][flag];
if(flag){
return dp[cur][flag] = modpow(3,cur+1,MOD);
}
int ans = 0;
if(s[cur] == '1'){
ans = solve(cur-1,1);
ans += 2*solve(cur-1,0);
ans %= MOD;
}
else{
ans = solve(cur-1,0);
}
return dp[cur][flag] = ans;
}
int32_t main(){
cin >> s;
memset(dp,-1,sizeof dp);
reverse(s.begin(),s.end());
cout << solve((int)s.size()-1,0) << endl;
return 0;
} | 1 | 100,555,554 |
#define _GLIBCXX_DEBUG
#include <iostream>
#include <vector>
using namespace std;
using vi = vector<int>;
int main(void){
int n, k;
cin >> n >> k;
vi s(n, 1);
for(int i=0; i<k; i++){
int d;
cin >> d;
for(int j=0; j<d; j++){
int a;
cin >> a;
s[a-1] = 0;
}
}
int cnt = 0;
for(int &x : s) cnt += x;
cout << cnt << '\n';
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <queue>
#include <deque>
#include <bitset>
#include <iterator>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <functional>
#include <numeric>
#include <utility>
#include <limits>
#include <time.h>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
using namespace std;
#define FOR(i,n) for(int i = 0; i < n; i++)
#define FORa(i,a,b) for(int i = a; i < b; i++)
#define pb(x) push_back(x)
#define mp(a, b) make_pair(a, b)
#define F first
#define S second
#define SORT(a,n) sort(begin(a), begin(a) + n)
#define VSORT(v) sort(v.begin(), v.end())
#define MAX 1000000
#define ll long long
#define LOW(s) transform(s.begin(),s.end(),s.begin(),::tolower)
#define UP(s) transform(s.begin(),s.end(),s.begin(),::toupper)
int main() {
int n, k, d, cur;
cin >> n >> k;
unordered_set<int> s;
for(int i = 0; i < k; i++) {
cin >> d;
for(int j = 0; j < d; j++) {
cin >> cur;
if(s.find(cur) == s.end()) {
s.insert(cur);
n--;
}
}
}
cout << n << endl;
return 0;
} | 1 | 20,751,320 |
#include <bits/stdc++.h>
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
typedef long long ll;
using namespace std;
int main(){
int n;
ll ans = 1;
cin >> n ;
bool over = false;
bool zero = false;
rep(i, n){
ll a;
cin >> a;
if(a==0){
zero=true;
ans = 0;
continue;
}
if(ans > 1000000000000000000/a){
ans = -1;
over = true;
}else{
ans *= a;
}
if(a==0)zero=true;
}
if(!zero && over)ans = -1;
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
signed main()
{
int n;
ll t=1, a;
cin >> n;
for(int i = 0; i < n; i++){
cin >> a;
if(t == 0 || a == 0){
t = 0;
}
else if ( t > 0 && t <= 1000000000000000000 / a) {
t *= a;
}
else{
t = -1;
}
}
cout << t << endl;
} | 1 | 12,865,804 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> v(n+1);
v[0] = 2;
v[1] = 1;
for(int i = 2; i < n+1; i++) {
v[i] = v[i-1]+v[i-2];
}
cout << v[n];
} | #include <bits/stdc++.h>
using namespace std;
int lyuka(int i) {
int64_t L;
if (i==0) L=2;
else if (i==1) L=1;
else L = lyuka(i-1) + lyuka(i-2);
return L;
}
int main() {
int N;
cin >> N;
long long L[87];
L[0] = 2LL;
L[1] = 1LL;
for(int i=2; i<=N; i++) L[i]=L[i-2]+L[i-1];
cout << L[N] << endl;
return 0;
} | 1 | 21,857,415 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
int main(){
int A, B, C, D, E;
std::cin >> A >> B >> C >> D >> E;
std::vector<int> v = {A, B, C, D, E};
int amari = 0;
int max = v.at(0);
for (int x : v){
if (x % 10 != 0){
int temp = 10 - x % 10;
if (temp >= amari){
amari = temp;
max = x;
}
}
}
std::vector<int> V(5);
for (int i=0; i<5; i++){
if (v.at(i) % 10 != 0){
int temp = 10 - v.at(i) % 10;
V.at(i) = v.at(i) + temp;
}
else{
V.at(i) = v.at(i);
}
}
if (max % 10 == 0){
std::cout << std::accumulate(v.begin(), v.end(), 0);
} else{
std::cout << std::accumulate(V.begin(), V.end(), 0) - (max + (10 - (max % 10))) + max << std::endl;
}
} | #include <iostream>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int sum = 0;
int r = 10;
REP(i, 5) {
int tmp;
cin >> tmp;
sum += (tmp + 9) / 10;
if (tmp % 10 && r > tmp % 10)
r = tmp % 10;
}
cout << sum * 10 - 10 + r << '\n';
return 0;
} | 1 | 95,989,845 |
#include <bits/stdc++.h>
using namespace std;
#define MAXN 100010
typedef long long LL;
LL n, p[100];
int main( int argc , char * argv[] ){
int i, L, l, r, m; p[0] = 1;
char c;
for(i = 1; i <= 12; ++i){
p[i] = p[i - 1] * 10;
}
printf("? %lld\n", p[12]);
fflush(stdout);
scanf(" %c", &c);
if(c == 'Y'){
for(i = 1; i <= 12; ++i){
printf("? %lld\n", p[i] - 1);
fflush(stdout);
scanf(" %c", &c);
if(c == 'Y') break;
}
printf("! %lld\n", p[i - 1]);
}
else{
for(i = 1; i <= 12; ++i){
printf("? %lld\n", p[i]);
fflush(stdout);
scanf(" %c", &c);
if(c == 'N') break;
}
L = i;
for(i = 1; i < L; ++i){
n *= 10;
for(l = 0, r = 9; l < r;){
m = (l + r + 1) >> 1;
printf("? %lld\n", n + m);
fflush(stdout);
scanf(" %c", &c);
if(c == 'Y') l = m;
else r = m - 1;
}
n += l;
}
n *= 10;
for(i = L == 1 ? 1 : 0; i <= 9; ++i){
printf("? %lld\n", (n + i) * 10 + 9);
fflush(stdout);
scanf(" %c", &c);
if(c == 'Y') break;
}
n += i;
printf("! %lld\n", n);
}
return 0;
} | #include <cassert>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <deque>
using namespace std;
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
typedef long long ll;
inline bool query(ll x) {
char buf[10];
printf("? %lld\n", x);
fflush(stdout);
scanf("%s", buf);
return buf[0] == 'Y';
}
inline void answer(ll x) {
printf("! %lld\n", x);
fflush(stdout);
exit(0);
}
int main(void) {
ll res = 0;
bool all9 = true;
{
ll left = 0;
ll right = 9;
while(left+1 < right) {
ll md = (left + right) / 2;
bool q = query(md * 1000000000 + 999999999);
if(q) {
right = md;
} else {
left = md;
}
}
if(right != 9) {
all9 = false;
}
res = right;
}
for(ll t = 100000000; ; t /= 10) {
if(query(res + 1) == !all9) {
answer(res);
break;
} else {
ll left = -1;
ll right = 9;
while(left+1 < right) {
ll md = (left + right) / 2;
bool q = query(res * 10*t + md * t + t-1);
if(q) {
right = md;
} else {
left = md;
}
}
if(right != 9) {
all9 = false;
}
res = res * 10 + right;
}
}
return 0;
} | 1 | 60,375,131 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <stdio.h>
#include <math.h>
#include <string>
#include <cctype>
#include <map>
#include <limits>
#include <iomanip>
using namespace std;
const int mod = 1000000007;
#define ARRAY_LENGTH(array) (sizeof(array) / sizeof(array[0]))
#define ll long long
int main()
{
vector< vector<int> > A(3, vector<int>(3));
for (int i = 0; i < 3; i++)
{
for (int j = 0; j < 3; j++)
{
cin >> A.at(i).at(j);
}
}
int N;
cin >> N;
vector<int> b(N);
for (size_t i = 0; i < N; i++)
{
cin >> b[i];
}
vector< vector<bool> > s(3, vector<bool>(3));
for (int i = 0; i < 3; i++)
{
for (int j = 0; j < 3; j++)
{
int num = A.at(i).at(j);
if (find(begin(b), end(b), num) != end(b))
{
s.at(i).at(j) = true;
}
}
}
if (s.at(0).at(0) && s.at(1).at(0) && s.at(2).at(0))
{
cout << "Yes" << endl;
}
else if (s.at(0).at(1) && s.at(1).at(1) && s.at(2).at(1))
{
cout << "Yes" << endl;
}
else if (s.at(0).at(2) && s.at(1).at(2) && s.at(2).at(2))
{
cout << "Yes" << endl;
}
else if (s.at(0).at(0) && s.at(0).at(1) && s.at(0).at(2))
{
cout << "Yes" << endl;
}
else if (s.at(1).at(0) && s.at(1).at(1) && s.at(1).at(2))
{
cout << "Yes" << endl;
}
else if (s.at(2).at(0) && s.at(2).at(1) && s.at(2).at(2))
{
cout << "Yes" << endl;
}
else if (s.at(0).at(0) && s.at(1).at(1) && s.at(2).at(2))
{
cout << "Yes" << endl;
}
else if (s.at(0).at(2) && s.at(1).at(1) && s.at(2).at(0))
{
cout << "Yes" << endl;
}
else
{
cout << "No" << endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define debug(x) cout<<#x<<" :"<<x<<endl;
#define ff first
#define ss second
#define ar array
#define int long long
#define ld long double
#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
#define mk(arr,n,type) type *arr=new type[n];
#define w(x) int x; cin>>x; while(x--)
#define f(i,n) for(int i=0;i<n;i++)
#define MOD 1000000007
#define pi 3.14159265
#define umii unordered_map<int,int>
#define umci unordered_map<char,int>
#define umsi unordered_map<string,int>
void k_007()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("ip1.txt", "r", stdin);
freopen("op1.txt", "w", stdout);
#endif
}
bool sortbysec(const pair<int, int> &a, const pair<int, int> &b)
{
return (a.second < b.second);
}
int gcd(int a, int b) {
if (b == 0) return a;
return gcd(b, a % b);
}
int prime(int n) {
int flag = 1;
for (int i = 2; i <= sqrt(n); i++) {
if (n % i == 0) {flag = 0; break;}
}
return flag;
}
int power(int x, int y)
{
if (y == 0)
return 1;
else if (y % 2 == 0)
return ((power(x, y / 2) % MOD) * ( power(x, y / 2) % MOD)) % MOD;
else
return ((x % MOD) * (power(x, y / 2) % MOD) * (power(x, y / 2) % MOD)) % MOD;
}
int lcm(int a, int b)
{
return (a * b) / gcd(a, b);
}
int32_t main()
{
k_007();
int a[3][3];
f(i, 3)
{
f(j, 3)
{cin >> a[i][j];}
}
int n;
cin >> n;
map<int, int> mp;
while (n--)
{
int x;
cin >> x;
mp[x] = 1;
}
bool bingo = false;
f(i, 3)
{
bool ok = true;
f(j, 3)
{
if (mp[a[i][j]] != 1)
{
ok = false;
}
}
if (ok)
{
bingo = true;
break;
}
}
if (bingo)
{
cout << "Yes";
return 0;
}
f(i, 3)
{
bool ok = true;
f(j, 3)
{
if (mp[a[j][i]] != 1)
{
ok = false;
}
}
if (ok)
{
bingo = true;
break;
}
}
if (bingo)
{
cout << "Yes";
return 0;
}
if (mp[a[1][1]] && mp[a[0][0]] && mp[a[2][2]])
{
cout << "Yes";
return 0;
}
if (mp[a[0][2]] && mp[a[1][1]] && mp[a[2][0]])
{
cout << "Yes";
return 0;
}
cout << "No" << endl;
} | 1 | 45,303,448 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repr(i,n) for(int i = (int)(n); i >= 0; i--)
#define all(v) v.begin(),v.end()
typedef long long ll;
int main(){
int N,M;
cin >> N >> M;
vector<pair<int,int> > vec(N);
rep(i,N){
cin >> vec[i].first >> vec[i].second;
}
sort(all(vec));
priority_queue<int> pque;
rep(i,100005){
pque.push(0);
}
int count = 0;
int ans = 0;
for (int i = 1; i <= M; i++){
while(true){
if (count >= N){
break;
}
else if (vec[count].first != i){
break;
}
else{
pque.push(vec[count].second);
count++;
}
}
ans += pque.top();
pque.pop();
}
cout << ans << endl;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <math.h>
#include <cmath>
using namespace std;
#define int long long
#define endl "\n"
#define all(v) v.begin(),v.end()
#define fir first
#define sec second
#define m_p make_pair
#define rep(i,n) for(int i=0; i<(int) (n); i++)
#define vecin(v) for(int i=0; i<(int)v.size(); i++)cin>>v[i];
#define vecout(v) for(int i=0; i<v.size(); i++)cout<<v[i]<<" "; cout<<endl;
#define LLU long long unsigned
const double pai = 3.1415926535897;
const int mod = 1000000007;
const int INF = 2000000015;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
int jousu(int x00, int y00) {
int z00 = 1;
for (int i = 0; i < y00; i++) {
z00 *= x00;
}
return z00;
}
int keta(int x00) {
int z00 = x00;
int w00 = 0;
while (z00 != 0) {
z00 /= 10;
w00++;
}
return w00;
}
int krag(double xx) {
return INF - (int)(INF - xx);
}
int b_s(vector<int>&vecxx, int xx) {
if (xx <= vecxx[0]) {
return 0;
}
if (vecxx.back() < xx) {
return vecxx.size();
}
int aa1 = 0, aa2 = vecxx.size() - 1, aa3;
while (aa1 + 1 < aa2) {
aa3 = (aa1 + aa2) / 2;
if (vecxx[aa3] >= xx) {
aa2 = aa3;
}
else {
aa1 = aa3;
}
}
return aa2;
}
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(int n, int k) {
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int modinv(int a, int m) {
int b = m, u = 1, v = 0;
while (b) {
int t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
int modpow(int a, int n) {
int res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
int gcd(int xx, int yy) {
int p = xx;
int q = yy;
if (q > p)swap(p, q);
while (p % q != 0) {
p %= q;
swap(p, q);
}
return q;
}
int lcm(int xx, int yy) {
return xx * yy / gcd(xx, yy);
}
bool prime(int xx) {
int a = xx;
for (int i = 2; i * i <= xx; i++) {
if (xx % i == 0) {
return 0;
}
}
return 1;
}
signed main() {
int n, m, a = 0, ans = 0;
cin >> n >> m;
vector<pair<int, int>>vec(n);
priority_queue<int>que;
rep(i, n) {
cin >> vec[i].first >> vec[i].second;
}
sort(all(vec));
rep(i, m) {
while (a < vec.size() && vec[a].first <= i + 1) {
que.push(vec[a].second);
a++;
}
if (!que.empty()) {
ans += que.top();
que.pop();
}
}
cout << ans << endl;
} | 1 | 88,872,717 |
#include<iostream>
int main(){
int a, b, c, f = 0;
std::cin >> a >> b >> c;
for(int x = a; x <= b; x++ ){
if(c % x == 0) f++;
}
std::cout<< f <<"\n";
return 0;
} | #include <iostream>
int count_divisors(int a, int b, int c) {
int count = 0;
for (int i = a; i <= b; i ++) {
if (c % i == 0) {
count += 1;
}
}
return count;
}
int main() {
int a, b, c;
std::cin >> a >> b >> c;
std::cout << count_divisors(a, b, c) << std::endl;
return 0;
} | 1 | 31,645,665 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); ++i)
using namespace std;
int main(){
int n, m, total=0, can=0;
cin >> n >> m;
vector<int> a(n);
rep(i,n){
cin >> a[i];
total += a[i];
}
rep(i,n){
if(a[i]*4*m<total) continue;
can++;
}
if(can >= m) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
vector <int> n;
int main(){
int n,m,t,cnt=0;
double al=0;
vector <int> a;
cin>>n>>m;
for(int i=0;i<n;i++){
cin>>t;
al+=t;
a.push_back(t);
}
al/=4*m;
sort(a.begin(),a.end());
for(int i=0;i<n;i++){
if(a[i]>=al){
cnt++;
}
}
if(cnt>=m){
cout<<"Yes"<<endl;
}else{
cout<<"No"<<endl;
}
return 0;
} | 1 | 94,822,560 |
#include<iostream>
using namespace std;
int n;
main()
{
while(cin>>n,n)
{
string s;int flag=0,r=0,l=0,cnt=0;
for(int i=0;i<n;i++)
{
cin>>s;
if(s=="lu")
{
l=1;
if(flag==0&&r==l)cnt++,flag=1;
}
else if(s=="ru")
{
r=1;
if(flag==0&&r==l)cnt++,flag=1;
}
else if(s=="ld")
{
l=0;
if(flag==1&&r==l)cnt++,flag=0;
}
else
{
r=0;
if(flag==1&&r==l)cnt++,flag=0;
}
}
cout<<cnt<<endl;
}
} | #include<iostream>
#include<string>
using namespace std;
int main(){
int n,r[3],l[3];
while(true){
cin>>n;
if(n==0)
break;
string f;
for(int i=0;i<3;i++)
r[i]=0,l[i]=0;
int count=0;
for(int i=0;i<n;i++){
cin>>f;
if(f=="ru")
r[0]=min(1,r[0]+1);
if(f=="rd")
r[0]=max(0,r[0]-1);
if(f=="lu")
l[0]=min(1,l[0]+1);
if(f=="ld")
l[0]=max(0,l[0]-1);
if(r[0]==l[0]&&r[2]==l[2]&&r[0]!=r[2])
count++;
r[2]=r[1],r[1]=r[0];
l[2]=l[1],l[1]=l[0];
}
cout<<count<<endl;
}
return 0;
} | 1 | 58,090,357 |
#include<iostream>
#include<vector>
#include<algorithm>
typedef long long ll;
int main(){
int n;
std::cin >> n;
std::vector<ll> a(n+1);
for(int i=0; i<=n; i++){
std::cin >> a[i];
}
std::vector<ll> up(n+1);
std::vector<ll> error(n+1);
up[n] = a[n];
error[n] = a[n];
for(int i=n-1; i>=0; i--){
up[i] = up[i+1] + a[i];
error[i] = (error[i+1] + 1)/2 + a[i];
}
if(error[0] > 1){
std::cout << -1 << std::endl;
return 0;
}
std::vector<ll> down(n+1);
ll res = 0;
down[0] = 1;
for(int i=1; i<=n; i++){
down[i] = std::min(down[i-1]*2, up[i]);
res += down[i];
down[i] -= a[i];
}
res += 1;
std::cout << res << std::endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void){
long long n;
cin>>n;
vector<long long> A(n+1), B(n+1, 1e18);
for(int i=0;i<n+1;i++) cin>>A[i];
B[0]=1;
if(A[0]>B[0]){
cout<<-1<<endl;
return 0;
}
for(int i=0;i<n;i++){
B[i+1] = (B[i]-A[i])*2;
if(B[i]<0){
cout<<-1<<endl;
return 0;
}
if(B[i]>=1e18) break;
}
if(A[n]>B[n]){
cout<<-1<<endl;
return 0;
}
long long ans,now;
B[n]=ans=now=A[n];
for(int i=n-1;i>=0;i--){
now = min(now, B[i]-A[i])+A[i];
ans += now;
}
cout<<ans<<endl;
} | 1 | 72,361,593 |
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if(a > b) {
a = b;
return 1;
}
return 0;
}
typedef long long int ll;
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define endl "\n"
const double EPS = 1e-7;
const int INF = 1 << 30;
const ll LLINF = 1LL << 60;
const double PI = acos(-1);
const int MOD = 1000000007;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int toi(string s) {
int res = 0;
for(int i = 0; i < s.size(); i++) {
if(s[i] == 'm') {
if(i == 0) {
res += 1000;
} else {
res += 1000 * (s[i - 1] - '0');
}
} else if(s[i] == 'c') {
if(i == 0 || s[i - 1] == 'm') {
res += 100;
} else {
res += 100 * (s[i - 1] - '0');
}
} else if(s[i] == 'x') {
if(i == 0 || (s[i - 1] == 'c' || s[i - 1] == 'm')) {
res += 10;
} else {
res += 10 * (s[i - 1] - '0');
}
} else if(s[i] == 'i') {
if(i == 0 ||
(s[i - 1] == 'x' || s[i - 1] == 'c' || s[i - 1] == 'm')) {
res += 1;
} else {
res += 1 * (s[i - 1] - '0');
}
}
}
return res;
}
string tos(int n) {
string res = "";
int c = n / 1000;
if(c == 1) {
res += "m";
} else if(c > 1) {
res += to_string(c) + "m";
}
n -= 1000 * c;
c = n / 100;
if(c == 1) {
res += "c";
} else if(c > 1) {
res += to_string(c) + "c";
}
n -= 100 * c;
c = n / 10;
if(c == 1) {
res += "x";
} else if(c > 1) {
res += to_string(c) + "x";
}
n -= 10 * c;
c = n / 1;
if(c == 1) {
res += "i";
} else if(c > 1) {
res += to_string(c) + "i";
}
return res;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int t;
cin >> t;
while(t--) {
string s, t;
cin >> s >> t;
cout << tos(toi(s) + toi(t)) << endl;
}
} | #include<stdio.h>
#include<string>
#include<iostream>
using namespace std;
int main(){
string st1,st2;
int n;
cin>>n;
for(int iii=0;iii<n;iii++){
cin>>st1>>st2;
int d=1,a=0,s1=0,s2=0;
int S=0;
for(int i=0;i<st1.size();i++){
if(st1[i]=='m'){s1+=d*1000;d=1;}
else if(st1[i]=='c'){s1+=d*100;d=1;}
else if(st1[i]=='x'){s1+=d*10;d=1;}
else if(st1[i]=='i'){s1+=d*1;d=1;}
else d=st1[i]-'0';
}
for(int i=0;i<st2.size();i++){
if(st2[i]=='m'){s2+=d*1000;d=1;}
else if(st2[i]=='c'){s2+=d*100;d=1;}
else if(st2[i]=='x'){s2+=d*10;d=1;}
else if(st2[i]=='i'){s2+=d*1;d=1;}
else d=st2[i]-'0';
}
S=s1+s2;
int r=S/1000;S=S%1000;
if(r>0){if(r>1)cout<<r;cout<<'m';}
r=S/100;S=S%100;
if(r>0){if(r>1)cout<<r;cout<<'c';}
r=S/10;S=S%10;
if(r>0){if(r>1)cout<<r;cout<<'x';}
r=S;
if(r>0){if(r>1)cout<<r;cout<<'i';}
cout<<endl;
}
return 0;
} | 1 | 17,834,352 |
#include<iostream>
using namespace std;
char v[256];int n,m;
int main(){
while(true){
cin>>n;for(int i=32;i<127;i++){v[i]=i;}
if(n==0)break;
for(int i=0;i<n;i++){char p,q;cin>>p>>q;v[p]=q;}
cin>>m;
for(int i=0;i<m;i++){
char f;cin>>f;cout<<v[f];
}
cout<<endl;
}
return 0;
} | #include <bits/stdc++.h>
#define int long long
#define main signed main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecision(n)
#define stlice(from, to) substr(from, (to) - (from) + 1)
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
using namespace std;
using pii = pair<int, int>;
using vi = vector<int>;
using vd = vector<double>;
using vc = vector<char>;
using vb = vector<bool>;
using vs = vector<string>;
using vpii = vector<pii>;
using vvi = vector<vi>;
using vvb = vector<vb>;
using vvpii = vector<vpii>;
template<typename A> using fn = function<A>;
constexpr int INF = sizeof(int) == sizeof(long long) ? 1000000000000000000LL : 1000000000;
constexpr int MOD = 1000000007;
constexpr double PI = acos(-1);
template<typename A, typename B> bool cmin(A &a, const B &b) { return a > b ? (a = b, true) : false; }
template<typename A, typename B> bool cmax(A &a, const B &b) { return a < b ? (a = b, true) : false; }
constexpr bool odd(const int &n) { return n & 1; }
constexpr bool even(const int &n) { return !odd(n); }
template<typename V> constexpr typename V::value_type sum(const V &v) { return accumulate(all(v), 0); }
void solve();
main { solve(); return 0; }
void solve() {
int n;
while (cin >> n, n) {
map<char, char> t;
rep(i, n) {
char a, b;
cin >> a >> b;
t[a] = b;
}
int m;
cin >> m;
rep(i, m) {
char x;
cin >> x;
cout << char(t.count(x) ? t[x] : x);
}
cout << endl;
}
} | 1 | 89,381,922 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vin=vector<int>;
using vll=vector<long long>;
using vvin=vector<vector<int>>;
using vvll=vector<vector<long long>>;
using vstr=vector<string>;
using vvstr=vector<vector<string>>;
using vch=vector<char>;
using vvch=vector<vector<char>>;
using vbo=vector<bool>;
using vvbo=vector<vector<bool>>;
using vpii=vector<pair<int,int>>;
using pqsin=priority_queue<int,vector<int>,greater<int>>;
#define mp make_pair
#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 all(v) v.begin(),v.end()
#define decp(n) cout<<fixed<<setprecision((int)n)
const int inf=1e9+7;
vin par(100010);
vin deep(100010);
vin wei(100010);
void init(int n);
int root(int x);
void unite(int x,int y,int w);
bool same(int x,int y);
int weight (int x);
int diff(int x,int y);
int main(){
int n,m;cin>>n>>m;
vin l(m),r(m),d(m);
rep(i,m)cin>>l[i]>>r[i]>>d[i];
init(n);
bool can=true;
rep(i,m){
if(same(l[i],r[i])&&diff(l[i],r[i])!=d[i]){
can=false;
break;
}
unite(l[i],r[i],d[i]);
}
if(can)cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
void init(int n){
rep(i,n){
par[i]=i;
deep[i]=0;
wei[i]=0;
}
}
int root(int x){
if(par[x]==x)return x;
else{
int r=root(par[x]);
wei[x]+=wei[par[x]];
return par[x]=r;
}
}
void unite(int x,int y,int w){
w+=weight(x);w-=weight(y);
x=root(x);
y=root(y);
if(x==y)return;
if(deep[x]<deep[y]){
swap(x,y);
w=-w;
}
if(deep[x]==deep[y])deep[x]++;
par[y]=x;
wei[y]=w;
}
bool same(int x,int y){
return root(x)==root(y);
}
int weight(int x){
root(x);
return wei[x];
}
int diff(int x,int y){
return weight(y)-weight(x);
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)n; ++i)
static const int dx[4] = { 0, 1, 0, -1 };
static const int dy[4] = { 1, 0, -1, 0 };
static const char dir[4] = { 'u', 'r', 'd', 'l' };
static const ll INF = 1 << 21;
static const ll MOD = 1e9 + 7;
static const int MAX_N = 1e5;
int N, M;
struct edge {
int to,
d;
};
vector<vector<edge>> g;
vector<int> x,used;
void dfs(int i, int d)
{
used[i] = 1;
x[i] = d;
for (auto e : g[i]) {
if (used[e.to]) {
if (x[e.to] != x[i] + e.d) {
puts("No");
exit(0);
}
} else {
dfs(e.to, d + e.d);
}
}
}
signed main()
{
cin >> N >> M;
g.resize(N);
rep(i, M)
{
int l, r, d;
cin >> l >> r >> d;
--l, --r;
g[l].emplace_back(edge{ r, d });
g[r].emplace_back(edge{ l, -d });
}
used.resize(N), x.resize(N);
rep(i, N)
{
if (!used[i]) {
dfs(i, 0);
}
}
puts("Yes");
return 0;
} | 1 | 1,397,769 |
#include<stdio.h>
#include<queue>
#include<assert.h>
#include<tuple>
#include<string>
#include<algorithm>
#include<iostream>
#include<map>
#include<string.h>
#include<vector>
#include<math.h>
#include<stdlib.h>
#include<set>
#include<ctype.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef tuple<int,int,int> t3;
const int MX = 100005;
const int MM = 1000000007;
int D[MX], O[MX];
int N, K, M;
vector<int> G[MX];
int vst[MX], C[MX];
bool dfs(int x){
if( vst[x] ) return true;
vst[x] = 1;
bool ch = 1;
for(int c : G[x]){
if( vst[c] && C[c] + C[x] != 1 ) ch = 0;
if( !vst[c] ) C[c] = !C[x];
ch &= dfs(c);
}
return ch;
}
int main()
{
int N, M;
scanf("%d%d", &N, &M);
for(int i = 1; i <= M; i++){
int a, b;
scanf("%d%d", &a, &b);
G[a].push_back(b);
G[b].push_back(a);
}
ll p = 0, q = 0, r = 0;
for(int i = 1; i <= N; i++){
if( vst[i] ) continue;
if( G[i].size() == 0 ) p++;
else if( dfs(i) ) q ++;
else r ++;
}
printf("%lld\n", 2*p*N - p*p + r*r + q*q*2 + q*r*2);
} | #include <iostream>
#include <algorithm>
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <valarray>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <chrono>
#include <random>
#include <numeric>
#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);
#define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__);
template<typename T> void MACRO_VAR_Scan(T& t) { std::cin >> t; }
template<typename First, typename...Rest>void MACRO_VAR_Scan(First& first, Rest&...rest) { std::cin >> first; MACRO_VAR_Scan(rest...); }
#define VEC_ROW(type, n, ...)std::vector<type> __VA_ARGS__;MACRO_VEC_ROW_Init(n, __VA_ARGS__); for(int i=0; i<n; ++i){MACRO_VEC_ROW_Scan(i, __VA_ARGS__);}
template<typename T> void MACRO_VEC_ROW_Init(int n, T& t) { t.resize(n); }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Init(int n, First& first, Rest&...rest) { first.resize(n); MACRO_VEC_ROW_Init(n, rest...); }
template<typename T> void MACRO_VEC_ROW_Scan(int p, T& t) { std::cin >> t[p]; }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Scan(int p, First& first, Rest&...rest) { std::cin >> first[p]; MACRO_VEC_ROW_Scan(p, rest...); }
#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;
#define MAT(type, c, m, n) std::vector<std::vector<type>> c(m, std::vector<type>(n));for(auto& r:c)for(auto& i:r)std::cin>>i;
#define OUT(d) std::cout<<d;
#define FOUT(n, d) std::cout<<std::fixed<<std::setprecision(n)<<d;
#define SOUT(n, c, d) std::cout<<std::setw(n)<<std::setfill(c)<<d;
#define SP std::cout<<" ";
#define TAB std::cout<<"\t";
#define BR std::cout<<"\n";
#define SPBR(i, n) std::cout<<(i + 1 == n ? '\n' : ' ');
#define ENDL std::cout<<std::endl;
#define FLUSH std::cout<<std::flush;
#define SHOW(d) {std::cerr << #d << "\t:" << d << "\n";}
#define SHOWVECTOR(v) {std::cerr << #v << "\t:";for(const auto& xxx : v){std::cerr << xxx << " ";}std::cerr << "\n";}
#define SHOWVECTOR2(v) {std::cerr << #v << "\t:\n";for(const auto& xxx : v){for(const auto& yyy : xxx){std::cerr << yyy << " ";}std::cerr << "\n";}}
#define SHOWQUEUE(a) {auto tmp(a);std::cerr << #a << "\t:";while(!tmp.empty()){std::cerr << tmp.front() << " ";tmp.pop();}std::cerr << "\n";}
#define ALL(a) (a).begin(),(a).end()
#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<int(n);++i)
#define RREP(i, n) for(int i=int(n)-1;i>=0;--i)
#define FORLL(i, a, b) for(ll i=ll(a);i<ll(b);++i)
#define RFORLL(i, a, b) for(ll i=ll(b)-1;i>=ll(a);--i)
#define REPLL(i, n) for(ll i=0;i<ll(n);++i)
#define RREPLL(i, n) for(ll i=ll(n)-1;i>=0;--i)
#define IN(a, x, b) (a<=x && x<b)
template<typename T> inline T CHMAX(T& a, const T b) { return a = (a < b) ? b : a; }
template<typename T> inline T CHMIN(T& a, const T b) { return a = (a > b) ? b : a; }
#define EXCEPTION(msg) throw std::string("Exception : " msg " [ in ") + __func__ + " : " + std::to_string(__LINE__) + " lines ]"
#define TRY(cond, msg) try {if (cond) EXCEPTION(msg);}catch (std::string s) {std::cerr << s << std::endl;}
void CHECKTIME(std::function<void()> f) { auto start = std::chrono::system_clock::now(); f(); auto end = std::chrono::system_clock::now(); auto res = std::chrono::duration_cast<std::chrono::nanoseconds>((end - start)).count(); std::cerr << "[Time:" << res << "ns (" << res / (1.0e9) << "s)]\n"; }
template<class T> std::vector<std::vector<T>> VV(int n) {
return std::vector<std::vector<T>>(n);
}
template<class T> std::vector<std::vector<T>> VV(int n, int m, T init = T()) {
return std::vector<std::vector<T>>(n, std::vector<T>(m, init));
}
template<typename S, typename T>
std::ostream& operator<<(std::ostream& os, std::pair<S, T> p) {
os << "(" << p.first << ", " << p.second << ")"; return os;
}
#define int ll
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using PAIR = std::pair<int, int>;
using PAIRLL = std::pair<ll, ll>;
constexpr int INFINT = 1 << 30;
constexpr int INFINT_LIM = (1LL << 31) - 1;
constexpr ll INFLL = 1LL << 60;
constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62);
constexpr double EPS = 1e-9;
constexpr int MOD = 1000000007;
constexpr double PI = 3.141592653589793238462643383279;
signed main() {
INIT;
VAR(int, n, m);
VEC_ROW(int, m, u, v);
std::vector<std::vector<int>> g(n);
REP(i, m) {
--u[i]; --v[i];
g[u[i]].emplace_back(v[i]);
g[v[i]].emplace_back(u[i]);
}
std::vector<bool> visited(n, false);
std::vector<int> depth(n, 0);
int one = 0, bi = 0, etc = 0;
REP(i, n) {
if (visited[i]) continue;
visited[i] = true;
if (g[i].size() == 0) {
++one;
continue;
}
bool bif = true;
[&] {
std::queue<int> que;
que.push(i);
while (!que.empty()) {
int now = que.front(); que.pop();
for (auto to : g[now]) {
if (visited[to]) {
if (depth[to] == depth[now]) {
bif = false;
}
}
else {
visited[to] = true;
depth[to] = !depth[now];
que.push(to);
}
}
}
}();
if (bif) {
++bi;
}
else {
++etc;
}
}
int ans = 0;
ans += one * n * 2 - one * one;
ans += bi * bi;
ans += (bi + etc) * (bi + etc);
OUT(ans)BR;
return 0;
} | 1 | 86,524,029 |
#include <cstdio>
int main()
{
int a,b;
scanf("%d %d",&a,&b);
if((a+b)%2 == 0)
{
printf("%d",(a+b)/2);
}
else if((a+b)%2 != 0)
{
printf("%d",((a+b)/2)+1);
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int x;
x = (a + b) * 10 / 2;
if (x % 10 == 0) {
cout << x / 10 << endl;
} else {
cout << x / 10 + 1 << endl;
}
return 0;
} | 1 | 36,966,035 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<string> s(n);
vector<int> t(n);
string x;
for(int i = 0; i < n; i++) { cin >> s.at(i) >> t.at(i); }
cin >> x;
int ans = 0;
for(int i = 0; i < n; i++) {
if(s.at(i) == x) {
i++;
for(int j = i; j < n; j++) {
ans = ans + t.at(j);
}
cout << ans << endl;
return 0;
}
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i = 0;i < n;++i)
#define all(v) v.begin(), v.end()
using ll = long long;
int main()
{
ll i,j;
ll n;
cin >> n;
ll sum = 0;
ll a = 0;
vector<string> s(n);
vector<ll> t(n);
for(i = 0;i < n;++i){
cin >> s.at(i) >> t.at(i);
a += t.at(i);
}
string x;
cin >> x;
for(i = 0;i < n;++i){
sum += t.at(i);
if(s.at(i) == x) break;
}
cout << a - sum << endl;
return 0;
} | 1 | 14,974,714 |
#include "bits/stdc++.h"
using namespace std;
const int MAX = 700000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(int n, int k) {
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
long long int maxtime(long long int x, long long int y) {
return(x + y - 1) / y;
}
long long int lcm(long long int number1, long long int number2) {
long long int m = number1;
long long int n = number2;
if (number2 > number1) {
m = number2;
n = number1;
}
long long int s = -1;
while (s != 0) {
s = m % n;
m = n;
n = s;
}
return m;
}
long long int gcd(long long int number1, long long int number2) {
long long int m = number1;
long long int n = number2;
return m / lcm(m, n) * n;
}
long long int modinv(long long a, long long m) {
long long int b = m, u = 1, v = 0;
while (b) {
long long int t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
vector<long long int >meguru;
bool isOK(int index, int key) {
if (meguru[index] <= key) return true;
else return false;
}
int binary_search(int key) {
int left = -1;
int right = (int)meguru.size();
while (right - left > 1) {
int mid = left + (right - left) / 2;
if (isOK(mid, key)) left = mid;
else right = mid;
}
return left;
}
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
int dp[1000] = {};
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < k; i++) {
int d;
cin >> d;
for (int i = 0; i < d; i++) {
int a;
cin >> a;
dp[a]++;
}
}
int ans = 0;
for (int i = 1; i <= n; i++) {
if (dp[i] == 0) {
ans++;
}
}
cout << ans;
} | #include <bits/stdc++.h>
#include <iostream>
#include <cstdio>
#include <cstdlib>
using namespace std;
#define rep0(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
using ll = long long;
const double PI=3.14159265358979323846;
int main() {
int n,k,d;cin>>n>>k;
vector<int> p(n);
rep0(i,k){
cin>>d;
vector<int> v(d);
rep0(j,d){
cin>>v[j];
p[v[j]-1]=1;
}
}
int count=0;
rep0(i,n){
if(p[i]==0){
count++;
}
}
cout<<count<<endl;
} | 1 | 12,947,426 |
#include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>
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; }
constexpr long long MAX = 5100000;
constexpr long long INF = 1LL << 60;
constexpr int inf = 1 << 28;
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
int main()
{
int kkt = 89;
while (kkt) {
int m, n_min, n_max; scanf("%d %d %d", &m, &n_min, &n_max);
if (m == 0) break;
vector<int> p(m); for (int i = 0; i < m; i++) scanf("%d", &p[i]);
sort(p.rbegin(), p.rend());
int g = -1;
int res = 0;
for (int i = n_max - 1; i >= n_min - 1; i--) {
if (chmax(g, p[i] - p[i + 1])) {
res = i + 1;
}
}
printf("%d\n", res);
}
return 0;
} | #include<iostream>
#include<vector>
#include<algorithm>
#define INF 100000
using namespace std;
int main()
{
while (true) {
int m, n_min, n_max;
cin >> m >> n_min >> n_max;
if (m==0 && n_min ==0 && n_max == 0) {
return 0;
}
vector<int> pv(m);
for (int i = 0; i < m; i++) {
cin >> pv[i];
}
sort(pv.rbegin(), pv.rend());
int d_max = -INF;
int result = n_min;
for (int n = n_min; n <= n_max; n++) {
int d = pv[n - 1] - pv[n];
if (d >= d_max) {
d_max = d;
result = n;
}
}
cout << result << endl;
}
return 0;
} | 1 | 99,195,918 |
#include <bits/stdc++.h>
#define ll long long int
#define ull unsigned long long int
#define IO ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
using namespace std;
const int INF = 1e9 + 7;
const int N = 1e5+5;
int main() {
IO;
int a, b, c;
cin >> a >> b >> c;
if (c <= b && c >= a) {
cout << "Yes";
}
else {
cout << "No";
}
} | #include <stdio.h>
#include <stdlib.h>
int main()
{
int a,b,e;
while(~scanf("%d%d%d",&a,&b,&e))
{
if(e>=a&&e<=b)
printf("Yes\n");
else
printf("No\n");
}
return 0;
} | 1 | 15,873,197 |
# include "bits/stdc++.h"
using namespace std;
#define endl "\n"
typedef long long int ll;
#define f first
#define s second
inline void fastio(){ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);}
inline void setPrecision(int n){cout.precision(n);}
#define BR cerr<<endl
#define dbg(x) cerr<<(#x)<<": "<<x<<endl
#define dbgV(x) cerr<<(#x)<<": "; for(auto it: x) cerr<<it<<" "; cerr<<endl;
#define dbgS(x) cerr<<(#x)<<": "; for(auto it: x) cerr<<it<<" "; cerr<<endl;
#define dbgM(x) cerr<<(#x)<<": "; for(auto it: x) cerr<<"["<<it.f<<", "<<it.s<<"] "; cerr<<endl;
#define dbg2D(x) cerr<<(#x)<<": \n"; for(auto y: x) { for(auto it: y) cerr<<it<<" "; cerr<<endl; } cerr<<endl;
#define dbgA(x, n) cerr<<(#x)<<": "; for(int i=0;i<n;++i) cerr<<x[i]<<" "; cerr<<endl;
#define dbgVP(x) cerr<<(#x)<<": "; for(auto it: x) cerr<<"["<<it.f<<", "<<it.s<<"] "; cerr<<endl;
ll INF = 1e10;
int MOD = 1e9+7;
int n, k;
ll r, s, p;
string t;
inline bool win(int x, char s){
if(x == 0){
if(s == 's')
return 1;
else
return 0;
}else if(x == 1){
if(s == 'r')
return 1;
else
return 0;
}
else{
if(s == 'p')
return 1;
else
return 0;
}
}
ll formdp(vector<int> a){
int N = a.size();
ll dp[N][3];
ll score[] = {r, p , s};
dp[0][0] = win(0, t[a[0]]) ? score[0] : 0;
dp[0][1] = win(1, t[a[0]]) ? score[1] : 0;
dp[0][2] = win(2, t[a[0]]) ? score[2] : 0;
for(int i = 1; i < N; ++ i){
dp[i][0] = (win(0, t[a[i]]) ? score[0] : 0) + max(dp[i - 1][1], dp[i - 1][2]);
dp[i][1] = (win(1, t[a[i]]) ? score[1] : 0) + max(dp[i - 1][0], dp[i - 1][2]);
dp[i][2] = (win(2, t[a[i]]) ? score[2] : 0) + max(dp[i - 1][0], dp[i - 1][1]);
}
return max(dp[N - 1][0], max(dp[N - 1][1], dp[N - 1][2]));
}
int main(){
#ifndef ONLINE_JUDGE
freopen("inputf.in", "r", stdin);
#endif
fastio();
cin >> n >> k >> r >> s >> p >> t;
vector<vector<int>> groups;
set<int> keep;
for(int i = 0; i < n; ++ i)
keep.insert(i);
while(!keep.empty()){
int cur = *keep.begin();
vector<int> temp;
while(cur < n){
temp.push_back(cur);
keep.erase(cur);
cur += k;
}
groups.push_back(temp);
}
ll ans = 0;
for(auto grp : groups){
ans += formdp(grp);
}
cout << ans;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
void solve() {
int n, k;
cin >> n >> k;
int r, s, p;
cin >> r >> s >> p;
string t;
cin >> t;
ll ans = 0;
for (int i = 0; i < k; i++) {
char c = 'x';
for (int j = i; j < n; j += k) {
if (c == t[j]) c = 'x';
else {
if (t[j] == 'r') ans += p;
else if (t[j] == 's') ans += r;
else ans += s;
c = t[j];
}
}
}
cout << ans << endl;
}
int main() {
solve();
return 0;
} | 1 | 27,757,928 |
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <ctype.h>
#include <string>
using namespace std;
int hiniti(int y,int m,int d){
int result=0;
for(int s=1;s<=y;s++){
for(int j=1;j<=10;j++){
if(y==s&&m==j){
return result+=d;
}
if(s%3==0){
result+=20;
}else{
if(j%2==0){
result+=19;
}else{
result+=20;
}
}
}
}
}
int main(void){
int n;
cin>>n;
int y,m,d;
for(int s=0;s<n;s++){
cin>>y>>m>>d;
int t=hiniti(y, m, d);
cout<<196471-t<<endl;
}
return 0;
} | #include"bits/stdc++.h"
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, n) FOR(i, 0, n)
#define RFOR(i, a, b) for (int i = b - 1; i >= a; i--)
#define RREP(i, n) RFOR(i, 0, n)
#define rep(i, a, b) for (auto i = a; i < b; i++)
#define rrep(i, a, b) for (auto i = a; i > b; i--)
#define range(i, a, b) (a <= i && i < b)
#define fi first
#define fs first
#define se second
#define sc second
using namespace std;
using vec = vector<int>;
using mat = vector<vec>;
typedef pair<int, int> P;
#define ll long long
void solve() {
int y, m, d;
cin >> y >> m >> d;
int base = 39*5*666 + 40*5*333+1;
int tmp = 0;
FOR(i, 1, y) {
if(i%3 == 0) tmp += 40 * 5;
else tmp += 39 * 5;
}
FOR(i, 1, m) {
if (i % 2 || y % 3 == 0) tmp += 20;
else tmp += 19;
}
tmp += d;
cout << base - tmp << endl;
}
int main() {
int n;
cin >> n;
REP(_, n) solve();
} | 1 | 25,999,213 |
#include <iostream>
using namespace std;
int main()
{
int x,y,z;
int i,l;
l=0;
cin >> x;
cin >> y;
cin >> z;
for(i=x;i<=y;i++){
if((z%i)==0){
l++;
}
}
cout<<l<<endl;
return 0;
} | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
using namespace std;
typedef long long unsigned int ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
int main() {
int a,b,c;
int cnt = 0;
cin >> a >> b >> c;
for(int i = a;i<= b;i++){
if (c % i == 0){
cnt++;
}
}
cout << cnt << endl;
return 0;
} | 1 | 72,957,948 |
#include<iostream>
#include<cstdio>
using namespace std;
#define MAX 300
int main(void)
{
int H,W;
while(1){
cin >> H >> W;
if(H == 0 && W == 0) break;
for(int i = 0;i < H;i++){
for(int j = 0;j < W;j++){
if(i == 0 || i == H - 1 || j == 0 || j == W - 1) printf("#");
else printf(".");
}
printf("\n");
}
printf("\n");
}
return 0;
} | #include <iostream>
using namespace std;
void printRectangle(int height, int width) {
for (int row = 0; row < height; ++row) {
string line;
bool isTopBottom = (row == 0 || row == height - 1) ? true : false;
for (int column = 0; column < width; ++column) {
bool isLeftRightEnd = (column == 0 || column == width - 1) ? true : false;
line += (isTopBottom || isLeftRightEnd) ? "#" : ".";
}
cout << line << endl;
}
cout << endl;
}
int main() {
while (true) {
int height, width;
cin >> height >> width;
if (height == 0 && width == 0) break;
printRectangle(height, width);
}
return 0;
} | 1 | 84,943,617 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
template<typename tn> void read(tn &a){
tn x=0,f=1; char c=' ';
for(;!isdigit(c);c=getchar()) if(c=='-') f=-1;
for(;isdigit(c);c=getchar()) x=x*10+c-'0';
a=x*f;
}
int n,a[101000];
int f[110000];
vector<int> e[101000];
void dfs(int x,int dad){
if(e[x].size()==1){f[x]=a[x];return;}
ll s=0;int mx=0;
for(int v:e[x]) if(v!=dad){
dfs(v,x);
mx=max(mx,f[v]);
s+=f[v];
}
if(s<a[x]||s>2ll*a[x]){puts("NO");exit(0);}
f[x]=2*a[x]-s;
if(2*mx-s>f[x]){puts("NO");exit(0);}
}
int main(){
read(n);
for(int i=1;i<=n;i++) read(a[i]);
if(n==2){puts(a[1]==a[2]?"YES":"NO");return 0;}
for(int i=1;i<n;i++){
int x,y;read(x);read(y);
e[x].push_back(y);
e[y].push_back(x);
}
for(int i=1;i<=n;i++)
if(e[i].size()>1){
dfs(i,0);
if(!f[i])puts("YES");
else puts("NO");
return 0;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int,int> P;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define LLINF 1000000000000000ll
#define sz(x) ((int)(x).size())
#define fi first
#define sec second
#define all(x) (x).begin(),(x).end()
#define sq(x) ((x)*(x))
#define rep(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define repn(i,a,n) for(int (i)=(a);(i)<(int)(n);(i)++)
#define EQ(a,b) (abs((a)-(b))<eps)
template<class T> void chmin(T& a,const T& b){if(a>b)a=b;}
template<class T> void chmax(T& a,const T& b){if(a<b)a=b;}
int N;
ll A[100100];
vector<int> g[100100];
int par[100100];
int deg[100100];
ll c[100100];
ll csum[100100];
void dfs(int v,int p){
par[v]=p;
int cnt = 0;
for(int i=0;i<g[v].size();i++){
int u = g[v][i];
if(u==p)continue;
cnt++;
dfs(u,v);
csum[v]+=c[u];
}
if(cnt>0)c[v]=2ll*A[v]-csum[v];
else c[v]=A[v];
}
void fail(int x=-1){
cout << "NO" << endl;
exit(0);
}
int main(){
cin >> N;
for(int i=0;i<N;i++)cin >> A[i];
for(int i=0;i<N-1;i++){
int a,b;
cin >> a >> b;
a--;b--;
deg[a]++;
deg[b]++;
g[a].pb(b);
g[b].pb(a);
}
dfs(0,-1);
for(int i=0;i<N;i++){
if(i>0&&c[i]<0ll)fail();
}
if(deg[0]==1){
if(c[g[0][0]]!=A[0])fail(0);
}else{
if(c[0]!=0)fail();
for(int i=0;i<g[0].size();i++){
int u = g[0][i];
if(c[u]>A[0])fail();
}
}
for(int i=1;i<N;i++){
if(deg[i]>1&&c[i]>csum[i])fail(1);
ll rem = 0ll;
ll h = (csum[i]-c[i])/2ll;
for(int j=0;j<g[i].size();j++){
int u = g[i][j];
if(par[i]==u)continue;
rem += max(0ll,c[u]-h);
}
if(rem>c[i])fail(2);
}
cout << "YES" << endl;
return 0;
} | 1 | 33,694,931 |
#include <iostream>
#include <cstdio>
#include <stack>
#include <queue>
#define MAX 100
#define WHITE 0
#define GRAY 1
#define BLACK 2
#define NO -1
using namespace std;
int adjacencyList[MAX + 1][MAX + 1];
int color[MAX + 1];
int d[MAX + 1];
int n;
void bfs(int o)
{
queue<int> S;
S.push(o);
color[o] = GRAY;
d[o] = 0;
int fr;
while (S.size() > 0) {
fr = S.front();
S.pop();
color[fr] = BLACK;
for (int i = 1; i <= n; i++) {
if (color[i] == WHITE && adjacencyList[fr][i] != NO) {
S.push(i);
color[i] = GRAY;
d[i] = d[fr] + 1;
}
}
}
}
int main(void)
{
int u;
int k;
int v;
cin >> n;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
adjacencyList[i][j] = NO;
}
}
for (int i = 0; i < n; i++) {
cin >> u >> k;
for (int j = 0; j < k; j++) {
cin >> v;
adjacencyList[u][v] = 1;
}
}
bfs(1);
for (int i = 1; i <= n; i++) {
cout << i << " ";
if (color[i] == BLACK) {
cout << d[i];
}
else {
cout << -1;
}
cout << endl;
}
return 0;
} | #include<bits/stdc++.h>
#include<limits.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define MAX 200
int n;
vector<vector<int>> adj_mat(MAX, vector<int>(MAX, 0));
queue<int> q;
vector<int> visited(MAX, -1);
vector<int> d(MAX, -1);
void add_queue(int node){
rep(i, n){
if(adj_mat.at(node).at(i) == 1 && visited.at(i) == -1){
q.push(i);
d.at(i) = d.at(node) + 1;
visited.at(i) = 1;
}
}
}
void bfs(int node){
q.push(node);
d.at(node) = 0;
visited.at(node) = 1;
while(q.size() != 0){
int visited_node = q.front();
q.pop();
add_queue(visited_node);
}
}
int main(){
cin >> n;
rep(i, n){
int u, k; cin >> u >> k;
rep(j, k){
int v; cin >> v;
adj_mat.at(u-1).at(v-1) = 1;
}
}
bfs(0);
rep(i, n){
cout << i+1 << " " << d.at(i) << endl;
}
} | 1 | 56,055,233 |
#include <fstream>
#include <iostream>
using namespace std;
#define MOD 998244353
#define FOR(i,a,b) for (int i = (a); i < (b); i++)
#define F0R(i,b) FOR(i,0,b)
#define RFO(i,a,b) for (int i = (b-1); i >= (a); i--)
#define RF0(i,b) RFO(i,0,b)
#define lli long long int
#define pii pair<int,int>
#define add(a,b) ((int) (((lli) (a) + (b))%MOD))
#define mul(a,b) ((int) (((lli) (a) * (b))%MOD))
#define PB emplace_back
#define F first
#define S second
int N, M;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> N >> M;
if (N&1) {
N -= N&1;
F0R(i,M) cout << i+1 << ' ' << N-i << '\n';
} else {
F0R(i,M) {
if (N-2*i-1 <= N/2) cout << i+1 << ' ' << N-i-1 << '\n';
else cout << i+1 << ' ' << N-i << '\n';
}
}
} | #include <bits/stdc++.h>
#define REP(i, x) REPI(i, 0, x)
#define REPI(i, a, b) for (int i = int(a); i < int(b); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
int l = 1;
int r = N;
if (N % 2 == 1) {
REP(i, M) {
cout << l << " " << r << endl;
++l;
--r;
}
} else {
set<pair<int, int>> found;
REP(i, M) {
cout << l << " " << r << endl;
++l;
--r;
if (abs(r - l) == abs(l + N - r) ||
found.find(make_pair(min(abs(r - l), abs(l + N - r)),
max(abs(r - l), abs(l + N - r)))) !=
found.end()) {
++l;
}
found.insert(make_pair(min(abs(r - l), abs(l + N - r)),
max(abs(r - l), abs(l + N - r))));
}
}
return 0;
} | 1 | 39,177,240 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define resort(v) sort((v).rbegin(), (v).rend())
#define vi vector<int>
#define vvi vector<vector<int>>
#define vc vector<char>
#define vvc vector<vector<char>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
using ll = long long;
using P = pair<int, int>;
int dx[] = {1,0,-1,0};
int dy[] = {0,1,0,-1};
constexpr ll mod = 1e9+7;
constexpr ll inf = LLONG_MAX;
constexpr long double eps = DBL_EPSILON;
constexpr long double pi = 3.141592653589793238462643383279;
ll fact(int i) {
if (i == 0) return 1;
return (fact(i - 1)) * i;
}
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);
}
int keta(ll n) {
if(n == 0) return 1;
int count = 0;
while(n != 0) {
n /= 10;
count++;
}
return count;
}
ll ketasum(ll n) {
ll sum = 0;
while(n != 0) {
sum += n % 10;
n /= 10;
}
return sum;
}
int main() {
int n;cin >> n;
map<int,int> mp;
rep(i, n) {
int a;cin >> a;
mp[a]++;
}
int count = 0;
for(auto p:mp) {
if(p.first==1) count+=mp[p.first] - 1;
count += mp[p.first]%p.first;
}
cout << count << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
const ll INF = 1LL << 60;
int main(){
int n;
cin >> n;
vector<int> a(n);
rep(i,n) cin >> a[i];
map<int,int> m;
for(auto &i:a){
m[i] ++;
}
int cnt=0;
for(auto &i:m){
if(i.first < i.second){
cnt += i.second - i.first;
}
else if(i.first > i.second){
cnt += i.second;
}
}
cout << cnt << endl;
} | 1 | 53,972,797 |
#include<cstdio>
#include<cstring>
int main() {
char s[201];
int m, h, i, n;
while (true) {
scanf("%s", s);
if (strcmp(s, "-") == 0)break;
scanf("%d", &m);
n = 0;
for (i = 0; i < m; i++) {
scanf("%d", &h);
n = (n + h) % strlen(s);
}
printf("%s", s + n);
s[n] = '\0';
printf("%s\n", s);
}
return 0;
} | #include <cstdio>
#include <string>
using namespace std;
char word[201];
void copy_word(char* s, char* t, int n){
for(int i = 0; i<n; ++i){
t[i] = s[i];
}
}
int main(){
while(1){
scanf("%s", word);
if(word[0] == '-'){
break;
}
int length =0;
while(word[length]!='\0'){
++length;
}
int m, b;
char new_word[201];
scanf("%d", &m);
for(int i=0; i<m; ++i){
scanf("%d", &b);
copy_word(word+b,new_word,length-b);
copy_word(word,new_word+length-b,b);
copy_word(new_word,word,length);
}
printf("%s\n", word);
}
} | 1 | 67,092,588 |
#include <iostream>
#include <iomanip>
#include <ios>
#include <vector>
#include <string>
#include <algorithm>
#include <functional>
#include <queue>
#include <stack>
#include <set>
#include <cmath>
#include <bitset>
#include <map>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define sz(c) ((int)(c).size())
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
int main(){
int A,B,C;
cin>>A>>B>>C;
if(A==B && B==C)cout<<"Yes"<<endl;
else cout<<"No"<<endl;
} | #include <iostream>
#include <numeric>
#include <stdio.h>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
using namespace std;
using ll = long long;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
int Max(int(a), int(b), int(c)) {
return max(max(a, b), c);
}
int Min(int(a), int(b), int(c)) {
return min(min(a, b), c);
}
int main() {
ll N,K,M;
cin >> N>>K>>M;
string s = "No";
if (N==M&&N==K) {
s = "Yes";
}
cout << s << endl;
} | 1 | 38,522,171 |
#include <cstdio>
using namespace std;
int main() {
int a,b,c;
scanf("%d%d%d",&a,&b,&c);
printf(( a < b && b < c)?"Yes\n":"No\n");
return 0;
} | #include<stdio.h>
#include<stdbool.h>
int main(void){
int a,b,c;
scanf("%d",&a);
scanf("%d",&b);
scanf("%d",&c);
printf(a<b&&b<c ? "Yes\n" : "No\n");
return 0;
} | 1 | 68,385,815 |
#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 n;
cin >> n;
vector<int> x(n);
rep(i,n) cin >> x[i];
int ans = 1e9;
for(int i=1; i<=100; i++){
int now = 0;
rep(j,n){
now += (x[j]-i)*(x[j]-i);
}
ans = min(ans,now);
}
cout << ans << endl;
return 0;
} | #include<iostream>
#include<vector>
#include<string>
#include<math.h>
#include<stdio.h>
#include<queue>
#include<map>
#include<stack>
using namespace std;
int dx[] = { -1,0,0,1,-1,-1,1,1,0 };
int dy[] = { 0,1,-1,0,1,-1,1,-1,0 };
int main()
{
int n;
cin >> n;
vector<int>x(n);
for (int i = 0; i < n; i++)
{
cin >> x[i];
}
int ans = 0;
int ans2 = 0;
for (int i = 1; i <= 100; i++)
{
for (int j=0; j < n; j++)
{
int a;
a = (x[j] - i)*(x[j] - i);
ans = ans + a;
}
if (i == 1)
{
ans2 = ans;
}
else
{
if (ans2 > ans)
{
ans2 = ans;
}
}
ans = 0;
}
cout << ans2 << endl;
} | 1 | 292,130 |
#include<bits/stdc++.h>
using namespace std;
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(V) (V).begin(),(V).end()
#define SORT(V) sort(ALL(V))
vector<string> split(string,string);
int main()
{
int N;
cin >> N;
int w = N*N;
int A;
cin >> A;
cout << w - A;
} | #include <iostream>
#include <math.h>
int main() {
double DDblCulCells, DDblAllCells, DDblWhiteCells;
double DDblBlackCells;
std::cin >> DDblCulCells >> DDblWhiteCells;
DDblAllCells = pow(DDblCulCells, 2);
DDblBlackCells = DDblAllCells - DDblWhiteCells;
std::cout << DDblBlackCells << std::endl;
} | 1 | 52,445,402 |
Subsets and Splits