code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int main(void){
int D;
cin >> D;
string s = "Christmas";
if(D == 24) s += " Eve";
if(D == 23) s += " Eve Eve";
if(D == 22) s += " Eve Eve Eve";
cout << s << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using PII = pair<ll, ll>;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
template<typename T> void chmin(T &a, const T &b) { a = min(a, b); }
template<typename T> void chmax(T &a... | 0 | 82,332,831 |
#include <bits/stdc++.h>
#include <vector>
#define rep(x, n) for(int i = x; i < (n); ++i)
using namespace std;
using ll = long long;
ll H, W;
vector<string> a(100);
int main(void)
{
cin >> H >> W;
rep(0, H) cin >> a.at(i);
vector<bool> row(H, false);
vector<bool> col(W, false);
for (int y = 0; y < H; ++y) {
... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#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 a, b;
string s;
cin >> a >> b >> s;
if(s.size()!=a+b+1) {cout << "No" << endl; return 0;}
if(s... | 0 | 3,183,671 |
#include <iostream>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main(){
int n, k;
ll s;
cin >> n >> k >> ... | #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <iomanip>
#include <random>
#include <cassert>
#include <cstring>
using namespace std;
#define GET_ARG(a,b,c,F,...) F
#define REP3(i,s,e) for (i = s; i <= e; i++)
#define REP2(i,n) REP3 (i,0,(int)(n)-1)
#d... | 0 | 30,429,730 |
#include<iostream>
using namespace std;
int a,b,c,s,t,miti[20][20],memo[20][20],sum;
long long int zi(int x,int y){
if(x==1&&y==1)return 1;
if(memo[x][y]!=0)return memo[x][y];
if(miti[x][y]==-1)return 0;
if(x==1)return zi(x,y-1);
if(y==1)return zi(x-1,y);
int ans= zi(x-1,... | #include<iostream>
#include<cstdio>
#include<map>
using namespace std ;
int main(){
int n;
char a,b;
for(;;){
map<char,char> a2b;
cin>>n;
if(n==0)break;
for(int i=0;i<n;i++){
cin >> a >> b;
a2b[a]=b;
}
cin>>n;
for(int i=0;i<n;i++){
cin>>a;
if(a2b.count(a)==0){
cout<... | 0 | 72,194,865 |
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <numeric>
#include <utility>
#include <iostream>
#include <algorithm>
#include <functi... | #include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <ctype.h>
#include <math.h>
#include <stack>
#include <string>
#include <string.h>
using namespace std;
double PI = 3.1415926535897932;
long mod = 1000000007;
const long INF = 1e9 + 1;
int main() {
int h,w;
char a[200][200];
cin >> h >> w;... | 0 | 95,094,277 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i=0;i < (int)(n);i++)
struct edge{int c,s,f;};
int main(){
int n;
cin >> n;
vector<edge> v(n-1);
rep(i,n-1){
int a,b,c;
ci... | #include<bits/stdc++.h>
#include<cmath>
#define pb push_back
#define ld long double
#define mp make_pair
#define vl vector<ll>
#define vd vector<double>
#define vld vector<long double>
#define ll long long int
#define pl pair<ll, ll>
#define all(a) a.begin(), a.end()
#define forr(i, n) for(ll i=0; i<n; i++)
#define f... | 0 | 98,564,285 |
#pragma GCC target("avx")
#pragma GCC optimize("03")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
int_fast32_t n, h, w, a, b, ans;
int main(){
scanf("%ld %ld %ld", &n, &h, &w);
while(n--){
scanf("%ld %ld", &a, &b);
ans += (a>=h && b>=w);
}
printf("%ld\n", ans);
return 0;
} | #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 = 1000000009LL;
#define all(x) (x).begin(),(x).end()
#define ... | 0 | 55,865,155 |
#include <iostream>
#include <string>
using namespace std;
int main(int argc, char const* argv[])
{
string str;
cin >> str;
while(str != "-"){
int m;
cin >> m;
for(int i = 0; i < m; i++){
int h;
cin >> h;
string sf = str.substr(h);
str = sf + str.substr(0, h);
}
cout << str << endl... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define in(v) (v).begin(),(v).end()
#define rin(v) (v).rbegin(),(v).rend()
#define inf 1e9+7
int solvius()
{
int n;
cin>>n;
vector<int> dp(3);
for(int i=0;i<n;i++)
{
vector<int> a(3),new_dp(3,0);
cin>>a[0]>>a[1]>>a... | 0 | 45,609,201 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;
static const ll MOD ... | #include <bits/stdc++.h>
using namespace std;
const int m=1e5+1;
int a[m];
main(){
int n; cin >> n;
for(int i=0;i<n;i++) cin >> a[i];
long long ans=0ll;
for(int i=n-1;i>=0;i--){
ans+=a[i]/2;
if(a[i]&1)
if(i!=0&&a[i-1]){
++ans;
--a[i-1];
... | 0 | 100,293,731 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll p(ll a,ll b){
ll sum=1,cnt=0;
for(ll i=a;cnt<b;i--){
sum*=i;
cnt++;
}
return sum;
}
ll c(ll a,ll b){
ll r=1;
for(ll i=1;i<=b;i++){
r*=i;
}
return a/r;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
map<ll,ll>mp;
ll n,a;
c... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
int main(){
int n;
string s;
cin >> n >> s;
int res = 0;
for (int i = 0; i < 10; ++i) {
int iid = s.find(to_string(i));
if (iid == string::np... | 0 | 35,116,329 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define sf scanf
#define pf printf
#define pb push_back
#define llu unsigned long long
#define U unsigned int
#define SIZE 100005
#define pie 3.14159265358979323
#define minuss 1e-6
#define pair pair<ll,ll>
#define fast_cin ios_bas... | #include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} fast;
long long mod = 1000000007;
#define REP(i, n) for (long long i = 0; i < (n); i++)
long long modpow(long long m, long long n) {
if... | 0 | 8,612,752 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int X, N;
cin >> X >> N;
if (N==0) {
cout << X << endl;
exit(0);
}
vector<int> p(N);
for (int i=0; i<N; i++) {
cin >> p[i];
}
int ans = 0;
for (int i=0; i<=100; i++) {
... | #include<bits/stdc++.h>
using namespace std;
using i64 = long long;
#define dbg(x) cerr << "[" #x << " : " << x << "]\n"
const int mod = (int)1e9+7;
int main()
{
i64 n, m;
i64 a[200000];
scanf("%lld%lld", &n, &m);
for(int i = 0; i < n; i++) scanf("%lld", &a[i]);
i64 lcm = a[0]/2;
i64 ans = 0;
... | 0 | 85,454,125 |
#include <iostream>
using namespace std;
#define MAX 100001
#define NIL -1
struct Node{
int p,l,r;
};
struct Node T[MAX];
int D[MAX];
void rec(int u,int p){
D[u] = p;
if(T[u].r!=NIL) rec(T[u].r,p);
if(T[u].l!=NIL) rec(T[u].l,p+1);
}
void print(int u){
cout<<"node "<<u<<": parent = "<<T[u].p<<", dept... | #pragma GCC diagnostic ignored "-Wunused-variable"
#include <bits/stdc++.h>
using namespace std;
#define BOOST
#ifdef BOOST
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/range/adaptor/reversed.hpp>
using namespace boost;
using ml = boost::multiprecision::... | 0 | 8,837,178 |
#include <iostream>
#include <vector>
#include <numeric>
using namespace std;
int main() {
int n;
vector<int> v;
while (cin >> n) {
if (v.size() >= n + 1) {
cout << accumulate(v.begin(), v.end() - (v.size() - (n + 1)), 0) << endl;
continue;
}
v.resize(n + 1);
fill(v.begin(), v.end(), 1... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define ff first
#define ss second
#define file_se_input freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
#define pp long long int
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __bui... | 0 | 74,994,948 |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N=2e5+10;
#define fi first
#define se second
#define pb push_back
int n;
int main() {
ios::sync_with_stdio(false);
cin>>n;
cout<<(n-1)/2<<endl;
return 0;
} | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define cinf(n,x) for(int i=0;i<(n);i++)cin>>x[i];
#define ft first
#define sc second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(),(v).end()
#define mod 1000000007
#define FS fix... | 0 | 60,357,530 |
#include<bits/stdc++.h>
#define REP(i,s,n) for(int i=s;i<n;++i)
#define rep(i,n) REP(i,0,n)
#define fst first
#define snd second
#define pb push_back
#define ALL(x) x.begin(),x.end()
#define EPS (1e-9)
#define equals(a,b) (fabs((a)-(b))<EPS)
using namespace std;
bool LT(double a,double b) { return !equals(a,b) && a < b... | #include<bits/stdc++.h>
using namespace std;
using ll = int_fast64_t;
#define rep(i,n) for(int i=0;i<(n);++i)
signed main(){
int N,K,R,S,P;
string T;
cin>>N>>K>>R>>S>>P>>T;
auto solve = [&](string const& s){
int n = size(s);
vector dp(n+1,vector(3,0));
rep(i,n){
if(s[i]=='r')dp[i+1][0] = max(d... | 0 | 82,550,479 |
#include<stdio.h>
#include<math.h>
typedef struct{
double x;
double y;
}koch;
void fractal(int,koch,koch);
int main(){
koch p1,p2;
int n;
p1.x = 0;
p2.x = 100;
p1.y = 0;
p2.y = 0;
scanf("%d",&n);
printf("%f %f\n",p1.x,p1.y);
fractal(n,p1,p2);
printf("%f %f\n",p2.x,p2.y);
return 0;
}
void fract... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template <class T>
inline bool chmin(T &a, T b)
{
if (a > b)
{
a = b;
return true;
}
return false;
}
template <class T>
inline bool chmax(T &a, T b)
{
if (a < b)
{
a = b;
... | 0 | 19,304 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
int t;
cin>>t;
long long int ans = 0, max = t;
for(int i = 1; i < n; i++) {
cin>>t;
if(t < max) {
ans += max-t;
}
else if(t > max) {
max = t;
}
}
cout<... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rrep(i,n) for(int (i)=((n)-1);(i)>=0;(i)--)
#define itn int
#define miele(v) min_element(v.begin(), v.end())
#define maele(v) max_element(v.begin(), v.end())
#define SUM(v) accumulate(v.begin(), v.e... | 0 | 86,480,025 |
#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
const long MOD = 1000000007;
typedef pair<int, int> P;
typedef long long ll;
int main(){
int N;
cin >> N;
int sum[N+1][N+1];
for(int i=0; i<=N; i++){
for(int j=0; j<=N; j++){
sum[i][j] = 0;... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned int INT;
typedef unsigned long long LONG;
typedef long long LL;
typedef pair<int, int> PII;
const int N = 1e5 + 10;
const int mod = 998244353;
#define debug(x) cerr << #x << ": " << (x) << '\n'
#define FW freopen("data2.txt", "w", stdout);
template <class T... | 0 | 18,445,579 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
string T;
for(int i = 0; i < N; i++) {
if(i % 2 == 0) {
T.push_back('0');
}
else {
T.push_back('1');
}
}
int count_T = 0;
for(int i = 0; i < N; i++) {
if(S[i] != T[i]) {
... | #include <bits/stdc++.h>
#define REP(i, n) for(ll i = 0; i <= n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 1e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef unsigned long long ll;
int main(){
ll n, y;
cin >> n >> y;
REP(i... | 0 | 77,740,869 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string S;
cin >> S;
int A=S.size();
for(int i=0;i<A-1;i++){
if(S.at(i)==S.at(i+1)){
cout << i+1 << " " << i+2 << endl;
return 0;
}
}
for(int i=0;i<A-2;i++){
if(S.at(i)==S.at(i+1) || S.at(i+1)==S.at(i+2) || S.at(i+2)==S.at(i)){... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
vector<long long>A(N+1);
vector<long long>B(N);
for(int X=0;X<N+1;X++){
cin>>A[X];
}
for(int X=0;X<N;X++){
cin>>B[X];
}
long long K=0;
for(int X=0;X<N;X++){
if(B[X]<=A[X]){
K+=B[X];
A[X]-=B[X];
}
... | 0 | 69,419,699 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair<ll, ll>;
#define debug(var) cerr << "[" << #var << "] " <<... | #include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <sstream>
#include <cmath>
#include <set>
#include <iomanip>
#include <deque>
#include <stdio.h>
using namespace std;
#define REP(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define RREP(i,n... | 0 | 92,404,170 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <typename T, typename C> void printset(const multiset<T, C> &s) {
for (auto &t : s) {
cout << t << " ";
}
cout << endl;
}
int main() {
ll N, M;
vector<vector<ll>> jobs(100001);
cin >> N >> M;
for (ll i = 0; i < N; i++) {
... | #include<bits/stdc++.h>
#define flash() ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define sc1i(a) scanf("%d",&a)
#define sc2i(a,b) scanf("%d %d",&a,&b)
#define sc3i(a,b,c) scanf("%d %d %d",&a, &b, &c)
#define p1i(a) printf("%d\n",(a))
#define p2i(a,b) printf("%d %d\n",(a), (b))
#d... | 0 | 57,769,887 |
#include<bits/stdc++.h>
#define mo 1000000007
#define pi 3.1415926535898
#define eps 1e-9
using namespace std;
long long read(){
long long xx=0,flagg=1;
char ch=getchar();
while((ch<'0'||ch>'9')&&ch!='-')
ch=getchar();
if(ch=='-'){
flagg=-1;
ch=getchar();
}
while(ch>='0'... | #include <bits/stdc++.h>
#include <math.h>
#include <cmath>
using namespace std;
using ll =long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vs = vector<string>;
using vvs = vector<vs>;
using vc = vector<char>;
using vvc = vector<vc>;
using vb = vector... | 0 | 71,473,351 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
const int Maxn = 100005;
int n, k;
int cnt[Maxn];
int res;
int toPower(int a, int p)
{
int res = 1;
while (p) {
if (p & 1) res = ll(res) * a % mod;
p >>= 1; a = ll(a) * a % mod;
}
return res;
... | #include <bits/stdc++.h>
#define __STDC_FORMAT_MACROS
#define p64 PRId64
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR (i, 0, n)
#define ALL(f, x, ...) \
([&] (decltype ((x)) ALL) { \
... | 0 | 16,401,810 |
#include <bits/stdc++.h>
using namespace std;
bool is_black_out(int x, int y, int xi, int yi, int a) {
switch (a) {
case 1:
return x < xi;
case 2:
return x >= xi;
case 3:
return y < yi;
case 4:
return y >= yi;
default:
return false;
}
}
int main() {
int W, H, N;
... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define rep(i,n) for (int i=0; i<(n); ++i)
#define rep1(i,n) for (int i=1; i<=(n); ++i)
typedef long long ll;
bool debug=false;
string yes = "Yes";
string no = "No";
const ll mod = 998244353;
const double e = 0.000000001;
string assembleId(int k, int seq){... | 0 | 2,127,338 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
const double PI = acos(-1);
int main(){
int n; cin >> n;
map<int, int> odd, even;
for(int i=0; i<n; i++){
int x; cin >> x;
if(i%2==1) even[x] += 1;
else odd[x] += 1;
}
int okey1, oc1=0, oc2=0;
int... | #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(... | 0 | 75,701,339 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <numeric>
#include <string>
#include <cstdio>
#include <cstring>
#include <queue>
#include <stack>
#include <set>
#include <cmath>
#include <bitset>
#include <iomanip>
using ll = long long;
using ull = unsigned long long;
using namespac... | #include<iostream>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
ll tate[100000], yoko[100000];
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < n; i++)cin >> yoko[i];
for (int i = 0; i < m; i++)cin >> tate[i];
ll w = 0, h = 0;
for (int i = 0; i < n; i++) {
w += (i * yoko[i] - (... | 0 | 31,207,423 |
#pragma region header
#define _GLIBCXX_DEBUG
#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 <bits/stdc++.h>
#define REP(i, x) REPI(i, 0, x)
#define REPI(i, a, b) for (int i = int(a); i < int(b); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll R, G, B, N;
cin >> R >> G >> B >> N;
int ans = 0;
REP... | 0 | 38,554,742 |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
#include <vector>
#include <numeric>
#include <map>
#include <cmath>
#include <iomanip>
#include <queue>
using ll =long long;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vs = vector<string>;
int main() {
... | #include <bits/stdc++.h>
#define pragma
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define pf push_front
#define aisort sort(a,a+n)
#define adsort sort(a,a+n,greater<ll>())
#define PI 2 * acos(0)
typedef pair<ll, ll> pii;
typedef pair<ll, pii> piii;
typedef vector<ll> vi;
type... | 0 | 60,473,864 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define eb emplace_back
#define mt make_tuple
#define all(x) (x).begin(), (x).end()
#define MOD 1000000007
typedef long long ll;
typedef pair <int, int> ii;
typedef pair <ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typede... | #include<bits/stdc++.h>
using namespace std;
int main(){
string S, T;
cin >> S >> T;
string A="";
for(int i=0; i<S.size(); i++){
int p=A.size();
int e=0;
for(int j=0; j<p; j++){
if(S.at(i)==A.at(j)){
S.at(i)='a'+j;
e=1;
break;
}
}
if(e==0){
A.push_ba... | 0 | 54,846,634 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(v) v.begin(), v.end()
using ll = long long;
const ll MOD = 1e9+7; ll LLINF = 1LL << 60; int INF = INT_MAX;
int main(){
string a,b,c; cin>>a>>b>>c;
if(a[a.size()-1]==b[0]&&b[b.size()-1]==c[0]) cout... | #include<stdio.h>
int main(void){
while(1){
int n;
scanf("%d",&n);
if(n == 0)
break;
int p[n];
for(int i = 0;i < n;i++){
scanf("%d",&p[i]);
}
int sum = 0,min = 100000,max = -1;
for(int i = 0;i < n;i++){
if(min > p[i]... | 0 | 82,986,592 |
#include <iostream>
#include<array>
using namespace std;
int main() {
int n, k, sum = 0;
cin >> n >> k;
int p[n];
for(int i = 0; i < n; i++) {
cin >> p[i];
}
for(int i = 0; i < n; i++) {
for(int j = 0; j < n-1; j++) {
if (p[j] > p[j+1]) {
swap(p[j], p[... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<int> a(N), b(N);
for (int i=0;i<N;i++) cin >> a[i];
for (int i=0;i<N;i++) cin >> b[i];
ll cnta = 0;
ll cntb = 0;
for (int i=0;i<N;i++)... | 0 | 99,269,967 |
#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(i, 0, n)
#define rep1(i, n) FOR(i, 1, n+1)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define whole(x) (x).begin(),(x).end()
#define rwhole(x) (x).rbegin(), (x).rend()
#... | #include <bits/stdc++.h>
using namespace std;
#define INF INT_MAX/3
#define LLINF LLONG_MAX/3
#define MOD (1000000007LL)
#define MODA(a, b) a=((a)+(b))%MOD
#define MODP(a, b) a=((a)*(b))%MOD
#define inc(i, l, r) for(long long i=(l);i<(r);i++)
#define dec(i, l, r) for(long long i=(r)-1;i>=(l)... | 0 | 11,479,069 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
#define dbg(x) cerr << __LINE__ << " > " << #x << " = " << (x) << endl
void MAIN() {
int n; cin >> n;
vector<int> a(2 * n);
for (auto &i : a) cin >> ... | #include <bits/stdc++.h>
#define rep0(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i <= (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef tuple<string, int, int> TU;
typedef tuple<int, int, int> TI;
int main()
{
ll n;
cin >> n;
int input[n];
... | 0 | 69,609,789 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100 * 1000 + 10;
int n, sz[maxn];
vector <int> adj[maxn];
bool ans;
void dfs(int v, int papa) {
if (ans)
return;
sz[v] = 1;
int o = 0, tmp = 0;
bool f = 1;
for (int u: adj[v])
if (u != papa) {
dfs(u, v);
... | #include <bits/stdc++.h>
using namespace std;
const int MAX = 100005;
const int NIL = -1;
struct Node { int parent, left, right;};
struct Node T[MAX];
int n, D[MAX];
void print(int u) {
cout << "node " << u << ": ";
cout << "parent = " << T[u].parent << ", ";
cout << "depth = " << D[u] << ", ";
if (T[u].parent ... | 0 | 42,444,784 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
int maxN = 5000;
int n,k;
vector<bool>vis(maxN+5);
vector<int>a(maxN+5);
vector<int>b(maxN+5);
vector<int>path;
void dfs(int i,int val)
{
vis[i] = 1;
val+=b[i];
p... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, M, V, P; cin >> N >> M >> V >> P;
vector<ll> A(N); for (int i = 0; i < N; i++) cin >> A[i];
sort(A.begin(), A.end(), greater<ll>());
int ok = 0, ng = N;
while (ng - ok != 1) {
int med = (ng + ok) / 2;
... | 0 | 43,284,590 |
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
int main()
{
long int n,*a;
scanf("%ld", &n);
a = (long int *)malloc(n * sizeof(long int));
for (int i = 0; i < n; i++)
scanf("%ld", &a[i]);
double sum = 0, sum1 = 0;
for (int i = 0; i < n; i++)
sum += a[i];
long int min = fabs(2 * a[0] - sum);
for (int ... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long int n,x;
n=3;
vector<long long int> v;
while(n--){
cin>>x;
v.push_back(x);
}
sort(v.begin(),v.end());
cout<<abs(v[1]-v[0])+abs(v[2]-v[1]);
return 0;
} | 0 | 40,711,107 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int MAX = 305;
const int NIL = -1;
const ll LINF = 1LL << 50;
const int mod = 1e+9 + 7;
int main() {
int N, K;
cin >> N >> K;
vector<int> a(N);
for (int i = 0; i < N; i++) cin >> a[i];
vector<vector... | #include<bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define uint unsigned
#define pii pair<int,int>
#define pll pair<ll,ll>
#define PB push_back
#define fi first
#define se second
#define For(i,j,k) for (int i=(int)(j);i<=(int)(k);i++)
#define Rep(i,j,k) for (int i=(int)(j);i>=(int)(k);i--)
#define CLR... | 0 | 53,115,443 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
for(int i = 0; i <= n; i++){
int price = n - 7 * i;
if(price >= 0 && price % 4 == 0){
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vec... | 0 | 87,413,699 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x... | #include "bits/stdc++.h"
using namespace std;
#define MOD 1000000007
#define INF 1LL<<60
#define fs first
#define sc second
#define pb push_back
#define int long long
#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(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#d... | 0 | 19,213,177 |
#include <iostream>
using namespace std;
int main() {
int n;
int out;
while(cin >> n){
out=0;
for(int i = 0; i <= 9 && i <= n; i ++) {
for(int j = 0; j<=9 && j <= n; j++) {
for(int k = 0; k<=9 && j <= n; k++) {
if(i+j+k <= n && i+j+k >= n-9) {
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long int ull;
#define endl "\n"
#define pb push_back
#define sq(a) (a)*(a)
#define all(x) (x).begin(), (x).end()
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugv(v) cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;
#... | 0 | 11,562,652 |
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
class DICE{
private:
int D[6];
public:
DICE();
void set(int*);
int show();
void roll(char);
void change(int);
};
DICE::DICE(){
for(int i = 0; i < 6; ++i){
D[i] = i+1;
}
}
void DICE::set(int *number){
for(int i = 0; i < 6; ++i){
D... | #include <iostream>
#include <string>
#include <cstring>
#include <stack>
#include <queue>
#include <cctype>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <stdlib.h>
#include <tuple>
#include <iomanip>
#include <iterator>
#include <stdio.h>
#include <fstream>
#include <t... | 0 | 36,493,413 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <math.h>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
using namespace std;
usi... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define brep(i,n) for(int i=n-1;i>=0;i--)
#define rep1(i,n) for(int i=1;i<n;i++)
#define brep1(i,n) for(int i=n-1;i>=1;i--)
vector<int> a;
bool check(int x){
map<int,int>mp;
rep1(i,a.size()){
if(a[i-1]<a[i])continue;
... | 0 | 55,581,149 |
#include <cstdio>
#include <cctype>
using namespace std;
int main(void){
char ch;
while(1){
scanf("%c",&ch);
if(!isalpha(ch)){
printf("%c",ch);
if(ch=='\n')break;
continue;
}
if(isupper(ch))printf("%c",tolower(ch));
else printf("%c",tou... | #include<bits/stdc++.h>
#define INF 2000000000
#define MOD 1000000007
#define EPS (1e-10)
using namespace std;
int main(int argc, char *argv[]) {
int N; cin >> N;
string s,t; cin >> s >> t;
string ans = "";
for (int i = 0; i < N; i++) {
ans += s[i];
ans += t[i];
}
cout << ans << endl;
return 0;
} | 0 | 83,555,066 |
#include <iostream>
using namespace std;
int a, b;
bool shouldDrawWhite(int x, int y) {
if (y < 50) {
if (a == 0) {
return false;
}
if (y % 2 == 0 && x % 2 == 0) {
a--;
return true;
}
return false;
}
if (b == 0) {
return true;
}
if (y % 2 == 1 && x % 2 == 0) {
b--... | #include<bits/stdc++.h>
#define ALL(c) (c).begin(),(c).end()
#define EACH(i,c) for(auto i=(c).begin();i!=(c).end();++i)
using namespace std;
#define int long long
bool finished(const vector<int> &v) {
int N = v.size();
for(int i = 0; i < N; ++i) {
if(v[i] >= N) {
return false;
}
}
return true;
}
signed main(... | 0 | 47,551,433 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <numeric>
int main() {
int N=0;
int K=0;
int X=0;
int Y=0;
std::cin >>N>>K>>X>>Y;
int total=0;
if (N>=K)
{
total=K*X+(N-K)*Y;
}else
{
total=N*X;
}
std::cout << total << std::endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define endl "\n"
typedef long long ll;
const double pi=3.14159265358979323846;
int ctoi(const char c) {
if ('0' <= c && c <= '9') return (c - '0');
return -1;
}
vector<int> input(int n) {
vector<int> vec(n);
... | 0 | 49,816,679 |
#include <iostream>
#include <map>
#include <string>
#include <algorithm>
#include <vector>
#define ll long long
int main()
{
ll a, b, c, d;
std::cin >> a >> b >> c >> d;
ll max_num = -1000000000000000000;
max_num = (max_num > (a*c)) ? max_num : (a*c);
max_num = (max_num > (a*d)) ? max_num : (a*d);
... | #include <bits/stdc++.h>
#include <math.h>
#include <cmath>
using namespace std;
using ll =long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vs = vector<string>;
using vvs = vector<vs>;
using vc = vector<char>;
using vvc = vector<vc>;
using vb = vector... | 0 | 23,779,956 |
#include <stdio.h>
#include <math.h>
int n,k = 10000;
int a[2000001], b[2000001], c[10000];
int main(void)
{
int i, j;
scanf("%d", &n);
for(i = 0 ; i < n ; i++) {
scanf("%d", &a[i + 1]);
}
for(i = 0 ; i <= k ; i++) {
c[i] = 0;
}
for(i = 0 ; i < n ; i++) {
c[a[i + 1]]+... | #include <iostream>
#include <algorithm>
using namespace std;
int main(){
int H, W;
for(int i=0 ; ; i++){
cin >> H >> W;
if(H==0 && W==0){
break;
}else{
for(int ii=1 ;ii<=H; ii++){
for(int iii=1 ;iii<=W; iii++){
if(ii==H || ii==1 || iii==W || iii==1){
cout << "#";
}else{
cout << ... | 0 | 46,027,471 |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int X, t;
int main() {
ios::sync_with_stdio(false);
cin... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
vector<... | 0 | 11,299,069 |
#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(){
int N;
cin>>N;
vector<int> city(N+1),brave(N);
rep(i,N+1)cin>>city[i];
rep(i,N)cin>>brave[i];
int ans=0;
rep(i,N){
if(city[i]>=brave[i]){
ans+=brave[i];
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define fi first
#define se second
#define dbg(x) cout<<#x" = "<<((x))<<endl
template<class T,class U> ostream& operator<<(ostream& o, const pa... | 0 | 7,709,996 |
#include<bits/stdc++.h>
using namespace std;
int main() {
string s; long long k;
cin >> s >> k;
string c = s;
if(count(s.begin(), s.end(), s[0]) == s.size()) cout << s.size() * k / 2 << endl;
else {
long long res = 0;
for (int i = 1; i < c.size(); i++)
{
if(c[i] =... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main()
{
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int n,m,v,p;
cin>>n>>m>>v>>p;
int a[n];
for(int i=0;i<n;++i)
{
cin>>a[i];
}
sort(a,a+n);
int low=(-1);
int up=n;
while((up-low... | 0 | 64,525,343 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
ll MEMO[2001][2001][4];
int main() {
ll H, W;
cin >> H... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define ll long long
#define pii pair < int, int >
#define fr first
#define sc second
#define mk make_pair
#define sz(s) (int)s.size()
#define all(s) s.begin(), s.end()
#define ok puts("ok");
#define whatis(x) cerr << #x << " = "... | 0 | 18,176,609 |
#include <iostream>
#include <cmath>
using namespace std;
int main(void) {
double x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
cout << fixed << sqrt(pow(x1-x2, 2) + pow(y1-y2, 2)) << endl;
return 0;
} | #include <bits/stdc++.h>
#include <vector>
#include <string>
using namespace std;
vector<string> split(const string &s, char delim) {
vector<string> elems;
string item;
for (char ch: s) {
if (ch == delim) {
if (!item.empty()) {
elems.push_back(item);
}
item.clear();
}
else {
... | 0 | 96,005,590 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define ll long long
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define sz(a) ll((a).size())
#define all(a) (a).begin(), (a).end()
#define REP(i,n) for(int i=0;i<(n);++i)
#define REPD(i,n) for(int i=(n)-1;i>=0;--i)
#... | #include <iostream>
#include <cstdio>
#include <stack>
#include <queue>
#define MAX 2048
using namespace std;
int main(void) {
int n, num = 0, count = 0;
char nums[MAX];
scanf("%d", &n);
while(n--) {
scanf("%s", nums);
for(int i = 0; nums[i] != '\0'; i++) {
if(nums[i] == '0') {
if(num >= 2 && num <= 6) {... | 0 | 98,966,610 |
#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>
#ifdef MBP
#include "stdc++.h"
#else
#include <bits/stdc++.h>
#endif
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define REP(i, n) for (long long int i = 0, i##_len = (n); i < i##_len; ++i)
#define REP1(i, n) for (long long int i = 1, i##_len = (n); i <= i##_len; ++... | 0 | 69,277,332 |
#include<stdio.h>
#pragma GCC optimize("O2")
#define swap(a,b) (a+=b,b=a-b,a-=b)
static inline char CH()
{
static char buf[100000],*ptr1=buf,*ptr2=buf;
return ptr1==ptr2&&(ptr2=(ptr1=buf)+fread(buf,1,100000,stdin),ptr1==ptr2)?EOF:*ptr1++;
}
static inline int IN(void)
{
int x=0,f=0,c=CH();while(c<48||c>57){f^=c==4... | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
#define NIL -1
struct Matrix {
Matrix(int r, int c)
: r(r), c(c){
}
int r;
int c;
};
int costs[101][101];
void init_costs() {
for(int i=0; i<101; i++) {
for(int j=0; j<101; j++) {
costs[i][j] = NIL;
}
}
}
int cost... | 0 | 30,081,637 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
typedef long long ll;
typedef pair<int, int> pii;
const int inf=1010001000;
const ll INF=1001000100010001000;
const int mod=(int)1e9+7;
int main(){
int n,k;
cin>>n>>k;
vector<int>... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,M;
cin >> N >> M;
vector<int>a(N);
vector<int>b(N);
for (int i = 0; i < N; i++) {
cin >> a.at(i) >> b.at(i);
}
vector<int>c(M);
vector<int>d(M);
for (int i = 0; i < M; i++) {
cin >> c.at(i) >> d.at(i);
}
vector<int>A(M);
fo... | 0 | 49,189,105 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define int long long
signed main() {
cin.tie(0);
ios::sync_with_stdio(0);
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n + 1, 0);
for (int i = 0; i < n + 1; i++) cin >> a[i];
vector<int> csa(n... | #include <iostream>
#include <cstdio>
#include <vector>
#include <set>
using namespace std;
int main(){
long long s;
cin >> s;
vector<long long> a(1000001);
a[0] = s;
for(long long i = 1; i <= 1000000; i++){
if(a[i-1] % 2 == 0) a[i] = a[i-1]/2;
else a[i] = 3*a[i-1]+1;
}
set<l... | 0 | 23,939,995 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
int N;
cin >> N;
vector<int> t(N+1, 0), x(N+1, 0), y(N+1, 0);
t[0] = 0;
x[0] = 0;
y[0] = 0;
for (int i = 1; i < N+1; i++)
{
cin >> t[i] >> x[i] >> y[i];
}
bool reachable = false;
fo... | #include <iostream>
#include <iomanip>
#include <cmath>
#include <string>
#include <vector>
#include <cstdlib>
#include <map>
#include <queue>
#include <deque>
#include <algorithm>
#include <stack>
#include <functional>
#include <sstream>
#define rep(i,j,n) for(i=j;i<(n);i++)
#define rrep(i,j,n) for(i=j;i>(n);i--)
type... | 0 | 98,791,576 |
#include <bits/stdc++.h>
using namespace std;
#define sws ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define INFINITO 1000000000
#define ll long long
#define vi vector<int>
#define pb push_back
#define pii pair<int, int>
#define mp make_pair
#define ff first
#define ss second
#define all(x) x.begin(), x.end(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vint;
typedef vector<double> vd;
typedef vector<ll> vll;
typedef vector<string> vstr;
typedef vector<vector<int>> vvint;
typedef vector<pair<int, int>> vp... | 0 | 81,101,054 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const long long INF = 1LL << 60;
using Graph = vector<vector<int>>;
const int dx[4] = { 1, 0, -1, 0 };
const int dy[4] = { 0, 1, 0, -1 };
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inlin... | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define maxn 1000005
#define fr(i,j,k) for(int i=j;i<k;i++)
#define f(n) fr(i,0,n)
#define f1(n) fr(i,1,n+1)
#define ms(i) memset(i,0,sizeof(i));
#define ms1(i) memset(i,-1,sizeof(i));
#define F first
#define S second
#define all(x) ... | 0 | 8,327,324 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
int n,b;
vector<int>a;
while (1){
int max_v = -1000000;
a.clear();
cin >> n;
if (n == 0)break;
a.push_back(0);
for (int i = 0; i < n; i++){
cin >> b;
a.push_back(b);
}
for (int i = 1; i <= n; i++){
a[i]... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 998244353;
int main(){
ll n,d,a,sum = 0;
cin >> n >> d >> a;
vector<pair<ll,ll>>x(n);
vector<ll>pm(n+1),ac(n),it(n+1);
for(int i =0; i<n; i++){
cin >> x[i].first >> x[i].second;
it[i] = x[i].first;
}
it[n] = 1000000... | 0 | 13,682,410 |
#pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define PI 3.141592
#define MOD7 1000000007
#define LL_INF 9000000000000000000
#define LL_MINF -9000000000000000000
#define INT_INF 2000000000
#define INT_MINF -2000000000
#define all(a) (a)... | #include <bits/stdc++.h>
using namespace std;
int main () {
int N;
cin >> N;
vector<int> H(N);
for (int i = 0; i < N; i++) {
cin >> H.at(i);
}
int ans = 0;
int memo = 0;
for (int i = 0; i < N - 1; i++) {
if (H.at(i) >= H.at(i + 1)) {
memo++;
}
else {
ans = max(ans, memo);
... | 0 | 80,270,568 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int main() {
int n, c, k;
cin >> n >> c >> k;
vector<int> t(n);
rep(i, n) cin >> t[i];
sort(t.begin(), t.end());
int now = t[0], cnt = 1;
int ans = 1;
for (int i = 1; i... | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long
#define endl "\n"
#define all(v) v.begin(),v.end()
#define double long double
#define trace1(x) cerr<<#x<<": "<<x<<endl
#define trace2(x, y) cerr<<#x... | 0 | 56,268,712 |
#include<bits/stdc++.h>
#define rep(i, n) for(int (i) = 0; (i) < (n); (i)++)
#define printd(x) printf("%.12f\n", ans);
#define print(x) cout << (x) << endl;
#define Yes() cout << "Yes" << endl;
#define No() cout << "No" << endl;
#define YES() cout << "YES" << endl;
#define NO() cout << "NO" << endl;
#define printa(x, n... | #include<bits/stdc++.h>
using namespace std;
int main()
{
string s;
int n,k=0;
cin>>n>>s;
for(int i=0; s[i]; i++){
if(i>=n){
printf("...");
break;
}
else{
cout<<s[i];
}
}
} | 0 | 69,821,979 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
template<class T> inline bool chmax(T &a, T b) {if (a < b) {a = b;return 1;}return 0;}
template<class T> inline bool chmin(T &a, T b) {if (a > b) {a = b;return 1;}return 0;}
int main(){
int n,m;
cin >>... | #include<stdio.h>
int main(){
int H[10000], W[10000];
int length;
int i=0, j, k;
do{
scanf("%d %d", &H[i], &W[i]);
i += 1;
}while(H[i-1]!=0 || W[i-1]!=0);
length = i;
for(i=0; i<length-1; i++){
for(j=0; j<H[i]; j++){
for(k=0; k<W[i]; k++){
... | 0 | 100,235,736 |
#include<cstdio>
#include<queue>
#include<utility>
#include<cstring>
#include<stack>
#include<algorithm>
#include<cmath>
#include<iostream>
#define MAX_N 100001
#define INF 2147483647
#define REP(i,n) for(int i=0;i<(int)(n);i++)
void init(int n);
int find(int n);
void unite(int x,int y);
bool same(int x, int y);
int dx... | #include<bits/stdc++.h>
#include<cmath>
#define M 1000000007
#define ll long long
#define pb push_back
#define mp make_pair
#define all(v) v.begin(),v.end()
#define fi first
#define se second
#define loop(n) for(ll i=0;i<n;i++)
#define loop1(n) for(ll i=1;i<=n;i++)
#define looprev(n) for(ll i=n-1;i>=0;i--)
#define fast... | 0 | 59,864,095 |
#define rep(i, n) for (int i = 0; i < (n); i++)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
int main() {
int n;
cin >> n;
vector<int> p(n), q(n);
rep(i, n) cin >> p.at(i);
rep(i, n) cin >> q.at(i);
vector<int> a(n);
... | #include <bits/stdc++.h>
#include<cmath>
#define N 100005
#define A 1000005
#define MOD 998244353
#define INF 1000000000000000000
#define ll long long
using namespace std;
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n; ... | 0 | 84,431,792 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb push_back
#define all(v) (v).begin(), (v).end... | #include <bits/stdc++.h>
typedef long long LL;
using namespace std;
int main() {
while (true) {
int t; cin >> t;
if (t == 0) break;
int x = 1000 - t;
int cnt = 0;
while (x > 0) {
if (x / 500 > 0) {
cnt += x / 500;
x %= 500;
} else if (x / 100 > 0) {
cnt += x / 1... | 0 | 25,350,814 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP0(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define RREP0(i, n) for (int i = (n)-1; i >= 0; --i)
#define REP1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define RREP1(i, n) for (int i ... | #include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <numeric>
#include <iomanip>
#define SPBR(w, n) std::cout... | 0 | 99,724,384 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
typedef pair<int, int> pii;
const int MAXN = 1e5 + 5;
const int MOD = 1e9 + 7;
int mul(int a, int b) {
return (long long) a * b % MOD;
}
int sub(int a, int b) {
a -= b;
if (a < 0) a += MOD;
return a;
}
int add(int a, int b) {
a += b;
... | #include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(vec) (vec).begin(), (vec).end()
#define SUM(...) accumulate(ALL(__VA_ARGS__),0LL)
#define DSUM(...) accumulate(ALL(__VA_ARGS__),0.0)
using namespace std... | 0 | 87,877,233 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long q, h, s, d, n;
cin >> q >> h >> s >> d >> n;
if(2*q < h) h = 2*q;
if(2*h < s) s = 2*h;
if(2*s < d) d = 2*s;
long long ans = 0;
ans += n/2 * d + n%2 * s;
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef pair<int,int> pii;
typedef priority_queue< int, vector< int >, greater< int > > minHeap;
#define ones(x) __builtin_popcount(x)
#define onesl(x) __builtin_popcountl(x)
#define onesll(x) __builtin_popcoun... | 0 | 80,771,693 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld double
#define ff first
#define ss second
int main(){
int n,k,x,y;
scanf("%d%d%d%d",&n,&k,&x,&y);
if(n<=k){
printf("%d\n",n*x);
}
else printf("%d\n",k*x+(n-k)*y);
return 0;
} | #include <bits/stdc++.h>
#define int long long
typedef long long ll;
using namespace std;
const ll MAXN = 200000;
const ll INF = 5001001001001001001;
ll N, K, ans=INF, tmp=0;
vector<ll> Xs, Ys;
vector<pair<ll,ll>> XY;
signed main(){
cin >> N >> K;
for(int i=0;i<N;i++) {
ll x, y;
cin >> x >> y;
... | 0 | 64,889,418 |
#include <bits/stdc++.h>
using namespace std;
using int64 = long long;
using PAIR = pair<int, int>;
constexpr int INF = 1 << 30;
constexpr int64 LINF = 1LL << 60;
constexpr int MOD = 1e9 + 7;
constexpr int MAX_N = 1e5 + 1;
#define int int64
#define INIT ios::sync_with_stdio(false);cin.tie(0);
#define VAR(type, ...) typ... | #include <bits/stdc++.h>
#define DEBUG(x) cout << #x << " = " << x << endl
#define pb push_back
#define ff first
#define ss second
using namespace std;
typedef long long ll;
const int MAXN = 100005;
ll a[MAXN];
ll b[MAXN];
int main()
{
ll n, k;
cin >> n >> k;
for (int i = 0; i < n; i++)
{
cin >>... | 0 | 95,680,133 |
#include <bits/stdc++.h>
#define jehian using
#define mau namespace
#define libur std
#define cepet {ios_base::sync_with_stdio(0);cin.tie(0);}
jehian mau libur;
typedef long l;
typedef long double ld;
typedef long long ll;
typedef unsigned long ul;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define P pair<ll, ll>
#define Graph vector<vector<ll>>
#define fi first
#define se second
constexpr ll mod = 1000000007;
constexpr ll INF = (1ll << 60);
constexpr double pi = 3.14159265358979323846;
template... | 0 | 81,368,999 |
#include <iostream>
#include <cassert>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <cctype>
#include <cmath>
#include <ctime>
#include <queue>
#include <set>
#include <map>
#include <stack>
#include <string>
#include <bitset>
#include <vector>
#include <complex>
#include <algorithm>
using namespace... | #include <bits/stdc++.h>
using namespace std;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void... | 0 | 57,752,784 |
#include <bits/stdc++.h>
using namespace std;
#define ar array
#define pb push_back
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
typedef vector<int> vi;
typedef long long ll;
typedef pair<int,int> pii;
typedef double db;
const ll mod = 1000000007;
ll gcd(ll a,... | #include<bits/stdc++.h>
#define ll long long int
using namespace std;
int main()
{
string s;
cin>>s;
ll sum=0,i,m;
for(i=0; i<s.size(); i++){
m = s[i]-48;
sum += m;
}
if(sum % 9 ==0)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
return 0;
} | 0 | 66,530,305 |
#include<bits/stdc++.h>
using namespace std;
int cnt[1000];
int main()
{
int n,i,j,k,a;
cin >> n;
int amax = 0;
for(i=0;i<n;i++)
{
cin >> a;
cnt[a]++;
amax = max(amax,a);
}
int mid ;
if(amax%2==0)
{
mid=amax/2;
if(cnt[mid]!=1)
{
... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5+5;
int n;
int m;
int ar[N];
int pos[N];
int parent[N];
int getP(int u){
if(parent[u] == u)
return u;
return parent[u] = getP(parent[u]);
}
void join(int u , int v){
u = getP(u);
v = getP(v);
parent[v] = u;
}
int main(){
scan... | 0 | 9,692,764 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<ll(n);i++)
vector<vector<ll>> t;
vector<ll> v, s;
vector<bool> ok;
void dfs(ll p, ll c ){
s[p] = c + v[p];
ok[p] = 1;
for (auto q : t[p]) {
if (!ok[q]) dfs(q, c + v[p]);
}
}
int main() {
ll n, q... | #include<iostream>
#include<vector>
using namespace std;
int main(int argc, char *argv[])
{
for(;;) {
int n, m, p;
cin >> n >> m >> p;
if(n == 0) break;
m--;
int s = 0;
int mx = 0;
for(int i = 0; i < n; i++) {
int x;
cin >> x;
s += x;
if(i == m) {
mx = x;
... | 0 | 12,413,454 |
#include<bits/stdc++.h>
#define rep(i,N) for(ll (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;
const int mod = 1000000007;
int main() {
int h1, m1, h2, m2, k;
cin >> h1 >> m1 >> h2 >> m2 >> k;
int len1 = h1 * 60 ... | #include <stdio.h>
#include <iostream>
using namespace std;
#define NUM 100000
#define INF 1000000010
int L[NUM + 1];
int length = 0;
void init(){
for(int i = 0; i <= NUM; i++){
L[i] = INF;
}
}
int main(void){
init();
int n;
scanf("%d", &n);
for(int i = 0; i < n; i++){
int a;
... | 0 | 55,943,965 |
#include <stdio.h>
#include <string>
#include <cstring>
#include <stdlib.h>
#include <math.h>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <list>
#include <iterator>
#include <assert.h>
#pragma warning(disable:4996)
typedef long long ll;
#define MIN(a, b) ((a)>(b)? (b)... | #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;
string s;
cin >> s;
int a = 0;
int b = 0;
int mina = 0;
int maxb = 0;
rep(i, n){
if(s.at(i) == '('){
... | 0 | 42,979,991 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <st... | #include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define endl '\n'
#define pii pair<ll int,ll int>
#define all(v) (v).begin(), (v).end()
using namespace std;
std::vector<ll> v;
void solve()
{
ll n;
cin >> n;
v.resize(n);
for(auto &i : v) cin >> i;
... | 0 | 36,000,495 |
#include <bits/stdc++.h>
using namespace std;
#define pb insert
#define eb emplace_back
#define ff first
#define ss second
typedef long long int ll;
typedef long double ld;
#define all(a) a.begin(), a.end()
#define show(x) cerr << #x << " is " << x << "\n"
#define show2(x, y) cerr << #x << " " << #y << " " << x << " " ... | #include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main(){
int n;
cin >> n;
... | 0 | 4,096,068 |
#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<stack>
#include<algorithm>
#include<cmath>
#include<climits>
#include<string>
#include<set>
#include<numeric>
#include<map>
#include<iostream>
using namespace std;
#define rep(i,n) for(int i = 0;i<((int)(n));i++)
#define reg(i,a,b) for(int i =... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> P;
typedef pair<ld,P> P2;
P2 mk_P(ld a,ll b,ll c){
return P2(a,P(b,c));
}
int main(){
ll n;
cin>>n;
vector<P2> vec;
for(int i=0;i<n;i++){
ll x,y;
ld angle;
cin>>x>>y;
if(y>0){
a... | 0 | 16,397,938 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector< vector<int> > VVI;
typedef pair<int,int> P;
#define rep(i,n) for(int i=0;i<(n);... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#define rep(i, begin, n) for (int i = begin; i < n; i++)
#define repe(i, begin, n) for (int i = begin; i <= n; i++)
#define repr(i, begin, n) for (int i = begin; i > begin - n; i--)
#define repre(i,... | 0 | 24,488,034 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
template <typename TYPE>
void print_vec(const vector<TYPE>& v){
for(int i=0; i<v.size(); i++){
cout << v[i] << " ";
}
cout << endl;
}
template <typename TYPE>
void print_vec2(const vector<vector<TYPE>>& v){
cout << endl; cout << " ";
for... | #include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
int main() {
int n, x;
while (cin >> n >> x, n) {
int cnt = 0;
for (int i = 1; i <= n; i++)
for (int j = i + 1; j <= n; j++)
for (int k = j + 1; k <= n; k++) {
if (i + j + k == x)cnt++;
}
cout << cnt << endl;
}
} | 0 | 3,133,710 |
#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;
using P=pair<int,int>;
using lP=pair<ll,ll>;
using fP=pair<double,double>;
int ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | 0 | 82,403,575 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
typedef vector < vector<ll> > Mat;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;... | #include<bits/stdc++.h>
using namespace std;
long long n,a[200010],sum[200010],x[200010],l,r,ans;
int main(){
long long i,j;
cin>>n;
sum[0]=0;
x[0]=0;
for(i=1;i<=n;i++)cin>>a[i];
for(i=1;i<=n;i++)sum[i]=sum[i-1]+a[i];
x[1]=a[1];
for(i=2;i<=n;i++)x[i]=x[i-1]^a[i];
l=1;
for(r=1;r<=n;r++){
while(sum[r]-sum[l-1... | 0 | 13,510,035 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> lpair;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
#define rREP(i,m,n) for(ll i = (m); i >= (n); i--)
#define print(x) cout << (x) << endl;
... | #include <iostream>
#include <algorithm>
#include <string>
std::string shufle(std::string str, int n) {
std::string temp;
temp = str.substr(0, n);
str = str.substr(n, str.size() - n) + temp;
return str;
}
int main() {
while (true) {
std::string str;
std::cin >> str;
if(str=="... | 0 | 39,323,759 |
#include <iostream>
#include <string>
#include <algorithm>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cc... | #include <bits/stdc++.h>
#define ss second
#define ff first
#define all(x) x.begin(), x.end()
using namespace std;
using ll = long long;
using pii = pair<ll, ll>;
const int oo = 1e9 + 7;
const ll mod = 1e9 + 7, maxn = 500050;
const double PI = acos(-1);
vector<int> p(maxn, 0);
void init(int n){
for (int i=0; i<=n; ... | 0 | 83,474,308 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
const int N = 1e5 + 100;
ll n, d[N], cnt[N], dp[N];
vector<int> nei[N];
vector<pll> vec, ans;
bool no_homo;
unordered_map<ll, int> v_d;
void dfs(int v, int par = -1) {
for (int u: nei[v])
if(u != par) {
dfs(u, v);
dp[... | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9+7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,n) for(ll i=0;i<(n);++i)
#define REPR(i,n) for(ll i=n;i>=0;i--)
#define FOREACH(x,a) for(auto& (x) : (a) )
typed... | 0 | 69,260,864 |
#include <iostream>
#include <functional>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <queue>
#include <map>
#include <iomanip>
#include <complex>
#include <random>
#include <bitset>
#include <list>
using namespace std;
#define repi(i,n) for(int i=... | #include <iostream>
using namespace std;
void displayA(int A[], int N) {
for (int i = 0; i < N - 1; i++)
cout << A[i] << " ";
cout << A[N - 1] << endl;
}
int selectionSort(int A[], int N) {
int num_of_exchange = 0;
for (int i = 0; i < N; i++) {
int minj = i;
for (int j = i; j < N; j++) {
if (A[j] < A[minj]... | 0 | 20,249,512 |
#include<stdio.h>
#include<string.h>
typedef struct{
int num[6];
}saikoro;
int num_1,num_2;
saikoro s_1;
void set_s_num(int *a){
int i;
for(i=0;i<6;i++){
s_1.num[i]=a[i];
}
}
void n(saikoro *a){
int tmp;
tmp=a->num[4];
a->num[4]=a->num[0];
a->num[0]=a->num[1];
a->num[1]=a->num[5];
a->num[5]=tmp;
}
void s(sa... | #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include... | 0 | 5,901,466 |
#include<stdio.h>
int main(){
int len;
scanf("%d",&len);
char str[len+5];
scanf("%s",&str);
if(len % 2 != 0){
printf("No\n");
}
else{
int left = 0, right = 0;
for(int i = 0;i<len;i++){
if(i<len/2) left+=str[i];
else if (i>=len/2) right+=str[i];
}
if(right == left) printf("Yes\n");
else printf("... | #include <bits/stdc++.h>
#define rep(i,n) for(long long int (i)=0;(i)<(int)(n);(i)++)
#define rrep(i,a,b) for(long long int i=(a);i<(b);i++)
#define rrrep(i,a,b) for(long long int i=(a);i>=(b);i--)
#define all(v) (v).begin(), (v).end()
#define pb(q) push_back(q)
#define Abs(a,b) max(a,b)-min(a,b)
#define YES(condition)... | 0 | 38,935,861 |
#include<iostream>
#include <algorithm>
#include <vector>
#include <cstdlib>
#include <sstream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
int n, i = 0, j = 1;
cin >> n;
string s;
cin >> s;
rep... | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <set>
#define ll long long
#define rep(i, a, b) for (int i = int(a); i <= int(b); i++)
#define sz(a) int((a).size())
#define shit while(t--)
#define fr for(int i... | 0 | 88,622,258 |
#include <bits/stdc++.h>
#define INF 1e9
using namespace std;
#define REPR(i,n) for(int i=(n); i >= 0; --i)
#define FOR(i, m, n) for(int i = (m); i < (n); ++i)
#define REP(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define ALL(a) (a).begin(),(a).end()
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b... | #include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define IOS ios :: sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define AfterDecimal(n) cout << fixed << setprecision(n);
#define ll long long int
#define ld long double
#define all(a) a.begin(), a.end()
#define pii ... | 0 | 66,963,543 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef long long LL;
static LL INF = (1LL<<62);
const int MAX = 100002;
int PARENT[MAX] = {0};
int RANK[MAX] = {0};
void init(int L){
if(L<1) return;
for(int i=0; i<L; i++){
PARENT[i]=i;
RANK[i]=0;
}
}
int root(int x){
if(x<0) return -1;
if(P... | #include <iostream>
using namespace std;
class Solve{
private:
int n_ = 0;
int s_ = 0;
int result = 0;
void dfs(int num, int sum, int cnt);
public:
Solve(int num, int sum);
int getSolve();
};
Solve::Solve(int num, int sum){
n_ = num;
s_ = sum;
Solve::dfs(0,0,0);
}
void Solve:... | 0 | 5,412,144 |
#include <iostream>
#include <numeric>
#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>
#inclu... | #include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
map<long long, long long> mp;
mp[0] = 0;
for (int i = 0; i < n; i++) {
long long x;
cin >> x;
mp[x]++;
}
auto i = mp.end();
vector<long long> ans(3);
int cnt = 0;
while(i != mp.b... | 0 | 12,430,605 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define f first
#define s second
#define db(x) cerr << #x << ": " << (x) << '\n';
#define pb push_back
#define lb lower_bound
#define up upper_bound
#define all(x) x.begin() , x.end()
#define rall(x) x.rbegin() , x.rend()
#define enl '\n'
typedef pair<i... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> vec(0), rvec(0);
for(int i=0; i<n; ++i){
int x;
cin >> x;
if(i%2==0) vec.push_back(x);
else rvec.push_back(x);
}
if(n%2==1){
for(int i=vec.size()-1; i>=0; --i){
cout << vec[i] << " ";
}
f... | 0 | 9,482,467 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.