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 ff first
#define ss second
#define ll long long int
#define pb push_back
#define ar array
#define mp make_pair
#define f(i,n) for(ll i =0;i<n;i++)
#define inf INT_MAX
#define pll pair<ll, pair<ll,ll>>
const ll INF = 1e... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i = 0;i<((ll)(n));i++)
#define reg(i,a,b) for(ll i = ((ll)(a));i<=((ll)(b));i++)
#define irep(i,n) for(ll i = ((ll)(n)-1);i>=0;i--)
#define ireg(i,a,b) for(ll i = ((ll)(b));i>=((ll)(a));i--)
template<class T = int> using V = vect... | 1 | 30,317,712 |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,... | #include<bits/stdc++.h>
#include<cctype>
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 pi 3.1415926535897932384
#define E9 10000... | 1 | 12,250,365 |
#include<iostream>
#include<string>
using namespace std;
int main(){
char ch[100],s[100],str[200];
int n=0,i=0,j=0;
cin>>n;
cin.ignore();
cin>>ch;
cin>>s;
while(i<n){
str[j]=ch[i];
j++;
str[j]=s[i];
j++;
i++;
}
for(i=0;i<(2*n);i++)
cout<<str[i];
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
string S;
cin >> S;
string T;
cin >> T;
for (int i=0;i<N;i++){
cout << S.at(i) <<T.at(i);
if(i==N-1){
cout << endl;
}
}
} | 1 | 44,613,899 |
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout <<(#x)<<" is "<<(x)<<endl
#define debug cout <<"hi"<<endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, i... | #include <iostream>
using namespace std;
int main() {
int r; cin>> r;
int D; cin>> D;
int wt; cin>>wt;
for(int a=1; a<11; a++){
wt= (r*wt)-D;
cout<< wt<< endl;
}
return 0;
} | 1 | 3,911,287 |
#include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << 1 + (a != b) + (a != c && b != c) << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using str = string;
using P = pair<int, int>;
using Pll = pair<ll, ll>;
const double PI = 3.141592653589793238;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define REP(i, m, n) for (int i = m; i < (int)n; i++)
#def... | 1 | 68,903,665 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,K;
int min = 1;
cin >> N >> K;
int i = 1;
while (i <= N) {
if((min * 2 - min) < K){
min *= 2;
}else{
min += K;
}
i++;
}
cout << min << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); i++)
int main() {
int N, K;
cin >> N >> K;
int j = 1;
rep(i, N) {
if (j * 2 < j + K) {
j *= 2;
}
else {
j += K;
}
}
cout << j << endl;
} | 1 | 56,143,298 |
#include <iostream>
#include <string>
using namespace std;
int main(void){
int H, W;
string hori;
int i;
while(!cin.eof()){
cin >> H >> W;
if(!H && !W) return 0;
hori = string(W, '#');
for(i = 0; i < H; i++){
cout << hori << endl;
}
cout << end... | #include <iostream>
using namespace std;
int main()
{
int h, w, ww;
cin >> h >> w;
while((h != 0) && (w != 0)) {
while(h--) {
ww = w;
while(ww--)
cout << '#';
cout << endl;
}
cout << endl;
cin >> h >> w;
}
return 0;
} | 1 | 35,769,856 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vb=vector<bool>;
using vvb=vector<vb>;
using vd=vector<double>;
using vvd=vector<vd>;
using vi=vector<int>;
using vvi=vector<vi>;
using vl=vector<ll>;
using vvl=vector<vl>;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
using tll=tuple<ll,ll>;
usi... | #include <bits/stdc++.h>
using namespace std;
int64_t gcd(int64_t a,int64_t b){return (a%b==0?b:gcd(b, a%b));}
int64_t lcm(int64_t a,int64_t b){return a/gcd(a, b)*b;}
int factorial(int a){int b=1;while(a){b*=a--;}return b;}
bool is_prime(int64_t a){if(a<=1)return false;for(int64_t i=2;(int64_t)i*i<=a;i++){if(a%i==0)re... | 1 | 55,703,011 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for (ll i = 0; i < (n); ++i)
#define rep2(i,a,b) for (ll i = (a); i < (b); ++i)
#define INF 1E18
int main(){
int n;
cin>>n;
int h[n];
rep(i,n) cin>>h[i];
int ans = 1;
rep2(i,1,n){
bool flag = true;
... | #include<iostream>
using namespace std;
int main(void){
int N,i,max,count=0;
int mount[21]={0};
cin >> N;
for(i=1;i<=N;i++){
cin >> mount[i];
}
for(i=1;i<=N;i++){
if(i==1){
count++;
max = mount[1];
}else if(mount[i]>=max){
count++;
... | 1 | 43,630,706 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using lint=long long;
class union_find{
int n;
vector<int> p;
public:
union_find(int n):n(n),p(n,-1){}
int find(int u){ return p[u]<0?u:p[u]=find(p[u]); }
void unite(int u,int v){
u=find(u); v=find(v);
if(u!=v){
if(p[v]<p[... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 100005;
typedef long long ll;
int col[MAXN];
vector<int> g[MAXN];
bool dfs(int v, int c)
{
col[v] = c;
bool flag = true;
for (int i = 0; i < g[v].size(); i++)
{
int to = g[v][i];
if (!col[to]) flag &= dfs(to, 3-c);
el... | 1 | 50,281,403 |
#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,m;
cin >> n >> m;
vector<int> a(n);
rep(i,n) cin >> a[i];
int s = 0;
rep(i,n) s += a[i];
int cnt = 0;
rep(i,n) {
if(s <= a[i]*(4*m)) cnt++;
}
if... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = int64_t;
#define rep(i, j, n) for (int i = j; i < (int)n; ++i)
#define rrep(i, j, n) for (int i = (int)n - 1; j <= i; --i)
int main() {
int ... | 1 | 79,443,714 |
#include <bits/stdc++.h>
using namespace std;
typedef unsigned int INT;
typedef unsigned long long LONG;
typedef long long LL;
typedef pair<int, int> PII;
const int N = 1e5 + 10;
const int mod = 998244353;
#define debug(x) cerr << #x << ": " << (x) << '\n'
#define FW freopen("data2.txt", "w", stdout);
template <class T... | #include <bits/stdc++.h>
typedef long long LL;
using namespace std;
const int MOD = 998244353;
void solve_test() {
LL n;
int x, m;
cin >> n >> x >> m;
LL sum = 0;
vector<int> marked(m, -1);
vector<int> values;
int t = x, i = 0;
while (n > 0 && marked[t] == -1) {
marked[t] = i;
values.push_back(t);
sum += ... | 1 | 71,266,508 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define ll long long
#define bp __builtin_popcount
#define endl "\n"
#define oo 0x3f3f3f3f3f3f3f3fLL
#define pb push_back
#define loop(i,n) for(int i = 0;i < int(n);i++)
#define range(i,a,b) for(int i = int(a);i <= int(b);i++)
#define sz(s) (int)(s.size... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define sc(x) scanf("%d",&x);
int main(){
int n; sc(n)
vector<int> a(n);
for (int i = 0; i < n; i++) sc(a[i])
for (int i = 0; i < n; i++) a[i] = a[i] - (i+1);... | 1 | 46,450,623 |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define ld long double
#define ll long long int
#define ull unsigned long long int
#define pb push_back
#define mp make_pair
#define F first
#define S se... | #include<iostream>
#include<algorithm>
#include<string>
#include<bits/stdc++.h>
using std::string;
int main()
{
int N;
std::cin >> N;
int arr[2 * N];
for(int i = 0; i < 2 * N; i++)
{
std::cin >> arr[i];
}
int n = sizeof(arr)/sizeof(arr[0]);
std::sort(arr, arr + n);
int ans =... | 1 | 8,958,494 |
#include <cstdio>
#include <iostream>
#include <cmath>
#include <ctype.h>
#include <string>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#include <set>
#include <list>
#include <cstring>
#include <stack>
using namesp... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
#define pb emplace_back
typedef long long ll;
typedef pair<int,int> pint;
int main(){
int n;
cin>>n;
string s,t;
while(n--){
cin>>s>>t;
int si=0;
rep(i,s.size()... | 1 | 46,596,688 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef map<int,int> mii;
typedef pair<int,int> pii;
typedef vector<pii> vpii;
#define int ll
#define F first
#define S second
#define endl "\n"
#define MP make_pair
#define PB push_back
#define WL(t)... | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main(void){
int n;
cin >> n;
string s, t;
cin >> s >> t;
string ans = "";
for (int i = 0; i < n; i++){
ans += s[i];
ans += t[i];
}
cout << ans << endl;
} | 1 | 65,222,949 |
#include <stdio.h>
#include <string>
#include <cstring>
#include <stdlib.h>
#include <math.h>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <iterator>
#include <assert.h>
#pragma warning(disable:4996)
typedef long long ll;
#define MIN(a,... | #define LOCAL
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<(n); ++i)
#define rrep(i, n) for(int i=(n-1); i>=0; --i)
#define rep2(i, s, n) for(int i=s; i<(n); ++i)
#define ALL(v) (v).begin(), (v).end()
#define memr(dp, val) memset(dp, val, sizeof(dp))
using namespace std;
typedef long long ll;
static const ... | 1 | 48,715,949 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
using namespace std;
int main(){
int N, M;
cin >> N >> M;
int WA[N+1];
bool AC[N+1];
rep(i, N+1){
AC[i] = false;
WA[i] = 0;
}
rep(i, ... | #include<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
const int mod=1000000007 ;
void solve(){
int n ,m ;
cin>>n>>m ;
vector<int> AC(n) ;
vector<int> pen(n) ;
for(int i=0;i<m;i++){
int p ;
string s ;
cin>>p>>s ;
p-- ;
if(AC[p]==1){
continue ;
}
else{
if(s=="WA"){
pen[p]++ ;
... | 1 | 24,118,024 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i < (int)(n); i++)
using ull = unsigned long long;
using ll = long long;
int main() {
ll N, A, B;
cin >> N >> A >> B;
B = B - A;
A = 0;
ll ans = 0;
if (B < 0) ans = 0;
else if (B == 0) ans = 1;
else {
i... | #include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstring>
using namespace std;
#define ll long long
ll n,a,b;
int main(){
scanf("%lld%lld%lld",&n,&a,&b);
if (n>1&&b>=a||n==1&&a==b) printf("%lld\n",(n-2)*(b-a)+1);
else puts("0");
} | 1 | 91,416,436 |
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define dump(...)
#endif
#define endl "\n"
#define ll long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#... | #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... | 1 | 72,722,743 |
#include<bits/stdc++.h>
using namespace std;
#define LL long long
inline LL read();
const int N=50+2;
LL n;
LL cnt, a[N];
bool Minus()
{
int id=0;
for(int i=1; i<=n; ++i)
if(a[i]>a[id]) id=i;
if(id)
{
LL k=a[id]/n; a[id]%=n; cnt+=k;
for(int j=1; j<=n; ++j)
if(j^id) a... | #include <bits/stdc++.h>
using namespace std;
#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 all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
#define get_unique(x) x.erase(unique(all(x)), x.end());
typedef long long ll;
typedef complex<do... | 1 | 37,906,936 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define rep2(i,a,n) for(int i=(a); i<(n); i++)
#define all(vec) vec.begin(),vec.end()
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
int main() {
string S; cin >> S;
map<char, int> ... | #include <bits/stdc++.h>
#define ll long long
#define sz(x) (int)x.size()
using namespace std;
int main(){
string t;
set<char>s;
cin>>t;
for(char c:t){
s.insert(c);
}
cout<<(sz(t)==sz(s)?"yes":"no");
} | 1 | 90,157,371 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
int main(){
int a,b;
cin >> a >> b;
for(int i=1; i<100000; i++){
if(a==i*8/100 && b==i*10/100){
cout << i << endl;
return 0;
}
}
cout << -1 << endl;
... | #include <iostream>
#include <string>
#include <cmath>
#include <iomanip>
#include <queue>
#include <algorithm>
using namespace std;
int min(int a,int b){
return a<b?a:b;
}
int main(void){
int A,B;
cin >> A >> B;
int xa,xb;
xa = (A*100+8-1) / 8;
xb = (B*100+10-1) / 10;
int ans;
if(int(xa... | 1 | 62,700,837 |
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#... | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
typedef long long ll;
int n;
int a[N];
ll ans;
ll ps[N];
map<ll, int> freq;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
cin >> n;
for(int i = 1; i <= n; i++) {
cin >> a[i];
ps[i] = ps[i - 1] ... | 1 | 64,207,290 |
#include<bits/stdc++.h>
using namespace std;
const long P=1000000007;
int main(){
long N;cin>>N;string S;cin>>S;
vector<long>A(26,1);
for(char c:S)A[c-97]++;
long ans=1;
for(long x:A)ans=(ans*x)%P;
cout<<(ans-1+P)%P;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long llint;
const long long MOD = 1e9 + 7;
int main() {
int n;
string s;
cin >> n >> s;
llint ans = 1;
vector<llint> used(26, 0);
for (int i = 0; i < n; i++) {
int d = s[i] - 'a';
used[d]++;
}
for (int i = 0; i < 26; i++) {
if (used[... | 1 | 4,837,359 |
#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> W(N);
rep(i, N) cin >> W.at(i);
int sum = 0;
rep(i, N) {
sum += W.at(i);
... | #include<bits/stdc++.h>
using namespace std;
const int MAX_N=1e6;
int seg_tree[2*MAX_N+5],n;
void build()
{
for(int i=n-1; i>0; --i)
seg_tree[i]=__gcd(seg_tree[i<<1],seg_tree[i<<1|1]);
}
void modify(int pos,int val)
{
for(seg_tree[pos+=n]=val; pos>1; pos>>=1)
seg_tree[pos>>1]=__gcd(seg_tree[pos],seg_tree[pos^1]);
}
int... | 1 | 70,117,474 |
#include <iostream>
#include <algorithm>
using namespace std;
int main(void)
{
int n;
int cnt = 0;
int a[128];
cin >> n;
for (int i = 0; i < n; i++){
cin >> a[i];
}
for (int i = 0; i < n - 1; i++){
int mini = i;
for (int j = i; j < n; j++){
if (a[mini] > a[j]) mini = j;
}
if (mini != i){
swap(a[m... | #include <iostream>
using namespace std;
int SelectionSort(int a[],int n);
int main(){
int a[1000],n;
cin>>n;
for(int i=0;i<n;i++){
cin>>a[i];
}
int count =SelectionSort(a,n);
for(int i=0;i<n;i++){
if(i)cout<<" ";
cout<<a[i];
}
cout <<'\n';
cout <<count<<'\n';... | 1 | 24,740,763 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <string>
#include <queue>
#include <utility>
using namespace std;
int main() {
int N;
int C[]={500,100,50,10,5,1};
while(scanf("%d",&N),N) {
N=1000-N;
int sum=0;
for(int i=0;i<6;i++) {
sum+=N/C[i];
N... | #include<cstdio>
using namespace std;
int money[6]{500,100,50,10,5,1};
void solve(int price){
int ans{0};
for(int i{0} ; i< 6 ; i++){
while(price >= money[i]){
price -= money[i];
ans++;
}
}
printf("%d\n",ans);
}
int main(){
int price;
while(true){
scanf("%d",&price);
if(price == ... | 1 | 18,060,454 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long int a,b,c,x3=0,t;
string s;set<char>k;
cin>>s;
for(int i=0;i<s.size();i++){
k.insert(s[i]);}
if(k.size()==s.size())cout<<"yes";
else cout<<"no";
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) begin(v),end(v)
using ll = long long;
int main() {
string s;cin>>s;
bool ans=true;
rep(i,s.size())for(int j=i+1;j<s.size();j++){
if(s[i]==s[j])ans=false;
}
if(ans)cout<<"yes"<<endl;
else cout<<"n... | 1 | 88,302,493 |
#include<bits/stdc++.h>
using namespace std;
using ll = int64_t;
const ll MOD = 1e9 + 7;
int main(){
ll n, m;
cin >> n >> m;
ll po = 0, yo = 0;
for(ll i = 0; i < n; i++){
ll x;
cin >> x;
x *= (2 * i - n + 1);
po += x;
if(po < 0) po += -po / MOD * MOD + (-po % MOD ... | #include <bits/stdc++.h>
#define int long long
using namespace std;
#define rep(i,s,n) for(int i = s;i<n;i++)
#define repe(i,s,n) for(int i = s;i<=n;i++)
#define pb push_back
#define fi first
#define se second
typedef long long ll;
typedef pair<int,int>pint;
typedef vector<int>vint;
typedef vector<pint>vpint;
static co... | 1 | 5,193,926 |
#include<iostream>
using namespace std;
int main()
{
long long n,a=1;
cin >> n;
for (int i = (int)n; i >= 2; i--){
a *= i;
}
cout << a << endl;
} | #include <iostream>
#include <cstring>
using namespace std;
#define N 300
int a[N+1];
int main()
{
int n; cin >> n;
memset(a, 0, sizeof(a));
a[0] = 1;
for (int i=2; i<=n; ++i) {
for (int j=0; j<N; ++j) a[j] *= i;
for (int j=0; j<N; ++j) {
a[j+1] += a[j] / 10;
a[j]... | 1 | 74,791,423 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m; i >= n; --i)
#define ALL(v) (v).begin(),(v... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef vector<char> vc;
typedef queue<ll> ql;
typedef deque<ll> dql;
typedef priority_queue<ll, vl> pql;
typedef set<ll> sl;
typedef pair<ll, ll> pl;
typedef vector<vl> vvl... | 1 | 89,090,493 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for (int i = s; i < (int)(n); i++)
#define out(x) cout << x << endl
#define INF 1000000;
#include <map>
#include <math.h>
using ll = long long;
using nam... | #include<bits/stdc++.h>
using namespace std;
int main(){int A,B;cin>>A>>B;if(A*B%2==0)cout<<"Even"<<endl;else cout<<"Odd"<<endl;} | 1 | 17,737,655 |
#include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef long double lld;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265359
#define MOD 998244353
int main(){
stri... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string o, e; cin >> o >> e;
string ans = "";
int o_index = 0;
int e_index = 0;
for (int i = 0; i < o.size() + e.size(); i++) {
if (i % 2 == 0) {
ans += o[o_index];
o_index++;
}
else {
ans += e[e_index];
e_index++;
... | 1 | 94,698,480 |
#include<bits/stdc++.h>
using namespace std;
#define REP(i,s,n) for(int i=s;i<n;++i)
#define rep(i,n) REP(i,0,n)
typedef long long ll;
ll mod = 1000000007LL;
ll sum[63][2], A[300010];
ll modmultiply(ll a,ll b,ll c) {
ll x = 0,y = a%c;
while(b > 0) {
if(b%2 == 1) x = (x+y)%c;
y = (y*2)%c;
b /= 2;
}
... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
const ll MOD = 1000000007;
int main() {
ll N;
cin >> N;
vector <ll> A(N);
for (int ii = 0; ii < N; ++ii){
cin >> A[ii];
}
ll ans = 0;
vector <ll> digZero(61);
vector <ll> digOne(61);... | 1 | 38,163,890 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,ini,n) for(int i=ini;i<n;i++)
#define _rep(i,ini,n) for(int i=ini;i>=n;i--)
#define ToEnd(a) a.begin(),a.end()
uint64_t MOD=1000000007;
int main(){
int x1,y1,x2,y2;
cin>>x1>>y1>>x2>>y2;
int dX=x2-x1,dY=y2-y1,x3,y3,x4,y4;
y3=y2+dX;x3=x2-dY;
... | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
int main() {
int x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
int p = x1 - x2;
int q = y1 - y2;
cout << x2 + q << ' ';
cout << y2 - p << ' ';
cout << x1 + q << ' ';
cout << ... | 1 | 7,605,504 |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define rep(i,n) for(int i = 0; i < ((int)(n)); i++)
int main() {
ll N; cin >> N;
vector<ll> A(N), B(N);
rep(i,N) cin >> A.at(i);
vector<pair<ll, ll>> plus, minus;
ll sump = 0, summ = 0;
rep(i,N) {
cin >> B.at(i);
... | #include<bits/stdc++.h>
using namespace std;
const long long maxn=1e5+5;
const long long inf=0x3f3f3f3f;
long long a[maxn],b[maxn],ans,sum1,sum2,sum,minu;
priority_queue<long long> q;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long n;
cin>>n;
for(long long i=1;i<=n;i++)
{
cin>>a[i];... | 1 | 4,865,823 |
#include<stdio.h>
int n;
int ans;
int i;
int c[6]={500,100,50,10,5,1};
int main(){
while(1){
scanf("%d",&n);
if(n==0)return 0;
ans=0;
n=1000-n;
for(i=0;i<6;i++){
ans+=(int)n/c[i];
n%=c[i];
}
printf("%d\n",ans);
}
} | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
typedef long long lint;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define trep(i, k, n) for (int i = (k); i < (int)(n); ++i)
typedef pair<int, int> P;
int v[6] = {500, 100, 50, 10, 5, 1};
int greed(int n)
{
int count = 0;
rep(i, 6)
... | 1 | 28,849,558 |
#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define double long double
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ff first
#define ss second
#define pb push_back
#define pf push_front
#define endl "\n"
const int N = 105;
int a[N];
unordered_map<int, ... | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(v) v.begin(), v.end()
#define mem(arr) memset(arr, 0, sizeof(arr))
#define ff first
#define ss second
#define int long long int
const int MOD = 1e9 + 7;
const int INF = 1e18;
const int N = 1e6 + 1;
vector<int> g[N];
vector<int> vis(N);
int32_... | 1 | 1,222,012 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <functional>
#include <limits.h>
#include <set>
#include <map>
#include <tuple>
using namespace std;
#define ll long long
#define ull unsigned long long
#define rep... | #include<bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define fo(i,n) for(int i=0;i<n;i++)
#define Fo(i,k,n) for(i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define ll long long
#define si(x) scanf("%d",&x)
#define sl(x) scanf("%lld",&x)
#define ss(s) scanf("%s",s)
#define pi(x) printf("%d\n",x)
#define pl(x) pri... | 1 | 91,951,785 |
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout << (#x) << " is " << (x) << endl
#define debug cout << "hi" << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef p... | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define int long long
const int N = 2e3 + 5;
int n, m;
char c[N][N];
int a[N][N], l[N][N], u[N][N], r[N][N], d[N][N];
int32_t main()
{
IOS;
cin >> n >> m;
for(int i = 1; i <= n; i++)
for(in... | 1 | 21,553,885 |
#include <iostream>
using namespace std;
int main(void){
int m,f,r;
while(1){
cin >> m >> f >> r;
if(m == -1 && f == -1 && r == -1){
break;
}
else if(m == -1 || f == -1){
cout << "F";
}
else if(m + f >= 80){
cout << "A";
... | #include <iostream>
using namespace std;
void grade(char c) {
cout << c << endl;
}
int main() {
cin.tie(0); ios::sync_with_stdio(false);
int m, f, r;
while (true) {
cin >> m >> f >> r;
if (m == -1 && f == -1 && r == -1) break;
if (m == -1 || f == -1 || m + f < 30) { grade('F'); continue; }
if (m + f >= 80) ... | 1 | 38,717,286 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mx = 1e6 + 9;
vector<ll>adj[mx];
bitset<mx>mark;
ll dist[mx];
int main() {
ll n, m; cin >> n >> m;
for(ll i = 0; i < m; i++) {
ll u, v; cin >> u >> v;
adj[u].push_back(v);
adj[v].push_back(u);
}
bool nafi... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
string char_to_string(char val) {
return string(1, val);
}
int char_to_int(char val) {
return val - '0';
}
template<class T> inline bool chmin(T& a, T b... | 1 | 4,804,599 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (ll i = m; i < (n); i++)
using ll = long long;
using pii = pair<int, int>;
using Vi = vector<int>;
int main() {
int n,a;
cin >>n>>a;
if(n%500<=a) cout << "Yes" << endl;
else cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A;
cin >> N >> A;
if (A >= 499) {
cout << "Yes" << endl;
}
else if ( (N % 500) <= A) {
cout << "Yes" << endl;
}
else {cout << "No" << endl;
}
} | 1 | 85,947,429 |
#include <iostream>
using namespace std;
typedef long long ll;
int main(){
int N;
cin>>N;
ll res=1;
for(int i=1;i<=N;i++){
res*=(ll)i;
}
cout<<res<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
long long ans =1;
int n;
scanf("%d", &n);
for(int i=n;i>1;--i)
ans*=i;
printf("%lld\n",ans);
return EXIT_SUCCESS;
} | 1 | 17,866,712 |
#include <iostream>
using namespace std;
int dp[50];
int fib(int n)
{
if (n == 0 || n == 1) return dp[n] = 1;
if (dp[n]) return dp[n];
return dp[n] = fib(n - 1) + fib(n - 2);
}
int main()
{
int n;
cin >> n;
cout << fib(n) << endl;
return 0;
} | #include "bits/stdc++.h"
#include <unordered_set>
#define _CRT_SECURE_NO_WARNINGS
#define REP(i, n) for(decltype(n) i = 0; i < (n); i++)
#define REP2(i, x, n) for(decltype(x) i = (x); i < (n); i++)
#define REP3(i, x, n) for(decltype(x) i = (x); i <= (n); i++)
#define RREP(i, n) for (decltype(n) i = (n) - 1; i >= 0; i--... | 1 | 84,310,124 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main()
{
int a, b, c;
cin >> a >> b >> c;
if(a+b>=c)
cout << "Yes";
else
{
cout << "No";
}
} | #include <bits/stdc++.h>
#define rep(i,n) for(int64_t i=0;i < (int64_t)(n);i++)
using namespace std;
vector<vector<int>> fspattern;
vector<int> fspattern_draft;
int fspcnt = 0;
void setfspattern_core(int floor,int number,int degree){
if(floor==degree){
fspattern.at(fspcnt) = fspattern_draft;
fspcnt++;
}else... | 1 | 13,839,100 |
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
int main(){
char C; cin>>C;
C++;
cout<<C<<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
char C;
cin >> C;
cout << (char)(((int)C)+1) << endl;
return 0;
} | 1 | 16,793,429 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string A, B;
cin >> A >> B;
string ans="EQUAL";
if(A.size()>B.size())ans="GREATER";
else if(A.size()<B.size())ans="LESS";
else{
for(int i=0; i<A.size(); i++){
if(A.at(i)>B.at(i)){
ans ="GREATER";
break;
}
else i... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define ll long long
#define bp __builtin_popcount
#define pb push_back
#define loop(i,n) for(int i = 0;i < int(n);i++)
#define sz(s) (int)(s.size())
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define setdp memset(dp,-1,sizeo... | 1 | 74,201,001 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<ll> vi;
#define INF (1e9)
int main() {
string S;
cin >> S;
ll N = S.length() + 1;
vi A(N);
for (int i = 0; i < N - 1; i++) {
if (S[i] == '<') {
A[i + 1] = A[i] + 1;
... | #include <bits/stdc++.h>
using namespace std;
int main(){
string s; cin >> s;
int n = s.size();
vector<int> a(n+1,0);
for(int i=0; i<n; i++) {
if(s[i]=='<') a[i+1]=a[i]+1;
}
for(int i=n-1; i>=0; i--) {
if(s[i]=='>') a[i]=max(a[i],a[i+1]+1);
}
cout << accumulate(a.begin(),a.end(),0LL) << endl;
... | 1 | 46,183,026 |
#include <bits/stdc++.h>
using namespace std;
bool isOK(int ma, int n) {
for (int i = ma; i >= 1; --i) {
if (n >= i) {
n -= i;
}
}
return n == 0;
}
int main() {
int n;
cin >> n;
int left = 0, right = n;
int ma = n;
while (right - left > 1) {
int mid = left + (right - left) / 2;
if ... | #include <iostream>
#include <bitset>
#include <fstream>
#include <string>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <vector>
#include <algorithm>
#include <numeric>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <functional>
#include <cc... | 1 | 27,737,919 |
#include<iostream>
int main(){
int a, b, c;
std::cin >> a;
std::cin >> b;
std::cin >> c;
int count = 0;
for(int n = a; n <= b; n++){
if(c % n == 0) count++;
}
std::cout << count << std::endl;
return 0;
} | #include<stdio.h>
int main()
{
int a, b, c, i;
int syou, amari, kosuu = 0;
scanf("%d %d %d", &a, &b, &c);
for (int i = a; i <= b; i = i + 1){
syou = c / i;
amari = c%i;
if (amari == 0){
kosuu = kosuu + 1;
}
else;
}
printf("%d\n", kosuu);
return 0;
} | 1 | 22,191,245 |
#include <bits/stdc++.h>
#define repl(i, l, r) for (int i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using G = vector<vecto... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define int long long
signed main() {
int N; cin >> N;
vector<int> A(N);
rep(i, N) {
int a; cin >> a;
if(i == 0) A[i] = a;
else A[i] = A[i-1]+a;
}
int ans = 0;
uno... | 1 | 12,273,578 |
#include <bits/stdc++.h>
#define fastio (cin.tie(0), cout.tie(0), ios::sync_with_stdio(false))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define precise(i) fixed << setprecision(i)
using lint = long;
using llint = long long;
using namespace std;
int main() {
fastio;
int x, t;
cin >> x >> t;
if (x ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main()
{
ll x, t;
cin >> x >> t;
if(x>t)
cout << x - t;
else if(x == t)
cout << 0;
else
{
cout << 0;
}
} | 1 | 27,237,621 |
#include <bits/stdc++.h>
#define loop(i,n) for(int i=0;i<n;i++)
#define pi acos(-1.00)
using namespace std;
int main()
{
int n,m,i;
cin>>n>>m;
string s[200];
for(i=0;i<n;i++)
{
cin>>s[i];
}
sort(s,s+n);
for(i=0;i<n;i++)
cout<<s[i];
} | #include<bits/stdc++.h>
using namespace std;
#define pi acos(-1)
#define _terminated return 0
#define endl "\n"
#define yes cout << "yes" << endl
#define no cout << "no" << endl
#define booster ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
typedef long long ll;
typedef unsigned long long ull;
typedef vecto... | 1 | 68,811,579 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = n; i >= 0; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 30;
int a[500005];
int main() {
string s;
cin >> s;
int n = s.size();
rep(i, n) {
if (s[i] == '<') a[i+... | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b)... | 1 | 66,020,229 |
#include <bits/stdc++.h>
using namespace std;
using dou =long double;
string yes="yes";
string Yes="Yes";
string YES="YES";
string no="no";
string No="No";
string NO="NO";
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) {... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll inf = 1e18;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define per(i, a, b) for (int i = b - 1; i >= a; i--)
using pint = pair<int, int>;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
signed main() {
int n;
cin >> n;
int ... | 1 | 88,293,551 |
#include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define INF 1e18
#define PI 3.14159265358979
using namespace std;
ll gcd(ll a, ll b);
ll power(ll n, ll k);
ll inv(ll n);
ll genfact(ll n, ll k);
ll fact(ll n);
ll nck(ll n, ll k);
int main(void){
int a, b, c, d, e;
cin >> a >> b >> c >> d;
... | #include<bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(long long i=(l);i<(r);++i)
#define REP(i,n) FOR(i,0,n)
#define REPS(i,n) FOR(i,1,n+1)
#define int long long
const int MOD=1e9+7;
const int INF=1e15;
signed main(){
int A,B,C,D;cin>>A>>B>>C>>D;
cout<<min(A,B)+min(C,D)<<endl;
} | 1 | 28,677,259 |
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define FRE freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define all(v) (v).begin(),(v).end()
#define endl "\n"
#define int long long
#define rep(i,a,b) for(int i=a;i<b;i++)
#define per(i,a,b)... | 1 | 32,397,670 |
#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 10;
int cnt[N], n;
int a[N], ans[N];
int main() {
cin>>n;for(int i = 1; i <= n; i++) {
int t; scanf("%d", &t);
cnt[t]++;
}
for(int i = 1; i <= n; i++) if (cnt[i]) {
a[++a[0]] = cnt[i];
}
sort(a + 1, a + 1 + a[0]);
int sum = 0;
for(int cs = 1... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#includ... | 1 | 72,231,869 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
string s; cin >> s;
sort(begin(s), end(s));
if (s == "abc") cout << "Yes" << "\n";
else cout << "No" << "\n";
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(v) (v).begin(), (v).end()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define EPS (1e-7)
#define gearup ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
typ... | 1 | 17,946,860 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define zero_pad(num) setfill('0') << std::right << setw(num)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
int n, a, b;
cin >> n >> a >> b;
int d = b - a - 1;
if(d % 2 ==... | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,a,b,c,f=0;
cin >> n >> a >> b;
c=abs(a-b);
if(c%2==1) f=1;
if(f==0) cout << "Alice" << endl;
else cout << "Borys" << endl;
return 0;
} | 1 | 35,236,163 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c,d;
cin>>a>>b>>c>>d;
int ans=min(b,d)-max(a,c);
if(ans<0)
ans=0;
cout<<ans<<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A,B,C,D ;
cin >> A >> B >> C >> D;
int ans =0;
if (B>C&&A<=C&&B<D) ans = B-C;
else if (D>A&&C<=A&&D<B) ans =D-A;
else if (A<=C&&D<=B) ans =D-C;
else if (C<=A&&B<=D) ans =B-A;
else ans = 0;
cout << ans << endl;
} | 1 | 52,472,152 |
#include <bits/stdc++.h>
using namespace std;
#define INF 1001001001
#define LINF 1001001001001001001
#define MOD 1000000007
#define MOD2 998244353
template<class T,class U>bool chmax(T &a, const U &b){if(a<b){a=b;return 1;}return 0;}
template<class T,class U>bool chmin(T &a, const U &b){if(b<a){a=b;return 1;}return 0;... | #include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define SORT(a) sort((a).begin(),(a).end())
#define rSORT(a) reverse((a).begin(),(a).end())
#define For(i, a, b) for(int i = (a) ; i < (b) ; ++i)
#define rep(i, n) For(i, 0, n)
#define debug(x) cerr << #x << " = " << (x) << endl;
template<clas... | 1 | 10,699,087 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >>N;
vector<long long>vecA(N+1);
vector<long long>vecB(N);
for(int i=0;i<N+1;i++){
cin >>vecA.at(i);
}
for(int i=0;i<N;i++){
cin >>vecB.at(i);
}
long long summ=0;
for(int i=0;i<N;i++){
... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n,b,c;
cin>>n;
int a[n+1];
long long ans=0;
for(int i=0;i<n+1;i++)cin>>a[i];
for(int i=0;i<n;i++){
cin>>b;
c=a[i+1]+a[i];
ans+=min(c,b);
a[i+1]=clamp(c-b,0,a[i+1]);
}
cout<<ans<<endl;
} | 1 | 67,824,622 |
#include <bits/stdc++.h>
using namespace std;
#define INCANT cin.tie(0), cout.tie(0), ios::sync_with_stdio(0), cout << fixed << setprecision(20)
#define int long long
#define double long double
const int INF = 1e18, MOD = 1e9 + 7;
int n, m, a;
int cnt[111111] = {};
signed main() {
INCANT;
cin>>n>>m;
for (in... | #include <bits/stdc++.h>
using namespace std;
#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 all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
#define get_unique(x) x.erase(unique(all(x)), x.end());
typedef long long ll;
typedef complex<do... | 1 | 98,648,160 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N;
vector<ll> A;
int main(){
cin >> N;
A.resize(N);
for(int i = 0; i < N; i++) cin >> A[i];
ll M_1 = 0, M_2 = 0;
ll M_1idx = 0, M_2idx = 0;
for (int i = 0; i < N; i++) {
if (A[i] > M_1) {
M_1 = A[i];
M_1... | #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 INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main()
{
int n;
cin >> n;
vector<ll> vec(n);
vector<ll> mvec(n);
rep(i, n) {
int x;
cin ... | 1 | 93,024,630 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#define rep(i, begin, n) for (int i = begin; i < n; i++)
#define repe(i, begin, n) for (int i = begin; i <= n; i++)
#define repr(i, begin, n) for (int i = begin; i > begin - n; i--)
#define repre(i,... | #include <iostream>
#include <string>
using namespace std;
int main(){
int a,b,y;
string x;
cin >> a >> x >> b;
if(x == "+") y = a + b;
else if ( x == "-") y = a - b;
cout << y;
return 0;
} | 1 | 39,584,882 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int h, w, d;
char col[1100][505];
int main() {
cin >> h >> w >> d;
if (d%2 == 1) {
for (int i = 0; i < h; ++i) {
for (int j = 0; j < w; ++j) {
if ((i+j)%2 == 0)
cout << "R";
else
cout << "G";
}
cout << "\n";
}
return ... | #include<bits/stdc++.h>
using namespace std;
const char mod[] = "YGBR";
int N , M , K;
char qbxf[2007][2007] , ans[1007][1007];
int main(){
cin >> N >> M >> K;
for(int i = -1000 ; i <= 1000 ; ++i)
for(int j = -1000 ; j <= 1000 ; ++j)
qbxf[i + 1000][j + 1000] = mod[((i + 1000) / K & 1) * 2 + ((j + 1000) / K & 1)]... | 1 | 67,472,994 |
#include <bits/stdc++.h>
using namespace std;
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using namespace boost::multiprecision;
using bint = cpp_int;
using bdec = cpp_dec_float_100;
int main() {
bint N;
cin >> N;
cout << ((N % 9) ? "No" : "Yes") << "\n";
} | #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 n;
cin >> n;
int ans = 0;
rep(i, n.size()) ans += n[i] - '0';
if (ans % 9 == 0) cout << "Yes" << endl;
else cout << "No" << endl;
r... | 1 | 4,245,515 |
#include <cstdio>
using namespace std;
typedef long long Int;
int main(){
int n;
Int res;
scanf("%d", &n);
res = 1;
while(n > 1){
res *= n;
n--;
}
printf("%lld\n", res);
return 0;
} | #include<iostream>
int main(){
int n;
long long int m=1;
std::cin>>n;
for(int i=n;i>0;i--)m*=i;
std::cout<<m<<std::endl;
return 0;
} | 1 | 53,491,657 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
int num = 0;
while (pow(2, num + 1) <= N){
num++;
}
int ans = pow(2, num);
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll ;
typedef vector<ll> vll ;
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define all(v) (v).begin(),(v).end()
#define precision(k) cout<<setprecision(k)<<fixed;
#define loop(i,a,b) for(ll i=(a);i<=(b);++i)
#define minv(v) *min_element... | 1 | 86,283,715 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for(int i=0; i<(n); ++i)
#define FOR(i, a, b) for(int i=(a); i<(b); ++i)
#define FORR(i, a, b) for(in... | #include <iostream>
#include <set>
#include <vector>
#include <map>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <queue>
#include <stack>
#define sf(n) scanf("%d",&n);
#define sfl(n) scanf("%lld",&n);
#define pf(n) printf("%d",n);
#define pfl(n) printf("%lld",n);... | 1 | 80,730,205 |
#include <bits/stdc++.h>
#define pb emplace_back
#define ll long long
#define fi first
#define se second
#define mp make_pair
using namespace std;
typedef pair<int, int> pii;
const int N = int(2e5 + 7);
const int nAlpha = 'z' - 'a' + 1;
const int mod = int(1e9 + 7);
unordere... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <map>
#include <unordered_map>
#include <cassert>
using namespace std;
int dp[202020];
unordered_map<int, int> dp2;
int main() {
string s;
cin >> s;
int n = int(s.size());
int x = 0;
... | 1 | 12,504,980 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int ans = 0;
int n;
cin >> n;
cout << 800 * n - n / 15 * 200 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin>>N;
int sum =800*N-200*(N/15);
cout<<sum<<endl;
} | 1 | 43,266,712 |
#include <bits/stdc++.h>
#include<math.h>
#include<algorithm>
#define rep(i,n) for (int i = 0; i < (n) ; ++i)
using namespace std;
using ll = long long ;
using P = pair<int, int> ;
#define PI 3.14159265358979323846264338327950
#define INF 1e18
#define mod 1000000007
int r, p, s;
int c (char x){
if(x == 'r') retur... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
using pil = pair<int, ll>;
using uint = unsigned int;
template <typename T>
using Graph = vector<vector<T>>;
const ... | 1 | 100,267,087 |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,... | #include <iostream>
using namespace std;
int main()
{
int a,b;
char x;
cin >> a >> x >> b;
if(x=='+')
{
cout << a+b;
}
else
{
cout << a-b;
}
} | 1 | 46,889,339 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
int n, ans = 0;
cin >> n;
string str;
for (int i = 1; i <= n; ++i) {
str = to_string(i);
if (str.length() % 2 == 1) {
ans++;
}
}
cou... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
#define all(x) x.begin(), x.end()
signed main() {
int n;
cin >> n;
int ans = 0;
for(int i = 1; i <= n; i++){
int cou = 1;
bool t = true;
int x = i;
while(t){
if(x/10 >= 1... | 1 | 53,161,069 |
#include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (int i=0; i<n; i++)
using namespace std;
const double PI = acos(-1);
using Graph = vector<vector<int>>;
int main() {
int n, m;
cin >> n >> m;
vector<ll> h(n+1);
vector<ll> highest(n+1, 1);
for (int i = 1; i < n+1; i++)
{
cin >> h[i];
}
rep(i,... | #include<bits/stdc++.h>
#define mod 1000000007
#define pb push_back
using namespace std;
using ll = long long;
using ld = long double;
const ll inf = LONG_LONG_MAX;
ll binpow(ll a, ll b) {
ll res = 1;
while (b > 0) {
if (b & 1){
res = (res * a)%mod;
}
a = (a * a)%mod;
... | 1 | 1,225,834 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<pii,int> ppii;
typedef pair<int,pii> pipi;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> ppll;
typedef pair<ll,pll> plpl;
typedef tuple<ll,ll,ll> tl;
ll mod=1000000007;
ll mod2=9982... | #include <iostream>
#include <cstdio>
using namespace std;
long long n, k, cnt=1, ans=1, M=1e9+7;
string s;
int main() {
int i;
cin >> n >> s;
if(s[0]=='W') {puts("0"); return 0;}
for(i=1; i<2*n; i++) {
if(s[i] == s[i-1]) k = 1 - k;
if(k==0) cnt++;
else ans = ans * cnt % M, cnt--;
}
if(cnt!=0) {puts("0"); r... | 1 | 74,804,510 |
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#ifdef DEBUG_MODE
#define DEBUG(...) debug_func_mult(split_names(#__VA_ARGS__), __VA_ARGS__)
#define DEBUG_ENDL endl << flush
#define DEBUG_SEPARATOR_LINE cout<<"=================\n"
#else
#define DEBUG(...) 0
#define DEBUG_ENDL 0
#define DEBUG_SEPARATOR_L... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)
#define ALL(v) (v).begin(),(v).end()
template<class T1,class T2>ostream& operator<<(ostream& os,const pair<T1,T2>&a){return os<<"("<<a.first<<","<<a.second<< ")";}
template<class T>void pv(T a,T b){for... | 1 | 62,032,644 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main()
{
string s, t;
cin >> s >> t;
if (t.substr(0, s.size()) == s)cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
#define INF INT_MAX
#define ll long long
#define ull unsigned long long
#define rep(i,n) for(ll i=0; i<n; ++i)
#define FOR(i, s, e) for(ll i=s; i<e; ++i)
#define MOD 1000000007
using namespace std;
template<class T> inline bool chmin(T& a, T b) { if(a>b) {a=b; return true;} return false;}
temp... | 1 | 9,889,602 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1e9
#define PI 3.14159265359
#define MOD 1000000007
#define ALL(v) v.begin(),v.end()
#define ALLR(v) v.rbegin(),v.rend()
typedef long long ll;
const int dx[4] = {1,0,-1,0};
const int dy[4] = {0,1,0,-1};
int ma... | #include <iostream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <sstream>
#include <iomanip>
#include <set>
using namespace std;
typedef long long int ll;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define YES cout << "YES" << endl
#define Yes cout << "Yes"... | 1 | 60,134,107 |
#include <iostream>
using namespace std;
float x1, y1, x2, y2, x3, y3, x4, y4;
int main(void) {
int n;
cin >> n;
bool flag;
while (n--) {
cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> x4 >> y4;
if (x1 == x2 && x3 == x4) {
flag = true;
} else if (((y2 - y1) / (x2 - x1)) == ((y4 - y3) / (x4 - x3))){
flag = t... | #include <stdio.h>
typedef struct _point {
double x, y;
} point;
double cross(point a, point b) {
return a.x * b.y - a.y * b.x;
}
int main() {
int Tc, tc;
point A, B, C, D;
scanf("%d", &Tc);
for(tc = 0; tc < Tc; ++tc) {
scanf("%lf %lf %lf %lf %lf %lf %lf %lf",
&A.x, &A.y, &B.x, &B.y, &C.x, &C.... | 1 | 20,030,330 |
#include"bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
ll x, y,... | #include<bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
typedef long long ll;
const ll inf = 1001001001001001001;
int main(){
ll x,y;scanf("%lld%lld",&x,&y);
ll ans = inf;
if(x <= y) ans = min(ans,y-x);
if(-x <= y) ans = min(ans,y+x... | 1 | 50,806,508 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
int t;
const int mod=1e9+7;
void add_self(int &a, int b){
a+=b;
if(a>=mod)a-=mod;
}
void sub_self(int &a, int b){
a-=b;
if(a<0)a+=mod;
}
void test_case(){
int n,k;
cin>>n>>k;
vector<int>dp(k+1);
dp[0]=1;
for(int i=0; i<... | #include<bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int n, k, a[105];
using ll = long long;
ll dp[105][100005];
int main()
{
cin >> n >> k;
for(int i = 1; i <= n; i++)
cin>>a[i];
dp[0][0] = 1;
for(int i = 1; i <= n; i++)
{
ll pre = 0;
for(int j = 0; j <= k; j++)
{
pre += dp[i - 1][... | 1 | 21,149,094 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#define all(x) (x).begin(), (x).end()
#define endl '\n'
#define fsp(x) cout << fixed << setprecision(x)
const ll inf = LLONG_MAX;
const long double pi = M_PI;
void Yes() {cout << "Yes" << endl;}
void No() {cout << "No" << endl;}... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
cin.tie(0); ios::sync_with_stdio(false);
vector<int> N(4);
for (int i = 0; i < 4; i++) cin >> N[i];
sort(N.begin(), N.end());
cout << (N[0] == 1 && N[1] == 4 && N[2] == 7 && N[3] == 9 ? "YES" : "NO") << endl;
} | 1 | 39,798,869 |
#include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include ... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;
ll dp[310][310][310] = {};
ll mi[310][310][310] = {};
ll inf = 1e18;
int main(){
int N,K;
cin >> N >> K;
vector<ll> H(N+1,0),L(N+1,0);
for(int i=1;i<=N;i++){
cin >> H[i];
L[i] = H[i];
... | 1 | 50,846,937 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(ll i=0;i<n;++i)
#define P pair<ll,ll>
#define Graph vector<vector<P>>
#define fi first
#define se second
constexpr ll mod=1000000007;
constexpr ll INF=(1ll<<60);
constexpr double pi=3.14159265358979323846;
template<typename T> inline... | #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(){
string s,t;
cin >> s>> t;
string ans{};
rep(i, t.size()){
ans.push_back(t[i]);
}
rep(i, s.size()){
ans.push_back(s[i]);
}
cout << ans << endl;
} | 1 | 69,059,731 |
#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 mod 1000000007
typedef long long ll;
vector<pair<long long, long long> > prime_factorize(long long n) {
vector<pair<long long, long long> > res;
for (long long p = 2; p * p <=... | #include <bits/stdc++.h>
using namespace std;
#define loop(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < n; ++i)
#define dump(a) cerr << #a << " = " << (a) << "(L:" << __LINE__ << ")" << endl
void solve(long long N) {
vector<int> ps;
loop (k, 2, 1000001) {
auto cnt = 0;
... | 1 | 36,946,906 |
#include <iostream>
#include<vector>
#include<algorithm>
#define ll long long
#define INVALID -1
#define mod 1e9+7
#define rep(n) for(int i=0;i<n;++i)
using namespace std;
int main(void){
int n,m;
cin>>n>>m;
vector<ll> dp(n+1,0);
dp[0]=1;
dp[1]=1;
for(int i=0;i<m;i++){
int a;
cin>>a;
dp[a]=INVALID;
}
for(in... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#incl... | 1 | 24,211,796 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
vector<int> a = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int k;
cin >> k;
cout << a[k - 1] << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define All(a) a.begin(),a.end()
#define INF 1000000007
const int MOD = 1000000007;
int gcd(int x,int y){
if(x%y==0) return y;
else return gcd(y,x%y);
}
int main(){
vector<int>s = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1... | 1 | 1,651,867 |
#include<bits/stdc++.h>
using namespace std;
void dfs(vector<vector<int>> &graph, vector<int> &counter, int child, int parent = 0) {
for(int son : graph[child]) {
if(son == parent) {
continue;
}
counter[son] += counter[child];
dfs(graph, counter, son, child);
}
}
int ... | #include <bits/stdc++.h>
#include <algorithm>
#define int long long
using namespace std;
#define mod 1000000007
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
bool vis[200005];
vector<int> vec[2000005], v1;
int child[2000005];
int dis[100005] = {0};
void dfs(int node)... | 1 | 57,014,945 |
#define Judge_Online
#include<queue>
#include<math.h>
#include<stdio.h>
#include<string.h>
#include<algorithm>
#define N 1005
using namespace std;
int Sum[N]={0};
int main(){
#ifdef Judge_Online
#endif
int n, i, j, y, m, d;
for(i=1;i<1000;i++)
Sum[i]=Sum[i-1]+(i%3?195:200);
scanf("%d",&n);
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n)-1;i>=0;i--)
#define rrep2(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define all(a) (a).begin(),(a).end()
typedef long long ll;
typedef ... | 1 | 71,387,686 |
#include <iostream>
using namespace std;
int main(){
int A, B;
string S;
cin >> A >> B >> S;
for(int i=0; i<A+B+1; i++){
if(i == A){
if(S[i] != '-'){
cout << "No" << endl;
return 0;
}
}
else
if(S[i]<'0' || '9'<S[i]){
cout << "No" << endl;
return 0;
}
}... | #include <iostream>
#include <string>
using namespace std;
int main(){
int A, B;
string S;
cin >> A >> B >> S;
for (int i = 0; i < S.size(); i++){
if (i==A){
if (S[i]!='-'){
printf("No\n");
return 0;
}
}else if (S[i]-'0' > 9 || S[i]-'0' < 0){
printf("No\n");
retur... | 1 | 46,542,747 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
long long MOD = 10000000000 + 7;
int main(){
cout << setprecision(10);
int N; cin >> N;
string S,T; cin >> S >> T;
string ans = "";
for(int i = 0; i < N; i++){
ans += S[i];
ans += T[i];
}
cout << ans << e... | #include <bits/stdc++.h>
using namespace std;
#define DBG(x) \
(void)(cout << "L" << __LINE__ \
<< ": " << #x << " = " \
<< (x) << '\n')
typedef long long ll;
using pii = pair<int, int>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int INF = ... | 1 | 14,511,639 |
#include <bits/stdc++.h>
using namespace std;
void debug() {cout<<endl;}
template<typename T,typename... Args>
void debug(T x,Args... args) {cout<<x<<" ";debug(args...);}
#define forn(i,a,b) for(int i=a;i<b;++i)
#define SZ(x) int(x.size())
#define pb push_back
#define F first
#define S second
#define endl "\n"
typedef ... | #include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <map>
#include <vector>
#include <stack>
#include <queue>
#include <tuple>
#include <cassert>
#include <functional>
#include <set>
#include <deque>
#include <list>
using namespace std;
typedef long long ll;
int dx[4] = {0,0,1,-1};
int ... | 1 | 53,604,778 |
#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define REP(i,a,b) for(inti=a;i<=b;i++)
#define MOD 1000000007
typedef long long int ll;
typedef vector<int>vi;
typedef pair<int,int>pi;
int main()
{
string s ;
cin>>s;
if((s[1]!=s[0]&&s[1]!=s[3])||s[... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n,a,b,c,d,x,y;
cin >> n;
x = 0;
y = 0;
a = n / 1000;
b = (n % 1000) / 100;
c = (n % 100) / 10;
d = (n % 10);
if (a == b) {
x = x + 1;
}
if (b == c) {
x = x + 1;
if (x >= 2){
y = 1;
}
} else {
x = 0;
}
i... | 1 | 56,238,255 |
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long
#define MOD 1000000007
#define all(c) c.begin(), c.end()
#define rep(i, s, e) for (auto i = s; i < e; i++)
#define peek(v) \
for (auto i : v) \
cout << i << ' ';
void solve()
{
ll n, k;
cin >> n >> k;
multiset<pair<ll, ll>> ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
int main() {
ll N, K;
cin >> N >> K;
vector<pair<int, int>> A;
rep(i, N) {
int a, b;
cin >> a >> b;
A.pus... | 1 | 78,508,389 |
#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 a,b;
cin >> a >> b;
int ans = -1;
REP(i,10000){
int c = i * 0.08;
int d = i * 0.1;
if(c ==... | #include <bits/stdc++.h>
typedef uint64_t u64;
typedef int64_t i64;
typedef uint32_t u32;
typedef int32_t i32;
typedef uint16_t u16;
typedef int16_t i16;
typedef uint8_t u8;
typedef int8_t i8;
using namespace std;
#define rep(idx, N) for (u64 idx = 0; idx < N; idx++)
int main() {
i32 a, b;
cin >> a >> b;
for (i32... | 1 | 75,828,472 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.