code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 2 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
int X;
cin >> X;
int A = 0;
for(int i = 0; i < X; i++) {
int l, r;
cin >> l >> r;
A += 1;
A += r;
A -= l;
}
cout << A << endl;
} | #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <cstring>
#include <algorithm>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
const double pi = acos(-1);
typedef long long ll;
int main()
{
ll a,b,c,d;
cin>... | 0 | 39,634,733 |
#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;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
const ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18);
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes c... | 0 | 100,602,474 |
#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;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
const ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define INF 1e12
#define PB push_back
#define PF push_front
#define fi first
#define se second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vpi vector<pii>
#define vll vector<ll>
#define vpl... | 0 | 81,424,591 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
cin.tie(0);
ios::sync_with_stdio(0);
int x1,y1,x2,y2;
cin>>x1>>y1>>x2>>y2;
int x3,y3,x4,y4;
int len=0;
int dx=x2-x1;
int dy=y2-y1;
x3=x2-dy;
y3=y2+dx;
x4=x3-dx;
y4=y3-dy;
printf("%d %d %d %d",x3,y3,x4,y4);
... | #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>
#include <cctype>
#de... | 0 | 26,535,423 |
#include <iostream>
#include <algorithm>
#include <string>
#include <set>
#include <regex>
#include <locale>
#include <iomanip>
using namespace std;
using ll = long long;
#define OVERLOAD3(_1,_2,_3,name,...) name
#define REP(i,n) REPI(i,0,n)
#define REPI(i,a,b) for(int i=int(a),i##_Len=int(b);i<i##_Len;++i)
#define rep... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(int i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(int i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(int i = (n) - 1; i >= (e); i--)
#d... | 0 | 19,385,960 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using pl = pair<ll,ll>;
using pi = pair<int,int>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n)... | #include<bits/stdc++.h>
using namespace std;
long calc(long n,vector<long>&dp,long mod){
if(n<3)return 0;
if(dp[n]!=0)return dp[n];
for(int i=3;i<=n;i++){
if(n!=i)dp[n] += calc(n-i,dp,mod);
else dp[n]++;
dp[n] %= mod;
}
dp[n]%=mod;
return dp[n];
}
int main(){
long s;
... | 0 | 84,902,009 |
#include<bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <string>
#include <set>
using namespace std;
int a,b,x;
int main()
{
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>a>>b>>x;
if(x<a||x>=(a+b))cout<<"NO\n";
else
cout<<"YES\n";
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c,k;
cin>>a>>b>>c>>k;
while(b<=a)
{
b*=2;
k--;
}
while(c<=b)
{
c*=2;
k--;
}
if(k<0)cout<<"No";
else cout<<"Yes";
} | 0 | 86,573,131 |
#include <bits/stdc++.h>
#include <vector>
#define rep(i, n) for(int i = 0; i < n; ++i)
#define ll long long
using namespace std;
int main() {
int mod = 1000000007;
int s;
cin >> s;
vector<int> dp(s+1, 0);
dp[0] = 1;
for(int i = 3; i <= s; ++i) {
for(int j = 0; j <= i-3; ++j) {
... | #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() {
ll n, h;
cin >> n >> h;
vector<ll> a(n);
vector<ll> b(n);
rep(i,n) {
cin >> a[i] >> b[i];
}
sort(a.begin(), a.end(), greater<ll>());
sort(b.begin()... | 0 | 65,209,462 |
#include<bits/stdc++.h>
#define ll long long int
#define vec vector<ll>
#define mat vector<vec>
using namespace std;
const ll mod=1000000007;
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 K,S; cin>>K>>S;
ll cnt=0;
for(ll i=K; i>=0; i--)... | #pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
constexpr char newl = '\n';
constexpr double eps =... | 0 | 75,155,911 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n; cin >>n;
int dai=0;
int shou=INT_MAX;
for(int i=0;i<n;i++){
int x;
cin>>x;
dai=max(dai,x);
shou=min(shou,x);
}
cout<<dai-shou<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, N) for (int i = 0; i < (int)N; i++)
#define FORIN(i, a, b) for (int i = a; i < (int)b; i++)
#define ALL(x) (x).begin(), (x).end()
#define MOD 1000000007
#define INF (1 << 29)
#define LLINF (1LL << 60)
#define DEBUG(...) debug(__LINE__, ":" __VA_ARGS__)
using ... | 0 | 97,676,096 |
#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;
struct edge {
int to;
int weight;
edge(int t, int w) : to(t), weight(w) { }
};
using Graph = vector<vector<int>>;
using dou =long double;
string Yes="Yes";
string YES="YES";
string NO="NO";
string No="No";
template<class T> inline bool chmax(T& a, T b) { i... | 0 | 45,297,612 |
#include <stdio.h>
#define MAX 26
int main(void)
{
char c;
while ((c=getchar()) != '\n') {
if ((c>='A') && (c<='Z')) {
c += ' ';
}
else if ((c>='a') && (c<='z')) {
c -= ' ';
}
else {
;
}
printf("%c",c);
}
printf("\n");
return 0;
} | #include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
typedef long long ll;
#define FAST ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define mp make_pair
#define pb push_back
#define lp(i,s,f) for(ll i = s; i < ll(f); i++)
#define inF freopen("input.in", "r", stdin);
#define outF freopen("outp... | 0 | 62,253,766 |
#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using P = pair<lint, lint>;
#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... | #include<bits/stdc++.h>
using namespace std;
int main(void){
while(true){
int n=0, min = 10000000, dif=0, score[1010];
cin >> n;
if(n==0) break;
for(int i=0;i<n;++i) cin >> score[i];
for(int i=0;i<n;++i){
for(int j=i+1;j<n;++j){
int dif = abs(score... | 0 | 81,480,990 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<n; i++)
#define PI 3.14159265359
#define INF 1000100100
#define MOD 1000000007
#define all(x) (x).begin(),(x).end()
typedef long long ll;
#define P pair<int, int>
#define PP pair<P,P>
#define T tuple<int,int,int>
using namespace std;
int main(){
string s; ci... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define per(i, n) for (int i = (int)(n-1); i >= 0; i--)
#define sz(x) int(x.size())
#define all(x) (x).begin(), (x).end()
#define INF 2e9
#define LINF 1e18
template<class T> inline bool chmax(T &a, const T &b) { if (a < b... | 0 | 14,008,843 |
#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;
int n = s.size();
int num = 753;
int ans = 1e9;
rep(i, n - 2)
{
int x = 0;
rep(j, 3)
{
... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x... | 0 | 33,333,775 |
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unorder... | #include <iostream>
using namespace std;
int main() {
string stra;
int x;
bool r=false;
cin >> stra;
for(int i=97;i<=122;i++){
if(stra.find((char)i)==-1){
cout << (char)i << endl;
r=true;
break;
}
}
if(r==false){
cout << "None" << e... | 0 | 72,801,531 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void){
int n, m, total = 0, ok = 0;
cin >> n >> m;
vector<int> a(n);
for(int i = 0; i < n; i++) cin >> a[i];
for(int i = 0; i < n; i++) total += a[i];
for(int i = 0; i < n; i++){
if(4*a[i]*m >= total) ok++;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define FastIO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie... | 0 | 96,406,360 |
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define REP(i, n) for (LL i = 0; i < (LL)(n); i++)
#define REP2(i, n) for (LL i = 1; i <= (LL)(n); i++)
#define FOR(i, m, n) for (LL i = m; i < n; i++)
#define SORT(x) sort(x.begin(), x.end())
#define REVE(x) reverse(x.begin(), x.end())
#define ALL(x) ... | #include <bits/stdc++.h>
using namespace std;
using pll=pair<long long,long long>;
const long double pi=atan2l(0,-1);
int N;
pair<long long,long long> operator+(pair<long long,long long> &a,pair<long long,long long> &b) {
return make_pair(a.first+b.first,a.second+b.second);
}
int main() {
cin >> N;
vector<pll> A(... | 0 | 49,482,431 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<set>
#include<map>
#include<queue>
#include<cmath>
#define REP(i,a) for (int i = 0;i < (a);++i)
#define FOR(i,a,b) for (int i = (a);i < (b); ++i)
#define FORR(i,a,b) for (int i = (a);i >= (b); --i)
#define ALL(obj) (obj).begin(),(obj).end... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i = 0;i < n;++i)
#define all(v) v.begin(), v.end()
using ll = long long;
int main()
{
ll i,j;
ll n;
cin >> n;
vector<pair<ll,ll>> a(n);
for(i = 0;i < n;++i){
cin >> a.at(i).first;
a.at(i).second = i;
}
sort(al... | 0 | 6,658,660 |
#include<bits/stdc++.h>
using namespace std;
struct point{
double x, y;
};
void koch(int n, point p1, point p2){
point p3, p4, p5;
double rad60=M_PI*60.0/180.0;
if(n==0) return;
p3.x=(2.0*p1.x+p2.x)/3.0;
p3.y=(2.0*p1.y+p2.y)/3.0;
p4.x=(p1.x+2.0*p2.x)/3.0;
p4.y=(p1.y+2.0*p2.y)/3.0;
p5.x=(p4.x-p3.x)*co... | #include<iostream>
#include<string>
#include<algorithm>
#include<list>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<numeric>
#include<vector>
#include<cstdio>
#include<climits>
#include<cfloat>
#include<cstring>
#define rforeach(t,p) for(t::reverse_iterator it=p.rbegin();it!=p.rend();++it)
#defi... | 0 | 19,132,604 |
#include <bits/stdc++.h>
#define PI 3.141592653
#define rep(i,a,n) for(int i=a;i<(int)n;++i)
#define SZ(x) ((int)(x).size())
#define descSort(a) sort(a.begin(),a.end(),std::greater<int>())
using namespace std;
typedef long long ll;
const ll INF = 1e9 + 7;
ll gcd(ll x,ll y){
if(x%y==0)return y;
return gcd(y,x%y... | #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++)
typedef int64_t Int;
int N;
vector<int> A(200010);
int main(){
cin >> N;
rep(i,N) cin >> A[i];
int l = 0, r = 0; Int ans = 0;
bitset<22> bit(A[0]);
... | 0 | 9,771,340 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long x, y;
cin >> x >> y;
if(x % y == 0){
cout << -1 << endl;
return 0;
}
long long k = 1;
while(1){
long long ans = k * x;
if(ans % y == 0){
k++;
continue;
}
cout << ans << endl;
return 0;
}
} | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(long long i = 0; i < (n); ++i)
#define ll long long
#define P pair<ll,ll>
#define all(v) (v).begin(),(v).end()
const ll mod = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1.0);
int main(void)
{
ll a, b;
cin >> a >> ... | 0 | 61,600,545 |
#include <bits/stdc++.h>
#include <algorithm>
#include <queue>
using namespace std;
int main() {
int N;
cin >> N;
int T[110] = {};
int V[110] = {};
int S[110] = {};
for(int i = 1; i <= N; i++){
cin >> T[i];
S[i] = S[i-1] + T[i] * 2;
}
for(int i = 1; i <= N; i++){
cin >> V[i];
}
int A[40010] = {};... | #include<bits/stdc++.h>
using namespace std;
int main() {
int N, K; cin >> N >> K;
vector<int> A(N);
for (auto& a: A) cin >> a;
for (int i = 0; i < K; i++) {
vector<int> B(N+1);
for (int j = 0; j < N; j++) {
B[max(j - A[j], 0)]++;
B[min(j + A[j] + 1, N)]--;
}
for (int j = 1; j <= N; ... | 0 | 38,754 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N, A;
int chk;
cin >> N >> A;
chk = N % 500;
if(chk == 0){
cout << "Yes" << endl;
}else if((A - chk) > 0){
cout << "Yes" << endl;
}else {
cout << "No" << endl;
}
} | #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>
#include <cctype>
#in... | 0 | 12,809,856 |
#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 (ll i = 0; i < (ll)(n); i++)
#define repi(i, n) for (ll i = 1; i < (ll)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x)... | #if !defined(__clang__) && defined(__GNUC__)
#include <bits/stdc++.h>
#else
#include <cstdlib>
#include <climits>
#include <iostream>
#include <cstdint>
#include <vector>
#include <string>
#include <complex>
#include <bitset>
#include <queue>
#include <deque>
#include <stack>
#include <utility>
#include <set>
#include ... | 0 | 91,283,797 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
vector<vector<int>> v(n, vector<int>(4, 0));
for (int i = 0; i < n; ++i)
cin >> v[i][1] >> v[i][2] >> v[i][3];
int dp[n][4];
memset(dp, -1, sizeof dp);
function<int(int, int)> calc_dp = [&] (int i, int j) ... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define printl(s) cout << s << endl;
#define rep(i,n) for(int i=0;i<(n);i++)
using ll = long long;
using vvi = vector<vector<int>>;
using pii = pair<int,int>;
const ll modSeed = pow(10,9) + 7;
const int INF = 1'000'000'000;
template <typename T>
vecto... | 0 | 48,607,434 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define F first
#define S second
#define FOR(i,a,b) for(int (i)=(a);(i)<(b);(i)++)
#define rep(i,n) FOR(i,0,n)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define ve vector
#define vi vector<int>
#d... | #include<iostream>
#include <math.h>
using namespace std;
struct Vector2D{
double x;
double y;
};
#define Vertex2D Vector2D
Vector2D sub_vector(const Vector2D& a, const Vector2D& b)
{
Vector2D ret;
ret.x = a.x - b.x;
ret.y = a.y - b.y;
return ret;
}
int hittest_point_polygon_2d(Vertex2D A, Verte... | 0 | 99,418,415 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
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) { if (b<a) { a=b; return 1; } return 0; }
int main() {
i... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
string s;
cin >> s;
int pt1 = 0;
int pt2 = 0;
rep(i, s.size()) {
if(i % 2 == 0) {
if(s.at(i) == '0') pt1++;
if(s.at(i) == '1') pt2++;
... | 0 | 37,369,789 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
using M = map<int, int>;
int main()
{
int n, m;
cin >> n;
m = n + 1;
int a[m], b[n];
rep(i, m) cin >> a... | #include <bits/stdc++.h>
using namespace std;
int main(){
long long int N, norma = 0, ans = 0, ans2 = 0;
cin >> N;
vector<int> A(N), B(N), sabun(N);
for (int i = 0; i < N; i++){
cin >> A.at(i);
}
for (int i = 0; i < N; i++){
cin >> B.at(i);
}
for (int i = 0; i < N; i++){
sabun.at(i) = B.at(i... | 0 | 86,667,655 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAX_N = 5e6+10;
string s;
int le[MAX_N], ri[MAX_N];
void solve()
{
const int n = s.length();
for(int i=0;i<n;++i){
if(s[i] == '<') le[i+1]=max(le[i+1], le[i]+1);
else le[i+1] = 0;
}
for(int i=n-1;i>=0;--i){
if(s[i] == '>') ri[i]=max... | #include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#define initdp(a, b) for (int i = 0; i <= a; i++) for (int j = 0; j <= b; j++) dp[i][j] = -1;
#define pb push_back
#define mpr make_pair
#define pii pair<int, int>
#define ll long long
#define pll pair<ll, ll>
#define all(arr) arr.begin(), ar... | 0 | 24,724,754 |
#include<iostream>
#include<cstdio>
#include<vector>
#include<map>
#include<string>
#include<sstream>
#include<cmath>
#include<climits>
#include<algorithm>
#include<bitset>
#include<set>
#include<stack>
#include<queue>
#include<iomanip>
#include<memory.h>
#include<complex>
#include<unordered_map>
using namespace std; ... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
# define M_PI 3.14159265358979323846
const int M=1e9+7;
long long mod(long long x){
return ((x%M + M)%M);
}
long long add(long long a, long long b){
... | 0 | 36,029,686 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i, s, n) for (int i = (s); i < (n); i++)
#ifdef LOCAL
#define INPUT_FILE \
ifstream in("atcoder-problems/arc063_a.txt"); \
cin.rdbuf(in.rdbuf());
#define print_vec(v) \
rep(l, v.size()) { cou... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <iomanip>
#include <limits>
using namespace... | 0 | 73,263,940 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REPR(i,n) for(int i=n; i>-1; --i)
#define ALL(a) (a).begin(),(a).end()
#define FILL(a,n,x); REP(i,(n)){ (a)[i]=(x); }
#define CINA(a,n); REP(i,(n)){ cin >> (a)[i... | #include <cstdio>
#include <algorithm>
int a, b, n, map[17][17];
int search(int x, int y)
{
if (x == 1 && y == 1)
{
map[1][1] = 1;
return 1;
}
int left = 0, down = 0;
if (map[y][x - 1] != -1)
{
left = search(x - 1, y);
}
if (map[y - 1][x] != -1)
{
down = search(x, y - 1);
}
map[y][x] = left + down;
... | 0 | 43,951,847 |
#include <iostream>
int main(void){
int N, tmp=200001, ans=0;
std::cin >> N;
for (int i=0; i<N; ++i){
int a;
std::cin >> a;
if (a < tmp){
++ans;
tmp = a;
}
}
std::cout << ans << std::endl;
return 0;
} | #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()
{
int n;
cin >> n;
int ans = 0;
int count = 0;
for(int i = 1; i <= n; i++){
if(i % 2 == 1){
for(int j = 1; j <= i; j++){
if(i % j == 0){
count++;
... | 0 | 84,659,407 |
#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... | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <numeric>
#include <ctime>
#include <complex... | 0 | 81,137,191 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD1 1000000007
#define MOD2 1000000009
#define FOR(a,b) for(int i=a;i<b;i++)
#define nl "\n"
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll d, t, s;
cin >> d >> t >> s;
if (t * s >= d)
cout << "Yes";
else
c... | #define rep(i, n) for (int i = 0; i < (n); i++)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
int main() {
int n;
cin >> n;
vector<int> p(n), q(n);
rep(i, n) cin >> p.at(i);
rep(i, n) cin >> q.at(i);
vector<int> oneCase(... | 0 | 66,473,119 |
#include <bits/stdc++.h>
#define ALL(a) (a).begin(),(a).end()
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<long long> vll;
typedef vector... | # include <iostream>
# include <queue>
# include <climits>
using namespace std;
int H;
int W;
char A[1005][1005];
int counter=0;
int shortestpath[1005][1005];
bool visited[1005][1005];
int maximum=INT_MIN;
int dr[4]={1, -1, 0, 0};
int dc[4]={0, 0, -1, 1};
queue< pair<int, int> > starting;
bool inside (int row, int colu... | 0 | 40,741,001 |
#include<bits/stdc++.h>
#define rep(i,j,n) for(int i=(j);i<(n);i++)
#define per(i,n,j) for(int i=(n)-1;i>=(j);i--)
using ll=long long;
using namespace std;
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; re... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define fi first
#define se second
long long mo = 1000000007;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
typedef pair<ll,Pll> Pl... | 0 | 77,032,635 |
#include <algorithm>
#include <bitset>
#include <cassert>
#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++)
... | #include<bits/stdc++.h>
using namespace std;
int main(void) {
long n;
cin >> n;
vector<pair<long,long>> a(n);
for(long i=0; i<n; i++)
cin >> a[i].first, a[i].second = -i;
sort(a.begin(), a.end(), greater<>());
map<long, long> res;
long top, cur;
tie(top, cur) = a[0];
cur = -c... | 0 | 36,611,291 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template<class T> using vc = vector<T>;
template<class T> using vvc = vector<vector<T>>;
const ll MOD = 1e9 + 7;
const ll INF = 1e16;
const ld EPS = 1e-11;
const ld PI = acos(-1.0L);
#define eb emplace_bac... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
typedef pair<int,int> P;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
priority_queue<ll> a;
rep(i,n) {
ll x;
cin >> x;
a.push(x);
}
rep(i,m) {
ll x = a.top(... | 0 | 42,097,084 |
#include <bits/stdc++.h>
#define ll long long int
#define uu first
#define vv second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define INF 1e9
#define fastRead ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
using namespace std;
const int MAX = 1e6 + 6;
... | #include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef vector<int> vi;... | 0 | 69,197,588 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<ll> A(N);
for (int i = 0; i < N; i++)
{
cin >> A[i];
}
map<int, int> p;
for (int i = 0; i < N; i++)
{
p[A[i] - 1] += 1;
p[A[i] + 1] += 1;
p[A[i]] +=... | #include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
ll mod=1000000007;
using namespace std;
bool Factorial(ll x, vector<ll>&f){
f[0]=1;
for(int i=1; i<=x; i++){
f[i]=(f[i-1]*i)%mod;
}
return true;
}
int main() {... | 0 | 60,871,436 |
#include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<string>
#include<unordered_map>
using namespace std;
#define intmax INT_MAX
#define lmax LONG_MAX
#define uintma... | #include<bits/stdc++.h>
using namespace std;
#define INFTY 1<<20
#define rep(i,n) for (int i = 0; i < (n); ++i)
typedef long long int ll;
using ipair = pair<int,int>;
bool operator< (const ipair a, const ipair b){return a.first < b.first;};
const int MOD=1000000007;
int main(){
int n;cin>>n;
priority_queue<ipai... | 0 | 18,677,834 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin>>N;
int sum=0;
for(int i=0;i<N;i++){
int a;
int b;
cin>>a>>b;
sum+=b-a+1;
}
cout<<sum<<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll L, R;
int main(){
cin >> L >> R;
ll result = 2019;
for ( ll i = L; i < R && i < L+2019; i++ ){
for ( ll j = i+1; j <= R && j < i+1+2019; j++ ){
result = min( result, (i*j) % 2019 );
}
}
cout << result << endl;
return 0;
} | 0 | 1,729,364 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int r;
int g;
double p;
cin >> r;
cin >> g;
p = 2 * g - r;
cout << p << endl;
} | #include "bits/stdc++.h"
using namespace std;
#define INF (1LL<<60)
#define int long long
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define REP(i,n) FOR(i,0,(n))
typedef vector<int> vec;
typedef vector< vector<int> > mat;
class ECrestedIbisVsMonster {
public:
template<class T> inline bool chmin(T& a, T b... | 0 | 77,257,079 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int A, B, K;
cin >> A >> B >> K;
int result = 1;
int count = K;
for (int i=max(A, B); i>1; i--)
{
if (A%i==0 && B%i==0)
{
count -= 1;
if (count==0)
{
result = i;
... | #include<iostream>
#include<math.h>
#include<vector>
#include<algorithm>
#include<numeric>
#include<map>
#include<queue>
#include<deque>
#include<set>
#include<cstdio>
#include<cstring>
#include<string>
using namespace std;
typedef long long ll;
typedef vector<int> vec;
typedef vector<vector<int>> mat;
int main(){
... | 0 | 26,360,417 |
#include<iostream>
using namespace std;
int main()
{
int x,y;
while( cin >> x >> y )
{
if( x == 0 && y == 0 )
break;
else
if( x > y )
{
int tmp = x;
x = y;
y = tmp;
}
cout << x << " " << y... | #include <iostream>
#include <algorithm>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int C[m], T[m][n + 1];
for(int i = 0; i < m; i++) {
cin >> C[i];
T[i][0] = 0;
}
sort(C, C + m);
for(int i = 0; i < m; i++) {
if(i == 0) {
for(int j = 1; j <... | 0 | 13,948,762 |
#include <cstdio>
#include <cmath>
#include <limits>
#include <fstream>
#include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
#include <cstring>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cstdint>
#include <functional>
#define rep(i, s, g) for (i = s; i < g; i++)
u... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using PLL = pair<ll, ll>;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repn(i,n) for(int i = 0; i <= (int)(n); i++)
#define srep(i,l,n) for(int i = l; i < (int)(n); i++)
#define srepn(i,l,... | 0 | 78,426,919 |
#include <bits/stdc++.h>
using namespace std;
int main(){
char a, b;
cin >> a >> b;
bool judge;
if(a=='H'){
if(b=='H') judge=true;
if(b=='D') judge=false;
}
if(a=='D'){
if(b=='H') judge=false;
if(b=='D') judge=true;
}
if(judge) cout << 'H' << endl;
else cout << 'D' << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rrep(i, n) for(int i = 1; i <= (int)(n); i++)
#define drep(i, n) for(int i = (n)-1; i >= 0; i--)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef... | 0 | 12,044,772 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using namespace std;
#define rad_to_deg(rad) (((rad)/2/M_PI)*360)
int main(){
double a,b,x,y;
cin>>a>>b>>x;
if(x>=b*a*a/2){
y=a*a*a/(2*a*a*b-2*x);
}
else{
y=2*x/(a*b*b);
}
cout << fixed << setprecision(15);
... | #include <bits/stdc++.h>
#define rep3(i, s, n, a) for (int i = (s); i < (int)(n); i += a)
#define rep2(i, s, n) rep3(i, s, n, 1)
#define rep(i, n) rep2(i, 0, n)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
int main(){
int n;
cin >> n;
vector<int> a, b(... | 0 | 36,624,055 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define ALL(c) (c).begin(), (c).end()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v... | #include <bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(false);cin.tie(0)
#define endl "\n";
#define pb push_back
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define int long long
const int MOD=1e9+7;
const int N=3e5+10;
int a[N];
int pow(int a, int b, int m)
{
int a... | 0 | 76,343,015 |
#include<stdio.h>
#include<stdlib.h>
#define N 2000000
#define MAX 10000
void CountingSort(int *,int *,int);
int main(){
int n,i;
int *A,*B;
scanf("%d",&n);
A = (int *)malloc(n * sizeof(int));
B = (int *)malloc(n * sizeof(int));
for(i=0; i<n; i++) scanf("%d",&A[i]);
CountingSort(A,B,n);
for(i=0; i<n-1;... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define ff first
#define ss second
#define rsz resize
#define ins insert
#define mp make_pair
#define pf push_front
#define pb push_back
#define eb emplace_back
#define ft front()
#define bk back()
#define sz(x) (int)(x).size(... | 0 | 27,923,879 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#define rep(i,n) for(int i = 0; i , (n); ++i)
using ll = long long;
using namespace std;
int sum(int n) {
if (n == 0) {
return 0;
}
int s = sum(n - 1);
return s + n;
}
int main() {
int N, K, sum=0;
cin >> N >> K;... | #include<iostream>
using namespace std;
int main(void){
int A, B, K;
bool result{false};
cin >> K >> A >> B;
if(A%K == 0){
result = true;
}
else if((A/K+1)*K<=B){
result = true;
}
if(result){
cout << "OK" << endl;
}
else{
cout << "NG" << endl;
... | 0 | 43,731,972 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define MOD 1000000007
ll recurse(ll i, bool color, vector<vector<ll>>& adj, vector<vector<ll>>& dp, ll from) {
if (dp[i][color] != -1) {
return dp[i][color];
}
ll ans = 1;
for (auto v: adj[i]) {
if (v != from) {
... | #include <iostream>
#include <algorithm>
#include <cstdio>
#define INF 200000
using namespace std;
const int MAX=11;
int d[MAX][MAX];
int V;
int main()
{
int n;
while(~scanf("%d", &n) && n)
{
for(int i=0; i<MAX; i++)
{
for(int j=0; j<MAX; j++)
{
if(i!=... | 0 | 28,374,375 |
#include <bits/stdc++.h>
#define int long long int
#define MOD(x) ((x % MOD_N) + MOD_N) % MOD_N
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define FORE(i,a,b) for(int i=(a);i<=(b);++i)
#define RFOR(i,a,b) for(int i=(b)-1;i>=(a);--i)
#define RFORE(i,a,b) for(int i=(b);i>=(a);--i)
#define REP(i,n) FOR(i,0,n)
#define RRE... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define fi first
#define se second
#define rep(i,s,n) for(int i = s;i<n;i++)
#define rrep(i,s,n) for(int i = (n)-1;i>=(s);i--)
#define all(v) (v).begin(),(v).end()
#define chmin(a,b) a=min((a),(b))
#define chmax(a,b) a=max((a),(b))... | 0 | 98,242,617 |
#include <bits/stdc++.h>
using namespace std;
typedef long long Int;
int main()
{
int n;
set<int> p;
vector< pair<int, int> > v;
scanf("%d", &n);
p.insert(0);
p.insert(n + 1);
for (int i = 1; i <= n; i++) {
int x;
scanf("%d", &x);
v.emplace_back(x, i);
}
sort(v.rbegin(), v.rend());
Int a... | #include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using Bint = boost::multiprecision::cpp_int;
using namespace std;
typedef long long ll;
typedef pair<int, ll> Pil;
int N;
const int MAX_N = 1.0e5 + 10;
Bint A[MAX_N];
int main() {
cin >> N;
for (int i = 0; i < N; i++) cin >> A[i];
bool is_... | 0 | 84,336,648 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define sc second
signed main() {
#ifdef _DEBUG
#endif
ios::sync_with_stdio(0); cin.tie(0);
int a, b;
cin >> a >> b;
int ans = 0;
while (a <= b) ans++, a *= 2;
cout << ans << '\n';
return 0;
} | #include <iostream>
#include <utility>
int main() {
int a , b ;
for( int i = 0 ; i <= 3000 ; i++ ) {
std::cin >> a >> b ;
if( a == 0 && b == 0 ) {
break ;
} else if( a > b ) {
std::swap( a , b ) ;
}
std::cout << a << " " << b << std::endl ;
}
} | 0 | 83,027,083 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, k;
cin >> a >> b >> c >> k;
if (a + b >= k) {
cout << min(a, k) << endl;
} else {
cout << a - (k - a - b) << endl;
}
} | #include<bits/stdc++.h>
using namespace std;
#define lli long long int
#define pb push_back
#define fi first
#define se second
#define MOD 1000000007
const int maxn= 100010;
lli modexp(lli x, lli y)
{
x%=MOD;
lli ans=1ll;
while(y>0ll)
{
if(y&1ll)
ans=(ans*x)%MOD;
x=(x*x)%MOD;... | 0 | 29,782,366 |
#include "iostream"
#include "cmath"
#include "iomanip"
using namespace std;
int main(int argc, char const *argv[])
{
double x1, y1, x2, y2=0;
cin >> x1 >> y1 >> x2 >> y2;
cout << setprecision(10) << sqrt( pow(x1 - x2, 2) + pow(y1 - y2, 2) ) <<endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int t = 1;
while(t--)
{
int n;
cin >> n;
int h[n];
for(int &val : h)
cin >> val;
int dp[n] = {0};
for(int i = 1; i < n; i++)
{
int op1, op2;
op1 = op2 = 1e9;
if(i-2 >= 0)
... | 0 | 48,222,212 |
#include<bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
#define rep(i,x) for(int i = 0; i < x; i++)
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
typedef long long ll;
typedef pair<int,int> P;
typedef vector<int> ivec;
const ll N... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
ll gcd(ll a, ll b) { return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {
if(a==1 || b==1){
return max(a,b);
}
return a/gcd(a,b)*b;
}
void solve(long long N, long long M, std::vector<long long> a){
ll num = a[0]/... | 0 | 48,450,494 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for(int i=0; i<N; i++)
typedef long long ll;
#define dump(x) cerr<<#x<<"="<<x<<endl
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
int res, ans;
res = min(a, b);
ans = min(c, d);
ans += res;
cout << ans << endl;
} | #include <iostream>
#include <iomanip>
#include <string>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <vector>
#include <cassert>
#include <fstream>
#include <algorithm>
#include <list>
#include <random>
#include <ctime>
#include <cmath>
#include <random>
#in... | 0 | 49,950,413 |
#include <stdio.h>
int main (){
char s[4];
scanf("%s",s);
if( s[0] == s[1] && s[1] == s[2]){
printf("No\n");
}
else {
printf("Yes\n");
}
return 0;
} | #include <iostream>
#include <algorithm>
#include <math.h>
#include <vector>
#include <string>
#include <queue>
#include <map>
#include <utility>
#include <iomanip>
#include <set>
using namespace std;
using ll = long long;
#define rep(i,a,b) for(ll i=(a); i<(b); i++)
#define YES cout << "YES" << endl;
#define NO cout... | 0 | 35,857,586 |
#include<cstdio>
using namespace std;
int main(){
int a,b,c,d;
scanf("%d", &a);
scanf("%d", &b);
scanf("%d", &c);
scanf("%d", &d);
int ans = 0;
if (a > b) ans += b;
else ans += a;
if (c > d) ans += d;
else ans += c;
printf("%d\n", ans);
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
ll gcd (ll a, ll b) {
if (b > a) {
ll tmp = b;
b = a;
a = tmp;
}
if (b == 0) return a;
return gcd(b, a % b);
}
int main(){
int N;
cin >> N;
vect... | 0 | 33,134,115 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, n;
cin >> x >> n;
unordered_set<int> hashset;
for (int i = 0; i < n; ++i) {
int p;
cin >> p;
hashset.insert(p);
}
int min_diff = 100;
int min_val = 100;
for (int val = 101; val >= 0; val--) {
if (hashset.find(val) == hashs... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(15);
string strs;
cin >> strs;
for (auto &s: strs) {
if (s == '1') cout << '9';
else if (s == '9') cout << '1';
else cout << s;
}
... | 0 | 64,699,596 |
bool DBG = false;
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define IFOR(i,a,b) for(int i=(b-1);i>=(a);--i)
#define RPT(i,a,b) for(int i=(a);i<((a)+(b));++i)
#define IRPT(i,a,b) for(int i=((a)+(b)-1);i>=(a);--i)
#define ALL(x) ... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define sd(x) scanf("%lf", &x)
#define l0(i,n) for(ll i=0; i<n; i++)
#define MAX 100005
#define maxn 200002
#define pb push_back
#define mk make_pair
#define endl "\n"
#define INF 10... | 0 | 58,469,926 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string A, B;
cin >> A >> B;
if (A.size() < B.size()) {
cout << "LESS" << endl;
}
else if (A.size() > B.size()) {
cout << "GREATER" << endl;
}
else {
for (int i = 0; i < A.size(); i++) {
if (A.at(i) == B.at(i) && i < A.size() - 1) {
continue;... | #include <bits/stdc++.h>
#define f(i,j,k) for(int i=j;i<k;i++)
#define f2(i,j,k) for(int i=j;i>k;i--)
using namespace std;
int main(){
long long k;
double n;
cin>>n>>k;
double ans=0;
f(i,1,n+1){
long double a=1/n;
long long now=i;
while(now<k){
now*=2;
... | 0 | 65,066,757 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int a12 = a/1000;
int a21 = a12/10 + a12%10*10;
int b12 = b/1000;
int b21 = b12/10 + b12%10*10;
int count_less_than_a = 0;
for (int i = 0; i <= 9; i++) {
if (a12*1000 + i*100 + a21 < a){
count_less_than_a++;
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int MAX = 510000;
const int MOD = 998244353;
const int Inv2 = (MOD+1)/2;
signed main(){
int n;
cin>>n;
int a[(1<<n)],b[(1<<n)]={},c[(1<<n)]={},p[4];
for(int i=0;i<(1<<n);i++)cin>>a[i];
for(int i=0;i<(1<<n);i++){
b... | 0 | 72,765,497 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int n;
cin>>n;
map<string, int> mp;
long long ans=0;
rep(i,n){
string s;
cin>>s;
sort(s.begin(),s.end());
if(mp[s]>0) ans+=mp[s];
mp[s]++;
}
cout<<ans<<endl;
} | #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define PER(i, n) for (int i = (n-1); i >= 0; --i)
#define ALL(V) (V).begin(),(V).end()
#define SORT(V) sort(ALL(V))
#define REV(V) reverse(AL... | 0 | 43,453,842 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define FASTIO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl '\n'
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
using ll = long long;
using P = pair<ll, ll>;
int main()... | #include <bits/stdc++.h>
#define REP(i, n) for(int (i)=0;(i)<(n);++(i))
#define MOD 1000000007
using namespace std;
typedef long long ll;
int main()
{
int N;
cin >> N;
vector<int> primes;
map<int, int> primeFact;
for (int i = 2; i <= N; ++i)
{
bool isPrime = true;
for (int j = 2;... | 0 | 84,186,905 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,a,b) for(ll i=a;i<b;++i)
#define rrep(i,a,b) for(ll i=a;i>b;--i)
#define FOR(i,n) for(ll i=0;i<n;i++)
#define vi vector<int>
#define vl vector<ll>
#define ld long double
#define vvi vector<vector<int>>
#define vvl vector<vector<long long... | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define ll long long int
#define mod 1000000007
#define deb(x) cout ... | 0 | 7,784,001 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,a,b;
ll i,j,k;
ll x[100005];
bool solve(){
cin >> n >> a >> b;
if(n + a + b == 0){
return false;
}
for(i=0;i<n;i++){
cin >> x[i];
}
ll num = -100;;
ll ansind = -1;
for(i=a-1;i<b;i++){
ll sa = x[i] - x[i+1];
if(sa >= num){
num = s... | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
sort(s.begin(), s.end());
sort(t.begin(), t.end());
reverse(t.begin(), t.end());
bool flag = false;
for (int i = 0; i < 100; i++) {
if (s[i] < t[i]) {
flag = true;
break;
}
else if... | 0 | 53,781,013 |
#include <iostream>
using namespace std;
int main()
{
int n, m;
cin >> n >> m;
for(int a = n / 2, b = a + 1, c = 1; c <= m; a--, b++, c++)
{
if(n % 2 == 0 && (b - a == n / 2 || b - a == n / 2 + 1))
{
b++;
}
cout << a << ' ' << b << endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define M 100007
#define INF 1e9
#define INFL 1e18
#define PI acos(-1)
#define mp make_pair
int n;
int dp[100100];
int arr[100100];
int mydp(int i)
{
if(i>=n)
{
return... | 0 | 13,746,766 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int MAX_XYZ = 1005;
ll A[MAX_XYZ],B[MAX_XYZ],C[MAX_XYZ],ans[MAX_XYZ*3];
ll X,Y,Z,K;
bool f(ll x)
{
ll cnt = 0;
rep(i,X)
{
rep(j,Y)
{
ll s = A[i]+B[j];
int l = -1, r... | #include <iostream>
#include <algorithm>
using namespace std;
int main( void )
{
char s[ 4 ];
char t[ 4 ];
cin >> s >> t;
int ans = 0;
for ( int i = 0; i < 3; i++ )
{
if ( s[ i ] == t[ i ] )
{
ans++;
}
}
cout << ans << endl;
return 0;
} | 0 | 9,590,781 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,... | #pragma GCC diagnostic ignored "-Wunused-variable"
#include <bits/stdc++.h>
using namespace std;
#define BOOST
#ifdef BOOST
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/range/adaptor/reversed.hpp>
using namespace boost;
using ml = boost::multiprecision::... | 0 | 13,457,230 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll=long long;
int main(){
ll n;
cin>>n;
ll ans=1LL<<60;
ll tmp;
for(ll i=1;i*i<=n;i++){
if(n%i==0){
tmp=i+n/i-2;
ans=min(ans,tmp);
}
}
cout<<ans<<endl;
} | #include<iostream>
using namespace std;
int main(){
int number;
int i=1;
while(1<3){
cin >> number;
if(number == 0){
break;
}
cout << "Case " << i << ": " << number << endl;
i++;
}
return 0;
} | 0 | 65,212,183 |
#include<iostream>
#include<algorithm>
#include<functional>
#include<cmath>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<deque>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;
int cnt[3];
int main()
{
in... | #include<stdio.h>
#include<string.h>
int main(){
int k, l;
char str[105];
scanf("%d%s", &k, str);
l = strlen(str);
for (int i=0 ; i<k ; i++){
if (str[i]=='\0'){
break;
}
printf("%c", str[i]);
}
if (l>k){
printf("...");
}
puts("");
retur... | 0 | 76,448,844 |
#include<bits/stdc++.h>
using namespace std;
int n;
int a,b,c;
vector<int> l;
int ans=1000000000;
void dfs(int i,int A,int B,int C,int cal){
if(i==n){
if(A>0 && B>0 && C>0){
ans=min(ans,abs(A-a)+abs(B-b)+abs(C-c)+cal);
}
return;
}
if(A>0 && B>0 && C>0) ans=min(ans,abs(A-a)+abs(B-b)+abs(C-c)+cal)... | #include<iostream>
#include<cstdio>
using namespace std;
class Dice_c{
private:
int me[4];
int topbot[2];
public:
void Input();
void Roll(int top, int front);
void Output();
};
int main(){
Dice_c dice;
int m;
int top,front;
dice.Input();
cin >> m;
for(int i=0; i<m; i++){
cin >> top >> front;
... | 0 | 46,348,341 |
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
using namespace std;
int main() {
int a,b,c,d;
string s,ss;
long long ans = 0;
cin >> s >> ss;
if(s == "H" && ss == "H" || s == "D" &&... | #include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#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 sz(a) (int)(a).size()... | 0 | 90,680,597 |
#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>;
const long long inf = 1000000001;
const double PI = 3.14159265358979323846;
int main(void){
int bingo[3][3];
rep(i,3){
rep(j,3){
cin >> bingo[i][j];
... | #include <bits/stdc++.h>
#define pb push_back
#define fst first
#define snd second
#define sz(x) int(x.size())
#define fill(x,v) memset(x,v,sizeof(x))
#define REP(i,a,b) for(int i = int(a); i < int(b); ++i)
#define trace(x) cout << #x << " = " << x << endl
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie... | 0 | 79,034,826 |
#include <iostream>
#include <map>
#include <set>
#include <vector>
#include <cmath>
#define int long long
typedef long long ll;
using namespace std;
ll N, K, A[15], M[16], mincount=100000000000;
void dfs(ll id, ll k, vector<ll> v){
if(k>K) return;
if(id==N){
if(k!=K) return;
ll ms[N+1];
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vl vector<ll>
#define vi vector<int>
#define pi pair<int,int>
#define pl pair<ll,ll>
#define all(a) a.begin(),a.end()
#define mem(a,x) memset(a,x,sizeof(a))
#define pb push_back
#defi... | 0 | 73,090,802 |
#include <bits/stdc++.h>
#define ALL(A) (A).begin(),(A).end()
#define ll long long
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
int main(void){
cin.tie(0);
ios::sync_with_stdio(false);
int N,K;
cin >> N >> K;
long long ans = 1LL<<62;
vector<ll> x(N),y(N);
rep(i,N)cin >> x[i] >> y[i];
rep(a,N)rep... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <numeric>
#include <cstdint>
#include <iomanip>
using ll = long long;
int main(){
ll H, W; std::cin >> H >> W;
std::string temp(W+2,'.');
std::vector<std::string> s(H+2, temp);
for(int i=0; i<H; i++){
... | 0 | 36,572,426 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
int N=(a+b)/2;
if ((a+b)%2==1){
N++;
}
cout<<N<<endl;
} | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
bool field[20][20];
int cnt;
int dx[] = {1,0};
int dy[] = {0,1};
int h,w;
void dfs(int x,int y){
for(int i = 0; i < 2; i++){
int px = x + dx[i];
int py = y + dy[i];
if(px >= 0 && px < w && py >= 0 && py < h){
if(py == h-1 && px =... | 0 | 18,888,611 |
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#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 ALL(n) begin(n),end(n)
#define IN(a, x, b) (a<=x && x<b... | 0 | 82,876,270 |
#pragma GCC optimize("Ofast", "unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
const auto half = [](int a) {return a >> 1; };
const auto halfl = [](ll a) { return a >> 1; };
string s; cin >> s;
int k; cin >> k;
bool all_same = true;
for (int i = 0; i < s.length() - 1... | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define ll long long int
#define mod 1000000007
#define deb(x) cout ... | 0 | 23,999,412 |
#include<bits/stdc++.h>
using namespace std;
int a,b,n,x,y;
int memo[19][19]={0},check[19][19]={0};
int saiki(int x,int y){
if(check[x][y]==1)return(memo[x][y]);
else{
memo[x][y]=saiki(x,y-1)+saiki(x-1,y);
check[x][y]=1;
return memo[x][y];
}
}
int main(){
while(1){
cin>>a>>b;
if(a==0 &... | #include <iostream>
#include <map>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <sstream>
#include <cmath>
#include <math.h>
#include <string>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll h , w , x = 1e10;
cin >> h >> w;
if... | 0 | 41,779,687 |
#include <bits/stdc++.h>
#define ALL(obj) begin(obj), end(obj)
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace std;
template <class T>
vector<T> make_vec(size_t a) {
return vector<T>(a);
}
template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts.... | #include <bits/stdc++.h>
#define int long long
using namespace std;
int mod=1e9+7;
int fac[100005];
int modInverse(int a, int m)
{
int m0 = m;
int y = 0, x = 1;
if (m == 1)
return 0;
while (a > 1)
{
int q = a / m;
int t = m;
m = a % m, a = t;
t = y;
y ... | 0 | 33,316,317 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
int main(){
ll n,m;
cin >> n >> m;
ll a[n],b[n];
vector<ll> t[100005];
for(ll i=0;i<n;i++){
cin >> a[i] >> b[i];
t[a[i]].push_back(b[i]);
}
priority_que... | #pragma GCC diagnostic ignored "-Wunused-variable"
#include <bits/stdc++.h>
using namespace std;
#define BOOST
#ifdef BOOST
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/range/adaptor/reversed.hpp>
using namespace boost;
using ml = boost::multiprecision::... | 0 | 47,234,935 |
#include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
int n, m;
unordered_map<string, int> mp;
int main(void){
cin >> n;
rep(i, n){
string s;
cin >> s;
mp[s]++;
}
cin >> m;
rep(i, m){
string t;
cin >> t;
mp[t]--;
}
int ans = -INT_MAX;
for(auto i : ... | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <stack>
#include <set>
#include <queue>
#include <iomanip>
#include <math.h>
#include <fstream>
using namespace std;
class pqComp
{
public:
bool operator()(pair<int, int> &a, pair<int, int> &b)
{
return a.second < b.secon... | 0 | 84,795,580 |
#include <iostream>
using namespace std;
int main()
{
long long ans,cnt,i,j,g;
string s,t;
ans=1000000;
cin>>s>>t;
for(i=0;i<s.length();i++)
{
cnt=0;g=5;
for(j=0;j<t.length();j++)
{
if(i+j>=s.length()){g=0;break;}
if(s[i+j]!=t[j]){cnt++;}
}
... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin>>n>>k;
vector<int> data(n);
for (int i=0;i<n;i++){
int tmp;
cin>>tmp;
data.at(i)=tmp;
}
vector<int> count(200001,0);
for (int i=0;i<n;i++){
count.at(data.at(i))++;
}
sort(count.begin(),count.end());
int plusindex;... | 0 | 64,055,242 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (ll i = 0; i < (n); i++)
typedef pair<ll,ll> P;
ll gcd(ll a, ll b) { return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
int main(){
ll n;
cin >> n;
vector<ll> a(n);
rep(i,n) cin >> a[i];
sort(a.begin(), a.... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using piii = pair<int, pair<int, int>>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
template <typename T>
using Graph = vector<vector<T>>;
const int MOD = 1e9 + 7;
int main() {
ci... | 0 | 44,844,782 |
#include <bits/stdc++.h>
using namespace std;
#define println(msg) cout << msg << endl
int main() {
int N, D;
cin >> N >> D;
vector<vector<int>> vvi(N);
for (int i = 0; i < N; i++) {
for (int j = 0; j < D; j++) {
int x;
cin >> x;
vvi.at(i).push_back(x);
}
}
set<int> table;
{
... | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> P;
typed... | 0 | 30,947,168 |
#define rep(i,n) for (int i=0;i<n;i++)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int N,R;
cin>> N >> R;
if(N>=10)
cout << R << endl;
else
cout << R + 100*(10-N) <<endl;
} | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define repr(i,a,b) for(ll i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define invrepr(i,a,b) for(int i=b-1;i>=a;i--)
#define invrep(i,n) invrepr(i,0,n)
#define repitr(itr,a) for(auto itr=a.begin();itr!=a.end();++itr)
const int MOD=1e9+7;
int ma... | 0 | 56,135,731 |
#include <bits/stdc++.h>
#include <math.h>
#define REP(i, n) for(int i = 0; i < (n); i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1001001001;
const int mINF = -1001001001;
int main() {
int x,y;
cin >> x >> y;
cout << x+ y/2 << endl;
retu... | #include <bits/stdc++.h>
#include <fstream>
#include<string>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
typedef long long ll;
typedef long double ld;
using namespace std;
using namespace __gnu_pbds;
#define endl "\n"
#define FIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
... | 0 | 74,627,309 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
int main(){
ll l, r;
cin >> l >> r;
ll ans = 10000;
for(ll i=l; i <= l+2020; i++){
if(i==r) break;
for(ll j=l+1; j <= l+2021; j++){
... | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define repex(i, a, b, c) for(int i = a; i < b; i += c)
#define repx(i, a, b) repex(i, a, b, 1)
#define rep(i, n) repx(i, 0, n)
#define repr(i, a, b) for(int i = a; i >= b; i--)
LL a[101010], b[101010];
int main(){
int N;
scanf("%d", &N);
r... | 0 | 67,020,428 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using LL = long long;
using P = pair<int,int>;
int main(){
int N;
cin >> N;
vector<int> v(N);
for(int i = 0; i < N; ++i) {
cin >> v[i];
}
sort(v.begin(),v.end());
double ans = v[0];
for (int i = 1; i < N... | #pragma region header
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb p... | 0 | 24,869,790 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rep2(i,s,n) for(int i = (s); i < (n); ++i)
#define ll long long
#define ld long double
#define P pair<ll,ll>
#define all(v) v.begin(),v.end()
const ll mod = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1.0);
int m... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int h, w;
cin >> h;
cin >> w;
vector<vector<char>> c(h+2,vector<char>(w+2));
rep(i, h+2) {
rep(j, w+2) {
if (i == 0 || j == 0 || i == h+1 || j == w+1) {
c[i][j... | 0 | 98,168,611 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define rrep(i,n) for(int i=1;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define dunk(a) cout << (a) << "\n"
using namespace std;
typedef long long ll;
const int inf = 1001001001;
const int mod = 1000000007;
in... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<pair<int, int>> data(N);
for(int i = 0; i < N; i++) {
int a, b;
cin >> a >> b;
data.at(i) = make_pair(a, b);
}
sort(data.begin(), data.end());
int ans = 0;
priority_queue<int> keep;
int start = 0;
... | 0 | 9,159,740 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
ll combination(ll n, ll r) {
if (n / 2 <= r) {
r = n - r;
}
ll res = 1;
for (ll i = 0; i < r; ++i) {
res *= (n - i);
}
for (ll i = r; i > 0; --i... | #include <iostream>
#include <vector>
using namespace std;
int findRoot(int* parent, int x) {
if (parent[x] == x) {
return x;
}
parent[x] = findRoot(parent, parent[x]);
return parent[x];
}
bool isSame(int* parent, int x, int y) {
return findRoot(parent, x) == findRoot(parent, y);
}
void unite(int* parent,... | 0 | 34,220,962 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e16;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (ll)(n); i++)
int main() {
string s; cin >> s;
stack <ll> st;
rep(i, s.size()) {
if (s.at(i) == '0') st.push(0);
else if (s.at(i) == '1') ... | #include<bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#define REP(i, l, n) for(int i=(l), i##_len=(n); i<i##_len; ++i)
#define ALL(x) (x).begin(),(x).end()
#define pb push_back
ll gcd(ll a,ll b){return b ? gcd(b,a%b) : a;}
ll lcm... | 0 | 75,987,476 |
#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 (){
... | #include <stdio.h>
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <deque>
#include <set>
#include <stdlib.h> ... | 0 | 2,779,707 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.