code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 45 101M |
|---|---|---|---|
#define _GLIBCXX_DEBUG
#include <iostream>
#include <string>
using namespace std;
int main(void){
string s, t;
cin >> s >> t;
int i=0;
for(char &c : s){
if(c == t[i]) i++;
else{
cout << "No\n";
return 0;
}
}
cout << "Yes\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
string a;
cin >> a;
string b;
cin >> b;
b.pop_back();
if(a==b) {
cout << "Yes" <<'\n';
} else {
cout << "No" <<'\n';
}
return 0;
} | 1 | 49,141,263 |
#include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <utility>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
using namespace std;
typedef long long ll;
int main(){
int a, b, k;
cin >> a >> b >> k;
vector... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define file() freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define tt int t; cin>>t; while(t--)
#define nl cout<<"\n";
#define sp cout<<" ";
#define rep(i, a, b... | 1 | 6,068,517 |
#include<iostream>
using namespace std;
int main(){
int n;
cin >> n;
int Room[4][3][10] = {0};
for(int i = 0; i < n; i++) {
int a, b, c, num;
cin >> a >> b >> c >> num;
Room[a - 1][b - 1][c - 1] += num;
}
for(int a = 0; a < 4; a++) {
for(int b = 0; b < 3... | #include<stdio.h>
#include<string.h>
int main()
{
int a[4][3][10];
int b,f,r,v;
int i,j,k;
int n;
for(i=0;i<4;i++) for(j=0;j<3;j++) for(k=0;k<10;k++) a[i][j][k]=0;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf(" %d %d %d %d",&b,&f,&r,&v);
a[b-1][f-1][r-1]=a[b-1][f-1][r-1]+v;
}
for(i=0;i<4;i++){
for(j=0;j<3;j++){
for(k=0;k<... | 1 | 74,633,101 |
#include <bits/stdc++.h>
#define int long long
using namespace std;
main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin>>n;
map<int,int>mp;
for(int i=0;i<n;i++)
{
int x;
cin>>x;
mp[x]++;
}
int a[n+10];... | #include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
using namespace std;
using ll = long long;
const double PI = 3.14159265358979;
void solve()
{
ll n;
cin >> n;
vector... | 1 | 2,501,393 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int N;scanf("%d",&N);
int A[N+1],B[N];
for(int i=0;i<N+1;i++)scanf("%d",&A[i]);
for(int i=0;i<N;i++)scanf("%d",&B[i]);
long long ans=0;
for(int i=0;i<N;i++)
{
ans+=min(A[i]+A[i+1],B[i]);
A[i+1]=min(A[i+1],max(A[i+1]+A[i]-B[i],0));
}
pri... | #include <bits/stdc++.h>
using namespace std;
int main(void){
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long N;
cin >> N;
vector<long long> A(N + 1), B(N);
for(long long i = 0; i < N + 1; ++i) {
cin >> A[i];
}
for(long long i = 0; i < N; ++i) {
cin >> B[i];
}
long lo... | 1 | 13,924,230 |
#include <iostream>
#define N 10000
using namespace std;
int d[N];
int p[N];
void mergeSort(int, int);
void merge(int, int, int);
int main(){
int n, m;
while(1){
cin >> n >> m;
if(n==0 && m==0) break;
for(int i=0;i<n;i++){
cin >> d[i] >> p[i];
}
mergeSort(0, n);
for(int i=n-1;i>=0;i--)... | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
int main()
{
while (true) {
int n, m;
cin >> n >> m;
if (n == 0 && m == 0) {
return 0;
}
vector<pair<int, int>> v;
for (int i = 0; i < n; ++i) {
... | 1 | 54,153,262 |
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <iomanip>
#include <bitset>
#include <set>
#include <map>
#include <stdio.h>
#include <numeric>
#include <cstring>
#define rep(i,n) for (int i = 0;... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
using LLONG = long long;
const LLONG MOD = 1000000007;
int main()
{
vector<int> cookies(2);
int K;
cin >> co... | 1 | 60,778,070 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
S = regex_replace(S, regex(","), " ");
cout << S << "\n";
} | #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, " ... | 1 | 7,150,238 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N, M;
vector<vector<pair<ll, ll>>> Out;
vector<ll> Pos;
const ll INF = 1ll << 60;
void dfs(ll v, ll pos) {
Pos[v] = pos;
for (auto wd : Out[v]) {
ll w = wd.first, d = wd.second;
if (Pos[w] == INF) dfs(w, pos + d);
}
}
bool check() {
... | #include <bits/stdc++.h>
using namespace std;
struct edge{int to;int cost;};
vector<edge> tree[100010];
vector< int> d(100010 , -1e9);
bool f;
void bfs(int s){
queue<int> q;
q.push(s);
d[s]=0;
while(!q.empty()){
int p=q.front();
q.pop();
for(auto x:tree[p]){
int u=x.to,v=x.cost;
if(d[u]=... | 1 | 94,361,092 |
#include <bits/stdc++.h>
using namespace std;
#define INF 2147483647
#define INFF 9223372036854775807
#define ll long long
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REPP(i,m,n) for(int i=m;i<n;i++)
#define ALL(N) (N.begin(),N.end())
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
in... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int inf = 1001001001;
int main(){
string s;
cin >> s;
int n = s.size();
int cnt = 0;
rep(i,n) if(s[i] == 'o') cnt++;
if(cnt+15-n>=8) cout << "YES" << endl;
else cout << "NO" << endl;
} | 1 | 18,847,328 |
#include <iostream>
#include <cstdio>
using namespace std;
int main(){
int a[100];
for(int i=0;i<100;i++) a[i] = 0;
int b;
while(cin >> b) {a[b]++;}
int max = 0;
for(int i=0;i<100;i++) if(max<a[i]) max = a[i];
for(int i=0;i<100;i++) if(a[i]==max) cout << i << endl;
} | #include <stdio.h>
int main()
{
int a[101]={0},b,max=0;
while(scanf("%d",&b)!=EOF)
a[b]++;
for(int i=1;i<=100;i++){
if(max<a[i])
max=a[i];
}
for(int i=1;i<=100;i++){
if(max==a[i])
printf("%d\n",i);
}
return 0;
} | 1 | 79,829,699 |
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include ... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int debug = 0;
int main(void){
int i, j, k;
int n, m;
int tmp, maxi, cont;
vector<int> intv, imax;
while(cin >> n){
if(n == 0) break;
for(i=0;i<n;i++){
cin >> m;
intv.push_back(m);
}
cont = 0;
maxi = 0;
tmp = 0;
for... | 1 | 59,770,990 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, m; cin >> n >> m;
vector<long> x(n,0); vector<long> y(n,0); vector<long> z(n,0);
vector<long> sum(n,0);
vector<vector<long>> sum_sum(8,sum);
bitset<3> bit;
rep(i, n) {
scanf("%... | #include <string.h>
#include <stdlib.h>
#include <math.h>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <iomanip>
#include <vector>
#include <queue>
#include <map>
#include <utility>
#include <limits.h>
#include <bitset>
#include <set>
using namespace std;
#define LL long l... | 1 | 37,295,778 |
#include <bits/stdc++.h>
using namespace std;
int n,m;
vector<int> color(10005,0),indeg(10005,0);
vector<vector<int>> G(10005,vector<int>(0));
list<int> ans;
void bfs(int s){
queue<int> Q;
Q.push(s);
color[s]=1;
while(!Q.empty()){
int u=Q.front();
Q.pop();
ans.push_back(u);
... | #include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <bitset>
#include <ctime>
#include <map>
#include <uno... | 1 | 18,353,524 |
#include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;
const ll mod=1000000007, INF=(1LL<<60);
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
ll n... | #include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
using P = pair<ll,ll>;
using ld=long double;
int main(){
ll n,x;cin >>n>>x;
ll ans=0;
for (int i = 0; i < n; ++i) {
ll a;cin >>... | 1 | 68,693,445 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int a, b;
cin >> a >> b;
int e = 0;
for (int i = a; i <= b; ++i) if (i / 10000 == i % 10 && i % 10000 / 1000 == i % 100 / 10) ++e;
cout << e << endl;
retur... | #include <iostream>
#include <string>
#include <vector>
#include <set>
#include <queue>
#include <algorithm>
#include <utility>
#include <cmath>
using namespace std;
using ll=long long;
using P=pair<int,int>;
#define rep(i,a,b) for(ll i=a;i<ll(b);i++)
#define repr(i,a,b) for(ll i=a;i>=ll(b);i--)
#define endl '\n'
#defi... | 1 | 11,633,675 |
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> u;
for(int i = 0; i < n; i++) {
int ui;
cin >> ui;
u.push_back(ui);
}
sort(u.begin(), u.end())... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> v(n);
rep(i, n) cin >> v[i];
sort(v.rbegin(), v.rend());
double cur = v[n-1];
v.pop_back();
while (!v.empty()) {
cur... | 1 | 86,282,604 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1000005;
int n, a[MAXN], lo[MAXN], vis[MAXN];
int main(){
for(int i = 2; i < MAXN; i++){
if(lo[i] != 0)continue;
lo[i] = i;
for(int j = 2 * i; j < MAXN; j += i)
lo[j] = i;
}
scanf("%d", &n);
int g = 0;
bool ok = true;
for(int i = 0; i < n; i+... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = (int)1e6;
int d[MAXN+1];
bool prime[MAXN+1];
int n;
void sieve(){
memset(prime,true,sizeof(prime));
for(int p=2; p*p<=MAXN; p++){
if(prime[p]){
for(int i=p*p; i<=MAXN; i+=p){
prime[i] = false;
d[i]... | 1 | 8,269,620 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define ALL(x) (x).begin(),(x).end()
#define sz(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element... | #include<bits/stdc++.h>
using namespace std;
using p=pair<int,int>;
#define int long long
#define rep(i,N) for(int i=0;i<N;i++)
signed main(){
string S;
cin>>S;
for(int i=0;i>-1;i++){
S.pop_back();
string x=S.substr(0,S.size()/2);
string y=S.substr(S.size()/2,S.size()-1);
if(x==y){
cout<<S.s... | 1 | 22,180,621 |
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
string lis;
cin>>lis;
bool ans=true;
ll i;
for(i=0;i<3;i++)
{
if(lis[i]=='7')
{
ans=true;
break;
}
else
{
ans=false;
}
}
if(ans==true)
{
cout<<"Yes"<<"\n";
}
... | #include<iostream>
using namespace std;
int main (void)
{
int r;
cin>>r;
while(r>1)
{
if(r%10==7)
{
cout<<"Yes";return 0;
}
r=r/10;
}
cout<<"No";
} | 1 | 5,900,727 |
#include <iostream>
#include <cstdio>
using namespace std;
int main () {
int num;
cin >> num;
int max = -1000001, min = 1000001, data;
long long sum = 0;
for (int i = 0; i < num; i++) {
cin >> data;
if (min > data) {
min = data;
}
if (max < data) {
max = data;
}
sum += data;
}
cout << min << "... | #include<iostream>
using namespace std;
int main(){
int n;
int a;
int min=1000000;
int max=-1000000;
long long sum=0;
cin >> n;
for(int i=1;i<=n;i++){
cin >> a;
sum=sum+a;
if(a<min){
min=a;
}
if(a>max){
max=a;
}
}
cout << min << " " << max << " " << sum << endl;
} | 1 | 2,528,348 |
#include <bits/stdc++.h>
#include <algorithm>
#include <functional>
#include <map>
#include <queue>
#include <set>
#include <stack>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define REP(i, m, n) for (ll(i) = (ll)(m); i < (ll)(n); ++i)
#define REP2(i, m, n) for (ll(i) = (ll)(n)-1; i >= (... | #include <bits/stdc++.h>
using namespace std;
int main() {
int x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
cout << x2 + (y1 - y2) << " " << y2 - (x1 - x2) << " ";
int x3 = x2 + (y1 - y2), y3 = y2 - (x1 - x2);
cout << x3 + (y2 - y3) << " " << y3 - (x2 - x3) << endl;
} | 1 | 24,133,315 |
#include<iostream>
#include<vector>
using namespace std;
const int MAXN = 1e5;
const int INF = 1e9 - 7;
typedef long long ll;
ll dp[MAXN + 2][4];
int n;
vector<ll> a,b,c;
ll happy(ll N, ll K){
if(N == 0) return 0;
if(dp[N][K] != -1) return dp[N][K];
if(K == 3) return dp[N][K] = max(happy(N-1, 2) + b[N], happy(N-1, 1... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<vector<int>> inp(n, vector<int>(3));
for(auto &x: inp)
for(auto &y: x)
cin>>y;
vector<vector<int>> dp(n + 1, vector<int>(3));
for(int i{1}; i <= n; ++i){
for(int j{0}; j <= 2; ++j){
dp[i][j] = max(dp[i - 1][(j + 1) % ... | 1 | 84,361,533 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
long sum=0;
long a[N];
for(int i=0;i<N;i++){
cin >> a[i];
sum+=a[i];
}
long s=a[0];
long min=10000000000;
for(int i=1;i<N-1;i++){
s+=a[i];
if(min>abs(sum-2*s))min=abs(sum-2*s);
}
if(N==2)min=abs(a[0]-a[1]);... | #include <bits/stdc++.h>
using namespace std;
#define debug(x) '[' << #x << " is: " << x << "] "
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.precision(10);
cout << fixed;
#ifndef ONLINE_JUDGE
#endif
int n;
cin>>n;
vecto... | 1 | 10,661,443 |
#include <iostream>
using namespace std;
int main()
{
long long int a,b,k;
cin>>a>>b>>k;
if(k>a){
k=k-a;
cout<<"0"<<" ";
if(b>=k)cout<<b-k;
else cout<<"0";
}
else{
cout<<a-k<<" "<<b;
}
return 0;
} | #include<bits/stdc++.h>
#define forr(i, a, b) for(int i = (a); i < (b); i++)
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = 1; i <= (n); i++)
#define ALL(a) (a.begin()),(a.end())
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll, ll> LP;
const ll LINF = 1LL... | 1 | 73,662,819 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
ll power(ll a , ll b) {
ll ans = 1;
while (b) {
if (b & 1) {
ans = ans * a;
}
a = a * a;
b /= 2;
}
return ans;
}
int main() {
string s;
cin >> s;
int n = (int)s.size();
int a = 0;
for (int i = 0; i < n; ++i) {
if (s[i] == '1'... | #include<bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(0); cin.tie(0)
#define LL long long
#define mod 1000000007
#define FOR(i, j, k) for (int i=j ; i<k ; i++)
#define ROF(i, j, k) for (int i=j ; i>=k ; i--)
#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#define time_... | 1 | 30,394,635 |
#include <stdio.h>
#include <string.h>
int main(){
char a[11], b[11], c[11];
scanf("%s %s %s", a, b, c);
int lenA = strlen(a);
int lenB = strlen(b);
int lenC = strlen(c);
if (a[lenA-1] == b[0] && b[lenB-1] == c[0]){
printf("YES\n");
}
else {
printf("NO\n");
}
return 0... | #include <algorithm>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vll = vector<ll>;
void solve();
int m... | 1 | 8,060,618 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
int n, a, b;
cin >> n >> a >> b;
if (a + b > n + 1 || 1LL * a * b < n) {
cout << -1 << '\n';
return 0;
}
vector<int> res(n);
iota(res.begin(), res.end(), 1);
int num = n - a, iter = 0, leng;
while (num... | #include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
d... | 1 | 69,190,106 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i = (m); i <= (n); i++)
#define zep(i,m,n) for(ll i = (m); i < (n); i++)
#define rrep(i,m,n) for(ll i = (m); i >= (n); i--)
#define print(x) cout << (x) << end... | #include <iostream>
using namespace std;
int main(void){
int a,b,c,d;
cin>>a>>b>>c>>d;
while(1){
if(d<0){
cout<<"No"<<endl;
break;
}
if(a>=b){
b*=2;
}else if(b>=c){
c*=2;
}else{
cout<<"Yes"<<endl;
... | 1 | 11,470,195 |
#include<iostream>
#include<algorithm>
using namespace std;
int main(void)
{
long long int i,j,k,n,a[100001],b[100000],ans;
cin>>n;
ans=0;
for(i=0;i<=n;i++){cin>>a[i];}
for(i=0;i<n;i++){cin>>b[i];}
for(i=0;i<n;i++)
{
if(a[i]>=b[i]){ans+=b[i];}
else if(a[i]+a[i+1]>=b[i])
{
a[i+1]=a[i+1]+... | #include <bits/stdc++.h>
using namespace std;
#include <iostream>
#include <vector>
#include <cstdlib>
#include <cmath>
#include <math.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
using pint = pair<int,int>;
using vec = vector<int>;
using ll=long long;
u... | 1 | 21,261,523 |
#include <stdio.h>
#include <algorithm>
using namespace std;
int main(){
int a[3];
int n;
scanf("%d", &n);
while(n>0) {
scanf("%d %d %d", &a[0], &a[1], &a[2]);
sort(a, a+3);
if(a[0]*a[0] + a[1]*a[1] == a[2] * a[2]) {
printf("YES\n");
}else{
printf(... | #include<iostream>
using namespace std;
int main()
{
int a, b, c, n;
bool _bool = false;
cin >> n;
for (int i = 0; i < n; i++)
{
cin >> a >> b >> c;
_bool = false;
if (a * a == (b* b + c * c) || b*b == a*a + c*c || c*c == a* a + b* b)
{
_bool = true;
}
if (_bool)
{
cout << "YES" << endl;
}
... | 1 | 16,780,786 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll n;
cin >> n;
vector<ll> a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
;
ll ans = 0;
rep(i, n) {
if(b[i] >... | #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdlib>
#include<queue>
#include<set>
#include<cstdio>
using namespace std;
#define ll long long
#define rep(i, n) for(int i = 0; i < n; i++)
#define P pair<int, int>
typedef vector<int> vec;
typedef vector<vec> mat;
const ll mod = 10000... | 1 | 13,814,549 |
#pragma region header
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int64_t> stairs(N + 1);
stairs.at(0) = 1;
int64_t MOD = 1000000000 + 7;
set<int> broken;
for(int i = 0; i < M; i++) {
int a;
cin >> a;
broken.insert(a);
}
for(int i = 1; i <= N; i++) {
if(i == 1)... | 1 | 65,511,178 |
#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--)
... | #include "bits/stdc++.h"
using namespace std;
int main()
{
int64_t n,ans;
cin>>n;
ans=(n-1)*n/2;
cout<<ans;
} | 1 | 100,464,765 |
#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=5e18;
int main() {
ll n;
cin >> n;
vec a(n),b(n);
for(ll i=0;i<n;i++) cin >> a[i] >> b[i];
ll mi=inf;
ll ans=0;
for(ll i=0;i<n;i++) ... | #include "bits/stdc++.h"
#include <iostream>
#include <string.h>
#include <stdio.h>
#include <map>
#include <vector>
#include <math.h>
#include <algorithm>
#include <queue>
#include <set>
#include <tuple>
using namespace std;
#define FOR(i,init,a) for(int i=init; i<a; i++)
#define rep(i,a) FOR(i,0,a)
#define rrep(i,a) ... | 1 | 48,952,072 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin >> s;
for (int i = 0; i < 19; i++){
if (s[i] != ',')
cout << s[i];
else
cout << " ";
}
return 0;
} | #include <bits/stdc++.h>
#include <boost/range/algorithm.hpp>
#include <boost/range/numeric.hpp>
#include <boost/integer/common_factor.hpp>
#include <boost/integer/common_factor_rt.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using std::string;
using std::vector;
using std::set;
using std::multiset;
using std... | 1 | 75,183,987 |
#include<bits/stdc++.h>
using namespace std;
typedef pair<double,double> P;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define LLINF 1000000000000000ll
#define sz(x) ((int)(x).size())
#define fi first
#define se... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for(int i=(a);i<(n);i++)
#define REP(i,n) for(int i=0;i<(n);i++)
int Levenshtein(string s1,string s2){
int dp[s1.size()+1][s2.size()+1];
REP(i,s1.size()+1)dp[i][0]=i;
REP(i,s2.size()+1)dp[0][i]=i;
rep(i,1,s1.size()+1)rep(j,1,s2.size()+1)
... | 1 | 97,744,774 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<long long> vll;
typedef vector<int> vi;
#define io ios_base::sync_with_stdio(false)
#define pb push_back
#define eb emplace_back
#define mod 998244353
#define PI 2*acos(0.0)
#d... | #include <bits/stdc++.h>
using namespace std;
long long f(long long k){
return (k*(k-1))/2;
}
int main(){
long long n;
long long now=0;
cin>>n;
vector<long long> p(n,0);
long long a[n];
for(int i=0;i<n;i++){
cin>>a[i];
a[i]--;
p[a[i]]++;
}
for(int i=0;i<n;i++){
now+=f(p[i]);
}
for(int... | 1 | 97,817,682 |
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define mp make_pair
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define MOD (ll)(1e6+3)
#define INF... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
ll GetDigit(ll num){ return log10(num)+1; }
int main()
{
int n;
string s;
cin >> n >> s;
if(n%2 == 1) {
cout << "No" << endl;
return 0;
}
int t = n/2;
boo... | 1 | 1,100,419 |
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int ans{753};
for (size_t i = 0; i != S.size() - 2; ++i) {
ans = min(ans, abs(753 - stoi(S.substr(i, 3))));
}
cout << ans << endl;
return 0;
} | #include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<util... | 1 | 92,296,003 |
#include <fstream>
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <sstream>
#include <map>
#include <set>
#include <vector>
#include <stack>
#include <cmath>
#include <queue>
#include <random>
#include <numeric>
using namespace std;
#define... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <tuple>
#include <iomanip>
#include <random>
#include <math.h>
#include <stdi... | 1 | 14,122,825 |
#include <iostream>
using namespace std;
#include <cstdio>
#include <string.h>
#include <stdlib.h>
#include <math.h>
int main(void)
{
int i,j,k,l;
int a,b,c,d;
int memory[2];
int height[10];
int n;
for(i=0;i<10;i++) cin >> height[i];
for(i=0;i<9;i++) {
for(j=9;j>i;j--) {
if(height[j]... | #include<iostream>
#include<algorithm>
int x[10];
int main(){
for(int i=0;i<10;++i){
std::cin>>x[i];
}
std::sort(std::begin(x),std::end(x));
for(int i=0;i<3;++i){
std::cout<<x[9-i]<<std::endl;
}
return 0;
} | 1 | 95,349,196 |
#include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using bint = boost::multiprecision::cpp_int;
using ll = long long;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define repSE(i,s,n) for (int i = (s); i < (n); i++)
#define ... | #include<iostream>
#include<unordered_map>
#include<bitset>
#include<math.h>
#include<vector>
#include<set>
#include<algorithm>
#include<ctype.h>
#include<unordered_set>
#include<string>
#include<iomanip>
#include<queue>
#include<limits>
#include<map>
#include<stack>
#include<iterator>
#include<cstring>
#include<deque>... | 1 | 51,143,081 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
string a;
cin >> a;
int n = a.size();
vector<int> counter(1 << 8, 0);
ll ans = 1;
rep(i,n) {
ans += i - counter[a[i]];
counter[a[i]]++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
long long int n = s.length();
vector<long long int> count(26);
for(int i=0; i<n; i++){
count[s[i] - 'a'] += 1;
}
long long int ans = 1 + n * (n-1) / 2;
for(int i=0; i<26; i++){
ans -= count[i] *... | 1 | 42,853,153 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <cstdio>
#include <queue>
#include <deque>
#include <map>
#include <stack>
#include <set>
#include <utility>
#include <functional>
using namespace std;
typedef pair<int, int> pii;
typedef pair<string, int> P;
typedef ... | #include<bits/stdc++.h>
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
int main(){
IOS;
int x;
cin>>x;
if(x>=400&&x<600)cout<<8;
else if(x>=600&&x<800)cout<<7;
else if(x>=800&&x<1000)cout<<6;
else if(x>=1000&&x<1200)cout<<5;
else if(x>=1200&&x<1400)cout<<4;
else if(x>=1400&&x<1600)co... | 1 | 58,419,067 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s,ans = "";
cin >> s;
for(int ix;ix<s.size();ix++){
if(s.at(ix) == '0') ans += "0";
if(s.at(ix) == '1') ans += "1";
if(s.at(ix) == 'B' && !ans.empty()) ans.erase(ans.end()-1);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<vector<int>> Graph;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
#define pi 3.14159265359
#define inf 2147483647
#define INF 9223372036854775807
#define mod 1000000007
#define mod2 998244353
i... | 1 | 86,730,347 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
int i;
cin>>s;
int x=0,y=0;
for(i=0;s[i]!='\0';i++){
if(s[i]=='A')
x++;
if(s[i]=='B')
y++;
}
if(x==3 || y==3)
cout<<"No"<<endl;
else
{
cout<<"Yes"<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N;
string s;
cin >> s;
bool A = false;
bool B = false;
for (char c : s){
if (c == 'A'){
A = true;
}
else if (c == 'B')
{
B =... | 1 | 4,058,789 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i, s, n) for (int i = (s); i < (n); i++)
#ifdef LOCAL
#define INPUT_FILE \
ifstream in("atcoder-problems/agc023_a.txt"); \
cin.rdbuf(in.rdbuf());
#define print_vec(v) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)
#define ALL(v) (v).begin(),(v).end()
#define CLR(t,v) memset(t,(v),sizeof(t))
template<class T1,class T2>ostream& operator<<(ostream& os,const pair<T1,T2>&a){return os<<"("<<a.first<<","<<a.second<< ")... | 1 | 97,891,803 |
#pragma GCC optimize("O3")
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include... | #include <bits/stdc++.h>
using namespace std;
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#define printint(v) copy(begin(v), end(v), ostream_iterator<int>(cout," "))
#define printintv(s,e) copy(s,e,... | 1 | 36,572,306 |
#include <iostream>
#define rep(i, n) for(int i=0; i<n; i++)
using namespace std;
int main(void){
int N;
cin >> N;
int a[N];
rep(i, N)
cin >> a[i];
int ans = 0;
bool pushed[N];
rep(i, N)
pushed[i] = false;
int now = 0;
while(now != 1){
if(pushed[now] == true){
cout << -1 << endl;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> button(N);
int L1 = 0;
int L2 = 0;
int C = 0;
for (int i = 0; i < N ; i++) {
cin >> button.at(i);
}
while (L1 != 1) {
if (button.at(L1) == -1) {
cout << -1 << endl;
break;
}
L1 = button... | 1 | 1,353,719 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i < (n); i++)
using namespace std;
using ll = long long;
int main(){
int N; cin>>N;
vector<int> vW(N);
int total=0;
rep(i,N){
int x; cin>>x;
total += x;
vW[i]=x;
}
int ans = 1e9;
int left = 0;
for(int i=0; i<... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define file() freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define tt int tc; cin>>tc; while(tc--)
#define nl cout<<"\n";
#define sp cout<<" ";
#define rep(i, a... | 1 | 27,086,389 |
#include<iostream>
#include<vector>
#include <cmath>
#include <map>
#include <algorithm>
#include <string>
using namespace std;
int main(void){
int A , B ;
cin >> A >> B ;
int a, b ,ab ;
a = A % 3 ;
b = B % 3 ;
ab = (A + B) % 3 ;
if(a==0){
cout << "Possible" << endl;
}else if (b=... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
const int INF = 100100100;
using namespace std;
int main()
{
int A,B;
bool res=false;
cin >> A>>B;
if(A%3==0) res=true;
if(B%3==0) res=true;
if((A+B)%3==0) res=true;
if(res) cout << "Possible" << endl;
else cout << "Impossible" << endl;
} | 1 | 62,481,003 |
#include <bits/stdc++.h>
#define rep(X,N) for(ll X = 0LL; X < (N); X++)
#define ALL(V) (V).begin(),(V).end()
#define endl "\n"
using namespace std;
typedef long long ll;
const double PI = 3.1415926535897932384626;
const ll MODN = 1000000007;
const ll MODN2 = 998244353;
const double EPS = 1e-10;
int main(){
ll s;
... | #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 <u... | 1 | 50,250,405 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int h, w; cin >> h >> w;
vector<vector<char>> g(h, vector<char>(w));
vector<vector<int>> cost(h, vector<int>(w, -1));
queue<pair<int, int>> que;
for(int i=0; i<h; i++)
for(int j=0; j<w; j++){
cin >> ... | #include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
template<class T> inli... | 1 | 49,560,179 |
#include <bits/stdc++.h>
#define ALL(obj) begin(obj), end(obj)
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace std;
template <class T>
vector<T> make_vec(size_t a) {
return vector<T>(a);
}
template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts.... | #include<bits/stdc++.h>
using namespace std;
int main(){
char a,b;
cin >> a >> b;
if(a<b)cout << "<";
if(a==b)cout << "=";
if(a>b)cout << ">";
} | 1 | 45,079,306 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, start, n) for (ll i = (ll)(start); i < (ll)(n); ++i)
static const ll INFTY = 1L << 62L;
bool solver(ll *a, ll *b, ll N)
{
ll r = 0;
rep(i, 0, N)
{
r += b[i] - a[i];
}
if (r < 0)
return false;
else
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(n) begin(n),end(n)
using ll = long long;
using P = pair<int,int>;
int main() {
int n;
cin >> n;
vector<int> a(n), b(n);
rep(i,n) cin >> a[i];
rep(i,n) cin >> b[i];
ll A = 0, B = 0;
rep(i,n) {
... | 1 | 4,501,872 |
#include <cstdio>
#include <vector>
#include <algorithm>
#define ll long long
using namespace std;
const int N = 4e5;
int A[N], B[N];
int main(){
int n, a, b;
scanf("%d %d %d", &n, &a, &b);
if(((ll)a*(ll)b<(ll)n) || (a+b>n+1)){
puts("-1");
return 0;
}
int i, j;
for(i=1; i<=n; i++... | #include <fstream>
#include <iostream>
#include <functional>
#include <algorithm>
#include <sstream>
#include <cstring>
#include <vector>
#include <string>
#include <cstdio>
#include <cmath>
#include <queue>
#include <stack>
#include <deque>
#include <ctime>
#include <list>
#include <set>
#include <map>
#include <bitse... | 1 | 45,053,899 |
#include<stdio.h>
int main(){
char x,y;
scanf("%c",&x);
y = x + 1;
printf("\n%c",y);
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
char x;
cin >> x;
x++;
cout << x << endl;
} | 1 | 59,727,048 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0) , cin.tie(0) , cout.tie(0);
int n , k;
cin >> n >> k;
int p = (n - 1) * (n - 2) / 2;
if (p < k) {
cout << -1;
return 0;
}
set<array<int , 2> > pairs;
vector<array<int , 2> > edges;
for ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i<n; i++)
#define pb push_back
#define int long long
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
int N, K;
bool ban[110][110];
signed main() {
cin >> N >> K;
if (K>N*(N-1)/2-(N-1)) {
cout << -1 << endl;
e... | 1 | 6,326,653 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<(n); i++)
using namespace std;
typedef pair<int, int> P;
int main(){
int k; cin >> k;
int d[k]; rep(i, k) d[i] = INT_MAX;
priority_queue<P, vector<P>, greater<P>> que;
que.push(P(0, 1));
d[1] = 0;
while(!que.empty()){
P p = que.top(); que.pop();
... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int K;
cin >> K;
priority_queue<P, vector<P>, greater<P>> que;
vector<int> min_cost(K, -1);
for(int i=1;i<10;i++) {
que.emplace(i, i % K);
min_cost[i % K] = i;
}
while(!que.empty()) {
auto p = que.top(... | 1 | 66,686,357 |
#include <iostream>
#include <vector>
#include<algorithm>
#include<string>
#include<stdio.h>
#include<map>
#include<math.h>
#include<queue>
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int MOD = 1000000007;
const int mod = 1000000007;
con... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) cin >> h[i];
vector<int> next(n);
next[n-1] = n-1;
rep(i, n-1) {
if (h[i] ... | 1 | 72,527,832 |
#include <bits/stdc++.h>
#include <chrono>
using namespace std;
using namespace chrono;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vii;
typedef vector<ll> vll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define pb push_back
#define odd(x) ((x)&1)
#define even(x) (!odd(x))... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
const int mod = 1e9+7;
int main() {
int h, w;
cin >> h >> w;
vector<vector<char>> c(h+1, vector<char>(w+1));
for(int i = 1; i <= h; i++) {
for(int j = 1; j <= w; j++) {
cin >> c[i][j];
... | 1 | 93,725,717 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e16;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (ll)(n); i++)
int main() {
ll n; cin >> n;
cout << n/3 << endl;
} | #include <iostream>
#include <sstream>
#include <iomanip>
#include <stdio.h>
#include <string>
#include <cstdlib>
#include <vector>
#include <cmath>
#include <math.h>
#include <stdexcept>
#include <algorithm>
#include <set>
#include <map>
#include <stdlib.h>
#include <cctype>
#include <bitset>
using namespace std;
int ... | 1 | 43,311,028 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int n;
cin >> n;
vector<string> w(n);
rep(i,n) cin >> w[i];
for(int i = 0;i < n-1;i++){
for(int j = i+1;j < n;j++){
if(w[i] == w[j]){
cout << "No" << endl... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
long double const pi = std::acos(-1.0L);
int main() {
int n;
cin >> n;
vector<string> w(n);
rep(i,n) cin >> w[i];
bool ok = true;
rep(i,n-1){
if(w[i][w[i].size()-1] != w[i+1][0]){
ok =... | 1 | 8,530,331 |
#include <iostream>
#include <cmath>
using namespace std;
int main() {
long double x1,y1,x2,y2;
cin >> x1;
cin >> y1;
cin >> x2;
cin >> y2;
cout.precision(4);
cout.setf(ios::fixed);
cout << sqrt(pow(x1-x2, 2.0)+pow(y1-y2, 2.0)) << endl;
return 0;
} | #include<iostream>
#include<string>
#include<iomanip>
#include<math.h>
using namespace std;
int main(){
double x1,x2,y1,y2;
cin>>x1>>y1>>x2>>y2;
double x=(x1-x2)*(x1-x2),y=(y1-y2)*(y1-y2);
cout<<fixed<<setprecision(10)<<(double)sqrt((double)x+y)<<endl;
return 0;
} | 1 | 89,835,986 |
#include<bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const int INF= 1e9+5;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll> >vvl;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> T;
const ll MOD=1000000007LL;
int main(){
ll n,k;
... | #include <iostream>
#include <algorithm>
#include <iomanip>
#include <string>
#include <vector>
#include <math.h>
#include <queue>
#include <deque>
#include <map>
const int MOD = 1e9+7;
typedef long long ll;
using namespace std;
ll hoge(ll x){
if (x >= 3) return x*x*x;
if (x == 2) return x*(x-1)*3 + x;
return x;
}
i... | 1 | 74,913,036 |
#include <bits/stdc++.h>
#include <vector>
# include <cstdint>
#define FOR(i,l,r) for(int i=(l);i<(r);++i)
#define RFOR(i,l,r) for(int i=(l);i>=(int)(r);i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,n-1,0)
using namespace std;
#define int long long
using ll = long long;
const int MX = 1e6;
const ll inf = ... | #include <bits/stdc++.h>
#define ll unsigned long long
#define vec vector<ll>
using namespace std;
int main(){
ll a,b,m;
cin>>a>>b>>m;
vec ref,ov;
while(a--){
ll in;
cin>>in;
ref.push_back(in);
}
while(b--){
ll in;
cin>>in;
ov.push_back(in);
}
ll x = *min_element(ref.begin(),ref.end());
ll y = *mi... | 1 | 6,763,218 |
#include <bits/stdc++.h>
#define rep(i,k,n) for(int i=k;i<n;++i)
#define repe(i,k,n) for(int i=k;i<=n;++i)
using namespace std;
int main()
{
cin.tie(0);cout.tie(0);
ios::sync_with_stdio(false);
string a,b;
cin >> a >> b;
int aa = a.size(),bb = b.size();
for (int i=0;i<bb;++i){
putchar(a[... | #include<bits/stdc++.h>
using namespace std;
int main(){
string O,E,D;
cin>>O>>E;
int N,M;
N=O.size();
M=E.size();
for(int i=0;i<M;i++){
D+=O.at(i);
D+=E.at(i);
}
if(N!=M)
D+=O.at(N-1);
cout<<D<<endl;
} | 1 | 35,591,385 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
using P = pair<int,int>;
const int MOD = 1000000007;
int main() {
int h,w;
cin>>h>>w;
vector<string> s(h);
vector<vector<bool>> f(h,vector<bool>(w,true));
rep(i,h) cin>>s[i];
int dx... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vi = vector<int>;
#define _GLIBCXX_DEBUG
#define IO_STREAM cin.tie(0);ios::sync_with_stdio(false)
#define all(x) x.begin(),x.end()
#define rep(i,sta,end) for(ll i=sta;i<end;++i)
#define lcm(a,b) (a)/__gcd((a),(b))*(b)
#de... | 1 | 75,716,523 |
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <iomanip>
#include <queue>
#include <deque>
#include <map>
#include <unordered_map>
#define rep(i,n) for(int i=0;i<n;i++)
#define repn(i,n) for(int i=1;i<=n;i++)
#define repr(e,x) for(auto& e:x)
usi... | #include <bits/stdc++.h>
#include <algorithm>
#include <functional>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define DEBUG
#define PI 3.141592653589793238462643383279
#define _GLIBCXX_DEBUG
#ifdef DEBUG
#define s(...) show(__VA_ARGS__);
#define sl(...) show(__VA... | 1 | 81,029,877 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
string s;
cin >> n >> s;
if (n % 2) {
cout << "No";
} else {
if (s.substr(0, n / 2) == s.substr(n / 2)) {
cout << "... | #include <bits/stdc++.h>
typedef long long ll;
#define mod 1000000007
using namespace std;
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("outp.txt","w",stdout);
#endif
ll n;cin>>n;
string s;cin>>s;
if(n%2==1)
cout<<"No";
else
{
if(s.substr(... | 1 | 41,939,530 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
vector<int> hist;
int main(){
cin >> N;
hist.resize(N);
for ( int i = 0; i < N; i++ ){
int A;
cin >> A;
hist[A-1]++;
}
sort( hist.begin(), hist.end(), greater<int>() );
vector<int> kk(N+1);
{
int acc = 0;
int i = 0;
for ( int... | #include <iostream>
#include <vector>
using namespace std;
int main()
{
int N;
cin>>N;
vector<int> A(N);
for (int &a: A)
cin>>a, a--;
vector<int> C1(N);
for (int a: A)
C1[a]++;
vector<int> C2(N+1);
for (int c: C1)
C2[c]++;
vector<int> S(N+1);
S[N] = C2[N];... | 1 | 33,334,189 |
#include <stdio.h>
int main(void) {
long long a, b;
scanf("%lld%lld", &a, &b);
if(a >= b - 1 && a <= b + 1) printf("Brown");
else printf("Alice");
return 0;
} | #include<bits/stdc++.h>
#include<cmath>
#define ll long long
using namespace std;
signed main()
{
ll x, y;
cin >> x >> y;
if (abs(x - y) <= 1)
{
cout << "Brown\n";
}
else
{
cout << "Alice\n";
}
return 0;
} | 1 | 71,404,367 |
#include<bits/stdc++.h>
#define ll long long
#define fast_io ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define mod 1000000007
using namespace std;
int main()
{
fast_io
ll i,x,alp[26]={0},cnt=0;
string s;
cin>>s;
for(i=0; s[i]; i++)
{
x=s[i]-'A';
alp[x]++;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
int main(){
string S; cin >> S;
bool ok = false;
if(S.at(0) == S.at(1)){
if(S.at(2) == S.at(3) && S.at(0) != S.at(2)){
ok = true;
}
} else if(S.at(0) == S.at(2)){
... | 1 | 71,481,842 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define zero_pad(num) setfill('0') << std::right << setw(num)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
ll x, y;
cin >> x >> y;
if(x == y)cout << 0 << endl;
else if(x ... | #include"bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
ll x, y,... | 1 | 4,041,612 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b;
cin>>a>>b;
string s,s3;
s.insert(s.begin(),b,a+'0');
s3.insert(s3.begin(),a,b+'0');
if(s3<s){cout<<s3<<endl;}
else cout<<s<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int a, b;
cin >> a >> b;
if (a > b)
{
for (int i = 0; i < a; i++)
cout << b;
cout << endl;
}
else
{
for (int i = 0; i < b; i++)
cout << a;
cout << endl;
... | 1 | 11,819,809 |
#include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef p... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(obj) obj.begin(), obj.end()
#define fcout cout << setprecision(10)
const int iINF = 1e9;
const long long llINF = 1e18;
const int MOD = 1e9 + 7;
using namespace std;
template <typename T>
void debug(vector<T> &vec) {
for (auto x : vec... | 1 | 47,156,796 |
#include <bits/stdc++.h>
using namespace std;
using ll = 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++)
int main() {
int N;
cin >> N;
vector<int> vec(N);
vector<int> vec2(N);
int sum = 0;
rep(i, N) {
cin >> vec.at(i);
sum +=... | #include <bits/stdc++.h>
#define ll long long
#define sz(x) (int)x.size();
using namespace std;
const int N=105;
int n;
int p[N],s[N],a[N];
int main(){
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
p[i]+=p[i-1]+a[i];
}
for(int i=n;i>=1;i--){
s[i]+=s[i+1]+a[i];
}
int ans=1e9;
for(int i=1;i<=n;i++){
ans=min(an... | 1 | 7,029,971 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <queue>
#include <utility>
#include <map>
#include <bitset>
#include <numeric>
#define ll long long
using namespace std;
using p = pair<ll, ll>;
ll dx[8]={ 0, 1, 0,-1, 1, 1,-1,-1};
ll dy[8]={ 1, 0,-1, 0, 1,-1, 1,-1};... | #include <bits/stdc++.h>
using namespace std;
int main(){
int A, B, M;
cin >> A >> B >> M;
vector<int> a(A);
vector<int> b(B);
for (int i=0; i<A; i++) cin >> a.at(i);
for (int i=0; i<B; i++) cin >> b.at(i);
int min_a = 1e6;
int min_b = 1e6;
for (int i=0; i<A; i++){
min_a = mi... | 1 | 83,524,979 |
#include <iostream>
#include <math.h>
#define Max 200000
#define Mod 998244353
using namespace std;
long long ans = 1;
int N,D[Max], a[Max];
int main()
{
cin >> N;
for (int i = 1; i <= N; i++){
cin >> D[i];a[D[i]]++;
}
if (D[1] != 0)ans = 0;
for (int j = 2; j <= N; j++){
ans = ((ans)%Mod * (a[D[j] - 1] % Mod))... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
typedef tree<ii,null_type,less<ii>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
const int mod=998244353;
int main() {
cin.tie(0); cout.tie(0);... | 1 | 25,348,291 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int A,B,C;
cin>>A>>C;
B=C*2-A;
cout<<B<<endl;
} | #include <iostream>
using namespace std;
int main() {
int R, G, T;
cin >> R;
cin >> G;
T = (2 * G) - R;
cout << T << endl;
} | 1 | 53,460,634 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>
using namespace std;
#define FOR(i,a,b) for(lo... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef pair<ll, int> li;
typedef pair<int, ll> il;
typedef vector<ii> vii;
typedef vector<il> vil;
typedef vector<li> vli;
#define F first
#define S second
#define pb(x... | 1 | 6,282,306 |
#include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef tuple<ll,ll,ll> T;
const long long INF = 1LL<<60;
const int MOD = 1000000000+7;
#define rev(s) (string((s).rbegin(),... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pr;
typedef vector<pr> vp;
typedef vector<vp> vpp;
typedef vector<vector<ll> > graph;
#define pb push_back
#define mp make_pair
#define endl '\n'
void set_val(vector<ll>& v, ll val){for(ll i=0;i<v.size();i++) v[i]=val;}
ll mod = pow(... | 1 | 9,150,002 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n) ;i++)
using namespace std;
using p=pair<int,int>;
typedef long long ll;
int main() {
int n;
cin >> n;
ll a[n];
rep(i,n){
cin >> a[i];
}
sort(a,a+n);
rep(i,n-1){
if(a[i]==a[i+1]){
cout <<"NO" <<endl;
return 0;
}
}
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n);... | 1 | 35,765,548 |
#include<iostream>
#include<vector>
#include<limits>
#include<algorithm>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> arr(n);
for(int i=0;i<n;i++) cin >> arr[i];
vector<int> dp(n, INT32_MAX);
dp[0] = 0;
for(int i=0;i<n-1;i++){
dp[i+1] = min(abs(arr[i] - arr[i+1]) + d... | #include<bits/stdc++.h>
using namespace std;
#define deb(x) cout <<"\n"<< (#x) << " = " << (x) << "\n"
const long long INF = 1e18;
const long long mod=1e9+7 ;
void inputoutput()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout)... | 1 | 16,043,642 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
template<typename T> using V = std::vector<T>;
using Vi = V<int>;
using VVi = V<V<int>>;
using Vl = V<ll>;
using VVl = V<V<ll>>;
using Vs = V<string>;
template<typename T1, typename T2> using P = std::pair<T1, T2>;
using Pii = P<int, int>;
using Pll = ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vl;
typedef pair<ll, ll> PP;
#define rep(i, n) for(ll i = 0; i < ll(n); i++)
#define all(v) v.begin(), v.end()
bool chmin(ll & a, ll b) { if (b < a) { a = b; return 1; } return 0; }
bool chmax(ll & a, ll b) { if (b > a) { a = b;... | 1 | 29,580,680 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int gcd(int a,int b){
while(b!=0){
int r=a%b;
a=b;
b=r;
}
return a;
}
int main(){
int n;
cin >> n;
vector<int> a(n);
rep(i,n){
cin >> a.at(i);
}
int ans=gcd(a.at(0),a.at(1));
rep(i,n){
... | #include <bits/stdc++.h>
#include <vector>
#include <queue>
#include <set>
#include <iostream>
#include <iomanip>
using namespace std;
typedef long long LL;
#define REP(i,n) for(int i=0;i<(n);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
LL gcd(LL val1, LL val2);
int main(){
int N;
cin >> N;
vector<LL> A... | 1 | 40,542,004 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define all(x) (x).begin(),(x).end()
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VLL;
typedef vector<VLL> VVLL;
typedef vector<string> V... | #include<bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
#define dbg(x...) do{cout << "\033[32;1m" << #x << "->" ; err(x);} while(0)
void err(){cout << "\033[39;0m" << endl;}
template<template<typename...> class T,typename t,typename... A>
void err(T<t> a,A... x){for (auto v:a) cout << v << ' '; err(x...);}
te... | 1 | 49,337,416 |
#include<iostream>
#include<cstring>
#include<cstdlib>
#include<cctype>
#include<cstdio>
#include<algorithm>
#include<string>
using namespace std;
#define REP(i,n) for(int i= 0;i < n;i++)
char mozi[][5] = {
{'.',',','!','?',' '},
{'a','b','c'},
{'d','e','f'},
{'g','h','i'},
{'j','k','l'},
{'m','n','o'},
{'p','q'... | #include <bits/stdc++.h>
using namespace std;
#define PI 4*atan(1)
#define INF 1e8
int dx[4] = {1,0,-1,0};
int dy[4] = {0,1,0,-1};
vector<string> button = {".,!?@",
"abc",
"def",
"ghi",
"jkl",
"mno",
"pqrs",
"tuv",
"wxyz"};
int main... | 1 | 99,943,677 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i < (n); i++)
using namespace std;
using ll = long long;
int main(){
string s,t;
cin >> s >> t;
if(s.size()<t.size()){
cout << "UNRESTORABLE" << endl;
return 0;
}
int fit=-1;
for(int i=0; i<=s.size()-t.size(); i++){
... | #include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#... | 1 | 13,095,828 |
#include <iostream>
#include <string.h>
#include <stdio.h>
using namespace std;
int main(){
char s[100], p[100];
scanf("%s",s);
scanf("%s",p);
int lgp = strlen(p);
for (int i=0;i<strlen(s);i++){
for (int j=0; j < lgp; j++){
if (s[j] != p[j]) break;
if (j == lgp-1){
cout << "Yes" << endl;
retur... | #include <iostream>
#include <string>
using namespace std;
int main () {
int a;
string p,s;
cin >> p >> s;
p += p;
a=p.find(s);
if(a==-1)cout <<"No"<<endl;
else cout << "Yes"<<endl;
} | 1 | 86,795,955 |
#include <cstdio>
long long n,m;
int main(){
scanf("%lld %lld",&n,&m);
long long x=0;
if(m<=n*2)x=m/2;
else x=(n*2+m)/4;
printf("%lld",x);
} | #include <iostream>
using namespace std;
int main(){
long long int n, m;
cin >> n >> m;
long long int ans;
if(n*2 > m) ans = m/2;
else{
ans = n;
m -= n*2;
ans += m/4;
}
cout << ans << endl;
return 0;
} | 1 | 23,252,921 |
#include <stdio.h>
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <functional>
using namespace std;
int main(){
int n;
scanf ("%d",&n);
while(n){
int k;
vector<int> p(n);
for(int t=0;t<n;t++){
scanf ("%d",&p[t]);
}
sort(p.begin(),p.end());
k=p[1... | #include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <utility>
#include <cstring>
#include <iomanip>
#include <numeric>
#include <limits>
#include <cmath>
#include <cassert>
using namespace std;
using ll = long long;
const int INF = 1<<30;
const int MOD = (int)1e9 ... | 1 | 21,240,323 |
#include <bits/stdc++.h>
#define pb push_back
#define ll long long
#define hell 1000000007
#define PI 3.14159265358979323846
#include <fstream>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t=1;
while(t--) {
ll n,i,j,k;
cin>>n;
ll arr[n+1... | #pragma GCC target ("avx2")
#pragma GCC optimization ("unroll-loops")
#pragma GCC optimize("O2")
#include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define ll lon... | 1 | 67,886,177 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int a,b;
cin >> a >> b;
if(a>8||b>8) cout << ":(" << "\n";
else cout << "Yay!" << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
int main(){
int A, B;
cin >> A >> B;
if (A < 9 && B < 9){
cout << "Yay!" << endl;
}
else
{
cout << ":(" << endl;
}
} | 1 | 81,057,398 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <utility>
#include <iomanip>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
ll a[100000];
int main()
{
int n;
ll ans=0;
cin>>n;
for(int i=0;i<n;i++)
cin>>a[i];
if(a[n-1]!=2)
{
cout<<-1<<end... | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int mod=1e9+7;
const int INF=1001001001;
int ... | 1 | 48,710,379 |
#include<iostream>
#include<math.h>
#include<bits/stdc++.h>
#define ll long long int
#define hell 1000000007LL
using namespace std;
ll power(ll x, ll y){
if(y==0)
return 1;
else
{
ll p=power(x,y/2);
if(y%2==0)
return (p*p)%hell;
else
return (x*((p*p)%hell))%hel... | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<set>
#include<iomanip>
#define rep(i, a, n) for(int i = a; i < n; i++)
using namespace std;
int main(){
int a;
cin >> a;
cout << a * a << "\n";
} | 1 | 28,031,711 |
#pragma GCC optimize("O3", "unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
using pii = pair<int, int>;
template<typename T>
using prior = priority_queue<T, vector<T>, greater<T>>;
template<typename T>
using Prior = priority_queue<T>;
#define X first
#define... | #include <bits/stdc++.h>
using namespace std;
int main() {
int D;
cin >> D;
cout << "Christmas";
for (int i = D; i < 25; i++) {
cout << " Eve";
}
cout << endl;
return 0;
} | 1 | 30,574,793 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int m;
string s;
cin >> s;
m=s.at(6)-'0'+(s.at(5)-'0')*10;
if(m>4){
cout << "TBD" << endl;
}else{
cout << "Heisei" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define debug(x) cerr << "L" << __LINE__ << ": " << #x << " = " << (x) << endl
#define debugvec(v) rep(i, v.size()) cerr << "L" << __LINE__ << ": " << #v << "[" << i << "] = " << v[i] << endl;
#define debugvec2(v) ce... | 1 | 72,409,457 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
string s;
cin >> s;
string ans = "" ;
int cnt = 0;
for(int i=s.size()-1; i>=0; i--)
{
if(!cnt && s[i]!='B')
ans += s[i];
else if(cnt && s[i]!='B')
{
cnt--;
}
else if(s[i]=='B')
cnt++;
... | #include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int main() {
string s;
cin >> s;
string res;
for (auto ss : s) {
... | 1 | 56,167,386 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.