code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 44 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5+5;
int n;
int ar[N];
int pr[N][20];
bool can(int mid , int idx){
for(int i = 0; i < 20; i++){
if(pr[mid][i] - pr[idx - 1][i] > 1)
return 0;
}
return 1;
}
int main(){
scanf("%d" , &n);
for(int i = 1; i <= n; i++){
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, pii> pipii;
typedef pair<pii, int> piipi;
typedef pair<pii, pii> piipii;
#define mp make_pair
#define fi first
#define se second
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()
#define e... | 0 | 98,051,175 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string ABCD;
cin >> ABCD;
int a, b, c, d;
a = (int)ABCD.at(0) - 48;
b = (int)ABCD.at(1) - 48;
c = (int)ABCD.at(2) - 48;
d = (int)ABCD.at(3) - 48;
int n = 3;
vector<int> answerCal(3);
for (int bit = 0; bit < (1 << n); bit+... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i=0;i < (int)(n);i++)
struct edge{int c,s,f;};
int main(){
int n;
cin >> n;
vector<edge> v(n-1);
rep(i,n-1){
int a,b,c;
ci... | 0 | 44,986,205 |
#include<bits/stdc++.h>
#define PI 3.1415926535897932384626
#define fo(i,n) for(i=0;i<n;i++)
#define Fo(i,a,b) for(i=a;i<b;i++)
#define ll long long
#define pb push_back
#define popb pop_back
#define mp make_pair
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define ini(a) memset(a,-1,sizeof(a))
#d... | #include <stdio.h>
#include <cctype>
#include <limits.h>
#include <math.h>
#include <complex>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <cstring>
#include <string>
#include <sstream>
#include <algorithm>
#include <iomanip>
#include <iostream>
#define VA... | 0 | 42,031,659 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A , B , C , D;
cin >> A >> B >> C >> D;
int a = A + B;
int c = C + D;
if (a < c) {
cout << "Right" << endl;
}
else if (a == c) {
cout << "Balanced" << endl;
}
else if (a > c) {
cout << "Left" << endl;
}
} | #include <iostream>
#include <string>
#include <cstdlib>
using namespace std;
int main(){
int n;
while(cin>>n,n){
int state=0,cnt=0;
for(string step;n>0;--n){
cin>>step;
if(step=="lu"||step=="ru"){
if(state==1) cnt++;
state=1;
}else{
if(state==0) cnt++;
stat... | 0 | 85,516,828 |
#include <bits/stdc++.h>
#include<list>
#include<algorithm>
#define ll long long int
#define ld long double
#define pb push_back
#define ff first
#define ss second
#define rep(a,b,c) for(a=b;a<c;a++)
#define repj(a,b,c) for(a=b;a<c;a++)
#define repr for(i=n-1;i>=0;i--)
#define pii pair<ll,ll>
#define pll pair<ll, ll>
#... | #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 K, S; cin>>K>>S;
int cnt=0;
for(int x=0; x<=K; x++){
for(int y=0; y<=K; y++){
if(x+ y... | 0 | 5,440,068 |
#include <iostream>
#include<cmath>
#include<string>
using namespace std;
int main()
{
string s;
cin>>s;
int a=0,b=0;
int k=s.length();
for(int i=0;i<k;i++)
{
if(s[i]=='A')
a++;
... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using vll = vector<ll>;
int N;
vll A;
bool f(ll k) {
ll sum = 0;
rep(i,A.size()) {
sum += (A[i]+k+1)/(N+1);
}
return sum <= k;
}
int main() {
cin >> N;
A.resize(N);
... | 0 | 89,695,717 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
string s;
int main(void){
cin>>s;
for(int i=0;i<s.size();i++){
if(s[i]!=','){
cout<<s[i];
}else{
cout<<" ";
}
}
cout<<endl;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
class DisjointSet{
public:
vector<int> p;
DisjointSet(int size){
for(int i=0;i<size;i++) makeSet(i);
}
void makeSet(int x){
p.push_back(x);
}
void unite(int x, ... | 0 | 30,803,278 |
#include <iostream>
#include<queue>
struct cheese{
int x,y;
};
using namespace std;
int map[1001][1001],walk[1001][1001];
int main(void){
int X,Y,sx,sy,gx,gy,xx,yy,N,Ncnt=1,i,i2,ans=0,bx[4]={1,-1,0,0},by[4]={0,0,1,-1};
char nyuryoku[1001][1001];
queue<cheese> jotai;
cheese ima,tugi;
cin>>Y>>X>>N... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define INF 100000000
#define rep(i,s,n) for (int i = (int)(s); i < (int)(n); i++)
#define mp make_pair
ll mod = 10e9+7;
ll mod2 = 998244353;
int main(){
vector<ll> ans;
while (true){
int n... | 0 | 24,334,921 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(n) begin(n),end(n)
using ll = long long;
using P = pair<int,int>;
int main() {
int n, m;
cin >> n >> m;
vector<string> a(n),b(m);
rep(i,n) cin >> a[i];
rep(i,m) cin >> b[i];
bool ok = false;
r... | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INF INT_MAX
#define INFLL LLONG_MAX
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define per(i, n) for(ll i=((ll)(n))-1; i>=0; i--)
#define perf(i, n) for(l... | 0 | 70,395,315 |
#include<bits/stdc++.h>
#define fast ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define int long long
#define endl '\n'
using namespace std;
const int N = 2e5 + 77;
void sol(){
string s ,t ; cin >> s >> t ;
int n = s.length() , m = t.length();
for(int i = n-m; i >=0 ; --i){
string a... | #include <algorithm>
#include <bits/stdc++.h>
#define ll long long
#define pi (acos(-1))
#define rep(i, n) for (unsigned long long i = 0; i < (unsigned long long)(n); ++i)
using namespace std;
std::vector<unsigned ll> genprimevec(const unsigned ll N);
int main()
{
unsigned ll h, w;
cin >> h >> w;
if(h==1||w... | 0 | 98,135,250 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
string reply;
cin >> a >> b;
if (((a %= 2) == 0) || ((b %= 2) == 0)) {
reply = "Even";
} else {
reply = "Odd";
}
cout << reply << endl;
} | #include<bits/stdc++.h>
#include<climits>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define umapii unordered_map<int,int>
#define pqmaxi priority_queue<int>
#define pqmini ... | 0 | 82,719,038 |
#include<cstdio>
#include<iostream>
using namespace std;
int main(){
int a,b;
int cnt=0;
int m[16]={0};
while(scanf("%d%d",&a,&b),a,b){
int ro[32][32]={{0}};
ro[0][1]=1;
int n;
scanf("%d",&n);
int x,y;
for(int i=0;i<n;i++){
scanf("%d%d",&x,&y);... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n;
string s;
cin >> n >> s;
set<int> rs, gs, bs;
rep(i, n) {
switch (s[i]) {
case 'R':
rs.insert(i);
break;
case 'G':
gs.in... | 0 | 29,574,057 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const static ll Max = 100000+5;
const static ll INF = 1e18+5;
vector<set<ll>> G(Max);
ll N, Q, K;
map<pair<ll, ll>, ll> C;
ll DP[Max];
void Dijkstra(ll s){
for(int i = 0; i < Max; i++) DP[i] = INF;
DP[s] = 0;
for(auto v : G[s]) DP[v] = C[ma... | #include <bits/stdc++.h>
#define int long long
#define INF 1e+9
using namespace std;
signed main(){
int n,a[100000],ma = 0,b = INF;
cin >> n;
for(int i = 0;i < n;i++){
cin >> a[i];
ma = max(ma,a[i]);
}
bool flag = false;
for(int i = 0;i < n;i++){
if(!flag && a[i] == ma) flag = true;
else if(min(abs(b - ma... | 0 | 25,884,759 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
const long long INF = numeric_limits<long long>::max();
typedef long long ll;
int main(){
... | #include <stdio.h>
#include <iostream>
#include <string>
using namespace std;
#define NUM 100
#define INF 1000000000
int X_dim[NUM];
int Y_dim[NUM];
int M[NUM][NUM];
void init(){
for(int i = 0; i < NUM; i++){
for(int j = 0; j < NUM; j++){
if(i == j){
M[i][j] = 0;
}els... | 0 | 62,803,709 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FAST ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define mp make_pair
#define pb push_back
#define lp(i,s,f) for(ll i = s; i < ll(f); i++)
#define inF freopen("input.in", "r", stdin);
#define outF freopen("output.in", "w", stdout)... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main()
{
int X, Y, N;
cin >> X >> Y >> N;
vector<vector<bool>> v(X, vector<bool>(Y, false));
for (int i = 0; i < N; i++)
{
int x, y, a;
cin >> x >> y >> a;
switch (a)
{
case 1:
... | 0 | 45,287,340 |
#include<bits/stdc++.h>
using namespace std;
int get(vector<int> &a, int x) {
int res = 0;
for(int i : a) {
res += (x - i) * (x - i);
}
return res;
}
int main() {
int n;
cin >> n;
int s = 0;
int x;
vector<int> a;
for(int i = 0; i < n; ++i) {
cin >> x;
s +=... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, init, n) for(int i = (int)(init); i < (int)(n); i++)
#define vi vector<int>
#define vl vector<long>
#define vvi vector<vector<int>>
#define vvl vector<vector<long>>
#define pint pair<int, int>
#define plong pair<long, long>
long MOD = 1000000007;
int main() {... | 0 | 56,695,232 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pi pair<ll,ll>
#define pd pair<ld,ld>
#define pb push_back
#define inf 1e18
#define mod 1000000007
#define en '\n'
#define ld long double
#define ff first
#define ss second
#define ull unsigned long long
#define lb lower_bound
#define ub up... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define MOD 1000000007
#define MOD2 998244353
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long Int;
typedef pair<Int, Int> P;
int main() {
int n, k;
cin >> n >> k;
Int sm[n+2];
... | 0 | 58,013,840 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
string s, t;
cin >> s;
char pre = s[0];
t.push_back(pre);
for (int i = 1; i < s.size(); i++) {
if (pre != s[i]) {
pre = s[i];
t.push_back(pre... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
typedef vector<vector<vector<bool>>> vvvb;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
... | 0 | 66,197,817 |
#include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
const int MAXN=1e5+5;
int n,L,T;
int a[MAXN],w[MAXN];
int ans[MAXN];
int main(){
scanf("%d%d%d",&n,&L,&T);
for(int i=1;i<=n;i++){
scanf("%d%d",&a[i],&w[i]);
if(w[i]==2) w[i]=-1;
}
ll cnt=0;
for(int i=1;i<... | #include <iostream>
#include <cstring>
#include <vector>
#include <list>
#include <queue>
#define MAXV 10005
#define MAXE 100005
using namespace std;
int N,E;
bool V[MAXV];
vector<int> G[MAXV],out;
int indeg[MAXV];
void bfs(int u){
queue<int> q;
q.push(u);
V[u]=true;
int i;
while(!q.empty()){
... | 0 | 36,422,042 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <unordered_map>
#include <vector>
const int mod = 1e9 + 7;
const int kmax = 510000;
const int last_days[] = { 31, 28, 31, 30, 31, 30, 31, 31, 30, 31,... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define FF(i,a,b) for(int i=a;i<b;i++)
#define BF(i,a,b) for(int i=a;i>=b;i--)
#define vi vector<int>
#define MAP map<int,int>
#define pb push_back
#define MP ... | 0 | 256,300 |
#include <cstdio>
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#define rep(i,n) for (int i=0;i<n;i++)
using ll = long long;
using namespace std;
void solve(){
}
int main (){
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main()
{
int n, m, X, Y;
cin >> n >> m >> X >> Y;
vector<int> x(n), y(m);
rep (i, n)
cin >> x[i];
rep (i, m)
cin >> y[i];
sort(x.rbegin(), x.rend());
sort(y.begin(), y.end());
... | 0 | 1,661,410 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const static ll INF = 1e15;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const ll MOD = 1e9+7;
int main(){
ll N; cin >> N;
string S; cin >> S;
map<char, ll> M;
for(auto ch : S) M[ch]++;
ll ans = 0;
for(int i = 0; i < 10;... | #include <bits/stdc++.h>
#include <vector>
#include <iostream>
#include<algorithm>
#include<string>
#include <map>
#include <queue>
#include <stack>
#include<set>
#include<tuple>
#define DIV 1000000007
#define TE 2e5
using namespace std;
using ll = long long;
using ldb = long double;
int main() {
int N, M; cin >> N >>... | 0 | 65,704,569 |
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define pb push_back
#define vl vector
#define ff first
#define ss second
using namespace std;
int main()
{
ll a,b,i,j,n,t;
string s;
cin>>n;
ll arr[n];
for(i=0;i<n;i++) cin>>arr[i];
sort(arr,arr+n);
b=n/2;
a=b-1;
l... | #include <iostream>
#include <cstdint>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unorder... | 0 | 92,017,526 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i = (m); i <= (n); i++)
#define zep(i,m,n) for(ll i = (m); i < (n); i++)
#define rrep(i,m,n) for(ll i = (m); i >= (n); i--)
#define print(x) cout << (x) << end... | #include<iostream>
#include<string>
#include<cmath>
#include<queue>
#include<vector>
#include<functional>
#include<algorithm>
#include<cstdio>
using namespace std;
int main() {
string a;
string d[10] = { "",".,!? ","abc","def","ghi","jkl","mno",
"pqrs","tuv","wxyz" };
int m;
cin >> m;
for (int z = 0; z < m; z++)... | 0 | 76,236,007 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define PI acos(-1)
#define Rep(i, n) for (int i = 0; i < (int)(n); i++)
#define BitRep(i, n) for (int i = 0; i < (int)(1 << n); i++)
#define All(vec) vec.begin(), vec.end()
#define Sum(vec) accumulate(vec.begin(), vec.end(), ... | #include<bits/stdc++.h>
#ifdef LOCAL
#include "lib/debug.hpp"
#else
#define debug(...) 1
#endif
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define rep(i, n) REP(i, 0, (n))
#define repc(i, n) REPC(i, 0, (n))
#define REP(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define REPC(i... | 0 | 26,528,994 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N,S;
cin >> N;
rep(i,N) {
int l_i,r_i;
cin >> l_i >> r_i;
S += r_i - l_i + 1;
}
cout << S << endl;
} | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define INF 1e18
#define EPS 1e-9
#define MOD 1000000007
#define F first
#define S second
#define all(x) begin(x), end(x)
using ll = long long;
using ull = unsigned lo... | 0 | 3,414,068 |
#include <iostream>
#include <vector>
using namespace std;
const long long int MOD = 1000000007;
int main(){
long long int n, k;
cin >> n >> k;
vector<int> a(n+1);
for(int i = 0; i < n; i++) cin >> a[i];
long long int ans_in = 0;
long long int ans_out = 0;
for(int i = 0; i < n; i++){
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
const double eps = 1e-10;
const int MOD = 1000000007;
const int INF = 1000000000;
const ... | 0 | 89,654,443 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
int main(){
int N,T;
cin >> N >> T;
vector<int> t(N);
for(int i = 0; i < N; i++){
cin >> t[i];
}
ll ans = 0;
for(int i = 1; i < N; i++){
int gap = t[i] - t[i-1];
if(gap >= T){
ans += T;
}e... | # include <bits/stdc++.h>
# define speed ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
# pragma GCC target("avx2")
# pragma GCC optimize("O3")
# pragma GCC optimize("unroll-loops")
# define int long long
using namespace std;
const int N = 1e3 + 7;
const int mod = 1e9 + 7;
int dp[N][N];
string a[N];
int32_t ma... | 0 | 88,332,286 |
#include <iostream>
int main() {
long long int r, d, x;
std::cin >> r >> d >> x;
for (int i = 0; i < 10; ++i) {
std::cout << r * x - d << "\n";
x = r * x - d;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(ll i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vect... | 0 | 36,836,998 |
#include <stdio.h>
int main()
{
long long n;
int i;
char s[111];
scanf("%s%lld", s, &n);
for(i = 0; s[i] && s[i] == 49; i++);
if(n > i) printf("%c\n", s[i]);
else puts("1");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
int main() {
int N,M;
while(scanf("%d %d",&N,&M),N) {
priority_queue<P> Q;
for(int i=0;i<N;i++) {
int d,p;
scanf("%d %d",&d,&p);
Q.push(P(p,d));
}
int sum=0;
while(!... | 0 | 90,326,846 |
#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 n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < k; i++) {
vector<int> b(n + 1);
for (int j =... | #include <iostream>
#include <string>
#include <vector>
#include <set>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <queue>
#include <map>
#include <numeric>
#include <unordered_map>
#include <iomanip>
#include <functional>
#include <bitset>
#include <complex>
#include <stack>
#include <cstdint>
#de... | 0 | 23,647,704 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s,t;
int a,b;
while(cin>>a>>b)
{
int c,d,e,f,g;
c=a-1;
d=(c*(c+1))/2.;
e=b-1;
f=(e*(e+1))/2.;
cout<<d+f<<endl;
}
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main(int argc, char *argv[])
{
string map[10] = {"", ".,!? ", "abc", "def", "ghi", "jkl", "mno",
"pqrs", "tuv", "wxyz"};
string line;
int n, cnt, num;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> line;
cnt = 0;
... | 0 | 75,258,638 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
const long long MOD = 1000000007;
#define SET(x) memset(x, 0, sizeof(x))
#define SET2d(x,m,n) memset(x, 0, sizeof(x[0][0]) * m * n)
#define SETBOOL(x) memset(x,false,siz... | #include<bits/stdc++.h>
using namespace std;
#define Boost() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
typedef long long ll;
typedef long long int lli;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int,int> pii;
typedef pair<double, double> pdd;
t... | 0 | 18,886,223 |
#include <iostream>
#include <vector>
using namespace std;
int main(){
while(true){
int m, nmin, nmax;
cin >> m >> nmin >> nmax;
if(m == 0)
break;
vector<int> p(m);
for(int i=0; i<m; i++)
cin >> p[i];
int amax = 0, ans;
for(int i=nmin; i<=nmax; i++){
if(p[i-1] - p[i] >= a... | #pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
constexpr int MOD=1000000007;
#define INF (1<<30)
#define LINF (lint)(... | 0 | 52,787,569 |
#include<iostream>
#include<string>
#include<vector>
using namespace std;
int main(){
int n;
while(1){
cin >> n;
if (n==0) return 0;
string tmp;
int cnt=0,state=0;
int ud = 0;
for(int i=0; i<n; i++) {
cin >> tmp;
if (tmp == "lu") {
... | #include <stdio.h>
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string... | 0 | 50,396,711 |
#include<bits/stdc++.h>
using namespace std;
const int INF = 1000000000;
int arr[205][205];
int main(){
int n,m,r;
cin>>n>>m>>r;
for(int i=1; i<=n; i++){
for(int j=1; j<=n; j++) arr[i][j] = INF;
}
vector<int>town(r);
for(int i=0; i<r; i++) cin>>town[i];
sort(town.begin(),town.end());
while(m--){
int a,b,c;
... | #include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
int bingo[3][3];
bool mark[3][3];
int main(){
for(int i=0; i<3; ++i){
for(int j=0; j<3; ++j){
int a;
cin >> a;
bingo[i][j] = a;
}
}
int N; cin >> N;
for(i... | 0 | 96,859,292 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n , k , ga;
cin>>n>>k;
if(k==0)
{
cout<<"0 0";
} else {
int ca[n+1] = { 0 };
int wa[n+1] = { 0 };
int x;
string s,c="AC";
while(k-... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
#define all(x) x.begin(), x.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> pair;
const int inf = 1000000000;
const ll inff = 1000000000000000000;
int main(){
string s;
ll n;
cin >>... | 0 | 92,137,485 |
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef vector<ll> vint;
typedef vector< vector<ll> > vvint;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repf(i,f,n) for(ll i=f;i<n;i++)
#define repr(i,n) for(ll i=n-1;i>=0;i--)
#define mp make_pair
#def... | #include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<cmath>
#include<cstring>
#include<set>
#include<climits>
#include<deque>
#include<iomanip>
#include<utility>
usi... | 0 | 64,786,225 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
using P = pair<int,int>;
using pq = priority_queue<int>;
typedef long long ll;
int main()
{
int n, k; cin >> n >> k;
int ans = 1;
rep(i, n)
{
if (ans * 2 - ans... | #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 +... | 0 | 7,307,563 |
#include <iostream>
#include <vector>
#include <algorithm>
using ll = long long;
using namespace std;
int n;
int c[15000];
int A[2000001];
void countingsort(int A[], int k){
for (int i = 0; i < k; ++i) {
c[i] = 0;
}
for (int j = 0; j < n; ++j) {
c[A[j]]++;
}
}
int main() {
cin >> n;
... | #include <bits/stdc++.h>
#define WHOLE(v) (v).begin(), (v).end()
#define REV_WHOLE(v) (v).rbegin(), (v).rend()
using i64 = int64_t;
using namespace std;
template<class F>auto recursive(F f){return[f](auto...a){return f(f,a...);};}
template<class T>using rev_priority_queue=priority_queue<T,vector<T>,greater<T>>;
templat... | 0 | 66,785,907 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> A(N);
for(int i = 0; i < N; i++){
cin >> A[i];
}
int sum = 0;
sum += abs(A[0]);
for(int i = 0; i < N - 1; i++){
sum += abs(A[i] - A[i + 1]);
}
sum += abs(A[N - 1]);
int sum1 = sum;
sum1 -= abs(A[0]);
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define m_p make_pair
#define p_b push_back
#define e_b emplace_back
#define all(x) (x).begin(),(x).end()
#define uniq(x) ((x).erase(unique(all(x)),(x).end()))
#define sz(x) ((int)(x).size())
#... | 0 | 48,708,007 |
#include<bits/stdc++.h>
#define all(v) v.begin(),v.end()
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
long long n,m,h[100005],a,b,ans=0;
bool c[100005]={};
cin>>n>>m;
for(int i=0;i<n;i++){
cin>>h[i];
}
for(int i=0;i<m;i++){
cin>>a>>b;
... | #define LOCAL
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<(n); ++i)
#define rep2(i, s, n) for(int i=s; i<(n); ++i)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
static const int INTINF = (INT_MAX >> 1);
static const ll LLINF = (LLONG_MAX >> 1);
static const int MAX = 1e... | 0 | 44,043,065 |
#include <bits/stdc++.h>
#include <algorithm>
#include <queue>
using namespace std;
int main(){
int N;
cin >> N;
int X[N];
int min = 101;
int max = 0;
for(int i=0; i<N; i++){
cin >> X[i];
if (min > X[i]){min=X[i];}
if (max < X[i]){max=X[i];}
}
int nums = int(max-m... | #include <stdio.h>
int main(){
int W,H,j=0;
int n = 0;
int d[10000][2];
while(j == 0){
scanf("%d %d",&H,&W);
if(W == 0 && H == 0){
j = 1;
}else{
d[n][0] = H;
d[n][1] = W;
n++;
}
}
for(int i = 0;i < n;i++){
for(int q = 0;q < d[i][0];q++){
for(j = 0;j < ... | 0 | 100,540,649 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
template <typename T>
void print_vec(const vector<T>& v, bool is_reverse=false, int num=0){
if(num == 0) num = (int)v.size();
if(is_reverse) for(int i=num-1; i>=0; i--){ cout<<v[i]; if(i!=0) cout<<" ";}
else for(int i=0; i<num; i++){ cout<<v[i]; ... | #include <bits/stdc++.h>
#define INF 1e18
#define int long long
#define Rep(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) Rep(i, 0, n)
#define all(a) (a).begin(), (a).end()
using namespace std;
typedef pair<int, int> P;
typedef pair<int, P> PP;
const int mod = 1000000007;
signed main()
{
ios::sync_with... | 0 | 79,453,444 |
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
int main() {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
if (a >= 0 && c <= 100) {
if (a<b && b<c) {
printf("Yes\n");
}
else {
printf("No\n");
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
int n;
vector<int> pcnt(110, 0);
int main() {
cin >> n;
pcnt.at(1)... | 0 | 98,075,584 |
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int a[5];
for(int i=1;i<6;i++){
cin>>a[i];
}
sort(a+1,a+6);
for(int i=5;i>0;i--){
if(i==1)cout<<a[i];
else cout<<a[i]<<' ';
}
cout<<endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
int main(){
int n;
cin>>n;
vector<int> a(n);
rep(i,n) cin>>a[i];
sort(all(a));
int sum=0;
rep(i... | 0 | 81,424,935 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long i, x = 0, ans = 0;
string s;
cin >> s;
for(i = 0; i < s.size(); i++)
{
if(s[i] == 'B')
x++;
else
ans += x;
}
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
template<class T> inline T sqr(T x) {return x*x;}
typedef long long LL;
typedef pair<int, int> PII;
typede... | 0 | 22,507,339 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
using namespace std;
int main() {
string k = "keyence";
string s; cin >> s;
string ans = "YES";
int p = 0;
bool d = false;
bool d2 = false;
int count = 0;
int n = s.length();
int left;
... | #include <bits/stdc++.h>
#include <chrono>
using namespace std;
using namespace std::chrono;
#define f0r(a, b) for (long long a = 0; a < (b); a++)
#define f1r(a, b, c) for (long long a = (b); a < (c); a++)
#define f0rd(a, b) for (long long a = (b); a >= 0; a--)
#define f1rd(a, b, c) for (long long a = (b); a >= (c); ... | 0 | 47,814,450 |
#include<stdio.h>
#include<algorithm>
#include<string>
#include<iostream>
#include<vector>
#include<queue>
#include<map>
using namespace std;
#define REP(i,n) for(long long int (i)=0;(i) < (n);(i)++)
int n,m;
char from,to,tmp;
int main(){
cin >> n;
while(n){
map<char,char>dict;
REP(i,n){
cin >> ... | #include <algorithm>
#include <iostream>
#include <list>
#include <math.h>
#include <stack>
#include <stdio.h>
#include <string>
#include <queue>
#include <vector>
using namespace std;
int main()
{
list<int> l;
int n, x;
cin >> n;
string cmd;
for (int i = 0; i < n; i++) {
cin >> cmd;
if (cmd == "insert") {
... | 0 | 31,036,014 |
#include<iostream>
using namespace std;
int main(){
int n;
int m;
cin>>n;
cin>>m;
cout<<(n*(n-1)/2+m*(m-1)/2)<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;
template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (ll i=(ll)from; i<(ll)to; i++)
#define all(vec) vec.begin(), vec.end(... | 0 | 91,539,951 |
#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
ull modpow(ll n,ll r){
ll res = 1;
while(r){
if(r & 1)res = res*n%MOD;
n = n*n ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<pair<pair<int,int>, int>> city(M);
vector<pair<int, int>> ans(M);
for (int i = 0; i < M; i++) {
int P, Y;
cin >> P >> Y;
pair<int, int> p = make_pair(P,Y);
city[i] = make_pair(p, i);
pair<int, int> q... | 0 | 22,997,443 |
#include <bits/stdc++.h>
#define pb push_back
#define tam 5010
#define se second
#define fi first
#define pitem item*
#define forr(i,p,n) for(ll i=p;i<n;i++)
using namespace std;
typedef long long ll;
const ll MOD=1000000007 ;
ll mult(ll a,ll b, ll p=MOD){return ((a%p)*(b%p))%p;}
ll add(ll a, ll b, ll p=MOD){return (a%... | #include <iostream>
#include <bitset>
#include <algorithm>
typedef long long ll;
const ll MAXN = 1e6+5;
std::bitset<MAXN> is;
int pr[MAXN], primes = 0;
void sieve() {
is[2] = true; pr[primes++] = 2;
for (int i = 3; i < MAXN; i += 2) is[i] = 1;
for (ll i = 3; i*i < MAXN; i += 2)
if (is[i])
for (ll j = i*... | 0 | 9,666,230 |
#include<bits/stdc++.h>
using namespace std;
const long long MOD=1000000007;
long long a[100100],b[100100];
main()
{
long long n,m;
long long suma=0;
long long sumb=0;
long long ans=0;
scanf("%lld %lld",&n,&m);
for(long long i=0;i<n;i++)
scanf("%lld",&a[i]);
for(long long i=0;i<m;i++... | #include <iostream>
#include <vector>
#include <string>
#include <utility>
#include <set>
#include <map>
using namespace std;
typedef long long lint;
const int MAXN = 100100;
vector<pair<int, int> > G[MAXN];
lint depth[MAXN];
bool visited[MAXN];
bool dfs(int v, lint d) {
depth[v] = d;
visited[v] = true;
for... | 0 | 68,630,215 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<queue>
#include<cmath>
#include<cstdio>
#include<tuple>
#include<bitset>
#include<map>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
#define ALL(x) x.begin(),x.end... | #include <iostream>
using namespace std;
const int maxn = 1e5 + 5;
int A, B, M, a[maxn], b[maxn], x[maxn], y[maxn], c[maxn];
int main() {
cin >> A >> B >> M;
for (int i=0; i<A; i++) {
cin >> a[i];
}
for (int i=0; i<B; i++) {
cin >> b[i];
}
for (int i=0; i<M; i++) {
cin >>... | 0 | 18,202,603 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,x,y;
cin>>a>>b>>x>>y;
int aa=max(a,x);
int bb=min(b,y);
if(bb<aa)cout<<0<<endl;
else cout<<bb-aa<<endl;
} | #include<iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#includ... | 0 | 25,514,378 |
#include <iostream>
using namespace std;
int main()
{
string str;
while (cin >> str, str != "#") {
int hand = -1, res = -1;
for (int i = 0; i < str.length(); i++) {
if (str[i] == 'y' || str[i] == 'u' || str[i] == 'i' || str[i] == 'o' || str[i] == 'p'
|| str[i] == 'h' || str[i] == 'j' || str[i] == 'k' || st... | #include <bits/stdc++.h>
int main() {
int N;
std::string str1, str2;
int point1, point2;
point1 = point2 = 0;
std::cin >> N;
for(int i = 0; i < N; ++i) {
std::cin >> str1 >> str2;
if( str1 > str2 ) {
point1 += 3;
}
else if( str1 < str2 ) {
point2 += 3;
}
else {
poin... | 0 | 86,514,124 |
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main(){
while (1){
int n;
cin >> n;
if (n == 0) break;
vector<int> num;
for (int i = 0; i < n; i++){
int tmp;
cin >> tmp;
num.push_back(tmp);
}
int max = -1;
int min = 99999;
int sum = 0;
for (int i = 0; i < n... | #pragma GCC diagnostic ignored "-Wunused-variable"
#include <bits/stdc++.h>
using namespace std;
#define BOOST
#ifdef BOOST
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/range/adaptor/reversed.hpp>
using namespace boost;
using ml = boost::multiprecision::... | 0 | 58,312,168 |
#include <iostream>
int main() {
int N, X, T;
int ans;
std::cin >> N >> X >> T;
ans = N / X;
if(N % X != 0) {
ans++;
}
std::cout << ans * T << std::endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int k, s;
int x, y, z;
int formas = 0;
cin >> k >> s;
for (int x = 0; x <= k; x++) {
for (int y = 0; y <= k; y++) {
z = s - x - y;
if (z >= 0 && z <= k) formas++;
}
}
cout << formas;
} | 0 | 77,712,507 |
#include <iostream>
#include <vector>
#include <cassert>
#include <algorithm>
#include <functional>
#include <cassert>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <limits>
#include <bits/stdc++.h>
#include<queue>
#include<type_traits>
#include<cstdint>
using namespace std;
us... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
int n;
cin >> n;
vector<double> vec(n + 1);
cout << fixed << setprecision(6);
for (int i = 1; i <= n; i++)
{
cin >> vec[i];
}
double ans = 0;
for (int i = 1; i < n; i++)
{
sort(vec.begi... | 0 | 24,805,562 |
#include <bits/stdc++.h>
using namespace std;
using Point = pair<int,int>;
int main()
{
int N,K;
cin >> N >> K;
vector<long long> h(N);
for(int i=0;i<N;i++)
{
cin >> h[i];
}
long long ans = LONG_LONG_MAX;
for(int bit = 0;bit < (1<<N);bit++)
{
vector<int> used;
... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using ll = long long;
using namespace std;
int main() {
ll n;
cin >> n;
ll a[n + 1];
ll b[n];
for(ll i = ... | 0 | 87,052,698 |
#include <bits/stdc++.h>
using namespace std;
int n,a,b,cost;
vector<int>ans;
int main(){
scanf("%d%d%d",&n,&a,&b);
if(a*1LL*b < n || a + b - 1 > n)return puts("-1"),0;
for(int i = n - a + 1;i <= n;i++)ans.push_back(i);
n-=a;
for(int i = b - 1;i >= 1;i--){
int t = min(n - i + 1,a);
for(int j = n - t + 1;j <= 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()
{
int n;
cin>>n;
string s,t;
cin>>s>>t;
string s_t;
for(int i=0;i<n;i++)
{
s_t.push_back(s[i]);
s_t.push_back(t[i]);
}... | 0 | 50,468,441 |
#include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if((a==1 && b==2) || (a==2 && b==1)) cout << "3" << endl;
else if((a==1 && b==3) || (a==3 && b==1)) cout << "2" << endl;
else if((a==2 && b==3) || (a==3 && b==2)) cout << "1" << endl;
return 0;
} | #include <iostream>
#include <set>
#include <iterator>
#include <utility>
using namespace std;
int q[100001];
int main(){
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n, p;
cin >> n;
for (int i = 1; i <= n; i++){
cin >> p;
q[p] = i;
}
set <int> myset;
myset.insert(-1... | 0 | 93,849,796 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
sort(s.begin(), s.end());
sort(t.begin(), t.end());
vector<int> a(26, 0);
vector<int> b(26, 0);
for (int i = 0; i < s.size(); i++) {
int c = s.at(i) - 'a';
a.at(c)++;
}
for (int i = 0; i < t.size(); i++) {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)n; ++i)
#define FOR(i, a, b) for(int i = a; i < (int)b; ++i)
typedef long long ll;
const int Inf = 1e9;
const double EPS = 1e-9;
const int MAX = 100001;
void bfs(int);
int gcd(int a, int b) {
if (b == 0) {
return a;
... | 0 | 31,146,623 |
#include <bits/stdc++.h>
using namespace std;
int main(){
vector<vector<int>> a(3, vector<int> (3, 0));
for(int i = 0; i<3; i++) {
for(int j = 0; j<3; j++) {
cin >> a[i][j];
}
}
int n;
cin >> n;
vector<int> b(n);
for(int i = 0; i<n; i++) cin >> b[i];
bool ans ... | #include <stdio.h>
#include <assert.h>
#include <fstream>
#include <iostream>
#include <algorithm>
#include <array>
#include <vector>
#include <queue>
#include <set>
#include <cmath>
const int MAX_N = 100050;
std::string S;
int N;
int tmp[MAX_N];
void proc() {
for (int i = 2; i < S.size(); i++) {
if (tmp[i-... | 0 | 2,410,354 |
#include<bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
typedef long long ll;
typedef pair<int,int> pi;
typedef vector<int> vi;
const int mod=1e9+7;
int main(){
int n;
cin>>n;
cout<<180+(n-3)*180<<endl;
} | #include <algorithm>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vll = vector<ll>;
void solve();
int m... | 0 | 22,626,987 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using P = pair<string,int>;
const double PI = acos(-1);
int main() {
int n;
cin >> n;
vector<int> even;
vector<int> odd;
rep(i,n){
int a;
cin >> a;
if(i%2 == 0) odd.push_back(a)... | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = p... | 0 | 33,299,240 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int k,n;
cin>>k>>n;
int a[n];
for(int i=0;i<n;i++)
{
cin>>a[i];
}
int total =0;
for(int i=1;i<n;i++)
{
total += a[i] - a[i-1];
}
total += a[0] + k-a[n-1];
int m = INT_MIN;
for(int i=1;i<n;i++)
... | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <random>
#include <ctime>
using namespace std;
int main(){
int n,k ;
string s ;
cin >> n >> s >> k ;
char key = s.at(k-1) ;
for (int i = 0; i < s.size(); i++)
{
if (s.at(i) != key)
... | 0 | 25,492,124 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
typedef unsigned long long ull;
#define loop(i,a,b) for(ll i=a;i<b;i++)
#define f(i,a,b) for(ll i=a;i<=b;i++)
#define testcases ll t;cin>>t;while(t--)
#define dec(x) greater<x>()
#define mx 200005
#define mod 1000000007
#define PI ... | #include <iostream>
#include <cstdio>
#include <vector>
#include <list>
#include <algorithm>
#include <cmath>
#include <stack>
#include <set>
using namespace std;
#define REP(i,n) for(int (i)=0; (i)<(n); (i)++)
#define FOR(i,a,b) for(int (i)=(a); (i)<(b); (i)++)
#define PUSH(n,v) for(int i=0; i<(n); i++) {int j; cin >>... | 0 | 35,783,618 |
#include <iostream>
#include <string>
#include <queue>
#include <map>
#include <unordered_map>
#include <vector>
#include <algorithm>
#include <math.h>
#include <set>
#define INTINF 2147483647
#define LLINF 9223372036854775807
#define MOD 1000000007
#define rep(i,n) for (int i=0;i<(n);++i)
using namespace std;
using ll... | #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++)
int main(){
ll n, m;
cin >> n >> m;
vector<vector<ll>> r(100010);
vector<ll> p(m), y(m);
rep(i, 0, m){
cin >> p[i] >> y[i];
r[p[i]].push_back(y[i]);
}
m... | 0 | 1,309,844 |
#define _CRT_SECURE_NO_WARNINGS
#define _SCL_SECURE_NO_WARNINGS
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <iostream>
#include <string>
#include <vector>
#include <list>
#include <utility>
#include <algorithm>
#include <functional>
#include <cmath>
#include <stack>
#include <que... | #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--)
typedef long long ll;
static const ll MX = 100005;
static const ll MX_ll = 1e18;
const double PI = acos(-1);
using namespace std;
#define SIZE_OF_ARRAY(array) (sizeof(array)/sizeof(array[0]))
int c... | 0 | 1,267,306 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,A,B,C,F=1,Q=167167167;
cin>>N>>A>>B>>C;
vector<int> l(N);
for(int i=0;i<N;i++){
cin>>l[i];
F*=4;
}
for(int i=1;i<F;i++){
int D=i,X=0,Y=0,Z=0,K=0;
for(int j=0;j<N;j++){
if(D%4==1){
X+=l[j];
}
else if(D%4... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin()... | 0 | 24,974,843 |
#include<iostream>
using namespace std;
int main(){
while(1){
int h,w;
cin >> h >> w;
if(h == 0 && w == 0){
break;
}
for(int n = 0; n < h; n++){
for(int m = 0; m < w; m++){
cout << "#";
}
cout << endl;
}
cout << endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define fast() ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long int
#define test() ll t; cin>>t; while(t--)
#define lp0(i,begin,end) for(ll i=begin;i<end;i++)
#define lp1(i,begin,end) ... | 0 | 86,512,716 |
#include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define INF 1000000000
#define mod 1000000007
using ll=long long;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0};
int dy[... | #include<bits/stdc++.h>
#define ll long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
static const ll MAX = 1000000000000000;
static const int NIL = -1;
using namespace std;
const long double EPS = 0.0000000001;
const long double PI = (acos(-1));
const int MOD = 1000000007;
#pragma GCC target("avx2")
#p... | 0 | 95,797,264 |
#include <bits/stdc++.h>
using namespace std;
void solve(long long N, std::string S, std::string T){
for(int i = 0; i < N; ++i){
cout << S[i] << T[i];
}
cout << endl;
return;
}
int main(){
long long N;
scanf("%lld",&N);
std::string S;
std::cin >> S;
std::string T;
std::ci... | #include<cstdio>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
int cou[200004];
vector<int> edge[200004];
int ans[200004];
void func(int pos,int nowcou,int bef){
int nowans=nowcou+cou[pos];
ans[pos]=nowans;
for(int i=0;i<edge[pos].size();i++){
if(edge[po... | 0 | 30,548,619 |
#include <iostream>
using namespace std;
int main(){
int n,m;
cin >> n >> m;
int ev = n*(n-1) / 2;
int od = m*(m-1) / 2;
int ans = ev + od;
cout << ans << endl;
} | #include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | 0 | 1,503,197 |
#include<iostream>
#include<vector>
#include<string>
#include<map>
#include<set>
#include<algorithm>
#define MOD (1000000007)
using namespace std;
typedef long long int Int;
int main(void) {
int n;
vector<int> a;
cin>>n;
for(int i = 0;i < n;i++) {
int temp;
cin>>temp;
a.push_back... | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | 0 | 40,728,320 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<int, int>;
int main()
{
int a, b, c;
cin >> a >> b >> c;
if(a == b && a == c) cout << "Yes" << endl;
else cout << "No" << endl;
return ... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n;
cin >> n;
vector<string> a, b, ab, c;
int count = 0;
rep(i,n) {
string s;
cin >> s;
int pos = s.find("AB");
... | 0 | 33,151,224 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 1e9+7;
int mod = 1e9+7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0 , -1};
signed main() {
int N;
cin >> N;
vector<int>A(N);
set<int>Set;
for(int i = 0; i < N; i++) {
cin >> A[i];
... | #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... | 0 | 100,461,311 |
#include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = (ll)(a); i < (ll)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ll long long
#define lld long double
#define ALL(x) x.begin(), x.end()
using n... | #include<bits/stdc++.h>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long int
#define mod 1000000007
#define inf 1e18+42
#define endl "\n"
#define pi 3.1415926535897932384626433832795028841971693993751058
#defi... | 0 | 83,960,525 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<ll(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=ll(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=ll(b);i--)
#define ALL(x) x.begin(),x.end()
#define SIZE(x) ll(x.size())
#define INF 10000... | #include <bits/stdc++.h>
#define REP(i, x) REPI(i, 0, x)
#define REPI(i, a, b) for (int i = int(a); i < int(b); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N, C, K;
cin >> N >> C >> K;
vector<ll> T(N);
REP(i, ... | 0 | 64,479,134 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
long long MOD = 1000000000 + 7;
int main(){
cout << setprecision(10);
int N;
cin >> N;
map<int,int> odd,even;
odd[0] = 0;
even[0] = 0;
for(int i = 0; i < N; i++){
int tmp;
cin >> tmp;
if(i %2 == 0){
... | #include <iostream>
#include <stack>
#include <math.h>
#include <vector>
#include <string>
#include <algorithm>
#include <map>
#define rep(i,n) for(int i=0; i < n; i++)
using ll = long long;
using namespace std;
int main()
{
int people, day, choco;
cin >> people >> day >> choco;
vector<int> a(people);
... | 0 | 44,354,672 |
#include<bits/stdc++.h>
#include<cmath>
using namespace std;
int main(){
int a,b,c,d;
cin >> a >> b >> c >> d ;
bool q = true;
if(abs(a-c) >d){
if(abs(a-b)>d|| abs(b-c) >d){
q = false;
}
}
if(q ==true)cout << "Yes" << endl;
else cout << "No" << endl;
} | #include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL (-1)
#define LL long long
using namespace std;
const int64_t MOD = 1e9 + 7;
int main() {
int A, B, C;
cin >> A >> B >> C;
int M = max(max(A, B), C);
int sum = A + B + C;
if ((M * 3 - sum) % 2) M++;
cout << (M * 3 - sum) / 2 << endl;
} | 0 | 93,032,509 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPS(I, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> v(n);
vector<int> v1(n);
vector<bool> ok(n,true);
int mx = 0;
REP(i,n){... | #include <iostream>
#include <vector>
#include <algorithm>
#include <unordered_map>
#include <string>
#include <deque>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <cstring>
#include <iomanip>
#include <tuple>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#defi... | 0 | 91,177,895 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for... | #include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <functional>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
#include <b... | 0 | 15,274,960 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define ALL(vec) vec.begin(), vec.end()
#define rALL(vec) vec.rbegin(), vec.rend()
using namespace std;
using ll = long long;
int main() {
string S;
cin >> S;
int cnt = 0;
rep(i, S.siz... | #include <iostream>
#include <string>
#include <cmath>
using namespace std;
int main(){
long long int i, x, N , K, score, score_max, cycle, K_rem, ans;
cin >> N >> K;
score = 0;
score_max = 0;
cycle = 0;
long long int P[N], C[N], Sc[N], Sm[N], Cy[N], Max[N];
for (i = 0; i < N; i++){
... | 0 | 37,157,851 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;cin>>S;
cout<<(S.size()>=4? (S.substr(0,4)=="YAKI"?"Yes":"No"):"No")<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define endl "\n"
#define pb push_back
#define PI 3.1415926535897932384626433832795l
#define F first
#... | 0 | 94,543,187 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
double a = 0;
double b = 1;
vector<int>v(n);
for (int i = 0; i < n; ++i) {
int x;
cin >> x;
v[i] = x;
b *= x;
}
for (int i = 0; i < n; ++i) {
a += (b/v[i]);
}
double ans = b/a;
cout << fixed << setprec... | #include <bits/stdc++.h>
#include <numeric>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define per(i,n) for (int i = n - 1; i >= 0; --i)
#define rep1(i,n) for (int i = 1; i <= n; ++i)
template<typename T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T> inline bool chmax... | 0 | 58,811,991 |
#include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define MAXX 10005
#define PI 3.14159265358979323846264338327950
#define ll signed long long int
using namespace std;
ll t , n, c[MAXX];
vector<ll> adj[MAXX];
bool used[MAXX];
signed main()
{
FAST;
ll a, b, r;
cin >> r >> a ... | #include <iostream>
#include <string>
using namespace std;
int main()
{
string arg, arg2;
cin >> arg;
cin >> arg2;
arg += arg;
if (arg.find(arg2) == string::npos)
{
cout << "No\n";
return 0;
}
cout << "Yes\n";
return 0;
} | 0 | 12,569,031 |
#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 REP(i,a,b) for(int i=a;i<b;i++)
#define yesno(flg) if(flg){cout<<'YES'<<endl;}else{cout<<'NO'<<endl;}
#define vi vector<int>
#define pb push_back
#define i197 1000000007
#define MAX_N 200002
using namespace ... | #include<bits/stdc++.h>
using namespace std;
#define MAXN 200005
#define MAXVAL 1000005
int a[MAXN];
int f[MAXVAL];
int n, ans;
int main(){
scanf("%d", &n);
for(int i = 1; i <= n; i++)
scanf("%d", &a[i]);
sort(a+1, a+n+1);
if(a[1] == 1){
if(a[2] == 1)
printf("%d\n", 0);
else... | 0 | 18,439,105 |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using namespace std;
#define ll long long
#define ld long double
ll ctoi(const char c){if('0'<=c&&c<='9') return (c-'0');return -1;}
#define ALL(x) begin(x),end(x)
int main(){
ll n,m;
cin >> n >> m;
vector<ll> l(m),r(m);
rep(i,m) cin >>... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n, m;
cin >> n >> m;
vector<string> a(n);
vector<string> b(m);
for(int i = 0;i < n;i++)cin >> a.at(i);
for(int i = 0;i < m;i++)cin >> b.at(i);
for(int ay = 0;ay < n;ay++){
for(int ax = 0;ax < n;ax++){
if(n - m +... | 0 | 13,112,802 |
#include<iostream>
#include<cmath>
#include<algorithm>
#include<string>
#include<cstdio>
#include<iomanip>
#include<map>
#include<cstring>
using namespace std;
long long n,m;
int main()
{
cin>>n>>m;
if(n*2>m) cout<<m/2;
else if(n*2==m) cout<<n;
else
{
m-=n*2;
m/=4;
... | #include <bits/stdc++.h>
#define pb push_back
#define Int long long
using namespace std;
const int MAXN=500005;
const long MOD=(long)(1e9+7);
vector<int> adj[MAXN];
vector<pair<int,int>> G[MAXN];
Int N,M,K;
Int X,Y,Z;
Int ceilS(Int x,Int y){
return (x+y-1)/y;
}
using D=long double;
Int perform(Int x){
return (x... | 0 | 96,635,495 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i=0;i < (int)(n);i++)
int main(){
char x;
cin >> x;
if (isupper(x)) cout << 'A' << endl;
else cout << "a"<< endl;
... | #include<stdio.h>
#include<string.h>
int main(){
char a[11];
char b[11];
char c[11];
scanf("%s",a);
scanf("%s",b);
scanf("%s",c);
int len1 = strlen(a);
int len2 = strlen(b);
int len3 = strlen(c);
if(a[len1-1] == b[0] && b[len2-1] == c[0]){
printf("YES");
}
else{... | 0 | 19,067,863 |
#include<iostream>
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<set>
#include<string>
#include<map>
#include<string.h>
#include<complex>
#include<math.h>
#include<queue>
#include <functional>
#include<time.h>
#include<iomanip>
using namespace std;
typedef long long int llint;
typedef pair<int, int> p... | #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 (){
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < (int)(n); i++){
cin >> a[i];
}
int k=1;
int ans=0;
int no=0;
for (int i = 0; i < (int)... | 0 | 90,498,686 |
#include <bits/stdc++.h>
using namespace std;
#define trav(a, A) for (auto & a : A)
#define f first
#define s second
typedef long long ll;
const ll MOD = 1e+9+7;
const ll INFLL = 0x3f3f3f3f3f3f3f3f;
const int INF = 0x3f3f3f3f;
const ll MAXN = 1e+5+7;
void solve(){
string s, t;
cin >> s >> t;
int ans = INF;
... | #include<iostream>
#include<cstdio>
#include<string>
#include<algorithm>
#include<cstring>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
using namespace std;
#define INT(x) int x; scanf("%d",&x)
#define LL(x) ll x; scanf("%lld",&x)
#define INPUT(x) cin >> x
#define REP1(x,n) for(int x = 0; x < n; x++... | 0 | 83,302,356 |
#include <bits/stdc++.h>
#define pb push_back
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define ll long long
#define ii pair<int,int>
#define vi vector<int>
#define vll vector<ll>
#define vii vector<ii>
using namespace std;
int ans=0,k;
string s;
int dp[110][4][2];
int solve(int pos,int n... | #include <bits/stdc++.h>
using namespace std;
int main()
{
long int n;
cin>>n;
long int i,j,a[n],t=0,x=1,s=0;
for(i=0;i<n;i++)
{
cin>>a[i];
}
for(j=0;j<n;j++)
{
if(x==a[j])
{
x++;
}
else
{
s++;
}
}
if(x==1)
{
cout<<-1<<endl;
return 0;
}
cout<<s<<endl;
} | 0 | 93,074,595 |
#include <bits/stdc++.h>
#include <iostream>
#include <cstdio>
#include <string>
#include <string.h>
using namespace std;
int main() {
string s;
cin >> s;
sort(s.begin(),s.end());
if(s == "abc")
cout << "Yes" << endl;
else cout << "No" << endl;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using lb = long double;
using P = pair<ll,ll>;
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#de... | 0 | 5,717,815 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,z,w;
cin>>n>>z>>w;
vector<int> a(n);
for(int i=0;i<n;i++)
cin>>a.at(i);
vector<int> x(n);
vector<int> y(n);
for(int i=n-1;i>=0;i--){
x[i]=abs((i>0?a.at(i-1):w)-a.at(n-1));
y[i]=abs((i>0?a.at(i-1):z)-a.at(n-1));
for(int j=i+1;j<... | #include<iostream>
using namespace std;
const int size=1e5+5;
const int level = 60;
typedef long long int ll;
ll basis[level];
void add(ll mask)
{
for(int i=level-1;i>=0;i--)
{
if(((mask>>i)&1) == 0)
continue;
if(!basis[i])
{
basis[i] = mask;
return;
... | 0 | 43,294,108 |
#include <iostream>
#include <string>
#include <map>
using namespace std;
int main(){
string s; getline(cin,s);
string word;
map<string,int> dic;
for(int i=0;i<s.size();i++){
if(s[i]!=' '){
word+=s[i];
}
else{
dic[word]++;
word="";
}
}
dic[word]++;
int num=0;
for(auto it:dic) num=max(num,it.sec... | #include <bits/stdc++.h>
using namespace std;
using UL=unsigned int;
using LL=long long;
using ULL=unsigned long long;
#define rep(i,n) for(UL i=0; i<(n); i++)
struct Vec{
double x,y;
Vec(double xx,double yy):x(xx),y(yy){}
};
Vec Relate(Vec o, Vec x, Vec p){
Vec ans{0,0};
x.x-=o.x; x.y-=o.y;
ans.x += x.x*p.x; a... | 0 | 89,038,914 |
#include<bits/stdc++.h>
#define ll long long int
#define M 1000000007
using namespace std;
ll n,t,x,y,m,q;
int main(){
ios_base::sync_with_stdio(false); cin.tie(NULL);
cin>>n;
string s,s1;
cin>>s>>s1;
for(int i=0;i<n;i++){
cout<<s[i]<<s1[i];
}
} | #include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
using namespace std;
using ll = long long;
const ll MOD = 1000000007LL;
const double PI = 3.14159265358979;
void solve()
{
int h, w;
cin >> h >> w;
vector<string> a(h);
for(int i = 0; i < h;... | 0 | 57,555,746 |
#include <iostream>
#include <string>
using namespace std;
int main() {
string a, b, c;
cin >> a >> b >> c;
if (a[a.size() - 1] == b[0] &&b[b.size() - 1] == c[0]) cout << "YES\n";
else cout << "NO\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;++i)
#define ll long long
const int MAX = 510000;
const int MOD = 1000000007;
ll fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++){
f... | 0 | 95,510,250 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.