code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <iostream>
#include <string.h>
int main()
{
char main_string[1000], sub_string[1000];
std::cin >> main_string;
std::cin >> sub_string;
int difference = strlen(main_string) - strlen(sub_string) + 1;
int max_same_char[difference];
for (int i = 0; i < difference; i++)
{
max_sam... | #include <bits/stdc++.h>
#define ll long long
#define ar array
#define AC ios_base::sync_with_stdio(0); cin.tie(NULL);
using namespace std;
const int M = 1e9+7;
const int N = 5*1e5;
vector<vector<char>> grid;
vector<vector<char>> tmp;
int h, w, k;
void do_paint(int i, int j){
for(int x=0; x<h; x++){
if((i>>... | 0 | 71,565,183 |
#include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
char s[100];
int main() {
int n; scanf("%d", &n);
list<int>ls;
rep(i, n) {
scanf("%s", s);
if (!strcmp(s, "insert")) {
int x; scanf("%d", &x);
ls.push_front(x);
}
else if (!strcmp(s, "delete")) {
int x; scanf("%d", &x)... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
constexpr int INF = numeric_limits<int>::max()/2;
constexpr long long LINF = numeric_limits<long long>::max()/3;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(v) (v).beg... | 0 | 71,859,902 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<string>
#include<cmath>
#include<numeric>
using namespace std;
int main(void) {
string s, p;
cin >> s >> p;
s += s;
for(int i=0; i<s.size(); i++){
bool f = true;
for(int j=0; j<p.size(); j++){
if( i+j >= s.size() ){
... | #define _GLIBCXX_DEBUG
#include"bits/stdc++.h"
using namespace std;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define OneToN(i,n) for(ll i=1;i<(ll)(n+1);i++)
#define ZeroToN(i,n) for(ll i=0;i<(ll)(n+1);i++)
#define AToB(i,a,b) for(ll i=a;i<(ll)(b+1);i++)
#define FOR(i,a,b... | 0 | 93,050,945 |
#include <bits/stdc++.h>
using namespace std;
#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 ll = long long;
using P = pair<int, int>;
#define debug(var) cout << "[" << #var << "] " ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
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 main(){
int n;
string s,t;
... | 0 | 13,836,319 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... | #include <bits/stdc++.h>
using namespace std;
const int _A = 100000;
int L[100009], A[100009];
long long ans[100009], F1[100009], F2[100009];
vector<int> S;
void upd(long long F[], int x, int y) {
for(int i=x; i<=_A; i+=(i&-i)) F[i] += y;
}
long long get(long long F[], int x) {
long long ret = 0;
for(int i=x; i>=1; ... | 0 | 76,283,208 |
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
const long long MOD=1e09+7;
#define rep(i,n) for(int i=0;i<n;i++)
#define vi vector<int>
int main(){
int n;
cin>>n;
vi height(n);
rep(i,n){
int tmp;
cin>>tmp;
height.at(i)=tmp;
}
vi maxes(n);
int tmp=height.at(0);
maxes.at... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for (int i = (a); i < (int)(b); ++i)
#define endl "\n"
typedef long long ll;
const double pi=3.14159265358979323846;
int ctoi(const char c) {
if ('0' <= c && c <= '9') return (c - '0');
return -1;
}
vector<int> input(int n) {
vector<int> vec(n... | 0 | 20,288,055 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int q; cin >> q;
string A, B;
for (int i=0; i<q; i++) {
cin >> A >> B;
vector<vector<int>> LCS(A.length()+1, vector<int>(B.length()+1,0));
int ans=0;
for (int j=0; j<A.length(); j++) {
for (int k=0; k<B.length(); k++) {
if(A[... | #include <iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<queue>
#include<cmath>
using namespace std;
typedef long long ll;
const ll MOD_CONST = 1000000007;
int main()
{
int a, b;
cin >> a >> b;
vector<string> ans(100);
for (int i = 0; i < 50; i++) {
ans[i] = string(100, '#');
}
for (int i... | 0 | 97,108,033 |
#include <iostream>
long f(long x)
{
return x * x;
}
long integral(long x_begin, long x_end, long delta)
{
long result = 0;
for (long x = x_begin; x < x_end; x += delta) {
result += f(x) * delta;
}
return result;
}
int main()
{
int input;
while (std::cin >> input) {
std::cout << integral(0, 600, input) << st... | #include <bits/stdc++.h>
using namespace std;
#define long long long
#define INF ((long) 2e18)
#define MOD ((long) (1e9 + 7))
#define umap unordered_map
int main()
{
ios::sync_with_stdio(true); cin.tie(0); cout.tie(0);
long t = 1;
while (t--) {
long k;
cin >> k;
if (k <= 9) printf("%... | 0 | 20,319,748 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll func(ll x, ll y, ll z) {
ll maxV = max({ x,y,z });
ll minV = min({ x,y,z });
return maxV - minV;
}
int main() {
ll h, w; cin >> h >> w;
ll ans = 2147483647;
for (ll y = 1; y <= h - 1; y++) {
ll sa, sb, sc;
sa = y * w;
sb = w / 2 * (h - y... | #include <bits/stdc++.h>
using namespace std;
typedef complex<double> cd;
const int LG = 18;
const int SZ = (1 << LG);
const double PI = acos(-1);
int bitreverse[SZ];
int Bitreverse(int x)
{
int y = 0;
for (int i = 0; i < LG; i++)
{
y = y * 2 + (((1 << i) & x) > 0);
}
return y;
}
int k;
vect... | 0 | 7,844,039 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MOD 1000000007
int main(void) {
string L;
vector<pair<ll, ll>> dp;
cin >> L;
dp.resize(L.size() + 1);
dp[0].second = 1;
for(ll i = 0;i < L.size();i++) {
if(L[i] == '1') {
dp[i + 1].first += (dp[i].fir... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);++i)
#define ll long long
const long long INF = 1LL<<60;
const long long mod = 1e9 + 7;
using Graph = vector<vector<int>>;
int main(){
int N;
cin >> N;
vector<int> x(N);
REP(i,N) cin >> x[i];
sort(x.begin(),x.end());
... | 0 | 78,334,247 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<string> VS;
typedef vector< vector<int... | #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>;
int main() {
int a, b, c;
cin >> a >> b >> c;
int numOfColor = 0;
if (a == b && b == c) {
numOfColor = 1;
} else if (a != b && a != c && b != c) {
... | 0 | 59,685,778 |
#include "bits/stdc++.h"
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
using namespace std;
const int maxn = 8080 * 2;
bitset<maxn> mp;
int main(){
string s;
cin >> s;
vector<int> t[2];
int p = 0, curx = maxn/2, cury = maxn/2;
while(p < s.size() && s[p] == 'F') curx++, p++;
int tot = 0... | #include<iostream>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<string>
#include<algorithm>
#include<utility>
#include<math.h>
#include<cstdlib>
#define rep(i, n) for(int i=0;i<n;i++)
#define repb(i, a, b) for(int i=a;i<b;i++)
using namespace std;
typedef pair<int, int> P;
typed... | 0 | 45,834,811 |
#include <bits/stdc++.h>
using namespace std;
int K,i;
long long dp[3][101],ans;
int main(){
string N;
cin>>N>>K;
dp[1][1]=9;
dp[2][1]=0;
dp[3][1]=0;
for(i=2;i<=(int)N.size();i++){
dp[1][i]=9*i;
dp[2][i]=81*i*(i-1)/2;
dp[3][i]=243*i*(i-1)*(i-2)/2;
}
if(K==1){cout<<dp[1][(int)N.size()-1]+(N.a... | #include <cstring>
#include <map>
#include <deque>
#include <queue>
#include <stack>
#include <sstream>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <fstream>
#include <string>
#include <cstdlib>
#include <ctime>
#include <functional>
#include <algorithm>
#includ... | 0 | 63,960,136 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(n) begin(n),end(n)
using ll = long long;
using P = pair<int,int>;
int main() {
int n;
cin >> n;
vector<ll> a;
ll sum = 0;
rep(i,n) {
int x;
cin >> x;
sum += x;
a.push_b... | #include <bits/stdc++.h>
#define int long long
#define zmrl(x) (int)((x).size())
#define ahen(x) (x).begin(), (x).end()
#define pb push_back
#define fi first
#define se second
using namespace std;
using pii = pair<int, int>;
signed main() {
ios_base::sync_with_stdio(false); cin.tie(NULL);
int n,x,m; cin>>n>>x>>... | 0 | 67,167,562 |
#include<iostream>
using namespace std;
int main(){
int i,l;
long long m,K,a[50];
cin >> K;
l = K%50;
m = K/50;
cout << 50 << endl;
if(K<=50){
for(i=0;i<K;i++){
a[i] = 50;
}
for(i=K;i<50;i++){
a[i] = 0;
}
}else{
for(i=0;i<l;i++){
a[i] = m+50;
}
for(i=l;i<50;i++){
a[i] = 49 - l + m ;
}
}
for(i=0;i<50;... | #include "stdio.h"
#include "stdlib.h"
#include "iostream"
#include "math.h"
#include <string.h>
#include <stack>
#include <queue>
using namespace std;
#define fori0(G) for(int i=0;i<G;i++)
#define fori1(G) for(int i=1;i<=G;i++)
#define forj0(G) for(int j=0;j<G;j++)
#define forj1(G) for(int j=1;j<=G;j++)
#define fork0(... | 0 | 56,584,853 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
int main() {
string a,b;
cin>>a>>b;
int ans=0;
REP(i,3)ans+=a[i]==b[i];
cout << ans << endl;
} | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rrep(i,n) for(ll i = 1; i <= (n); ++i)
#define drep(i,n) for(ll i = (n)-1; i >= 0; --i)
#define all(v) v.begin(),v.end()
#define len(x) (ll)(x).length()
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y... | 0 | 19,033,600 |
#include <bits/stdc++.h>
using namespace std;
#ifdef _DEBUG
#define _GLIBCXX_DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
#define int long long
#define DBG 1
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define loop(n) rep(loop, (0), (n))
#def... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
using pil = pair<int, ll>;
using uint = unsigned int;
template <typename T>
using Graph = vector<vector<T>>;
const ... | 0 | 62,784,609 |
#include<iostream>
#include<cmath>
#include<string>
using namespace std;
int a,b,c,mx;
int main(){
cin>>a>>b>>c;
mx=fmax(a,b);
mx=fmax(mx,c);
mx=a+b+c-mx;
cout<<mx;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using lpair = pair<ll, ll>;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i=(m);i<(n);i++)
#define rrep(i,m,n) for(ll i=(m);i>=(n);i--)
#define printa(x,n) for(ll i=0;i<n;i++){cout<<(x[i])<<" \n"[i==n-1];};
void print() {}
templa... | 0 | 13,779,331 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vint = vector<int>;
using vvint = vector<vint>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vchar = vector<char>;
using vvchar = vector<vchar>;
#define rep(i, n) for (int i = 0; i < n; ++i)
#pragma region Deb... | #include<bits/stdc++.h>
using namespace std;
typedef long long unsigned int ll;
#define Scd(x) scanf("%d", &x)
#define Scd2(x,y) scanf("%d%d", &x, &y)
#define Scd3(x,y,z) scanf("%d%d%d", &x, &y, &z)
#define Scll(x) scanf("%llu", &x)
#define Scll2(x,y) scanf("%llu%llu", &x, &y)
#define Scll3(x,y,z) scanf("%llu%llu%llu",... | 0 | 91,452,990 |
#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(... | #include<bits/stdc++.h>
#define rep(i,n) for (int i=0;i<(n);i++)
using namespace std;
using P = pair<int,int>;
using ll = long long;
int main() {
int h, w, k; cin >> h >> w >> k;
vector<string> c(h);
rep(i, h) cin >> c[i];
int ans = 0;
rep(i0, 1 << h){
rep(j0, 1 << w){
int count ... | 0 | 23,354,568 |
#include<iostream>
#include<stdio.h>
#include<string>
#include<vector>
#include<map>
#include<tuple>
#include<algorithm>
#include<cmath>
#include<limits>
#include<set>
#include<queue>
using namespace std;
#define int long long int
#define ll long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int gcd(int a,... | #include <bits/stdc++.h>
using namespace std;
void solve(long long N, std::vector<long long> a){
double a_mean = 0;
long long ans = 0;
for(auto i: a) a_mean += (double)i;
a_mean = a_mean/(double)N;
for(int i = 0; i < N; ++i) ans += round((double)a[i] - a_mean) * round((double)a[i] - a_mean);
cou... | 0 | 282,148 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
vector<int> a(100000,0);
for(int i=0;i<n;i++){
int x;
cin>>x;
a[x]++;
}
int minn =-1;
for(int i=1;i<100000;i++){
int www=a[i-1]+a[i]+a[i+1];
minn=max(minn,www);
}
cout<<minn<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define pb push_back
#define eb emplace_back
#define a first
#define b second
#define bg begin(... | 0 | 38,189,106 |
#include <iostream>
#include <string>
#include <map>
using namespace std;
int main(){
string str,s,mls,mcs,input[100];
map <string,int> dic;
int n,c,a,ml,mc;
getline(cin,str);
c = a = mc = ml = 0;
str += ' ';
while(str.length()){
n = str.find(' ');
s = str[c];
++c;
for(;c < n;++c){
s += str[c];
}
... | #include <bits/stdc++.h>
#define rr(i, b) for (int i = 0; i < int(b); i++)
#define vi(n, a) vector <long long> a(n); rr(i, n) cin >> a[i]
#define pvec(a) rr(i, a.size()) cout << a[i] << " "; cout << endl
#define bug(x) cout << #x << " " << x << endl
#define ll long long
#define vii vector <int>
#define PI acos(-1)
i... | 0 | 94,730,228 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#define int ll
typedef pair<int,int> pii;
#define fi first
#define se second
#define Sort(a) sort(a.begin(),a.end())
#define rep(i,n) for(int i = 0;i < (n) ; i++)
#define REP(i,n) for(int i = 0;i < (n) ; i++)
#define MP(a,b) m... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0;i<int(N);++i)
#define rep1(i,N) for(int i=1;i<int(N);++i)
#define all(a) (a).begin(),(a).end()
#define print(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<_<<", "; cerr<<"]"<<endl; }
#define printpair(v) { cerr<<#v<<": [ "; for(auto _ : v) cer... | 0 | 81,540,978 |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <queue>
#include <vector>
using namespace std;
int main() {
int n, data[6];
int max_mini = 0;
while (cin >> n) {
if (n == 0)break;
int x[86401] = { 0 };
for (int i = 0; i < n; i++) {
scanf("%d:%d:%d %d:%d:%d",&data[0],&dat... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios_base::sync_with_stdio(0);cin.tie(0);
char c;
cin>>c;
cout<<(c=='e'||c=='u'||c=='o'||c=='a'||c=='i'?"vowel\n":"consonant\n");
} | 0 | 22,501,614 |
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <math.h>
using namespace std;
int CalcSumOfDigit(int n);
string upper(string str);
string lower(string str);
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define pb push_b... | #include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <numeric>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#d... | 0 | 27,230,104 |
#include <iostream>
#include <iomanip>
#include <sstream>
#include <stdio.h>
#include <vector>
#include <stack>
#include <queue>
#include <algorithm>
#include <math.h>
#include <utility>
#include <string>
#include <ctype.h>
#include <cstring>
#include <cstdio>
#include <sstream>
#include <functional>
using namespace st... | #include <iostream>
#include <iomanip>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unorder... | 0 | 99,992,987 |
#include <iostream>
#include<queue>
#include<algorithm>
using namespace std;
typedef long long ll;
int main() {
int n;cin>>n;
ll d,a;cin>>d>>a;
vector<ll> x(n),h(n);
vector<pair<ll,ll>> p(n);
for(int i=0;i<n;i++){
cin>>x[i]>>h[i];
p[i].first=x[i];
p[i].second=h[i];
}
sort(p.begin(),p.end());
for(int i=0;i... | #include <iostream>
#include <vector>
#define int long long
using namespace std;
template<typename T>
class PriorityQueue{
private:
vector<T> d;
public:
void push(T t){
int k = d.size();
d.push_back(t);
while(k && d[(k - 1) / 2] < d[k]){
swap(d[(k - 1) / 2], d[k]);
k = (k - ... | 0 | 73,555,793 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, A,B;
cin >> N >> A;
B = N % 500;
if (A >= N % 500) {
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
} | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <map>
#include <math.h>
using namespace std;
#include <vector>
#define rep(i,n) for (ll i = 0; i < (n) ; i++)
#define INF 1e9
#define llINF 1e18
#define base10_4 10000
#define base10_5 100000
#define base10_6 1000000
#define base10_7 ... | 0 | 39,136,529 |
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
#define all(x) (x).begin(), (x).end()
const int MAX = 105;
char inp[MAX][MAX];
int H, W;
bool empty(int x, int y) {
if (inp[x][y] == '#') return false;
return true;
}
bool okay(int x, int y) { return x >= 0 && x < H && y... | #include <iostream>
using namespace std;
int main()
{
int a,b,x,c;
cin>>a>>b;
c=a-b;
if(c%2==0)
{
a=a+b;
x=a/2;
cout<<x;
}
else
{
a=a+b;
x=a/2;
x++;
cout<<x;
}
return 0;
} | 0 | 92,582,017 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
int main () {
int a, b, c;
std::cin >> a >> b >> c;
std::vector<int> di;
di.push_back(a + b);
di.push_back(b + c);
di.push_back(c + a);
std::cout << *std::min_element(di.begin(), di.end()) << "\n";
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> pll;
const ll mod=1e9+7;
const ll inf=1LL<<61;
int main() {
ll h,w;
cin >> h >> w;
vector<string> s(h);
for(ll i=0;i<h;i++) cin >> s[i];
ll f=1;
vec idx={1,0,-1,0};
vec i... | 0 | 49,790,446 |
#include <iostream>
#include <array>
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
int n, max_cnt = -1;
std::array<int, 101> arr{{}};
while (std::cin >> n) {
max_cnt = (max_cnt > ++arr[n]
? max_cnt : arr[n]);
}
for (int i = 1; i < 101; ++i) {
... | #include <iostream>
#include <vector>
int INF = 1e9;
int main(){
int n;
std::cin >> n;
std::vector<int> g(n), re(n);
for(int i = 0; i < n; i++) std::cin >> g[i] >> re[i];
int dp[n + 1][n + 1];
for(int i = 0; i < n + 1; i++){
for(int j = 0; j < n + 1; j++) dp[i][j] = INF;
if(i < n... | 0 | 98,195,859 |
#include<bits/stdc++.h>
#include<algorithm>
using namespace std;
#define pb push_back
#define csl ios_base::sync_with_stdio(false); cin.tie(NULL)
typedef long long ll;
#define reps(i,a,b) for(ll i=ll(a);i<ll(b);i++)
#define rep(i,b) for(ll i=0;i<ll(b);i++)
typedef vector<long long> vll;
typedef vector<pair<int,int>> vi... | #include <iostream>
using namespace std;
int main()
{
int t1 = 0;
int t2 = 0;
int t3 = 0;
for (int i = 0; i < 10; i++)
{
int h;
cin >> h;
if (t1 < h)
{
t3 = t2;
t2 = t1;
t1 = h;
}
else if (t2 < h)
{
t3 = t2;
t2 = h;
}
else if (t3 < h)
{
t3 = h;
}
}
cout << t1 << endl;
cou... | 0 | 82,856,077 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
int main() {
ll a, b;
cin >> a >> b;
if (a == 1) a =... | #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 rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb(x) push_back(x)
#define all(x) x.begin(), x.end()
using ll... | 0 | 18,975,532 |
#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)
typedef long long ll;
const ll mod=pow(10,9)+7;
int main()
{
ll n;
cin >> n;
ll ans = 0;
for(int i=1; i<n; i++){
ans += (n-1)/i;
... | #include <bits/stdc++.h>
using namespace std;
void print_Qbey(){cout<<
" H M#5J~d " <<endl<<
" Hm.?WMM MMB^ .Z d " <<endl<<
" MZS.` ?7WMM M#=`` (!`` d ... | 0 | 100,860,652 |
#include <bits/stdc++.h>
#define ll long long
#define pi 3.14159265358979
#define mod 1000000007
#define rep(i,n) for(ll i=0;i<n;i++)
using namespace std;
int main(){
ll n,a,b,k,p,ans;
cin >>n>>a>>b;
k=n/(a+b);
p=n%(a+b);
if(p<a){
ans=p;
}else{
ans=a;
}
ans+=k*a;
cout <... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
int main()
{
ll n,m,i,j;
cin>>n>>m;
char a[n+1][m+1];
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
cin>>a[i][j];
}
}
ll dp[n+1][m+1];
dp[1][1]=1;
ll f=0;
for(i... | 0 | 18,792,794 |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
int main() {
int N,M,X,Y;
cin>>N>>M>>X>>Y;
vector<int>x(N);
vector<int>y(M);
for(int i=0;i<N;i++){
cin>>x[i];
}
x.push_back(X);
for(int i=0;i<M;i++){
cin>>y[i];
}
y.push_back(Y);
for(int i=-100;i<=100;i++){
int miny=*min_element(y... | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <iostream>
#include <sstream>
#include <algorithm>
#include <numeric>
#include <complex>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <bitset>
#include <array>
#include <unordered_map>
#include <unordered_set... | 0 | 30,334,917 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<ll,ll> P;
#define pb push_back
#define mp make_pair
#define fr(i,n) for(int i=0;i<n;i++)
#define Fr(i,n) for(int i=0;i++<n;)
#define ifr(i,n) for(int i=n-1;i>=0;i--)
#define iFr(i,n) for(int i=n;i>0;i--)
const ll MOD=1e9+... | #include<iostream>
using namespace std;
int pos[1000001];
#include<cmath>
bool done[1000001];
int main()
{
int n;
cin>>n;
int arr[n];
int ans=n;
for(int i=0; i<n; i++) {
cin>>arr[i];
pos[arr[i]]++;
}
for(int i=1; i<=1e6; i++) {
if(pos[i]>1){ans-=pos[i];
done[i... | 0 | 69,556,723 |
#include <bits/stdc++.h>
#include <algorithm>
#define rep(i,n) for(int i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
const int mod =1e+9+7;
ll RepeatSquaring(ll a, ll n, ll p){
if(n==0) return 1;
if(n%2==0){
ll t = Repea... | #include<bits/stdc++.h>
using namespace std;
int n,k;
int a[100100];
long long sum[100100];
long long possum[100100];
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin>>n>>k;
for(int i=1;i<=n;i++){
cin>>a[i];
sum[i]=sum[i-1]+a[i];
possum[i]=possum[i-1];
if(a[i]>0)
possum[i]+=a[... | 0 | 82,322,932 |
#include <iostream>
#include <algorithm>
#include <string>
#include <queue>
#include <vector>
#include <cstdio>
#include <cstring>
#include<map>
#include<cmath>
#include<set>
#define ll long long int
#define ull unsigned long long int
#define I(a) scanf("%d",&a)
#define I2(a,b) scanf("%d%d",&a,&b)
#define I3(a,b,c) s... | #include <bits/stdc++.h>
typedef int64_t int64;
typedef uint32_t uint;
typedef uint64_t uint64;
using namespace std;
template <typename T>
inline void print(const T& rhs){ std::cout<<" = "<<rhs<<std::endl; }
template <typename T>
inline void print(const std::vector<T>& rhs){
std::cout<<" = [ ";
for(uint i=0; i<... | 0 | 45,266,081 |
#include<bits/stdc++.h>
using namespace std;
int main() {
string a,b,c;
cin >> a >> b >> c;
bool flag = false;
if(a.at(a.size()-1) == b.at(0)) {
if(b.at(b.size()-1) == c.at(0)) flag = true;
}
if(flag) cout << "YES" << endl;
else cout << "NO" << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i,n) for (int (i)=0; (i) < (n); (i)++)
int main()
{
ll N, Y;
cin >> N >> Y;
rep(i,N+1) {
rep(j,N+1) {
ll a = i;
ll b = j;
ll c = N - a - b;
if (c < ... | 0 | 89,135,002 |
#include<iostream>
#include <iomanip>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <cstdlib>
using namespace std;
int main(){
string str;
int n;
cin >> str >> n;
for(int i=0;i<n;i++){
string cmd;
cin >> cmd;
if(cmd.compare("print") == 0){
int a,b;
... | #include<bits/stdc++.h>
using namespace std;
int main(){
long long n,m;
cin>>n>>m;
long long answer=min(n,m/2);
m=m-answer*2;
answer=answer+m/4;
cout<<answer<<endl;
} | 0 | 89,571,467 |
#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... | #include<bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(long long i=(l);i<(r);++i)
#define REP(i,n) FOR(i,0,n)
#define REPS(i,n) FOR(i,1,n+1)
#define RFOR(i,l,r) for(long long i=(l);i>=(r);--i)
#define RREP(i,n) RFOR(i,n-1,0)
#define RREPS(i,n) RFOR(i,n,1)
#define int long long
#define mp make_pair
#define ... | 0 | 35,090,572 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<cmath>
#include<queue>
#include<stack>
#include<list>
#define endl "\n"
using namespace std;
using ll = long long;
const ll MOD = 1e9+7;
int main(){
int x;
cin>>x;
if(x<1200) cout<<"ABC"<<endl;
else cout<<"AR... | #include <bits/stdc++.h>
#define maxn 100000
using namespace std;
typedef long long LL;
int fa[maxn], off[maxn];
int find(int x) {
if (fa[x] == x) return x;
int temp = fa[x];
fa[x] = find(fa[x]);
off[x] += off[temp];
return fa[x];
}
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int ... | 0 | 56,705,659 |
#include<iostream>
#include<vector>
#include<algorithm>
int main(){
int max=0,count=0;
std::vector<int> vec(100);
std::vector<int> vec2(100);
std::vector<int> vec3;
while(1){
for(int i=0;i<100;i++){
std::cin>>vec[i];
vec2[vec[i]]++;
if(vec2[vec[i]]>max)max=vec2[vec[i]];
count++;
}
if(std::cin.eof... | #include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
typedef long long ll;
const int N=100005;
int n,i,a[N];
ll sum,w,c[N];
int main()
{
scanf("%d",&n);
for(i=1;i<=n;++i)
{
scanf("%d",a+i);
sum+=a[i];
}
if(sum%(1ll*(1+n)*n/2))
{
printf("NO");
return 0;
}
sum/=1ll*(... | 0 | 55,808,529 |
#include<iostream>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<utility>
#include<algorithm>
#include<cstdio>
#include<iomanip>
#include<queue>
#include<stack>
#define ll int64_t
#define Rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
const int MOD = 1000000007;
int main(){
cin.t... | #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;
int main(){
int h, w; cin >> h >> w;
int cnt[h][w];
char s[h][w];
P mv[] = {make_pair(0, 1), make_pair(1, 0)};
rep(i, h) rep(j, w) cin >> s[i][j];
int INF = 1e9;
rep... | 0 | 65,822,056 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
string char_to_string(char val) {
return string(1, val);
}
int char_to_int(char val) {
return val - '0';
}
template<class T> inline bool chmin(T& a, T b... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
const int mod=1000000007,MAX=1005,INF=1000;
int main(){
ll N;cin>>N;
vector<ll> S(N);
bool flag=true;
ll sum=0,a=0;
for(int i=0;i<N;i++){
cin>>S[i];
sum+=S[i];
a+=(i+1);
... | 0 | 50,500,518 |
#include <bits/stdc++.h>
#include <algorithm>
#define rep(i,n) for(int i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
const int mod= 1e+9+7;
int main(){
string s,t,u; cin>>s>>t>>u;
s[0]=char(s[0]-32);
cout<<s[0];
t[0]=cha... | #include <iostream>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
void solve(std::string S){
bool ans = true;
string tmp = S.substr(2, S.size() - 3);
int countC = 0;
REP(i, tmp.size())
if (tmp[i] == 'C') countC++;
if (S[0] != 'A') ans = false;
else if (countC != 1)... | 0 | 20,612,188 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int r,d,x;
cin >> r >> d >> x;
long int ans = r*x-d;
cout << ans << endl;
for(int i=0; i<9; i++) {
ans = r*ans-d;
cout << ans << endl;
}
} | #include <bits/stdc++.h>
#include <utility>
#include <vector>
using namespace std;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define deg_to_rad(deg) (((deg) / 360) * 2 * M_PI)
#define rad_to_deg(rad) (((rad) / 2 / M_PI) * 360)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for ... | 0 | 57,546,489 |
#include <bits/stdc++.h>
using namespace std;
int main() {
char po;
cin >>po;
if(po=='a' || po=='i' || po=='u' ||po =='e' ||po=='o'){cout <<"vowel"<<endl;}
else{cout<<"consonant"<<endl;}
} | #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 | 22,859,403 |
#include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for(int i = 0; i < n; ++i)
using namespace std;
int main() {
string s, t = "";
int w, tmp = 0;
cin >> s >> w;
while(tmp < s.size()){
t += s[tmp];
tmp += w;
}
cout << t << endl;
return 0;
} | #include<bits/stdc++.h>
#define parent(i) i/2
#define left(i) i*2
#define right(i) i*2+1
using namespace std;
int main(){
int h;
scanf("%d",&h);
int heap[h+1];
for(int i=1;i<=h;++i) scanf("%d",&heap[i]);
for(int i=1;i<=h;++i){
printf("node %d: key = %d, ",i,heap[i]);
if(parent(i)>0&&... | 0 | 80,000,335 |
#include<iostream>
using namespace std;
int main(){
int n;
int H[251];
cin >> n;
for(int i=1;i<n+1;++i){
cin >> H[i];
}
for(int i=1;i<n+1;++i){
if(i==1){
cout << "node " << i << ": key = " << H[i] <<", left key = "<< H[i*2]<<", right key = "<< H[i*2+1]<<", "<<endl;
}
else if(i<n/2){
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int r, g;
cin >> r;
cin >> g;
cout << g - r + g << endl;
} | 0 | 97,277,295 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, const char *argv[]) {
int a, b, c;
cin >> a >> b >> c;
int mx = max({a, b, c});
int diff = (mx - a) + (mx - b) + (mx - c);
if (diff % 2 == 1) {
diff += 3;
}
cout << diff / 2 << '\n';
return 0;
} | #include <iostream>
#include <fstream>
#include <typeinfo>
#include <vector>
#include <stack>
#include <cmath>
#include <set>
#include <map>
#include <string>
#include <algorithm>
#include <cstdio>
#include <queue>
#include <iomanip>
#include <cctype>
#include <random>
#define syosu(x) fixed<<setprecision(x)
using name... | 0 | 5,090,760 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
ll n;
cin>>n;
ll ans=1000000000005;
for(ll i=1;i<=sqrt(n);i++){
ll j=n/i;
if(j*i==n) ans=min(ans,i+j-2);
}
cout<<ans<<"\n";
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
int main(){
int n;
cin>>n;
vector<int> h(n);
rep(i,n) cin>>h[i];
vector<int> g(n,0);
int ans=0;
... | 0 | 97,970,972 |
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | #include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#... | 0 | 76,056,557 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int A,B,C,D;
A=N/1000;
B=N%1000/100;
C=N%100/10;
D=N%10;
if((A==B&&B==C)||(B==C&&C==D)){
cout<<"Yes"<<endl;
}
else {
cout << "No"<< endl;
}
} | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll MOD = 1000000007;
#define vec vector<int>
#define vecll vector<ll>
#define vecst vector<string>
#define vecb vector<bool>
#define vec2(var, n, m) vector<vector<int>> var(n, vector<int>(m, 0))... | 0 | 56,657,246 |
#include <cstdio>
#include <iostream>
#include <string>
#include <map>
using namespace std;
int main(){
while(true){
map<char, char> mp;
int n, m;
scanf("%d", &n);
if(n == 0){
return 0;
}
for(int i = 0; i < n; i++){
char ci, co;
cin >> ci >> co;
mp[ci] = co;
}
s... | #include <iostream>
using namespace std;
int main() {
int A, B, C, D;
cin >> A >> B >> C >> D;
if (A + B == C + D) cout << "Balanced" << endl;
else cout << (A + B < C + D ? "Right" : "Left") << endl;
} | 0 | 15,691,003 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second
template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typen... | #include <iostream>
#include <string>
int main()
{
while(1)
{
std::string ostr = "";
std::string current = "";
std::cin >> ostr;
if (ostr == "-") {
break;
}
int n = 0;
std::cin >> n;
int shuffle[n] = {};
for (int i = 0; i < n; i... | 0 | 29,538,872 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define rep(i,x,y) for(ll i=x;i<y;i++)
#define irep(i,a) for(auto i = a.begin(); i != a.end(); ++i)
#define nvarep(n,a) ll n;cin>>n;vector<ll>a(n);rep(i,0,n)cin>>a[i]
#define vecrep(n,a,type) vector<type>a(n);rep(i,0,n)cin>>a[i]
#d... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i,n) for (int i = 0; i < (n); ++i)
struct UnionFindTree {
vector<int> par;
UnionFindTree(int n) : par(n) {
rep(i, n) par[i] = i;
}
int root(int x) {
if ( par[x] == x ) return x;
... | 0 | 98,410,881 |
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define E "\n"
using namespace std;
const long long MOD = (long long)1e9 + 7;
int N, n, a[1000009];
multiset<int> s[1000009];
int main()
{
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> N;
n = 1 ... | #include <iostream>
#include <algorithm>
using namespace std;
int main() {
const int V = 10;
const int INF = 1<<28;
int n;
while(cin >> n && n) {
int v = 0;
int g[V][V];
for(int i = 0; i < V; ++i) {
for(int j = 0; j < V; ++j) {
g[i][j] = i == j ? 0 : INF;
}
}
for(int i = ... | 0 | 94,522,986 |
#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; typedef pair<int,int> pii;... | #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;
double kaijyo(int n){
int k(1);
for(int i=n;i>0;i--){
k *= i;
}
return k;
}
double distance(int x[],int y[],int i,int j){
int dx = (x[i] - x[j]) ... | 0 | 51,694,101 |
#include<bits/stdc++.h>
using namespace std;
int fa[100005],k[100005];
int f(int u)
{
if(u==fa[u])
return u;
else
{
int t=f(fa[u]);
k[u]+=k[fa[u]];
return fa[u]=t;
}
}
int main()
{
int i,l,r,d,p,q,n,m;
cin>>n>>m;
for(i=1;i<=n;i++)
{
fa[i]=i;
k[i]=0;
}
for(i=1;i<=m;i++)
{
cin>>l>>r>>d;
if(f(l... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, x, m;
cin >> n >> x >> m;
ll f, r;
f = r = 0;
ll p, p2;
p = p2 = x;
for (ll i = 0; i < 2*m; ++i) {
(p *= p) %= m;
(p2 *= p2) %= m;
(p2 *= p2) %= m;
if (p == p2) break;
}... | 0 | 58,479,045 |
#include <bits/stdc++.h>
#define F first
#define S second
#define mp make_pair
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pi;
const ll inf = 1e18+5;
ll n;
pair<string, ll> playlist[55];
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);
cin >> n;
for (ll i= 0; i< n; i++){... | #include <iostream>
#include <cstring>
#define INF 999999
using namespace std;
int list[100][100];
int ans;
int weigh,high;
void search(int x,int y);
int main(void){
int n;
int nx[100],ny[100];
int i;
while(cin>>weigh>>high,weigh||high){
ans=0;
for(i=0;i<100;i++){
memset(list[i],0,sizeof(list[i]))... | 0 | 76,685,430 |
#include <bits/stdc++.h>
using namespace std;
vector<int> dp;
int q(int x) {
if (dp[x]) return dp[x];
cout << x << endl;
string s; cin >> s;
if (s == "Vacant") exit(0);
if (s == "Male") return dp[x] = -1;
return dp[x] = 1;
}
bool f(int s, int t) {
int o = (s - t) & 1;
if (o) return q(s) == q(t);
return q(s) !=... | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
using ll = long long;
using ld = long double;
#define vl vector<long long>
#define vvl vector<vector<long long>>
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
using pll = pair... | 0 | 100,458,948 |
#include<iostream>
#include<vector>
#include<map>
#include<algorithm>
#include<math.h>
#include<queue>
#include<stack>
#include<iomanip>
#include<cstring>
#include<string>
#include<set>
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
using namespace std;
using ll = long long int;
const l... | #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... | 0 | 27,045,950 |
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void... | #include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define LCM(a, b) (a) / __gcd((a), (b)) * (b)
#define CEIL(a, b) (a)/(b)+(((a)%(b))?1:0)
#define log_2(a) (log((a)) / log(2))
#define ln '\n'
using n... | 0 | 48,543,300 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b , c , d;
cin >> a >> b >> c;
d = max ( a, max ( b,c)) ;
cout << ( d==b ? a+10*b+c : d==a ?10*a + b + c : a+b+10*c ) <<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i<(int)(n); i++)
#define all(x) x.begin(), x.end()
#define mod 1000000007
typedef long long ll;
int main(){
ll n;
cin >> n;
vector<ll> vec(n+1);
for(ll i=0; i<=n; i++) cin >> vec[i];
ll res = 0;
ll current = 0;
vector<ll> mx(n+1... | 0 | 29,903,712 |
#include <iostream>
#include <cstdio>
#include <climits>
#include <cmath>
#include <algorithm>
#include <utility>
#include <vector>
#include <string>
#define MAX 200000
#define INFTY 1<<30
using namespace std;
static const int N = 1000;
int main()
{
int n, p[N+1], m[N+1][N+1]; cin >> n;
for(int i = 1; i <= n; i++)
... | #include<bits/stdc++.h>
typedef long long ll;
ll gi(){
ll x=0,f=1;
char ch=getchar();
while(!isdigit(ch))f^=ch=='-',ch=getchar();
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
int c[101];
void cxk(int i,int j){if(c[i]<j)puts("Impossible"),exit(0);}
int main(){
#ifdef XZZSB
freopen("in.in","r",std... | 0 | 69,499 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
string s;
cin >> s;
bool found = true;
if(n&1){
cout << "No" << endl;
}else{
int x = 0, y = n/2;
while(x < n/2 && y < n){
if(s[x] != s[y]){
found = false;
... | #include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#de... | 0 | 82,758,056 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c; cin >> a >> b >> c;
int ans;
if (a == b && b == c) ans = 1;
else if (a != b && b != c && c != a) ans =3;
else ans =2;
cout << ans << endl;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define int long long
#define pb push_back
#define For(i,n) f... | 0 | 80,950,937 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define loop(__x, __start, __end) for(int __x = __start; __x < __end; __x++)
int main() {
int n; cin >> n;
vector<int> A(n);
loop(i,0,n) cin >> A[i];
int max_ = 0;
loop(i,0,n-1) {
loop(j,i+1,n) {
int d = abs(A[i]-A[j]);
if (max... | #include <bits/stdc++.h>
using namespace std;
template <class t>
using vc = vector<t>;
template <class t>
using vvc = vector<vector<t>>;
typedef long long ll;
typedef vc<int> vi;
typedef vvc<int> vvi;
typedef pair<int, int> pi;
#define uset unordered_set
#define umap unordered_map
#define endl "\n"
#define fi first
#de... | 0 | 18,300,057 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
for ( int i = 0; i < 3; i++ ) {
cout << (s[i] == '1' ? '9' : '1' ) ;
}
cout << endl;
return (0);
} | #include <bits/stdc++.h>
using namespace std;
typedef complex<long long> point;
#define EPS 1e-11
#define X real()
#define Y imag()
#define angle(v) (atan2((v).Y, (v).X))
int dcmp(const double &a, const double &b) {
if (fabs(a - b) < EPS)
return 0;
return ((a > b) << 1) - 1;
}
int main() {
#ifndef ON... | 0 | 80,699,207 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
int main() {
string S, T;
cin >> S >> T;
map<char, c... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
template<typename T> void drop(const T &x){cout<<x<<endl;exit(0);}
void solve() {
int n,m; cin >> n >> m;
vector<string> a(n),b(m);
for(int i=0; i<n; ++i) cin >> a.at(i);
for(int i=0; i<m; ++i) cin >> b.at(i);
for(int i=0; i<n-m+1; ++i) {
... | 0 | 53,080,873 |
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; ++i)
using namespace std;
int main(){
long long n, k, a; cin >> n >> k;
map<long long, long long> m;
rep(i, n){
long long c, d; cin >> c >> d;
m[c] += d;
}
for(auto p: m){
k -= p.second;
if(k <= 0){
a = p.first;
break;... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define int ll
#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define pb push_back
#define eb emplace_back
#define a first
#define b second
#d... | 0 | 54,448,461 |
#include <bits/stdc++.h>
#define For(i, a, b) for(int (i)=(a); (i)<(b); ++(i))
#define rFor(i, a, b) for(int (i)=(a)-1; (i)>=(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef pair<int, int> pii;
typ... | #include <bits/stdc++.h>
using i64 = long long;
int main() {
int n;
std::cin >> n;
std::vector<int> a(1 << n);
for (auto &e : a) std::cin >> e;
std::vector<std::pair<int, int>> dp(1 << n, std::make_pair(-1, -1));
for (int i = 0; i < (1 << n); i++) {
dp[i].first = i;
}
for (int i ... | 0 | 15,601,947 |
#include<bits/stdc++.h>
using namespace std;
void read(int &x) {
x=0;int f=1;char ch=getchar();
for(;!isdigit(ch);ch=getchar()) if(ch=='-') f=-f;
for(;isdigit(ch);ch=getchar()) x=x*10+ch-'0';x*=f;
}
void print(int x) {
if(x<0) putchar('-'),x=-x;
if(!x) return ;print(x/10),putchar(x%10+48);
}
void wr... | #include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
using namespace std;
int s[1000][1000];
int n;
int k;
int main(){
cin>>n;
int m=2;
bool flag=false;
s[1][1]=1;
k=1;
while(k<100000){
for(int i=1;i<=m-1;i++,k++)
s[i][m-1]=s[m][i]=k;
if(k-1==n){
... | 0 | 91,764,864 |
#include <iostream>
#include <map>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <sstream>
#include <cmath>
#include <math.h>
#include <string>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n , a , b;
cin >> n >> a >> b;
int... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i = 0;i < n;i++)
#define repr(i, n) for(int i = n;i >= 0;i--)
#define For(i, s, e) for(int i = s;i <= e;i++)
#define Sort(v, n) sort(v, v+n);
#define VSort(v) sort(v.begin(), v.end());
#define ll long long
#define pb(a) push_back(a)
#define I... | 0 | 14,773,537 |
#include <iostream>
using namespace std;
int main()
{
for (int i=0; ;++i ) {
int x;
cin>>x;
if(x==0)
break;
else{
cout<<"Case "<<i+1<<": "<<x<<endl;
}
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<=ll(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=ll(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=ll(b);i--)
#define FORA(i,I) for(const auto& i:I)
#define ALL(x) x.begin(),x.end()
#define... | 0 | 38,935,386 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
ll a,b,c;
cin>>a>>b>>c;
ll d=abs(a-b)+abs(b-c);
ll e=abs(a-c)+abs(b-c);
ll f=abs(a-c)+abs(a-b);
cout<<min(d,min(e,f))<<endl;
return 0;
} | #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <algorithm>
#include <iomanip>
#include <queue>
#include <string>
#include <utility>
#include <cassert>
#include <numeric>
#include <random>
using namespace std;
typedef long long ll;
string grid[2048];
vector<int> rows[2048],... | 0 | 38,150,625 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int n;
cin>>n;
int h[n];
for(int i=0;i<n;i++)
{
cin>>h[i];
}
int curr = 0;
int ans = 0;
for(int i=0;i<n-1;i++)
{
if( h[i] >= h[i+1])
{
curr++;
ans = max... | #pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma comment(linker, "/STACK:1024000000,1024000000")
#include "bits/stdc++.h"
using namespace std;
#define pb push_back
#define F first
#define S second
#define f(i,a,b) fo... | 0 | 81,344,832 |
#include <bits/stdc++.h>
using namespace std;
#define REPR(i, n) for(int i = n; i >= 0; i--)
int main() {
string s;
cin >> s;
REPR(i, s.size() - 1) cout << s[i];
cout << endl;
return 0;
} | #include <bits/stdc++.h>
#define ull unsigned long long
#define ll long long
#define endl '\n'
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define line cout<<"----------------------------------"<<endl
#define fast ios_base::sync_with_stdio(false); cin.tie(0);cout.tie(0);
#define filein freopen("inp... | 0 | 93,583,243 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int m;
string s;
cin >> s;
m=s.at(6)-'0'+(s.at(5)-'0')*10;
if(m>4){
cout << "TBD" << endl;
}else{
cout << "Heisei" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
long long total = 0;
for (long long i = 1; i * i <= N; i++) {
if (N % i == 0) {
total = i;
}
}
long long result = N / total;
long long count = 0;
while (result != 0) {
result = result / 10;
count++;
}
cout << count <<... | 0 | 86,998,881 |
#include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <iomanip>
#include <stdlib.h>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <time.h>
using namespace std;
typedef long long ll;
typedef long double ld;
ty... | #include <cstdio>
#include <vector>
#include <string>
using namespace std;
typedef unsigned long long llong;
#define MAX 200001
int main()
{
llong N, P;
char S[MAX];
llong mod = 0, ans = 0;
llong T[MAX], M[MAX];
M[0] = 1;
T[0] = 1;
scanf("%llu%llu", &N, &P);
for (llong i = 1; i < P; i++)
{
M[i] = ... | 0 | 68,813,367 |
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int w, h, x, y, r;
cin >> w >> h >> x >> y >> r;
if (r <= x && x <= w - r && r <= y && y <= h - r) cout << "Yes" << endl;
else cout << "No" << endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for(ll i = ll(0); i < ll(n); i++)
#define Rep(i, n) for(ll i = ll(1); i < ll(n); i++)
#define ALL(a) (a).begin(),(a).end()
#define IOS ios::sync_with_st... | 0 | 84,384,416 |
#include <bits/stdc++.h>
using namespace std;
int main()
{int N, s{}; cin >> N;
int D[N]; for (int &d : D) cin >> d;
for (int i{}; i < N; ++i) for (int j{i + 1}; j < N; ++j) s += D[i] * D[j];
cout << s;} | #include <bits/stdc++.h>
using namespace std;
const int N = 100020;
int n,q,f[N][30]; long long x[N],L;
int main(void)
{
scanf("%d",&n);
for (int i=1;i<=n;i++) scanf("%lld",&x[i]);
scanf("%lld\n%d",&L,&q);
for (int i=1;i<=n;i++)
f[i][0] = upper_bound( x+1 , x+n+1 , x[i] + L ) - x - 1;
for (i... | 0 | 89,126,025 |
#include <iostream>
using namespace std;
int main () {
int a , b , c , count;
cin >> a >> b >> c ;
for (int i=a;i<=b;i++) {
if ( c%i==0 ) {
count = count + 1;
}
}
cout << count << endl;
return 0;
} | #include<bits/stdc++.h>
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=(int)a, i##_len=(b); i<i##_len; i++)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define int long long
using namespace std;
using P = pair<int, int>;
using ll = long long;
... | 0 | 3,956,075 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using ll = long long;
using ld = long double;
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define rep3(i, n) for (ll i = 1; i < (ll)(n+1); i++)
#define rep4(i, s, n) for (ll i = (s); i < ... | #include <iostream>
using namespace std;
double equ(double x1, double y1, double x2, double y2, double x, double y){
return (x1-x2)*(y-y1) - (y1-y2)*(x-x1);
}
bool same_side(double x1, double y1, double x2, double y2,
double xa, double ya, double xb, double yb){
return equ(x1, y1, x2, y2, xa, ya)... | 0 | 94,664,996 |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define dump(x) cout << x << '\n'
typedef int64_t Int;
const double pi = M_PI;
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
bool ans = true;
if (a + b < c) {
ans = false;
}
if (ans)
cout << "Yes" << endl;
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const double PI = 3.1415926535897932;
long long GCD(long long a, long long b) {
if (b == 0... | 0 | 13,049,085 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
#define VL vector<ll>
#define VVL vector<vector<ll>>
int main(){
ll N, M;
cin >> N >> M;
VVL a(N, VL(2,0));
VL c(N);
rep(i,0,N){
cin >> a[i][0] >> a[i][1];
}
... | #include <bits/stdc++.h>
#define rep(i, n) \
for (int64_t i = 0; i < (int64_t)(n); i++) \
;
using namespace std;
using vi = vector<int64_t>;
using vvi = vector<vi>;
using namespace std;
int main() {
cin.tie(0);
... | 0 | 94,022,233 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
const int N = 1e5 + 5;
int n, m, k, ans;
int a[N];
int main() {
... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
ios::sync_with_stdio(false);
int N; cin >> N;
vector<int> A((1 << N) + 1);
for (int i = 0; i < (1 << N); ++i) {
cin >> A[i];
}
A[1 << N] = -1;
vector<int> best1(1 << N, 1 << N), best2(1 << N,... | 0 | 67,521,692 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
#define mem(a,v) memset((a), (v), sizeof (a))
#define enl printf("\n")
#define case(t) printf("Case #%d: ", (t))
#define ni(n) scanf("%d", &(n))
#define nl(n) scanf("%lld", &(n))
#define nai(a, n) ... | #include <iostream>
#include <cstdio>
#include <vector>
#include <iomanip>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <map>
#include <set>
#include <cmath>
using namespace std;
using VLL = vector <long long>;
using VB = vector <bool>;
int main() {
int N;
cin >> N;
VLL an... | 0 | 88,420,885 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
ll n,m,d;
cin >> n >> m>> d;
long double ans = ((max(n-2*d,0LL)%n +n) *(m-1))/(long double)(n*n);
cout << setprecision(10)<< ans << endl;
return 0;
} | #include<iostream>
#include<string>
#include<list>
using namespace std;
int main(){
int n;
list<int> N;
cin >> n;
string command;
int a;
for(int i=0; i<n; i++){
cin >> command;
if(command=="insert"){
cin >> a;
N.push_front(a);
}else if(command=="de... | 0 | 39,968,674 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define SP << " "
#define LLi long long int
using namespace std;
int imax=2147483647;
long long int llimax=9223372036854775807;
void PV(vector<int> pvv) {
rep(i, pvv.size()) cout << pvv[i] SP;
cout << endl... | #include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < n; i++)
#define ALL(a) a.begin(), a.end()
#define MOD 998244353
using namespace std;
typedef long long ll;
ll power(ll n, ll p, ll mod) {
ll ans = 1;
while (p > 0) {
if (p & 1) ans = ans * n % mod;
n = n * n % mod;
p >>= 1... | 0 | 95,074,849 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);
template<class T> using PQ = priority_queue<T>;
template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>;
constexpr long long MOD = (long long)... | #if 0
#endif
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef complex<double> xy_t;
const double EPS = 1e-11;
double dot_product(xy_t a, xy_t b) {
return (conj(a)*b).real();
}
double cross_product(xy_t a, xy_t b) {
return (conj(a)*b).imag();
}
xy_t projection(xy_t p, xy_t b) {
retur... | 0 | 14,158,247 |
#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... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define fi first
#define se second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define debug(a) cout << #a << " = " << a << " ";
#define endl "\n"
const int MOD=1000000007;
const int N=100010;
void solve(){
int n;
cin>>n;
... | 0 | 73,464,554 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <iterator>
#include <set>
#include <map>
#include <cmath>
#include <deque>
#include <queue>
#include <string>
#include <cstring>
#include <stack>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define PB push_back
#define M... | #include <iostream>
#include <cstdlib>
using namespace std;
class element{
public:
int key;
char org[2];
int postition;
};
void bubble(element *arr, int n);
void select(element *arr, int n);
int main()
{
int n;
cin>>n;
element arr[n];
element arr2[n];
for(int i = 0;i < n;... | 0 | 10,429,478 |
#include<bits/stdc++.h>
using namespace std;
int n,a[201];
long long ans=0;
int main()
{
scanf("%d",&n);
n*=2;
for (int i=1;i<=n;i++)
scanf("%d",&a[i]);
sort(a+1,a+1+n);
for (int i=1;i<=n;i+=2)
ans+=a[i];
printf("%lld",ans);
return 0;
} | #include <stdio.h>
#include <iostream>
#include <queue>
#include <cstdio>
#include <stack>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <string.h>
#include <limits.h>
#include <map>
#include <string>
#include <bitset>
#include <vector>
using namespace std;
queue <long long >q;
int main() {
int ... | 0 | 66,821,960 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int h, n, temp;
cin >>h >>n;
for(int i =0; i <n; ++i){
cin >> temp;
h -= temp;
}
if(h>0){
cout<<"No";
}
else{
cout<< "Yes";
}
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int N,ans = 0,max = -1;
cin >> N;
vector<int> H(N);
for(int i = 0;i < N;i++){
cin >> H.at(i);
}
for(int i = 0;i < N;i++){
if(max <= H.at(i)){
max = H.at(i);
ans++;
}
}
cout << ans <<... | 0 | 84,087,396 |
#include <iostream>
#include <math.h>
using namespace std;
int main(){
char c;
cin>>c;
int x=int(c);
if(x==97||x==101||x==105||x==111||x==117){
cout<<"vowel";}
else{
cout<<"consonant"<<endl;}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define all(v) v.begin(), v.end()
#define sz(v) v.size()
#define INF 100000000000000
template <typename T>
bool chmax(T &a, const T& b) {
if ... | 0 | 20,926,714 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
#include <climits>
#include <iomanip>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
int main(){
ll h,w,d;
cin >> h >> w >> d;
ll si = h*w / d + 1;
vector<vector<pair<ll,ll>>>... | #ifdef __LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
template<typename T> bool chmax(T &a,T b) {if(a<b) {a=b; return true;} return false;}
template<typename T> bool chmin(T &a,T b) {if(a>b) {a=b; return true;} return false;}
#define itn int
#define fi first
#define se second
#def... | 0 | 72,315,097 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.