code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vll = vector<vl>;
using Pll = pair<ll, ll>;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(v) v.begin(), v.end()
#define sz(x) ((int) x.size())
#define pb push_back
#define mp make_pair
#defi... | #include <cstdio>
int face[6];
int times,a,b;
int main(){
for(int i=0; i<6; ++i){
scanf("%d", &face[i]);
}
int check[6][4] = {
{face[1],face[2],face[4],face[3]},
{face[5],face[2],face[0],face[3]},
{face[5],face[4],face[0],face[1]},
{face[5],face[1],face[0],face[4]},
{face[5],face[3],face[0],face[2]},
{... | 0 | 21,854,130 |
#include <bits/stdc++.h>
using namespace std;
std::vector<int> v;
int main() {
int N,A,B;
cin >> N >> A >> B;
int ans = B-A;
if(ans%2==0){
cout << "Alice";
}else{
cout<<"Borys";
}
return 0;
} | #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 1e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main(){
ll n;
cin >> n;
vector<ll>a(n, 0);
... | 0 | 22,233,477 |
#include "bits/stdc++.h"
using namespace std;
void Main() {
int N;
cin >> N;
vector<int> a(N, 0);
for (int i = 0; i < N; ++i) {
cin >> a[i];
}
int ans = 40000000;
for (int target = -100; target <= 100; ++target) {
int cost = 0;
for (int i = 0; i < N; ++i) {
... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x... | 0 | 5,314,726 |
#include <iostream>
#include <string>
#include <utility>
#include <algorithm>
#include <map>
#include <vector>
#include <cmath>
#include <cstdlib>
#include <queue>
#include <stack>
using namespace std;
#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... | #include<iostream>
#include<string>
#include<vector>
using namespace std;
int main(){
int n, m, a, b, flag;
string s = "IMPOSSIBLE";
cin >> n >> m;
vector<int> ve(200001);
flag = 0;
for(int i = 0; i < m; i++){
cin >> a >> b;
if(flag == 0){
if(a == 1){
if(ve[b] == 0){
... | 0 | 91,108,565 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ll n;
cin >> n;
bool exist=false;
ll groups = 0, crr = 0;
queue<ll> q, tpq;
if(n>2){
for(ll i=2;i<2*n;i++){
if((2*n)%i!=0) continue;
else{
if(abs((2*n)/i - i) == 1) {
groups = i;
exist =... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,m,n) for(int (i)=(int)(m);i<(int)(n);i++)
#define rep2(i,m,n) for(int (i)=(int)(n)-1;i>=(int)(m);i--)
#define REP(i,n) rep(i,0,n)
#define REP2(i,n) rep2(i,0,n)
#define FOR(i,c) for(decltype((c).begin())i=(c).begin();i!=(c).end();++i)
#define ll long long
#defi... | 0 | 5,123,904 |
#include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
map<int, int> mp;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
mp[a]++;
}
vector<pair<int, int>> vec;
for (auto it = mp.begin(); it != mp.end(); it++) {
int len = ... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <list>
#include <utility>
#include <tuple>
#include <cstdio>
#include <set>
#include <queue>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#inclu... | 0 | 43,080,976 |
#include<stack>
#include<cstdio>
using namespace std;
int main(){
int n;
int temp;
stack<int> data;
while(1){
scanf("%d",&n);
if(n!=0){
data.push(n);
}
else{
if(data.empty() == true)break;
else{
printf("%d\n",data.top());
data.pop();
}
}
}
return 0;
} | #include <bits/stdc++.h>
#define DAU ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define PLEC exit(0);
using namespace std;
vector<int> v;
int x, y, res(2019);
int main() {
DAU
cin >> x >> y;
for (int i = x; i <= min(x + 2020, y); ++i)
v.emplace_back(i % 2019);
sort(v.begin(), v.end()... | 0 | 18,659,993 |
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <c... | #include<stdio.h>
int main()
{
int n,m,i,j;
for(i=1;i<=9;i++)
{
for(j=1;j<=9;j++)
{
printf("%dx%d=%d\n",i,j,i*j);
}
}
} | 0 | 2,089,782 |
#include<iostream>
#include <functional>
#include<algorithm>
#include <cmath>
#include <string>
#include <map>
using namespace std;
int main(){
int max=0;
string a;
map<string,int> s;
string x,y;
cin>>a;
s[a]++;
x=y=a;
while(cin>>a){
s[a]++;
if(y.size()<a.size())
y=a;
if(s[a]>max){
max=s[a];
x=a;... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,s, n) for(int i = s; i < (int)(n); i++)
#define co(x) cout<<x<<endl
#define SQvec(i,j) vector<vector<int>> data(i, vector<int>(j))
#define mod 1000000000+7
typedef long long int lint;
int main (){
lint N,M,sum,ans = 0,op_x = -1,op_y = -1,op_z = -1;
cin >> N... | 0 | 84,494,456 |
#include<iostream>
using namespace std;
int main(){
int n;
cin>>n;
if(n<1200){
cout<<"ABC";
}
else
cout<<"ARC";
} | #include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef tuple<ll,ll,ll> T;
const long long INF = 1LL<<60;
const int MOD = 1000000000+7;
#define rev(s) (string((s).rbegin(),... | 0 | 91,728,692 |
#include <iostream>
#include <string>
#include <stack>
using namespace std;
int main(){
string str;
while(getline(cin, str)){
if(str==".") break;
stack<char> st;
for(int i=0;i<str.size();i++){
if(str[i]=='('||str[i]=='[') st.push(str[i]);
if(str[i]==')'){
if(!st.empty()&&st.top()=='(') st.pop();
e... | #include <iostream>
#include <cmath>
using namespace std;
int n;
double xa,xb,xc,xd,ya,yb,yc,yd,ta,tb,tc,td;
int main(){
int i;
cin >> n;
for(i=0;i<n;i++){
cin >> xa >> ya >> xb >> yb >> xc >> yc >> xd >> yd;
ta = xa - xb;
tb = ya - yb;
tc = xc - xd;
td = yc - yd;
if(tc/td == ta/tb) cout << "YES" << endl... | 0 | 65,445,299 |
#include <bits/stdc++.h>
using namespace std;
const int N = 200005;
int cnt[N], aux[N];
int main() {
int n, k;
cin >> n >> k;
map <int, int> mp;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
cnt[x]++;
}
int sz = 0;
for (int i = 1; i < N; i++) {
if (cnt[i]) {
... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
#define rep(i,n) for(ll i = 0;i < (ll)n;i++)
#define ALL(x) (x).begin(),(x).end()
#define MOD 1000000007
int main(){
ll n,c,k;
cin >> n >> c >> k;
priority_queue<ll,vector<ll>,greater<ll>> q... | 0 | 48,839,846 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <math.h>
#include <iomanip>
#include <map>
#include <bitset>
using namespace std;
#define INF 1e9
#define LLINF 1e18
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int gcd(int a, int b) {
if(a % b == 0)... | #include<bits/stdc++.h>
using namespace std;
#define deb(x) cerr<<"["#x<<" : "<<x<<" ]\n";
int main()
{
int n;
cin >> n;
int time = 0, currX = 0, currY = 0;
for(int i = 0; i < n; i++) {
int t, destX, destY;
cin >> t >> destX >> destY;
int distance = abs(currX - destX) + abs(currY - destY);
if((t-time-distan... | 0 | 75,825,787 |
#include <iostream>
#include <vector>
using namespace std;
int main(void)
{
int i ,N, M, P, sum;
while(1){
cin >> N >> M >> P;
if(N == 0 && M == 0 && P == 0){
break;
}
sum = 0;
vector<int> rate(N);
... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
int n;
c... | 0 | 96,281,661 |
#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;++... | #include <iostream>
#include <string.h>
#include<cstdlib>
using namespace std;
struct Node
{
int key;
Node *next, *prev;
};
Node *nil;
Node* listSearch(int key)
{
Node *cur = nil->next;
while (cur != nil&&cur->key != key)
{
cur=cur->next;
}
return cur;
}
void init()
{
nil = (Node*)malloc(sizeof(Node));
nil->... | 0 | 17,267,070 |
#include <bits/stdc++.h>
using namespace std;
int diveder(long long x, int d){
int ret = 0;
while(x > 0){
ret += x % d;
x /= d;
}
return ret;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << setprecision(20) << fixed;
long long N;
cin >> N;
int min = 999999;
for (int i = 0; ... | #include <bits/stdc++.h>
using namespace std;
#define intt long long
#define FAST ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
const int N = 100005;
int n;
int a[N];
int main() {
FAST;
int n, m;
cin >> n >> m;
if (n > m) swap(n, m);
if (n == 1 && m == 1) {
cout << 1 << '\n';
}
else if (n == 1 && m !=... | 0 | 38,320,527 |
#include <iostream>
using namespace std;
int main(){
int W,H,x,y,r;
cin >> W >> H >> x >> y >> r;
if (r > W || r > H)
cout << "No" << endl;
else if ((x - r) < 0 || W < (x + r))
cout << "No" << endl;
else if ((y - r) < 0 || H < (y + r))
cout << "No" << endl;
else
cout << "Yes" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
ll gcd(ll a, ll b) { return b == 0 ? a : gcd(b, a % b); }
ll lcm(ll a, ll b) { return a * (b / gcd(a, b)); }
#define endl '\n'
#define max3(a,b,c) max(a,max(b,c))
const int q = 1e9+9;
int main()
{
int n,b;
cin>>n>>b;
... | 0 | 90,508,525 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> Pair;
typedef vector<ll> vll;
typedef vector<vector<ll>> Graph;
typedef vector<string> vs;
typedef vector<pair<ll, ll>> Pll;
typedef queue<ll> qll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n... | #pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() {
cerr << endl;
}
template <typename H, typename... T>
void d_err(H h, T...... | 0 | 57,082,144 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
#define VL vector<ll>
#define VS vector<string>
#define VB vector<bool>
#define VP vector<pair<ll,ll>>
#define VVL vector<vector<ll>>
#define VVP vector<vector<pair<ll,ll>>>
... | #include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<stack>
#include<string>
#include<map>
#include<set>
#include<tuple>
#include<cmath>
#include<iomanip>
#define MOD 1000000007
#define INF 1001001001
#define MIN -1001001001
#define rep(i,k,N) for(int i=k;i<N;i++)
#define MP make_pair
#defin... | 0 | 72,026,964 |
#include <bits/stdc++.h>
using namespace std;
#define SELECTER(_1, _2, _3, SELECT, ...) SELECT
#define REP1(i, n) for(int i=0; (i)<(n); (i)++)
#define REP2(i, a, b) for(int i=(a); (i)<(b); (i)++)
#define REP(...) SELECTER(__VA_ARGS__, REP2, REP1,) (__VA_ARGS__)
template <class T> ostream& operator<<(ostream& os, const ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int maxp = 1e6 + 5;
vector<bool> primes(maxp, true);
int prefsum[10] = {0, 1, 3, 6, 10, 15, 21, 28, 36, 45};
int main()
{
ll n, orign;
int ans = 0, count;
cin >> n;
orign = n;
for(ll i = 2; (i * i) <= orign; i++) {
if(... | 0 | 61,896,016 |
#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e6+5;
const long long mod = 1e9+7;
long long Sort[maxn];
long long ans[maxn];
int dir[9][2]={-2,-2,-2,-1,-2,0,-1,-2,-1,-1,-1,0,0,-2,0,-1,0,0};
int tot;
int main()
{
long long H,W,N;
scanf("%lld%lld%lld",&H,&W,&N);
long long Ans=(long long)(H-2)*(long lon... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = vector<string>;
using vld = vector<ld>;
using vvld = vector<vld>;
typedef pair<ll, ll> P;
#def... | 0 | 73,304,691 |
#include<bits/stdc++.h>
#define all(v) v.begin(),v.end()
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int a[5],ans=0,ma;
cin>>a[0]>>a[1]>>a[2];
sort(a,a+3);
if(a[2]%2==(a[0]+a[1]+a[2])%2){
ma=a[2];
}
else{
ma=a[2]+1;
}
int ans1=0;
for... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define reps(i,n) for(int i=1;i<(int)(n);i++)
typedef long long ll;
using namespace std;
ll gcd(ll a, ll b) {
if (b==0) return a;
else return gcd(b, a%b);
}
ll lcm(ll a, ll b) {
return a * b / gcd(a, b);
}
ll digit_sum(ll a){
ll ans=0;
wh... | 0 | 5,279,260 |
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<cmath>
using namespace std;
#define REP(i, limit) for(int i=0; i< limit; ++i)
#define FOR(i, j, limit) for(int i=j; i< limit; ++i)
#define DUMP(a) REP(d,a.size()){cout<<a[d];if(d!=a.size()-1)cou... | #include <iostream>
#include <vector>
#include <math.h>
#include <algorithm>
typedef long long ll;
using namespace std;
vector <int> A(3);
vector <vector <int>> dp(100000, vector <int> (3, -1));
int idx,N;
int f,s,ans = -1;
int main() {
cin >> N;
for(int j = 0; j < N; j++ ){
cin >> A[0] >> A[1] >> A[2];
f =... | 0 | 22,485,953 |
#include <cstdio>
#include <algorithm>
using namespace std;
const int MAXN=1e5+10,INF=1e9+4;
int dp[MAXN],N,ans=0;
int main(){
scanf("%d",&N);
fill(dp+1,dp+N+1,INF);
for(int i=1;i<=N;i++){
int temp;
scanf("%d",&temp);
auto l=lower_bound(dp+1,dp+1+i,temp);
*l=temp;
ans... | #include <iostream>
#include <string>
#include <iomanip>
#include <cmath>
#include <vector>
#include <algorithm>
using namespace std;
int main (void){
int n, l;
cin >> n >> l;
vector <string> array(n);
for (int i = 0; i < n; i++) {
cin >> array[i];
}
sort (array.begin(), array.end()); ... | 0 | 94,448,537 |
#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 ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
int main()
{
map<char, int> m;
char c;
while ((c = getc... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string str;
typedef vector<ll> vel;
typedef vector<str> ves;
#define REP(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, b) REP(i, 0, b)
const ll mod = 1000000007;
const double pi = 3.14159265358979;
ll exp... | 0 | 51,071,782 |
#include <bits/stdc++.h>
#include <fstream>
#include<string>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
typedef long long ll;
typedef long double ld;
using namespace std;
using namespace __gnu_pbds;
#define endl "\n"
#define FIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
... | #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,... | 0 | 76,952,800 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long N,K;
cin>>N>>K;
vector<int>test(N);
for(int i=0;i<N;i++){
cin>>test.at(i);
}
sort(test.begin(), test.end(),greater<int>());
int ans=0;
for(int i=0;i<K;i++){
ans=ans+test.at(i);
}
cout<<ans<<endl;
} | #include<iostream>
using namespace std;
int selectionsort(int n, int *buff)
{
int j,minj,i;
int count=0;
for(i=0;i<n;i++){
minj=i;
for(j=i;j<n;j++){
if(buff[minj]>buff[j]) minj=j;
}
if(i!=minj){
swap(buff[minj],buff[i]);
count++;
}
}
return count;
}
int main()
{
int n;
int buff[100];
cin>>n;
... | 0 | 100,302,649 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int a, b; cin >> a >> b;
int p = a * b;
if (p % 2 == 0) cout << "Even" << endl;
else cout << "Odd" << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
using namespace std;
using ll = int64_t;
using vi = vector<int>;
using vvi = vector<vi>;
int main() {
string s, t;
cin >> s >> t;
int num = s.size();
vi si(num), ti(num);
rep(i, num) {
si[i] = s[i] - 'a';
ti[i] = t[i] ... | 0 | 33,956,843 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long int takahasi,nakahasi,hikuhasi,K;
cin>>takahasi>>nakahasi>>hikuhasi>>K;
if(K%2==0){
K=2;
}else if(K%2==1){
K=1;
}
if(takahasi==nakahasi==hikuhasi){
cout<<0<<endl;
return 0;
}
for(int i=1;i... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define test int t; cin>>t; while(t--)
vector<int>arr[200001];
int vis[200001],di[200001];
void bfs(int root)
{
queue<int> que;
que.push(root);
di[root] = 0;
vis[root] = 1;
while (!que.empty()) {
root = que.front();
que... | 0 | 40,060,988 |
#include <bits/stdc++.h>
#define _ ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define int long long
#define pb push_back
#define sz(i) (int)(i.size())
#define F first
#define S second
#define L long double
#define P pair<int, int>
const int inf = 0x3f3f3f3f3f3f3f3LL;
const int mod = (int)1e9 + 7;
us... | #include <bits/stdc++.h>
using namespace std;
#define froop1(a,n) for(int i = a;i < n;i++)
#define froop2(a,n) for(int i = a;i > n;i--)
int main(){
string S1,S2;
int sw = 0;
cin >> S1 >> S2;
if(S1.length() < S2.length()){
cout << "UNRESTORABLE" << endl;
return 0;
}
int count = 0;
for(int i = S1.length... | 0 | 34,194,204 |
#include <iostream>
using namespace std;
string shuffle(string str, int n)
{
string leftString = str.substr(0, n);
string rightString = str.substr(n, str.size());
return rightString + leftString;
}
int main()
{
string str;
int m, n;
while (true) {
cin >> str;
if (!str.compare("-"... | #include<bits/stdc++.h>
using namespace std;
#define read FILE *fp;\
fp=freopen("testcase.txt","r",stdin);
#define ll long long
#define ull unsigned long long
#define sf(n) scanf("%lld",&n)
#define pf(n) printf("%lld ",n)
#define loop for(long long i=0;i<n;i++)
#define lp(b,n) for(long long i=b;i<=n;i++)
#define pb(n) ... | 0 | 95,432,007 |
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define codefor int test;scanf("%d",&test);while(test--)
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define yn(ans) if(ans)pr... | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define pu... | 0 | 67,930,835 |
#include <bits/stdc++.h>
using namespace std;
struct Fast {Fast(){cin.tie(0);ios::sync_with_stdio(0);}} fast;
using intpair = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0,i##_max=(N);i<i##_max;++i)
#define repp(i,l,r) for(int i=(l),i##_max=(r);i<i##_max;++i)
#define per(i,N) for(int i=(N)-1;i>=0;--i)
#define perr(i,l,r) for(int i=r-1,i##_min(l);i>=i##_min;--i)
#define all(arr) (arr).begin(), (arr).end()
#define S... | 0 | 91,501,523 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll INF = 1LL << 62;
const double PI = acos(-1);
const double eps = 1e-10;
int main() {
string s, t;
cin >> s >> t;
cout << t << s << endl;
return 0;
} | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <cmath>
#include <numeric>
#include <iomanip>
#include <stack>
#include <complex>
#include <functional>
#include <tuple>
using namespace std;
#define Rep(i,a,b) for(ll i = a; i < b; ++i)
... | 0 | 10,263,510 |
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 42
#endif
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define all(x) (x).begin(),(x).end()
#define foreach(u,v) for(auto (u) : ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll solve() {
ll N, A, B, p;
cin >> N >> A >> B;
vector<ll> n(3);
for ( int i = 0; i < N; i++ ) {
cin >> p;
if ( p <= A ) n[0]++;
else if ( p <= B ) n[1]++;
else n[2]++;
}
ll ans = min({n[0],n[1],n... | 0 | 10,860,600 |
#include<bits/stdc++.h>
#define PI 3.141592653589
using namespace std;
using ll = long long;
template<typename T_char>
T_char ToUpper(T_char cX){return toupper(cX);}
int main(){
int n;
cin >> n;
string w, cpw;
string ans = "Yes";
map<string, int> count;
for(int i=0; i<n; ++i){
cin >> w;
if(i==0){
... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
#include <cmath>
#include <tuple>
#include <cstdio>
#include <bitset>
#include <sstream>
#include <iterator>
#include <numeric>
#include <map>
#include <cstring>
#include <set>
#include <functional>
#include <... | 0 | 74,932,188 |
#include <iostream>
#include <climits>
#include <vector>
using namespace std;
void fnInput(vector<int>& rvnMtrx)
{
int nMaxSiz;
cin >> nMaxSiz;
rvnMtrx.resize(nMaxSiz + 1);
for (int i = 0; i < rvnMtrx.size() - 1; ++i)
cin >> rvnMtrx[i] >> rvnMtrx[i + 1];
}
int fnMtrxChainMultpl(vector<vector<int>>& rvvnDet... | #include <bits/stdc++.h>
#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) int(v.size())
#define all(... | 0 | 19,502,753 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int X[3][3];
for(int i=0; i<3; i++) {
for(int j=0; j<3; j++) {
cin >> X[i][j];
}
}
int n;
cin >> n;
for(int b=0; b<n; b++) {
int y;
cin >> y;
for(int i=0; i<3; i++) {
for(int j=0; j<3; j++) {
... | #include <iostream>
#include <cmath>
#include <vector>
#include <map>
using namespace std;
int main() {
int n; cin >> n;
while (n--) {
vector<pair<double, double>> p(4);
for (int i = 0; i < 4; i++) {
double x, y; cin >> x >> y;
p[i] = {x, y};
}
double l1_r... | 0 | 41,027,269 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define all(a) (a).begin(), (a).end()
int main() {
int N, K, X, Y;
cin >> N >> K >> X >> Y;
int ans;
if(N > K) ans = K* X + (N - K)*Y;
else ans = N * X;
cout << ans << endl;
} | #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>;
const int MOD = 1e+9 + 7;
int main() {
string L;
cin >> L;
int N = L.size(), max_d, l;
vector<vector<vector<ll>>> dp(N + 1, vector<vector<ll>>(2, vector<ll>(2, 0)));
dp[0... | 0 | 94,860,536 |
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#define ll long long
#define inf 0x3f3f3f3f
#define maxn 200010
inline ll read()
{
ll x=0; char c=getchar(),f=1;
for(;c<'0'||'9'<c;c=getchar())if(c=='-')f=-1;
for(;'0'<=c&&c<='9';c=getchar())x=x*10+c-'0';
return x*f;
}
inline v... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repA(i, a, n) for (int i = a; i <= (n); ++i)
#define repD(i, a, n) for (int i = a; i >= (n); --i)
#define tr(a, x) for (auto &a : x)
#define all(c) c.begin(), c.end()
#define lld long long
#define pb push_back
#define mp make_pair
#define ... | 0 | 44,366,110 |
#include <iostream>
#include <cstdio>
#include <vector>
using namespace std;
int main(void)
{
int n;
cin >> n;
vector<int> a(n);
for(int i = 0; i < n; i++ )
{
cin >> a[i];
}
int min = a[0];
int max = a[0];
long sum = a[0];
for(int i = 1; i < n; i++)
{
if( min > a[i] )
{
min = a[i];
}
if( max < a... | #include <iostream>
#include <vector>
using namespace std;
int main()
{
int n;
cin >> n;
vector<int> heap(n + 1);
for (int i = 0; i < n; ++i) {
int key;
cin >> key;
heap[i + 1] = key;
}
for (int i = 1; i <= n; ++i) {
cout << "node " << i << ": key = " << heap[i] <... | 0 | 91,800,732 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
ll ans = 1;
for(int i ... | #include <bits/stdc++.h>
using namespace std ;
const int MAX = 1e5 + 10 ;
int arr[MAX] ;
int n ;
int main()
{
ios_base::sync_with_stdio(0) ;
cin.tie(0) ;
cin>>n ;
int neg = 0 ;
for(int i = 0 ; i < n ; ++i)
{
cin>>arr[i] ;
if(arr[i] < 0)
neg++ ;
}
for(int i = 0 ; i < n ; ++i)
{
if(neg == n)
arr[i] *... | 0 | 35,747,624 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x=0, y=0;
cin >> x >> y;
int sum = x+(y/2);
cout << sum << endl;
} | #pragma GCC optimize(2)
#include<bits/stdc++.h>
#define read(a) scanf("%d", &a)
#define readl(a) scanf("%lld", &a)
#define reads(a) scanf("%s", a)
#define readf(a) scanf("%lf", &a)
#define readc(a) scanf("%c", &a)
#define debug(a, b) printf("%s = %d\n", a, b)
#define debug1(a, i, b) printf("%s[%d] = %d", a, i, b)
#defi... | 0 | 37,575,501 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 1; i < (n); ++i )
typedef std::pair<int,int> pint;
using namespace std;
typedef long long ll;
int main(){
int N; cin >> N;
string str; cin >> str;
string ans;
char tmp;
tmp = str[0];
ans[0] = tmp;
rep (i,str.length()){
if (str[i] ... | #include <bits/stdc++.h>
using namespace std;
#define fastIO ios_base::sync_with_stdio(false);cin.tie(NULL);
int main(){
fastIO;
int N;
cin >> N;
vector<long long> x(N+1,0);
vector<long long> y(N+1,0);
vector<long long> t(N+1,0);
for(int i=1; i<N+1; i++){
cin >> t[i] >> x[i] >> y[i];... | 0 | 9,953,622 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string s1, s2;
cin >> s1 >> s2;
for(int i = 0; i < s1.size(); i++)
{
if(s1 == s2) return cout << "Yes\n", 0;
s1.insert(s1.begin(), s1.back());
s1.pop_back();
}
cout << "No\n";
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | 0 | 82,152,917 |
#include <bits/stdc++.h>
#define M 1000000007
#define pi 3.14159265358979323846
#define cel(x,a) (x+a-1)/a
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<vector<int>> Matrix;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
const int mod = 1000000000+7;
ll factorial(ll x){
ll ret = 1;
while (x){
ret *= x;
ret %... | 0 | 26,288,705 |
#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 main() {
string s;
cin >> s;
ll cntB=0;
ll ans = 0;
rep(i, s.size()) {
if (s[i] == 'B') cntB++... | #include <iostream>
#include <string>
using std::string;
int main() {
std::ios::sync_with_stdio(false);
string cards, subcards;
int n_shuffles, length;
while(std::cin) {
std::cin >> cards;
if (cards == "-") break;
std::cin >> n_shuffles;
for (int i = 0; i < n_shuffles; i+... | 0 | 84,466,958 |
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define all(v) ((v).begin()), ((v).end())
#define sz size()
#define clr(v,d) memset(v,d,sizeof(v))
#define rep(i, v) for(int i=0;i<(v).sz;++i)
#define lp(i, n) for(int i=0;i<(int)(n);++i)
#de... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <queue>
#include <stack>
#include <cstdlib>
#include <map>
#include <iomanip>
#include <set>
#include <stdio.h>
#include <ctype.h>
#include <random>
#include <string.h>
#include <cmath>
#include <unordered_map>
#inc... | 0 | 94,879,684 |
#include<iostream>
using namespace std;
int main()
{
char str[19];
cin>>str;
int i;
for(i=0;i<19;i++)
{
if(str[i]==',')
{
cout<<" ";
}
else
{
cout<<str[i];
}
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main() {
int n,k;
scanf("%d%d",&n,&k);
if(k % 2 == 1) {
ll ans = 1;
int c = n / k;
rep(i,3) {
ans *= c;
}
printf("%ld\n",ans);
... | 0 | 39,011,858 |
#include<bits/stdc++.h>
using namespace std;
int main(void)
{
int a,b,n,t;
cin>>a>>b;
if(a+b==15) putchar('+');
else if(a*b==15) putchar('*');
else putchar('x');
putchar('\n');
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
int main(){
int n;
cin >> n;
vector<int> v1(100010, 0), v2(100010, 0);
rep(i, n){
int v;
cin >> v;
if (i % 2 == 0) v1[v]++;
else v2[v]++... | 0 | 95,391,707 |
#include <functional>
#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
#include <queue>
#include <string>
#include <cstring>
#include <math.h>
using namespace std;
int main() {
int a[5];
int sum = 0;
int min = 10;
for(int i = 0;i<5;i++){
cin >> a[i];
int b = 0;
if(a[i... | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
int N;
cin >> N;
vector<int> T(N + 2), TS(N + 2), V(N + 2);
for (int i = 1; i <= N; i++) {
cin >> T[i];
TS[i] = TS[i - 1] + T[i]... | 0 | 100,394,854 |
#include<stdio.h>
#include<string.h>
#include<iostream>
using namespace std;
struct card{char suit,value;};
void bubbl(struct card a[],int n){
for(int i=0;i<n;i++){
for(int j=n-1;j>=i+1;j--){
if(a[j].value<a[j-1].value){
card t=a[j];a[j]=a[j-1];a[j-1]=t;
}
}
}
}
void selectio(st... | #include<bits/stdc++.h>
using namespace std;
using Int = long long;
#include<bits/stdc++.h>
using namespace std;
using Int = long long;
template<typename T, typename E>
struct FGC{
typedef function<T(T, E)> F;
typedef function<E(E, E)> G;
typedef function<bool(T,T)> C;
F &f;
G &g;
C &c;
FGC(F &f,G &g,C &c... | 0 | 83,507,277 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define forin(in, n) for(int i=0; i<n; i++) cin>>in[i]
#define forout(out, n) for(int i=0; i<n; i++) cout<<out[i]<<endl
int main(){
int N, M, X;
cin >> N >> M >> X;
int C[N], A[N][M];
for (int i = 0; i < N; i++) {
cin >> C[i];
for (int j = 0... | #include <iostream>
using namespace std;
int main()
{
int a,b,c,temp;
cin >> a >> b >> c;
while(1)
{
if((a < b && b < c) || (a == b && b < c ) || (a == b && b == c ))
break;
else if(b < a)
{
... | 0 | 88,357,260 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i,n) for(int i = 0; i < n; i++)
#define MOD 1000000007
int main() {
int x,y;
cin >> x >> y;
string grid[x];
rep(i,x) cin >> grid[i];
int cnt1[x][y];
rep(i,x) rep(j,y) cnt1[i][j] = 0;
int l,r,cnt;
rep(i,x) {
l = 0;
... | #include <iostream>
#include <algorithm>
using namespace std;
long long x[100001], endx[100001];
long long w[100001];
int main() {
#ifdef ONLINE_JUDGE
ios_base::sync_with_stdio(false);
#endif
long long n, l, t;
cin >> n >> l >> t;
long long c = 1;
for (long long i = 1; i <= n; ++i) {
cin >> x[i] >> w[i];
if (w... | 0 | 42,736,881 |
#include <bits/stdc++.h>
#define arep(a,i,n) for(ll i=(a);i<(n);i++)
#define rep(i,n) for(ll i=0;i<(n);i++)
#define cinf(x,n) for(ll i=0;i<(n);i++)cin>>x[i];
#define coutf(x,n) for(ll i=0;i<(n);i++)cout<<x[i]<<endl;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
using namespace std;
int m... | #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... | 0 | 27,616,528 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
using PL = pair<ll,ll>;
int main()
{
int x, y, z, k;
cin >> x >> y >> z >> k;
vector<ll> a(x), b(y), c(z);
for(int i = 0; i < x; i++)cin >> a[i]; sort(a.begin(), a.end(), greater<ll>());
for(int i = 0; i < y; i++)cin >> b[i... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1e18;
ll dx[] = {1, 0};
ll dy[] = {0, 1};
int main() {
ll h, w;
cin >> h >> w;
string s[h];
ll ans[h][w] = {};
rep(i, h) rep(j, w) ans[i][j] = INF;
rep(i, h) cin >> s[i];
ans[0... | 0 | 35,546,018 |
#include <iostream>
#include <cmath>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
#define INF 1e9
#define MAXN 100005
#define MAXM 100005
#define ll long long
#define vi vector<int>
#define vll vector<long long>
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define pii pair... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define sci(x) scanf("%d", &x)
#define scl(x) scanf("%lld", &x)
#define scd(x) scanf("%lf", &x)
#define l0(i,n) for(ll i=0; i<n; i++)
int main ()
{
ios::sync_with_stdio(0);
cin.tie(0);
string s1,s2,s3;
cin >> s1 >> s2 >> s3;
putcha... | 0 | 93,303,781 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
#define pb push_back
#define fr(i,n) for(int i=0;i<n;i++)
#define Fr(i,n) for(int i=0;i++<n;)
#define ifr(i,n) for(int i=n-1;i>=0;i--)
#define iFr(i,n) for(int i=n;i>0;i--)
int main(){
ll n,a[200010],s=0,ans=1e18,x;
cin>>n;
fr(i... | #include<stdio.h>
#include<stdlib.h>
#include<limits.h>
#define N 101
int main(){
int a[N],b[N][N];
int i,n,k,j,l=0,tmp=0;
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%d%d",&a[i-1],&a[i]);
}
for(i=1;i<=n;i++){
b[i][i]=0;
}
for(j=2;j<=n;j++){
for(i=1;i<=n-j+1;i++){
k=i+j-1;
b[i][k]=... | 0 | 16,774,308 |
#pragma target("avx")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef unordered_map<ll, ll> U_MAP;
typedef priority_queue<ll> pq;
typedef priority_queue<ll, vector<ll>, greater<ll>> rpq;
constexpr ll INF = 1e9, MOD = 1e9 +... | #include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,b,a) for(int i=b;i>=a;i--)
#define fori(a) for(auto i : a )
#define all(a) begin(a), end(a)
#define set(a,b) memset(a,b,sizeof(a))
#define sz(a) a.size()
#define pi 3.14159
#define ll long long
#define ull unsigned long long
#define pb push... | 0 | 94,722,624 |
#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() {
string a,b;
cin>>a>>b;
int c,d;
c=a.size();d=b.size();
string ans="EQUAL";
if(c<d){
ans="LESS";
}else if(d<c){
ans="GREATER";
}else{
rep(i,c){
if(... | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
using ll = long long;
using ld = long double;
#define vpl vector<pair<long long,long long>>
#define vl vector<long long>
#define vvl vector<vector<long long>>
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (... | 0 | 70,997,448 |
#include<bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a),i##formax=(b);i< i##formax;i++)
#define FORR(i,a,b) for(int i=(a),i##formin=(b);i>=i##formin;i--)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define pcnt __builtin_popcount
#define sz(x) (int)(x).size()
#def... | #include<stdio.h>
#include<algorithm>
#include<vector>
#define fst first
#define snd second
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
int N, M;
char A[100][100+1];
int D[100][100];
int main() {
scanf("%d%d", &N, &M);
for(int i = 0; i < N; i++) {
scanf("%s", A[i]);
}
... | 0 | 80,104,048 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K; string S; cin >> N >> K >> S;
vector<int> v;
if(S.at(0) == '1') v.push_back(0);
char c = S.at(0);
for (int i = 0; i < N; i++) {
int cnt = 1;
while(i + 1 < N) {
if(S.at(i + 1) == c) {
i++; cnt++;
}
else break... | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define piii pair<int,pii>
#define pll pair<ll,ll>
#define plii pair<ll,pii>
#define vi vector<int>
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define SORT(x) sort(x.begin(), x.end())... | 0 | 55,170,330 |
#include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define LCM(a, b) (a) / __gcd((a), (b)) * (b)
#define CEIL(a, b) (a)/(b)+(((a)%(b))?1:0)
#define log_2(a) (log((a)) / log(2))
#define ln '\n'
using n... | #include <iostream>
#include <vector>
using namespace std;
int main(){
int n,a,b,c,x;
while(cin>>n>>a>>b>>c>>x&&n|a|b|c|x!=0){
vector<int> y(n);
for(int i=0;i<n;i++){
cin >> y[i];
}
int count=0;
int flag=0;
for(int i=0;i<n;i++){
if(y[i]==x&&flag==0){
flag++;
conti... | 0 | 25,499,839 |
#include<bits/stdc++.h>
#define ll long long
#define mod (long long)(1e9+7)
#define endl "\n"
using namespace std;
void solve(){
string s;
cin>>s;
ll n=s.length();
ll ans=0;
for(ll i=0;i<n;i++){
ans=(ans+(s[i]-'0'))%9;
}
if(ans==0){
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<endl;
}
}
int main(){
ll t=1;
... | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
typedef long long ll;
const int INT_INF = 1e9;
const ll INF = 1LL << 30;
const ll MOD = 1e9 + 7;
const ll limit = 100010;
using edge = struct { ll to; ll cost; };
V<edge> G[limit];
ll dis[limit];
void dfs(ll ... | 0 | 79,563,471 |
#include <vector>
#include <bitset>
#include <limits>
#include <iostream>
long long solve(int n, int k, const std::vector<long long> & a) {
long long cost { std::numeric_limits<long long>::max() };
for (int i = 0; i < (1 << n); ++i) {
const std::bitset<15> bits(i);
if (bits.count() < k) {
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 3e5 + 10;
int main() {
int n;
cin >> n;
typedef pair<int, int> pa;
vector<pa> v;
for(int i = 1, x; i <= n; i++) {
cin >> x;
v.push_back(pa(x, i));
}
sort(v.begin(), v.end());
multiset<int> st... | 0 | 45,967,103 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,a) for(int i = 0; i < (a); i++)
#define ALL(a) (a).begin(),(a).end()
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const long long LINF = 1e18;
const long long MOD = 1e9 + 7;
signed main(){
string a;
cin >> a;
ll n = a.size()... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int> > vii;
#define rrep(i, m, n) for(int (i)=(m); (i)<(n); (i)++)
#define erep(i, m, n) for(int (i)=(m); (i)<=(n); (i)++)
#define rep(i, n) for(int (i)=0; (i)<(n); (... | 0 | 44,107,536 |
#include <bits/stdc++.h>
using namespace std ;
using ll=long long ;
int main(){
int x,y;
cin>>x>>y;
if(y>4*x || y<2*x)
{
cout<<"No";
return 0 ;
}
if (y%2 !=0)
{
cout<<"No";
return 0 ;}
cout << "Yes" ;
} | #include <cstdio>
#include <cstring>
#include <vector>
#define MAX_N 100000
using namespace std;
typedef long long int ll;
int N, M;
vector<int> G[MAX_N];
int color[MAX_N];
ll ans;
bool dfs(int v, int c) {
bool is_bipartite = true;
if (color[v] != 0) {
return (color[v] == c);
}
color[v] = c;
for (int e = ... | 0 | 35,858,645 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
using ll = long long;
using P = pair<int,int>;
int main()
{
int n;cin >> n;
ll a[n+1];
rep(i,n)cin >> a[i];
sort(a,a+n);
ll ans = a[n-1] - a[0];
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
int main(void) {
ll x, y, z, k;
cin >> x >> y >> z >> k;
vector<ll> a(x);
rep(i, x) cin >> a[i];
vector<ll> b(y);
re... | 0 | 93,625,697 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll,ll> l_l;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#def... | #define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <bi... | 0 | 12,336,085 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long LL;
typedef vector<ll>VI;
typedef vector<bool>VB;
typedef pair<ll,ll>P;
typedef pair<double,double>P_D;
#define VV(T) vector<vector<T>>
#define PI 3.1415926535897932384626433832795
#define rep(i, n) for (ll i = 0; i < (ll)n; i... | #include <iostream>
#include <vector>
using namespace std;
const int MOD = 1000000007;
typedef long long ll;
int main(){
int N;
cin >> N;
vector<ll> T(N);
vector<ll> A(N);
for(int i = 0;i < N;i++)cin >> T[i];
for(int i = 0;i < N;i++)cin >> A[i];
if(A[0] != T[N-1]){
cout << 0 << endl;
return 0;
}
int index_... | 0 | 54,295,776 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <limits>
using namespace std;
typedef long long LL;
using Graph = vector<vec... | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define ld long double
#define pll pair<ll, ll>
#define pii pair<int, int>
#define f first
#define se second
#define pb push_back
using namespace std;
const int N = 1e3 + 123;
const int MAXN = 2e5;
const int brd = 32;
const ull inf = 1e18 + 7;
ll n,... | 0 | 62,929,653 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <math.h>
#include <map>
#include <queue>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
int main()
{
int n, left, right;
string s;
ci... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
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; }
r... | 0 | 68,021,316 |
#pragma region header
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#i... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <functional>
#include <bitset>
#include <numeric>
#include <complex>
#include <cassert>
#include <random>
long long extgcd(long long a, long long... | 0 | 48,849,196 |
#include<bits/stdc++.h>
#define all(v) v.begin(),v.end()
using namespace std;
using ll=long long;
#ifdef ONLINE_JUDGE
#define D(...)
#else
#define D(...)cerr<<__LINE__<<":"<<"["<<#__VA_ARGS__<<"]->",P(__VA_ARGS__)
#endif
void P(){cerr<<endl;}
template<typename H,typename...T>void P(H h,T...t){cerr<<h<<" ";P(t...);}
in... | #include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<vector>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<time.h>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#define all(in) in.b... | 0 | 75,913,147 |
#include<cstdio>
long long a[1005];
long long b[1000005];
int delet[1000005];
int main(){
int n,k;
scanf("%d%d",&n,&k);
for(int i = 1; i <= n; i++) scanf("%lld",&a[i]);
int size = 0;
for(int i = 1; i <= n; i++){
long long sum = 0;
for(int j = i; j <= n; j++){
sum += a[j];... | #include <iostream>
using namespace std;
int main() {
string x;
int ans,i;
while (cin>>x && x != "0") {
ans = 0;
for (i=0;i<x.size();i++) {
ans += x[i] - '0';
}
cout << ans << endl;
}
return 0;
} | 0 | 43,991,081 |
#include <bits/stdc++.h>
#define endl "\n"
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define fi first
#define se second
#def... | #include <cmath>
#include <iostream>
#include <vector>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <bitset>
#include <algorithm>
#include <functional>
#include <utility>
#include <iomanip>
#define int long long int
#define mod(x) ((x % MOD) + MOD) % MOD
#de... | 0 | 29,236,501 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
for (int i = 1; i <= N; i++) {
cin >> A.at(i);
}
sort(A.begin(), A.end());
vector<int> dp(1000001);
for (int i = 1; i <= N; i++) {
dp.at(A.at(i))++;
if (dp.at(A.at(i)) == 1) {
for (int j =... | #include <iostream>
#include <string>
using namespace std;
int main() {
for (;;) {
int x;
int y;
cin >> x >> y;
if (x == 0 && y == 0) break;
if (x > y) {
int a = x;
int x = y;
int y = a;
cout << x << " " << y << endl;
}
else {
cout << x << " " << y << endl;
}
}
return 0;
} | 0 | 42,410,160 |
#include <cstdio>
int n, x, y, a[1005], b[1005], o;
char c[] = "RUDL";
int main(){
scanf("%d", &n);
for(int i = 0; i < n; i++){
scanf("%d%d", &x, &y);
if(i && x+y&1^o) return puts("-1")*0;
else o = x+y&1;
if(!o) x++;
a[i] = (1<<30)-(x+y+1)/2; b[i] = (1<<30)-(x-y+1)/2;
}
printf("%s", o ? "31\... | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define SZ(X) ((int)(X).size())
#define endl "\n";
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int n,m,a,sum=0;
cin>>n>>m;
for (int i = 0; i < m; ++i)
{
cin>>a;
sum+=a;
}
int ans = n-sum;
if(ans<0) cout<<-1; el... | 0 | 96,147,018 |
#include <bits/stdc++.h>
#if DEBUG
template <typename T>
void debug(T value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) \
do { \... | #include "bits/stdc++.h"
using namespace std;
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... | 0 | 79,473,979 |
#include <bits/stdc++.h>
using namespace std;
int main() {
char a, b, c, d;
cin >> a >> b >> c >> d;
if ((a == b)&&(b == c) ){
cout << "Yes" << endl;
}
else if ((c == b)&&(b == d) ){
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
} | #include<bits/stdc++.h>
#define rep(i,n) for (int i=0; i<n; i++)
#define REP(i,x,n) for (int i=x; i<n; i++)
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using ll = long long;
const int mod =1'000'000'007;
int main(){
int n;
cin >> n;
map<int, int> mp;
rep(i,n){
int x;
... | 0 | 73,906,723 |
#include <iostream>
#include <bitset>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int a = N / 7;
int b = (N / 4);
if (N % 7 == 0 || N % 4 == 0 ){
cout << "Yes" << endl;
return 0;
}
int y4 = 1;
int y7 = 1;
int sum = 0;
do{
sum = (y4... | #define _USE_MATH_DEFINES
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <cstdio>
#include <complex>
#include <numeric>
#include <string.h>
#include <random>
#include <cmath>
#define rep(i,n) for (int i = 0; i < (int)n; i++)
using nam... | 0 | 87,207,630 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int i, j;
int n; cin >> n;
vector<string> s(n); for (i=0; i<n; i++) cin >> s[i];
int m; cin >> m;
vector<string> t(m); for (i=0; i<m; i++) cin >> t[i];
int max_point = 0, point = 0;
bool different = true;
vector<string> str(1, s.... | #include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <set>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define dbg(x) cout<<#x"="<<x<<endl
typ... | 0 | 87,965,251 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Edge = int;
using Graph = vector<vector<Edge>>;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
const ll MOD = 1000000007;
const ll nmax = 8;
const ll IN... | #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.at(i);
int ans = 0;
for (int bh = 0; bh < (1 << h); bh++) {
for (int bw = 0; bw < (1 << w); bw++) {
int count = 0;
for (int i = 0; i < h; i++) {
... | 0 | 83,459,866 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
const int ... | #include <iostream>
#include <algorithm>
using namespace std;
const int INF = 100000000;
int main() {
int n, p, a, b, c;
int m[10][10];
while (1) {
cin >> n;
if (!n) break;
for (int i=0; i<10; i++) {
for (int j=0; j<10; j++) {
m[i][j] = INF;
}
m[i][i] = 0;
}
p = 0;
... | 0 | 13,194,773 |
#include <iostream>
#include <cstdio>
#include <string>
#include <sstream>
#include <algorithm>
#include <math.h>
#include <iomanip>
#include <vector>
using namespace std;
int main()
{
int heya[4][3][10];
int n, b, f, r, v;
bool first_flag;
for (int i=0; i<4; i++)
{
for (int j=0; j<3; j++)
{
for (int k=0; k... | #include<bits/stdc++.h>
using namespace std;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void ... | 0 | 53,717,763 |
#include <iostream>
#include <cstdlib>
#include <vector>
using namespace std;
int main(void){
int n1, n2, tmp, row;
cin>>n1;
vector < vector <int> > M(n1, vector <int>(n1));
for (int j=0; j<n1; j++){
cin>>row;
cin>>n2;
for (int i=0; i<n2; i++){
cin>>tmp;
M[row-1][tmp-1] = 1;
}
}
for (int i=0; i<n1; ... | #include <bits/stdc++.h>
using namespace std;
int main(){
int64_t N, P, ans = 0;
string S;cin >> N >> P >> S;
reverse(S.begin(), S.end());
if (P == 2 || P == 5){
for (int i = 0; i < N; i++){
int sint = S[i] - '0';
if (sint % P == 0)
ans += N - i;
}
}
else{
vector<int64_t> Cou... | 0 | 77,902,292 |
#include<iostream>
using namespace std;
int main() {
int n; cin >> n;
string s; cin >> s;
int ans = 0;
for (int i = 0; i < 1000; i++) {
int c[3] = { i / 100,(i / 10) % 10,i % 10 };
int hit = 0;
for (int j = 0; j < n; j++) {
if (s[j] == ('0' + c[hit]))hit++;
if (hit == 3)break;
}
if (hit == 3)ans++;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define pii pair<int,int>
#define pll pair<long,long>
#define vi vector<int>
#define vll vector<ll>
#define vii vector<pii>
#define mi map<int,int>
#define mii ... | 0 | 79,280,104 |
#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>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, co... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define allrev(x) (x).rbegin(), (x).end()
#define pb push_back
#define pf push_front
#define fori(i, a, n) for(int i = a; i < n; ++i)
#define MAX(x) (*max_element(all(x)))
#define ... | 0 | 57,272,404 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e3+5,M=2e4+5,inf=0x3f3f3f3f,mod=1e9+7;
#define mst(a,b) memset(a,b,sizeof a)
#define lx x<<1
#define rx x<<1|1
#define reg register
#define PII pair<int,int>
#define fi first
#define se second
#define pb push_back
#define il inline
ll fun(l... | #include<iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
using P = pair<int,int>;
char tolower(char c) {return (c + 0x20);}
char toupr(char c) {return (c - 0x20);}
ll choose2(ll x){
return x*(x-1)/2;
}
int main()
{
int n;
cin >> n;
vect... | 0 | 57,897,259 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
int tax8,tax10;
for(int i=1; i<=10000; i++){
tax8=i*0.08;
tax10=i*0.1;
if(a==tax8 && b==tax10){
cout << i << endl;
break;
}
if(i==10000) cout << -1 << endl;
... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() {
cerr << endl;
}
template <typename H, typename... T>
void d_err(H h, T... ... | 0 | 24,956,593 |
#include <cstdio>
using namespace std;
int main(){
int a,b,d,r;
double f;
scanf("%d%d", &a,&b);
d=a/b; r=a%b;
f=1.00*a/b;
printf("%d %d %.6lf\n",d,r,f);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | 0 | 20,441,262 |
#include <iostream>
#include <algorithm>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <numeric>
#include <functional>
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) r... | #include<bits/stdc++.h>
#define LL long long
using namespace std;
const int maxn = 105;
int q;
const long double eps = 1e-9;
int main()
{
scanf("%d", &q);
for(int i = 0; i < q; i ++) {
int a, b;
scanf("%d%d", &a, &b);
if(a > b)
swap(a, b);
long double t = (long double... | 0 | 32,801,417 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cassert>
#include <climits>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <fstr... | #include <iostream>
int main() {
int h, w = 0;
while(std::cin >> h >> w, h || w) {
for(int i = h ; i; i--) {
for(int j = w; j; j--) {
if(i == h || i == 1 || j == w || j == 1) {
std::cout << "#";
}else {
std::... | 0 | 83,359,113 |
#include <bits/stdc++.h>
#include <x86intrin.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define V vector
template <typename T> bool chmin(T &a, const T &b) {if(a > b){a = b... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const string YES = "Yes";
const string NO = "No";
void solve(long long X, long long Y){
bool check = false;
for(ll i = 0; i <= 100; ++i){
for(ll j = 0; j <= 100; ++j){
if(2*i + 4*j == Y && i + j == X) check = true;
}... | 0 | 97,326,611 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
using namespace std;
#define REP(i, x) for(int i=0;i<(int)(x);i++)
#define REPS(i, x) for(int i=1;i<=(int)(x);i++)
#define RREP(i, x) for(int i=(int)(x)-1;i>=0;i--)
#define RREPS(i, x) for(int i=(int)(x);i>0;i--)
#define FOR(it, x) for(auto it=x.b... | #include <algorithm>
#include <complex>
#include <cstdlib>
#include <ctime>
#include <time.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define SAY... | 0 | 13,267,733 |
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long LL;
#define maxn 101000
int main()
{
int n,i;
scanf("%d%d",&n,&i);
printf("%d\n",n-i+1);
return 0;
} | #include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <map>
#include <unordered_map>
#include <string>
#include <tuple>
using namespace std;
typedef long long ll;
int N;
string S;
int X, Y;
std::vector<int> d;
std::vector<int> dx;
std::vector<int> dy;
bool ok(std::vector<int> &dx, int g... | 0 | 13,147,265 |
#pragma GCC optimize("O3")
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include... | #include <bits/stdc++.h>
using namespace std;
long long indB, ans;
string s;
int main() {
cin >> s;
for(char ele: s){
if(ele == 'B')
indB++;
else if(ele == 'W')
ans += indB;
}
cout << ans << endl;
} | 0 | 661,504 |
#include <bits/stdc++.h>
using namespace std;
#define ENDL '\n'
#define sayy cout<<"YES"<<ENDL;
#define sayn cout<<"NO"<<ENDL;
int main(){
string s,t;
cin >> s >> t;
int ans(0);
for (int i(0); i < 3; i++) {
if(s[i] == t[i]) ans++;
}
cout << ans << ENDL;
return 0;
} | #include <iostream>
#include <utility>
static void bsort(char c[][3], int n) {
for (int i = 0; i < n; ++i) {
for (int j = n - 1; j > i; --j) {
if (c[j][1] < c[j - 1][1]) {
std::swap(c[j], c[j - 1]);
}
}
}
}
static void ssort(char c[][3], int n) {
for (... | 0 | 10,519,375 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define INF_LL 1LL << 60
#define INF 99999999
#define MOD (ll)1000000007
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define REP(i, a, n) for(int i = a; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
void put_double(double obj){printf("%... | #include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
#include<map>
#include<string>
#include<iomanip>
using namespace std;
#define rep(i, n) for(int (i) = 0; (i) < (n); (i)++)
#define repn(i, n) for(int (i) = 1; (i) <= (n); (i)++)
#define repr(i, n) for(int (i) = (n-1); (i) >= 0; (i)--)
#define all(x... | 0 | 48,490,806 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define range(i,a,b) ((a)<=(i) && (i)<(b))
#define debug(x) cout << #x << " = " <... | #include <bits/stdc++.h>
using namespace std;
int main()
{
long long X, Y;
cin >> X >> Y;
long long cnt = 1LL;
while (X <= Y)
{
X *= 2LL;
if (X > Y)
break;
cnt++;
}
cout << cnt << endl;
return 0;
} | 0 | 53,229,335 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.