code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <bits/stdc++.h>
#define debug(x) cerr << #x << ": " << x << endl
#define debugArray(x, n) \
for(long long hoge = 0; (hoge) < (n); ++(hoge)) \
cerr << #x << "[" << hoge << "]: " << x[hoge] << endl
using namespace std;
using... | #include <iostream>
#include <cctype>
int main()
{
char ch;
int alphabet[26] = {0};
while (std::cin >> ch) {
if (isupper(ch)) {
alphabet[ch - 'A']++;
} else if (islower(ch)) {
alphabet[ch - 'a']++;
}
}
for (int i = 0; i < 26; i++) {
std::cout <... | 0 | 24,444,275 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
int a, b, c;
cin >> a >> b >> c;
cout << max({a, b, c}) - min({a, b, c});
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int N,Y;
cin >> N >> Y;
int a10000 = -1, b5000 = -1, c1000 = -1;
for(int a = 0; a <= N; a++){
for(int b = 0; a + b <= N; b++){
int c = N - a - b;
int total = 10000*a + 5000*b + 1000*c;
if(Y == total){
... | 0 | 95,179,894 |
#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... | #include <iostream>
using namespace std;
#define ll long long int
ll max(ll a, ll b){
if(a > b) return a;
return b;
}
ll min(ll a, ll b){
if(a < b) return a;
return b;
}
ll Solve(int N, int R, int S, ll* H, ll* Kai){
ll ret = LLONG_MAX>>2;
if(R <= 0){
ret = 0;
}else if(S == 1){
ret = H[R];
}else... | 0 | 14,481,216 |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using Pair = pair<int32_t, int32_t>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string A, B;
cin >> A >> B;
enum class Comparison : int32_t { kEquals = 0, kGreater, kLess };
Comparison result;
if (A.length() > B.length()) {
r... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
#define Rep(i,n) for(int i = 1; i <= n; i++)
#define sz(x) int(x.size())
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define YesorNo(a) printf(a ? "Yes\n" : "No\n")
#define endl '\n'
#define fi first
#def... | 0 | 85,735,390 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<ll,ll> P;
const ll MOD = 1e9;
int main(){
ll n;
cin>>n;
if(n==1){
cout<<"Yes"<<endl;
cout<<2<<endl;
cout<<1<<" "<<1<<endl;
cout<<1<<" "<<1<<endl;
return 0;
}
ll f=0;
ll k;
for(int i=0;i<n;i++){
if(i*(i+1)==n*2){
f=1;
... | #include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <cmath>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <iostream>
#include <random>
#include <map>
#include <iomanip>
#include <stdlib.h>
#inclu... | 0 | 4,424,495 |
#include <iostream>
#include <string>
#include <cstdlib>
#include <cstdio>
#include <cstring>
using namespace std;
#define ref goto refrain
int main(){
char str[256];
refrain:
cin>>str;
if(str[0]=='-') return 0;
int a=strlen(str);
int m;
cin>>m;
int b,c;
for(int i=0;i<m;i++){
cin>>b;
char temp[b];
for(in... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, pii> pipii;
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 eb emplace_back
char s[105];
ll... | 0 | 18,288,015 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
vector<vector<string>> S(H, vector<string>(W));
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
cin >> S[i][j];
}
}
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
if (S[i][j] ... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using ll=long long;
using vi=vector<int>;
using vll=vector<ll>;
#define MOD 1e9+7
int main(){
int n,k;
cin >> n >> k;
vll p(n);
vll c(n);
for(int i=0;i<n;i++){
cin >> p[i];
p[i]--;
}
for(int... | 0 | 91,091,028 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <iomanip>
using namespace std;
int main(){
std::ios::sync_with_stdio(false);
int N;
long long L, T;
while(cin >> N >> L >> T){
L *= 2;
T *= 2;
vector<pair<long long, int>> X(N);
for(auto& p : X){
cin >> p.first >> p.second;
p.first *=... | #include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<double, double> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() ret... | 0 | 38,900,637 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define pcnt(bit) __builtin_popcountll(b... | #include <bits/stdc++.h>
using namespace std;
#define MX 100050
int x[MX];
int f[18][MX];
int main() {
int n, L, q;
scanf("%d", &n);
for(int i = 0; i < n; i++) scanf("%d", x + i);
scanf("%d%d", &L, &q);
for(int i = 0; i < n; i++) {
int p = upper_bound(x, x + n, x[i] + L) - x; p--;
f[0][i] = p;
}
for(int i = ... | 0 | 97,598,980 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using ll = long long... | #include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
const int maxn = 100005;
#define NIL -1
struct node{
int parent;
int left;
int right;
};
node T[maxn];
int D[maxn], n;
void rec(int node, int depth){
D[node] = depth;
if(T[node].left != NIL)
rec(T[node].left, dep... | 0 | 74,659,777 |
#include <bits/stdc++.h>
using namespace std;
#define range(i, l, r) for (int i = (int)(l); i < (int)(r); (i) += 1)
#define rrange(i, l, r) for (int i = (int)(r) - 1; i >= (int)(l); (i) -= 1)
#define whole(f, x, ...) ([&](decltype((x)) container) { return (f)( begin(container), end(container), ## __VA_ARGS__); })(x... | #include <bits/stdc++.h>
using namespace std;
using str = string;
using ss = stringstream;
int main()
{
cin.tie(0);
ios::sync_with_stdio(0);
str s,t;cin>>s>>t;
sort(s.begin(),s.end());
sort(t.begin(),t.end(),greater<char>());
int ans=2;
int i=0;
for(;i<min(s.size(),t.size());i++)
{
... | 0 | 39,098,730 |
#include<stdio.h>
#include<vector>
#include<algorithm>
using namespace std;
typedef long long ll;
int main()
{
int a, b, x, y;
scanf("%d%d%d%d", &a, &b, &x, &y);
printf("%lf %d\n", double(a)*double(b) / 2, x + x == a
&&y + y == b);
} | #include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define NO cout<<"NO"<<endl
#define YES cout<<"YES"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define all(... | 0 | 81,003,099 |
#include "bits/stdc++.h"
using namespace std;
int main() {
long long M, K;
cin >> M >> K;
long long lim = ((long long)1) << M;
if (K>= lim) {
cout << -1 << endl;
return 0;
}
if (0 == M) {
if (0 == K) {
cout <<"0 0"<<endl;
}
else {
cout << -1 << endl;
}
return 0;
}
if (1== M) {
if (0 == K... | #include <stdio.h>
#include <string.h>
int main(int argc, const char * argv[]) {
char str[1000][33]={};
int strId[1000]={};
char strTmp[33]={};
int i, j, l = 0;
int mt=0;
int cm=0;
int mm=0;
char ch;
for(i=0;i<1000;i++){
scanf("%c", &ch);
if(ch==' '||ch=='\n'){
... | 0 | 8,211,969 |
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for(int i=0;i<n;++i)
... | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define REP(a,b) for(int a=0;a<(b);++a)
#define REP1(i,n) for(int i=1;i<=(n);++i)
#define debug(x) cerr<<#x<<": "<<x<<'\n'
#define all(x) (x).begin(),(x).end()
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define isYES(x) printf("... | 0 | 42,285,450 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
ll N,L;
ll A[100000];
int main(){
cin >> N >> L;
for(int i=0;i<N;i++) cin >> A[i];
ll ind = -1;
for(int i=0;i<N-1;i++){
if(A[i] + A[i+1] >= L) ind = i+1;
}
if(ind < 0){
cout << "Impossible"... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i<(int)(n); i++)
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n+1), b(n);
ll count = 0;
rep(i,n+1) {
cin >> a[i];
count += a[i];
}
rep(i,n) cin >> b[i];
rep(i,n) {
i... | 0 | 19,135,090 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
ll add(ll n,ll a){
return -a*(a+1)*(2*a+1)/6+a*(a+1)*(n+1)/2+a;
}
int main(){
ll n,k;
cin >> n >> k;
ll ans =0;
ans+= add(n,n+1);
ans-= add(n,k-1);
cout << ans%1000000007;
return 0;
} | #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<n; i++)
#define loop(i, j, n) for(ll i=j; i<n; i++)
#define all(x) (x).begin(), (x).end()
#define UNIQUE(v) v.erase(unique(all(v)), v.end());
#define Sp(p) cout<<se... | 0 | 17,072,583 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); i++)
const long double EPS = 1e-10;
const long long INF = 1e18;
const long double PI = acos(-1.0L);
int main() {
ll A, B;
cin >> A >> B;
cout << A ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=2e5+10;
ll a[maxn];
ll f[maxn][35];
int main(){
int n,step,q,i,j,p;
scanf("%d",&n);
for (i=0;i<n;i++) scanf("%lld",&a[i]);
scanf("%d%d",&step,&q);
for (i=0;i<n;i++) {
p=upper_bound(a,a+n,a[i]+step)-a;
... | 0 | 10,965,264 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
vector<pair<ll,int>> soinsuu_bunkai(ll N){
vector<pair<ll,int>> res;
ll t = N;
for(ll i=2;i*i<=N;i++){
if(t == 1) break;
if(t % i == 0){
ll prime = i;
int cnt = 0;
while(t % i == 0){
... | #include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
using namespace std;
typedef long long LL;
const int SIZEN = 500;
LL f[SIZEN][SIZEN];
int N,K;
LL H[SIZEN];
int main(){
scanf("%d%d",&N,&K);
for(int i = 1;i <= N;i++)scanf("%d",&H[i]);
memset(f,0x3f,size... | 0 | 96,413,296 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rrep(i,n) for(int i=(int)(n-1);i>=0;i--)
#define FOR(i,n,m) for(int i=n;i<=(int)(m);i++)
#define RFOR(i,n,m) for(int i=(int)(n);i>=m;i--)
#define all(x) (x).begin(),(x).end()
#define sz(x) int(x.size())
typedef long long ll;
const int INF = 1... | #include <bits/stdc++.h>
#define rep2(x,fr,to) for(int (x)=(fr);(x)<(to);(x)++)
#define rep(x,to) for(int (x)=0;(x)<(to);(x)++)
#define repr(x,fr,to) for(int (x)=(fr);(x)>=(to);(x)--)
#define all(c) (c).begin(),(c).end()
#define sz(v) (int)(v).size()
using namespace std;
typedef long long ll; typedef vector<int> VI; ty... | 0 | 4,954,688 |
#include <iostream>
#include <string>
#include <cstring>
#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>
#incl... | #include <cstdio>
#include <iostream>
using namespace std;
static const int MAX_NUM = 10001;
int FindRoot(int elem[], int target)
{
int parent;
parent = target;
for (;;) {
if (parent == elem[parent]) {
break;
}
else {
parent = elem[parent];
}
}
... | 0 | 16,824,446 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
const int m=1000000007;
int main(){
int n;
cin >> n;
vi a(n);
rep(i,n){
char x;
cin >> x;
a[i]=x-'a';
}
sort(... | #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()... | 0 | 40,083,406 |
#include <iostream>
#include <string>
using namespace std;
int main()
{
string s;
int arr[26] = {0};
while (getline(cin, s))
{
for (int i = 0; i < s.length(); i++)
{
if(65 <= s[i] && s[i] <= 90)
arr[s[i] - 65]++;
else if(97 <= s[i] && s[i] <= 122)
arr[s[i] - 97]++;
}
}
for (int i = 0; i < 26; ... | #include <bits/stdc++.h>
#define rep0(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i <= (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef tuple<string, int, int> TU;
typedef tuple<int, int, int> TI;
int main()
{
int a,b,c,d,e;
cin >> a >> b >> c >> ... | 0 | 41,368,380 |
#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++)
int main(){
int n;
cin >> n;
string s;
cin >> s;
int now = 0;
int left = 0;
int right = 0;
for (int ... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP0(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define RREP0(i, n) for (int i = (n)-1; i >= 0; --i)
#define REP1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define RREP1(i, n) for (int i ... | 0 | 89,162,011 |
#pragma GCC target("avx2")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define LLINF 2000000000000000000ll
#define fi first... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;
int main(){
int N,... | 0 | 75,144,642 |
#include <bits/stdc++.h>
#if DEBUG
template <typename T>
void debug(T value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) \
do { \... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, m, n) for(int(i) = (int)(m); i < (int)(n); ++i)
#define rep2(i, m, n) for(int(i) = (int)(n)-1; i >= (int)(m); --i)
#define REP(i, n) rep(i, 0, n)
#define REP2(i, n) rep2(i, 0, n)
#define all(hoge) (hoge).begin(), (hoge).end()
#define en '\n'
using ll = long l... | 0 | 69,814,071 |
#include <iostream>
#include <string>
using namespace std;
string chars[] = {
"",
".,!? ",
"abc",
"def",
"ghi",
"jkl",
"mno",
"pqrs",
"tuv",
"wxyz",
};
int main() {
int nnn;
cin >> nnn;
for (int iii = 0; iii < nnn; ++iii) {
string input;
cin >> input;
int prev = 0, cnt = 0;
for... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll=long long;
using vi = vector<int>;
using Graph = vector<vi>;
using P = pair<int,int>;
const int MOD=(int)1e9+7;
const int INF=(int)1e9;
const ll LINF=(ll)1e18;
ll fnc(bitset<15> bit,vi a,int n,int k){
ll res ... | 0 | 51,850,898 |
#include<bits/stdc++.h>
#define test ll t; cin>>t; while(t--)
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define mod 1000000007
#define ll long long
#define int long long
#define ull unsigned long long
#define MAX 1000005
#define pb push_back
#define mkp make_pair
#define vi vector<int>
#define... | #include<bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; i++)
#define repo(i, n) for(int i=1; i<=n; i++)
#define INF 1001001001
#define INFll 100100100100100
#define PrintVec(x) for (auto elementPrintVec: x) { cout << elementPrintVec << " "; } cout << endl;
using namespace std;
using ull = unsigned long long;
using ... | 0 | 88,594,145 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int a, b, c, r;
string ans = "No";
cin >> a >> b >> c >> r;
if(abs(a-c)<=r || (abs(b-c)<=r && abs(a-b)<=r)) ans = "Yes";
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb emplace_back
typedef pair<int,int> pi;
int h, w, ans, dist[1005][1005], dx[4] = {0, 0, 1, -1}, dy[4] = {1, -1, 0, 0};
char grid[1005][1005];
queue<pi> q;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> h >> w;
memset(dist,... | 0 | 67,239,877 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vin=vector<int>;
using vll=vector<long long>;
using vvin=vector<vector<int>>;
using vvll=vector<vector<long long>>;
using vstr=vector<string>;
using vvstr=vector<vector<string>>;
using vch=vector<char>;
using vvch=vector<vector<char>>;
using vbo=ve... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll n,m;
cin >> n >> m;
vector<pair<ll,ll>> array(n);
for(int i=0;i<n;i++){
cin >> array.at(i).first >> array.at(i).second;
}
sort(array.begin(),array.end());
ll money = 0;
for(int i=0;i<n;i++){
... | 0 | 5,677,792 |
#include <iostream>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <cstring>
#include <climits>
using namespace std;
#define ll long long
#define FOR(i,n) for(int i=0;i<n;i++)
#define sz... | #include <bits/stdc++.h>
#include <limits>
#include <math.h>
#include <cmath>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int> ;
using vi = vector<int> ;
using vvi = vector<vector<int>> ;
using vll = vector<long long>;
using vvll = vector<vector<long long >>;
#define... | 0 | 75,119,653 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i=0; i<n; i++)
#define rep2(i, s, n) for (int i=s; i<n; i++)
int main() {
int a,b;
cin >> a >> b;
int cnt = 0;
rep2(i, a, b+1) {
string wk = to_string(i);
if (wk[0]==wk[4] && wk[1]==wk[3]) {
cnt++;
}
}
cout << cnt << e... | #include <bits/stdc++.h>
using namespace std;
int main() {
int K;
cin >> K;
int A, B;
cin >> A >> B;
if (B - A + 1 >= K) {
cout << "OK" << endl;
}
else {
for (int i = A; i <= B; i++) {
if (i % K == 0) {
cout << "OK" << endl;
break;
}
if (i == B) {
cout << ... | 0 | 78,335,631 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 1e16+7;
int mod = 1e9+7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
signed main() {
int X;
cin >> X;
cout << 10-X/200 << endl;
} | #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 | 10,569,507 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
std::vector<ll> vec(100010);
int n;
cin >> n;
for (int i = 0; i < n; i++) cin >> vec.at(i);
int zero = 0;
for (int i = 0; i < n; i++) if (vec.at(i) == 0) zero++;
if (zero > 0) {
cout << 0 << endl;
return 0;
}
ll p... | #include<iostream>
#include<string>
#include<algorithm>
#include<math.h>
#include<queue>
#include<vector>
#include<map>
#include<cstdlib>
using namespace std;
int n,k,R,S,P;
int arr[100001];
int rock = 1,scissor = 2, paper = 3;
int ans=0;
string s;
int main(){
cin >> n >> k;
cin >> R >> S >> P ;
cin >> s;
... | 0 | 61,893,482 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using vst=vector<string>;
using P = ... | #include <map>
#include <set>
#include <list>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <numeric>
#include <utility>
#include <iostream>
#include <algorith... | 0 | 10,391,621 |
#pragma GCC optimize(2)
#include<bits/stdc++.h>
#define ll long long
#define maxn 1000005
#define inf 1e9
#define eps 1e-10
using namespace std;
char s[maxn];
const ll mod=1000000007;
ll dp[maxn][2];
int main()
{
scanf("%s",s+1); ll len=strlen(s+1),p=1,cnt=0,ans=0,a1=0;
for(int i=1;i<=len;i++) if(s[i]=='1') cnt++;
d... | #pragma region header
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb p... | 0 | 24,393,274 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define pb push_back
#define INF 9223372036854775807
#define endl '\n'
#define pii pair<ll int,ll int>
#define vi vector<ll int>
#define all(a... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
void solve() {
... | 0 | 28,012,818 |
#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<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<un... | 0 | 98,905,712 |
#include <bits/stdc++.h>
int main(){
int A, B;
std::cin >> A >> B;
std::cout << 100 << " " << 100 << std::endl;
std::vector< std::string > out(100);
for(int i=0; i<50; i++){
std::string out_1line(100, '.');
if(i % 2 == 0){
int index = 0;
while(B != 1 && index ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int n,m;
int main(void)
{
scanf("%d%d",&n,&m);
if(n%2==1)
{
for(ll i=1;i<=m;i++)
{
printf("%lld %lld\n",i,n-i+1);
}
}
else
{
ll cnt=0;
for(ll i=1;i<=n/2/2;i++)
{
cnt++;
printf("%lld %lld\n",i,n/2-i+1);
if(cnt==m) return 0;
... | 0 | 31,278,792 |
#include <iostream>
#include <algorithm>
#include <tuple>
#include <vector>
#include <string>
using namespace std;
int h, w;
vector<vector<char>> s;
vector<vector<int>> score;
int main(int argc, char const *argv[])
{
cin >> h >> w;
s = vector<vector<char>>(h, vector<char>(w));
score = vector<vector<int>>(h,... | #include<iostream>
#include<queue>
using namespace std;
static const int N=100;
static const int INFTY=2000000000;
int n,M[N+1][N+1];
int d[N+1];
void bfs(int s){
queue<int> q;
q.push(s);
for(int i=1;i<=n;i++)d[i]=INFTY;
d[s]=0;
int u;
while(!q.empty()){
u=q.front();
q.pop();
... | 0 | 70,034,788 |
#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... | #include <iostream>
using namespace std;
int main(){
int H, N;
cin >> H >> N;
int A[N], B[N], cost[N];
for (int i = 0; i < N; i++){
cin >> A[i] >> B[i];
}
long long dp[N+1][H+1];
for (int i = 0; i <= N; i++){
for (int j = 0; j <= H; j++){
dp[i][j] = 1000000000000000000;
}
}
dp[0][0] ... | 0 | 56,191,163 |
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define lld long double
#define w(x) ll x;cin>>x;while(x--)
#define mod 1000000007
#define speed ios_base::sync_with_stdio(false);cin.tie(0);
using namespace std;
int main(){
speed;
ll n; cin>>n;
vector<ll> a(n); for(auto &i:a)... | #include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } re... | 0 | 2,164,078 |
#include <bits/stdc++.h>
using namespace std;
#define forn(i, s, f) for (int i = (int)s; i < (int)f; i++)
#define ll long long
#define ull unsigned long long
#define ld long double
#define pii pair <int, int>
#define fs first
#define sc second
#define pf push_front
#define pb push_back
#define pop_f pop_front
#define p... | #if __has_include("debug.h")
#include "debug.h"
#else
#include <bits/stdc++.h>
using namespace std;
#define d(...) 2;
#endif
#define int long long int
#define ld long double
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl "\n"
#define all(c) (c).begin(),(c).end()
#define rall(... | 0 | 36,386,715 |
#include <iostream>
#define N_MAX 200000
using namespace std;
int main(){
int N;
int diff_max = 0;
int min_b = 1000000001;
int diff_max_index;
long sum = 0;
int A[N_MAX], B[N_MAX];
cin >> N;
for(int i = 0; i < N; i++){
cin >> A[i] >> B[i];
sum += A[i];
}
for(int i... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n) ; i++)
constexpr auto INF = 2147483647;
typedef long long ll;
int main(){
int n,k;
cin >> n >> k;
ll height[15],maxHeightPre[15], tmp_height;
ll min_cost, tmp_cost;
maxHeightPre[0] = 0;
rep(i,n){
cin >> height[i];
i... | 0 | 2,710,034 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int,int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<pii> ... | #include <cstdio>
#include<iostream>
#include<map>
#include<algorithm>
#include<vector>
#include <cmath>
#include <iomanip>
#include <regex>
#include <bits/stdc++.h>
#include <string>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
using plong = pair<long,long>;
bool cmp(plong a,plong b){
if(... | 0 | 29,771,939 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const double PI = 3.14159265358979323846;
int main() {
int n,k;
cin >> n >> k;
if(n % k != 0) cout << 1 << endl;
else cout << 0 << 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>
#include <cctype>
#in... | 0 | 95,962,257 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long LL;
typedef long double ld;
typedef vector<ll>VI;
typedef pair<ll,ll>P;
#define VV(T) vector<vector<T>>
#define sz(x) int(x.size())
#define PI 3.1415926535897932384626433832795
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
... | #include <iostream>
using namespace std;
int main()
{
int n, k[102], v[101][102] = {0}, i, j, l, a;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a;
cin >> k[i];
for (j = 0; j < k[i]; j++) {
cin >> v[i][j + 1];
}
}
for (i = 0; i < n; i++) {
for (j = 0; j < n + 1; j++) {
if (k[i] =... | 0 | 54,498,751 |
#include <bits/stdc++.h>
using namespace std;
using P= pair<int,int>;
int main(){
int n; cin>>n;
int num[n];
for(int i=0;i<n;i++){
cin>>num[i];
}
sort(num,num+n);
vector<P> ans;
int max=num[n-1],min=num[0];
for(int i=1;i<n-1;i++){
if(num[i]<0){
ans.push_back(P(max,num[i]));
max-=num[... | #include <bits/stdc++.h>
#define FOR(i, a, n) for(ll i = (ll)a; i < (ll)n; i++)
#define rep(i, n) FOR(i, 0, n)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
constexpr int Mod = 998244353;
constexpr int mod = 1e9 + 7;
constexpr ll inf = 1LL << 60;
template <typename T> constexpr bool c... | 0 | 68,633,890 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll MOD=1000000007;
int main() {
int a,b,c,d;
cin >> a >> b >> c >> d;
if(abs(c-a)<=d||(abs(b-a)<=d&&abs(b-c)<=d))
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include<iostream>
#include<string.h>
using namespace std;
int main(){
int i,len;
char str[20];
cin >> str;
len = strlen(str);
for(i = len-1; i >= 0; i--)
cout << str[i];
cout << endl;
return 0;
} | 0 | 71,860,078 |
#include<bits/stdc++.h>
using namespace std;
int i,j,n,m,k,l,b;
double x,c;
char u[3];
int main()
{
for(cin>>n;i<n;i++){
cin>>x>>u;
if(strcmp(u,"BTC")==0)x*=380000;
c+=x;
}
printf("%.5f",c);
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
const long long MOD = 1000000007;
int main() {
ll N,M;
cin >> N >> M;
vector<ll> a(N+5,0);
for(int i=0;i<M;i++){
ll b;
cin >> b;
a[b] =1;
}
ll dp[N+5] = {};
dp[0] = 1;
for(int i=0;i<N;i++){
... | 0 | 65,563,938 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
using namespace std;
int main() {
int a, b, x;
cin >> a >> b >> x;
if (x >= a && x < a + b)
cout << "YES" << "\n";
else
cout << "NO" << "\n";
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
int main() {
int N;
cin >> N;
vector<ll> A(N);
rep(i, N) cin >> A[i];
sort(all(A));
vector<ll> use;
vector<ll> tmp;
rep(i, N) {
... | 0 | 78,590,781 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e9 + 7;
ll gcd(ll a, ll b) {
if (b == 0) {
return a;
} else {
return gcd(b, a % b);
}
}
int main() {
ll n, x;
cin >> n >> x;
vector<ll> a;
ll r = 0;
for (int i = 0; i < n; i++) {
ll v;
cin >> v;
r = gcd(r... | #include <bits/stdc++.h>
#include <string>
#include <cstring>
#include <algorithm>
#include <math.h>
#include <map>
#include <bitset>
#include <cmath>
#include <set>
#include <utility>
#include <sstream>
#define INF 1000000000000
#define MOD 1000000007
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll... | 0 | 31,215,002 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; i++)
#define rep1(i, n) for(int i=1; i<=n; i++)
#define repr(i, n) for(int i=n-1; i>=0; i--)
#define repr1(i, n) for(int i=n; i>=1; i--)
#define all(v) v.begin(),v.end()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<in... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0; i<(n); i++)
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
#define sz(x) ((int)(x).size())
using ll=long long;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define MOD 998244353
const ll INF=1... | 0 | 7,794,784 |
#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) {
... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#includ... | 0 | 76,928,261 |
#pragma GCC optimize("O3", "unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
using pii = pair<int, int>;
template<typename T>
using prior = priority_queue<T, vector<T>, greater<T>>;
template<typename T>
using Prior = priority_queue<T>;
#define X first
#define... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=int(a);i<int(b);i++)
typedef long long ll;
int main(){
ll h,w,a,b;cin>>h>>w>>a>>b;
a--;b--;
rep(i,0,h){
rep(j,0,w){
if(i<=b){
if(j<=a)cout<<0;
else cout<<1;
}
else{
... | 0 | 33,339,974 |
#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>;
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 < b) { a = b; return true; } ret... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#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>
const int maxn = 1e5+10;
const int mod = 1e9+7;
using namespace s... | 0 | 19,016,770 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
int32_t main()
{
int a;int b;cin>>a>>b;
double ans=a*1.0/b;
cout<<fixed<<setprecision(10)<<ans<<endl;
} | #include "bits/stdc++.h"
#include <numeric>
#define rep(i,n) for(ll i = 0; i < n; i++)
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
#define llMAX numeric_limits<long long>::max()
#define intMAX numeric_limits<int>::max()
#define llMIN numeric_limits<long long>::min()
#define intMIN numeric... | 0 | 54,083,627 |
#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>
#include <bitset>
#include <ra... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define P pair<int,int>
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1000000000
#define MOD 1000000007
#define all(v) v.begin(),v.end()
int dx[]={0,1,0,-1},dy[]={1,0,-1,0};
int kaijo[222222];
struct edge{int to,c... | 0 | 73,273,876 |
#include <bits/stdc++.h>
using namespace std;
#define fast \
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define int long long
#define ll long long
#define f(i, n) for (int i = 0; i < n; i++)
#define ff(i, n) for (int i = 1; i <= n; i++)
#define... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main()
{
int n;
string s, tmp1, tmp2;
cin >> s;
tmp1=s;
tmp2=s;
reverse(tmp1.begin(), tmp1.end());
if (s.compare(tmp1) != 0)
{
cout << "No" << endl;
retur... | 0 | 41,190,299 |
#include <bits/stdc++.h>
using namespace std;
#ifdef ENABLE_DEBUG_OUTPUT
#define DEBUG_LOG(s) cout << s << endl;
#else
#define DEBUG_LOG(s) void();
#endif
int main(){
string s;
cin >> s;
for (auto i = ((int)s.size() - 1) / 2; i > 0; i--) {
if(s.substr(0, i) == s.substr(i, i)) {
cout << 2... | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
using ll = long long;
using ld = long double;
const int MOD = 1e9 + 7;
using Graph = V<V<int>>;
Graph g;
V<bool> seen;
int n, m;
int ans = 0, cnt = 0;
void dfs(int v) {
seen[v] = true;
cnt++;
if(c... | 0 | 90,997,910 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,v... | #include<iostream>
#include<vector>
#include<algorithm>
#include<utility>
#include<string>
#include<cmath>
#include<cstring>
#include<queue>
#include<map>
#include<climits>
#include<set>
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)... | 0 | 2,600,915 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N, K, Max, Min, Dif;
cin >> N >> K;
Max = (N/K) + (N%K);
Min = (N/K);
Dif = Max - Min;
cout << Dif << endl;
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INFLL LLONG_MAX
#define EPS 1e-9
#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 all(v) v.begin(), v.end()
#define endl "\n"
#define vi vector<ll>
#defi... | 0 | 80,216,632 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
using namespace std;
using ll = int64_t;
using vi = vector<int>;
using vvi = vector<vi>;
int main() {
int x;
int y;
cin >> x >> y;
if(x%y == 0) {
cout << -1 << endl;
} else {
cout << x << endl;
}
} | #include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <vector>
#include <iomanip>
#include <sstream>
#include <bitset>
#include <unordered_map>
#define ALL(x) (x).begin(), (x).end()
#define sz(a) int(a.size... | 0 | 88,398,570 |
#include "bits/stdc++.h"
using namespace std;
#define rep(i, j) for(int i = 0; i < (j); i++)
int main() {
while(true) {
int N, M; cin >> N >> M;
if(N == 0) break;
vector<pair<int, int>> PD(N);
rep(i, N) cin >> PD[i].second >> PD[i].first;
sort(begin(PD), end(PD));
... | #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--)
int main()
{
cin.tie(0);
ios_ba... | 0 | 89,718,373 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
constexpr int INFI = 1145141919;
int main(){
std::cin.tie(0);
std::ios::sync_with_stdio(false);
std::vector<int> a;
int s;
std::cin >> s;
a.push_back(s);
for(int i=0; i<1000000; i++){
a.push_ba... | #include <iostream>
#include <vector>
using namespace std;
bool f1[4123][32123],f2[4123][32123];
int b=16000;
vector<int> ex,ey;
int main(){
string s;
int cur=1,ls=0;
int nx=0,ny=0;
int x,y;
cin>>s>>x>>y;
for(int i=0;i<s.size();++i){
if(s[i]=='T'){
if(ls>0){
i... | 0 | 81,542,503 |
#include <bits/stdc++.h>
#include<cmath>
#define N 100005
#define A 1000005
#define MOD 1000000007
#define inf 1000000000000000000
#define ll long long
using namespace std;
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n;... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
const int INF=1e9+7;
const ll LINF=9223372036854775807;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld EPS = 1e-10;
int ii() { int x; if (scanf("%d", &x)==1) return x; el... | 0 | 49,147,732 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,M;
cin >> N;
vector<string>s(N);
vector<string>t(M);
for (int i = 0; i < N; i++) {
cin >> s.at(i);
}
cin >> M;
for (int i = 0; i < M; i++) {
cin >> t.at(i);
}
vector<int>count(N,0);
for (int i = 0; i < N; i++) {
for (int ... | #include<bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; i++)
#define repo(i, n) for(int i=1; i<=n; i++)
#define INF 1001001001
#define INFll 100100100100100
#define PrintVec(x) for (auto elementPrintVec: x) { cout << elementPrintVec << " "; } cout << endl;
using namespace std;
using ull = unsigned long long;
using ... | 0 | 87,653,791 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <set>
#include <string>
#include <queue>
#include <algorithm>
#include <map>
#include <cmath>
#include <numeric>
#include <list>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <tuple>
#define rep(i, n) for (int i = 0; i... | #include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <string>
#include <bitset>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n) - 1; i >= 0; i--)
#define... | 0 | 30,038,306 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string a, b; cin >> a; cin >> b;
int res = 0;
if(a.size()>b.size())
res = 1;
if(a.size()<b.size())
res = -1;
if(a.size() == b.size()){
for(int i=0; i<a.size(); i++){
if(a.at(i)>b.at(i)){
res... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
ll n,y;
... | 0 | 88,426,181 |
#include <bits/stdc++.h>
using namespace std;
template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl
using ll = long long;
const ll mod = 1e9+7;
const int maxn = 1e6 + 5;
int n, m;
vector<int> g[maxn];
int main() {
ios_base::sync_with_stdio(false); ... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n, m;
cin >> n >> m;
int v[n];
vector<int> a[n];
for (int i = 0; i < n; i++)
cin >> v[i];
while (m--)
{
int u, v;
cin >> u >> v;
a[u - 1].push_back(v - 1);
a[v - 1].push_back(u - 1);
}
... | 0 | 1,143,536 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
#include <fstream>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(fals... | #include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<vector>
#include<utility>
#include<queue>
#include<deque>
#include<stack>
#include<set>
#include<map>
#include<bitset>
#include<string>
#define MOD 1000000007
typedef long long ll;
using namespace std;
template<typename A, size_t N, typena... | 0 | 97,826,843 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
vector<ll> a;
ll n,allxor=0;
cin>>n;
for(int i=0;i<n;i++){
ll num;
cin>>num;
a.push_back(num);
allxor^=num;
}
for(int i=0;i<n;i++) a[i]&=(~allxor);
ll rnk=0;
for(int i=59;i>=0;i--){
int id=rnk;
for(;id... | #include <iostream>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <set>
#include <algorithm>
#include <string>
#include <math.h>
#include <limits.h>
#include <stack>
#include <complex>
#include <stdlib.h>
#include <stdio.h>
#include <functional>
#include <cfloat>
#include <math.h>
... | 0 | 81,280,155 |
#include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
int main() {
int n;
while (cin >> n, n) {
int sum = 0;
int Max = 0, Min = 1000;
rep(i, n) {
int s; cin >> s;
Max = max(Max, s);
Min = min(Min, s);
sum += s;
}
cout << (sum - Max - Min) / (n - 2) << endl;
}
} | #include "bits/stdc++.h"
using namespace std;
#define rep(i,n)for(int i=0;i<(int)(n);i++)
int main() {
int a,n;
int i;
int sum=0;
cin >> a;
n = a;
for (i = 100000000; i > 0; i /= 10)
{
sum += n / i;
n -= n / i * i;
}
if (a % sum == 0)
{
cout << "Yes" << endl;
}
else
{
cout << "No" << endl;
}
} | 0 | 76,203,724 |
#include <bits/stdc++.h>
#define rep(i,x,n) for(int i=x; i<(int)(n); i++)
#define rep_eq(i,x,n) for(int i=x; i<=(int)(n); i++)
using namespace std;
using ll=long long;
int main() {
int a; cin >>a;
bool ans=true;
rep(i,1,3) {
int b; cin >>b;
if (a!=b) {
ans=false;
break;
}
}
cout <<(ans... | #include<bits/stdc++.h>
using namespace std;
int main() {
int N; cin >> N;
vector<string> S(N);
for (int i = 0; i < N; i++) cin >> S[i];
int res = 0;
for (int i = 0; i < N; i++) {
bool f = true;
for (int r = 0; r < N; r++) {
for (int c = 0; c < N; c++) {
int R = (i + r) % N;
int ... | 0 | 94,651,025 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long t,n;
cin>>n>>t;
vector<int>v(t);
long long cnt=0;
for(int i=0;i<t;i++)
{
cin>>v[i];
cnt+=v[i];
}
if(cnt>=n)cout<<"Yes"<<endl;
else cout<<"No"<<endl;
return 0;
} | #include <iostream>
#include <string>
#include <math.h>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < n; i++)
int main(){
ll N, C, K;
cin >> N >> C >> K;
vector<ll> T(N);
rep(i, N) cin >> T[i];
sor... | 0 | 54,657,355 |
#include <iostream>
using namespace std;
#define Nil -1;
struct Node { int parent, left, right; };
int getDepth(Node* T,int u) {
int d = 0;
while(T[u].parent != -1){
u = T[u].parent;
d++;
}
return d;
}
void setDepth(Node* T,int u, int p,int* D) {
D[u] = p;
if (T[u].right != -1)
setDepth(T, T[u].right, p,D);... | #include <bits/stdc++.h>
#define maxn 200010
using namespace std;
int n,a[maxn],s[maxn],m;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
cin>>n>>m;
for (int i=1;i<=n;i++) cin>>a[i];
while (m--) {
bool change = true;
for (int i=1;i<=n;i++) s[i]=0;
for (int i=1;i<=n;i++) {... | 0 | 35,460,236 |
#include <bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define lli long long int
#define tc int t;cin>>t;while(t--)
#define all(x) x.begin(),x.end()
#define f first
#define s second
#define pb push_back
#define vi vector<int>
#define vll vector<lli>
#d... | #include <bits/stdc++.h>
using namespace std;
int main() {
int X,A,B;
cin >> X >> A >> B;
if(A>=B){
cout << "delicious";
}else{
int after = B-A;
if(after <= X){
cout << "safe";
}else{
cout << "dangerous";
}
}
return 0;
} | 0 | 64,386,228 |
#include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INFLL LLONG_MAX
#define EPS 1e-9
#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 all(v) v.begin(), v.end()
#define endl "\n"
#define vi vector<ll>
#defi... | #include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include<bits/stdc++.h>
using namespace __gnu_pbds;
using namespace std;
#define ll long long
#define pb push_back
#define vi vector<int>
#define rep0(a,b) for(int a=0;a<b;a++)
#define rep1(a,b) for(int a=1;a<=b;a++)
#define repp(a,b,c) for(i... | 0 | 56,351,951 |
#include <cstdio>
#define max(a,b) ((a)>=(b)?(a):(b))
int main() {
int s=0,t=0,p;
for(int i=0;i<4;i++)
scanf("%d",&p),s+=p;
for(int i=0;i<4;i++)
scanf("%d",&p),t+=p;
printf("%d\n",max(s,t));
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
const ll mod = ll(1e9) + 7;
const int INF = int(1e9);
int main()
{
vector<int> ans_list;
while (1)
{
int m... | 0 | 58,869,731 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin>>n>>m;
char temp[n][n];
char image[m][m];
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
cin>>temp[i][j];
}
}
for(int i = 0; i < m; i++){
for(int j = 0; j < m; j++){
... | #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 x, n;
cin >> x >> n;
vector<int> a(105);
rep(i, n) {
int p;
cin >> p;
a[p] = 1;
}
int l = x, r = x;
int ans = x;
while (1) {
if (... | 0 | 65,546,146 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
using M = map<int, int>;
int main()
{
int n;
cin >> n;
int ans = 0, cnt = 0;
int a[n];
rep(i, n) cin >>... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A,B;
cin >> A >> B;
string S;
cin >> S;
int countA = 0;
int countab = 0;
int countB = 0;
for (int i = 0; i < A ; i++) {
if (S.at(i) == '1' || S.at(i) == '2' || S.at(i) == '3' || S.at(i) == '4' || S.at(i) == '5' || S.at(i) == '6' || S.at(... | 0 | 70,986,167 |
#include <iostream>
#include <map>
using namespace std;
int main() {
map<string, int> words;
string word;
int longest = 0, aliance = 0;
while (cin >> word) {
if (words.find(word) == words.end()) {
int len = word.size();
words[word] = 1;
longest = max(longest, len);
} else {
int n = words[word];
w... | #include<bits/stdc++.h>
using namespace std;
const int MAXN = 1e6 + 10;
int n, pr[MAXN], a[MAXN];
void div(int x)
{
for (int i = 2; i*i <= x; i++)
{
if (x%i == 0)
{
pr[i] += 1;
while (x%i == 0)
x /= i;
}
}
if (x > 1)
pr[x] += 1;
}
int main()
{
scanf("%d", &n);
for (int i = 1; i <= n; i++)
{
s... | 0 | 87,799,399 |
#include <iostream>
using namespace std;
int main(){
long long int h, w;
cin >> h >> w;
if(h == 1 || w == 1)
cout << "1";
else if(h * w % 2 == 0)
cout << h * w / 2;
else
cout << (h * w + 1) / 2;
} | #include <iostream>
#include <string>
#include<algorithm>
#include<vector>
using namespace std;
int main() {
string s;
cin >> s;
if (s == "AAA") {
cout << "No";
}
else if (s == "BBB") {
cout << "No";
}
else {
cout << "Yes";
}
} | 0 | 69,532,018 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,c=0;
cin >> n;
for(int i = 1; i <= n ; i++) c += i ;
cout << c;
} | #include<bits/stdc++.h>
using namespace std;
const int N = 10010;
int fa[N];
int findfa(int x){
if(x == fa[x]) return x;
return findfa(fa[x]);
}
int main(){
int n, q;
scanf("%d %d", &n, &q);
for(int i = 0; i < n; i++) fa[i] = i;
for(int time = 0; time < q; time++){
int a, b, c;
s... | 0 | 25,385,196 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int digits(int x) {
int result = 0;
while (x) {
result++;
x /= 10;
}
return result;
}
int main() {
int N;
cin >> N;
int ans = 0;
for (int i = 1; i <= N; i++) {
if (d... | #include <iostream>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <cmath>
#include <math.h>
#include <tuple>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef long double ld;
int dy4[4] = {-1, 0, +... | 0 | 37,022,568 |
#include <iostream>
#include <string>
#include <vector>
#include <queue>
using namespace std;
template<typename ISTREAM>
void readGraphList(ISTREAM& cin, vector< vector<int> >& graphList) {
size_t n;
cin >> n;
graphList = vector< vector<int> >(n);
for (size_t i = 0; i != n; ++i) {
size_t u;
size_t k;
cin >> u... | #include<iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <queue>
#include <string>
#include <cmath>
#include <set>
#include <functional>
using namespace std;
int d[102];
int main()
{
int n,a,b,c,x;
while(true){
cin>>n>>a>>b>>c>>x;
int tot=0;
... | 0 | 17,132,246 |
#include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
#include <functional>
#include <cmath>
#include <set>
#include <queue>
#include <deque>
#include <vector>
#include <climits>
#include <sstream>
#include <iomanip>
#include <map>
#include <stack>
using namespace std;
typedef unsigned long long... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using ll = long long;
#include<bits/stdc++.h>
void solve(long long N, long long K, std::vector<long long> A){
for(int i = 0;i < K;i++){
vector<ll> B(N);
for(int i ... | 0 | 79,113,136 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
#define ll long long
#define ld long double
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define PI 3.14159265358979323846
#define sz(x) ((int)(x).size())
#define chmin(x,y) x = min(x,y)
#define chmax(x,y) x = max(x,y)
#define all(x) (x).begi... | #include <bits/stdc++.h>
#define rep(i, z, n) for(int64_t i = z; i < n; i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
#define PI 3.14159265358979
const int INF = 1 << 29;
using namespace std;
typedef pair<int64_t, int64_t> P;
int main(){
int N;
cin >> N;
vector<int> dp(N + 100, INF);
dp.a... | 0 | 12,149,553 |
#include<stdio.h>
#include<iostream>
int main(){
int n[32] = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int i;
std::cin>>i;
std::cout<<n[i-1];
} | #include <iostream>
int main(void){
std::string S;
int N;
char ans = '1';
long long tmp = -1, K;
std::cin >> S >> K;
N = S.size();
for (int i = 0; i < N; ++i){
if (S.at(i) != '1'){
ans = S.at(i);
break;
} else {
tmp = i;
}
}
... | 0 | 52,337,126 |
#include <bits/stdc++.h>
using namespace std;
#include <iostream>
#include <vector>
#include <cstdlib>
#include <cmath>
#include <math.h>
#include <sstream>
#include <numeric>
#include <cctype>
#include <bitset>
#include <cassert>
#include<algorithm>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, ... | #include<bits/stdc++.h>
#define REP(i,x) for(int i=0,i##_len=(x);i<i##_len;++i)
#define rep(i,a,b) for(int i=(a),i##_len(b);i<i##_len;++i)
#define All(x) begin(x),end(x)
#define rAll(x) rbegin(x),rend(x)
using namespace std;
using ll = long long;
int main(){
string s;cin>>s;
REP(i,s.size()) rep(j,i,s.size()+1){... | 0 | 68,763,481 |
#include <bits/stdc++.h>
using namespace std;
void solve(std::string S, std::string T){
cout << T << S << endl;
}
int main(){
std::string S;
std::cin >> S;
std::string T;
std::cin >> T;
solve(S, T);
return 0;
} | #include <iostream>
#include <string>
#include <vector>
using namespace std;
void to_adjacent_matrix(vector<vector<int> >& adjacent_list, vector<vector<int> >& adjacent_matrix);
int main()
{
int n;
cin >> n;
vector<vector<int> > vertex(n, vector<int>(n, -1));
for (int i = 0; i < n; ++i) {
int u,... | 0 | 55,117,318 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int INF = 1000000000000;
const int mod = 1000000007;
int dx[4] = { 1, 0, -1, 0 }, dy[4] = { 0, 1, 0, -1 };
int bb[1234][1234], cc[123][123][123];
int res[123456], uio[1234][1234];
signed main() {
int n, m, a, b, x = INF, mae = 0, ans = 0; cin >> ... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define pb(n) push_back(n)
#define GSORT(v) sort(v.begin(), v.end(), greater<int>())
#define SORT(v) ... | 0 | 26,239,995 |
#include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<queue>
#include<stack>
#include<iomanip>
#define fast_io ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
using namespace std;
#define debug(x) cout<<(#x)<<"="<<(x)<<", ";
#defin... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <numeric>
#include <cstdint>
#include <iomanip>
using ll = long long;
int main(){
std::string S;
std::cin >> S;
ll N=(ll)S.size();
ll ans=0, b=0;
for(ll i=0; i<N; ++i){
if(S[i]=='B'){
... | 0 | 72,150,410 |
#include <iostream>
using namespace std;
void print_char_line(const int n, const char edge, const char inside)
{
cout << edge;
for (int i = 0; i < n - 2; ++i)
{
cout << inside;
}
cout << edge << endl;
}
void print_frame(const int height, const int width)
{
print_char_line(width, '#', '#'... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define vi vector<ll>
#define pb push_back
#define ff first
#define ss second
#define inf 2e18
#define ull unsigned long long
#define pi acos(-1.0)
#define mod 1000000007
#define lop0(n) for(ll i=0;i<n;i++)
#define lopj(n) for(ll j=0;j<n;j++)
#define lo... | 0 | 48,655,931 |
#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstring>
#include <chrono>
#include <complex>
#define fill(a,val) memset(a,val,sizeof(a))
#define REP(i,a,b) for (auto i = a; i != b; i++)
#define ll long long int
#define ld long double
#define vi vector<int>
#define vll vector<ll... | #include <iostream>
using namespace std;
int solve(int n, int s, int t){
if (n == 1) {
if (s >= t && s < 10) return 1;
else return 0;
}
int ret = 0;
for(int i = t; i < 10 && i < s; i++)
ret += solve(n - 1, s - i, i + 1);
return ret;
}
int main(){
int n,s;
while(cin >> n >> ... | 0 | 67,110,255 |
#include <stdlib.h>
#include <cmath>
#include <cstdio>
#include <cstdint>
#include <string>
#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
using namespace std;
using ll = long long;
int main(){
string S;
ll K;
cin >> S >> K;
if(K<S.size()) S=S.substr(0,K);
for(int... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
int main(){
int h, w;
cin >> h >> w;
vector<string> a(h);
rep(i, h)cin >> a[i];
queue<P> q;
rep(i,h)rep(j,w){
... | 0 | 83,481,797 |
#include <bits/stdc++.h>
using namespace std;
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define rep(i, n) repl(i, 0, n)
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define CST(x) cout << fixed << setprecision(x)
using ll = long long;
const ll MOD = 1000000007;
const int inf = 1e9... | #include<bits/stdc++.h>
#define se second
#define fi first
using namespace std;
const int MAXN = 10+1e5;
typedef pair<int,int> I;
typedef long long LL;
const LL oo = 1e9;
int n,m;
int l1[MAXN],r1[MAXN];
LL a[MAXN];
void Inout()
{
#define TASK "ABC"
freopen(TASK ".inp", "r", stdin);
freopen(TASK ".out", "w",... | 0 | 624,472 |
#include <iostream>
#include <string>
#include <iomanip>
#include <cmath>
using namespace std;
int main (void){
int a, b, k;
int cnt = 0;
cin >> k >> a >> b;
for (int i = a; i <= b; i++) {
if (i % k == 0) {
cnt++;
break;
}
}
if (0 < cnt) {
cout <<... | #include<iomanip>
#include<limits>
#include<thread>
#include<utility>
#include<iostream>
#include<string>
#include<algorithm>
#include<set>
#include<map>
#include<vector>
#include<stack>
#include<queue>
#include<cmath>
#include<numeric>
#include<cassert>
#include<random>
#include<chrono>
#include<unordered_map>
#includ... | 0 | 48,170,663 |
#include<iostream>
using namespace std;
struct Card { char suit, value; };
void BubbleSort(struct Card A[], int N) {
for (int i = 0; i <= N - 1; i++) {
for (int j = N - 1; j >= i + 1; j--) {
if (A[j].value < A[j - 1].value) swap(A[j], A[j - 1]);
}
}
}
void SelectionSort(struct Card A[], int N) {
int minj;
fo... | #ifndef DEBUG
#pragma GCC optimize("O3")
#endif
#include <bits/stdc++.h>
#define ull unsigned long long
#define ll long long
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
#define fastio ios_base::sync_with_stdio(0)
#define untie cin.tie(0)
#define ms(a, b) memset(a, b, sizeof a)
#define m... | 0 | 72,816,195 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
typedef tree<ii,null_type,less<ii>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
int main() {
cin.tie(0); cout.tie(0); ios_base::sync_with_stdi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef vector<int> VI;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
#define _overload3(_1,_2,... | 0 | 17,972,244 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; i--)
#define irep(i, m, n) for (int i = (... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vll = vector<vl>;
using Pll = pair<ll, ll>;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(v) v.begin(), v.end()
#define sz(x) ((int) x.size())
#define pb push_back
#define mp make_pair
#defi... | 0 | 90,852,375 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.