code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 45 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define repr(i, n) for (int i = (int)n - 1; i >= 0; --i)
#define ALL(a) (a).begin(), (a).end()
using ll = long long;
const ll MOD = 1e9 + 7;
const ll INF = 1e9;
co... | #include <bits/stdc++.h>
#include <algorithm>
#include <functional>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define DEBUG
#define PI 3.141592653589793238462643383279
#define _GLIBCXX_DEBUG
#ifdef DEBUG
#define s(...) show(__VA_ARGS__);
#define sl(...) show(__VA... | 1 | 52,160,063 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)n;i++)
using Graph = vector<vector<int> >;
using GraphC = vector<vector<char> >;
typedef pair<int, int> P;
const int MAX_N = 10000;
const int MAX_L = 100000000;
const int MAX_SQRT_B = 10000;
const int INF = 1000000000;
typedef int64_t ll;... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {;
vector<int> num{};
int ret = 0, tmp;
for (int i = 0; i < 3; i++) {cin >>tmp; num.push_back(tmp);}
while (num[0] != num[1] || num[1] != num[2]) {
sort(num.begin(), num.end());
if (num[2]-num[0] >... | 1 | 54,108,094 |
#include <bits/stdc++.h>
#define pb push_back
#define pi pair<int, int>
#define l first
#define r second
#define all(x) x.begin(), x.end()
#define fori(a, b, step) for (int i = a; i < b; i += step)
#define forj(a, b, step) for (int j = a; j < b; j += step)
const int maxn = 5e5 + 1, CC = 10001;
using namespace std;
shor... | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <tuple>
#include <iomanip>
#include <queue>
#include <cmath>
using namespace std;
using ll = long long;
using pa = pair<ll, ll>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
const ll MOD = 1e9 + 7;
const ll INF = 1e14;
const lo... | 1 | 16,728,590 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
static const int MAX = 500;
int c[MAX], s[MAX], f[MAX];
int main(){
int n;
cin >> n;
for(int i = 0; i < n-1; i++){
cin >> c[i] >> s[i] >> f[i];
}
for(int i = 0; i < n-1; i++){
int t = s[i] + c[i];
for(int j =... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define PR pair<int, int>
const int N = 3e5 + 10;
const int MOD = 1e9 + 7;
const long long INF = 5e18;
const double PI = 2 * acos(0.0);
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> c(n), s(n), ... | 1 | 71,499,043 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define SORT(c) sort((c).begin(),(c).end())
#define all(a) (a).begin(), (a).end()
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define pv(val) cerr << #val << '=' << (val) << endl
const int INF = 1e9;
int main(void){
string... | #include <bits/stdc++.h>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int win = 0;
for (int i = 0; i < s.size(); i++) {
char c = s.at(i);
if (c == 'o')
win++;
}
win = win + (15 - s.size());
cout << ((win >= 8) ? "YES" : "NO") << endl;
} | 1 | 83,308,495 |
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int n,m,c[20],dp[50001],l,k,p=0;
cin >>n>>m;
for(int i=0;i<m;i++)
cin >> c[i];
for(int i=0;i<=n;i++){
dp[i]=i;
for(int j=0;j<m;j++){
if(i-c[j]>=0){
dp[i]=min(dp[i],dp[i-c[j]]+1);
}
}
}
cout << dp[n]<<endl;
... | #include <iostream>
#include <cstdio>
#include <vector>
#include <list>
#include <algorithm>
#include <cmath>
#include <stack>
#include <map>
#include <numeric>
#include <sstream>
#include <queue>
#include <iomanip>
using namespace std;
#define REP(i,n) for(int (i)=0; (i)<(n); (i)++)
#define FOR(i,a,b) for(int (i)=(a);... | 1 | 41,140,453 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using str = string;
using P = pair<int, int>;
using Pll = pair<ll, ll>;
const double PI = 3.141592653589793238;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define REP(i, m, n) for (int i = m; i < (int)n; i++)
#def... | #include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <utility>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
using namespace std;
typedef long long ll;
typedef pair<int, int> pair;
const int inf = 1000000000;
int ma... | 1 | 34,893,600 |
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
string str;
int q, a, b;
void print() {
for (int i = a; i<=b; i++) {
cout << str[i];
}
cout << endl;
}
void reverse() {
while (a<b) {
swap(str[a], str[b]);
a++;
b--;
}
}
void replace(string p... | #include <stdio.h>
#include <string.h>
int main() {
char str[1050] = {0};
char ch[1050] = {0};
char mei[30] = {0};
char pl[1050]={0};
int i,j,k,l,m,n,o,p;
scanf("%s",str);
scanf("%d",&n);
for(i=0; i<7 ;i++) {
ch[i] = str[i];
}
j=0;
o=0;
k=l=0;
for ( i = 0; i < n; i++ ){
scanf("%s", mei... | 1 | 19,815,722 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using ll = long long;
using ld = long double;
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define rep3(i, n) for (ll i = 1; i < (ll)(n+1); i++)
#define rep4(i, s, n) for (ll i = (s); i < ... | #include <bits/stdc++.h>
using namespace std;
#include<cstdlib>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
typedef long long ll;
int main(){
string s;
cin >> s;
int n=s.size();
string k = "keyence";
int mae=0, ushiro=0;
rep(i,7){
if(s.at(i)==k.at(i))mae++;
else break;
}
rep(i,7){
if(s.at(... | 1 | 83,114,906 |
#include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define pu... | #include <bits/stdc++.h>
typedef uint64_t u64;
typedef int64_t i64;
typedef uint32_t u32;
typedef int32_t i32;
#define MAX_NUM (1000000007)
#define PI 3.14159265358979323846
using namespace std;
template <typename T>
static inline void ArrayInput(vector<T>& A) {
for (auto itr = A.begin(); itr < A.end(); ++itr) cin >>... | 1 | 33,631,282 |
#include<bits/stdc++.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++)
#define repr(i, n) for(int i=n-1; i>=0; i--)
#define repr1(i, n) for(int i=n; i>=1; i--)
#define all(v) v.begin(),v.end()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<in... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll A[100000];
ll cum_A[100001];
unordered_map<int, ll> mod_cnt;
int main() {
int N, M;
cin >> N >> M;
for (int i=0; i<N; i++) {
cin >> A[i];
cum_A[i+1] = cum_A[i] + A[i];
}
for (int i=0; i<=N; i++) {
mod_cnt[cum_A[i] % M]++;
}
ll ans = 0;
... | 1 | 4,112,215 |
#include <stdio.h>
#include <string.h>
int main(){
int n;
char stT[110], stH[110];
int result;
int ptT=0, ptH=0;
scanf("%d", &n);
for (int i=0; i<n; i++){
scanf("%s %s", stT, stH);
result = strcmp(stT, stH);
if (result > 0) ptT+=3;
else if (result <0) ptH += 3;
... | #include <iostream>
#include <string>
using namespace std;
int main(void){
int n, taro = 0, hanako = 0;
cin >> n;
for(int i = 0; i < n; i++){
string t, h;
cin >> t >> h;
if(t > h) taro += 3;
else if(t < h) hanako += 3;
else {taro += 1; hanako += 1;}
}
cout << ... | 1 | 2,545,035 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <iomanip>
#include <map>
#include <set>
using namespace std;
void solve(){
int a, b, x; cin >> a >> b >> x;
if(x >= a && x <= a + b) cout << "YES\n";
else cout << "NO\n";
return;
}
int main(){
solve();
return 0;
} | #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... | 1 | 12,718,183 |
#include <iostream>
#include <string>
char Compare_Func(const char arg_a);
const int L_CHAR_MIN = 0x41;
const int L_CHAR_MAX = 0x5a;
const int S_CHAR_MIN = 0x61;
const int S_CHAR_MAX = 0x7a;
int main()
{
char Result = NULL;
char Char_Temp = NULL;
std::string buf;
std::cin >> buf;
if (!buf.empty())
{
Char_Te... | #include <cmath>
#include <cstdio>
#include <vector>
#include <list>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <stack>
#include <fstream>
#include <queue>
#include <iomanip>
#include <iterator>
#include <map>
#include <unordered_map>
#include <set>
#include <assert.h>
#include <numeric>
#defi... | 1 | 65,764,855 |
#include<iostream>
#include<cstdio>
#define a(i,b) for(int i=0;i<b;i++)
using namespace std;
int main() {
int n,c;
while(scanf("%d",&n)!=EOF){
c=0;
a(i,10)a(j,10)a(k,10)a(h,10)if(i+j+k+h==n)c++;
cout<<c<<endl;
}
return 0;
} | #include <iostream>
int main() {
int n;
while( std::cin >> n ) {
int ans = 0;
for( int a=0; a<10; ++a )
for( int b=0; b<10; ++b )
for( int c=0; c<10; ++c )
for( int d=0; d<10; ++d )
ans += (a+b+c+d==n)?1:0;
std::cout << ans << std::endl;
}
} | 1 | 59,413,443 |
#include<cstdio>
const short N_MAX = 105;
bool matrix[N_MAX][N_MAX];
int main(){
int n;
scanf("%d", &n);
for(char i=0; i<n;i++){
int degree, index;
scanf("%u%u", &index, °ree);
for(char j=0; j<degree; j++){
int temp;
scanf("%d", &temp);
matrix[index-1][temp-1] = true;
}
}
for(char r=0; r<n; r++... | #include<iostream>
using namespace std;
int main()
{
int g[100][100];
int n;
for(int i=0; i<100; i++)
{
for(int j=0; j<100; j++)
{
g[i][j]=0;
}
}
cin>>n;
int x,y,z;
for(int i=0; i<n; i++)
{
cin>>x>>y;
for(int j=0; j<y; j++)
{
cin>>z;
g[x-1][z-1]=1;
}
... | 1 | 43,158,127 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = int64_t;
using P = pair<ll, ll>;
template <class T>
using V = vector<T>;
const int INF = 1e8;
int main() {
int h, n;
cin >> h >> n;
V<int> a(n), b(n);
rep(i, n) cin >> a[i] >> b[i];
V<int> dp(h + 10, INF);... | #include <stdio.h>
#include <math.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <numeric>
#include <string>
#include <map>
#include <bitset>
#include <stack>
using namespace std;
typedef long long int lli;
#define urept(soeji, start, n) for (int soeji = start; soeji < n; soeji++)
#define drept(... | 1 | 27,684,864 |
#include <iostream>
#include <string>
#include <unordered_map>
#include <algorithm>
int main()
{
std::ios_base::sync_with_stdio(0);
std::cin.tie(0);
std::unordered_map<int, int> mapa;
mapa.insert(std::make_pair(0, 0));
std::string str;
std::getline(std::cin, str);
int n = str.length();
int xoring = 0;
for (int... | #include <iostream>
#include <string>
#include <memory.h>
#include <algorithm>
#include <limits.h>
using namespace std;
const int MAXN = 2e5 + 10;
int dp[1<<26], state[MAXN];
int ret[MAXN];
int main() {
memset(dp, -1, sizeof(dp));
string s;
cin >> s;
int n = s.size();
for (int i = 0; i < n; i++) {
... | 1 | 33,408,271 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int H,W;
cin >> H >> W;
vector<vector<char>> vec(H,vector<char> (W));
for(int i=0;i<H;++i){
for(int j=0;j<W;++j){
cin >> vec.at(i).at(j);
}
}
for(int i=0;i<H;++i){
for(int j=0;j<W;++j){
cout << vec.at(i).at(j);
}
cout... | #include<iostream>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
char c[105];
for(int i=0;i<a;i++){
scanf("%s",c);
printf("%s\n%s\n",c,c);
}
return 0;
} | 1 | 39,876,952 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
char c;
cin >> c;
if (c == 'A') cout << 'T' << endl;
if (c == 'C') cout << 'G' << endl;
if (c == 'G') cout << 'C' << endl;
if (c == 'T') cout << 'A' << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define co cout
#define ci cin
#define sf1(n) scanf("%lld",&n)
#define sf2(n,m) scanf("%lld %lld",&n,&m);
#define sf3(n,m,p) scanf("%lld %lld %lld",&n,&m,&p)
#define pf1(n) printf("%lld\n",n);
#define mem(a,b) mems... | 1 | 48,971,044 |
#include <iostream>
#include <algorithm>
using namespace std;
int N, K;
int A[100010];
int gcd(int a, int b)
{
return b == 0 ? a : gcd(b, a % b);
}
int main()
{
cin >> N >> K;
for (int i = 0; i < N; ++i) cin >> A[i];
int GCD = 0, mx = 0;
for (int i = 0; i < N; ++i) {
GCD = gcd(GCD, A[i]);
... | #include <bits/stdc++.h>
using namespace std;
#define rall(x) x.rbegin() , x.rend()
#define all(x) x.begin() , x.end()
#define fi first
#define se second
#define pb push_back
using ll = long long;
using ii = pair <int , int>;
void in(int &x);
#define singleCase
int n,k;
void work() {
in(n); in(k);
vector <int> v(... | 1 | 49,658,847 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
using ll = long long;
using ld = long double;
ll INF = LLONG_MAX;
using vi = vector<int>;
using vll = vector<ll>;... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr int inf = 0x3f3f3f3f;
constexpr ll linf = 0x3f3f3f3f3f3f3f3fLL;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int h, w, n; cin >> h >> w >> n;
set<pair<int, int>> cand, black;
for (int i = 0; i < n; i++) {
... | 1 | 10,487,717 |
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int n;
cin >> n;
int x;
cin >> x;
for (int i = 1; i < n; ++i) {
int y;
cin >> y;
x = __gcd(x, y);
}
cout << x << endl;
} | #include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
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; } re... | 1 | 55,755,683 |
#include <bits/stdc++.h>
using namespace std;
long long fxor(long long n){
long long ans=0;
if((n/2)%2==0 && n%2==0){
ans=n;
}
else if((n/2)%2==0 && n%2==1){
ans=n^(n-1);
}
else if((n/2)%2==1 && n%2==0){
ans=n^1;
}
else{
ans=0;
}
return ans;
}
int main(){
long long A,B;
cin>>A>>B... | #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... | 1 | 27,778,763 |
#include <iostream>
#include <queue>
#include <vector>
#include <iostream>
#include <vector>
#include <string>
#include <cassert>
#include <algorithm>
#include <functional>
#include <cmath>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <map>
#include <iomanip>
#include <utility>
#include <s... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i = 0; i < n; ++i)
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n; cin >> n;
vector<int> a(n); rep(i,n) cin >> a[i];
map<int,int> m;
int cnt = 0;
rep(i,n){
if(m[a[i]] == 0) cnt++;
... | 1 | 53,892,613 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int X;cin>>X;
int Y=X/200;
cout<<10-Y<<endl;
} | #include <iostream>
using namespace std;
int main() {
int X;
cin >> X;
int kyu[] = {2000, 1800, 1600, 1400, 1200, 1000, 800, 600, 400};
for (int i = 0; i < 9; i++) {
if (X >= kyu[i]) {
cout << i << endl;
break;
}
}
return 0;
} | 1 | 97,287,606 |
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
int b(string s, string t) {
int len = (int) s.size();
int count = 0;
for(int i=0;i<len;i++) {
if(s[i] != t[i]) {
count++;
}
}
return count;
}
int main() {
string s, t;
cin >> s;
cin >> t;
cout << b(s, t);
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define ALL(c) (c).begin(), (c).end()
#define pb push_back
#define eb emplace_back
const long long INF = 1LL<<60;
using namespace std;
using ll = long long;
using P = pair<int, int>;
template<class T> inlin... | 1 | 85,231,068 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i = 0; i < (N); i++)
#define repo(i,N) for(int i = 1; i < (N); i++)
#define pb push_back
#define mp make_pair
#define ll long long
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
#define pi acos(-1.0)
int main() {
int n;
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> pll;
const ll mod=1e9+7;
const ll inf=5e18;
int main() {
ll n;
cin >> n;
vector<double> x(n);
vector<string> u(n);
double ans=0;
for(ll i=0;i<n;i++) {
cin >> x[i] >> u[... | 1 | 54,533,238 |
#include <iostream>
#include <stdio.h>
using namespace std;
int main()
{
unsigned long a, b;
cin >> a >> b;
cout << a/b << ' ' << a%b;
printf(" %.6f\n", (double)a/(double)b);
} | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int a, b, quot, remain;
double floatNum;
cin >> a >> b;
quot = a / b;
remain = a % b;
floatNum = (double)a / (double)b;
printf("%d %d %f\n", quot, remain, floatNum);
return 0;
} | 1 | 72,670,695 |
#include <bits/stdc++.h>
#if DEBUG
template <typename T>
void debug(T value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) \
do { \... | #include <bits/stdc++.h>
using namespace std;
int main(){
long long H,W;
cin >>H>>W;
if(H==1||W==1){
cout<<1<<endl;
return 0;
}
cout<<setprecision(20)<<(W/2)*(H/2)+(W/2+W%2)*(H/2+H%2)<<endl;
return 0;
} | 1 | 43,871,769 |
#pragma target("avx")
#pragma optimize("O3")
#include<bits/stdc++.h>
using ll = int_fast64_t;
using P = std::pair<ll,ll>;
using PP = std::pair<ll,P>;
using V = std::vector<ll>;
template<typename T> using pq = std::priority_queue<T>;
template<typename T> using rpq = std::priority_queue<T, std::vector<T>, std::greater<T>... | #include <stdio.h>
#include <string.h>
int main(){
int N, K, X=1;
scanf("%d %d", &N, &K);
while (N>0){
if(X<=K){
X*=2;
}
else{
X+=K;
}
N--;
}
printf ("%d", X);
return 0;
} | 1 | 60,427,909 |
#include<stdio.h>
#include<string.h>
int main(){
int k;
char word[101];
scanf("%d", &k);
scanf("%s", &word);
int len = strlen(word);
if (len <= k){
printf("%s", &word);
}
else {
word[k] = '\0';
printf("%s...", word);
}
return 0;
} | #include <bits/stdc++.h>
int main() {
int K;
std::cin >> K;
std::string s;
std::cin >> s;
if (s.size() <= K) std::cout << s << "\n";
else std::cout << s.substr(0, K) << "...\n";
} | 1 | 20,132,637 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, k, n) for (int i = k; i < (int)(n); i++)
#define RRep(i, k, n) for (int i = k; i > (int)(n); i--)
#... | #include "bits/stdc++.h"
using namespace std;
int main() {
int N;
cin >> N;
vector<int>H(N);
for (int n = 0;n<N;++n) {
cin >> H[n];
}
int ans = 0;
int high = 0;
for (int n = 0; n < N; ++n) {
if (high<=H[n]) {
ans++;
high = H[n];
}
}
cout << ans << endl;
return 0;
} | 1 | 67,491,517 |
#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 repx(i, x, n) for (int i = int(x); i < int(n); ++i)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; --i)
#define ALL(n) begin(n), end(n)
#define IN(a, x, b) ((... | #include <bits/stdc++.h>
using namespace std;
const int N=1e5+3;
int arr[N];
int main(){
std::ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
long test;
test=1;
while(test--)
{
long long i,j,n,q,e=0,t,o=0,c=0,temp,k,maxpeak=0,peak,d;
string s;
cin>>n;
for(i=0;i... | 1 | 66,679,002 |
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
void solve() {
int n, m;
cin >> n >> m;
string a;
string b;
a = "";
b = "";
for (int i = 0 ; i < n; ++i) {
string ai;
cin >> ai;
a += ai;
}
for (int i = 0; i < m; ++i) {
st... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) begin(v),end(v)
using ll = long long;
int main() {
int n,m;cin>>n>>m;
vector<vector<char>> a(n,vector<char>(n)),b(m,vector<char>(m));
rep(i,n)rep(j,n)cin>>a[i][j];
rep(i,m)rep(j,m)cin>>b[i][j];
rep(i,n... | 1 | 80,998,285 |
#include<iostream>
#include<stdio.h>
#include<string>
#include<vector>
#include<map>
#include<tuple>
#include<algorithm>
#include<cmath>
#include<limits>
#include<set>
#include<deque>
#include<queue>
#include<stack>
using namespace std;
#define int long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1001001001;
int main() {
string a,b,c;
cin >> a >> b >> c;
cout << char(a.at(0) - 32) << char(b.at(0) - 32) << char(c.at(0) - 32) << endl;
return 0;
} | 1 | 95,266,843 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long n,m;
cin >> n >> m;
cout << (m*1800+n*100)*pow(2,m) << endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n)for(ll i=0;i<n;i++)
const ll INF = 1001001001;
const double PI=3.141592653;
const ll sosu = 1000000007;
ll f(ll x){
if(x==1) return 1;
return 2*f(x/2)+1;
}
int main(){
int n,m;
cin>>n>>m;
int a=1;
for(int i=0;i<m;i++){
a=... | 1 | 87,218,034 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
double m;
cin >> n >> m;
int a[n];
int i;
double all=0;
for (i = 0; i<n ; i++){
cin >> a[i];
all += a[i];
}
double bunki=all / 4.0 / m;
sort(a, a+n, std::greater<>());
for (i = 0; i<m; i++){
... | #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;
int n,m;
cin>>n>>m;
vector<double> arr;
double total=0;
for(int i=0;i<n;i++) {
double num;
cin>>num;
total... | 1 | 67,047,643 |
#include <iostream>
#include <vector>
using namespace std;
int main(){
int a,b,c,d,p[100001],n,k;
vector<int> e[100001];
cin>>a;
for(int i=0;i<=a;i++)p[i]=-1;
for(int i=0;i<a;i++){
cin>>b>>c;
for(int j=0;j<c;j++){
cin>>d;
p[d]=b;
e[b].push_back(d);
}
}
for(int i=0;i<a;i++){
... | #include <iostream>
#include <vector>
using namespace std;
class Node{
public:
int id;
Node* p_parent;
vector<Node*> p_children;
Node(int n):id(n), p_parent(), p_children(){}
Node(int n, Node& supernode):id(n), p_parent(&supernode), p_children(){}
};
void initializeNodes(vector<Node>& nodes, int n, Node& supernode... | 1 | 12,509,644 |
#include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, a;
vector<int> v;
vector<pair<int, int> > p;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
v.push_back(a);
}
sort(v.begin(), v.end());
for (int i = 1; i < n - 1; i++) {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for(int (i)=0;(i)<(n);(i)++)
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
bool custom1 (pair<int, int> a, pair<int, int> b) {
return (a.first < b.first);
}
bool custom2(pair<int, int>... | 1 | 70,724,584 |
#include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <unordered_map>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
#include <assert.h>
#include <unordered_map>
#include <fstream>
#include <ctim... | #include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
vector<int> arr[1000002];
for(lli i=2;i<1000002;i++){
if(arr[i].size()==0){
lli k=i;
while(k<1000002){
arr[k].push_back(i);
... | 1 | 93,891,371 |
#include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#define SPBR(w, n) std::cout<<(w + 1 == n ? '\n' : ' ');
#define YES cout << "YES" << ... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
int X,Y;
cin>>X>>Y;
if(X%Y==0) cout<<"-1"<<endl;
else cout<<X<<endl;
} | 1 | 31,935,686 |
#include<iostream>
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<set>
#include<string>
#include<sstream>
#include<complex>
#include<time.h>
#include<random>
#include<cmath>
#include<math.h>
#include<queue>
#include<time.h>
#include<iomanip>
#include<locale>
#include<utility>
#define rt "\n"
#define re... | #include <stdio.h>
#include <iostream>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <math.h>
#include <algorithm>
using namespace std;
#define ll long long
const double EPS = 1e-10;
const ll MOD = 7+(1e+9);
int main (){
ll a,b,c;
cin>>a>>b>>c;
if(a==... | 1 | 96,523,080 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int K,X;
cin >> K >> X;
if(500*K >= X){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
#define pb(x) push_back(x)
#define HAYAKU_HAYAKU ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int main()
{
HAYAKU_HAYAKU;
ll n,m,sum;
cin>>n>>m;
sum = n * 500;
sum >= m ? cout<<"Yes" : cout<<"No";
} | 1 | 96,288,532 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll N1097 = 1000000007LL;
ll N, K;
ll A[1000000];
ll d[1000000];
int main(){
cin >> N >> K;
for(ll i=0;i<N;i++){
scanf("%ld", &A[i]);
}
for(ll l=0;l<K;l++){
for(ll i=0;i<=N;i++){
d[i] = 0LL;
}
for(ll i=0;i<N;i++){
... | #pragma GCC optimize("avx2, O3")
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <string>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
#include <deque>
#include <map>
#include <fstream>
#include <utility>
#include <stack>
#include <unordered_map>
#include <unord... | 1 | 83,682,311 |
#include <bits/stdc++.h>
#define DB double
#define LL long long
#define MST(a,b) memset((a),(b),sizeof(a))
#define MRK() cout<<"Mark"<<endl;
#define WRT(x) cout<<#x<<" = "<<(x)<<endl;
#define MAXN 210000
#define MAXM 410000
#define MOD 998244353
#define INF 0x3f3f3f3f
#define LLINF 0x3f3f3f3f3f3f3f3f
#define EPS 1e-5
#... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, s, e) for (int i = s; i < e; ++i)
#define sort_(a) stable_sort(a.begin(), a.end())
#define rsort(a) stable_sort(a.rbegin(), a.rend())
#define sum(a) accumulate(a.begin(), a.end(), 0LL)
#define join(a, d) accumulate(a.begin() + 1, a.end(), a[0], [](string s, s... | 1 | 86,477,937 |
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
int main() {
ll N;
cin>>N;
ll ans=1;
while(ans<=N) {
ans*=2;
}
ans/=2;
cout<<ans<<endl;
} | #include <iostream>
#include <cmath>
using namespace std;
int main(){
int N;
cin >> N;
int ans=0;
int i;
for(i=1; i<7; i++){
if(pow(2,i)<=N) ans++;
}
cout << pow(2,ans) << endl;
return 0;
} | 1 | 36,231,994 |
#include <bits/stdc++.h>
#define sz(x) ((int)x.size())
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef long double ld;
int n;
vector<int> lst[100010];
int main() {
scanf("%d", &n);
int lo = 1, hi = n;
while(lo < hi) {
int mid = (lo + hi) / 2;
if(1ll*mid*(mid+1)/2 < n) lo ... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <utility>
#include <cmath>
#include <functional>
#include <queue>
#include <climits>
#include <map>
#define REP(i,n) for(int i=0;i<n;i++)
#define FOR(i,n1,n2) for(int i=n1;i<n2;i++)
#define put(a) cout<<a<<endl;
#define all(a) (a).be... | 1 | 23,313,877 |
#define _USE_MATH_DEFINES
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <string>
#include<math.h>
#include<iomanip>
#include<stdio.h>
#include <stdlib.h>
#include<stdio.h>
#include <queue>
#include<map>
#include <sstream>
#include<set>
#include<stack>
typedef lo... | #include <bits/stdc++.h>
using namespace std;
int main() {
int x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
int x3, y3, x4, y4;
vector<int> xy = { x2 - x1, y2 - y1 };
x3 = x2 - xy.at(1);
y3 = y2 + xy.at(0);
x4 = x3 - xy.at(0);
y4 = y3 - xy.at(1);
cout << x3 <<" "<< y3 << " " << x4 << " " << y4 << " " << endl;
... | 1 | 15,736,357 |
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
#define SIZE 200005
#define INF 1000000005LL
#define MOD 1000000007
using namespace std;
typedef long long int ll;
typedef pair <int,int> P;
int main(){
int n;
string s;
cin >> n >> s;
vector<int> data(n);
rep(i,0,n){
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ... | 1 | 91,169,284 |
#include "bits/stdc++.h"
using namespace std;
typedef unsigned long long li;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
li n;
cin >> n;
vector<li> xs(n);
for (int i = 0; i < n; ++i) {
cin >> xs[i];
}
li xorsum = 0;
for (int i = 0; i < n; ++i) {
xorsum ^= xs... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
typedef long double ld;
ll inv(ll a, ll b){
return (a > 1 ? b - inv(b%a, a)*b/a : 1);
}
#define rc(s) return cout << s, 0
#define fi first
#define se second
#define L (nod << 1)
#define R (L |... | 1 | 28,885,747 |
#include<bits/stdc++.h>
#include<numeric>
using namespace std;
const long double PI = 3.141592653589793238;
const double EPS = 1e-6 ;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long
#define dd double
#define vll vector<ll>
#define vs vector<string>
#define fn(i,n) for(ll i = 0; i<n; i... | #include <bits/stdc++.h>
using namespace std;
#define len(s) int(s.size())
#define res(x) cout<<((x)?"unsafe\n":"safe\n")
#define all(v) v.begin(),v.end()
typedef long long ll;
typedef long double ld;
ll mod = 1e9+7;
void solution() {
int k, n, x;
cin >> k >> n;
bool existk = false;
vector<bool> a(110, false);
for... | 1 | 34,593,173 |
#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 ll long long
#define db long double
#define ii pair<int,int>
#define vi vector<int>
#define fi first
#define se second
#define sz(a) (int)(a).size()
#define all... | #include <bits/stdc++.h>
using namespace std;
using VS = vector<string>; using LL = long long;
using VI = vector<int>; using VVI = vector<VI>;
using PII = pair<int, int>; using PLL = pair<LL, LL>;
using VL = vector<LL>; using VVL = vector<VL>;
#define ALL(a) begin((a)),end((a))
#define RALL(a) (a).rb... | 1 | 89,284,203 |
#include <bits/stdc++.h>
#include <numeric>
using namespace std;
#define ll long long
#define mod 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
using Graph = vector<vector<int>>;
#define grepq priority_queue<double, std::vector<double>, std::greater<double>>
#define all(v) v.begin(), v.end()
#define PI acos(... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
long q,h,s,d,n;
cin >>q>>h>>s>>d>>n;
q *= 4;
h *= 2;
long minimum = min(q,h);
minimum = min(minimum,s);
long ans = 0;
if(n >= 2){
if(2*minimum > d){
... | 1 | 12,222,459 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll a7=1000000007;
ll inf=1000000000000000;
typedef pair<ll,ll> l_l;
#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define pb push_back
ll min(ll a,ll b){
if(a<b)return a;
return b;
}
ll max(ll a,ll b){
if(a>b)return a;
return b;
}
bool used[1... | #include<iostream>
#include<string>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#include<vector>
#include<list>
#include<cstdint>
#include<bits/stdc++.h>
#include<queue>
#include<set>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep_r(i, n) for(int i = n-1; i >= 0; i--)
#define rep1(i, n) for(i... | 1 | 34,699,035 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int mod = 1e9+7;
const ll inf = 1e18;
const double pi = 3.1415926535897932384626;
ll mpow(ll a,ll b){
ll res=1;
a%=mod;
while(b){
if(b%2) res=res*a%mod;
a=a*a%mod;
b/=2;
}
return res;
}
ll gcd(ll a,ll b){
if(b==0) retur... | #include <cstdio>
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#define rep(i,n) for (int i=0;i<n;i++)
using ll = long long;
using namespace std;
void solve(){
}
int main (){
... | 1 | 87,906,486 |
#include<iostream>
#include<math.h>
using namespace std;
int main(){
double a,b,c,d=0,e=0;
string s;
cin>>s;
if(s[0]==s[1] && s[1]==s[2]){cout<<"No"; return 0;}
if(s[0]==s[2] || s[0]==s[1] || s[1]==s[2]){cout<<"Yes";return 0;}
else{cout<<"No";}
return 0;
} | #include <bits/stdc++.h>
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <math.h>
#define fi first
#define se second
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rrep(i,n) for(ll i = 1; i <= (n); ++i)
#define drep(i,n) for(ll i = (n)-1; i >= 0; --i)
#define all(v) v.begin(),v.end()
#define len(x)... | 1 | 4,745,449 |
#include <iostream>
#include <string.h>
using namespace std ;
int A,P;
int main(){
cin >> A >> P;
P += A*3;
int pi = P /2;
cout << pi << "\n";
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int INF = 1001001001;
const int mod = 1000000007;
ll pow(ll base, ll order) {
ll ans = 1;
rep(i,order - 1) ans *= base;
return ans;
}
int gcd(int a, int b) {
if (a < b) {
int c = a;
a = b;
... | 1 | 4,929,457 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define show(x) {for(auto i: x){cout << i << " ";} cout << endl;}
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... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> s = a;
sort(s.rbegin(), s.rend());
rep(i, n) {
int ans = s[0];
if (s[0] == a[i... | 1 | 44,732,638 |
#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 rep1(i,n) for(int i = 1; i <= (n); i++)
#define rrep1(i,n) for(int i = (n); i > 0; i--)
#define ll long long
#define pi pair<int, int>
#define pll pair<ll, ll>
#define MOD 1000000007
#define I... | #include <bits/stdc++.h>
#define PI 3.14159265358979323846264338327950288419
using namespace std;
int n;
int a[100005];
long long leftt = 2, rightt = 2;
void compute(int cmd){
long long lo = (leftt + cmd - 1) / cmd;
long long hi = rightt / cmd;
leftt = lo * cmd;
rightt = (hi + 1) * cmd - 1;
return;
}
int main(){
... | 1 | 64,040,884 |
#include<iostream>
#include<string>
using namespace std;
int main(){
string str_m,command,str_1,str_2;
int a,b,q;
cin >> str_m >> q;
for(int i=0;i<q;i++){
cin >> command >> a >> b;
if(command == "replace"){
cin >> str_1;
str_m = str_m.replace(a,b-a+1,str_1);
}
if(command == "print"){
cout << str_m... | #include<bits/stdc++.h>
using namespace std;
int main(){
string pri = "print", rev = "reverse", rep = "replace", str;
int q;
cin>>str>>q;
for(int i = 0; i < q; i++){
int a, b;
string o, p, temp = "";
cin>>o;
cin>>a>>b;
if(o == pri){
for(int j = a; j <= b; j++) cout<<str[j];
cout<<endl;
}
if(o ==... | 1 | 43,616,829 |
#include<iostream>
#include<string.h>
#include<string>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<bitset>
#include<math.h>
#include<stack>
#include<queue>
#include<set>
#include<map>
using namespace std;
typedef long long ll;
typedef long double db;
typedef vector<int> vi;
typedef pair<int,int> pii... | #include<bits/stdc++.h>
#define M 1000000000
using std::stack;
using std::pair;
using std::vector;
stack<pair<int,int>> Q;
int n;
int a[200020];
vector<int> V;
long long pow(int a,int pw){
if(pw==0) return 1;
long long ans=pow(a,pw/2);
if(ans==-1) return -1;
ans=ans*ans;
if(ans>=M) return -1;
if... | 1 | 99,196,276 |
#include<bits/stdc++.h>
#include<unordered_map>
using namespace std;
#define ll long long
#define all(x) (x).begin(),(x).end()
#define rep(i, n) for(ll i = 0; i < n; i++)
const ll INF = 100100100100;
ll combination(ll n, ll r){
if(n < r) return 0;
if(r == 0||r == n) return 1;
else if(r == 1) return n;
r... | #include <iostream>
int main() {
int A, B, C;
std::cin >> A >> B >> C;
std::cout << (A + B >= C ? "Yes" : "No") << std::endl;
return 0;
} | 1 | 40,461,334 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int k;
string s;
cin >> k >> s;
if (s.size() > k) {
s = s.substr(0,k).append(3,'.');
}
cout << s;
} | #include <iostream>
using namespace std;
int main()
{
long int K;
cin >> K;
string palabra;
cin >> palabra;
int lon= palabra.size();
if(lon>K){
for(int i=0; i<K; i++){
cout<<palabra[i];
}
cout<<"...";
}
else{
cout << palabra;
}
retu... | 1 | 83,442,115 |
#include<bits/stdc++.h>
#define endl '\n'
#define int long long
using namespace std;
int32_t main ()
{
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
int n;
cin>>n;
vector<int> v(n);
for(int i=0;i<n;i++){
cin>>v[i];
}
int money = 1000;
int best_sell=0;
int cant=0;
int best_item=INT_MAX;
for(int i=0... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin>>N;
int a[N+100];
for (int i=0;i<N;i++){
cin>>a[i];
}
long long money=1000;
for (int i=0;i<N-1;i++){
if (a[i]<a[i+1]){
money=a[i+1]*(money/a[i])+money%a[i];
}
}
cout<<money<<endl... | 1 | 62,169,867 |
#include<iostream>
#include<cmath>
#include<vector>
#include<algorithm>
#include<string.h>
#include<iomanip>
using namespace std;
#define PI 3.14159265358979323846264338327950L
int main() {
int N, K, d, A;
int l[100];
memset(l, 0x00, sizeof(l));
cin >> N >> K;
for (int ii = 0; ii < K; ii++) {
cin >> d;
for (in... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, start, end) for (int i = (start); i <= (int)(end); i++)
int main(){
int n,k;
cin >> n >> k;
vector<int> okasi(n);
rep(i,k){
int d;
cin >> d;
rep(j,d){
int a... | 1 | 26,475,468 |
#include <bits/stdc++.h>
#define ull unsigned long long int
#define ll long long
using namespace std;
ll solve(ll h, ll w)
{
ll res = h*w;
ll t_area = h*w;
for(ll i=1; i<w; i++)
{
ll a = i*h;
ll b = (w-i)*(h/2);
ll c = t_area - a - b;
ll tmp = max({a,b,c}) - min({a,b,c});... | #include <iostream>
#include <vector>
#include <algorithm>
#include <iterator>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <string>
#include <cmath>
using namespace std;
#define MOD 998244353
#define INF 1<<30
#define LINF (ll)1<<62
#define MAX 510000
#define rep(i,n) for(ll i=0; i<(n); i++... | 1 | 90,078,084 |
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <sstream>
#include <iostream>
#include <set>
#include <map>
#include <vector>
#include <math.h>
#include <stdlib.h>
typedef long double ld;
typedef long long ll;
using namespace std;
int n;
#define MAXN (1 << 12)
int lleft[3];
int rright[3];
int a[MAX... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
using ll = long long;
using v = vector<int>;
using P = pair<int,int>;
using vp = vector<P>;
using vvp = vector<vp>;
int main(){
int n;
string s;
cin>>n>>s;
ll r=0,g=0,b=0;
rep(i,n){
if(s[i]=='R')r++... | 1 | 12,600,331 |
#include<iostream>
using namespace std;
int main()
{
int m, f, r, sum;
while(1)
{
cin >> m >> f >> r;
if ( m == (-1) && f == (-1) && r == (-1) )break;
else{
sum = m + f;
if ( m != (-1) && f != (-1) && sum >= 80)cout... | #include<iostream>
using namespace std;
int main(){
int m,f,r;
char c;
while(1){
cin>>m>>f>>r;
if(m==-1&&f==-1&&r==-1)break;
if(m==-1||f==-1) c='F';
else if(m+f>=80) c='A';
else if(m+f>=65) c='B';
else if(m+f>=50||m+f>=30&&r>=50) c='C';
else if(m+f>=30) c='D';
else c='F';
... | 1 | 53,567,876 |
#include <iostream>
#include <string>
#include<algorithm>
using namespace std;
int main(){
string str;
int n;
cin>>str>>n;
string com;
for(int i=0;i<n;i++){
cin>>com;
if(com=="replace"){
string str1;
int a,b;
cin>>a>>b;
cin>>str1;
... | #include <iostream>
#include <cstdlib>
using namespace std;
void print(int a, int b, char str[]);
void rev(int a, int b, char str[]);
void rep(int a, int b, char str[], char repstr[]);
int main()
{
char str[1000];
int orderlen;
cin >> str;
cin >> orderlen;
cin.clear();
cin.ignore();
for(int i=0; i<orderlen; i++)... | 1 | 54,277,874 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
int main() {
string A, B;
cin >> A >> B;
if (A.size(... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define vll vector<ll>
#define vllv vector<vector<ll>>
#define sz size()
#define pb push_back
#define ff first
#define ss second
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
#define fast ios_base::sync_with_stdio(0); cin.tie(... | 1 | 97,328,427 |
#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <deque>
#include <queue>
#include <fstream>
#include <iomanip>
#include <stack>
#include <algorithm>
#include <set>
#include <map>
#include <list>
#define endl "\n"
typedef long long ll;
using namespace std;
void Lancer() { ios::sync_with... | #include <bits/stdc++.h>
using namespace std;
int main(){
string s; cin >> s;
int n = (int)s.length();
int ptr1 = 0;
int ptr2 = 2;
int ans = INT_MAX;
while(ptr2 < n){
int sum = (s[ptr1] - '0')*100 + (s[ptr1 + 1] - '0')*10 + (s[ptr2] - '0');
ans = min(abs(sum - 753),ans);
ptr1++; ptr2++;
}
c... | 1 | 56,052,541 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
int cnt = 0;
REP(i,n) {
cin >> h[i];
if (h[i] >= k) cnt++;
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long INF = 1LL<<60;
ll GCD(ll x,ll y){
if(y == 0) return x;
else return GCD(y,x%y);
}
ll LCM(ll a,ll b){
return a / GCD(a,b) * b;
}
const int MOD = 1000000007;
int main() {
int n,k; cin >> n >> k;
int ans = 0;
for(int... | 1 | 83,545,609 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef long double ld;
#define mp make_pair
#define f first
#define s second
#define pb push_back
const int N = 50 + 5;
const int M = 100 + 5;
const ll OO = 1e18;
const int mod = 1e9 + 7;
int n,k,v[N],dp[N][N][M];
int solve(in... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define ll int64_t
#define _GLIBCXX_DEBUG
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
vector< int64_t > divisor(int64_t n) {
vector< int64_t > ret;
for(int64_t i... | 1 | 41,984,415 |
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <queue>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cst... | #include <iostream>
#include <string>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <vector>
#include <cmath>
#include <cctype>
#define rep(i,a,b) for(int i=(a);i<b;i++)
#define INF 1000000000
using namespace std;
bool debug=false;
int main(){
int n;
cin>>n;
for(int i=0;i<n;i++){
... | 1 | 26,889,857 |
#include<iostream>
using namespace std;
int main()
{
char c[5];
cin>>c;
for(int i=0;i<3;i++)
{
if(c[i]=='1') cout<<9;
else if(c[i]=='9') cout<<1;
else cout<<c[i];
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string n;
cin >> n;
for (int i = 0; i < 3; i++) {
if (n[i]=='1') n[i]='9';
else n[i]='1';
}
cout << n << endl;
} | 1 | 22,956,250 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define ll int64_t
#define _GLIBCXX_DEBUG
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
vector< int64_t > divisor(int64_t n) {
vector< int64_t > ret;
for(int64_t i... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define INF 1145141919810893364
#define PI 3.141592653589
typedef pair<int,int> PP;
typedef long long ll;
#define int ll
#define setdouble setprecision
#define REP(i,n) for(int i=0;i<(n);++i)
#define OREP(i,n) for(int i=1;i<=(n);++i)
#define RREP(i,n)... | 1 | 56,702,343 |
#include<bits/stdc++.h>
#define ll long long int
#define vec vector<ll>
#define mat vector<vec>
using namespace std;
const ll mod=1000000007;
const ll inf=LONG_LONG_MAX;
ll dx4[4]={1,0,-1,0};
ll dy4[4]={0,-1,0,1};
ll dx8[8]={1,0,-1,1,-1,1,0,-1};
ll dy8[8]={1,1,1,0,0,-1,-1,-1};
int main(){
ll n;
cin >> n;
bo... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N; cin>>N;
for(int i=0;i<26;i++){
for(int j=0;j<16;j++){
if(i*4+j*7==N){cout<<"Yes"<<endl; return 0;}
}
}
cout<<"No"<<endl;
} | 1 | 87,987,185 |
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
using namespace std;
... | #include<bits/stdc++.h>
using namespace std;
const int N=1e6+7;
int n,l,t,k,cnt,w[N];
int main()
{
scanf("%d%d%d",&n,&l,&t);
for(int i=1;i<=n;i++) {scanf("%d%d",&w[i],&k),w[i]+=(k==1)?t:-t,cnt+=w[i]/l; if(w[i]%l<0) cnt--; ((w[i]%=l)+=l)%=l;}
sort(w+1,w+n+1),((cnt%=n)+=n)%=n; for(int i=cnt+1;i<=n;i++) printf... | 1 | 90,069,359 |
#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() {
char a, b;
cin >> a >> b;
char ans = 'D';
if (a == b) ans = 'H';
cout << ans << endl;
} | #include"bits/stdc++.h"
using namespace std;
int main() {
char a, b;
cin >> a >> b;
char judge = 'D';
if (a == b) {
judge = 'H';
}
cout << judge << endl;
return 0;
} | 1 | 49,725,880 |
#include<bits/stdc++.h>
using namespace std;
main(){
vector<int>v(5); for(int i=0; i<5; i++) cin>>v[i];
if((v[0]>=v[2]+v[4])&&(v[1]>=v[3]+v[4])&&(v[2]-v[4]>=0)&&(v[3]-v[4]>=0))cout<<"Yes";
else cout<<"No";
cout<<"\n";
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <cmath>
#include <string>
#include <sstream>
#include <iomanip>
#include <complex>
using namespace std;
#define ll long long
#define vvi vector< vector<int> >
#define vi vector<int>
#define All(X) X.begi... | 1 | 11,918,102 |
#include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#define vv(a, b, c, d) vector<vector<d> >(a, vector<d>(b, c))
#define vvi vector<vector<int> >
#define vvl vector<vector<l... | #include <iostream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <sstream>
#include <iomanip>
using namespace std;
typedef long long int ll;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define YES cout << "YES" << endl
#define Yes cout << "Yes" << endl
#defin... | 1 | 79,327,140 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
using ll = long long int;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vii = vector<pii>;
using vll = vector<pll>;
#define Scd(x) scanf("%d", &x)
#define Scd2(x,y) scanf("%d%d", &x, &y)
#de... | #include <cstring>
#include <cstdio>
#include <algorithm>
using namespace std;
typedef long long li;
int n;
int main(void) {
scanf("%d", &n);
li ans = 0, diff = 0;
int tmp = 2e9;
for (int i = 1, x, y; i <= n; ++i) {
scanf("%d%d", &x, &y);
diff += abs(x - y);
ans += x;
if (y < x) tmp = min(tmp, y... | 1 | 66,189,155 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
bool ask (ll x)
{
cout << "? " << x << endl;
char c;
cin >> c;
return c == 'Y';
}
int main()
{
ios_base::sync_with_stdio(0);
ll cp = 1;
while (ask (cp) && cp < 2e12)
{
cp *= 10;
}
if (cp > 1e12)
{
... | #include<iostream>
#include<cstdio>
using namespace std;
main()
{
char s[2];
int now,k=1;
for(now=1;now<=10;now++,k*=10)
{
printf("? %d\n",k);
fflush(stdout);
scanf("%s",s);
if(s[0]=='N')break;
}
now--;
if(now==10)
{
k=2;
for(now=1;now<=10;now++,k*=10)
{
printf("? %d\n",k);
fflush(stdout);
... | 1 | 89,000,468 |
#include <bits/stdc++.h>
#define rep(i,n)for(long long i=0;i<(long long)(n);++i)
#define all(a) a.begin(), a.end()
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T&... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s; cin >> s;
cout << (s == "AAA" || s == "BBB" ? "No" : "Yes") << endl;
} | 1 | 46,088,767 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string o,e; cin>>o>>e;
int i=0;
char c;
for(int i=0; i<o.length(); i++) {
if(e.length()>i) cout<<o[i]<<e[i];
else cout<<o[i];
}
} | #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"
... | 1 | 6,243,051 |
#include <iostream>
#define MAX 10001
using namespace std;
int main()
{
int A[MAX] = {};
int size, num;
cin >> size;
for (int i = 0; i<size; i++) {
cin >> num;
A[num]++;
}
for (int i = 0; i<size; i++) {
if (0<A[i]) {
cout << i;
A[i]--;
break;
}
}
for (int i = 0; i<MAX; i++) {
if (0<A[i]) {
... | #include <cstdio>
#include <iostream>
#include <cmath>
#include <ctype.h>
#include <string>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#include <set>
#include <iomanip>
using namespace std;
#define pi 3.14159265358... | 1 | 32,014,594 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < (n); i++)
#define REPS(i, n) for(int i = 1; i <= (n); i++)
#define RREP(i, n) for(int i = (n)-1; i >= 0; i--)
#define RREPS(i, n) for(int i = (n); i > 0; i--)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#de... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
string A, B;
cin >> A >> B;
int a = A.size();
int b = B.size();
if (a == b)
{
int now = a;
for(int i = 0; i < now; i++) {
if(A.at(i) > B.at(i)) {
a = 3;
b ... | 1 | 29,126,315 |
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<climits>
#include<iostream>
#include<algorithm>
#include<stack>
#include<queue>
#include<vector>
#include<list>
#include<map>
#include<set>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
#define pb push_back
int dy... | #include <cstdio>
#include <iostream>
#include <cmath>
#include <ctype.h>
#include <string>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#include <set>
using namespace std;
int main()
{
int n;
while(1){
... | 1 | 42,934,167 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = 1; i < (int)(n+1); i++)
int main() {
int a,b,c,d;
cin>>a>>b>>c>>d;
cout<<c-(d-b)<<" "<<d+(c-a)<<" "<<a-(d-b)<<" "<<b+(c-a)<<endl;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
ll euclidean_gcd(ll a, ll b) {
while(1) {
if(a < b) swap(a, b);
if(!b) break;
a %= b;
}
return a;
}
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
int x = c-a, y = d-b;
cou... | 1 | 41,837,274 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;
int main(void) {
int N, K;
cin >> N >> K;
vector<int> P(N);
for(int i=0; i<N; ++i)
cin >> P[i];
sort(P.begin(), P.end());
int ret = 0;
for(int i=0; i<K; ++i) {
ret += P[i];
... | #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() {
ll n,k;
cin >>... | 1 | 25,468,296 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve(long long N, long long K, std::vector<long long> p){
sort(p.begin(), p.end());
ll ans = 0;
for(ll i = 0; i < K; ++i) ans = ans + p[i];
cout << ans << endl;
return;
}
int main(){
long long N;
scanf("%lld",&N);
... | #include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main(){
int n,k;
cin>>n>>k;
vector<int>a(n);
for(int i=0;i<n;i++)cin>>a[i];
sort(a.begin(),a.end());
int tmp=0;
for(int i=0;i<k;i++){
tmp+=a[i];
}
cout<<tmp<<endl;
return 0;
} | 1 | 49,944,626 |
#include "bits/stdc++.h"
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define FOR(i, a) for (auto &i : a)
#define ALL(obj) begin(obj), end(obj)
#define MAX(x) *max_element(ALL(... | #include<stdio.h>
int main(){
char arr[30];
scanf("%s",arr);
arr[5] = ' ';
arr[13] = ' ';
printf("%s",arr);
return 0;
} | 1 | 9,189,021 |
#include<bits/stdc++.h>
using namespace std;
const long long MOD=1000000007;
long long a[100100],b[100100];
main()
{
long long n,m;
long long suma=0;
long long sumb=0;
long long ans=0;
scanf("%lld %lld",&n,&m);
for(long long i=0;i<n;i++)
scanf("%lld",&a[i]);
for(long long i=0;i<m;i++... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, ll> pil;
typedef pair<int, ll> pli;
typedef pair<double,double> pdd;
#define SQ(i) ((i)*(i))
#define MEM(a, b) memset(a, (b), sizeof(a))
#define SZ(i) int(i.size())
#define FOR(i, ... | 1 | 54,380,462 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
void solve() {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int W, H, N;
vector<int> x, y, a;
cin >> W >> H >> N;
int width = W;
int height = H;
int maxW_l=0, maxW_u=0;
int maxH_l=0, maxH_u=0;
for(int i=0; i<N; i++){
int s1,s2,s3;
cin >> s1 >> s2 >> s3;
x.push_back... | 1 | 92,586,774 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, Y;
cin >> N >> Y;
for (int i=0; i<N+1; i++) {
for (int j=0; j<N-i+1; j++) {
if (10000*i+5000*j+1000*(N-i-j)==Y) {
cout << i << " " << j << " " << N-i-j << endl;
exit... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i,N) for(int i = 0; i < (N); i++)
#define erep(i,N) for(int i = N; i >= 0; i--)
const ll INF = 1000000000000000000;
#define PI 3.1415926535
using Graph = vector<vector<int>>;
template<class T> inline bool chmin(T& a, ... | 1 | 63,745,536 |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int n, ans = 0;
string s;
cin >> n >> s;
for (int i = 0; i < 1000; ++i) {
int ieei[3] = {i / 100, i / 10 % 10, i % 10};
int idx = 0;
for (int j = 0; j < s... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#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(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL... | 1 | 79,696,496 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
using namespace std;
int main(void){
int n;
cin >> n;
vector<int> t(n);
vector<bool> dt(n, false);
vector<int> a(n);
vector<bool> da(n, false);
dt[0] = true;
da[n-1] = true;
for(int i=0; i<n; i++){
... | #include "bits/stdc++.h"
using namespace std;
#define rep(i,n) for(int i=0;i<n;++i)
typedef long long ll;
typedef vector<ll> vll;
ll mod = 1e9+7;
int main() {
ll n;cin >> n;
vll a(n), t(n);
rep(i,n) cin>>a[i];
rep(i,n) cin>>t[i];
vll x(n,-1);
if(a[n-1] != t[0]) {
puts("0");
return 0;
}
x[0]=a[0]... | 1 | 99,676,785 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
const int INF=0x3f3f3f3f,N=2e5+5;
int n,k;
int a[N],b[N];
void op()
{
int i;
for(i=1;i<=n;i++)
b[i]=0;
for(i=1;i<=n;i++)
{
int l=max(1,i-a[i])... | #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... | 1 | 49,376,157 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e16;
const ll mod = 1000000007;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int main() {
ll x, y, z; cin >> x >> y >> z;
ll k; cin >> k;
vector <ll> a(x), b(y), c(z);
rep(i, x) cin >> a.at(i);
rep(i, y) cin >> b.at(i);
... | #include <bits/stdc++.h>
using namespace std;
#define sz(x) int(x.size())
#define pii pair<int, int>
#define Task "abc"
#define For(i, a, b) for(int i = (a), _b = (b); i <= b; ++i)
#define Debug(X) cout << #X << " = " << X << '\n'
#define All(x) (x).begin(), (x).end()
#define mp make_pair
typedef unsigned long long ull... | 1 | 80,794,210 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.