code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 2
101M
|
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
const int mod=1e9+7;
int main(){
int n;cin>>n;
ll a[n];rep(i,n)cin>>a[i];
ll ans=0;
bool flag=1;
while(flag){
flag=0;
rep(i,n){
if(a[i]>=n){
ll p=a[i]/n;
ans+=p;
a[i]-=p*n;
flag=1;
rep(j,n){
if(j!=i)a[j]+=p;
}
}
}
if(!flag)break;
}
cout<<ans<<endl;
} | #include <iostream>
#include <algorithm>
#include <vector>
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
using namespace std;
typedef long long ll;
int main()
{
ll n;
cin >> n;
vector<ll> a(n);
rep(i,n) cin >> a[i];
ll r=0;
rep(i,n){
r += (a[i]+1)/(n+1);
}
if(r==0){
cout << 0 << "\n";
return 0;
}
vector<ll> b(n+1,0);
rep(i,n){
ll x = a[i]%(n+1);
ll y = (x+2)%(n+1);
b[(n+1-y)%(n+1)]++;
}
ll d=0;
vector<ll> c(n+1);
rep(i,n+1){
c[i] = d+1-b[i];
d = c[i];
}
ll mi=0;
ll mx=c[0];
rep(i,n+1){
if(mx<c[i]){
mx=c[i];
mi=i;
}
if(r<=c[i]){
cout << i+1 << "\n";
return 0;
}
}
cout << (r-mx)*(n+1)+mi+1 << "\n";
return 0;
} | 1 | 65,317,549 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define rep(i,N) for(ll (i)=0;(i)<(N);(i)++)
const int mod = 1000000007;
vector<ll> divisor(ll n) {
vector<ll> res;
for (ll i = 1; i * i <= n; ++i) {
if(n % i == 0) {
res.push_back(i);
if(i * i != n) res.push_back(n / i);
}
}
sort(res.begin(), res.end());
return res;
}
int main(){
ll n;
cin >> n;
vector<ll> div = divisor(n);
ll ans = 0;
rep(i, div.size()) {
ll t = n / div[i] - 1;
if(t == 0) continue;
if(n % t == n / t) ans += t;
}
cout << ans << endl;
} | #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <ctime>
#include <bitset>
#include <complex>
#include <chrono>
#include <random>
#include <functional>
using namespace std;
#define int long long
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
int ans = 0;
auto relax_x = [&](int x) {
int m = n / x - 1;
if (x < m) {
ans += m;
}
};
for (int i = 1; i * i <= n; i++) {
if (n % i == 0) {
relax_x(i);
if (i * i < n) relax_x(n / i);
}
}
cout << ans << endl;
} | 1 | 13,410,960 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define all(x) (x).begin(),(x).end()
#define V vector
typedef V<int> vi;
typedef V<vi> vvi;
typedef long long ll;
typedef pair<ll, int> P;
typedef tuple<int, int, int> T;
constexpr auto INF = INT_MAX >> 1;
constexpr auto LINF = 5000000000000000;
constexpr auto MOD = 1000000007;
int main() {
int n;
cin >> n;
vi a(n);
rep(i, n)cin >> a[i];
sort(all(a));
V<ll> sum(n + 1);
rep(i, n)sum[i + 1] = sum[i] + a[i];
int ans = 0;
rep(i, n) {
ll d = a[i];
bool ok = false;
while (true) {
int k = upper_bound(all(a), 2 * d) - a.begin();
if (k == n) { ok = true;break; }
if (d == sum[k])break;
d = sum[k];
}
if (ok) {
ans = n - i;
break;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(int)(n); i<i##_len; i++)
#define reps(i,n) for(int i=1 , i##_len=(int)(n);i<=i##_len;i++)
#define rrep(i,n) for(int i=((int)(n)-1);i>=0;i--)
#define rreps(i,n) for(int i=((int)(n));i>0;i--)
#define repi(i,x) for(auto i=(x).begin(),i##_fin=(x).end();i!=i##_fin;i++)
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define solve(a) ((a)?"Yes":"No")
typedef vector<int> Vi;
typedef vector<Vi> VVi;
typedef pair<int , int> Pi;
typedef vector<Pi> VPi;
typedef vector<long long> V;
typedef vector<V> VV;
typedef pair<long long , long long> P;
typedef vector<P> VP;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1;} return 0;}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1;} return 0;}
const long long INFLL = 1LL<<60;
const int INF = 1<<30;
const double PI=acos(-1);
int main(){
int n;
int ans=0;
ll sum=0LL;
int cnt=0;
cin >>n;
V a(n);
rep(i,n){
cin>>a[i];
}
sort(all(a));
rep(i,n){
if(i==0){
cnt=1;
sum=a[0];
}else{
if(sum *2 >= a[i]){
cnt++;
}else{
cnt=1;
}
sum += a[i];
}
}
cout<<cnt<<endl;
} | 1 | 52,220,760 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int n, c, k, o, per, bus;
int a[N];
int main() {
scanf("%d%d%d", &n, &c, &k);
for(int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
sort(a + 1, a + n + 1);
o = 1, per = a[1], bus = 1;
for(int i = 2; i <= n; i++) {
if(o < c && a[i] <= per + k) o++;
else {
bus++;
per = a[i];
o = 1;
}
}
printf("%d\n", bus);
} | #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 vector_finder(std::vector<ll> vec, int number) {
auto itr = std::find(vec.begin(), vec.end(), number);
size_t index = std::distance( vec.begin(), itr );
if (index != vec.size()) {
return 1;
}
else {
return 0;
}
}
int main() {
ll N, C, K; cin >> N >> C >> K;
vector<ll> T(N); REP(i, N) cin >> T[i];
sort(all(T));
ll k = 0;
ll cnt = 1;
ll tmp = 0;
bool flag = false;
for(int i = 0; i < N; ++i) {
if(T[k] + K >= T[i]) {
tmp++;
if(tmp == C) {
tmp = 0;
cnt++;
k = i + 1;
if(i + 1 == N) cnt--;
}
} else {
tmp = 1;
cnt++;
k = i;
}
}
cout << cnt << endl;
} | 1 | 61,285,843 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int (i)=0;(i)<(n);i++)
#define INF 1001001001
#define LLINF 1001001001001001001
#define MOD 1000000007
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; }
#define ALL(v) v.begin(), v.end()
typedef long long ll;
const ll mod=1000000007;
ll powmod(ll x,ll y){
ll res=1;
for(ll i=0;i<y;i++){
res=res*x%mod;
}
return res;
}
int main(){
char b;
cin >> b;
if(b=='A')cout << 'T' << endl;
else if(b=='T')cout << 'A' << endl;
else if(b == 'C') cout << 'G' << endl;
else cout << 'C' << endl;
return 0;
} | #include <iostream>
using namespace std;
void ABC120(void);
void ABC121(void);
void ABC122(void);
void ABC123(void);
void ABC124(void);
void ABC125(void);
void ABC126(void);
void ABC127(void);
void ABC128(void);
void ABC129(void);
int main(void){
ABC122();
}
void ABC122(){
char b;
cin>>b;
if(b=='A')cout<<'T'<<endl;
if(b=='C')cout<<'G'<<endl;
if(b=='G')cout<<'C'<<endl;
if(b=='T')cout<<'A'<<endl;
} | 1 | 51,343,590 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
ll H, W;
struct cellinfo {
int x0;
int xlen;
int y0;
int ylen;
};
cellinfo ci[2001][2001];
int main(){
cin >> H >> W;
vector<string> S(H+1);
for ( int i = 0; i < H; i++ )
cin >> S[i];
S[H] = S[0];
for ( int i = 0; i < W; i++ )
S[H][i] = '#';
for ( int y = 0; y < H; y++ ){
for ( int x = 0; x < W; x++ ){
ci[y][x].y0 = ci[y][x].x0 = -1;
}
}
for ( int y = 0; y < H; y++ ){
int x0 = -1;
for ( int x = 0; x <= W; x++ ){
if ( S[y][x] == '.' ){
if ( x0 == -1 ){
x0 = x;
}
ci[y][x].x0 = x0;
}
else {
if ( x0 != -1 ){
ci[y][x0].xlen = x - x0;
x0 = -1;
}
}
}
}
for ( int x = 0; x < W; x++ ){
int y0 = -1;
for ( int y = 0; y <= H; y++ ){
if ( S[y][x] == '.' ){
if ( y0 == -1 ){
y0 = y;
}
ci[y][x].y0 = y0;
}
else {
if ( y0 != -1 ){
ci[y0][x].ylen = y - y0;
y0 = -1;
}
}
}
}
int max_val = 0;
for ( int y = 0; y < H; y++ ){
for ( int x = 0; x < W; x++ ){
int val = 0;
if ( S[y][x] == '.' ){
int x0 = ci[y][x].x0;
val += ci[y][x0].xlen;
int y0 = ci[y][x].y0;
val += ci[y0][x].ylen;
max_val = max(max_val, val-1);
}
}
}
cout << max_val << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int h,w;
cin >> h >> w;
vector<string> field(h);
for(int i=0; i<h; i++) cin >> field[i];
vector<vector<int>> L(h,vector<int>(w,0));
vector<vector<int>> R(h,vector<int>(w,0));
vector<vector<int>> D(h,vector<int>(w,0));
vector<vector<int>> U(h,vector<int>(w,0));
for (int i=0; i<h; i++){
int cnt = 1;
for (int j=0; j<w; j++){
if (field[i][j]=='#') cnt = 0;
L[i][j] = cnt;
cnt++;
}
}
for (int i=0; i<h; i++){
int cnt = 1;
for (int j=w-1; 0<=j; j--){
if (field[i][j]=='#') cnt = 0;
R[i][j] = cnt;
cnt++;
}
}
for (int j=0; j<w; j++){
int cnt = 1;
for (int i=0; i<h; i++){
if (field[i][j]=='#') cnt = 0;
U[i][j] = cnt;
cnt++;
}
}
for (int j=0; j<w; j++){
int cnt = 1;
for (int i=h-1; 0<=i; i--){
if (field[i][j]=='#') cnt = 0;
D[i][j] = cnt;
cnt++;
}
}
int ans = 0;
for (int i=0; i<h; i++){
for (int j=0; j<w; j++){
if (field[i][j] == '#') continue;
int res = L[i][j]+R[i][j]+U[i][j]+D[i][j]-3;
ans = max(ans,res);
}
}
cout << ans << endl;
return 0;
} | 1 | 20,130,565 |
#include <iostream>
using namespace std;
const int MOD = 1000000007;
int N;
int dig[60];
long long A[300100];
int main() {
cin >> N;
for (int i = 0; i < N; i++) cin >> A[i];
long long ans = 0, dig = 1;
for (int i = 0; i < 60; i++) {
long long zero = 0, one = 0;
for (int j = 0; j < N; j++) {
long long bit = A[j];
if ((bit >> i) & 1) one++;
else zero++;
}
ans += (zero * one % MOD) * dig % MOD;
ans %= MOD;
dig *= 2;
dig %= MOD;
}
cout << ans << endl;
} | #include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
int main(){
cout << fixed << setprecision(10);
int n;
cin >> n;
vector<ll> v(n);
rep(i,n) cin >> v[i];
vector<ll> cnt(60);
rep(i,60){
rep(j,n){
if((v[j]>>i)&1) cnt[i]++;
}
}
ll ans = 0;
rep(i,60){
ll now = cnt[i]*(n-cnt[i])%mod;
rep(j,i){
now *= 2;
now %= mod;
}
now %= mod;
ans += now;
ans %= mod;
}
cout << ans << endl;
return 0;
} | 1 | 11,161,043 |
#include<bits/stdc++.h>
#define mod 1000000007
#define ll long long int
#define ld long double
#define f first
#define mt make_tuple
#define s second
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define time_bata cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
#define pb push_back
#define ppb pop_back
#define ppf pop_front
#define vec std::vector<int > v;
#define eps 1e-7
#define endl "\n"
#define mp make_pair
#define p_q priority queue
#define dbg(x) cout<<"#x"<<" = "<<x<<endl
#define dbg2(x,y) cout<<"#x"<<" = "<<x<<", "<<#y<<" = "<<y<<endl
#define dbg3(x,y,z) cout<<"#x"<<" = "<<x<<", "<<#y<<" = "<<y<<", "<<#z<<" = "<<z<<endl
#define dbg4(x,y,z,q) cout<<"#x"<<" = "<<x<<", "<<#y<<" = "<<y<<", "<<#z<<" = "<<z<<", "<<#q<<" = "<<q<<endl
#define FOR(i,n) for(int i=0;i<n;i++)
#define FOR_(i,a,b) for(int i=a;i<=b;i++)
using namespace std;
bool cmp(pair<ll,ll>a,pair<ll,ll>b){
return a.f<b.f;
}
bool check(int a){
int sum=0;
while(a>0){
sum+=(a%10);
a/=10;
}
if(sum==10) return true;
return false;
}
void solve()
{
int n;
cin>>n;
string s[2];
cin>>s[0]>>s[1];
int row=0,i;
for(i=0;i<n;i++)
{
if(s[row][i]>='3')
{
if(s[row^1][i]<'3')
{
break;
}
else
{
row=row^1;
}
}
}
if(row==1 && i==n)
{
cout<<"YES"<<endl;
}
else
{
cout<<"NO"<<endl;
}
}
ll power(ll x,ll y)
{
if (y == 0)
return 1;
else if (y % 2 == 0)
return power(x, y / 2) * power(x, y / 2);
else
return x * power(x, y / 2) * power(x, y / 2);
}
int main()
{
fast;
int t=1,x;
while(t--)
{
int n,x;
cin>>n;
vector< pair<int ,int > > v;
for(int i=0;i<n;i++)
{
cin>>x;
v.push_back({x,i});
}
int pos=0,ans=0;
sort(v.begin(),v.end(),cmp);
for(auto it:v)
{
if(it.s%2!=pos%2)
{
ans++;
}
pos++;
}
cout<<ans/2<<endl;
}
time_bata;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
using pil = pair<int, ll>;
using uint = unsigned int;
template <typename T>
using Graph = vector<vector<T>>;
const int MOD = 1e9 + 7;
const ld PI = acosl(-1);
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> A(N), B(N);
map<int, int> mp;
for (int i = 0; i < N; ++i) {
cin >> A[i];
B[i] = A[i];
mp[A[i]] = i;
}
sort(B.begin(), B.end());
int cnt = 0;
vector<bool> mov(N);
for (int i = 0; i < N; ++i) {
if ((mp[B[i]] ^ i) & 1)
cnt++;
}
cout << cnt / 2 << endl;
return 0;
} | 1 | 8,365,064 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
vector<int> v(N);
for(int i=0;i<N;i++){
cin>>v.at(i);
}
sort(v.begin(),v.end());
double x=(v.at(0)+v.at(1))/2.0;
for(int i=2;i<N;i++){
x=(x+v.at(i))/2.0;
}
cout<<x<<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> l;
for (int i = 0; i < N; i++) {
int v;
cin >> v;
l.push_back(v);
}
sort(l.begin(), l.end());
long long sum = 0, tmp = 1;
sum += l[0] + l[1];
for (int i = 2; i < N; i++) {
tmp *= 2;
sum += tmp * l[i];
}
cout << (double)sum / (2.0 * tmp) << endl;
return 0;
} | 1 | 57,239,776 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define REP(i, n) for(int i = 0; i < (n); ++i)
#define REPr(i, n) for(int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for(int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for(int i = (n); i >= (m); --i)
#define MP make_pair
#define SIN(x, S) (S.count(x) != 0)
#define M0(x) memset(x, 0, sizeof(x))
#define FILL(x, y) memset(x, y, sizeof(x))
#define MM(x) memset(x, -1, sizeof(x))
#define ALL(x) (x).begin(), (x).end()
#define DB(x) cerr << #x << " = " << x << endl
#define DB2(x, y) \
cerr << "(" << #x << ", " << #y << ") = (" << x << ", " << y << ")\n";
#define DEBUG \
int x12345; \
cin >> x12345;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef long long ll;
typedef long long integer;
const long long MOD = 1e9 + 7;
template <class T> inline bool chmin(T &a, T b) {
if(a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
int main() {
vector<string> S;
vector<int> T;
int N;
cin >> N;
REP(i,N){
string s;
int t;
cin >> s >> t;
S.push_back(s);
T.push_back(t);
}
string X; cin >> X;
int ans = 0;
REP(i,N){
if (X == S[i]){
for (size_t k = i + 1; k < N; k++) {
ans += T[k];
}
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#include <regex>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
#define PI 3.14159265358979323846264338327950L
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define Z class
#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 w_ = 0; w_ < n; ++w_) \
{ \
MACRO_VEC_ROW_Scan(w_, __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 &w : R) \
std::cin >> w;
template <typename T>
void MACRO_OUT(const T t) { std::cout << t; }
#define OUT(...) MACRO_OUT(__VA_ARGS__);
#define SP std::cout << " ";
#define TAB std::cout << "\t";
#define BR std::cout << "\n";
#define ENDL std::cout << std::endl;
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define isYES(x) printf("%s\n", (x) ? "YES" : "NO")
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define yes() printf("yes\n")
#define no() printf("no\n")
#define ln cout << '\n'
template <Z A>
void pr(A a)
{
cout << a;
ln;
}
template <Z A, Z B>
void pr(A a, B b)
{
cout << a << ' ' << b << endl;
}
template <typename T>
T square(T x) { return x * x; }
ll gcd(ll a, ll b)
{
while (b)
{
ll c = b;
b = a % b;
a = c;
}
return a;
}
ll lcm(ll a, ll b)
{
if (!a || !b)
return 0;
return a * b / gcd(a, b);
}
#define chmax(x, y) (x = max(x, y))
#define chmin(x, y) (x = min(x, y))
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repe(i, n) for (ll i = 0; i <= (n); i++)
#define repd(i, n) for (ll i = n; i > 0; i--)
#define repde(i, n) for (ll i = n; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i < (b); i++)
#define FORE(i, a, b) for (ll i = a; i <= (b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (b); i--)
#define FORA(i, I) for (const auto &i : I)
#define ALL(x) x.begin(), x.end()
#define ALLR(x) x.end(), x.begin()
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<vi> vvi;
typedef vector<ll> vl;
#define ERASE(x) x.erase(unique(ALL(x)), x.end());
#define sz(x) (int)(x).size()
bool yes = 0;
bool boo = 0;
double mx = -100000;
int mn = 1001001001;
int sum = 0;
ll ans = 0;
int co = 0;
int abc[26];
bool OK = false;
int main()
{
VAR(int, n);
vs v(n);
vi x(n);
rep(i, n)
{
cin >> v[i];
cin >> x[i];
sum += x[i];
}
VAR(string, s);
rep(i, n)
{
ans += x[i];
if (v[i] == s)
{
break;
}
}
pr(sum - ans);
} | 1 | 50,633,135 |
#include <iostream>
#include <string>
#include <algorithm>
using i64 = long long;
int main() {
std::string s;
std::cin >> s;
std::cout << (std::find(s.begin(), s.end(), '7') != s.end() ? "Yes\n" : "No\n");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
char S[4];
int s=0;
cin>>S;
for(int i=0;i<3;i++){
if(S[i]=='7'){printf("Yes\n");return 0;}
}
printf("No\n");
} | 1 | 80,782,422 |
#include <iostream>
#include <algorithm>
using namespace std;
#define MAX 100000
long long a[MAX+1];
void solve() {
int n;
long long ai, bi, k, cnt;
cin >> n >> k;
cnt = 0;
for (int i=0; i<n; ++i) {
cin >> ai >> bi;
a[ai] += bi;
}
for (int i =1 ; i <= MAX; ++i) {
cnt += a[i];
if (cnt >= k) {
cout << i;
return;
}
}
}
int main() {
solve();
return 0;
} | #include<bits/stdc++.h>
using namespace std;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i : x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#define fo(i, n) for(int i=0; i<n; i++)
#define Fo(i, k, n) for(int i=k; i<n; i++)
#define w(x) int x; cin>>x; while(x--)
#define watch(x) cout << (#x) << " is " << (x) << "\n"
#define watch2(x,y) cout <<(#x)<<" is "<<(x)<<" and "<<(#y)<<" is "<<(y)<<"\n"
#define watch3(x,y,z) cout <<(#x)<<" is "<<(x)<<" and "<<(#y)<<" is "<<(y)<<" and "<<(#z)<<" is "<<(z)<<"\n"
#define watch4(x,y,z,q) cout <<(#x)<<" is "<<(x)<<" and "<<(#y)<<" is "<<(y)<<" and "<<(#z)<<" is "<<(z)<<" and "<<(#q)<<" is "<<(q)<<"\n"
#define MOD 1000000007
#define INF 1000000007;
#define F first
#define S second
#define pb(x) push_back(x);
#define ll long long
#define all(c) (c).begin(),(c).end()
#define endl "\n"
typedef vector<int> vl;
typedef vector< vl > vvl;
typedef pair< int, int> pll;
typedef map< int, int> mll;
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
void c_p_c()
{
#ifndef ONLINE_JUDGE
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
void parray(int a[], int n) {
for (int i = 0; i < n; i++) {
cout << a[i] << " ";
}
cout << endl;
}
int main() {
ll i, n, m, k, c = 0, sum = 0;
c_p_c();
ll no;
cin >> n >> m;
vector<pair<ll,ll>> v;
for (int i = 0; i < n; ++i)
{
ll a,b;
cin>>a>>b;
v.pb(make_pair(a,b));
}
sort(all(v));
for (int i = 1; i < n; ++i)
{
v[i].S+=v[i-1].S;
}
for (int i = 0; i < n; ++i)
{
if(v[i].S>=m)
{
cout<<v[i].F<<endl;
return 0;
}
}
return 0;
} | 1 | 44,324,081 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=1e5+5;
int a[N][3];
int dp[N][4];
int n;
int func(int index,int last){
if(index==n) return 0;
if(dp[index][last]!=-1) return dp[index][last];
int ans=0;
for(int k=0;k<3;k++){
if(k==last) continue;
ans=max(ans,a[index][k]+func(index+1,k));
}
return dp[index][last]=ans;
}
main(){
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
ios_base::sync_with_stdio(false);cin.tie(NULL);
cin>>n;
for(int i=0;i<n;i++){
for(int j=0;j<3;j++)
cin>>a[i][j];
}
memset(dp,-1,sizeof(dp));
cout<<func(0,3)<<"\n";
} | #include<bits/stdc++.h>
using namespace std;
const int N = 1e5+5;
int n , a , b , c , dp[N][3];
int main(){
cin >> n;
cin >> dp[0][0] >> dp[0][1] >> dp[0][2];
for(int i = 1 ; i < n ; i++){
cin >> a >> b >> c;
dp[i][0] = a+max(dp[i-1][1],dp[i-1][2]);
dp[i][1] = b+max(dp[i-1][0],dp[i-1][2]);
dp[i][2] = c+max(dp[i-1][1],dp[i-1][0]);
}
cout << max(dp[n-1][0],max(dp[n-1][1],dp[n-1][2])) << "\n";
} | 1 | 44,438,748 |
#include <stack>
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <cmath>
#include <array>
#include <iomanip>
#include <string>
#include <limits>
using namespace std;
int gcd(int a, int b)
{
if (a%b == 0)
{
return(b);
}
else
{
return(gcd(b, a%b));
}
}
int mod = 1000000000 + 7;
vector<int> v;
class Calc
{
long long a;
public:
void decompositPrime(long long a);
};
void Calc::decompositPrime(long long n)
{
a = 2;
while (n >= a * a) {
if (n % a == 0) {
v.push_back(a);
n /= a;
} else {
a++;
}
}
v.push_back(n);
}
vector<int> divisor(int n) {
vector<int> ret;
for (int i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n) ret.push_back(n / i);
}
}
std::sort(ret.begin(), ret.end());
return ret;
}
long nc2(long n){
return n*(n-1)/2;
}
int main(){
int n;
cin >> n;
long tot = 0;
vector<int> a(n);
vector<long> cnt(n, 0);
for(int i = 0; i < n; i++){
cin >> a[i];
a[i] --;
cnt[a[i]] ++;
}
for(int i = 0; i < n; i++){
tot += nc2(cnt[i]);
}
for(int i = 0; i < n; i++){
long ans = tot;
ans -= nc2(cnt[a[i]]);
ans += nc2(cnt[a[i]]-1);
cout << ans << endl;
}
return 0;
} | #include<iostream>
using namespace std;
#define MAX_N 200010
int main() {
long long n, a[MAX_N];
long long dic[MAX_N]= {};
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
dic[a[i]]++;
}
long long sum = 0;
for (int i = 1; i <= n; i++) {
sum += dic[i] * (dic[i] - 1) / 2;
}
for (int i = 0; i < n; i++) {
if (dic[a[i]] > 1) cout << sum - dic[a[i]] + 1 << endl;
else cout << sum << endl;
}
} | 1 | 92,156,873 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define REP(i, a, b) for(ll i = a; i <= b; i++)
#define out(x) std::cout << x << '\n'
#define all(a) a.begin(), a.end()
#define pb push_back
#define sz(x) ((int)(x).size())
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { ll g = gcd(a, b); return a / g * b; }
const int dx[4] = { 1, 0, -1, 0 };
const int dy[4] = { 0, 1, 0, -1 };
const int INF = (int)1e9;
const ll inf = (ll)1e18;
const int mod = 1000000007;
const int MAX_N = 100010;
const double PI = acos(-1);
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
int n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
vector<ll> s(n + 1, 0);
map<ll, ll> num;
for (int i = 0; i < n; i++) {
s[i + 1] = s[i] + a[i];
}
for (int i = 0; i < n + 1; i++) {
num[s[i]]++;
}
ll res = 0;
for (auto it : num) {
ll num = it.second;
res += num * (num - 1) / 2;
}
out(res);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
long long n , x[300000] , previx[300000] , ans;
map<long long , int>pos;
int main(){
cin >> n;
pos[0]++;
for(int i = 1 ; i <= n ; i++){
cin >> x[i];
previx[i] = x[i] + previx[i - 1];
pos[previx[i]]++;
if(pos[previx[i]] > 1){
ans += pos[previx[i]] - 1;
}
}
cout << ans << endl;
} | 1 | 36,842,836 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s,t;
int f=0;
cin>>s>>t;
for(int i=0;i<s.size();i++)
{
char h=s.at(s.size()-1);
for(int j=s.size()-1;j>=1;j--)
{
s.at(j)=s.at(j-1);
}
s.at(0)=h;
if(s==t)
{
f=1;
break;
}
}
if(f==1)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPLL(i, n) for (ll i = 0; i < (ll)(n); i++)
using namespace std;
template<class T>inline bool chmax(T &a, const T &b){if(a < b){a = b; return 1;}return 0;}
template<class T>inline bool chmin(T &a, const T &b){if(a > b){a = b; return 1;}return 0;}
typedef long long ll;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
string S, T; cin >> S >> T;
int n = S.size();
REP(i, n){
string tmp;
tmp = S.substr(i, n-i) + S.substr(0, i);
if(T == tmp){
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
} | 1 | 44,899,288 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base :: sync_with_stdio(0);
cin.tie(0);
int i, a, b;
cin >> a >> b;
if(a<b){
for(i=1; i<=b; i++){
cout << a;
}
cout << endl;
}
else{
for(i=1; i<=a; i++){
cout << b;
}
cout << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define infll 0x3f3f3f3f3f3f3f3f
#define all(x) (x).begin(),(x).end()
#define forn(i, a, b) for (int i=a; i<(signed)(b); ++i)
#define pb push_back
#define debug(x) cerr<< #x <<" : "<< x << endl;
#define debuga(A,N) cerr<< #A <<" : [";for(int i = 0; i<N;i++) cerr<<A[i]<<" "; cerr<<"]\n";
#define debuga2(A,N,M) cerr<< #A << " : \n"; for(int i=0;i<N;i++){cerr<<"[";for(int j=0;j<M;++j) cerr<<A[i][j]<<" ";cerr<<"]\n";}
#define debugp(p) cerr<< #p <<" : "<<"("<<(p).first<<","<<(p).second<<")\n";
#define debugv(v) cerr<< #v <<" : "<<"[";for(int i = 0; i< (v).size(); i++) cerr<<v[i]<<" "; cerr<<"]\n";
#define debugv2(v) cerr<< #v << " : \n"; for(int i=0;i<v.size();i++){cerr<<"[";for(int j=0;j<(v[0].size());++j) cerr<<v[i][j]<<" ";cerr<<"]\n";}
#define debugs(m) cerr<< #m <<" : [ "; for(auto itr = m.begin(); itr!=m.end();itr++) cerr<<*itr<<" "; cerr<<"]\n";
#define debugm(m) cerr<< #m <<" : [ "; for(auto itr = m.begin();itr!=m.end(); itr++) cerr<<"("<<itr->first<<","<<itr->second<<") ";cerr<<"]\n";
void solve(){
int a,b; cin >> a >> b;
if(b > a) swap(a,b);
forn(i,0,a) cout << b;
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
solve();
return 0;
} | 1 | 88,608,011 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <time.h>
#define int long long
#define endl '\n'
#define INF 1000000000000000000
#define EPS 1e-10
#define PI 3.141592653589793238
#define all(a) a.begin(),a.end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define double long double
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<P, ll> PP;
typedef complex<double> com;
template<class T, class S> bool chmax(T &a, const S &b) { if (a < b) { a = b; return 1; } return 0; }
template<class T, class S> bool chmin(T &a, const S &b) { if (a > b) { a = b; return 1; } return 0; }
ll gcd(ll n, ll m) { return (m ? gcd(m, n%m) : n); }
ll lcm(ll n, ll m) { return n / gcd(n, m)*m; }
vector<vector<int>> graph(100010, vector<int>());
vector<int> cnt(100010), deg(100010);
bool ans = true;
int dfs(int n, int p) {
int sum = 0;
int mx = 0;
int check = 0;
for (int i : graph[n]) {
if (i == p) continue;
check++;
int d = dfs(i, n);
sum += d;
chmax(mx, d);
}
if (check == 0) return cnt[n];
if (check == 1 && sum != cnt[n] || sum < cnt[n] || sum > 2 * cnt[n] || mx > cnt[n]) ans = false;
return 2 * cnt[n] - sum;
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
int n;
cin >> n;
rep(i, n) cin >> cnt[i];
rep(i, n - 1) {
int a, b;
cin >> a >> b;
a--; b--;
graph[a].pb(b);
graph[b].pb(a);
deg[a]++; deg[b]++;
}
int d = INF; int p = -1;
rep(i, n) if (deg[i] == 1) p = i;
if (dfs(p, -1) != cnt[p]) ans = false;
cout << (ans ? "YES" : "NO") << endl;
} | #include <bits/stdc++.h>
template <typename T> inline void rd(T& x) {
int si = 1; char c = getchar(); x = 0;
while(!isdigit(c)) si = c == '-' ? -1 : si, c = getchar();
while(isdigit(c)) x = x * 10 + c - 48, c = getchar();
x *= si;
}
template <typename T, typename... Args>
inline void rd(T& x, Args&... args) { rd(x); rd(args...); }
#define fi first
#define se second
typedef long long ll;
typedef double ff;
typedef std::pair<int, int> pii;
const int kN = 1e5 + 5;
int a[kN], dg[kN], fa[kN]; ll f[kN]; std::vector <int> E[kN];
void Dfs(int cur) {
if(dg[cur] == 1) return;
ll s = 0, mx = 0;
for(auto x : E[cur])
if(x != fa[cur]) {
fa[x] = cur; Dfs(x); s += f[x];
mx = std::max(mx, f[x]);
}
f[cur] = 2 * a[cur] - s;
if(f[cur] < 0 || f[cur] > a[cur] || mx > a[cur]) {
printf("NO"); exit(0);
}
}
int main() {
int n; rd(n);
for(int i = 1; i <= n; ++i) rd(a[i]);
if(n == 2) { printf(a[1] == a[2] ? "YES" : "NO"); return 0; }
for(int i = 1; i < n; ++i) {
int u, v; rd(u, v);
E[v].push_back(u);
E[u].push_back(v);
++dg[u]; ++dg[v];
}
int rt;
for(int i = 1; i <= n; ++i) {
if(dg[i] != 1) rt = i;
else f[i] = a[i];
}
Dfs(rt);
printf(!f[rt] ? "YES" : "NO");
return 0;
} | 1 | 97,133,469 |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<queue>
using namespace std;
#define MAX 10000
#define TOSEC(h,m,s) ((h)*3600+(m)*60+(s))
struct Train{
int st;
int ed;
bool operator<(const Train &t)const{
return ed > t.ed;
}
};
bool CompTrainForSort(const Train &a, const Train &b){
return a.st < b.st;
}
int main(){
while(true){
Train vt[MAX];
unsigned int ans = 0;
int n;
priority_queue< Train > pq;
scanf("%d", &n);
if( n == 0 ) break;
for(int i = 0; i < n; ++i){
int sh,sm,ss;
int eh,em,es;
Train t;
scanf("%02d:%02d:%02d %02d:%02d:%02d",
&sh,&sm,&ss,
&eh,&em,&es);
t.st = TOSEC(sh,sm,ss);
t.ed = TOSEC(eh,em,es);
vt[i] = t;
}
sort( vt, vt + n, CompTrainForSort );
for(int i = 0; i < n; ++i){
if( pq.size() == 0 )
pq.push( vt[i] );
else{
Train tt = pq.top();
if( tt.ed <= vt[i].st ){
pq.pop();
pq.push( vt[i] );
}else{
pq.push( vt[i] );
}
}
ans = max(ans, pq.size());
}
printf("%d\n", ans);
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main() {
while(1){
int n;
cin >> n;
if(n==0) break;
vector<int> s(n),g(n);
vector<int> m(86400);
for(int i=0; i<n; i++){
string a,b;
cin >> a >> b;
s.at(i)=stoi(a.substr(0,2))*3600+stoi(a.substr(3,2))*60+stoi(a.substr(6,2));
g.at(i)=stoi(b.substr(0,2))*3600+stoi(b.substr(3,2))*60+stoi(b.substr(6,2));
m.at(s.at(i))++;
m.at(g.at(i))--;
}
int ans{}, cnt{};
for(int i=0; i<86400; i++){
cnt += m.at(i);
ans = max (ans, cnt);
}
cout << ans << endl;
}
} | 1 | 65,901,636 |
#include<bits/stdc++.h>
using namespace std;
const int INF = 1 << 30;
int main(){
int s,t,n,m;
cin>>n>>m;
vector<vector<int> > lis(n+1000);
list<int> out;
vector<bool> V(n+1000,false);
for(int i=0;i<m;i++){
cin>>s>>t;
lis[s].push_back(t);
}
vector<int> indeg(n+1000,0);
for(int u=0;u<n;u++){
for(int i=0;i<lis[u].size();i++){
int v=lis[u][i];
indeg[v]++;
}
}
for(int u=0;u<n;u++){
if(indeg[u]==0 && !V[u]){
queue<int> que;
que.push(u);
V[u]=true;
while(!que.empty()){
int u=que.front(); que.pop();
out.push_back(u);
for(int i=0;i<lis[u].size();i++){
int v=lis[u][i];
indeg[v]--;
if(indeg[v]==0 && !V[v]){
V[v]=true;
que.push(v);
}
}
}
}
}
for(auto it=out.begin();it!=out.end();it++){
cout<<*it<<'\n';
}
return(0);
} | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<cstdio>
#include<sstream>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#define all(in) in.begin(),in.end()
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef pair<int,pii> pip;
typedef vector<pip>vip;
const double PI=acos(-1);
const double EPS=1e-8;
const int inf=1e8;
class TOPO{
public:
vvi G;
vi out;
vector<bool>V;
vi indeg;
int n;
TOPO(int size){
n=size;
G=vvi(n);
out=vi(0);
V=vector<bool>(n);
indeg=vi(n);
}
void add_edge(int s,int t){
G[s].pb(t);
}
void bfs(int s){
queue<int>q;
q.push(s);
V[s]=true;
while(!q.empty()){
int u=q.front();q.pop();
out.pb(u);
rep(i,G[u].size()){
int v=G[u][i];
indeg[v]--;
if(indeg[v]==0&&!V[v]){
V[v]=true;
q.push(v);
}
}
}
}
void tsort(){
rep(i,n)indeg[i]=0;
rep(i,n)rep(j,G[i].size()){
int v=G[i][j];
indeg[v]++;
}
rep(i,n)if(indeg[i]==0&&!V[i])bfs(i);
}
};
int main(){
int n,m;
cin>>n>>m;
TOPO topo(n);
while(m--){
int a,b;
cin>>a>>b;
topo.add_edge(a,b);
}
topo.tsort();
rep(i,n)cout<<topo.out[i]<<endl;
} | 1 | 71,509,523 |
#include<bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
#define FOR(i,a,b) for (int i = a; i < b; ++i)
#define FORR(i,a,b) for (int i = b - 1; i >= a; --i)
#define REP(i,n) FOR(i,0,n)
#define REPR(i,n) FORR(i,0,n)
int main() {
int N, M, X;
cin >> N >> M >> X;
vector<int> C(N);
vector<vector<int>> A(N, vector<int>(M));
REP(i, N) {
cin >> C[i];
REP(j, M) cin >> A[i][j];
}
vector<int> U(M);
REP(i, N) {
REP(j, M) {
U[j] += A[i][j];
}
}
bool check = true;
REP(i, M) {
if (U[i] < X) check = false;
}
if (!check) {
cout << "-1" << endl;
return 0;
}
int min_price = numeric_limits<int>::max();
REP(i, (1 << N)) {
U = vector<int>(M);
int price = 0;
REP(j, N) {
int mask = 1 << j;
if ((i & mask) > 0) {
price += C[j];
REP(k, M) U[k] += A[j][k];
}
}
check = true;
REP(j, M) {
if (U[j] < X) check = false;
}
if (check) {
min_price = min(min_price, price);
}
}
cout << min_price << endl;
return 0;
} | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;++i)
using namespace std;
using ll=long long;
constexpr ll mod=1000000007;
constexpr int inf=1000000000;
constexpr ll linf=1000000000000000000;
int main(){
int n,m,x;
cin>>n>>m>>x;
int c[n];
int a[n][m];
rep(i,n){
cin>>c[i];
rep(j,m)cin>>a[i][j];
}
ll ans=linf;
rep(i,1<<n){
ll v=0;
int sum[m]={};
rep(j,n){
if(i&(1<<j)){
v+=c[j];
rep(k,m){
sum[k]+=a[j][k];
}
}
}
bool flag=true;
rep(j,m){
if(sum[j]<x)flag=false;
}
if(flag)ans=min(v,ans);
}
if(ans==linf)ans=-1;
cout<<ans<<endl;
} | 1 | 73,579,166 |
#include<stdio.h>
int main(){
int w, h, x, y, r, luas1, luas2;
scanf("%d %d %d %d %d", &w, &h, &x, &y, &r);
if(x>=w || y>=h || r>x || r>y){
printf("No\n");
}
else{
printf("Yes\n");
}
} | #include <cstdio>
#include <iostream>
using namespace std;
int main()
{
int w,h,x,y,r;
cin >> w >> h >> x >> y >> r;
if (x-r>=0 && x+r<=w && y-r>=0 && y+r<=h)
cout << "Yes" << endl;
else if (x-r<=0 && x+r>=w && y-r<=0 && y+r>=h)
cout << "No" << endl;
else
cout << "No" << endl;
return 0;
} | 1 | 2,060,607 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main()
{
int n;
cin >> n;
vector<int> a(n), p(n), q(n);
rep(i, n) a[i] = i + 1;
rep(i, n) cin >> p[i];
rep(i, n) cin >> q[i];
sort(a.begin(), a.end());
int A = 0, B = 0, cnt = 0;
do
{
cnt++;
int cntA = 0, cntB = 0;
rep(i, n)
{
if (a[i] == p[i])
cntA++;
if (a[i] == q[i])
cntB++;
}
if (cntA == n)
A = cnt;
if (cntB == n)
B = cnt;
} while (next_permutation(a.begin(), a.end()));
cout << abs(A - B) << endl;
return 0;
} | #include "bits/stdc++.h"
#define rep(i,n) for(int i = 0;i<n;i++)
#define vv(Type,Name, n,m,d)vector<vector<Type>> vv(n, vector<Type>(m, d));
using namespace std;
using ll = long long;
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
int n; cin >> n;
vector<int> a(n), b(n);
rep(i, n) cin >> a[i];
rep(i, n) cin >> b[i];
int fact[10];
fact[0] = 1;
for (int i = 1; i < 10; i++) fact[i] = fact[i-1] * i;
int A = 0;
bool use[10] = {};
rep(i, n-1) {
int cnt = 0;
for (int j = 1; j < 10; j++) {
if (a[i] == j) break;
if (use[j] == false) cnt++;
}
A += fact[n - 1 - i] * cnt;
use[a[i]] = true;
}
int B = 0;
rep(i, 10) use[i] = false;
rep(i, n-1) {
int cnt = 0;
for (int j = 1; j < 10; j++) {
if (b[i] == j) break;
if (!use[j])cnt++;
}
B += fact[n - 1 - i] * cnt;
use[b[i]] = true;
}
cout << abs(A - B) << endl;
return 0;
} | 1 | 18,084,919 |
#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;
}
int main(){
ll n,k;string s;cin>>n>>k>>s;
ll cnt=0,ans=0;
vp q;
rep(i,0,n-1){
cnt++;
if(s[i]=='0'&&s[i+1]=='1'){q.push_back(make_pair(cnt,0));cnt=0;}
if(s[i]=='1'&&s[i+1]=='0'){q.push_back(make_pair(cnt,1));cnt=0;}
}
if(s[n-1]=='0'){q.push_back(make_pair(cnt+1,0));}
else q.push_back(make_pair(cnt+1,1));
ll m=q.size();vll sum(m+1,0);
rep(i,0,m){
sum[i+1]=sum[i]+q[i].first;
}
rep(i,0,m){
if(q[i].second){
ans=max(ans,sum[min(m,i+2*k+1)]-sum[i]);
}
else ans=max(ans,sum[min(m,i+2*k)]-sum[i]);
}
cout<<ans<<endl;
} | #include<iostream>
#include<iomanip>
#include<vector>
#include<map>
#include<stack>
#include<queue>
#include<string>
#include<utility>
#include<numeric>
#include<algorithm>
#include<cmath>
#include<climits>
using namespace std;
using ll = long long;
class Stream{
public:
Stream(){
}
void read(){
}
template<typename First, typename... Rest>
void read(First& first, Rest&... rest){
cin >> first;
read(rest...);
}
template<typename T>
void write_vec(vector<T>& v, char divider){
for(size_t i = 0; i < v.size(); i++){
cout << v[i] << divider;
}
}
};
struct UF{
const int node_num;
vector<int> parent;
vector<int> size;
UF(int N) : node_num(N), parent(N), size(N, 1) {
for(int i = 0; i < N; ++i) parent[i] = i;
}
int root(int x){
if(parent[x] == x) return x;
return parent[x] = root(parent[x]);
}
void unite(int x, int y){
int root_x = root(x);
int root_y = root(y);
if(root_x == root_y) return;
parent[root_y] = root_x;
size[root_x] += size[root_y];
}
bool same(int x, int y){
int root_x = root(x);
int root_y = root(y);
return root_x == root_y;
}
int same_size(int x){
int root_x = root(x);
return size[root_x];
}
};
int main(){
Stream io;
int N, K;
io.read(N, K);
string S;
io.read(S);
vector<pair<int, int>> v;
v.push_back(make_pair(1, 0));
for(int i = 0; i < S.size(); i++){
int x = S[i] - '0';
if(v.back().first == x) v.back().second++;
else v.push_back(make_pair(x, 1));
}
if(v.back().first == 0){
v.push_back(make_pair(1, 0));
}
if((v.size() - 1) / 2 <= K){
cout << S.size();
}
else{
int sum = 0;
for(int i = 0; i <= 2 * K; i++){
sum += v[i].second;
}
int ans = sum;
for(int i = 2 * K + 2; i < v.size(); i += 2){
sum += v[i - 1].second + v[i].second;
sum -= v[i - (2 * K + 2)].second + v[i - (2 * K + 1)].second;
ans = max(ans, sum);
}
cout << ans;
}
return 0;
} | 1 | 20,273,700 |
#include <bits/stdc++.h>
using namespace std;
bool dfs(string &s, int p){
if(s.size() == p)
return true;
bool r = false;
string words[] = {"dream", "dreamer", "erase", "eraser"};
for(int i=0; i<4; i++){
bool ok = true;
for(int j=0; j<words[i].size(); j++)
if(words[i][j] != s[p+j]){
ok = false;
break;
}
if(ok) r = r || dfs(s, p+words[i].size());
}
return r;
}
int main(){
string s; cin >> s;
string ans = "NO";
if(dfs(s, 0)) ans = "YES";
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
#define ll long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
static const ll MAX = 1000000000000000;
static const int NIL = -1;
using namespace std;
const long double EPS = 0.0000000001;
const long double PI = (acos(-1));
const int MOD = 1000000007;
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
int main() {
string s; cin >> s;
ll n = s.length();
while(s.length() > 0){
if(s[n-1] == 'e'){
if(n >= 5 && s.substr(n-5,n) == "erase"){
s = s.substr(0,n-5);
n = s.length();
}else{
cout << "NO";
return 0;
}
}else if(s[n-1] == 'm'){
if(n >= 5 && s.substr(n-5,n) == "dream"){
s = s.substr(0,n-5);
n = s.length();
}else{
cout << "NO";
return 0;
}
}else if(s[n-1] == 'r'){
if(n >= 7 && s.substr(n-7,n) == "dreamer"){
s = s.substr(0,n-7);
n = s.length();
}else if(n >= 6 && s.substr(n-6,n) == "eraser"){
s = s.substr(0,n-6);
n = s.length();
}else{
cout << "NO";
return 0;
}
}else{
cout << "NO";
return 0;
}
}
cout << "YES";
return 0;
} | 1 | 89,785,295 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin >> a >> b >> c;
int k=a;
string s="NO";
for(int i=0;i<b;i++){
if(k%b==c){
s="YES";
break;
}
k+=a;
}
cout << s << endl;
} | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <limits>
using namespace std;
typedef long long LL;
int main(int argc, char* argv[]){
cin.tie(0);
ios::sync_with_stdio(false);
int A, B, C;
cin >> A >> B >> C;
int q = A / B;
int r = A % B;
int possible = 0;
for(int s=0; s < B; s++){
if((r*s - C) % B == 0){
possible = 1;
break;
}
}
if(possible == 1){
printf("YES\n");
}
else{
printf("NO\n");
}
return 0;
} | 1 | 50,329,238 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define pb push_back
typedef long double ld;
#define fi first
#define se second
#define mp make_pair
ll inf = 1e18;
ll p = 1e9 + 7;
ll power(ll x, ll y, ll p)
{
ll res = 1;
x = x % p;
while (y > 0)
{
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
ll modInverse(ll n, ll p)
{
return power(n, p - 2, p);
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll i, j, y, x, z, w, g, key, l, r, n, m, t, k, d;
ll t2, t3, t4, t1;
string s;
cin >> n >> k;
ll ans = -inf;
ll p[n + 1], c[n + 1];
for (i = 1; i <= n; i++)
cin >> p[i];
for (i = 1; i <= n; i++)
cin >> c[i];
for (i = 1; i <= n; i++)
{
t1 = c[i], t2 = k - 1, t3 = c[i], t4 = i;
vector<ll>marked(n + 2, 0), val(n + 2, 0);
marked[i] = 1;
ll cur = 1;
val[cur++] = c[i];
while (t2 > 0)
{
if (marked[p[t4]] == 0)
{
t4 = p[t4];
t3 += c[t4];
t2--;
marked[t4] = cur;
val[cur++] = t3;
t1 = std::max(t1, t3);
}
else
{
ll len = marked[t4] - marked[p[t4]] + 1;
ll t6 = val[marked[t4]] - val[marked[p[t4]] - 1];
ll t5 = t2 / len;
if (t2 % len == 0)
{
t5--;
t2 = len;
}
else
t2 %= len;
t3 += t5 * t6;
t1 = std::max(t1, t3);
while (t2 > 0)
{
t4 = p[t4];
t3 += c[t4];
t1 = std::max(t1, t3);
t2--;
}
break;
}
}
ans = std::max(t1, ans);
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
# define M_PI 3.14159265358979323846
const int M=1e9+7;
long long mod(long long x){
return ((x%M + M)%M);
}
long long add(long long a, long long b){
return mod(mod(a)+mod(b));
}
vector<ll>a(5005);
vector<ll>b(5005);
vector<ll>track;
bool vis[5005];
void dfs(int u , long long total_cycle){
if(vis[u]) return ;
vis[u]=true;
total_cycle+=b[u];
track.push_back(total_cycle);
dfs(a[u],total_cycle);
}
void solve(){
int n,k;
cin>>n>>k;
for(int i=0;i<n;i++){
cin>>a[i];
a[i]--;
}
for(int i=0;i<n;i++)
cin>>b[i];
ll ans=-(1e18);
for(int i=0;i<n;i++){
memset(vis,false,sizeof(vis));
dfs(i,0);
if(track.back()>0 && k>=(int)(track.size())){
ll cycles=(ll)(k/(int)track.size());
ll left=(ll)(k%(int)track.size());
ll maxi=-1e18;
for(int x=0;x<(int)track.size();x++)
maxi=max(maxi,track[x]);
ans=max(ans,(cycles-1LL)*(track.back())+maxi);
maxi=-1e18;
for(int x=0;x<left;x++)
maxi=max(maxi,track[x]);
ans=max(ans,(cycles*track.back()) + maxi);
}
else{
for(int j=0;j<(min((int)track.size(),k));j++){
ans=max(ans,track[j]);
}
}
track.clear();
}
cout<<ans;
return;
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cout<<fixed;
cout<<setprecision(10);
int t=1;
for(int i=1;i<=t;i++){
solve();
}
return 0;
} | 1 | 41,144,898 |
#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;
const ll INF=1e18;
vector<vector<pair<int,int>>> edge(110);
vin d(110);
void dijkstra(int s){
priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> q;
fill(all(d),inf);
d[s]=0;
q.push(mp(0,s));
while(q.size()){
auto p=q.top();q.pop();
auto v=p.second;
if(d[v]<p.first)continue;
for(auto e:edge[v]){
if(d[e.first]>d[v]+e.second){
d[e.first]=d[v]+e.second;
q.push(mp(d[e.first],e.first));
}
}
}
}
int main(){
int n,m;cin>>n>>m;
int a,b,c;
rep(i,m){
cin>>a>>b>>c;
edge[a].push_back(mp(b,c));
edge[b].push_back(mp(a,c));
}
int ans=0;
rep2(i,1,n+1){
dijkstra(i);
for(auto e:edge[i]){
if(d[e.first]!=e.second)ans++;
}
}
cout<<ans/2<<endl;
} | #include <bits/stdc++.h>
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <stack>
#include <queue>
#include <cmath>
using namespace std;
const int max_n= 10000;
int n,W,L,kk,m,V,e,r,ML, MD, E, v, H;
const int INF = 1e9+1;
const int mod = 1e9 + 7;
bool used[max_n][max_n];
string s1,s2;
int x[max_n],y[max_n],table[max_n][max_n],d[max_n][max_n],ppar[max_n],rrank[max_n],spf[max_n],a[max_n],b[max_n],c[max_n];
typedef pair<long , long> pii;
vector<long long> G[max_n];
vector<int> ls;
vector<pair<int, int> > edgee[max_n];
struct edge{
int from,to,cost;
};
bool comp(const edge& e1, const edge& e2){
return e1.cost < e2.cost;
}
edge es[max_n];
typedef pair<int, int> P;
struct Cmp{
bool operator()(const pii &a,const pii &b){
return a.second > b.second;
}
};
void warshall_floyd(){
for(int k=0 ; k<n ; k++){
for(int i=0 ; i<n ; i++){
for(int j=0 ; j<n ; j++){
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
}
}
}
}
void solve(){
warshall_floyd();
long long count = 0;
for(int i=0 ; i<m ; i++){
if(c[i] > d[a[i]][b[i]]) count++;
}
cout << count << endl;
}
int main(){
cin >> n >> m;
for(int i=0 ; i<n ; i++){
for(int j=0 ; j<n ; j++){
d[i][j] = INF;
if(i == j) d[i][j] = 0;
}
}
for(int i=0 ; i<m ; i++){
cin >> a[i] >> b[i] >> c[i];
--a[i]; --b[i];
d[a[i]][b[i]] = d[b[i]][a[i]] = c[i];
}
solve();
return 0;
} | 1 | 15,243,822 |
#include<iostream>
int main()
{
int k,s,x,y,z,ans=0;
std::cin>>k>>s;
for(x=0;x<=k;x++){
for(y=0;y<=k;y++){
for(z=0;z<=k;z++){
if(x+y+z==s)ans++;
}
}
}
std::cout<<ans<<std::endl;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
using namespace std;
void darts();
void longest_dis();
void sum_of_three_integers();
int main()
{
sum_of_three_integers();
}
void darts()
{
while (true)
{
int n, m;
cin >> n >> m;
if (n == 0) break;
vector<int> p(n);
for (int i = 0; i < n; ++i) cin >> p[i];
vector<int> q = p;
q.push_back(0);
for (int i = 0; i < n; ++i)
{
for (int j = 0; j <= i; ++j)
{
q.push_back(p[i] + p[j]);
}
}
sort(q.begin(), q.end());
int ret = 0;
int j = q.size() - 1;
for (int i = 0; i < q.size(); ++i)
{
if (q[i] > m) break;
while (q[i] + q[j] > m) --j;
ret = max(ret, q[i] + q[j]);
}
cout << ret << "\n";
}
}
void longest_dis()
{
int n;
cin >> n;
vector<pair<int, int>> p(n);
for (int i = 0; i < n; ++i) cin >> p[i].first >> p[i].second;
double v_max = 0.0;
for (int i = 0; i < n; ++i)
{
for (int j = 0; j < n; ++j)
{
if ((p[i].first - p[j].first) * (p[i].first - p[j].first)
+ (p[i].second - p[j].second) * (p[i].second - p[j].second)
> v_max * v_max)
{
v_max = sqrt((p[i].first - p[j].first) * (p[i].first - p[j].first)
+ (p[i].second - p[j].second) * (p[i].second - p[j].second));
}
}
}
cout << v_max << "\n";
}
void sum_of_three_integers()
{
int k, s;
cin >> k >> s;
int cnt = 0;
for (int i = 0; i <= k; ++i)
{
for (int j = 0; j <= k; ++j)
{
int m = s - i - j;
if (0 <= m && m <= k) ++cnt;
}
}
cout << cnt << "\n";
} | 1 | 76,540,947 |
#ifdef __GNUC__
#pragma GCC diagnostic ignored "-Wunused-result"
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <sstream>
#include <numeric>
#include <map>
#include <set>
#include <queue>
#include <vector>
using namespace std;
typedef long long LL;
struct UnionFind {
std::vector<int> _parent;
std::vector<int> _size;
UnionFind(int size) : _parent(size, -1), _size(size, 1) { }
void unite(int a, int b) {
int ra = root(a), rb = root(b); if (ra == rb) { return; }
if (_size[ra] >= _size[rb]) { _parent[rb] = ra, _size[ra] += _size[rb]; } else { _parent[ra] = rb, _size[rb] += _size[ra]; }
}
int root(int a) {
int p = _parent[a];
if (p < 0) { return a; }
while (_parent[p] >= 0) { p = _parent[p]; }
return _parent[a] = p;
}
int size(int a) { return _size[root(a)]; }
};
void solve(long long N, long long Q, std::vector<long long> &t, std::vector<long long> &u, std::vector<long long> &v) {
UnionFind uf(N);
for (LL i = 0; i < Q; ++i) {
if (t[i] == 0) {
uf.unite(u[i], v[i]);
} else {
cout << (uf.root(u[i]) == uf.root(v[i])) << endl;
}
}
}
int main() {
long long N;
std::cin >> N;
long long Q;
std::cin >> Q;
std::vector<long long> t(Q);
std::vector<long long> u(Q);
std::vector<long long> v(Q);
for (int i = 0; i < Q; i++) {
std::cin >> t[i];
std::cin >> u[i];
std::cin >> v[i];
}
solve(N, Q, t, u, v);
return 0;
} | #include <bits/stdc++.h>
#include <atcoder/dsu.hpp>
using namespace std;
using namespace atcoder;
void solve(long long N, long long Q, std::vector<long long> t, std::vector<long long> u, std::vector<long long> v){
dsu d(N);
for (int i = 0; i < Q; i++) {
if (t[i] == 0) {
d.merge(u[i], v[i]);
} else {
cout << d.same(u[i], v[i]) << endl;
}
}
}
int main(){
long long N;
scanf("%lld",&N);
long long Q;
scanf("%lld",&Q);
std::vector<long long> t(Q);
std::vector<long long> u(Q);
std::vector<long long> v(Q);
for(int i = 0 ; i < Q ; i++){
scanf("%lld",&t[i]);
scanf("%lld",&u[i]);
scanf("%lld",&v[i]);
}
solve(N, Q, std::move(t), std::move(u), std::move(v));
return 0;
} | 1 | 6,481,820 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int divisors(int n)
{
int ret = 0;
for (int i = 1; i * i <= n; ++i)
{
if (n % i == 0)
{
ret++;
if (n / i != i)
ret++;
}
}
return ret;
}
int main()
{
int n;
cin >> n;
int ans = 0;
rep (i, n + 1)
if (divisors(i) == 8 && i % 2 == 1)
ans++;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
const int inf = 1001001001;
int main(){
int n;
cin >> n;
int ans = 0;
rep(i,n+1){
int j = 0;
int cnt = 0;
while(j < n){
j++;
if(j%2 == 0) continue;
if(i%j == 0) cnt++;
}
if(cnt == 8) ans++;
}
cout << ans << endl;
} | 1 | 67,857,192 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
#endif
ll n,k;
cin>>n>>k;
ll hun=500;
if(n*hun>=k)
{
cout<<"Yes"<<endl;
}
else
{
cout<<"No"<<endl;
}
return 0;
} | #include<cstdio>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
int main(){
int K,X;
cin>>K>>X;
if(X<=500*K)cout<<"Yes"<<endl;
else cout<<"No"<<endl;
return 0;
} | 1 | 25,750,709 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
int main() {
ll a, b, k;
cin >> a >> b >> k;
if(a >= k) cout << a-k << " " << b << endl;
else if(a + b <= k) cout << "0 0" << endl;
else cout << "0 " << b - (k - a) << endl;
return 0;
} | #include<bits/stdc++.h>
#define ios ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define int unsigned long long
#define endl "\n"
using namespace std;
int32_t main() {
ios;
int t = 1;
while(t--) {
int a,b,k;
cin>>a>>b>>k;
if(k <= a) {
a-=k;
} else {
k-=a;
a = 0;
if(k <= b)
b-=k;
else
b = 0;
}
cout<<a<<" "<<b;
cout<<endl;
}
return 0;
} | 1 | 60,189,429 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, K;
cin >> N >> K;
double ans = (N - K + 1)*(N - K + 1 > 0);
for(int i = 1; i < min(N + 1, K); i++) {
for(int j = 0; j < 30; j++) {
if(i*(ll)pow(2, j) >= (ll)K) {
ans += pow(2, -1*j);
break;
}
}
}
cout << fixed << setprecision(15) << (double)ans/(double)N << endl;
return 0;
} | #include <bits/stdc++.h>
#include <string>
#include <cstring>
#include <algorithm>
#include <math.h>
#include <map>
#include <bitset>
#include <cmath>
#include <set>
#include <utility>
#include <sstream>
#define INF 1000000000000
#define MOD 1000000007
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define ALL(x) x.begin(),x.end()
#define chmax(x,y) (x = max(x,y))
#define chmin(x,y) (x = min(x,y))
int main(){
ll N,K;
cin >> N >> K;
ll kensa = 1;
for(int i = 0;i < 20;i++)
kensa *= 2;
double goukei = 0.0;
for(ll i = 1;i <= N;i++){
int res = 0;
ll hako = i;
while(hako < K){
hako *= 2;
res++;
}
double keisan = 1;
for(int j = 0;j < res;j++){
keisan /= 2.0;
}
goukei += keisan / (double)N;
}
printf("%.12f\n",goukei);
} | 1 | 20,422,767 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define FOR(i,a,b) for(int i=(a); i<=(b); i++)
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define chmin(a,b) if((a)>(b)) (a)=(b);
#define chmax(a,b) if((a)<(b)) (a)=(b);
#define vi vector<int>
#define pii pair<int,int>
#define all(v) (v).begin(),(v).end()
#define allr(v) (v).rbegin(),(v).rend()
#define pb push_back
#define pf push_front
int gcd(int a,int b){
while(min(a,b)>0){if(a<b)swap(a,b);a%=b;}return max(a,b);
}
int dx[]={1,0,-1,0,1,-1,-1,1};
int dy[]={0,1,0,-1,1,1,-1,-1};
const int MOD = 1e9+7;
const long long INF = 1e18+10;
int modpow(int x,int n){
int res=1;
while(n>0){
if(n&1) res=(res*x)%MOD;
x=(x*x)%MOD;
n>>=1;
}
return res;
}
int ncr(int n,int r){
int res=1,fact=1;
FOR(i,1,r) fact=(fact*i)%MOD;
rep(i,r) res=(res*(n-i))%MOD;
res=(res*modpow(fact,MOD-2))%MOD;
return res;
}
signed main(){
int x,y;
cin>>x>>y;
if((x+y)%3!=0){
cout<<0<<endl;
return 0;
}
if(max(x,y)>2*min(x,y)){
cout<<0<<endl;
return 0;
}
int tot=(x+y)/3;
int a=y-tot;
cout<<ncr(tot,a)<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,ini,n) for(int i=ini;i<n;i++)
#define _rep(i,ini,n) for(int i=ini;i>=n;i--)
#define ToEnd(a) a.begin(),a.end()
uint64_t MOD=1000000007;
int64_t FastPow(int64_t n, int64_t m){
if(m==0) return 1;
if(m==1) return n;
int64_t v=FastPow(n,m/2);
v*=v;
v%=MOD;
if(m%2){
v*=n;
v%=MOD;
}
return v;
}
int64_t RevS(int64_t n){
return FastPow(n,MOD-2);
}
int64_t Factorical(int64_t n, int64_t m){
int64_t v=1;
_rep(i,n,n-m+1){
v*=i;
v%=MOD;
}
return v;
}
int main(){
int X,Y; cin>>X>>Y;
int64_t a,b;
if(2*X-Y>=0 && (2*X-Y)%3==0) a=(2*X-Y)/3;
else a=-1;
if(2*Y-X>=0 && (2*Y-X)%3==0) b=(2*Y-X)/3;
else b=-1;
if(a<0 || b<0){
cout<<0<<endl;
return 0;
}
int64_t ans=(Factorical(a+b,a+b-max(a,b))*RevS(Factorical(min(a,b),min(a,b))))%MOD;
cout<<ans<<endl;
} | 1 | 74,299,979 |
#include <stdio.h>
#include <string.h>
typedef long long ll;
int main(void) {
ll i, j, k, ans = 0, now = 0, cnt = 0;
char s[500010];
scanf("%s", s);
ll a[strlen(s) + 1];
for(i = 0; s[i]; ++i) if(s[i] == '<') {
if(!i || s[i - 1] == '>') a[i] = 0;
a[i + 1] = a[i] + 1;
}
for(--i; i >= 0; --i) if(s[i] == '>') {
if(!s[i + 1] || s[i + 1] == '<') a[i + 1] = 0;
if(!i || s[i - 1] == '>' || a[i] < a[i + 1] + 1) a[i] = a[i + 1] + 1;
}
for(i = 0; s[i]; ++i) ans += a[i];
ans += a[i];
printf("%lld", ans);
return 0;
} | #include<bits/stdc++.h>
#define ll long long
#define MAX 1000005
#define MOD (ll)(1e9+7)
#define INF INT32_MAX
#define INFL INT64_MAX
using namespace std;
void solve() {
string s;
cin >> s;
int n = s.size();
ll a[n+1];
memset(a,-1,sizeof(a));
for(int i=0; i<n; i++) {
if(i==0 && s[i]=='<') a[i]=0;
else {
if(s[i]=='<' && s[i-1]=='>') a[i]=0;
if(s[i]=='<' && s[i-1]=='<') a[i]=a[i-1]+1;
}
}
if(s[n-1]=='<') a[n]=a[n-1]+1;
else a[n]=0;
for(int i=n-1; i>=0; i--) {
if(i-1 >=0 && s[i]=='>' && s[i-1]=='<') a[i]=max(a[i-1],a[i+1])+1;
else if(s[i]=='>') a[i]=a[i+1]+1;
}
ll ans=0;
for(int i=0; i<=n; i++) ans+=a[i];
cout << ans << endl;
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t=1;
for(int i=1; i<=t; i++) {
solve();
}
return 0;
} | 1 | 85,634,882 |
#include <iostream>
#include <string>
#include <cstring>
#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 <cmath>
#include <numeric>
#include <float.h>
#include <math.h>
#include <sstream>
#include <iterator>
using namespace std;
using Graph = vector<vector<int>>;
#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 all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define vi vector<int>
#define vl vector<ll>
const long long INF = 1LL << 60;
typedef long long ll;
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int ctoi(char c) {
switch (c) {
case '0': return 0;
case '1': return 1;
case '2': return 2;
case '3': return 3;
case '4': return 4;
case '5': return 5;
case '6': return 6;
case '7': return 7;
case '8': return 8;
case '9': return 9;
default: return 0;
}
}
bool is_prime(const unsigned n){
switch(n){
case 0:
case 1: return false;
case 2:
case 3: return true;
}
if(n % 2 == 0 || n % 3 == 0) return false;
for(unsigned i = 5; i * i <= n; i += 6) {
if(n % i == 0) return false;
if(n % (i+2) == 0) return false;
}
return true;
}
map<ll,ll> mp;
ll primeFactorization(ll a){
ll i,sq;
if(a%2==0){
if(!mp.count(2)){
mp[2] = 1;
}
else{
mp[2] +=1;
}
return primeFactorization(a/2);
}
sq = sqrt(a);
for(i=3;i<=sq;i+=2){
if(a%i==0){
if(!mp.count(i)){
mp[i] = 1;
}
else{
mp[i] += 1;
}
return primeFactorization(a/i);
}
}
if(a!=1){
if(!mp.count(a))
mp[a] = 1;
else{
mp[a] += 1;
}
}
return 0;
}
ll kaizyou(ll n){
if(n == 1){
return 1;
}
else{
return (n * kaizyou(n-1)) % 1000000007;
}
}
bool key(string s){
int x = s.size();
string t ="";
rep(i,x){
for(int j = i; j < x; j++){
t = "";
for(int k = 0; k <= i; k++) t += s[k];
for(int l = j; l < x; l++) t+= s[l];
if(t == "keyence") return true;
}
}
return false;
}
int main(){
string S; cin >> S;
if(key(S)) cout << "YES" << endl;
else cout << "NO" << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
string str;
cin >> str;
string t = "keyence";
if(str == t){
cout << "YES" << endl;
return 0;
}
int n = str.size();
for(int i = 0; i < n; i++){
for(int j = i; j < n; j++){
string S = "";
for(int k = 0; k < n; k++){
if(i <= k && k <= j) continue;
else S.push_back(str[k]);
}
if(S == t){
cout << "YES" << endl;
return 0;
}
}
}
cout << "NO" << endl;
return 0;
} | 1 | 185,600 |
#include <bits/stdc++.h>
using ll = long long;
#define mod 1000000007
#define REP(i, n) for (int i = 0; i < n; i++)
#define INF (1 << 29)
using namespace std;
void solve()
{
int n, z, w;
cin >> n >> z >> w;
int a[n];
REP(i, n) cin >> a[i];
if(n == 1) {
cout << abs(a[0] - w) << endl;
}
else{
cout << max(abs(a[n-1] - w), abs(a[n-1]-a[n-2])) << endl;
}
}
int main()
{
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
inline void Boost() {
ios::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
}
typedef long long int ll;
typedef long double ld;
int main() {
Boost();
int n, z, w;
cin >> n >> z >> w;
vector < int > v(n);
for (int i = 0; i < n; ++i) cin >> v[i];
int ans = abs(w - v[n - 1]);
if (n > 1) {
ans = max(ans, abs(v[n - 1] - v[n - 2]));
}
cout << ans;
return 0;
} | 1 | 421,709 |
#include <bits/stdc++.h>
using namespace std;
const int N=1e6;
char p[N];
int S[N],P[N],n;
int main()
{
scanf("%d",&n);
scanf("%s",p);
int i,j;
for(i=0;p[i];i++)
{
if(p[i]=='o') P[i+1]=0;
else P[i+1]=1;
}
P[n+1]=P[1];
for(i=0;i<8;i++)
{
S[0]=i&1;
S[1]=(i>>1)&1;
S[2]=(i>>2)&1;
for(j=2;j<=n+1;j++)
{
S[j+1]=S[j-2]^P[j];
}
if(S[0]^S[n]^S[1]^S[n+1] || S[1]^S[n+1]^S[2]^S[n+2]) continue;
for(j=1;j<=n;j++)
{
printf("%c",(S[j]^S[j-1])?'W':'S');
}
return 0;
}
printf("-1\n");
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;
typedef pair<int,int> pii;
typedef pair<pii,int> ppii;
typedef pair<int,pii> pipi;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> ppll;
typedef pair<ll,pll> plpl;
typedef tuple<ll,ll,ll> tl;
ll mod=1000000007;
ll mod2=998244353;
ll mod3=1000003;
ll mod4=998244853;
ll inf=1000000000000000000;
long double pi=3.14159265358979323846L;
#define rep(i,m,n) for(ll i=m;i<n;i++)
#define rrep(i,n,m) for(ll i=n;i>=m;i--)
int dh[4]={1,-1,0,0};
int dw[4]={0,0,1,-1};
int ddh[8]={-1,-1,-1,0,0,1,1,1};
int ddw[8]={-1,0,1,-1,1,-1,0,1};
ll lmax(ll a,ll b){
if(a<b)return b;
else return a;
}
ll lmin(ll a,ll b){
if(a<b)return a;
else return b;
}
ll gcd(ll a,ll b){
if(a<b)swap(a,b);
if(b==0)return a;
if(a%b==0)return b;
return gcd(b,a%b);
}
ll Pow(ll n,ll k){
ll ret=1;
ll now=n;
while(k>0){
if(k&1)ret*=now;
now*=now;
k/=2;
}
return ret;
}
ll gya[1000010];
ll kai[1000010];
ll beki(ll n,ll k,ll md){
ll ret=1;
ll now=n;
while(k>0){
if(k%2==1){
ret*=now;
ret%=md;
}
now*=now;
now%=md;
k/=2;
}
return ret;
}
ll gyaku(ll n,ll md){
return beki(n,md-2,md);
}
void nckinit(ll n,ll md){
kai[0]=1;
kai[1]=1;
for(int i=2;i<=n;i++){
kai[i]=kai[i-1]*i;
kai[i]%=md;
}
gya[n]=gyaku(kai[n],md);
for(int i=n-1;i>=1;i--){
gya[i]=gya[i+1]*(i+1);
gya[i]%=md;
}
gya[0]=1;
}
ll nck(ll n,ll k,ll md){
if(k<0)return 0;
if(k==0||n==k)return 1;
ll ret=kai[n];
ret*=gya[n-k];
ret%=md;
ret*=gya[k];
ret%=md;
return ret;
}
ll npk(ll n,ll k,ll md){
if(k<0)return 0;
if(k==0)return 1;
ll ret=kai[n];
ret*=gya[n-k];
ret%=md;
return ret;
}
int main(){
ios::sync_with_stdio(false);cin.tie(0);
int n;cin>>n;
string s;cin>>s;
char a[2]={'S','W'};
rep(i,0,2){
rep(j,0,2){
char c[n];
if(i==0)c[0]='S';
else c[0]='W';
if(j==0)c[1]='S';
else c[1]='W';
rep(k,1,n-1){
if(c[k]=='S'){
if(s[k]=='o')c[k+1]=c[k-1];
else{
if(c[k-1]=='S')c[k+1]='W';
else c[k+1]='S';
}
}
else{
if(s[k]=='x')c[k+1]=c[k-1];
else{
if(c[k-1]=='S')c[k+1]='W';
else c[k+1]='S';
}
}
}
if(c[n-1]=='S'){
if(s[n-1]=='o'){
c[0]=c[n-2];
}
else{
if(c[n-2]=='S')c[0]='W';
else c[0]='S';
}
}
else{
if(s[n-1]=='x')c[0]=c[n-2];
else{
if(c[n-2]=='S')c[0]='W';
else c[0]='S';
}
}
if(c[0]=='S'){
if(s[0]=='o'){
c[1]=c[n-1];
}
else{
if(c[n-1]=='S')c[1]='W';
else c[1]='S';
}
}
else{
if(s[0]=='x')c[1]=c[n-1];
else{
if(c[n-1]=='S')c[1]='W';
else c[1]='S';
}
}
if(c[0]==a[i]&&c[1]==a[j]){
rep(k,0,n)cout<<c[k];
cout<<endl;
return 0;
}
}
}
cout<<-1<<endl;
} | 1 | 41,974,346 |
#include<bits/stdc++.h>
#define ll long long
#define FI freopen("input.txt","r",stdin)
#define FO freopen("output.txt","w",stdout)
#define PrintCase(i) printf("Case %d: ",i)
#define sc(a) scanf("%d",&a)
#define scl(a) scanf("%lld",&a)
#define rep(i,n) for(int i=0;i<n;i++)
#define pb push_back
#define MAX 1000000
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
using namespace std;
bool isPrime(ll a)
{
for(ll i=2;i*i<=a;i++)
if(a%i==0)
return false;
return true;
}
bool isPowerOfTwo(ll a)
{
if(a==1)
return true;
if(a&1)
return false;
while(a)
{
a/=2;
if(a!=1 && a&1)
return false;
if(a==1)
return true;
}
return true;
}
ll gcd(ll a, ll b)
{
if(a<0 || b<0)
{
a = abs(a);
b = abs(b);
}
if(a<b)
swap(a,b);
if(a%b==0 || b==0)
return b;
else
return gcd(b,a%b);
}
ll lcm(ll a, ll b)
{
return (a*b)/gcd(a,b);
}
ll power(ll base, ll exponent)
{
ll ans = 1;
for(ll i=1;i<=exponent;i++)
ans*=base;
return ans;
}
bool isPowerOfX(ll x, ll value)
{
if(value==1)
return true;
while(value)
{
value/=x;
if(value%x && value!=1)
return false;
}
return true;
}
ll X_or(ll for1, ll for2, ll value)
{
ll arr[7];
arr[3] = for1^for2;
arr[4] = arr[3]^for2;
arr[5] = arr[4]^arr[3];
cout<<arr[3]<<" "<<arr[4]<<" "<<arr[5]<<" ..... \n";
if(value%3==0)
{
return arr[3];
}
else
{
ll ret = ((value%3)==1)?arr[4] : arr[5];
return ret;
}
}
ll X_nor(ll for1, ll for2, ll value)
{
ll arr[7];
arr[3] = ~(for1^for2);
if(arr[3]<0)
arr[3]*=(-1);
arr[4] = ~(arr[3]^for2);
if(arr[4]<0)
arr[4]*=(-1);
arr[5] = ~(arr[3]^arr[4]);
if(arr[5]<0)
arr[5]*=(-1);
cout<<arr[3]<<" "<<arr[4]<<" "<<arr[5]<<" ..... \n";
if(value%3==0)
{
return arr[3];
}
else
{
ll ret = (value%3==1)? arr[4] : arr[5];
return ret;
}
}
int main()
{
int n,x;
cin>>x>>n;
vector<int>arr(n);
rep(i,n)cin>>arr[i];
int value = INT_MAX , mn = INT_MAX;
for(int i=-200;i<=110;i++)
{
if(abs(x-i)<mn && find(arr.begin(),arr.end(),i)==arr.end())
{
value = i;
mn = min(mn,abs(x-i));
}
}
cout<<value<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
#define mem(a, b) memset(a, b, sizeof(a))
#define MOD 1000000007
#define MAX (int) 1e9
#define PI 3.141592653589793238462643383279502884
template <typename T, typename U>
T max(T x, U y) {
return x > y ? x : y;
}
template <typename T, typename U>
T min(T x, U y) {
return x < y ? x : y;
}
template<typename T>
void debug(string msg, T t) {
cout << msg << ": " << t << "\n";
}
template<typename T>
T abs(T a, T b) {
return a > b ? a - b : b - a;
}
inline int toDigit(char c) { return c - '0'; }
unordered_set<int> f;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int x, n, p;
cin >> x >> n;
for(int i = 0; i < n; i++) {
cin >> p;
f.emplace(p);
}
int ans = 0;
for(int d = 0; d <= 100; d++) {
if(f.count(x - d) == 0) {
ans = x - d;
break;
} else if(f.count(x + d) == 0) {
ans = x + d;
break;
}
}
cout << ans << "\n";
return 0;
} | 1 | 43,711,756 |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<vector<int>> bingo(3,vector<int>(3));
for(int i=0;i<3;i++){
for(int j=0;j<3;j++){
cin >> bingo.at(i).at(j);
}
}
int n;
cin >> n;
vector<int> number(n);
for(int i=0;i<n;i++){
cin >> number.at(i);
}
for(int i=0;i<3;i++){
for(int j=0;j<3;j++){
for(int k=0;k<n;k++){
if( number.at(k) == bingo.at(i).at(j) ){
bingo.at(i).at(j) = 0;
}
}
}
}
bool x = true;
for(int i=0;i<3;i++){
if( bingo.at(i).at(0) == 0 && bingo.at(i).at(1) == 0 && bingo.at(i).at(2) == 0 ){
cout << "Yes" <<endl;
x = false;
break;
}
else if( bingo.at(0).at(i) == 0 && bingo.at(1).at(i) == 0 && bingo.at(2).at(i) == 0 ){
cout << "Yes" <<endl;
x = false;
break;
}
else if( bingo.at(0).at(0) == 0 && bingo.at(1).at(1) == 0 && bingo.at(2).at(2) == 0 ){
cout << "Yes" <<endl;
x = false;
break;
}
else if( bingo.at(2).at(0) == 0 && bingo.at(1).at(1) == 0 && bingo.at(0).at(2) == 0 ){
cout << "Yes" <<endl;
x = false;
break;
}
}
if(x)
cout << "No" << endl;
} | #include <bits/stdc++.h>
#define REP(i, a, b) for(int i = (int)a; i < (int)b; i++)
#define fastio ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define pb push_back
#define mp make_pair
#define st first
#define nd second
#define vi vector<int>
#define ii pair<int, int>
#define ll long long int
#define MAX 200010
#define MOD 1e9+7
#define endl '\n'
using namespace std;
int m[3][3];
int mk[3][3];
void mark(int x){
REP(i, 0, 3){
REP(j, 0, 3){
if(m[i][j] == x){
mk[i][j] = 1;
return;
}
}
}
}
int main()
{
fastio;
REP(i, 0, 3){
REP(j, 0, 3){
cin >> m[i][j];
mk[i][j] = 0;
}
}
int n;
cin >> n;
REP(i, 0, n){
int x;
cin >> x;
mark(x);
}
bool bingo = false;
REP(i, 0, 3){
int c = 0;
REP(j, 0, 3){
if(mk[i][j]) c++;
}
if(c == 3){
bingo = true;
}
}
REP(i, 0, 3){
int c = 0;
REP(j, 0, 3){
if(mk[j][i]) c++;
}
if(c == 3){
bingo = true;
}
}
int i = 0, j = 0;
int c = 0;
while(i < 3){
if(mk[i][j]) c++;
i++; j++;
}
if(c == 3) bingo = true;
i = 2; j = 0;
c = 0;
while(i >= 0){
if(mk[i][j]) c++;
i--; j++;
}
if(c == 3) bingo = true;
if(bingo){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
return 0;
} | 1 | 19,080,655 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A;
cin >> A;
cout << "Christmas";
A -= 25;
while(A<0){
cout << " Eve";
A++;
}
cout << endl;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
using P = pair<int,int>;
const int MOD = 1000000007;
int main() {
int d;
cin>>d;
if (d==22) {
cout<<"Christmas Eve Eve Eve"<<endl;
} else if(d==23) {
cout<<"Christmas Eve Eve"<<endl;
} else if(d==24) {
cout<<"Christmas Eve"<<endl;
} else {
cout<<"Christmas"<<endl;
}
} | 1 | 31,157,341 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
int main() {
ll q, h, s, d;
cin >> q >> h >> s >> d;
ll n;
cin >> n;
ll x = min({q * 8, h * 4, s * 2, d});
ll y = min({q * 4, h * 2, s});
cout << n / 2 * x + (n % 2) * y << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ios_base::sync_with_stdio(0);
unsigned long long q,h,s,d,n;
cin>>q>>h>>s>>d;
cin>>n;
unsigned long long n1 = min(s,min(2*h,min(4*q,2*q+h)));
unsigned long long n2 = min(d, 2*n1);
if(n==1){
cout<<n1<<endl;
}
else if(n==2){
cout<<n2<<endl;
}
else{
unsigned long long sum=(n/2)*n2 + (n%2)*n1;
cout<<sum<<endl;
}
return 0;
} | 1 | 18,075,264 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
int main()
{
int n, d;
cin >> n >> d;
vector<vector<int>> x(n, vector<int>(d));
rep(i, n) rep(j, d) cin >> x[i][j];
int ans = 0;
rep(i, n)
{
rep2(j, i + 1, n)
{
double res = 0;
rep(k, d)
{
res += (x[i][k] - x[j][k]) * (x[i][k] - x[j][k]);
}
res = sqrt(res);
if (res == (int)res)
{
ans++;
}
}
}
cout << ans << '\n';
return (0);
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <stack>
#include <map>
#include <tuple>
#include <cmath>
#include <cstdio>
#include <cassert>
#include <functional>
#define _LIBCPP_DEBUG 0
using namespace std;
int main(void){
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-1; i++)
{
for (int j = i+1; j < n; j++)
{
int in=0;
for (int k = 0; k < d; k++)
{
in += (x.at(i).at(k) - x.at(j).at(k)) * (x.at(i).at(k) - x.at(j).at(k));
}
for (int k = 1; k <= sqrt(in); k++)
{
if (k*k==in)
{
ans++;
}
}
}
}
cout << ans << endl;
} | 1 | 55,746,965 |
#include<stdio.h>
int main(){
int a[10000],i=0;
do{
scanf("%d",&a[i]);
}while(a[i++]!=0);
for(int b=0;b<i-1;b++){
printf("Case %d: %d\n",b+1,a[b]);
}
} | #include <iostream>
using namespace std;
int main() {
auto count = 0;
while(1) {
int a;
cin >> a;
if (a == 0) break;
cout << "Case " << ++count << ": " << a << endl;
}
} | 1 | 96,064,305 |
#include<bits/stdc++.h>
using namespace std;
using ull=unsigned long long;
#define mod 1000000007
#define mod2 998244353
#define PI 3.14159265
#define ll long long
#define ld long double
#define pi pair<ll,ll>
#define pb push_back
#define vi vector<ll>
#define sz size()
#define setbits(x) __builtin_popcount(x)
#define fi first
#define se second
#define lz length()
#define all(x) (x).begin(),(x).end()
#define scf(x) scanf("%lld",&x)
#define rep(i,n) for(ll i=0;i<n;i++)
const int INF = (int)1e9;
const ll IINF=1LL<<62;
const int maxn=10000005;
int main(){
int n,k;
cin>>n>>k;
int a[n];rep(i,n)cin>>a[i];
vector<ll> vec;
for(int i=0;i<n;i++){
ll sm=0;
for(int j=i;j<n;j++){
sm+=a[j];
vec.pb(sm);
}
}
ll cur=0;
for(int i=40;i>=0;i--){
int ct=0;
ll ncur=cur+(1LL<<i);
for(int j=0;j<vec.size();j++){
if((ncur&vec[j])==ncur)ct++;
}
if(ct>=k)cur=ncur;
}
cout<<cur;
} | #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x) cerr << #x << " = " << (x) << endl;
#define INF 2000000000
#define mod 1000000007
#define INF2 1000000000000000000
#define int long long
signed main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
int a[1010];
rep(i, N) cin >> a[i];
vector<int> v;
rep(i, N) {
int sum = 0;
REP(j, i, N - 1) {
sum += a[j];
v.push_back(sum);
}
}
int ans = 0;
RREP(i, 50, 0) {
vector<int> nx_v;
rep(j, v.size()) {
if (v[j] & (1LL << i)) nx_v.push_back(v[j]);
}
if(nx_v.size() < K) continue;
ans += (1LL << i);
v = nx_v;
}
cout << ans << endl;
return 0;
} | 1 | 49,149,694 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N;
for(int i = 0; i <= 7; i++){
if(!(N >= pow(2, i))){
cout << pow(2, i - 1) << endl;
break;
}
}
return 0;
} | #include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iostream>
#include <iostream>
#include <fstream>
#include <numeric>
#include <cstring>
#include <cassert>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <cmath>
#include <set>
#include <map>
#include <functional>
#include <bitset>
#include <iomanip>
#include <stack>
#include <list>
using namespace std;
#define ll long long
#define all(v) (v).begin() , (v).end()
#define vi vector <ll>
#define vii vector <pair<ll,ll>>
#define ii pair<ll,ll>
#define sz(v) ((int)((v).size()))
#define lp(i,a,b) for(int i=a;i<b;i++)
#define pb push_back
#define pf push_front
#define F first
#define S second
#define endl "\n"
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
const double PI = 3.14159265358979323846;
const ll inf=2e9,MOD=998244353,MAX=1e7+2;
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
IOS;
int n;
cin>>n;
int ans=0,res=1;
lp(i,1,n+1){
int x=i,cnt=0;
while(x%2==0)
cnt++,x/=2;
if(cnt>ans)
ans=cnt,res=i;
}
cout<<res;
} | 1 | 19,142,752 |
#include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef tuple<ll,ll,ll> T;
const long long INF = 1LL<<60;
const int MOD = 1000000000+7;
#define rev(s) (string((s).rbegin(), (s).rend()))
template < typename T > inline string toString( const T &a ) { ostringstream oss; oss << a; return oss.str(); };
int main() {
int N,K;cin>>N>>K;
vector<ll> v(N);
rep(i,N) cin>>v[i];
ll ans = 0;
K = min(K,2*N);
rep(i,K+1) {
for (int j = (i+1)/2;j<min(i+1,N+1);j++) {
for (int k = 0;k<j+1;k++) {
priority_queue<int,vector<int>,greater<int>> qu;
ll sum = 0;
for (int p = 0;p<k;p++) {
sum+=v[p];
qu.push(v[p]);
}
for(int p = N - 1;p>N-1-j+k;p--) {
sum+=v[p];
qu.push(v[p]);
}
rep(p,i-j) {
sum -= qu.top();
qu.pop();
}
ans = max(ans,sum);
}
}
}
cout<<ans<<endl;
} | #include <iostream>
#include <algorithm>
#include <string>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <iomanip>
#include <set>
#include <ctime>
#include <tuple>
#include <bitset>
#include <assert.h>
#include <deque>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define rep(i, n) for (ll i = 0; i < n; i++)
#define debugA cerr << "AAAAA" << endl
#define debug_ cerr << "-------------" << endl
#define debug(x) cerr << #x << ": " << x << endl
#define debug_vec(v) \
cout << #v << endl; \
for (int i = 0; i < v.size(); i++) \
{ \
cout << v[i] << " "; \
} \
cout << endl;
#define debug_vec2(v) \
cout << #v << endl; \
for (int i = 0; i < v.size(); i++) \
{ \
for (int j = 0; j < v[i].size(); j++) \
{ \
cout << v[i][j] << " "; \
} \
cout << endl; \
}
template <typename T>
bool chmax(T &a, const T &b)
{
if (a < b)
{
a = b;
return true;
}
return false;
}
template <typename T>
bool chmin(T &a, const T &b)
{
if (a > b)
{
a = b;
return true;
}
return false;
}
using Graph = vector<vector<int>>;
using P = pair<int, int>;
using P1 = pair<int, pair<int, int>>;
const ll INF = 1001001001001001001;
const double pi = acos(-1);
int main()
{
int n, k;
cin >> n >> k;
vector<int> v(n);
for (int i = 0; i < n; i++)
{
cin >> v[i];
}
ll ans = 0;
for (int i = 0; i <= n; i++)
{
for (int j = 0; j <= n; j++)
{
if (i + j > k || i + j > n)
{
break;
}
ll tmp = 0;
priority_queue<int, vector<int>, greater<int>> que;
for (int l = 0; l < i; l++)
{
tmp += v[l];
que.push(v[l]);
}
for (int l = 0; l < j; l++)
{
tmp += v[n - 1 - l];
que.push(v[n - 1 - l]);
}
for (int l = 0; l < k - i - j; l++)
{
if (que.empty())
{
break;
}
int x = que.top();
if (x >= 0)
{
break;
}
que.pop();
tmp -= x;
}
ans = max(ans, tmp);
}
}
cout << ans << endl;
return 0;
} | 1 | 62,230,072 |
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
const ll mod=1000000007;
const ll inf=1e18;
int main(){
ll n;
cin >> n;
double a[n];
for(int i=0;i<n;i++)cin >> a[i];
double s=0;
for(int i=0;i<n;i++)s+=1/a[i];
s=1/s;
printf("%.12f",s);
} | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define F first
#define S second
using namespace std;
typedef pair<int,int> P;
const int MOD=1000000007;
int INF=100100100100100;
signed main(){
int n;
long double a[110],ans;
cin>>n;
rep(i,n){
cin>>a[i];
ans+=1/a[i];
}
cout<<setprecision(15)<<1/ans<<endl;
return 0;
} | 1 | 59,286,611 |
#include <stdio.h>
int main() {
char s[11];
scanf("%s", s);
int idx = 0;
for(int i = 0; s[i] != '\0'; i++) {
if(s[i] == '0') s[idx++] = '0';
else if(s[i] == '1') s[idx++] = '1';
else if(s[i] == 'B' && idx > 0) idx--;
}
for(int i = 0; i < idx; i++) {
printf("%c", s[i]);
}
return 0;
} | #include<stdio.h>
#include<string.h>
int main(){
char s[20];
scanf("%s", s);
int dex = 0;
char arr[11] = {'\0'};
int l = strlen(s);
for(int i = 0; i < l;i++){
if(s[i] == '0'){
arr[dex] = '0';
dex++;
}
else if (s[i] == '1'){
arr[dex] = '1';
dex++;
}
else if(s[i] == 'B'){
if (dex != 0){
dex--;
arr[dex] = '\0';
}
}
}
printf("%s", arr);
return 0;
} | 1 | 46,554,331 |
#include <cstdio>
#include <cstdlib>
#include <string>
#include <iostream>
using namespace std;
int D[10000];
int H[10000];
void printResult(int i, int n){
printf("node %d: key = %d, ",i,H[i]);
if(i!=1) printf("parent key = %d, ",H[i/2]);
if(2*i<=n) printf("left key = %d, ",H[2*i]);
if(2*i+1<=n) printf("right key = %d, ",H[2*i+1]);
printf("\n");
}
int main()
{
int n,i,x;
string com;
cin>>n;
for(i=1;i<=n;i++){
cin>>H[i];
}
for(i=1;i<=n;i++){
printResult(i,n);
}
return 0;
} | #include<iostream>
using namespace std;
struct Node {
int key;
int parent = -1;
int left = -1;
int right = -1;
};
Node T[251];
void prop(int num) {
int div = num / 2;
int tmp = num % 2;
T[num].parent = div;
if (tmp == 0) {
T[div].left = num;
}
else {
T[div].right = num;
}
}
int main() {
int n;
cin >> n;
cin >> T[1].key;
for (int i = 2; i <= n; i++) {
cin >> T[i].key;
prop(i);
}
for (int i = 1; i <= n; i++) {
cout << "node " << i << ": key = " << T[i].key << ", ";
if (T[i].parent != -1) {
cout << "parent key = " << T[T[i].parent].key << ", ";
}
if (T[i].left != -1) {
cout << "left key = " << T[T[i].left].key << ", ";
}
if (T[i].right != -1) {
cout << "right key = " << T[T[i].right].key << ", ";
}
cout << endl;
}
} | 1 | 33,262,960 |
#include<bits/stdc++.h>
using namespace std;
#define PI acos(-1)
typedef long long ll;
int main()
{
string a,b;
cin >> a >> b;
if(a.size()>b.size())
{
cout<<"GREATER"<<endl;
}
else if(a.size()<b.size())
{
cout<< "LESS" <<endl;
}
else
{
for(int i=0; i<a.size();i++)
{
if(a[i]>b[i])
{
cout<< "GREATER" <<endl;
return 0;
}
else if(b[i]>a[i])
{
cout<<"LESS" << endl;;
return 0;
}
}
cout<< "EQUAL" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
string a,b;
cin >> a >> b;
if(a.length()>b.length()){
cout << "GREATER" << endl;
}else if(a.length()<b.length()){
cout << "LESS" << endl;
}else{
for(int i = 0; i < a.length(); i++){
if(a[i]>b[i]){
cout << "GREATER" << endl;
break;
}else if(a[i]<b[i]){
cout << "LESS" << endl;
break;
}else{
if(i == a.length()-1){
cout << "EQUAL" << endl;
}
}
}
}
return 0;
} | 1 | 72,866,743 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define rep(i,m,n) for(int i=m;i<n;i++)
ll mod=1e9+7;
int main(){
int a,b,x;
cin>>a>>b>>x;
if(a<=x && a+b>=x) cout<<"YES"<<endl;
else cout<<"NO"<<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int a, b, c;
cin >> a >> b >> c;
if (c < a) {
cout << "NO";
return 0;
} else if (a + b >= c) {
cout << "YES";
return 0;
} else {
cout << "NO";
return 0;
}
} | 1 | 56,780,015 |
#include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
using ll = long long;
using ld = long double;
const int MOD = 1e9+7;
const ll INF = 1LL << 60;
int main() {
int n, m; cin >> n >> m;
V<bool> b(n + 1, false);
for(int i = 0; i < m; i++){
int a; cin >> a;
b[a] = true;
}
V<int> dp(n + 5);
dp[0] = 1;
for(int i = 0; i < n; i++){
if(b[i]) continue;
if(!b[i + 1]) dp[i + 1] += dp[i], dp[i + 1] %= MOD;
if(!b[i + 2]) dp[i + 2] += dp[i], dp[i + 2] %= MOD;
}
cout << dp[n] << endl;
return 0;
} | #include <iostream>
#include <math.h>
using namespace std;
int mod=1e9+7;
int main(){
int N,M;
cin >> N >> M;
int s[N+1];
for(int i=0;i<=N;i++){
s[i]=0;
}
for(int i=0;i<M;i++){
int a; cin >> a;
s[a]=1;
}
int dp[N+1];
dp[0]=1;
for(int i=1;i<N+1;i++){
dp[i]=0;
}
for(int i=0;i<N-1;i++){
if(s[i]==0){
dp[i+1]+=dp[i];
dp[i+2]+=dp[i];
dp[i+1]%=mod;
dp[i+2]%=mod;
}
}
if(s[N-1]==0){
dp[N]+=dp[N-1];
dp[N]%=mod;
}
cout << dp[N]<<endl;
} | 1 | 25,751,359 |
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
ll gcd(ll a,ll b){
if(b == 0) return a;
return gcd(b , a % b);
}
ll mod(ll a){
return (a % 1000000007);
}
ll lcm(ll a,ll b){
return (a*b)/gcd(a,b);
}
int main(){
ll n,m; cin >> n >> m;
if(n == 1 && m == 1){
cout << 1;
}
else if(n == 1 && m >= 2){
cout << m-2 << endl;
}
else if(n >= 2 && m == 1){
cout << n-2 << endl;
}
else{
cout << (n-2)*(m-2) << endl;
}
} | #include "bits/stdc++.h"
#define rep(i, j) for (int i = 0; i < j; i++)
using namespace std;
using ll = long long;
int gcd(int x, int y);
const int INF = 1001001001;
int main() {
ll n, m;
cin >> n >> m;
ll ans;
if (n >= 3 && m >= 3)
ans = (n - 2) * (m - 2);
else if (n == 2 || m == 2)
ans = 0;
else if (n == 1) {
ans = m - 2;
if (ans < 0)
ans = 1;
}
else {
ans = n - 2;
if (ans < 0)
ans = 1;
}
cout << ans << endl;
return 0;
}
int gcd(int x, int y) {
int num[3];
num[0] = (x > y) ? x : y;
num[1] = (x <= y) ? x : y;
num[2] = num[0] % num[1];
while (num[2]) {
num[0] = num[1];
num[1] = num[2];
num[2] = num[0] % num[1];
}
return num[1];
} | 1 | 96,082,351 |
#include <iostream>
#include <utility>
using namespace std;
typedef pair<int,int> pii;
pii mx(pii a, pii b){
int i,ma1 = -1,ma2 = -1,c[4];
c[0] = a.first,c[1] = a.second,c[2] = b.first,c[3] = b.second;
for(i=0;i<4;i++){
if(ma1<c[i]){
ma2 = ma1; ma1 = c[i];
}else if(ma2<c[i]){
ma2 = c[i];
}
}
return {ma1,ma2};
}
int a[1<<20];
pii dp[1<<20];
int main(){
int i,j,n;
cin >> n;
for(i=0;i<(1<<n);i++){
cin >> a[i];
dp[i] = {a[i],0};
}
for(i=0;i<n;i++){
for(j=0;j<(1<<n);j++){
if(j&(1<<i)){
dp[j] = mx(dp[j],dp[j^(1<<i)]);
}
}
}
int ans = a[0] + a[1];
for(i=1;i<(1<<n);i++){
ans = max(ans,dp[i].first + dp[i].second);
cout << ans << endl;
}
} | #include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <climits>
#include <string>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <ctime>
#include <cassert>
#include <fstream>
#include<unordered_map>
#include <stack>
#include <random>
typedef long long ll;
typedef std::pair<int, int> Pii;
typedef std::pair<long long, long long> Pll;
typedef std::pair<double, double> Pdd;
#define rip(i, n, s) for (int i = (s);i < (int)( n ); i++)
#define all(a) a.begin(), a.end()
#define MM << " " <<
template<typename T>
using MaxHeap = std::priority_queue<T>;
template<typename T>
using MinHeap = std::priority_queue<T, std::vector<T>, std::greater<T>>;
template<typename T>
inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template<typename T>
inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<typename T>
void vdeb(std::vector<T> &da) {
for (int i = 0;i < da.size();i++) {
if (i == da.size() - 1) std::cout << da[i];
else std::cout << da[i] << ' ';
}
std::cout << std::endl;
}
template<typename T>
void vdeb(std::vector<std::vector<T>> &da) {
for (int i = 0;i < da.size();i++) {
std::cout << i << ' ';
vdeb(da[i]);
}
std::cout << std::endl;
}
using namespace std;
typedef pair<Pii, Pii> P;
P change(P x, P y) {
set<Pii> pq;
pq.insert(x.first);
pq.insert(x.second);
pq.insert(y.first);
pq.insert(y.second);
auto a = *(--pq.end());
pq.erase(a);
auto b = *(--pq.end());
return {a, b};
}
int main() {
int n; cin >> n;
vector<int> da((1 << n));
rip(i,1 << n,0) cin >> da[i];
vector<pair<Pii,Pii>> dp((1 << n));
int m = 1 << n;
rip(i,m,0) {
dp[i] = {{da[i], i},{da[0], 0}};
int now = 1;
rip(j,n,0) {
if(now&i) {
dp[i] = change(dp[i], dp[i-now]);
}
now <<= 1;
}
}
vector<int> ans(m);
rip(i,m,1) {
ans[i] = max(ans[i-1], dp[i].first.first + dp[i].second.first);
}
rip(i,m,1) {
printf("%d\n", ans[i]);
}
} | 1 | 82,886,368 |
#include<iostream>
#include<iomanip>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cinttypes>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<string>
#include<stack>
#define FSCNd64 "%" SCNd64
#define FPRId64 "%" PRId64
using namespace std;
using ll=long long;
using vb=vector<bool>;
using vi=vector<int>;
using vvi=vector<vi>;
using pii=pair<int,int>;
using vll=vector<ll>;
using vvll=vector<vll>;
using vpii=vector<pii>;
#define PI 3.1415926535897932384626433832795
template<typename X>
bool max_u(X&m, X v)
{
if(m<v)
{
m=v;
return true;
}
return false;
}
template<typename X>
bool min_u(X&m, X v)
{
if(m>v)
{
m=v;
return true;
}
return false;
}
struct loop_t
{
vll c_sum;
vll c_max;
vll c_rmax;
void dump(void)
{
int n=c_sum.size();
for(int i=0;i<n;i++)
{
cout << "(" << c_sum[i] << "," << c_max[i] << "," << c_rmax[i] << ")";
}
cout << "\n";
}
};
template <typename X>
struct btmax_t
{
vector<X> t;
int base;
btmax_t(int n)
{
for(base=1;base<n;base*=2)
;
t.resize(base*2);
}
btmax_t(int n, X x)
{
for(base=1;base<n;base*=2)
;
t.resize(base*2, x);
}
void seti(int idx)
{
if(idx<=0) return;
if(t[idx*2]<t[idx*2+1]) t[idx]=t[idx*2+1];
else t[idx]=t[idx*2];
seti(idx/2);
}
void set(int idx, const X&v)
{
int y=idx+base;
t[y]=v;
seti(y/2);
}
X get(void)
{
return t[1];
}
};
template<typename X>
void dump(vector<X>&v)
{
for(auto&m:v) cout << m << " ";
cout << "\n";
}
struct solve
{
solve(){}
ll operator()() {
return 0;
}
};
int main(void)
{
for(;;)
{
int n, k;
cin >> n >> k;
if(cin.fail()) break;
vi p(n+1);
vll c(n+1);
for(int i=1;i<=n;i++) cin >> p[i];
for(int i=1;i<=n;i++) cin >> c[i];
ll ans=c[1];
vb is_passed(n+1, false);
for(int i=1;i<=n;i++)
{
if(is_passed[i]) continue;
int cp=i;
int g_num=1;
for(int j=0;j<=n;j++)
{
if(is_passed[cp])
{
g_num=j;
break;
}
is_passed[cp]=true;
cp=p[cp];
}
vll sum={c[cp]};
ll sum_min=sum.back();
for(int j=1;j<g_num*3;j++)
{
cp=p[cp];
sum.push_back(sum.back()+c[cp]);
min_u(sum_min, sum.back());
}
int loop_num=max(0, (int)k/g_num-1);
ll ans_add=sum[g_num-1]*loop_num;
if(ans_add<0) ans_add=0;
int chk_size=k-loop_num*g_num;
btmax_t<ll> t(chk_size, sum_min);
for(int j=0;j<chk_size;j++)
{
t.set(j, sum[j]);
}
for(int j=0;j<g_num;j++)
{
t.set(j%chk_size, sum[chk_size+j]);
max_u(ans, t.get()-sum[j]+ans_add);
}
}
cout << ans << "\n";
}
return 0;
} | #include<bits/stdc++.h>
#include<boost/dynamic_bitset.hpp>
using namespace std;
using u64 = uint64_t;
using s64 = int64_t;
int main() {
u64 N, K;
cin >> N >> K;
vector<u64> P(N);
vector<s64> C(N);
for(u64 i=0; i<N; i++) cin >> P[i], P[i]--;
for(u64 i=0; i<N; i++) cin >> C[i];
s64 ans = INT64_MIN;
for(u64 i=0; i<N; i++) {
u64 v = i;
s64 csum = 0;
u64 cnum = 0;
do {
csum += C[v];
cnum++;
v = P[v];
} while(v != i);
u64 ccnt = 0;
s64 pans = 0;
do {
pans += C[v];
v = P[v];
ccnt++;
s64 off = (csum > 0) ? (K - ccnt) / cnum * csum : 0;
ans = max(ans, pans + off);
} while(v != i && ccnt < K);
}
cout << ans << endl;
return 0;
} | 1 | 91,514,121 |
#include <bits/stdc++.h>
using namespace std;
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 1LL<<60;
ll gcd(ll a, ll b) {
if(b == 0) return a;
return gcd(b, a % b);
}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
ll modpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
bool ok = false;
if(s == "keyence"){
cout << "YES" << endl;
return 0;
}
for(int i = 0; i < s.length(); i++){
for(int j = i; j < s.length(); j++){
string t = "";
for(int k = 0; k < s.length(); k++){
if(k < i || k > j){
t += s[k];
}
}
if(!ok && t == "keyence"){
ok = true;
cout << "YES" << endl;
break;
}
}
}
if(!ok){
cout << "NO" << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define INF 1e18
using namespace std;
int main(void){
string s;
cin >> s;
int ok = 0;
for (int i = 0; i < s.size(); i++){
for (int j = i; j < s.size(); j++){
if ("keyence" == s.substr(0, i) + s.substr(j))
ok = 1;
}
}
if (ok)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | 1 | 79,260,255 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<cmath>
#include<map>
using namespace std;
#define rep(i,N) for(int i=0;i<N;i++)
typedef long long ll;
ll binary_search(vector<ll> a, ll n, ll key){
ll right = n, left = -1;
ll md = (right + left) / 2;
while(right - left > 1){
if(a[md] <= key){
right = md;
}else{
left = md;
}
md = (right + left) / 2;
}
if(left == -1) return -1;
return right;
}
vector<ll> prime;
void Prime(ll n){
vector<ll> p(n,0);
p[0]=1;
p[1]=1;
for(ll i=2;i<n;i++){
if(p[i]==0){
prime.push_back(i);
p[i]=i;
}
ll k=prime.size();
for(ll j=0;j<k && i*prime[j]<n && prime[j]<=p[i];j++){
p[i*prime[j]]=prime[j];
}
}
}
ll gcd(ll a,ll b){
if(a<b){
swap(a,b);
}
ll r=a%b;
while(r!=0){
a=b;
b=r;
r=a%b;
}
return b;
}
#define MOD ((ll)1e+9 + 7)
int main(){
ll n;
cin>>n;
vector<ll> a(n);
rep(i,n){
cin>>a[i];
}
ll k=pow(10,18);
ll ans=1;
sort(a.begin(),a.end(),greater<ll>());
if(a[n-1]==0){
cout<<0<<endl;
return 0;
}
rep(i,n){
if(k/ans<a[i]){
cout<<-1<<endl;
return 0;
}
ans*=a[i];
}
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
unsigned long long ans=1;
vector<long long> a(n);
for(int i=0;i<n;i++)cin>>a.at(i);
sort(a.begin(),a.end());
if(a[0]==0){
cout<<0<<endl;
return 0;
}
for(int i=0;i<n;i++){
if(ans>(long long)1e18/a[i]){
cout<<-1<<endl;
return 0;
}
ans*=a[i];
}
cout<<ans<<endl;
return 0;
} | 1 | 46,384,276 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define rep(i, begin, n) for (int i = begin; i < n; i++)
#define repe(i, begin, n) for (int i = begin; i <= n; i++)
#define repr(i, begin, n) for (int i = begin; i > begin - n; i--)
#define repre(i, begin, end) for (int i = begin; i >= end; 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;
}
const int inf = 1000000007;
const int MOD = 1000000007;
const long long INF = 1000000000000000007;
ll N, M;
ll x[1010], y[1010], z[1010];
ll total[1010];
int main() {
cin >> N >> M;
rep(i, 0, N) { cin >> x[i] >> y[i] >> z[i]; }
ll ans = 0;
for (int bit = 0; bit < (1 << 3); ++bit) {
rep(i, 0, N) {
ll xx = x[i];
ll yy = y[i];
ll zz = z[i];
if (bit & 1) {
xx = -xx;
}
if (bit & (1 << 1)) {
yy = -yy;
}
if (bit & (1 << 2)) {
zz = -zz;
}
total[i] = xx + yy + zz;
}
sort(total, total + N, greater<ll>());
ll sum = 0;
rep(i, 0, M) { sum += total[i]; }
chmax(ans, sum);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int N, M;
long long X[1005], Y[1005], Z[1005];
long long dp[1005][1005][8];
int main() {
cin >> N >> M;
for (int i = 0; i < N; i++) {
cin >> X[i] >> Y[i] >> Z[i];
}
for (int i = 0; i < 1005; i++) {
for (int j = 0; j < 1005; j++) {
for (int k = 0; k < 8; k++) {
dp[i][j][k] = -1e15;
}
}
}
for (int i = 0; i < 8; i++) {
dp[0][0][i] = 0;
}
for (int i = 0; i < N; i++) {
for (int j = 0; j <= M; j++) {
for (int k = 0; k < 8; k++) {
chmax(dp[i + 1][j][k], dp[i][j][k]);
}
chmax(dp[i + 1][j + 1][0], dp[i][j][0] + X[i] + Y[i] + Z[i]);
chmax(dp[i + 1][j + 1][1], dp[i][j][1] + X[i] + Y[i] - Z[i]);
chmax(dp[i + 1][j + 1][2], dp[i][j][2] + X[i] - Y[i] + Z[i]);
chmax(dp[i + 1][j + 1][3], dp[i][j][3] + X[i] - Y[i] - Z[i]);
chmax(dp[i + 1][j + 1][4], dp[i][j][4] - X[i] + Y[i] + Z[i]);
chmax(dp[i + 1][j + 1][5], dp[i][j][5] - X[i] + Y[i] - Z[i]);
chmax(dp[i + 1][j + 1][6], dp[i][j][6] - X[i] - Y[i] + Z[i]);
chmax(dp[i + 1][j + 1][7], dp[i][j][7] - X[i] - Y[i] - Z[i]);
}
}
long long ans = 0;
for (int i = 0; i < 8; i++) {
chmax(ans, dp[N][M][i]);
}
cout << ans << endl;
return 0;
} | 1 | 48,899,252 |
#include <iostream>
#include <cctype>
#include <cstring>
using namespace std;
int main(){
char str[1200];
int j;
cin.getline(str, 1200);
size_t len = strlen(str);
for(j = 0; j <= len-1; j++){
if(islower(str[j]) != 0){
str[j] = toupper(str[j]);
}
else if(isupper(str[j]) != 0){
str[j] = tolower(str[j]);
}
}
for(j = 0; j <= len-1; j++){
cout << str[j];
}
cout << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main()
{
string line;
getline(cin, line);
for (auto &it : line)
{
if (('a' <= it) && (it <= 'z'))
{
it = toupper(it);
}
else if (('A' <= it) && (it <= 'Z'))
{
it = tolower(it);
}
}
cout << line << "\n";
return 0;
} | 1 | 86,718,961 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = (0); i < (n); ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define DEBUG(val) cout << #val << " : " << val << endl
#define MOD 1000000007
int main() {
int h, w, a, b;
cin >> h >> w >> a >> b;
REP(t, b) {
REP(i, a) cout << "0";
REP(j, w - a) cout << "1";
cout << endl;
}
REP(t, h - b) {
REP(i, a) cout << "1";
REP(j, w - a) cout << "0";
cout << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, a, b; cin >> n >> m >> a >> b;
string l = string(a, '0') + string(m - a, '1');
string o = string(a, '1') + string(m - a, '0');
for(int i = 0; i < b; i++) cout << l << "\n";
for(int i = b; i < n; i++) cout << o << "\n";
} | 1 | 33,021,116 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector <int> a(n);
for (int i = 0; i < n; i ++){
int _a;
cin >> _a;
a[i] = _a;
}
sort(a.begin(), a.end());
int now_num = 0;
int now_cnt = 0;
int ans = 0;
for (auto num : a){
if (now_num != num){
if (now_cnt < now_num){
ans += now_cnt;
}
now_cnt = 0;
}
if (now_cnt == 0){
now_num = num;
}
now_cnt += 1;
if (now_cnt > now_num){
ans += 1;
}
}
if (now_cnt < now_num){
ans += now_cnt;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
const ll INF=1LL<<60;
const double EPS = 1e-10;
const ll mod=1000000007;
int main(void){
ll n;
cin>>n;
map<ll,ll> m;
for(int i=0;i<n;i++){
ll a;
cin>>a;
m[a]++;
}
ll ans=0;
for(auto x:m){
if(x.second<x.first) ans+=x.second;
else ans+=x.second-x.first;
}
cout<<ans<<endl;
} | 1 | 97,658,613 |
#include <bits/stdc++.h>
#define EPS (1e-10)
#define rep(i, a, b) for (int i = a; i < (int)(b); ++i)
#define rrep(i, a, b) for (int i = b - 1; i >= (int)(a); --i)
#define all(a) a.begin(), a.end()
using namespace std;
using ll = long long;
using vi = vector<int>;
using vb = vector<bool>;
using vll = vector<ll>;
using vd = vector<double>;
using vvi = vector<vi>;
using vvb = vector<vb>;
constexpr int MOD = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vll s(n), t(m);
rep(i, 0, n) { cin >> s[i]; }
rep(i, 0, m) { cin >> t[i]; }
vll cols(m, 0);
rep(i, 0, n) {
ll sum = 0;
rep(j, 0, m) {
ll d = (s[i] == t[j]) ? (1 + sum) % MOD : 0;
sum = (sum + cols[j]) % MOD;
cols[j] = (cols[j] + d) % MOD;
}
}
ll ans = 1;
rep(i, 0, m) { ans = (ans + cols[i]) % MOD; }
cout << ans << endl;
return 0;
} | #include <cstdio>
#include <algorithm>
using namespace std;
const int N = 2e3 + 7;
const int M = 1e9 + 7;
int S[N], T[N], sum[N][N];
int mod(int val)
{
return (val % M + M) % M;
}
int main()
{
int n, m;
scanf("%d %d", &n, &m);
for (int i = 0; i < n; ++i)
scanf("%d", &S[i]);
for (int i = 0; i < m; ++i)
scanf("%d", &T[i]);
for (int i = 0; i <= max(n, m); ++i)
sum[0][i] = sum[i][0] = 1;
for (int i = 0; i < n; ++i)
for (int j = 0; j < m; ++j)
{
int val = S[i] == T[j] ? sum[i][j] : 0;
sum[i + 1][j + 1] = mod(mod(mod(sum[i + 1][j] + sum[i][j + 1]) - sum[i][j]) + val);
}
printf("%d", sum[n][m]);
return 0;
} | 1 | 2,218,512 |
#define _GLIBCXX_DEBUG
#include <iostream>
using namespace std;
int main(void){
int n, r;
cin >> n >> r;
if(n<10) r += 100*(10-n);
cout << r << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int n,r,ans;
int main()
{
scanf("%d%d",&n,&r);
if(n<10){
ans=r+100*(10-n);
printf("%d",ans);
}else{
ans=r;
printf("%d",ans);
}
return 0;
} | 1 | 95,407,087 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const ll INF = 1e12;
const int MOD = 1000000007;
int main() {
int n;
cin >> n;
vector<ll> a(n);
rep(i,n) cin >> a.at(i);
ll ans = 0;
int before = 0;
rep(i,n){
if( before == 1 && a[i] > 0) {ans ++; a[i] --;}
ans += a[i]/2;
before = a[i]%2;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; ++i)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
ll ans = 0, sum = 0;
rep(i, n) {
int a;
cin >> a;
sum += a;
if (a == 0) {
ans += sum / 2;
sum = 0;
}
}
ans += sum / 2;
cout << ans << endl;
return 0;
} | 1 | 83,681,023 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int a, b;
cin >> a >> b;
if (a > 8 || b > 8)
{
cout << ":(" << endl;
}
else
{
cout << "Yay!" << endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
string ans;
if(A > 8 || B > 8) {
ans = ":(";
} else {
ans = "Yay!";
}
cout << ans << endl;
} | 1 | 74,528,396 |
#include <bits/stdc++.h>
using namespace std;
bool hantei(int n){
bool hantei;
int cnt = 0;
while(n>0){
n/=10;
cnt++;
}
if(cnt%2==0){
hantei = false;
}else{
hantei = true;
}
return hantei;
}
int main(){
int n;
cin >> n;
int ans = 0;
for(int i=1;i<=n;i++){
if(hantei(i)) ans++;
}
cout << ans << endl;
} | #pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define PI 3.141592
#define all(a) (a).begin(), (a).end()
int main(){
int N;
cin >> N;
int count = 0;
for(int i = 1; i <= N; i++) if(to_string(i).size() % 2) count++;
cout << count << endl;
} | 1 | 41,301,940 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 1000000007
#define mod 200003
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; }
using pl = pair<ll,ll>;
using vvb=vector<vector<bool>>;
using vb= vector<bool>;
ll f(ll a,ll b,ll p){
if(b==0) return 1;
if(b%2==0){
ll t=f(a,b/2,p);
return t*t%p;
}
return a*(f(a,b-1,p))%p;
}
signed main(){
ll n,m; cin>>n>>m;
vl g[n];
rep(i,0,m){
ll a,b; cin>>a>>b;
--a; --b;
g[a].push_back(b);
g[b].push_back(a);
}
vl ans(n+10);
queue<ll> q;
q.push(0);
vector<bool> seen(n);
seen[0]=1;
while(!q.empty()){
ll k=q.front(); q.pop();
for(auto c:g[k]){
if(seen[c])continue;
seen[c]=1;
ans[c]=k;
q.push(c);
}
}
cout<<"Yes"<<endl;
rep(i,1,n)cout<<ans[i]+1<<endl;
return 0;
} | #include<functional>
#include<algorithm>
#include<iostream>
#include<iomanip>
#include<cstring>
#include<cstdlib>
#include<utility>
#include<string>
#include<cstdio>
#include<vector>
#include<bitset>
#include<cmath>
#include<ctime>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
using namespace std;
const int inf=2147483647,dx[]={-1,0,1,0},dy[]={0,-1,0,1};
const int N=100005,M=1000005,K=200005,mod=1000000007;
const long long llinf=9223372036854775807ll;
int n,m,a,b,ans[N];
vector<int> v[N];
bool u[N];
queue<int> q;
int main(){
cin>>n>>m;
for(int i=1;i<=m;i++)
{
cin>>a>>b;
v[a].push_back(b);
v[b].push_back(a);
}
cout<<"Yes\n";
q.push(1);
u[1]=true;
while(q.size())
{
int l=q.size();
for(int i=1;i<=l;i++)
{
int x=q.front();
q.pop();
for(int j=0;j<v[x].size();j++)
if(!u[v[x][j]])
u[v[x][j]]=true,q.push(v[x][j]),ans[v[x][j]]=x;
}
}
for(int i=2;i<=n;i++)
cout<<ans[i]<<'\n';
return 0;
} | 1 | 71,096,466 |
#include<iostream>
using namespace std;
int main(){
long long sum = 0;
int input, max = -1000000, min = 1000000, count = 0, limit;
cin >> limit;
while ( count < limit ){
cin >> input;
min = min > input ? input : min;
max = max < input ? input : max;
sum = sum + input;
count++;
}
cout << min << " " << max << " " << sum << "\n";
return 0;
} | #include <iostream>
using namespace std;
int main()
{
int n;
int a[10000];
int max, min;
long long sum;
cin >> n;
for(int i = 0; i < n; i++){
cin >> a[i];
sum += a[i];
}
max = min = a[0];
for(int i = 0; i < n; i++){
if(min > a[i]) min = a[i];
if(max < a[i]) max = a[i];
}
cout << min << " " << max << " " << sum << '\n';
} | 1 | 77,425,036 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace __gnu_pbds;
using namespace std;
#define getbit(n, i) (((n) & (1LL << (i))) != 0)
#define setbit0(n, i) ((n) & (~(1LL << (i))))
#define setbit1(n, i) ((n) | (1LL << (i)))
#define togglebit(n, i) ((n) ^ (1LL << (i)))
char gap = 32;
template < typename T >
ostream& operator<<(ostream &os, const vector < T > &v) {
os << '{';
for (const auto &x: v) os << gap << x;
return os << '}';
}
template < typename A, typename B >
ostream& operator<<(ostream &os, const pair < A, B > &p) {
return os << '(' << p.first << gap << p.second << ')';
}
template < class T >
void read(T &x) {
char c;
for (c = getchar(); c < '0' || c > '9'; c = getchar());
for (x = 0; c <= '9' && c >= '0'; c = getchar()) x = x * 10 + (c & 15);
}
#define ll long long
#define lll __int128_t
#define pb push_back
#define mp make_pair
typedef pair < int, int > ii;
typedef vector < ii > vii;
typedef vector < ll > vl;
typedef vector < int > vi;
typedef vector < vi > vvi;
typedef tree <
int,
null_type,
less < int >,
rb_tree_tag,
tree_order_statistics_node_update >
ordered_set;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ll hashPrime = 1610612741;
ll dp[1001][1001];
ll mod=1000000007;
vector<string>Data;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
ll i,j,k,l,n,m;
cin>>n>>m;
vector<pair<ll,ll>>res;
ll ini=1;
ll fina=n;
vector<ll>used(n+1,0);
ll kola1=(m+1)/2;
while(kola1--){
used[ini]=1;used[fina]=1;
res.pb({ini++,fina--});
}
m=m/2;
ll cnt=2*m;
while(m--){
while(used[ini]==1) ini++;
res.pb(make_pair(ini,ini+cnt));
used[ini]=1;
used[ini+cnt]=1;
cnt-=2;
}
for(auto x:res) cout<<x.first<<" "<<x.second<<'\n';
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int L = N / 2;
int R = L + 1;
int min_L = N;
vector<pair<int, int>> P;
for (int d = 1; d < (N + 1) / 2; d += 2) {
if (P.size() < M) {
P.push_back({L + 1, R + 1});
}
min_L = min(min_L, L);
L--;
R++;
}
vector<int> D;
for (int d = 2; d < (N + 1) / 2; d += 2) {
D.push_back(N - d);
}
sort(D.begin(), D.end());
L = min_L - 1;
for (int d : D) {
if (P.size() < M) {
P.push_back({L + 1, L + d + 1});
}
L--;
}
sort(P.begin(), P.end());
int offset = P[0].first - 1;
for (auto& p : P) {
p.first -= offset;
p.second -= offset;
}
for (auto& p : P) {
cout << p.first << " " << p.second << endl;
}
return 0;
} | 1 | 27,602,358 |
#include <bits/stdc++.h>
#define f first
#define s second
using namespace std;
using ll = long long;
using ii = pair<int, int>;
vector<int> G[100001];
int dfs(int u, int p) {
int ret = 0;
for (int v : G[u]) if (v != p) ret ^= (dfs(v, u) + 1);
return ret;
}
int main() {
if (fopen("in", "r")) freopen("in", "r", stdin), freopen("out", "w", stdout);
ios_base::sync_with_stdio(0), cin.tie(0);
int N; cin >> N;
for (int i = 1; i < N; ++i) {
int x, y; cin >> x >> y;
G[x].push_back(y), G[y].push_back(x);
}
cout << (dfs(1, 0) ? "Alice" : "Bob");
} | #include<cstdio>
#include<cctype>
#include<vector>
inline int getint() {
register char ch;
while(!isdigit(ch=getchar()));
register int x=ch^'0';
while(isdigit(ch=getchar())) x=(((x<<2)+x)<<1)+(ch^'0');
return x;
}
const int N=1e5+1;
std::vector<int> e[N];
inline void add_edge(const int &u,const int &v) {
e[u].push_back(v);
e[v].push_back(u);
}
int dfs(const int &x,const int &par) {
int sg=0;
for(auto &y:e[x]) {
if(y==par) continue;
sg^=dfs(y,x)+1;
}
return sg;
}
int main() {
const int n=getint();
for(register int i=1;i<n;i++) {
add_edge(getint(),getint());
}
puts(dfs(1,0)?"Alice":"Bob");
return 0;
} | 1 | 55,256,617 |
#include<cstdio>
#include<iostream>
#include<cmath>
using namespace std;
int main(){
double a, b, c, cRad;
double s, l, h;
double pi = acos(-1);
cin >> a >> b >> cRad;
s = a * b * sin(pi / 180 * cRad) / 2;
c = sqrt( a*a + b*b - 2 * a * b * cos(pi / 180 * cRad) );
l = a + b + c;
h = 2 * s / a;
printf("%f\n%f\n%f\n", s, l, h);
return 0;
} | #include<iostream>
using namespace std;
#include<iomanip>
#define _USE_MATH_DEFINES
#include<cmath>
int main()
{
double a, b, t;
int C;
cin >> a >> b >> C;
t = (M_PI * C * 1.0) / 180;
cout << fixed << setprecision(10) << endl;
cout << 0.5 * a * b * sin(t) << endl;
cout << a + b + sqrt(a * a + b * b - 2 * a * b * cos(t)) << endl;
cout << b * sin(t) << endl;
return 0;
} | 1 | 84,412,220 |
#include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INF INT_MAX
#define INFLL LLONG_MAX
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define per(i, n) for(ll i=((ll)(n))-1; i>=0; i--)
#define perf(i, n) for(ll i=((ll)(n)); i>0; i--)
#define all(v) v.begin(), v.end()
#define endl "\n"
#define vi vector<ll>
#define vvi vector<vector<ll>>
#define Yes() cout << "Yes" << endl
#define YES() cout << "YES" << endl
#define No() cout << "No" << endl
#define NO() cout << "NO" << endl
template<class T>bool chmax(T &a, const T &b){ if(a<b){ a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b){ if(b<a){ a=b; return 1; } return 0; }
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(10);
string s; cin >> s;
bool heisei = false;
ll y = (s[0]-'0')*1000 + (s[1]-'0')*100 + (s[2]-'0')*10 + (s[3]-'0');
ll m = (s[5]-'0')*10 + (s[6]-'0');
ll d = (s[8]-'0')*10 + (s[9]-'0');
if(y < 2019) heisei = true;
else if(y == 2019 && m <= 4 && d <= 30) heisei = true;
cout << ((heisei) ? "Heisei" : "TBD") << endl;
} | #include <bits/stdc++.h>
using intl = long long;
using itnl = long long;
using itn = int;
using ld = long double;
using namespace std;
#define rep(i, n) for(intl i = 0; i < (intl)(n); i++)
#define rrep(i, n) for(intl i = (intl)(n) - 1; i >= 0; i--)
#define repi(i, a, b) for(intl i = (intl)(a); i < (intl)(b); i++)
#define rrepi(i, a, b) for(intl i = (intl)(a); i > (intl)(b); i--)
#define max(a, b) ((a) > (b) ? (a) : (b))
#define min(a, b) ((a) < (b) ? (a) : (b))
#define all(x) (x).begin(),(x).end()
#define m0(x) memset(x,0,sizeof(x))
#define m1(x) memset(x,1,sizeof(x))
#define fill(x,y) memset(x,y,sizeof(x))
#define alength(a) (sizeof(a) / sizeof(a[0]))
#define cin(i, a) rep(i, alength(a))cin >> a[i]
#define ccin(i, j, a) rep(i, alength(a))rep(j, alength(a[i]))cin >> a[i][j]
#define debug(x) cout << #x << ":" << x << endl
#define rdebug(i,x) rep(i, alength(x))cout << #x << "[" << i << "]:" << x[i] << endl
#define sqrt sqrtl
#define itn int
#define double ld
#define pb push_back
#define mp make_pair
#define pii pair<intl,intl>
const intl INF = 1e9;
const intl MOD = 1e9+7;
const ld eps = 1.0e-14;
void fp(bool f){cout << (f ? "Yes" : "No") << endl;}
void fp(bool f, string s, string t){cout << (f ? s : t) << endl;}
intl kai(intl k){
intl a = 1;
for(int i = 2; i <= k; i++){
a *= i;
}
return a;
}
intl gcd(intl a, intl b){
if(!b)return a;
return gcd(b, a % b);
}
intl lcm(intl a,intl b){
return a / gcd(a, b) * b;
}
intl digit10(intl a){
intl b = 0;
do{
a /= 10;
b++;
}while(a);
return b;
}
signed main(){
cout << fixed << setprecision(10);
string s;
cin >> s;
fp(s.substr(5,2) <= "04","Heisei","TBD");
return 0;
} | 1 | 2,899,370 |
#include <bits/stdc++.h>
#define rep(i,n) for (ll i=0; i<(n); i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int main(){
int x; cin >> x;
if (x>=1200) cout << "ARC" << endl;
else cout << "ABC" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define fin(ans) cout << (ans) << endl;
#define blank(ans) cout << (ans) << " ";
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
typedef long long ll;
typedef long long lli;
typedef unsigned long long ull;
typedef long double ld;
typedef string str;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<ld> vd;
typedef vector<str> vs;
typedef vector<ll> vll;
typedef vector<pair<ll, ll>> vpll;
typedef vector<pair<ll, str>> vpls;
typedef vector<tuple<str, ll, ll>> vtsl;
typedef vector<vector<ll>> vvll;
typedef vector<vector<char>> vvc;
typedef vector<vector<str>> vvs;
const ld PI = acos(-1.0);
const ll MAX = 9000000000000000000;
const ll MIN = -9000000000000000000;
const ld DMAX = 4500;
const ld DMIN = -4500;
const ll MOD = 1000000007;
void Main()
{
ll a, b;
cin >> a;
fin(a < 1200 ? "ABC" : "ARC")
}
int main()
{
cout << fixed << setprecision(20);
Main();
return 0;
} | 1 | 59,968,389 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define LL_HALFMAX 9223372036854775807 / 2
int main()
{
ll n,k;
cin >> n >> k;
vector<ll>a(n);
for(ll i = 0; i < n; i++)
{
cin >> a[i];
}
ll result = LL_HALFMAX;
ll addcost = 0;
for(ll bit = 0; bit <(1<<n); bit++)
{
ll cost = 0;
ll look = 0;
ll hmax = a[0] - 1;
for(ll i = 0; i < n; i++)
{
if(a[i] > hmax)
{
hmax = a[i];
look++;
}
else if(bit&(1<<i))
{
addcost = hmax - a[i] + 1;
look++;
hmax += 1;
cost += addcost;
}
}
if(look >= k)
{
result = min(result,cost);
}
}
cout << result << endl;
return 0;
} | #include <bits/stdc++.h>
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define REP(i, n) for(int i=0;i<(n);++i)
#define REPr(i, n) for(int i=(n)-1;i>=0; --i)
#define FORq(i, m, n) for(int i = (m);i <= (n);++i)
#define FORqr(i, m, n) for(int i = (n);i >=(m);--i)
#define PB push_back
#define MP make_pair
#define DEBUG printf("%s\n","debug")
#define fst first
#define snd second
#define SIN(x, S) (S.count(x) != 0)
#define M0(x) memset(x,0,sizeof(x))
#define FILL(x, y) memset(x,y,sizeof(x))
#define MM(x) memset(x,-1,sizeof(x))
#define ALL(x) (x).begin(),(x).end()
#define SCD(n) scanf("%d",&n)
#define SCD2(m,n) scanf("%d%d",&m,&n)
#define SCD3(m,n,k) scanf("%d%d%d",&m,&n,&k)
#define SCLLD(n) scanf("%lld",&n)
#define SCLLD2(m,n) scanf("%lld%lld",&m,&n)
#define SCLLD3(m,n,k) scanf("%lld%lld%lld",&m,&n,&k)
using namespace std;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef long long ll;
typedef long long integer;
const ll MOD = 1e9+7;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
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;
int K; cin >> K;
vector<ll> B(N);
REP(i,N){
cin >> B[i];
}
ll ans = 1e15;
for (int b = 0; b < (1<<N); b++){
if (__builtin_popcount(b) != K) continue;
vector<ll> A;
A = B;
ll nowH = A[0];
ll nowc = 0;
REP(i,N){
if (i == 0) continue;
if (b & (1<<i)){
if (nowH >= A[i]){
nowc += nowH - A[i] + 1;
A[i] = nowH + 1;
nowH = A[i];
}else{
nowH = A[i];
}
}else{
if (nowH <= A[i]){
nowH = A[i];
}
}
}
chmin(ans,nowc);
}
cout << ans << "\n";
return 0;
} | 1 | 66,758,726 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define REP(i,x,n) for(int i = (x); i < (n); ++i)
#define ll long long
#define P pair<ll,ll>
#define all(v) (v).begin(),(v).end()
const ll mod = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1);
int main(void)
{
ll n,m,k; cin>>n>>m>>k;
rep(i,n+1)rep(j,m+1){
if(i*(m-j)+j*(n-i) == k){
cout<<"Yes"<<endl;
return 0;
}
}
cout<<"No"<<endl;
return 0;
} | #ifdef LOCAL
#define _GLIBCXX_DEBUG
#define __clock__
#else
#pragma GCC optimize("Ofast")
#endif
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;
using PII = pair<ll, ll>;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string& s) {
return '"' + s + '"';
}
string to_string(const char* s) {
return to_string((string) s);
}
string to_string(bool b) {
return (b ? "true" : "false");
}
string to_string(vector<bool> v) {
bool first = true;
string res = "{";
for (int i = 0; i < static_cast<int>(v.size()); i++) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(v[i]);
}
res += "}";
return res;
}
template <size_t N>
string to_string(bitset<N> v) {
string res = "";
for (size_t i = 0; i < N; i++) {
res += static_cast<char>('0' + v[i]);
}
return res;
}
template <typename A>
string to_string(A v) {
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void debug_out() { cerr << '\n'; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
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; }
#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,b) FOR(i, 0, b)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<'\n'
#define p2(s, t) cout << (s) << " " << (t) << '\n'
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << '\n'
#define SZ(x) ((int)(x).size())
#define SORT(A) sort(ALL(A))
#define RSORT(A) sort(ALL(A), greater<ll>())
#define MP make_pair
#define p_yes() p("Yes")
#define p_no() p("No")
ll SUM(VI& V){
return accumulate(ALL(V), 0LL);
}
ll MIN(VI& V){return *min_element(ALL(V));}
ll MAX(VI& V){return *max_element(ALL(V));}
void print_vector(VI& V){
ll n = V.size();
rep(i, n){
if(i) cout << ' ';
cout << V[i];
}
cout << endl;
}
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;
}
using ld = long double;
#define EPS (1e-14)
#define equals(a,b) (fabs((a)-(b)) < EPS)
void no(){p_no(); exit(0);}
void yes(){p_yes(); exit(0);}
const ll mod = 1e9 + 7;
const ll inf = 1e18;
const double PI = acos(-1);
void solve(){
ll a;
cin>>a;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll N,M,K;cin>>N>>M>>K;
if(K==0) yes();
rep(i,N){
rep(j,M){
ll blk = i*j + (N-i)*(M-j);
if(K==blk) yes();
}
}
no();
return 0;
} | 1 | 50,329,834 |
#include<cstdio>
#include<cstring>
#include<algorithm>
#define ll long long
using namespace std;
const int N=1000100,P=1e9+7;
inline int read(){
int x=0,f=0,c=getchar();
for(;c>'9'||c<'0';f=c=='-',c=getchar());
for(;c>='0'&&c<='9';c=getchar())
x=(x<<1)+(x<<3)+c-'0';return f?-x:x;
}
inline void write(ll x){
if(x<0)putchar('-'),x=-x;
if(x>9)write(x/10);putchar(x%10+'0');
}
int n,a[N],h[N],ne[N],to[N],du[N],L,flag=1;
inline void addl(int x,int y){
ne[++L]=h[x];h[x]=L;to[L]=y;du[x]++;
ne[++L]=h[y];h[y]=L;to[L]=x;du[y]++;
}
int dfs(int x,int fa){
if(du[x]==1)return a[x];
int re=a[x]+a[x],k,s;
for(k=h[x];k;k=ne[k])
if(to[k]!=fa){
s=dfs(to[k],x);
if(s>a[x])flag=0;
re-=s;
}if(re>a[x]||re<0)flag=0;
return re;
}
int main(){
int i;
n=read();
for(i=1;i<=n;i++)a[i]=read();
if(n==2){flag=(a[1]==a[2]);}
for(i=1;i<n;i++)addl(read(),read());
for(i=1;i<=n;i++)if(du[i]>1)
{if(dfs(i,0)>0)flag=0;break;}
puts(flag?"YES":"NO");
return 0;
} | #include <cstdio>
#include <fstream>
#include <iomanip>
#include <ios>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <numeric>
#include <random>
#include <array>
#include <bitset>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
template <typename T>
using PQ = priority_queue<T>;
template <typename T>
using GPQ = priority_queue<T, vector<T>, greater<T>>;
using ll = long long;
#define fst first
#define snd second
#define mp make_pair
#define mt make_tuple
#define INT(c) static_cast<int>(c)
#define CHAR(n) static_cast<char>(n)
#define LL(n) static_cast<ll>(n)
#define DOUBLE(n) static_cast<double>(n)
#define ALL(v) (v).begin(), (v).end()
#define SIZE(v) (LL((v).size()))
#define FIND(v, k) (v).find(k) != (v).end()
#define VFIND(v, k) find(ALL(v), k) != (v).end()
#define gsort(b, e) sort(b, e, greater<decltype(*b)>())
template <class T>
ostream& operator<<(ostream& os, vector<T> v) {
os << "[";
for (auto vv : v)
os << vv << ",";
return os << "]";
}
template <class T>
ostream& operator<<(ostream& os, set<T> v) {
os << "[";
for (auto vv : v)
os << vv << ",";
return os << "]";
}
template <class L, class R>
ostream& operator<<(ostream& os, pair<L, R> p) {
return os << "(" << p.fst << "," << p.snd << ")";
}
template <typename T>
T sq(T a) {
return a * a;
}
template <typename T>
T gcd(T a, T b) {
if (a > b) return gcd(b, a);
return a == 0 ? b : gcd(b % a, a);
}
template <typename T, typename U>
T mypow(T b, U n) {
if (n == 0) return 1;
if (n == 1) return b ;
if (n % 2 == 0) {
return mypow(b * b , n / 2);
} else {
return mypow(b, n - 1) * b ;
}
}
ll pcnt(ll b) {
return __builtin_popcountll(b);
}
ll A[100010];
vector<int> path[100010];
bool visited[100010];
ll dfs(int v) {
visited[v] = true;
vector<ll> chl;
ll sum = 0;
for (int sv : path[v]) {
if (visited[sv]) continue;
ll res = dfs(sv);
if (res < 0) return -1;
chl.push_back(res);
sum += res;
}
if (chl.empty()) {
return A[v];
}
if (sum < A[v] || A[v] * 2 < sum) {
return -1;
}
sort(chl.begin(), chl.end());
ll ma = chl.back();
if (sum - ma < ma && ma > A[v]) {
return -1;
}
return A[v] * 2 - sum;
}
int main() {
int N;
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;
path[a].push_back(b);
path[b].push_back(a);
}
fill(visited, visited + N, false);
for (int v = 0; v < N; ++v) {
if (path[v].size() == 1) continue;
cout << (dfs(v) == 0 ? "YES" : "NO") << endl;
return 0;
}
cout << (A[0] == A[1] ? "YES" : "NO") << endl;
return 0;
} | 1 | 20,206,002 |
#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()
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
int main(){
int n; cin >> n;
vector<int> accum(n+1);
vector<int> w(n);
accum[0] = 0;
rep(i,n) cin >> w.at(i);
for(int i=1; i<n+1; i++){
accum.at(i) = accum.at(i-1) + w.at(i-1);
}
int ans = 1e9;
rep(i,n){
ans = min(ans,abs(accum.at(n) - 2*accum.at(i)));
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> w(n);
for(int i = 0; i < n; ++i){
cin >> w[i];
}
int res = 1000000;
int c1,c2;
for(int i = 0; i < n; ++i){
c1 = 0;
c2 = 0;
for(int j = 0; j < n; ++j){
if(j <= i){
c1 += w[j];
}else{
c2 += w[j];
}
}
res = min({res,abs(c1-c2)});
}
cout << res;
} | 1 | 4,291,619 |
#include<iostream>
#include<algorithm>
#define REP(i,n) for(int (i) = (0);(i) < (n);++i)
using namespace std;
#define MAX_D 10000
int dp[MAX_D][MAX_D];
void LS(string a,string b)
{
REP(i,a.size()+1)dp[i][0] = i;
REP(i,b.size()+1)dp[0][i] = i;
for(int i = 1;i <= a.size() ;i++)
{
for(int j = 1;j <= b.size() ;j++)
{
int q = 1;
if(a[i-1] == b[j-1])q = 0;
dp[i][j] = min(min(dp[i-1][j-1]+q,dp[i][j-1]+1),dp[i-1][j]+1);
}
}
}
int main()
{
string a,b;cin >> a >> b;
cout << (LS(a,b),dp[a.size()][b.size()]) << endl;
return 0;
} | #include<iostream>
#include<algorithm>
#include<string.h>
using namespace std;
char S[2][2000];
int length[2];
int changed = 0;
int dp[1500][1500];
int main()
{
cin >> S[0];
cin >> S[1];
for (int a = 0; a < 1000; a++)
{
if (S[0][a] == 0)
{
length[0] = a;
break;
}
}
length[0] = strlen(S[0]);
length[1] = strlen(S[1]);
for (int a = 0; a < 1000; a++)
{
if (S[1][a] == 0)
{
length[1] = a;
break;
}
}
for (int a = 0; a < length[0]+1; a++)
{
dp[0][a] = a;
}
for (int a = 0; a < length[1]+1; a++)
{
dp[a][0] = a;
}
for (int a = 1; a < length[0]+1; a++)
{
for (int b = 1; b < length[1]+1; b++)
{
if (S[0][a-1] == S[1][b-1])
{
dp[b][a] = min(dp[b - 1][a - 1], min(dp[b - 1][a] + 1, dp[b][a - 1] + 1));
}
else
{
dp[b][a] = min(dp[b - 1][a - 1], min(dp[b - 1][a], dp[b][a - 1])) + 1;
}
}
}
cout << dp[length[1]][length[0]] << endl;
return 0;
} | 1 | 79,840,697 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <array>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <sstream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <list>
#include <numeric>
#include <stack>
#include <iomanip>
#include <random>
#include <complex>
#include <functional>
#include <tuple>
#include <new>
using namespace std;
#define EPS (1e-9)
#define INF (1e9)
#define MOD (ll)(1e9 + 7)
#define PI (acos(-1))
#define REP(i,a,n) for(int i=a;i<n;i++)
#define rep(i, n) REP(i,0,n)
#define allof(a) (a).begin(), (a).end()
#define Yes(q) ((q) ? "Yes" : "No")
#define YES(q) ((q) ? "YES" : "NO")
#define Possible(q) ((q) ? "Possible" : "Impossible")
#define POSSIBLE(q) ((q) ? "POSSIBLE" ; "IMPOSSIBLE")
using ll = long long int;
ll gcd(ll a, ll b) {
if (a < b) swap(a, b);
if (b == 0) return a;
return gcd(b, a % b);
}
ll beki(ll a, ll b) {
ll tmp = 1;
rep(i, b) tmp *= a;
return tmp;
}
ll modPow(ll x, ll a) {
if (a == 1) return x;
if (a % 2) return (x * modPow(x, a - 1)) % MOD;
ll t = modPow(x, a / 2);
return ((t % MOD) * (t % MOD)) % MOD;
}
ll modInv(ll x) {
return modPow(x, MOD - 2);
}
int N, X, T;
int main() {
cin >> N >> X >> T;
cout << (N + X - 1) / X * T << endl;
} | #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstring>
#include<queue>
#include<tuple>
#include<utility>
#include<map>
#include<math.h>
#include<iomanip>
#include<stdio.h>
#include<stdlib.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define range(a) a.begin(), a.end()
#define endl "\n"
#define Yes() cout << "Yes" << endl
#define No() cout << "No" << endl
using Graph = vector<vector<int>>;
const unsigned long long mod = 1e9 + 7;
const long long INF = 1LL<<60;
const int dx[4]={1,0,-1,0};
const int dy[4]={0,1,0,-1};
void chmin(long long &a, long long b) { if (a > b) a = b; }
void chmax(long long &a, long long b) { if (a < b) a = b; }
int main(void){
ios::sync_with_stdio(0);
cin.tie(0);
int n,x,t,a; cin>>n>>x>>t;
if(n%x==0) a=n/x;
else a=n/x+1;
cout<<t*a<<endl;
return 0;
} | 1 | 24,010,007 |
#include <iostream>
#include <cmath>
#include <climits>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <algorithm>
#include <numeric>
using namespace std;
#pragma warning(disable: 4996)
int main()
{
int N;
int ret;
ret = scanf("%d", &N);
vector<int> v(N);
for (int i = 0; i < N; i++) {
ret = scanf("%d", &v[i]);
}
int sum = accumulate(v.begin(),v.end(),0);
double average = (double)sum/N;
int average_int = round(average);
int result = 0;
for (int i = 0; i < N; i++) {
result += pow((v[i] - average_int), 2);
}
printf("%d\n", result);
return 0;
} | #include <bits/stdc++.h>
#define rep(i, ns, ne) for (int i = ns; i < ne; ++i)
using namespace std;
int main() {
int N, sum, ans = 10e8;
cin >> N;
vector<int> v(N);
rep(i, 0, N) { cin >> v[i]; }
rep(i, -100, 101) {
sum = 0;
rep(j, 0, N) {
if (i != v[j]) {
sum += (i - v[j]) * (i - v[j]);
}
}
ans = min(ans, sum);
}
cout << ans << endl;
getchar();
} | 1 | 82,655,246 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int h[100];
cin >> n;
for (int i = 0; i < n; i++) cin >> h[i];
int ans = 0;
while (true) {
if (*max_element(h, h + n) == 0) break;
int i = 0;
while (i < n) {
if (h[i] == 0) i++;
else {
ans++;
while (i < n && h[i] > 0) {
h[i]--;
i++;
}
}
}
}
cout << ans << endl;
} | #include <iostream>
using namespace std;
int main(void)
{
int count, a[100], i, N;
cin >> N;
for (i = 0; i < N; i++)
{
cin >> a[i];
}
count = a[0];
for (i = 0; i < N - 1; i++)
{
if (a[i] < a[i + 1])
{
count = count + a[i + 1] - a[i];
}
}
cout << count << endl;
return 0;
} | 1 | 57,182,930 |
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long
#define MOD 1000000007
#define all(c) c.begin(), c.end()
#define rep(i, s, e) for (auto i = s; i < e; i++)
#define peek(v) \
for (auto i : v) \
cout << i << ' ';
void solve()
{
ll n, k;
cin >> n >> k;
multiset<pair<ll, ll>> s;
while (n--)
{
ll a, b;
cin >> a >> b;
s.insert({a, b});
}
for (auto i : s)
{
ll a = i.first;
ll b = i.second;
k -= b;
if (k <= 0)
{
cout << a;
break;
}
}
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
solve();
cerr << "\n\n~" << 500 * clock() / CLOCKS_PER_SEC << "ms\n";
return 0;
} | #include <bits/stdc++.h>
#define repl(i, l, r) for (int i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main()
{
ll n;
ll k;
cin >> n >> k;
vector<ll> x(100001, 0);
rep(i, n) {
ll a, b;
cin >> a >> b;
x[a] += b;
}
ll sum = 0;
rep(i, 100001) {
sum += x[i];
if(sum >= k) {
cout << i << endl;
return 0;
}
}
return 0;
} | 1 | 12,384,743 |
#include <vector>
#include <functional>
#include <iostream>
using namespace std;
int main() {
int n, m; cin >> n >> m;
vector<vector<int> > adj(n);
while (m--) {
int u, v; cin >> u >> v;
u--; v--;
adj[u].push_back(v);
adj[v].push_back(u);
}
long long a = 0, b = 0, c = 0;
int col[n];
bool visited[n];
fill(visited, visited+n, false);
function <bool(int, int)> dfs = [&](int i, int c) {
col[i] = c;
visited[i] = true;
bool ret = true;
for (int j : adj[i]) {
if (!visited[j]) { if (!dfs(j, -c)) ret = false; }
else if (col[j] == c) ret = false;
}
return ret;
};
for (int i = 0; i < n; i++) {
if (adj[i].empty()) a++;
else if (visited[i]) continue;
else if (dfs(i, 1)) b++;
else c++;
}
cout << 2 * a * n - a * a + b * b + (b + c) * (b + c) << endl;
} | #include<bits/stdc++.h>
using namespace std;
const int MaxN=1e5+5;
int N,M,K,Cnt0,Cnt1;
int Fa[MaxN],Size[MaxN],Col[MaxN];
vector<int> To[MaxN];
int Get_Fa(int x){
return x==Fa[x]?x:Fa[x]=Get_Fa(Fa[x]);
}
bool Check(int u){
int i,v;
for(i=0;i<To[u].size();i++)
if(!Col[v=To[u][i]]){
Col[v]=3-Col[u];
if(!Check(v))
return false;
}
else if(Col[u]==Col[v])
return false;
return true;
}
int main(){
int i,u,v,r1,r2;
scanf("%d%d",&N,&M);
for(i=1;i<=N;i++)
Fa[i]=i,Size[i]=1;
while(M--){
scanf("%d%d",&u,&v);
To[u].push_back(v);
To[v].push_back(u);
if((r1=Get_Fa(u))^(r2=Get_Fa(v)))
Fa[r1]=r2,Size[r2]+=Size[r1];
}
for(i=1;i<=N;i++)
if(i==Get_Fa(i)){
if(Size[i]<2)
K++;
else{
Col[i]=1;
Check(i)?Cnt0++:Cnt1++;
}
}
printf("%lld\n",2ll*K*N-1ll*K*K+2ll*Cnt0*Cnt0+1ll*Cnt1*Cnt1+2ll*Cnt0*Cnt1);
return 0;
} | 1 | 62,260,286 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ll k,n;
cin>>k>>n;
ll arr[n+5]={0};
for(int i=0;i<n;i++)
{
cin>>arr[i];
}
ll dis=arr[0]-arr[n-1]+k;
for(int i=0;i<n-1;i++)
{
ll x=abs(arr[i+1]-arr[i]);
dis=max(dis,x);
}
cout<<k-dis<<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int L, N;
cin >> L >> N;
vector<int> A(N);
vector<int> B(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
for (int i = 0; i < N; i++) {
if (i == 0) {
B.at(i) = A.at(0) + L - A.at(N-1);
} else {
B.at(i) = A.at(i) - A.at(i - 1);
}
}
sort(B.begin(), B.end());
cout << L - B.at(N-1) << endl;
} | 1 | 57,689,855 |
#include <bits/stdc++.h>
using namespace std;
typedef int64_t i64;
int main()
{
string n;
cin >> n;
if(n[0] == '1'){
cout << "9";
}else{
cout << "1";
}
if(n[1] == '1'){
cout << "9";
}else{
cout << "1";
}
if(n[2] == '1'){
cout << "9";
}else{
cout << "1";
}
} | #define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <stdio.h>
#include <sstream>
#include <algorithm>
#include <iterator>
#include <cmath>
#include <complex>
#include <string>
#include <cstring>
#include <vector>
#include <bitset>
#include <queue>
#include <set>
#include <map>
#include <stack>
#include <list>
#include <ctime>
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
const int INF = (int)1e9 + 10;
const LL MOD = (LL)1e9 + 7;
const LL LINF = (LL)4e18 + 20;
const LD PI = acos(-1.0);
const double EPS = 1e-9;
using namespace::std;
void solve() {
string S;
cin >> S;
int len = S.size();
for (int i = 0; i < len; ++i) {
if (S[i] == '1') {
S[i] = '9';
}
else {
S[i] = '1';
}
}
cout << S << endl;
}
signed main(void) {
std::cin.tie(0);
std::ios::sync_with_stdio(false);
std::cout << std::fixed;
cout << setprecision(16);
solve();
} | 1 | 63,121,080 |
#include <algorithm>
#include <cstdio>
#include <cstring>
const int N = 1e3;
int n, m, x[N], y[N], c[2];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d%d", x + i, y + i);
c[(x[i] + y[i]) & 1]++;
}
if (c[0] && c[1]) return puts("-1"), 0;
printf(c[0] ? "32\n1 " : "31\n");
for (int i = 30; i >= 0; i--) printf("%d%c", 1 << i, " \n"[!i]);
for (int i = 1; i <= n; i++) {
if (c[0]) putchar('R'), x[i]--;
for (int j = 30; j >= 0; j--)
if (abs(x[i]) > abs(y[i])) {
if (x[i] > 0)
x[i] -= 1 << j, putchar('R');
else
x[i] += 1 << j, putchar('L');
} else {
if (y[i] > 0)
y[i] -= 1 << j, putchar('U');
else
y[i] += 1 << j, putchar('D');
}
if (x[i] || y[i]) printf("[%d %d] WTF\n", x[i], y[i]);
puts("");
}
} | #include<bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define F first
#define S second
#define pb push_back
#define INF 1e18
#define MOD 1000000007
#define N 1000005
#define BB(V) V[V.size()-2]
#define ex(V) return printf(V),0
using namespace std;
pii a[1005];
vector<int>d;
char dir[5]="LUDR";
int main() {
int n;
scanf("%d",&n);
for(int i=0;i<n;i++){
int t1,t2;
scanf("%d%d",&t1,&t2);
a[i]={t1+t2,t1-t2};
if(!!(a[0].F%2)!=!!(a[i].F%2))ex("-1");
}
for(int i=30;i>=0;i--)d.push_back(1<<i);
if(a[0].F%2==0)d.push_back(1);
printf("%u\n",d.size());
for(auto &p:d)printf("%d ",p);
puts("");
for(int i=0;i<n;i++){
ll x=0,y=0;
for (auto &p:d){
int f=0;
if(x<a[i].F)f+=1,x+=p;
else x-=p;
if(y<a[i].S)f+=2,y+=p;
else y-=p;
printf("%c",dir[f]);
}
puts("");
}
} | 1 | 23,577,711 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
string s; cin >> s;
if(s[0] == s[1] && s[1] == s[2])cout << s;
else if(s[0] >= s[1] && s[0] >= s[2]) cout << s[0] << s[0] << s[0];
else cout << char(s[0] + 1) << char(s[0] + 1) << char(s[0] + 1);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n)for(int i=0;i<(n);i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
using ll = long long;
using P = pair<int, int>;
int main(){
int n; cin >> n;
for(int i = n; i <= 999; ++i){
int t = i;
int a = t % 10;
t /= 10;
int b = t % 10;
t /= 10;
int c = t;
if(a == b && b == c) {
cout << i << endl;
return 0;
}
}
} | 1 | 78,885,641 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
const ll mod=1e9+7,INF=mod*mod*3;
#define rep(i,N) for(ll i=0; i<(N); i++)
#define rep1(i,N) for(ll i=1; i<(N); i++)
#define pb push_back
ll N;
ll A[100005];
ll dp[100005];
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
cin>>N;
rep(i,N+1) cin>>A[i];
if(N==0){
if(A[0]!=1){
cout<<-1<<endl;
return 0;
}
}
dp[0]=1-A[0];
if(N){
if(dp[0]<=0){
cout<<-1<<endl;
return 0;
}
}
rep1(i,N+1){
if(dp[i-1]>1e18) dp[i]=INF;
else dp[i]=2*(dp[i-1]-A[i-1]);
if(i<N){
if(dp[i]<=A[i]){
cout<<-1<<endl;
return 0;
}
}
if(i==N){
if(dp[i]<A[i]){
cout<<-1<<endl;
return 0;
}
}
}
ll ans=A[N];
ll son=A[N];
for(ll i=N; i>=1; i--){
ll parent=dp[i-1]-A[i-1];
if(son>2*parent){
cout<<-1<<endl;
return 0;
}
else if(son<parent){
son=son+A[i-1];
}
else{
son=parent+A[i-1];
}
ans+=son;
}
cout<<ans<<endl;
} | #include<bits/stdc++.h>
#define ll long long
#define fornum(A,B,C) for(A=B;A<C;++A)
#define pii pair<int,int>
#define pll pair<ll,ll>
using namespace std;
#define INF (ll)1e18
ll N,A[202020];
ll mk[202020];
ll i, j, k,ans;
void no(){
printf("-1\n");
exit(0);
}
pll calc(ll d,ll mx){
if(d==N){
if(mx<A[d])
no();
ans += A[d];
return {(A[d] + 1) / 2, min(A[d], mx / 2)};
}
if(mx<=A[d])
no();
pll rt = calc(d + 1, min((mx - A[d]) * 2, (ll)1e18));
if(rt.first>rt.second){
no();
}
ans += min(rt.second + A[d], mx);
return {(rt.first + A[d] + 1) / 2, min(rt.second + A[d], mx / 2)};
}
int main(){
scanf("%lld", &N);
fornum(i,0,N+1){
scanf("%lld", &A[i]);
}
if(N==0){
if(A[0]==1){
printf("1\n");
return 0;
}else{
no();
}
}
if(A[0]!=0)
no();
calc(0, 1);
printf("%lld\n", ans);
return 0;
} | 1 | 95,897,485 |
#include <iostream>
#include <string>
using namespace std;
int main(){
int n;
int k;
int b;
int c;
int d;
while(cin>>n){
if(n==0){break;}
cin>>k;
int a[n];
b=0;
while(b<n){
cin >>a[b];
b=b+1;}
c=0;
b=0;
while(b<k){
c=c+a[b];
b=b+1;}
d=c;
while(b<n){
c=c-a[b-k]+a[b];
if(c>d){d=c;}
b=b+1;}
cout << d<<endl;}
} | #include<bits/stdc++.h>
using namespace std;
int N,K;
int a[100000];
int main()
{
while(scanf("%d%d",&N,&K),N||K){
for(int i=0;i<N;i++)scanf("%d",&a[i]);
int sum=0;
for(int i=0;i<K;i++)sum+=a[i];
int ma=sum;
for(int i=K;i<N;i++){
sum-=a[i-K];
sum+=a[i];
ma=max(ma,sum);
}
printf("%d\n",ma);
}
return 0;
} | 1 | 28,663,474 |
#include <bits/stdc++.h>
#define ll long long
#define pi 3.14159265358979
#define mod 1000000007
#define rep(i,n) for(ll i=0;i<n;i++)
using namespace std;
const int INF = 1000100100;
int main(){
ll n,cnt=0,sum=0,ans;
string s;
cin>>s;
n=s.size();
rep(i,n){
if(s[i]=='B'){
cnt++;
sum+=n-i;
}
}
ans=sum-cnt*(cnt+1)/2;
cout<<ans;
} | #include <bits/stdc++.h>
#define PI 3.14159265359
#define INF 1000000009
#define LINF 1000000000000000009
#define IMOD 1000000007
#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 lrep(i,n) for(long long i = 0; i < (long long)(n); i++)
#define lrep2(i,a,n) for(long long i = (long long)(a); i <= (long long)(n); i++)
#define irrep(i,n) for(int i = (int)(n-1); i > -1; i--)
#define irrep2(i,a,n) for(int i = (int)(n); i >= (int)(a); i--)
typedef long long ll;
typedef std::vector<char> v_char;
typedef std::vector<v_char > v2_char;
typedef std::vector<double> v_double;
typedef std::vector<v_double > v2_double;
typedef std::vector<int> v_int;
typedef std::vector<v_int > v2_int;
typedef std::vector<ll> v_ll;
typedef std::vector<v_ll > v2_ll;
typedef std::vector<std::string> v_string;
typedef std::vector<v_string > v2_string;
typedef std::vector<bool> v_bool;
typedef std::vector<v_bool > v2_bool;
typedef std::pair<ll, ll> pll;
typedef std::pair<int, int> pii;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
using namespace std;
int main(void)
{
string s;
cin >> s;
int n = s.size();
v_int a(n, 0);
irep(i, n) {
if(s[i] == 'W') {
a[i] = 1;
}
}
ll ans = 0;
ll white = 0;
irep(i, n) {
if(a[i] == 0) {
while(i < n && a[i] == 0) {
i++;
}
}
if(a[i]) {
ans += (i - white);
white++;
}
}
cout << ans << endl;
return 0;
} | 1 | 76,190,972 |
#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;
int len = s.size();
if(s[0] != 'A'){
cout << "WA" << endl;
return 0;
}
int ccnt = 0;
int cind;
for(int i = 2;i <= len-2;i++){
if(s[i] == 'C'){
ccnt++;
cind = i;
}
}
if(ccnt != 1){
cout << "WA" << endl;
return 0;
}
for(int i = 1;i < len;i++){
if(i == cind) continue;
if(isupper(s[i])){
cout << "WA" << endl;
return 0;
}
}
cout << "AC" << endl;
} | #include <iostream>
#include <string>
using namespace std;
int main()
{
string S;
cin >> S;
bool ans = true;
if (S[0]!='A') ans = false;
int Ccnt = 0;
for (int i = 2; i <= S.length()-2; i++) {
if (S[i]=='C') Ccnt++;
}
if (Ccnt!=1) ans = false;
int CpCnt = 0;
for (int i = 0; i < S.length(); i++) {
if (('A'<= S[i]) && (S[i] <= 'Z')) CpCnt++;
}
if (CpCnt != 2) ans = false;
if (ans) cout << "AC" << endl;
else cout << "WA" << endl;
return 0;
} | 1 | 84,637,736 |
#include<stdio.h>
#include<algorithm>
#include<string.h>
#include<queue>
using namespace std;
int vis[100009];
typedef pair<int, int> P;
int main()
{
int k;
scanf("%d", &k);
deque<P> q;
memset(vis, 0, sizeof(vis));
q.push_back(make_pair(1, 1));
while(!q.empty())
{
P x = q.front(); q.pop_front();
if(vis[x.first]) continue;
vis[x.first] = 1;
if(x.first == 0)
{
printf("%d\n", x.second);
break;
}
q.push_front(make_pair(x.first*10 % k, x.second));
q.push_back(make_pair((x.first+1) % k, x.second+1));
}
return 0;
} | #include <bits/stdc++.h>
#define il inline
#define rg register
using namespace std;
typedef long long LL;
const LL m_63=1061109567;
const LL m_127=2139062143;
const int inf=2147483647;
const double pi=atan(1.0)*4.0;
const LL llf=9223372036854775807;
const LL N=1e6+7;
const int M=1e6;
int n,d[N],flag[N];
int num,b[N],w[N],p[N],nt[N];
il LL read(){
LL x(0),ff(1);char ch=getchar();
while(ch<'0'||ch>'9'){
if(ch=='-')ff=-1;
ch=getchar();
}
while(ch>='0'&&ch<='9')x=x*10+ch-'0',ch=getchar();
return x*ff;
}
il void fre(){
freopen("6.in","r",stdin);
}
il void spfa(){
queue<int>q;
memset(d,127,sizeof(d));
memset(flag,0,sizeof(flag));
q.push(1);d[1]=0;
while(!q.empty()){
int k=q.front();q.pop();
int e=p[k];flag[k]=0;
while(e){
int kk=b[e];
if(d[kk]>d[k]+w[e]){
d[kk]=d[k]+w[e];
if(!flag[kk]){
flag[kk]=1;
q.push(kk);
}
}
e=nt[e];
}
}
}
il void add(int x,int y,int z){b[++num]=y,w[num]=z,nt[num]=p[x],p[x]=num;}
int main(){
int k=read();
for(rg int j=0;j<k;++j){
add(j,(j+1)%k,1);
add(j,(j*10)%k,0);
}
spfa();
printf("%d\n",d[0]+1);
return 0;
} | 1 | 33,207,040 |
#include <bits/stdc++.h>
using namespace std;
using Pair = pair<int64_t, int64_t>;
constexpr int64_t kInf = INT64_MAX / 2L;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int64_t N;
cin >> N;
int64_t result = 0;
if (N % 2 == 0) {
N /= 2;
int64_t p = 5;
while (p <= N) {
result += N / p;
p *= 5;
}
} else {
result = 0;
}
cout << result << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define fi first
#define se second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define debug(a) cout << #a << " = " << a << " ";
#define endl "\n"
const int MOD=1000000007;
const int N=100010;
void solve(){
ll n;
cin>>n;
if(n%2==1){
cout<<"0\n";
return ;
}
ll tw=0,fiv=0;
ll tPower=2,fPower=10;
while(tPower<=n){
tw+=n/tPower;
tPower*=2LL;
}
while(fPower<=n){
fiv+=n/fPower;
fPower*=5LL;
}
ll ans=min(tw,fiv);
cout<<ans<<endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long int t = 1;
for (long int tt = 1; tt <= t; tt++) {
solve();
}
return 0;
} | 1 | 34,352,381 |
#include <bits/stdc++.h>
#include <assert.h>
using namespace std;
long long x[100000], y[100000];
int main()
{
int n, m;
cin >> n >> m;
for (int i = 0; i < n; i++)
cin >> x[i];
for (int i = 0; i < m; i++)
cin >> y[i];
long long xs = 0, ys = 0;
for (int i = 0; i < n; i++)
xs += x[i] * (i - (n - i - 1));
for (int i = 0; i < m; i++)
ys += y[i] * (i - (m - i - 1));
cout << (xs % 1000000007) * (ys % 1000000007) % 1000000007 << endl;
return 0;
} | #include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cctype>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>
using namespace std;
#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define MOD 1000000007
#define rep(i,n) for(i=0;i<(n);i++)
#define loop(i,a,n) for(i=a;i<(n);i++)
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int,int> pii;
int main(void) {
int i,j;
int n,m;
cin>>n>>m;
vector<ll> x(n+1),y(m+1);
x[0]=y[0]=0;
rep(i,n)cin>>x[i+1];
rep(i,m)cin>>y[i+1];
rep(i,n)x[i+1]+=1000000000;
rep(i,m)y[i+1]+=1000000000;
rep(i,n)x[i+1]+=x[i];
rep(i,m)y[i+1]+=y[i];
ll xsum=0,ysum=0;
rep(i,n)(xsum+=i*(x[i+1]-x[i])-x[i])%=MOD;
rep(i,m)(ysum+=i*(y[i+1]-y[i])-y[i])%=MOD;
cout<<(xsum*ysum)%MOD<<endl;
} | 1 | 44,419,329 |
#include <bits/stdc++.h>
int main() {
int n;
std::cin >> n;
int len = 0;
std::vector<int> a(n), lis(n, -1);
for (int i = 0; i < n; i++) {
std::cin >> a[i];
if (i == 0) {
lis[len] = a[i];
len++;
continue;
}
if (lis[len - 1] < a[i]) {
lis[len] = a[i];
len++;
} else {
for (int j = 0; j < len; j++) {
if (lis[j] >= a[i]) {
lis[j] = a[i];
break;
}
}
}
}
std::cout << len << std::endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i < (int)(n); i++)
using ull = unsigned long long;
using ll = long long;
const int INF = 1E+9;
int main() {
int N;
cin >> N;
int a[N];
rep(i, N) cin >> a[i];
int LIS[N];
fill(LIS, LIS + N, INF);
rep(i, N) {
auto pos = lower_bound(LIS, LIS+N, a[i]);
*pos = a[i];
}
cout << lower_bound(LIS, LIS+N, INF) - LIS << endl;
return 0;
} | 1 | 5,746,501 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef pair<int, int> pii;
#define INF 1e9
#define LINF __LONG_LONG_MAX__
bool isUpper(char c) {
return 'A' <= c && c <= 'Z';
}
bool isLower(char c) {
return 'a' <= c && c <= 'z';
}
int main() {
string S; cin >> S;
int N = S.size();
if (S[0] != 'A') {
cout << "WA" << endl;
return 0;
}
int cnt = 0;
int index = -1;
for (int i = 2; i <= N - 2; i++) {
if (S[i] == 'C') {
cnt++;
index = i;
}
}
if (cnt != 1) {
cout << "WA" << endl;
return 0;
}
for (int i = 0; i < N; i++) {
if (i == 0) continue;
if (i == index) continue;
if (!isLower(S[i])) {
cout << "WA" << endl;
return 0;
}
}
cout << "AC" << endl;
} | #include<bits/stdc++.h>
using namespace std ;
int main(){
string S ;
cin >> S ;
int N = S.size() ;
int cnt = 0 ;
int total = 0 ;
if(S.at(0) != 'A'){
cout << "WA" << endl ;
return 0 ;
}
for(int i = 2 ; i < N-1 ; i++){
if(S.at(i) == 'C'){
cnt++ ;
}
}
for(int i = 0 ; i< N ; i++){
if(isupper(S.at(i))){
total++ ;
}
}
if(cnt != 1){
cout << "WA" << endl ;
return 0 ;
}
if(total > 2){
cout << "WA" << endl ;
return 0 ;
}
cout << "AC" << endl ;
} | 1 | 75,739,762 |
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
using namespace std;
int main()
{
string s;
cin >> s;
int size_s = s.length();
int sub_s, sub_e;
sub_s = -1, sub_e = -1;
for(int i=0; i<size_s-1; ++i){
if(s.substr(i, 1) == s.substr(i+1, 1)){
sub_s = i+1;
sub_e = i+2;
break;
}
}
for(int i=0; i<size_s-2; ++i){
if(s.substr(i, 1) == s.substr(i+2, 1)){
sub_s = i+1;
sub_e = i+3;
break;
}
}
cout << sub_s << " " << sub_e << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
int n = s.length();
int a = -1, b = -1;
for(int i=0; i<n; i++){
if(i <= n-2 && s[i] == s[i+1]){
a = i+1;
b = i+2;
break;
}
if(i <= n-3 && s[i] == s[i+2]){
a = i+1;
b = i+3;
break;
}
}
cout << a << " " << b << endl;
return 0;
} | 1 | 76,147,843 |
#include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <set>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define dbg(x) cout<<#x"="<<x<<endl
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<pii, int> ppi;
#define INF 1000000000
char t[9][5] = {
{'.',',','!','?',' '},
{'a','b','c',0,0},
{'d','e','f',0,0},
{'g','h','i',0,0},
{'j','k','l',0,0},
{'m','n','o',0,0},
{'p','q','r','s',0},
{'t','u','v',0,0},
{'w','x','y','z',0}};
int sz[9] = {5,3,3,3,3,3,4,3,4};
int main(){
int n;
scanf("%d\n", &n);
rep(i,n){
char last=0; int cnt=0;
while(true){
char c;
scanf("%c",&c);
if(c==last){
cnt++;
}
else if(c=='0' && last!=0){
printf("%c", t[last-'1'][cnt%sz[last-'1']]);
last=0;
cnt=0;
}
else if(c=='\n'){
break;
}
if(c!='0') last = c;
else last = 0;
}
cout << endl;
}
} | #include <bits/stdc++.h>
#include <tuple>
#include <iterator>
using namespace std;
using ll = long long;
char t[][5] = {
{},
{'.', ',', '!', '?', ' '},
{'a', 'b', 'c'},
{'d', 'e', 'f'},
{'g', 'h', 'i'},
{'j', 'k', 'l'},
{'m', 'n', 'o'},
{'p', 'q', 'r', 's'},
{'t', 'u', 'v'},
{'w', 'x', 'y', 'z'}};
int main()
{
int n;
cin >> n;
vector<string> ans;
for (int i = 0; i < n; ++i)
{
string s;
cin >> s;
string sum = "";
int cnt = 0;
char c = '0';
for (int j = 0; j < s.size(); ++j)
{
if (s[j] == '0')
{
if (c == '0')
continue;
if ((c - '0') == 1)
sum += t[c - '0'][(cnt - 1) % 5];
else if ((c - '0') == 7 || (c - '0') == 9)
sum += t[c - '0'][(cnt - 1) % 4];
else
sum += t[c - '0'][(cnt - 1) % 3];
cnt = 0;
c = '0';
}
else
{
c = s[j];
cnt++;
}
}
ans.push_back(sum);
}
for (auto &e : ans)
cout << e << endl;
return 0;
} | 1 | 38,007,324 |
Subsets and Splits