code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 45 101M |
|---|---|---|---|
#include <bits/stdc++.h>
#define ll long long
#define endl '\n'
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
using namespace std;
void solve(){
int k,n;
cin >> k >> n;
if(k*500 >= n) cout <<"Yes";
else cout <<"No";
}
int main(){
fastio;
#ifndef ONLINE_JUDGE
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define dl double
#define ull unsigned long long
#define ft first
#define sd second
#define pi acos(-1)
#define ct(tc) scanf("%lld",&tc)
#define scnm(n,m) ... | 1 | 66,603,980 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if(s.at(0) == '1') s.at(0) = '9';
else s.at(0) = '1';
if(s.at(1) == '1') s.at(1) = '9';
else s.at(1) = '1';
if(s.at(2) == '1') s.at(2) = '9';
else s.at(2) = '1';
cout << s << endl;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for (int i = s; i < (int)(n); i++)
#define out(x) cout << x << endl
#define INF 1000000;
#include <map>
#include <math.h>
using ll = long long;
using nam... | 1 | 79,691,838 |
#include <bits/stdc++.h>
#define all(x) begin(x), end(x)
#define dbg(x) cerr << #x << " = " << x << endl
#define _ << ' ' <<
using namespace std;
using ll = long long;
using vi = vector<int>;
map<int, int> f;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
int sum = 0;... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using V = vector<int>;
using VV = vector<vector<int>>;
using VVV = vector<vector<vector<int>>>;
using VL = vector<ll>;
using VVL = vector<vector<ll>>;
using VVVL = vector<vector<vector<ll>>>;
template<class T> using P = ... | 1 | 62,573,776 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,n,m) for(int i=(int)(n); i<=(int)(m); i++)
#define RFOR(i,n,m) for(int i=(int)(n); i>=(int)(m); i--)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define RITR(x,c) for(__typeof(c.rbegin()) x=c.rbegin();x!=c.rend(... | #include<iostream>
using namespace std;
int main(){
int n,k;
cin>>n>>k;
if(n%k==0) cout<<"0";
else cout<<"1";
} | 1 | 49,915,235 |
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using vec=vector<ll>;
#define For(i,a,b) for(i=a;i<(ll)b;i++)
#define rep(i,N) For(i,0,N)
#define rep1(i,N) For(i,1,N)
#define all(v) (v).begin(),(v).end()
#define vsort(v) sort(all(v))
#define endl "\n"
#define pb push_back
... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <functional>
#include <bitset>
#include <numeric>
#include <complex>
#include <iomanip>
#include <cassert>
#include <random>
int main() {
int... | 1 | 85,525,498 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define repp(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
#define repm(i,n) for(int (i)=(n-1);(i)>=0;(i)--)
#define INF (1ll<<60)
#define all(x) (x).begin(),(x).end()
typedef long long lint;
const lint MOD =1000000007;
const lint MAX =... | #include <bits/stdc++.h>
using namespace std;
typedef long long signed int LL;
typedef long long unsigned int LU;
#define incID(i, l, r) for(int i = (l) ; i < (r); i++)
#define incII(i, l, r) for(int i = (l) ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) for(... | 1 | 79,839,526 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fastio ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define gcd(a,b) __gcd((a),(b))
#define lcm(a,b) ((a)*(b))/gcd((a),(b))
const int maxn = 1e9 + 5;
#define INF 100000000000
const int MOD = 1e9+7;
const double PI = 3.1415926535897932384... | #include <bits/stdc++.h>
using namespace std;
int main() {
int X, Y;
cin >> X >> Y;
bool flag = false;
int legs = 0;
for(int i=0; i<=X; i++){
int j = X-i;
legs = 2*i + 4*j;
if(legs == Y){
flag = true;
break;
}
}
if(flag)
cout << "Yes" << endl;
else
cout << "No" << end... | 1 | 68,473,839 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
set<int> SE;
for (int i = 0; i < K; i++) {
int D;
cin >> D;
for (int j = 0; j < D; j++) {
int A;
cin >> A;
SE.insert(A);
}
}
cout << N - SE.size() << "\n";
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <queue>
#include <deque>
#include <bitset>
#include <iterator>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <functional>
#include <numeric... | 1 | 8,245,248 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using ll = long long;
using ld = long double;
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define rep3(i, n) for (ll i = 1; i < (ll)(n+1); i++)
#define rep4(i, s, n) for (ll i = (s); i < ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int k,s,ans=0;
cin >> k >> s;
for (int x=0; x < k+1; x++) {
if (s-x>2*k) continue;
else if (s-x<0) continue;
else {
ans += min((2*k+1)-(s-x),s-x+1);
}
}
cout << ans << endl;
} | 1 | 66,387,080 |
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef long double ld;
#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 =... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main()
{
double n, ans = 0;
cin >> n;
rep(i, n)
{
double a;
cin >> a;
ans += 1 / a;
}
cout << fixed << setprecision(14) << 1.0 / ans << endl;
return 0... | 1 | 80,422,579 |
#include <bits/stdc++.h>
using namespace std;
#define arep(i, x, n) for (int i = int(x); i < (int)(n); i++)
#define rep(i, n) for (long long i = 0; i < n; ++i)
#define pi 3.141592653589793
#define eps 0.00000001
#define INF 1e9 + 7
using ll = long long;
int main(){
ll H;
ll W;
cin >> H >> W;
ll sum = H ... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using LL = long long;
using P = pair<int,int>;
int main(){
LL H,W;cin >> H >> W;
LL ans = 0;
LL tmp;
if(H == 1||W == 1){
cout << 1 << endl;
return 0;
}
tmp = H/2;
ans += tmp * W;
if(H%2==1){
tmp = (W+1)/2;
an... | 1 | 6,387,430 |
#include <iostream>
#include <vector>
using namespace std;
int main(void){
int n,i,ans=0,x=0;
cin >> n;
vector<int> h(n);
for(i=0;i<n;i++) cin >> h[i];
for(i=0;i<n;i++){
if(x<h[i]){
ans+=h[i]-x;
x = h[i];
}
else x = h[i];
}
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n-1; i >= 0; i--)
#define ALL(x) x.begin(),x.end()
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
const int mod = 1e9+7;
const ll INF = 1e18;
const int MAX = 1e6;
int ma... | 1 | 8,422,441 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, gcd;
cin >> n >> gcd;
n--;
while (n--) {
int a;
cin >> a;
gcd = __gcd(gcd, a);
}
cout << gcd << endl;
} | #include<iostream>
#include<vector>
using namespace std;
int gcd(int x,int y){
return y ? gcd(y,x%y) : x;
}
int main(){
int n;
cin>>n;
vector<int> a(n);
for(int i=0;i<n;i++) cin>>a[i];
int ans=0;
for(int i=0;i<n;i++){
ans=gcd(ans,a[i]);
}
cout<<ans<<endl;
} | 1 | 55,261,644 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define lb lower_bound
#define ub upper_bound
#define fi ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
ll nCr(ll n, ll r){
ll a = 1;
ll b = 1;
rep(i, r){
a *= n-i;
b *= i+1;
}
return a/b;
}
int main()
{
ll N, P;
cin >> N >> P;
vector<ll> A(N);
ll even ... | 1 | 72,237,161 |
#include <bits/stdc++.h>
using namespace std;
#define dump(x) cout << (x) << '\n';
typedef int64_t Int;
Int mod = 1e9+7;
Int INF = 1e9+7;
int main() {
while (true) {
Int m, nmin, nmax;
cin >> m >> nmin >> nmax;
if (m == 0) break;
vector<Int> p(m + 1);
for (Int i = 1; i <= m; ... | #include <cstdio>
int m,nmin,nmax;
int P[205];
int diff[205];
int main(){
while(scanf("%d%d%d",&m,&nmin,&nmax)&&m&&nmin&&nmax){
for(int i=1;i<=m;i++) scanf("%d",P+i);
for(int i=1;i<=m-1;i++) diff[i]=P[i]-P[i+1];
int ans=nmax,difference=diff[ans];
for(int i=nmax;i>=nmin;i--)
... | 1 | 84,784,258 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll MOD = 998244353;
#define vec vector<int>
#define vecll vector<ll>
#define vecst vector<string>
#define vecb vector<bool>
#define rep(i,n) for(ll i=(ll)0; i<(ll)n; i++)
#define REP(i,m,n) for(ll i=(ll)m; i<(ll)n; i++)
#define... | #include <bits/stdc++.h>
using namespace std;
int n, m;
string a[100], b[100];
bool check(int i, int j)
{
if ((n - i) < m || (n - j) < m)
{
return false;
}
for (int ax = i, bx = 0; bx < m; ax++, bx++)
{
for (int ay = j, by = 0; by < m; ay++, by++)
{
if (a[ax][ay] ... | 1 | 71,292,627 |
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long li;
li Solve(li a, li b) {
if (a < b) swap(a, b);
if (a == b) return a;
li x = (a - 1) / b;
return x * 2 * b + Solve(b, a - x * b);
}
int main(void) {
li n, x;
scanf("%lld %lld\n", &n, &x);
li ans = n + Solve(... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <random>
using namespace std;
using namespace __gnu_pbds;
typedef
tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag, tree_order_statistics_node_update> orderedSet... | 1 | 92,540,987 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
ll n, x, m;
cin >> n >> x >> m;
vector<int> id(m, -1);
vector<ll> s;
int len = 0;
while (id[x] == -1) {
id[x] = len++;
s.push_back(x);
x = x * x % m;
}
int d ... | #include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int,int> pii;
#define FOR(i, n) for(int i = 1; i<=n; i++)
#define F0R(i, n) for(int i = 0; i<n; i++)
#define mp make_pair
#define pb push_back
#define f first
#define s second
LL n, MOD, x, ans = 0, sq, nosq;
vector<LL> seq, pf, oseq, bef;
... | 1 | 96,508,220 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long double A,B;
cin >> A >> B;
cout << (long long)floor(A*B+0.001) << endl;
} | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < n; i++)
#define reps(i, s, n) for (int i = s; i < n; i++)
#define all(v) v.begin(), v.end()
#define INF 1000000000
#define mod 1000000007
#define EPS 0.001
using namespace std;
using ll = long long;
using vi = vector<int>;
using pl... | 1 | 76,006,877 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false); cin.tie(NULL);
int n;
cin>>n;
set<int>s;
for(int i =0 ;i<n;i++)
{
int x;
cin>>x;
s.insert(x);
}
if(s.size()==n)
cout<<"YES\n";
else
cout<<"NO\n";
return 0;
} | #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<int> a(n);
rep(i,n)cin>>a[i];
sort(all(a));
rep(i,n-1){
if(a[i]==a[i+1]){
cout<<"NO"<<endl;
return 0;
}
}
... | 1 | 85,110,515 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0; i<(n); i++)
#define REP2(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
const long long INF = numeric_limits<long long>::max();
template<class T> inline bool chmax(... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1000000000LL;
#define all(x) (x).begin(),(x).end()
#define ... | 1 | 75,456,362 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using pii = pair<int, int>;
#define rep(i,n) for(int i=0; i<(int)(n); i++)
int main() {
ll n,a,b; cin>>n>>a>>b;
ll d=b-a;
ll ans;
if(d<0||(n==1&&d!=0)){ans=0;}
else if(n==1){ans=1;}
else{ans=d*(n-2)+1;}
cout<<ans<<endl;
} | #include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
template<class T> inli... | 1 | 66,345,270 |
#include <iostream>
using namespace std;
int main()
{
int A1, A2, A3, A4;
cin >> A1 >> A2 >> A3 >> A4;
int B1, B2, B3, B4;
cin >> B1 >> B2 >> B3 >> B4;
int S = A1+A2+A3+A4;
int T = B1+B2+B3+B4;
if(S>=T){
cout << S << '\n';
}
else{
cout << T << '\n';
}
return 0;
} | #include<iostream>
#include<algorithm>
using namespace std;
int main(){
int a, b, c, d, ans = 0;
while(cin >> a >> b >> c >> d) ans = max( ans, a + b + c + d);
cout << ans << endl;
} | 1 | 51,876,127 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i< (n); i++)
using ll = long long;
using namespace std;
int main(){
int N;
cin >> N;
int P[N];
rep(i,N) cin >> P[i];
int Q[N];
int minl = P[0];
rep(i,N){
minl = min(minl,P[i]);
Q[i] = minl;
}
int ans = 0;
rep(i,N){
if (Q[i]>=P[i]) ans++;
}
cout... | #include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a),... | 1 | 5,391,981 |
#include <bits/stdc++.h>
#define rep(i, f, n) for (ll i = (f); i < (ll)(n); i++)
#define repe(i, f, n) for (ll i = (f); i <= (ll)(n); i++)
using namespace std;
using ll = long long;
using GraphI = vector<vector<int>>;
using GraphC = vector<vector<char>>;
using pint = pair<int, int>;
int main() {
string S;
cin >> S;... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios_base::sync_with_stdio(0);cin.tie(0);
string s;
set<int> Set;
cin>>s;
for(char c:s)
Set.insert(c);
cout<<(int(Set.size())==int(s.size())?"yes\n":"no\n");
} | 1 | 16,761,012 |
#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>
#inclu... | #include <bits/stdc++.h>
#include <cmath>
const double PI = 3.14159265358979323846;
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, int> P;
const ll INF = 1e15;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ... | 1 | 67,375,908 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i=0; i<(n); ++i)
#define REPR(i,n,m) for (int i=(n); i>=(m); --i)
using namespace std;
using LL = long long;
using LD = long double;
using PLL = pair<long long, long long>;
using PLD = pair<long double, long double>;
using VLL = vector<long long>;
using VLD = vector<lo... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int ctoi(const char c) {
if ('0' <= c && c <= '9') return (c - '0');
return -1;
}
vector<int> input(int n) {
vector<int> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
}
return vec... | 1 | 45,507,237 |
#include <iostream>
using namespace std;
int main(void)
{
int N, X, T;
cin >> N >> X >> T;
int m = N / X;
int n = N % X;
int ans = m * T;
if (n != 0) {
ans += T;
}
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
void solve()
{
int x, t, n;
cin >> n >> x >> t;
int ans;
int times;
if (n%x==0)
times = n/x;
else
times = n/x+1;
ans = times*t;
cout << ans;
}
int main()
{
solve();
cout << "\n";
} | 1 | 91,723,280 |
#include <deque>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
deque<char> a(s.begin(), s.end());
int ans = 0;
while (1 < a.size()) {
if (a.front() == a.back()) {
a.pop_front();
a.pop_back();
}
else if (a.f... | #include <bits/stdc++.h>
#define rep(i, a, b) for(int i = a; i < b; i++)
#define Rep(i, a, b) for(int i = a; i <= b; i++)
#define repr(i, a, b) for(int i = a; i >= b; i--)
#define _GLIBCXX_DEBUG
#define Vl vector<ll>
#define Vs vector<string>
#define Vp vector<pair<ll, ll>>
using ll = long long;
#define ALL(v) (v).begi... | 1 | 32,575,209 |
#include <algorithm>
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
struct vertex{
vector<int> E;
};
#define MAX_V 10000
#define MAX_E 100000
bool isVisited[MAX_V];
bool isChecked[MAX_V];
vertex V[MAX_V];
vector<int> A;
void rec(int i){
isChecked[i]=true;
for(auto&e:V[i].E){
... | #include<bits/stdc++.h>
#define REP(i,n) for(int i=0;i<(n);i++)
#define ALL(v) (v).begin(),(v).end()
#define int long long
#define INF 1e18
using namespace std;
int V,E;
vector<int> G[10005];
int indeg[10005];
vector<int> tsort()
{
stack<int> S;
REP(i,V) if(indeg[i]==0) S.push(i);
vector<int> res;
while... | 1 | 62,425,260 |
#include<bits/stdc++.h>
using namespace std;
int main(){
cin.tie(NULL);
ios::sync_with_stdio(false);
int x,y;
cin>>x>>y;
if(x%y==0) cout<<-1<<'\n';
else{
int sum=0;
while(true){
sum+=x;
if(sum%y!=0) break;
}
cout<<sum<<'\n';
}
return 0;
} | #include <bits/stdc++.h>
#define PI 3.14159265359
#define INF 1e9
#define LINF 1e18
#define IMOD 1000000007
#define irep(i,n) for(int i = 0; i < (int)(n); i++)
#define irep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define lrep(i,n) for(long long i = 0; i < (long long)(n); i++)
#define lrep2(i,a,n) for(long l... | 1 | 11,589,103 |
#include <iostream>
#include <sstream>
#include <fstream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <utility>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cs... | #include<bits/stdc++.h>
#define godspeed ios_base:: sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define ll long long
#define ld long double
#define fi first
#define se second
#define mp make_pair
#define rep1(i,a,b) for(ll i=a; i<=b; i++)
#define repVect(i,n) for(ll i=0; i<sum.size(); i++)
#define fixed cou... | 1 | 9,243,655 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
const ll INF = 1LL<<60;
int main(){
int n;
cin>>n;
string s, t;
cin >> s >> t;
rep(i,n){
cout << s[i] << t[i];
}
cout << endl;
} | #include<bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i,n) for(int i=0;i<n;++i)
#define all(v) v.begin(), v.end()
typedef long long int ll;
typedef unsigned long long ull;
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
template<class T... | 1 | 47,888,432 |
#include "bits/stdc++.h"
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(ll i=0;i<n;++i)
#define END(x) (*(x.end()-1))
#define INF (INT_MAX / 2)
using namespace std;
typedef long long ll;
template<typename T>
T gcd(T a, T b){
if (a%b == 0){
return(b);
}
else{
return(gcd(b, a%b));
}
}
tem... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define double long double
#define rep(i, n) for (long long i = 0; i < (n); ++i)
#define repr(i, a, b) for (auto i = (a); i < (b); ++i)
#define itr(x, c) for (auto&& x : (c))
#define updatemax(t, v) ((t) = std::max((t), (v)))
#define updatemin(t, v) ((... | 1 | 24,068,620 |
#include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
int gcd(int a, int b) { return b != 0 ? gcd(... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
using namespace std;
typedef long long ll;
int main(){
ll N,M;
cin >> N >> M;
ll p[M];
string S[M];
for(int i=0;i<M;i++){
cin >> p[i] >> S[i];
}
ll err = 0;
ll ans = 0;
bool ok[N+1];
ll W[N+1];
for(... | 1 | 10,586,854 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
string ans = "Yes";
int nowh = 0, noww = 0, nowt = 0;
while(n--){
int t, w, h; cin >> t >> w >> h;
int s = t - nowt - abs(w-noww) - abs(h-nowh);
if(s >= 0 && s%2 == 0)
noww = w, nowh = h, nowt = t;
else
an... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<int>t(n+1),x(n+1),y(n+1);
t[0]=x[0]=y[0]=0;
for(int i=1;i<=n;i++){
cin>>t[i]>>x[i]>>y[i];
}
bool at=true;
for(int i=0;i<n;i++){
int dist=abs(x[i]-x[i+1])+abs(y[i]-y[i+1]);
int d=t[i+1]-t[i];
if(d<dist) at=fals... | 1 | 59,791,082 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int H, N;
cin >> H >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
sort(A.begin(), A.end());
int sum = 0;
for (int i = N-1; i >= 0; i--) {
sum += A.at(i);
if (H <= sum) {
cout << "Yes" << endl;
ret... | #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 h, n;
cin >> h >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
bool win = false;
rep(i, n)
{
h -= a[i];
if (h <= 0)
... | 1 | 69,156,528 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<ll,ll> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; } template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
#define M 1000000007
#define al... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
t... | 1 | 21,709,717 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i <(n); ++i)
#define REP2(i,x,n) for (int i = x; i <(n); ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
static const int INF = 1e9... | #include <iostream>
#include <numeric>
#include <stdio.h>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_... | 1 | 59,157,405 |
#include<bits/stdc++.h>
#define rep(i,m) for(long long i=0; i<m; i++)
#define per(i,m) for(long long i=m-1; i>=0; i--)
#define FOR(i,n,m) for(long long i=n; i<m; i++)
#define ROF(i,n,m) for(long long i=m-1; i>=n; i--)
#define SORT(v,n) do{sort(v,v+n);reverse(v,v+n);}while(0)
#define all(x) (x).begin(),(x).end()
#define... | #include <bits/stdc++.h>
#include <complex.h>
#define fmin brent_find_minima
#define int long long
#define endl "\n"
#define ALL(v) (v).begin(),(v).end()
#define COUNT(a,k) upper_bound(ALL(a),k)-lower_bound(ALL(a),k)
#define BIGGER(a,k) a.end()-upper_bound(ALL(a),k)
#define SMALLER(a,k) lower_bound(ALL(a),k)-a.begin()... | 1 | 29,326,543 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, m; cin >> n >> m;
vector<vector<int>> s(n, vector<int>(2));
vector<vector<int>> c(m, vector<int>(2));
for (int i=0; i<n; i++){
cin >> s.at(i).at(0);
cin >> s.at(i).at(1);
}
for (int i=0; i<m; i++){
cin >> c.... | #include <iostream>
int abs(int a)
{
if(a < 0)
{
return a * (-1);
}
else
{
return a;
}
}
int main()
{
int N, M, a[50], b[50], c[50], d[50], goal_num[50], goal_dist[50];
std::cin >> N >> M;
for(int i = 0; i < N; i++)
{
std::cin >> a[i] >> b[i];
goal_dist[i] = 1000000000;
}
for(... | 1 | 19,973,033 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,M;
cin >> N;
vector<string> S(N);
for (int i=0;i<N;i++) {
cin >> S.at(i);
}
cin >> M;
vector<string> T(M);
for (int i=0;i<M;i++) {
cin >> T.at(i);
}
int count=0;
int point=0;
for (int i=0;i<N... | #include <iostream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
void addWordCount(const vector<string>& cards, map<string, int>& wordCount);
void subWordCount(const vector<string>& cards, map<string, int>& wordCount);
int getMaxValue(const map<string, int>& wordCount);
i... | 1 | 73,758,073 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
int mx=0,ans;
for(int i=0;i<=20;i++)
{
if(n< (1<<(i+1)))
{
cout << (1<<i) << endl;
break;
}
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, to) for (int i = 0; i < (to); ++i)
#define repf(i, from, to) for (int i = (from); i < (to); ++i)
#define unless(cond) if (!(cond))
using namespace std;
using ll = long long;
template <typename T>
using V = vector<T>;
template <typename T, typename U>
using P = pair<T, U>;
int cou... | 1 | 86,944,298 |
#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
int main() {
double a, b, C;
cin >> a >> b >> C;
double S, L, h, radC, c;
radC = C *acos(-1) / 180;
S = 0.5 * a * b * sin(radC);
c = sqrt(a*a + b*b - 2 * a*b*cos(radC));
L = a + b + c;
h = 2 * S / a;
printf("%lf\n%lf\n%lf\n", S, L, h);
r... | #include<bits/stdc++.h>
using namespace std;
int main(){
cout<<fixed<<setprecision(12);
double a,b,C,h;
cin>>a>>b>>C;
C=C*acos(-1)/180;
h=b*sin(C);
double c=sqrt(a*a+b*b-2*a*b*cos(C));
cout<<a*h/2<<endl<<a+b+c<<endl<<h<<endl;
return 0;
} | 1 | 99,781,481 |
#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 r,g,ans;
cin>>r>>g;
ans=2*g-r;
cout<<ans<<endl;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using ll = long long;
using p = pair<int,int>;
using Graph = vector<vector<int>>;
int main(int argc, const char * argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
double r,g;
cin>>r>>g;
cout<<2*g-r<<endl;
retur... | 1 | 21,583,622 |
#include <bits/stdc++.h>
#include <chrono>
using namespace std;
using namespace std::chrono;
#define ll long long
#define ld long double
#define ull unsigned long long
#define endl "\n"
ll google_itr = 1;
#define google(x) cout<<"Case #"<<x<<":"
#define pi 3.14159265358979323846264338327950L
const ll mod = 1e9+... | #include "bits/stdc++.h"
#define DEBUG(x) cout<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cout<<#v<<":";for(int i=0;i<v.size();i++) cout<<" "<<v[i]; cout<<endl
using namespace std;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#de... | 1 | 19,241,719 |
#include <bits/stdc++.h>
using namespace std::literals::string_literals;
using i64 = std::int_fast64_t;
using std::cout;
using std::cerr;
using std::endl;
using std::cin;
template<typename T>
std::vector<T> make_v(size_t a){return std::vector<T>(a);}
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts){
... | #include <bits/stdc++.h>
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
#define _rrep(i,n) _rrange(i,0,n)
#define _rrange(i,a,b) for(int i=(int)(b)-1;i>=(int)(a);--i)
#de... | 1 | 7,453,826 |
#include<iostream>
#include<string>
#include<vector>
int main() {
int a, b; std::cin >> a >> b;
int ans = 0;
for(int i = a; i <= b; i++) {
std::string num = std::to_string(i);
bool f = true;
for(int j = 0; j < num.size() / 2; j++) {
if(num[j] != num[num.size() - 1 - j]) {... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A,B;
cin >> A >> B;
int num=0;
for(int i=A; i<B+1; i++){
int a =i/10000;
int e =i%10;
int b =i/1000-a*10;
int d =(i%100-e)/10;
if(a==e && b==d){
num++;}
}
cout << num <<endl;
} | 1 | 39,760,236 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <math.h>
#include <iomanip>
#include <map>
using namespace std;
#define INF 1e9
#define LLINF 1e18
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int gcd(int a, int b) {
if(a % b == 0) {
return ... | #include <bits/stdc++.h>
using namespace std;
#define fo(i, n) for (i = 0; i < n; i++)
#define Fo(i, k, n) for (i = k; k < n ? i < n : i > n; k < n ? i += 1 : i -= 1)
#define ll long long
#define si(x) scanf("%d", &x)
#define sl(x) scanf("%lld", &x)
#define ss(s) scanf("%s", s)
#define pi(x) printf("%d\n", x)
#define p... | 1 | 171,022 |
#include <iostream>
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll w,h,s[100000],t[100001],ans,a;
vector<ll>v;
int main(void){
cin>>w>>h;
for(int i=0;i<w;i++){
cin>>a;
v.push_back(a);
ans+=a;
}
for(int i=0;i<h;i++){
cin>>s[i];
}
sort(v.begin... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int W, H; cin >> W >> H;
vector<P> a(W + H);
for (int i = 0; i < W + H; i++) {
int x; cin >> x;
a[i] = {x, (i < W)};
}
sort(begin(a), end(a));
ll ans {};
int c[2] { W + 1, H + 1 };
for (aut... | 1 | 54,355,867 |
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
long long MOD = 1000000000 + 7;
int main(){
cout << setprecision(10);
string S;
cin >> S;
bool flg = false;
for(int n = 0; n <= S.size()-1; n++){
for(int m = 0; m <= S.size()-n; m++){
string T = S;
if... | 1 | 46,093,871 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define vi vector<int>
#define vll vector<ll>
#define inf 1000000000
#define mod 1000000007
ll power(ll a, ll b)
{
ll prod = 1;
while(b)
{
if(b&1)
... | #include <bits/stdc++.h>
int n;
std::string s[55], x;
int t[55], ans;
int main() {
std::cin >> n;
for (int i = 1; i <= n; ++i) {
std::cin >> s[i] >> t[i];
}
std::cin >> x;
int k = 1;
while (s[k] != x) {
++k;
}
for (int i = k + 1; i <= n; ++i) {
ans += t[i];
}
std::cout << ans << std::endl;
} | 1 | 93,990,037 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int a, b, c, d;
cin >> a >> b >> c >> d;
int ftravel = 0;
if (a >= b) {
ftravel = b;
} else {
ftravel = a;
}
if (c >= d) {
ftravel = ftravel + d;
} else {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int a, b, c, d;
cin >> a;
cin >> b;
cin >> c;
cin >> d;
cout << min(a, b) + min(c, d) << endl;
} | 1 | 72,318,382 |
#include <bits/stdc++.h>
#include<algorithm>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define repa(i,a,n) for(int i=(a);i<(n);i++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define rrepa(i,a,n) for(int i=n-1;i>=(a);i--)
#define all(a) (a).begin(),(a).end()
#define MOD 1000000007
#define cmax(a,b) a=... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair< int, int > pii;
typedef pair< pii, int > ppi;
#define fill(a,b) memset(a,b,sizeof(a))
#define all(v) (v).begin(),(v).end()
#define sp(k) cout<<setprecision(k)<<fixed;
#define rep(i,a) for(in... | 1 | 31,396,224 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <iomanip>
#include <map>
#include <set>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <iterator>
#include <string>
#include <limits>
using namespace std;
using i64 = int64_t;
using P = pai... | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INFLL LLONG_MAX
#define EPS 1e-9
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
#define vi vector<ll>
#defi... | 1 | 60,595,800 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const ll LINF = 1e18;
const int mod = 1e9+7;
#define pi pair<int,int>
#define pl pair<lld,lld>
#define dump(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ? "Y... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main(){
int n;
cin >> n;
double ans = 0.0, a;
rep(i, n){
cin >> a;
ans += 1.0 / a;
}
ans = 1.0 / ans;
printf("%f", ans);
} | 1 | 50,638,813 |
#include <bits/stdc++.h>
using namespace std;
using int32 = int_fast32_t;
using int64 = int_fast64_t;
const int32 INF = 1e9;
const int32 MOD = 1e9+7;
const int64 LLINF = 4 * 1e18;
#define YES(n) cout << ((n) ? "YES\n" : "NO\n" )
#define Yes(n) cout << ((n) ? "Yes\n" : "No\n" )
#define ANS(n) cout << (n) << "\n"
#defi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll,ll> l_l;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#def... | 1 | 45,461,724 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD=1000000007;
#define REP(i,n) for(ll i=0; i<(n); i++)
#define REP2(i,x,n) for(ll i=x; i<(n); i++)
const long long INF = numeric_limits<long long>::max();
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
... | #include<bits/stdc++.h>
using namespace std;
#define sz(x) (int)x.size()
#define pb push_back
#define mp make_pair
#define ll long long
#define mod 998244353
void fast(){
ios_base::sync_with_stdio(false);cin.tie(NULL);
}
int main() {
fast();
long long n;
cin>>n;
long long l=n;
int ans=0;
while(l){
l... | 1 | 89,795,823 |
#include<bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie();
char c;
cin>>c;
char out = c+1;
cout<<out;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int INF = 1001001001;
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool ... | 1 | 91,112,662 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = (0); i < (n); ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define DEBUG(val) cout << #val << " : " << val << endl
#define MOD 1000000007
int main() {
int n;
cin... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; ++i)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
ll ans = 0, sum = 0;
rep(i, n) {
int a;
cin >> a;
sum += a;
if (a == 0) {
ans += sum / 2;
sum = 0;
... | 1 | 72,831,482 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll,ll>;
using vl = vector<ll>;
using Map = map<ll,ll>;
using T = tuple<ll,ll,ll>;
using vvl = vector<vector<ll>>;
#define all(v) v.begin(), v.end()
#define prt(v) cout<<v<<"\n";
#define fi(v) get<0>(v)
#define se(v... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N, H;
cin >> N >> H;
vector<int> a(N), b(N);
for (int i = 0; i < N; i++)
{
cin >> a.at(i) >> b.at(i);
}
sort(a.rbegin(), a.rend());
sort(b.rbegin(), b.rend());
int res = 0;
int i = 0;
while (i < N && a.at(... | 1 | 2,766,288 |
#include<bits/stdc++.h>
using namespace std;
struct node{
int key;
node *next;
};
node L;
node* nil=&L;
int root;
node t[100000];
int main(){
int n,par[100000];
cin>>n;
for(int i=0;i<n;i++)par[i]=-1;
for(int i=0;i<n;i++){
int a,b,c;
cin>>a>>b;
node* pre=&t[a];
for(int j=0;j<b;j++){
cin... | #include<stdio.h>
#include<string>
#define MAX 100000
struct Node {
int parent;
int left;
int right;
int depth;
};
Node N[MAX];
void setDepth(Node& n, int depth) {
Node* cur = &n;
while (true) {
cur->depth = depth;
if (cur->left >= 0) {
setDepth(N[cur->left], depth + ... | 1 | 23,534,200 |
#include <bits/stdc++.h>
#define rep(i,n) for(long long i = 0; i < (n) ; ++i)
#define orep(i,n) for(long long i = 1; i <= (n); ++i)
#define drep(i,n) for(long long i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for(long long i = (s); i < (t); ++i)
#define rng(x) (x).begin(),(x).end()
#define rrng(a) (a).rbeg... | #include<bits/stdc++.h>
#define ll long long
#define mod 838627288460106
#define fast_io ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
using namespace std;
int main()
{
fast_io
ll a,b,c,d,s,t;
cin>>a>>b>>c>>d;
s=a+b;
t=c+d;
if(s<t)
cout<<"Right"<<endl;
else if(s>t)
... | 1 | 90,240,637 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, start, n) for (int i = (int)(start); i < (int)(n); ++i)
int main(){
string S, T;
int ans = 0;
cin >> S >> T;
rep(i,0,3){
if (S[i] == T[i]){
ans++;
}
}
cout << ans << endl;
} | #include <iostream>
#include <cassert>
#include <limits>
#include <cmath>
#include <algorithm>
#include <vector>
#include <unordered_map>
#include <unordered_set>
#include <string>
#include <array>
#include <map>
#include <set>
#include <deque>
#include <list>
#include <sstream>
#include <iomanip>
#include <numeric>
#i... | 1 | 61,871,199 |
#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
using namespace std;
#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)
type... | #include <iostream>
int main()
{
int a, b, c;
std::cin >> a >> b >> c;
if(a==b && b==c)
{
std::cout << "Yes" << std::endl;
}
else
{
std::cout << "No" << std::endl;
}
return 0;
} | 1 | 84,961,072 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N=100005;
int n,p[N],sz[N],U[N],V[N];ll tot,d[N];
map<ll,int>mp;vector<int>G[N];
inline bool cmp(int x,int y){return d[x]>d[y];}
void dfs(int x,int d){tot+=d;for(int i=0;i<G[x].size();i++)dfs(G[x][i],d+1);}
int main()
{
scanf("%d",&n);
for(in... | #include <bits/stdc++.h>
using namespace std;
typedef pair<long long, int> pli;
const int N = 1e5 + 10;
int h[N], n, cnt[N], par[N];
long long d[N], check;
vector<pli> di;
vector<int> child[N];
map<long long, int> mp;
void dfs(int v, int p){
h[v] = h[p] + 1;
for (int u : child[v])
dfs(u, v);
}
int main(){
ios::syn... | 1 | 89,749,726 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
using ll = long long;
using P = pair<int,int>;
void Yes() {
cout << "Yes" << endl;
}
void No() {
cout << "No" << endl;
}
int main(void) {
int x, t; cin >> x >> t;
cout << max(0, x - t);
} | #include <algorithm>
#include <complex>
#include <cstdlib>
#include <ctime>
#include <time.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <numeric>
#include <lim... | 1 | 50,444,542 |
#include <bits/stdc++.h>
#if DEBUG
template <typename T>
void debug(T value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) \
do { \... | #include <bits/stdc++.h>
#define rep(i,n) for (long long i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n, k, ans;
ans = 0;
cin >> n;
k = n;
while(k >= 100){
k = k / 100;
ans++;
}
if(ans == 0){
cout << min(9,n);
}
else if(ans == 1)... | 1 | 78,179,362 |
#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>
#incl... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A ;
cin >> N >> A;
int B = N - (N / 500 * 500) ;
if (A >= B)
cout << "Yes" << endl;
else if (A < B)
cout << "No"<< endl;
} | 1 | 40,505,036 |
#include <iostream>
using namespace std;
int nums[200];
int main(){
int N, A, B, C, X;
while(cin >> N >> A >> B >> C >> X && (N || A || B || C || X)){
int pos = 0;
int res = 0;
for(int i = 0; i < N; i++) cin >> nums[i];
if(nums[pos] == X) pos++;
while(pos < N){
res++;
X = (A * X + B)... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,a,b,c,x,x2;
while(1){
cin>>n>>a>>b>>c>>x; if(n==0)break;
int ans=0;
vector<int> y(n);
for(int i=0;i<n;i++){
cin>>y[i];
}
int pos=0;
while(1){
if(x==y[pos]){
pos++;
}
if(pos>=n)break;
x=(a*x +b)%c;
ans++;
if(ans>10000... | 1 | 83,416,700 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string A;
cin >> A;
if ((A.at(2) == A.at(3)) && (A.at(4) == A.at(5))) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | #include <stdio.h>
int main()
{
char S[10]; scanf ("%s", S);
puts(S[2] == S[3] && S[4] == S[5] ? "Yes" : "No");
return 0;
} | 1 | 23,676,739 |
#include <bits/stdc++.h>
#include <string>
#include <cstring>
#include <algorithm>
#include <math.h>
#include <map>
#include <bitset>
#include <cmath>
#include <set>
#include <utility>
#define INF 1000000000000
#define MOD 1000000007
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(v) v.begin(),v.end()
#define len(x) (ll)(x).length()
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
ll gcd(int a,int b){if(a%b==0){return b;}else{return(gcd(b,a%b));}}
ll lcm(int a,int b){return a*b/gcd(a,b);}
const int IN... | 1 | 65,787,869 |
#include <iostream>
#include <string>
using namespace std;
int main(){
int h, w, k;
string c[6];
int ans = 0;
cin >> h >> w >> k;
for(int i = 0; i < h; i++){
cin >> c[i];
}
int num = 0;
for(int i = 0; i < (1 << h); i++){
for(int j = 0; j < (1 << w); j++){
num = 0;
f... | #include <bits/stdc++.h>
using namespace std;
int n,m,k,sum = 0;
char a[10][10];
bool avail[10][10];
void reset(){
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) avail[i][j] = false;
}
int main(){
cin >> n >> m >> k;
for (int i = 1; i <= n; i++){
string s;
cin >> s;
... | 1 | 47,783,104 |
#include<iostream>
#include<math.h>
#include<algorithm>
#include<stdint.h>
#include<vector>
#include<deque>
#include<stack>
#include<string>
#include<cstring>
#include<time.h>
#include<array>
#include<iomanip>
#include<list>
#include<set>
#include<unordered_map>
#include<unordered_set>
#include<random>
#include<bitset>... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, const char *argv[]) {
int n, i;
cin >> n >> i;
cout << n - i + 1 << '\n';
return 0;
} | 1 | 5,619,350 |
#include <iostream>
#include <algorithm>
#include <set>
int main() {
int n;
std::cin >> n;
std::set<int> seti;
int a[200010];
for (int i = 0; i < n; ++i)
{
std::cin >> a[i];
seti.insert(a[i]);
}
if (seti.size() == n)
std::cout << "YES";
else
std::cout << "NO";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
map<int, int> cnt;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
cnt[a[i]]++;
if (cnt[a[i]] == 2) {
cout << "NO" << '\n';
return 0;
}
}
cout <... | 1 | 33,171,069 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define ve vector
int main(){
string s;
cin >> s;
int ans=0,memo=0;
int now = 0;
int n = s.size();
rep(i,n){
if(s[i]-'0' != now) ans++;
n... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <list>
#include <utility>
#include <tuple>
#include <cstdio>
#include <set>
#include <queue>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#inclu... | 1 | 49,328,782 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
#define rep(i,n) for (ll i=0;i<n;++i)
#define rep2(i,a,b) for (ll i=a;i<b;++i)
const ll MOD=1e9+7;
const ll INF=1e9;
const ll IINF=1e18;
const double EPS=1e-8;
const double pi=acos(-1);
template<class... | 1 | 81,485,235 |
#include <iostream>
#include <string>
#include <sstream>
#include <vector>
using namespace std;
int main()
{
int N = 0;
std::string lineBuf;
cin >> N;
std::vector<int> vctA(N + 2);
#if 0
cin >> lineBuf;
istringstream iss(lineBuf);
string s;
while (iss >> s){
cout << s;
}
#else
vctA[0] = 0;
for (int i = 0... | #include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
using namespace std;
int N; vector<int> A;
void input()
{
cin >> N;
A.resize(N+2);
A[0] = A[N+1] = 0;
for (int i = 0; i < N; ++i) cin >> A[i+1];
}
void solve()
{
int cost = 0;
for (int i = 0; i < N+1; ++i){
cost ... | 1 | 52,368,142 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1LL << 60;
ll N, X;
vector<ll>a, p;
ll f(ll L, ll X) {
if (L == 0) {
if (X <= 0) return 0;
return 1;
}
ll m... | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
vector<long long> len(55);
vector<long long> pat(55);
long long solve(long long n, long long x){
if (x == len[n]) return pat[n];
long long ans = 0;
x--;
if (x){
long long l = min(x,len[n-1]);
ans += solve(n-1,l);
x... | 1 | 41,567,673 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using p = pair<int,int>;
int main() {
string s;
cin >> s;
rep(bit,(1<<3)){
ll sum = s[0]-'0';
string ans= "";
ans += s[0];
rep(i,3){
if (bit & (1<<i)) {
sum += s[i... | #include<bits/stdc++.h>
using namespace std;
int main()
{
string s; cin >> s;
for (int i = 0; i < 8; ++i)
{
int ans = s[0]-48;
string op = "";
for (int j = 2; j >= 0; --j)
{
if (i & 1 << j)
{
ans -= s[3-j]-48;
op += "-";
}
else
{
ans += s[3-j]-48;
op += "+";
}
}
if (ans ... | 1 | 96,164,452 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using POS = pair<int, int>;
unordered_map<int, POS> n_to_pos;
int cum_pow[300 * 300 + 1];
int main() {
int H, W, D;
cin >> H >> W >> D;
for (int i=0; i<H; i++) {
for (int j=0; j<W; j++) {
int A;
cin >> A;
n_to_pos[A] = make_pair(i, j);
... | #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)
#define int long long
using namespace std;
const int MX = 1e6;
const int inf = 1e9;
const int mod =... | 1 | 90,893,279 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using LL = long long;
using P = pair<int,int>;
int main(){
int x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
int x3, y3, x4, y4;
x3 = x2 - (y2 - y1);
y3 = y2 + (x2 - x1);
x4 = x1 - (y2 - y1);
y4 = y1 + (x2 - x1);
co... | #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++)
#d... | 1 | 79,149,963 |
#include <bits/stdc++.h>
#include <vector>
#define rep(i, n) for(int i = 0; i < n; ++i)
#define ll long long
using namespace std;
int main() {
int x, y;
cin >> x >> y;
cout << (x-1)*(y-1) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std ;
typedef double du ;
typedef string st ;
typedef long long ll ;
typedef long double ld ;
typedef long long int lli ;
#define vi vector <lli>
#define loop(num) for (lli i = 0 ; i < num ; i ++ )
#define loopcin(num , ar ) for (lli i = 0 ; i < num ; i ++ ) {cin >> ar [i] ;}
#d... | 1 | 47,405,764 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e9+7;
int main(){
string s; cin>>s;
int cnt1{},cnt2{};
for(int i=0; i<s.size(); i++){
if(s.at(i)=='0'+i%2) cnt1++;
if(s.at(i)=='1'-i%2) cnt2++;
}
cout << min(cnt1,cnt2)<<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int cnt = 0;
for (int i = 1; i < s.size(); i++) {
if (s.at(i-1) == s.at(i)) {
cnt++;
if (s.at(i) == '0') {
s.at(i) = '1';
} else {
s.at(i) = '0';
... | 1 | 36,346,172 |
#include <iostream>
using namespace std;
int main(){
long n;
cin >> n;
long A[10001] = {};
for (long i = 0; i < n; i++){
long x;
cin >> x;
A[x]++;
}
long k = 0;
for (long i = 0; i <= 10000; i++){
for (long j = 0; j < A[i]; j++){
if (k) cout << " ";... | #include <iostream>
using namespace std;
int main()
{
const int MAX_VALUE = 10000;
int n;
cin >> n;
int A[n + 1], B[n + 1], C[MAX_VALUE + 1];
for (int i = 0; i <= MAX_VALUE; i++) {
C[i] = 0;
}
for (int i = 1; i <= n; i++) {
cin >> A[i];
C[A[i]]++;
}
for (int i... | 1 | 44,447,452 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ok() puts(ok?"Yes":"No");
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef set<int> si;
ty... | #include <iostream>
#include <string>
#include <algorithm>
#include <ctime>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <cassert>
#include <bitset>
#include <list>
#include <cstdio>
#include <stdio.h>
#include <string.h>
#include <limits.h>
#include <... | 1 | 7,302,146 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
#define ALL(x) (x).begin(), (x).end()
#define REP(i ,n) for(int i = 0; i < (int)(n); i++)
#define pb push_back
typedef vector<int>vint;
typedef vector<ll>vll;
template<typename T> istream &operator>>(istream &is, vecto... | #include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define LCM(a, b) (a) / __gcd((a), (b)) * (b)
#define CEIL(a, b) (a)/(b)+(((a)%(b))?1:0)
#define ln '\n'
using namespace std;
using LL = long long;
u... | 1 | 29,100,598 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(int i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = ve... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
cin.tie(0)->sync_with_stdio(false);
int n; cin >> n;
int h, w; cin >> h >> w;
vector<int> a(n), b(n);
REP(i, n) cin >> a[i] >> b[i];
int cnt = 0;
REP(i, n)
if (a[i] >= h && b[i]... | 1 | 98,250,501 |
#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
int n;
int a[N];
int rem[N];
vector<int> G[N];
void dfs(int u, int p) {
int mx = 0;
rem[u] = (G[u].size() == 1 ? a[u] : 0);
for (int v : G[u]) if (v != p) {
dfs(v, u);
rem[u] += rem[v];
mx = max(mx, rem[v]);
}
if (a[u] > rem[u]) { printf("NO... | #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... | 1 | 4,225,981 |
#include<iostream>
#include<algorithm>
#include<map>
using namespace std;
int main()
{
int n,i,a=0,b=0,k1,k2,n1=0,n2=0,ans1,ans2;
cin>>n;
int m1[n];
int m2[n];
for(i=0;i<n;i++)
{
cin>>m1[i];
n1=n1*10+m1[i];
}
for(i=0;i<n;i++)
{
cin>>m2[i];
n2=n2*10+m2[... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v... | 1 | 65,775,028 |
#include <iostream>
#include <vector>
#include <stack>
#include <queue>
using namespace std;
#define INT_MIN (-2147483647 - 1)
#define INT_MAX 2147483647
static const int N = 100;
static const int NEW = 0;
static const int VISITING = 1;
static const int OLD = 2;
int n, m[N][N] = {0}, t;
int color[N] = { ... | #include<iostream>
#include<vector>
#include<queue>
using namespace std;
void calc(const vector<vector<int> >& G, vector<int>& D,
queue<int>& Q, int dim) {
if (Q.empty()) return;
queue<int> Q2;
while (!Q.empty()) {
int i = Q.front();
for (int j = 1; j ... | 1 | 8,883,719 |
#include <bits/stdc++.h>
#define _USE_MATH_DEFINES
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
constexpr ll INF = 1e16;
constexpr ll INM = 114514;
constexpr ll MOD = 1e9 + 7;
constexpr ld EPS = 1e-12;
constexpr ll dx[4] = {1, 0, -1, 0};
constexpr ll dy[4] = {0, 1, ... | #include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#include <numeric>
using namespace std;
int n;
int m;
int main() {
cin >> n >> m;
vector<bool> is_acs(n, false);
vector<int> wa_cnt(n, 0);
int ac_cnt = 0;
int penalty = 0;
for (int i=0;i<m;i++) {
int p;
str... | 1 | 32,441,021 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const ll LINF = 1e18;
const int mod = 1e9+7;
#define pi pair<int,int>
#define pl pair<lld,lld>
#define dump(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ? "Y... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; ++i)
int main() {
int n;
cin >> n;
queue<int> que;
rep(i, n) {
int p;
cin >> p;
if(i == 0) que.push(p);
else {
if(que.back() > p) que.push(p);
}
}
cout << que.size() << endl;
} | 1 | 25,229,198 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M, X, Y;
cin >> N >> M >> X >> Y;
vector<int> x(N);
vector<int> y(M);
for(int i = 0; i < N; i++) {
cin >> x[i];
}
for(int i = 0; i < M; i++) {
... | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main()
{
int n, m;
cin >> n >> m;
vector<int> xv(n + 1);
vector<int> yv(m + 1);
cin >> xv[0];
cin >> yv[0];
int mx = xv[0];
for (int i = 1; i <= n; ++i) {
cin >> xv[i];
mx = max(xv[i], mx);
}
int my = yv[0];
for (int i = ... | 1 | 33,162,301 |
#include <stdio.h>
#include <string.h>
char s[20],t[20];
int main(){
int i,len;
scanf("%s%s",s,t);
len=strlen(s);
for(i=0;i<len;i++)
if(s[i]!=t[i])return 0*printf("No\n");
return 0*printf("Yes\n");
} | #include <bits/stdc++.h>
#define fastIO (cin.tie(0), cout.tie(0), ios::sync_with_stdio(false))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define precise(i) fixed << setprecision(i)
using lint = long;
using llint = long long;
using namespace std;
int main() {
fastIO;
string s, t;
cin >> s >> t;
for... | 1 | 32,200,905 |
#include <iostream>
using namespace std;
int main() {
int a, b, c, d, l, r;
cin >> a >> b >> c >> d;
l = a + b;
r = c + d;
if (l > r) {
cout << "Left" << endl;
}
else if (l == r) {
cout << "Balanced" << endl;
}else if(l < r){
cout << "Right" << endl;
}
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i< (n); ++i)
#define vvec(m,n) vector<vector<int>> (int(m), vector<int>(n))
#define ALL(a) (a).begin(), (a).end()
using ll = long long;
int main(){
int A, B, C, D;
cin >> A >> B >> C >> D;
string res;
if(A+B>C+D) res = "Left";... | 1 | 49,364,283 |
#include<bits/stdc++.h>
using namespace std;
string a,b;
int main()
{
cin>>a;
for(int i=0;i<a.size();i++)
{
switch(a[i])
{
case '0':b+='0';break;
case '1':b+='1';break;
case 'B':
{
if(b.size()>0)
{
string c;
for(int i=0;i<b.size()-1;i++)
{
c+=b[i];
}
b=... | #include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i <(n); ++i)
#define REP2(i,x,n) for (int i = x; i <(n); ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
static const int INF = 1e9... | 1 | 20,974,056 |
#include <iostream>
int check(int x, int& y) {
int times = 0;
while (y <= x) {
++times;
y *= 2;
}
return times;
}
int main() {
int a, b, c, k;
std::cin >> a >> b >> c >> k;
int times = 0;
times += check(a, b);
times += check(b, c);
if (times <= k) std::cout << "Yes" << std::endl;
else std:... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#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++)
using namespace std;
ll ctoi(const char c){if('0'<=c&&c<='9') return (c-'0');return -1;}
#define ALL(x) begin(x),end(x)
int main(){
ll a,b,c,k;
cin >> ... | 1 | 86,293,431 |
#include <bits/stdc++.h>
using namespace std;
bool is_kaibun(string s) {
for ( int i = 0; i < s.size(); i++ ) {
if ( s[i] != s[s.size()-i-1] ) { return false; }
}
return true;
}
int main() {
string s;
cin >> s;
int n = s.size();
string ans = (
is_kaibun(s) &&
is_kaibun(s.substr(0, (n-1)/2)) &&... | #include<bits/stdc++.h>
using namespace std;
int main(){
string s,c;
cin >> s;
bool ok=true;
for(int i=0;i<s.size();i++){
if(s.at(i)!=s.at(s.size()-1-i))ok=false;
}
c=s;
for(int i=0;i<s.size()/2+1;i++){
c.pop_back();
}
for(int i=0;i<c.size();i++){
if(c.at(i)!=... | 1 | 87,299,444 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<(n); ++i)
#define rep2(i, s, n) for(int i=s; i<(n); ++i)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
template<typename T>
using priority_queue_rev = priority_queue<T, vector<T>, greater<T> >;
static const int INTINF = (214748... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<vector<ll>> a(n, ... | 1 | 78,686,598 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.