code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<bitset>
#include<cctype>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<functional>
#include<limits>
#include<list>
#include<map>
#include<set>
#include<stack>
#include<string>
#include<sstream>
#include<queue>
#include<vector>
using namespa... | #include <bits/stdc++.h>
using namespace std;
int main() {
int h,w;
cin >> h >> w;
vector<vector<char>> c(h,vector<char>(w));
for ( int i = 0; i < h; i++){
for ( int j = 0; j < w; j++){
cin >> c[i][j];
}
}
for ( int i = 0; i < h; i++){
int k = 0;
while(k < 2){
for ( int j = 0; j ... | 0 | 61,420,692 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> a(n), b(n), p(n);
for(int i=0; i<n; i++){
cin >> p[i];
p[i] -= 1;
a[p[i]] += i;
a[i] += (n+1) * (i+1);
b[i] += (n+1) * (n-i);
}
for(int i=0; i<n; i++){
cout << a... | #include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cassert>
#include <stack>
#include <limits>
#include <array>
#include <unordered_map>
#include <unordered_set>
#include <memory>
#include <numeric>
constexpr long long mod = static_cast<long long>(1e... | 0 | 34,082,343 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define FORR(i, a, b) for (int i = b - 1; i >= a; --i)
#define SORT(v) sort(v.begin(), v.end())
#define SORTR(v) sort(v.rbegin(), v.rend())
#define ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i<(int)(n); i++)
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
template<class T> inline bool chmin(T& a, T b){if (a>b){a = b; return true;}return false;}
template<class T> inline bool chmax(T& a, T b){if (a<b){a = b; return true;}r... | 0 | 35,477,122 |
#include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <functional>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
#include <b... | #include <bits/stdc++.h>
using namespace std;
int main(){
int H,W; cin >> H >> W;
vector<vector<char>> s(H,vector<char>(W));
int dw[4] ={1,0,-1,0};
int dh[4] ={0,1,0,-1};
bool can = true;
for(int h=0; h<H; h++){
for(int w=0; w<W; w++){
cin >> s.at(h).at(w);
}
}
... | 0 | 92,539,686 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, N, x;
cin >> N >> A;
if(A >= (N % 500)){
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
} | #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 | 58,640,530 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using pii=pair<ll,ll>;
#define For(i,a,b) for(ll i=a;i<=b;i++)
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define sz(x) ((ll)x.size())
#define MOD (ll)(1e9+7)
#define INF (9e18)
#define EPS (1e-6)
#ifdef LOCAL_TEST
#define debug(..... | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef priority_queue<int> PQ_DESC;
typedef priority_queue<int, vector<int>, greater<int>> PQ_AS... | 0 | 76,834,037 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, n) for(int i = 0; i < n; i++)
#define REP(i, a, b) for(int i = a; i <= b; i++)
#define all(x) x.begin(), x.end()
#define fi first
#define se second
#define debug(...) cerr<<__LINE__<<... | #ifndef TEMPLATE_HPP
#define TEMPLATE_HPP
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <... | 0 | 38,880,607 |
#include <bits/stdc++.h>
using namespace std;
#define LOG(...) fprintf(stderr, __VA_ARGS__)
#define FOR(i, a, b) for(int i=(int)(a); i<(int)(b); ++i)
#define REP(i, n) for(int i=0; i<(int)(n); ++i)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define EXIST(s, e) ((s).find(e)!=(s).end()... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using ii = pair<int, int>;
using vii = vector<ii>;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define sz(x) (int)(x).size()
#define eb emplace_back
#define pb push_back
#def... | 0 | 16,020,950 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
using namespace std;
#define FOR(I,A,B) for(int I = (A); I < (B); ++... | #include<stdio.h>
#include<ctype.h>
#define P(c) putchar(c)
int F(char*s)
{
int r=0,a;
for(;*s;++s)
{
if(isdigit(*s))a=*s++-'0';
else a=1;
if(*s=='m')r+=a*1000;
if(*s=='c')r+=a*100;
if(*s=='x')r+=a*10;
if(*s=='i')r+=a;
}
return r;
}
int main()
{
int n,a,k,i;
char s[9],u[9],x[]="mcxi";
scanf("%d",&n)... | 0 | 93,693,623 |
#include <bits/stdc++.h>
#include <vector>
# include <cstdint>
#define FOR(i,l,r) for(int i=(l);i<(r);++i)
#define RFOR(i,l,r) for(int i=(l);i>=(int)(r);i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,n-1,0)
#define int long long
using namespace std;
const int MX = 1e6;
const int inf = 1e9;
const int mod =... | #include<iostream>
#include<vector>
int main(){
int H,W;
std::cin>>H>>W;
std::vector<bool>map(H*W);
for(int i=0;i<H;++i){
for(int j=0;j<W;++j){
char buf;
std::cin>>buf;
if(buf=='.'){
map[i*W+j]=0;
}else{
map[i*W+j]=1... | 0 | 17,875,388 |
#include<iostream>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<utility>
#include<algorithm>
#include<cstdio>
#include<iomanip>
#include<queue>
#include<stack>
#define ll int64_t
#define Rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
const ll inf = 1LL << 62;
template<class T> inlin... | #include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <map>
#include <set>
#include <vector>
#include <iostream>
#include <algorithm>
#include <string>
#include <iomanip>
#include <assert.h>
#include <math.h>
#include <stack>
#include <queue>
#include <list>
using namespace std;
#ifdef __DEBUG__
bool debu... | 0 | 66,149,664 |
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
typedef unsigned int ui;
#define forn(i, n) for (int i = 1; i <= n; i++)
#define pb push_back
#define all(x) x.begin(), x.end()
#define y1 qewr1234
const double PI = acos(-1.0);
const int DIR = 4;
const int X[] = {1, 0, -1, 0};
const int Y[] = {0, 1... | #include <bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
using namespace std;
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#ifdef LOCAL
#endif
string s;
cin >> s;
int cnt = 0;
for (char x : s) cnt += (x == 'R');
if (cnt == 2 && s[1] == 'S') cnt--;
cout << cnt << '\n';
... | 0 | 43,553,663 |
#include<iostream>
using namespace std;
int main()
{
int n,t,tt,ts,te,i,res=0;
cin >> n >> t;
cin >> ts;
te=ts+t;
for(i=1;i<n;i++){
cin >> tt;
if(tt>te){
res+=te-ts;
ts=tt;
}
te=tt+t;
}
res+=te-ts;
cout << res << endl;
return 0;
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <string>
#include <iomanip>
#include <map>
#include <set>
#include <cmath>
#include <cstdio>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define FOR(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
#define ... | 0 | 37,571,149 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <map>
#include <iomanip>
#include <deque>
#include <set>
#include <climits>
#include <memory>
#include <numeric>
#include <utility>
#define rep(i,a,b) for(int i=a;i<b;++i)
#define rrep(i,a,b... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<long long> vll;
typedef vector<pair<int,int>> vpi;
typedef vector<pair<long long, long long>> vpl;
typedef pair<int,int> pii;
typedef pair<long long, long long> pll;
#define INF (int)(1e9)
#define MAXX 1.1529215e+18
#define inf 999999
#d... | 0 | 17,329,836 |
#include <bits/stdc++.h>
using namespace std;
int main(){
map<char,int> S;
for(int i=0;i<4;i++){
char c;
cin>>c;
S[c]++;
}
for(pair<char,int> i:S)
if(i.second!=2){
cout<<"No"<<endl;
return 0;
}
cout<<"Yes"<<endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (rint i = 1; i <= (n); i ++)
#define re0(i, n) for (rint i = 0; i < (int) n; i ++)
#define travel(i, u) for (rint i = head[u]; i; i = e[i].nxt)
#define rint register int
using namespace std;
typedef long long lo;
template<typename tp> inline void read(tp &x) {
x = 0; c... | 0 | 41,319,649 |
#include<iostream>
using namespace std;
int main(){
int A, B, X;
cin >> A >> B >> X;
if (A <= X && X <= A+B){
cout << "YES" << endl;
}
else{
cout << "NO" << endl;
}
return 0;
} | #include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define pb push_back
#define x first
#define y second
#define mk(a,b) make_pair(a,b)
#define rr return 0
#define sqr(a) ((a)*(a))
#define all(a) (a).begin(), (a).end()
#define... | 0 | 25,964,061 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
int main(){
map<int, int> ball;
int n,k,a; cin>>n>>k;
rep(i,n){
cin>>a;
ball[a]++;
}
if(ball.size()<=k){
cout << 0 << endl;
return 0;
}
vector<int> count;
for(auto... | #include <bits/stdc++.h>
using namespace std;
int main(){
int H, W;
cin >> H >> W;
vector<vector<char>> S(H + 2, vector<char>(W + 2, '#'));
for (int i = 1; i <= H; i++){
for (int j = 1; j <= W; j++){
cin >> S[i][j];
}
}
vector<vector<int>> R(H + 2, vector<int>(W + 2, 0));
for (int i = 0; i <... | 0 | 68,780,589 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef pair<ll, P> PP;
static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const ll INF = 1023456789;
#define REP(i,n) for(int i=0;i<n;++i)
#define REPR(i,n) for(int ... | #include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
const ll LINF = 10010... | 0 | 19,189,137 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
int i;
cin>>s;
int x=0,y=0;
for(i=0;s[i]!='\0';i++){
if(s[i]=='A')
x++;
if(s[i]=='B')
y++;
}
if(x==3 || y==3)
cout<<"No"<<endl;
else
{
cout<<"Yes"<<endl;
}
} | #include<bits/stdc++.h>
using namespace std;
int main(){
cin.tie(0);
ios_base::sync_with_stdio(false);
int n,k;
cin>>n>>k;
int a[200005];
int b[200005];
for(int i=0;i<n;i++){
cin>>a[i];
b[i]=0;
}
b[n]=0;
int d=min(50,k);
for(int j=0;j<d;j++){
for(int i=0;i<n;i++){
int l=max(0,i-a[i]... | 0 | 15,668,584 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S, T;
cin >> S >> T;
for (int i = 0; i < S.size(); i++) {
cout << S.at(i);
if (i < T.size()) cout << T.at(i);
}
cout << "\n";
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(int i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = ve... | 0 | 33,479,532 |
#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
constexpr int MOD = 100000... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i,s,n) for(int i=s;i<n;i++)
#define MOD 1000000007
#define NUM 2520
#define INF (1LL<<50)
#define DEBUG 0
#define mp(a,b) make_pair(a,b)
#define SORT(V) sort(V.begin(),V.end())
#define PI (3.141592653589794)
struct edge{
lli to,cost... | 0 | 57,789,352 |
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int N;
cin >> N;
int t[N+1];
int x[N+1];
int y[N+1];
t[0] = x[0] = y[0] = 0;
for(int i = 0; i < N; i++) {
cin >> t[i+1] >> x[i+1] >> y[i+1];
}
bool flag = true;
for(int i = 0; i < N; i++){
i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int64_t i=0; i<(int64_t)(n); i++)
#define all(v) v.begin(), v.end()
int main(){
int n, k;cin >> n >> k;
vector<vector<int>> a(51, vector<int>(n));
rep(i, n) cin >> a[0][i];
rep(i, k){
vector<int> memo(n+1);
rep(j, n){
... | 0 | 1,277,622 |
#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define sz(a) (a).size()
#define all(c) (c).begin(),(c).end()
#define rep(i,n) for(int i=0;i<n;i++)
#define forn(i,n) for(int i=1;i<=n;i++)
#define ford(i,n) for(int i=n;i>=0;i--)
#define REP(i,a,n) for(int i=a;i<n;i+... | #include <bits/stdc++.h>
#include <iostream>
#include <unordered_map>
#include <unordered_set>
#define pb push_back
#define mpr make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ll long long
#define ld long double
#define fi first
#define se second
#define all(arr) arr.begin(), arr.end()
#define rep... | 0 | 33,876,842 |
#include <stdio.h>
int main(void){
int W,H,x,y,r;
scanf("%d%d%d%d%d",&W,&H,&x,&y,&r);
printf(r>x||W<x+r||r>y||H<y+r?"No\n":"Yes\n");
return 0;
} | #include "bits/stdc++.h"
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int m,nmin,nmax;
while(cin>>m>>nmin>>nmax,m||nmin||nmax){
vector<int> p(m);
nmin--;nmax--;
for(int i=0;i<m;i++) cin>>p[i];
sort(p.rbegin(),p.rend());
int res=0,gap=0;
... | 0 | 83,462,769 |
#include <iostream>
using namespace std;
int main(void) {
int a, b, x;
cin >> a >> b >> x;
string ans;
if (x < a) {
ans = "NO";
} else {
if ((a+b) < x) {
ans = "NO";
} else {
if (b < (x-a)) {
ans = "NO";
} else {
... | #include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cmath>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <sstream>
#include <string>
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define ... | 0 | 60,941,068 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100005;
const int maxd = 10;
int n, cnt;
int a[maxn], b[maxn];
long long h, w;
long long ans[maxd];
map < int, map < int, bool > > point;
signed main () {
scanf("%lld %lld %d", &h, &w, &n);
for (int i = 1; i <= n; ++i) {
scanf("%d %d", &a[i], &b[i]);
... | #include<iostream>
#include<vector>
#include<limits>
#include<array>
using namespace std;
typedef long ll;
int main() {
ll n;
cin >> n;
vector<array<ll, 3>> nums(n);
for(auto&e:nums) {
for(auto&a:e)
cin >> a;
}
vector<array<ll, 3>> dp(n);
dp[0][0] = nums[0][0];
dp[0]... | 0 | 61,686,153 |
#include <bits/stdc++.h>
using namespace std;
void my_dbg() { cout << endl; }
template<typename Arg, typename... Args> void my_dbg(Arg A, Args... B) { cout << ' ' << A; my_dbg(B...); }
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", my_dbg(__VA_ARGS__)
#define scn(n) scanf("%d", &n)
#define lscn(n) scanf("%lld",... | #include <algorithm>
#include <bitset>
#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;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define reps(i, f, ... | 0 | 20,397,538 |
#include <cstdio>
#include <algorithm>
long long cnt(long long a, long long b)
{
long long ans = a * b;
for (int i = 1; i < a; ++i)
{
long long top = i * b;
long long left = (a - i) * (b / 2);
long long right = a * b - top - left;
long long dif = std::max(top, std::max(left, right)) - std::min(top... | #include <iostream>
#include <cstdio>
#include <cstdlib>
using namespace std;
char a[10],b[10];
int ia,ib;
int n;
int ta,tb;
char ans[10];
void transa(){
ia = 0;
for(int i = ta-1 ; i >= 0 ; i--){
if(a[i] == 'i'){
if(i == 0) ia += 1;
else{
if( atoi(&a[i-1]) != 0 ){
ia += atoi(&a[i-1]);
}else{
... | 0 | 96,975,351 |
#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 H, N;
cin >> H >> N;
vector<int> A(N);
rep(i, N) {
cin ... | #include <iostream>
#include <algorithm>
using namespace std;
int main(){
while(1){
int n;
cin >> n;
if(n==0){
break;
}
int a[1000];
for(int i=0; i<n; i++){
cin >> a[i];
}
sort(a,a+n);
int ans=10000000;
... | 0 | 61,493,896 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long S, C;
cin >> S >> C;
long s = S;
long c = C / 2;
long tmp = min(s, c);
long ans = 0;
ans += tmp;
S -= tmp;
C -= tmp * 2;
if (C <= 1) return cout << ans << "\n", 0;
ans += C / 4;
cout << ans << "\n";
} | #include <iostream>
#include <string>
#include <array>
#include <algorithm>
#include <vector>
#include <string>
#include <set>
#include <cctype>
#include <map>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <ctype.h>
#include <queue>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC o... | 0 | 12,499,710 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int D;
cin >> D;
string e,s;
e =" Eve";
s ="Christmas";
if(D == 25)cout << s <<endl;
if(D == 24)cout << s << e <<endl;
if(D == 23)cout << s << e << e <<endl;
if(D == 22)cout << s << e << e << e <<endl;
} | #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <algorithm>
#include <cstdio>
#include <iomanip>
#include <queue>
#include <deque>
#include <stack>
#include <fstream>
#include <cmath>
#include <random>
#include <complex>
#include <functional>
#define ll ... | 0 | 69,703,705 |
#include "bits/stdc++.h"
#include "math.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<int> vin;
typedef pair<ll,ll> P;
typedef vector<P> vp;
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
#define drep(i,a,b) fo... | #include <iostream>
using namespace std;
void search(int x, int y);
int w, h;
char maze[22][22];
bool reached[22][22];
int ans;
int main() {
while(cin >> w >> h) {
if(w == 0 && h == 0) return 0;
for(int k = 0; k < h; k++) {
for(int l = 0; l < w; l++) {
maze[k][l] = '#';
reached[k][l] = ... | 0 | 37,353,135 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using st = string;
using P = pair<int, int>;
#define rep(i, n) for(int i = 0; i < n; i++)
#define chmax(x, y) { x = max(x, y); }
#define chmin(x, y) { x = min(x, y); }
int main() {
int h, w, k;
cin >> h >> w >> k;
vector<st> s(h);
rep(i... | #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 { \... | 0 | 21,837,651 |
#include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define put(i) cout<<fixed<<i<<endl
using namespace std;
using ll = long long;
int main(){
ll l, r; cin >> l >> r;
ll ans = 1e18;
if(r - l >= 2019){
put(0);
return 0;
}
l %= 2019;
r %= 2019;
if(r <= ... | #include <iostream>
#include <stdio.h>
#define MIN_N 1
#define MAX_N 100
#define MIN_A 0
#define MAX_A 100
using namespace std;
int selection_sort(int a[], int n) {
int minj, swapped = 0;
for(int i=0; i<n; i++) {
minj = i;
for(int j=i; j<n; j++) {
if (a[j] < a[minj]) {
... | 0 | 10,299,269 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<cassert>
#include<iterator>
#include<complex>
#in... | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <cstdio>
#include <cstdint>
#include <iostream>
#include <algorithm>
using namespace std;
int_fast8_t d;
uint_fast32_t M = 0;
uint_fast64_t c, sd = -1, sc = -1;
constexpr uint_fast32_t buff_size = 1 << 2... | 0 | 96,778,123 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define P 1000000007
#define inf 1e18
int main()
{
ll i, n;
string s;
cin >> s;
n = s.length();
for (i = s.length() % 2 == 0 ? 2 : 1; i < n; i = i + 2)
{
string t;
for (ll j = 0; j < n - i; j++)
t ... | #include <iostream>
#include <set>
#include <initializer_list>
using namespace std;
int main()
{
string s;
set<char> right = {'y', 'u', 'i', 'o', 'p', 'h', 'j', 'k', 'l', 'n', 'm'};
while (cin >> s, s!="#") {
int lastr = right.count(s[0]);
int count = 0;
for (char c: s) {
... | 0 | 25,823,658 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c,d,ans;
while(cin >> a >> b >> c >> d){
ans = 0;
ans+=min(a,b);
ans+=min(c,d);
cout << ans << endl;
}
} | #include<bits/stdc++.h>
#define int long long
#define fi first
#define si second
#define mp make_pair
#define ... | 0 | 92,731,213 |
#include <iostream>
using namespace std;
int main() {
cin.tie(0); ios::sync_with_stdio(false);
int H, W;
while (true) {
cin >> H >> W;
if (H == 0 & W == 0)return 0;
for (int i = 0;i < H;i++) {
for (int j = 0; j < W;j++) {
if (i == 0 | i == H - 1) { cout << "#"; continue; }
if (j == 0 | j == W - 1) {... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(n) begin(n),end(n)
using ll = long long;
using P = pair<int,int>;
int main() {
string s;
int n, k;
cin >> n >> k;
cin >> s;
int now = 1;
int cnt = 0;
vector<int> nums;
rep(i,n) {
i... | 0 | 5,214,653 |
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define SZ(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define allr(a) a.rbegin(), a.rend()
#define sf(a) scanf("%d",&a)
#define sff(a,b) scanf("%d %d",&a,&b)
#de... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
constexpr ld EPS = 1e-12;
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr int MOD = 1e9 + 7;
template <typename T>
void printv(const vector<T> &v) {
int sz = v.size();
for (int i = 0; ... | 0 | 50,310,751 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
int n,m,i;
cin >> n >> m;
vector<int> a(m),b(m),x(n,0);
for(i=0;i<m;i++){
cin >> a.at(i) >> b.at(i);
if(a.at(i)==1){
x.at(b.at(i))++;
}
if(b.at(i)==n){
x.at(a.at(i))++;
}
}
for(i=2;i<=n-1;i++){
... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1005;
int X[maxn], Y[maxn];
char s[32];
int iabs (int x) {
return x >= 0 ? x : -x;
}
int main () {
int n, c = 0;
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> X[i] >> Y[i];
if ((X[i] + Y[i]) & 1) ++c;
else --c;
... | 0 | 54,264,810 |
#include <iostream>
using namespace std;
int main(){
string s;
int i;
cin>>s;
string t;
for(i=0;i<s.size();i=2+i){
t=t+s[i];
}
cout<<t<<endl;
} | #include <bits/stdc++.h>
#define INF 1e9
using namespace std;
#define REPR(i,n) for(int i=(n); i >= 0; --i)
#define FOR(i, m, n) for(int i = (m); i < (n); ++i)
#define REP(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define ALL(a) (a).begin(),(a).end()
#define endl "\n"
template<class T>bool chmin(T &a, const T &b... | 0 | 11,964,233 |
#include<bits/stdc++.h>
using namespace std;
string s, t;
int main(){
cin >> s >> t;
int answer = 0;
for(int i = 0; i < s.size(); i++)
answer += s[i] != t[i];
cout << answer << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb(x) push_back(x)
#define f(i,st,n) for(i=st;i<n;i++)
#define vec vector
#define mst(a,b) memset(a,b,sizeof(a))
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set... | 0 | 22,241,449 |
#include<iostream>
#include<algorithm>
using namespace std;
int a[200000];
int n,l,s,maxn;
int main(){
while(true){
maxn=-100000000;
s=0;
cin>>n>>l;
if(n==0 && l==0){break;}
for(int i=0;i<n;i++){
cin>>a[i];
if(i<l){s+=a[i];}
}
maxn=s;
... | #include <bits/stdc++.h>
using namespace std;
using str = string;
using ss = stringstream;
int main()
{
cin.tie(0);
ios::sync_with_stdio(0);
int n;
str s,t;
cin>>n>>s>>t;
int ans=2*n;
for(int i=n;i>0;i--)
{
bool c=true;
for(int j=0;j<i;j++)if(t[j]!=s[j+n-i]){c=false;break... | 0 | 6,894,154 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int A;
cin >> A;
int B;
cin >> B;
double C;
C = 2 * B - A;
cout << C << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define PVAR(x) (cout << #x"=" << x << endl)
void test_case() {
int n;
cin >> n;
vector<int> A(n);
int ma = 0;
for (int &a : A) {
cin >> a;
ma = max(ma, a);
}
vector<int> pfs(ma + 1);
int pcount = 0;
iota(pfs.begin(), pfs.end(), 0);
for (int i = ... | 0 | 55,083,425 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
int a,b;
bool B = true;
bool B2 = true;
int cnt = 0;
vector<int> x(n); vector<int> y(n);
for(int i=0;i<n;i++)cin >> x[i];
for(int i=0;i<n;i++)cin >> y[i];
vector<int> v(n);
for(int i=0;i<n;i++)v[i] = i+1;
... | #include <iostream>
#include <vector>
using namespace std;
int main()
{
int ChangeNum;
int WordNum;
char BeforWord;
char AfterWord;
char Word;
vector< pair< char, char > > vecpChangePair;
vector< pair< char, char > > :: iterator pIt;
vector< pair< char, bool > > vecpString;
vector< pair< char, bool > > :: it... | 0 | 34,791,401 |
#pragma GCC optimize ("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse4")
#include"bits/stdc++.h"
using namespace std;
typedef long long ll;
#define int ll
#define sz(x) (int)(x).size();
#define all(x) x.begin(), x.end()
#define trav(i,a) for(auto &i:a)
inline int in(){int x;scanf("%lld",&x);return x... | #include<iostream>
#include<iomanip>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<numeric>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
using ll = long long;
using... | 0 | 74,387,305 |
#include<iostream>
#include<stdio.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include <cassert>
#include <cmath>
#include<cstdint>
#define INF 1e9
#define re... | #include<bits/stdc++.h>
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define ll long long
#define pii pair<int,int>
#define all(x) begin(x), end(x)
#define loop(i,n) for(int i=0; i<n; i++)
#define rep(i,a,b,c) for(int i=a; i<b; i+=c)
#define brep(i,a,b,c) for(int i=a; i>b; i-=c)
#defi... | 0 | 87,247,971 |
#include <bits/stdc++.h>
#define debug(x) cerr << #x << ": " << x << endl
#define debugArray(x, n) \
for (long long hoge = 0; (hoge) < (n); ++(hoge)) \
cerr << #x << "[" << hoge << "]: " << x[hoge] << endl
using namespace std;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define INF 9223372036854775806
#define pb push_back
#define mp make_pair
#define MOD 1000000007
#define PI 2*acos(0.0)
#define EPS 1e-9
ll max(ll a,ll b) {if(a>b) return a; else return b;}
ll min(ll a,ll b) {if(a<b) ret... | 0 | 4,194,793 |
#include<bits/stdc++.h>
using namespace std;
#define inf 1e9
#define ll long long
#define M 1000000007
#define P pair<int,int>
#define FOR(i,m,n) for(int i=m;i<n;i++)
#define rep(i,n) FOR(i,0,n)
const int vx[4] = {0,1,0,-1};
const int vy[4] = {1,0,-1,0};
#define PI 3.14159265
int n;
int sum;
int main(){
cin>>n;
fo... | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)n; ++i)
#define repr(i, n) for (ll i = n - 1; i >= 0; --i)
const int MOD = 1000000007;
const ll INF = 10000000000;
using namespace std;
void solve(void)
{
int n;
cin >> n;
vector<ll> a(n), b(n);
rep(i, n) cin >> a[i]... | 0 | 62,345,918 |
#include <bits/stdc++.h>
#define debug(...) fprintf(stderr, __VA_ARGS__)
#ifndef AT_HOME
#define getchar() IO::myGetchar()
#define putchar(x) IO::myPutchar(x)
#endif
namespace IO {
static const int IN_BUF = 1 << 23, OUT_BUF = 1 << 23;
inline char myGetchar() {
static char buf[IN_BUF], *ps = buf, *pt = buf;
if (ps... | #include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
using namespace std;
typedef long long LL;
const int MX=200011;
int n;
LL a[MX];
struct Edge{int t,nxt;Edge(int _t=0,int _nxt=0):t(_t),nxt(_nxt){}}e[MX];
int hed[MX],ec,D[MX];
inline void ade(int f,int t... | 0 | 34,833,046 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <cstring>
#include <functional>
#include <iostream>
#include <iomanip>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define fix(n) cout<<... | #include<bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,int> pli;
const int inf=1e9;
const ll Inf=1e18;
const int N=1e5+10;
ll gi() {
ll x=0,o=1;char ch=getchar();
while((ch<'0'||ch... | 0 | 75,122,404 |
#include <iostream>
#include <vector>
#include <limits.h>
#include <algorithm>
#include <string>
#include <math.h>
#include <limits.h>
#include <queue>
#include <map>
#include <set>
#include <iomanip>
#include <bitset>
#include <cassert>
#include <random>
#include <functional>
#include <stack>
#include <iomanip>
#inclu... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
int main(void) {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<ll> hen;
map<ll, ll> mp;
for(a... | 0 | 40,655,889 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std; typedef long long ll; const ll INF=1e18;
typedef pair<int,int> P;
int main() {
int n,m; cin>>n>>m;
ll l[m], r[m], d[m];
for(int i=0;i<m;i++) cin>>l[i]>>r[i]>>d[i];
for(int i=0;i<m;i++) l[i]--,r[i]--;
bool able[m];... | #include <iostream>
#include <vector>
using namespace std;
int main(void){
int n,m,x;
cin >> n >> m >> x;
vector<vector<int>> a(n,vector<int>(m));
vector<int> c(n);
for(int i = 0;i < n;i++){
cin >> c[i];
for(int j = 0;j < m;j++){
cin >> a[i][j];
}
}
... | 0 | 43,640,391 |
#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... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using st = string;
using P = pair<int, int>;
#define mrep(i, m, n) for(int i = m; i < n; i++)
#define rep(i, n) mrep(i, 0, n)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
const int mod = 1e9 + 7;
int main() {
int n;
cin >... | 0 | 27,758,918 |
#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() {
ll n,t;cin>>n>>t;
vector<ll> vec(n);
rep(i,n)cin>>vec[i];
int ans=t;
rep(i,n-1){
ans+=min(t,vec[i+1]-vec[i]);
}
cout<<ans<<endl;
} | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#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<ll> A(N+1), B(N);
rep(i,N+1) cin >> A... | 0 | 47,438,984 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
int q;
ll a, b;
scanf("%d", &q);
for(int i=0; i<q; i++) {
scanf("%lld%lld", &a, &b);
ll x = a*b;
ll r = (ll)sqrt(x);
ll ans = r*2 - 1;
if(r * (r+1) >= x) ans--;
if(r * r =... | #include <cstdio>
#include <vector>
#include <algorithm>
#include <queue>
#include <utility>
using namespace std;
template <class T>
using lp_queue=priority_queue<T, deque<T>, greater<T>>;
using Weight=long long;
static const Weight INF=1LL<<57;
struct Edge {
size_t src, dst;
Weight weight;
Edge() {}
Ed... | 0 | 17,050,806 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long X, Y;
cin >> X >> Y;
int ans = 1;
while (X * 2 <= Y) X *= 2, ans++;
cout << ans << "\n";
} | #pragma region header
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define int long long
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (... | 0 | 63,685,208 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
ll n, a, b, res;
int main() {
cin >> n;
vector<ll> s(n);
REP(i, n) {
cin >> a >> b;
s[i] = a + b;
res -= b;
}
sort(s.rbegin(), s.rend());
REP(i, n) res += s[i++];
cout << res << '\n';
return... | #include<bits/stdc++.h>
using namespace std;
typedef bool boo;
typedef int li;
typedef long il;
typedef unsigned long ul;
typedef long long int ll;
typedef unsigned long long ull;
typedef double dd;
typedef string ... | 0 | 54,533,189 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const double PI = 3.14159265358979323846;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
bool flag = false;
if(abs(a-c)<=d) flag = true;
else if(abs(a-b)<=d && abs(b-c)<=d) flag = tru... | #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... | 0 | 25,181,327 |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P... | #include<bits/stdc++.h>
using namespace std;
#define lli long long
#define all(i) i.begin(),i.end()
#define rall(i) i.rbegin(),i.rend()
#define rep0(i,j) for(int i=0;i<j;i++)
#define rep1(i,j) for(int i=1;i<=j;i++)
#define rep0d(i,j) for(int i=j-1;i>=0;i--)
#define MOD 1000000007
#define MAX (lli)1e12
typedef pair<lli... | 0 | 60,562,524 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <vector>
#include <algorithm>
using namespace std;
struct Event {
int time, type;
Event(int type, int time): type(type), time(time){;}
bool operator<(const Event &rhs) const {
if (time == rhs.time)
return type < rhs.typ... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define endl '\n'
#define pb push_back
const int N=1e5+1;
const int INF=1e9+7;
int32_t main()
{
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n,m; cin>>n>>m;
char A[n][m];
for(int i=0;i<n;i++)
{
for(int j=0... | 0 | 24,775,740 |
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using P = pair<int, int>;
using vec = vector<int>;
using mat = vector<vector<int>>;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
constexpr int MOD = 1000000007;
const int INF = 1 << 30;
int m... | #include <bits/stdc++.h>
using namespace std;
void solve(){
string s, ans;
cin >> s;
for(char c : s){
if(c == '0')
ans += "0";
else if(c == '1')
ans += "1";
else if(!ans.empty()) ans.pop_back();
}
cout << ans << "\n";
}
int main(){
ios_base::sync_w... | 0 | 13,323,493 |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <string>
#include <iomanip>
#include <limits>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <list>
#include <queue>
#include <tuple>
#include <deque>
#include <algorithm>
#include <numeric>
... | #include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
int main() {
ll N;
cin>>N;
vector<ll> X(N);
ll ans=10000000000;
for(ll i=0;i<N;i++) {
cin>>X[i];
}
sort(all(X));
for(ll i=X[0];i<=X[N-1];i++) {
ll count=0;
for(ll j=0;j<N;j++) {
count+=abs(i-X[j])*ab... | 0 | 21,616,566 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<(ll)n;++i)
using P = pair<ll,ll>;
const ll dv = 1000000007;
vector<ll> dy = {1,0,-1,0};
vector<ll> dx = {0,1,0,-1};
int main(){
ll h,w;cin >> h >> w;
vector<string> a(h);
rep(i,h) cin >> a.at(i);
vector<vector<ll>> ... | #include <stdio.h>
#include<string.h>
int main() {
int k;
char s[105];
scanf("%d\n %s", &k, s);
int len = strlen(s);
if (strlen(s)>k) {
s[k]='.';
s[k+1]='.';
s[k+2]='.';
s[k+3]='\0';
}
printf("%s", s);
return 0;
} | 0 | 13,639,268 |
#include<iostream>
#include<iomanip>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<string>
#include<utility>
#include<numeric>
#include<algorithm>
#include<cmath>
#include<climits>
using namespace std;
using ll = long long;
class Stream{
public:
Stream(){
}
void read(... | #include <bits/stdc++.h>
using namespace std;
int main() {
long w,h,o,t,ans=0;
cin >> w >> h;
o=h+1;
t=w+1;
vector<pair<long,long>> pq(w+h,{0,0});
for(long i=0;i<w;i++) {
cin >> pq[i].first;
pq[i].second=1;
}
for(long i=0;i<h;i++) {
cin >> pq[w+i].first;
pq[w+i].second=2;
}
sort(pq.b... | 0 | 25,582,807 |
#include <iostream>
#include <iomanip>
#include <math.h>
using namespace std;
struct point { double x,y;};
void koch(int n,point a,point b){
if(n == 0) return;
point s,t,u;
double th = M_PI * 60.0 / 180.0;
s.x = (2.0 * a.x + 1.0 * b.x) / 3.0;
s.y = (2.0 * a.y + 1.0 * b.y) / 3.0;
t.x = (1.0 * a.x... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
const int mod=1000000007,MAX=100001,INF=1<<30;
int main(){
int N;cin>>N;
int j=-1;
for(int i=1;i<=1000;i++){
if(i*(i+1)/2==N) j=i;
}
if(j==-1) cout<<"No"<<endl;
else{
cout<<"Y... | 0 | 31,263,407 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
bool check=false;
int num=s.length();
for(int i=0; i<num; i++){
for(int j=i+1; j<num; j++){
if(s.at(i)==s.at(j)){
check=true;
}
}
}
if(check) cout << "no" << ... | #include <bits/stdc++.h>
const int INF=1e9;
const int MOD=1e9+7;
const long long LINF=1e18;
using namespace std;
#define int long long
int c[3000][3000];
typedef pair<int,int> P;
std::vector<P> num(2000000,P(0,0));
int wa[3000][3000];
int d;
P grd,gld,brd,bld,ord,old,rrd,rld,rt,rb,gt,gb,ot,ob,bb,bt;
int po=0;
void draw... | 0 | 20,626,264 |
#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++)
using namespace std;
typedef long long ll;
int sum_(ll i){
ll sum = 0;
while(i > 0){
sum += i % 10;
i /= ... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i<(n); i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
typedef long long ll;
int N, K;
vector<ll> a;
bool need(int x) {
if (a[x] >= K) return true;
vector<bool> dp(K);
dp[0] = true;
rep(i, N) {
... | 0 | 87,458,962 |
#include<bits/stdc++.h>
using namespace std ;
int main()
{
int score[2] = {0} ;
int cmp = 0 ;
for (int i = 0 ; i < 2 ; i++ )
{
for ( int j = 0 ; j < 4 ; j++ )
{
cin >> cmp ;
score[i] += cmp ;
}
}
if ( score[0] >= score[1] )
{
cout << sc... | #include<bits/stdc++.h>
#include<ctype.h>
# define pb push_back
#define fst first
#define sec second
#define For(i,a,b) for(int i=a;i<b;i++)
#define ll long long int
#define ull unsigned long long int
#define mod 1000000007
#define fo(i,n) for(ll i=0;i<n;i++)
#define endl "\n"
#define rev(i,n) for(ll i=n-1;i>=0;i--)
#d... | 0 | 7,693,874 |
#include <cmath>
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll inf = 1000000007;
int main() {
string s;
cin >> s;
ll zerocount = 0;
ll onecount = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '1') {
onecount++;
}
else {
zerocount++;
... | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
templ... | 0 | 98,619,270 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n); for(int i = 0;i<n;++i)
using ll = long long;
using P = pair<int,int>;
int main(){
string s;
cin >> s;
bool flag = false;
if(s == "a") flag = true;
if(s == "i") flag = true;
if(s == "u") flag = true;
if(s == "e") flag = true;
if(s == "o") fl... | #include <bits/stdc++.h>
using namespace std;
int main() {
uint64_t N, C, K;
cin >> N >> C >> K;
vector<uint64_t> T(N);
for (uint64_t& t : T) {
cin >> t;
}
sort(T.begin(), T.end());
uint64_t num_buses = 0;
uint64_t time_limit = T[0] + K;
uint64_t num_people = 0;
for (uint... | 0 | 60,721,889 |
#include<bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
int chk = n / 111;
if (n % 111) ++chk;
cout << (chk * 111) << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = (ll)1e9 + 7;
template< typename T >
T mod_pow(T x, T n, const T &p) {
T ret = 1;
while(n > 0) {
if(n & 1) (ret *= x) %= p;
(x *= x) %= p;
n >>= 1;
}
return ret;
}
int main() {
int n;
cin >>... | 0 | 13,548,680 |
#include <bits/stdc++.h>
using namespace std;
const long long int MAX = 1e18;
int main() {
int n = 0;
cin >> n;
long long int a,ans = 1;
bool over = false;
for(int i = 0; i < n; i++){
cin >> a;
if(a == 0){
ans = 0;
break;
}
if (over) continue;
if(a <= MAX/ans){
ans *= a;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define pb push_back
const int N = 300005, M = 1000000007;
ll a[N], cnt[66];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%lld", &a[i]);
for (ll j = 0; (1LL << ... | 0 | 34,402,666 |
#include <algorithm>
#include <iostream>
#include <string>
#include <random>
#include <cassert>
#include <cstring>
#include <chrono>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
int main()
{
int n;
cin >> n;
vector<ll> a(n), b(n);
for (int i = 0; i < n; ++i) cin >> a[i];
for (int i... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define FastIO ios_base::sync_with_stdio(0);cin.tie(0),cout.tie(0)
#define pb push_back
#define mp make_pair
#define mem(x,i) memset(x,i,sizeof(x))
#define ff... | 0 | 21,877,064 |
#include <iostream>
using namespace std;
int main()
{
int k,s;
int i,j,z=0,count=0;
cin>>k>>s;
for( i=0;i<=k;i++){
for( j=0;j<=k;j++){
z=s-i-j;
if(i>=0 && j>=0 && z>=0 && z<=k)
count+=1;
}
}
cout<<count;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using ll = long long;
using namespace std;
const int INF = 1e9;
int main() {
string s, t;
cin >> s >> t;
vector<vector<int>> dp(s.size() + 1, vector<int>(t.size() + 1));
for (int i = 1; i <= s.size(); i++)
dp[i][0] = i;
f... | 0 | 96,258,363 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
#define all(x) (x).begin(),(x).end()
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
template<class T>bool chmin(T &a, const T &b) ... | #include <iostream>
#include <algorithm>
#include <vector>
typedef int TInt;
typedef std::vector<TInt> TList;
TList Input()
{
int Count;
std::cin >> Count;
TList List(Count);
for(int i = 0; i < Count; ++i){
std::cin >> List[i];
}
return List;
}
TInt SelectionSort(TList& List)
{
typed... | 0 | 65,941,827 |
#include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL (-1)
#define LL long long
using namespace std;
const int64_t MOD = 1e9 + 7;
const int INF = INT_MAX;
int main() {
int N;
cin >> N;
vector<string> v;
for (int i = 0; i < N; i++) {
string w;
cin >> w;
if (!i) {
v.push_back(w);
continue;
}
i... | #include <bits/stdc++.h>
#include <chrono>
#define fr first
#define sc second
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
const ll md = 1000000007;
ll ad(ll a, ll b) {
return (a%md + b%md + md) % md;
}
ll ml(ll a, ll b) {
return ( (a%md) * (b%md) ) % md;
}
ll pw(ll ... | 0 | 89,631,231 |
#include <stdio.h>
int main() {
int n,k;
scanf("%d %d", &n, &k);
int more = 1;
while (more < k && n > 0){
more *= 2;
n--;
}
for(int i = 0; i < n; i++){
more += k;
}
printf("%d\n", more);
return 0;
} | #include <bits/stdc++.h>
#define mod 1000000007
#define INF 1001001001
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define rep1(i,n) REP(i,1,n+1)
using namespace std;
int main() {
... | 0 | 49,135,544 |
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using L64 = int64_t;
inline vector<pair<L64, int>> prime_factorize(L64 N) {
vector<pair<L64, int>> res;
for (int a = 2; a * a <= N; ++a) {
if (N... | #include<string>
#include<vector>
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<sstream>
#include<functional>
#include<map>
#include<set>
#include<cmath>
#define REP(i,s,e) for(int i=int(s);i<int(e);i++)
#define rep(i,n) for(int i=0;i<int(n);i++)
#define EPS 1e-6
using namespace std... | 0 | 48,825,727 |
#include<iostream>
using namespace std;
typedef pair<int, int> pii;
pii dxdy[]={{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
char fld[21][21];
bool used[20][20];
int W, H;
int rec(int i, int j){
if(fld[i][j]=='#') return 0;
if(used[i][j]) return 0;
used[i][j]=true;
int ret=0;
for(pii dd: dxdy){
int ni=i+dd.f... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pf printf
#define pi acos(-1.0)
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define pb push_back
#define mp make_pair
#define sz(v) ((int)(v).size())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) ... | 0 | 41,144,350 |
#include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef vector<lint> vlint;
#define inf 1e+9
#define endl "\n"
#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 rep_rev(i, n) for (int i = n-1; i >= 0; --i)
#define all(x) (x).begin(),... | #include <bits/stdc++.h>
using namespace std;
void solve(){
string s;
cin>>s;
bool a = s[0] == 'R';
bool b = s[1] == 'R';
bool c = s[2] == 'R';
if(a && b && c){
cout<<3<<endl;
}
else if((a && b ) || (b && c)){
cout<<2<<endl;
}
else if(a || b || c)
{
cout<<1<<endl;
}
else{
cout<<0<<endl;
}
}
... | 0 | 75,765,802 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s;
int sum =0;
cin>>s;
int len = s.length();
for ( int i =0; i<len; i++ )
sum = sum + (int)s[i] - (int)'0';
if (sum%9==0)
cout<<"Yes";
else
{
cout<<"No";
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
typedef vector < vector<ll> > Mat;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;... | 0 | 82,751,915 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
const ll MOD=1000000007;
int main(void){
cin.tie(0);
ios::sync_with_stdio(0);
int n,m,k;
cin>>n>>m>>k;
for(int i=0;i<=n;i++){
for(int j=0;j<=m;j++){
if((n-i)*j+i*(m-j)==k){
... | #include<cstdio>
#include<vector>
#include<queue>
#include<utility>
#define INF (1<<30)
using namespace std;
int dx[4]={0,1,0,-1};
int dy[4]={1,0,-1,0};
int h,w,n;
bool canmove(int x,int y){
return (0 <= x && x < w && 0 <= y && y < h);
}
int main(){
scanf("%d %d %d",&h,&w,&n);
(void)getchar();
vector<int> dat... | 0 | 21,228,410 |
#include <iostream>
#include <math.h>
#include <algorithm>
#include <string>
#include <map>
#include <vector>
using namespace std;
void b_strings_with_the_same_length(void) {
int n;
string s, t;
cin >> n >> s >> t;
for (int i = 0; i < n; i++) {
cout << s[i] << t[i];
}
cout << endl;
}
int main()
{
b_strings_... | #include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
using namespace std;
template <class It> string join(It i1, It i2)
{
ostringstream ss;
for (auto it = i1; it != i2; ++it)
ss << ((it == i1) ? "" : ", ") << (*... | 0 | 88,351,973 |
#include <algorithm>
#include <array>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#include <cassert>
#define rep(i, n) for (int i = 0; i < (int)(n); ++... | #include<bits/stdc++.h>
typedef long long ll;
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define last freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define fr first
#define sc second
#define lcm(a,b) (a*b)/__gcd(a,b)
#d... | 0 | 45,118,759 |
#include <iostream>
using namespace std;
double V[51];
void swap (double *x, double *y) {
double temp;
temp = *x;
*x = *y;
*y = temp;
}
void bubble_sort (double array[], int array_size) {
int i, j;
for (i = 0; i < array_size - 1; i++){
for (j = array_size - 1; j >= i + 1; j--){
if (array[j] < arra... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD (long long)(1e9+7)
#define INF (1LL<<60)
#define rep(i,n) for(ll i = 0; i < (n); i++)
#define rep1(i,n) for(ll i = 1; i <= (n); i++)
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return fa... | 0 | 61,112,884 |
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define rep(i, n) FOR(i, 0, n - 1)
using namespace std;
typedef long long ll;
template <class T> inline bool dpmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool dpmax(T &a, T b) {
if ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int64_t i=0; i<(int64_t)(n); i++)
#define all(v) v.begin(), v.end()
int main(){
int N, M; cin >> N >> M;
if(N%2==1){
int x=1, y=N-1;
rep(i, M){
cout << x << " " << y << endl;
x++;
y--;
... | 0 | 60,112,501 |
#include <bits/stdc++.h>
#define rep0(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i <= (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef tuple<string, int, int> TU;
typedef tuple<int, int, int> TI;
int main()
{
ll n;
cin >> n;
int input[n-1];
... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
unsigned long long res;
if(N&1){
res = N-1;
res >>= 1;
res *= N;
}else{
res = N;
res >>= 1;
res *= N-1;
}
cout << res << endl;
return 0;
} | 0 | 34,285,005 |
#include<cstdio>
#include<vector>
using namespace std;
inline int read()
{
int x = 0, f = 1; char ch = getchar();
for (; ch < '0' || ch > '9'; ch = getchar()) if (ch == '-') f = -1;
for (; ch >= '0' && ch <= '9'; ch = getchar()) x = (x << 1) + (x << 3) + ch - '0';
return x * f;
}
const int N = 2e5 + 5;
vector<int>... | #include<iostream>
using namespace std;
#define REP(i,m,n) for(int i=(int)m ; i < (int) n ; ++i )
#define rep(i,n) REP(i,0,n)
typedef long long ll;
const ll longinf=1LL<<60 ;
ll dist(ll x,ll y){
return abs(x)+abs(y);
}
bool odd,even;
int main(){
string s="RLUD";
int n;cin>>n;
ll x[n],y[n];
rep(i,n){... | 0 | 50,775,330 |
#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() {
string S;
cin >> S;
string T = "keyence";
int samebegin = 0;
int sameend = 0;
rep(i,T.size()) {
if (S.at(i) != T.at(i)) break;
... | #include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for... | 0 | 84,165,038 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b,x;
string op;
cin>>a>>op>>b;
if(op=="+")
{x=a+b;}
else {
x=a-b;
}
cout<<x<<endl;} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int,int> P;
constexpr int INF = 2e9+1;
int main(){
int n, l, q;
cin >> n;
vector<int> x(n);
rep(i,n) cin >> x[i];
cin >> l >> q;
vector<vector<int>> to(23... | 0 | 14,994,136 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
vector<int> x(n);
int ans=1000000000;
for(int i=0; i<n; i++)
{
cin >> x.at(i);
}
sort(x.begin(), x.end());
for(int i=x.at(0); i<=x.at(x.size()-1); i++)
{
int tmp=0;
for(int j=0; j<n; j++)
{
tmp+=(x.at(j... | #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()
#define endl "\n"
using ll = long long;
using P = pair<int,int>;
using mp = map<int,int>;
const int MOD = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NUL... | 0 | 89,502,147 |
#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 X, Y;
cin >> X >> Y;
bool bl = (X * 2 <= Y && X * 4 >= ... | #include<iostream>
#include<algorithm>
#include<string>
#include<cmath>
#include<vector>
#include<map>
using namespace std;
int main() {
int A, B, C;
int x = 0;
cin >> A >> B >> C;
if(A%2 == B%2 && C%2 != B%2) {
A++;
B++;
x++;
}
else if(A%2 == C%2 && B%2 != C%2) {
... | 0 | 99,983,636 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <limits>
using namespace std;
typedef long long LL;
using Graph = vector<vec... | #include <iostream>
using namespace std;
int a,b,n,tx,ty;
int stp[16][16];
int check(int x,int y){
int ret=0;
if (x==a-1&&y==b-1) return 1;
if (!stp[x+1][y]&&x+1<a) ret += check(x+1,y);
if (!stp[x][y+1]&&y+1<b) ret += check(x,y+1);
return ret;
}
int main(){
while (1){
cin >> a >> b;
if (a==0&&b=... | 0 | 13,276,734 |
#include <bits/stdc++.h>
#define int long long
#define ALL(v) (v).begin(),(v).end()
#define Vi vector<int>
#define pb push_back
#define rep(i,a,b) for(int i=a;i<b;i++)
#define repr(i,a,b) for(int i=a;i>b;i--)
#define leng(n) (int)(log10(n)+1)
#define INF 9000000000000000000
#define MOD 1000000007
using namespace std;
i... | #include <stdio.h>
#define N 101
int main() {
int n,i,k,l,j,u,a[N][N],v[N];
scanf("%d",&n);
for(i=1;i<=n;i++) {
for(j=1;j<=n;j++){
a[i][j] = 0;
}
}
for(i=0;i<n;i++){
scanf("%d",&u);
scanf("%d",&k);
while(k>0){
scanf("%d",&l);
a[u][l] = 1;
k--;
}
}
for(i=1;i<... | 0 | 57,781,491 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
ll n,k;
cin>>n>>k;
ll vec[110000]={};
for(int i=0;i<n;i++){
int a,b;
cin>>a>>b;
vec[a]+=b;
}
ll sum=0;
for(int i=0;i<110000;i++){
sum+=vec[i];
if(sum>=k){
cout<<i<<endl;
return 0;
}
}
} | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#d... | 0 | 28,726,377 |
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <vector>
#include <utility>
#include <complex>
using namespace std;
using Arrow = complex<long long>;
class Solution {
public:
long double engines(vector<Arrow>& arrows) {
const int n = arrows.size();
sort(arrows.begin(), arrows.end(), [](const a... | #include <bits/stdc++.h>
using namespace std;
#define PI 4*atan(1)
#define INF 2 * 1e9
typedef long long ll;
int dx[4] = {1,0,-1,0};
int dy[4] = {0,1,0,-1};
int main(){
int V, E;
cin >> V >> E;
vector<vector<int>> d(V, vector<int>(V, INF));
for(int i = 0; i < V; i++)d[i][i] = 0;
for(int i = 0; i < E; i++){
... | 0 | 91,731,276 |
#include <time.h>
#include <stdlib.h>
#include <cstdint>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <limits>
#include <cstdint>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <limits>
#include <vector>
#include <map>
#include <s... | #include <bits/stdc++.h>
using namespace std;
#define range(i, l, r) for (int i = (int)(l); i < (int)(r); ++(i))
#define rrange(i, l, r) for (int i = (int)(r) - 1; i >= (int)(l); --(i))
#define whole(f, x, ...) ([&](decltype((x)) container) { return (f)( begin(container), end(container), ## __VA_ARGS__); })(x)
#def... | 0 | 80,963,553 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
ll n, d, a;
cin >> n >> d >> a;
vector < pair < ll, ll > > v;
for(int i = 0; i < n; i++){
ll x, h;
cin >> x >> h;
v.push_back({x, (h + a - 1) / a});
}
... | #include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rrep(i, n) for(int i = 0; i <= (n); i++)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
const ll INF = 1LL<<60;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } retur... | 0 | 13,616,434 |
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
using P = pair<int,int>;
int main()
{
... | #include<iostream>
#include <string>
using namespace std;
int main(){
int N, M, flg=0;
cin >> N >> M;
string A[N], B[N];
for (int i = 0; i < N; i++){
cin >> A[i];
}
for (int i = 0; i < M; i++){
cin >> B[i];
}
for (int i = 0; i < N - M + 1; i++){
for (int j = 0; j < N - M + 1; j++){
for... | 0 | 6,070,985 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.