code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 32
101M
|
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int main(void){
int h,w;
cin>>h>>w;
string c[h];
for (int i=0;i<h;i++){
cin>>c[i];
}
for (auto ci:c){
cout<<ci<<endl;
cout<<ci<<endl;
}
} | #include <bits/stdc++.h>
#define si(v) int(v.size())
#define all(v) v.begin(), v.end()
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep2(i, n, m) for (ll i = n; i <= (m); ++i)
#define rep3(i, n, m) for (ll i = n; i >= (m); --i)
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; }
using ll = long long;
using ld = long double;
using namespace std;
signed main()
{
cout << fixed << setprecision(20);
ios::sync_with_stdio(false);
cin.tie(0);
int h, w; cin >> h >> w;
char c[h][w];
rep(i, h) rep(j, w) cin >> c[i][j];
rep(i, h) {
rep(j, w) cout << c[i][j]; cout << '\n';
rep(j, w) cout << c[i][j]; cout << '\n';
}
return (0);
} | 1 | 15,810,127 |
#include<iostream>
using namespace std;
int main(){
int x, cnt;
int coin[6] = {500, 100, 50, 10, 5, 1};
while(cin >> x){
cnt = 0;
if(x == 0) break;
x = 1000 - x;
for(int i=0; i<6; i++){
cnt += x / coin[i];
x -= x / coin[i] * coin[i];
}
cout << cnt << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main(){
int a,b,c=0;
while(1){
cin>>a;
if(a==0){
break;
}else{
b=1000-a;
c=b/500;
c=c+b%500/100;
c=c+b%500%100/50;
c=c+b%500%100%50/10;
c=c+b%500%100%50%10/5;
c=c+b%500%100%50%10%5/1;
a=0;
}
cout<< c << endl;
}
return 0;
} | 1 | 25,100,460 |
#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>
#define _GLIBCXX_DEBUG
#define DIVISOR 1000000007
using namespace std;
typedef pair<int,int> pii;
typedef pair<int64_t, int64_t> pII;
template<typename T>
void cins(vector<T>& arr) { for(T& e: arr) cin >> e; }
#ifdef DEBUG
#define debug(fmt, ...) \
printf("[debug: %s] " fmt, __func__, __VA_ARGS__)
#define ps(arr) \
for(auto e: arr) cout << e << " "; \
cout << endl;
#else
#define debug(fmt, ...)
#define ps(arr)
#endif
int main(void) {
string str;
cin >> str;
int len = str.length();
str += '0';
vector<int> rle;
char prev = '<';
int cnt = 0;
for(int i = 0; i < len+1; i++) {
char cur = str[i];
if(cur == prev) {
cnt++;
} else {
rle.push_back(cnt);
cnt = 1;
}
prev = cur;
}
int size = rle.size();
rle.push_back(0);
ps(rle);
int64_t sum = 0;
for(int i = 0; i < size; i+=2) {
int mmax = max(rle[i], rle[i+1]);
sum += mmax;
if(rle[i]) {
int64_t left = rle[i]-1;
sum += (left+1) * left/2;
}
if(rle[i+1]) {
int64_t right = rle[i+1]-1;
sum += (right+1) * right/2;
}
}
cout << sum << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define int ll
#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
#ifdef LOCAL
#define dmp(x) cerr<<__LINE__<<" "<<#x<<" "<<x<<endl
#else
#define dmp(x) void(0)
#endif
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;}
template<class t> using vc=vector<t>;
template<class t> using vvc=vc<vc<t>>;
using pi=pair<int,int>;
using vi=vc<int>;
template<class t,class u>
ostream& operator<<(ostream& os,const pair<t,u>& p){
return os<<"{"<<p.a<<","<<p.b<<"}";
}
template<class t> ostream& operator<<(ostream& os,const vc<t>& v){
os<<"{";
for(auto e:v)os<<e<<",";
return os<<"}";
}
signed main(){
cin.tie(0);
ios::sync_with_stdio(0);
cout<<fixed<<setprecision(20);
string s;cin>>s;
int n=s.size()+1;
vi a(n);
rep(i,n-1)
if(s[i]=='<')
chmax(a[i+1],a[i]+1);
per(i,n-1)
if(s[i]=='>')
chmax(a[i],a[i+1]+1);
cout<<accumulate(all(a),int(0))<<endl;
} | 1 | 95,149,926 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,T;
cin >> N >> T ;
vector<int> t(N);
for(int i=0;i<N;i++) cin >> t.at(i);
int64_t ans=0;
for(int i=1;i<N;i++) ans+=min(T,t.at(i)-t.at(i-1));
ans+=T;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
template<typename T> void drop(const T &x){cout<<x<<'\n';exit(0);}
void solve() {
int n, T; cin >> n >> T;
int t, ans=0, x=0;
for(int i=0; i<n; ++i) {
cin >> t;
ans += t+T;
ans -= max(t,x);
x = t+T;
}
cout << ans << '\n';
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int T=1;
while(T--) solve();
return 0;
} | 1 | 64,621,403 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
#include<queue>
#include<chrono>
#include<iomanip>
#include<map>
#include<set>
#include<bitset>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using TP = tuple<ll,ll,ll>;
void init_io(){
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(18);
}
const ll MAX_B = 32;
signed main(){
init_io();
ll n,k,ans=0;
cin >> n >> k;
vector<ll> a(n),b(n);
vector<vector<ll>> dp(MAX_B,vector<ll>(2,0));
for(int i=0;i<n;i++){
cin >> a[i] >> b[i];
}
for(int i=0;i<n;i++){
if((a[i]|k) == k){
ans += b[i];
}
}
for(int r=0;r<MAX_B;r++){
ll tmp = 0,tk=0;
for(ll i=0;i<MAX_B;i++){
if(i<r){
tk += (1ll << i);
}else if(i==r){
if((k&(1ll << i))==0){
tk = 0;
break;
}
}else{
tk += ((1ll << i) & k);
}
}
for(int i=0;i<n;i++){
if((a[i]|tk) == tk){
tmp+=b[i];
}
}
ans = max(tmp,ans);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, j) for (int i = 0; i < j; i++)
#define all(obj) (obj).begin(), (obj).end()
#define rall(obj) (obj).rbegin(), (obj).rend()
typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.precision(10);
cout << fixed;
unsigned int n, k;
cin >> n >> k;
map<unsigned int, ll> m;
rep(i, 30) {
if (k & (1 << i)) {
unsigned int x = k - (1 << i);
m[x | ((1 << i) - 1)] = 0;
}
}
m[k] = 0;
rep(i, n) {
unsigned int a, b;
cin >> a >> b;
for(auto& p : m) {
if ((p.first & a) == a) {
p.second += b;
}
}
}
ll ans = 0;
for(auto& p: m) {
ans = max(ans, p.second);
}
cout << ans << endl;
return 0;
} | 1 | 17,322,601 |
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#include<algorithm>
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
ll gcd(ll a,ll b){
if(b == 0) return a;
return gcd(b , a % b);
}
const ll MOD = 1000000007;
const ll MAX = 2000001;
ll mod(ll a){
return a % MOD;
}
ll lcm(ll a,ll b){
return (a*b)/gcd(a,b);
}
ll fac[MAX], finv[MAX], inv[MAX];
void nCrprep() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll nCr(ll n, ll r){
if (n < r) return 0;
if (n < 0 || r < 0) return 0;
return fac[n] * (finv[r] * finv[n - r] % MOD) % MOD;
}
ll nCrcheep(ll n,ll r){
if(r == 0) return 1;
else if(r == 1) return n;
else return nCrcheep(n-1,r-1)*n/r;
}
vector<pair<ll,ll>> prime_factorize(ll n){
vector<pair<ll,ll>> res;
for(ll i=2; i*i <= n; i++){
if(n % i != 0) continue;
ll ex = 0;
while(n % i == 0){
ex++;
n /= i;
}
res.push_back({i,ex});
}
if(n != 1) res.push_back({n,1});
return res;
}
int main(){
ll n,m; cin >> n >> m; vector<bool> iscame(n+1,false);
vector<vector<ll>> connect(n+1); ll cnt = 1;
vl roomnum(n+1);
rep(i,m){
ll a,b; cin >> a >> b;
connect[a].push_back(b); connect[b].push_back(a);
}
queue<ll> q; q.push(1);
while(cnt <= n){
ll x = q.front();
q.pop();
for(ll room : connect[x]){
if(!iscame[room]){
cnt++;
iscame[room] = true;
roomnum[room] = x;
q.push(room);
}
}
}
cout << "Yes" << endl;
for(ll i=2; i <= n; i++){
cout << roomnum[i] << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
void fast() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
}
void ran() {
srand(chrono::steady_clock::now().time_since_epoch().count());
}
long long get_rand() {
long long a = rand();
long long b = rand();
return a * (RAND_MAX + 1ll) + b;
}
void usaco() {
freopen("problem.in", "r", stdin);
freopen("problem.out", "w", stdout);
}
const int MXN = 100005;
vector<int> adj[MXN];
int dist[MXN];
int par[MXN];
signed main() {
ran(); fast();
int n, m;
cin >> n >> m;
for (int i=0; i<m; i++) {
int a, b;
cin >> a >> b;
adj[a].push_back(b);
adj[b].push_back(a);
}
for (int i=0; i<MXN; i++) dist[i] = INT_MAX;
queue<pair<int, int>> proc;
proc.push({1, 0});
while (!proc.empty()) {
auto x = proc.front(); proc.pop();
int no = x.first, di = x.second;
if (dist[no] < di) continue;
dist[no] = di;
for (auto x: adj[no]) {
int ot = x;
if (dist[ot] > di + 1) {
dist[ot] = di + 1;
par[ot] = no;
proc.push({ot, di+1});
}
}
}
for (int i=1; i<=n; i++) {
if (dist[i] == INT_MAX) {
cout << "No" << endl;
exit(0);
}
}
cout << "Yes" << endl;
for (int i=2; i<=n; i++) {
cout << par[i] << endl;
}
} | 1 | 11,022,028 |
#include<cstdio>
#include<cstdlib>
using namespace std;
int x,now;
int main() {
scanf("%d",&x);
for(int ii=1;;++ii) {
now+=x;
if(now%360==0) {printf("%d",ii);break;}
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define pb push_back
#define f(i,n) for(int i=0; i<n; ++i)
#define fi(i,st,n) for(int i=st; i<=n; ++i)
#define veci vector<int>
#define vecp vector<pair<int,int> >
#define vecl vector<ll>
int prime[100000+10];
ll lcm(ll a, ll b) {
return a*b/__gcd(a,b);
}
ll power(ll a, ll n, ll mod) {
ll res = 1;
while(n > 0) {
if(n&1) {
res = (res*a)%mod;
}
a = (a*a)%mod;
n = n/2;
}
return res;
}
ll sum(int arr[], int n) {
ll res = 0;
f(i,n) {
res += arr[i];
}
return res;
}
void seive() {
prime[1] = 0;
for(int i=2; i<=100000; i++) {
prime[i] = 1;
}
for(ll i=2; i<=100000; i++) {
if(prime[i]) {
for(ll j=i*i; j<=100000; j+=i) {
prime[j] = 0;
}
}
}
}
void solve(ll &c, ll &x, ll &node, ll depth) {
while(x-depth >= c-1) {
cout<<node-1<<" "<<node<<"\n";
node++;
c--;
x -= depth;
depth++;
}
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t = 1;
while(t--){
int n;
cin>>n;
cout<<lcm(n,360)/n<<"\n";
}
return 0;
} | 1 | 2,005,960 |
#include <iostream>
using namespace std;
const int MAX_N = 100;
int N, A, B, C, X;
int Y[MAX_N];
void solve() {
int real = 0;
int r = X;
if (r == Y[real]) {
real++;
if (real == N) {
cout << 0 << endl;
return;
}
}
for (int frame = 1; frame <= 10000; frame++) {
r = (A * r + B) % C;
if (r == Y[real]) {
real++;
if (real == N) {
cout << frame << endl;
return;
}
}
}
cout << -1 << endl;
return;
}
int main() {
while (true) {
cin >> N >> A >> B >> C >> X;
if (N == 0) {
break;
}
for (int i = 0; i < N; i++) {
cin >> Y[i];
}
solve();
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define INF_LL (int64)1e18
#define INF (int32)1e9
#define REP(i, n) for(int i = 0;i < (n);i++)
#define FOR(i, a, b) for(int i = (a);i < (b);i++)
#define all(x) x.begin(),x.end()
#define fs first
#define sc second
using int32 = int_fast32_t;
using uint32 = uint_fast32_t;
using int64 = int_fast64_t;
using uint64 = uint_fast64_t;
using PII = pair<int32, int32>;
using PLL = pair<int64, int64>;
const double eps = 1e-6;
template<typename A, typename B>inline void chmin(A &a, B b){if(a > b) a = b;}
template<typename A, typename B>inline void chmax(A &a, B b){if(a < b) a = b;}
const int64 mod = 1e9+7;
int main(void){
int64 N, A, B, C, X;
while(cin >> N >> A >> B >> C >> X && (N || A || B || C || X)){
vector<int64> y(N);
REP(i, N) cin >> y[i];
int32 in = 0;
int32 cnt = 0;
while(in < N){
if(X == y[in]){
in++;
if(in == N) break;
}
X = (X*A+B)%C;
cnt++;
if(cnt > 10000) break;
}
if(cnt > 10000) cout << -1 << endl;
else cout << cnt << endl;
}
} | 1 | 88,200,724 |
#include<bits/stdc++.h>
#define __ ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
using namespace std;
int main()
{
__;
int n,k;
cin >> n >>k;
cout << (n-k)+1 ;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, m, n) for(int (i) = (m); (i) < (n); (i)++)
#define FORN(i, m, n) for(int (i) = (m); (i) <= (n); (i)++)
#define FORR(i, m, n) for(int (i) = (m); (i) >= (n); (i)--)
#define rep(i, n) FOR(i, 0, n)
#define repn(i, n) FORN(i, 1, n)
#define repr(i, n) FORR(i, n, 0)
#define repnr(i, n) FORR(i, n, 1)
#define co(n) cout << (n) << endl
#define cosp(n) cout << (n) << ' '
#define setp(n) cout << fixed << setprecision(n);
#define all(s) (s).begin(), (s).end()
#define pb push_back
#define mp make_pair
#define fs first
#define sc second
typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<ll> Vec;
const ll INF = 1e9+1;
const ll LINF = 1e18+1;
const ll MOD = 1e9+7;
const double PI = acos(-1);
const double EPS = 1e-9;
int main(void){
ll n, k;
cin >> n >> k;
co(n-k+1);
return 0;
} | 1 | 19,895,791 |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
int n;
while(cin >> n){
vector<int> v(n);
for(int i=0;i<n;i++) cin >> v[i];
for(int i=0;i<n;i++){
cout << "node " << i+1 << ": key = " << v[i] << ", ";
if(i != 0) cout << "parent key = " << v[(i+1)/2-1] << ", ";
if((i+1) * 2 <= n) cout << "left key = " << v[(i+1)*2-1] << ", ";
if((i+1) * 2 + 1 <= n) cout << "right key = " << v[(i+1)*2] << ", ";
cout << endl;
}
}
} | #include<iostream>
#include<cstdio>
using namespace std;
int parent(int num)
{
return num / 2;
}
int left(int num)
{
return num * 2;
}
int right(int num)
{
return num * 2 + 1;
}
int main()
{
int A[100000];
int N;
scanf("%d", &N);
for (int i = 1; i <= N; i++)
scanf("%d", &A[i]);
for (int i = 1; i <= N; i++) {
printf("node %d: key = %d, ", i, A[i]);
if (parent(i) > 0)printf("parent key = %d, ", A[parent(i)]);
if (left(i) <= N)printf("left key = %d, ", A[left(i)]);
if (right(i) <= N)printf("right key = %d, ", A[right(i)]);
printf("\n");
}
return 0;
} | 1 | 14,455,689 |
#include<bits/stdc++.h>
#define ll long long int
#define l(i,a,b) for(ll i=a;i<b;i++)
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if(a<=b){
l(i,0,b) cout<<a;
cout<<"\n";
}
else{
l(i,0,a) cout<<b;
cout<<"\n";
}
} | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define fi first
#define se second
#define em emplace
#define eb emplace_back
#define mp make_pair
#define pi pair<int,int>
#define vi vector<int>
#define vpi vector<pair<int,int>>
#define vll vector<ll>
#define vpll vector<pair<ll,ll>>
#define endl '\n'
#define si(v) int((v).size())
#define all(v) (v).begin(), (v).end()
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, n, m) for (ll i = n; i <= (ll)(m); ++i)
#define rep3(i, n, m) for (ll i = n; i >= (ll)(m); --i)
template<class T, class U> bool chmax(T &a, U b) { if (a < b) a = b; return true; }
template<class T, class U> bool chmin(T &a, U b) { if (a > b) a = b; return true; }
using ll = long long;
using ld = long double;
using namespace std;
constexpr ll MOD = 1000000007;
signed main()
{
cout << fixed << setprecision(20);
ios::sync_with_stdio(false);
cin.tie(0);
int a, b; cin >> a >> b;
string s, t;
rep(i, b) s += to_string(a);
rep(i, a) t += to_string(b);
cout << min(s, t) << endl;
return (0);
} | 1 | 81,322,465 |
#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define pb push_back
int mo[100005];
const int N=1000000007;
int binpow(int x, int y)
{
int res = 1;
x = x % N;
if (x == 0) return 0;
while (y > 0)
{
if (y & 1)
res = (res*x) % N;
y = y>>1;
x = (x*x) % N;
}
return res;
}
main() {
int n, k;
cin>>n>>k;
mo[1]=1;
for(int i=2; i<100005; i++){
int num=i;
vector<int>f;
for(int x=2; x*x<=num; x++){
while(num%x==0){
num=num/x;
f.pb(x);
}
}
if(num!=1){
f.pb(num);
}
bool b=0;
for(int j=0; j<f.size()-1; j++){
if(f[j]==f[j+1]){
b=1;
}
}
if(b==1){
mo[i]=0;
continue;
}
if(f.size()%2==0){
mo[i]=1;
continue;
}
mo[i]=-1;
}
int fin=0;
for(int i=1; i<=k; i++){
int num=(k/i);
int ans=0;
for(int j=1; j<=num; j++){
int nums=(num/j);
ans=(ans+mo[j]*binpow(nums, n)+N)%N;
}
fin=(fin+i*ans)%N;
}
cout<<fin;
return 0;
} | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <cstdlib>
#include <set>
#include <utility>
#include <climits>
#include <cstdio>
#include <cmath>
#include <queue>
#include <stack>
#define ll long long
#define ull unsigned long long
using namespace std;
const int mod = 1e9 + 7;
ll fexp(ll base, ll p) {
ll res = 1;
while (p) {
if (p & 1) res = res * base % mod;
base = base * base % mod;
p >>= 1;
}
return res;
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
ll cnt[k + 1]{};
cnt[k] = 1;
ll res = k;
for (int i = k - 1; i > 0; --i) {
cnt[i] = fexp(k / i, n);
for (int j = 2 * i; j <= k; j += i) {
cnt[i] -= cnt[j];
}
cnt[i] %= mod;
res += cnt[i] * i;
}
cout << (res % mod + mod) % mod;
} | 1 | 74,762,446 |
#include "iostream"
using namespace std;
int main()
{
int n;
cin>>n;
string s,t;
cin>>s>>t;
string result;
for(int i=0;i<n;i++)
{
result=result + s[i] +t[i];
}
cout<<result<<endl;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
typedef long long ll;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n;
cin >> n;
string s, t;
cin >> s >> t;
for(int i = 0; i < n; i++) {
cout << s[i] << t[i];
}
return 0;
} | 1 | 64,570,568 |
#include <bits/stdc++.h>
#define PI 3.1415926535897
using namespace std;
typedef long long ll;
const int INF = 1000000000;
const ll LINF = 1000000000000000000;
const double EPS = 1e-10;
int main(void)
{
int A, B, C;
cin >> A >> B >> C;
if (A == B)
{
cout << C << endl;
}
else if (B == C)
{
cout << A << endl;
}
else
{
cout << B << endl;
}
return (0);
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define ll long long
const ll mod = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1);
int main(void)
{
ll a,b,c;
cin>>a>>b>>c;
if(a==b) cout<<c<<endl;
else if(a==c) cout<<b<<endl;
else cout<<a<<endl;
return 0;
} | 1 | 67,115,367 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <string>
#include <set>
#include <cmath>
#include <map>
int main(int,char**){
int n;
char from,to;
char in;
while(std::cin >> n){
if(!n) break;
std::map<char,char> map;
while(n--){
std::cin >> from >> to;
map[from] = to;
}
std::cin >> n;
while(n--){
std::cin >> in;
if(map[in]) std::cout << map[in];
else std::cout << in;
}
std::cout << std::endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define for_(i,a,b) for(int i=a;i<b;++i)
#define for_rev(i,a,b) for(int i=a;i>=b;--i)
#define allof(a) a.begin(),a.end()
#define minit(a,b) memset(a,b,sizeof(a))
#define size_of(a) (int)a.size()
typedef long long lint;
typedef double Double;
typedef pair<int, int> pii;
typedef vector< int > Array;
typedef vector< Array > Matrix;
typedef vector< Double > DArray;
typedef vector< DArray > DMatrix;
typedef vector< string > SArray;
typedef vector< pii > PArray;
inline int POPCNT(int _x) { return __builtin_popcount(_x); }
inline int POPCNT(lint _x) { return __builtin_popcountll(_x); }
const int iINF = 1L << 30;
const lint lINF = 1LL << 60;
Double EPS = 1e-9;
inline bool in_range(int _v, int _mx, int _mi) { return _mi <= _v && _v < _mx; }
inline bool in_range(Double _v, Double _mi, Double _mx) { return -EPS < _v - _mi && _v - _mx < EPS; }
inline bool in_range(int _x, int _y, int _W, int _H) { return 0 <= _x && _x < _W && 0 <= _y && _y < _H; }
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};
inline void modAdd(int& _a, int _b, int _m) { _a = (_a + _b) % _m; }
inline void modAdd(lint& _a, lint _b, lint _m) { _a = (_a + _b) % _m; }
inline void minUpdate(int& _a, int _b) { _a = min(_a, _b); }
inline void minUpdate(lint& _a, lint _b) { _a = min(_a, _b); }
inline void maxUpdate(int& _a, int _b) { _a = max(_a, _b); }
inline void maxUpdate(lint& _a, lint _b) { _a = max(_a, _b); }
int n, m;
map< char, char > table;
void solve() {
for_(i,0,m) {
char c; cin >> c;
if (table.find(c) != table.end()) c = table[c];
cout << c;
}
cout << endl;
}
int main() {
while (cin >> n, n) {
table.clear();
for_(i,0,n) {
char a, b; cin >> a >> b;
table[a] = b;
}
cin >> m;
solve();
}
return 0;
} | 1 | 26,293,288 |
#ifdef LOCAL_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <iomanip>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <math.h>
#include <cmath>
#include <bitset>
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; }
const long long INF = 100100100100;
const long long MOD = 1000000007;
typedef pair<long long,long long> P;
long long mod_pow(long long N, long long M) {
if (M == 0) return 1;
long long res = mod_pow((N * N) % MOD, M / 2);
if (M & 1) res = (res * N) % MOD;
return res %= MOD;
}
long long nCr(long long n, long long r) {
long long A = 1, B = 1;
for (long long i = n - r + 1; i <= n; i++) {
A = A * i % MOD;
}
for (long long i = 1; i <= r; i++) {
B = B * i % MOD;
}
B = mod_pow(B, MOD - 2);
B %= MOD;
return (A * B) % MOD;
}
long long gcd(long long a, long long b) {
if (b == 0) return a;
else return gcd(b, a % b);
}
long long lcm(long long a, long long b) {
return a * b / gcd(a, b);
}
bool ok(long long key,long long index){
if(index > key) return true;
else if(index <= key) return false;
}
long long binary_search(long long key,long long size){
long long left = -1,right = size;
while(right - left > 1){
long long mid = left + (right-left)/2;
long long hantei = ok(key,mid);
if(hantei) right = mid;
else left = mid;
}
if(left == -1)return 0;
return left;
}
int main() {
string S;cin >> S;
for(int i = 0;i<5;i++){
cout << S.at(i);
}
cout << " ";
for(int i = 6;i<13;i++){
cout << S.at(i);
}
cout << " ";
for(int i = 14;i<19;i++) cout << S.at(i);
cout << endl;
} | #include<iostream>
#include<string>
int main(void) {
std::string str;
std::cin >> str;
str.at(5) = ' ';
str.at(13) = ' ';
std::cout << str << std::endl;
system("pause");
} | 1 | 4,430,534 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair<ll,ll> ii;
typedef vector<int> vi;
typedef long double ld;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
const long long mod = 1000000007;
const long long inf = 1e18;
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
int n,k;
cin>>n>>k;
vi a;
for(int i=0;i<n;i++){
ll p;
cin>>p;
a.pb(p);
}
sort(a.begin(),a.end());
a.pb(-1);
vi count;
int c=1;
int p=a[0];
for(int i=1;i<=n;i++){
if(a[i]==p){
c+=1;
}
else{
count.pb(c);
c=1;
p=a[i];
}
}
sort(count.begin(),count.end());
ll ans=0;
if(count.size()>k){
for(int i=0;i<count.size()-k;i++){
ans+=count[i];
}
}
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, k; cin >> n >> k;
const int p = 200010;
vector<int> num(p,0);
for (int i = 0; i < n; i++) {
int a; cin >> a;
num[a]++;
}
sort(num.begin(), num.end(), greater<int>());
int ans = 0;
for (int i = k; i < p; i++) {
if (num[i] == 0) break;
ans += num[i];
}
cout << ans << endl;
return 0;
} | 1 | 42,723,202 |
#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)n;++i)
#define each(a, b) for(auto (a): (b))
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
#define pb push_back
#define show(x) cout <<#x<<" = "<<(x)<<endl
#define spair(p) cout <<#p<<": "<<p.fi<<" "<<p.se<<endl
#define svec(v) cout<<#v<<":";rep(kbrni,v.size())cout<<" "<<v[kbrni];cout<<endl
#define sset(s) cout<<#s<<":";each(kbrni,s)cout <<" "<<kbrni;cout<<endl
using namespace std;
typedef pair<int,int>P;
const int MAX_N = 100005;
vector<int> G[MAX_N];
bool flag[MAX_N];
int dfs(int u)
{
flag[u] = true;
int ans = 0;
rep(i,G[u].size()){
if(!flag[G[u][i]]){
ans ^= (dfs(G[u][i]) + 1);
}
}
return ans;
}
int main()
{
int n;
cin >> n;
rep(i,n-1){
int a,b;
cin >> a >> b;
G[a-1].pb(b-1);
G[b-1].pb(a-1);
}
rep(i,n){
flag[i] = false;;
}
int res = dfs(0);
if(res){
cout << "Alice\n";
}else{
cout << "Bob\n";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int , int> P2;
typedef pair<pair<int , int> , int> P3;
typedef pair<pair<int , int> , pair<int , int> > P4;
#define PB(a) push_back(a)
#define MP(a , b) make_pair((a) , (b))
#define M3P(a , b , c) make_pair(make_pair((a) , (b)) , (c))
#define M4P(a , b , c , d) make_pair(make_pair((a) , (b)) , make_pair((c) , (d)))
#define repp(i,a,b) for(int i = (int)(a) ; i < (int)(b) ; ++i)
#define repm(i,a,b) for(int i = (int)(a) ; i > (int)(b) ; --i)
const int MC = 100010;
int N;
vector<int> V[MC];
int dfs(int p , int q){
int g = 0;
for(auto u : V[q]){
if(u == p) continue;
g ^= dfs(q,u)+1;
}
return g;
}
int main(){
cin >> N;
repp(i,1,N){
int x,y;
cin >> x >> y;
V[x].PB(y);
V[y].PB(x);
}
cout << (dfs(-1,1)?"Alice":"Bob") << endl;
return 0;
} | 1 | 71,928,279 |
#include <bits/stdc++.h>
#define REP(i, n) for(ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for(ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF (1ll << 60)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
using vl = vector<ll>;
using vvl = vector<vl>;
typedef double db;
typedef string str;
typedef pair<ll, ll> p;
constexpr int MOD = 1000000007;
using ll = long long;
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;
}
void print(const std::vector<ll> &v) {
std::for_each(v.begin(), v.end(), [](ll x) { std::cout << x << " "; });
std::cout << std::endl;
}
int main() {
int N, M;
cin >> N >> M;
vector<int> a(M), b(M);
map<int, int> cnt;
REP(i, M) {
cin >> a[i] >> b[i];
a[i]--;
b[i]--;
cnt[a[i]]++;
cnt[b[i]]++;
}
for(auto tmp : cnt) {
if(tmp.second % 2 == 1) {
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
int main() {
int n, m;
cin >> n >> m;
vi G(n);
rep(i, m) {
int a, b;
cin >> a >> b;
--a;
--b;
G[a]++;
G[b]++;
}
rep(i, n) {
if(G[i]&1) {
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
} | 1 | 52,778,078 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for (int i = 0; i< (n); ++i)
const long long INF = 1LL<<58;
template<class T> void chmin(T &a, T b){ if(a>b) a = b; }
template<class T> int former(const vector<T> &v, T x){
return upper_bound(v.begin(), v.end(), x) - v.begin() -1;
}
template<class T> int latter(const vector<T> &v, T x){
return lower_bound(v.begin(), v.end(), x) - v.begin();
}
int main() {
char b;
cin >> b;
map<char,char> change;
change['A'] = 'T';
change['T'] = 'A';
change['C'] = 'G';
change['G'] = 'C';
cout << change[b] << endl;
} | #include<bits/stdc++.h>
#define ll long long int
using namespace std;
int main()
{
ll n,i,j,t;
char ch;
cin>>ch;
if(ch=='A')
cout<<"T\n";
if(ch=='T')
cout<<"A\n";
if(ch=='C')
cout<<"G\n";
if(ch=='G')
cout<<"C\n";
return 0;
} | 1 | 81,116,477 |
#include <bits/stdc++.h>
using namespace std;
long long x, y;
signed main () {
scanf("%lld %lld", &x, &y);
if (abs(x - y) > 1)
printf("Alice\n");
else
printf("Brown\n");
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define MOD 1000000007
#define ADD(X,Y) ((X) = ((X) + (Y)%MOD) % MOD)
typedef long long i64; typedef vector<int> ivec; typedef vector<string> svec; typedef pair<int, int> pi;
int dd[] = { 0, 1, 0, -1, 0 };
#define all(u) begin(u),end(u)
#define mp make_pair
#define pb push_back
int main()
{
i64 x, y;
cin >> x >> y;
cout << (abs(x - y) >= 2 ? "Alice" : "Brown") << endl;
return 0;
if(x >=3 || y >= 3)
{
cout << "Alice" << endl;
return 0;
}
bool b = false;
while(x > 1 || y > 1)
{
if(x > 1)
{
x -= 2;
y += 1;
}
else
{
y -= 2;
x += 1;
}
b = !b;
}
cout << (b ? "Alice" : "Brown") << endl;
return 0;
} | 1 | 21,886,190 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef long double ld;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define sz(x) ((int)(x).size())
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define INF 1000000000
#define MOD 1000000007
void solve() {
ll n,a,b;
cin >> n >> a >> b;
ll ans = n/(a+b)*a;
if (n % (a+b)) ans += min(a, n%(a+b));
cout <<ans << "\n";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t = 1;
while (t--)
solve();
return 0;
} | #include <iostream>
int main() {
using namespace std;
long long n, a, b;
cin >> n >> a >> b;
long long sets, imp;
sets = n / (a + b);
imp = n % (a + b);
if (imp <= a){
cout << (sets * a) + imp;
} else {
cout << (( sets + 1) * a);
}
} | 1 | 31,249,739 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
struct Eng {
Eng(const double th_, const int x_, const int y_) : th(th_), x(x_), y(y_) {}
double th;
int x, y;
};
int main() {
int N;
std::cin >> N;
std::vector<Eng> engs;
for (int i = 0; i < N; i++) {
int x, y;
std::cin >> x >> y;
engs.push_back(Eng(atan2(y, x), x, y));
}
std::sort(engs.begin(), engs.end(),
[](const Eng &a, const Eng &b) -> bool { return a.th < b.th; });
double max = 0;
for (int i = 0; i < N; i++) {
long xsum = engs[i].x, ysum = engs[i].y;
double pre = xsum * xsum + ysum * ysum;
if (pre > max) max = pre;
for (int j = 1; j < N; j++) {
int k = i + j < N ? i + j : i + j - N;
xsum += engs[k].x;
ysum += engs[k].y;
double tmp = xsum * xsum + ysum * ysum;
if (tmp > max) max = tmp;
pre = tmp;
}
}
printf("%0.12f\n", sqrt(max));
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (lli i = 0; i < (n); i++)
#define rrep(i, n) for (lli i = (n)-1; i >= 0; i--)
#define vall(x) (x).begin(), (x).end()
using namespace std;
using lli = long long int;
void YESNO(bool), YesNo(bool);
template <class T1, class T2>
bool chmin(T1 &l, const T2 &r);
template <class T1, class T2>
bool chmax(T1 &l, const T2 &r);
template <class T1, class T2>
void vadd(vector<T1> &v, T2 x);
#define int long long int
void solve(long long N, const std::vector<long long> x, const std::vector<long long> y)
{
vector<int> idx;
rep(i, N) if (x[i] != 0 || y[i] != 0) idx.push_back(i);
sort(vall(idx), [&](int l, int r) -> bool {
return atan2(y[l], x[l]) < atan2(y[r], x[r]);
});
double ans = 0;
rep(i, 2 * idx.size()) rep(j, i + 1)
{
lli X = 0, Y = 0;
if (i - j + 1 <= idx.size())
{
for (int k = j; k <= i; k++)
{
X += x[idx[k % idx.size()]];
Y += y[idx[k % idx.size()]];
}
chmax(ans, sqrt(X * X + Y * Y));
}
}
printf("%.10f", ans);
}
signed main()
{
long long N;
scanf("%lld", &N);
std::vector<long long> x(N);
std::vector<long long> y(N);
for (int i = 0; i < N; i++)
{
scanf("%lld", &x[i]);
scanf("%lld", &y[i]);
}
solve(N, std::move(x), std::move(y));
return 0;
}
void YESNO(bool b) { cout << (b ? "YES" : "NO") << endl; }
void YesNo(bool b) { cout << (b ? "Yes" : "No") << endl; }
template <class T1, class T2>
bool chmin(T1 &l, const T2 &r)
{
return (l > r) ? (l = r, true) : false;
}
template <class T1, class T2>
bool chmax(T1 &l, const T2 &r)
{
return (l < r) ? (l = r, true) : false;
}
template <class T1, class T2>
void vadd(vector<T1> &v, T2 x)
{
for (auto &s : v)
s += T2(x);
} | 1 | 72,231,010 |
#include <iostream>
#include <algorithm>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <unordered_map>
#include <numeric>
#include <functional>
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(ll i=ll(a);i<ll(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
#define PRINT(V) cout << V << "\n"
#define SORT(V) sort((V).begin(),(V).end())
#define RSORT(V) sort((V).rbegin(), (V).rend())
using namespace std;
using ll = long long;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
inline void Yes(bool condition){ if(condition) PRINT("Yes"); else PRINT("No"); }
template<class itr> void cins(itr first,itr last){
for (auto i = first;i != last;i++){
cin >> (*i);
}
}
template<class itr> void array_output(itr start,itr goal){
string ans = "",k = " ";
for (auto i = start;i != goal;i++) ans += to_string(*i)+k;
if (!ans.empty()) ans.pop_back();
PRINT(ans);
}
ll gcd(ll a, ll b) {
return a ? gcd(b%a,a) : b;
}
const ll INF = 1e18;
const ll MOD = 1000000007;
typedef pair<ll,ll> P;
const ll MAX = 100010;
constexpr ll nx[8] = {1,0,-1,0,-1,-1,1,1};
constexpr ll ny[8] = {0,1,0,-1,-1,1,-1,1};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll n,k,s;
cin >> n >> k >> s;
vector<ll> ans;
rep(i,k) ans.push_back(s);
if (s == 1e9){
rep(i,n-k) ans.push_back(1);
}
else{
rep(i,n-k) ans.push_back(1e9);
}
array_output(all(ans));
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<pair<int,int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
#define PUB push_back
#define PO pop
#define POF pop_front
#define POB pop_back
#define REP(i,a,b) for(int i=a; i<=b; i++)
#define MOD 1000000007
void solve(int test_case) {
int n,k,s;
cin>>n>>k>>s;
while(n--) {
if(k>0)cout<<s<<" ",--k;
else if(s!=1000000000)cout<<s+1<<" ";
else cout<<s-1<<" ";
}
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int t=1;
REP(i,1,t) {
solve(i);
}
return 0;
} | 1 | 76,573,408 |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main(void){
int N,M;
cin >> N >> M;
string A[N],B[M];
for(int i=0;i<N;i++){
cin >> A[i];
}
for(int i=0;i<M;i++){
cin >> B[i];
}
for(int H=0;H+M-1<N;H++){
for(int W=0;W+M-1<N;W++){
bool OK = true;
for(int i=0;i<M;i++){
if(!OK)break;
for(int j=0;j<M;j++){
if(B[i][j] != A[H+i][W+j]){
OK = false;
break;
}
}
}
if(OK){
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MM = 1000000000;
const int MOD = MM + 7;
const int MAX = 510000;
#define rep(i, n) for(ll i=0; i<n; i++)
#define Rep(i, j, n) for(ll i=j; i<n; i++)
#define all(vec) vec.begin(), vec.end()
template<class T> inline bool chmin(T& a, T b) {if(a > b) {a = b; return true;} return false;}
template<class T> inline bool chmax(T& a, T b) {if(a < b) {a = b; return true;} return false;}
const ll INF = 1LL << 60;
const double pi = acos(-1.0);
int main() {
int n, m; cin >> n >> m;
vector<vector<char>> a(n, vector<char>(n));
vector<vector<char>> b(m, vector<char>(m));
rep(i, n) {
string s; cin >> s;
rep(j, n) a[i][j] = s[j];
}
rep(i, m) {
string s; cin >> s;
rep(j, m) b[i][j] = s[j];
}
rep(i, n-m+1) {
rep(j, n-m+1) {
bool fl = true;
rep(k, m) {
rep(l, m) {
if(a[i+k][j+l] != b[k][l]) fl = false;
}
}
if(fl) {
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No" << endl;
} | 1 | 31,073,198 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
int h,w;
cin >> h >> w;
cout << (h-1)*(w-1) << endl;
} | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
using P = pair<int, int>;
using vec = vector<int>;
using mat = vector<vector<int>>;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
constexpr int MOD = 1000000007;
const int INF = 1 << 30;
int main() {
int a, b;
cin >> a >> b;
cout << a * b - a - b + 1 << endl;
return 0;
} | 1 | 33,171,061 |
#include <bits/stdc++.h>
#define String std::string
#define fi first
#define se second
#define mp std::make_pair
#define Pair std::pair<int, int>
#define Map std::map< int, int >
#define Vector std::vector<int>
using std::cin;
using std::cout;
using std::endl;
typedef long long ll;
typedef unsigned long long ull;
const int N = 100000 + 5;
const int M = 1000 + 5;
const int K = 1e7 + 5;
const int MOD = 1e9 + 7;
const int inv2 = 500000004;
const int LOG = 40;
const ull BASE = 19260817;
const int dx[] = { 0, 1, -1, 0, 1, -1, 1, -1 };
const int dy[] = { 1, 0, 0, -1, 1, -1, -1, 1 };
const double PI = acos(-1);
template<class T>
inline T readT() {
T res = 0, f = 1;
char ch = getchar();
for (; !isdigit(ch); ch = getchar()) if (ch == '-') f = -1;
for (; isdigit(ch); ch = getchar()) res = (res << 1) + (res << 3) + ch - '0';
return res * f;
}
#define read readT<int>
int n, m, ps[N];
ll ans;
Map map;
int main() {
cin >> n >> m;
map[0] = 1;
for (int i = 1; i <= n; i++) {
scanf("%d", &ps[i]);
(ps[i] += ps[i - 1]) %= m;
ans += map[ps[i]];
map[ps[i]]++;
}
printf("%lld\n", ans);
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define pq priority_queue
using namespace std;
const ll INF=(ll)1e9;
const ll MOD=(ll)1e9+7;
const ll MAX=510000;
vector<int> dx={1,0,-1,0},dy={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(){
ll N,M,ans=0;
cin>>N>>M;
ll A[N+1];
A[0]=0;
for(ll i=1;i<=N;i++){
cin>>A[i];
A[i]+=A[i-1];
}
map<ll,ll> m;
for(ll i=0;i<=N;i++){
A[i]%=M;
m[A[i]]++;
}
for(auto a:m) ans+=a.second*(a.second-1)/2;
cout<<ans<<endl;
} | 1 | 90,500,989 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define fi first
#define se second
const ll mod = 1e9+7;
const int N = 2e6+6;
void solve(){
int n;
cin>>n;
vector<int>v(n);
int a,b;
cin>>a>>b;
for(int i=0;i<n;i++)cin>>v[i];
int c[3]={};
for(int i=0;i<n;i++){
if(v[i]<=a)c[0]++;
else if(v[i]<=b)c[1]++;
else c[2]++;
}
cout<<min({c[0],c[1],c[2]})<<endl;
}
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int t=1;
while(t--){
solve();
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#define all(x) (x).begin(), (x).end()
#define endl '\n'
#define fsp(x) cout << fixed << setprecision(x)
const ll inf = LLONG_MAX;
const long double pi = M_PI;
void Yes() {cout << "Yes" << endl;}
void No() {cout << "No" << endl;}
void YES() {cout << "YES" << endl;}
void NO() {cout << "NO" << endl;}
int main() {
ll n, a, b;
cin >> n >> a >> b;
vll p(n);
ll x = 0, y = 0, z = 0;
for (ll i = 0; i < n; i++) {
cin >> p[i];
if (p[i] <= a) x++;
else if (p[i] <= b) y++;
else z++;
}
cout << min({x, y, z}) << endl;
} | 1 | 40,458,779 |
#include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <string>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
using ull= unsigned long long;
int dx[4]={1,-1,0,0};
int dy[4]={0,0,1,-1};
const int INF=1e9;
int h,w,stat;
string str;
int main(){
cin >>h>>w;
vector<vector<bool>> s(h,vector<bool>(w));
rep(r,h){
cin>>str;
rep(c,w){
if(str[c]=='#') s[r][c]=false;
else s[r][c]=true;
}
}
vector<vector<int>> dp(h,vector<int>(w));
rep(i,h)rep(j,w) dp[i][j]=INF;
if(s[0][0]) dp[0][0]=0;
else dp[0][0]=1;
for(int i=1; i<=h+w-1;i++){
int j_st=max(i-w+1,0);
int j_end=min(h-1,i);
for(int j=j_st; j<=j_end;j++){
int k=i-j;
if(j>=1){
if(s[j][k]^s[j-1][k]){
dp[j][k]=min(dp[j][k],dp[j-1][k]+1);
}else{
dp[j][k]=min(dp[j][k],dp[j-1][k]);
}
}
if(k>=1){
if(s[j][k]^s[j][k-1]){
dp[j][k]=min(dp[j][k],dp[j][k-1]+1);
}else{
dp[j][k]=min(dp[j][k],dp[j][k-1]);
}
}
}
}
int ans=(dp[h-1][w-1]+1)/2;
cout<<ans<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 1e16+7;
int mod = 1e9+7;
int dx[4] = {1,-1, 0, 0};
int dy[4] = {0, 0, 1,-1};
int dp[105][105][2];
signed main() {
int H,W;
cin >> H >> W;
vector<string>S(H);
for(int i = 0; i < H; i++) {
cin >> S[i];
}
for(int i = 0; i < 105; i++) {
for(int j = 0; j < 105; j++) {
for(int k = 0; k < 2; k++) {
dp[i][j][k] = INF;
}
}
}
if(S[0][0] == '#') {
dp[0][0][1] = 1;
}
else {
dp[0][0][0] = 0;
}
for(int i = 0; i < H; i++) {
for(int j = 0; j < W; j++) {
if(dp[i][j][0] != INF) {
if(i+1 < H) {
if(S[i+1][j] == '#') dp[i+1][j][1] = min(dp[i+1][j][1],dp[i][j][0]+1);
else dp[i+1][j][0] = min(dp[i+1][j][0],dp[i][j][0]);
}
if(j+1 < W) {
if(S[i][j+1] == '#') dp[i][j+1][1] = min(dp[i][j+1][1],dp[i][j][0]+1);
else dp[i][j+1][0] = min(dp[i][j+1][0],dp[i][j][0]);
}
}
if(dp[i][j][1] != INF) {
if(i+1 < H) {
if(S[i+1][j] == '#') dp[i+1][j][1] = min(dp[i+1][j][1],dp[i][j][1]);
else dp[i+1][j][0] = min(dp[i+1][j][0],dp[i][j][1]);
}
if(j+1 < W) {
if(S[i][j+1] == '#') dp[i][j+1][1] = min(dp[i][j+1][1],dp[i][j][1]);
else dp[i][j+1][0] = min(dp[i][j+1][0],dp[i][j][1]);
}
}
}
}
cout << min(dp[H-1][W-1][0],dp[H-1][W-1][1]) << endl;
} | 1 | 50,089,411 |
#include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
int N;
cin>>N;
vector<long long> L(87);
L[0]=2;
L[1]=1;
for(int i=2;i<87;i++){
L[i]=L[i-1]+L[i-2];
}
cout<<L[N]<<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N; cin >> N;
long long Li=1,Li1=1,Li2=2;
for(int i=2; i<N+1; i++){
Li=Li1+Li2;
Li2=Li1;
Li1=Li;
}
cout << Li << endl;
} | 1 | 13,181,667 |
#include <cstdio>
#include <memory.h>
#include <algorithm>
using namespace std;
typedef long long ll;
ll bulb[300010];
ll bkt[300010];
ll operate(int n) {
memset(bkt, 0, sizeof bkt);
for (int i = 0; i < n; ++i) {
ll op1 = i - bulb[i];
ll op2 = i + bulb[i];
if (op1 < 0) op1 = 0;
++bkt[op1];
if (op2 >= n) op2 = n - 1;
--bkt[op2 + 1];
}
bulb[0] = bkt[0];
for (int i = 1; i < n; ++i)
bulb[i] = bulb[i - 1] + bkt[i];
return *min_element(bulb, bulb + n);
}
int main() {
int n, k, i;
scanf("%d%d", &n, &k);
for (i = 0; i < n; ++i)
scanf("%lld", bulb + i);
for (i = 0; i < k; ++i)
if (operate(n) >= n)
break;
for (int i = 0; i < n; ++i)
printf("%lld%c", bulb[i], " \n"[i == n - 1]);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int n, k;
cin >> n >> k;
vector<int> a(n+1);
for(int i=0; i<n; i++){
cin >> a[i];
}
int times = 0;
bool flag = true;
while(flag == true && times < k){
vector<int> a_new(n+1);
flag = false;
times += 1;
for(int i=0; i<n; i++){
int l = max(0, i-a[i]);
int r = min(n-1,i+a[i]);
a_new[l] += 1;
a_new[r+1] -= 1;
}
for(int i=0; i<n; i++){
a_new[i+1] += a_new[i];
}
for(int i=0; i<n; i++){
if(a_new[i] != a[i]) flag = true;
}
a = a_new;
}
for(int i=0; i<n; i++){
cout << a[i];
if(i == n-1) break;
cout << " ";
}
cout << endl;
return 0;
} | 1 | 88,654,533 |
#include <iostream>
#include <vector>
#define MAX_N 100000
#define pb push_back
using namespace std;
int par[MAX_N];
void init(int n){
for(int i=0;i<n;i++){
par[i]=i;
}
}
int root(int x){
if(par[x]==x){
return x;
}
else{
return par[x]=root(par[x]);
}
}
bool same(int x,int y){
return root(x)==root(y);
}
void unite(int x,int y){
x=root(x);
y=root(y);
if(x==y)return;
par[x]=y;
}
int main(){
int n,q;
int a,b,c;
cin>>n>>q;
init(n);
while(q--){
cin>>a>>b>>c;
if(a==0){
unite(b,c);
}
else{
cout<<same(b,c)<<endl;
}
}
} | #include <bits/stdc++.h>
#define rep(i,a,n) for(int i=a; i<n; i++)
using namespace std;
const int S = 10010;
int uf[S];
int find(int a) {
if(a == uf[a]) return a;
return find(uf[a]);
}
void unite(int a, int b) {
int fa = find(a), fb = find(b);
if(fa == fb) return;
uf[fa] = uf[fb];
}
int main() {
rep(i,0,S) uf[i] = i;
int n, q; cin >> n >> q;
rep(i,0,q) {
int c, x, y; cin >> c >> x >> y;
if(c == 0) unite(x, y);
else if(c == 1) cout << (find(x) == find(y)) << endl;
}
return 0;
} | 1 | 92,290,618 |
#include <bits/stdc++.h>
#define int long long
#define N 100010
using namespace std;
const int INF = 1LL<<55;
const int mod = (1e9)+7;
const double EPS = 1e-8;
const double PI = 6.0 * asin(0.5);
template<class T> T Max(T &a,T b){return a=max(a,b);}
template<class T> T Min(T &a,T b){return a=min(a,b);}
vector<int> G[N];
int num[N];
int can(int pos,int par){
int sum = 0,mx = 0;
for(int to:G[pos]) if(to!=par) sum += num[to],Max(mx,num[to]);
int mxpair = sum-mx < mx? (sum-mx): sum/2;
if(sum < num[pos]) return 0;
int target = sum - num[pos];
if(mxpair < target) return 0;
num[pos] = num[pos] - target;
return 1;
}
int check(int pos,int par){
if(par != -1 && G[pos].size() == 1) return 1;
int res = 1;
for(int to:G[pos]) if(to != par)res &= check(to,pos);
res &= can(pos,par);
return res;
}
signed main(){
int n;
cin>>n;
for(int i=0;i<n;i++) cin>>num[i];
for(int i=0,a,b;i<n-1;i++){
cin>>a>>b; a--,b--;
G[a].push_back(b);
G[b].push_back(a);
}
int root = 0;
for(int i=0;i<n;i++) if(G[i].size() == 1) root = i;
int ans = check(root,-1);
cout<<(ans? "YES":"NO")<<endl;
return 0;
} | #include<bits/stdc++.h>
#define ll long long
#define inf 1000000005
#define put putchar('\n')
#define F(i,a,b) for (int i=(a);i<=(b);i++)
#define D(i,a,b) for (int i=(a);i>=(b);i--)
#define go(i,t) for (int i=head[t];i;i=Next[i])
#define sqr(x) ((x)*(x))
#define re register
#define mp make_pair
#define fi first
#define se second
#define pa pair<int,int>
#define pb push_back
#define be begin()
#define en end()
#define mod 1000000007
#define N 500055
using namespace std;
inline char gc(){
static char buf[100000],*p1=buf,*p2=buf;
return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
}
#define gc getchar
inline int read(){char c=getchar();int tot=1;while ((c<'0'|| c>'9')&&c!='-') c=getchar();if (c=='-'){tot=-1;c=getchar();}
int sum=0;while (c>='0'&&c<='9'){sum=sum*10+c-'0';c=getchar();}return sum*tot;}
inline void wr(int x){if (x<0) {putchar('-');wr(-x);return;}if(x>=10)wr(x/10);putchar(x%10+'0');}
inline void wrn(int x){wr(x);put;}inline void wri(int x){wr(x);putchar(' ');}
inline void wrn(int x,int y){wri(x);wrn(y);}inline void wrn(int a,int b,int c){wri(a);wrn(b,c);}
int n,m,a[N],f[N],fa[N];
int nedge,Next[N*2],head[N],to[N*2],in1[N];
#define V to[i]
void add(int a,int b){
Next[++nedge]=head[a];head[a]=nedge;to[nedge]=b;
}
void add_ne(int a,int b){add(a,b);add(b,a);in1[a]++;in1[b]++;}
void ret(){puts("NO");exit(0);}
void dfs(int x){
f[x]=a[x];
int sum=0,ma=-1;
go(i,x){
if (V==fa[x]) continue;
fa[V]=x;dfs(V);sum+=f[V];ma=max(ma,f[V]);
}
if (ma==-1) return;
if (sum<a[x]) ret();
if (sum>a[x]*2) ret();
f[x]=a[x]-(sum-a[x]);
if (sum-a[x]>sum-ma) ret();
if (fa[x]==-1&&a[x]*2!=sum) ret();
}
signed main(){
n=read();F(i,1,n) a[i]=read();
F(i,1,n-1) add_ne(read(),read());
if (n==2){
if (a[1]==a[2]) puts("YES");
else puts("NO");
return 0;
}
F(i,1,n){
if (in1[i]>=2){
fa[i]=-1;dfs(i);break;
}
}
puts("YES");
return 0;
} | 1 | 77,955,918 |
#include<bits/stdc++.h>
using namespace std;
int main() {
vector<int> n(4);
for(int i=0;i<4;i++) {
cin >> n.at(i);
}
sort(n.begin(), n.end());
vector<int> ans={1,4,7,9};
bool flag=true;
for(int i=0;i<4;i++) {
if(ans.at(i)!=n.at(i)) {
flag=false;
break;
}
}
if(flag) {
cout << "YES" << endl;
}
else {
cout << "NO" << endl;
}
} | #include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef long double ld;
const int inf=1e9+7;
const ll INF=1LL<<60 ;
const ll mod=1e9+7 ;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<int, int> P;
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(),c.end()
#define pb push_back
#define debug(x) cout << #x << " = " << (x) << endl;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
void solve() {
vector<int> n(4);
rep(i, 4) {
cin >> n[i];
}
sort(all(n));
if(n[0] == 1 && n[1] == 4 && n[2] == 7 && n[3] == 9) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
solve();
return 0;
} | 1 | 13,935,803 |
#include<iostream>
#include<cmath>
using namespace std;
double p1[2]={0.0,0.0},p2[2]={100.0,0.0};
#define A 1.0471975511965
void koch(int d,double p1[],double p2[]){
if(d==0){return;}
double p3[2],p4[2],p5[2];
p3[0]=p1[0]+(p2[0]-p1[0])*1.0/3.0;
p3[1]=p1[1]+(p2[1]-p1[1])*1.0/3.0;
p5[0]=p1[0]+(p2[0]-p1[0])*2.0/3.0;
p5[1]=p1[1]+(p2[1]-p1[1])*2.0/3.0;
p4[0]=(p5[0]-p3[0])*cos(A)-(p5[1]-p3[1])*sin(A)+p3[0];
p4[1]=(p5[0]-p3[0])*sin(A)+(p5[1]-p3[1])*cos(A)+p3[1];
koch(d-1,p1,p3);
cout<<p3[0]<<' '<<p3[1]<<endl;
koch(d-1,p3,p4);
cout<<p4[0]<<' '<<p4[1]<<endl;
koch(d-1,p4,p5);
cout<<p5[0]<<' '<<p5[1]<<endl;
koch(d-1,p5,p2);
}
int main(){
int n;
cin>>n;
cout<<p1[0]<<' '<<p1[1]<<endl;
koch(n,p1,p2);
cout<<p2[0]<<' '<<p2[1]<<endl;
return 0;
} | #include<bits/stdc++.h>
#include<math.h>
using namespace std;
const double rasian = M_PI*60.0/180.0;
typedef struct
{
double x;
double y;
}K;
void print(K plot)
{
printf("%lf %lf\n",plot.x,plot.y);
}
void KochCurve(int n, K p1, K p2)
{
if(n == 0) return;
K s,t,u;
s.x = (2.0*p1.x+1.0*p2.x)/3.0;
s.y = (2.0*p1.y+1.0*p2.y)/3.0;
t.x = (1.0*p1.x+2.0*p2.x)/3.0;
t.y = (1.0*p1.y+2.0*p2.y)/3.0;
u.x = (t.x-s.x)*cos(rasian)-(t.y-s.y)*sin(rasian)+s.x;
u.y = (t.x-s.x)*sin(rasian)+(t.y-s.y)*cos(rasian)+s.y;
KochCurve(n-1, p1, s);
print(s);
KochCurve(n-1, s, u);
print(u);
KochCurve(n-1, u, t);
print(t);
KochCurve(n-1, t, p2);
}
int main()
{
int n;
cin >> n;
K plot1={0,0};
K plot2={100,0};
print(plot1);
KochCurve(n,plot1,plot2);
print(plot2);
return 0;
} | 1 | 79,411,175 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define bit(n) (1<<(n))
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<bool> vb;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template < typename T > string tost( const T& n ) { ostringstream stm; stm << n; return stm.str();}
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 const INF = 1001001001;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int a,b,c,d;
cin >> a >> b >> c >> d;
chmin(a, b); chmin(c, d);
cout << a + c << endl;
return 0;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define pcnt(bit) __builtin_popcountll(bit)
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 mod = 1000000007;
const long double pi = acos(-1.0);
const int inf = 1LL << 60;
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << min(a,b) + min(c,d) << endl;
return 0;
} | 1 | 55,922,157 |
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define F first
#define S second
#define B begin()
#define E end()
#define FASTIO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
using namespace std ;
int main()
{
FASTIO
int r , d , x ;
cin >> r >> d >> x ;
for ( int i = 0 ; i < 10 ; i++ )
{
x = r*x - d ;
cout << x << "\n" ;
}
return 0 ;
} | #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){
int r,d,x2000; cin >> r >> d >> x2000;
int x = x2000;
rep(i,10){
x = r*x-d;
cout << x << endl;
}
return 0;
} | 1 | 73,332,022 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<math.h>
using namespace std;
#define mod (1000000000+7)
#define N (10007)
#define INF 1e16
typedef long long ll;
typedef pair<ll,ll> P;
int main(void){
ll n,a,b;
cin>>n;
vector<ll>s(n);
ll ans=0;
for(ll i=0;i<n;i++){
cin>>a>>b;
ans-=b;
s[i]=a+b;
}
sort(s.begin(),s.end(),greater<ll>());
for(ll i=0;i<n;i+=2)ans+=s[i];
cout<<ans<<endl;
return 0;
} | #include <stdio.h>
#include <string>
#include <cstring>
#include <stdlib.h>
#include <math.h>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <iterator>
#include <assert.h>
#pragma warning(disable:4996)
typedef long long ll;
#define MIN(a, b) ((a)>(b)? (b): (a))
#define MAX(a, b) ((a)<(b)? (b): (a))
#define LINF 9223300000000000000
#define INF 2140000000
const long long MOD = 1000000007;
using namespace std;
int main(int argc, char* argv[])
{
int n;
scanf("%d", &n);
vector<ll> z(n);
int i;
ll sum=0;
for(i=0; i<n; i++) {
int a,b;
scanf("%d%d", &a, &b);
z[i]=a+b;
sum-=b;
}
sort(z.rbegin(), z.rend());
for(i=0; i<n; i++) {
if(i%2==0) {
sum+=z[i];
}
}
printf("%lld\n", sum);
return 0;
} | 1 | 95,334,287 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vll vector<ll>
#define vpii vector<pair<int,int>>
#define vpll vector<pair<ll,ll>>
#define fr(i,k,n) for (int i = k; i < n; ++i)
#define fri(i,k,n) for (int i = k; i >= n; --i)
#define INF (int)1e9
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define all(arr) arr.begin(),arr.end()
void boost(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
void solve(){
ll a,b,c,d;
cin>>a>>b>>c>>d;
ll a1=a*c,a2=b*d,a3=a*d,a4=b*c;
a1=max(a1,a2);
a2=max(a3,a4);
cout<<max(a1,a2)<<endl;
return;
}
int main()
{
boost();
int tc=1;
while(tc--)
solve();
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll signed long long
ll x,y,a,b,c,d;
int main()
{
scanf("%lld %lld %lld %lld",&a, &b, &c, &d);
ll ans = max(a*c, b*c);
ans = max(ans,a*d);
ans = max(ans,b*d);
cout << ans;
return 0;
} | 1 | 60,761,192 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > b) {
int temp = a;
a = b;
b = temp;
}
for (int i = 0; i < b; i++) {
cout << (char)('0' + a);
}
cout << endl;
return 0;
} | #include <bits/stdc++.h>
#define pi 3.14159
using namespace std;
int main()
{
int a,b,i,j;
string s,g;
cin>>a>>b;
for(i=0;i<a;i++)
s+=(char)(b+'0');
for(i=0;i<b;i++)
g+=(char)(a+'0');
if(a<=b)
cout<<g<<endl;
else
cout<<s<<endl;
} | 1 | 98,652,901 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
for(int i=0;i<s.size();i++){
if(s[i]==','){
cout<<" "<<flush;
}else{
cout<<s[i]<<flush;
}
}
cout<<endl;
} | #include <iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
int main() {
string str;
cin >> str;
str = str.replace(5, 1, " ");
str = str.replace(13, 1, " ");
cout << str << endl;
return 0;
} | 1 | 3,442,503 |
#include "bits/stdc++.h"
#include <set>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define all(i) (i).begin(), (i).end()
#define rall(i) (i).begin(), (i).end(), greater<int>()
#define int long long
#define elif else if
#define eb emplace_back
#define pb push_back
#define mp make_pair
#define fst first
#define sec second
#define mod 1000000007
#define INF 10e10
template <typename T>
void print(T x)
{
std::cout << x << " ";
}
template <typename T>
void println(T x)
{
std::cout << x << "\n";
}
signed main(void) {
int n;
cin >> n;
map<int, int>a;
rep(i, n) {
int tmp;
cin >> tmp;
a[tmp]++;
}
vector<int>b;
for (auto itr = a.rbegin(); itr != a.rend(); ++itr) {
if (b.size()>= 2)break;
int key = itr->first;
int value = itr->second;
if (value >= 2) {
b.pb(key);
}
if (value >= 4) {
if (b.size() < 2)b.pb(key);
}
}
if (b.size() < 2) {
print(0);
}
else {
print(b[0] * b[1]);
}
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int N;
cin >> N;
vector<int> A(N);
for(int i = 0; i < N; ++i) {
cin >> A[i];
}
sort(A.rbegin(), A.rend());
long long W = 0, H = 0;
for(int i = 1; i < N; i++) {
if(A[i-1] == A[i]) {
if(!W) {
W = A[i];
i++;
}
else if(!H) {
H = A[i];
break;
}
}
}
if(W && H) {
cout << W * H << endl;
}
else {
cout << 0 << endl;
}
return 0;
} | 1 | 40,718,939 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
int n, m, x, y;
cin >> n >> m >> x >> y;
vector<int> a(n), b(m);
for(int i = 0; i < n; i++)cin >> a[i];
for(int i = 0; i < m; i++)cin >> b[i];
a.push_back(x), b.push_back(y);
int nax = *max_element(a.begin(), a.end());
int niy = *min_element(b.begin(), b.end());
cout << (niy > nax ? "No War" : "War") << endl;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)n; i++)
using namespace std;
int main() {
int n, m, X, Y;
cin >> n >> m >> X >> Y;
vector<int> x(n);
vector<int> y(m);
rep(i,n) cin >> x[i];
rep(i,m) cin >> y[i];
for (int z = (X+1); z <= Y; z++) {
bool ok = true;
rep(i,n) if (x[i] >= z) ok = false;
if (ok) {
rep(i,m) if (y[i] < z) ok = false;
}
if (ok) {cout << "No War" << endl; return 0;}
}
cout << "War" << endl;
return 0;
} | 1 | 72,776,680 |
#include <iostream>
#include <string>
using namespace std;
int main()
{
while(true){
string n;
cin>>n;
if(n=="-"){break;}
else{
int x;
cin>>x;
for(int i=0;i<x;i++){
int s;
cin>>s;
s-=1;
n=n.substr(s+1,n.size()-s)+n.substr(0,s+1);
}
cout<<n<<endl;
}
}
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main(){
int a,b;
string s,s1,s2;
while(cin>>s){
if(s=="-")break;
cin>>a;
for(int i=0;i<a;i++){
cin>>b;
for(int j=0;j<s.size();j++){
if(j<b){
s1+=s[j];
}else{
s2+=s[j];
}
}
s=s2+s1;
s1="";
s2="";
}
cout<<s<<endl;
}
return 0;
} | 1 | 78,389,287 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cassert>
#include <climits>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <fstream>
using namespace std;
#define SZ(x) (int)(x).size()
#define REP(i,n) for(int i=0;i<(n);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REPR(i,n) for(int i=(n)-1;i>=0;i--)
#define ALL(s) (s).begin(), (s).end()
#define so(V) sort(ALL(V))
#define rev(V) reverse(ALL(V))
#define uni(v) v.erase( unique(ALL(v)) , v.end());
typedef long long unsigned int llu;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<bool> vb;
const double EPS = 1e-9;
const int MOD = 1e9 + 7;
const int INF = (1 << 29);
const ll LINF = 1e18;
const double PI = acos(-1);
template<typename T>vector<T> make_v(size_t a) { return vector<T>(a); }
template<typename T, typename... Ts>auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...)); }
template<typename T, typename U, typename... V>
typename enable_if<is_same<T, U>::value != 0>::type
fill_v(U & u, const V... v) { u = U(v...); }
template<typename T, typename U, typename... V>
typename enable_if<is_same<T, U>::value == 0>::type
fill_v(U & u, const V... v) { for (auto& e : u) fill_v<T>(e, v...); }
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T& a, const T& b) { if (a > b) { a = b; return 1; } return 0; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
REP(k, N) {
vector<string> S(2);
cin >> S[0] >> S[1];
int cur = 1;
int ans = 0;
REP(i, 2) {
REP(j, SZ(S[i])) {
switch (S[i][j]) {
case 'm':
cur *= 10;
case 'c':
cur *= 10;
case 'x':
cur *= 10;
case 'i':
ans += cur;
cur = 1;
break;
default:
cur = S[i][j] - '0';
}
}
}
string SA = "";
int r = 10000;
char c[] = { 'm','c','x','i' };
REP(i, 4) {
ans %= r;
r /= 10;
if (ans / r == 0)continue;
else if (ans / r != 1)SA += (char)('0' + (ans / r));
SA += c[i];
}
cout << SA << endl;
}
return 0;
} | #include <iostream>
#include <string>
using namespace std;
void solve()
{
int n;
cin >> n;
while(n--)
{
string s1, s2;
cin >> s1 >> s2;
int num1 = 0, num2 = 0;
if(s1.size() == 1)
{
if(s1[0] == 'm')
{
num1 = 1000;
}
else if(s1[0] == 'c')
{
num1 = 100;
}
else if(s1[0] == 'x')
{
num1 = 10;
}
else if(s1[0] == 'i')
{
num1 = 1;
}
}
else
{
for(int i = 0; i < s1.size(); ++i)
{
if(s1[i] == 'm')
{
if(i == 0 || s1[i - 1] < '2' || '9' < s1[i - 1])
{
num1 += 1000;
}
else if('2' <= s1[i - 1] && s1[i - 1] <= '9')
{
num1 += 1000 * (s1[i - 1] - '0');
}
}
if(s1[i] == 'c')
{
if(i == 0 || s1[i - 1] < '2' || '9' < s1[i - 1] )
{
num1 += 100;
}
else if('2' <= s1[i - 1] && s1[i - 1] <= '9')
{
num1 += 100 * (s1[i - 1] - '0');
}
}
if(s1[i] == 'x')
{
if(i == 0 || s1[i - 1] < '2' || '9' < s1[i - 1] )
{
num1 += 10;
}
else if('2' <= s1[i - 1] && s1[i - 1] <= '9')
{
num1 += 10 * (s1[i - 1] - '0');
}
}
if(s1[i] == 'i')
{
if(i == 0 || s1[i - 1] < '2' || '9' < s1[i - 1] )
{
num1 += 1;
}
else if('2' <= s1[i - 1] && s1[i - 1] <= '9')
{
num1 += 1 * (s1[i - 1] - '0');
}
}
}
}
if(s2.size() == 1)
{
if(s2 == "m")
{
num2 = 1000;
}
else if(s2 == "c")
{
num2 = 100;
}
else if(s2 == "x")
{
num2 = 10;
}
else if(s2 == "i")
{
num2 = 1;
}
}
else
{
for(int i = 0; i < s2.size(); ++i)
{
if(s2[i] == 'm')
{
if(i == 0 || s2[i - 1] < '2' || '9' < s2[i - 1])
{
num2 += 1000;
}
else if('2' <= s2[i - 1] && s2[i - 1] <= '9')
{
num2 += 1000 * (s2[i - 1] - '0');
}
}
if(s2[i] == 'c')
{
if(i == 0 || s2[i - 1] < '2' || '9' < s2[i - 1] )
{
num2 += 100;
}
else if('2' <= s2[i - 1] && s2[i - 1] <= '9')
{
num2 += 100 * (s2[i - 1] - '0');
}
}
if(s2[i] == 'x')
{
if(i == 0 || s2[i - 1] < '2' || '9' < s2[i - 1] )
{
num2 += 10;
}
else if('2' <= s2[i - 1] && s2[i - 1] <= '9')
{
num2 += 10 * (s2[i - 1] - '0');
}
}
if(s2[i] == 'i')
{
if(i == 0 || s2[i - 1] < '2' || '9' < s2[i - 1] )
{
num2 += 1;
}
else if('2' <= s2[i - 1] && s2[i - 1] <= '9')
{
num2 += 1 * (s2[i - 1] - '0');
}
}
}
}
int ans = num1 + num2;
if(ans >= 2000)
{
cout << ans / 1000 << "m";
}
else if(ans >= 1000)
{
cout << "m";
}
ans %= 1000;
if(ans >= 200)
{
cout << ans / 100 << "c";
}
else if(ans >= 100)
{
cout << "c";
}
ans %= 100;
if(ans >= 20)
{
cout << ans / 10 << "x";
}
else if(ans >= 10)
{
cout << "x";
}
ans %= 10;
if(ans >= 2)
{
cout << ans << "i";
}
else if(ans >= 1)
{
cout << "i";
}
cout << endl;
}
}
int main()
{
solve();
return(0);
} | 1 | 48,570,918 |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define REP(i, n) for(ll i = 1; i < n + 1; i++)
#define PI 3.14159265359
#define EPS 0.0000000001
#define MOD 1000000007
int main(){
ll N, M;
cin >> N >> M;
ll a[N + 1], b[N + 1];
ll c[M + 1], d[M + 1];
REP(i, N){
cin >> a[i] >> b[i];
}
REP(i, M){
cin >> c[i] >> d[i];
}
ll dist;
ll closest;
REP(i, N){
dist = 500000000;
closest = 0;
REP(j, M){
if(dist > abs(c[j] - a[i]) + abs(d[j] - b[i])){
dist = abs(c[j] - a[i]) + abs(d[j] - b[i]);
closest = j;
}
}
cout << closest << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define mh(s, g) abs(start.at(i).first - goal.at(j).first) + abs(start.at(i).second - goal.at(j).second)
int main()
{
int n, m, i, j;
cin >> n >> m;
vector<pair<long, long>> start(n + 1);
vector<pair<long, long>> goal(m + 1);
for (i = 1; i <= n; i++)
{
cin >> start.at(i).first >> start.at(i).second;
}
for (i = 1; i <= m; i++)
{
cin >> goal.at(i).first >> goal.at(i).second;
}
for (i = 1; i <= n; i++)
{
int ans = 1;
long min = abs(start.at(i).first - goal.at(1).first) + abs(start.at(i).second - goal.at(1).second);
for (j = 2; j <= m; j++)
{
long kouho = abs(start.at(i).first - goal.at(j).first) + abs(start.at(i).second - goal.at(j).second);
if (min > kouho)
{
min = kouho;
ans = j;
}
}
cout << ans << endl;
}
} | 1 | 67,763,818 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout<< (x) << " "
int main(){
int x;cin>>x;
int r=x/100, q=x%100;
if(5*r>=q)co(1);
else co(0);
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i = 0; i < n; i++)
#define Rep(i,n) for(ll i = 0; i <= n; i++)
#define REp(i,n) for(ll i = 1; i < n; i++)
#define REP(i,n) for(ll i = 1; i <= n; i++)
#define sz(x) int(x.size())
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define YesorNo(a) printf(a ? "Yes\n" : "No\n")
#define endl '\n'
#define fi first
#define se second
using ll = long long;
using P = pair<int,int>;
using Pl = pair<ll,ll>;
template<class T> using V = vector<T>;
const int dx[] = {0,1,0,-1,1,1,-1,-1};
const int dy[] = {1,0,-1,0,1,-1,-1,1};
const int inf = (1<<30)-1;
const ll infll = (1LL<<62)-1;
ll ceil(const ll &a, const ll &b){return ((a)+(b)-1)/b;}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
set<int> can;
void f(int n, V<int> &m) {
if(n > 100000) return;
can.insert(n);
rep(i,6) {
int nx = n + m[i];
if(can.find(nx) == can.end()) f(nx,m);
}
}
int main(){
int x;
cin >> x;
V<int> m = {100,101,102,103,104,105,106};
f(0,m);
for(int i : can) {
if(i == x) {
cout << 1 << endl;
return 0;
}
}
cout << 0 << endl;
} | 1 | 45,724,595 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define all(x) (x).begin(), (x).end()
#define MOD 1000000007
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<vector<int>> dp(20, vector<int>(n, 0));
for(size_t i = 0; i < n; i++) {
cin >> a[i];
}
int l;
cin >> l;
for(size_t i = 0; i < n; i++) {
auto itr = lower_bound(all(a), a[i] + l + 1) - a.begin();
dp[0][i] = itr - 1;
}
for(int k = 0; k < 19; k++) {
for(int i = 0; i < n; i++) {
dp[k + 1][i] = dp[k][dp[k][i]];
}
}
int q;
cin >> q;
while(q--) {
int x, y;
cin >> x >> y;
x--;
y--;
if(x > y) {
swap(x, y);
}
int day = 0;
for(int i = 19; i >= 0; i--) {
if(dp[i][x] < y) {
x = dp[i][x];
day += 1 << i;
}
}
cout << day + 1 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef vector<int> VI;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
const int mod=1e9+7;
int main(){
int n;cin>>n;
vector<ll> x(n+1);rep(i,n)cin>>x[i];
x[n]=1e18+1;
int l;cin>>l;
vector<vector<int>> db(18,vector<int>(n,0));
rep(i,n){
int idx=upper_bound(all(x),x[i]+l)-x.begin();
db[0][i]=--idx;
}
rep(i,1,18){
rep(j,n){
db[i][j]=db[i-1][db[i-1][j]];
}
}
int q;cin>>q;
rep(_,q){
int a,b;cin>>a>>b;
if(a>b)swap(a,b);
--a;--b;
int ctr=0;
for(int i=17;i>=0;--i){
int p=db[i][a];
if(p<b){
a=p;ctr+=(1<<i);
}
}
cout<<ctr+1<<endl;
}
} | 1 | 35,605,150 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C, K;
cin >> A >> B >> C >> K;
if (A>=K)
cout << K << endl;
else if (A+B >= K)
cout << A << endl;
else
cout << 2*A + B - K << endl;
} | #include<iostream>
#include<string>
using namespace std;
main(){
int i=0,A,B,C,K,ans=0;
cin >> A >> B >> C >> K;
if(A>=K){
cout << K << endl;;
}
if(A+B>=K&&A<K){
cout << A << endl;
}
if(A+B<K){
K=K-(A+B);
cout << A-K << endl;
}
} | 1 | 30,658,247 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<pair<int,int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
#define PUB push_back
#define PO pop
#define POF pop_front
#define POB pop_back
#define REP(i,a,b) for(int i=a; i<=b; i++)
#define MOD 1000000007
void solve(int test_case) {
int a,b;
char c;
cin>>a>>c>>b;
if(c=='-')cout<<a-b;
else cout<<a+b;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int t=1;
REP(i,1,t) {
solve(i);
}
return 0;
} | #include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define fi first
#define se second
#define PI 3.1415926535897932384626433832795
#define MOD 1000000007
using namespace std;
ll power(ll a,ll n)
{
ll result=1;
while(n>0)
{
if(n&1)
result=result*a;
a=a*a;
n=n>>1;
}
return result;
}
ll lcm(ll a,ll b)
{
return ((a*b)/__gcd(a,b));
}
bool ispow2(ll n)
{
return (ceil(log2(n))==floor(log2(n)));
}
bool isprime(ll n)
{
if(n==1)
return false;
else if(n==2)
return true;
else
{
for(ll i=2;i*i<=n;++i)
{
if(n%i==0)
return false;
}
return true;
}
}
ll ncr(ll n,ll r)
{
if(r > n - r)
r = n - r;
ll ans = 1;
ll i;
for(i = 1; i <= r; i++)
{
ans *= n - r + i;
ans /= i;
}
return ans;
}
char a[35][35];
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int t=1;
while(t--)
{
int a,b;
char ch;
cin>>a>>ch>>b;
if(ch=='+')
cout<<a+b;
else
cout<<a-b;
}
return 0;
} | 1 | 50,439,279 |
#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
#include <cmath>
#include <string>
#include <map>
#define pb push_back
#define mp make_pair
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef unsigned long long ull;
typedef long long ll;
int main() {
int a, b, m;
cin >> a >> b >> m;
vi va;
vi vb;
int min_a = 100005;
for (int i = 0; i < a; ++i) {
int k;
cin >> k;
va.pb(k);
min_a = min(min_a, k);
}
int min_b = 100005;
for (int i = 0; i < b; ++i) {
int k;
cin >> k;
vb.pb(k);
min_b = min(min_b, k);
}
int res = min_a+min_b;
for (int i = 0; i < m; ++i) {
int xi, yi, ci;
cin >> xi >> yi >> ci;
xi--; yi--;
res = min(res, va.at(xi)+vb.at(yi)-ci);
}
cout << res << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int an, bn, m;
cin >> an >> bn >> m;
vector<int> a(an + 1);
int am = 1e9;
for (int i = 1; i <= an; i++) {
cin >> a.at(i);
am = min(am, a.at(i));
}
vector<int> b(bn + 1);
int bm = 1e9;
for (int i = 1; i <= bn; i++) {
cin >> b.at(i);
bm = min(bm, b.at(i));
}
vector<int> x(m);
vector<int> y(m);
vector<int> c(m);
for (int i = 0; i < m; i++) {
cin >> x.at(i) >> y.at(i) >> c.at(i);
}
int cm = 1e9;
for (int i = 0; i < m; i++) {
cm = min(cm, a.at(x.at(i)) + b.at(y.at(i)) - c.at(i));
}
cout << min(cm, am + bm) << endl;
return 0;
} | 1 | 70,264,412 |
#include <cmath>
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
string s;
string t;
void input() {
cin >> s >> t;
}
void solve() {
sort(s.begin(), s.end());
sort(t.rbegin(), t.rend());
string ans = "No";
if (s < t)
ans = "Yes";
cout << ans << '\n';
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.precision(16);
cout << fixed;
int _times = 1;
#ifdef _DEBUG
freopen("input.txt", "r", stdin);
_times = 5;
#endif
while (_times--) {
input();
solve();
}
} | #include<bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
string a,b;
cin>>a>>b;
sort(a.begin(),a.end());
sort(b.begin(),b.end(),greater<char>());
puts(a<b?"Yes":"No");
} | 1 | 82,604,608 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> pll;
const ll mod=1e9+7;
const ll inf=1LL<<61;
int main() {
string s;
cin >> s;
if(s.size()>3&&s.substr(0,4)=="YAKI") cout << "Yes" << endl;
else cout << "No" << endl;
} | #include <iostream>
#include <string>
using namespace std;
int main(void)
{
string s;
cin >> s;
if(s[0]=='Y'&&s[1]=='A'&&s[2]=='K'&&s[3]=='I'){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
return 0;
} | 1 | 82,606,688 |
#include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rrep(i, n) for(int i = 0; i <= (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1LL<<62;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class 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...));
}
const int MOD = 1000000007;
int main(){
int N; cin >> N;
vector<int> a(N);
rep(i,N) cin >> a[i];
vector<int> counter(10000000, 0);
rep(i,N){
if (a[i]-1 >= 0 ) counter[a[i]-1]++;
counter[a[i]]++;
counter[a[i]+1]++;
}
int ans = 0;
rep(i,10000000){
ans = max(ans, counter[i]);
}
cout << ans << endl;
} | #include<iostream>
using namespace std;
const int N=1e5+5;
int a[N];
int main()
{
int n;
cin>>n;
while(n--){
int t;
cin>>t;
a[t]++;
a[t+1]++;
if(t>0){
a[t-1]++;
}
}
int maxn=0;
for(int i=0;i<100005;i++){
if(a[i]>maxn){
maxn=a[i];
}
}
cout<<maxn;
return 0;
} | 1 | 26,337,497 |
#include <stdio.h>
int main(){
int a, piece;
scanf("%d %d", &a, &piece);
piece = piece + a*3;
int pie = piece / 2;
printf("%d\n", pie);
return 0;
} | #include<stdio.h>
int main(){
int apel,potongan;
scanf("%d %d", &apel, &potongan);
int total=((apel*3)+potongan)/2;
printf("%d\n", total);
return 0;
} | 1 | 47,866,838 |
#include<bits/stdc++.h>
using namespace std;
#define flash ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define F first
#define S second
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define endl "\n"
#define int long long int
#define ll long long
#define ld long double
const int mod = 1000000007;
const int N=200005;
const int inf=1e18;
int vis[N];
vector<vector<int>>adj(N);
bool isPrime(ll n){if(n<2)return false;for(ll i=2;i*i<=n;++i){if(n%i==0){return false;}}return true;}
ll power(ll x,ll y){ll res=1;x=x;while(y>0){if(y&1)res=(res*x)%mod;y=y>>1;x=(x*x)%mod;}return res%mod;}
ll gcd(ll a,ll b){if (a==0)return b;return gcd(b%a,a);}
ll lcm(ll a,ll b){return (a/gcd(a,b)*b);}
ll max(ll a,ll b){ll ans=a>b?a:b;return ans;}
ll min(ll a,ll b){ll ans=a<b?a:b;return ans;}
void dfs(int x){
vis[x]=1;
for(auto i:adj[x]){
if(!vis[i])
dfs(i);
}
}
void fun(){
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
int time(int x,int y){
int r=0;
while(x<y){
x*=2;
r++;
}
return r;
}
double powe(int r){
double c=1;
for(int i=0;i<r;i++){
c/=2;
}
return c;
}
signed main(){
flash;
fun();
int t=1;
while(t--){
int n,k;
cin>>n>>k;
ld ans=0;
for(int i=1;i<=n;i++){
ans+=powe(time(i,k))/n;
}
cout<<fixed<<setprecision(10);
cout<<ans;
}
return 0;
} | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int gcd(ll a, ll b){
if (a%b == 0){
return(b);
}
else{
return(gcd(b, a%b));
}
}
ll lcm(ll a, ll b){
return a * b / gcd(a, b);
}
int kan_hyaku(int n){
int kurai = 0;
for(int i=0;i<3;i++){
kurai = n%10;
n /=10;
}
return kurai;
}
int kan_ju(int n){
int kurai = 0;
for(int i=0;i<2;i++){
kurai = n%10;
n /=10;
}
return kurai;
}
int kan_ichi(int n){
int kurai = 0;
for(int i=0;i<1;i++){
kurai = n%10;
n /=10;
}
return kurai;
}
int keta(int n){
int wa = 1;
while(n>0){
wa *=10;
n--;
}
return wa;
}
double kan_half(int n){
double wa = 1;
while(n>0){
wa *= 0.5;
n--;
}
return wa;
}
int main() {
double n;
int k;
cin >> n >> k;
double sum = 0;
for(int i=1;i<=n;i++){
int count = 0;
int num = i;
for(;;){
if(k <= num) break;
num *= 2;
count ++;
}
double s = 1/n * kan_half(count);
sum += s;
}
cout << fixed << setprecision(20)<< sum << endl;
} | 1 | 60,231,320 |
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define rep(i, m, n) for (lli i = m; i < (n); i++)
#define repe(i, m, n) for (lli i = m; i <= (n); i++)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((lli)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define _GLIBCXX_DEBUG
const lli INF = 2147483647;
const lli MINF = -2147483648;
const lli LINF = 9223372036854775807;
const lli MOD = 1000000007;
const double PI = acos(-1);
#define SORT(n) sort(n.begin(), n.end())
#define SORTR(n) sort(n.begin(), n.end(), greater<int>())
#define REV(n) reverse(n.begin(), n.end())
#define pb push_back
#define eb emplace_back
#define mp make_pair
#pragma GCC optimize("Ofast")
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vlli = vector<lli>;
using vvli = vector<vlli>;
using vs = vector<string>;
using vvs = vector<vs>;
using vb = vector<bool>;
using vvb = vector<vb>;
using ll = long long;
template <typename T>
istream &operator>>(istream &is, vector<T> &vec)
{
for (T &x : vec)
is >> x;
return is;
}
template <typename T>
ostream &operator<<(ostream &os, vector<T> &vec)
{
for (int i = 0; i < vec.size(); i++)
{
os << vec[i] << (i + 1 == vec.size() ? "" : "");
}
return os;
}
template <typename T>
bool chmax(T &a, const T &b)
{
if (a < b)
{
a = b;
return true;
}
return false;
}
template <typename T>
bool chmin(T &a, const T &b)
{
if (a > b)
{
a = b;
return true;
}
return false;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
lli a, b, c, h, n, k, s, w, ans = 0, count = 0;
string t;
vector<pair<string, pair<lli, lli>>> pr;
cin >> n >> k >> s;
vlli d;
a = 1000000000;
while (d.size() < n)
{
if (d.size() < k)
{
d.push_back(s);
}
else if (s >= a)
{
d.push_back(1);
}
else
{
d.push_back(s + 1);
}
}
rep(i, 0, n)
{
cout << d[i] << " ";
}
cout << endl;
} | #include <bits/stdc++.h>
#include <random>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef double ld;
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<vvc> vvvc;
typedef pair<int, int> pii;
typedef pair<pii, pii> piii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<short> vs;
typedef vector<vs> vvs;
typedef vector<vvs> vvvs;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<ld> vld;
typedef vector<vld> vvld;
typedef vector<vvld> vvvld;
typedef vector<string> vst;
typedef vector<vst> vvst;
typedef pair<ld, ld> pld;
#define inmin(a, b) a = min(a, (b))
#define inmax(a, b) a = max(a, (b))
#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()
#define sqr(x) ((x) * (x))
#define fori(i, n) for(int i = 0; i < int(n); ++i)
#define SZ(a) ((int)((a).size()))
#define triple(T) tuple<T, T, T>
#define quad(T) tuple<T, T, T, T>
#define watch(x) cout << (#x) << " = " << (x) << endl;
#ifdef MAX_HOME
#define cerr cout
#else
#define cerr if (false) cerr
#endif
const double PI = 2 * acos(0.0);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count());
const string DIGITS = "0123456789";
const string ALPH = "abcdefghijklmnopqrstuvwxyz";
template<class T0, class T1>
inline ostream &operator<<(ostream &out, pair<T0, T1> &a) {
return out << "{" << a.first << ", " << a.second << "}";
}
template<class T0, class T1>
inline istream &operator>>(istream &in, pair<T0, T1> &a) {
return in >> a.first >> a.second;
}
template<class T0, class T1, class T2>
inline ostream &operator<<(ostream &out, tuple<T0, T1, T2> &a) {
return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << "}";
}
template<class T0, class T1, class T2, class T3>
inline ostream &operator<<(ostream &out, tuple<T0, T1, T2, T3> &a) {
return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << ", " << get<3>(a) << "}";
}
template<class T>
inline ostream &operator<<(ostream &out, vector<T> &a) {
out << "[";
fori (i, a.size())out << a[i] << vector<string>{", ", "] "}[i + 1 == a.size()];
return out;
}
void smain();
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifdef MAX_HOME
freopen("input.txt", "r", stdin);
clock_t start = clock();
#endif
cout << setprecision(12) << fixed;
smain();
#ifdef MAX_HOME
cout << "\n\nTOTAL EXECUTION TIME: " << float(clock() - start) / CLOCKS_PER_SEC << endl;
#endif
return 0;
}
void smain() {
int n, k, s;
cin >> n >> k >> s;
int vl = s == 1000 * 1000 * 1000 ? 1 : s + 1;
fori (i, n) {
if (i < k) {
cout << s << ' ';
} else {
cout << vl << ' ';
}
}
} | 1 | 60,218,259 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cstring>
#include <functional>
using namespace std;
typedef long long ll;
typedef pair<long long, long long> P;
#define rep(i, n) for(long long i=0; i<n; i++)
#define reps(i, s, e) for(long long i=s; i<e; i++)
#define repr(i, n) for(long long i=n-1; i>=0; i--)
#define reprs(i, s, e) for(long long i=e-1; i>=s; i--)
ll amax = 1e6;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll n; cin >> n;
ll a[n];
set<ll> st;
set<ll> ng;
rep(i, n){
cin >> a[i];
if(st.find(a[i]) == st.end()){
st.insert(a[i]);
}
else{
ng.insert(a[i]);
}
}
sort(a, a+n);
bool is_forbidden[amax + 1];
rep(i, amax + 1){
is_forbidden[i] = false;
}
for(ll t : st){
if(is_forbidden[t]) continue;
ll prod = t;
while(true){
prod += t;
if(prod > amax) break;
is_forbidden[prod] = true;
}
}
ll cnt = 0;
rep(i, n){
if(is_forbidden[a[i]]){
continue;
}
if(!(ng.find(a[i]) == ng.end())){
continue;
}
cnt++;
}
cout << cnt << endl;
return 0;
} | #include <bits/stdc++.h>
#include <ext/hash_map>
#include <ext/numeric>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define REP(i,n) for( (i)=0 ; (i)<(n) ; (i)++ )
#define rep(i,x,n) for( (i)=(x) ; (i)<(n) ; (i)++ )
#define REV(i,n) for( (i)=(n) ; (i)>=0 ; (i)-- )
#define FORIT(it,x) for( (it)=(x).begin() ; (it)!=(x).end() ; (it)++ )
#define foreach(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();++it)
#define rforeach(it,c) for(__typeof((c).rbegin()) it=(c).rbegin();it!=(c).rend();++it)
#define foreach2d(i, j, v) foreach(i,v) foreach(j,*i)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define SZ(x) ((int)(x).size())
#define MMS(x,n) memset(x,n,sizeof(x))
#define mms(x,n,s) memset(x,n,sizeof(x)*s)
#define pb push_back
#define mp make_pair
#define NX next_permutation
#define UN(x) sort(all(x)),x.erase(unique(all(x)),x.end())
#define CV(x,n) count(all(x),(n))
#define FIND(x,n) find(all(x),(n))-(x).begin()
#define ACC(x) accumulate(all(x),0)
#define PPC(x) __builtin_popcountll(x)
#define LZ(x) __builtin_clz(x)
#define TZ(x) __builtin_ctz(x)
#define mxe(x) *max_element(all(x))
#define mne(x) *min_element(all(x))
#define low(x,i) lower_bound(all(x),i)
#define upp(x,i) upper_bound(all(x),i)
#define NXPOW2(x) (1ll << ((int)log2(x)+1))
#define PR(x) cout << #x << " = " << (x) << endl ;
typedef unsigned long long ull;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int> > vvi;
typedef pair<int, int> pii;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
const int OO = (int) 2e9;
const double eps = 1e-9;
const int N = 2e5 + 5;
int n;
int a[N];
unordered_map<int, int> M;
int main() {
std::ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#ifndef ONLINE_JUDGE
#endif
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i], M[a[i]]++;
if (M.find(1) != M.end()) {
if (M[1] == 1)
cout << 1 << endl;
else
cout << 0 << endl;
return 0;
}
int res = 0;
for (auto it : M) {
if (it.second == 1) {
bool f = 1;
for (int i = 2; i * i <= it.first; i++) {
if (it.first % i == 0 && M.find(i) != M.end()) {
f = 0;
break;
}
int j = it.first / i;
if (it.first % j == 0 && M.find(j) != M.end()) {
f = 0;
break;
}
}
res += f;
}
}
cout << res << endl;
return 0;
} | 1 | 72,565,960 |
#include <bits/stdc++.h>
const int MOD = 1000000007;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define copy(from, to) copy(from.begin(), from.end(), back_inserter(to))
#define sort(a) sort(a.begin(), a.end())
#define reverse(s) reverse(s.begin(), s.end())
#define p(s) cout << (s) << endl
typedef long long ll;
using namespace std;
template<class T>
void load(vector<T> &v, int n) {
for (int i = 0; i < n; ++i) {
T t;
cin >> t;
v.push_back(t);
}
}
template<class T>
T max(vector<T> &v) {
return *max_element(v.begin(), v.end());
}
template<class T>
T min(vector<T> &v) {
return *min_element(v.begin(), v.end());
}
void py(bool isUpper = false) {
if (isUpper) {
p("YES");
} else {
p("Yes");
}
}
void pn(bool isUpper = false) {
if (isUpper) {
p("NO");
} else {
p("No");
}
}
int main() {
int n, h, w;
cin >> n >> h >> w;
int c = 0;
rep(i, n) {
int a, b;
cin >> a >> b;
if (a >= h && b >= w) c++;
}
p(c);
} | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
int main() {
ll N, H, W;
cin >> N >> H >> W;
ll ans = 0, a, b;
for (int i = 0; i < N; i++) {
cin >> a >> b;
if (H <= a && W <= b) ans++;
}
cout << ans << endl;
return 0;
} | 1 | 98,490,516 |
#include <bits/stdc++.h>
#define INF 100000007
#define rep(i, N) for(ll i = 0; i < N; i++)
#define rep2(i, j, k) for(ll i = j; i < k; i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = inx(x, y)
#define print(x) cout << x << "\n"
#define print2(x, y) cout << x << " " << y << "\n"
#define printv(vec) rep(i, vec.size()) cout << vec[i] << " "; print("");
#define ALL(v) v.begin(), v.end()
#define SUM(v) accumulate(ALL(v), 0)
#define MAX(v) *max_element(ALL(v))
#define MIN(v) *min_element(ALL(v))
#define SORT(v) sort(ALL(v))
#define REV(v) reverse(ALL(v))
typedef long long ll;
using namespace std;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vs = vector<string>;
using vvs = vector<vector<string>>;
ll f(ll x){
if(x % 4 == 0) return 0 ^ x;
if(x % 4 == 1) return 1;
if(x % 4 == 2) return 1 ^ x;
if(x % 4 == 3) return 0;
}
void solve(){
ll A, B;
cin >> A >> B;
ll ans = f(B) ^ f(A - 1);
print(ans);
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
solve();
return 0;
} | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using ll = long long;
using P = pair<int,ll>;
ll gcd(ll a, ll b) { return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
ll binary(ll bina){
ll ans = 0;
for (ll i = 0; bina>0 ; i++)
{
ans = ans+(bina%2)*pow(10,i);
bina = bina/2;
}
return ans;
}
int main()
{
ll A,B;
cin >> A >> B;
ll C,D;
bool a = false;
bool b = false;
if(A%2 == 1){
a = true;
C = A + 1;
}
if(B%2 == 0){
b = true;
D = B - 1;
}
ll ans;
ll c;
if(a&&b){
c = (B - A - 1)/2;
if(c%2 == 0) ans = A^B;
else ans = A^1^B;
}
else if(a&&!b){
c = (B - A)/2;
if(c%2 == 0) ans = A + 0;
else ans = A^1;
}
else if(!a&&b){
c = (B - A)/2;
if(c%2 == 0) ans = B + 0;
else ans = B^1;
}
else{
c = (B - A + 1)/2;
if(c%2 == 0) ans = 0;
else ans = 1;
}
cout << ans << endl;
return 0;
} | 1 | 5,148,775 |
#include<bits/stdc++.h>
using namespace std;
char s[100000005];
int main()
{
scanf("%s",s);
int len=strlen(s);
int m,a;
m=0;
for (int i=0;i<len;i++)
{
a=s[i]-'0';
m+=a;
}
if (m%9==0)
cout<<"Yes";
else
cout<<"No";
return 0;
} | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <string>
#include <algorithm>
#include <time.h>
#include <chrono>
#include <random>
#include <cmath>
#include <fstream>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <stdlib.h>
#include <iomanip>
#include <cstdio>
#include <cassert>
#include <bitset>
#pragma comment(linker, "/STACK:36777216")
using namespace std;
#define flu fflush(stdout)
#define gg return 0
#define mp make_pair
typedef long double ptype;
long long mod = /*27449*
int inf = 1e9;
double eps = 1e-8;
long double pi = acosl(-1);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ifstream in("input.txt");
ofstream out("output.txt");
void solve()
{
string s;
cin >> s;
int rem = 0;
for (auto c : s)
{
rem = (rem * 10 + c - '0') % 9;
}
cout << (rem ? "No" : "Yes");
}
int main()
{
cout << setprecision(20) << fixed;
cin.tie();
cout.tie();
clock_t t1 = clock();
int t;
t = 1;
while (t--) {
solve();
}
gg;
} | 1 | 13,887,371 |
#include<stdio.h>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<set>
#define Vsort(a) sort(a.begin(), a.end())
#define Vreverse(a) reverse(a.begin(), a.end())
#define Srep(n) for(int i = 0; i < (n); i++)
#define Lrep(i,a,n) for(int i = (a); i < (n); i++)
#define Brep(n) for(int bit = 0; bit < (1<<n); bit++)
#define rep2nd(n,m) Srep(n) Lrep(j,0,m)
#define vi vector<int>
#define vi64 vector<int64_t>
#define vvi vector<vector<int>>
#define vvi64 vector<vector<int64_t>>
#define P pair<int,int>
#define F first
#define S second
using namespace std;
int main(){
char s;
cin >> s;
if((s == 'a')||(s == 'i')||(s == 'u')||(s == 'e')||(s == 'o')) cout << "vowel" << endl;
else cout << "consonant" << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define INF_LL 1LL << 60
#define INF 99999999
#define MOD (ll)1000000007
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define REP(i, a, n) for(int i = a; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
void put_double(double obj){printf("%.12f\n",obj);};
template < typename T > std::string to_string( const T& n )
{
std::ostringstream stm ;
stm << n ;
return stm.str() ;
}
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 main()
{
char c;
cin >> c;
if( c == 'a' || c == 'i' || c == 'u' || c == 'e' || c == 'o' ) cout << "vowel" << endl;
else cout << "consonant" << endl;
} | 1 | 47,453,972 |
#include <iostream>
#include <set>
#include <numeric>
#include <map>
using namespace std;
long long a[100000];
long long b[100000];
long long ans[10];
map <long long, set<long long> > point_map;
set <pair <long long, long long> > checked;
int main(void){
long long H;
long long W;
int N;
cin >> H >> W >> N;
for(int i = 0; i < N; i++){
cin >> a[i] >> b[i];
if(point_map.find(a[i]) == point_map.end()){
set <long long> tmp = {b[i]};
point_map[a[i]] = tmp;
} else {
point_map[a[i]].insert(b[i]);
}
}
for(int i = 0; i < N; i++){
for(int j = -2; j <= 0; j++){
for(int k = -2; k <= 0; k++){
int upper_left_h = a[i] + j;
int upper_left_w = b[i] + k;
if(checked.find(make_pair(upper_left_h, upper_left_w)) != checked.end()
|| upper_left_h < 1 || upper_left_w < 1 || upper_left_h > H - 2 || upper_left_w > W - 2){
continue;
}
int filled_no = 0;
for(int l = 0; l < 3; l++){
for(int m = 0; m < 3; m++){
int cur_h = upper_left_h + l;
int cur_w = upper_left_w + m;
if(point_map.find(cur_h) != point_map.end() && point_map[cur_h].find(cur_w) != point_map[cur_h].end()){
filled_no++;
}
}
}
ans[filled_no] ++;
checked.insert(make_pair(upper_left_h, upper_left_w));
}
}
}
ans[0] = (H - 2) * (W - 2) - accumulate(ans + 1, ans + 10, (long long) 0);
for(int i = 0; i < 10; i++){
cout << ans[i] << endl;
}
return 0;
} | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <set>
#include <map>
#include <queue>
using namespace std;
#define rep(i,n) for(int i = 0;i<n;i++)
const long long MOD = 1000000007LL;
const string alpha = "abcdefghijklmnopqrstuvwxyz";
bool judge(long a,long b,long h,long w){
if(a<1) return false;
if(a+2>h) return false;
if(b<1) return false;
if(b+2>w) return false;
return true;
}
int main(){
long long h,w,n;
cin >> h >> w >> n;
long a[n],b[n];
rep(i,n){
cin >> a[i] >> b[i];
}
long long ans[10] = {0};
set<pair<long,long>> st;
map<pair<long,long>,int> mp;
rep(i,n){
rep(j,3){
rep(k,3){
if(judge(a[i]-j,b[i]-k,h,w)){
mp[make_pair(a[i]-j,b[i]-k)]++;
st.insert(make_pair(a[i]-j,b[i]-k));
}
}
}
}
ans[0]=(h-2)*(w-2)-st.size();
for(auto itr = st.begin();itr!=st.end();itr++){
ans[mp[*itr]]++;
}
rep(i,10){
cout << ans[i] << endl;
}
} | 1 | 6,304,468 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int m,n_min,n_max;
while(cin>>m>>n_min>>n_max,m){
vector<int> V(m);
for(int i=0;i<m;i++) cin>>V[i];
sort(V.begin(), V.end(),greater<int>());
int ans=-1;
int gap=0;
for(int i=n_min-1;i<n_max;i++){
if(V[i+1]==V[i]) continue;
if(V[i]-V[i+1]>=gap){
gap=V[i]-V[i+1];
ans=i+1;
}
}
cout<<ans<<endl;
}
return 0;
} | #include <bits/stdc++.h>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int m,nmin,nmax;
int p[100001];
int main(void){
while(1){
scanf("%d%d%d",&m,&nmin,&nmax);
if(m==0 && nmin==0 && nmax==0)break;
for(int i=1;i<=m;i++){
scanf("%d",&p[i]);
}
sort(p,p+m+1);
int val=-1,res=-1;
for(int i=nmin;i<=nmax;i++){
if(p[m-i+1]-p[m-i]>=val){
res=i;
val=p[m-i+1]-p[m-i];
}
}
printf("%d\n",res);
}
return 0;
} | 1 | 25,908,511 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define PI 3.141592653589793
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, a, n) for (int i = a; i < (n); i++)
#define rrep(i, n, k) for (int i = (n); i >= (k); i--);
#define all(x) (x).begin(), (x).end()
#define vi vector<int>
template<class T> istream &operator>>(istream&is,vector<T>&v){for(auto &elemnt:v)is>>elemnt;return is;}
template<class T,class U> istream &operator>>(istream&is,pair<T,U>&p){is>>p.first>>p.second;return is;}
template<class T>vector<T> make_vector(size_t a){return vector<T>(a);}
template<class T, class... Ts>auto make_vector(size_t a, Ts... ts){return vector<decltype(make_vector<T>(ts...))>(a, make_vector<T>(ts...));}
const int MOD = 998244353;
const int INF = 2e18;
signed main() {
int N;
cin >> N;
vector<int> A(N + 1, 0);
for (int i = 1; i <= N; i++) cin >> A[i];
int ans = (A[1] - 1), maxValue = 2;
for (int i = 2; i <= N; i++) {
if (maxValue == A[i]) {
maxValue++;
} else if (maxValue * 2 - 1 > A[i]) {
ans += (A[i] > maxValue);
} else {
ans += (A[i] - 1) / maxValue;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
int A[100005];
ll sum = 0, d = 2;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
if (i == 0) sum += A[i] - 1;
else if (d == A[i]) d++;
else sum += (A[i] - 1) / d;
}
cout << sum << endl;
return (0);
} | 1 | 74,586,309 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<long long> V(N);
for (int i = 0; i < N; ++i) cin >> V[i];
long long result = 0;
for (int a = 0; a <= min(N, K); ++a) {
for (int b = 0; a + b <= min(N, K); ++b) {
vector<long long> out;
for (int i = 0; i < a; ++i) out.push_back(V[i]);
for (int i = 0; i < b; ++i) out.push_back(V[N-i-1]);
sort(out.begin(), out.end());
long long sum = 0;
for (auto v : out) sum += v;
for (int i = 0; i < min(a + b, K - a - b); ++i) {
if (out[i] >= 0) break;
sum -= out[i];
}
result = max(result, sum);
}
}
cout << result << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i < b; i++)
#define out(x) cout << x << endl
#define EPS (1e-7)
#define gearup ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<pair<int,int> > vpii;
typedef vector<vector<int> > vvi;
typedef vector<vector<char> > vvc;
typedef vector<vector<bool> > vvb;
typedef vector<vector<double> > vvd;
typedef vector<vector<string> > vvs;
typedef vector<ll> vl;
typedef vector<vector<ll> > vvl;
typedef vector<vector<vector<ll> > > vvvl;
ll MOD = 1000000007;
const long long L_INF = 1LL << 60;
const int INF = 2147483647;
const double PI = acos(-1);
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
template<class T> void debug(T v){rep(i,v.size()) cout<<v[i]<<" ";cout<<endl;}
const ll dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
signed main()
{
gearup;
int n,k; cin >> n >> k;
vl v(n);
rep(i,n)cin>>v[i];
ll res = 0;
for(int left = 0;left<=k;left++){
for(int right = 0;right <= k-left;right++){
if(left + right > n)continue;
ll ttl = left + right;
ll dif = k - ttl;
vl tmp;
rep(j,left)tmp.push_back(v[j]);
rep(j,right)tmp.push_back(v[n-j-1]);
sort(all(tmp));
rep(j,min(dif,ttl)){
if(tmp[j] < 0)tmp[j] = 0;
}
ll ans = accumulate(all(tmp),0LL);
res = max(res,ans);
}
}
out(res);
} | 1 | 22,918,117 |
#include<bits/stdc++.h>
typedef long long int ll;
using namespace std;
void solve()
{
int x, n;
cin >> x >> n;
int a[205];
fill_n(a, 205, 1);
int mn = INT_MAX, val;
for(int i = 0; i<n; i++)
{
int c;
cin >> c;
a[c]--;
}
if(a[x])
{
cout << x << endl;
return ;
}
int i = x-1;
while(a[i]!=1)
{
i--;
}
int j = x+1;
while(a[j]!=1)
{
j++;
}
if(x-i>j-x)
{
cout << j << endl;
}
else cout << i << endl;
}
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
ll t;
solve();
return 0;
} | #include <iostream>
#include <cstring>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
long long x,y,n,i,r;
map<long long,long long> mp;
int main() {
cin >> x >> n;
for(i = 0; i < n; i++) {
cin >> y;
mp[y] = 1;
}
i = x;
while(mp[i]) {
i++;
}
r = i-x;
i = x;
while(mp[i]) {
i--;
}
if(r < x-i) {
cout << x+r;
} else {
cout << i;
}
return 0;
} | 1 | 36,393,789 |
#include<iostream>
#include<string>
#include<cmath>
#include<queue>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<functional>
#include<algorithm>
#include<cstdio>
#include<unordered_map>
using namespace std;
#define int long long
const int inf = 999999999999999999;
struct P {
int pos, cost;
};
bool operator<(P a, P b) { return a.cost < b.cost; }
bool operator>(P a, P b) { return a.cost > b.cost; }
struct B {
int to, cost;
};
typedef long long ll;
typedef long double ld;
int n, s;
int solve(int i, int bf,int res) {
if (i == n&&res==0) return 1;
int ans = 0;
for (int j = 0; j < bf; j++) {
ans += solve(i + 1, j, res - j);
}
return ans;
}
signed main() {
while (cin >> n >> s&&n + s != 0) {
cout << solve(0, 10, s) << endl;
}
} | #include<bits/stdc++.h>
using namespace std;
int s, n, cnt = 0;
void solve(int x, int y, int sum){
if(y == n){
if(sum == s){
++cnt;
}
return ;
}
if(x > 9) return ;
solve(x + 1, y + 1, sum + x);
solve(x + 1, y, sum);
return ;
}
int main(){
while(1){
cin >> n >> s;
if(n == 0 && s == 0) break;
cnt = 0;
solve(0, 0, 0);
cout << cnt << endl;
}
return 0;
} | 1 | 52,696,385 |
#include <iostream>
using namespace std;
int main(void)
{
int i=1;
int in;
while (1) {
cin >> in;
if (in==0) {
break;
}
else {
cout << "Case" << " " << i << ":" << " " << in << endl;
i++;
}
}
return 0;
} | #include <iostream>
using namespace std;
int main(){
int input, count = 1;
cin >> input;
while(input != 0){
cout << "Case " << count << ": " << input << endl;
count++;
cin >> input;
}
} | 1 | 1,000,534 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<P,ll> PLL;
typedef pair<P,P> PP;
typedef vector<ll> llVEC;
typedef vector<P> PVEC;
typedef priority_queue<P,PVEC,greater<P> > PPQ;
typedef priority_queue<ll, llVEC, greater<ll> > llPQ;
#define rep(i,a,n) for(ll i = a;i < n;i++)
#define rrep(i,a,n) for(ll i = n-1; i >= a;i--)
#define index_check(i,n) if(i > n-1 || i < 0) continue;
#define LINF (ll)1e18
#define INF (int)1e9
#define fs first
#define sc second
template<typename T>
ll sz(vector<T> &vec){ return (ll)vec.size(); }
ll sz(string &s){ return (ll)s.size(); }
ll gcd(ll a,ll b){ return ((!b) ?a :gcd(b, a%b)); }
int main(){
ll l,r;
cin >> l >> r;
if(abs(r-l) > 2019) cout << 0 << endl;
else{
ll ans = 2018;
rep(i,l,r+1){
rep(j,i+1,r+1){
ans = min(ans,(i*j)%2019);
}
}
cout << ans << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
typedef long long ll;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (int i = 0; i < (n); ++i)
int main() {
int l,r;
cin >> l >> r;
int g = r - l;
l %= 2019;
r %= 2019;
int ans = 2020;
int m = 2020;
if (l < r )FOR(i,l,r) FOR(j,i+1,r+1) ans = min(ans, (i*j)%2019);
else ans = 0;
if (g >= 2019)ans = 0;
cout << ans << endl;
} | 1 | 67,477,551 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unordered_set>
#include <unordered_map>
#include <iomanip>
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef pair<int,int> pii;
typedef vector<pair<int,int> > vpii;
typedef vector<vector<int> > vvi;
typedef vector<vector<char> > vvc;
typedef vector<vector<string> > vvs;
typedef vector<vector<ll> > vvll;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define irep(it, stl) for(auto it = stl.begin(); it != stl.end(); it++)
#define drep(i,n) for(int i = (n) - 1; i >= 0; --i)
#define fin(ans) cout << (ans) << '\n'
#define mp(p,q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define floatprec(dig) fixed << setprecision(dig)
#define Sort(a) sort(a.begin(), a.end())
#define Rort(a) sort(a.rbegin(), a.rend())
#define MATHPI acos(-1)
#define itn int;
#define invar(typ, var) typ var; cin >> var;
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
template <class T> inline bool chmax(T& a,T b){if(a<b){a=b;return 1;} return 0;}
template <class T> inline bool chmin(T& a,T b){if(a>b){a=b;return 1;} return 0;}
struct io{io(){ios::sync_with_stdio(false);cin.tie(0);}};
const int INF = INT_MAX / 2;
const ll LLINF = 1LL<<60;
constexpr ll MOD = 1000000007;
const double EPS = 1e-9;
signed main(void) {
cin.tie(0); ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
ll ctt = 0;
for(int a=1; a<=N; a++) {
ll amod = a % K;
if(K % 2 == 0 && amod == K / 2) {
ll bt = (N + K / 2) / K;
ll ct = (N + K / 2) / K;
ctt += bt * ct;
} else if(amod == 0) {
ll bt = N / K;
ll ct = N / K;
ctt += bt * ct;
}
}
fin(ctt);
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define rep2(i, a, n) for(ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina cout << ' '
#define in(n) cin >> n
#define in2(n, m) cin >> n >> m
#define in3(n, m, l) cin >> n >> m >> l
#define out(n) cout << n
const ll mei = (ll)1e9 + 7;
int main(){
ll n, k, s;
in2(n, k);
if(k % 2 == 1)
s = (n / k) * (n / k) * (n / k);
else{
s = (n / k) * (n / k) * (n / k);
if(n % k >= k / 2)
s += (n / k + 1) * (n / k + 1) * (n / k + 1);
else
s = 2 * s;
}
out(s);
memi;
} | 1 | 58,128,195 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<(n);++i)
#define reps(i,n) for(ll i=1;i<=(n);++i)
using ll = long long;
using str = string;
constexpr long long INF = (1LL<<60);
constexpr long long MOD = (1e9+7);
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 bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>inline bool chmin(T &a,const T &b){if(a>b){a=b;return true;}return false;}
inline void dump(){cout<<endl;}
template<class Head,class... Tail>inline void dump(Head&& head, Tail&&... tail){cout<<head<<", ";dump(forward<Tail>(tail)...);}
template<typename T>inline istream &operator>>(istream&input,vector<T>&v){for(auto &elemnt:v)input>>elemnt;return input;}
main(){
cin.tie(0);
ios::sync_with_stdio(false);
cout<<fixed<<setprecision(20);
ll n;
cin>>n;
vector<long double> x(n),y(n);
rep(i,n)cin>>x[i]>>y[i];
vector<pair<long double,ll>> a(n);
long double sx=0.0,sy=0.0;
rep(i,n){
sx+=x[i];
sy+=y[i];
a[i].first=atan2(x[i],y[i]);
a[i].second=i;
}
sort(a.begin(),a.end());
long double ans=0.0;
rep(i,n)rep(j,n){
long double xx=0.0,yy=0.0;
for(ll k=i;k<=j;++k){
xx+=x[a[k].second];
yy+=y[a[k].second];
}
long double tmp=sqrt(xx*xx+yy*yy);
long double _x=sx-xx,_y=sy-yy;
chmax(tmp,sqrt(_x*_x+_y*_y));
chmax(ans,tmp);
}
cout<<(ans)<<endl;
} | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
#define MAXN 105
#define FOR(i, n) for (int i = 0; i < n; i++)
#define FORR(j, i, n) for (int i = j; i < n; i++)
#define FORD(i, n) for (int i = n - 1; i >= 0; i--)
#define FOBIR(i, n) for (int i = 1; i <= n; i++)
#define pb push_back
#define mp make_pair
#define endl '\n'
#define DUEHOANG \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL)
#define JaydenXia(in, out) \
freopen(in, "r", stdin); \
freopen(out, "w", stdout);
#define ll long long
typedef set<int> si;
typedef vector<int> vi;
typedef pair<ll, ll> pii;
typedef vector<pii> vii;
typedef priority_queue<int> pqi;
typedef stack<int> sti;
typedef queue<int> qi;
typedef deque<int> di;
typedef map<int, int> mii;
#define f first
#define s second
#define EPS 1e-9
int n;
pii psum[MAXN];
pii a[MAXN];
bool ang(pii p, pii q)
{
return atan2(p.f, p.s) < atan2(q.f, q.s);
}
int main()
{
cin >> n;
FOR(i, n)
{
cin >> a[i].f >> a[i].s;
}
sort(a, a+n, ang);
ll ans = 0;
FOR(i, n)
{
ll x = 0;
ll y = 0;
FOR(j, n)
{
x += a[(i+j)%n].f;
y += a[(i+j)%n].s;
ans = max(ans, x*x+y*y);
}
}
cout << setprecision(25) << fixed << sqrt(ans) << endl;
} | 1 | 64,643,567 |
#include<algorithm>
#include<bitset>
#include<cmath>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<string>
#include<unordered_map>
#include<utility>
#include<vector>
constexpr int IINF = (1 << 30) - 1;
constexpr long long LLINF = 1LL << 61;
template<typename T>
bool chmax(T& a, T b){
if(a < b){
a = b;
return true;
}
return false;
}
template<typename T>
bool chmin(T& a, T b){
if(b < a){
a = b;
return true;
}
return false;
}
class UnionFind{
using Weight = long long;
int n;
std::vector<int> par;
std::vector<Weight> weight;
int siz;
public:
UnionFind(int n_ = 0){
init(n_);
}
void init(int n_ = 0){
n = n_;
par.assign(n, -1);
weight.assign(n, 0);
siz = n;
return;
}
int find(int x){
if(par[x] < 0){
return x;
}
int root = find(par[x]);
weight[x] += weight[par[x]];
return par[x] = root;
}
bool same(int x, int y){
return find(x) == find(y);
}
Weight get_weight(int x){
find(x);
return weight[x];
}
bool unite(int x, int y, Weight w = 0){
w += get_weight(x) - get_weight(y);
x = find(x);
y = find(y);
if(x == y){
return false;
}
if(par[x] < par[y]){
std::swap(x, y);
w = -w;
}
par[x] += par[y];
par[y] = x;
weight[y] = w;
--siz;
return true;
}
Weight diff(int x, int y){
return get_weight(y) - get_weight(x);
}
int size_of_set(int x){
return -par[find(x)];
}
int count_set(void){
return siz;
}
};
int main(){
int n, m;
std::cin >> n >> m;
std::vector<int> l(m), r(m);
std::vector<long long> d(m);
for(int i = 0 ; i < m ; ++i){
std::cin >> l[i] >> r[i] >> d[i];
--l[i];
--r[i];
}
UnionFind uf(n);
for(int i = 0 ; i < m ; ++i){
if(uf.same(l[i], r[i]) && uf.diff(l[i], r[i]) != d[i]){
std::cout << "No" << std::endl;
return 0;
}
uf.unite(l[i], r[i], d[i]);
}
std::cout << "Yes" << std::endl;
return 0;
} | #include<bits/stdc++.h>
using ll = long long;
using namespace std;
const ll INF = 1000000000000000000;
const ll mod = 1000000007;
ll ok[12345678], cost[12345678];
signed main() {
ll n, m, l, r, d, z = 0, ans = 0;
cin >> n >> m; map <ll, map<ll, ll>> ma;
vector<vector<ll>> G(123456);
queue<ll> que;
if (m == 0) { cout << "Yes" << endl; return 0; }
for (int h = 0; h <= n + 10; h++) { ok[h] = 1; }
for (int h = 0; h < m; h++) {
cin >> l >> r >> d; ma[l][r] = d;
G[l].push_back(r); ok[r] = 0;
}
for (int i = 0; i <= n; i++) {
if (ok[i] != 0) {
if (!G[i].empty()) { cost[i] = 1; que.push(i); }
}
}
if (que.empty()) { cout << "No" << endl; return 0; }
while (que.size()) {
for (int i = 0; i < G[que.front()].size(); i++) {
if (cost[G[que.front()][i]] == 0) {
que.push(G[que.front()][i]);
cost[G[que.front()][i]] = cost[que.front()] + ma[que.front()][G[que.front()][i]];
}
else {
if (cost[G[que.front()][i]] != cost[que.front()] + ma[que.front()][G[que.front()][i]]) {
cout << "No" << endl; return 0;
}
}
}
que.pop();
}
cout << "Yes" << endl;
return 0;
} | 1 | 75,535,317 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,s,n) for(int i=s;i<n;i++)
#define all(a) (a).begin(),(a).end()
struct dice {
int d[6];
void rotation(char com){
if(com == 'E'){
int tmp = d[0];
d[0] = d[3];
d[3] = d[5];
d[5] = d[2];
d[2] = tmp;
}
else if(com == 'S'){
int tmp = d[4];
d[4] = d[5];
d[5] = d[1];
d[1] = d[0];
d[0] = tmp;
}
else if(com == 'N'){
int tmp = d[0];
d[0] = d[1];
d[1] = d[5];
d[5] = d[4];
d[4] = tmp;
}
else if(com == 'W'){
int tmp = d[0];
d[0] = d[2];
d[2] = d[5];
d[5] = d[3];
d[3] = tmp;
}
else if(com == 'R'){
int tmp = d[3];
d[3] = d[1];
d[1] = d[2];
d[2] = d[4];
d[4] = tmp;
}
}
int guess(int U, int F){
int cnt = 0;
while(U != d[0]){
if(cnt % 2)rotation('N');
else rotation('W');
cnt++;
}
while(F != d[1])
rotation('R');
return d[2];
}
};
int main(){
dice D;
rep(i,6)cin >> D.d[i];
int q; cin >> q;
rep(i,q){
int U, F;
cin >> U >> F;
cout << D.guess(U, F) << endl;
}
return 0;
} | #include<iostream>
using namespace std;
int main(){
int a[6],num,x,y;
for(int i=0;i<6;i++)cin>>a[i];
cin>>num;
for(int i=0;i<num;i++){
cin>>x>>y;
if(x==a[0]&&y==a[1]||x==a[1]&&y==a[5]||x==a[5]&&y==a[4]||x==a[4]&&y==a[0]){
cout<<a[2]<<endl;
}
if(x==a[1]&&y==a[0]||x==a[5]&&y==a[1]||x==a[4]&&y==a[5]||x==a[0]&&y==a[4]){
cout<<a[3]<<endl;
}
if(x==a[3]&&y==a[1]||x==a[1]&&y==a[2]||x==a[2]&&y==a[4]||x==a[4]&&y==a[3]){
cout<<a[0]<<endl;
}
if(x==a[1]&&y==a[3]||x==a[2]&&y==a[1]||x==a[4]&&y==a[2]||x==a[3]&&y==a[4]){
cout<<a[5]<<endl;
}
if(x==a[0]&&y==a[3]||x==a[3]&&y==a[5]||x==a[5]&&y==a[2]||x==a[2]&&y==a[0]){
cout<<a[1]<<endl;
}
if(x==a[3]&&y==a[0]||x==a[5]&&y==a[3]||x==a[2]&&y==a[5]||x==a[0]&&y==a[2]){
cout<<a[4]<<endl;
}
}
} | 1 | 15,453,901 |
#include <bits/stdc++.h>
using namespace std;
#define PI 3.141592653589793
#define MOD 1000000007
#define rep(i, n) for (ll i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
typedef long double ld;
int main(){
ll A;
ld B;
cin >> A >> B;
ll ib = B*100+0.5;
A *= ib;
A /= 100;
cout << A << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int A;
double B;
cin >> A >> B;
long long int C = B*100+0.1;
A = A * C;
A /= 100;
cout << A << endl;
} | 1 | 66,948,592 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (long long i = 0; i < N; i++)
using ll = long long;
const int MAX = 1000000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(int n, int k) {
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
template <class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INF = 1LL << 60;
int main() {
string S, T;
cin >> S >> T;
vector<char> start(26, -1);
vector<char> goal(26, -1);
rep(i, S.length()) {
ll start_index = S[i] - 'a';
ll goal_index = T[i] - 'a';
if (start[start_index] != -1 || goal[goal_index] != -1) {
if (start[start_index] != T[i] || goal[goal_index] != S[i]) {
cout << "No" << endl;
return 0;
}
}
start[start_index] = T[i];
goal[goal_index] = S[i];
}
cout << "Yes" << endl;
return 0;
} | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <deque>
#include <numeric>
#include <sstream>
#include <iomanip>
using lint = long long;
int main()
{
std::string s;
std::cin >> s;
std::string t;
std::cin >> t;
std::map<char, std::unordered_set<char>> smap;
std::map<char, std::unordered_set<char>> tmap;
for (int i = 0; i < s.size(); ++i)
{
char s_char = s[i];
char t_char = t[i];
smap[s_char].insert(t_char);
tmap[t_char].insert(s_char);
if (smap[s_char].size() > 1 || tmap[t_char].size() > 1)
{
printf("No");
return 0;
}
}
printf("Yes");
return 0;
} | 1 | 20,314,850 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,r,in;
cin>>n;
cin>>r;
if (n>=10)
in=r;
else
in = r+ (100*(10-n));
cout<<in;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if(a<10)cout<<b+100*(10-a)<<endl;
else cout<<b<<endl;
return 0;
} | 1 | 39,595,509 |
#include<bits/stdc++.h>
using namespace std;
#define MAX 100001
#define MOD 1000000007
#define ll long long
#define ld long double
#define fast ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
int main() {
fast;
int t = 1;
while(t--) {
string s;
cin >> s;
ll n = s.size();
ll ans = 0;
for(ll i=0;i<n;i++) {
ans += s[i] - '0';
ans %= MOD;
}
if(ans % 9 == 0) cout << "Yes" << endl;
else cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin>>s;
int len=s.size();
int ans=0;
for(int i=0;i<len;i++){
ans+=s[i]-'0';
}
if(ans%9==0)cout<<"Yes"<<endl;
else{
cout<<"No"<<endl;
}
} | 1 | 33,264,138 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int64_t lucas(int N) {
vector<int64_t> L = {2, 1};
for (int i = 2; i < N + 1; i++) {
L.push_back( L.at(i-1) + L.at(i-2) );
}
return L.at(N);
}
int main() {
int N;
cin >> N;
cout << lucas(N) << "\n";
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) begin(v),end(v)
using ll = long long;
int main() {
int n;cin>>n;
vector<ll> vec(90);
vec[0]=2;
vec[1]=1;
for(int i=2;i<=n;i++){
vec[i]=vec[i-1]+vec[i-2];
}
cout<<vec[n]<<endl;
} | 1 | 80,769,155 |
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
while (true) {
int n,k;
cin >> n >> k;
if(n == 0 && k == 0)
return 0;
int sum[n+1];
sum[0] = 0;
for (int i = 0; i < n; i++){
int s;
cin >> s;
sum[i+1] = sum[i] + s;
}
int ans = -1987654321;
for (int i = 0; i < n-k; i++){
int tmp = sum[i+k] - sum[i];
if(tmp > ans)
ans = tmp;
}
cout << ans << endl;
}
return 0;
} | #include<iostream>
using namespace std;
int main(){
int n,k,s,ans;
int a[100001];
while(cin>>n>>k){
if(n==0&&k==0)break;
for(int i=0;i<n;i++)cin>>a[i];
s=0;
for(int i=0;i<n-k+1;i++){
if(i==0)for(int j=i;j<i+k;j++)s+=a[j];
if(i!=0){s-=a[i-1]; s+=a[i+k-1];}
if(i==0)ans=s;
if(s>ans)ans=s;}
cout<<ans<<endl;}} | 1 | 79,803,052 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cstdio>
using namespace std;
int main() {
int n;
int i = 1;
while (cin >> n, n) {
printf("Case %d: %d\n", i, n);
++i;
}
} | #include<iostream>
using namespace std;
int i = 1, a = 1;
int main()
{
cin >> a;
while (a * i != 0)
{
cout << "Case " << i << ": " << a << endl;
i++;
cin >> a;
}
return 0;
} | 1 | 67,376,576 |
#include <bits/stdc++.h>
#define rep(i,a,b) for(ll i=ll(a);i<ll(b);i++)
#define irep(i,a,b) for(ll i=ll(a);i>=ll(b);i--)
#define pb push_back
#define mp make_pair
#define F .first
#define S .second
using ll=long long;
using ld=long double;
using namespace std;
const ll mod=1e9+7;
ll GCD(ll a, ll b) { return b ? GCD(b, a%b) : a; }
pair<ld,ll> a[4];
int main(){
ld n,tmp;
rep(i,0,4){cin>>tmp;a[i]F=tmp*8/powl(2,i);a[i]S=pow(2,i);}
cin>>n;
n*=4;
sort(a,a+4);
ll cnt=n,ans=0,t;
rep(i,0,4){ans+=(cnt/a[i]S)*(a[i]F*a[i]S/8);cnt%=a[i]S;}
cout<<ans<<endl;
} | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define repLRE(i, l, r) for (ll i = (l); i <= (r); ++i)
#define rrepLRE(i, l, r) for (ll i = (l); i >= (r); --i)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define Lower_bound(v, x) \
distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) \
distance(v.begin(), upper_bound(v.begin(), v.end(), x))
using ll = long long;
using ull = unsigned long long;
using P = pair<ll, ll>;
using T = tuple<ll, ll, ll>;
using vll = vector<ll>;
using vP = vector<P>;
using vT = vector<T>;
using vvll = vector<vector<ll>>;
using vvP = vector<vector<P>>;
using dqll = deque<ll>;
ll dx[9] = {-1, 1, 0, 0, -1, -1, 1, 1, 0};
ll dy[9] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
const ll INF = 1LL << 50;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cout << fixed << setprecision(15);
ll q,h,s,d,n;
cin >> q >> h >> s >> d >> n;
h = min(2*q,h);
s = min(2*h,s);
ll ca = d*(n/2) + s*(n%2);
ll cb = s*n;
ll ans =min(ca, cb);
cout << ans << endl;
return 0;
} | 1 | 99,991,315 |
#include<iostream>
#include<string>
#include<cstdlib>
#include<algorithm>
using namespace std;
int main(void){
int i;
string s;
getline(cin,s);
for(i=0;i<s.size();i++){
if(isupper(s[i])!=0) s[i]=tolower(s[i]);
else if(islower(s[i])!=0) s[i]=toupper(s[i]);
}
cout << s << endl;
return 0;
} | #include <iostream>
#include <cstdio>
int main()
{
int i=0,num;
char str[1200],c='a';
while(c!='\n'){
scanf("%c",&c);
str[i]=c;
i++;
}
num=i;
for(i=0;i<num;i++){
if(97<=str[i]&&str[i]<=122){
str[i]=str[i]-32;
}else if(65<=str[i]&&str[i]<=90){
str[i]=str[i]+32;
}
}
i=-1;
while(str[i++]!='\n'){
if(str[i]=='\n')break;
std::cout<<str[i];
}
std::cout<<std::endl;
return 0;
} | 1 | 86,172,610 |
#include<bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define all(v) (v).begin(),(v).end()
using namespace std;
using ll=long long;
using ld=long double;
using pii=pair<int, int>;
using vi=vector<int>;
using vii=vector<vector<int>>;
const ll LINF=1LL<<60;
const int INF=1<<29;
const int MOD=1e9+7;
template<typename T> bool chmin(T &a,const T b){if(a>b){a=b; return true;}return false;}
template<typename T> bool chmax(T &a,const T b){if(a<b){a=b; return true;}return false;}
int main(){
int N, K; cin >> N >> K;
string S; cin >> S;
vi pos;
for(int i=0; i<N; i++){
pos.push_back(i);
int cur=i;
while(cur < N && S[cur] == S[i]) cur++;
i=cur-1;
}
int ans=0;
for(int i=0; i<(int)pos.size(); i++){
if(S[pos[i]] == '0'){
if(i+2*K >= (int)pos.size()) chmax(ans, N-pos[i]);
else chmax(ans, pos[i+2*K]-pos[i]);
}
else{
if(i+2*K+1 >= (int)pos.size()) chmax(ans, N-pos[i]);
else chmax(ans, pos[i+2*K+1]-pos[i]);
}
}
cout << ans << endl;
return 0;
} | #define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<vector>
#include<functional>
#include<algorithm>
#include<stdlib.h>
#include<string>
#include<string.h>
#define _USE_MATH_DEFINES
#include<math.h>
#include<deque>
#include<set>
#include<map>
#include<queue>
#include<list>
#include<iostream>
#include <bitset>
using namespace std;
typedef long long ll;
#define rep(i,a,b) for(auto i=a;i<b;i++)
#define all(_x) _x.begin(), _x.end()
#define r_sort(_x) sort(_x.begin(), _x.end(), std::greater<int>())
#define vec_cnt(_a, _n) (upper_bound(all(_a), _n) - lower_bound(all(_a), _n))
#define vec_unique(_a) _a.erase(std::unique(all(_a)), _a.end());
#define vvec vector<vector<ll>>
ll gcd(ll a, ll b) { return a % b == 0 ? b : gcd(b, a % b); }
ll lcm(ll a, ll b) { return (a / gcd(a, b)) * b; }
#define INF 1 << 30
const int mod = 1000000007;
ll power(ll x, ll p) { ll a = 1; while (p > 0) { if (p % 2 == 0) { x *= x; p /= 2; } else { a *= x; p--; } }return a; }
ll mpower(ll x, ll p) { ll a = 1; while (p > 0) { if (p % 2 == 0) { x = x * x % mod; p /= 2; } else { a = a * x % mod; p--; } }return a; }
ll c(ll n, ll k) { ll a = 1; rep(i, 1, k) { a *= n - i + 1; a /= i; }return a; }
ll mc(ll n, ll m) { ll k = 1, l = 1; rep(i, n - m + 1, n + 1) k = k * i % mod; rep(i, 1, m + 1) l = l * i % mod; l = mpower(l, mod - 2); return k * l % mod; }
int main(void) {
int n, k, c = 1;
string s;
cin >> n >> k >> s;
s.push_back('2');
deque<int> l;
if (s[0] == '1')l.push_back(0);
rep(i, 0, s.size() - 1) {
if (s[i] == s[i + 1]) {
c++;
}
else {
l.push_back(c);
c = 1;
}
}
int sum = 0, ans = 0;
l.push_front(0);
l.push_back(0);
l.push_back(0);
rep(i, 0, min(2 * k + 1, (int)l.size())) {
sum += l[i];
}
ans = sum;
for (int i = 2; i + 2 * k < (int)l.size() - 1; i += 2) {
sum += l[i + 2 * k] + l[i + 2 * k - 1] - l[i - 1] - l[i - 2];
ans = max(ans, sum);
}
printf("%d\n", ans);
return 0;
} | 1 | 2,857,240 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define dl double long
#define rep(i, m, n) for(ll i = (ll)(m); i < (ll)(n); ++i)
#define rrep(i, m, n) for(ll i = (ll)(m); i > (ll)(n); --i)
const ll MOD = 1000000007;
const double pi = 3.14159265358979323846;
int n;
void countingsort(int a[], int b[], int k){
int c[10001];
rep(i, 0, k+1) c[i] = 0;
rep(j, 1, n+1) c[a[j]]++;
rep(i, 1, k+1) c[i] += c[i-1];
rrep(j, n, 0) {
b[c[a[j]]] = a[j];
c[a[j]]--;
}
}
int main(void){
int *a, *b;
cin >> n;
a = new int[n+1];
b = new int[n+1];
rep(i, 1, n+1) cin >> a[i];
countingsort(a, b, 10000);
rep(i, 1, n+1) {
if(i-1) cout << ' ';
cout << b[i];
}
cout << endl;
return 0;
} | #include<iostream>
#include<vector>
using namespace std;
int out(vector<int> &A,int n){
int i;
for (i=0;i<=n-2;i++){
cout << A[i] <<" ";
}
cout << A[n-1] <<endl;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n,i,j;
cin >> n;
vector<int> A(n);
for (i=0;i<n;i++){
cin >> A[i];
}
const int k=10000;
vector<int> C(k+1,0);
vector<int> B(n);
for (i=0;i<n;i++){
C[A[i]]++;
}
for (j=1;j<k+1;j++){
C[j]=C[j]+C[j-1];
}
for (i=n-1;i>-1;i--){
B[C[A[i]]-1]=A[i];
C[A[i]]--;
}
out(B,n);
return 0;
} | 1 | 77,743,758 |
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <stack>
#include <bitset>
#include <queue>
using namespace std;
typedef long long Int;
typedef pair<Int,Int> P;
#define print(x) cout<<(x)<<endl
#define INF10 10000000000
#define INF5 100000
#define EPS 1e-10
#define MOD 1000000007
char c[] = " ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int main() {
int H, W;
cin >> H >> W;
string ans;
for (int i = 1; i <= H; i++) {
for (int j = 1; j <= W; j++) {
string s;
cin >> s;
if (s == "snuke") {
ans += c[j]; ans += to_string(i);
}
}
}
print(ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef ostringstream OSS; typedef istringstream ISS;
typedef long long LL;
typedef pair<int, int> PII; typedef pair<LL, LL> PLL;
typedef vector<int> VI; typedef vector<VI> VVI; typedef vector<VVI> VVVI;
typedef vector<LL> VLL; typedef vector<VLL> VVLL; typedef vector<VVLL> VVVLL;
typedef vector<double> VD; typedef vector<VD> VVD; typedef vector<VVD> VVVD;
typedef vector<string> VS; typedef vector<VS> VVS; typedef vector<VVS> VVVS;
typedef vector<bool> VB; typedef vector<VB> VVB; typedef vector<VVB> VVVB;
typedef vector<PII> VPII; typedef vector<VPII> VVPII; typedef vector<VVPII> VVVPII;
typedef vector<PLL> VPLL; typedef vector<VPLL> VVPLL; typedef vector<VVPLL> VVVPLL;
typedef unsigned int UI;
typedef vector<UI> VUI;
typedef vector<VUI> VVUI;
#define fst first
#define snd second
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(x) (x).begin(),(x).end()
#define RALL(x) (x).rbegin(),(x).rend()
#define RANGEBOX(x,y,maxX,maxY) (0 <= (x) && 0 <= (y) && (x) < (maxX) && (y) < (maxY))
#define RANGE(x, l, r) ((l) <= (x) && (x) <= (r))
#define rep(i, N) for (int i = 0; i < (int)(N); i++)
#define rrep(i, N) for (int i = N - 1; i >= 0; i--)
#define REP(i, init, N) for (int i = (init); i < (int)(N); i++)
#define RREP(i, N, last) for (int i = (init - 1); i >= last; i--)
#define MAXUD(orig, target) orig = max(orig, target)
#define MINUD(orig, target) orig = min(orig, target)
#define DUMP(x) cerr << #x << " = " << (x) << endl
template < typename T > inline T fromString(const string &s) { T res; ISS iss(s); iss >> res; return res; };
template < typename T > inline string toString(const T &a) { OSS oss; oss << a; return oss.str(); };
template<typename T=int> inline void dump(vector<T> vs, bool ent=false) { rep(i, vs.size()) cout << vs[i] << (i+1==vs.size() ? '\n' : ' '); if (ent) cout << endl; }
template<typename T = int> inline void dump(vector<vector<T>> vs, bool ent=false) { rep(i, vs.size()) dump<T>(vs[i]); if (ent) cout << endl; }
const int INF = 0x3f3f3f3f;
const LL INFL = 0x3f3f3f3f3f3f3f3fLL;
const double DINF = 0x3f3f3f3f;
const int DX[] = {1, 0, -1, 0};
const int DY[] = {0, -1, 0, 1};
const double EPS = 1e-12;
template<typename T = int> inline T in() { T x; cin >> x; return x; }
template<typename T = int> inline vector<T> in(int n) { vector<T> xs(n); rep(i, n) cin >> xs[i]; return xs; }
template<typename T = int> inline vector<vector<T>> in(int n, int m) { vector<vector<T>> xs(n, vector<T>(m)); rep(i, n) rep(j, m) cin >> xs[i][j]; return xs; }
int main(void) {
int h, w;
cin >> h >> w;
VVS ts = in<string>(h, w);
int x = 0, y = 0;
rep(i, h) rep(j, w) if (ts[i][j] == "snuke") {
y = i;
x = j;
}
cout << (char)('A' + x) << (y + 1) << endl;
return 0;
} | 1 | 39,313,998 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/trie_policy.hpp>
#define pb push_back
#define mp make_pair
#define taskname "A"
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> ii;
typedef tree <int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
const int maxn = 1e5 + 5;
const int logn = 20;
int P[maxn][logn];
int n , L , q;
ll x[maxn];
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
if(fopen(taskname".INP","r")){
freopen(taskname".INP", "r",stdin);
freopen(taskname".OUT", "w",stdout);
}
cin >> n;
for(int i = 1 ; i <= n ; ++i){
cin >> x[i];
}
cin >> L >> q;
for(int i = 1 ; i <= n ; ++i){
P[i][0] = P[i - 1][0];
while(P[i][0] <= n && x[P[i][0]] - x[i] <= L)++P[i][0];
--P[i][0];
}
for(int j = 1 ; j < logn ; ++j){
for(int i = 1 ; i <= n ; ++i){
P[i][j] = P[P[i][j - 1]][j - 1];
}
}
for(int i = 1 ; i <= q ; ++i){
int u , v;cin >> u >> v;
if(u > v)swap(u , v);
int res = 0;
for(int j = logn - 1 ; j >= 0 ; --j){
if(P[u][j] < v)u = P[u][j] , res += (1 << j);
}
cout << res + 1 << '\n';
}
} | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
using ll = long long int;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vii = vector<pii>;
using vll = vector<pll>;
#define Scd(x) scanf("%d", &x)
#define Scd2(x,y) scanf("%d%d", &x, &y)
#define Scd3(x,y,z) scanf("%d%d%d", &x, &y, &z)
#define Scll(x) scanf("%lld", &x)
#define Scll2(x,y) scanf("%lld%lld", &x, &y)
#define Scll3(x,y,z) scanf("%lld%lld%lld", &x, &y, &z)
#define Scc(c) scanf("%c", &c);
#define Scs(s) scanf("%s", s);
#define Scstr(s) scanf("%s", &s);
#define EPS (1e-7)
#define INF (2e9)
#define PI (acos(-1))
#define Repe(x,y,z) for(ll x = z; x < y; x++)
#define Rep(x,y) Repe(x,y,0)
#define RRepe(x,y,z) for(ll x = y-z-1; x >= 0; x--)
#define RRep(x,y) RRepe(x,y,0)
#define YesNo(a) (a)?printf("Yes\n"):printf("No\n")
#define YESNO(a) (a)?printf("YES\n"):printf("NO\n")
int main() {
int N,L;
Scd(N);
vi x(N);
Rep(i,N){
Scd(x[i]);
}
Scd(L);
vector<vi> pare(N,vi(20));
int to = 1;
Rep(from,N){
while( to < N-1 && x[to+1] <= x[from]+L ){
to++;
}
pare[from][0] = to;
}
RRep(from,N){
Repe(di,20,1){
pare[from][di] = pare[pare[from][di-1]][di-1];
}
}
auto paresch = [&]( int a, int dis){
int bi = 0;
while( dis >= (1<<bi) ){
if( dis & (1<<bi) ) a = pare[a][bi];
bi++;
}
return a;
};
auto sch = [&]( int a, int b ){
int l = 0,r = N-1,c = 1;
while( r-l > 1 ){
c = (r+l)/2;
if( paresch(a,c) >= b ) r = c;
else l = c;
}
return r;
};
int Q;
int a,b;
Scd(Q);
Rep(qqi,Q){
Scd2(a,b);
a--,b--;
if( a>b ) swap(a,b);
printf ("%d\n", sch(a,b) );
}
return 0;
} | 1 | 70,913,340 |
#include<bits/stdc++.h>
using namespace std;
int coin[]={500,100,50,10,5,1};
int main(){
int N;
while(scanf("%d",&N),N){
N=1000-N;
int ans=0;
for(int i=0;i<6;i++){
ans+=N/coin[i];
N%=coin[i];
}
printf("%d\n",ans);
}
return 0;
} | #include <iostream>
using namespace std;
int main(void){
int n = 1;
int pay ;
while (n){
int cent = 0;
cin >>n;
if (n==0){
break;
}
pay = 1000 - n;
if (pay >= 500){
pay -= 500;
cent++;
}
while (pay >= 100){
pay -= 100;
cent++;
}
while (pay >= 50){
pay -= 50;
cent++;
}
while (pay >= 10){
pay -= 10;
cent++;
}
while (pay >= 5){
pay -= 5;
cent++;
}
while (pay >= 1){
pay -= 1;
cent++;
}
cout << cent << "\n";
}
return 0;
} | 1 | 7,824,215 |
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin>>s;
bool b=true;
int cnt=0,x;
if(s[0]!='A') b=false;
for(int i=2;i<s.size()-1;i++){
if(s[i]=='C'){
cnt++;
x=i;
}
}
if(cnt!=1) b=false;
for(int i=1;i<s.size();i++){
if(i==x) continue;
if(s[i]<'a' || s[i]>'z') b=false;
}
if(b) cout<<"AC"<<endl;
else cout<<"WA"<<endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define prtd(var, i) cout << fixed << setprecision(i) << var << endl;
#define ll long long
using namespace std;
#define INF 1e18LL
const ll MAX = 1000000000000000000;
int main(){
string s;
cin >> s;
bool exist = true;
int cnt = 0;
int n = s.size();
rep(i, n){
if(i == 0){
if(s[i] != 'A') exist = false;
}else if(2 <= i && i <= n-2){
if(s[i] == 'C') cnt++;
}else{
if('a' <= s[i] && s[i] <= 'z'){
continue;
}else{
exist = false;
}
}
}
if(exist && cnt == 1) cout << "AC" << endl;
else cout << "WA" << endl;
} | 1 | 85,107,116 |
#include <algorithm>
#include <iostream>
using namespace std;
const int T[10] = {6, 2, 5, 5, 4, 5, 6, 3, 7, 6};
int main()
{
int n, m;
cin >> n >> m;
int a[10];
for(int i = 0; i < m; i++) cin >> a[i];
sort(a, a + m, greater<int>());
int dp[10005];
for(int i = 0; i <= n; i++) dp[i] = -1;
dp[0] = 0;
for(int i = 1; i <= n; i++){
for(int j = 0; j < m; j++){
int k = a[j];
if(T[k] <= i) dp[i] = max(dp[i], dp[i - T[k]] + 1);
}
}
int s = n;
for(int i = dp[n]; i > 0; i--){
for(int j = 0; j < m; j++){
int k = a[j];
if(T[k] <= s && dp[s - T[k]] == i - 1){
s -= T[k];
cout << k;
}
}
}
cout << endl;
} | #include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <stack>
#include<algorithm>
#include<sstream>
#include<iomanip>
using namespace std;
typedef long long ll;
const ll MOD_CONST = 1000000007;
const ll BIG_NUM = 1000000000000000000;
int main() {
int n, m;
cin >> n >> m;
vector<int> cost{ 100,2,5,5,4,5,6,3,7,6 };
vector<int> a(m);
for (int i = 0; i < m;i++) {
cin >> a[i];
}
sort(a.begin(), a.end(),greater<int>());
vector<int> dp(n+1);
for (int i = 1; i <= n;i++) {
dp[i] = -100000000;
for (int j = 0; j < m;j++) {
if (i >= cost[a[j]]) {
dp[i] = max(dp[i - cost[a[j]]]+1, dp[i]);
}
}
}
string s;
for (int i = n; i > 0;) {
for (int j = 0; j < m;j++) {
if (i >= cost[a[j]] && dp[i-cost[a[j]]] == (dp[i] -1)) {
s += ('0' + a[j]);
i -= cost[a[j]];
break;
}
}
}
cout << s << endl;
} | 1 | 24,205,860 |
#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rrep(i,n) for(ll i = 1; i <= (n); ++i)
#define drep(i,n) for(ll i = (n)-1; i >= 0; --i)
#define all(v) v.begin(),v.end()
#define len(x) (ll)(x).length()
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define pb push_back
#define sz(x) (ll)(x).size()
#define v(T) vector<T>
#define vv(T) vector<vector<T>>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
ll gcd(ll a,ll b){if(a%b==0){return b;}else{return(gcd(b,a%b));}}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
const int INF=1e9;
const ll MX = 1e18;
const ll MOD=INF+7;
const int di[] = {-1,0,1,0};
const int dj[] = {0,-1,0,1};
const double PI=acos(-1);
#define dame { puts("-1"); return 0;}
#define yn {puts("Yes");}else{puts("No");}
#define YN {puts("YES");}else{puts("NO");}
const ll MAX = 1000001;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {fac[0] = fac[1] = 1;finv[0] = finv[1] = 1;inv[1] = 1;for (ll i = 2; i < MAX; i++){fac[i] = fac[i - 1] * i % MOD;inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;finv[i] = finv[i - 1] * inv[i] % MOD;}}
long long COM(ll n, ll k){if (n < k) return 0;if (n < 0 || k < 0) return 0;return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;}
ll llpow(ll n,ll i){ll cnt=n; for(ll j=0;j<i-1;j++){n*=cnt;}return n;}
int main(){
int a,b;
cin>>a>>b;
ll cnt=0;
if(a<=b){
cout<<min(abs(abs(a)-abs(b))+1,b-a)<<endl;
return 0;
}
if(a>b){
if(a>0&&b>0){
cout<<a-b+2<<endl;
return 0;
}
if(a<0&&b<0){
cout<<a-b+2<<endl;
return 0;
}
else{
cout<<abs(abs(a)-abs(b))+1<<endl;
return 0;
}
}
} | #include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<numeric>
#include<math.h>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main() {
ll x, y;
cin >> x >> y;
ll ans = 1e18;
rep(d1, 2) rep(d2, 2) {
ll res = d1 + d2;
ll xx = x * (d1 ? -1 : 1);
ll yy = y * (d2 ? -1 : 1);
if ( xx <= yy ) {
ans = min(ans, res + yy - xx );
}
}
cout << ans << endl;
return 0;
} | 1 | 79,350,485 |
#include<bits/stdc++.h>
#include<map>
#include<set>
#include<stack>
using namespace std;
#define night_rider ios::sync_with_stdio(false);cin.tie(NULL);
#define int long long int
#define double long double
#define en "\n"
#define fi first
#define se second
#define MP make_pair
#define PB push_back
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
#define toUpper(x) transform(x.begin(), x.end(), x.begin(),::toupper);
#define toLower(x) transform(x.begin(), x.end(), x.begin(),::tolower);
#define rep(i,x,y) for(int i=x ; i<y ; i++)
#define erep(i,x,y) for(int i=x ; i<=y ; i++)
#define erepr(i,x,y) for(int i=x ; i>=y ; i--)
#define repr(i,x,y) for(int i=x ; i>y ; i--)
typedef vector<int> vi;
typedef vector<vector<int>> vii;
typedef pair<int,int> pi;
typedef vector<pair<int,int>> pii;
bool secdes(const pair<int,int>&a , const pair<int,int>&b){if(a.se==b.se){return a.fi>b.fi;}else{return a.se>b.se;}}
bool sir(const pair<int,int>&a , const pair<int,int>&b){if(a.fi==b.fi){return a.se>b.se;}else{return a.first>b.first;}}
bool bysec(const pair<int,int>&a , const pair<int,int>&b){if(a.se==b.se){return a.fi<b.fi;} else{return a.se<b.se;}}
const int no=3e6+5;
const int modulo=1e9+7;
const int inf=1e18;
const int N=2001;
int ar[no],br[no],mat[N][N];
int dx[]={-1 , 0 , 1 , 0};
int dy[]={0 , 1 , 0 , -1};
char dc[]={'L', 'D' , 'R' ,'U'};
int mul(int x , int y , int mod) {
return ((x%mod)*(y%mod))%mod;
}
int powwmod(int x, int y , int mod) { int res=1; while (y) { if (y & 1){ y--; res=mul(res,x,mod); res%=mod; } else { y/=2; x=mul(x,x,mod); x%=mod; } } return res%mod; }
int poww(int x , int y) { int res=1; while(y) { if(y%2) { y--; res=res*x; } else { y/=2; x=x*x; } } return res; }
int div(int x , int y , int mod) {
return x*poww(y,mod-2)%mod ;
}
bool comp(int x, int y) {
return (x < y);
return (x > y);
}
int gcd(int x, int y) { if(y==0) return x; else return gcd(y,x%y); }
int lcm(int x, int y) { return (x*y)/gcd(x,y);}
vi adj[no];
int used[no];
void solve (){
int n,m,a,b,x,y;
cin>>n>>m>>a>>b;
x=max(m*a,m*b);
cout<<max(n*a,max(n*b,x));
}
inline void runn(){
#ifndef ONLINE JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
}
signed main()
{
night_rider
int t=1;
while(t--){
solve();
}
} | #include <bits/stdc++.h>
#define fio ios::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
using namespace std;
const int INF = 1e9 + 7;
int main(){
#ifndef ONLINE_JUDGE
freopen("test.inp", "r", stdin);
#endif
fio;
long long a, b, c, d;
cin >> a >> b >> c >> d;
cout << max({a * c, a * d, b * c, b * d});
} | 1 | 82,972,690 |
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<ll, int> ll_i;
typedef pair<double, int> d_i;
typedef pair<ll, ll> ll_ll;
typedef pair<double, double> d_d;
struct edge { int u, v; ll w; };
ll MOD = 1000000007;
ll _MOD = 1000000009;
double EPS = 1e-10;
int main() {
string l = "qwertasdfgzxcvb";
string r = "yuiophjklnm";
vector<int> a(256);
for (int i = 0; i < l.length(); i++)
a[l[i]] = -1;
for (int i = 0; i < r.length(); i++)
a[r[i]] = 1;
for (;;) {
string s; cin >> s;
if (s == "#") break;
int x = 0, cnt = 0;
for (int i = 0; i < s.length(); i++) {
char c = s[i];
if (a[c] != x) {
x = a[c];
cnt++;
}
}
cout << cnt - 1 << endl;
}
} | #include <iostream>
using namespace std;
int main(void){
string k_l = "qwertasdfgzxcvb";
string k_r = "yuiophjklnm";
while(1) {
string s;
cin >> s;
int result = 0;
int mode = -1;
if (s == "#") break;
for(int i=0; i<s.length(); i++) {
if ((int)k_r.find(s[i]) >= 0) {
if (mode==0) result += 1;
mode = 1;
} else {
if (mode==1) result += 1;
mode = 0;
}
}
cout << result << endl;
}
} | 1 | 54,143,465 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
template<typename H> bool chmin(H& v1, const H v2) { if (v1 > v2) { v1 = v2; return true; } return false; }
template<typename H> bool chmax(H& v1, const H v2) { if (v1 < v2) { v1 = v2; return true; } return false; }
template<typename H> void read(H& head) { cin >> head; }
template<typename H, typename ...T> void read(H& head, T& ...tail) { cin >> head; read(tail...); }
template<typename H> void print(H head) { cout << head << '\n'; }
template<typename H, typename ...T> void print(H head, T ...tail) { cout << head << " "; print(tail...); }
int main() {
cin.tie(0)->sync_with_stdio(0);
cin.exceptions(cin.failbit);
int n, m, k; read(n, m, k);
bool ok = 0;
rep(i, 0, n + 1) rep(j, 0, m + 1) if (i * m + j * n - i * j * 2 == k) ok = 1;
print(ok ? "Yes" : "No");
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define SORT(c) sort((c).begin(),(c).end())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define pv(val) cerr << #val << '=' << (val) << endl
const int INF = 1e9;
int main(void){
int N, M, K; cin >> N >> M >> K;
bool ok = false;
REP(i,N+1){
REP(j,M+1){
if((j*N + i*M - 2*i*j) == K) ok = true;
}
}
if(ok) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | 1 | 56,427,139 |
#include<cstdio>
#include<algorithm>
using namespace std;
int main(void)
{
int a,b;
scanf("%d%d",&a,&b);
printf("%d\n",(a+1)-b);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define rep(i,m,n) for(int i=m;i<n;i++)
ll mod=1e9+7;
int main(){
int h,w;
cin>>h>>w;
cout<<h+1-w<<endl;
} | 1 | 90,580,155 |
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
#define vec(s) vector<s>
#define vvec(s) vector<vector<s>>
typedef vector<lli> vi;
typedef vector<vi> vvi;
typedef pair<lli,lli> pii;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define YN(x) cout<<(bool x?"Yes":"No")<<endl;
#define out(s) cout<<s<<endl;
#define pb(s) push_back(s);
#define sp " ";
#define INF 10000000000
#define all(s) s.begin(),s.end()
void vout(vi v){
for(int i=0;i<v.size();i++)
cout<<v.at(i)<<endl;
}
int main(){
lli n, m;
cin>>n>>m;
out(n * (n - 1) / 2 + m * (m - 1) / 2);
} | #include<bits/stdc++.h>
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 int long long
using namespace std;
int ctoi(char c) {
switch (c) {
case '0': return 0;
case '1': return 1;
case '2': return 2;
case '3': return 3;
case '4': return 4;
case '5': return 5;
case '6': return 6;
case '7': return 7;
case '8': return 8;
case '9': return 9;
default: return 0;
}
}
ll a,b,c,s,t,x,y,z;
ll A,B,C,S,T,X,Y,Z;
ll count;
long double pi=3.14159265358979323846;
string N,M;
unsigned long long D;
signed main(){
cin>>a>>b;
cout<<(a*(a-1))/2+(b*(b-1))/2;
return 0;
} | 1 | 41,898,522 |
#include <bits/stdc++.h>
using namespace std;
using ull = unsigned long long;
ull gcd(ull a, ull b){
if(b == 0){ return a;}
else {
return gcd(b, a % b);
}
}
int main(void)
{
ull A, B, C, D;
cin >> A >> B >> C >> D;
ull all = B - A + 1;
ull divC = B / C - (A-1) / C;
ull divD = B / D - (A-1) / D;
ull CD = C*D/gcd(max(C,D) , min(C,D));
ull divCD = B/CD - (A-1)/CD;
cout << all - (divC + divD - divCD) << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
using ll=long long;
int main()
{
ll a,b,c,d;
cin>>a>>b>>c>>d;
a--;
auto f=[](ll i,ll t){
return i/t;
};
auto solve=[&](ll s){
return f(s,c)+f(s,d)-f(s,lcm(c,d));
};
cout<<(b-a)-(solve(b)-solve(a));
} | 1 | 58,322,658 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
int main(){
int l;
cin >> l;
double a = l/3.0;
printf("%.12lf\n",a*a*a);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int l;
cin >> l;
long long V27 = l * l * l;
double v = V27 / 27.0;
printf("%.10lf",v);
} | 1 | 3,474,057 |
#include <iostream>
#include <vector>
#include <algorithm>
#define In_Heap(n,i) ((-1)<(i))&&((i)<(n))
#define lt(i,j) ((i)>(j))
#define Parent(i) ((i-1)>>1)
#define Last_Internal(n) Parent(n-1)
#define LChild(i) (((i)<<1)+1)
#define RChild(i) ((1+(i))<<1)
#define Parent_Valid(i) (0<i)
#define LChildValid(n,i) In_Heap(n,LChild(i))
#define RChildValid(n,i) In_Heap(n,RChild(i))
#define Bigger(PQ,i,j) (lt(PQ[i],PQ[j])?i:j)
#define ProperParent(PQ,n,i) \
((RChildValid(n,i))?((LChildValid(n,i))?\
Bigger(PQ,Bigger(PQ,i,LChild(i)),RChild(i)):Bigger(PQ,i,RChild(i))):\
((LChildValid(n,i))?Bigger(PQ,i,LChild(i)):(i)))
using namespace std;
class Heap
{
public:
vector<int> V;
int percolate_Up(int pos);
int percolate_Down(int pos);
void insert(int u);
int del_Max();
int get_Max() {return V[0];}
void heapify();
};
int Heap::percolate_Up(int pos)
{
while(Parent_Valid(pos))
{
int parent_pos=Parent(pos);
if(lt(V[parent_pos],V[pos])) break;
swap(V[parent_pos],V[pos]);
pos=parent_pos;
}
return pos;
}
int Heap::percolate_Down(int pos)
{
int j;
while(pos!=(j=ProperParent(V,V.size(),pos)))
{
swap(V[pos],V[j]);
pos=j;
}
return pos;
}
void Heap::insert(int u)
{
V.push_back(u);
percolate_Up(V.size()-1);
}
int Heap::del_Max()
{
int temp=V[0];
swap(V[0],V[V.size()-1]);
V.pop_back();
percolate_Down(0);
return temp;
}
void Heap::heapify()
{
for(int i=Last_Internal(V.size());In_Heap(V.size(),i);i--)
{
percolate_Down(i);
}
}
int main()
{
char order[100];
int order_num;
Heap heap;
bool is_over=false;
while(cin>>order)
{
switch(order[0])
{
case 'i': cin>>order_num;
heap.insert(order_num);
break;
case 'e':
if(order[1]=='x')
{
cout<<heap.del_Max()<<endl;
}
else
{
is_over=true;
}
break;
}
if(is_over==true) break;
}
} | #include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
const int INF = 2100000000;
class Heap{
public:
vector<int> a;
int N;
Heap(int n){
N = n;
a.resize(N, INF);
N--;
}
int get_parent(int x){
return a[(x)/2];
}
int get_left(int x){
if(x*2 < N){
return a[x*2];
}
return INF;
}
int get_right(int x){
if(x*2+1 < N){
return a[x*2+1];
}return INF;
}
void print(){
cout << "debug print " << endl;
for(int j = 1; j <= N; ++j){
cout << " " << a[j];
}cout << endl;
}
void mx(int i){
int l = i*2;
int r = i*2+1;
int largest = INF;
if(l <= N && a[l] > a[i]){
largest = l;
}else{
largest = i;
}
if(r <= N && a[r] > a[largest])
largest = r;
if(largest != i){
swap(a[i], a[largest]);
mx(largest);
}
}
void rmx(int i){
int parent;
int largest = INF;
while(1){
parent = i/2;
if(parent < 1)
break;
if(a[parent] < a[i]){
swap(a[parent], a[i]);
i = parent;
continue;
}
break;
}
}
void buildMXHeap(){
for(int i = N/2; i > 0; --i){
mx(i);
}
}
void insert(int x){
if( N+1 >= a.size())
a.resize((N+1)*2, INF);
N++;
a[N] = x;
rmx(N);
}
int extract(){
int tmp = a[1];
a[1] = a[N];
a[N] = INF;
N--;
mx(1);
return tmp;
}
};
int main(void){
int n, a;
string str;
Heap hp(1);
while(1){
cin >> str;
if(str == "insert"){
cin >> a;
hp.insert(a);
}else if(str == "extract"){
cout << hp.extract() << endl;
}else{
break;
}
}
return 0;
} | 1 | 84,150,963 |
#include<bits/stdc++.h>
using namespace std;
using ll = int64_t;
int main(){
ll w,h,x,y;cin>>w>>h>>x>>y;
bool ans=0;
if(w==2*x&&h==2*y)ans=1;
cout<<fixed<<setprecision(15)<<(double)w*h/2<<" ";
cout<<ans<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
void solve() {
ll w, h, x, y;
cin >> w >> h >> x >> y;
cout << fixed << setprecision(10);
cout << (w * h) / 2.0 << " ";
if(x == w / 2.0 && y == h / 2.0) {
cout << 1;
}
else {
cout << 0;
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
solve();
return 0;
} | 1 | 81,183,670 |