code1 stringlengths 54 12k | code2 stringlengths 66 12k | similar int64 0 1 | __index_level_0__ int64 24 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define vi vector<int>
#define FOR(i, a, b) for(int i = a; i < b; i++)
#define sizeOf(A) (sizeof(A))/(sizeof(A[0]))
#define odd(x) ((x) % (2))
#define fastio ios_base::sync_with_stdio(false), cin.tie(0);
const l... | #include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#de... | 1 | 88,516,753 |
#include <iostream>
#include <cmath>
#include <algorithm>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
int N, M, ans = 0; cin >> N;
vector<string> S(N, "");
unordered_map<string, int> s;
unordered_map<string, int> t;
for (int i = 0; i < N; ++i) {
string a; cin... | #include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#def... | 1 | 61,364,082 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
template <class T>
bool ch... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define INF 1000000000000000000
typedef pair<ll, ll> pll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
cin... | 1 | 52,029,045 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
int main() {
int N;
cin >> N;
ll A[N];
ll now[N];
ll ans = 0;
now[0] = 1;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int i = 1; i < N; i++) {
if (A[i] == now[i-1] + 1) {
... | #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--)
const int MAX = 101010;
LL A[MAX];
int main(){
int N;
scanf("%d", ... | 1 | 99,853,691 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ifstream fi("input.in");
const ll MOD = 1000000007;
ll n, m;
ll sx, sy;
ll x[100005], y[100005];
signed main()
{
cin >> n >> m;
for (ll i = 1; i <= n; i++)
cin >> x[i];
for (ll i = 1; i <= m; i++)
cin >> y[i];
for (ll i =... | #include<iostream>
using namespace std;
typedef long long ll;
const ll MOD=1000000007;
ll n,m,x[100010]={0},y[100010]={0};
ll sx=0,sy=0;
signed main(){
cin>>n>>m;
for(int i=0;i<m+n;++i){
if(i<n){
cin>>x[i];
}
else cin>>y[i-n];
}
n--,m--;
for(ll i=0;i<n;++i){
... | 1 | 61,254,743 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define inf 1001001001001001001
#define mod 1000000007
#define mod2 998244353
#define pi acos(-1)
#define all(v) v.begin(),v.end()
int main(){
int H,W;cin>>H>>W;
vector<vector<char>>c(H,vector<char>(W)... | #include <iostream>
#include <algorithm>
#include <string>
#include <queue>
#include <vector>
#include <cstdio>
#include <cstring>
#include<map>
#include<cmath>
#include<set>
#define ll long long int
#define ull unsigned long long int
#define I(a) scanf("%d",&a)
#define I2(a,b) scanf("%d%d",&a,&b)
#define I3(a,b,c) s... | 1 | 23,423,632 |
#include <bits/stdc++.h>
#define respa return 0
#define all(x) x.begin(), x.end()
#define sz size
#define pb push_back
#define eb emplace_back
using namespace std;
typedef long long ll;
typedef long double ld;
const int N = 2e5 + 17, M = N << 2, mod = 1e9 + 7;
int tt = 1, n, a[N];
void solve () {
cin >> n;
for (int... | #include <iostream>
#include <cstdlib>
#include <cstdio>
#include <vector>
#include <queue>
#include <algorithm>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define pb(x) push_back(x)
#define F first
#define S second
using namespace std;
const int N=101;
int arr[2*N];
int n;
void solve(){
scanf("%d",&n);
loop(i,0,2*n){
... | 1 | 97,563,274 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n, k;
vector<int> A;
cin >> n >> k;
A = vector<int>(n);
for(int i = 0; i < n; i++) cin >> A[i];
for(int i = 0; i < k; i++){
vector<int> B(n,0);
vector<int> C(n,0);
for(int j = 0; j < n; j++){
int s = max(0, j-A[j]);
int e =... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, k; cin >> n >> k;
vector<int> a(n);
for (int i=0; i<n; i++) cin >> a[i];
vector<int> ans(n, 0);
for (int i=0; i<k; i++) {
vector<long long> ls(n, 0);
vector<long long> rs(n, 0);
for (int j=0; j<n; j++) {
int l = max(j - a[... | 1 | 84,060,355 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
using namespace std;
int main(void){
long long w, h;
cin >> w >> h;
vector<long long> p(w);
for(long long i=0; i<w; i++){
cin >> p[i];
}
vector<long long> q(h);
for(long long i=0; i<h; i++){
cin >> ... | #include <cmath>
#include <iostream>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <tuple>
#include <algorithm>
#include <utility>
#include <iomanip>
#define int long long int
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef pair<int, int> P;
const int INF = 1e15;
... | 1 | 98,222,463 |
#include <bits/stdc++.h>
using namespace std;
#define INF 0x3f3f3f3f
#define maxn 100005
#define ll long long
#define DEBUG
#ifdef DEBUG
#define debug(x) cout << #x << ": " << x << " "
#else
#define debug(x) ;
#endif
string s;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
cin>>s;
int f = 0;
... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef long double ld;
typedef tree<ll,null_type,less<ll>,rb_tree_tag, tree_order_statistics_node_update> ordered_set;
#define int ll
#define endl "\n"
#define all( x ) x.begin(), x.... | 1 | 98,818,204 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define ll long long int
int main(){
int n;
cin>>n;
int a[n];
int average=0;
rep(i,n){
cin>>a[i];
}
int ans=100000007;
for(int i=-1000;i<1000;i++){
int count=0;
rep(p,n){
count+=abs(i-a[p])*abs(i-a[p]);
}
ans=min(ans,count);
}
cout<... | #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define lint long long
#define setbits(x) __builtin_popcountll(x)
#define zrbits(x) __builtin_ctzll(x)
#define zlbits(x) ... | 1 | 36,749,479 |
#include <iostream>
#include<cmath>
#include<string>
using namespace std;
int main()
{
string s;
cin >> s;
int min = 10000;
for (int i = 0; i < s.size() - 2; i++) {
string s2 = s.substr(i, 3);
int x = atoi(s2.c_str());
int y = abs(753 - x);
if (min > y)min = y;
}
... | #include <iostream>
#include <vector>
#include <cmath>
using namespace std;
#define ll long long
void solve_B(){
string s;
cin >> s;
int n = s.size();
int ans = 10000;
for(int i = 0; i < n-2; i++){
int x = 100 * (s[i] - '0') + 10 * (s[i+1] - '0') + (s[i+2] - '0');
int sa = fabs(x - 7... | 1 | 64,391,249 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPS(I, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n);
REP(i,n) cin >> a[i];
int ans = 1000000;
int i = -100;
while(i <=... | #include <bits/stdc++.h>
using namespace std;
# define C continue;
# define R return
# define D double
# define I insert
# define ll long long
# define ld long double
# define ull unsigned long long
# define ui unsigned int
# define pb push_back
# define pf push_front
# define vi vector < int >
# define vc vector < cha... | 1 | 12,395,693 |
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) a.size()
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define MOD (ll)(998244353)
#defi... | #define _GLIBCXX_DEBUG
#define SIZE_OF_ARRAY(array) (sizeof(array)/sizeof(array[0]))
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int d[N];
for(int i=0; i<N; i++) cin >> d[i];
sort(d, d + SIZE_OF_ARRAY(d));
cout << d[N/2]-d[N/2-1] << endl;
return 0;
} | 1 | 26,232,690 |
#include <bits/stdc++.h>
using namespace std;
#define FOE(i, s, t) for (int i = s; i <= t; i++)
#define FOR(i, s, t) for (int i = s; i < t; i++)
#define FOD(i, s, t) for (int i = s; i >= t; i--)
#define LL long long
#define mp make_pair
#define pb push_back
LL max(LL a, LL b) { return (a > b ? a : b); }
#define K 60000... | #include<bits/stdc++.h>
#define MAXN ((int)(1e5+10))
#define INF ((int)(1e9))
using namespace std;
typedef long long LL;
int n,k;
LL a[MAXN],sum=0,ans=-INF,tmp=0;
int main()
{
cin>>n>>k;
for(int i=0;i<n;i++)
{
cin>>a[i];
tmp+=a[i];
if(a[i]>0)
sum+=a[i];
}
LL integer=0,fu=0;
for(int i=0;i<k;i++)
{
if(a... | 1 | 45,809,323 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <map>
#include <utility>
#define endl '\n'
#define fi first
#define se second
#define pb push_back
#define debug(x) cout << "[debug] " << #x << ": " << x << endl
using namespace std... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<int, int> P;
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define Z class
template <typename T>
T square(T x) { retu... | 1 | 15,193,667 |
#include<bits/stdc++.h>
using namespace std;
long long x;
__int128 ans=1;
long long a[100005];
void print(__int128 x)
{
if (!x) return ;
if (x < 0) putchar('-'),x = -x;
print(x / 10);
putchar(x % 10 + '0');
}
int main()
{
long long a;
string b;
cin>>a>>b;
int x1=(b[0]-48)*100;
int x2=(b[2]-48)*10;
int x3=(b[... | #include <iostream>
#include <cmath>
using namespace std;
int main()
{
long long int A;
long double B;
cin >> A >> B;
B = round(B * 100.00);
long long int r = (A * B) / 100;
cout << r << '\n';
} | 1 | 67,352,949 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string a,b,c;
cin>>a>>b>>c;
int d = a.length();
int e = b.length();
if(a.at(d-1) == b.at(0) && b.at(e-1) == c.at(0)){
cout<<"YES"<<"\n";
}
else{
cout<<"NO"<<"\n";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
string a, b, c;
cin >> a >> b >> c;
if (a.back() == b.front() && b.back() == c.front()) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | 1 | 19,158,485 |
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<stack>
#include<algorithm>
#include<iostream>
#include<cmath>
using namespace std;
typedef struct st
{
double x;
double y;
}st_Coordinate;
void Koch_curve(st_Coordinate p1, st_Coordinate p2, int n);
int main(void)
{
int n;
st_Coordinate st_st... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define SIZE_OF_ARRAY(array) (sizeof(array)/sizeof(array[0]))
#define MAX 100005
using ll =long long;
using namespace std;
struct coordinate{
double x,y;
};
struct line{
coordinate p,q;
};
struct triangle{
coordinate s,u,t;
};
triangle ... | 1 | 44,738,176 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int MOD = 1000000007;
struct edge {int to,costa,costb;};
signed main() {
int n;
cin>>n;
int t[n+1],t0;t[0]=0;
for(int i=0;i<n;i++){
cin>>t0;
t[i+1]=t[i]+2*t0;
}
int ans[t[n]+1];
for(int i=0;i<=t[n];i++)ans[i]=min(i,t[n]-i);
priority_queue... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using WGraph = vector<vector<pair<int, ll>>>;
template<class T>inline bool chmax(T &a, const T &b) { if (b > a) { a = b; return true; } return false; }
template<class T>inline bool chmin(T &a, const T &b) { if (b < a)... | 1 | 62,023,267 |
#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,... | #include <bits/stdc++.h>
#define repl(i, l, r) for (int i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<int, int>;
int main()
{
string s;
cin >> s;
string ans = "yes";
rep(i, s.size()) {
repl(j, i + 1... | 1 | 47,449,484 |
#include <bits/stdc++.h>
#include <algorithm>
#define rep(i,n) for(int i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
using namespace std;
typedef long long ll;
using Graph = vector<vector<pair<ll,ll>>>;
const int mod =1e+9+7;
const int dy[4]={0,1,0,-1};
const int dx[4]={1,0,-1,0};
const ll INF=1e10;
int main(){
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int limit = 100010;
using edge = struct {int to; ll cost;};
vector<edge> tree[limit];
ll depth[limit];
void dfs(int v, int p, ll d){
depth[v] = d;
for (auto &e : tree[v])
{
if (e.to == p)
{
continue;
... | 1 | 96,953,278 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A,B;
cin >> A >> B;
int K = min(A,B);
int L = max(A,B);
for (int i = 0; i < L; i++)
cout << K;
cout << endl;
} | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define fi first
#define se second
#define em emplace
#define eb emplace_back
#define mp make_pair
#define pi pair<int,int>
#define vi vector<int>
#define vpi vector<pair<int,int>>
#define vll vector<ll>
#define vpll vector<pair<ll,ll>>
#define endl '\n'
#define si(v)... | 1 | 95,007,227 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
int main()
{
long long int a,b,c,d;
cin>>a>>b>>c>>d;
a+=b;
c+=d;
if(a>c)cout<<"Left";
else if(c>a)cout<<"Right";
else cout<<"Balanced";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int a, b, c, d;
string s;
cin >> a >> b >> c >> d;
if ((a+b) == (c+d)) s = "Balanced";
else if ((a+b) < (c+d)) s = "Right";
else s = "Left";
cout << s << endl;
} | 1 | 60,902,322 |
#include <iostream>
int main(void){
for(int i=1;i<10;i++){
for(int j=1;j<10;j++){
std::cout<<i<<"x"<<j<<"="<<i*j<<"\n";
}
}
} | #include <iostream>
using namespace std;
int main()
{
int qq;
for(int i = 1; i < 10; i++){
for(int iq = 1; iq < 10; iq++){
qq = i * iq;
cout << i << "x" << iq << "=" << qq << endl;
}
}
return 0;
} | 1 | 29,586,094 |
#include <iostream>
#include <stack>
#include <math.h>
#include <vector>
#include <string>
#include <algorithm>
#include <map>
#define rep(i,n) for(int i=0; i < n; i++)
using ll = long long;
using namespace std;
#define pi 3.14159265358979
int main()
{
int n, m;
cin >> n >> m;
int first = 0, last = n + 1;
rep(i, m... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define vlli vector<ll>
#define vi vector<int>
#define vs vector<string>
#define vplli vector< pair< ll,ll> >
#define plli pair< ll,l... | 1 | 90,187,161 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, k, n) for (int i = k; i < (int)(n); i++)
#define repd(i, n) for (int i = n-1; i >= 0; i--)
#define rrepd(i, k, n) for (int i = n-1; i >= (int)(k); i--)
#define all(x) (x).begin(),(x).end()
#define chmax(x,... | #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.... | 1 | 56,566,257 |
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cctype>
#include <queue>
#define fi first
#define se second
using namespace std;
typedef long long i64;
typedef pair<i64, int> pii;
inline i64 read(int f = 1, i64 x = 0, char ch = ' ')
{
while(!isdigit(ch = getchar())) if(ch == '-') f = -1;
whi... | #include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#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 srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto& (a): (b))
#define all(v) (v).begi... | 1 | 55,169,519 |
#include <iostream>
using namespace std;
int main()
{
int a;
cin >> a;
if (a <= 1199){
cout << "ABC";
}else if (a <= 2799){
cout << "ARC";
}else{
cout << "AGC";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(ll 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 = vect... | 1 | 13,280,993 |
#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include <iostream>
#include <string>
#include <cmath>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
#define FORR(i,a,b)for(ll i=(a);i<=(b);i++)
#define repR(i,n)... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
ll ans = 0;
vector<ll> v;
void f(ll i, ll j, ll k) {
if (i == j && j == k) {
if (v[i] >= 74)++ans;
}
else if (i == j) {
if (v[i] >= 14 && v[k] >= 4)++ans;
}
else if (i == k) {
if (v[i] >= 14 && v[j] >= 4)++ans;
}
else if(j==k) {
if (v[i] ... | 1 | 52,271,473 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,c=0;
cin >> n;
for(int i = 1; i <= n ; i++) c += i ;
cout << c;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int i,ans=0;
for(i=1;i<=n;i++){
ans+=i;
}
cout << ans;
} | 1 | 77,513,596 |
#include <iostream>
#include <numeric>
#include <stdio.h>
#include <iomanip>
#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_... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
double x;
string u;
double goukei = 0;
for ( int i = 0; i < n ; i++){
cin >> x >> u;
if ( u == "JPY" ){
goukei += x;
}else{
goukei += x * 380000;
}
}
cout << fixed << setprecision(7) << goukei << endl... | 1 | 40,316,423 |
#include <bits/stdc++.h>
#ifdef LOCAL_DEBUG
#define DEBUG 1
#define CERR if(DEBUG) cerr
#define MACRO(_1,_2,_3,_4,_5,_6,_7,_8,_9,_10,NAME,...) NAME
#define pr(...) CERR<<MACRO(__VA_ARGS__,pr10,pr9,pr8,pr7,pr6,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__)<<endl
#define pr1(a) (#a)<<"="<<(a)<<" "
#define pr2(a,b) pr1(a)<<pr1(b)
#def... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdlib>
#include <map>
#include <iomanip>
#include <set>
#include <stdio.h>
#include <ctype.h>
using namespace std;
#define pie 3.141592653589793238462643383279
#... | 1 | 69,287,060 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
int R, G;
cin >> R >> G;
cout << 2 * G - R << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double b;
int R, G;
cin >> R;
cin >> G;
b = (G * 2) - R;
cout << b << endl;
} | 1 | 92,292,190 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INTINF 1999999999
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define MODA 1000000007
int main() {
int ans = 0;
int tmp;
string s;
cin >> s;
int o= 0, z = 0;
REP(i, s.size()){
if(s[i] == '0') z++;
el... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
int main() {
string s; cin >> s;
int n = s.size();
int red = 0; int blue = 0;
REP(i, n) {
if (s[i] == '0') ++red;
else ++blue;
}
cout << min(red, blue) * 2 << endl;
return 0;
} | 1 | 77,496,797 |
#include <iostream>
#include <stdio.h>
#include <vector>
#include <string>
#include <cstring>
#include <queue>
#include <deque>
#include <stack>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <unordered_map>
#include <cmath>
#include <math.h>
#include <tuple>
#include <iomanip>
#include ... | #include <bits/stdc++.h>
#define INF 1000000000
#define ll long long
#define pll pair<ll, ll>
using namespace std;
ll N, M, V, P;
vector<ll> A;
bool check(ll m)
{
if (m < P)
{
return true;
}
if (A.at(m) + M < A.at(P - 1))
{
return false;
}
ll S = 0;
S += (P - 1) * M;
S += (N - m) * M;
for (l... | 1 | 36,694,723 |
#include<bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define vi vector<ll>
#define vvi vector<vi>
#define BITLE(n) (1LL<<((ll)n))
#define SHIFT_LEFT(n) (1LL<<((ll)n))
#define SUBS(s,f,t) ((s).su... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define ll long long
long long min(long long x,long long y){return (x<y ? x:y);}
long long max(long long x,long long y){return (x>y ? x:y);}
#define ld long double
int stoi(string s) {return atoi(s.c_str());}
int k... | 1 | 57,278,376 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define printVec(v) printf("{"); for (const auto& i : v) { std::cout << i << ", "; } printf("}\n");
#define degreeToRadian(deg) (((deg)/360)*2*M_PI)
#define radianTodegree(rad) (((rad)/2/M_PI)*360)
template<class T> inline bool chmax(T& a, T b) { i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll limit = 1000000000000000000;
int main() {
ll N;
cin >> N;
vector<ll> vec(N);
for (ll i = 0; i < N; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
ll ans = 1;
for(ll i = 0; i < N; i++) {
i... | 1 | 51,165,760 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
long long int N,K;
cin >> N >> K;
long long int Health[N];
for(int i=0;i<N;i++) cin >> Health[i];
sort(Health,Health+N);
long long int ans=0;
for(int i=0;i<N-K;i++){
ans+=Health[i];
}
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin >> n >> k;
vector<long long> array(n);
for(int i=0;i<n;i++){
cin >> array.at(i);
}
sort(array.begin(),array.end());
int size = array.size() -1;
for(int i=0;i<k;i++){
if(size < 0) break;
array.a... | 1 | 16,713,982 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define repr(i,a,b) for(int 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)
#define P pair<int,int>
co... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
const int INFint = 2e9+1;
const ll INFll = 2e18+1;
ll MOD=1e9+7;
int main(){
int N,K;
cin>>N>>K;
if (K > (N-1)*(N-2)/2){
cout << -1 << endl;
return 0;
}
int tmp = (N-1)*(N-2)/2 - K;
cout << tmp + N-1 << endl;
for(int i(2);i<=N;i++... | 1 | 52,147,756 |
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
long long a, b, c, d;
cin >> a >> b >> c >> d;
cout << max({ a*c,a*d,b*c,b*d });
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int64_t a,b,c,d;
cin >> a >> b >> c >> d;
cout << (int64_t)max(a*c,max(a*d,max(b*c,b*d))) << endl;
} | 1 | 68,298,553 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int h, w;
cin >> h >> w;
vector<vector<int>>grid(h+2, vector<int>(w+2,0));
queue<pair<int, int>>black;
for (int i = 1; i < h + 1; i++) {
for (int j = 1; j < w + 1; j++) {
char x;
cin >> x;
if (x == '.')grid.at(i).at(j) = 1e... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
template<class T>
inline bool chmin(T &a, T b) {
if(a > b) {
... | 1 | 63,358,575 |
#include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#de... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
int main() {
int n; cin >> n;
int a = 25-n;
cout << "Christmas";
rep(i,a) cout << " Eve";
cout << endl;
} | 1 | 61,863,113 |
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
int main() {
int R, G;
cin >> R >> G;
cout << 2 * G - R << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int inNumR = 0;
int inNumG = 0;
cin >> inNumR >> inNumG;
cout << 2 * inNumG - inNumR << endl;
} | 1 | 58,687,683 |
#include <bits/stdc++.h>
#define int long long
#define ALL(v) (v).begin(),(v).end()
#define Vi vector<int>
#define pb push_back
#define mp make_pair
#define cYES cout<<"YES"<<endl
#define cNO cout<<"NO"<<endl
#define cYes cout<<"Yes"<<endl
#define cNo cout<<"No"<<endl
#define rep(i,a,b) for(int i=a;i<b;i++)
#define r... | #include <bits/stdc++.h>
using namespace std;
int main() {
long N,A,B;
cin>>N>>A>>B;
vector<long> p(N);
for(int i=0;i<N;i++) cin>>p[i];
long q1=0,q2=0,q3=0;
for(int i=0;i<N;i++){
if(p[i]<=A) q1++;
else if(p[i]<=B) q2++;
else q3++;
}
cout<<min(q1,min(q2,q3))<<endl;
} | 1 | 50,240,923 |
#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() {
ll n;
cin >> n;
cout << (n-2)*180 << endl;
} | #include <iostream>
#include <cmath>
#include <iomanip>
#include <cstdio>
#include <stack>
#include <queue>
#include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
using namespace std;
int main(){
ll n;
cin>>n;
cout<<180*(n-2);
} | 1 | 20,456,448 |
#include <iostream>
using namespace std;
int main() {
char c; cin >> c;
for (int i = 0; i < 26; i++) {
if (c == 'A' + i) {
cout << "A" << endl;
return 0;
}
}
for (int i = 0; i < 26; i++) {
if (c == 'a' + i) {
cout << 'a' << endl;
r... | #include<bits/stdc++.h>
using namespace std;
int main()
{
char c;
cin>>c;
if(c>64 && c<91)cout<<'A'<<endl;
else cout<<'a'<<endl;
} | 1 | 42,153,466 |
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
using namespace std;
typedef long long ll;
int INF = (1LL << 30) - 1;
ll MOD = 1e9+7;
main(){
ll N,M;
cin >> N >> M;
vector<ll> X(N),Y(M),accumX(N+1),accumY(M+1);
rep(i,0,N){
cin >> X[i];
X[i] += 1e9;
accum... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0;i<n;++i)
#define SORT(name) sort(name.begin(), name.end())
#define ZERO(p) memset(p, 0, sizeof(p))
#define MINUS(p) memset(p, -1, sizeof(p))
#if 1
# define DBG(fmt, ...) printf(fmt, __VA_ARGS__)
#else
# define DBG(fmt, ..... | 1 | 28,640,670 |
#include <iostream>
using namespace std;
int main(void){
int H,W;
while(1){
cin>> H >> W;
if(H==0 && W==0){
break;
}else{
for(int i=1;i<=H;i++){
for(int j=1;j<=W;j++){
if(i==1||j==1||i==H||j==W){
cout<<"#... | #include <iostream>
using namespace std;
int main(void) {
int H, W;
while(true) {
cin >> H >> W;
if(H == 0 && W == 0) break;
for(int w = 0; w < W; ++w) {
cout << "#";
}
cout << endl;
for(int h = 0; h < H - 2; ++h) {
cout << "#";
... | 1 | 93,972,982 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<double> a(n);
double ans = 0;
for(int i = 0; i < n; i++){
cin >> a[i];
}
for(int i = 0; i < n; i++){
ans += (double)(1 / a[i]);
}
cout << fixed << setprecision(15) << (double)(1 / ans) << endl;
} | #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 =... | 1 | 66,665,266 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main()
{
int n, k;
cin >> k >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
sort(a.begin(), a.end());
int dis = 0;
rep(i, n)
{
if (i < ... | #include <bits/stdc++.h>
#define rep(i,n) for(long long i = 0; i < (long long)(n); ++i)
using namespace std;
using ll = long long;
int main() {
int k, n;
int ans = 0;
cin >> k >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
rep (i, n - 1) ans = max(ans, a[i + 1] - a[i]);
ans = max(ans, (k - a[n - 1]) + a[0]);
co... | 1 | 31,880,980 |
#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 r,g,b;
cin>>r>>g>>b;
int n;
cin>>n;
ll ans=0;
for(int i=0; i*r<=n; i++){
for(int j=0; i*r+j*g<=n; j++){
if((n-(i*r+j*g))%b==0)ans++;
}
}
cout<<ans<<endl;... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int r, g, b, n;
cin >> r >> g >> b >> n;
ll ans = 0;
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= n; j++) {
if (r * i + g * j > n) continue;
if ((n - (r * i + g * ... | 1 | 58,062,820 |
#include<bits/stdc++.h>
using namespace std;
#define arep(i,x,n) for(int i=int(x);i<(int)(n);i++)
#define rep(i,n) for(long long i = 0;i < n;++i)
#define rrep(i,n) for(int i=int(n-1);i>=0;i--)
#define fs first
#define sc second
#define all(x) (x).begin(), (x).end()
#define pi 3.141592653589793
#define eps 0.00000001
#d... | #include <bits/stdc++.h>
using namespace std;
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ", "; os << "]"; return os; }
template<type... | 1 | 91,116,467 |
#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 <bits/stdc++.h>
#define rep_n(_1, _2, _3, NAME,...) NAME
#define rep_2(i, n) for(int i = 0; i < (int)(n); ++i)
#define rep_3(i, initial, n) for(int i = (int)(initial); i < (int)(n); ++i)
#define repeat(...) rep_n(__VA_ARGS__, rep_3, rep_2, rep_1)(__VA_ARGS__)
#define rep_r_n(_1, _2, _3, NAME,...) NAME
#define ... | 1 | 3,504,962 |
#include <iostream>
#include <cstdio>
using namespace std;
int main(){
while(1){
char c;
scanf("%c",&c);
if(c=='\n') { cout << endl; return 0;}
char d = c;
if(islower(c)) d = toupper(c);
else if(isupper(c)) d = tolower(c);
cout << d;
}
} | #include <cstdlib>
#include <string>
#include <iostream>
int main() {
std::string str;
getline(std::cin, str);
char r;
for (auto c: str) {
if (isupper(c)) {
r = tolower(c);
} else {
r = toupper(c);
}
std::cout << r;
}
std::cout << std::end... | 1 | 26,037,098 |
#include <bits/stdc++.h>
#include <iomanip>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265359
ll gcd(ll a, ll b){
if (a%b == 0){
return(b);
}
else{
return(gcd(b, a%b));
}
}
ll lcm(ll a, ll b){
return a / gcd(a, b)* b;
... | #include <iostream>
using namespace std;
int main() {
int a,b,k;cin >>a>>b>>k;
for(int i=0;i<k/2;++i){
if(a%2!=0)--a;
a/=2;
b += a;
if(b%2!=0)--b;
b/=2;
a += b;
}
if(k%2!=0){
if(a%2!=0)--a;
a/=2;
b += a;
}
cout << a << " " << b << endl;
return 0;
} | 1 | 57,777,041 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
#include <iomanip>
#include <climits>
#include <functional>
#include <cassert>
using namespace std;
typedef long long ll;
typedef pair<int,int> ... | #include <iostream>
#include <fstream>
using namespace std;
int main() {
int n, x, t;
cin >> n >> x >> t;
int time = 0;
while (n > 0) {
time = time + t;
n = n - x;
}
cout << time;
return 0;
} | 1 | 36,214,259 |
#include <cstdint>
#include <iostream>
#include <string>
#include <algorithm>
constexpr int32_t kMaxNumberOfMatrices = 100;
constexpr int32_t kMaxNumberOfRowsAndCols = 100;
void CallMatrixChainMultiplication(std::istream &input_stream);
struct Matrix {
int32_t number_of_rows{0};
int32_t number_of_columns{0};
};
str... | #include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<iostream>
using namespace std;
#define N_MAX 100
#define C_MAX 100
#define R_MAX 100
int p[N_MAX+1];
int m[R_MAX+1][C_MAX+1];
int chain_multiplication(int n)
{
for (int i = 0; i < n; i++) {
m[i][i] = 0;
}
for (int l = 1; l < n; l++) {
... | 1 | 36,024,275 |
#include <stdio.h>
void B_sort(int data[], int n) {
int tmp;
for (int i = 0; i < n-1; i++) {
for (int j = i+1; j < n; j++) {
if (data[i] < data[j]) {
tmp = data[i];
data[i] = data[j];
data[j] = tmp;
}
}
}
}
int ave(int data[], int n) {
int i;
int sum = 0;
int ave;... | #include <iostream>
#include <string>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int n;
int s[102];
void solve() {
int mini = 10000;
int maxi = -1;
int ans = 0;
rep(i, n) {
if (s[i] < mini) mini = s[i];
if (s[i] > maxi) maxi = s[i];
ans += s[i];
}
... | 1 | 27,970,196 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
int N;
int odd[100010], even[100010];
signed main()
{
cin >> N;
for(int i = 0; i < N; i++)
{
int a;
cin >> a;
if(i & 1) even[a]++;
else odd[a]++;
}
int odd_index = -1, odd_max = -1;
for(int i = 0; ... | #include <iostream>
#include <stack>
#include <algorithm>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <functional>
#include <string>
#include <cstdlib>
#include <numeric>
#include <cstdbool>
#include <cstring>
#include <map>
#include <set>
#include <queue>
#include <iomanip>
typedef long long ll;
#... | 1 | 98,105,236 |
#include <iostream>
using namespace std;
int main(){
int n , m;
cin >> n >> m;
int sum = 0 , num;
for(int i = 0; i < m; i++){
cin >> num;
sum += num;
}
if(n >= sum){
cout << n - sum << endl;
}
else{
cout << -1 << endl;
}
} | #include <iostream>
#include <vector>
#include<string>
#include <set>
#include <map>
#include <algorithm>
#include <math.h>
using namespace std;
int main()
{
int N;
int M;
cin >> N >> M;
vector<int>A(M);
int total = 0;
for(int i = 0;i<M;i++){
cin >> A[i];
total += A[i];
}
if(total>N){
std::cout << "-1" <<... | 1 | 41,437,821 |
#include<stdio.h>
main()
{
int a,b,c;
int i,div=0;
scanf("%d %d %d",&a,&b,&c);
for(i=a;i<=b;i++)
{
if((c/i*i)==c)div++;
}
printf("%d\n",div);
} | #include <iostream>
#include <string>
using namespace std;
int main()
{
int a, b, c;
cin >> a >> b >> c;
int c1[10000] = {0};
int length = 0;
for (int i = 1; i <= c; i++)
{
if (c % i == 0)
{
c1[length] = i;
length++;
}
}
int count = 0;
for (int i = a; i <= b; i++)
{
for (int j = 0; j < length; j... | 1 | 10,275,315 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b,c,d;
cin>>a>>b>>c>>d;
int kotae=min(b,d)-max(a,c);
if(kotae<=0){
cout<<0<<endl;
}else{
cout<<kotae<<endl;
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(){
int a,b,c,d;
cin >> a >> b >> c >> d;
if(a<=c && b<=d){
if(b-c>0) cout << b-c << endl;
else cout << 0 << endl;
}else if(a<=c && d<=b){
if(d-c>0) cout <... | 1 | 62,898,466 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, K;
cin >> N >> K;
double ans = (N - K + 1)*(N - K + 1 > 0);
for(int i = 1; i < min(N + 1, K); i++) {
for(int j = 0; j < 30; j++) {
if(i*(ll)pow(2, j) >= (ll)K) {
ans += pow(2, -1*j... | #include <iostream>
#include <cstdint>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unorder... | 1 | 48,556,149 |
#include<stdio.h>
#include<string.h>
int main(){
char number[1001]={0};
int i,sum,lon;
while(1){
scanf("%s",number);
if(strcmp(number,"0")== 0) break;
lon = strlen(number);
for(i=0;i<lon;i++){
sum +=number[i]-'0';
}
printf("%d\n",sum);
sum = 0;
}
} | #include "bits/stdc++.h"
using namespace std;
int main(){
string s;
int i,sum;
while(true){
cin >> s;
if(s == "0") break;
sum = 0;
for(i=0;i<s.length();i++){
sum += s.at(i)-'0';
}
cout << sum << endl;
}
return 0;
} | 1 | 9,646,186 |
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<climits>
#include<iostream>
#include<sstream>
#include<utility>
#include<map>
#include<vector>
#include<queue>
#include<algorithm>
#include<set>
#include<stack>
#include<functional>
using namespace std;
typedef long long ll;
typedef pair<int,... | #include <cmath>
#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
#include<queue>
#include<set>
#include<tuple>
#include<bitset>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll inf = 1000000007;
int d[200005];
int main(void) {
int n;
cin >> n;
ll ans = 0;
... | 1 | 3,833,530 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0; i<(n); i++)
#define REP2(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
const long long INF = numeric_limits<long long>::max();
int main()
{
char c;
cin >> c;
... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = s; i < (int)(n); i++)
typedef long long ll;
typedef vector<vector<ll>> vvl;
typedef vector<ll> vl;
typedef vector<vector<char>> vvc;
typedef vector<char> vc;
typed... | 1 | 66,034,926 |
#include <stdio.h>
int main(void) {
int H[100000], W[100000];
int i, j, k, n = 0;
do {
scanf("%d %d", &H[n], &W[n]);
n++;
} while (!(H[n - 1] == 0 && W[n - 1] == 0));
for (j = 0; j < H[0]; j++) {
for (k = 0; k < W[0]; k++) {
printf("#");
}
puts("");
}
for (i = 1; i < n; i++) {
... | #include <iostream>
int main(int argc, char const* argv[])
{
int h, w;
do {
std::cin >> h >> w;
for (size_t i = 0; i < h; i++)
{
for (size_t j = 0; j < w; j++)
std::cout << "#";
std::cout << std::endl;
}
if(h != 0 && w != 0)
std::cout << std::endl;
} while(h != 0 && w != 0);
return 0;
} | 1 | 61,644,556 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define printVec(v) printf("{"); for (const auto& i : v) { std::cout << i << ", "; } printf("}\n");
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 ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S,T;
cin >> S >> T;
if( S.size() < T.size() ){
cout << "UNRESTORABLE" << endl;
return 0;
}
bool same = true;
string ans = "UNRESTORABLE";
for(int i=0;i<=S.size()-T.size();i++){
for(int j=0;j<T.size();j++){
if( S.at(i+j) !=... | 1 | 57,643,858 |
#include<iostream>
#include<cstring>
#include<cmath>
#include<queue>
#include<cstdio>
#include<algorithm>
#define LL long long
#define INF 0x3f3f3f3f
using namespace std;
const int N=2e5+100;
const LL mod=1e9+7;
LL arr[N],ans[N];
LL fac[N],opp[N],op_fa[N];
LL mul(LL a,LL b){
LL base=a;
LL ans=1;
while(b){
if(b&1)a... | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
const long long MAXN = 1e5+5;
const long long MOD = 1e9+7;
long long fact[MAXN];
long long rem;
map<long long,long long> m1;
long long power(long long x, long long y, long long p)
{
long long res = 1;
x = x % p;
while (y > 0)
{
... | 1 | 30,351,574 |
#pragma region
#pragma GCC target("avx2")
#pragma GCC optimize("03")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std; typedef long double ld; typedef long long ll;
typedef unsigned long long ull;
#define endl "\n"
#define MP make_pair
#define FOR(i,a,b) for(int i=(a);i<=(b);i++)
#defin... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
int N;
vector<vector<int>> cand;
void DFS(vector<int> a) {
if ((int)a.size() == N) {
int num[4];
num[0] = 0;
num[1] = 0;
num[2] = 0;
num[3] = 0;
for (int i = 0; i < N; i++) {
... | 1 | 24,345,868 |
#include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define f first
#define s second
#define pb push_back
#define eb emplace_back
#define mk make_pair
#define mt make_tuple
#define MOD 1000000007
#define fo(i,a,b) for(i=a;i<b;i++)
#define foe(i,a,b) for(i=a;i<=b;i++)
#define all(x) x.begin(), x.end... | #include "bits/stdc++.h"
using namespace std;
using LL = long long;
template<class T>constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template<class T>constexpr T HINF() { return INF<T>() / 2; }
# define FOR(i,tptpt,ypypy) for(LL i=(tptpt);i<(ypypy);i++)
# define REP(i,upupu) FOR(i,0,upupu)
int d... | 1 | 33,538,911 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
int n,a,b; cin>>n>>a>>b;
if(n%(a+b)==0){
cout<<(n/(a+b))*a;
}
else if(n-n/(a+b)*(a+b)>a)
cout<<n/(a+b)*a+a<<endl;
else
cout<<n/(a+b)*a+n-n/(a+b)*(a+b)<<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i,n) for(ll i=0;i<ll(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=ll(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=ll(b);i--)
#define FORA(i,I) for(const auto& i:I)
#define ... | 1 | 34,809,249 |
#include<iostream>
using namespace std;
void magic(int a,int b,int c,int k)
{
for (int i = 0; i < k; i++)
{
if(a >= b)
{
if (b >= c)
c*=2;
else
b*=2;
}
else if (a < b) {
if(b*2 < c)
b*=2;
... | #include <bits/stdc++.h>
using namespace std;
template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl
using ll = long long;
const ll mod = 1e9+7;
const int maxn = 1e6 + 5;
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
i... | 1 | 16,614,792 |
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define fi first
#define se second
#define pi 3.1415926535
#define mod1 1000000007
#define mod2 1000000009
#define mp make_pair
#define no_of_digits(n) floor(log10(n)) + 1
#define lcm(a, b) (a/__gcd(a,b)*b)
using namespace std;
int main()
{
ios::syn... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int main(){
int n,ans=0,l[210],i;
cin >> n;
n=n*2;
for(i=0;i<n;i++){
cin >> l[i];
}
sort(l,l+n);
for(i=0;i<n;i++){
if(i%2==0){
ans+=l[i];
}
}
cout << ans << endl;
return 0;
} | 1 | 19,082,824 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
a.at(5) = ' ';
a.at(13) = ' ';
cout << a << endl;
} | #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;
string s;
long long ans = 0;
cin >> s;
s[5] = ' ';
s[13] = ' ';
cout << s << endl;
} | 1 | 1,974,513 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < (int)(N); ++i)
#define rep2(i, startValue, N) for (int i = (int)(startValue); i < (int)(N); ++i)
#define REP(type, name, beginValue, endCondValue) \
for (type name = beginValue; name < endCondValue; ++name)
#define VECTOR_DIM3(T, name... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int main() {
string s;
cin >> s;
string ans;
rep(i, (int)s.size()) {
if (s[i] == 'B') {
if(!ans.empty()) ans.pop_back();
}
else ans += s[i];
}
cout << ans << end... | 1 | 87,165,128 |
#include<bits/stdc++.h>
using namespace std;
int main()
{ string s;
long long d,sum=0,num;
cin>>s;
long long n=s.size();
for(int i=0 ; i<n ; i++){
d = s[i] - '0';
num = num * 10 + d;
sum+=d;
}
if(num%(sum)==0) cout<< "Yes"<< endl;
if(num%(sum)!=0) cout<< "No"<< endl;
return 0;
} | #include <iostream>
#include <cmath>
#include <climits>
#include <string>
#include <numeric>
#include <vector>
#include <queue>
#include <map>
#include <algorithm>
#include <functional>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
int X=0;
int Y = N;
for (int i = 0; i < 9; i++) {
X +=... | 1 | 59,394,271 |
#include "bits/stdc++.h"
using namespace std;
int main() {
int h, w, k;
cin >> h >> w >> k;
vector<string> s(h);
for (int i = 0; i < h; i++) cin >> s[i];
int ans = 0;
for (int is = 0; is < 1 << h; ++is) {
for (int js = 0; js < 1 << w; ++js) {
int cnt = 0;
for (int i = 0; i < h; ++i) {
for (int j = 0; ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define FOR(i,b,e) for(int i=(b); i<=(int)(e); i++)
#define DEBUG 1
#if DEBUG
#define _GLIBCXX_DEBUG
#define DUMP(a) REP(_i, a.size()) cout << a[_i] << (_i + 1 == a.size() ? "\n" : " ")
#define DUMP2D(b) REP(_j, b.size(... | 1 | 56,746,722 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long n,z,w,ans;
cin >> n >> z >> w;
vector<long> a(n);
for(long i=0;i<n;i++) cin >> a[i];
ans=labs(a[n-1]-w);
if(n>1) ans=max(ans,labs(a[n-2]-a[n-1]));
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef vector<vector<vector<ll>>> vvvl;
struct edge{ll to,cost;};
const int inf = 1<<28;
const ll INF = 1LL<<53;
const int COMBMAX = 500005;
const ll MOD = 1e9+7;
#define _... | 1 | 19,065,850 |
#pragma GCC optimize(3)
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
bool Finish_read;
template<class T>inline void read(T &x){Finish_read=0;x=0;int f=1;char ch=getchar();while(!isdigit(ch)){if(ch=='-')f=-1;if(ch==EOF)return;ch=getchar();}while(isdigit(ch))x=x*10+ch-'0',ch=getchar();x*=f;Finish_re... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; i++)
#define rep1(i, n) for(int i=1; i<=n; i++)
#define repr(i, n) for(int i=n-1; i>=0; i--)
#define repr1(i, n) for(int i=n; i>=1; i--)
#define all(v) v.begin(),v.end()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<in... | 1 | 1,974,597 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n = 0;
cin >> n;
float Ax, Ay, Bx, By, Cx, Cy, Dx, Dy;
vector<pair<float, float> > A;
vector<pair<float, float> > B;
vector<pair<float, float> > C;
vector<pair<float, float> > D;
for(int i = 0; i < n; i++... | #include <bits/stdc++.h>
#define int long long
#define main signed main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecision(n)
#define stlice(from, to) substr(from, (t... | 1 | 36,941,772 |
#include<iostream>
#include<vector>
#include<string>
using namespace std;
int main(){
int ans,n,h;
string m1,m2;
int a[4]={1000,100,10,1};
char c[4]={'m','c','x','i'};
vector<char>m;
cin>>n;
while(n--){
ans=0;
h=1;
int f,g;
cin>>m1>>m2;
m.clear();
f=m1.size();
for(int i=0;i<f;i++){
for(int j=0;j... | #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{
... | 1 | 92,054,043 |
#include<iostream>
#include<vector>
#include<string>
using namespace std;
struct tree {
vector<int> children;
int depth;
int parent;
string type;
};
tree trees[100000];
int calc_depth(int n) {
for (vector<int>::iterator i = trees[n].children.begin(); i < trees[n].children.end(); i++) {
trees[*i].depth = trees[n... | #include <iostream>
#include <vector>
using namespace std;
static int current_depth = 0;
struct Node{
Node() : parent(-1), depth(-1) {}
int parent, depth;
vector<int> cld_;
};
void bfs(int pos, vector<Node>& tree){
tree[pos].depth = current_depth;
for(int i=0; i<tree[pos].cld_.size(); i++){
current_depth+... | 1 | 16,749,440 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
int main() {
ll n;
cin >> n;
string s,h;
cin >> s >> h;
string ans;
for(ll i=0;i<n;i++){
ans.push_back(s[i]);
ans.push_back(h[i]);
}
cout << ans << endl;
} | #include<bits/stdc++.h>
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define int long long
#define endl "\n"
#define mod 1000000007
#define mod2 998244353
#define double long double
#define pb push_back
#define swap(x,y) (x^=y^=x^=y)
#define TC int TESTCASE;cin>>TESTCASE;while(TESTCASE--)
#defi... | 1 | 48,481,884 |
#include <bits/stdc++.h>
inline void print(const std::vector<std::string>& grid, const std::vector<bool>& cols) {
for (std::size_t r = 0; r < grid.size(); ++r) {
for (std::size_t c = 0; c < grid[r].size(); ++c)
if (cols[c])
std::cout << grid[r][c];
std::cout << std::endl;... | #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() {
int h, w;
cin >> h >> w;
vector<string> a(h);
rep(i,h) cin >> a[i];
vector<int> r(h), c(w);
rep(i,h){
rep(j,w... | 1 | 7,110,896 |
#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
using namespace std;
#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)
type... | #include <bits/stdc++.h>
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=(int)(a)-1;i>=(int)(b);--i)
#de... | 1 | 47,653,853 |
#include<cstdio>
#include<iostream>
using namespace std;
int main() {
int a, b, c;
string result;
scanf("%d %d %d", &a, &b, &c);
if (a < b && b < c) {
result = "Yes";
} else {
result = "No";
}
printf("%s\n", result.c_str());
} | #include <cstdlib>
#include <string>
#include <iostream>
std::string get_range(int a, int b, int c) {
std::string ans;
if (a < b && b < c) {
ans = std::string {"Yes"};
} else {
ans = std::string {"No"};
}
return ans;
}
int main() {
int a;
int b;
int c;
std::cin >> a;
... | 1 | 86,845,917 |
#include "bits/stdc++.h"
#define rep(i,b) for(ll i=0;i<b;i++)
#define ll long long
using namespace std;
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vvvl vector<vector<vector<ll>>>
#define debug(x) cerr<<#x<<" "<<x<<'\n';
int cnt[200003],n,k;
long long ans;
map<int,int>mp;
int main(void) {
cin>>n>>k... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, k;
ll A[200005], S[200005];
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> A[i];
A[i]--;
S[i + 1] = (S[i] + A[i] + k) % k;
}
ll ans = 0;
map<int, int> mp;
for(int i = 0; i <= n; i... | 1 | 94,030,866 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N, A, B;
cin >> N >> A >> B;
cout << (N/(A + B))*A + (N%(A + B) >= A)*A + (N%(A + B) < A)*(N%(A + B))<< endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
#define _GLIBCXX_DEBUG
int main() {
ll N, A, B;
cin >> N >> A >> B;
ll tmp1, tmp2, ans;
tmp1 = N / (A+B);
tmp2 = N % (A+B);
if(tmp2 < A ){
ans = tmp1 * A + tmp2;
}else{
ans = tmp1 * A + A;
}
... | 1 | 91,124,288 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define RAP(i, n) for(ll i=0;i<(n);i++)
#define FOR(i, a, b) for(ll i=(a);i<(b);i++)
#include <iostream>
#include <vector>
using namespace std;
vector<ll> buf;
void permutation(ll i, const ll size, const ll range_start, const ll range_end)
{
if (i... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<int,int>;
int n;
vector<int> bmb;
int a, b, c;
int ans;
void dfs(vector<int> &A){
if(A.size() == n){
int len_a = 0, len_b = 0, len_c = 0;
int cnt = 0;
for(int i = 0; i < n; i++){
if(A[i] == 0){
... | 1 | 60,296,707 |
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
while(true){
int n;
cin >> n;
if(n==0)
break;
int a[5000];
for(int i=0; i<n; i++){
cin >> a[i];
}
int DP[5000];
DP[0] = a[0];
int s_max = DP[0];
for(int i=1; i<n; i++){
DP[i] = max(DP[i-1]+a[i], a[i]);
s_max = ma... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int v[5001];
int main(){
int n;
while(cin >> n,n){
rep(i,n) cin >> v[i];
int sum = 0 , mx = *max_element(v,v+n);
for(int i = 0 ; i < n ; i++){
if(sum+v[i]<0){
sum = 0;
}else{
sum +... | 1 | 15,305,197 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;
template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (int i=(int)from; i<(int)to; i++)
#define all(vec) vec.begin(), vec.e... | #include <iostream>
#include <cstring>
#define ll long long
using namespace std;
int n, p, value[105];
ll memo[55][5005];
ll calculate(int i, ll sum){
if(memo[i][sum]!=-1)return memo[i][sum];
if(i>n){
if(sum%2== p)return 1;
else return 0;
}
ll t = calculate(i+1, sum+value[i]);
ll nt ... | 1 | 4,273,613 |
#include <bits/stdc++.h>
using namespace std;
#define ALL(c) c.begin(), c.end()
#define SZ(x) ((int)(x).size())
#define pb push_back
#define mp make_pair
#define DB(a) cerr << #a << " = " << (a) << endl;
#define OUT( a , n ) for( int J = 0; J < (n); J++ )cout<< (a)[J] << " \n"[J == (n) - 1 ]
#define WAIT cout << flush ... | #include<cstdio>
using ll=long long;
int ask(ll n)
{
char r[1+2];
printf("? %lld\n", n);
fflush(stdout);
scanf("%1s", r);
return r[0]=='Y';
}
int search_one(ll offset, int s_initial)
{
int s, e, c, r, ans=0;
s=s_initial;
e=9;
for(;s<=e;)
{
c=(s+e)/2;
r=ask(c+offset);
if(r)
{
s=c+1;
ans=c;
}
... | 1 | 31,388,830 |
#include<bits/stdc++.h>
using namespace std;
int main(){int N , A , B; cin >> N >> A >> B; puts((B - A) & 1 ? "Borys" : "Alice"); return 0;} | #include <bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(),(a).end()
#define rALL(a) (a).rbegin(),(a).rend()
typedef pair<int, int> Pint;
typedef pair<int64_t, int64_t> Pll;
int main() {
int N, A, B;
cin >> N >> A >> B;
if ((B - A) % 2 == 1){
cout << "Borys" << endl;
}
else {
... | 1 | 22,057,460 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <cstdio>
#include <utility>
#include <string>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <numeric>
using namespace std;
typedef uin... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define rep(i,x,y) for(ll i=x;i<y;i++)
#define irep(i,a) for(auto i = a.begin(); i != a.end(); ++i)
#define nvarep(n,a) ll n;cin>>n;vector<ll>a(n);rep(i,0,n)cin>>a[i]
#define vecrep(n,a,type) vector<type>a(n);rep(i,0,n)cin>>a[i]
#d... | 1 | 10,886,803 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c,k;
cin>>a>>b>>c>>k;
int sum = 0;
for(;k > 0; k--){
if(a > 0){
a--;
sum++;
}else if(b > 0){
b--;
}else if(c > 0){
c--;
sum--;
}
}
cout<<sum<<endl;
} | #include <bits/stdc++.h>
#define yes cout<<"YES"<<endl
#define no cout<<"NO"<<endl
#define sz(x) x.size()
#define ll long long int
#define ls long int
#define start ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define test int t;... | 1 | 25,975,539 |
#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using WGraph = vector<vector<pair<int, ll>>>;
template<class T>bool chmax(T &a, const T &b) { if (b > a) { a = b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 1; i <= (n); i++)
signed main(void)
{
int v[5];
rep(i, 4) v[i] = 0;
rep(i, 3)
{
int a, b;
cin >> a >> b;
v[a]++;
v[b]++;
}
if (v[1] <= 2 && v[2] <= 2 && v[3] <= 2 && v[4] <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl... | 1 | 51,378,998 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int AA=0;
int BB=0;
string S;
cin>>S;
vector<char>A(S.size());
for(int X=0;X<S.size();X++){
if(X%2==0){
A.at(X)='1';
}
else{
A.at(X)='0';
}
}
for(int X=0;X<S.size();X++){
if(S.at(X)==A.at(X)){
AA++;
}
... | #include <bits/stdc++.h>
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; return 1; } return 0; }
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++... | 1 | 17,438,534 |
#include<iostream>
#include<set>
#include <bitset>
#include<queue>
#include<vector>
#include<map>
#include<stack>
#include <cstdio>
#include<algorithm>
#include <sstream>
#include<string>
#include<string.h>
#include <cmath>
#include <iomanip>
#include <string>
#include<list>
#include <limits>
#include <numeric>
#includ... | #include<iostream>
#include<vector>
#define rep(i, start, end) for (int i = (int)start; i < (int)end; ++i)
#define rrep(i, start, end) for (int i = (int)start - 1; i >= end; --i)
#define arep(i, c) for (auto i = (c).begin(); i != (c).end(); ++i)
#define all(x) (x).begin(), (x).end()
using namespace std;
int main() {
... | 1 | 84,397,651 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.