code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 45
101M
|
|---|---|---|---|
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <string>
#include <functional>
#include <set>
#define DB cerr<<"D"<<endl
#define pb push_back
using namespace std; using ll=long long; using ld=long double; const int INF=1e9; const ll LINF=1e18; const double dINF = 1e18; const ld ldINF = 1e18; const double EPS = 1e-6;
template<typename T, typename U, typename O> void caut(T a, U b, O c){cout<<"("<<a<<","<<b<<","<<c<<") ";} template<typename T, typename U> void caut(T a, U b){cout<<"("<<a<<","<<b<<") ";} template<typename T> void caut(T a){cout<<"("<<a<<") ";}
using P=pair<double,int>;
const ll M = 1e9+7;
void add(ll& x, ll y) {x+=y; x%=M;}
void chmax(ll& x, ll y) {if (x<y) x=y;}
int main() {
int a,b,c; cin>>a>>b>>c;
if (a==b&&a==c) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
} | #include <bits/stdc++.h>
using namespace std ;
typedef double du ;
typedef string st ;
typedef long long ll ;
typedef long double ld ;
typedef long long int lli ;
#define vi vector <lli>
#define loop(num) for (lli i = 0 ; i < num ; i ++ )
#define loopcin(num , ar ) for (lli i = 0 ; i < num ; i ++ ) {cin >> ar [i] ;}
#define loopcout(num , ar) for (lli i = 0 ; i < num ; i ++ ) {cout << ar [i] << ' '; }
#define forr(num1 , num2) for (lli i = num1 ; i < num2 ; i ++ )
#define forrcin(num1 , num2 , ar ) for (lli i = num1 ; i < num2 ; i ++ ) {cin >> ar [i] ;}
#define forrcout(num1 , num2 , ar) for (lli i = num1 ; i < num2 ; i ++ ) {cout << ar [i] << ' '; }
#define D2forrcin(num1_1 , num1_2 , num2_1 , num2_2 , A ) for (lli i = num1_1 ; i < num1_2 ; i ++){ for (lli j = num2_1 ; j < num2_2 ; j++){cin >> A[i][j] ;}}
#define D2forrcout(num1_1 , num1_2 , num2_1 , num2_2 , A ) for (lli i = num1_1 ; i < num1_2 ; i ++){ for (lli j = num2_1 ; j < num2_2 ; j++){cout << A[i][j] << ' ' ;}cout << endl ;}
#define YES cout << "YES" << endl
#define Yes cout << "Yes" << endl
#define NO cout << "NO" << endl
#define No cout << "No" << endl
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int main ()
{
fastio
lli num ;
cin >> num ;
if (num < 1200)
cout << "ABC" ;
else if (num < 2800)
cout << "ARC" ;
else
cout << "AGC" ;
return 0 ;
} | 0 | 36,512,260 |
#pragma GCC optimize("O3")
#define _GLIBCXX_DEBUG
#include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < ll(n); i++)
#define REPD(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (int i = a; i < ll(b); i++)
#define FORD(i, a, b) for (int i = a; i > ll(b); i--)
#define ALL(x) x.begin(), x.end()
#define SIZE(x) ll(x.size())
const long long INF = 1e12;
const int MOD = 1e9 + 7;
#define MAXR 100000
#define Umap unordered_map
#define Uset unordered_set
#define int long long
#define P pair<int, int>
#define MP make_pair
const unsigned int BIT_FLAG_0 = (1 << 0);
const unsigned int BIT_FLAG_1 = (1 << 1);
const unsigned int BIT_FLAG_2 = (1 << 2);
const unsigned int BIT_FLAG_3 = (1 << 3);
const unsigned int BIT_FLAG_4 = (1 << 4);
const unsigned int BIT_FLAG_5 = (1 << 5);
const unsigned int BIT_FLAG_6 = (1 << 6);
const unsigned int BIT_FLAG_7 = (1 << 7);
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1},
Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
void print() { cout << endl; }
template <class Head, class... Tail> void print(Head &&head, Tail &&... tail) {
cout << head;
if (sizeof...(tail) != 0)
cout << " ";
print(forward<Tail>(tail)...);
}
template <class T> void print(vector<T> &vec) {
for (auto &a : vec) {
cout << a;
if (&a != &vec.back())
cout << " ";
}
cout << endl;
}
template <class T> void print(vector<vector<T>> &df) {
for (auto &vec : df) {
print(vec);
}
}
void add(long long &a, long long b) {
a += b;
if (a >= MOD)
a -= MOD;
}
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;
}
long long power(long long a, long long n) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a;
a = a * a;
n >>= 1;
}
return res;
}
signed main() {
int n, p;
cin >> n >> p;
int even = 0;
int odd = 0;
REP(i, n) {
int val;
cin >> val;
if (val % 2 == 0) {
even++;
} else {
odd++;
}
}
if (odd == 0 && p == 1) {
print(0);
} else if (odd == 0 && p == 0) {
print(power(2, even));
} else {
print(power(2, even) * power(2, odd) / 2);
}
} | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define each(it,v) for(auto &it : v)
#define All(v) (v).begin(),(v).end()
#define vi vector<int>
#define vl vector<long>
#define P pair<int,int>
#define Graph vector<vector<int>>
using namespace std;
main()
{
int n,m; cin>>n>>m;
vl a(n);
rep(i,n)cin>>a[i];
vl wa(n+1,0);
rep(i,n)wa[i+1]=wa[i]+a[i];
vl mod(n+1);
rep(i,n+1)mod[i]=wa[i]%m;
map<long,long> M;
rep(i,n+1)M[mod[i]]++;
long ans=0;
each(it,M)ans+=it.second*(it.second-1)/2;
cout<<ans<<endl;
} | 0 | 8,370,881 |
#include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <ctype.h>
#include <math.h>
#include <stack>
#include <string>
#include <string.h>
using namespace std;
double PI = 3.1415926535897932;
long mod = 1000000007;
const long INF = (1<<30);
int main() {
string s,t;
cin >> s >> t;
bool flag = 0;
for(int i = 0; i < s.size(); i++) {
string a = s.substr(0,i);
string b = s.substr(i);
if(a+b == t | b+a == t) flag = 1;
}
if(flag)
cout << "Yes" << endl;
else cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define pb push_back
#define eb emplace_back
#define a first
#define b second
#define bg begin()
#define ed end()
#define all(x) x.bg,x.ed
const ll MOD = 998244353;
ll modpow(ll base, int p) {
ll mul = base;
ll ret = 1;
while (p) {
if (p&1) {
ret *= mul;
ret %= MOD;
}
mul *= mul;
mul %= MOD;
p >>= 1;
}
return ret;
}
int main() {
int n;
cin >> n;
unordered_map<int, int> mp;
int maxa = 0;
vector<int> va(n);
rep(i, n) {
int as;
cin >> va[i];
mp[va[i]]++;
maxa = max(maxa, va[i]);
}
if (mp[0] != 1 || va[0] != 0) {
cout << 0 << endl;
return 0;
}
ll ret = 1;
ll pre = 1;
for (int a = 1; a <= maxa; ++a) {
if (mp[a] == 0) {
ret = 0;
break;
}
ret *= modpow(pre, mp[a]);
ret %= MOD;
pre = mp[a];
}
cout << ret << endl;
return 0;
} | 0 | 89,512,632 |
#pragma GCC optimize("Ofast")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define all(x) x.begin(), x.end()
#define F first
#define S second
#define pb push_back
#define pl pair<ll, ll>
#define vl vector<ll>
#define vi vector<int>
#define endl '\n'
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...);}
#ifdef LOCAL
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
template <typename T, typename TT>
ostream &operator<<(ostream &os, const pair<T, TT> &t) {
return os << t.first << " " << t.second;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &t) {
for (auto &i : t) os << i << " ";
return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
for (T &t : v) is >> t;
return is;
}
template <typename T1, typename T2>
istream &operator>>(istream &is, vector<pair<T1, T2>> &v) {
for (pair<T1, T2> &t : v) is >> t.first >> t.second;
return is;
}
const ll mod = 1e9 + 7;
void solve() {
ll n; cin >> n;
cout << 8 - (n - 400)/200 << endl;;
}
int main()
{
fast;
ll t = 1;
while(t--) {
solve();
}
return 0;
} | #include <bits/stdc++.h>
#define f(i,n) for(int i=0;i<(n);i++)
#define inf (int)(3e18)
#define int long long
#define mod (int)(1000000007)
#define intt long long
#define P pair<int,int>
using namespace std;
int modpow(int x, int y, int m = mod) {
int res = 1;
while (y) {
if (y % 2) {
res *= x;
res %= m;
}
x = x * x % mod;
y /= 2;
}
return res;
}
int mypow(int x, int y) {
int res = 1;
while (y) {
if (y % 2) {
res *= x;
}
x = x * x;
y /= 2;
}
return res;
}
bool prime(int x) {
for (int i = 2; i * i <= x; i++) {
if (!(x % i)) {
return false;
}
}
return true;
}
double kyori(pair<int, int> f, pair<int, int> s) {
double ans = 0;
double t = fabs(f.first - s.first);
double y = fabs(f.second - s.second);
ans = sqrt(t * t + y * y);
return ans;
}
inline int gcd(int x, int y) {
if (!y) {
return x;
}
return gcd(y, x % y);
}
class Union_Find {
vector<int> par;
vector<int> rankmy;
public:
Union_Find(int size) {
par = vector<int>(size);
rankmy = vector<int>(size);
for (int i = 0; i < size; i++) {
par[i] = i;
}
}
int find(int x) {
if (par[x] == x) {
return x;
}
return par[x] = find(par[x]);
}
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y) {
return;
}
if (rankmy[x] < rankmy[y]) {
par[x] = y;
}
else {
par[y] = x;
if (rankmy[x] == rankmy[y]) {
rankmy[x]++;
}
}
}
bool same(int x, int y) {
return find(x) == find(y);
}
};
template <class T>
class SegTree {
int n;
vector<T> data;
T def;
function<T(T, T)> operation;
function<T(T, T)> update;
T _query(int a, int b, int k, int l, int r) {
if (r <= a || b <= l) return def;
if (a <= l && r <= b)
return data[k];
else {
T c1 = _query(a, b, 2 * k + 1, l, (l + r) / 2);
T c2 = _query(a, b, 2 * k + 2, (l + r) / 2, r);
return operation(c1, c2);
}
}
public:
SegTree(size_t _n, T _def, function<T(T, T)> _operation,
function<T(T, T)> _update)
: def(_def), operation(_operation), update(_update) {
n = 1;
while (n < _n) {
n *= 2;
}
data = vector<T>(2 * n - 1, def);
}
void change(int i, T x) {
i += n - 1;
data[i] = update(data[i], x);
while (i > 0) {
i = (i - 1) / 2;
data[i] = operation(data[i * 2 + 1], data[i * 2 + 2]);
}
}
T query(int a, int b) {
return _query(a, b, 0, 0, n);
}
T operator[](int i) {
return data[i + n - 1];
}
};
#define R_MIN ([](long long a, long long b) { return min(a, b); })
#define R_MAX ([](long long a, long long b) { return max(a, b); })
#define R_SUM ([](long long a, long long b) { return a + b; })
#define NORMAL_UPDATE ([](long long a, long long b) { return b; })
#define ADD_UPDATE ([](long long a, long long b) { return a + b; })
#define MINUS_UPDATE ([](long long a, long long b) { return a - b; }
int keta(int x) {
int ans = 0;
while (x) {
x /= 10;
ans++;
}
return ans;
}
int ketasum(int x) {
int ans = 0;
while (x) {
ans += x % 10;
x /= 10;
}
return ans;
}
inline int lcm(int x, int y) {
int ans = x / gcd(x, y) * y;
return ans;
}
int twobeki(int x) {
int ans = 0;
while (1) {
if (!(x & 1)) {
ans++;
x /= 2;
}
else {
break;
}
}
return ans;
}
int kai(int x, int y) {
int res = 1;
for (int i = x - y + 1; i <= x; i++) {
res *= i; res %= mod;
}
return res;
}
int comb(int x, int y) {
if (y > x)return 0;
return kai(x, y) * modpow(kai(y, y), mod - 2) % mod;
}
int fukugen(vector<int> l) {
int ans = 0;
for (int i = 0; i < (int)l.size(); i++) {
ans *= 10;
ans += l[i];
}
return ans;
}
int nanjyo(int n){
int ans=0;
while (n>1) {
ans++;
n/=2;
}
return ans;
}
bool intersect(pair<pair<int,int>, pair<int,int>>p1 ,pair<pair<int,int>,pair<int,int>>p2){
int men11=(p2.first.first-p1.first.first)*(p2.second.second-p1.first.second)-(p2.second.first-p1.first.first)*(p2.first.second-p1.first.second);
int men12=(p2.first.first-p1.second.first)*(p2.second.second-p1.second.second)-(p2.second.first-p1.second.first)*(p2.first.second-p1.second.second);
int men21=(p1.first.first-p2.first.first)*(p1.second.second-p2.first.second)-(p1.second.first-p2.first.first)*(p1.first.second-p2.first.second);
int men22=(p1.first.first-p2.second.first)*(p1.second.second-p2.second.second)-(p1.second.first-p2.second.first)*(p1.first.second-p2.second.second);
return ((signbit(men11)) ^ (signbit(men12))) && ((signbit(men21)) ^ (signbit(men22)));
}
template <class T, class U>
inline bool chmax(T& lhs, const U& rhs) {
if (lhs < rhs) {
lhs = rhs;
return 1;
}
return 0;
}
template <class T, class U>
inline bool chmin(T& lhs, const U& rhs) {
if (lhs > rhs) {
lhs = rhs;
return 1;
}
return 0;
}
void Yes(){
cout<<"Yes"<<endl;
}
void No(){
cout<<"No"<<endl;
}
void YES(){
cout<<"YES"<<endl;
}
void NO(){
cout<<"NO"<<endl;
}
int yakusuu(int x){
int ans=0;
for (int i=1; i*i<=x; i++) {
if (!(x%i)) {
if (i*i==x) {
ans++;
}
else ans+=2;
}
}
return ans;
}
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<=n;i++)
int n,m,x[100004],y[100004],z[100004],ans;
signed main(){
cin>>n>>m;
ans=0-inf;
rep(i, n)scanf("%lld%lld%lld",&x[i],&y[i],&z[i]);
rep(i, 8){
bitset<4> bits(i);
vector<int> vec;
rep(j, n){
int ad=0;
if (!bits[0]) {
ad+=x[j];
}else{
ad-=x[j];
}
if (!bits[1]) {
ad+=y[j];
}else{
ad-=y[j];
}
if (!bits[2]) {
ad+=z[j];
}else{
ad-=z[j];
}
vec.push_back(ad);
}
sort(vec.begin(), vec.end(),greater<int>());
int karians=0;
rep(j, m){
karians+=vec[j];
}
chmax(ans, karians);
}
cout<<ans<<endl;
} | 0 | 11,863,943 |
#include <bits/stdc++.h>
#define pt(sth) cout << sth << "\n"
#define chmax(a, b) {if(a<b) a=b;}
#define chmin(a, b) {if(a>b) a=b;}
#define moC(a, s, b) (a)=((a)s(b)+MOD)%MOD
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
static const ll INF=1e18;
static const ll MAX=101010;
static const ll MOD=1e9+7;
static const ll LOGN=55;
int main(void) {
double N, M, d;
cin >> N >> M >> d;
double ans;
if(d)
ans=2*(N-d)/N/N*(M-1);
else
ans=1/N*(M-1);
printf("%.9f\n", ans);
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
#define MAX_N 5000
#define MAX_K 5000
int N, K;
ll A[MAX_N];
bool dp[MAX_N][MAX_K];
ll max(ll a, ll b) { return a > b ? a : b; }
bool need(int i) {
for (int n = 0; n < N; n++)
for (int k = 0; k < K; k++)
dp[n][k] = false;
dp[0][0] = true;
int elm_num = 0;
for (int a_idx = 0; a_idx < N; a_idx++) {
if (a_idx == i) continue;
ll a = A[a_idx];
for (int k = 0; k < K; k++)
dp[elm_num+1][k] = dp[elm_num][k] || (a <= k && dp[elm_num][k-a]);
elm_num++;
}
for (ll k = max(K-A[i], 0); k < K; k++)
if (dp[N-1][k]) return true;
return false;
}
int no_need() {
sort(A, A+N);
int l = -1, r = N;
while (l + 1 < r) {
int m = (l + r) / 2;
if (need(m)) r = m;
else l = m;
}
return l + 1;
}
int main(int argc, char **argv) {
cin >> N >> K;
for (int i = 0; i < N; i++) cin >> A[i];
int ans = no_need();
cout << ans << endl;
} | 0 | 89,607,475 |
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <clocale>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define FOR(i, s, n) for(int i = (s), i##_len=(n); i < i##_len; ++i)
#define FORS(i, s, n) for(int i = (s), i##_len=(n); i <= i##_len; ++i)
#define VFOR(i, s, n) for(int i = (s); i < (n); ++i)
#define VFORS(i, s, n) for(int i = (s); i <= (n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define REPS(i, n) FORS(i, 0, n)
#define VREP(i, n) VFOR(i, 0, n)
#define VREPS(i, n) VFORS(i, 0, n)
#define RFOR(i, s, n) for(int i = (s), i##_len=(n); i >= i##_len; --i)
#define RFORS(i, s, n) for(int i = (s), i##_len=(n); i > i##_len; --i)
#define RREP(i, n) RFOR(i, n, 0)
#define RREPS(i, n) RFORS(i, n, 0)
#define ALL(v) (v).begin(), (v).end()
#define SORT(v) sort(ALL(v))
#define RSORT(v) sort(ALL(v), greater<decltype(v[0])>())
#define SZ(x) ((int)(x).size())
#define REV(x) reverse(ALL(x))
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define MT make_tuple
#define BIT(n) (1LL<<(n))
#define UNIQUE(v) v.erase(unique(ALL(v)), v.end())
using ld = long double;
using ll = long long;
using ui = unsigned int;
using ull = unsigned long long;
using Pi_i = pair<int, int>;
using Pll_ll = pair<ll, ll>;
using VB = vector<bool>;
using VC = vector<char>;
using VD = vector<double>;
using VI = vector<int>;
using VLL = vector<ll>;
using VS = vector<string>;
using VSH = vector<short>;
using VULL = vector<ull>;
const int MOD = 1000000007;
const int INF = 1000000000;
const int NIL = -1;
const double EPS = 1E-10;
template<class T, class S>
bool chmax(T &a, const S &b){
if(a < b){
a = b; return true;
}
return false;
}
template<class T, class S>
bool chmin(T &a, const S &b){
if(b < a){
a = b; return true;
}
return false;
}
int main(){
int X, Y, Z, K; cin >> X >> Y >> Z >> K;
VLL A(X), B(Y), C(Z);
REP(i, X) cin >> A[i];
REP(i, Y) cin >> B[i];
REP(i, Z) cin >> C[i];
RSORT(A); RSORT(B); RSORT(C);
VLL ANS;
REP(i, X){
REP(j, Y){
REP(k, Z){
if(i*j*k <= K) ANS.PB(A[i] + B[j] + C[k]);
else break;
}
}
}
RSORT(ANS);
REP(i, K)
cout << ANS[i] << "\n";
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define loop(i, a, n) for(int i = (a); i < (n); i++)
#ifdef _DEBUG
#define dd(x) cout << #x << " : " << x << endl
#else
#define dd(x)
#endif
using namespace std;
using ll = int64_t;
using P = pair<int, int>;
void chmax(int &a, int b) {
if(a < b) a = b;
}
int main(){
int h, w, m; cin >> h >> w >> m;
map<int, int> bh, bw;
vector<int> bhmax, bwmax;
int hmax = 0, wmax = 0;
set<P> s;
rep(i, m) {
int hi, wi; cin >> hi >> wi;
s.insert({hi, wi});
}
for(auto si : s) {
chmax(hmax, ++bh[si.first]);
chmax(wmax, ++bw[si.second]);
}
for(auto tmp : bh) {
if(tmp.second == hmax) bhmax.push_back(tmp.first);
}
for(auto tmp : bw) {
if(tmp.second == wmax) bwmax.push_back(tmp.first);
}
int ans = hmax + wmax - 1;
for(int bi : bhmax) {
for(int bj : bwmax) {
if(s.find({bi, bj}) == s.end()) {
ans++;
goto PRINT;
}
}
}
PRINT:
cout << ans << endl;
return 0;
} | 0 | 7,723,772 |
#include <stdio.h>
int main() {
char s1[11], s2[11], s3[11];
scanf("%s %s %s", s1, s2, s3);
printf("%c%c%c\n", s1[0] - 32, s2[0] - 32, s3[0] - 32);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
#define DEBUG freopen("in.txt", "r", stdin);
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
const int N = 1e5;
int ans, k, s;
int cnt[N];
int main() {
cin >> k >> s;
for (int i = 0; i <= k; ++i) {
for (int j = 0; j <= k; ++j) {
++cnt[i + j];
}
}
for (int i = 0; i <= k; ++i) {
int d = s - i;
if (d >= 0) {
ans += cnt[d];
}
}
cout << ans << endl;
return 0;
} | 0 | 26,736,801 |
#include <bits/stdc++.h>
using namespace std;
int n,t,tarr[51],total,totalnot;
string s,x,arr[51];
int main(){
cin>>n;
for(int i = 1;i <= n;i++){
cin>>s>>t;
arr[i] = s;
tarr[i] = t;
total = total + t;
}
cin>>x;
for(int i = 1;i <= n;i++){
if(arr[i] != x){
totalnot = totalnot + tarr[i];
}else{
totalnot = totalnot + tarr[i];
break;
}
}
cout<<total - totalnot<<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1e9 + 7;
const ll inf = 1LL<<60;
const int int_inf = 100000000;
const double eps = 1e-9;
const int dx[4] = { 1, 0, -1, 0 };
const int dy[4] = { 0, 1, 0, -1 };
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int n, m, k;
cin >> n >> m >> k;
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= m; j++) {
if ((m-j)*i + (n-i)*j == k) {
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No" << endl;
return 0;
} | 0 | 11,784,984 |
#include<iostream>
using namespace std;
int main()
{
long long n, min=0, max=0, sum=0;
cin >> n;
for(int i=0;i<n;++i){
int j;
cin >> j;
sum += j;
if(i){
if(j>max) max = j;
if(j<min) min = j;
}else{
max = j;
min = j;
}
}
cout << min << " " << max << " " << sum << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int N = 1e6;
vector<int> fact[N + 1];
int freq[N + 1];
int main() {
for (int i = 1; i <= N; i++)
for (int j = 1; j * i <= N; j++)
fact[i * j].push_back(i);
int n, ans = 0;
cin >> n;
int v[n];
for (int i = 0; i < n; i++) {
cin >> v[i];
freq[v[i]]++;
}
for (int i = 0; i < n; i++) {
bool absent = true;
freq[v[i]]--;
for (int f : fact[v[i]])
if (freq[f])
absent = false;
ans += absent;
freq[v[i]]++;
}
cout << ans;
return 0;
} | 0 | 28,131,675 |
#include <iostream>
#include<stdio.h>
using namespace std;
int main(void){
int x,y,d,r;
double z;
cin>>x>>y;
d=x/y;
r=x%y;
z=double(x)/double(y);
printf("%d %d %.5lf\n", d,r,z);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void){
int h, w;
cin >> h >> w;
char grid[h][w];
bool flag = false;
for (int i=0; i<h; i++) for (int j=0; j<w; j++) cin >> grid[i][j];
for (int i=0; i<h; i++){
for (int j=0; j<w; j++){
if (grid[i][j] == '#'){
if ((i==0 && j==0) && (grid[i][j+1]=='.') && (grid[i+1][j]=='.')) flag = true;
else if ((i==0 && j==w-1) && (grid[i][j-1]=='.') && (grid[i+1][j]=='.')) flag = true;
else if ((i==h-1 && j==0) && (grid[i-1][j]=='.') && (grid[i][j+1]=='.')) flag = true;
else if ((i==h-1 && j==w-1) && (grid[i-1][j]=='.') && (grid[i][j-1]=='.')) flag = true;
else if ((i == 0) && (grid[i][j-1]=='.') && (grid[i][j+1]=='.') && (grid[i+1][j]=='.')) flag = true;
else if ((i == h-1) && (grid[i][j-1]=='.') && (grid[i][j+1]=='.') && (grid[i-1][j])=='.') flag = true;
else if ((j == 0) && (grid[i-1][j]=='.') && (grid[i+1][j]=='.') && (grid[i][j+1]=='.')) flag = true;
else if ((j == w-1) && (grid[i-1][j]=='.') && (grid[i+1][j]=='.') && (grid[i][j-1]=='.')) flag = true;
else if (grid[i][j-1]=='.' && grid[i][j+1]=='.' && grid[i-1][j]=='.' && grid[i+1][j]=='.') flag = true;
if (flag){
cout << "No" << endl;
return 0;
}
}
}
}
cout << "Yes" << endl;
return 0;
} | 0 | 8,984,825 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
#define f first
#define s second
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) FOR(i, 0, a)
#define ROF(i, a, b) for (int i = (b); i >= (a); i--)
#define R0F(i, a) ROF(i, 0, a-1)
#define trav(x, a) for (auto& x: a)
const int MX = 2e5+5;
const int MOD = 1e9+7;
const ll INF = 1061109567;
const ld EPS = 1e-9;
const ld PI = acos(-1);
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
char op;
ll a, b; cin >> a >> op >> b;
if (op == '+') {
cout << a+b << "\n";
} else {
cout << a-b << "\n";
}
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (int i = int(n); i >= 0; i--)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define repic(i, a, b) for (int i = int(a); i <= int(b); i++)
#define each(x, y) for (auto &x : y)
#define all(a) (a).begin(), (a).end()
#define bit(b) (1ll << (b))
using namespace std;
using i32 = int;
using i64 = long long;
using u64 = unsigned long long;
using f80 = long double;
using vi32 = vector<i32>;
using vi64 = vector<i64>;
using vu64 = vector<u64>;
using vf80 = vector<f80>;
using vstr = vector<string>;
inline void yes() { cout << "Yes" << '\n'; exit(0); }
inline void no() { cout << "No" << '\n'; exit(0); }
inline i64 gcd(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); if (a % b == 0) return b; return gcd(b, a % b); }
inline i64 lcm(i64 a, i64 b) { return a / gcd(a, b) * b; }
inline u64 xorshift() { static u64 x = 88172645463325252ull; x = x ^ (x << 7); return x = x ^ (x >> 9); }
void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(16); solve(); return 0; }
template <typename T> class pqasc : public priority_queue<T, vector<T>, greater<T>> {};
template <typename T> class pqdesc : public priority_queue<T, vector<T>, less<T>> {};
template <typename T> inline void amax(T &x, T y) { if (x < y) x = y; }
template <typename T> inline void amin(T &x, T y) { if (x > y) x = y; }
template <typename T> inline T power(T x, i64 n, T e = 1) { T r = e; while (n > 0) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; }
template <typename T> istream& operator>>(istream &is, vector<T> &v) { each(x, v) is >> x; return is; }
template <typename T> ostream& operator<<(ostream &os, vector<T> &v) { rep(i, v.size()) { if (i) os << ' '; os << v[i]; } return os; }
template <typename T, typename S> istream& operator>>(istream &is, pair<T, S> &p) { is >> p.first >> p.second; return is; }
template <typename T, typename S> ostream& operator<<(ostream &os, pair<T, S> &p) { os << p.first << ' ' << p.second; return os; }
void solve() {
while (true) {
int n, a, b, c, x;
cin >> n >> a >> b >> c >> x;
if (n == 0) return;
vi32 y(n); cin >> y;
int ans = 0;
int idx = 0;
while (true) {
if (ans > 10000) break;
if (y[idx] == x) idx++;
if (idx == n) break;
ans++;
x = (a * x + b) % c;
}
if (ans > 10000) {
cout << -1 << '\n';
} else {
cout << ans << '\n';
}
}
} | 0 | 10,379,483 |
#include <bits/stdc++.h>
#define mod 1000000007
#define pb push_back
#define ll long long
#define mp make_pair
using namespace std;
ll getma(ll x, ll y){
if(y<=x){
return x*y;
}
else{
if( (x+y)%2 == 0){
return (x+y)*(x+y)/4;
}
else{
return (x+y-1)*(x+y+1)/4;
}
}
}
ll solve(ll a, ll b){
if(a>b) return solve(b,a);
ll ans = 0;
ans += a-1;
ll lef = 0, rig = b;
while(rig-lef>1){
ll mid = (rig+lef)/2;
if( getma(a+1,mid) < a*b){
lef = mid;
}
else{
rig = mid;
}
}
ans += lef;
return ans;
}
int main(){
ll q;
cin>>q;
for(int i=0;i<q;i++){
ll a,b;
cin>>a>>b;
cout<<solve(a,b)<<endl;
}
return 0;
} | #include<iostream>
using namespace std;
int main(){
while(1){
int grade[3] = {};
for (int i = 0; i < 3; i++){
cin >> grade[i];
}
if (grade[0] == -1 && grade[1] == -1 && grade[2] == -1) break;
if (grade[0] == -1 || grade[1] == -1) cout << "F" << endl;
else if (grade[0] + grade[1] >= 80) cout << "A" << endl;
else if (grade[0] + grade[1] >= 65) cout << "B" << endl;
else if (grade[0] + grade[1] >= 50) cout << "C" << endl;
else if (grade[0] + grade[1] >= 30) {
if (grade[2] >= 50) cout << "C" << endl;
else cout << "D" << endl;
} else cout << "F" << endl;
}
return 0;
} | 0 | 72,855,446 |
#pragma region
#include <bits/stdc++.h>
using namespace std;
inline void ci(void){
return;
}
template <typename First, typename... Rest>
void ci(First& first, Rest&... rest){
cin >> first;
ci(rest...);
return;
}
inline void co(void){
cout << "\n";
return;
}
template <typename First, typename... Rest>
void co(First first, Rest... rest){
cout << first << " ";
co(rest...);
return;
}
#define ll long long
#define ld long double
#define st string
#define dl double
#define wh while
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define tp tuple
#define ft first
#define sc second
#define ve vector
#define tos to_string
#define len length
#define rt return 0
#define br break
#define gcd __gcd
#define lcm(n, m) (n * m / gcd(n, m))
#define np next_permutation
#define repi(i, m, n) for(int i=(int)(m);i<(int)(n);i++)
#define rep(i, n) repi(i, 0, n)
#define revi(i, m, n) for(int i=(int)(m);i>(int)(n);i--)
#define rev(i, n) repi(i, 0, n)
#define repill(i, m, n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define repll(i, n) repill(i, 0, n)
#define revill(i, m, n) for(ll i=(ll)(m);i>(ll)(n);i--)
#define revll(i, n) repi(i, 0, n)
#define sz(v) ((int)(v).size())
#define each(i, n) for(auto&& i: n)
#define all(n) (n.begin(), n.end())
#define sp(n) cout << fixed << setprecision(n)
#pragma endregion
int main() {
ld N, a = 0;
ci(N);
rep(i, N){
ld x;
st y;
ci(x, y);
if(y == "JPY"){
a += x;
}
else{
a += x * 380000;
}
}
sp(10);
co(a);
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using piii = pair<int, pair<int, int>>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
template <typename T>
using Graph = vector<vector<T>>;
const int MOD = 1e9 + 7;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
vector<int> S(N), T(M);
for (int i = 0; i < N; ++i)
cin >> S[i];
for (int i = 0; i < M; ++i)
cin >> T[i];
vector<vector<ll>> dp(N + 2, vector<ll>(M + 2));
dp[0][0] = 1;
for (int i = 0; i <= N; ++i) {
for (int j = 0; j <= M; ++j) {
if (i > 0)
dp[i][j] += dp[i - 1][j];
if (j > 0)
dp[i][j] += dp[i][j - 1];
if (i > 0 && j > 0 && S[i - 1] != T[j - 1])
dp[i][j] -= dp[i - 1][j - 1];
dp[i][j] %= MOD;
}
}
if (dp[N][M] < 0)
dp[N][M] += MOD;
cout << dp[N][M] << endl;
return 0;
} | 0 | 39,399,161 |
#include<iostream>
using namespace std;
int main()
{
float t,x,k;
cin >> t >> x;
k=t/x;
cout << k;
} | #include<stdio.h>
#include<ctype.h>
#include<string.h>
int main(){
char s[100],p[100];
int i,k,n,cnt=0,t=0,lens,lenp;
scanf("%s %s",s,p);
lens=strlen(s);
lenp=strlen(p);
for(i=0;i<lens;i++){
cnt=0;
if(s[i]==p[0]){
cnt++;
for(k=1;k<lenp;k++){
if(p[k]==s[(i+k)%lens]){
cnt++;
}
}
if(cnt==lenp)t++;
}
}
if(t>=1){
printf("Yes\n");
}else{
printf("No\n");
}
} | 0 | 100,152,380 |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define FOR(i,s,n) for(int i = (s); i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for(int i = (n); i >= 0; i--)
#define ALL(n) (n).begin(), (n).end()
#define RALL(n) (n).rbegin(), (n).rend()
#define ATYN(n) cout << ( (n) ? "Yes":"No") << '\n';
#define CFYN(n) cout << ( (n) ? "YES":"NO") << '\n';
#define OUT(n) cout << (n) << '\n';
using ll = long long;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
int main(void)
{
IOS
int N, A, B;
cin >> N >> A >> B;
while(true) {
if (A+1 != B) A++;
else {
if (A == 1) {
OUT("Borys")
return 0;
} else A--;
}
if (B-1 != A) B--;
else {
if (B == N) {
OUT("Alice")
return 0;
} else B++;
}
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int a[n];
for(int i = 0; i < n; i++){
cin >> a[i];
}
int now = a[0];
int cou = 0;
int ans = 0;
for(int i = 1; i < n; i++){
if(a[i] == now){
cou++;
}else{
now = a[i];
if(cou != 0){
if(cou % 2 == 0){
ans += (cou / 2);
}else{
ans += (cou / 2);
ans++;
}
}
cou = 0;
}
}
if(cou != 0){
if(cou % 2 == 0){
ans += (cou / 2);
}else{
ans += (cou / 2);
ans++;
}
}
cout << ans << endl;
} | 0 | 86,850,212 |
#include <bits/stdc++.h>
namespace org
{
template <class T>
T make_value()
{
T tmp;
return tmp;
}
template <class T>
T VALUE()
{
T tmp;
std::cin >> tmp;
return tmp;
}
template <class T>
std::vector<T> make_vector(long long size)
{
std::vector<T> tmp(size);
return tmp;
}
template <class T>
std::vector<T> VECTOR(long long size)
{
auto tmp = make_vector<T>(size);
for (long long i = 0; i < tmp.size(); i++)
{
std::cin >> tmp.at(i);
}
return tmp;
}
template <class T>
std::vector<std::vector<T>> make_matrix(long long line, long long row)
{
std::vector<std::vector<T>> tmp;
tmp.resize(line);
for (long long i = 0; i < tmp.size(); i++)
{
tmp.at(i).resize(row);
}
return tmp;
}
template <class T>
std::vector<std::vector<T>> MATRIX(long long line, long long row)
{
auto tmp = make_matrix<T>(line, row);
for (long long i = 0; i < tmp.size(); i++)
{
for (long long j = 0; j < tmp.at(0).size(); j++)
{
std::cin >> tmp.at(i).at(j);
}
}
return tmp;
}
template <class T>
bool find(std::vector<T> vec, T value)
{
for (long long i = 0; i < vec.size(); i++)
{
if (vec.at(i) == value)
{
return 1;
}
}
return 0;
}
}
std::ostream &operator<<(std::ostream &os, const std::vector<long long> vec)
{
for (long long i = 0; i < vec.size(); i++)
{
os << vec.at(i) << " ";
}
return os;
}
std::ostream &operator<<(std::ostream &os, const std::vector<std::string> vec)
{
for (long long i = 0; i < vec.size(); i++)
{
os << vec.at(i) << " ";
}
return os;
}
std::ostream &operator<<(std::ostream &os, const std::vector<std::vector<long long>> vec)
{
for (long long i = 0; i < vec.size(); i++)
{
for (long long j = 0; j < vec.at(0).size(); j++)
{
os << vec.at(i).at(j) << " ";
}
os << std::endl;
}
return os;
}
std::ostream &operator<<(std::ostream &os, const std::vector<std::vector<std::string>> vec)
{
for (long long i = 0; i < vec.size(); i++)
{
for (long long j = 0; j < vec.at(0).size(); j++)
{
os << vec.at(i).at(j) << " ";
}
os << std::endl;
}
return os;
}
using ll = long long;
using namespace std;
using org::MATRIX;
using org::VECTOR;
#define VEC(name, size, type) auto name = org::VECTOR<type>(size)
#define MAT(name, line, row, type) auto name = org::MATRIX<type>(line, row)
#define llV(name, size) VEC(name, size, long long)
#define stV(name, size) VEC(name, size, std::string)
#define llM(name, line, row) MAT(name, line, row, long long)
#define stM(name, line, row) MAT(name, line, row, std::string)
#define ll(name) auto name = org::VALUE<long long>()
#define rep1(name, max1) for (long long name = 0; name < max1; name++)
#define rep2(max1, max2) \
for (long long i = 0; i < max1; i++) \
for (long long j = 0; j < max1; j++)
ll res=0;
int main()
{
ll(H);
ll(W);
ll(K);
auto c = org::VECTOR<string>(H);
for (ll i = 0; i < (1 << W); i++)
{
for (ll k = 0; k < (1 << H); k++)
{
auto tmp=c;
ll counter=0;
vector<ll> W_ar;
vector<ll> H_ar;
for (ll j = 0; j < W; j++)
{
for (ll f = 0; f < H; f++)
{
if (i & (1 << j))
{
for(ll h=0;h<H;h++)
tmp[h][j]=':';
}
if (k & (1 << f))
{
for(ll w=0;w<W;w++)
tmp[f][w]=':';
}
}
}
for(ll w=0;w<W;w++){
for(ll h=0;h<H;h++){
if(tmp[h][w]=='#')counter++;
}
}
if(counter==K)res++;
}
}
cout << res << endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=2e5+5;
int m,a[N];
ll ans=0;
int top,s[N];
int solve()
{
while(top>1)
{
ans++;
s[top-1]+=s[top];
if(s[top-1]<10) top--;
else
{
s[top]=s[top-1]%10;
s[top-1]=1;
}
}
return s[1];
}
int main()
{
scanf("%d",&m);
for(int i=1;i<=m;i++)
{
int d;
ll c;
scanf("%d%lld",&d,&c);
while(c>1)
{
if(c&1) s[++top]=d,c--;
if(d==9)
{
ans+=c;
c/=2;
}
else if(d==8)
{
ans+=c;
c/=2;
d=7;
}
else if(d==7)
{
ans+=c;
c/=2;
d=5;
}
else if(d==6)
{
ans+=c;
c/=2;
d=3;
}
else if(d==5)
{
ans+=c;
c/=2;
d=1;
}
else if(d==4)
{
ans+=c/2;
c/=2;
d=8;
}
else if(d==3)
{
ans+=c/2;
c/=2;
d=6;
}
else if(d==2)
{
ans+=c/2;
c/=2;
d=4;
}
else if(d==1)
{
ans+=c/2;
c/=2;
d=2;
}
else if(d==0)
{
ans+=c/2;
c/=2;
d=0;
}
}
if(c==1) s[++top]=d;
a[i]=solve();
top=0;
}
while(m>1)
{
ans++;
a[m-1]+=a[m];
if(a[m-1]<10) m--;
else
{
a[m]=a[m-1]%10;
a[m-1]=1;
}
}
printf("%lld\n",ans);
} | 0 | 76,675,365 |
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
#include <numeric>
#include <functional>
#include <sstream>
#include <iostream>
#include <iomanip>
#define _USE_MATH_DEFINES
#include <cmath>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cfloat>
#include <cmath>
#include <ctime>
#include <cassert>
#include <cctype>
#include <cstdio>
#include <cassert>
using namespace std;
#define EPS 1e-12
#define ull unsigned long long
#define ll long long
#define VI vector<ll>
#define PII pair<ll, ll>
#define VVI vector<vector<ll> >
#define VVVI vector<vector<vector<ll>>>
#define VVVVI vector<vector<vector<vector<ll>>>>
#define REP(i,n) for(ll i=0,_n=(n);(i)<(ll)_n;++i)
#define REPR(i,n) for(ll i=(ll)(n)-1;0<=(i);--i)
#define RANGE(i,a,b) for(ll i=(ll)a,_b=(ll)(b);(i)<_b;++i)
#define RANGER(i,a,b) for(ll i=(ll)(b)-1,_a=(ll)(a);(_a)<=i;--i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()
#define ALLR(c) (c).rbegin(), (c).rend()
#define PB push_back
#define MP(a, b) make_pair(a, b)
#define POPCOUNT __builtin_popcount
#define POPCOUNTLL __builtin_popcountll
#define CLEAR(table, v) memset(table, v, sizeof(table));
#define UNIFORM_DOUBLE(a, b) (((b-a)*(double)rand()/RAND_MAX)+a)
#define UNIFORM_LL(a, b) (ll)UNIFORM_DOUBLE(a, b)
#define IN(v, lo, hi) ((lo)<=(v) && (v)<(hi))
#define DD(v) cout<<#v<<": "<<v<<endl
#define FI first
#define SE second
template <typename T0, typename T1> std::ostream& operator<<(std::ostream& os, const map<T0, T1>& v) { for( typename map<T0, T1>::const_iterator p = v.begin(); p!=v.end(); p++ ){os << p->first << ": " << p->second << " ";} return os; }
template <typename T0, typename T1> std::ostream& operator<<(std::ostream& os, const pair<T0, T1>& v) { os << v.first << ": " << v.second << " "; return os; }
template <typename T> std::ostream& operator<<(std::ostream& os, const vector<T>& v) { for( int i = 0; i < (int)v.size(); i++ ) { os << v[i] << " "; } return os; }
template <typename T> std::ostream& operator<<(std::ostream& os, const set<T>& v) { vector<T> tmp(v.begin(), v.end()); os << tmp; return os; }
template <typename T> std::ostream& operator<<(std::ostream& os, const deque<T>& v) { vector<T> tmp(v.begin(), v.end()); os << tmp; return os; }
template <typename T> std::ostream& operator<<(std::ostream& os, const vector<vector<T> >& v) { for( int i = 0; i < (int)v.size(); i++ ) { os << v[i] << endl; } return os; }
template<typename T>void maxUpdate(T& a, T b) {a = max(a, b);}
template<typename T>void minUpdate(T& a, T b) {a = min(a, b);}
string YN(bool v) { return v ? "Yes":"No"; }
void uniq(VI& es) { sort(ALL(es)); es.erase(unique(ALL(es)), es.end()); }
#define INF (1LL<<60)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N,M,W,H,K;
string s;
while(cin>>s>>K) {
auto f=[&](string s) {
ll L=1;
ll ans=0;
RANGE(i, 1, s.size()) {
if(s[i]==s[i-1]) L++;
else {
if(2<=L) ans+=L/2;
L=1;
}
}
if(2<=L) ans+=L/2;
return ans;
};
ll ans;
ll li=K%2?11:10;
if(K-li<0) {
string t;
REP(i, K) t+=s;
ans = f(t);
} else {
string t;
REP(i, li) t+=s;
ll a=f(t);
t+=s;
t+=s;
ll b=f(t);
ans = a+(b-a)*(K-li)/2;
}
cout<<ans<<endl;
}
return 0;
} | #include<iostream>
using namespace std;
int main()
{
int money,count = 0,oturi[1000] = {};
int money2[6] = {500,100,50,10,5,1};
for(int i = 0;i >= 0;i++){
cin >> money;
count++;
if(money == 0)
break;
oturi[i] = 1000 - money;
}
for(int j = 0;j < count;j++){
int maisu = 0;
for(int i = 0;i < 6;i++){
maisu += oturi[j] / money2[i];
oturi[j] %= money2[i];
}
if(maisu > 0)
cout << maisu << endl;
}
return 0;
} | 0 | 52,839,920 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define ALL(c) (c).begin(), (c).end()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v.begin(), v.end(), x) != v.end())
using namespace std;
using ll = long long;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline void dump(vector<T> v) { for (auto& x : v) cerr << x << " "; cerr << endl; }
template<class T> inline void dump(vector<pair<T, T>> v) { for (auto& p : v) cerr << p.first << " " << p.second << endl; }
template<class T> inline void dump(vector<vector<T>> vv) { for (auto& v : vv) {for (auto& x : v) cerr << x << " "; cerr << endl;} }
constexpr int INF = 1e9 + 5;
constexpr long long INFLL = 1LL << 62;
constexpr double eps = (1e-9);
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, m;
cin >> n >> m;
vector<ll> a(n, 0);
rep(i, n) cin >> a[i];
vector<ll> cs(n, 0);
cs[0] = a[0] % m;
for (int i = 1; i < n; i++) {
cs[i] = (cs[i-1] + a[i]) % m;
}
map<ll, ll> mp;
for (auto& x : cs) {
mp[x]++;
}
ll ans = 0;
for (auto& p : mp) {
if (p.first == 0) ans += p.second;
if (p.second >= 2) ans += (p.second * (p.second - 1)) / 2LL;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll GCD(ll x,ll y){
if(y == 0) return x;
else return GCD(y,x%y);
}
ll LCM(ll a,ll b){
return a / GCD(a,b) * b;
}
const int MOD = 1000000007;
int main() {
int n; cin >> n;
int a[n];
for(int i = 0;i < n;i++){
cin >> a[i];
}
sort(a,a+sizeof(a)/sizeof(a[0]),greater<int>());
bool x = false;
bool y = false;
int h = 0,w = 0;
for(int i = 1;i < n;i++){
if(!(x) && a[i] == a[i-1]){
h = a[i];
x = true;
a[i] = 0;a[i-1] = 0;
continue;
}
if(x && a[i] == a[i-1]){
w = a[i];
y = true;
break;
}
}
if(x && y){
cout << (ll)h*w;
}else{
cout << 0;
}
} | 0 | 89,221,645 |
#include <bits/stdc++.h>
using namespace std;
template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl
typedef long long ll;
const ll mod = 1e9+7;
const int maxn = 1e6 + 5;
int n;
ll a[maxn];
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
cin>>n;
for (int i=1; i<=n; i++) {
cin>>a[i];
}
vector<int> stk;
for (int i=n; i>=0; i--) {
while (!stk.empty() && a[stk.back()] <= a[i]) stk.pop_back();
stk.push_back(i);
}
vector<ll> ans(n+1, 0);
priority_queue<ll> right;
ll same = 0;
int j=n;
int len = stk.size();
for (int i=0; i<len-1; i++) {
int idx = stk[i];
ll target = a[stk[i+1]];
while (j>=idx) {
right.push(a[j]); j--;
}
ll &cur = ans[idx];
cur += same*(a[idx]-a[stk[i+1]]);
while (!right.empty() && right.top() >= target) {
ll x = right.top(); right.pop();
cur += x-target;
same++;
}
}
for (int i=1; i<=n; i++) {
cout<<ans[i]<<"\n";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void)
{
int N;
string S;
cin >> N >> S;
int ans = 0;
for (int i = 0; i < 1000; i++)
{
int d1 = i/100;
int d2 = (i%100)/10;
int d3 = i%10;
int sel = 0;
for (int i = 0; i < N; i++)
{
if(sel == 0){
if(d1 == (S[i] - '0')) sel++;
} else if(sel == 1){
if(d2 == (S[i] - '0')) sel++;
} else if(sel == 2){
if(d3 == (S[i] - '0')) sel++;
} else if(sel == 3){
break;
}
}
if(sel == 3) {
ans++;
}
}
cout << ans << endl;
return 0;
} | 0 | 36,446,774 |
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
using namespace std;
static const int num = 1001;
int lcs(string ch1, string ch2) {
int s = ch1.size();
int t = ch2.size();
ch1.insert(0, " ");
ch2.insert(0, " ");
int c[num][num];
for (int i = 0; i <= s; i++) c[i][0] = 0;
for (int i = 0; i <= t; i++) c[0][i] = 0;
for (int i = 1; i <= s; i++) {
for (int j = 1; j <= t; j++) {
if (ch1[i] == ch2[j]) c[i][j] = c[i - 1][j - 1] + 1;
else c[i][j] = max(c[i - 1][j], c[i][j - 1]);
}
}
return c[s][t];
}
int main() {
int q;
cin >> q;
string a, b;
for (int i = 0; i < q; i++) {
cin >> a >> b;
cout << lcs(a, b) << endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define in freopen("input.txt", "r", stdin)
#define out freopen("output1.txt", "w", stdout)
#define ios ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int main() {
ios
#ifndef ONLINE_JUDGE
in;
out;
#endif
int n;
cin>>n;
int d[n];
for (int i = 0; i < n; i++){
cin>>d[i];
}
int sum = 0;
for (int i = 0; i < n; ++i){
for (int j = i+1; j < n; j++){
sum = sum + (d[i]*d[j]);
}
}
cout<<sum<<endl;
} | 0 | 28,612,888 |
#include <algorithm>
#include <iostream>
#include <vector>
#include <math.h>
#include <set>
#include <map>
#include <string>
#include <stack>
#include <queue>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <bitset>
#include <complex>
#define _USE_MATH_DEFINES
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> plglg;
typedef tuple<int, int, int> tiii;
typedef tuple<ll, ll, ll> tlglglg;
typedef complex<double> xy_t;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
double pi = 3.141592653589793;
ll mod = 1000000007;
int intmax = 2147483647;
int intmin = -2147483648;
ll llmax = 9223372036854775807;
ll llmin = -9223372036854775807;
ll inf = llmax / 2;
bool xx[4010][16020];
bool yy[4010][16020];
vector<int> mv[2];
int main() {
string s;
cin >> s;
int x, y;
cin >> x >> y;
int mark = 0;
int len = s.size();
int num = 0;
for (int i = 0; i < len; i++) {
if (s[i] == 'F') {
num++;
} else {
if (num > 0 || (mark == 0 && mv[0].size() == 0)) {
mv[mark].push_back(num);
}
num = 0;
mark = (mark + 1) % 2;
}
}
mv[mark].push_back(num);
for (int i = 0; i < 4010; i++) {
fill(xx[i], xx[i] + 16020, false);
fill(yy[i], yy[i] + 16020, false);
}
xx[0][mv[0][0] + 8010] = true;
yy[0][8010] = true;
int lenx = mv[0].size();
for (int i = 1; i < lenx; i++) {
for (int j = 0; j < 16020; j++) {
if (xx[i - 1][j]) {
xx[i][j + mv[0][i]] = true;
xx[i][j - mv[0][i]] = true;
}
}
}
int leny = mv[1].size();
for (int i = 0; i < leny; i++) {
for (int j = 0; j < 16020; j++) {
if (yy[i][j]) {
yy[i + 1][j + mv[1][i]] = true;
yy[i + 1][j - mv[1][i]] = true;
}
}
}
if (xx[lenx - 1][x + 8010] && yy[leny][y + 8010]) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define coutc "\033[48;5;196m\033[38;5;15m"
#define endc "\033[0m"
#define endl '\n'
#define M(_1, _2, _3, _4, NAME, ...) NAME
#define rep(...) M(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rep4(_, x, n, s) for (int _ = x; (s < 0) ? _ > n : _ < n; _ += s)
#define rep3(_, x, n) rep4(_, x, n, (x < n ? 1 : -1))
#define rep2(_, n) rep3(_, 0, n)
#define rep1(n) rep2(i, n)
#define fi first
#define se second
#define pb push_back
#define pairii pair<int, int>
#define all(x) x.begin(), x.end()
#define len(x) int(x.size())
#define lli __int128_t
#define li long long int
#define ld long double
template <class A, class B>
ostream &operator<<(ostream &o, const pair<A, B> &p) {
return o << "(" << p.fi << ", " << p.se << ")";
}
template <class T>
ostream &operator<<(ostream &o, const vector<T> &v) {
rep(i, len(v)) o << setw(7) << left << v[i];
return o << endc << endl << coutc;
}
template <class A, class B>
ostream &operator<<(ostream &o, const map<A, B> &m) {
for (auto &kv : m) o << kv;
return o;
}
template <class T, class... Ts>
void debug(const T &e, const Ts &... r) {
#ifdef DEBUG
cerr << coutc << e;
((cerr << " " << r), ..., (cerr << endc << endl));
#endif
}
void _main(int tc) {
int n;
cin >> n;
vector<vector<int>> adj(n);
auto addEdge = [&](int u, int v) { adj[u].pb(v); };
rep(n - 1) {
int u, v;
cin >> u >> v;
u--, v--;
addEdge(u, v);
addEdge(v, u);
}
const int mod = 1e9 + 7;
function<pairii(int, int)> f = [&](int u, int p) -> pairii {
int ifwhitecnt = 1, ifblackcnt = 1;
for (int v : adj[u]) {
if (v == p) continue;
auto ans = f(v, u);
ifwhitecnt = ((li)ifwhitecnt * ((ans.fi + ans.se) % mod)) % mod;
ifblackcnt = ((li)ifblackcnt * ans.fi) % mod;
}
return {ifwhitecnt, ifblackcnt};
};
auto ans = f(0, 0);
cout << ((ans.fi + ans.se) % mod) << endl;
}
int main() {
ios_base::sync_with_stdio(0), cin.tie(0);
_main(0), exit(0);
int tc;
cin >> tc;
rep(i, tc) _main(i + 1);
} | 0 | 15,604,343 |
#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(){
string s;
cin>>s;
rep(i,0,3){
if(s[i]=='1') cout<<9;
else cout<<1;
}
cout<<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(void){
string s;
cin>>s;
std::deque<string> deq;
string tmp="";
for (int i=0;i<s.size();i++) {
tmp+=s[i];
if (i!=s.size()-1) {
if (s[i]=='>'&&s[i+1]=='<') {
deq.emplace_back(tmp);
tmp="";
}
} else {
deq.emplace_back(tmp);
}
}
long long int sum=0;
for (int i=0;i<deq.size();i++) {
string mark=deq[i];
long long int inc=0,dec=0;
for (int j=0;j<mark.size();j++) {
if (mark[j]=='<') {
inc++;
} else {
dec++;
}
}
if (inc>dec) {
dec--;
if (dec>=0&&dec%2==0) {
sum+=(dec+1)*(dec/2);
} else {
sum+=(dec+1)*(dec/2)+(dec+1)/2;
}
if (inc>=0&&inc%2==0) {
sum+=(inc+1)*(inc/2);
} else {
sum+=(inc+1)*(inc/2)+(inc+1)/2;
}
} else if (inc<dec) {
inc--;
if (dec>=0&&dec%2==0) {
sum+=(dec+1)*(dec/2);
} else {
sum+=(dec+1)*(dec/2)+(dec+1)/2;
}
if (inc>=0&&inc%2==0) {
sum+=(inc+1)*(inc/2);
} else {
sum+=(inc+1)*(inc/2)+(inc+1)/2;
}
} else {
if (dec>=0&&dec%2==0) {
sum+=(dec+1)*(dec/2);
} else {
sum+=(dec+1)*(dec/2)+(dec+1)/2;
}
if (inc>=0&&inc%2==0) {
sum+=(inc+1)*(inc/2);
} else {
sum+=(inc+1)*(inc/2)+(inc+1)/2;
}
sum-=inc;
}
}
cout<<sum<<endl;
} | 0 | 13,894,563 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int64_t MOD=1000000007;
const long long INF = 1LL<<60;
void YN(bool x){
if(x) cout<<"Yes";
else cout<<"No";
}
int main() {
vector<vector<int>> A(3,vector<int>(3));
vector<vector<bool>> S(3,vector<bool>(3,false));
rep(i,3){
rep(j,3){
cin>>A[i][j];
}
}
int N; cin>>N;
rep(q,N){
int B; cin>>B;
rep(i,3){
rep(j,3){
if(B==A[i][j]) S[i][j]=true;
}
}
}
bool bingo=false;
if(S[0][0]&&S[1][1]&&S[2][2]) bingo=true;
if(S[0][2]&&S[1][1]&&S[2][0]) bingo=true;
rep(i,3) if(S[i][0]&&S[i][1]&&S[i][2]) bingo=true;
rep(i,3) if(S[0][i]&&S[1][i]&&S[2][i]) bingo=true;
YN(bingo);
} | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
using ll = long long;
using ull = unsigned long long;
using namespace std;
int main() {
int N, M, tmp, result = 0;
cin >> N;
vector<string> s(N), u;
bool can;
REP(i, N) {
can = true;
cin >> s[i];
REP(j, u.size()) {
if (s[i] == u[j]) {
can = false;
break;
}
}
if (can) {
u.push_back(s[i]);
}
}
cin >> M;
vector<string> t(M);
REP(i, M) {
cin >> t[i];
}
REP(i, u.size()) {
tmp = 0;
REP(j, N) {
if (u[i] == s[j]) {
tmp++;
}
}
REP(j, M) {
if (u[i] == t[j]) {
tmp--;
}
}
if (tmp > result) {
result = tmp;
}
}
cout << result << endl;
return 0;
} | 0 | 74,208,790 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
using namespace std;
int main(void) {
int n;
while (cin >> n, n) {
vector<int> scores(n);
for (int i = 0; i < n; i++) {
cin >> scores[i];
}
sort(scores.begin(), scores.end());
cout << accumulate(scores.begin()+1, scores.end()-1, 0) / (scores.size()-2) << endl;
}
return 0;
} | #include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<vector>
using namespace std;
int n,par[100000],typ[100000],dep[100000];
vector <int> chi[100000];
int depth(int now){
if(dep[now] != -1)return dep[now];
if(par[now]==-1)return 0;
return depth(par[now])+1;
}
int main(){
cin >> n;
for(int i=0; i<n; i++){
par[i] = -1;
dep[i] = -1;
}
for(int i=0; i<n; i++){
int id,k;
cin >> id >> k;
if(k == 0) typ[id] = 3;
else{
typ[id] = 2;
for(int j=0; j<k; j++){
int c;
cin >> c;
chi[id].push_back(c);
par[c] = id;
}
}
}
for(int i=0; i<n; i++){
if(par[i] == -1) typ[i] = 1;
cout << "node " << i << ": parent = " << par[i] << ", depth = " << depth(i) << ", ";
if(typ[i] == 1)cout << "root, [";
else if(typ[i] == 2)cout << "internal node, [";
else cout << "leaf, [";
for(int k=0; k < chi[i].size(); k++){
cout << chi[i][k];
if(k != chi[i].size()-1) cout << ", ";
}
cout << "]" << endl;
}
return 0;
} | 0 | 85,574,902 |
#include <iostream>
#include <math.h>
#include <algorithm>
using namespace std;
int main(){
int N,V,P;
long long M;
cin>>N>>M>>V>>P;
long long A[100000],emp[100000];
for(int i=0;i<N;i++) cin>>A[i];
sort(A,A+N);
emp[N-P]=0;
for(int i=N-P-1;i>=0;i--){
emp[i]=A[N-P]-A[i];
emp[i]+=emp[i+1];
}
int answer=P;
for(int i=0;i<N-P;i++){
if(A[N-P]-A[i]<=M){
long long a=A[i]+M;
long long vote=(V-P-i)*M;
if(emp[i+1]+(N-P-i)*(a-A[N-P])>=vote){
answer=N-i;
break;
}
}
}
cout<<answer<<endl;
return 0;
} | #include <bits/stdc++.h>
#define eps 1e-3
#define pi acos(-1.0)
#define inf 0x3f
#define INF 0x3f3f3f3f
#define pb push_back
#define debug1 cout<<"&&";
#define debug2 cout<<"**";
#define ms(a, x) memset(a, x, sizeof(a))
#define for0(i, n) for(int i = 0; i < n; ++i)
#define for1(i, n) for(int i = 1; i <= n; ++i)
using namespace std;
typedef double db;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<long long, int> pli;
typedef pair<long long, long long> pll;
const int mod = 1e9 + 7;
const int N = 1e5+10;
const int M = 1e6+10;
int n, tot, head[N], ver[N<<2], nex[N<<2];
ll dp[N][2];
void add(int x, int y) {
ver[++tot] = y;
nex[tot] = head[x];
head[x] = tot;
}
void dfs(int x, int fa) {
ll a = 1, b = 1;
if(nex[head[x]] == 0 && ver[head[x]] == fa) {
dp[x][0] = dp[x][1] = 1;
return;
}
for(int i = head[x]; i; i = nex[i]) {
int y = ver[i];
if(y == fa) continue;
dfs(y, x);
a = (a * ((dp[y][0] + dp[y][1]) % mod)) % mod;
b = (b * dp[y][0]) % mod;
}
dp[x][0] = a, dp[x][1] = b;
}
int main() {
cin>>n;
for0(i, n-1) {
int x, y;
scanf("%d %d", &x, &y);
add(x, y), add(y, x);
}
dfs(1, 0);
cout << (dp[1][0] + dp[1][1]) % mod << endl;
return 0;
} | 0 | 30,589,110 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
string s, t;
cin >> s >> t;
int cnt = 0;
if (s[0] == t[0])
cnt++;
if (s[1] == t[1])
cnt++;
if (s[2] == t[2])
cnt++;
cout << cnt << endl;
return 0;
} | #include <bits/stdc++.h>
#define irep(i,n) for(int i = 0; i < (int)(n); i++)
#define irep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define irrep(i,n) for(int i = (int)(n-1); i > -1; i--)
#define irrep2(i,a,n) for(int i = (int)(n); i >= (int)(a); i--)
#define fi first
#define se second
using ll = long long;
using v_int = std::vector<int>;
using v2_int = std::vector<v_int>;
using v_ll = std::vector<ll>;
using v2_ll = std::vector<v_ll>;
using v_string = std::vector<std::string>;
using v_bool = std::vector<bool>;
using v2_bool = std::vector<v_bool>;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;
const double PI = 3.1415926535897932;
const int INF = (int)1e9;
const ll LINF = (ll)1e18;
const ll MOD = 1000000007;
const int dr[4] = {1, 0, -1, 0};
const int dc[4] = {0, 1, 0, -1};
using namespace std;
template<typename T, typename U> inline
ostream& operator<<(ostream &o, pair<T,U> &p)
{
return o << "{" << p.first << "," << p.second << "}";
}
template<typename T, typename U, typename V> inline
ostream& operator<<(ostream &o, tuple<T,U,V> &p)
{
return o << "{" << get<0>(p) << "," << get<1>(p) << "," << get<2>(p) << "}";
}
template<typename T> inline
istream& operator>>(istream &is, vector<T> &v)
{
int len = (int)v.size();
for(int i = 0; i < len; i++) {
is >> v[i];
}
return is;
}
template<typename T> inline
ostream& operator<<(ostream &os, vector<T> &v)
{
int len = (int)v.size();
for(int i = 0; i < len; i++) {
os << v[i];
if(i != len-1) { os << ","; }
}
return os;
}
template<typename T> inline
void chmin(T &a, T b) { a = min(a, b); }
template<typename T> inline
void chmax(T &a, T b) { a = max(a, b); }
int main(void)
{
string s;
cin >> s;
int len = s.size();
int l = 0, r = len-1;
int ans = 0;
while(l < r) {
if(s[l] == s[r]) {
l++; r--;
} else if(s[l] == 'x') {
l++;
ans++;
} else if(s[r] == 'x') {
r--;
ans++;
} else {
cout << -1 << endl;
return 0;
}
}
cout << ans << endl;
return 0;
} | 0 | 38,820,548 |
#include<bits/stdc++.h>
#define ll long long
#define fixed cout.setf(ios::fixed);
#define Precise cout.precision(7);
using namespace std;
int main()
{
ll n,div,rem,fived;
cin>>n;
div=n/100;
rem=n%100;
fived=rem/5;
if(rem%5)
fived++;
if(fived<=div)
cout<<"1"<<endl;
else
cout<<"0"<<endl;
return 0;
} | #if __has_include("debug.h")
#include "debug.h"
#else
#include <bits/stdc++.h>
using namespace std;
#define d(...) 2;
#endif
#define int long long int
#define ld long double
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl "\n"
#define all(c) (c).begin(),(c).end()
#define rall(c) (c).rbegin(),(c).rend()
#define ff first
#define ss second
#define eps 1e-10
#define PI acos(-1LL)
#define gcd(a,b) __gcd((a),(b))
#define lcm(a,b) ((a*b)/gcd(a,b))
void solve();
int32_t main()
{
#ifdef DEBUG
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
fast
int t = 1;
while(t--)
solve();
return 0;
}
void solve()
{
int i,j;
int n,m;
cin>>n>>m;
cout<<lcm(n,m)<<endl;
} | 0 | 65,529,143 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int t=0,s=0;;
string S,T;
cin >> S>>T;
for(int i=0; i<S.length()-T.length()+1; i++){
t=0;
for(int j=0; j<T.length(); j++){
if(S.at(i+j)==T.at(j)) t++;
if(s<t) s=t;
}
}
cout << T.length()-s << endl;
} | #include <bits/stdc++.h>
using namespace std;
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pair<int, int>; using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define rp(i,N) for(ll i = 0; i < (ll)N; i++)
#define repi(i,a,b) for(ll i = ll(a); i < ll(b); ++i)
template<class T>bool chmax(T &former, const T &b) { if (former<b) { former=b; return true; } return false; }
template<class T>bool chmin(T &former, const T &b) { if (b<former) { former=b; return true; } return false; }
template<class T>T sqar(T x){ return x*x; }
#define Sort(v) std::sort(v.begin(), v.end(), std::greater<decltype(v[0])>())
#define p_queue(v) priority_queue<v, vector<v>, greater<v> >
template<class T> inline void princ(T x){cout<<x<<" ";};
template<class T> inline void print(T x){cout<<x<<"\n";};
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
int main(){
ll n,d,a;
cin >> n >> d >> a;
vector<PLL> monster(n);
rp(i,n) {
ll x,h;
cin >> x >> h;
monster.at(i)=mp(x,(h+a-1)/a);
}
sort(all(monster));
ll ans=0;
ll bom=0;
queue<PLL> bombed;
rp(i,n){
ll pos=monster.at(i).first,life=monster.at(i).second;
while(!bombed.empty()&&bombed.front().first<pos-d-d){
PLL pl=bombed.front(); bombed.pop();
bom -= pl.second;
}
if(life<=bom) continue;
ans += life-bom;
bombed.push(mp(pos,life-bom));
bom=life;
}
print(ans);
return 0;
} | 0 | 48,000,293 |
#define _crt_secure_no_warnings
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#ifdef __GXX_EXPERIMENTAL_CXX0X__
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#ifdef __GXX_EXPERIMENTAL_CXX0X__
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#endif
using namespace std;
int main()
{
long long int N, A, B, C, X;
vector <int >data;
while (1)
{
int count = -1;
data.clear();
cin >> N >> A >> B >> C >> X;
if (N == 0)break;
data.resize(N);
for (size_t i = 0; i < N; i++)
{
cin >> data[i];
}
while (data.size())
{
if (*data.begin()==X)
{
data.erase(data.begin());
}
X = (A*X + B) % C;
count++;
if (count > 10000)
{
count = -1;
break;
}
}
cout << count<< endl;
}
} | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using ll=long long;
using namespace std;
int main(){
int n,d,x;
cin>>n>>d>>x;
int sum=0;
rep(i,n){
int a;
int b;
cin>>a;
b=1;
while(b<=d){
b+=a;
sum++;
}
}
cout<<sum+x<<"\n";
return 0;
} | 0 | 62,744,416 |
#include<bits/stdc++.h>
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int,int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<pii> vii;
typedef vector<pll> vll;
typedef double dl;
typedef priority_queue<int>piwi;
typedef queue<int>kiwi;
typedef map<int,int>mi;
typedef map<string,int>mis;
typedef multimap<int,int>muli;
typedef multimap<string,int>muls;
typedef multiset<int>si;
#define endl "\n"
#define Y cout<<"YES"<<endl;
#define NO cout<<"NO"<<endl;
#define yes cout<<"Yes"<<endl;
#define no cout<<"No"<<endl;
#define sp " "
#define PB push_back
#define F first
#define S second
#define as(a) (a).begin(),(a).end()
#define ras(a) (a).rbegin(),(a).rend()
#define sz(x) (int)x.size()
#define ki 1LL
#define MOD 1000000007
#define over return 0;
#define mem(a,b) memset(a, b, sizeof(a) )
#define sqr(a) ((a) * (a))
#define test int t;cin>>t;while(t--)
const double PI = acos(-1);
const double eps = 1e-9;
const int inf = 2000000000;
const ll infLL = 9000000000000000000;
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define fraction() cout.unsetf(ios::floatfield); cout.precision(10); cout.setf(ios::fixed,ios::floatfield);
#define file() freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define dbg(args...) do {cerr << #args << " : "; faltu(args); } while(0)
void faltu () { cerr << endl;}
template < typename T, typename ... hello>void faltu( T arg, const hello &... rest) {cerr << arg << ' ';faltu(rest...);}
const long long MAX_SIZE = 1000001; vector<long long >isprime(MAX_SIZE , true); vector<long long >prime; vector<long long >SPF(MAX_SIZE); void manipulated_seive(int N) { isprime[0] = isprime[1] = false ; for (long long int i=2; i<N ; i++) { if (isprime[i]) { prime.push_back(i); SPF[i] = i; } for(int j=0;j < (int)prime.size() && i*prime[j] < N && prime[j] <= SPF[i]; j++) { isprime[i*prime[j]]=false; SPF[i*prime[j]] = prime[j] ; } } }
int man_seive(int n){ manipulated_seive(n); for(int i=0;i<prime.size() && prime[i]<=n;i++)
cout<<prime[i]<<endl;
}
ll gcd ( ll a, ll b ) { return __gcd ( a, b ); }
ll lcm ( ll a, ll b ) { return a * ( b / gcd ( a, b ) ); }
int main(){
optimize();
int n;
cin>>n;int a[n+1];int b[n];
for(int i=0;i<n-1;i++){
cin>>b[i];
}
a[0]=b[0];
a[n-1]=b[n-2];
for(int i=1;i<n-1;i++){
a[i]=min(b[i-1],b[i]);
}
int sum=0;
for(int i=0;i<n;i++){
sum+=a[i];
}
cout<<sum<<endl;
over
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void){
int n, m;
cin >> n >> m;
vector<int> ans(n+1);
vector<bool> flag(n+1, true);
vector<vector<int>> g(n+1);
for(int i = 0; i < m; i++){
int a, b;
cin >> a >> b;
g[a].push_back(b);
g[b].push_back(a);
}
queue<int> que;
que.push(1);
flag[1] = false;
while(!que.empty()){
int v = que.front();
que.pop();
for(int i : g[v]){
if(flag[i]){
que.push(i);
ans[i] = v;
flag[i] = false;
}
}
}
cout << "Yes" << endl;
for(int i = 2; i <= n; i++){
cout << ans[i] << endl;
}
return 0;
} | 0 | 15,944,640 |
#include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int64_t i = 0; i < (n); i++)
#define irep(i, n) for (int64_t i = 0; i <= (n); i++)
#define rrep(i, n) for (int64_t i = (n)-1; i >= 0; i--)
#define rirep(i, n) for (int64_t i = n; i >= 0; i--)
int main() {
string N;
int K;
cin >> N >> K;
vector<int64_t> dpl(K + 1);
int nonzero = 0;
rep(i, N.size() + 1) {
int d = N[i - 1] - '0';
rrep(j, K + 1) {
if (i == 0) {
dpl[j] = 0;
} else {
dpl[j] = dpl[j];
dpl[j] += (j > 0) ? 9 * dpl[j - 1] : 0;
dpl[j] += (j == nonzero && d > 0) ? 1 : 0;
dpl[j] += (j - 1 == nonzero && d > 0) ? d - 1 : 0;
}
cerr << dpl[j] << " ";
}
cerr << endl;
if (d > 0) {
nonzero++;
}
}
cout << (nonzero == K ? 1 : 0) + dpl[K] << endl;
return 0;
} | #include <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <iomanip>
#include <stdlib.h>
#include <string.h>
#include <cmath>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <set>
const int MOD = 1e9 + 7;
using namespace std;
typedef long long ll;
map<ll, int> mp;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
if (k == 1) cout << 0 << endl;
else cout << n - k << endl;
return 0;
} | 0 | 35,040,215 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using p = pair<int,int>;
const long long INF = 1ll << 60;
int main() {
int N;cin >> N;
vector<int> v(N);
rep(i,N)cin >> v[i];
sort(v.begin(),v.end());
double ans = v[0];
for(int i = 1; i < N; i++){
ans = (ans + v[i])/2;
}
cout << fixed << setprecision(15) << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww
{
cww()
{
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
typedef long long ll;
typedef vector<int> vint;
typedef vector<char> vchar;
typedef vector<vector<int>> vvint;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef unsigned long long ull;
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;
}
vll yakusuu;
void div(ll N)
{
for (ll i = 1; i * i <= N; i++)
{
if (N % i == 0)
{
yakusuu.push_back(i);
if (i * i != N)
yakusuu.push_back(N / i);
}
}
}
int main()
{
ll N, ans = 0;
cin >> N;
div(N);
for (auto i : yakusuu)
{
ll m = N / i - 1;
if (N / (m + 1) < m)
ans += m;
}
cout << ans;
return 0;
} | 0 | 91,732,273 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define all(vec) vec.begin(),vec.end()
using ll = long long;
int main() {
int N, A, B; cin >> N >> A >> B;
if ((B-A)%2 == 1) cout << "Borys" << endl;
else cout << "Alice" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define INF 1000007
#define MOD 1000000007
#define int long long
#define maxn 101
#define maxh 1001
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) FOR(i, 0, n)
const int dx[4] = {0, 1, -1, 0}, dy[4] = {1, 0, 0, -1};
typedef std::pair<int, int> P;
vector<bool> prime(maxn + 1, true);
void prime_table(void) {
prime[0] = false;
prime[1] = false;
for (int i = 2; i * i <= maxn; i++) {
if (!prime[i]) {
continue;
}
for (int j = i + i; j <= maxn; j += j + i) {
prime[j] = false;
}
}
}
int gcd(int a, int b) {
return b ? gcd(b, a % b) : a;
}
int lcm(int a, int b) { return a / gcd(a, b) * b; }
bool IsPrime(int num)
{
if (num < 2)
return false;
else if (num == 2)
return true;
else if (num % 2 == 0)
return false;
double sqrtNum = sqrt(num);
for (int i = 3; i <= sqrtNum; i += 2) {
if (num % i == 0) {
return false;
}
}
return true;
}
vector<int> divisor(int n)
{
vector<int> ret;
for (int i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i - 1);
if (i * i != n) {
ret.push_back((n / i) - 1);
}
}
}
sort(ret.begin(), ret.end());
return (ret);
}
int a, b;
void f(int x) {
while (x) {
a++;
b = x;
x /= 10;
}
}
signed main() {
int H, W;
cin >> H >> W;
vector<string> A(H);
rep(i, H) cin >> A[i];
vector<vector<int>> ans(H, vector<int>(W, INF));
vector<vector<int>> dist(H, vector<int>(W, INF));
queue<P> q;
auto update = [&](int i, int j, int x) {
if (dist[i][j] != INF) return;
dist[i][j] = x;
ans[i][j] = min(ans[i][j], dist[i][j]);
q.push(P(i, j));
};
rep(si, H)
rep(sj, W) {
if (A[si][sj] != '#')continue;
update(si, sj, 0);
}
while (!q.empty()) {
int i = q.front().first;
int j = q.front().second;
q.pop();
rep(dis, 4) {
int ni = i + dx[dis];
int nj = j + dy[dis];
if (ni < 0 || ni >= H || nj < 0 || nj >= W || (dist[ni][nj] != INF)) continue;
if (A[ni][nj] == '#') {
dist[ni][nj] = 0;
continue;
}
update(ni, nj, dist[i][j] + 1);
}
}
int ANS = 0;
rep(i, H)
rep(j, W) {
ANS = max(ANS, ans[i][j]);
}
cout << ANS << endl;
} | 0 | 54,264,987 |
#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <deque>
#include <queue>
#include <fstream>
#include <iomanip>
#include <stack>
#include <algorithm>
#include <set>
#include <map>
#include <list>
#define endl "\n"
typedef long long ll;
using namespace std;
void Lancer() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); }
bool isPrime(ll n){
if (n == 2 || n == 3 || n == 5)
return true;
else if (n % 2 == 0 || n % 3 == 0 || n % 5 == 0 || n == 1)
return false;
else {
for (int i = 5; i <= sqrt(n); i += 2){
if (n%i == 0)
return false;
}
return true;
}
}
int main(){
Lancer();
ll n, m, ans = 0;
cin >> n;
vector<string>blue(n);
for (int i = 0; i < n; i++)
cin >> blue[i];
cin >> m;
vector<string>red(m);
for (int i = 0; i < m; i++)
cin >> red[i];
for (int i = 0; i < n; i++){
bool ch = true;
ll t = 0;
for (int j = 0; j < m; j++){
if (blue[i] == red[j])t--;
}
for (int j = 0; j < n; j++){
if (blue[i] == blue[j])
t++;
}
ans = max(t, ans);
}
cout << ans;
cout << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define uint unsigned int
#define ull unsigned long long
typedef string str;
typedef long long ll;
typedef double db;
typedef pair<int, int> pii;
typedef map<int, int> mii;
typedef vector<int> vi;
typedef vector<bool> vb;
#define pb push_back
#define fi first
#define se second
#define in insert
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define speed ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
const int INF = 1e9 + 5;
const int N = 2e5 + 123;
int main(){
speed;
int n;
cin >> n;
vi s(n);
for(int i = 0; i < n; ++i){
cin >> s[i];
}
sort(rall(s));
ll x = 0, y = 0;
for(int i = 0; i < n - 1; ++i){
if(s[i] == s[i + 1] && x == 0){
x = s[i];
i++;
}
else if(s[i] == s[i + 1] && x != 0){
if(y == 0){
y = s[i];
break;
}
}
}
cout << x * y;
} | 0 | 98,571,533 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(x) (x).begin(),(x).end()
template <class T> inline bool chmin(T &a, T b) {if (a > b){a = b;return true;}return false;}
template <class T> inline bool chmax(T &a, T b) {if (a < b){a = b;return true;}return false;}
int ans[1100][1100];
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int h,w,a,b; cin>>h>>w>>a>>b;
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
if((i<b && j<a) || (i>=b && j>=a)){
ans[i][j]=1;
}
}
}
for(int i=0; i<h;i++){
for(int j=0;j<w;j++){
cout<<ans[i][j];
}
cout<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >>n;
priority_queue<int>q;
for(int i=0;i<n;i++){
int a;
cin>>a;
q.push(a);
}
int a,b,amari;
while(q.size()>0){
if(q.size()==1){
amari=q.top();q.pop();
break;
}else if(q.size()==2){
a=q.top();q.pop();
b=q.top();q.pop();
a-=b;;
if(a>0&&b>0){
q.push(a);
q.push(b);
}else{
amari=b;
}
}else{
a=q.top();q.pop();
b=q.top();q.pop();
amari=a%b;
if(amari!=0)q.push(amari);
}
}
cout<<amari<<endl;
return 0;
} | 0 | 83,578,520 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int min_value = 100000000;
for (int i = 2; i < S.size(); ++i) {
int A, B, C;
A = S.at(i - 2) - '1' + 1;
B = S.at(i - 1) - '1' + 1;
C = S.at(i) - '1' + 1;
int value = A * 100 + B * 10 + C * 1;
min_value = min(min_value, abs(value - 753));
}
cout << min_value << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const long long INF = 1e18;
# define len(x) ((int)(x).size())
# define rep(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
# define reps(i, n) for(int i=1, i##_len=(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 foreps(i, m, n) for(int i = m;i < n;i++)
# define ALL(x) (x).begin(), (x).end()
# define rall(x) (x).rbegin(), (x).rend()
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; }
int ssChecker(string &S) {
int cnt = 0;
while (true) {
S.pop_back();
if (len(S) % 2 != 0) continue;
string st = S.substr(0, len(S) / 2);
string str = S.substr(len(S) / 2);
if (st == str) {
return len(st) + len(str);
}
}
}
int main() {
string S; cin >> S;
cout << ssChecker(S) << endl;
} | 0 | 38,180,969 |
#include <bits/stdc++.h>
#define INF INT_MAX
#define ll long long
#define ull unsigned long long
#define rep(i,n) for(ll i=0; i<n; ++i)
#define FOR(i, s, e) for(ll i=s; i<e; ++i)
#define MOD 1000000007
using namespace std;
template<class T> inline bool chmin(T& a, T b) { if(a>b) {a=b; return true;} return false;}
template<class T> inline bool chmax(T& a, T b) { if(a<b) {a=b; return true;} return false;}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string S; cin >> S;
if(S == "RRS" || S == "SRR") cout << 2 << endl;
else if(S == "RRR") cout << 3 << endl;
else if(S == "SSS") cout << 0 << endl;
else cout << 1 << endl;
} | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define INF 1000000000000000000
typedef pair<ll, ll> pll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
map<string, int> ma;
string prev = "unti";
rep(i, N) {
string s;
cin >> s;
if (i != 0) {
if (ma[s] != 0) {
cout << "No" << endl;
return 0;
}
if (prev.back() != s.front()) {
cout << "No" << endl;
return 0;
}
}
ma[s]++;
prev = s;
}
cout << "Yes" << endl;
return 0;
} | 0 | 95,640,856 |
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <stack>
#include <string>
#include <math.h>
#define MAX 16777216
using namespace std;
bool dct[MAX+1];
int fourToTen(string key){
string::iterator itr;
int number=0;
itr = key.begin();
for(int i=0;;i++){
if(itr == key.end())
return number;
if(*itr == 'A'){
number+=1*(int)pow((double)4,(double)i);
}else if(*itr == 'C'){
number+=2*(int)pow((double)4,(double)i);
}else if(*itr == 'G'){
number+=3*(int)pow((double)4,(double)i);
}else if(*itr == 'T'){
number+=4*(int)pow((double)4,(double)i);
}else
cout <<"error" <<endl;
itr++;
}
}
bool find(string key){
if(dct[fourToTen(key)] == true)
return true;
else
return false;
}
void insert(string key){
dct[fourToTen(key)] = true;
}
int main(){
int numinput;
string command,key;
for(int i=0;i<MAX;i++){
dct[i] = false;
}
cin >>numinput;
for(int i=0;i<numinput;i++){
cin >>command;
cin >>key;
if(command == "find"){
if(find(key))
cout <<"yes" <<endl;
else
cout <<"no" <<endl;
}else if(command =="insert"){
insert(key);
}
}
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main()
{
int n;
while (cin >> n && n != 0) {
int *a = new int[n];
int m;
for (int i = 0; i < n; i++) {
int t;
cin >> t;
a[i] = t;
}
m = a[0];
for (int j = 0; j < n; j++) {
int t = 0;
for (int k = j; k < n; k++) {
t += a[k];
if (m < t) m = t;
}
}
delete [] a;
cout << m << endl;
}
return 0;
} | 0 | 83,710,042 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 1e9
int main() {
int N,K;
cin >> N >> K;
vector<long long int> a(N);
vector<long long int> max_a(N);
for (int i=0;i<N; i++){
cin >> a[i];
if (i==0){
max_a[0] = a[i];
}else{
if(max_a[i-1]< a[i]){
max_a[i] = a[i];
}else{
max_a[i] = max_a[i-1];
}
}
}
long long int min_cost = LLONG_MAX;
for (int j=0; j<(1<<N); j++){
vector<int> S;
for (int k=0; k<N; k++){
if (j & (1<<k)){
S.push_back(k);
}
}
if (S.size() >= K && S[0] == 0){
long long int max_height = 0;
long long int cost = 0;
for (int l=0; l<S.size(); l++){
if (l == 0){
max_height = a[S[0]];
continue;
}
if(max_height < max_a[S[l]]){
if(max_a[S[l]] > max_a[S[l]-1]){
max_height = max_a[S[l]];
continue;
}
max_height = max_a[S[l]];
}
if (max_height >= a[S[l]]){
cost += max_height - a[S[l]] +1;
max_height ++;
}
else{
max_height = a[S[l]];
}
}
if (min_cost > cost){
min_cost = cost;
}
}
}
cout << min_cost << endl;
return 0;
} | #include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#define rep(i,j,k) for(int i=(int)j;i<(int)k;i++)
#define ll long long
#define Sort(v) sort(all(v))
#define LINF (1LL<<40)
#define END return 0
#define pb push_back
#define se second
#define fi first
#define pb push_back
#define all(v) (v).begin() , (v).end()
#define MP make_pair
#define int long long
using namespace std;
int day[12]={31,28,31,30,31,30,31,31,30,31,30,31};
typedef pair<int,int> P;
const long long MOD=1000000007LL;
bool isupper(char c){if('A'<=c&&c<='Z')return 1;return 0;}
bool islower(char c){if('a'<=c&&c<='z')return 1;return 0;}
bool iskaibun(string s){for(int i=0;i<s.size()/2;i++)if(s[i]!=s[s.size()-i-1])return 0;return 1;}
bool isnumber(char c){return ('0'<=c&&c<='9');}
bool isalpha(char c){return (isupper(c)||islower(c));}
template<typename T>
void print(vector<T> v){
for(int i=0;i<v.size();i++){
if(i)cout<<" ";
cout<<v[i];
}
cout<<endl;
}
int INF=1e18;
template<typename T>
void printendl(vector<T> v){
for(auto date:v)cout<<date<<endl;
}
template<typename T>
void printvv(vector<vector<T>> v){
for(int i=0;i<v.size();i++){
for(int j=0;j<v[i].size();j++){
if(j)cout<<" ";
cout<<v[i][j];
}
cout<<endl;
}
}
int gcd(int a,int b){
if(a<b)swap(a,b);
if(b==0)return a;
else return gcd(b,a%b);
}
struct Edge{
int to,cost;
};
struct S{
int time,money;
};
vector<vector<Edge>> g(100100);
int n,m;
bool solve(){
vector<int> vis(n,0),cost(n,0);
rep(j,0,n){
if(vis[j]==0){
vis[j]=1;
cost[j]=0;
queue<int> que;
que.push(j);
while(!que.empty()){
int now=que.front();
que.pop();
rep(i,0,g[now].size()){
if(vis[g[now][i].to]){
if(cost[g[now][i].to]!=cost[now]+g[now][i].cost)return false;
}else {
cost[g[now][i].to]=cost[now] + g[now][i].cost;
vis[g[now][i].to]=1;
que.push(g[now][i].to);
}
}
}
}
}
return true;
}
signed main (){
cin>>n>>m;
rep(i,0,m){
int l,r,c;
cin>>l>>r>>c;
l--; r--;
g[l].push_back(Edge{r,c});
g[r].push_back(Edge{l,-c});
}
bool ans=solve();
if(ans)cout<<"Yes"<<endl;
else cout<<"No"<<endl;
} | 0 | 2,696,748 |
#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;
sort(s.begin(), s.end());
bool bl = false;
if (s[0]==s[1] && s[2]==s[3] && s[0]!=s[2]) bl = true;
if (bl) puts("Yes");
else puts("No");
return 0;
} | #include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#define dbg(x) cerr << #x << " = " << x << '\n'
#define sz(x) (int)x.size()
#define all(a) (a.begin(),a.end())
#define ff first
#define ss second
#define pii pair<int,int>
#define lcm(a,b) (a*b)/__gcd(a,b)
using namespace std;
int x[2005][2005],y[2005][2005];
inline void solve(){
int r, c ;
cin >> r >> c ;
string s[r];
for (int i=0;i<r;i++){
cin >> s[i] ;
for (int j=0,cnt=0;j<c;j++){
if (s[i][j]=='#') {
x[i][j] = -1;
cnt = 0;
}
else {
cnt++;
x[i][j] = cnt;
}
}
}
for (int i=0;i<c;i++){
for (int j=0,cnt=0;j<r;j++){
if (s[j][i] == '#') {
y[j][i] = -1 ;
cnt = 0 ;
}
else {
cnt++;
y[j][i] = cnt ;
}
}
}
for (int i=0;i<r;i++){
for (int j=c-2;j>=0;j--){
if (x[i][j] != -1){
x[i][j] = max(x[i][j],x[i][j+1]);
}
}
}
for (int i=0;i<c;i++){
for (int j=r-2;j>=0;j--){
if (y[j][i] != -1){
y[j][i] = max(y[j][i],y[j+1][i]);
}
}
}
int ans = 0;
for (int i=0;i<r;i++)
for (int j=0;j<c;j++)
ans = max(ans,x[i][j]+y[i][j]-1);
cout << ans << endl;
}
signed main()
{
int n=1;
while (n--) solve();
return 0;
} | 0 | 65,976,485 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long;
const int INF = 1001001001;
const ll INF_LL = 1001001001001001001LL;
int main(void){
string s; cin >> s;
if(s.size()==2 && s[0] == s[1]){
cout << s.size() << endl;
return 0;
}
while(true){
auto end = s.end()-1;
s.erase(end);
int n = s.size();
string left = "";
string right = "";
if(s.size()%2!=0) continue;
rep(j,s.size()/2) left+=s[j];
for(int j = n/2;j<n;j++) right+=s[j];
if(left==right && s.size()%2==0){
cout << s.size() << endl;
return 0;
}
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
string s1,s2,s3;
cin>>s1>>s2;
cin>>a>>b;
cin>>s3;
if(s3.compare(s1)==0){
a--;
}
else if(s3.compare(s2)==0){
b--;
}
if(a<0){
a=0;
}
if(b<0){
b=0;
}
cout<<a<<" "<<b<<endl;
} | 0 | 40,470,058 |
#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<string>
#include<iomanip>
#include<list>
#include<math.h>
#include<stack>
using namespace std;
int n = 0;
int s = 0;
static int ans;
void check(int atai, int num, int count){
if (num > 9) {
if (atai == s && count == n) {
ans++;
}
return;
}
check(atai + num, num + 1, count + 1);
check(atai, num + 1, count);
}
int main(int argc, char **argv)
{
while (cin >> n >> s) {
ans = 0;
if (n == 0 && s == 0) {
break;
}
check(0, 0, 0);
cout << ans << endl;
}
} | #include<iostream>
using namespace std;
int main(){
int H,W;
bool flag= true;
cin>>H>>W;
if(H==0&&W==0){
flag = false;
}
while(flag==true){
for(int i=1;i<=H;i++){
for(int j=1;j<=W;j++){
cout<<"#";
if(1<i&&i<H&&0<j&&j<W){
for(int k=1;k<W-1;k++){
cout<<".";
j=W-1;
}
}
}
cout<<endl;
}
cin>>H>>W;
if(H==0&&W==0){
flag = false;
}
cout<<endl;
}
return 0;
} | 0 | 69,419,190 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i= 0; i < (n); i++)
using ll= long long int;
using namespace std;
ll mod= 1e9 + 7;
int main() {
int n;
cin >>n;
int a[n];
rep(i,n)cin >>a[i];
int ans=a[0];
for(int i=1;i<n;i++){
ans=__gcd(ans,a[i]);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n,m,sum;
cin >> n >> m;
sum = 0;
vector<int> vec(n);
for(int i=0;i<n;i++){
cin >> vec.at(i);
}
for(int i=0;i<n;i++){
sum += vec.at(i);
}
sort(vec.begin(), vec.end());
reverse(vec.begin(), vec.end());
if(sum % (4*m) == 0){
if(vec.at(m-1) < sum/(4*m))
cout << "No";
else
cout << "Yes";
}
else{
if(vec.at(m-1) <= sum/(4*m))
cout << "No";
else
cout << "Yes";
}
} | 0 | 30,233,784 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define m_p make_pair
#define p_b push_back
#define e_b emplace_back
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#define rep(i,n) REP(i,0,n)
#ifdef LOCAL
#define debug(x) cerr<<"LINE"<<__LINE__<<" : "<<#x<<" = "<<(x)<<endl
#define debug_vec(x) cerr<<"LINE"<<__LINE__<<" : "<<#x<<" = ";\
rep(i,sz(x)){cerr<<x[i]<<" ";}cerr<<endl
#define debug_mat(x) cerr<<"LINE"<<__LINE__<<" : "<<#x<<" = "<<endl;\
rep(i,sz(x)){rep(j,sz(x[i])){cerr<<x[i][j]<<" ";}cerr<<endl;}cerr<<endl
#else
#define debug(x) void(0)
#define debug_vec(x) void(0)
#define debug_mat(x) void(0)
#endif
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return true;}return false;}
template<class T> bool chmin(T &a,T b){if(a>b){a=b;return true;}return false;}
int main(){
ios_base::sync_with_stdio(false);cin.tie(0);
string S;
cin >> S;
if(sz(S)!=26){
vector<bool> used(26,false);
rep(i,sz(S)) used.at(S.at(i)-'a')=true;
rep(i,26){
if(used.at(i)) continue;
S+=char(i+'a');
break;
}
cout << S << endl;
return 0;
}
bool flag=true;
rep(i,26) if(S.at(i)!='z'-i) flag=false;
if(flag){
cout << -1 << endl;
return 0;
}
vector<bool> used(26,false);
for(int i=26-1;i>=0;i--){
int now=S.at(i)-'a';
used.at(now)=true;
if(i==25) continue;
if(S.at(i)<S.at(i+1)){
string ans="";
rep(j,i) ans+=S.at(j);
REP(j,now+1,26){
if(used.at(j)){
ans+=char(j+'a');
break;
}
}
cout << ans << endl;
return 0;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define mp make_pair
#define ff first
#define ss second
#define pb push_back
#define fo(i,n) for(i=0;i<n;i++)
#define fo1(i,n) for(i=1;i<=n;i++)
#define FO(i,k,n) for(i=k;k<=n?i<=n:i>=n;k<=n?i++:i--)
#define all(c) c.begin(),c.end()
#define rall(c) c.rbegin(),c.rend()
#define si set<int>
#define vi vector<int>
#define mii map<int,int>
#define pii pair<int,int>
#define usi unordered_set<int>
#define umii unordered_map<int,int>
#define pqmx priority_queue<int>
#define pqmn priority_queue<int,vi,greater<int> >
#define sp(x) cout<<setprecision(x)<<fixed;
#define setbits(x) __builtin_popcountll(x)
#define zerobits(x) __builtin_ctzll(x)
#define in(a,n) vi a(n);fo(i,n)cin>>a[i];
#define in1(a,n) vi a(n+1);fo1(i,n)cin>>a[i];
#define w(t) int t;cin>>t;while(t--)
#define gcd __gcd
#define lcm(x,y) x*(y/gcd(x,y))
#define endl '\n'
#define PI 3.14159265358979323846
#define inf 1e18
#define mod 1000000007
void __p(int x) {cout<<x;}
void __p(int32_t x){cout<<x;}
void __p(float x){cout<<x;}
void __p(double x){cout<<x;}
void __p(ld x) {cout<<x;}
void __p(char x){cout <<'\''<<x<<'\'';}
void __p(const char *x){cout <<'\"' <<x<<'\"';}
void __p(const string &x) {cout<<'\"'<<x<<'\"';}
void __p(bool x) {cout<<(x?"true":"false");}
template<typename T,typename V> void __p(const pair<T,V> &x) {cout<<'{';__p(x.first);cout<<',';__p(x.second);cout<<'}';}
template<typename T> void __p(const T &x) {int f = 0; cout << '{'; for (auto &i: x) cout << (f++ ? "," : ""), __p(i); cout << "}";}void _p() {cout << "]\n";}
template <typename T,typename... V> void _p(T t, V... v) {__p(t);if(sizeof...(v))cout<<", ";_p(v...);}
int po(int x,int p,int m = inf) {int ans=1;x%=m;while(p>0){if(p&1)ans=(ans*x)%m;p=p>>1;x=(x*x)%m;}return ans;}
int inv(int x,int m=mod){return po(x,m-2,m)%m;}
#ifndef ONLINE_JUDGE
#define dbg(x...) cout<<"["<<#x<<"]=[";_p(x)
#else
#define dbg(x...)
#endif
const int N=1e6+6;
int n,m,k,x,y,z,a,b,c,d,i,j,l,r;
void sol()
{
cin>>n>>m;
in(a,n);
int sm=0;
fo(i,n)sm+=a[i];
sm=ceil(sm/(4.0*m));
c=0;
fo(i,n)if(a[i]>=sm)c++;
cout<<((c>=m)?"Yes":"No") <<endl;
}
int32_t main()
{
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
sol();
return 0;
} | 0 | 45,717,941 |
#include <iostream>
#include <complex>
#include <cmath>
#include <string>
using namespace std;
typedef complex<double> C;
#define EPS (1e-8)
#define EQ(a,b) (abs((a)-(b)) < EPS)
const string mes[2] = {"YES","NO"};
double cross(C a, C b) {
return a.real()*b.imag() - a.imag()*b.real();
}
bool is_paralelle(C a, C b) {
return EQ(cross(a,b), 0.0);
}
void solve() {
double x1, y1, x2, y2, x3, y3, x4, y4;
cin>>x1>>y1>>x2>>y2>>x3>>y3>>x4>>y4;
C a(x1, y1), b(x2, y2), c(x3, y3), d(x4, y4);
int res = (is_paralelle(a-b, c-d))?0:1;
cout<<mes[res]<<endl;
}
int main (int argc, char const* argv[]) {
int n; cin>>n;
for(int i=0;i<n;i++) solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<string, int> psi;
typedef pair<string, string> pss;
#define pb push_back
#define PI acos(-1.0)
#define EPS 1e-4
#define mp make_pair
#define all(x) x.begin(), x.end()
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define fout(S,x) cout<<fixed<<setprecision(x)<<(S)<<endl
#define present(c,x) ((c).find(x) != (c).end())
#define T() ll t;cin>>t;while(t--)
#define mem(input,b) memset(input,b,sizeof(input))
#define ff first
#define ss second
#define fread(input) freopen("input","r",stdin)
#define fwrite(b) freopen("b","w",stdout)
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
#define FOREACH(i,c) for (__typeof ((c).begin()) i = (c).begin() ; i != (c).end() ; i++)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
const char* comma = strchr(names + 1, ',');cerr.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
}
const int maxn=1e5+5;
const int mod=1e9+7;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
bool lessThan(const string &a, const string &b) {
if (a == "") {
return true;
} else if (a.size() == b.size()) {
return a < b;
} else {
return a.size() < b.size();
}
}
int main(){
fastio;
ll n,m;
cin>>n>>m;
vector<ll> a(m);
for(int i=0;i<m;++i)
cin>>a[i];
vector<string> dp(n+1,"$");
ll matches[9] = {2,5,5,4,5,6,3,7,6};
dp[0]="";
for(int i=0;i<n;++i){
if(dp[i]=="$")
continue;
for(auto x:a){
if(i+matches[x-1]>n){
continue;
}
if(lessThan(dp[i+matches[x-1]],dp[i]+(char)('0'+x))){
dp[i+matches[x-1]] = dp[i] + (char)('0'+x);
}
}
}
cout<<dp[n]<<endl;
return 0;
} | 0 | 55,998,968 |
#include <bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(),(x).end()
#define COUT(x) cout<<(x)<<"\n"
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define REP(i, n) for(int i=0;i<n;i++)
#define YES(x) cout<<(x?"YES":"NO")<<"\n"
#define Yes(x) cout<<(x?"Yes":"No")<<"\n"
#define dump(x) cout<<#x<<" = "<<(x)<<"\n"
#define endl "\n"
using G = vector<vector<int>>;
using P = pair<int,int>;
using PQ = priority_queue<int>;
using PQG = priority_queue<int,vector<int>,greater<int>>;
using V = vector<int>;
using ll = long long;
using edge = struct { int to; int cost; };
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
int N,M,R;
vector<int> r(8);
vector<int> a(40000),b(40000),c(40000);
vector<vector<P>> g(40000);
int dp[200][200];
int ans = INF;
void warshall_floyd() {
REP(i,N) REP(j,N) {
dp[i][j] = j==i ? 0 : INF;
}
REP(i,M) {
dp[a[i]][b[i]] = c[i];
dp[b[i]][a[i]] = c[i];
}
REP(k,N) {
REP(i,N) {
REP(j,N) {
dp[i][j] = min(dp[i][j], dp[i][k] + dp[k][j]);
}
}
}
}
void dfs(vector<int> v) {
if (v.size() == R) {
int sum = 0;
REP(i,R-1) {
int from = r[v[i]], to = r[v[i+1]];
sum += dp[from][to];
}
chmin(ans,sum);
return;
}
REP(i,R) {
if (find(ALL(v), i) != v.end()) continue;
vector<int> nv = v;
nv.push_back(i);
dfs(nv);
}
return;
}
int main() {
IOS;
cin >> N >> M >> R;
REP(i,R) {
cin >> r[i];
r[i]--;
}
REP(i,M) {
cin >> a[i] >> b[i] >> c[i];
a[i]--; b[i]--;
}
warshall_floyd();
dfs(vector<int>());
COUT(ans);
return 0;
} | #include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
typedef long long ll;
int main(){
int n, x, y;
int c=0;
while(cin>>n>>x && !(n==0 && x==0)){
int c=0;
for(int i=1; i<=n-2; i++){
for(int j=i; j<=n-1; j++){
for(int k=j; k<=n; k++){
if(!(i==j || j==k || k==i)){
y = i+j+k;
if(y==x){
c++;
}
}
}
}
}
cout<<c<<endl;
}
} | 0 | 62,571,081 |
#include <iostream>
#include<string>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<vector>
using namespace std;
int main(){
int a,i,max=0;
vector<int> count(100,0);
while(cin>>a){
count[a]++;
}
for(i=1;i<count.size();i++){
if(max<count[i])max=count[i];
}
for(i=1;i<count.size();i++){
if(max==count[i])cout<<i<<endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int n;
int a[2002];
int m[2][2002];
int main() {
cin>>n>>a[0]>>a[1];
for (int i=0; i<n; i++) cin>>a[i+2];
for (int i=n+1; i>1; i--) {
m[0][i] = abs(a[i-1] - a[n+1]);
for (int j=n+1; j>i; j--) {
m[0][i] = max(m[1][j], m[0][i]);
}
m[1][i] = abs(a[i-1] - a[n+1]);
for (int j=n+1; j>i; j--) {
m[1][i] = min(m[0][j], m[1][i]);
}
}
cout<<m[0][2]<<endl;
} | 0 | 9,720,492 |
#include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL (-1)
using namespace std;
const int64_t MOD = 1e9 + 7;
int n;
vector<vector<int>> M(100, vector<int>(100));
vector<int> d(100), C(100);
static const int INFTY = INT_MAX;
void bfs(int s) {
for (int i = 0; i < n; i++) {
C.at(i) = 0;
d.at(i) = INFTY;
}
C.at(s) = 1;
d.at(s) = 0;
queue<int>q;
q.push(s);
while (!q.empty()) {
int u = q.front();
q.pop();
for (int i = 0; i < n; i++) {
if (M.at(u).at(i) && (C.at(i) == 0)) {
C.at(i) = 1;
d.at(i) = d.at(u) + 1;
q.push(i);
}
}
C.at(u) = 2;
}
for (int i= 0; i < n; i++) {
cout << i + 1 << ' ' << (d.at(i) == INFTY ? -1 : d.at(i)) << endl;
}
}
int main() {
int u, k, v;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> v >> k;
for (int j = 0; j < k; j++) {
int x;
cin >> x;
M.at(v - 1).at(x - 1) = true;
}
}
bfs(0);
return 0;
} | #include <bits/stdc++.h>
#define fastIO (cin.tie(0), cout.tie(0), ios::sync_with_stdio(false))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define precise(i) fixed << setprecision(i)
using lint = long;
using llint = long long;
using namespace std;
int main() {
fastIO;
char buf[10]{};
string s;
cin >> s;
int idx = 0;
for (auto ch : s) {
if (ch == '0') {
buf[idx++] = ch;
} else if (ch == '1') {
buf[idx++] = ch;
} else if (ch == 'B') {
if (idx > 0)
idx--;
}
}
for (int i = 0; i < idx; i++) cout << buf[i];
cout << endl;
} | 0 | 85,095,512 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n;
a = n / 1000;
b = n % 1000 / 100;
c = n % 1000 % 100 / 10;
d = n % 1000 % 100 % 10;
if (a == b) {
if (b == c) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
}
else if (b == c) {
if (c == d) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
}
else {
cout << "No" << endl;
}
} | #include <iostream>
using std::cout;
using std::endl;
using std::cin;
int main()
{
int a, b, c;
while (cin >> a >> b >> c) {
if (a < b && b < c) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
} | 0 | 78,676,216 |
#include <iostream>
#include <fstream>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <algorithm>
#include <numeric>
#include <functional>
#include <string>
#include <vector>
#include <bitset>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
using namespace std;
using ll = long long;
#define REP(i,n) for(long long i = 0; i < (n); i++)
#define FOR(i, m, n) for(long long i = (m);i < (n); ++i)
#define ALL(obj) (obj).begin(),(obj).end()
template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;
const ll MOD = (ll)1e9 + 7;
const ll HINF = (ll)1e18;
const ll LINF = (ll)1e9;
const long double PI = 3.1415926535897932384626433;
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
template <template <class tmp> class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
void YN(bool flg) {cout << ((flg) ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << ((flg) ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << ((flg) ? "yes" : "no") << endl;}
int main() {
int N; cin >> N;
V<ll> x(N),y(N);
REP(i,N) cin >> x[i] >> y[i];
ll prt = abs(x[0]+y[0])%2;
REP(i,N) corner((abs(x[i]+y[i])%2)!=prt,-1);
int m = 31+!prt;
V<ll> d;
REP(i,31) d.push_back(1LL<<i);
if(!prt)d.push_back(1);
cout << m << endl;
REP(i,m) cout << d[i] << " "; cout << endl;
REP(i,N){
ll u = x[i]+y[i];
ll v = x[i]-y[i];
ll ub=(u+(1<<31)-prt)/2;
ll vb=(v+(1<<31)-prt)/2;
string ans;
REP(i,31) {
char c;
if( !(ub&(1<<i)) && !(vb&(1<<i)) ) c = 'L';
if( (ub&(1<<i)) && (vb&(1<<i)) ) c = 'R';
if( !(ub&(1<<i)) && (vb&(1<<i)) ) c = 'D';
if( (ub&(1<<i)) && !(vb&(1<<i)) ) c = 'U';
ans.push_back(c);
}
if(!prt)ans.push_back('L');
cout << ans << endl;
}
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define FastIO ios_base::sync_with_stdio(0);cin.tie(0),cout.tie(0)
#define pb push_back
#define mp make_pair
#define mem(x,i) memset(x,i,sizeof(x))
#define ff first
#define ss second
#define popcount(x) __builtin_popcount(x)
#define all(x) x.begin(),x.end()
#define Case(t) for(int ks=1;ks<=t;ks++)
#define fileout freopen("output.txt","w",stdout)
#define filein freopen("input.txt","r",stdin)
#define D(x) cerr<< __LINE__ <<": "<< #x << " = "<<(x) <<'\n';
#define endl '\n'
using namespace std;
using namespace __gnu_pbds;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pil = pair<int,ll>;
const int INF = 0x3f3f3f3f;
const ll LL_INF = 0x3f3f3f3f3f3f3f3f;
const double PI = acos(-1);
const double eps = 1e-4;
const int mod = 1e9+7;
const int mx = 5e5+5;
template <typename T> using orderedSet =
tree<T, null_type, less_equal<T>,
rb_tree_tag, tree_order_statistics_node_update>;
char arr[103][103];
int dis[103][103];
int main()
{
int h,w;
cin>>h>>w;
for(int i=0;i<h;i++) cin>>arr[i];
mem(dis,INF);
dis[0][0]=(arr[0][0]=='#');
for(int i=0;i<h;i++)
{
for(int j=0;j<w;j++)
{
if(!i && !j) continue;
else if(!i) dis[i][j]=dis[i][j-1]+(arr[i][j]!=arr[i][j-1]);
else if(!j) dis[i][j]=dis[i-1][j]+(arr[i][j]!=arr[i-1][j]);
else dis[i][j]=min(dis[i-1][j]+(arr[i-1][j]!=arr[i][j]),dis[i][j-1]+(arr[i][j]!=arr[i][j-1]));
}
}
cout<<(dis[h-1][w-1]+1)/2<<endl;
} | 0 | 100,215,600 |
#include <iostream>
using namespace std;
int main() {
string S,T;
cin>>S>>T;
cout<<T+S;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define boost ios_base::sync_with_stdio(false);cin.tie(NULL);
#define pb push_back
#define mp make_pair
#define in insert
#define pi 2*acos(0.0)1
#define srt(s) sort(s.begin(),s.end())
#define all(x) x.begin(),x.end()
const ll mod=1e9+7;
const ll MX=2e5+5;
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
boost
int n;
cin >> n;
vector <int> v(n);
for(auto &i : v) cin >> i;
int tmp=v[0],ans=0;
for(int i=0;i<n;i++)
{
if(v[i]<=tmp)
{
tmp=v[i];
ans++;
}
}
cout << ans << endl;
return 0;
} | 0 | 57,079,678 |
#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
const int N=1e5+1e3+7;
int n,a[N],val;
int ab(int x)
{
return x<0?-x:x;
}
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d",&a[i]);
sort(a+1,a+n+1);
int k=a[n];
double v=(double)k/2;
val=a[n];
int ans=0;
for(int i=1;i<=n;i++)
if(abs((double)a[i]-v)<val)
ans=a[i],val=abs((double)a[i]-v);
printf("%d %d",a[n],ans);
} | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define rep(i, n) FOR(i, 0, n - 1)
using namespace std;
typedef long long ll;
template <class T> inline bool dpmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool dpmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
const string YES = "Yes";
const string NO = "No";
void solve(vector<vector<long long>> A, long long N, vector<long long> b) {
string ans = NO;
bool card[3][3] = {false};
for (int i = 0; i < N; i++) {
for (int ai = 0; ai < 3; ai++) {
for (int aj = 0; aj < 3; aj++) {
if (A[ai][aj] == b[i]) {
card[ai][aj] = true;
}
}
}
}
for (int i = 0; i < 3; i++) {
bool is_bingo = card[i][0] && card[i][1] && card[i][2];
if (is_bingo) ans = YES;
}
for (int i = 0; i < 3; i++) {
bool is_bingo = card[0][i] && card[1][i] && card[2][i];
if (is_bingo) ans = YES;
}
if (card[0][0] && card[1][1] && card[2][2]) ans = YES;
if (card[0][2] && card[1][1] && card[2][0]) ans = YES;
cout << ans << endl;
}
int main() {
vector<vector<long long>> A(3, vector<long long>(3));
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3; j++) {
cin >> A[i][j];
}
}
long long N;
cin >> N;
vector<long long> b(N);
for (int i = 0; i < N; i++) {
cin >> b[i];
}
solve(move(A), N, move(b));
return 0;
} | 0 | 88,766,044 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
ll mm=1000000000;ll MM=mm+7;
#define rep(i, n) for(int i=0;i<n;i++)
#define PI 3.141592653589793
int main(){
string s;
cin >> s;
int n=s.size();
set<char> chk;
bool c=true;
rep(i,n){
if(chk.count(s.at(i))){
c=false;
break;
}
else{
chk.insert(s.at(i));
}
}
if(c)cout <<"yes" << endl;
else cout << "no" << endl;
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e9+7;
int main(){
int n, k; cin>>n>>k;
string s; cin>>s;
vector<pair<int,int>> a(1,{1,0});
for(auto i:s){
if(a.back().first==i-'0') a.back().second++;
else a.push_back({i-'0',1});
}
if(a.back().first==0) a.push_back({1,0});
deque<int> q;
for(auto i:a) q.push_back(i.second);
int ans{}, sum{}, cnt{};
for(int i=0; i<a.size(); i++){
if(cnt<k){
if(a.at(i).first==1){
sum += a.at(i).second;
}
else{
sum += a.at(i).second;
cnt++;
}
}
else{
if(a.at(i).first==1){
sum += a.at(i).second;
}
else{
sum -= q.front();
q.pop_front();
sum -= q.front();
q.pop_front();
sum += a.at(i).second;
}
}
ans = max(ans,sum);
}
cout << ans << endl;
} | 0 | 65,651,071 |
#include <bits/stdc++.h>
using namespace std;
#define elif else if
typedef long long ll;
typedef unsigned long long ull;
#define DEBUG(x) cout << (x) << endl
ll n, p;
string s;
ll tmp[10005] = {0};
int main()
{
scanf("%lld %lld", &n, &p);
cin >> s;
tmp[0] = 1;
ll ans = 0;
ll now = 0;
ll times = 1;
if (p == 2 || p == 5)
{
for (int i = 0; i < n; i++)
{
if ((s[i] - '0') % p == 0)
{
ans += i + 1;
}
}
}
else
{
for (int i = n - 1; i >= 0; i--)
{
now += (s[i] - '0') * times;
times *= 10;
now %= p;
times %= p;
ans += tmp[now];
tmp[now] += 1;
}
}
printf("%lld\n", ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
ll INF = 1e9+7;
int main()
{
int n;
cin >> n;
map<int, int> m;
for(int i = 0; i < n; i++)
{
int a;
cin >> a;
m[a]++;
}
vector<int> v;
for(auto itr = m.begin(); itr != m.end(); itr++)
{
v.push_back(itr->second);
}
sort(v.begin(), v.end());
vector<int> sum(n+1);
int size = v.size();
int pos = 1;
sum[0] = 0;
int cur = 0;
while(cur < size)
{
while(pos <= v[cur])
{
sum[pos] = sum[pos-1];
if(pos < v[cur]) pos++;
else break;
}
sum[pos] += v[cur];
while(cur < size-1 && v[cur] == v[cur+1])
{
sum[pos] += v[cur];
cur++;
}
cur++;
pos++;
}
for(int i = pos; i <= n; i++)
{
sum[i] = sum[i-1];
}
for(int k = 1; k <= n; k++)
{
int l = -1;
int h = n / k + 1;
while(h - l > 1)
{
int num = (h + l) >> 1;
int card = sum[num];
int dis = distance(lower_bound(v.begin(), v.end(), num+1), v.end());
card += dis * num;
if(card >= num * k)
{
l = num;
}
else
{
h = num;
}
}
cout << l << endl;
}
} | 0 | 53,667,711 |
#include <iostream>
#include <cmath>
using namespace std;
int main(){
int d;
while(cin >> d){
int sum = 0;
for(int x = d; x < 600; x += d) sum += x * x * d;
cout << sum << endl;
}
return 0;
} | #include <cstdio>
#include <iostream>
#include <cmath>
#include <ctype.h>
#include <string>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#include <set>
using namespace std;
int main()
{
string phone[10] = {".,!? ", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"};
int n;
string input;
cin >> n;
for(int i = 0; i < n; i++){
cin >> input;
int l = input.length();
int j = 0;
while(1){
int c1 = 0;
while(c1 == 0 && j < l){
c1 = input[j] - '0';
j++;
}
if(j == l) break;
int l2 = phone[c1 - 1].length();
int k = 0;
while(c1 == input[j] - '0'){
j++;
k++;
}
cout << phone[c1 - 1][k % l2];
}
cout << endl;
}
return 0;
} | 0 | 64,893,484 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int n;
cin >> n;
int ans=n/3;
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
void Output(int sum){
if((int)(sum/1000) != 0){
if((int)(sum/1000) != 1){
cout << sum/1000;
}
cout << 'm';
}
sum = sum%1000;
if((int)(sum/100) != 0){
if((int)(sum/100) != 1){
cout << sum/100;
}
cout << 'c';
}
sum = sum%100;
if((int)(sum/10) != 0){
if((int)(sum/10) != 1 ){
cout << sum/10;
}
cout << 'x';
}
sum = sum%10;
if(sum != 0){
if(sum != 1){
cout << sum;
}
cout << 'i';
}
cout << endl;
}
int main(){
int n;
int sum;
int num;
char in;
cin >> n;
getchar();
for(int i=0; i<n; i++){
sum = 0;
num = 1;
while(scanf("%c",&in) && in!='\n'){
if(in == 'm'){
sum += num*1000;
num = 1;
}
else if(in == 'c'){
sum += num*100;
num = 1;
}
else if(in == 'x'){
sum += num*10;
num = 1;
}
else if(in == 'i'){
sum += num;
num = 1;
}
else if(in != ' '){
num = in-'0';
}
}
Output(sum);
}
return 0;
} | 0 | 87,078,263 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <chrono>
#include <ctime>
#include <queue>
#include <math.h>
#include <deque>
#include <stack>
#include <iomanip>
#include <assert.h>
#include <stdio.h>
#include <cstring>
#include <random>
using namespace std;
#define int long long
#define ll long long
#define ull unsigned long long
#define ld long double
#define pii pair<int, int>
#define pld pair<ld, ld>
#define ti tuple<int, int, int>
#define vi vector <int>
#define vpi vector <pii>
#define vld vector <ld>
#define try tr
#define left left11
#define right right11
#define lb lower_bound
#define ub upper_bound
#define sz(c) (int)(c).size()
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define pf push_front
#define sqr(a) ((a) * (a))
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define x first
#define y second
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
clock_t START;
inline ld TIME() {
return (ld) (clock() - START) / CLOCKS_PER_SEC;
}
void SHOW() {
cout << fixed << setprecision(10);
cout << TIME() << " SECONDS FROM START\n";
}
ld TL = 2.0;
int calls = 0;
inline bool IS() {
if(++calls == 1000) {
calls = 0;
if(TL - TIME() < 0.1)
return true;
}
return false;
}
template<typename T1, typename T2>
inline bool amin(T1 &a, T2 b) { if (a > b) { a = b; return true;} return false; }
template<typename T1, typename T2>
inline bool amax(T1 &a, T2 b) { if (a < b) {a = b; return true;} return false; }
template<typename T1, typename T2>
ostream &operator<<(ostream &os, pair<T1, T2> &p) {
os << p.first << ' ' << p.second;
return os;
}
template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
is >> p.first >> p.second;
return is;
}
template<typename T>
istream &operator>>(istream &is, vector<T> &v) {
for (auto &u : v) is >> u;
return is;
}
template<typename T>
ostream &operator<<(ostream &os, vector<T> &v) {
for (auto &u : v) os << u << ' ';
return os;
}
int hash_mod[4] = {1000000007, 998244353, 1000000009, 999999937}, mod = hash_mod[rnd() % 4];
int hash_pows[4] = {179, 239, 1007, 2003}, P = hash_pows[rnd() % 4];
int binpow(int x, int p) {
int res = 1;
while(p) {
if(p % 2)
res = (res * x) % mod;
x = (x * x) % mod;
p /= 2;
}
return res;
}
const int N = 1e6 + 7, NS = 2e3 + 7, lg = 31, sq = 550, inf = 2e9 + 7, SM = 1e2 + 7;
const ld eps = 1e-9;
void solve() {
int n;
cin >> n;
vi a(n); cin >> a;
int mx = 0, ans = 0;
for (int i = 0; i < n; i++) {
if(mx + 1 < a[i]) {
ans += (a[i] - 1) / (mx + 1);
a[i] = 1;
}
amax(mx, a[i]);
}
cout << ans;
}
signed main() {
fast
solve();
} | # include <iostream>
# include <cstring>
using namespace std;
int N;
string S;
long long counting[100005];
long long ans=1;
int order;
int n;
int main()
{
cin>>N;
cin>>S;
for (int i=0; i<N; i++)
{
order=S[i]-'a';
counting[order]++;
}
for (int i=0; i<26; i++)
{
if (counting[i]>0)
{
n=(counting[i]+1)%1000000007;
ans=(ans*n)%1000000007;
}
}
ans=(ans-1)%1000000007;
cout<<ans<<endl;
} | 0 | 80,075,795 |
#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;
int main(){
ll n,a,cnt=1;
cin>>n;
rep(i,n){
cin>>a;
if(a==cnt){
cnt++;
}
}
if(cnt==1){
cout<<-1;
}else{
cout<<n-cnt+1;
}
} | #include <iostream>
#include <algorithm>
using namespace std;
const int MAXSIZE = 2000005;
int htop = 0;
int Heap[MAXSIZE];
void insert(int x);
int extract(void);
void interact(char command[])
{
switch (command[0])
{
case 'I':
case 'i':
int k;
cin >> k;
insert(k);
break;
case 'E':
case 'e':
cout << extract() << endl;
break;
default:
break;
}
}
int main()
{
char command[32];
cin >> command;
while (!(command[0] == 'e' && command[1] == 'n'))
{
interact(command);
cin >> command;
}
}
void max_heapify(int arr[], int ia)
{
int left = ia * 2, right = ia * 2 + 1;
int largest = ia;
if (left <= htop && arr[left] > arr[ia])
largest = left;
if (right <= htop && arr[right] > arr[largest])
largest = right;
if (largest != ia)
{
swap(arr[ia], arr[largest]);
max_heapify(arr, largest);
}
}
void insert(int x)
{
Heap[++htop] = x;
int cur = htop;
int pa = cur / 2;
while (pa > 0 && Heap[pa] < Heap[cur])
{
swap(Heap[pa], Heap[cur]);
cur = pa;
pa = pa / 2;
}
}
inline bool is_h_empty(void)
{
return htop <= 0;
}
int extract()
{
if (is_h_empty())
return (-2147483647 - 1);
int ret = Heap[1];
Heap[1] = Heap[htop--];
max_heapify(Heap, 1);
return ret;
} | 0 | 98,449,947 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0;i < (n);i++)
using namespace std;
using ll = long long;
using pii = pair<int,int>;
int main(){
int n;
cin >> n;
int s = 111;
for(int i = 1;i<10;i++){
if(s*i >= n){
cout << s*i << 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;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> b(n);
rep(i, n) {
cin >> a[i];
b[i] = a[i];
}
sort(b.begin(), b.end());
reverse(b.begin(), b.end());
rep(i, n) {
if (a[i] != b[0]) {
cout << b[0] << endl;
} else {
cout << b[1] << endl;
}
}
return 0;
} | 0 | 59,141,756 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,x,y) for(int i=x;i<y;i++)
#define print(A,x,n) rep(I,0,n){cout<<(I ? " ":"")<<A[I]x;}cout<<endl;
#define pprint(A,y,m,n) rep(J,0,m){print(A[J],y,n);}
const long mod=1e9+7;
const int size=1e5+1;
const long inf=1e14;
int main(){
int N; cin>>N;
int A[N]; map<int,int> mp;
rep(i,0,N){ cin>>A[i]; mp[A[i]] = i + 1; }
int k = 0; int cnt = 0;
for(pair<int,int> p:mp){ k++; cnt += (p.second % 2 != k % 2); }
cout<<cnt / 2<<endl;
} | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define ld long double
#define INF 1000000000000000000
typedef pair<ll, ll> pll;
typedef pair<int, int> pint;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int H, W, D;
cin >> H >> W >> D;
ll m = 0;
map<ll, pll> ma;
rep(i, H) {
rep(j, W) {
ll a;
cin >> a;
ma[a] = {i, j};
m = max(m, a);
}
}
vector<ll> table(m + 1, 0);
for (int i = 0; i < m + 1; i++) {
if (table[i] != 0)
continue;
for (int j = i + D; j < m + 1; j += D) {
pll a = ma[j], b = ma[j - D];
table[j] = table[j - D] + abs(a.first - b.first) +
abs(a.second - b.second);
}
}
int Q;
cin >> Q;
vector<ll> L(Q), R(Q);
rep(i, Q) {
cin >> L[i] >> R[i];
cout << table[R[i]] - table[L[i]] << endl;
}
} | 0 | 95,409,792 |
#include <iostream>
int main()
{
long long N, A, B;
std::cin >> N >> A >> B;
std::cout << (N/(A+B))*A + std::min(A, N%(A+B)) << std::endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pl;
const int INT_INF = 2147483646;
const ll LL_INF = 9223372036854775807;
const double PI=3.1415926535897932;
bool SecondCompare(const pair<int,int> &a,const pair<int,int> &b)
{
return a.second<b.second;
}
bool SecondCompareDes(const pair<int,int> &a,const pair<int,int> &b)
{
return a.second>b.second;
}
ll minll(ll a, ll b){
if(a >= b) return b;
else return a;
}
ll maxll(ll a, ll b){
if(a >= b) return a;
else return b;
}
ll a,b;
int main(){
cin >> a >> b;
ll ans = (a-1)*(b-1);
cout << ans << endl;
} | 0 | 20,481,534 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int a, b, c;
cin >> a >> b >> c;
if (c <= b) cout << "delicious" << "\n";
else if (c <= b + a) cout << "safe "<< "\n";
else cout << "dangerous" << "\n";
} | #include <bits/stdc++.h>
#define slld(longvalue) scanf("%lld", &longvalue)
#define ll long long
#define ull unsigned long long
#define pll pair < long long, long long >
#define fastio ios_base:: sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define pb push_back
#define bug printf("BUG\n")
#define mxlld LLONG_MAX
#define mnlld -LLONG_MAX
#define mxd 2e8
#define mnd -2e8
#define pi 3.14159265359
using namespace std;
bool check(ll n, ll pos)
{
return n & (1LL << pos);
}
ll Set(ll n, ll pos)
{
return n = n | (1LL << pos);
}
int main()
{
ll i, j, k, l, m, n, o, r, q;
ll testcase;
ll input, flag, tag, ans;
while(cin >> k)
{
ans = 1;
for(ll i = 1; i <= 10000000; i++)
{
if((i * k) % 360 == 0)
{
ans = i;
break;
}
}
cout << ans << "\n";
}
} | 0 | 41,422,549 |
#include <bits/stdc++.h>
using namespace std;
#define arep(i, x, n) for (int i = int(x); i < (int)(n); i++)
#define rep(i, n) for (long long i = 0; i < n; ++i)
#define pi 3.141592653589793
#define eps 0.00000001
#define INF 1e9 + 7
using ll = long long;
int main() {
string s;
cin >> s;
int sSize = s.size() - 1;
if(sSize % 2){
sSize = sSize - 1;
}
ll res = sSize/2;
ll output = 0;
for(int i = res; i >= 1; i--){
string s0 = s.substr(0, i);
string s1 = s.substr(i, i);
if(s0 == s1){
output = i * 2;
break;
}
}
cout << output << endl;
} | #include<cctype>
#include<string>
#include<algorithm>
#include<iostream>
#include<set>
#include<regex>
#include<cmath>
#include<stack>
#include<queue>
#include<deque>
#include<ctime>
#include<vector>
#include<bitset>
#include<cstdio>
#include<numeric>
#include<utility>
#include<sstream>
#include<cstdlib>
#include<iomanip>
#include<cstring>
#include<map>
#include<functional>
#include<unordered_map>
#define _USE_MATH_DEFINES
#define inf 999999999999999999
#define rep(i,n,m) for(lli i=(lli)(n);i<(lli)(m);++i)
#define reep(i,n,m) for(int i=(int)(n);i<=(int)(m);++i)
#define per(i,m,n) for(lli i=(int)(m)-1;i>=(int)(n);--i)
#define st(n) sort(n.begin(), n.end())
#define rev(n) reverse(n.begin(),n.end())
#define ou(S) cout << S << endl
#define pb(n) push_back(n)
#define ue(N) N.erase(unique(N.begin(),N.end()),N.end());
#define nou(S) cout << S
#define hou(S) cout << setprecision(30) << S << endl
#define vec(K,L,N,S) vector<L> K(N,S)
#define dv(K,L,N,M,S) vector<vector<L>> K(N,vector<L>(M,S))
#define tv(K,L,N,M,R,S) vector<vector<vector<L>>> K(N,vector<vector<L>>(M,vector<L>(R,S)))
#define pint pair<lli,lli>
#define paf(L,R) pair<L,R>
#define maxx 5100000
#define chmax(a, b) a = (((a)<(b)) ? (b) : (a))
#define chmin(a, b) a = (((a)>(b)) ? (b) : (a))
#define endl "\n"
typedef long long int lli;
typedef unsigned long long int uli;
const uli mod = 1e9 + 7;
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int n, d, x, sum = 0;
cin >> n >> d >> x;
for(int i = 0; i < n; ++i) {
int a; cin >> a;
if(a ==1)
sum += d;
else sum += d / a + 1;
if(d % a == 0&&a!=1)
--sum;
}
cout << sum + x << endl;
} | 0 | 46,414,703 |
#include<bits/stdc++.h>
#define con continue
#define pb push_back
#define fi first
#define se second
#define fr front()
#define one 1.0
#define inf 1000000000000000000
#define ret return
#define all(vl) vl.begin(),vl.end()
#define sor sort
#define cl clear
#define m_p make_pair
#define sz(a) a.size()
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef map<ll,ll>::iterator itll;
typedef long double ld;
typedef map<ll,ll> mapll;
typedef map<string,ll> mapstl;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
string s,t;
cin>>t>>s;
cout<<s<<t<<endl;
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <cmath>
#include <limits>
#include <list>
#include <cassert>
#define ALL(x) (x).begin(),(x).end()
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define int_INF 2147483647
#define pint_INF 2000000000
#define ll_INF 9223372036854775807
#define MOD 1000000007
#define vi vector<int>
#define vvi vector<vector<int>>
#define vvll vector<vector<long long>>
#define vvc vector<vector<char>>
#define vll vector<long long>
#define pii pair<int,int>
#define vpii vector<pair<int,int>>
#define sysp system("PAUSE")
#define pno cout << "no" << endl
#define pyes cout << "yes" << endl
#define pYes cout << "Yes" << endl
#define pNo cout << "No" << endl
#define pNO cout << "NO" << endl
#define pYES cout << "YES" << endl
#define endl "\n"
#define pi 3.14159265358979
using namespace std;
using ll = long long;
int ctoi(char c){
return c - 'a';
}
int main(){
string S; cin >> S;
vector<ll> cntAplha(26,0);
ll ans = 0;
for(auto& c: S){
cntAplha[ctoi(c)]++;
}
ll L = S.size();
ans = L*(L-1)/2;
for(ll& num:cntAplha){
ans -= num*(num-1)/2;
}
cout << ans+1 << endl;
sysp;
} | 0 | 6,300,977 |
#include <iostream>
using namespace std;
int main (){
int a, b, c;
cin >> a >> b >> c;
if ((b-a)*(c-b) > 0) cout << "Yes" << '\n';
else cout << "No" <<'\n';
} | #include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
const lli mod = 1e9+7;
lli n;
string s;
lli modpow(lli a, lli x){
lli ret = 1;
while(x > 0){
if(x&1){
ret *= a;
ret%=mod;
x--;
}else{
a*=a;
a%=mod;
x >>= 1;
}
}
return ret;
}
int main(void){
cin >> n >> s;
vector<lli> used(26);
rep(i, n){
used[s[i]-'a']++;
}
lli ans = 1;
rep(i, 26){
ans*=used[i]+1;
ans%=mod;
}
ans--;
if(ans < 0) ans*=mod;
cout << ans << endl;
return 0;
} | 0 | 91,897,466 |
#include<iostream>
#include<string>
using namespace std;
int main(){
int n;
while(cin>>n){
int count=0;
for(int i=0;i<10; i++){
for(int s=0;s<10; s++){
for(int t=0;t<10; t++){
for(int w=0;w<10; w++){
if(i+s+t+w==n)count++;
}
}
}
}
cout<<count<<endl;
}
return 0;
} | #include<bits/stdc++.h>
#define int long long
#define fi first
#define si second
#define mp make_pair
#define pb push_back
#define pi pair<int,int>
#define f(i,l,r) for(int i=l;i<=r;i++)
#define rf(i,r,l) for(int i=r;i>=l;i--)
#define done(i) cout<<"done = "<<i<<endl;
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
const int inf=1e18;
const int mod=1e9+7;
const int M=100009;
inline int bigmod(int B,int P){int R=1;while(P>0){if(P&1){R=(R*B)%mod;}P>>=1;B=(B*B)%mod;}return R;}
inline int ad(int x,int y){int ret=(x%mod+y%mod)%mod;if(ret<0){ret+=mod,ret=ret%mod;}return ret;}
inline int sub(int x,int y){int ret=((x%mod)-(y%mod)+mod)%mod;if(ret<0){ret+=mod,ret=ret%mod;}return ret;}
inline int gun(int x,int y){int ret=((x%mod)*(y%mod))%mod;if(ret<0){ret+=mod,ret=ret%mod;}return ret;}
main()
{
fast
string s;
cin>>s;
map<char,bool>vis;
string chk="";
for(char ch='z';ch>='a';ch--)chk+=ch;
for(char x:s)
{
vis[x]=true;
}
if(s==chk)
{
cout<<"-1"<<endl;
}
if(s.size()==26)
{
for(int i=25;i>=0;i--)
{
int flag=0;
char ok;
for(int j=i+1;j<26;j++)
{
if(s[j]>s[i])
{
if(flag==0)ok=s[j];
else if(s[j]<ok)ok=s[j];
flag=1;
}
}
if(flag==1)
{
string ses=s.substr(0,i);
ses+=ok;
cout<<ses<<endl;
return 0;
}
}
}
else
{
for(char ch='a';ch<='z';ch++)
{
if(vis[ch]!=true)
{
s+=ch;
break;
}
}
cout<<s<<endl;
}
return 0;
} | 0 | 35,751,728 |
#include <iostream>
using namespace std;
int main()
{
int X, T;
cin >> T >> X;
cout << double(T)/double(X);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define IOS ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define endl '\n'
#define ld long double
#define mid (l+r)/2
typedef pair<int,int> pii;
const int maxn=(1<<18)+5;
int a[maxn];
int ans[maxn],mx[maxn];
int tot;
void calc(int id,int n)
{
for(int i=id;i<=n;i=((i+1)|id))
{
ans[i]=max(ans[i],mx[i]+a[id]);
mx[i]=max(mx[i],a[id]);
++tot;
}
}
int main()
{
#ifdef local
freopen("in.txt","r",stdin);
#endif
IOS;
int n;
cin>>n;
int m=(1<<n)-1;
for(int i=0;i<=m;i++) cin>>a[i];
for(int i=0;i<=m;i++) calc(i,m);
for(int i=1;i<=m;i++)
{
ans[i]=max(ans[i],ans[i-1]);
cout<<ans[i]<<endl;
}
} | 0 | 2,189,826 |
#include"bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
char c;
cin >> c;
char ans = 'G';
if (c == 'A')ans = 'T';
else if (c == 'T')ans = 'A';
else if (c == 'G')ans = 'C';
cout << ans << endl;
return 0;
} | #include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int num = 1;
for (int i = 0; i < n; i++) {
if (num <= k) {
num *= 2;
} else {
num += k;
}
}
cout << num << endl;
} | 0 | 64,917,103 |
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
using namespace std;
using ll = long long;
const ll MOD = 1000000007LL;
const double PI = 3.14159265358979;
void solve()
{
ll s;
cin >> s;
ll ans = s;
while(s >= 100)
{
ans = min(ans, abs((s % 1000) - 753));
s /= 10;
}
cout << ans;
}
int main()
{
fastio;
solve();
return 0;
} | #include <string>
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
ll p[64];
void ins(ll x)
{
for (int i = 60; i >= 0; --i)
{
if (x >> i)
{
if (!p[i])
{
p[i] = x;
break;
}
x ^= p[i];
}
}
}
ll num[100010];
int main()
{
ios::sync_with_stdio(false); cin.tie(0);
int n;
ll x, sum = 0;
cin >> n;
for (int i = 0; i < n; ++i)
{
cin >> num[i];
sum ^= num[i];
}
for (int i = 0; i < n; ++i)
{
for (int j = 60; j >= 0; --j)
{
if (((sum >> j) & 1) == 1 && ((num[i] >> j) & 1) == 1)
{
num[i] -= 1ll << j;
}
}
ins(num[i]);
}
x = 0;
for (int i = 60; i >= 0; --i)
{
x = max(x, x ^ p[i]);
}
cout << x + (x^sum);
} | 0 | 375,987 |
#include <bits/stdc++.h>
using namespace std;
#define d(x) cerr << #x ":" << x << endl;
#define dd(x, y) cerr << "(" #x "," #y "):(" << x << "," << y << ")" << endl
#define rep(i, n) for (int i = (int)(0); i < (int)(n); i++)
#define repp(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define all(v) v.begin(), v.end()
#define dump(v) \
cerr << #v ":[ "; \
for (auto macro_vi : v) { \
cerr << macro_vi << " "; \
} \
cerr << "]" << endl;
#define ddump(v) \
cerr << #v ":" << endl; \
for (auto macro_row : v) { \
cerr << "["; \
for (auto macro__vi : macro_row) { \
cerr << macro__vi << " "; \
} \
cerr << "]" << endl; \
}
using lint = long long;
const int INF = 1e9;
const lint LINF = 1e18;
const lint MOD = 1e9 + 7;
const double EPS = 1e-10;
int main() {
int N, M;
cin >> N >> M;
vector<int> count(N, 0);
rep(i, M) {
int a, b;
cin >> a >> b;
a--, b--;
count[a]++, count[b]++;
}
bool ok = true;
for (int i = 0; i < N; i++) {
if (count[i] % 2 == 1) { ok = false; }
}
cout << (ok ? "YES" : "NO") << endl;
return 0;
} | #include <bits/stdc++.h>
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 SORT(s) sort((s).begin(), (s).end())
#define SORTD(s) sort((s).rbegin(), (s).rend())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
#define SZ(x) ((int)(x).size())
#define MEMSET(v, h) memset((v), h, sizeof(v))
int main()
{
cin.tie(0);
ios_base::sync_with_stdio(false);
int n, k;
cin >> n >> k;
int tmp;
map<int, int> m;
vector<int> v;
REP(i, n)
{
cin >> tmp;
if (m.count(tmp) == 0)
m.insert(make_pair(tmp, 1));
else
m[tmp]++;
}
for (auto it = m.begin(); it != m.end(); ++it)
{
v.push_back(it->second);
}
SORT(v);
int ans = 0, minA, aa;
int i = 0;
while (k < SZ(m))
{
for (auto it = m.begin(); it != m.end(); ++it)
{
if (it->second == v[i])
{
ans+=it->second;
m.erase(it->first);
break;
}
}
i++;
}
cout << ans << endl;
return 0;
} | 0 | 36,662,425 |
#pragma region template 2.4
#include <bits/stdc++.h>
using namespace std;
template <typename T>
using pq_asc = priority_queue<T, vector<T>, greater<T>>;
typedef long long ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef pair<ll, ll> ii;
typedef vector<ii> vii;
typedef vector<string> vs;
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REP1(i, n) for (ll i = 1; i <= (n); ++i)
#define FOR(i, a) for (auto &i : a)
#define CH(f, x, y) x = f(x, y)
#define IN(T, x) \
T x; \
cin >> x;
#define AIN(T, a, n) \
vector<T> a(n); \
FOR(i, a) \
cin >> i;
#define A2IN(T1, a, T2, b, n) \
vector<T1> a(n); \
vector<T2> b(n); \
REP(i, n) \
cin >> a[i] >> b[i];
#define OUT(x) cout << (x) << endl;
#define FOUT(x) cout << fixed << setprecision(15) << (x) << endl;
#define ALL(a) (a).begin(), (a).end()
#define SORT(a) sort(ALL(a))
#define RSORT(a) \
SORT(a); \
reverse(ALL(a))
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define DUMPA(a) \
cout << #a << " = {"; \
JOUT(ALL(a), ", ", cout) << "}" << endl;
template <typename T>
ostream &JOUT(T s, T e, string sep = " ", ostream &os = cout)
{
if (s != e)
{
os << *s;
++s;
}
while (s != e)
{
os << sep << *s;
++s;
}
return os;
}
ostream &YES(bool cond, string yes = "Yes", string no = "No", ostream &os = cout)
{
if (cond)
{
os << yes << endl;
}
else
{
os << no << endl;
}
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p)
{
os << '(' << p.first << ", " << p.second << ')';
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v)
{
os << '[';
JOUT(ALL(v), ", ", os) << ']';
return os;
}
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
#pragma endregion template
int main()
{
IN(ll, N);
ll M = 1 << N;
AIN(ll, A, M);
ll ans = 0;
REP1(i, M - 1)
{
ll opt = 0;
ll opt2 = 0;
for (ll j = M - 1; j >= 0; --j)
{
j &= i;
if (A[j] > opt)
{
opt2 = opt;
opt = A[j];
}
else if (A[j] > opt2)
{
opt2 = A[j];
}
}
CH(max, ans, opt + opt2);
OUT(ans);
}
} | #include <iostream>
using namespace std;
int main() {
int x;
cin >> x;
int kyu = 8;
for (size_t i = 400;; i += 200) {
if (i <= x && x < i + 200) {
cout << kyu << endl;
return 0;
}
kyu--;
}
} | 0 | 14,564,760 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
using namespace std;
using ll = int64_t;
using vi = vector<int>;
using vvi = vector<vi>;
int main() {
int N;
cin >> N;
vi a(N), b(N), c(N);
rep(i, N){
cin >> a[i];
}
ll X = 0LL;
rep(i, N) {
cin >> b[i];
c[i] =a[i] - b[i];
X += c[i];
}
if(X>0) {
cout << "No" << endl;
return 0;
}
X = -X;
ll A=0LL, B=0LL;
rep(i, N) {
if(c[i]>0) {
B += c[i];
} else {
if(c[i]%2) {
A += (1-c[i])/2;
++B;
} else {
A += (-c[i])/2;
}
}
}
if((X-A)*2 == (X-B) && X>=A) {
cout << "Yes" << endl;
return 0;
}
cout << "No" << endl;
} | #define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repn(i,x) for(int i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#include <bits/stdc++.h>
using namespace std;
int sum(vector<int> s){return accumulate(s.begin(),s.end(),0);}
void p(vector<int> A){rep(i,A.size()){cout << A[i] << " ";}cout << "\n";}
int main(){
int r, g, b ,n;
cin >> r >> g >> b >> n;
int cnt = 0;
rep(i,n+1){
rep(j,n+1){
int k = n - r*i - g*j;
if(k % b == 0 && k >= 0){
cnt++;
}
}
}
cout << cnt;
} | 0 | 83,309,229 |
#include<iostream>
#include<vector>
#include<queue>
#include<utility>
using namespace std;
bool cant[20][20];
int a,b,ans;
int main()
{
while(cin >> a >> b,a)
{
for(int i = 0;i < 20;i++)for(int j = 0;j < 20;j++)
{
cant[i][j] = false;
}
ans = 0;
int n;
cin >> n;
for(int i = 0;i < n;i++)
{
int x,y;
cin >> x >> y;
cant[x-1][y-1] = true;
}
queue<pair<int,int> > q;
q.push(make_pair(0,0));
while(!q.empty())
{
pair<int,int> tmp = q.front();q.pop();
if(tmp.first == a-1 && tmp.second == b-1)
{
ans++;
continue;
}
if(cant[tmp.first][tmp.second] == true)
{
continue;
}
if(tmp.first < a-1)
{
q.push(make_pair(tmp.first+1,tmp.second));
}
if(tmp.second < b-1)
{
q.push(make_pair(tmp.first,tmp.second+1));
}
}
cout << ans << endl;
}
return 0;
} | #include<bits/stdc++.h>
#define rep(i,n) for(ll i = 0;i < n;++i)
#define all(v) v.begin(),v.end()
using namespace std;
using ll = long long;
typedef pair<int,int> P;
const int INF = 1001001001;
const long double PI = (acos(-1));
const int mod = 1e9+7;
const int vx[6] = {0,1,0,-1,1,-1};
const int vy[6] = {1,0,-1,0,1,1};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s,t;
cin >> s >> t;
char c = s[0];
map<char,int> smemo;
map<char,int> tmemo;
rep(i,s.length()){
smemo[s[i]]++;
tmemo[t[i]]++;
}
bool ok = true;
rep(i,s.length()){
if(smemo[s[i]] != tmemo[t[i]]){
ok = false;
}
}
if(ok){
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
cout << endl;
return 0;
} | 0 | 81,774,757 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if(s[0]==s[1] && s[1]==s[2]) cout << "Yes" << endl;
else if(s[1]==s[2] && s[2]==s[3]) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define pb push_back
#define mp make_pair
#define pii pair<ll,ll>
#define ff first
#define ss second
#define vi vector<ll>
#define mod 1000000007
#define MOD 1000000007
#define full(a) a.begin(),a.end()
#define inf INT_MAX
#define minf INT_MIN
#define dd double
#define fori(x,n) for(ll i=x;i<n;i++)
#define modd 998244353
#define umap unordered_map<ll,ll>
ll a[101];
ll fun(ll n,ll k){
ll dp[n+2][k+2];
for(int j=0;j<=k;j++)
dp[0][j]=(j>a[0]?0:1);
for(int i=1;i<n;i++)
for(int j=0;j<=k;j++)
if(j==0)dp[i][j]=dp[i-1][j];
else dp[i][j]=(dp[i][j-1]%mod+dp[i-1][j]%mod-(j-a[i]-1>=0?dp[i-1][j-a[i]-1]:0)%mod +mod)%mod;
return dp[n-1][k];
}
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
ll n,k;
cin>>n>>k;
fori(0,n)cin>>a[i];
cout<<fun(n,k)<<"\n";
return 0;
} | 0 | 99,998,059 |
#include <stdio.h>
int main(){
char C;
int z;
scanf("%c", &C);
z= C+1;
printf("%c\n", z);
return 0;
} | #include <bits/stdc++.h>
#include <iostream>
#include<math.h>
using namespace std;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
using Graph = vector<vector<int>>;
int N, M;
Graph G;
void solve() {
vector<int> dist(N, -1);
vector<int> prev(N, -1);
queue<int> que;
que.push(0);
dist[0] = 0;
while(!que.empty()) {
int v = que.front();
que.pop();
for (auto nv : G[v]) {
if (dist[nv] == -1) {
dist[nv] = dist[v] + 1;
prev[nv] = v;
que.push(nv);
}
}
}
cout << "Yes" << endl;
for (int i = 1; i < N; ++i) cout << prev[i] + 1 << endl;
}
int main()
{
cin >> N >> M;
G.assign(N, vector<int>());
for (int i=0; i<M; i++) {
int a, b;
cin >> a >> b;
--a, --b;
G[a].push_back(b);
G[b].push_back(a);
}
solve();
return 0;
} | 0 | 5,717,240 |
#include <fstream>
#include <iostream>
#include <cmath>
#include <vector>
#include <queue>
#include <utility>
#include <algorithm>
using namespace std;
int main() {
int a[5];
cin >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
sort(a, a+5);
for (int i = 4; i > 0; i--)
cout << a[i] << " ";
cout << a[0] << endl;
} | #include<iostream>
#include<string>
#include<vector>
#include<queue>
#include<algorithm>
#include<map>
typedef long long ll;
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
ll INF = 1000000007;
ll mod = 998244353;
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
int main() {
int n;
cin >> n;
vector<ll> cnt(n);
int a;
cin >> a;
ll end = 0;
if (a != 0) {
cout << 0 << endl;
return 0;
}
rep(i, n - 1) {
ll k;
cin >> k;
cnt[k]++;
end = max(end, k);
}
ll ans = 1;
for(int i=1;i<=end;i++) {
if (cnt[i] == 0 && cnt[i + 1] != 0) {
cout << 0 << endl;
return 0;
}
}
if (cnt[0] != 0) {
cout << 0 << endl;
return 0;
}
cnt[0] = 1;
for (int i = 1; i <= end; i++) {
ans *= modpow(cnt[i-1], cnt[i], mod);
ans %= mod;
}
cout << ans << endl;
} | 0 | 80,435,339 |
#include<iostream>
using namespace std;
#define ll long long
int N;
ll X;
ll a[50],p[50];
ll fact(int n,ll x){
if(n==0) return 1;
if(x==1) return 0;
if(x<=1+a[n-1]) return fact(n-1,x-1);
if(x==2+a[n-1]) return p[n-1]+1;
if(x<=2*a[n-1]+2) return p[n-1]+1+fact(n-1,x-a[n-1]-2);
if(x==2*a[n-1]+3) return p[n-1]*2+1;
}
int main(){
cin>>N>>X;
a[0]=p[0]=1;
for(int i=1;i<N;i++){
a[i]=2*a[i-1]+3;
p[i]=2*p[i-1]+1;
}
cout<<fact(N,X)<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long int
int main()
{
string s;
cin>>s;
ll l=s.length();
ll i=0, j=l-1;
ll cnt=0;
while(j-i>=0)
{
if(s[i]==s[j])
{
i++;
j--;
}
else if(s[i]=='x')
{
i++;
cnt++;
}
else if(s[j]=='x')
{
j--;
cnt++;
}
else
{
cout<<-1<<endl;
return 0;
}
}
cout<<cnt<<endl;
return 0;
} | 0 | 24,288,643 |
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define fi first
#define se second
#define pb push_back
typedef long long ll;
typedef pair<int,int> ii;
typedef pair<ii,int> iii;
typedef pair<ll,ll> pll;
const int N = 1e2+2;
const int INF = 1e9;
int n, m;
int dr[2] = {0,1};
int dc[2] = {1,0};
int dp[N][N];
char ar[N][N];
bool inRange(int r, int c)
{
return r >= 1 && r <= n && c >= 1 && c <= m;
}
int solve(int r, int c)
{
if (r == n && c == m)
return ar[r][c] == '#';
if (dp[r][c] != -1)
return dp[r][c];
int ret = INF;
for (int i = 0; i < 2; i++)
{
int nr = r + dr[i];
int nc = c + dc[i];
if (!inRange(nr,nc))
continue;
ret = min(ret, solve(nr,nc) + (ar[r][c] == '#' && ar[nr][nc] == '.'));
}
return dp[r][c] = ret;
}
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n >> m;
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= m; j++)
{
cin >> ar[i][j];
}
}
memset(dp,-1,sizeof(dp));
cout << solve(1,1) << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
bool canstop=false;
vector<int> a(N);
for(int i=0;i<N;i++) cin >> a.at(i);
int now=0,cnt=0;
for(int i=0;i<N;i++){
if(now!=1){
now = a.at(now)-1;
cnt++;
}
else{
canstop = true;
break;
}
}
if(canstop) cout << cnt << endl;
else cout << -1 << endl;
return 0;
} | 0 | 7,277,582 |
#include <iostream>
#include <string>
using namespace std;
int main() {
char d[5] = { '.', ',', '!', '?', ' ' };
int m[10] = { 5, 3, 3, 3, 3, 3, 4, 3, 4 };
int h[10] = { 0, 0, 3, 6, 9, 12, 15, 19, 22 };
long long int n;
cin >> n;
for ( long long int i = 0; i < n; i++ ) {
string in;
cin >> in;
long long int a = -1;
long long int b = -1;
char c;
for ( long long int j = 0; j < in.size(); j++ ) {
if ( in[j] == '0' ) {
if ( a == -1 ) continue;
b %= m[a-1];
if ( a == 1 ) {
c = d[b];
}else {
c = 'a' + h[a-1] + b;
}
cout << c;
a = -1;
b = -1;
}else {
a = in[j] - '0';
b++;
}
}
cout << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define mod 1000000007
#define pb push_back
#define S second
#define F first
#define INF 1e18
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define deb(x) cerr << "\n" \
<< #x << "=" << x << "\n";
#define deb2(x, y) cerr << "\n" \
<< #x << "=" << x << "\n" \
<< #y << "=" << y << "\n";
#define w(x) \
int x; \
cin >> x; \
while (x--)
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, x, m;
cin >> n >> x >> m;
int ans = 0;
vector<int> prev;
map<int,bool> seen;
int cur = 1,start = -1;
while(cur <= n) {
if(seen.find(x) != seen.end()) {
break;
}
ans = (ans + x);
prev.pb(x);
seen[x] = 1;
x = (x % m * x % m) % m;
cur++;
}
if(cur >= n) {
cout << ans;
return 0;
}
int val = 0, ok = -1;
for(int i = 0; i < prev.size(); ++i) {
if(prev[i] == x && ok == -1)
ok = i;
if(ok != -1)
val = val + prev[i];
}
int len = prev.size() - ok ;
int maxm = (n - cur) / len;
cur += maxm * len;
ans += val * maxm;
for(;cur<=n;cur++) {
ans = (ans + prev[ok]);
ok++;
}
cout << ans;
} | 0 | 80,616,116 |
#include "bits/stdc++.h"
#define MOD 1000000007
#define rep(i, n) for(ll i=0; i < (n); i++)
#define rrep(i, n) for(ll i=(n)-1; i >=0; i--)
#define ALL(v) v.begin(),v.end()
#define rALL(v) v.rbegin(),v.rend()
#define FOR(i, j, k) for(ll i=j;i<k;i++)
#define DUMP(i, v)for(ll i=0;i<v.size();i++)cerr<<v[i]<<" "
using namespace std;
typedef long long int ll;
typedef vector<ll> llvec;
typedef vector<double> dvec;
typedef pair<ll, ll> P;
typedef long double ld;
struct edge{ll x, c;};
ll mod(ll a, ll mod){
ll res = a%mod;
if(res<0)res=res + mod;
return res;
}
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;
}
ll modinv(ll a, ll mod){
return modpow(a, mod-2, mod);
}
ll gcd(ll a, ll b){
ll r = a%b;
if(r==0) return b;
else return gcd(b, a%b);
}
bool is_prime(ll n){
ll i = 2;
if(n==1)return false;
if(n==2)return true;
bool res = true;
while(i*i <n){
if(n%i==0){
res = false;
}
i = i+1;
}
if(n%i==0)res=false;
return res;
}
struct UnionFind{
ll N;
llvec p;
llvec cnt;
UnionFind(ll n){
N = n;
p=llvec(N);
cnt=llvec(N, 0);
rep(i, N){
p[i] = i;
cnt[i] = 1;
}
}
void con(ll a, ll b){
P at = root(a);
P bt = root(b);
if(at.second!=bt.second){
if(at.first>bt.first){
swap(at, bt);
swap(a, b);
}
p[at.second] = bt.second;
cnt[bt.second]+=cnt[at.second];
p[a]=bt.second;
}
}
P root(ll a){
ll atmp = a;
ll c=0;
while(atmp!=p[atmp]){
atmp = p[atmp];
c++;
}
p[a] = atmp;
return {c, atmp};
}
bool is_con(ll a, ll b){
P at=root(a);
P bt=root(b);
return at.second == bt.second;
}
};
struct dijkstra{
ll N;
llvec d;
vector<vector<edge>> e;
dijkstra(ll n){
N = n;
e = vector<vector<edge>>(N);
}
void add_edge(ll from, ll to, ll cost){
e[from].push_back({to, cost});
}
void run(ll start){
priority_queue<P, vector<P>, greater<P>> que;
que.push({0, start});
d = llvec(N, 1e18);
d[start]=0;
while(!que.empty()){
P q = que.top();que.pop();
ll dc = q.first;
ll x = q.second;
if(dc>d[x]){
continue;
}else{
for(auto ip: e[x]){
if(d[ip.x]<=d[x]+ip.c){
continue;
}else{
d[ip.x]= d[x]+ip.c;
que.push({d[ip.x], ip.x});
}
}
}
}
}
};
int main(){
ll N, X;
cin >> N >> X;
llvec x(N);
rep(i, N)cin >> x[i];
sort(ALL(x));
ll g=1e18;
rep(i, N){
g = min(abs(X-x[i]), g);
}
rep(i, N-1){
g = gcd(g, x[i+1] - x[i]);
}
cout << g;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define FOR(i,s,n) for(int i = (s); i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for(int i = (n); i >= 0; i--)
#define ALL(n) (n).begin(), (n).end()
#define RALL(n) (n).rbegin(), (n).rend()
#define ATYN(n) cout << ( (n) ? "Yes":"No") << '\n';
#define CFYN(n) cout << ( (n) ? "YES":"NO") << '\n';
#define OUT(n) cout << (n) << '\n';
using ll = long long;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
int main(void)
{
IOS
const vector<int> dx{0,1,0,-1},
dy{1,0,-1,0};
const char B = '#';
int H, W;
cin >> H >> W;
vector<string> ss(H);
REP(i,H) cin >> ss[i];
int ans = 0;
vector<pii> bfs;
REP(i,H) REP(j,W) {
if (ss[i][j] == B) bfs.emplace_back(i,j);
}
while(!bfs.empty()) {
vector<pii> tmp;
swap(tmp,bfs);
for(auto p:tmp) {
REP(i,dx.size()) {
int ny = p.first + dy[i];
int nx = p.second+ dx[i];
if (ny < 0 || H <= ny) continue;
if (nx < 0 || W <= nx) continue;
if (ss[ny][nx] == B) continue;
bfs.emplace_back(ny,nx);
ss[ny][nx] = B;
}
}
if (!bfs.empty()) ans++;
}
cout << ans << '\n';
return 0;
} | 0 | 89,285,024 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define all(a) a.begin(), a.end()
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<ll,int> pli;
#define rep(i,a,b) for(ll i=a ; i<b ; i++)
#define qrep(que, ite) for(auto ite=begin(que) ; ite!=end(que) ; ite++)
const int max_n = 1e5;
const ll mod = 1e9+7;
const ll INF = 1LL<<60;
const int inf = 1e5;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int dx[4] = {0,0,1,-1};
int dy[4] = {1,-1,0,0};
ll mo = 998244353;
int main(){
int n,m; cin >> n >> m;
vector<ll> v(n,0);
rep(i,0,m){
ll x,y; cin >> x >> y; --x; --y;
v[x]++; v[y]++;
}
bool odd = false;
rep(i,0,n){
if(v[i]%2==1) odd = true;
}
if(odd){
cout << "NO" << endl;
}else{
cout << "YES" << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define ALL(obj) begin(obj), end(obj)
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace std;
template <class T>
vector<T> make_vec(size_t a) {
return vector<T>(a);
}
template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
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 ll = long long;
using ull = unsigned long long;
const int INF = 2100100100;
int main() {
int N, D, X;
cin >> N >> D >> X;
if (N + D < X) {
cout << "No\n";
} else {
cout << "Yes\n";
}
} | 0 | 88,185,908 |
#include <bits/stdc++.h>
#define INF 5000000000000000000
#define ll long long
#define pll pair<ll, ll>
using namespace std;
int main()
{
ll N;
cin >> N;
vector<ll> A(N);
vector<ll> B(N);
ll a_sum = 0, b_sum = 0;
for (ll i = 0; i < N; ++i) {
cin >> A.at(i);
a_sum += A.at(i);
}
for (ll i = 0; i < N; ++i) {
ll b;
cin >> b;
B.at(i) = b;
b_sum += b;
}
if (a_sum < b_sum) {
cout << -1 << endl;
return 0;
}
ll ans = 0;
vector<bool> chage(N, false);
ll chage_num = 0;
for (ll i = 0; i < N; ++i) {
if (A.at(i) < B.at(i)) {
chage.at(i) = true;
chage_num += B.at(i) - A.at(i);
ans += 1;
}
}
vector<ll> can_chage;
for (ll i = 0; i < N; ++i) {
if (chage.at(i)) {
continue;
}
can_chage.push_back(A.at(i) - B.at(i));
}
sort(can_chage.begin(), can_chage.end());
reverse(can_chage.begin(), can_chage.end());
ll temp = 0;
for (ll i = 0; i < can_chage.size(); ++i) {
if (temp >= chage_num) {
break;
}
temp += can_chage.at(i);
ans += 1;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#include <algorithm>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using ll = long long;
using namespace std;
int main() {
int n;
cin >>n;
vector<int> a(n);
rep(i,n) {
cin>>a.at(i);
}
vector<int> b(n);
vector<int> c(n);
rep(i,n) {
b.at(i) = a.at(i)+1;
c.at(i) = a.at(i)-1;
}
a.insert(a.end(),b.begin(),b.end());
a.insert(a.end(),c.begin(),c.end());
sort(a.begin(),a.end());
int ans = 1;
int count = 1;
for(int i = 0;i<a.size()-1;i++) {
if(a.at(i) == a.at(i+1)) {
count++;
}
else {
ans = max(ans,count);
count = 1;
}
}
cout << ans;
} | 0 | 53,950,051 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 2e5 + 5;
int main(){
char s;
cin>>s;
if(s == 'A'){
cout<<"T"<<endl;
} else if(s == 'T'){
cout<<'A'<<endl;
}else if(s == 'G'){
cout<<"C"<<endl;
}else{
cout<<"G"<<endl;
}
return 0;
} | #include <bits/stdc++.h>
#include <algorithm>
#include <math.h>
using namespace std;
int CalcSumOfDigit(int n);
int getDigit(int n);
string upper(string str);
string lower(string str);
class Combi
{
public:
Combi();
long long Combination(long long n, long long k);
private:
vector<vector<long long>> memo;
long long n_num;
long long k_num;
void Resize(long long n, long long k);
};
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define sz(a) int((a).size())
#define rep(i,n) for(int(i)=0;(i)<(n);(i)++)
#define repe(i,n) for(int(i)=0;(i)<=(n);(i)++)
#define vsort(v) sort((v).begin(),(v).end())
#define rvsort(v) sort(rall((v)))
#define vi vector<int>
#define GCD(a,b) __gcd((a),(b))
#define LCM(a,b) (a)/GCD((a),(b))*(b)
#define kiriage(a,b) ((a)+(b)-1)/(b)
const int INF = 1e9;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<long> vll;
int main() {
string s;
ll k;
cin >> s >> k;
vector<pair<char,ll>> z;
set<char> se;
rep(i,sz(s))
{
se.insert(s[i]);
pair<char,ll> one;
if(i == 0)
{
one.first = s[i];
one.second = 1;
z.push_back(one);
}
else
{
one = z[sz(z) - 1];
if(one.first == s[i])
{
z[sz(z) - 1].second++;
}
else
{
one.first = s[i];
one.second = 1;
z.push_back(one);
}
}
}
ll ans = 0;
if(sz(se) == 1)
{
ll len = sz(s);
ans = len * k / 2;
}
else
{
ll once = 0;
rep(i,sz(z))
{
once += z[i].second / 2;
}
ans = once * k;
if(s[0] == s[sz(s) - 1])
{
ll minus = (z[0].second + z[sz(z) - 1].second) / 2 - z[0].second / 2 - z[sz(z) - 1].second / 2;
ans += minus * (k - 1);
}
}
cout << ans << endl;
return 0;
}
int getDigit(int n)
{
int i = 1;
while(1)
{
n = n / 10;
if(n == 1)
break;
i++;
}
return i;
}
int CalcSumOfDigit(int n)
{
int s = 0;
while(n)
{
s += n % 10;
n = n / 10;
}
return s;
}
string upper(string str)
{
for(auto itr = str.begin();itr != str.end() ; itr++)
{
if(97 <= *itr && *itr <= 122)
{
*itr = *itr - 32;
}
}
return str;
}
string lower(string str)
{
for(auto itr = str.begin();itr != str.end() ; itr++)
{
if(65 <= *itr && *itr <= 90)
{
*itr = *itr + 32;
}
}
return str;
}
Combi::Combi(){
n_num = -1;
k_num = -1;
};
ll Combi::Combination(ll n, ll k)
{
Resize(n,k);
ll ret;
if(memo[n][k] != 0)
{
ret = memo[n][k];
}
else if(n == k || k == 0)
{
memo[n][k] = 1;
ret = 1;
}
else
{
ret = Combination(n - 1, k - 1) + Combination(n - 1, k);
memo[n][k] = ret;
}
return ret;
}
void Combi::Resize(ll n, ll k)
{
if(n_num <= n || k_num <= k)
{
n_num = (n + 1) * 2;
k_num = (k + 1) * 2;
memo.resize(n_num);
for(auto itr = memo.begin(); itr != memo.end(); ++itr)
{
itr->resize(k_num);
}
}
} | 0 | 46,709,501 |
#include <iostream>
using namespace std;
int main() {
for (int l = 1; l < 10; l++) {
for (int r = 1; r < 10; r++) {
cout << l << 'x' << r << '=' << l * r << endl;
}
}
return 0;
} | #include <cstdio>
#include <cstring>
typedef long long int64;
static const int MAXD = 10;
int N;
int pow10[MAXD];
inline bool query(int64 n)
{
static char r[20];
printf("? %lld\n", n); fflush(stdout);
scanf("%s", r);
return r[0] == 'Y';
}
bool result[MAXD];
int main()
{
pow10[0] = 1;
for (int i = 0; i < MAXD - 1; ++i)
pow10[i + 1] = pow10[i] * 10;
for (int i = 0; i < MAXD; ++i)
result[i] = query(pow10[i]);
if (result[MAXD - 1] == true) {
for (int i = 0; i < MAXD; ++i)
if (query(2 * pow10[i])) { printf("! %d\n", pow10[i]); break; }
} else {
int dg;
for (dg = 0; result[dg]; ++dg) ;
int64 accum = 0;
for (int i = 0; i < dg - 1; ++i) {
int lo = 0, hi = 10, mid;
while (lo < hi - 1) {
mid = (lo + hi) >> 1;
if (query(accum * 10 + mid)) lo = mid; else hi = mid;
}
accum = accum * 10 + lo;
}
for (int j = (dg == 1 ? 1 : 0); j <= 9; ++j)
if (query(accum * 100 + j * 10)) {
printf("! %lld\n", accum * 10 + j); break;
}
}
return 0;
} | 0 | 44,101,022 |
#include<iostream>
#include<string>
#include<cstdio>
#include <cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 1000000007;
typedef long double ld;
const ll INF = 1e+14;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(),c.end()
#define pb push_back
void Yes(){
cout<<"Yes"<<endl;
exit(0);
}
void No(){
cout<<"No"<<endl;
exit(0);
}
long long mod_inverse(long long x) {
long long ret = 1; long long n = mod - 2;
while (n) {
if (n & 1)ret = ret * x % mod;
x = x * x % mod; n >>= 1;
}
return ret;
}
ll fact[100100], inv_fact[100100];
ll comb(ll n, ll r) {
if(n < r || r < 0) return 0;
if(n == r || r == 0) return 1LL;
ll ret = fact[n] * inv_fact[n - r] % mod * inv_fact[r] % mod;
return ret % mod;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n; cin >> n;
set<int> s;
map<int, int> mp;
ll l;
rep(i, n + 1) {
int a; cin >> a;
if(s.find(a) != s.end()) {
l = (ll)i - (ll)mp[a];
break;
} else {
s.insert(a);
mp[a] = i;
}
}
fact[0] = 1LL; inv_fact[0] = 1LL;
rep1(i, n) {
fact[i] = fact[i - 1] * i % mod;
inv_fact[i] = mod_inverse(fact[i]);
}
rep1(k, n + 1) {
ll ans = 0;
(ans += comb(n - 1, k)) %= mod;
(ans += comb(n - l, k - 1)) %= mod;
((ans += 2LL * (comb(n - 1, k - 1) - comb(n - l, k - 1))) += 3 * mod) %= mod;
(ans += comb(n - 1, k - 2)) %= mod;
ans %= mod;
cout << ans << endl;
}
return 0;
} | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
#define base 196471
int n;
int main() {
cin >> n;
int Y, M, D;
vector<int> ans;
while (n--) {
int tmp = 0;
cin >> Y >> M >> D;
tmp += (Y % 3 && !(M % 2)) ? 20 - D : 21 - D;
for (int i = M+1; i <= 10; ++i) {
tmp += (Y % 3 && !(i % 2)) ? 19 : 20;
}
for (int i = Y + 1; i <= 999; ++i) {
tmp += (i % 3) ? 195 : 200;
}
ans.push_back(tmp);
}
for (int i = 0; i < ans.size(); ++i) {
cout << ans[i] << endl;
}
return 0;
} | 0 | 92,511,588 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const int maxn=1e6+5;
vector<ll> V;
int pre[maxn];
int main() {
ll n;cin>>n;
cout<<n*(n+1)/2<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) \
for (int i = 0; i < (int)(n); i++) \
;
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
int main() {
ll n;
cin >> n;
vector<ll> a(n);
for (ll &x : a) {
cin >> x;
}
sort(a.begin(), a.end());
vector<bool> ok(n, true);
for (long i = 0; i < n; i++) {
if (i != 0 && a.at(i) == a.at(i - 1)) {
ok.at(i) = false;
ok.at(i - 1) = false;
}
if (!ok.at(i)) {
continue;
}
ll maxVal = a.at(n - 1);
for (ll x = a.at(i) * 2; x <= maxVal; x += a.at(i)) {
auto iter = lower_bound(a.begin(), a.end(), x);
if (iter != a.end()) {
if (*iter == x) {
ok.at(distance(a.begin(), iter)) = false;
}
}
}
}
ll ans = 0;
for (auto x : ok) {
if (x) {
ans++;
}
}
cout << ans << endl;
} | 0 | 1,158,821 |
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
typedef long long LL;
const int MaxN = 1e5;
using namespace std;
int n, K;
int a[MaxN + 5], b[MaxN + 5];
int main()
{
while(~scanf("%d%d", &n, &K)) {
K++;
for (int i = 1; i <= n; i++) scanf("%d%d", &a[i], &b[i]);
LL ans = 0, now = 0;
for (int P = 30; P >= 0; P--) {
if(K & (1 << P)) {
now ^= (1 << P);
LL tmp = 0;
for (int i = 1; i <= n; i++) {
if((a[i] & now) == 0) tmp = tmp + b[i];
}
ans = max(ans, tmp);
now ^= (1 << P);
}
else {
now ^= (1 << P);
}
}
printf("%lld\n", ans);
}
} | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
using namespace std;
#define N (1000000000+7)
#define M (998244353)
#define INF 1e16
typedef long long ll;
typedef pair<ll,ll > P;
typedef pair<P,ll>Q;
int main(void){
int n;
cin>>n;
vector<ll>a(n),b(n);
ll sa = 0,sb = 0;
for(int i=0;i<n;i++)cin>>a[i],sa+=a[i];
for(int i=0;i<n;i++)cin>>b[i],sb+=b[i];
ll s = sb - sa;
ll pl = 0;
ll mi = 0;
for(int i=0;i<n;i++){
if(a[i]-b[i]>0)pl += a[i]-b[i];
else{
if(a[i]-b[i]<0){
mi += (b[i]-a[i])/2;
if((b[i]-a[i])%2==1)mi++;
}
}
}
if(pl<=s && mi<=s)cout<<"Yes"<<endl;
else cout<<"No"<<endl;
return 0;
} | 0 | 83,662,560 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int m, n, i, cnt = 0, sum = 0;
float x;
cin>>n>>m;
int a[n];
for(i = 0; i<n; i++)
{
cin>>a[i];
}
for(i = 0; i<n; i++)
{
sum += a[i];
}
x = (1.0/(4.0*m))*sum;
for(i = 0; i<n; i++)
{
if(a[i]>=x)
{
cnt++;
}
}
if(cnt>=m) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int n, m;
cin >> n >> m;
vector<pair<long long,long long>>ab(n);
for(int i=0; i<n; i++){
cin >> ab[i].first >> ab[i].second;
}
sort(ab.begin(),ab.end());
long long ans = 0, tmp=m;
for(int i=0; i<n; i++){
if(ab[i].second>=tmp){
ans += ab[i].first * tmp;
break;
}else{
ans += ab[i].second * ab[i].first;
tmp -= ab[i].second;
}
}
cout << ans << endl;
return 0;
} | 0 | 31,256,240 |
#include <iostream>
#include <climits>
#include <vector>
class TMinimumMultiplications
{
std::vector<std::vector<int> > FTable;
std::vector<std::pair<int, int> >& FMatrixChain;
int GetMinimum(int Begin, int End);
public:
TMinimumMultiplications(std::vector<std::pair<int, int> >& MatrixChain);
int Get(int Begin, int End);
};
TMinimumMultiplications::TMinimumMultiplications(std::vector<std::pair<int, int> >& MatrixChain)
: FMatrixChain(MatrixChain), FTable(MatrixChain.size(), std::vector<int>(MatrixChain.size(), -1))
{
}
int TMinimumMultiplications::GetMinimum(int Begin, int End)
{
int Minimum = INT_MAX;
for(int i = Begin; i < End; ++i){
int Total = Get(Begin, i) + Get(i + 1, End) + FMatrixChain[Begin].first * FMatrixChain[i + 1].first * FMatrixChain[End].second;
if(Minimum > Total) Minimum = Total;
}
return Minimum;
}
int TMinimumMultiplications::Get(int Begin, int End)
{
if(Begin == End) return 0;
if(FTable[Begin][End] < 0){
FTable[Begin][End] = GetMinimum(Begin, End);
}
return FTable[Begin][End];
}
int main()
{
int Count;
std::cin >> Count;
std::vector<std::pair<int, int> > MatrixChain;
for(int i = 0; i < Count; ++i){
int Row, Col;
std::cin >> Row >> Col;
MatrixChain.push_back(std::make_pair(Row, Col));
}
TMinimumMultiplications Minimum(MatrixChain);
std::cout << Minimum.Get(0, MatrixChain.size() - 1) << std::endl;
return 0;
} | #include <iostream>
#include <algorithm>
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <cstring>
#include <utility>
#include <vector>
#include <complex>
#include <valarray>
#include <fstream>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <numeric>
#include <climits>
#define _overload(a, b, c, d, ...) d
#define _rep1(X, A, Y) for (int (X) = (A);(X) <= (Y);++(X))
#define _rep2(X, Y) for (int (X) = 0;(X) < (Y);++(X))
#define rep(...) _overload(__VA_ARGS__, _rep1, _rep2)(__VA_ARGS__)
#define rrep(X,Y) for (int (X) = Y-1;(X) >= 0;--(X))
#define all(X) (X).begin(),(X).end()
#define _size(X) (int)((X).size())
#define mod(n, m) (((n)%(m)+(m))%m)
#define fi first
#define sc second
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
const int INFINT = 1 << 30;
const ll INFLL = 1LL << 60;
const double EPS = 1e-10;
const int MOD = 1000000007;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const int MAX_N = 100000;
int N;
int a[MAX_N], b[MAX_N];
int match[MAX_N];
vector<int> G[MAX_N];
bool dfs(int par, int v) {
for (int i = 0; i < G[v].size(); ++i) {
if (G[v][i] != par) {
if (!dfs(v, G[v][i])) {
return false;
}
}
}
if (match[v] < 0) {
if (par < 0 || match[par] >= 0) return false;
else match[v] = match[par] = v;
}
return true;
}
int main() {
std::ios::sync_with_stdio(false);std::cin.tie(0);
cin >> N;
rep(i, N-1) cin >> a[i] >> b[i];
rep(i, N-1) {
--a[i]; --b[i];
G[a[i]].push_back(b[i]);
G[b[i]].push_back(a[i]);
}
memset(match, -1, sizeof(match));
if (dfs(-1, 0)) {
cout << "Second" << endl;
} else {
cout << "First" << endl;
}
return 0;
} | 0 | 72,800,316 |
#include<bits/stdc++.h>
#define pb push_back
#define mk make_pair
#define ll long long
#define ss second
#define ff first
#define pll pair<ll,ll>
#define vll vector<ll>
#define mll map<ll,ll>
#define mod 1000000007
#define w(x) ll x; cin>>x; while(x--)
#define ps(x,y) fixed<<setprecision(y)<<x;
#define fo(i, j, k, in) for (ll i=j ; i<k ; i+=in)
#define re(i, j) fo(i, 0, j, 1)
#define pi 3.1415926535897932384626433832795
#define all(cont) cont.begin(), cont.end()
#define countbit(x) __builtin_popcount(x)
#define mod 1000000007
#define lo lower_bound
#define de(n) ll n;cin>>n;
#define def(a,n) ll n;cin>>n;ll a[n];re(i,n){cin>>a[i];}
#define defi(a,n,k) ll n;cin>>n; ll k;cin>>k;ll a[n];re(i,n){cin>>a[i];}
#define deb(x) cout<<#x<<"="<<x<<endl;
#define tr(it,a) for(auto it=a.begin();it!=a.end();it++)
#define nl cout<<endl;
using namespace std;
void cp()
{
ios :: sync_with_stdio(false); cin.tie(0); cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
int main()
{
de(n);
string s,t;
cin>>s>>t;
re(i,n)
cout<<s.at(i)<<t.at(i);
return 0;
} | #include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <iomanip>
#include <functional>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <map>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> PLL;
#define rep(i,n) for (ll i = 0; i < (ll)(n); i++)
#define rep1(i,n) for (ll i = 1; i <= (ll)(n); i++)
#define repR(i,n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define rep1R(i,n) for (ll i = (ll)(n); i >= 1; i--)
#define loop(i,a,B) for (ll i = a; i B; i++)
#define loopR(i,a,B) for (ll i = a; i B; i--)
#define all(v) v.begin(), v.end()
#define fcout cout<<fixed<<setprecision(15)
#define PI 3.1415926535897932384626433832795028841971693993751058209749445923078160628620899
const unsigned int BIT_FLAG_0 = (1 << 0);
const unsigned int BIT_FLAG_1 = (1 << 1);
const unsigned int BIT_FLAG_2 = (1 << 2);
const unsigned int BIT_FLAG_3 = (1 << 3);
const unsigned int BIT_FLAG_4 = (1 << 4);
const unsigned int BIT_FLAG_5 = (1 << 5);
const unsigned int BIT_FLAG_6 = (1 << 6);
const unsigned int BIT_FLAG_7 = (1 << 7);
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
const ll INF = 1000000000000000000;
string S, T, U, V[1100000], W[1100000];
char P[1100000], Q[1100000];
ll ANS=0, SUM=0, NOW=0, N, M, A, B, C, D, E, F[1100000] = { 0 }, G[1100000] = { 0 }, H[1100000] = { 0 };
double n, m, a, b, c, d, e;
bool ans = 0, now = 0, sum = 0, BOOL[1100000];
int mod_pow(int x, int y, int m) {
int res = 1;
while (y) {
if (y & 1) {
res = res * x % m;
}
x = x * x % m;
y >>= 1;
}
return res;
}
int kai(int x, int y) {
int res = 1;
for (int i = x - y; i <= x; i++) {
res *= i;
res %= MOD;
}
return res;
}
int comb(int x, int y) {
if (y > x) return 0;
return kai(x, y) * mod_pow(kai(x, y), MOD - 2, MOD) % MOD;
}
ll gcd(ll x, ll y) {
if (x < y) {
swap(x, y);
}
ll r = x % y;
while (r != 0) {
x = y;
y = r;
r = x % y;
}
return y;
}
int lcm(int x, int y) {
int ans = x * y / gcd(x, y);
return ans;
}
long ketasu(long n) {
long count = 1;
while (n >= 10) {
n /= 10;
count++;
}
return count;
}
string sortS(string s) {
string sortS;
vector<char> t(s.size());
rep(i, s.size()) t[i] = s[i];
sort(t.begin(), t.end());
rep(i, s.size()) sortS += t[i];
return sortS;
}
bool anagram(string a, string b) {
if (sortS(a) == sortS(b)) return true;
else return false;
}
int euclidA(int a, int b) {
bool h = false;
int i = 1;
int ansa;
while (!h) {
if (((i * a) - gcd(a, b)) % b == 0) {
ansa = i;
h = true;
}
i++;
}
return ansa;
}
int eucridB(int a, int b) {
bool h = false;
int i = 1;
int ansb;
while (!h) {
if (((i * a) - gcd(a, b)) % b == 0) {
ansb = ((i * a - gcd(a, b)) / b);
h = true;
}
i++;
}
return ansb;
}
int twobeki(int n) {
if (n == 0) return 1;
if (n % 2 == 0) {
int k = twobeki(n / 2);
return k * k;
}
return twobeki(n - 1) * 2;
}
ll nibutanlowL(ll k, ll a[], ll b, ll c) {
ll left = b - 1;
ll right = c + 1;
while (right - left > 1) {
ll mid = left + (right - left + 1) / 2;
if (a[mid] >= k) right = mid;
else left = mid;
}
return left;
}
ll nibutanlowR(ll k, ll a[], ll b, ll c) {
ll left = b - 1;
ll right = c + 1;
while (right - left > 1) {
ll mid = left + (right - left + 1) / 2;
if (a[mid] >= k) right = mid;
else left = mid;
}
return right;
}
ll nibutanupL(ll k, ll a[], ll b, ll c) {
ll left = b - 1;
ll right = c + 1;
while (right - left > 1) {
ll mid = left + (right - left + 1) / 2;
if (a[mid] > k) right = mid;
else left = mid;
}
return left;
}
ll nibutanupR(ll k, ll a[], ll b, ll c) {
ll left = b - 1;
ll right = c + 1;
while (right - left > 1) {
ll mid = left + (right - left + 1) / 2;
if (a[mid] > k) right = mid;
else left = mid;
}
return right;
}
ll mod(ll a, ll b) {
if (a >= 0) return a % b;
ll c = 0 - a;
ll d = c % b;
return b - d;
}
bool AC[1100000] = { 0 };
int main() {
cin >> N;
rep(i, N) cin >> V[i] >> F[i];
cin >> T;
rep(i, N) {
if (T == V[i]) {
NOW = i;
break;
}
}
for (ll i = NOW+1; i <= N - 1; i++) {
ANS += F[i];
}
cout << ANS << endl;
return 0;
} | 0 | 29,364,104 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 2e5 + 5;
const int INF = 0x3f3f3f3f;
const ll p = 1e9 + 7;
#define DEBUG(x) cout << (x) << '\n'
#define fi first
#define se second
int n, a[MAXN];
void run(){
cin >> n;
for(int i = 1; i <= n; i++) cin >> a[i];
int mx = 0;
ll ans = 0;
for(int i = 1; i <= n; i++)
ans += max(0, mx - a[i]), mx = max(mx, a[i]);
DEBUG(ans);
}
int main(){
#ifdef Irene
freopen("in.txt", "r", stdin);
#endif
ios_base::sync_with_stdio(false);
run(); return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define bg begin()
#define ed end()
#define all(x) x.bg, x.ed
#define vi vector<int>
template <class t, class u>
void chmax(t &a, u b)
{
if (a < b)
a = b;
}
template <class t, class u>
void chmin(t &a, u b)
{
if (b < a)
a = b;
}
int main()
{
string s;
cin >> s;
vector<ll> n(s.length() + 1, 0);
for (int i = 0; i < s.length(); i++)
{
if (s[i] == '<')
{
chmax(n[i + 1], n[i] + 1);
}
}
for (int i = s.length() - 1; i >= 0; i--)
{
if (s[i] == '>')
{
chmax(n[i], n[i + 1] + 1);
}
}
cout << std::accumulate(all(n), ll(0)) << endl;
return 0;
} | 0 | 11,605,629 |
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define min_3(a,b,c) min(a,min(b,c))
#define max_3(a,b,c) max(a,max(b,c))
#define nout(ans) cout << (ans) << "\n"
#define sout(ans) cout << (ans) << " "
using namespace std;
const double pi = 3.14159265359;
const ll INF = 1e12;
const ll MOD = 1e9 + 7;
const ll N = 1e5 + 5;
bool compare(const pair<int, int>&i, const pair<int, int>&j)
{
return i.second < j.second;
}
ll raise(ll a, ll b) {
ll res = 1;
while (b > 0) {
if (b & 1)
res = res * a;
a = a * a;
b >>= 1;
}
return res;
}
ll n, b[N];
void solve()
{
cin >> n;
for (int i=0; i<n-1; ++i) cin >> b[i];
ll s=0;
for (int i=0; i<n-2; ++i) {
if (b[i]<=b[i+1]) {
s+=b[i];
}else{
s+=b[i+1];
}
}nout(s+b[0]+b[n-2]);
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
int t = 1;
for (int i=1; i<=t; i++)
{
solve();
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(void){
vector<vector<char> > number(10);
number[1].push_back('.');
number[1].push_back(',');
number[1].push_back('!');
number[1].push_back('?');
number[1].push_back(' ');
number[2].push_back('a');
number[2].push_back('b');
number[2].push_back('c');
number[3].push_back('d');
number[3].push_back('e');
number[3].push_back('f');
number[4].push_back('g');
number[4].push_back('h');
number[4].push_back('i');
number[5].push_back('j');
number[5].push_back('k');
number[5].push_back('l');
number[6].push_back('m');
number[6].push_back('n');
number[6].push_back('o');
number[7].push_back('p');
number[7].push_back('q');
number[7].push_back('r');
number[7].push_back('s');
number[8].push_back('t');
number[8].push_back('u');
number[8].push_back('v');
number[9].push_back('w');
number[9].push_back('x');
number[9].push_back('y');
number[9].push_back('z');
int n; cin >> n;
for(int i = 0; i < n; i++){
string str; cin >> str;
int j = 0;
while(str[j] != '\0'){
int counter = 0;
if(str[j] == '0'){
j++;
continue;
}
while(str[j] != '0'){
counter++;
j++;
}
cout << number[(int)str[j - 1] - '0'][(counter-1) % number[(int)str[j - 1] - '0'].size()];
j++;
}
cout << endl;
}
return 0;
} | 0 | 60,667,454 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <deque>
#include <queue>
#include <list>
#include <stack>
#include <string>
#include <tuple>
#include <functional>
#include <numeric>
#include <cmath>
#include <iomanip>
#include <map>
#include <random>
#include <cstdlib>
#define INT_MAX 2147483647
#define INT_MIN -2147483646
#define Loop(i, n) for(int i = 0; i < (int)n; i++)
#define Loop1(i, n) for(int i = 1; i <= (int)n; i++)
#define Loopr(i, n) for(int i = (int)n - 1; i >= 0; i--)
#define Loopr1(i, n) for(int i = (int)n; i >= 1; i--)
using namespace std;
typedef long long int ll;
bool mx[105][105];
int main() {
int n;
cin >> n;
Loop1(i, n) {
Loop1(j, n) {
mx[i][j] = 0;
}
}
Loop(i, n) {
int u, k;
cin >> u >> k;
Loop(j, k) {
int v;
cin >> v;
mx[u][v] = 1;
}
}
Loop1(i, n) {
Loop1(j, n - 1) {
cout << mx[i][j] << " ";
}
cout << mx[i][n] << endl;
}
return 0;
} | #include<iostream>
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define IO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
int n, k, m=1e9+7, cnt[100009], f[100009],ph[100009];
vector<int> v[100009];
ll ans;
ll fastpower(ll b, ll p)
{
if(p == 0)
return 1 ;
return p % 2 == 0 ? fastpower((b * b) % m, p / 2) : (b * fastpower((b * b) % m, p / 2) % m) % m;
}
void solve()
{
for(int i=1; i<=k; i++)
{
for(int j=i; j<=k; j+=i)
v[j].push_back(i);
cnt[i]=k/i;
if(i==1)
ph[i]=1;
else if(v[i].size()==2)
ph[i]=-1;
else if(i%(1LL*v[i][1]*v[i][1])==0)
ph[i]=0;
else
ph[i]=-ph[i/v[i][1]];
}
for(int i=1; i<=k; i++)
for(auto j : v[i])
f[j]=(1LL*f[j]+1LL*fastpower(cnt[i],n)*ph[i/j])%m;
for(int i=1; i<=k; i++)
{
ans+=1LL*f[i]*i;
ans%=m;
}
cout<<(ans+m)%m;
}
int main()
{
IO
cin>>n>>k;
solve();
} | 0 | 33,494,073 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
typedef long long ll;
typedef long double ld;
int main()
{
int n, m; cin >> n >> m;
vector<string> a(n);
vector<string> b(m);
rep(i, n)
{
cin >> a[i];
}
rep(i, m)
{
cin >> b[i];
}
int cnt = 0;
rep(i, (n - m) + 1)
{
rep(j, (n - m + 1))
{
int k = 0;
if (a[i].substr(j, m) == b[k])
{
cnt = 1;
for(k = 1; k < m; k++)
{
if (a[i + k].substr(j, m) == b[k])
cnt++;
}
if (cnt == m)
{
cout << "Yes" << endl;
return 0;
}
}
}
}
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0; i<(n); i++)
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(){
ll n; cin>>n;
vector<ll> a(n);
rep(i,n) cin>>a[i];
ll inf=1e15;
vector<ll> dp(n, inf);
rep(i,n){
auto itr=lower_bound(dp.begin(), dp.end(), a[i]);
ll index=itr-dp.begin();
dp[index]=a[i];
}
ll res=0;
rep(i,n){
if(dp[i]<inf){
res=i;
}
}
cout<<res+1<<endl;
return 0;
} | 0 | 16,893,443 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, X = 1;
cin >> N >> K;
while (X < K && N > 0) {
X *= 2;
N--;
}
cout << X + N * K << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define inf 1001001001001001001
#define mod 1000000007
#define mod2 998244353
#define pi acos(-1)
#define all(v) v.begin(),v.end()
int main(){
int N;cin>>N;
vector<double>x(N);
vector<string>u(N);
double ans=0;
rep(i,N){
cin>>x.at(i)>>u.at(i);
}
rep(i,N){
if(u.at(i)=="JPY"){
ans+=x.at(i);
}else{
ans+=x.at(i)*380000.0;
}
}
cout<<ans<<endl;
} | 0 | 92,206,654 |
#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 INF = 1001001001;
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 h, n;
cin >> h >> n;
vector<vector<int>> dp(n+1, vector<int>(h+1));
rep(i,n+1)rep(j,h+1) {
dp[i][j] = INF;
}
dp[0][0] = 0;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
for (int j = 0; j <= h; j++) {
chmin(dp[i+1][j], dp[i][j]);
chmin(dp[i+1][min(j+a, h)], dp[i+1][j] + b);
}
}
cout << dp[n][h] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void)
{
int n; cin >> n;
int x[102] = {0};
int sum = 0;
for (int i = 0; i < n; i++)
{
cin >> x[i]; sum += x[i];
}
int c = sum / n;
int d1 = 0, d2 = 0;
for (int i = 0; i < n; i++)
{
d1 += (c - x[i]) * (c - x[i]);
d2 += (c + 1 - x[i]) * (c + 1 - x[i]);
}
int ans = min(d1, d2);
cout << ans << endl;
} | 0 | 94,786,652 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i<(int)(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll MOD = 1000000007;
const ll INF = 10000000000000000;
vector<int> x4 = {0, 1, 0, -1}, x8 = {0, 1, 1, 1, 0, -1, -1, -1};
vector<int> y4 = {1, 0, -1, 0}, y8 = {1, 1, 0, -1, -1, -1, 0, 1};
template<class T> struct edge { int from, to; T cost;};
template<class T> inline bool chmin(T& a, T b){if (a>b){a = b; return true;}return false;}
template<class T> inline bool chmax(T& a, T b){if (a<b){a = b; return true;}return false;}
template<class T> inline T powerM(T a,T b){if (b==0) return 1;
T tmp = powerM(a,b/2); if (b%2==0) return tmp*tmp%MOD; else return tmp*tmp%MOD*a%MOD; }
template<class T> inline T power(T a,T b,T m){ if (b==0) return 1;
T tmp = power(a,b/2,m); if (b%2==0) return tmp*tmp%m; else return tmp*tmp%m*a%m; }
template<class T> inline T gcd(T a, T b){if (b==0) return a; return gcd(b, a%b);}
template<class T> inline T lcm(T a, T b){return a / gcd(a,b) * b;}
template<class T> inline T extgcd(T a,T b,T &x,T &y){if (b==0){x=1; y=0; return a;} T d=extgcd(b,a%b,y,x); y -= a/b*x; return d;}
int main() {
int n; cin >>n;
cout <<(n-2) * 180 <<endl;
} | #include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
#include <sstream>
#include <algorithm>
#include <map>
#include <iterator>
#include <queue>
#include <utility>
#include <set>
#include <deque>
using namespace std;
#define endl "\n"
#define ll long long int
#define c(x) ll x;cin>>x
#define cc(x,y) ll x,y;cin>>x>>y
#define ccc(x,y,z) ll x,y,z; cin>>x>>y>>z
#define db long double
#define fast cin.tie(NULL); cout.tie(NULL); ios_base::sync_with_stdio(false)
#define inf 200000000000000
#define mod 1000000007
#define mod2 998244353
#define eps 1e-7
#define PI 3.1415926535897932385
#define pb push_back
#define bitc __builtin_popcountll
#define mp make_pair
#define ff first
#define ss second
#define all(ar) ar.begin(), ar.end()
#define len(x) (ll)(x).size()
#define fr(i,a,b) for (ll i = (a), _b = (b); i <= _b; i++)
#define rep(i,n) for (ll i = 0, _n = (n); i < _n; i++)
#define repr(i,n) for (ll i = n - 1; i >= 0; i--)
#define frr(i,a,b) for (ll i = (a), _b = (b); i >= _b; i--)
#define foreach(it,ar) for (auto it = ar.begin(); it != ar.end(); it++)
#define fill(ar,val) memset(ar, val, sizeof(ar))
#define print(arr,n) cout<<" :: "<<#arr<<" :: "<<endl; rep(i,n) cout<<arr[i]<<" "; cout<<endl
#define print2(arr,n,m) cout<<" :: "<<#arr<<" :: "<<endl; rep(i,n){ rep(j,m) cout<<arr[i][j]<<" "; cout<<endl; }
#define dyn1(arr,n) ll* arr=new ll[n]; rep(i,n) arr[i]=0;
#define dyn2(arr,n,m) ll** arr=new ll*[(n)]; rep(i,n) arr[i]=new ll[m]; rep(i,n) rep(j,m) arr[i][j]=0
#define carr(arr,n) rep(i,n) cin>>arr[i]
#define carr2(arr,n,m) rep(i,n) rep(j,m) cin>>arr[i][j]
#define debug(a) cout<<" :: "<<#a<<" == "<<a<<endl
#define debug2(a,b) cout<<" :: "<<#a<<" == "<<a<<" :: "<<#b<<" == "<<b<<endl
#define watch(x) cerr << (#x) << " is " << (x) << endl
#define debugx(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false); debugx("%s time : %.4fs", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef pair<ll,ll> pii;
typedef vector<pii> vii;
inline ll maxim(ll a,ll b) {if(a>b) return a; else return b;}
inline ll minim(ll a,ll b) {if(a<b) return a; else return b;}
inline bool equals(double a, double b){ return fabs(a - b) < 1e-9; }
ll gcd(ll a, ll b){ return b==0 ? a : gcd(b, a%b); }
ll sum(ll* arr,ll n)
{
ll total=0;
rep(o,n)
{
total+=arr[o];
}
return total;
}
ll Extended_gcd(ll a,ll b,ll& x,ll& y)
{
if(a==0)
{
x=0;
y=1;
return b;
}
else
{
ll x1,y1;
ll g=Extended_gcd(b%a,a,x1,y1);
x=y1-(b/a)*x1;
y=x1;
return g;
}
}
bool prime[2000010];
void SieveOfEratosthenes()
{
memset(prime, true, sizeof(prime));
prime[1]=false;
for (int p=2; p*p<=2000001; p++)
{
if (prime[p] == true)
{
for (int i=p*p; i<=2000001; i += p)
prime[i] = false;
}
}
}
vector<ll> prime_vec[1000010];
void modified_SieveOfEratosthenes()
{
for (int p=2; p*p<=1000001; p++)
{
if (prime_vec[p].size()==0)
{
for (int i=p*2; i<=1000001; i += p)
prime_vec[i].pb(p);
}
}
}
ll binpow(ll a, ll b)
{
ll res = 1;
while (b > 0)
{
if (b & 1) res = (res * a);
a = (a * a);
b >>= 1;
}
return res;
}
ll modpow(ll a, ll b,ll x)
{
ll res = 1;
while (b > 0)
{
if (b & 1) res = (res * a)%x;
a = (a * a)%x;
b >>= 1;
}
return res;
}
int modInverse(int a, int m)
{
int m0 = m;
int y = 0, x = 1;
if (m == 1)
return 0;
while (a > 1)
{
int q = a / m;
int t = m;
m = a % m, a = t;
t = y;
y = x - q * y;
x = t;
}
if (x < 0)
x += m0;
return x;
}
ll lpf[1000001] = {};
void precompute()
{
fr(i,2,1000000)
{
if(!lpf[i])
{
for(ll j=i;j<=1000000;j+=i)
{
if(!lpf[j])
lpf[j]=i;
}
}
}
}
vector<ll> adj[1000010];
ll degree[1000010];
void adj_former(ll n)
{
rep(o,n-1)
{
cc(a,b);
adj[a].pb(b);
adj[b].pb(a);
degree[a]++;
degree[b]++;
}
}
ll arr[1000010]={0};
ll brr[1000010]={0};
ll freq[1000010];
ll pre[1000010]={0};
ll suff[1000010]={0};
ll mat[2010][2010];
map<ll,ll> lookup;
string sarr[1000010];
pair<ll,ll> cont[1000010];
ll func(ll x)
{
ll count=0;
rep(o,26)
{
count+=(freq[o]/(x));
}
return count;
}
ll bs(ll low,ll high,ll target)
{
while(low+3<high)
{
ll mid=(low+high)/2;
if(func(mid)<target)
{
high=mid-1;
}
else
{
low=mid;
}
}
frr(o,high,low)
{
if(func(o)>=target) return o;
}
return -1;
}
bool leap(ll y)
{
if(y%400==0) return true;
if((y%4==0)&&(y%100!=0)) return true;
return false;
}
int main()
{
fast;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
cout<<setprecision(10)<<fixed;
cc(n,k);
carr(arr,n);
ll k_excluded[n+2]={0};
ll k_included[n+2]={0};
ll total_=0;
rep(o,n)
{
if(arr[o]>=0) total_+=arr[o];
}
ll pres=0;
rep(o,k)
{
if(arr[o]>=0) pres+=arr[o];
}
k_excluded[0]=pres;
fr(u,1,n-k)
{
ll d=k_excluded[u-1];
if(arr[u+k-1]>=0) d+=arr[u+k-1];
if(arr[u-1]>=0) d-=arr[u-1];
k_excluded[u]=d;
}
ll total=0;
rep(o,k)
{
total+=arr[o];
}
k_included[0]=total;
fr(u,1,n-k)
{
k_included[u]=k_included[u-1];
k_included[u]-=arr[u-1];
k_included[u]+=arr[u+k-1];
}
ll maxo=0;
fr(o,0,n-k)
{
ll pres=total_;
pres+=maxim(k_included[o],0);
pres-=k_excluded[o];
maxo=maxim(maxo,pres);
}
cout<<maxo<<endl;
return 0;
} | 0 | 54,190,380 |
#include <iostream>
#include <string>
using namespace std;
int main(){
int list[32] = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int l; cin >> l;
cout << list[l - 1] << endl;
return 0;} | #include <bits/stdc++.h>
#include <climits>
#include <sstream>
using namespace std;
long long modpow(long long a,long long n,long long mod){
long long res = 1;
while(n > 0){
if(n&1)res = res*a%mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
int main(){
int N;
cin >> N;
int D[N];
long long mod = 998244353;
map<long long,int> d;
for(int i = 0; i < N;i++){
cin >> D[i];
d[D[i]]++;
}
long long ans = 1;
bool flag = false;
for(int i = N -1; i >= 1;i--){
if(d[i]!=0)flag = true;
if(flag&&d[i]==0){
cout << 0 << endl;
return 0;
}
}
if(d[0]!=1){
cout << 0 << endl;
return 0;
}
if(D[0]!= 0){
cout << 0 << endl;
return 0;
}
for(int i = 1; i <N;i++){
ans *= modpow(d[i-1],d[i],mod);
ans %= mod;
}
cout << ans << endl;
return 0;
} | 0 | 1,310,583 |
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <utility>
#include <functional>
#include <sstream>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <climits>
using namespace std;
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v;}
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str();}
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define EACH(t,i,c) for(t::iretator i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
const double EPS = 1e-10;
bool isLeft(char c) {
switch(c) {
case 'q':
case 'a':
case 'z':
case 'w':
case 's':
case 'x':
case 'e':
case 'd':
case 'c':
case 'r':
case 'f':
case 'v':
case 't':
case 'g':
case 'b':
return true;
default:
return false;
}
}
int main() {
string str;
while(cin >> str, str != "#") {
bool lastLeft;
int num = 0;
lastLeft = isLeft(str[0]);
FOR(i, 1, str.size()) {
if(lastLeft != isLeft(str[i])) {
num++;
}
lastLeft = isLeft(str[i]);
}
cout << num << endl;
}
} | #include<iostream>
#include<vector>
#include<string>
#include <queue>
#include<map>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include<set>
using namespace std;
#define _USE_MATH_DEFINES
# define M_PI 3.14159265358979323846
# define MOD 1000000007
#define ll long long int
#define pii pair<ll, ll>
#define pb push_back
#define MIN -9,223,372,036,854,775
#define N 100005
#define all(v) v.begin(),v.end()
void solve(){
ll i,j,k,n,ans=0,m,mx=0,my=0,a,b,x,y;
cin>>n>>m>>k;
set<pii> s;
unordered_map<ll, ll> tx,ty;
vector<ll> vx,vy;
for(i=0;i<k;i++){
cin>>a>>b;
s.insert({a,b});
tx[a]++;
ty[b]++;
if( tx[a]>mx ){
vx.clear();
mx=tx[a];
vx.push_back(a);
}
else if(tx[a]==mx){
vx.push_back(a);
}
if( ty[b]>my ){
my=ty[b];
vy.clear();
vy.push_back(b);
}
else if(ty[b]==my){
vy.push_back(b);
}
}
if(k<=2){
cout<<k;
return;
}
ans=mx+my;
ll f=0;
for(i=0;i<vx.size();i++){
for(j=0;j<vy.size();j++){
if( s.find({vx[i], vy[j]}) == s.end() ){
f=1;
break;
}
}
}
if( !f )
ans--;
cout<<ans;
}
int main() {
ll t=1;
while( t-- ){
solve();
cout<<"\n";
}
return 0;
} | 0 | 15,536,470 |
#include <bits/stdc++.h>
using namespace std;
int n;
string s,t;
int main()
{
scanf("%d",&n);
cin >> s >> t;
for(int i=n;i >= 0;i--)
if(s.substr(n-i) == t.substr(0,i))
{
printf("%d\n",2*n-i);
return 0;
}
} | #include <bits/stdc++.h>
#include <iostream>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep_r(i, n) for (int i = n - 1; i >= 0; i--)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((ll)(x).size())
#define bit(n) (1LL << (n))
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
#define INF bit(60)
#define pb push_back
#define mod 1000000007
using namespace std;
using uif = uint_fast64_t;
using ll = long long int;
using tTree = __gnu_pbds::tree<ll, __gnu_pbds::null_type, less<ll>, __gnu_pbds::rb_tree_tag, __gnu_pbds::tree_order_statistics_node_update>;
ll dx[4] = {1, 0, -1, 0};
ll dy[4] = {0, 1, 0, -1};
#define FACSIZE 200002
ll invfac[FACSIZE];
ll fac[FACSIZE];
template <class T>
bool chmax(T &, const T &);
template <class T>
bool chmin(T &, const T &);
ll gcd(ll, ll);
ll powLL(ll x, ll y);
ll mod_pow(ll, ll);
ll mod_add(ll, ll);
ll mod_mul(ll, ll);
ll mod_div(ll, ll);
ll comb(ll, ll);
void make_fact(ll);
void make_invfact(ll);
void fact_init();
string rev(string s, ll i, ll j)
{
string fir = s.substr(0, i);
string mid = s.substr(i, j - i + 1);
reverse(begin(mid), end(mid));
string las = s.substr(j + 1);
return fir + mid + las;
}
int main(void)
{
string A;
cin >> A;
ll n = A.size();
unordered_map<char, ll> um;
for (auto c : A)
{
um[c]++;
}
ll ans = n * (n - 1) / 2 + 1;
for (auto p : um)
{
ll x = p.second;
if (x > 1)
ans -= (x * (x - 1) / 2);
}
cout << ans << endl;
return 0;
}
ll mod_pow(ll x, ll r)
{
if (r == 0)
return 1;
else if (r == 1)
return x % mod;
else if (r % 2 == 0)
{
ll t = mod_pow(x, r / 2) % mod;
return mod_mul(t, t);
}
else
{
ll t = mod_pow(x, r / 2) % mod;
ll k = mod_mul(t, t);
return (k % mod) * (x % mod);
}
}
ll mod_add(ll a, ll b)
{
return ((a % mod) + (b % mod)) % mod;
}
ll mod_mul(ll a, ll b)
{
return ((a % mod) * (b % mod)) % mod;
}
ll mod_div(ll a, ll b)
{
return mod_mul(a, mod_pow(b, mod - 2));
}
void fact_init()
{
make_fact(FACSIZE - 1);
make_invfact(FACSIZE);
}
void make_fact(ll n)
{
fac[0] = 1;
rep(i, n)
{
fac[i + 1] = mod_mul(fac[i], i + 1);
}
}
void make_invfact(ll n)
{
invfac[n] = mod_pow(fac[n], mod - 2);
for (int i = n - 1; i >= 0; i--)
{
invfac[i] = mod_mul(invfac[i + 1], i + 1);
}
}
ll comb(ll n, ll r)
{
return mod_mul(mod_mul(fac[n], invfac[r]), invfac[n - r]);
}
template <class T>
bool chmax(T &a, const T &b)
{
if (a < b)
{
a = b;
return 1;
}
return 0;
}
template <class T>
bool chmin(T &a, const T &b)
{
if (b < a)
{
a = b;
return 1;
}
return 0;
}
ll qp(ll a, ll b)
{
ll ans = 1LL;
do
{
if (b & 1LL)
ans = 1LL * mod_mul(ans, a) % mod;
a = 1LL * mod_mul(a, a) % mod;
} while (b >>= 1LL);
return ans;
}
ll qp(ll a, ll b, ll mo)
{
ll ans = 1LL;
do
{
if (b & 1LL)
ans = 1LL * (ans % mo) * (a % mo);
a = 1LL * (a % mo) * (a % mo);
} while (b >>= 1LL);
return ans;
}
ll gcd(ll a, ll b)
{
return b ? gcd(b, a % b) : a;
}
ll powLL(ll x, ll y)
{
ll ans = 1LL;
for (ll i = 0LL; i < y; i++)
ans *= x;
return ans;
} | 0 | 16,421,866 |