code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 1 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int A,B,C,D;
cin >> A >> B >> C >> D;
int ans = 0;
for (int i = A; i <= B; i++) {
if (C <= i && i <= D) {
ans++;
}
}
if (ans != 0) {
cout << ans-1 << endl;
return 0;
}
cout << ans << e... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(var) cerr << (#var) << " = " << (var) << endl;
#else
#define debug(var)
#endif
void init() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
}
const int N = 2e3+23;
char s[N][N];
int a[N][N], b[N][N];
void solve() {
int h, w; scanf("%... | 0 | 13,951,839 |
#include <bits/stdc++.h>
using namespace std;
#define rp(i, k, n) for (int i = k; i < n; i++)
using ll = long long;
using ld = double;
template<class T>inline bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>inline bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return ... | #include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
vector<int64_t>A(N);
for(int i=0;i<N;i++)
cin>>A.at(i);
vector<int64_t>B(N);
for(int i=0;i<N;i++)
cin>>B.at(i);
vector<int64_t>C(N);
for(int i=0;i<N;i++){
C.at(i)=A.at(i)-B.at(i);
}vector<int64_t>P={};
vector<int64_t>M={... | 0 | 88,424,806 |
#include "bits/stdc++.h"
using namespace std;
int main() {
vector<int> AB(6);
vector<int> cnt(4);
for (int i = 0; i < 6; i++) {
cin >> AB[i];
cnt[AB[i] - 1]++;
}
int res1 = 0, res2 = 0;
for (int i = 0; i < 4; i++) {
if (cnt[i] == 1) res1++;
else if (cnt[i] == 2) r... | #include <bits/stdc++.h>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define size_of_array(array) (sizeof(array)/sizeof(array[0]))
using ll =long long;
using namespace std;
using Graph=vector<vector<int>>;
using Field=vector<vector<int>>;
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;r... | 0 | 805,434 |
#include<bits/stdc++.h>
#define ll long long int
#define endl '\n'
#define M 1000000007
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define f first
#define s second
#define b begin
#define e end
#define pb push_back
#define mp make_pair
#define FOR(i,a,b) for(i=a;i<b;i++)
#define RFOR(i,a,b) for(i=a;i>=b;i--)
#de... | #include<iostream>
using namespace std;
int main(){
string s,p;
int s_num = 0;
int p_num = 0;
bool discover =false;
getline(cin,s);
getline(cin,p);
string s_search = s+s;
for(int i = 0; i < s_search.length();i++){
if(s_search[i]==p[0]){
... | 0 | 30,877,799 |
#include<bits/stdc++.h>
using namespace std;
#define ft ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long
#define pi pair<int,int>
#define pb push_back
#define F first
#define S second
const int N=1e5+3;
int c[N];
int main()
{
ft
int t,i,j,n,m,l=0,r=0,s=0;
cin>>n;
f... | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define codefor int test;scanf("%d",&test);while(test--)
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define yn(ans) if(ans)pr... | 0 | 51,675,339 |
#include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define MUL(A,B,C) (max(A*C, B*C))
int main(){
ll a[4];
for(int i=0; i<4; i++) scanf("%lld", &a[i]);
printf("%lld\n", max(MUL(a[0],a[1],a[2]), MUL(a[0],a[1],a[3])));
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) for(int i=0;i<(n);++i)
#define SORT(c) sort((c).begin(),(c).end())
#define CLR(a) memset((&a), 0 ,sizeof(a))
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " <... | 0 | 83,384,569 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll ;
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
const ll inf=1e9+7;
string a,b,c;
ll mod(ll a)
{
if(a<inf)return a;
else
return a%inf;
}
void test_cases()
{
char a,b;
cin>>a>>b;
if(a=='H')cout<<b;
else
{
if(b=='H')cout<<"D";... | #include <bits/stdc++.h>
using namespace std;
struct edge {
int to;
int weight;
edge(int t, int w) : to(t), weight(w) { }
};
using Graph = vector<vector<int>>;
using dou =long double;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define brep(n) for(int bit=0;bit<(1<<n);bit++)
... | 0 | 6,849,955 |
#include <bits/stdc++.h>
typedef long long ll;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REP2(i, a, b) for(int i = a;i <= b;i++)
#define REPR(i, a, b) for(int i = a; i >= b; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define PI 3.14159265358979323846
#define v... | #include <bits/stdc++.h>
using namespace std;
const int MAX_N = 110, dx[2] = {0, 1}, dy[2] = {1, 0};
typedef pair<int, int> pii;
int n, m, idx[MAX_N][MAX_N], head[MAX_N * MAX_N], current, dist[MAX_N * MAX_N], start_pos;
char str[MAX_N][MAX_N];
bool vis[MAX_N * MAX_N];
struct edge
{
int to, nxt, weight;
} edges[MAX_... | 0 | 66,752,085 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<string> a(n), b(m);
for (int i = 0; i < n; i++) cin >> a[i];
for (int j = 0; j < m; j++) cin >> b[j];
bool ans = false;
for (int i = 0; i + m <= n; i++) {
for (int j = 0; j + m <= n; j++) {
bool res = true;
for (in... | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<math.h>
using namespace std;
#define N (1000000000+7)
#define INF 1e16
typedef long long ll;
typedef pair<ll,ll> P;
string s,t;
map<char,int>mp;
map<int,char>mpinv;
set<char>ve... | 0 | 7,765,605 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int N, K;
cin >> N >> K;
int mx = N - K + 1;
int mn = (K > 1) ? 1 : (N - K + 1);
cout << mx - mn << endl;
return 0;
} | #include<bits/stdc++.h>
#define int long long
#define endl '\n'
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define bug1( x ) {cerr << (#x) <<"="<< x << endl;}
#define bug2( x , y ) {cerr << (#x) <<"="<< (x) << " " << (#y) << "="<< (y) << endl;}
#define bug3( x , y , z ) {cerr << (#x) <<"="<<(x) <<... | 0 | 44,864,861 |
#include <stdio.h>
int main()
{
int N, R;
scanf("%d%d",&N,&R);
if(R>4111)
{
printf("second value must between 0-4111");
}
else if(N>=10)
{
printf("%d", R);
}
else
{
printf("%d", R+100*(10-N));
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
int x,y;
cin>>x>>y;
int a,b,flag=0;
b=x-a;
for(int a=0;a<=x;a++)
{
if ((2 * a) + (4 * (x-a)) == y)
flag=1;
}
if(flag==1)
{
cout<<"Yes"<<"\n";
}
else
{
cout<<"No"<<"\n";
}... | 0 | 98,836,446 |
#include<bits/stdc++.h>
using namespace std;
using ll = unsigned long long;
int main(){
ll l, r; cin >> l >> r;
ll ans = 2019;
bool flg = false;
for(ll i=l; i<=r; i++){
for(ll j=i+1; j<=r; j++){
ll tmp = (i*j) % 2019;
ans = min(ans, tmp);
if(tmp==0){
... | #include <iostream>
#include <list>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <algorithm>
#include <cmath>
#include <string>
using namespace std;
typedef long long lli;
typedef vector<lli> vll;
typedef vector<bool> vbl;
typedef vector<vector<lli> > mat... | 0 | 36,502,850 |
#include <bits/stdc++.h>
#define rep(i,x,n) for(int i=x; i<(int)(n); i++)
#define rep_eq(i,x,n) for(int i=x; i<=(int)(n); i++)
using namespace std;
using ll=int64_t;
int main() {
int A,B,C; cin >>A >>B >>C;
string ans="NO";
rep_eq(i,1,B) {
if((A*i)%B==C) {
ans="YES";
break;
}
}
cout <<ans ... | #define ONLINE_JUDGE
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll,ll> pl;
typedef vector<pl> vp;
const ll INF=1001001001;
const ll LINF=1001001001001001001;
const ll D4[]={0,1,0,-1,0};
const ll D8[]={0,1,1,0,-1,-1,1,-1,0};
#define _ov... | 0 | 35,962,219 |
#include <bits/stdc++.h>
#include <math.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
template<class T> void chmax(T &a,T b) { if (a<b) a=b;}
template<class T> void chmin(T &a,T b) { if (a>b) a=b;}
int main(){
int n,z,w; cin >> n >> z >> w;
vector<int> a(n);
rep(i,... | #include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <cmath>
#include <map>
#include <climits>
#include <algorithm>
#include <utility>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
using VI = vector<long long int>;
namespace BasicMath {
static In... | 0 | 26,786,140 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <tuple>
#include <iomanip>
#include <queue>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pa;
const ll MOD = 1e9 + 7;
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll... | 0 | 55,751,254 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
float a, b;
cin >> a >> b;
cout << round((a + b) / 2) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T, class U> using Pa = pair<T, U>;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll W,H;
cin >> W >> H;
struct edge{
... | 0 | 84,516,791 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a;
string s, t;
set<string> x;
bool shiritori = true;
for(int i=0; i<n; i++) {
cin >> s;
if(i != 0 && s[0] != t[t.size()-1]) shiritori = false;
t = s;
a = x.size();
x.insert(s);
i... | #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 | 6,123,391 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rrep(i,m,n) for(ll i=(m);i<(n);i++)
#define fore(i,a) for(auto &i:a)
#define debug(a,b) cout << "debug : " << a << " , "<< b << endl
using ll=long long;
const ll INF=1LL<<60;
const ll mod=1E9+7;
int main(){
ll n,k;
cin >> n ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
using P = pair<ll,ll>;
const ll mod = 1e9+7;
#define ALL(x) (x).begin(),(x).end()
#define REP(i,n) for(ll (i)=0;(i)<(n);(i)++)
#define REPS(i,n) for(ll (i)=1;(i)<=(n);(i)++)
#define RREP(i,n) for(ll (i)=(n-1);(i)>=0;(i)--)
#defi... | 0 | 96,056,463 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main(){
int n; cin >> n;
string s; cin >> s;
string c;
int ans = 0;
rep(i, 10) rep(j, 10) rep(k, 10){
c[0] = i + '0';
c[1] = j + '0';
c[2] = k + '0';
... | #include<bits/stdc++.h>
using namespace std;
typedef vector<int>V;
void func(int node,int par,int rang);
bool flg[100000]={0};
int n,u,k,c;
V v[100000];
struct Node{
int parent,depth;
};
Node T[100000];
int main(void){
int i,j;
cin>>n;
for(i=0;i<n;i++){
cin>>u>>k;
T[i].parent=0;
T[i].depth=0;
for(j=0;j<k;j+... | 0 | 66,203,742 |
#include <bits/stdc++.h>
using namespace std;
const int N=5e5+5,mod=1e9+7;
#define ll long long
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
int n;
cin>>n;
ll INF=1e18;
ll mn=INF;
ll sum=0;
for(int i=0;i<n;i++)
{
ll x,y;
cin>>x>>y;
sum+=x... | #include <bits/stdc++.h>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double>... | 0 | 16,822,477 |
#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];
int sum = 0;
rep(i, N) sum += A[i];
if (sum >= H)
cout << "Yes"... | #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... | 0 | 16,903,943 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0) , cin.tie(0) , cout.tie(0);
int a , p;
cin >> a >> p;
p += a * 3;
cout << p / 2;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
long long H,W,c=0; cin>>H>>W;
long long counter=0;
long long a[H]={0};
long long aco=0;
long long bco=0;
cin>>a[0];
long long cco=a[0];
counter=a[0];
long long counter1=counter;
long long counter2;
long long answer=0;
long long ddo=0;
for(long long i=1;i<H;i++){... | 0 | 57,870,691 |
#include <bits/stdc++.h>
#define rep(i, n) for(long long int i = 0; i < n; i++)
#define _rep(i, m, n) for(long long int i = m; i < n; i++)
#define print(n) std::cout << n << std::endl
#define _print(n) std::cout << n
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int N = 1000000;
const ll mo... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
vector<string> t = {"maerd", "remaerd", "esare", "resare"};
string ans = "YES";
reverse(s.begin(), s.end());
int i;
while(s.size() > 0) {
int tmp = s.size();
for(i = 0; i < 4; i++) {
if... | 0 | 51,649,048 |
#include <iostream>
using namespace std;
int main(void){
int N, i;
cin >> N >> i;
int ans = (N - i) + 1;
cout << ans << endl;
} | #include<bits/stdc++.h>
#define r(i,n) for(int i=0;i<n;i++)
#define mk make_pair
using namespace std;
int dx[]={0,0,1,-1},dy[]={1,-1,0,0};
int main(){
int h,w,n,sum=0,x1,y1;
cin>>h>>w>>n;
string s[h];
for(int i=0;i<h;i++)cin>>s[i];
r(i,h)r(j,w)if(s[i][j]=='S')y1=i,x1=j;
for(int o=1;o<=n;o++){
int used[h... | 0 | 8,406,956 |
#include<iostream>
#include<algorithm>
#include<stack>
#include<queue>
#include<string>
#include<set>
#include<functional>
using namespace std;
#define INF 1<<21
#define MOD 1000000007
int main() {
int n;
string s1, s2;
int x, y;
int mul;
cin >> n;
for (int i = 0; i < n; i++) {
x = 0; y = 0;
cin >> s1 >> ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,M;
cin >> N >> M;
if (M == 1){
cout << 1 << ' ' << 2 << endl;
return 0;
}
if (N % 2 == 1){
for (int i = 0; i < M; i++) {
cout << i+1 << ' ' << M*2 - i << endl;
}
}
else {
for (int i = 0; i < (M+1)/2; i++) {
co... | 0 | 19,658,041 |
#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
... | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp ... | 0 | 69,941,960 |
#include <bits/stdc++.h>
#define pi 3.14159
using namespace std;
typedef long long LL;
const LL MOD = 1e9 + 7;
const int N = 1e5 + 7, M = 1e7, OO = 0x3f3f3f3f;
#define AC ios::sync_with_stdio(0);cin.tie(0);cout.tie(0); cin.sync_with_stdio(0);
int main()
{
int n,i;
string s;
set<int>s1;
cin>>s;
n=s.size();
for(i=0;i<n;+... | #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... | 0 | 47,623,411 |
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define vec vector<int>
#define map map<int,int>
#define scn(t) scanf("%d",&t);
#define lscn(t) scanf("%lld",&t);
#define mod 1000000007
#define rep(i,a,b) for(int i=a;i<b;i++)
#define endl "\n... | #include <iostream>
#include <cmath>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define ASC(c) sort((c).begin(), (c).end())
#define DESC(c) sort((c).begin(), (c).end(), greater<int>())
#define DUMP(x) ... | 0 | 27,211,235 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long N, K;
cin >> N >> K;
long long res = 1LL<<60;
for (int i = 0; i <= N; ++i) {
long long val = (1LL<<i) + K * (N-i);
res = min(res, val);
}
cout << res << endl;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define MOD 1000000007
#define REP(i, N) for (int i = 0; i < N; ++i)
#define REP1(i, N) for (int i = 1; i <= N; ++i)
#define RREP(i, N) for (int i = N - 1; i >= 0; --i)
#define ALL(a) a.begin(),... | 0 | 34,478,048 |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define rep(i,n) for(int i = 0; i < ((int)(n)); i++)
int main() {
char B;
cin >> B;
switch (B) {
case 'A':
cout << 'T';
break;
case 'C':
cout << 'G';
break;
case 'G':
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
typedef long long ll;
int main() {
string s, t;
cin >> s >> t;
int n = s.size();
if(n == 1){
cout << "Yes" << endl;
return 0;
}
vector<int> alpha_s(26, -1);
vector<int> alpha_t(2... | 0 | 18,901,729 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main(){
ll n;
cin >> n;
map<ll,ll> mp;
rep(i,n){
ll a;
cin >> a;
mp[a]++;
}
ll ans=0;
for(auto p: mp){
if(p.first<p.second){
ans+=p.second-p.first;
}else if... | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin>>s;
if(s.size() == 2){
if(s[0] == s[1])puts("1 2");
else puts("-1 -1");
}
else {
for(int l = 0; l + 2 < s.size(); ++l){
int r = l + 2;
if(s[l] == s[l + 1] || s[l] == s[l + 2] || s[l + 1] == s[l + 2]){... | 0 | 48,372,940 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin>>n>>k;
int a[n];
for (int i=0; i<n; i++) cin>>a[i];
vector<long long> v;
for (int i=0; i<n; i++) {
long long sum = 0;
for (int j=i; j<n; j++) {
sum += a[j];
v.push_back(sum);
}
}
for (int i=62; i>=0; i--) {
... | #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 >> ... | 0 | 4,963,368 |
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <cstdio>
#include <cstdint>
#define READINTA(X) while((ct=readchar())>='0')(X)=(X)*10+ct-'0';
#define READINTB(X) while((ct=*ci++)>='0')(X)=(X)*10+ct-'0';
using namespace std;
uint16_t d, k;
uint32_t M =... | #include<iostream>
#include<algorithm>
#include<vector>
#include<cstring>
using namespace std;
const int N_MAX = 200005;
int counter[N_MAX];
int plusc[N_MAX];
vector<int> root[N_MAX];
void dfs(int n, int p, int num){
int nownum = num + plusc[n];
counter[n] = nownum;
for(auto u: root[n]){
if (u == p)... | 0 | 7,438,361 |
#include <iostream>
#include <algorithm>
#include <vector>
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if(a < b){ a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if(a > b){ a = b; return... | #include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
using namespace std;
int main(){
long long hy,wx,i,j;
queue<long long>quex,quey;
scanf("%lld%lld ",&hy,&wx);
char a[1005][1005];
for(i=1;i<=hy;i++){
for(j=1;j<=wx+1;j++){
scanf("%c",&a[j][i]);
if(a[j][i]=='#'){
quex.... | 0 | 11,555,462 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m;
scanf("%d%d",&n,&m);
int mid;
if(m&1) mid=(m*2+1)/2;
else mid=(m*2+1)/2+1;
int cnt=1;
for(int i=1;cnt<=m;cnt++,i++){
if(cnt<=mid/2) printf("%d %d\n",i,mid-i+1);
if(cnt==mid/2+1) i=mid+1;
if(cnt>mid/2 ) printf("%d %d\n",i,mid+1+m*2+1-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() {
cin.tie(0)->sync_with_stdio(false);
int n; cin >> n;
vector<ll> a(n); REP(i, n) cin >> a[i];
vector<ll> b(n); REP(i, n) cin >> b[i];
vector<ll> diff(n);
int cnt = 0;
... | 0 | 90,972,802 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); i++)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
using P = pair<int, int>;
const int INF = 1e9;
const long long LINF = 1e18;
const long long MOD = 1e9 + 7;
signed main(){
ll n;
cin >> n;
ll sum = 0;
ll ... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n,t=0,f=0;cin>>n;
int a[n];
for(int i=0;i<n;i++)
cin>>a[i];
for(int i=0;i<n;i++)
{
t++;
if(a[f]==2)
break;
else
f=a[f]-1;
}
if(t<n)cout<<t;
else cout<<-1;
return ... | 0 | 97,235,501 |
#include <bits/stdc++.h>
using namespace std;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ll long long
#define ld long double
#define all(a) (a).begin(),(a).end()
#define mk make_pair
ll MOD=1000000007;
ll mod=998244353;
int inf=1000001000;
ll INF=1e18+5;
int main() {
int n;
cin >... | #include<stdio.h>
int main(){
int n,m;
int sum1=0;
int sum2=0;
scanf("%d %d",&n,&m);
if(n>1){
for(int i=1;i<n;i++){
sum1+=i;
}
}
if(m>1){
for(int i=1;i<m;i++){
sum2+=i;
}
}
printf("%d", sum1+sum2);
return 0;
} | 0 | 18,552,984 |
#include "bits/stdc++.h"
#include "math.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<vvll> vvvll;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<int> vin;
typedef vector<pair<ll,ll> > vp;
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
#defin... | #include <iostream>
#include <sstream>
#include <stack>
#include <iomanip>
#include <string>
#include <algorithm>
#include <functional>
#include <cstdlib>
#include <map>
#include <set>
#include <vector>
#include <utility>
#include <queue>
#include <cmath>
#define BEGIN(x) x.begin()
#define END(x) x.end()
#define ALL(x)... | 0 | 86,402,292 |
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define rep(i, n) ;for (int i = 0;i < (int)(n);i++)
#define rep2(i, s, n) ;for (int i = s; i < (int)(n);i++)
#define ALL(vec) (vec).begin(),(vec).end()
#define pi 3.1415926535897932384626433832795
#define MAX_INF 9223372036854775807
#define MIN_IN... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=1;i<=n;i++)
using ll=long long;
int main()
{
ll n,m,ac=0,wa=0;
cin>>n>>m;
vector<ll> a(n+1),w(n+1);
rep(i,m)
{
ll x;
string s;
cin>>x>>s;
if(s=="AC")
{
if(a[x]==0)
... | 0 | 45,071,221 |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int main(){
IOS;
int n;
cin >> n;
vector<int> vec;
for(int i=0; i<n; i++){
int a;
cin >> a;
vec.push_back(a);
}
sort(vec.begin(),vec.end());
int ans = vec[n... | #include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <deque>
#include <queue>
#include <array>
#include <set>
#include <map>
#include <cmath>
#include <algorithm>
#include <numeric>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cstdint>
#include <ca... | 0 | 90,442,593 |
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
vector<vector<int>> f(const vector<vector<int>>& dist) {
int n = dist.size() - 1;
... | #include <cstdlib>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <stack>
using namespace std;
int col[10][10];
int main(void)
{
int H,W,K;
scanf("%d%d%d",&H,&W,&K);
char s[10];
for (int i=1;i<=H;i++)
{
scanf("%s",s);
for (int j=0;j<W;j++)
i... | 0 | 32,799,104 |
#include <bits/stdc++.h>
using namespace std;
int main(){
vector<int> vec(3);
for(int i=0;i<3;i++){
cin >> vec.at(i);
}
stable_sort(vec.begin(),vec.end());
cout << vec.at(2)-vec.at(0) << endl;
} | #pragma region header
#include <bits/stdc++.h>
#define int long long
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)
#define mp make_pair
#define mt make_tuple
#define rep1(i, n) for (decltype(+n) i = 0; i < (n); i++)
#define rrep1(i, n) for (auto i = n - 1; i > static_cast<decltype(i)>(-1); i--)
#de... | 0 | 62,587,620 |
#include <bits/stdc++.h>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <cctype>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <functional>
using namespace std;
#de... | #include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
#ifdef DEBUG
#define DEBUG_PRINT(fm, ...) do{std::printf("%s:%d(%s)", __FILE__, __LINE__, __func__);std::cout << "DEBUG PRINT ";std::printf(fm, __VA_ARGS__);}while(0)
#define DEBUG_VAL(a, b) do{std::printf("%s:%d(%s)", __FILE__, __LINE__, __func__);... | 0 | 67,127,693 |
#include <iostream>
using namespace std;
int main()
{
int n;
while(cin >> n && n > 0)
{
int s[100];
int max=-1, min=1001;
int sum=0, ave=0;
for(int i=0;i<n;i++)
{
cin >> s[i];
sum += s[i];
if(s[i] > max)
max = s[i];
if(s[i] < min)
min = s[i];
}
sum -= (max +... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double DB;
typedef unsigned int UI;
typedef pair<int, int> PII;
const int inf = 0x7f7f7f7f;
#define rdi() read<int>()
#define rdl() read<LL>()
#define rds(a) scanf("%s", a)
#define mk(i, j) make_pair(i, j)
#define pb push_back
#define fi first
... | 0 | 91,571,955 |
#include<iostream>
int intager[101]={0};
int main(){
int a;
int max=0;
while(std::cin>>a){
intager[a]+=1;
if(intager[a]>max)max=intager[a];
}
for(int i=1;i<101;++i){
if(intager[i]==max)std::cout<<i<<std::endl;
}
return 0;
} | #include<bits/stdc++.h>
typedef long long ll;
#define pb push_back
#define mod 1000000007ll
const ll maxn = 9e18;
using namespace std;
const ll maxsize = 100000009;
ll arr[maxsize];
vector<ll> v(maxsize);
map<ll, ll> m;
ll gcd(ll a, ll b) {
if(a == 0) return b;
return gcd(b % a, a);
}
ll lcm(ll a, ll b) {
return ... | 0 | 49,890,184 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n) for (long long i = ((long... | #include <iostream>
#include <vector>
#include <cmath>
#include <string>
#include <algorithm>
#include <iomanip>
#include <map>
#include <bitset>
#include <cstdio>
#include <set>
#include <stack>
#include <queue>
#include <cassert>
#include <numeric>
using namespace std;
typedef long long ll;
#define FOR(i,a,b) for (ll... | 0 | 95,731 |
#include <bits/stdc++.h>
using namespace std;
int powe(int k){
int ans=1;
for(int i=1; i<=k; i++)
ans*=2;
return ans;
}
int main(int argc, const char * argv[]) {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int m, k; cin>>m>>k;
if(k>=powe(m))
cout<<"-1\n";
else ... | #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... | 0 | 63,325,040 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define mod 1000000007
#define INF 1000000000000
#define F first
#define S second
#define P pair<int,int>
#define all(vec) vec.begin(),vec.end()
int gcd(int a,int b){
if(a%b==0)return b;
return gcd(b,a%b);... | #include <bits/stdc++.h>
#define REP(i, e) for(int (i) = 0; (i) < (e); ++(i))
#define FOR(i, b, e) for(int (i) = (b); (i) < (e); ++(i))
#define ALL(c) (c).begin(), (c).end()
#define PRINT(x) cout << (x) << "\n"
using namespace std;
using ll = long long; using pint = pair<int, int>; using pll = pair<ll, ll>;
const long ... | 0 | 65,573,869 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;
#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()
#define ... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <numeric>
#include <cstdint>
#include <iomanip>
#include <set>
#include <map>
#include <unordered_map>
#include <cassert>
#define rep(i,n) for(int i=0; i<(n); i++)
using ll = long long;
#define fast_io(); std::ios_bas... | 0 | 26,612,161 |
#include <bits/stdc++.h>
using namespace std;
#define dhoom ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
typedef long long ll;
typedef long double ld;
const ll inf = 1e18;
const int nax = 2e6 + 7;
const ll mod = 1e9 + 7;
ll gcd(ll a , ll b){
if(b == 0) return a;
return gcd(b , a % b);
}
ll lcm(ll... | #include<bits/stdc++.h>
#define fuckit(){ \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
}
using namespace std;
int main()
{
fuckit();
int h,w,i,j;
cin>>h>>w;
char c[h+1][w+1],C[h*2+1][w];
for(i=1;i<=h;i++){
for(j=1;j<=w;j++){
cin>>c[i][j];
}
}
for(i=1;i<=2*h;i++){
for(j=1;j<=w;j++){
C[i][... | 0 | 29,955,745 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;
#define MP make_pair
#define PB push_back
#define X first
#define Y second
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define RFOR(i, b, a) for(int i = (b) - 1; i >= (a); --i)
#define ALL(a) ... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main()
{
int a,b,k;cin>>a>>b>>k;
int i = 0;
while(true){
a /= 2;
b += a;
i++;
if(i == k) break;
b /= 2;
a += b;
i++;
if(i == k) break;
}
cout << a << " " << b << en... | 0 | 88,473,300 |
#include <bits/stdc++.h>
#define rep(i, n) for (lli i = 0; i < (n); i++)
#define rrep(i, n) for (lli i = (n)-1; i >= 0; i--)
#define vall(x) (x).begin(), (x).end()
using namespace std;
using lli = long long int;
void YESNO(bool), YesNo(bool);
template <class T1, class T2>
bool chmin(T1 &l, const T2 &r);
template <class... | #include <iostream>
using namespace std;
int main(void){
int W;
int H;
int x;
int y;
int r;
cin>>W>>H>>x>>y>>r;
if(W<x+r||H<y+r){
cout<<"No"<<endl;
}
else if(0>x-r||0>y-r){
cout<<"No"<<endl;
}
else if(0<=x-r&&0<=y-r){
cout<<"Yes"<<endl;
}
... | 0 | 9,284,118 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string N;
cin >> N;
if (N.at(0) == N.at(1) && (N.at(1) == N.at(2) && N.at(2) == N.at(3)) ){
cout << "Yes" <<endl;
}
else if (N.at(0) == N.at(1) && N.at(1) == N.at(2) ){
cout << "Yes" <<endl;
}
else if (N.at(1) == N.at(2) && N.at(2) == N.at... | #include <bits/stdc++.h>
using namespace std;
char C[36][3];
char Cb[36][3];
char Cs[36][3];
int Ib[36];
int Is[36];
int N;
bool is_stable(char c[][3], int ind[]){
char num='1';
for (int i=1; i<N; i++) {
if (c[i][1] == num) {
if (ind[i-1] > ind[i]) {
return false;
... | 0 | 11,777,177 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll,ll>
#define FOR(I,A,B) for(ll I = (A); I < (B); ++I)
#define FORR(I,A,B) for(ll I = (B-1); I >= (A); --I)
#define SORT(x) (sort(x.begin(),x.end()))
const ll INF=1e18+7;
const ll MOD=1e9+7;
int main(){
ios::sync_with_stdio(false);
ci... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void) {
ll K;
cin >> K;
if (K < 10) {
cout << K << endl;
return 0;
}
vector<vector<string>> lunluns(12);
for (ll i = 1; i < 10; i++) {
lunluns[1].push_back(to_string(i));
}
ll cnt = 9;
... | 0 | 53,655,853 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i<(int)(n); i++)
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
vector<int> p(n);
vector<int> c(n);
rep(i,n) {
int px;
cin >> px;
p[i] = px-1;
}
rep(i,n) cin >> c[i];
ll ans... | #include <bits/stdc++.h>
using namespace std;
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pair<int, int>; using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
#defin... | 0 | 60,294,928 |
#include <algorithm>
#include <bits/stdc++.h>
#include<iostream>
#include<string>
using namespace std;
#define rep(i, n) for (int i = 0; i <(int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
const ll MOD=100000007;
const ll INF=1000000101001;
int main(){
int n;cin >> n;
string s,t;cin>>s>>t;... | #include <iostream>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>
#include <cstdlib>
#include <cstdio>
#include <functional>
#include <numeric>
#include <cmath>
#include <climits>
#include <limits>
#include <cfloat>
#incl... | 0 | 47,238,795 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = n; i >= 0; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 30;
bool isgusu(string s) {
int n = s.size();
string x = s.substr(0, n/2);
string y = s.substr(n/2, n/2);
... | #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;
int main(){
int N;... | 0 | 65,019,131 |
#include <cstdlib>
#include <iostream>
using namespace std;
int main(int argc, char *argv[])
{
string s;
char c;
int a,li,ls;
string accion;
getline(cin,s);
cin>>a;
while(a--)
{
cin>>accion;
if(accion=="replace")
{
cin>>li>>ls;
for(int i=li;i<=ls;i++)
cin>>s[i];
}else if(accion=="re... | #include <cstdio>
#include <iostream>
#include <string>
using namespace std;
string keitai(string s){
string t="";
char k1[6]=".,!? ";
for(int i=0; i<s.size(); ++i){
if(s[i]=='0') continue;
else if(s[i]=='1'){
int c1=0;
do{
++i;
++c1;
}while(s[i]=='1');
if(s[i]=='0') t += k1[(c1-1)%5];
... | 0 | 21,444,331 |
#include <iostream>
#include <string>
using namespace std;
int w, h, x, y, r;
bool a;
string answer;
int main(){
cin >> w >> h >> x >> y >> r;
if (y + r > h || y - r < 0 || x - r < 0 || x + r > w){
a = false;
}
else{
a = true;
}
if (a == false){
answer = "No";
}
else{
answer = "Yes";
}
cout << answer ... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for(int i = int(a); i < int(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
templat... | 0 | 30,280,426 |
#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... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
pair<int, int> r[n], b[n];
for (int i=0; i<n; i++) cin>>r[i].first>>r[i].second;
for (int i=0; i<n; i++) cin>>b[i].first>>b[i].second;
sort(r, r + n);
sort(b, b + n);
bool used[n];
for (int i=0; i<n; i++) used[i] = false;
int ... | 0 | 53,960,264 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<deque>
#include<cmath>
#include<map>
#include<cstring>
#include<iomanip>
using namespace std;
typedef long long ll;
const int INF = 1e9 + 6;
const ll MOD = 1e9 + 7;
const ll LLINF = 1LL<<60;
#define P pair<int, int>
#define rep(i, n) for ... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<ll(n);i++)
#define YESNO(T) if(T){cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}
#define yesno(T) if(T){cout<<"yes"<<endl;}else{cout<<"no"<<endl;}
#define YesNo(T) if(T){cout<<"Yes"<<endl;}else{cout<<"No... | 0 | 43,298,749 |
#include <stdio.h>
int main(void)
{
int a,b;
scanf ("%d %d",&a,&b);
if (a>=-1000 && a<=1000 && b>=-1000 && b<=1000){
if (a>b){
printf ("a > b\n");
} else if(a < b){
printf ("a < b\n");
} else {
printf ("a == b\n");
}
}
return 0;
} | #include <iostream>
#include <queue>
#include <vector>
#include <algorithm>
#include <map>
#include <string>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#ifndef _USEFUL_MACROS_
#define _USEFUL_MACROS_
#define INF (99999999/3)
#define N_PRIME 1000000007
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR... | 0 | 51,809,856 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0; i < (n); ++i)
#define REPR(i,n) for(int i=(n); i >= 0; --i)
#define FOR(i, m, n) for(int i = (m); i < (n); ++i)
using ll = long long;
#define INF 1e9
int n, m, d;
int main(){
cin >> n >> m >> d;
if(n<1){
cout << 0 << endl;
}
ll c = ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#pragma comment(linker, "/stack:200000000")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=na... | 0 | 91,282,005 |
#include <stdio.h>
int main() {
int n;
scanf("%d", &n);
printf("%d\n", n / 3);
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
int main() {
ll n; cin >> n;
vector<int> a(n);
bool ok = false;
for (int i = 0; i < n; ++i) {
cin >> a[i];
if (a[i] == 2) ok = true;
a[i]--;
}
if (!ok) {
cout << "-1" <... | 0 | 21,174,561 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A,B,K;
cin >> A >> B >> K;
for(int i=1;i<=K;i++){
if(i%2==1){
A/=2;
B+=A;
}
else{
B/=2;
A+=B;
}
}
cout << A << " " << B << endl;
} | #include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string... | 0 | 21,004,050 |
#define MOD 1000000007;
#define input ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long
#include <bits/stdc++.h>
using namespace std;
const int N = 2e1 + 5;
int main() {
ll n,k;
cin>>n>>k;
vector<pair<int,int>> vec;
for(int i=0;i<n;i++)
{
int a,b;
cin>>a>>b;... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <cmath>
#include <cstdio>
using namespace std;
#define REPS(i, a, n) for (int i = (a); i < (n); ++i)
#define REP(i, n) REPS(i, 0, n)
#define RREP(i, n) REPS(i, 1, n + 1)
#define DEPS(i, a, n) for (int i =... | 0 | 27,151,810 |
#include <bits/stdc++.h>
#pragma GCC optimize "trapv"
using namespace std;
typedef long long int lld;
typedef unsigned long long int llu;
#define TESTCASES() cin >> (T3X0); T353 = T3X0; while(T3X0--)
#define _input(V3C) for(auto &V3C_I7 : (V3C)) cin >> (V3C_I7)
#define mems(A77AY, V4LU) memset((A77AY), (... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<bool> vb;
typedef vector<char> vc;
#define INF __INT32_MAX__
#define LINF __LONG_LONG_MAX__
int main() {
int H, W; cin >> H >>... | 0 | 69,544,279 |
#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<ll,ll>;
const ll MOD = 1000000007;
const ll INF = 10000000000;
#define all(v) v.begin(), v.end()
int main(){
ll N,ans=0,P=1;
cin >> N;
vector<ll> A(N);
rep(i,N) cin >> A.at(i);... | #include<iostream>
#include<cstdio>
#include<string>
#include<queue>
#include<algorithm>
using namespace std;
queue<int> Q;
int N;
bool PATH[101][101] = {false};
int len[101];
void BFS(int id){
Q.pop();
for (int i = 1; i <= N; i++) {
if (PATH[id][i]) {
if (len[i] > len[id] + 1) {
... | 0 | 71,128,251 |
#include<iostream>
#include<algorithm>
#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
using namespace std;
class Dice
{
public:
int lab[6];
};
int main() {
Dice dice;
int q, i, j, a, b, ai, bi;
rep(i,6) cin >> dice.lab[i];
cin >> q;
rep(i,q) {
cin >> a >> b;
rep(j,6) {
if (dice.lab[j] == a... | #include<bits/stdc++.h>
using namespace std;
typedef long long L;
#define max_(x, y) (((x) > (y)) ? (x) : (y))
#define min_(x, y) (((x) < (y)) ? (x) : (y))
#define ___ ios_base::sync_with_stdio(false);cin.tie(NULL);
#define Mx 2000001
#define inf 1e17
const L MOD = 1e9+7;
const double pi = 2 * acos (0.0);
L a,b,a1,a2,... | 0 | 91,320,605 |
#include <bits/stdc++.h>
using namespace std;
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
int N, S, cnt;
void dfs( int i, int sum, int total )
{
if( total == N && sum == S )
{
cnt++;
return;
}
if( i == 10 || total == N ) return;
dfs( i + 1, sum + i, total + 1 );
... | #include<bits/stdc++.h>
using namespace std;
#define AC ios::sync_with_stdio(0),cin.tie(0);
#define ll long long int
int main(){
AC
ll a,b,c;
cin>>a>>b>>c;
if(a>b*c)cout<<"No"<<endl;
else cout<<"Yes"<<endl;
} | 0 | 62,521,666 |
#include<iostream>
#include<math.h>
using namespace std;
int main(){
double a,b,c,d=0,e=0;
string s;
string ab = "56789";
string ac = "321";
cin>>s;
if(s[5]=='1'){cout<<"TBD"; return 0;}
if(s[5]=='0'){
for(int i=0;i<5;i++){
if(s[6]==ab[i]){cout<<"TBD"; return 0;}
... | #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)
#define fi first
#define se second
using namespace std;
using lint = long long;
using uint = unsigned int;
using ulint = unsigned long long;
using ldouble = long double;
using pii = pair<int, int>;
usi... | 0 | 85,226,712 |
#include <bits/stdc++.h>
#define int long long
using namespace std;
int n,ans=0;
int a[200005],visited[200005];
signed main()
{
cin>>n;
for (int i=1;i<=n;i++) cin>>a[i];
for (int i=1;i<=n;i++) visited[a[i]]++;
for (int i=1;i<=200000;i++) ans=max(ans,visited[i]+visited[i-1]+visited[i+1]);
cout<<ans<<endl;
retur... | #include <bits/stdc++.h>
using namespace std;
const int N=2e5+100;
const int mod=1e9+7;
typedef long long ll;
typedef pair<int,int> pa;
map<ll,int>mp;
int main()
{
ios::sync_with_stdio(0);cin.tie(0);
int n,m;cin>>n>>m;
mp[0]=1;
ll sum=0,ans=0;
for(int i=1;i<=n;i++){
ll x;cin>>x;
sum=... | 0 | 30,796,062 |
#include <bits/stdc++.h>
#define WHOLE(v) (v).begin(), (v).end()
#define REV_WHOLE(v) (v).rbegin(), (v).rend()
using i64 = int64_t;
using namespace std;
template<size_t I,class H,class...T>struct TupleReaderWriter{static tuple<H,T...> r(istream&i){H v;i>>v;return tuple_cat(tuple<H>(v),TupleReaderWriter<sizeof...(T)-1,T... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main()
{
int N; cin >> N;
vector<int> a(N + 9); rep(i, N) cin >> a[i];
int ans = 0;
int prev = a[0];
for (int i = 1; i < N; ++i){
if (prev == a[... | 0 | 43,830,911 |
#include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
vector<int> Graph[210000];
vector<int> Depth[210000];
vector<int> Deep(210000);
vector<int> Parent(210000);
vector<int> child[210000];
int root;
void BFS() {
for (int i =... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define big 1000000007
map<int,int64_t> p;
void fl(int64_t n){
if(n==1){
return ;
}
int tmp = n;
while(tmp%2==0 ){
tmp /= 2;
p[2]++;
}
for(int i=3;i*... | 0 | 15,128,030 |
#include <bits/stdc++.h>
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() {
string s;
cin >> s;
s='>'+s+'<';
long ans=0;
int n=s.size()-1;
vector<int>b(n,-1);
vector<int>c(n,-1);
rep(i,n){
if(s.at(i)=='>'&&... | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, i, j;
string S;
bool finished = false;
cin >> H >> W;
for (i = 1; i <= H; i++) {
for (j = 1; j <= W; j++) {
cin >> S;
if (S == "snuke") {
cout << (char)(64 + j) << i << endl;
finished = true;
... | 0 | 4,656,125 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<long long>lve;
typedef vector<pair<ll,ll> > lvp;
#define sp ' '
#define endl '\n'
#define F first
#define S second
#define pp pop_back`
#define pb push_back
#define mp make_pair ... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define REP(i,n) for (int64_t i=0; i<(n); ++i)
#define P pair<int,int>
using ll=int64_t;
using namespace std;
#define ketasuu(n) fixed<<setprecision(n)
#define btoe(p) p.begin(),p.end()
#define etob(p) p.rbegin(),p.rend()
int main(){
int h,w,d;... | 0 | 67,797,001 |
#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
using namespace std;
const int MOD = 1e9+7;
using ll = long long;
using vi = vector<int>;
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(x) x.begin(), x.end();
int main() {
string a;
int flag = 0,co=-1;
cin >> a;
if(a.at(0)!=... | #include<bits/stdc++.h>
typedef long long ll;
using namespace std;
int main(){
ll h, w; cin >> h >> w;
ll ans1 = 10e11, ans2 = 10e11;
for(int i = 1; i < h; i++){
ll halfh = (h-i) / 2, halfw = w / 2, h2 = h - i;
ll s1 = i * w;
ll s2 = halfh * w;
ll s3 = (h2 - halfh) * w;
... | 0 | 71,228,600 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
string str;
int cou = 0;
for(int i = 0; i < A * B; i++) {
cin >> str;
cou++;
if(str == "snuke") {
break;
}
}
int X = cou % B;
int Y = (cou - X) / B + 1;
if(X == 0) {
X = B;
Y--;
}
stri... | #include <iostream>
#include <algorithm>
#include <string>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <iomanip>
#include <set>
#include <ctime>
#include <tuple>
#include <bitset>
#include <assert.h>
#include <deq... | 0 | 25,669,652 |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int table[1001][1001] = {};
int main()
{
string a, b;
cin >> a >> b;
for (int i = 0; i < a.size() + 1; i++)
{
table[i][0] = i;
}
for (int j = 0; j < b.size() + 1; j++)
{
table[0][j] = j;
}
for (int i = 1; i < a.size() + 1; i++)... | #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 | 14,877,587 |
#include <iostream>
#include <stdio.h>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
ll gcd(ll x,ll y){
if(x<y) swap(x,y);
ll r;
while(y>0){
r=x%y;
x=y;
... | #include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define x first
#define y second
#define ll long long
#define lll __int128
#define ull unsigned long long
#define ulll unsigned __int128
#define pb push_back
#define eb emplace_back
#define gu getchar_unloc... | 0 | 68,162,222 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
#include <cstring>
#include <cmath>
#include <stack>
#include <iomanip>
#include <tuple>
#include <functional>
#include <cfloat>
#include <map>
#include <set>
#inclu... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int X, Y, A, B, C;
cin >> X >> Y >> A >> B >> C;
vector<ll> p(A), q(B), r(C);
for (int i = 0; i < A; i++) {
cin >> p[i];
}
for (int i = 0; i < B; i++) {
cin >> q[i];
}
for (int i = 0; i < C; ... | 0 | 40,335,848 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string str1, str2;
cin >> n;
for(int cnt = 0; cnt < n; ++cnt) {
cin >> str1 >> str2;
int dp[str1.size() + 1][str2.size() + 1];
for(int i = 0; i <= str1.size(); ++i) {
dp[i][0] = 0;
}
for... | #include<iostream>
int main()
{
int X,Y;
std::cin >> X >> Y;
if((X*Y % 2) == 0)
{
std::cout << "Even" << std::endl;
}else{
std::cout << "Odd" << std::endl;
}
} | 0 | 56,983,618 |
#include <bits/stdc++.h>
using namespace std;
const int N = 200005;
long long d[N], c[N];
pair<int,int> co[10];
void Push(stack<int>&st, int now) {
st.push(now % 10);
if(now >= 10) st.push(now / 10);
}
pair<int,int> calculate(int num) {
int ops = 0, used = 0;
ops++;
used++;
stack<int> st;
Push(st, num + num);
w... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define rep2(i,n) for(int i=0;i<=n;i++)
#define repr(i,a,n) for(int i=a;i<n;i++)
#define all(a) a.begin(),a.end()
#define P pair<long long,long long>
#... | 0 | 38,193,735 |
#include<bits/stdc++.h>
using namespace std;
const long long mod=1000000000+7;
const long long INF=9e18;
const double PI=3.14159265358979323846;
using ll = long long;
using P=pair<long long, long long>;
using vl=vector<long long>;
using vvl=vector<vector<long long>>;
using vP=vector<pair<long long, long long>>;
#define... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll (i)=0;(i)<(ll) (n);(i)++)
int main(void){
ll n,i=0,j,p,h[1000010],k;
double c=1,kaku=0;
cin >> n >> k;
for(i=1;i<=n;i++)
{
j=i;
while(j<k)
{
c=c/2;
j=j*2;
... | 0 | 57,571,430 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int (i) = 0; (i) < (n); (i)++)
#define repp(i, n, m) for(int (i) = (n); (i) < (m); (i)++)
#define repn(i, n) for(int (i) = 1; (i) <= (n); (i)++)
#define repr(i, n) for(int (i) = (n-1); (i) >= 0; (i)--)
#define all(x) (x).begin(), (x).end()
#define lint ... | #include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline")
#pragma GCC option("arch=native","tune=native","no-zero-upper")
#pragma GCC target("avx2")
#define int long long
#define f first
#define s second
#define db(x) cerr << #x << ": " << (x) << '\n';
#d... | 0 | 82,355,279 |
#include<bits/stdc++.h>
using namespace std;
#define lli long long int
#define pb push_back
#define MOD 1000000007
lli a[200010];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n=0;lli t=0ll,sum=0ll;
cin>>n>>t;
for(int i=0;i<n;++i)
cin>>a[i];
for(int i=1;i<n;++i)
{
sum+=min(... | #pragma GCC optimize ("-O2")
#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 FAST ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define ll long long
#define ld ... | 0 | 47,534,178 |
#include<bits/stdc++.h>
using namespace std;
#define Bye return 0
#define ll long long
void solve(){
string str; getline(cin, str);
int a = 0, b = 0, i = 0;
while(str[i] != ' ') a = a*10 + (str[i] - '0'), i++;
bool oper = (str[i+1] == '+') ? true : false;
i += 3;
while(i<str.size()) b = b*10 + ... | #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;
const int INF=1001001000;
const int mINF=-1001001000;
const ll LINF=1010010010010010000;
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
retur... | 0 | 52,666,850 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll,ll>;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep2(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
const ll INF = 1L... | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define endl "\n"
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec){os << "["; for (c... | 0 | 21,565,129 |
#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... | #include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define pp pair<pair<ll, ll>,pair<ll, ll>>
#define pll pair<ll,ll>
#define pdd pair<double,double>
#define vii vector<int>
#define vll vector<ll>
#define mat vector<vector<ll>>
#define lb lower_bound
#define ub upper_b... | 0 | 37,713,287 |
#include <iostream>
using namespace std;
int main()
{
double d, t, s, x;
cin >> d >> t >> s;
x = d / s;
if (x > t)
{
cout << "No\n";
}
else
{
cout << "Yes\n";
}
} | #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>
#include <bitset>
using... | 0 | 58,722,320 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
ll ans = a[0] / 2;
a[0] -= a[0] / 2 * 2;
for (int i = 1; i < n; ++i) {
if (a[i-1] == 1 && a... | #include <iostream>
#include <cstdint>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unorder... | 0 | 616,334 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int a[10][10][11]={0};
for(int i=0;i<n;i++){
int b,f,r,v;
cin>>b>>f>>r>>v;
a[b][f][r]+=v;
if(a[b][f][r]<0) a[b][f][r]=0;
}
for(int i=1;i<=4;i++){
for(int j=1;j<=3;j++){
for(int k=1;k<=10;k++){
cout<<" "<<a[i][j][k];
}
... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define fast_io ios_base::sync_with_stdio(false) ; cin.tie(0); cout.tie(0);
int main() {
fast_io;
queue<long long> q;
long long k;
cin>>k;
for(int i=1;i<=9;i++) {
q.push(i);
}
long long x;
long long a;
while(... | 0 | 17,172,454 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
typedef long long ll;
int main() {
int R, G, B, N;
ll ans = 0;
cin >> R >> G >> B >> N;
for (int r = 0; r * R <= N; r++){
for (int g = 0; r * R + g * G <= N; g++){
if((N - (r * R + g... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define INF (1LL<<50)
#define MOD 1000000007
typedef vector<vector<int>> Graph;
int main(){
int H,W;
cin >> H >> W;
vector<string> S(H);
rep(i,H) cin >> S[i];
Graph L(H,vector<int>(W))... | 0 | 98,686,289 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S, T;
cin >> S >> T;
if (S.size() < T.size()) {
cout << "UNRESTORABLE" << endl;
}
else {
int F = S.size();
int D = T.size();
vector<char> ans(F);
for (int j = 0; j < F; j++) {
ans.at(j) = 'z';
}
bool ok = f... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ull> vull;
typedef vector<string> vs;
typedef pair<ll,ll> pll;
#define fast_io ios_base::sync_with_stdio(false);cin.tie(0);... | 0 | 16,847,552 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
string S;
cin >> N >> S;
map<char, long long> c;
c['R'] = 0;
c['G'] = 0;
c['B'] = 0;
for (auto ch : S) {
c[ch] += 1;
}
long long remove = 0;
for (long long d = 1; d <= (N - 1) / 2; d++) {
... | #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... | 0 | 60,501,871 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
int lose = 0;
for(int i=0; i<s.length(); i++){
if(s[i] == 'x') lose += 1;
}
if(lose < 8) cout << "YES" << endl;
else cout << "NO" << endl;
return 0;
} | #include<bits/stdc++.h>
#define sqr(x) ((x)*(x))
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define ld long double
#define vi vector<int>
#define HEAP(...) priority_queue<__VA_ARGS__ >
#define heap(...) priority_queue<__VA_ARGS__,vector<__VA_ARGS__ >,greater<__VA_ARGS__ > >
#define pii... | 0 | 39,915,745 |
#include <stdio.h>
int main() {
int A, B;
scanf("%d %d", &A, &B);
int length = A + B + 1, cnt = 0;
char S[50];
scanf("%s", S);
if (S[A] == '-') {
for(int i = 0; i < length; i++) {
if (S[i] >= '0' && S[i] <= '9') {
cnt++;
}
}
if (cnt == length -1) {
printf("Yes\n");
} else {
printf("No\n")... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
long long MOD = 10000000000 + 7;
int main(){
cout << setprecision(10);
ll S; cin >> S;
ll x1,x2,x3,y1,y2,y3;
if(S==1000000000000000000){
x1 = 0;
x2 = 1000000000;
x3 = 0;
y1 = 0;
y2 = 0;
y3 = 100... | 0 | 69,303,387 |
#include<bits/stdc++.h>
#define ll long long
#define ljc 998244353
using namespace std;
#define gc getchar
inline ll read(){
register ll x=0,f=1;char ch=gc();
while (!isdigit(ch)){if (ch=='-') f=-1;ch=gc();}
while (isdigit(ch)){x=(x<<3)+(x<<1)+ch-'0';ch=gc();}
return (f==1)?x:-x;
}
vector<int> e[1010101... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
using vi = vector<int>;
using vvi = vector<vi>;
using pii = pair<int, int>;
int main() {
int H, W;
cin >> H >> W;
vector<vector<char>> s(H, vector<char>(W));... | 0 | 14,151,345 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int N; cin>>N;
vector<ll> B(N);
for(int i=0; i<N; ++i){ cin>>B[i]; B[i] -= i+1; }
sort(B.begin(), B.end());
ll l = accumulate(B.begin()+N/2+(N%2), B.end(), 0LL);
ll r = accumulate(B.begin(), B.begin()+N/2, 0LL);
cout<< l-r <<endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n,m,k;
cin >> n >> m >> k;
vector<bool> a((n+1)*(m+1));
for(int i = 0; i <= n; i++) {
for(int j = 0; j <= m; j++) {
in... | 0 | 7,937,398 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int k, n;
cin >> k >> n;
vector<int> a(n);
for(int i = 0; i < n; i++) cin >> a[i];
sort(a.begin(), a.end());
int diff = a[0] + (k - a[n-1]);
for(int i = 1; i < n; i++) {
diff = max((a[i] - a[i-1]), diff);
}
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define yn(x) ((x) ? "Yes" : "No")
typedef pair <int, int> ii;
typedef pair <int, ii> iii;
const int siz = 2e5 + 10;
const int SIZ = 1e6 + 10;
const ... | 0 | 468,484 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.