code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 45 101M |
|---|---|---|---|
#include<bits/stdc++.h>
using namespace std;
int main(){
int x;
cin >> x;
int f=0;
string s=to_string(x);
for(int i=0;i<s.size();i++){
f+=s.at(i)-48;
}
cout << ((x%f==0)?"Yes":"No") << endl;
} | #include<bits/stdc++.h>
#include<string.h>
using namespace std;
int main()
{
string N;
cin>>N;
int sum=0;
int num = stoi(N);
for(int i=0;i<N.size();i++)
{
sum+=(N[i]-'0');
}
if(num%sum==0)
{
cout<<"Yes";
}
else{
cout<<"No";
}
return 0;
} | 1 | 10,821,978 |
#include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#include <unistd.h>
#include <stdio.h>
#define all(a) (a).begin(),(a).end()
#define vecin(a) rep(i,a.size())cin >> a[i]
#define vecout(a) rep(i,a.size()){cout << a[i];cout << (i == a.size() - 1 ? "\n":" ");}
#define rep(i,x) for(int i = 0;i<x;i++)
#define RE... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define REPL(i,m,n) for(ll i=(ll)(m); i<(ll)(n); i++)
#define repl(i,n) REPL(i,... | 1 | 82,558,723 |
#include <cstdio>
using namespace std;
int main(int argc, const char * argv[]) {
int n;
int p[101];
int dp[101][101];
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d%d", &p[i], &p[i+1]);
}
for (int dif = 0; dif < n; dif++) {
for (int i = 1; i <= n-dif; i... | #include <iostream>
#include <algorithm>
using namespace std;
void DP(int i, int j, long long dp[101][101], int r[], int c[]){
if(i == j) dp[i][j] = 0;
else if (j - i == 1){
dp[i][j] = r[i] * c[i] * c[j];
} else {
int tmp = i;
dp[i][j] = dp[i][tmp] + dp[tmp+1][j] + r[i] * r[tmp+1] * ... | 1 | 2,599,895 |
#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 mp make_pair
#define pb(x) push_back(x)
#define vi vector<int>
#define vs vector<string>
#define vll vector<long long>
#define vc vector<char>
#define vs vector... | #include<bits/stdc++.h>
using namespace std;
int main(){
long long n;
cin>>n;
long long v=0,e=0;
for(int i=1;i<=n;i++)v+=i*(n-i+1);
long long x[n-1],y[n-1];
for(int i=0;i<n-1;i++){
cin>>x[i]>>y[i];
e+=min(x[i],y[i])*(n-max(x[i],y[i])+1);
}
cout<<v-e<<endl;
return 0;
} | 1 | 66,248,438 |
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int a,b,c;
cin >> a >> b >> c;
int ar[3];
ar[0]=a;
ar[1]=b;
ar[2]=c;
sort(ar,ar+3);
cout << ar[0] << " " << ar[1] << " " << ar[2] << endl;
} | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
vector<int> x(3);
x[0] = a; x[1] = b; x[2] = c;
sort(x.begin(), x.end());
cout << x[0] << " " << x[1] << " " << x[2] << endl;
return 0;
} | 1 | 70,241,109 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll n, k;
cin >> n >> k;
vector<ll> h(n);
for (ll i = 0; i < n; i++)
{
cin >> h[i];
}
sort(h.begin(), h.end());
ll ans = 0;
for (ll i = 0; i < n - k; i++)
{
ans += h[i];
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define x first
#define y second
#define mk(a,b) make_pair(a,b)
#define rr return 0
#define sqr(a) ((a)*(a))
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()... | 1 | 79,209,280 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> ii;
typedef tuple<ll, ll, ll> iii;
typedef vector<ll> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<vi> vvi;
typedef vector<vii> vvii;
#define REP(i,n) for (ll i = 0; i < n; ++i)
#defi... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define PI 3.141592653589793
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, a, n) for (int i = a; i < (n); i++)
#define rrep(i, n, k) for (int i = (n); i >= (k); i--);
#define all(x) (x).begin(), (x).end()
#define vi vector<int>
templat... | 1 | 32,527,446 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL<<60;
ll gcd(ll a, ll b) {
if(b == 0) return a;
return gcd(b, a % b);
}
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... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP... | 1 | 97,200,731 |
#include <cmath>
#include <iostream>
#include <iomanip>
using namespace std;
int main()
{
double a, b, C;
cin >> a >> b >> C;
double sgn = (C>90) ? -1.0 : 1.0;
double sinC = sin(M_PI * C / 180.0);
double h = b * sinC;
double c = sqrt(a*a + b*b - 2.0*sgn*a*b*sqrt(1-sinC*sinC));
cout << fixed << setprecision(4);
... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
using namespace std;
#define FOR(i,a,b) for(long long int i=(a);i<(b);i++)
#define REP(i,n) for(long long int i=0;i<(n);i++)
#define PI 3.14159265358479
double l(long double a, long double b, long double C){
... | 1 | 64,005,091 |
#include "bits/stdc++.h"
using namespace std;
int main() {
string S;
int X, Y, count = 0;
bool lr = true;
vector<int> UD, LR;
cin >> S >> X >> Y;
for (int i = 0; i < S.size(); i++) {
if (S[i] == 'F') {
count++;
}
else {
if (lr) LR.push_back(count);
else UD.push_back(count);
count = 0;
lr = !l... | #include<bits/stdc++.h>
#define ALL(c) (c).begin(),(c).end()
#define EACH(i,c) for(auto i=(c).begin();i!=(c).end();++i)
using namespace std;
#define int long long
const string YES = "Yes";
const string NO = "No";
const int OFF = 8005;
int dp[2][16010];
void solve(std::string s, long long x, long long y){
vector<vec... | 1 | 55,841,723 |
#include <iostream>
int main()
{
const int Max = 100;
int matrix[Max][Max] = { 0 };
int n, m, l;
int temp;
std::cin >> n;
for (int i = 0; i < n; i++) {
std::cin >> m >> l;
for (int j = 0; j < l; j++) {
std::cin >> temp;
matrix[m - 1][temp - 1] = 1;
}
}
for (int i = 0; i < n; i++) {
for (int j = 0;... | #include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <cctype>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <functional>
using namespace std;
using ll = long long int;
#define rep(i,n) for(i... | 1 | 57,180,700 |
#include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int time_parse(string time)
{
int hour = atoi(time.substr(0, 2).c_str());
int minute = atoi(time.substr(3, 5).c_str());
int second = atoi(time.substr(6).c_str());
return hour * 3600 + minute * 60... | #include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL<<60;
#define REP(i,n) for(int i=0;i<n;i++)
#define REP2(i,m,n) for(int i=m;i<n;i++)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
int change(string time){
int num = (int(time[0]) -48)*100000... | 1 | 30,135,171 |
#include <bits/stdc++.h>
#define cinf(n,x) for(int i=0;i<(n);i++)cin>>x[i];
#define ft first
#define sc second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(),(v).end()
#define LB(a,x) lb(all(a),x)-a.begin()
#define UB(a,x) ub(all(a),x)-a.begin()
#define mod 1000000007
#def... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int 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 1000000007
const ll INF... | 1 | 83,811,024 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
const int N = 1e6 + 10, OO = 0x3f3f3f3f, mod = 1e9 + 7;
#define PI acos(-1)
#define clr(arr, val) memset(arr, val, sizeof(arr))
#define loop(i, n) for (int i = 0; i < int(n); i++)
#de... | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
string A;
string B;
cin >> A >> B;
sort(A.begin(), A.end());
sort(B.begin(), B.end(), greater<char>());
int N = A.size();
int M = B.size();
if (N < M) {
int i = 0;
wh... | 1 | 51,254,392 |
#include<bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin, (x).rend()
#define endl '\n'
#define first F
#define second S
typedef long long ll;
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);
int x, n; cin>>x>>n;
map<int, int> m;
for(int i=0; i<n; i++){
int ... | #include <bits/stdc++.h>
namespace org
{
template <class T>
T make_value()
{
T tmp;
return tmp;
}
template <class T>
T VALUE()
{
T tmp;
std::cin >> tmp;
return tmp;
}
template <class T>
std::vector<T> make_vector(long long size)
{
... | 1 | 50,832,392 |
#include <bits/stdc++.h>
#define fastIO (cin.tie(0), cout.tie(0), ios::sync_with_stdio(false))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define precise(i) fixed << setprecision(i)
using lint = long;
using llint = long long;
using namespace std;
int main() {
fastIO;
int n;
cin >> n;
cout << (n - 2... | #include <bits/stdc++.h>
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=(int)(a)-1;i>=(int)(b);--i)
#de... | 1 | 91,630,248 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, n) for(int i = 0; i < n; ++i)
using namespace std;
using LLONG = long long;
const LLONG MOD = 1000000007;
int... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
void solve() {
ll n, k;
cin >> n >> k;
vector <pair <int, int>> v(n);
for(int i = 0; i < n; i++) {
cin >> v[i].first >> v[i].second;
}
sort(v.begin(), v.end());
ll cur = 0;
for(int i = 0; i < n; i++) {
cur += v[i].se... | 1 | 29,221,186 |
#include <bits/stdc++.h>
#define mod 1000000007
#define INF 1001001001
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl
#define double long double
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define rep1(i,n) REP(i,1,n+1)
using names... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
struct Edge {
ll to;
ll cost;
};
i... | 1 | 10,149,257 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <queue>
#include <set>
#include <map>
#include <functional>
#include <complex>
#define REP(i,a) for(int i=0;i<(a);i++)
#define REPR(i,a) for(int i=(int)(a)-1;i>=0;i--)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define FORR(i,a,b) fo... | #include <bits/stdc++.h>
using namespace std;
int main(void){
int a,b,c;
cin >> a >> b >> c;
if(a == b && b == c){
cout << "Yes";
}else{
cout << "No";
}
} | 1 | 26,526,625 |
#include <iostream>
using namespace std;
int main(){
string s;
cin >> s;
int ans = 0;
for(int i = 0; i < s.length(); i++){
char num = s[i];
ans += num - 48;
}
cout << (atoi(s.c_str()) % ans == 0 ? "Yes" : "No") << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
int M = N;
int ketaSum = 0;
while(M > 0){
ketaSum += M % 10;
M /= 10;
}
if(N % ketaSum == 0){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
} | 1 | 93,134,942 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
ll A,B,K;
cin >> A >> B >>K;
ll num =0;
for(int i=100;i>=0;--i){
if(A%i ==0 && B%i==0){
num++;
}
if(num == K){
cout << i << endl;
return 0;
}
}
retur... | #include <iostream>
#include <string>
#include <algorithm>
#include <math.h>
using namespace std;
int main() {
int i;
int count = 0;
int A, B;
int K;
cin >> A >> B>> K;
int n = min(A,B) + 1;
while (count < K)
{
n--;
if ((A%n == 0) && (B%n == 0))
{
count++;
}
}
cout << n <<endl;
} | 1 | 52,757,072 |
#include <bits/stdc++.h>
using namespace std;
const double PI= acos(-1.0);
int gcd_func(int a, int b){
return b? gcd_func(b, a%b) : a;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
int x,n; cin >> x >> n;
map<int,int>p;
for(int i = 0; i < n; i++){
int ipt;
... | #include<bits/stdc++.h>
using namespace std;
#define f(x,y,z) for(int x=y;x<z;++x)
int x, n, k;
map<int,bool> a;
int main() {
ios_base::sync_with_stdio(false);cin.tie(0);
cin >> x >> n;
if(!n) return cout << x << '\n', 0;
f(i,0,n) {
cin >> k;
a[k] = true;
}
int i = 0;
while(t... | 1 | 60,955,445 |
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
int dfs(vector<vector<int>> &A, vector<bool> &U, vector<int> &R, int c)
{
if (U[c])
return -1;
if (R[c])
return R[c];
U[c] = true;
int m = 0;
for (auto... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxint = 1e9;
struct timestamp;
vector<int> shortest, indeg;
vector<vector<int>> connective;
void dag(int n)
{
vector<int> search;
vector<int> new_search;
for (int i = 0; i < n; i++)
{
if (indeg[i] == 0)
{
... | 1 | 96,679,696 |
#include <iostream>
using namespace std;
int fib(int n, int a, int b);
int main()
{
int n;
cin >> n;
cout << fib(n - 1, 1, 1) << endl;
return (0);
}
int fib(int n, int a, int b){
int f;
f = a;
if (n >= 1){
f = fib(n - 1, a + b, a);
}
return (f);
} | #include <iostream>
int fib(int, int[]);
int main()
{
int n;
const int size = 44;
int memo[size + 1];
for (int i = 0; i < size + 1; i++)
{
memo[i] = -1;
}
std::cin >> n;
std::cout << fib(n, memo) << std::endl;
return 0;
}
int fib(int n, int memo[])
{
int ans;
if (n == 0 || n == 1) {
return 1;
}
else {
... | 1 | 57,286,980 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair<int, int>;
#define debug(var) cerr << "[" << #var << "] " ... | #include <bits/stdc++.h>
using namespace std;
int main(){
vector<int> list(5);
int t,j=0,mw=0;
for(int i=0; i<5; i++) {
cin >> list.at(i);
t = 10-(list.at(i)%10);
if(j < t && t != 10) {
j = t;
mw = i;
}
}
int ans=0,x;
for(int i=0; i<5; i++) {
if(i != mw) {
x = list.at(i... | 1 | 77,034,182 |
#include <bits/stdc++.h>
#include <vector>
# include <cstdint>
#define FOR(i,l,r) for(int i=(l);i<(r);++i)
#define RFOR(i,l,r) for(int i=(l);i>=(int)(r);i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,n-1,0)
#define int long long
using namespace std;
const int MX = 1e6;
const int inf = 1e13;
const int mod ... | #include <iostream>
#include <map>
#include <set>
#include <algorithm>
#include <vector>
#include <sstream>
#include <string>
#include <functional>
#include <queue>
#include <deque>
#include <stack>
#include <limits>
#include <unordered_map>
#include <unordered_set>
#include <math.h>
#include <fstream>
#include <iterat... | 1 | 78,075,917 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ll k;
cin >> k;
if(k == 0)
{
cout << 2 << endl;
cout << "1 1" << endl;
}
else if(k == 1)
{
cout << 2 << endl;
cout << "2 0" << endl;
}
else if(k <= 50)
{
cout ... | #include <stdio.h>
#include <iostream>
#include <string.h>
#include <math.h>
#include <algorithm>
#include <vector>
#define pb push_back
#define mp make_pair
#define ll long long
#define ull unsigned ll
#define db double
#define INF 0x3f3f3f3f
#define MOD 1000000007
#define PII pair<int, int>
using namespace std;
ll k;... | 1 | 18,823,585 |
#include <bits/stdc++.h>
using namespace std::literals::string_literals;
using i64 = long long;
using std::cout;
using std::endl;
using std::cin;
template<typename T>
std::vector<T> make_v(size_t a){return std::vector<T>(a);}
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts){
return std::vector<declt... | #include <algorithm>
#include <functional>
#include <iostream>
#include <iomanip>
#include <vector>
#include <map>
#include <set>
#include <unordered_set>
#include <queue>
#include <numeric>
#include <bitset>
#include <cmath>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const ll mod = 100... | 1 | 28,207,421 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int count = 0;
for (int i = 0; i < 3; i++) {
if (S.at(i) == 'R') {
count ++;
}
}
if (count == 2) {
if (S.at(1) == 'S') {
count = 1;
}
}
cout << count << endl;
} | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#include<bits/stdc++.h>
#define int long long int
#define double long double
#define minheapair priority_queue<pair<int,int>, vector<pair<int,int>> , greater<pair<int,int>> >
#define maxheapair priority_queue<pair... | 1 | 78,251,727 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int n,m,i,j,bl,x,y;
int main(){
scanf("%d%d%d",&n,&m,&bl);
for(i=1;i<=n;i++){
for(j=1;j<=m;j++){
x=(i+j+m)/bl%2;
y=(i-j+m)/bl%2;
printf("%c","YBGR"[x*2+y]);
}
puts("");
}
} | #include <stdio.h>
#include <string.h>
#include <algorithm>
#include <vector>
const int kN = 500 + 5;
int n, m, d;
int a[kN][kN];
int main()
{
scanf("%d%d%d", &n, &m, &d);
int mod = d + d;
for (int i = 0; i < n; ++ i) {
for (int j = 0; j < m; ++ j) {
int x = (i + j) % mod;
in... | 1 | 68,496,479 |
#include <bits/stdc++.h>
const double pi = 3.141592653589793238462643383279;
using namespace std;
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }
inline int readInt() { int x; scanf("%d", ... | #include <iostream>
#include <fstream>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <algorithm>
#include <numeric>
#include <functional>
#include <string>
#include <vector>
#include <bitset>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
using namespace std;
using l... | 1 | 81,481,232 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
const ll MOD=1000000007;
ll abs1(ll a){
if(a>=0)return a;
else return -a;
}
ll pow1(ll a,ll b){
ll p=1;
for(int i=0;i<b;i++){
p*=a;
}
return p;
}
int digit(ll a,ll b){
int i=0;
while(a!=0){
a/=b;
i++;
}
... | #include <stdio.h>
#include <string.h>
#include <limits.h>
#include <math.h>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <stack>
#include <queue>
typedef unsigned long long ULLONG;
typedef long long LLONG;
static const LLONG MOD_NUM = 1000000007;
t... | 1 | 73,200,199 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
string s="#",w[100];
cin>>n;
bool ok=true;
for(int i=0;i<n;i++){
cin>>w[i];
if(i){
bool have=false;
for(int j=0;j<i;j++) if(w[j]==w[i]) have=true;
if(have||w[i-1][w[i-1].size()-1]!=w[i][0]) ok=false;
}
}
if(ok) cout<<"Yes"<<endl;
els... | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int main(){
IOS;
int n;
cin >> n;
vector<string> str;
vector<string> sn;
for(int i=0; i<n; i++){
string s;
cin >> s;
str.push_back(s);
sn.push_back(s);
... | 1 | 81,310,359 |
#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 ALL(v) v.begin(), v.end()
#define V vector
#define P pair
typedef long double ld;
typedef long long ll;
const int MOD = 1000000007;
const int IINF = INT_MAX;
const ll INF = 1LL << 60;
int main() {
int n; cin >> n;
if(n <= 111) cout << 111 << endl;
else ... | 1 | 43,285,832 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repm(i,m,n) for(ll i=m;i<n;i++)
#define max(a,b) (((a)>(b))?(a):(b))
#define min(a,b) (((a)<(b))?(a):(b))
#define YesNo(a) (a)?cout<<"Yes"<<endl:cout<<"No"<<endl
#define YESNO(a) (a)?cout<<"YES"<<endl:cout<<"NO"<<endl
#define INF... | #include<bits/stdc++.h>
using namespace std;
int main()
{
char a;
cin>>a;
cout<<(a<'a'?"A":"a");
} | 1 | 54,828,161 |
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
int main(){
ll n,m;
cin>>n>>m;
map<ll,ll> M;
ll tmp=0,x;
M[0]++;
rep(i,n){
cin>>x;
tmp=(tmp+x)%m;
M[tmp]++;
}
ll sum=0;
for(auto y:M){
... | #include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a), (b)) * (b))
using namespace std;
using l... | 1 | 31,765,799 |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long l... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REPR(i,n) for(int i=n; i>-1; --i)
#define ALL(a) (a).begin(),(a).end()
#define FILL(a,n,x); REP(i,(n)){ (a)[i]=(x); }
#define CINA(a,n); REP(i,(n)){ cin >> (a)[i... | 1 | 80,923,839 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long n,k,a[1009], cumsum[1009], cnt[42];
map<long long, long long> mp;
cin >> n >> k;
for(int i=0;i<n;i++){
cin >> a[i];
}
cumsum[0] = 0;
for(int i=1;i<=n;i++){
cumsum[i] = cumsum[i-1] + a[i-1];
}
for(int i=0;i<=n;i++){
for(int... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,n) for(long long i=0;i<n;++i)
#define REPP(i,m,n) for(long long i=m;i<n;++i)
#define rep(i,n) for(long long i = n-1;i>=0;--i)
#define repp(i,n,m) for(long long i = n-1; i >= m; --i)
#define ALL(N) (N.begin(),N.end())
#define de cout << "li... | 1 | 65,110,834 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long N,M;cin>>N>>M;
vector<pair<long,long>>A(N);
for(long i=0;i<N;i++)cin>>A[i].first>>A[i].second;
sort(A.begin(),A.end());
long m=0,ans=0;
long i=0;
while(m<M){
ans+=A[i].first*min(M-m,A[i].second);
m+=A[i].second;
i++;
}
cout<<ans... | #include<bits/stdc++.h>
#define fast ios::sync_with_stdio(false);cin.tie(NULL)
using namespace std;
#define int long long
#define MOD 1000000007
typedef vector<int> vi;
typedef pair<int,int> pi;
#define inf 1e18
#define For(i,a,b) for (int i = a; i < b; i++)
#define Rep(i,a,b) for (int i = a; i <= b; i++)
#define ps(x,... | 1 | 37,128,268 |
#include<bits/stdc++.h>
#define swap(type,a,b) {type t; t=a; a=b; b=t;}
#define forN(i,n) for(int i=0;i<n;i++)
#define forS(i,start,n) for(int i=start;i<n;i++)
#define ll long long
#define pb(t,d,n) {t p;int i;forN(i,n){cin>>p;d.push_back(p);}}
#define DOUBLE fixed << setprecision(10)
using namespace std;
typedef vecto... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define per(i,n) for(int i=(n)-1; i>=0; i--)
using namespace std;
using vi = vector<int>;
using vv = vector<vi>;
const int MOD = 1000000007;
int main(){
int n,m;cin>>n>>m;
vi a(n,0);
rep(i,m){
int b;cin>>b;
a[b]++;
}
... | 1 | 8,048,040 |
#include "bits/stdc++.h"
using namespace std;
int main() {
string S;
cin >> S;
int ans = 1e9;
for (int n = 0;n<S.size()-2;++n) {
int num = (S[n] - '0') * 100 + (S[n+1] - '0') * 10 + (S[n+2] - '0');
ans = min(ans, abs(753-num));
}
cout << ans <<endl;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <math.h>
using namespace std;
int keta(long long S) {
int ans = 1;
while (true) {
if (S < 10) {
break;
}
ans++;
S = floor(S / 10);
}
return ans;
}
int sub(int a, int b) ... | 1 | 34,845,561 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
map<int, int> a;
for(int i = 0; i < n; i++){
int now;
cin >> now;
a[now]++;
}
int ans = 0;
for(auto now : a){
int dis = now.second - now.first;
if(dis == 0) continue;
if(dis < 0) ans += now.second;
else... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define FOR(i,n,j) for(int i=(j);i<(n);++i)
using namespace std;
using ll=long long;
using ld=long double;
#define ssort(n) sort((n).begin(),(n).end())
typedef pair<int,int> P;
int main()
{
int N;
cin >> N;
vector<ll> a(N);
rep(i,N)cin >> a... | 1 | 11,812,673 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
signed main(void)
{
set<char> st;
string s;
cin >> s;
st.insert(s[0]);
st.insert(s[1]);
st.insert(s[2]);
if (st.size() == 3)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1e9
#define PI 3.14159265359
#define MOD 1000000007
#define ALL(v) v.begin(),v.end()
#define ALLR(v) v.rbegin(),v.rend()
typedef long long ll;
const int dx[4] = {1,0,-1,0};
const int dy[4] = {0,1,0,-1};
int ma... | 1 | 71,085,401 |
#include <iostream>
#include <vector>
using namespace std;
int dfs(vector<vector<int>> &v, int now, int par = -1){
int r = 0;
for(auto n:v[now]) if(n != par){
r ^= dfs(v, n, now) + 1;
}
return r;
}
int main(){
int n;
cin >> n;
vector<vector<int>> v(n);
for(int i = 0; i < n - 1; i++){
int x, y;
cin >> x >>... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define MOD 1000000007
#d... | 1 | 25,779,911 |
#include<stdio.h>
int main(){
int n;
scanf("%d", &n);
int a, b;
scanf("%d %d", &a, &b);
int ribuan, ratusan, puluhan, satuan;
int sum = 0;
for(int i = 1; i <= n; i++){
int jumlah = 0;
if(i > 9999){
sum += i;
}else if(i > 999){
ribuan = i / 1000;
ratusan = (i / 100) - (ribuan * 10);
puluhan = (i... | #include <bits/stdc++.h>
using namespace std;
int func(int n) {
int s = 0;
while (n > 0) {
s += n % 10;
n /= 10;
}
return s;
}
int main() {
int n, a, b;
cin >> n >> a >> b;
int s = 0;
for (int i = 1; i <= n; i++) {
int j = func(i);
if (j >= a && j <= b) {
... | 1 | 25,028,441 |
#include <bits/stdc++.h>
using namespace std;
int hashh[200005],ans[200005],memo[1<<26],arr[26];
int main(){
for(int i=0;i<(1<<26);i++) memo[i]=INT_MAX;
string s;
cin >> s;
int len=s.length();
s="*"+s;
hashh[0]=0;
for(int i=1;i<=len;i++){
arr[s[i]-'a']++;
int hv=0;
for(int j=0;j<26;j++){
if(arr[j]%2) hv... | #include<bits/stdc++.h>
using namespace std;
using Int = long long;
signed main(){
string s;
cin>>s;
int n=s.size();
vector<int> v(n+1);
v[0]=0;
for(int i=0;i<n;i++){
v[i+1]=v[i]^(1<<(s[i]-'a'));
}
vector<int> dp(n+1,1<<28);
map<int,int> m;
dp[0]=0;
for(int i=0;i<=n;i++){
int b=v[i];
i... | 1 | 86,337,185 |
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int dp[21][50001]={0},y[21]={0},n,m,a;
cin>>n>>m;
for(int i=1;i<=m;i++){
cin>>y[i];
}
for(int i=0;i<=n;i++)dp[0][i]=50050;
for(int i=1;i<=m;i++){
for(int j=1;j<=n;j++){
if(j-y[i]>=0)dp[i][j]=min(dp[i-1][j],dp[i][j-y[i]]+... | #include<iostream>
#include<stack>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)(n);i++)
const int NMAX = 65536, MMAX = 32, INF = 10000000;
int dp[NMAX];
int d[MMAX];
int main() {
int M, N;
cin >> N >> M;
REP(i, M) {
cin >> d[i];
}
REP(i, N+2) {
dp[i] = INF;
}
dp[0] = 0;
REP(m, M) {
... | 1 | 89,449,157 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
int N,sum=0,ans=1;
cin>>N;
vector<int> A(N);
for(int &i:A)cin>>i;
sort(A.begin(),A.end());
for(int i=0;i<N-1;i++){
sum+=A[i];
if(sum*2>=A[i+1])ans++;
else ans=1;
}
cout<<ans<<endl;
} | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <deque>
#include <numeric>
#include <sstream>
#include <ioman... | 1 | 73,193,557 |
#include <bits/stdc++.h>
using namespace std;
const int N = (1 << 18);
int n, a[N];
vector<int> sub[N], ans(N);
signed main(){
cin >> n;
for(int i = 0; i < (1 << n); ++i) cin >> a[i], sub[i].push_back(a[i]);
for(int j = 0; j < n; ++j){
for(int i = 0; i < (1 << n); ++i){
if(!(i & (1 << j))){
for(auto v : su... | #include<cstdio>
#include<algorithm>
int maxn[500005][20][2];
int a[500005];
void upDate(int& u,int &v,int x,int y){
int b[5];
b[0] = u, b[1] = v, b[2] = x, b[3] = y;
std::sort(b,b+4);
u = b[3], v = b[2];
}
int max(int a,int b){ return a>b?a:b; }
int main(){
int n;
scanf("%d",&n);
for(int i ... | 1 | 11,824,914 |
#include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
using namespace std;
using ll = long long;
using vl = vector<ll>;
using pll = pair<ll, ll>;
#define rep(i, n) for (ll i = 0, xxx_rep_end = (n); i < xxx_rep_end; ++i)
#define all(x) (x).begin(), (x).end()
template... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define ALL(c) (c).begin(), (c).end()
#define pb push_back
#define eb emplace_back
const long long INF = 1LL<<60;
using namespace std;
using ll = long long;
using P = pair<int, int>;
template<class T> inlin... | 1 | 88,712,318 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin>>a;
int d=0;
vector<string> b(a);
vector<int> c(a);
for(int i=0;i<a;i++){
cin>>b.at(i)>>c.at(i);
}
string e;
cin>>e;
for(int i=a-1;i>=0;i--){
if(b.at(i)==e){
break;
}
d+=c.at(i);
}
cout<<d<<endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int N,t,sum = 0;
bool frag = false;
string s,X;
vector<int> minute;
vector<string> name;
cin >> N;
for(int i = 0;i<N;i++){
cin >> s >> t;
minute.push_back(t);
name.push_back(s);
}
cin >> X;
for(int i = 0; i<N;i++){
if(frag){sum ... | 1 | 95,497,178 |
#include<bits/stdc++.h>
using namespace std;
int i;
string a,b;
int main(){
cin>>a>>b;
for(i=0;i<=b.length()-1;i++){
cout<<a[i]<<b[i];
}
if(a.length()>b.length()){
cout<<a[a.length()-1];
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define all(n) begin(n),end(n)
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
const long long INF = numeric_limits<long long>::max();
int main(){
string O,E;
cin>... | 1 | 98,293,882 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> A(N);
for(int i = 0; i < N; i++) {
cin >> A[i];
}
int R = 0;
ll ans = 0;
ll count = 0;
for(int i = 0; i < N; i++) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#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 ALL(x) (x).begin(),(x).end()
const int IINF = 1e9;
const LL LINF = 1e18;
const LL mod = 1e9+7;
int main() {
int N;
cin >> N;
vector<int>... | 1 | 74,637,644 |
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int long long
#define ll long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vi vector<int>
#de... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long MOD = 1000000007;
template <long long MOD_ = (long long)1e9 + 7>
class ModMath {
public:
ModMath(int N = 0)
: N_(N)
{
}
template <class... Ts>
constexpr long long mul(long long head, Ts&&... tail)
{
... | 1 | 69,684,754 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = a; i < (int)(b); i++)
#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 all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
using ll = long long;
int main() {
int... | #include<bits/stdc++.h>
using namespace std;
#define fRead(x) freopen(x,"r",stdin)
#define fWrite(x) freopen (x,"w",stdout)
#define ull unsigned long long
#define ll long long
#define pii pair<int,int>
#define sit set<int> :: iterator
#define vrit vector... | 1 | 13,320,349 |
#include <iostream>
using namespace std;
int main(){
string s;cin>>s;
int mn = 0;
int mx = s.size()-1;
int ans = 0;
while(mn < mx){
if(s[mn] == s[mx]){
mn++;mx--;
}else if(s[mn] == 'x'){
mn++;
ans++;
}else if(s[mx] == 'x'){
mx--;
ans++;
}else{
cout << -1 << ... | #include <bits/stdc++.h>
using namespace std;
template <typename T> bool chmax(T &u, const T z) { if (u < z) {u = z; return true;} else return false; }
template <typename T> bool chmin(T &u, const T z) { if (u > z) {u = z; return true;} else return false; }
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define l... | 1 | 86,731,329 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll l1[10];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s,t;
cin>>s;
cin>>t;
sort(s.begin(),s.end());
sort(t.begin(),t.end());
reverse(t.begin(),t.end());
if(s<t)cout<<"Yes";
else cout<<"No"... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
sort(s.begin(),s.end());
sort(t.begin(),t.end());
reverse(t.begin(),t.end());
if(s<t) cout << "Yes";
else cout << "No";
} | 1 | 91,882,162 |
#include <iostream>
#include <math.h>
#include <algorithm>
#include <string>
#include <map>
#include <vector>
using namespace std;
void b_roller_coaster(void) {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; i++)cin >> h[i];
int ans = 0;
for (int i = 0; i < n; i++) {
if (h[i] >= k) ans++;
}
... | #include<stdio.h>
#include <iomanip>
#include <iostream>
#include<string>
#include<vector>
#include<map>
#include<queue>
#include<algorithm>
#include <random>
#include <chrono>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int tmp,cnt=0;
rep(i, n) {
cin >> tmp;
... | 1 | 64,350,398 |
#ifdef LOCAL_JUDGE
#define _GLIBCXX_DEBUG
#endif
#define WOULD
#define YOU
#define PLEASE
#define ACCEPT
#define MY
#define SUBMISSION
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <iomanip>
#include <limits>
#include... | #include <bits/stdc++.h>
#define rep(i, f, n) for (ll i = (f); i < (ll)(n); i++)
#define repe(i, f, n) for (ll i = (f); i <= (ll)(n); i++)
using namespace std;
using ll = long long;
using GraphC = vector<vector<char>>;
using pint = pair<int, int>;
int main() {
int N, M;
cin >> N >> M;
GraphC A(N, vector<char>(N))... | 1 | 16,024,275 |
#include <stdio.h>
int main()
{
char a,b,c;
scanf("%c %c %c", &a, &b, &c);
getchar();
a!=b || b!=c || a!=c ? printf("Yes\n"): printf("No\n");
return 0;
} | #include "bits/stdc++.h"
using namespace std;
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long
#define li long int
#define pb push_back
#define m <i> map<int>
#define v <i> vector<int>
const int MX = 1e6;
const int MOD = 1e9 + 7;
const string ALPHA = "abcdefghijklmnopqrstuvwxyz"... | 1 | 71,880,630 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using intpair=pair<int,int>;
using llpair=pair<ll,ll>;
using intq=queue<int>;
using llq=queue<ll>;
using intvec=vector<int>;
using llvec=vector<ll>;
using llmat=vector<vector<ll>>;
#define PI 3.141592653589793
#define INTINF 1<<30
#define LLINF 1LL<<60
#... | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#include<algorithm>
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
using namespace std;
using ll = long lon... | 1 | 98,365,807 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A,B,C;
cin >> A >> B >> C;
for (int i = 0; i < B; i++) {
if (A*(i+1) % B == C){
cout << "YES" << endl;
return 0;
}
}
cout << "NO" << endl;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int a, b, c;
cin >> a >> b >> c;
int k = a;
rep(i, b) {
if (k % b == c) {
cout << "YES" << endl;
return 0;
}
k += a;
}
cout << "NO"... | 1 | 80,927,443 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <regex>
#include <set>
#include <cmath>
#include <sstream>
#include <numeric>
#include <set>
using namespace std;
int main()
{
int x, y;
std::cin >> x >> y;
std::cout << x + y / 2;
return EXIT_SUCCESS;
} | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
int gcd(int a, int b) { return b != 0 ? gcd(... | 1 | 56,898,452 |
#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... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a,T b){if(a<b){a=b;return 1;} return 0;}
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;return 1;} return 0;}
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(vec) vec.begin(),vec.end()
typedef... | 1 | 54,290,055 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main () {
ios::sync_with_stdio(0);
cin.tie(0);
char A,B;
cin >> A >> B;
if (A==B) {
cout << "H" << endl;
} else if (A!=B) {
cout << "D" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios_base::sync_with_stdio(0);cin.tie(0);
char a,b;
cin>>a>>b;
if(a=='H') cout<<b<<'\n';
else cout<<(b=='H'?'D':'H')<<'\n';
} | 1 | 72,386,608 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ios_base::sync_with_stdio(0);
ll n,m;
cin>>n>>m;
vector<pair<ll,ll> > x;
for(ll i=0;i<n;i++){
ll a,b;
cin>>a>>b;
x.push_back(make_pair(a,b));
}
sort(x.begin(), x.end());
ll sum=0, cnt=0... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
using ll = long long;
using PP = pair<int,int>;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n), b(n);
rep(i,n) {
cin >> a[i] >> b[i];
}
vector<PP> ab(n);
rep(i,n) {
ab[i] = make_pa... | 1 | 18,571,313 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
vector<int> A(4);
for(int i=0;i<6;i++){
int a;
cin>>a;
A[a-1]++;
}
for(int i:A)
if(i==3){
puts("NO");
return 0;
}
puts("YES");
} | #include<iostream>
using namespace std;
int main()
{
int a,b,c,d,e,f;
cin>>a>>b;
cin>>c>>d;
cin>>e>>f;
if(a==c||a==d){
if(a==e||a==f){
cout<<"NO";
}
else{
cout<<"YES";
}
}
else if(b==c||b==d){
if(b==e||b==f){
cout<<"NO";
}
else{
cout<<"YES";
}
}
... | 1 | 28,783,717 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
int CalcSumOfDigit(int n);
int getDigit(int n);
string upper(string str);
string lower(string str);
vector<pair<long long,long long>> prime_factorize(long long p);
vector<pair<char, long long>> runLengthEncoding(string s); ... | #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... | 1 | 13,915,047 |
#include <algorithm>
#include <climits>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <iomanip>
#include <cmath>
#include <stack>
using namespace std;
using ll = long long int;
template <class T> ostream &operator<<(ostream &os, vector... | #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<int,int>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++... | 1 | 75,274,623 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
if (m == 1) {
cout << 0 << endl;
} else {
cout << n-(m-1) - 1 << endl;
}
} | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define fo(a,b) for(int a=0;a<b;a++)
#define Sort(a) sort(a.begin(),a.end())
#define rev(a) reverse(a.begin(),a.end())
#define fi first
#define se second
#define co(a) cout<<a<<endl
#define sz size()
#define bgn begin()
#define en end()
#define pb(a) pu... | 1 | 92,827,895 |
#include <bits/stdc++.h>
#define INF (1<<30)
#define MOD 1000000007
#define l_ength size
using ll = long long;
using namespace std;
int yes(){
cout << "YES" << endl;
return 0;
}
int no(){
cout << "NO" << endl;
return 0;
}
int main(){
ll n; cin >> n;
vector<ll> a(n);
for( auto &k : a ) cin >> k;
ll acc = accumul... | #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)
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
double equal(double a, do... | 1 | 85,307,230 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define IOS ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define pf push_front
#define PI acos(-1)
#define EPS 1e-5
#define sz(v) ((int)(v).size())
#def... | #include <iostream>
using namespace std;
int main()
{
int n;
int a[200005];
int ans=0;
int cnt = 1;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
if (a[i] == cnt) {
cnt++;
}
else {
ans++;
... | 1 | 53,842,886 |
#include<iostream>
#include<vector>
#include<utility>
#include<map>
#include<algorithm>
using namespace std;
using ll = long long;
string s[110], t[110];
int main() {
int N;
cin >> N;
for (int i = 0; i < N; i++)cin >> s[i];
int M;
cin >> M;
for (int i = 0; i < M; i++)cin >> t[i];
int ans = 0;
for (int i = 0; i ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,x) for(int i=0;i<x;i++)
#define put(ans) cout << ans << endl;
int enum_divisors(int N)
{
vector<int> res;
for (int i = 1; i * i <= N; ++i)
{
if (N % i == 0)
{
res.push_back(i);
if (N ... | 1 | 53,477,866 |
#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 <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... | 1 | 23,759,384 |
#include <bits/stdc++.h>
#include <set>
#define ll long long
#include <string>
#define pb push_back
#define mp make_pair
# define pi 3.14159265358979323846
#define mod 1000000007
#define rep(i,n) for(i=0;i<n;i++)
using namespace std;
void fastio()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O0")
typedef long long int ll;
typedef long double ld;
const ll mod = 1e9+7;
const ll INF = 1e18;
#define rep(i,n) for (ll i = 0; i < (n); ++i)
#define Rep(i,a,n) for (ll i = (a); i < (n); ++i)
#define All(a) (a).begin(),(a).end()
#define Pi acos(-1)
u... | 1 | 44,627,193 |
#include <bits/stdc++.h>
#include <algorithm>
#define rep(i, n) for (int i=0; i<n; ++i)
#define all(obj) (obj).begin(),(obj).end()
using namespace std;
typedef long long ll;
long long GCD(long long x, long long y) { return y ? GCD(y, x%y) : x; }
int main(){
int r, D, x;
cin >> r >> D >> x;
ll a = r*x-D;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
using namespace std;
using P = pair<int,int>;
typedef long long ll;
int main()
{
int r,D;cin >> r >> D;
int x0 ; cin >> x0;
rep1(i, 10)
{
x0 = r*(x0) - D;
cout << x0 << endl;
}... | 1 | 59,873,466 |
#include <bits/stdc++.h>
#define FASTIO ios::sync_with_stdio(false);cin.tie(0);
#define ADD +
#define SUBTRACT -
#define MULTIPLY *
#define DIVIDE /
#define MOD %
#define INCREMENT(x) ++x
#define DECREMENT(x) --x
#define in(a,b) cin>>a>>b;
#define out(a,b) cout<<a<<endl<<b<<endl;
#define scan(a) scanf("%d",&a);
#define... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
string s;
cin>>n>>s;
if(n%2==1) cout<<"No";
else{
string t=s;
t=t.substr(0,n/2);
t=t+t;
if(t==s) cout<<"Yes";
else cout<<"No";
}
} | 1 | 86,641,008 |
#include <bits/stdc++.h>
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main(){
int a,b,c;
std::cin >> a>>b>>c;
bool ok=false;
for (int i = 1; i < 101; i++) {
if((a*i)%b==c){
ok=true;
}
}
if(ok)std::cout << "YES" << '\n';
else std::cout << "NO" ... | 1 | 46,544,965 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define inf 1001001001001001001
#define mod 1000000007
#define mod2 998244353
#define pi acos(-1)
#define all(v) v.begin(),v.end()
int main(){
int a,b;
cin>>a>>b;
ll ans=0;
if(12.5*a+12.5<=10.0... | #include <bits/stdc++.h>
using namespace std;
int main(void){
int n,a,b,i=1,j;
cin >> a >> b;
while(1)
{
if(floor (i*0.08)==a && floor (i*0.1)==b)
{
cout << i << endl;
return 0;
}
if(i>b*20)
{
cout << "-1" << endl;
r... | 1 | 4,405,189 |
#include <iostream>
#include <cmath>
#include <vector>
#include <algorithm>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
typedef long long ll;
using namespace std;
int main()
{
int n;
cin >> n;
bool flag = true;
unordered_map<int, int> mp;
for (int i = ... | #include <iostream>
#include <cmath>
#include <stdint.h>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
using namespace std;
#define int long long
#define INF (1e18)+1
int nChoosek( int n, int k )
{
if (k > n) return 0;
if (k * 2 > n) k = n-k;
if (k ... | 1 | 95,871,169 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define nl '\n'
#define st first
#define nd second
#define ins insert
#define pb push_back
#define mp make_pair
#define hashmap unordered_map
#define hashset unordered_set
signed main(){
int x, y; cin >> x >> y;
bool flag = false;
for (int i = 0; i <... | #define rep(i, n) for (int i = 0; i < (n); i++)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
ll myLongLongPow(ll base, ll times) {
ll acc = 1;
rep(i, times) acc *= base;
return acc;
}
int main() {
int X, Y;
cin >> X >> Y;
... | 1 | 13,038,850 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <map>
#include <stack>
#include <utility>
typedef long long ll;
using namespace std;
#define maxn 200000
int main()
{
ll n,m;
cin>>n>>m;
if(max(n,m)-min(n,m)>=2)
{
... | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <queue>
#include <functional>
#include <cmath>
#include <iomanip>
using namespace std;
int DP[100][100];
int main() {
long long X, Y; cin >> X >> Y;
if (abs(X - Y) <= 1)cout << "Brown" << endl;
else cout << "Alice" << endl;
return... | 1 | 81,811,482 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> array(n);
array.at(0) = 1000001;
for(int i=1;i<n;i++){
int b;
cin >> array.at(i);
}
array.push_back(1000001);
int sum = 0;
for(int i=0;i<array.size()-1;i++){
sum += min(arra... | #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);
int N; cin>>N;
vector<int> B(N-1),A(N);
rep(i,N-1) cin>>B[i];
for(int i=0; i<N; i++){
int a=1e9,b=1e9;
if(i-1>=0) a=B[i-1];
if(i<N-1) b=B[i];
A[i] = min(... | 1 | 5,442,878 |
#include <bits/stdc++.h>
#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 sp(n) cout << fixed << setprecision(n)
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... | #include<bits/stdc++.h>
using namespace std;
int main(){
cout << 100 << ' ' << 100 << endl;
int a,b,acount = 0,bcount = 0;
cin >> a >> b;
for(int i = 1;i <= 100;i++){
for(int j = 1;j <= 100;j++){
if(i <= 50){
if(acount < a-1 && i % 2 == 1 && j % 2 == 1){
cout << '.';
acount... | 1 | 37,707,035 |
#include<cstdio>
#include<algorithm>
#include<vector>
#include<set>
#include<queue>
#include<string>
#include<iostream>
#define R(i, n) for(int i = 0; i < n; i++)
#define S(a) scanf("%d", &a)
#define S2(a, b) scanf("%d%d", &a, &b)
#define S3(a, b, c) scanf("%d%d%d", &a, &b, &c)
#define SL(a) scanf("%lld", &a)
#define ... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
int64_t a = 2ll,b = 1ll;
cin >> n;
for(int i = 0; i < n - 1; i++){
a += b;
swap(a,b);
}
cout << b << endl;
return 0;
} | 1 | 72,097,271 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<string.h>
#include<math.h>
using namespace std;
int main(){
long long s,c;
cin >> s >> c;
long long cnt=0;
cnt+=min(c/2,s);
c-=2*cnt;
cnt+=c/4;
cout << cnt << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0;i<int(N);++i)
using i64 = int64_t;
using ll = long long;
int main() {
ll n,m;
cin >> n >> m;
ll ans = 0;
ll p;
p = min(n,ll(m/2));
ans += p;
n = n - p;
m = m - 2*p;
if(m < 4){
cout << ans << endl;
return 0;
}
ans +=... | 1 | 22,375,812 |
#include <bits/stdc++.h>
#define INF 5000000000000000000
#define ll long long
#define pll pair<ll, ll>
using namespace std;
int main() {
ll N;
cin >> N;
vector<ll> A(N);
bool all_neg = true, all_pos = true;
for (ll i = 0; i < N; ++i) {
cin >> A.at(i);
if (A.at(i) < 0) {
all_pos = false;
}
... | #pragma target("avx")
#pragma optimize("O3")
#include<bits/stdc++.h>
using ll = int_fast64_t;
using P = std::pair<ll,ll>;
using PP = std::pair<ll,P>;
using V = std::vector<ll>;
template<typename T> using pq = std::priority_queue<T>;
template<typename T> using rpq = std::priority_queue<T, std::vector<T>, std::greater<T>... | 1 | 68,512,983 |
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cst... | #include <iostream>
#include <algorithm>
int main(void)
{
using namespace std;
int data[3];
for(int i=0; i<3; i++){
cin >> data[i];
}
int count = 0;
for(int j=data[0]; j <= data[1]; j++){
if(data[2] % j == 0) count++;
}
cout << count << endl;
return 0;
} | 1 | 86,869,111 |
#define FOR(i, min, max) for(int (i) = (min); (i) < (max); (i)++)
#define MAX(a,b) ((a) > (b) ? (a) : (b))
#define SWAP(a,b) { int r = a; a = b; b = r; }
#include <utility>
#include <vector>
#include <math.h>
#include <algorithm>
#include <string>
#include <iostream>
using namespace std;
int main()
{
int n, c = 0, a[... | #include <iostream>
#include <algorithm>
using namespace std;
int main(){
int n,a[101],c,minv;
cin >> n;
for(int i = 0;i < n;i++){
cin >> a[i];
}
for(int i = 0;i < n-1;i++){
minv = i;
for(int j = i;j < n;j++){
if(a[j] < a[minv])
minv = j;
}
swap(a[i],a[minv]);
if(minv != ... | 1 | 7,945,677 |
#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... | #include<iostream>
using namespace std;
struct Card { char suit, value; };
void print(Card card[], int size) {
for (int i = 0; i < size; i++) {
if (i) cout << ' ';
cout << card[i].suit << card[i].value;
}
cout << endl;
}
void selection(Card cards[], int size) {
int minj;
for (int i = 0; i < size; i++) {
minj... | 1 | 75,205,945 |
#include<iostream>
using namespace std;
int main(){
int j,m,s,e,score=0;
for(int i=0;i<2;i++){
cin >> j >> m >> s >> e;
if(score<j+m+s+e) score = j + m + s + e;
}
cout << score << endl;
return 0;
} | #include<iostream>
#include<sstream>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<string>
#include<stack>
#include<queue>
#include<deque>
#include<set>
#include<map>
#include<algorithm>
#include<functional>
#include<utility>
#include<cmath>
#include<ctime>
#include<complex>
using namespace std;
#define ... | 1 | 59,010,636 |
#include <bits/stdc++.h>
using namespace std;
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
string s,t="qwertasdfgzxcvb";
while(1){
cin>>s;
if(s=="#")break;
int ans=0;
bool p=true;
for(int i=0;i<t.size();i++){
if(s[0]==t[i])p=false;
}... | #include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <cmath>
#include <string>
#include <sstream>
#include <iomanip>
#include <complex>
using namespace std;
#define ll long long
#define vvi vector< vector<int> >
#define All(X) X.begin(),X.end()
#define FOR... | 1 | 16,877,922 |
#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;
int b = 0;
ll ans = 0;
rep(i, s.size()) {
if (s[i] == 'B') ++b;
else ans += b;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef vector<char> vc;
typedef queue<ll> ql;
typedef deque<ll> dql;
typedef priority_queue<ll> pql;
typedef set<ll> sl;
typedef pair<ll, ll> pl;
typedef vector<vl> vvl;
ty... | 1 | 56,557,499 |
#include<bits/stdc++.h>
using namespace std;
#define INF 1000000007
#define LINF 1000000000000000007
typedef long long ll;
typedef pair<ll,ll> P;
int n;
bool use[1010101] = {0};
int main(){
cin >> n;
int cnt = 0, i;
for(i = 1; cnt < n; i++){
cnt += i;
}
if(cnt == n){
for(int j = 1; j < i; j++){
cout << j <<... | #include <bits/stdc++.h>
using namespace std;
long long N;
int main() {
scanf("%lld", &N);
long long lo = 1, hi = 1e7, mid, ans;
while (lo <= hi) {
mid = (lo + hi) / 2;
if (mid * (mid + 1) / 2 >= N) {
ans = mid;
hi = mid - 1;
} else {
lo = mid + 1;... | 1 | 1,330,550 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll w, h; cin >> w >> h;
vector<pair<ll, bool> > v;
for(ll i = 0; i < w + h; ++i){
ll p; cin >> p;
v.push_back(pair<ll, bool>(p, i < w));
}
ll ans = 0;
ll po[] = {w + 1, h + 1};
sort(v.begin(), v.end());
for(auto e : v){
ans += ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vl;
typedef pair<ll, ll> PP;
#define rep(i, n) for(ll i = 0; i < ll(n); i++)
#define all(v) v.begin(), v.end()
#define inputv(v, n) \
vl v; ... | 1 | 55,555,432 |
#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;
int calc_year_days(int Y, int M, int D) {
int count = 0;
if (Y%3 == 0) {
count += (20 - D + 1);
M++;
count += (10 - M + 1)*20;
} else {
if (M%2 == 1) {
count += (20 - D + 1);
} else {
count += (19 - D... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define repi(i,a,b) for(int i=(a);i<(b);i++)
#define rep(i,a) repi(i,0,a)
#define repd(i... | 1 | 3,874,861 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1001001001;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, M;
cin >> N >> M;
priority_queue<int> A;
rep(i, N) {
int a;
cin >> a;
A.push(a);
}
int odd = 0;
rep(... | #include <cstdio>
#include <cstdlib>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define repi(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,a) repi(i,0,a)
#define r... | 1 | 28,551,254 |
#include<bits/stdc++.h>
#define st first
#define nd second
#define pb push_back
#define ppb pop_back
#define umax(x,y) x=max(x,y)
#define umin(x,y) x=min(x,y)
#define ll long long
#define ii pair<int,int>
#define iii pair<ii,int>
#define iiii pair<ii,ii>
#define sz(x) ((int) x.size())
#define orta ((bas+son)>>1)
#defin... | #include <bits/stdc++.h>
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=(int)(a)-1;i>=(int)(b);--i)
#de... | 1 | 67,120,312 |
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <queue>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cst... | #include <bits/stdc++.h>
using namespace std;
int main()
{
long long K;
scanf("%lld",&K);
long long arr[50];
for(int i=0;i<50;i++)
{
arr[i] = i + (K/50);
}
for(int i=0;i<(K%50);i++)
{
arr[i] += (long long)50;
for(int j = 0;j<50;j++)
{ if(j == i)
... | 1 | 85,576,759 |
#include <bits/stdc++.h>
using namespace std;
typedef long lint;
typedef long long llint;
typedef pair<int, int> pint;
typedef pair<long long, long long> pllint;
bool compPair(const pint& arg1, const pint& arg2) { return arg1.first > arg2.first; }
template<class T> void chmax(T& a, T b) { if (a < b) { a = b; } }
templa... | #include <bits/stdc++.h>
using namespace std;
int main() {
string c ;
cin >> c;
if (c[0] == 'a' || c[0] == 'i' || c[0] == 'u' || c[0] == 'e' || c[0] == 'o') {
cout << "vowel" << endl;
}
else {
cout << "consonant" << endl;
}
return 0;
} | 1 | 37,709,166 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.