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;
int N, banyak[100100], a, tot, maks=0;
int main() {
cin >> N;
for (int i = 1; i<= N; i++ ){
cin >> a;
banyak[a]++;
}
for (int i= 1;i<=100000; i++){
tot = banyak[i] + banyak[i+1]+ banyak[i-1];
if (maks < tot){
maks=... | #include <stdio.h>
int main(){
int n,x,r,i,j,k;
while(1){
scanf("%d %d",&n,&x);
if (n != 0 || x != 0){
r=0;
for(i = 0; i < n; i++){
for(j = 0; j < i; j++){
for(k = 0; k < j; k++){
if (i+j+k+3 == x){
r++;
}
}
}
}
printf("%d\n",r);
} else {
break;
... | 0 | 24,484,106 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << min(a+c, min({a+d, b+c, b+d}));
} | #include<bits/stdc++.h>
#define eb emplace_back
#define pb push_back
#define size(s) (int)s.size()
#define int long long
#define vi vector<int>
#define vs vector<string>
#define vv vector<vector<int>>
#define pii pair<int,int>
#define m_p(x,y) make_pair(x,y)
#define vp vector<pair<int,int>>
#define setbits(x) __builtin... | 0 | 47,451,973 |
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int a[5];
for(int i=0;i<5;i++){
cin>>a[i];
}
sort(a,a+5,greater<int>());
cout<<a[0]<<" "<<a[1]<<" "<<a[2]<<" "<<a[3]<<" "<<a[4]<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define debug(x) cout << (#x) << " is " << x << endl;
#define Q int t; scanf("%d", &t); for(int q=1; q<=t; q++)
typedef long long int lli;
typedef pair<int, int> pi;
#define N 300005
int H[N], W[N];
int main()
{
int h, w, m, hmx=0, wmx=0;
cin >> h >> w >> m;
vect... | 0 | 76,823,204 |
#include <bits/stdc++.h>
using namespace std;
using int64 = long long;
bool Solve() {
int n;
cin >> n;
vector<int> xs(n);
vector<int> v_count(n);
int max_d = 0;
for (int i = 0; i < n; i++) {
cin >> xs[i];
v_count[xs[i]]++;
max_d = max(xs[i], max_d);
}
if (max_d % 2 == 1) {
int k = (max_d... | #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;
#define int long long
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>ordered_set;
typedef long double ld;
typedef vector<int> vi;
typ... | 0 | 25,564,439 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define ar array
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T> using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_upda... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD=1000000007;
int main(){
ll N, M;
cin>>N>>M;
vector<ll> S(N), T(M);
for(ll i=0; i<N; i++){
cin>>S[i];
}
for(ll i=0; i<M; i++){
cin>>T[i];
}
vector<vector<ll>> dp(N+1, vector<ll>(M+1, 0));
... | 0 | 7,357,150 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<pair<int,int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
#define PUB push_back
#define PO pop
#define POF pop_front
#define POB pop_back
#define R... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long int ll;
typedef pair<int, int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
#define ff first
#define ss second
#def... | 0 | 38,817,729 |
#pragma GCC optimize("O3")
#pragma GCC optimize("avx2")
#pragma GCC optimize("unroll-loops")
#include <iostream>
#include <iostream>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <tuple>
#include <math.h>
#include <set>
#include <stack>
#include <bitset>
#include <map>
#include <queue>
#include <ra... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
int main(){
int h,w;
cin>>h>>w;
vector<vector<char>>grid(h,vector<char>(w));
rep(i,h)rep(j,w)cin>>grid[i][j];
const int dx[4]={1, 0, -1, 0};
const int dy[4]={0, 1, 0, -1};
bool ans=true;
rep(i,h)rep(j,w)... | 0 | 52,873,484 |
#include<bits/stdc++.h>
#define N 100001
#define int long long
#define LOG(x) cerr<<#x<<" = "<<x<<endl
#define add_edge(u,v) nxt[++cnt]=head[u],head[u]=cnt,to[cnt]=v
#define open(x) freopen(#x".in","r",stdin),freopen(#x".out","w",stdout)
char ch;bool fs;void re(int& x)
{
while(ch=getchar(),ch<33);
if(ch=='-')fs=1,x=0... | #include <bits/stdc++.h>
#define uint uint64_t
#define mx 100001
#define ll long long int
#define ull unsigned long long int
#define pii pair<int, int>
#define pll pair<long long int, long long int>
#define mp make_pair
#define pb push_back
#define inf INT_MAX
#define pi acos(-1)
#define eps 1e-8
#define gcd(a, b) __gc... | 0 | 75,039,411 |
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <math.h>
#include <iomanip>
#include <bitset>
#include <string>
#include <cstring>
#include <stdlib.h>
#include <utility>
#include <set>
#include <queue>
using namespace std;
typedef long long int ll;
typedef long double ld;
template<... | #include<stdio.h>
#include<string.h>
#define M 1046527
#define NIL (-1)
#define L 14
char H[M][L];
int getChar(char ch)
{
if( ch == 'A' ) return 1;
else if(ch == 'C') return 2;
else if(ch == 'G') return 3;
else if(ch == 'T') return 4;
else return 0;
}
long long getKey(char str[])
{
long long sum... | 0 | 63,678,972 |
#include "bits/stdc++.h"
#define ALL(obj) (obj).begin(),(obj).end()
#define RALL(obj) (obj).rbegin(),(obj).rend()
#define REP(i, n) for(int i = 0; i < (int)(n); i++)
#define REPR(i, n) for(int i = (int)(n); i >= 0; i--)
#define FOR(i,n,m) for(int i = (int)(n); i < int(m); i++)
using namespace std;
typedef long long ll;... | #include<iostream>
#include<iomanip>
#include<cassert>
#include<math.h>
#include<complex>
#include<algorithm>
#include<utility>
#include<queue>
#include<string.h>
#include<string>
#include<set>
#include<map>
#include<unordered_map>
#include<functional>
#include<vector>
using namespace std;
typedef long long ll;
typedef... | 0 | 45,816,410 |
#include <iostream>
using namespace std;
const int MAX_N=40;
int a,b,n;
int undrcnst[MAX_N];
int isunderconstruction(int x,int y){
int hash=x*100+y;
for(int i=0;i<MAX_N;i++){
if(undrcnst[i]==hash)
return 1;
}
return 0;
}
int solve(){
int roadnet[a][b];
for(int i=0;i<a;i++)
for(int j=0;j<b;j++)
roadnet[i... | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef vector<VVLL> VVVLL;
typedef pair<LL, LL... | 0 | 43,456,222 |
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <numeric>
#include <utility>
#include <string>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n, 0);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int ans = 0;
n -= k;
ans++;
if (n > 0) {
k--;
a... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<ll> divisor(ll n) {
vector<ll> ret;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n) ret.push_back(n / i);
}
}
sort(ret.begin(), ret.end());
return... | 0 | 5,952,977 |
#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(),a.rend()... | #include <bits/stdc++.h>
using namespace std;
void solve(long long N, std::vector<long long> P)
{
vector<pair<int, int>> vs;
for (int i = 0; i < P.size(); i++)
vs.push_back(make_pair(P[i], i));
sort(vs.begin(), vs.end());
set<int> idx;
idx.insert(-2);
idx.insert(-1);
idx.insert(P.size());
idx.insert... | 0 | 36,862,289 |
#include <iostream>
using namespace std;
struct Card{
char suit;
char value;
};
void bubble_sort(struct Card A[], int N){
Card temp;
for(int i=0; i<N; i++){
for(int j = 0; j < N - i -1; j++){
if(A[j].value > A[j+1].value){
temp = A[j];
A[j] = A[j+1];
A[j+1] = temp;
}
... | #include<bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(false);cin.tie();cout.tie();
#define FILE_READ_IN freopen("input.txt","r",stdin);
#define FILE_READ_OUT freopen("output.txt","w",stdout);
using namespace std;
typedef long long ll;
int main(){
#ifndef ONLINE_JUDGE
FILE_READ_IN
FILE_READ_OUT... | 0 | 60,617,065 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int w, h, n;
cin >> w >> h >> n;
vector<int> x(n);
vector<int> y(n);
vector<int> a(n);
rep(i, n) cin >> x.at(i) >> y.at(i) >> a.at(i);
vector<vector<int>> square(w, vector<int>(h));
rep(i, n) {... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, k, n) for (int i = k; i < (int)(n); i++)
#define RRep(i, k, n) for (int i = k; i > (int)(n); i--)
#... | 0 | 58,291,482 |
#include<iostream>
using namespace std;
char evaluate(int,int,int);
int main(){
int m,f,r;
cin >> m >> f >> r;
while ( m > -1 || f > -1 || r > -1 ){
cout << evaluate(m,f,r) << endl;
cin >> m >> f >> r;
}
}
char evaluate(int m,int f,int r){
char rank;
int avg;
avg = (m+f);
... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define pb push_back
#define eb emplace_back
#define a first
#define b second
#define bg begin(... | 0 | 28,623,494 |
#include <iostream>
using namespace std ;
int main()
{
int a,b;
cin >> a >> b ;
cout << a + (b*0.5) ;
return 0 ;
} | #include <iostream>
#include "bits/stdc++.h"
using namespace std;
#define print(x) cout<<x<<endl;
#define rep(i, a, b) for(ll i=a;i<b;i++)
#define REP(i, a) for(ll i=0;i<a;i++)
#define jkl ll debug = 0;
#define RREP(i, a) for(ll i=a;i>0;i--)
#define rrep(i, a, b) for(ll i=a-1;i>=b;i--)
#define printall(n, array) {for(l... | 0 | 83,203,105 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
bool kaibun(string &s) {
string comp = s;
reverse(s.begin(), s.end());
if(comp == s) return true;
else return false;
}
int main() {
string s;
cin >> s;
string S;
S = s.substr(0, (s.size() -... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#includ... | 0 | 11,164,158 |
#include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const long long MOD = 1e9 + 7, MAX = 1e18, larg = 1e5, INF = -1e9;
long long A, B, C, D, E, F, G, H, I, J, K, L, N, M, O, P, Q, R, S, T, U, V, W;
typedef long long ll;
typedef pair<ll, ll> Pa;
int cnt[200001];
int main()
... | #include <algorithm>
#include <functional>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <bitset>
#include <cl... | 0 | 51,433,554 |
#include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
int main(){
int A,B;
char buf[2];
scanf("%d %s %d",&A,buf,&B);
if(buf[0] == '+'){
printf("%d\n",... | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main()
{
string str;
int n;
cin >> str >> n;
for (;n--;) {
string s, r;
int a, b;
cin >> s >> a >> b;
if (s == "replace") {
cin >> r;
for (int i = a; i <= b; i++) {... | 0 | 27,056,024 |
#include <bits/stdc++.h>
#define rep(i,n) for(long long i=0; i<n; i++)
#define Rep(i,n) for(long long i=1; i<n; i++)
#define ll long long
#include <math.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define PI acos(-1... | #include <iostream>
#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 <unordered_set>
#include <u... | 0 | 39,555,016 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n-1; i >= 0; i--)
#define ALL(x) x.begin(), x.end()
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
const int mod = 1e9+7;
const int INF = 1e9;
const int MAX = 1e6;
bool ... | #include<bits/stdc++.h>
#define f(i,a,b) for(register int i=a;i<=b;++i)
#define ff(i,a,b) for(register int i=a;i>=b;--i)
#define debug(x) cerr << #x << " : " << x << " " << endl
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<st... | 0 | 72,142,246 |
#include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<util... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
ll n;
ll a[200005],b[200005];
ll t;
ll ans;
int main(void){
cin>>n;
for(int i=0;i<n;i++){
cin>>a[i];
b[i+1]=b[i]+a[i];
}
sort(b,b+n+1);
for(int i=1;i<=n;i++){
if(b[i]!=b[i-1]){
... | 0 | 31,125,205 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ld = long double;
const double PI = 3.1415926535897932384626433832795;
const int dx[] = { 0, 1, 0, -1 };
const int dy[] = { -1, 0, 1, 0 };
int gcd(int x, int y) { return y ? gcd(y, x % y) : x; }
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; ... | #include <iostream>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <cstring>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <algorithm>
#include <iterator>
#include <bitse... | 0 | 63,624,176 |
#include <bits/stdc++.h>
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <stack>
#include <queue>
#include <cmath>
using namespace std;
const int max_n = 10000+2;
long long cnt[111];
long long m,n,a=0,b,W;
const int INF = 1e9+1;
const int mod = 1e9 + 7;
string s1,s2;
long dist[max_n],s[max_n],w[max_... | #include <numeric>
#include <bits/stdc++.h>
#include <utility>
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <math.h>
#include <string>
#define ll long long
#define ull unsigned long long
#define make(type,x) type x; cin>>x
#define make2(type,x,y) type x,y; cin>>x>>y
#define fr(x,... | 0 | 92,812,126 |
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int i,data[10];
for( i = 0; i < 10; i++ ){
cin >> data[i];
}
for( i = 0; i < 10; i++ ){
for ( int j = 0;j < 9; j++ ){
if ( data[j] < data[j+1]) swap(data[j],data[j+1]);
}
}
for( i = 0; i < 3; i++ ) cout << data[i] <<... | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<vector<int>> card(3, vector<int>(3));
for(int i = 0; i < 3; i++){
cin >> card.at(i).at(0);
cin >> card.at(i).at(1);
cin >> card.at(i).at(2);
}
int times; cin >> times;
vector<vector<int>> hits(3, vector<int>(3,0));
for(int i = 0; i < t... | 0 | 73,449,848 |
#include <bits/stdc++.h>
#define IO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define eb emplace_back
#define pb push_back
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
using namespace std;
using ll = long long;
using ull = unsigned long long;
using Vi = vector<int>;
void run() {... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define show(x) {for(auto i: x){cout << i << " ";} cout << endl;}
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int X, N;
cin >> X >> N;
vector<int> A(102, 0);
rep(i, ... | 0 | 93,772,357 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<cstdio>
#include<queue>
using namespace std;
typedef pair<int,int> ii;
typedef long long ll;
const int INF=1e9;
int main(){
string s;cin>>s;
vector<bool> used(26,false);
for(int i=0;i<(int)s.size();i++){
... | #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 { \... | 0 | 21,140,575 |
#include <bits/stdc++.h>
using namespace std;
inline long long ceil(long long x, long long y)
{
return (x+y-1)/y;
}
bool process(vector<long long> a, int n, long long T)
{
long long sum = 0;
for (int i = 0; i < n; i++)
{
long long y1 = ceil(a[i]+T-n+1,n+1);
long long y2 = (a[i]+T)/(n+1);
if (y1 != y2) return ... | #include <iostream>
#include <cmath>
#include <vector>
#include <bitset>
#include <string>
#include <utility>
#include <queue>
#include <algorithm>
#include<set>
using namespace std;
long long int mpown(long long int m, int n);
long long int bign=1000000007;
int bitCount(int bits);
int main()
{
long long int r,d,x;... | 0 | 86,747,698 |
#include <bits/stdc++.h>
using namespace std;
#define FASTIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using ll = long long;
int main() {
FASTIO
int n;
cin >> n;
vector<int> h(n);
for(int& x : h) cin >> x;
ll total = 0;
for(int i=1; i<n; i++) {
if(h[i] < h[i-1]) {
total += (ll) h[i-1]-h[i];
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
namespace Modop {
ll modAdd(ll a, ll b) {
return (a + b) % MOD;
}
ll modSub(ll a, ll b) {
return (((a - b) % MOD) + MOD) % MOD;
}
ll modMul(ll a, ll b) {
return ((a % MOD) * (b % MOD))... | 0 | 2,780,256 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define endl '\n'
#define pii pair<int, int>
#define all(a) a.begin(),a.end()
template <typename T>
inline T gcd(T a, T b) { while (b != 0) swap(b, a %= b); return a; }
int main(){
int n, d;
cin >> n >> d;
int... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll, ll> Pll;
#define debug(var) do{std::cout << #var << " : ";view(var);}while(0)
template<typename T> void view(T e){std::cout << e << std::endl;}
template<typename T> void view(const std:... | 0 | 32,994,503 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define ull unsigned long long
#define ld long double
#define rep(a) rep1(i,a)
#define rep1(i,a) rep2(i,0,a)
#define rep2(i,b,a) for(int i=(b); i<((int)(a)); i++)
#define rep3(i,b,a) for(int i=(b... | #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(int i=int(a);i<int(b);i++)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define rrep(i,n) for (int i=(n-1);i >= 0;i--)
#define all(v) v.begin(),v.end()
#define sz(v) (int)((v).si... | 0 | 17,035,078 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(var, begin, end) for (int var = (begin); var <= (end); var++)
#define RFOR(var, begin, end) for (int var = (begin); var >= (end); var--)
#define REP(var, length) FOR(var, 0, length - 1)
#define RREP(var, length) RFOR(var, length - 1, 0)
#de... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int w, h, n;
cin >> w >> h >> n;
vector<int> x(n);
vector<int> y(n);
vector<int> a(n);
rep(i, n) cin >> x.at(i) >> y.at(i) >> a.at(i);
vector<vector<int>> square(w, vector<int>(h));
rep(i, n) {... | 0 | 88,437,331 |
#include<bits/stdc++.h>
#define ll long long int
#define endl '\n'
#define M 1000000007
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define f first
#define s second
#define b begin
#define e end
#define pb push_back
#define mp make_pair
#define FOR(i,a,b) for(i=a;i<b;i++)
#define RFOR(i,a,b) for(i=a;i>=b;i--)
#de... | #include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<queue>
#include<string>
#include<cstring>
#include<algorithm>
#include<set>
#include<map>
#include<iomanip>
#define REP(i,n) for(int i=0;i<(n);i++)
#define EPS (1e-7)
#define INF (2e9)
using namespace std;
typedef long long int ll;
int M, K;... | 0 | 37,640,810 |
#include <bits/stdc++.h>
#include <sys/time.h>
using namespace std;
#define rep(i,n) for(long long i = 0; i < (long long)(n); i++)
#define repi(i,a,b) for(long long i = (long long)(a); i < (long long)(b); i++)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define mt make_... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
int main()
{
ll n,h,w;
cin >> n >> h >> w;
ll ans = 0;
for(ll i = 0;i < n;i++)
{
ll a,b;
cin >> a >> b;
if(a >= h && b >= w)
{
ans++;
... | 0 | 54,137,461 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >>n;
map<string,int>mp;
for(int i=0;i<n;i++){
string s;
cin>>s;
sort(s.begin(),s.end());
if(mp.count(s))mp[s]++;
else mp[s]=1;
}
long long kotae=0;
long long kazu=0;
auto begin=mp.begin(),end=mp.end();
for(auto i... | #include <stdio.h>
int main () {
char str[20];
scanf("%s", str);
for (int i = 0; str[i] != '\0'; i++) {
if(i == 5 || i == 13) {
printf(" ");
}
else {
printf("%c", str[i]);
}
}
return 0;
} | 0 | 21,268,490 |
#include<bits/stdc++.h>
using namespace std;
#define faster ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define sq(x) (x)*(x)
#define PI acos(-1.0)
#define all(x) x.begin(),x.end()
#define nl '\n'
typedef long long int ll;
typedef unsigned long long int llu;
int main()
{
int n,sz,ok=0;
... | #include<iostream>
#include<string>
using namespace std;
int main(){
int m,h;
while(1){
char tmp[400];
string str;
cin>>str;
if(str=="-"){break;}
for(int i=0;i<str.size();i++){
tmp[i]=str[i];
tmp[str.size()+i]=str[i];
}
cin>>m;
... | 0 | 93,231,917 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
string s;
cin>>s;
std::map<char, int> map;
for (int i=0;i<s.size();i++) {
map[s[i]]++;
}
std::deque<char> alpha;
for (int i=97;i<123;i++) {
char c=i;
alpha.emplace_back(c);
}
reverse(s.begin(),s.end... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define ull unsigned long long
#define vi vector<int>
#define vvi vector<vi>
#define pb push_back
#define mii map<int, int>
#define pii pair<int, int>
#define pq priority_queue<int>
#define pqs priority_queue<int, vi, greater<int>>
... | 0 | 15,161,122 |
#include <iostream>
#include <cstdlib>
using namespace std;
int main(){
char str[1000];
char one_str[2] = {'0', '\0'};
char *sp;
int a, digit;
cin>>str;
a = atoi(str);
while(a){
digit=0;
sp=str;
while(1){
if(*sp=='\0') break;
one_str[0] = *sp;
digit += atoi(one_str);
sp++;
}
cout<<digit<<en... | #include<iostream>
#include<map>
#include<string>
#include<cctype>
int main()
{
std::string str;
std::map<std::string,int> frequency;
std::string longest,frequent;
int freq=0;
int len=0;
std::getline(std::cin,str);
str+=' ';
int begin=0;
bool inword=false;
for(int i=0;i<str.size();i++)
{
std::string word;
... | 0 | 7,409,291 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i,n) for (int (i)=0; (i) < (n); (i)++)
int main()
{
ll K, S; cin >> K >> S;
ll ans = 0;
for (ll x = 0; x <= K; ++x) {
for (ll y = 0; y <= K; ++y) {
ll z = S - x - y;
if (z ... | #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... | 0 | 17,429,731 |
#include <bits/stdc++.h>
using namespace std;
int64_t GCD(int64_t a, int64_t b) {
if (b == 0) return a;
else return GCD(b, a % b);
}
int main() {
int64_t N;
cin >> N;
vector<int64_t> A(N);
for ( int64_t i = 0; i < N; ++i){
cin >> A[i];
}
int64_t ans = A[0];
for ( int64_t i = ... | #include <algorithm>
#include <climits>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define int long long int
constexpr int INF = std::numeric_limits<int>::max();
constexpr int NINF = std::numeric_limits<int>::min();
using namespace std;
int gcd(int a, int b) {
... | 0 | 40,643,772 |
#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 elif else if
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1e9+7;
const ll MOD2 = 998244353;
const ll INF = 1e15;
int main(){
string yes = "YES", no = "N... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define mk make_pair
#define fi first
#define se second
#define endl '\n'
typedef long long ll;
typedef pair<int,int> ii;
typedef vector<ii> vii;
const int INF = 0x3f3f3f3f;
const double PI = acos(-1.0);
const int T = 1e5+5;
int ... | 0 | 1,640,396 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
set<pair<int,int> > st;
int n, x[N], mx;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
cin >> n;
for (int i = 0; i < n; i++){
cin >> x[i];
mx = max(mx, x[i]);
}
for (int i = 0; i < n; i++)
if(x[i] != mx)
st.insert({a... | #include <iostream>
using namespace std;
int main() {
long long n, a, b;
cin >> n >> a >> b;
long long result;
if (n == 0 || a > b) {
result = 0;
} else if (n == 1) {
if (a != b) {
result = 0;
} else {
result = 1;
}
} else {
result ... | 0 | 73,415,794 |
#include<bits/stdc++.h>
using namespace std;
const int N = 1e2 + 5;
int n, A, B, a[N];
int cnta, cntb, cntc;
int main(){
cin >> n >> A >> B;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (a[i] <= A) cnta++;
else if (a[i] <= B) cntb++;
else cntc++;
}
cout << min(cnta, min(cntb, cntc... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(x) (x).begin(),(x).end()
template <class T> inline bool chmin(T &a, T b) {if (a > b){a = b;return true;}return false;}
template <class T> inline bool chmax(T &a,... | 0 | 16,519,001 |
#include<iostream>
#include<stack>
using namespace std;
int main(){
stack<int> st;
while( 1 ){
int inout;
cin >> inout;
if(cin.eof()) break;
if(inout == 0){
cout << st.top() << endl;
st.pop();
}else{
st.push(inout);
}
}
return 0;
} | #include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
#define pb push_back
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
vector<string> s(n);
rep(i, n) cin >> s[i];
int ans = 0;
vector<int> a(3);
rep(i, n){
if (s[i][0] == 'B' && s[i][s[i].siz... | 0 | 75,781,450 |
#include<bits/stdc++.h>
using namespace std;
int x=0;
string a,b;
char i;
int main(){
cin>>a>>b;
for(i=0;i<=a.length()-1;i++){
if(a[i]!=b[i]){
x=x+1;
}
}
if(x>=1){
cout<<"No";
}
else{
cout<<"Yes";
}
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod=1e9+7;
int main(){
int n,m;cin >> n >> m;
vector<int> s(n),t(m);
for(int i=0;i<n;i++){
cin >> s[i];
}
for(int j=0;j<m;j++){
cin >> t[j];
}
vector<vector<ll>> dp(n+1,vector<ll>(m+1));
dp[0][0]=1;
for(int i=0;i<=n;i... | 0 | 33,749,371 |
#include<iostream>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
using namespace std;
int func(int X,int A,int B,int C){return (A*X+B)%C;}
int main(){
int n,a,b,c,x;
while(1){
cin>>n>>a>>b>>c>>x;
if(!n && !a && !b && !c && !x)break;
int lucky[n];
rep(i,n)cin>>lucky[i];
int cnt=0,plac... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define ll long long
#define P pair<ll,ll>
#define all(v) (v).begin(),(v).end()
const ll mod = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1.0);
int main(void)
{
ll n; cin>>n;
long double a... | 0 | 27,047,626 |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(){
string s;
cin >> s;
int n = (s.size()+1)/2;
vector<char> ans(n);
int j = 0;
for(int i = 0; i < s.size(); i+=2){
ans.at(j) = s.at(i);
j++;
}
for(int i = 0; i < n; i++){
cout << ans.at(i);
}
return 0;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
int n, k;
bool has_enough(ll xmin, ll xmax, ll ymin, ll ymax, vector<P> &xy){
int cnt = 0;
for (int i = 0; i < n; ++i) {
ll x = xy[i].first;
ll y = xy[i].second;
if (x >= xmin && x <= xmax && y >= ymin && y <= ym... | 0 | 33,226,476 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
bool ok = true;
if (A != B){
ok = false;
}
if (B != C){
ok = false;
}
if (C != A){
ok = false;
}
if (ok){
cout << "Yes" << "\n";... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(20);
string s;
cin>>s;
int n=s.size();
for(int i=0;i<n-1;i++){
if(s[i]==s[i+1]){
cout << i+1 << " " << i+2<<endl;
... | 0 | 93,542,195 |
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define MOD 1000000007
using namespace std;
int d[10];
bool valid(int n) {
while(n) {
if(d[n%10]) return false;
n/=10;
}
return true;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL)... | #include "bits/stdc++.h"
typedef long long ll;
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<int> arr(n);
for(int i=0; i<n; i++)
cin >> arr[i];
vector<int> smn,smx;
smn.push_back(0);
smx.push_back(0);
ll tot=100... | 0 | 59,695,681 |
#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>;
vector<vector<int>> g;
vector<int> o;
map<int, int> ad;
vector<ll> c;
int main(){
int a, b, c, d;
cin >> a >> b >> c >> d;
if(abs(a-c) <= d || (abs(a-b) <= d && abs(b-c) <= d)){... | #include <iostream>
#include <vector>
#include <string>
using namespace std;
int main(){
int n;
while(cin >> n&& n!=0){
int sum=0,pri=1000-n;
while(pri>=500){
pri -=500;
++sum;
}
while(pri>=100){
pri -=100;
++sum;
}
while(pri>=50){
pri -=50;
++sum;
}
while(pri>=10){
pri -=10;
+... | 0 | 37,391,591 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define ALL(a) (a).begin(), (a).end()
#define SORT(c) sort(ALL((c)))
#define debug(x) \
do { \
... | #include <cmath>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <vector>
#include <map>
#include<cstdio>
#include<functional>
#include <bitset>
#include <iomanip>
#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)
#d... | 0 | 32,994,440 |
#include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <queue>
#define MOD (1000000007l)
#define rep(i, n) for(long i = 0; i < n; i++)
using namespace std;
void solve() {
long X, Y;
cin ... | #include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <cmath>
#include <cstdlib>
using namespace std;
const int MAX = 10010;
int V, E;
vector<int> G[MAX];
int dig[MAX];
void init(int V, i... | 0 | 3,637,348 |
#include <iostream>
#include <string>
#include <cstring>
#include <sstream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
int selectionSort(vector<int> &a, int n)
{
int count = 0;
for (int i = 0; i < n; i++)
{
int minj = i;
for (int j = i; j < n; j++)
{
if (... | #include <bits/stdc++.h>
using namespace std;
int main(){
string s, t;
cin >> s >> t;
sort(s.begin(),s.end());
sort(t.rbegin(),t.rend());
int cnt = 0;
while(1){
int i = (int)s[cnt];
int j = (int)t[cnt];
if(i == 0 & j == 0){
cout << "No" << endl;
break;
}
if(i < j){
cout... | 0 | 58,188,658 |
#include <bits/stdc++.h>
using namespace std;
int n, s;
int Comb(int N, int start, int s)
{
int ret = 0;
if (s < 0)
return 0;
if (N == n)
if (start == s)
return 1;
else
return 0;
for (int i = start + 1; i <= 9; ++i)
ret += Comb(N + 1, i, s - start);
return ret;
}
int main(){
vector<int> RET;
while ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n);(i... | 0 | 89,827,929 |
#include<bits/stdc++.h>
using namespace std;
#pragma GCC target ("avx2")
#pragma GCC optimization ("unroll-loops")
#pragma GCC optimize("O2")
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(v) v.begin(),v.end()
#define prec(n) fixed<<setprecision(n)
#define n_l '\n'
#define gcd... | #include<iostream>
#include<math.h>
#include<string>
#include<vector>
using namespace std;
#define rep(i,n) for(i=0;i<n;i++)
int main(){
int i;
int n;
cin>>n;
int max=0;
int ans=0;
if(n==1){
cout<<1;
return 0;
}
rep(i,n+1){
int cnt=0;
int p=i;
whil... | 0 | 73,537,011 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const long long INF = 1LL << 60;
using ping = pair<ll, ll>;
int main(){
ll N, M;
cin >> N >> M;
vector<ll> A(M);
for (int i = 0; i < M; i++) cin >> A[i];
ll cnt = 0;
for (int i = 0; i < M; i++) cn... | #include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i < (n); i++)
using namespace std;
using ll = long long;
int N,M;
int DFS(vector<vector<int>> &load, int now, vector<bool> visited){
bool end=true;
for(int i=1; i<=N; i++){
if(visited[i]==false){
end=false;
}
}
if(end) r... | 0 | 45,066,877 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <math.h>
#include <queue>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
ll prev = 1000000000;
int cnt = -1;
int ans = 0;
for (int i = 0; i < N; ++i) {
ll H;
cin >> H;
if (prev >= H) {
cnt++;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const long long MOD = 1e9 + 7;
#define INPUT(x) freopen(x,"r",stdin)
#define OUTPUT(x) freopen (x,"w",stdout)
#define pb push_back
#define endl '\n'
#d... | 0 | 85,339,723 |
#include <iostream>
#include <utility>
using namespace std;
#define N 1000000
#define INF 1000000
typedef pair<char, int> Card;
void bubSort(Card cards[], int n){
for (int i=0; i<n; i++){
for (int j=n-1; j>=i+1; j--){
if (cards[j].second < cards[j-1].second){
Card tmp;
tmp = cards[j]; cards[... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define rep(i,n) for(int i=0;i<n;++i)
#define repa(i,a,n) for(int i=a;i<n;++i)
#define repr(i,n) for(int i=n-1;i>=0;--i)
#define repba(i,b,a) for(int i=b;i>=a;--i)
#define repab(i,a,b) for(int i=a;i<b;++i)
... | 0 | 67,295,907 |
#include <stdio.h>
#include <math.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <numeric>
#include <string>
#include <map>
#include <stack>
#include <queue>
using namespace std;
typedef long long int lli;
#define urept(soeji, start, n) for (int soeji = start; soeji < n; soeji++)
#define drept(s... | #include<bits/stdc++.h>
using namespace std;
const long long MOD = 1e9+7;
#define rep(i,n) for(int i=0;i<n;++i)
typedef long long int ll;
typedef unsigned long long ull;
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b) {if (a < ... | 0 | 34,962,995 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
string S;
cin >> S;
vector<vector<int>> pre(N);
vector<int> cnt(10, 0);
for(int i=0; i<N; i++)
{
pre[i] = cnt;
cnt[(S[i] - '0... | #include <iostream>
using namespace std;
int main() {
int max = -1000005;
int min = -max;
int n;
cin >> n;
long long int sum = 0;
int num;
for (int i = 0; i < n; i++) {
cin >> num;
sum += num;
if (num > max) {
max = num;
}
if (num < min) {
min = num;
}
}
cout << min << ' ' << max << ' ' << su... | 0 | 67,928,922 |
#include <bits/stdc++.h>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <cctype>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <functional>
using namespace std;
#de... | #include <iostream>
#include <vector>
using namespace std;
vector<int> G[100000];
long A[100000];
bool used[100000];
bool judge = true;
long dfs(int v){
used[v] = true;
if(G[v].size() == 1){
return A[v];
}
long sum = 0;
for(int i = 0; i < G[v].size(); i++){
long tmp;
if(!used... | 0 | 96,102 |
#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,m,x;
cin >> n >> m >> x;
vector<int> c(n);
vector<vector<int>> a(n,vector<int>(m));
rep(i,n){
cin >> c[i];
rep(j,m) cin >> a[i... | #include <bits/stdc++.h>
#define F first
#define S second
#define maxn 200005
#define MOD 1000000007
#define mp make_pair
#define pb push_back
#define pi acos(-1)
#define bit(p,x) ((x>>p) & 1)
#define Task "CF"
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<pair<int,int>,int > piii;
... | 0 | 81,047,189 |
#include<bits/stdc++.h>
using namespace std;
const int N=3e5+10;
map<int,int>xc,yc;
struct node{
int x,y;
}p[N];
int numx,numy,cnt1,cnt2,cnt,h,w,m;
int main(){
scanf("%d%d%d",&h,&w,&m);
for(int i=1,x,y;i<=m;i++){
scanf("%d%d",&x,&y);
p[i]={x,y};
xc[x]++;yc[y]++;
numx=max(numx,xc[x]),numy=max(numy,yc[y]);
}
... | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <numeric>
#include <ctime>
#include <complex... | 0 | 49,431,959 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int p, n, m;
while (cin >> p >> n >> m, n || m || p) {
vector<int> v(p);
for (auto& i : v) cin >> i;
int ans, Max = -1;
for (int i = n; i <= m; i++) {
if (Max <= v[i-1] - v[i]) {
ans = i;
... | #include <iostream>
#include <vector>
#include <string>
#include <cctype>
using namespace std;
int main(){
string a;
getline(cin, a);
for (long i = 0; i < a.size(); i++){
if (isupper(a[i])) a[i] = tolower(a[i]);
else if (islower(a[i])) a[i] = toupper(a[i]);
}
cout << a << endl;
return 0;
} | 0 | 26,899,907 |
#include <iostream>
using namespace std;
void bubbleSort(string array[],int n){
for(int i=0;i<n;i++){
for(int j=n-1;j>i;j--){
if(array[j][1]<array[j-1][1]){
string tmp;
tmp = array[j-1];
array[j-1]=array[j];
array[j]=tmp;
}
}
}
}
void selectionSort(string array[],int n){
for(int i=0;i<n;i++... | #include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int main(){
long long n;
string s;
cin >> n >> s;
long long ans = 0;
for(char c1 = '0'; c1 <= '9'; c1++){
if(s.find(c1) == string::npos) continue;
string s1 = s.substr(s.find(c1)+1);
for(char c2 = '... | 0 | 44,515,544 |
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define f(i,n) for(int i=0;i<n;++i)
typedef vector<int> vi;
vi siz(200001);
vi par(200001);
void initialize(int n){
f(i,n){
par[i]=i;
siz[i]=1;
}
}
int find_set(int v){
if(par[v]==v) return v;
return par[v]=find_set(par[v]);
... | #include <iostream>
#include <stdlib.h>
#include <stdio.h>
#include <string>
#include <algorithm>
#include <math.h>
#include <map>
#include <chrono>
#include <vector>
using namespace std;
int main () {
int N;
cin >> N;
vector<long long int> x(N), y(N);
for (int i=0; i<N; i++) {
cin >> x[i] >> y[... | 0 | 44,963,789 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int set=0;
int max=10;
vector<int> a(5);
for(int i=0;i<5;i++){
cin >> a[i];
if(max>a[i]%10 && a[i]%10!=0){
max=a[i]%10;
set=i;
}
}
int ans=0;
for(int i=0;i<5;i++){
if(i!=set && ... | #include <bits/stdc++.h>
#define repd(i, a, b) for (ll i = (a); i < (b); i++)
#define repb(i, n) for (ll i = (n)-1; i >= 0; i--)
#define rep(i, n) repd(i, 0, n)
using namespace std;
using ll = long long;
using ul = unsigned long long;
ll mod = 1000000007;
const ll com_max = 510000;
ll fac[com_max], inv[com_max], finv[c... | 0 | 67,235,540 |
#include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL (-1)
#define LL long long
using namespace std;
const int64_t MOD = 1e9 + 7;
const int INF = INT_MAX;
int main() {
int64_t X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<int64_t> A(X), B(Y), C(Z);
for (int i = 0; i < X; i++) cin >> A[i];
for (int i = 0; i <... | #include <iostream>
using namespace std;
int fx(int x){
return x*x;
};
int main() {
int d;
while( cin >> d)
{
int l = d;
int s = 0;
while(l <= 600 - d)
{
s += fx(l) * d;
l += d;
}
cout << s <<endl;
}
return 0;
} | 0 | 74,707,547 |
#include <iostream>
#include<time.h>
#include<string>
#include<cstring>
#include <cstdio>
#include<utility>
#include<algorithm>
#include<vector>
#include<cmath>
#include<map>
#include<bitset>
#include<queue>
#include<stack>
#include<set>
#include <limits>
#include <climits>
#include <numeric>
#include<cassert>
#include... | #include<bits/stdc++.h>
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int INF = (1LL << 30) - 1;
int MOD = 1e9+7;
main(){
int N,M;
cin >> N >> M;
while(N){
vector<pair<int,int> > V(N);
rep(i,0,N){
int a,b;
... | 0 | 55,877,727 |
#include<iostream>
#include<map>
#include<string>
std::map<std::string,int> m;
int main()
{
std::string s;
std::getline( std::cin, s );
int b = 0, e = 0;
for( int i = 0; i < s.size(); i++ ){
if( s[i] != ' ' ) e++;
else{
std::string s2 = s.substr( b, e - b );
b = ++e;
e = b;
if( m.find( s2 ) != m.en... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int N,R;
cin>>N>>R;
if(N>=10){
cout<<R;
}
else{
cout<<100*(10-N)+R;
}
return 0;
} | 0 | 48,848,956 |
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#def... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repab(i, a, b) for (int i = a; i <= (int)(b); i++)
#define ll long long
#define vec vector
#define pb push_back
#define ft first
#define sd second
#define all(vec) vec.begin(), vec.end()
#define endl "\n"
typedef ... | 0 | 67,752,173 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<ll> a(n);
rep(i, n) {
cin >> a[i];
}
ll stock = 0, money = 1000;
rep(i, n) {
if (i == n - 1) {
... | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cmath>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <string>
#define BIG 1000000000
#define SIZE 40
#define PI 3.14159265359
using namespace std;
struct Point {
dou... | 0 | 91,859,768 |
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <cmath>
#include <utility>
#define ll (long long)
#define REP(i,n) for(int i = 0;i<(int)n;i++)
#define FOR(i,a,b) for(int i = (a);i < (b);i++)
#define RFOR(i,a,b) for(int i = (a);i>(b);i--)
#define COUNTER int i= 0,j = 0,k = 0,l = 0,m... | #include<bits/stdc++.h>
using namespace std;
using ll = long long int;
#define long ll
template <typename T>
struct SegmentTree {
using F = function<T(T, T)>;
const T e;
const F f;
size_t sz;
vector<T> tree;
SegmentTree(size_t n, const F &f, const T &e = 0) : f(f), e(e) {
sz = 1;
... | 0 | 15,484,365 |
#include"bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
int a, b... | #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>
us... | 0 | 59,635,572 |
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <stack>
#include <set>
#include <map>
typedef long long ll;
using namespace std;
int main(){
int N;
cin >> N;
int tl[N+2],tr[N+2],v[N+2];
tl[0] = 0;
tr[... | #define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cmath>
#include <bitset>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
ty... | 0 | 11,001,917 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
using ll = long long;
using P = pair<int, int>;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(v) v.begin(), v.end()
#define sz(x) ((int) x.size())
#define pb push_back
#define mp make_pair
#define F first
#define S second
typede... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep2(i,s,n) for(int i=(int)(s);i<(int)(n);i++)
typedef long long ll;
int main(){
int N,M;
cin >> N >> M;
vector<pair<int,int>> AB(N);
rep(i,N) cin >> AB[i].first >> AB[i].second;
sort(AB.begin(),AB.end(... | 0 | 46,283,752 |
#include <iostream>
using namespace std;
int parent(int x){return x/2;}
int leftchild(int x){return 2*x;}
int rightchild(int x){return 2*x + 1;}
int main()
{
int h,a[300];
cin>>h;
for(int i=1;i<=h;++i)cin>>a[i];
for(int i=1;i<=h;++i){
cout<<"node "<<i<<": key = "<<a[i]<<", ";
if(parent(i) >= 1)cout<<"parent key... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v... | 0 | 57,637,457 |
#include <cstdio>
#include <cstring>
#include <cmath>
#include <vector>
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <queue>
#include <list>
#include <numeric>
#include <stack>
#include <unordered_map>
#include <map>
#include <set>
using namespace std;
#define sz(a) int((a).size())
#define all(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
typedef vector<vpii> vvpii;
#define mt make_tuple
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(x) (x).begi... | 0 | 81,482,084 |
#include <iostream>
int main(int argc, char *argv[]) {
int N, A, B;
std::cin >> N >> A >> B;
std::cout << ((B - A) % 2 == 0 ? "Alice" : "Borys") << std::endl;
} | #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++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
ll res(string s){
... | 0 | 60,785,227 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); i++)
#define fcout cout << fixed << setprecision(15)
using lint = long long;
using P = pair<int, int>;
template<class T> inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool ... | #include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#include<bits/stdc++.h>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
#define pf p... | 0 | 58,299,712 |
#include<bits/stdc++.h>
using namespace std;
int main(void){
int N,K;
cin >> N >> K;
int tmp = 1;
int num_cnt = 0;
while(K > tmp){
tmp *= 2;
num_cnt += 1;
}
double nums_list[N];
for(int i = 1; i <= N; i++){
for(int j = 0;j <= num_cnt;j++){
if(i*pow(2,j) >= K){
nums_list[i-1] = ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 1e9+7;
int add (int a, int b) {
a += b;
if (a >= mod) a -= mod;
return a;
}
int mul (ll a, ll b) {
a *= b;
if (a >= mod) a %= mod;
return a;
}
int sub (int a, int b) {
a -= b;
if (a < 0) a += mod;
return a;
}
int binpow (int a,... | 0 | 57,313,457 |
#include <bits/stdc++.h>
using namespace std;
long long upper = 10e16 + 1000;
int main()
{
long long K;
cin >> K;
int n = 50;
vector<long long> res(50);
for (int i = 0; i < 50; ++ i) {
res[i] = i;
}
for (int i = 0; i < 50; ++ i) {
res[i] += K / n;
}
for (int i = 0; i < K % n; ++ i) {
res[i... | #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 | 55,873,126 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n = 5;
int a[n];
for(int i=0;i<n;i++) {
cin >> a[i];
}
sort(a,a+n);
for(int i=n-1;i>=0;i--) {
cout << a[i] << (i == 0 ? "\n" : " ");
}
} | #include <algorithm>
#include <iostream>
#include <set>
#include <vector>
int main(void)
{
int n, q;
std::cin >> n;
std::cin >> q;
std::vector< std::set<int> > sets;
for (int i = 0; i < n; i++) {
std::set<int> set;
set.insert(i);
sets.push_back(set);
}
for (int i = 0;... | 0 | 16,460,349 |
#include<iostream>
#include<string>
#include<cmath>
#include<iomanip>
using namespace std;
int main(){
long double x1;
long double x2;
long double y1;
long double y2;
long double X, Y;
cin >> x1 >> y1 >> x2 >> y2;
X = -(x1 - x2);
Y = -(y1 - y2);
long double A = pow(X, 2);
long double B = pow(Y, 2);
long doub... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
long long int n, m, v1, v2;
cin >> n >> m;
long long int l[m], r[m];
for (long long int i = 0; i < m; i++)
{
cin >> l[i] >> r[i];
}
v1 = l[0];
v2 = r[0];
for (long long int i = 1; i < m; i++)
{
... | 0 | 55,819,781 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <utility>
#include <set>
#include <stack>
#include <climits>
#include <cmath>
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define rep1(i,n) for(int i=1, i##_len=(n); i<=i##_len; ++i)
... | #include<bits/stdc++.h>
int n,m;
std::vector<std::vector<std::pair<int,int>>> hen;
std::vector<std::vector<int>> seen;
void dijkstra(int start){
std::vector<int> past(n, n + 5);
std::vector<int> dist(n,1000000000);
using T = std::pair<int, int>;
std::priority_queue<T, std::vector<T>, std::greater<T>> ... | 0 | 2,412,809 |
#include<bits/stdc++.h>
typedef long long ll;
const int N= 1e5+5;
using namespace std;
int main()
{
int n,k;
cin>>n>>k;
if(k==1)
cout<<"0";
else cout<<n-k;
return 0;
} | #pragma GCC optimize(2)
#pragma GCC optimize(3)
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 2e5 + 10;
#define fi first
#define se second
#define pb push_back
#define wzh(x) cerr<<#x<<'='<<x<<endl;
LL a,b;
LL get(LL x,int y){
if(x<0)return 0;
LL z=(x+1)/(1ll<<y+1);
LL t=(x+1)%... | 0 | 36,312,015 |
#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>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Pld = pair<ld, ld>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecD = vector<ld>;
using VecS = vector<string>;
using Graph = vector<V... | 0 | 32,516,870 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <math.h>
#include <complex>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <bitset>
#include <functional>
#include <assert.h>
#define int long
#def... | #include <iostream>
#include <fstream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for(ll i=0; i<n; i++)
#define repr(i, s, e) for(ll i=s; i>=e; i--)
#define reps(i, s, e) for(ll i=s; i<=e; i++)
#define inf 1e18
#define all(v) v.begin(),v.end()
#define ceill(a, b) (a+b-1)/b
#def... | 0 | 51,123,945 |
#include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
#define ld long double
#define ll long long
#define mod 1000000007
#define IINF INT_MAX
#define INF 1LL << 30
int main() {
V<int> v(3);
for(int i = 0; i < 3; i++) cin >> v[i];
sort(ALL(v));
co... | #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 | 37,696,806 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include ... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<n;i++)
#define all(v) v.begin(),v.end()
#define P pair<int,int>
#define len(s) (int)s.size()
#define pb push_back
template<class T> inline bool chmin(T &a, T b){
if(a>b){a=b;return tr... | 0 | 26,825,064 |
#include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
templ... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5;
int arr[N];
int main() {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(0);
int n, k, cnt =0;
cin >> n >> k;
for(int i =0 ; i < n; ++i){
cin >> arr[i];
if(arr[i] >= k)
cnt++;
}
cout << cnt;
} | 0 | 10,599,642 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, k;
cin >> n >> k;
if (k == 1) cout << 0 << endl;
else cout << n - k << endl;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <set>
#include <queue>
#include <deque>
#include <map>
#include <stack>
#include<bitset>
#include<list>
#include<cassert>
#include<numeric>
using namespace std;
long long x, y;
int main()
{
cin >> x >> y;
if (x % y == 0)
{
cout <<... | 0 | 97,752,478 |
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define ll long long
#define vi vector<int>
#define pii pair<int,int>
#define F first
#define S second
#define pb push_back
#define forn(b) for(int i = 0; i < b; i++)
#define rforn(b) for(int i = b - 1 ;i >= 0; i--)
#define It(m) for(aut... | 0 | 87,095,841 |
#include <iostream>
#include <stdio.h>
#include <vector>
#include <algorithm>
#include <cmath>
#define rep(i,cc,n) for(int i=cc;i<=n;++i)
#define drep(i,cc,n) for(int i=cc;i>=n;--i)
typedef long long ll;
using namespace std;
int main(){
int a,b,c,d;
cin>>a>>b>>c>>d;
if(max(a,c)-min(a,c)<=d) cout<<"Yes"<<end... | #pragma GCC optimize("O3")
#define _CRT_SECURE_NO_WARNINGS
#define _CRT_DISABLE_PERFCRIT_LOCKS
#define POPCNTI(a) __builtin_popcount(a)
#define fs first
#define sc second
#include <bits/stdc++.h>
using namespace std;
#define error(args...) \
{ \
c... | 0 | 34,328,861 |
#include <iostream>
#include <string>
#include <set>
#include <regex>
using namespace std;
int main () {
char a, b;
cin >> a >> b;
cout << (a==b ? "H" : "D") << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define maxn 300005
#define fr(i,j,k) for(int i=j;i<k;i++)
#define f(n) fr(i,0,n)
#define f1(n) fr(i,1,n+1)
#define ms(i) memset(i,0,sizeof(i));
#define ms1(i) memset(i,-1,sizeof(i));
#define F first
#define S second
#define all(x) x... | 0 | 1,644,601 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;
const int maxn = 1e5 +100;
vector<int> G[maxn];
int sg[maxn];
void dfs(int x, int fa){
sg[x] = 0;
for(auto to : G[x]){
if(to == fa) continue;
dfs(to, x);
sg[x] ^= (sg[to]+1);
}
}
int main(... | #include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(int i=0;i<n;i++)
#define Rep(i,a,b) for(int i=a;i<b;i++)
#define REP(i,a,b) for(int i=a;i<=b;i++)
#define rev(i,n) for(int i=n-1;i>=0;i--)
#define vi vector<int>
#define vv vector<vi>
#define pb push_back
#define pi pair<int,int>
#define vp vector<pair<... | 0 | 27,030,047 |
#include<bits/stdc++.h>
using namespace std;
const int INF = 1e9;
int mtoi(char c){
if(c=='m'){
return 1000;
}
if(c=='c'){
return 100;
}
if(c=='x'){
return 10;
}
if(c=='i'){
return 1;
}
return 0;
}
int ctoi(char c){
if(!mtoi(c)){
return c-'0';
}
return 0;
}
int toi(string s){... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<int>a(N);
for (int i = 0; i < N; ++i) {
cin >> a[i];
}
ll ans = 0;
for (int i = 1; i < N; ++i) {
if(a[i] == a[i-1]) {
ans++;
i++;
}
}
... | 0 | 76,167,410 |
#include <iostream>
#include <string>
int main(){
int num1,num2;
char ch[1000][2],ch2[100000];
while(true){
std::cin>>num1;
if(num1==0)
break;
for(int i=0;i<num1;i++)
std::cin>>ch[i][0]>>ch[i][1];
std::cin>>num2;
std::string str(num2,'a');
for(int i=0;i<num2;i... | #include <bits/stdc++.h>
using namespace std;
#define MAX 2000005
#define VMAX 10005
int A[MAX],C[MAX],B[MAX];
int n;
void CountingSort(){
for(int i=0;i<n;++i){
C[A[i]]++;
}
for(int i=1;i<VMAX;++i){
C[i] = C[i]+C[i-1];
}
for(int i=n-1;i>=0;i--){
B[C[A[i]]] = A[i];
C[A... | 0 | 65,719,400 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
string s;
cin >> s;
bool ok = true;
sort(s.begin(), s.end());
if (s[0] != s[1]) ok = false;
if (s[1] == s[2]) ok = false;
if (s[2] != s[3]... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define fi first
#define se second
#define pb push_back
#define all(v) v.begin(),v.end()
#define repf(i,a,b) for(ll i=a;i<b;i++)
#define repb(i,a,b) for(ll i=a;i>=b;i--)
#def... | 0 | 83,241,333 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.