code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 45 101M |
|---|---|---|---|
#include <bits/stdc++.h>
#define rep(i,a,n) for(int i=a;i<n;i++)
#define repb(i,a,b) for(int i=a;i>=b;i--)
#define all(a) a.begin(),a.end()
#define o(a) cout<<a<<endl
#define int long long
#define fi first
#define se second
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
... | #include<iostream>
#include<cstdio>
using namespace std;
int main(void){
char r[1000000];
int count = 101;
char s;
char c;
int maru=0;
int shikaku=0;
while(true){
scanf("%c",&s);
if(s=='\n')scanf("%c",&s);
if(s=='.')break;
else if(s=='('){
r[count++]=')';
maru++;
}
else... | 1 | 6,561,054 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
unordered_map<int, int> map;
vector<int> balls;
rep(i, n) {
int a;
cin >> a;
map[a]++;
balls.push_back(a);
}
ll total = 0;
for (auto buck... | #include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define all(x) (x).begin(),(x).end()
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { ... | 1 | 42,916,309 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int M = 100000+10;
const int mod = 1e9 + 7;
int n;
vector<int> id;
int vis[M];
ll fact[M];
ll inv (ll x) {
ll ret = 1;
for (int i=mod-2; i; i>>=1) {
if (i&1) ret = ret*x%mod;
x = x*x%mod;
}
return ret;
}
ll C(int n,int k) {
if (n<k) retur... | #include <cstdio>
typedef long long int64;
static const int MAXN = 1e5 + 4;
static const int MODULUS = 1e9 + 7;
#define _ % MODULUS
#define __ %= MODULUS
int n, d1 = -1, d2 = -1;
int occ[MAXN];
int64 fact[MAXN], fact_inv[MAXN];
inline int64 qpow(int64 base, int exp)
{
int64 ans = 1;
for (; exp; exp >>= 1, (ba... | 1 | 64,993,067 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ff first
#define ss second
#define pb push_back
#define vll vector<ll>
#define mll map<ll,ll>
#define MOD 1000000007
#define pll pair<ll,ll>
constexpr ll INF = 1999999999999999997;
#define fastio ios_base:... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<deque>
#include<functional>
#include<iterator>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<utility>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define a firs... | 1 | 49,534,481 |
#include <iostream>
using namespace std;
int main() {
int a,b;
char o;
cin>>a>>o>>b;
if(o=='+'){
cout<<a+b;
return 0;
}
cout<<a-b;
} | #include <bits/stdc++.h>
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(0); std::cout.tie(0);
std::string s;
std::getline(std::cin, s);
std::istringstream iss(s);
int a = 0, b = 0;
char o = ' ';
iss >> a >> o >> b;
if (o == '+')
std::cout << a + b << std::en... | 1 | 73,521,142 |
#include <algorithm>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
vector<int> H(10);
for (int i = 0; i < 10; ++i)
cin >> H[i];
sort(H.begin(), H.end(), greater<int>());
for (int i = 0; i < 3; ++i)
cout << H[i] << endl;
retu... | #include<stdio.h>
#include<algorithm>
using namespace std;
long long int nums[10];
void input()
{
int i;
for (i = 0; i < 10; i++)
scanf("%lld", &nums[i]);
sort(nums,nums+10);
printf("%lld\n%lld\n%lld\n", nums[9], nums[8], nums[7]);
}
int main()
{
input();
return 0;
} | 1 | 27,683,041 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
constexpr ll INF = 1e18;
constexpr ll MOD = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) v.begin(), V.en... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<(b);i++)
#define repr(i,b,a) for(int i=int(b);i>=(a);i--)
#define all(x) x.begin(),x.end()
const ll mod = 1e9+7;
const ll INF = 1e9;
ll gcd(ll a... | 1 | 100,724,359 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int N4 = N/1000;
int N3 = (N-N4*1000)/100;
int N2 = (N-N4*1000-N3*100)/10;
int N1 = N-N4*1000-N3*100-N2*10;
if (((N4 == N3) && (N3 == N2))
|| ((N3 == N2) && (N2 == N1))) {
cout << "Yes" << endl;
}
else {
cout << ... | #include <iostream>
#include <vector>
using namespace std;
int main()
{
int n;
vector<int> v;
cin >> n;
for(int i = 0; i < 4; i++)
{
int t = n % 10;
v.push_back(t);
n /= 10;
}
if((v[0]==v[1] && v[1]==v[2]) ||
(v[1]==v[2]) && v[2]==v[3])
cout << "Yes" << endl;
else
cout << "No" <<... | 1 | 19,954,127 |
#include <stdio.h>
int main()
{
int n;
scanf("%d", &n);
int n1 = n / 100;
int n2 = (n % 100) / 10;
int n3 = n % 10;
if (n1 == 7 || n2 == 7 || n3 == 7)
{
printf("Yes", n);
}
else
{
printf("No", n);
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(0);
string n;
cin >> n;
for (int i = 0; i < n.size(); ++i) {
if(n[i] == '7') {
cout << "Yes\n";
return 0;
}
}
cout << "No\n";
} | 1 | 9,992,749 |
#include<bits/stdc++.h>
using namespace std;
long long int a[200005],sum[200005];
int main()
{
map<long long int ,long long int >mp;
int n,k;
long long int ans=0;
cin>>n>>k;
sum[0]=0;
for(int i=1;i<=n;i++)
{
cin>>a[i];
sum[i]=sum[i-1]+a[i];
}
for(int i=0;i<=n;i++)
{
if(i>=k) {
mp[(sum[i-k]-(i-k))%k]-... | #include <bits/stdc++.h>
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
using ll = long long;
using P = pair<ll,ll>;
using grid = vector<vector<int>>;
const int dx[2] = {... | 1 | 1,036,771 |
#include <iostream>
using namespace std;
int main(){
int N,A,i,j;
cin >> A >> N;
i = A*A;
j = i - N;
cout << j;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pi 3.141592653589793238
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
int main(){
fast;
ll a,b;
cin>>a>>b;
cout<<a*a-b;
return 0;
} | 1 | 2,004,379 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int Maxn = 100005;
const int Maxb = 60;
int n;
ll a[Maxn];
ll my[Maxb];
ll res;
void Write(ll num)
{
for (int i = Maxb - 1; i >= 0; i--)
if (num & 1ll << ll(i))
if (my[i] == 0) { my[i] = num; break; }
else num ... | #include <bits/stdc++.h>
#define maxn 100005
using namespace std;
typedef long long ll;
ll a[maxn],dig[63];
int vis[63];
void add(ll x){
for(int i=61;i>=0;i--){
if(!vis[i]) continue;
if(x&(1ll<<i)){
if(dig[i]) x^=dig[i];
else{
dig[i]=x;
break;
... | 1 | 77,378,695 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main()
{
int a[3];
cin>>a[0]>>a[1]>>a[2];
sort(a,a+3);
cout<<a[2]-a[0]<<endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = s; i < (int)(n); i++)
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long l... | 1 | 77,324,694 |
# include <cstdio>
# include <cmath>
#define M_PI 3.14159265358979323846
int n;
struct PointPair {
double x, y;
};
void koch(int k, PointPair p1, PointPair p2) {
if (k == 0)
return;
PointPair s, u, t;
double th = M_PI * 60.0 / 180.0;
s.x = (2.0 * p1.x + 1.0 * p2.x) / 3.0;
s.y = (2.0 * p1... | #include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
void coch(double sx,double sy,double tx,double ty,int i,int n){
if(i == n){
return;
}else{
double xx = (tx-sx) / 3.0; double yy = (ty-sy) / 3.0;
double a = sqrt(3.0) * xx / 2.0; double b = xx / 2.0;
double c = sqrt(3.0) * yy / 2.0; doubl... | 1 | 90,339,073 |
#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;
const int INF = 1e9;
const int MOD = 1000000007;
const int MAX = 1000000;
int main(){
int a,b;
cin >> a >> b;
if(a == 1 && b == 1){
cout << 1 << " " ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
using Graph = vector<vector<bool>>;
const int MOD = 1e9 + 7;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int A, B;
... | 1 | 76,552,952 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define Rep(i,n) for(int i=1;i<=n;i++)
const ll MOD = 1000000007;
using Graph = vector<vector<int> >;
long long modinv(long long a, long long m=MOD) {
long long b = m, u = 1, v = 0;
while (b) {
long... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
void dfs(int idx, map<int, set<int>>& tree, const vector<int>& add, int add_sum, vector<int>& ans, vector<bool>& is_used)
{
if(is_used[idx]) return;
add_sum += add[idx];
ans[idx] = add_sum;
is_used[idx] = true;
for(auto i : tree[idx... | 1 | 70,421,237 |
#pragma region header
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb p... | #include <bits/stdc++.h>
#define rep3(i, s, n, a) for (int i = (s); i < (int)(n); i += a)
#define rep2(i, s, n) rep3(i, s, n, 1)
#define rep(i, n) rep2(i, 0, n)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
int main(){
int n;
cin >> n;
string s;
cin... | 1 | 78,550,818 |
#include <stdio.h>
#include <iostream>
int main()
{
long long a, b, r=1, temp;
long long A, B;
std::cin >> a >> b;
A = a; B = b;
if (a < b)
{
temp = a;
a = b;
b = temp;
}
while (r != 0)
{
r = a % b;
a = a / b;
a = b;
b = r;
}
std::cout << A*B/a << std::endl;
} | #include <iostream>
#include <unordered_set>
#include <cstdint>
#include <vector>
#include <string>
#include <climits>
#include <set>
#include <algorithm>
#include <math.h>
#include <iomanip>
#include <numeric>
using namespace std;
int main()
{
long long a, b;
cin >> a >> b;
cout << lcm(a, b);
} | 1 | 65,144,514 |
#include <bits/stdc++.h>
using namespace std;
double pi = 2 * acos(0.0);
int main(){
string s; cin >> s;
if (s[0] != s[1] || s[1] != s[2]) cout << "Yes";
else cout << "No";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
string S;
cin>>S;
string ans="Yes";
if(S.at(0)==S.at(1) && S.at(0)==S.at(2)){
ans="No";
}
cout<<ans<<endl;
} | 1 | 41,324,075 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
using namespace std;
#define rep(i,j) REP((i), 0, (j))
#define REP(i,j,k) for(int i=(j);(i)<(k);++i)
#defi... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
const int MAXN = 50000;
const int MAXM = 20;
const int INF = 50000;
int res;
vector<int> nums(MAXM);
vector<int> dp(MAXN);
int main()
{
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> nums[i];
}
for... | 1 | 64,029,847 |
#include <iostream>
typedef long long ll;
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); i++)
int main()
{
std::cin.tie(0);
std::ios::sync_with_stdio(false);
int n ;
std::cin >> n ;
ll ans = 0 ;
ll a, b ;
REP(i,n){
std::cin >> a ;
if(i==0 || a==0){
ans += a/2 ... | #include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
int main(void) {
int n, i, a[100003], t, d[100003] = {};
ll asum;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
}
asum = 0;
t = 0;
for (i = 0; i < n; i++) {
asum += a[i];
if (a[i] == 0) {
t++;
}
else {
d[t] +=... | 1 | 29,524,084 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,M;
cin >> N;
vector<string> blue(N);
int MAX = 0;
for(int i = 0; i < N; i++){
cin >> blue.at(i);
}
cin >> M;
vector<string> red(M);
for(int i = 0; i < M; i++){
cin >> red.at(i);
}
int count;
string S;
for(int i = 0; i < ... | #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 pai 3.14159265358979323846
const int INF = 1001001001;
typedef long long ll;
int A[3][3], N;
bool punched[3][3];
bool ok[3][3];
int a[3][3],n;
using Graph = vector<vector<int>>;
vector<vector<i... | 1 | 6,857,808 |
#include<cstdio>
using namespace std;
int gcd(int a, int b) {
return b ? gcd(b, a % b) : a;
}
int x;
int main() {
scanf("%d", &x);
printf("%lld", 1ll * x * 360 / gcd(x, 360) / x);
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
std::ios_base::sync_with_stdio(false);
cin.tie(0);
int x;
cin >> x;
cout << 360/__gcd(360,x) << "\n";
} | 1 | 24,941,248 |
#include<iostream>
#include<string>
#include<iomanip>
#include<cmath>
#include<vector>
#include<algorithm>
using namespace std;
#define int long long
#define endl "\n"
const long long INF = (long long)1e18;
const long long MOD = (long long)1e9 + 7;
string yn(bool f){return f?"Yes":"No";}
string YN(bool f){return f?"YE... | #include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <algorithm>
#include <set>
#include <map>
#define vv(a, b, c, d) vector<vector<d> >(a, vector<d>(b, c))
#define vvi std::vector<std::vector<int> >
#define vvl std::vector<std::vector<ll> >
#define MODs 1000000007;
typedef... | 1 | 12,525,821 |
#include<bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(),v.end()
#define INF INT_MAX;
typedef long long ll;
using namespace std;
int main(){
char a,b; cin >> a >> b;
if(a==b) puts("H");
else puts("D");
} | #include <iostream>
using namespace std;
int main (void) {
char a, b;
cin >> a >> b;
if (a == 'H' && b == 'H') {
cout << 'H' << endl;
}else if (a == 'D' && b == 'D'){
cout << 'H' << endl;
}else{
cout << 'D' << endl;
}
return 0;
} | 1 | 77,517,528 |
#include <cctype>
#include <iostream>
#include <string>
using namespace std;
int main() {
string a, b, c;
cin >> a >> b >> c;
cout << char(toupper(a[0])) << char(toupper(b[0])) << char(toupper(c[0]))
<< endl;
return 0;
} | #include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<queue>
#include<stack>
#include<iomanip>
#define fast_io ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
using namespace std;
#define debug(x) cout<<(#x)<<"="<<(x)<<", ";
#defin... | 1 | 96,548,606 |
#include <bits/stdc++.h>
#define lol long long
using namespace std;
int main(){
int a,b,c;
string s,t,q;
cin>>a>>b>>c;
if(a<=c && c<=b) cout<<"Yes\n";
else cout<<"No\n";
return(0);
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int a,b,c;
cin >> a >> b >> c;
if(c >= a && c <= b) puts("Yes");
else puts("No");
} | 1 | 91,555,312 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define rep(i, n) for(int i=0; i<(int)(n); ++i)
int main() {
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
int n; cin >> n;
ll a[85], dp[85];
for (int i = 1; i <= n; ++i) cin >> a[i];
dp[1] = 1000;
for (in... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[110];
int main(){
ll n;
cin>>n;
ll ans=1000;
for(int i=0;i<n;i++)cin>>a[i];
for(int i=0;i<n-1;i++){
if(a[i]<a[i+1])ans+=ans/a[i]*(a[i+1]-a[i]);
}
cout<<ans;
return 0;
} | 1 | 66,196,944 |
#include <bits/stdc++.h>
#define WHOLE(v) (v).begin(), (v).end()
#define REV_WHOLE(v) (v).rbegin(), (v).rend()
using i64 = int64_t;
using namespace std;
template<typename T> using rev_priority_queue = priority_queue<T, vector<T>, greater<T>>;
int main() {
i64 N, K;
cin >> N >> K;
vector<pair<i64, i64>> X(N)... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e17;
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;
int m... | 1 | 60,768,762 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i= 0; i < (n); i++)
using ll= long long int;
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; }
ll mod= 1e9 + 7;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define rep(i, n) for(int i = 0; i < n; i++)
#define sort(v) sort((v).begin(), (v).end())
using vi = vector<int>;
const int MOD = 1e9+7;
int main() {
string s;
cin >> s;
s[5] = ' ';
s[13] = ' ';
cout << s << endl;
} | 1 | 8,891,562 |
#include <iostream>
using namespace std;
int main(void){
int a;
int b;
cin>>a>>b;
if((a%500)<=b){
cout<<"Yes"<<endl;
}else{
cout<<"No"<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A;
cin >> N >> A;
string d = "No";
for(int i=0; i<(N/500+1); i++){
for(int j=0; j<=A; j++){
if(500*i+j==N){
d = "Yes";
break;
}
}
}
cout << d << endl;
} | 1 | 87,709,107 |
#include<bits/stdc++.h>
using namespace std;
struct edge
{int u,v,next;
};
struct edge e[200010];
int n,num,ans;
int head[200010],f[2][200010],g[200010];
void add(int u,int v)
{e[num].u=u;
e[num].v=v;
e[num].next=head[u];
head[u]=num;
num++;
e[num].u=v;
e[num].v=u;
e[num].next=head[v];
head[v]=num;
num++;
}
vo... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
#define irep(i, n) fo... | 1 | 7,426,776 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 10000000000
using namespace std;
using ll = long long;
int memo[90005];
int main()
{
int h, w, d;
cin >> h >> w >> d;
map<int, pair<int, int>> mp;
rep(i,h){
rep(j,w){
int a;
cin >> a;
... | #include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep2(i, m, n) for(int i = (int)(m); i < (int)(n); i++)
#define rep_inv(i, n, m) for(int i = (int)(n); i > (int)(m); i--)
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vc = vector<char>;
using vvl = vector<vl>;
... | 1 | 30,992,504 |
#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 1001001001
#define mod 1000000007
#define mod2 998244353
#define pi acos(-1)
#define all(v) v.begin(),v.end()
ll gcd(ll a,ll b){
if(b>a) swap(a,b);
if(b==0) return a;
return gcd(b,a%b);... | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
using P = pair<int,int>;
int main()
{
... | 1 | 93,453,483 |
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<functional>
#include<iomanip>
#include<iostream>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<string>
#include<utility>
#include<vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll MOD = 10000... | #include <bits/stdc++.h>
#define r(i,n) for(int i = 0; i<n; i++)
typedef long long ll;
using namespace std;
int main(){
ll n,sum1=0,sum2=0;
cin >> n;
vector<vector<ll>> v(n,vector<ll>(3,0));
vector<ll> v2(n);
r(i,n)cin >> v[i][1];
r(i,n){
cin >> v[i][2];
v[i][0]=v[i][1]-v[i][2];
sum1+=v[i][1]; s... | 1 | 91,424,920 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long INF = 1LL << 60;
using P = pair<int,int>;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int main() {
ll a;
double b;
cin >> a >> b;
ll ib = b*100+0.5;
a *= ib;
a /= 100;
cout << a << endl;
retur... | #include <bits/stdc++.h>
using namespace std;
#define INF (1 << 30)
#define EPS 1e-10
#define MOD 1000000007
#define rep(i, n) FOR(i, 0, n)
#define FOR(i, x, n) for (int i = (x); i < (n); ++i)
#define all(v) (v).begin(), (v).end()
using ll = long long;
template<class T> void chmax(T& a, T b){ if (a < b) { a = b; } }
te... | 1 | 65,226,661 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >>N;
long long T=sqrt(N);
long long stand=N-1;
long long a;
for(long long i=1;i<=T;i++){
if(N%i==0){
a=N/i;
stand=min(stand,(a+i-2));
}
}
cout <<stand <<endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
#define all(x) x.begin(), x.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> pair;
const int inf = 1000000000;
const ll inff = 1000000000000000000;
int main(){
ll n;
cin >> n;
ll ans... | 1 | 32,620,062 |
#include <iostream>
#include <string>
using namespace std;
int main()
{
int a,i;
string st;
cin >> st >> a;
for(i=0; i<st.size(); i+=a)
cout << st[i];
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
int main(){
string s; cin >> s;
int len = s.length();
int w; cin >> w;
if(w == 1){cout << s << endl; return 0;}
for(int i = 1; i <= len; i++){
if(i%w == 1) cout << s[i-1];
}
cout << endl;
re... | 1 | 53,586,722 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
int n=s.size(),flag=0;
for(int i=0;i<n;i++){
for(int j=0;i+j-1<n;j++){
string t = s;
t.erase(i,j);
if(t=="keyence") flag = 1;
}
}
if(flag) cout << "YES" << endl;
... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <cstring>
#include <functional>
#include <iostream>
#include <iomanip>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <regex>
#include <vector>
#define fix(n... | 1 | 88,867,930 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i,n) for(int i = 0;i < (int)(n);i++)
#define ALL(a) a.begin(),a.end()
template<class T>inline bool CHMAX(T&a,T b){if(a<b){a = b;return true;}return false;}
signed main(){
int N;
cin >> N;
vector<pair<int,int>>p(N);
REP(i,N){
cin>>p[i]... | #include<bits/stdc++.h>
using namespace std;
using Int = long long;
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
signed main(){
Int n;
cin>>n;
vector<Int> xs(n),ys(n);
... | 1 | 49,991,483 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string c;
cin >> c;
if((c=="a")||(c=="i")||(c=="u")||(c=="e")||(c=="o")){
cout << "vowel" << endl;
}
else {
cout << "consonant" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
char c;cin>>c;
if (c=='a' || c=='i' || c=='u' || c=='e' || c=='o') cout << "vowel";
else cout << "consonant";
} | 1 | 50,927,244 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long double n,ans=0;
cin >> n;
for(long long i=0; i<n; i++){
long double x;
string S;
cin >> x >> S;
if(S=="JPY"){
ans+=x;
}
else{
ans+=(x*380000);
}
}
cout << fixed << setprecision(10) << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
double sum=0;
cin>>n;
for(int i=0;i<n;i++){
double x; string u;
cin>>x>>u;
if(u=="JPY") sum+=x;
else sum+=x*380000.0;
}
cout<<fixed<<setprecision(8)<<sum<<endl;
return 0;
} | 1 | 92,115,258 |
#include<iostream>
using namespace std;
int main(){
int A, B, C, K;
cin >> A >> B >> C >> K;
int i;
int ans=0;
int count=0;
if(K <= A){
ans = K;
cout << ans << endl;
}
else if(K <= A+B){
ans = A;
cout << ans << endl;
}else{
ans = A - (K-A-B);
... | #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 pb push_back
#define ALL(v) v.begin(),v.end()
const long long INF = 1LL << 60;
using namespace std;
using ll = long long;
using P = pair<int, int>;
template<class T> inline bool ... | 1 | 86,211,616 |
#include <bits/stdc++.h>
#define MOD 1000000007
#define INF 1000000000
#define LINF 1000000000000000000
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define bit(n) (1LL<<(n))
using namespace std;
typedef pair<int, int> P;
typedef pair<long long, long long> LLP;
int main() {
int N;
cin >> N;
vector<P> red(... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb push_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bound... | 1 | 80,001,770 |
#include <bits/stdc++.h>
using namespace std;
int m, nmin, nmax, res, dif;
int p[10010];
int main() {
while(cin >> m >> nmin >> nmax && m && nmin && nmax) {
dif = 0;
for(int i = 0; i < m; ++i) {
cin >> p[i];
if(nmin <= i && i <= nmax && dif <= p[i-1] - p[i]) {
res = i;
dif = p[i-1]... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int m, nmin, nmax;
while (cin >> m >> nmin >> nmax, m | nmin | nmax) {
vector<int> P(m);
for (int i = 0; i < m; i++) {
cin >> P[i];
}
int cost = 0, ans = 0;
for (int i = 0; i < m; i++) {
... | 1 | 26,112,917 |
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int LCS(string a, string b)
{
int ret;
int i, j;
int len1, len2;
int result[1001][1001] = {0};
len1 = a.length();
len2 = b.length();
a = ' ' + a;
b = ' ' + b;
for (i = 1; i <= len1; i++) {
for (j = 1... | #include <iostream>
#include <stdio.h>
#include <cstring>
#include <math.h>
#include <algorithm>
#include <vector>
#include <string>
#include <stdlib.h>
#include <queue>
#include <stack>
#include <utility>
#define rep(i,n) for(int i=0;i<n;i++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define FOR(i,a,b) for(int i=a;i<b... | 1 | 82,837,945 |
#include <bits/stdc++.h>
#define FOR(i,k,n) for(int i = (k);i < (n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(x) begin(x),end(x)
using namespace std;
using vecint = vector<int>;
using ll = int64_t;
int main()
{
int q;
cin>>q;
REP(i,q) {
ll a,b;
cin>>a>>b;
if (a<b) swap(a, b);
ll s = sq... | #include<iostream>
#include<cmath>
#include<cstdio>
using namespace std;
int q;
typedef long long LL;
LL LLsqrt(LL x){
LL L=0,R=1e9,mid,ans=-1;
while (L<=R){
mid=(L+R)>>1;
if (mid*mid<=x)
L=mid+1,ans=mid;
else
R=mid-1;
}
return ans;
}
int main()
{
long... | 1 | 13,269,214 |
#include <cmath>
#include<iostream>
#include<vector>
#include<algorithm>
#include<map>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll inf = 1000000007;
int a[100005];
int main() {
int n;
cin >> n;
ll sum = 0;
a[0] = 0;
a[n + 1] = 0;
for (int i = 1; i <=n; i++) {
cin >> a[i];
sum += abs(... | #include <iostream>
#include<string>
#include <cstdio>
#include<utility>
#include<algorithm>
#include<vector>
#include<cmath>
#include<map>
#include<bitset>
#include<queue>
#include<set>
#include <limits>
#include <numeric>
#include<queue>
using namespace std;
typedef long long ll;
typedef pair<int,int>P;
typedef pair<... | 1 | 6,594,815 |
#include<stdio.h>
#include<string.h>
int main(){
char ang[1010];
int sum;
while(scanf("%s",ang) != EOF){
if(strcmp(ang, "0")==0) break;
for(int i=0; i<strlen(ang); i++){
sum = sum + ang[i]-'0';
}
printf("%d\n",sum);
sum=0;
}
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <math.h>
using namespace std;
typedef long long ll;
int main() {
string n;
while (cin >> n, n != "0") {
int ans = 0;
for (int i = 0; i < n.size(); ++i) {
ans += n[i]-'0';
}
cout << ans << endl;
}
} | 1 | 31,049,462 |
#include <iostream>
using namespace std;
int main(void)
{
int a[9] = {};
bool check[9] = {};
int n = 0;
for (int i = 0; i < 9; ++i)
{
cin >> a[i];
}
cin >> n;
int b[n] = {};
for (int i = 0; i < n; ++i)
{
cin >> b[i];
}
for (int i = 0; i < 9; ++i)
{
... | #include <bits/stdc++.h>
using namespace std;
typedef long double LD;
typedef long long ll;
#define int ll
#define ff(i,a,b) for (int i = a; i < b; i++)
#define bf(i,a,b) for (int i = a; i >= b; i--)
#define all(v) v.begin(),v.end()
#define show(a) for(auto xyz:a)cout<<xyz<<" ";cout<<endl;
#define F first
#defin... | 1 | 9,654,502 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, A;
cin >> N;
map<int, int> MA;
while (cin >> A) MA[A]++;
int cnt = 0;
for (auto &ma : MA) {
ma.second %= 2;
if (!ma.second) ma.second += 2;
if (ma.second == 2) cnt++;
}
cout << ((cnt % 2) ? MA.size() - 1 : MA.size()) << "\n";
... | #include<bits/stdc++.h>
#define mod 1000000007
#define ll long long int
#define ar array
#define mp make_pair
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin>>n;
int a[100001]={0};
multiset< int,greater<int > >s;
for(int i = 0 , j; i<n; i++)
{
cin>>j;
... | 1 | 62,040,137 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mod(n,k) ( ( ((n) % (k)) + (k) ) % (k))
#define forn(i,a,b) for(int i = a; i < b; i++)
#define forr(i,a,b) for(int i = a; i >= b; i--)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef long do... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef long double ld;
typedef tree<ll,null_type,less<ll>,rb_tree_tag, tree_order_statistics_node_update> ordered_set;
#define int ll
#define endl "\n"
#define all( x ) x.begin(), x.... | 1 | 100,473,609 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
template<class T> ostream& operator<<(ostream& os, const vector<T>& vec) { for (auto &vi: vec) os << vi << " "; return os; }
int main() {
vector<int> ab(2);
for (auto &abi: ab) cin >> abi;
int k; cin >> k;
for (int i = 0; i ... | #pragma region
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <list>
#include <iomanip>
#include <cstdint>
#include <bitset>
#include <sstream>
#include <r... | 1 | 83,786,281 |
#include <bits/stdc++.h>
using namespace std;
int a, b, c, d;
int main()
{
cin >> a >> b >> c >> d;
int ab = a + b;
int cd = c + d;
if (ab > cd)
{
cout << "Left" << endl;
}
else if (ab < cd)
{
cout << "Right" << endl;
}
else
{
cout << "Balanced" << end... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C, D;
cin >> A >> B >> C >> D;
int diff = (A + B)- (C + D);
if (diff > 0) {
cout << "Left" << endl;
} else if (diff == 0) {
cout << "Balanced" << endl;
} else {
cout << "Right" << endl;
}
} | 1 | 9,171,685 |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<queue>
#include<stack>
#include <cassert>
#include <numeric>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
t... | #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
#include<iom... | 1 | 48,349,459 |
#include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)n; ++i)
#define repr(i, n) for (ll i = n - 1; i >= 0; --i)
#define INF 10e7
#define MOD 1000000000 + 7
#define MAX 51000
#define all(x) (x).begin(), (x).end()
#define MX(x) *max_element(all(x))
#define MN(x) *min_element(all(x))
usi... | #include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#define vv(a, b, c, d) vector<vector<d> >(a, vector<d>(b, c))
#define vvi vector<vector<int> >
#define vvl vector<vector<l... | 1 | 443,469 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, k;
cin >> n >> k;
vector<int> a(n+1);
for(int i=0; i<n; i++){
cin >> a[i];
}
int times = 0;
bool flag = true;
while(flag == true && times < k){
vector<int> a_new(n+1);
flag = false;
times += ... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define countof(array) (sizeof(array) / sizeof(array[0]))
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = (n)-1; i >= 0; --i)
#define rep2(i,n) for(int i = 1; i <= (n); ++i)
#define rrep2(i,n) for(int i = (n); i... | 1 | 26,689,102 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
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... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(V) (V).begin(),(V).end()
void ans(vector<bool>&V) {
for (bool i : V) {
if (i)cout << 'S';
else cout << 'W';
}
cout << endl;
}
int main(){
int N;
cin >> N;
string S;
cin >> S;
vector<bool> A(N);
A[0] = 1;
if (S[0] == 'o')A[1] = ... | 1 | 10,282,872 |
#include <bits/stdc++.h>
#define pb push_back
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,n,s) for(int i=(s);i<(n);i++)
#define rrep(i,n) for(int i=(n-1);i>=0;i--)
#define rreps(i,n,s) for(int i=s;i>=n;i--)
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<clas... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<int,int>;
int main(){
ll n;
ll res=0;
cin >> n;
ll a[n];
ll totala=0;
for(ll i=0;i<n;i++){
cin >> a[i];
totala+=a[i];
}
ll b[n];
ll c[n];
ll totalb=0;
ll count=0;
for(ll i=0... | 1 | 73,799,592 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define m0(x) memset(x,0,sizeof(x))
const int INF = 1000000001;
int main(){
string a, b, c;
cin >>a >> b>>c;
printf("%c%c%c\n",toupper(a.at(0)),toupper(b.at(... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n);... | 1 | 51,733,315 |
#include <iostream>
#include <iomanip>
using namespace std;
int main(void){
int n,i;
string s;
double x,ans=0;
cin >> n;
for(i=0;i<n;i++){
cin >> x >> s;
if(s=="JPY") ans+=x;
else ans+=(x*380000);
}
cout << fixed << setprecision(5) << ans;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
long double JPY=0;
long double BTC=0;
for(int i=0;i<n;i++){
long double mn;
string cur;
cin>>mn>>cur;
if(cur=="JPY") JPY+=mn;
else BTC+=mn;
}
JPY += BTC*380000.0;
cout << JPY << endl;
} | 1 | 83,425,253 |
#include<bits/stdc++.h>
using namespace std;
typedef long long llint;
typedef long double ld;
#define inf 1e18
#define mod 1000000007
#define sort(v) sort(v.begin(),v.end())
#define reverse(v) reverse(v.begin(),v.end())
#define count(v,x) count(v.begin(),v.end(),x)
#define find(v,x) find(v.begin(),v.end(),x)
priority_q... | #include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <ctime>
#include <queue>
#include <map>
#include <set>
#include <tuple>
#include <functional>
#include <cassert>
#include <bitset>
using namespace std;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for... | 1 | 89,889,813 |
#include <stdio.h>
int main(){
int N;
scanf("%d",&N);
int A,B;
scanf("%d %d",&A,&B);
for (A==A;A<=B;A++){
if(A%N==0){
printf("OK");
return 0;
}
else{
continue;
}
}
printf("NG");
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
int K, A, B;
cin >> K >> A >> B;
if (A <= (B / K) * K)
cout << "OK" << endl;
else
cout << "NG" << endl;
return 0;
} | 1 | 33,105,777 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (ll i = 0; i < (n); ++i)
int main() {
ll n;
cin >> n;
vector<ll> a(n);
rep(i,n) cin >> a[i];
vector<ll> times(n,0);
for(ll i=n-2;i>=0;i--){
if(a[i]>=a[i+1]){
times[i] = times[i+1]+1;
}else{
times[i] ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
int c[n],b[n];
c[0]=0;
cin>>b[0];
for(int i=1;i<n;i++){
cin>>b[i];
if(b[i]>b[i-1]){
c[i]=0;
}
else{
c[i]=c[i-1]+1;
}
}
sort(c,c+n);
cout<<c[n-1];
... | 1 | 18,414,008 |
#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(void){
int n, r;
cin >> n >> r;
if(n < 10) cout << r+100*(10-n) << endl;
else cout << r << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> P;
typedef pair<int,int> Pi;
#define rep(i,n) for(ll i=0;i<n;i++)
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define fi first
#define se second
#define endl "\n"
template<typename T> inline bool chmax(T &a, T b){i... | 1 | 33,987,780 |
#include<bits/stdc++.h>
#include<iostream>
using namespace std;
#define ll long long
int main()
{
ll k;
while(cin >> k)
{
ll ro = k / 50;
ll yu = k % 50;
ll ty = ro - yu;
cout << 50 << endl;
for(int i = 0;i < 50;i++)
{
if(i < yu)
cout <... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
const int iINF = 1000000000;
const long long int llINF = 10000... | 1 | 25,175,268 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,i,lleg=0,rleg=0,bef=-1,ans=0;
while(1)
{
cin>>n;
if(n==0)
{
break;
}
string f[n]={};
for(i=0;i<n;i++)
{
cin>>f[i];
}
for(i=0;i<n;i++)
{
... | #include <iostream>
#include <string>
using namespace std;
bool isok(string a, string b)
{
return (a == "lu" && b == "ru") || (a == "ru" && b == "lu") || (a == "ld" && b == "rd") || (a == "rd" && b == "ld");
}
int main(void)
{
int n;
while (cin >> n, n){
string str, prev = "";
int ret = 0;
for (int i = 0; i < ... | 1 | 94,877,615 |
#include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
typedef long long ll;
using namespace std;
int main() {
string s;
cin >> s;
int left=0, right=s.size()-1;
int count=0;
while(left<=right){
if(s.at(left)==s... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <stack>
#include <queue>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <cmath>
using namespace std;
#define PI 3.1415926535897932384626433832795
#define MOD (1000000007)
#define EPS (1e-15)
#define rep(i, n)... | 1 | 75,690,489 |
#include <bits/stdc++.h>
#include <cassert>
#define rep(i, N) for (int i = 0; i < (N); ++i)
#define rep2(i, a, b) for (ll i = a; i <= b; ++i)
#define rep3(i, a, b) for (ll i = a; i >= b; --i)
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(c) begin(c), end(c)
#define ok() put... | #include <bits/stdc++.h>
using namespace std;
#define int long long
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const int MAX =3001;
const int MOD =998244353;
signed main(){
int n... | 1 | 29,365,358 |
#include<bits/stdc++.h>
#define REP(i,n) for(int i=0;i<n;i++)
#define RREP(i,n) for(int i=n;i>=0;i--)
#define FOR(i,m,n) for(int i=m;i<n;i++)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
typedef long long ll;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a ... | #include <bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin >>a>>b>>c;
if(b/a==c/a&&b%a!=0){
cout << "NG"<<endl;
}
else{
cout <<"OK" <<endl;
}
} | 1 | 25,854,871 |
#include <bits/stdc++.h>
using namespace std;
#define INF INT_MAX
int n, m;
vector<pair<int, int> > graph[100010];
int cost[100010];
bool flag = true;
void dfs(int idx, int num){
if(!flag) return;
cost[idx] = num;
for(int i = 0;i < graph[idx].size();i++){
if(cost[graph[idx][i].first] != INF){
... | #include <bits/stdc++.h>
#define rep(n) for(int i=0;i<n;i++)
#define repp(j, n) for(int j=0;j<n;j++)
#define reppp(i, m, n) for(int i=m;i<n;i++)
#define all(c) c.begin(), c.end()
#define rall(c) c.rbegin(), c.rend()
#define debug(x) cerr << #x << ": " << x << endl
using namespace std;
typedef long long ll;
typedef pair... | 1 | 24,176,190 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
const ll INF = 1LL<<60;
int main(int, char**) {
int n, k; cin >> n >> k;
int upr = (n - 2) * (n - 1) / 2;
if (k > upr) {
cout << -1 << endl;
return 0;
}
int m = n - 1 + (upr - k);
cout << m << endl;
for (int i=0; i... | #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()
static const int INF (1<<30);
int main() {
int N, K;
cin >> N >> K;
if (K > (N-1)*(N-2)/2) {
cout << -1 << endl;
return 0;
}
vector<vector<int>> ans(N);
for (int i ... | 1 | 60,955,123 |
#include <bits/stdc++.h>
using namespace std;
int n, a[100008], loc[100008], l[2][100008], r[2][100008];
set<int> s;
set<int, greater<int>> ss;
int main()
{
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
{
scanf("%d", &a[i]);
loc[a[i]] = i;
s.insert(i);
ss.insert(i);
}
s.insert(0);
s.insert(n + 1);
ss.ins... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N, P[100000], pos[100001];
cin >> N;
for(int i=0; i<N; i++){
cin >> P[i];
pos[P[i]] = i;
}
multiset<int64_t> st = {-1, -1, N, N};
int64_t ans = 0;
for(int i=N; i>0; i--){
st.insert(pos[i]);
auto it ... | 1 | 13,381,090 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N, H;
cin >> N >> H;
int a[N], b[N];
int max_A=0;
for(int i=0;i<N;i++)
{
cin >> a[i] >> b[i];
max_A=max(a[i], max_A);
}
sort(b, b+N, greater<int>());
long long int sum=0, counter=0;
long long int ans=0;
... | #include <iostream>
#include <vector>
#include <algorithm>
typedef long long LL;
using namespace std;
int main() {
int n;
LL h;
vector<LL> a;
vector<LL> b;
LL tmp_a;
LL tmp_b;
cin >> n >> h;
for(int i=0; i<n; i++){
cin >> tmp_a >> tmp_b;
a.push_back(tmp_a);
b.push... | 1 | 92,949,639 |
#include<cstdio>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<iostream>
#include<cmath>
#include<queue>
using namespace std;
#define MAXN 1005
struct node{
int x,y,step;
node(int x=0,int y=0,int step=0):x(x),y(y),step(step) {}
};
char mp[MAXN][MAXN];
int vis[MAXN][MAXN];
int w,h,n;
int dir[10... | #include <iostream>
#include <queue>
using namespace std;
int w, h, n;
char map[1024][1024];
int d[1024][1024];
const int direction[4][2] = {
{ -1, 0 },
{ 1, 0 },
{ 0, -1 },
{ 0, 1 },
};
int factory[16][2];
typedef pair<int, int> P;
int bfs(const int& sx, const int& sy, const int& gx, const int& gy)
{
for (int i =... | 1 | 14,734,571 |
#include<iostream>
#include<stdio.h>
using namespace std;
int main(){
int W, H, x, y, r;
cin >> W >> H >> x >> y >> r;
if (x < 0 || y < 0 || x > W || y > H || x - r < 0 || y - r < 0
|| x+r>W||y+r>H){
cout << "No" << endl;
}
if (x > 0 && y > 0 && x < W && y < H && x - r >= 0 && y - r >= 0
&& x + r<=W && y + r... | #include <iostream>
#include <stdio.h>
using namespace std;
int main(){
int w,h,x,y,r;
cin>>w>>h>>x>>y>>r;
cout<<((x-r>=0&&x+r<=w&&y-r>=0&&y+r<=h)?"Yes":"No")<<endl;
return 0;
} | 1 | 32,135,093 |
#include "bits/stdc++.h"
using namespace std;
int main() {
int N;
cin >> N;
double ans = 0;
for (int n = 0;n<N;++n) {
double x;
string u;
cin >> x >> u;
if ("JPY" == u) {
ans += x;
}
else {
ans += 380000.0*x;
}
}
cout << (ans) / 1.0 << endl;
} | #include <iostream>
#include <algorithm>
#include <cstring>
#include <iomanip>
using namespace std;
int main() {
cout<<fixed<<showpoint;
cout<<setprecision(9);
long double x;
string s;
int n;
cin>>n;
long double sum = 0;
while(n--)
{
cin>>x>>s;
if(s == "BTC")
{
sum+=(x*380000.0);
}
else
{
sum... | 1 | 14,826,681 |
#include <stdio.h>
#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>
#incl... | #include <iostream>
#include <queue>
using namespace std;
int main()
{
priority_queue<int> data;
string s;
while (cin >> s && s != "end")
{
if (s == "insert")
{
int n;
cin >> n;
data.push(n);
}
else
{
cout << data.to... | 1 | 25,682,658 |
#include <bits/stdc++.h>
#include <vector>
#include <queue>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> a(N);
for(int i=0; i<N; i++){
cin >> a[i];
}
int count =0;
for(int i=0; i<N; i++){
int val = a[i];
if(i+1 == a[val-1]){
count += 1;
... | #include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <map>
#include <vector>
#include <stack>
#include <queue>
#include <tuple>
#include <cassert>
#include <functional>
#include <set>
#include <deque>
using namespace std;
typedef long long ll;
int dx[4] = {0,0,1,-1};
int dy[4] = {1,-1,0,... | 1 | 96,454,829 |
#define _GLIBCXX_DEBUG
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
ll mod = 1000000007;
template<class Type> inline bool chmax(Type& a, Type b) { if (a < b) { a = b; return 1; } return 0; }
template<class Type> inline bool chmin(Type& a, Type b) { if (a > b) { a = b; return 1; } return 0; }
temp... | #include <bits/stdc++.h>
using namespace std;
int main(){
string S;
cin >> S;
cout << S.substr(0, 4) << " " << S.substr(4, 8) << endl;
return 0;
} | 1 | 74,732,404 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
int main()
{
char p[128] = { '\0' }, s[128] = { '\0' };
fscanf(stdin, "%s", s);
fscanf(stdin, "%s", p);
string ss = string(s) + string(s), pp(p);
string ans = "No";
if (ss.find(p, 0) != string::npos) {
ans = "Yes";
... | #include <bits/stdc++.h>
using namespace std;
int main(){
string s,t; cin>>s>>t;
s += s;
if(s.find(t) != -1) puts("Yes");
else puts("No");
return 0;
} | 1 | 17,416,023 |
#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
#define tr(it, a) for (auto it = a.begin(); it != a.end(); it++)
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x, y) cout <<... | #include<bits/stdc++.h>
using namespace std;
using vl = vector<long long>;
using vpl = vector<pair<long long, long long>>;
using vs = vector<string>;
using pl = pair<long long, long long>;
using ll = long long int;
using vb = vector<bool>;
struct hash_pair {
template <class T1, class T2>
size_t operator()(const p... | 1 | 60,363,091 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, b) for (int i = 0; i < (b); i++ )
typedef pair<int,int> P;
typedef long long ll;
const int INF = 100000000;
const double PI=acos(-1);
bool comp(P p1, P p2){
if (p1.first != p2.first) {
return p1.first < p2.first;
}
else if (p1.second != p2... | #include<bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define all(v) (v).begin(),(v).end()
using namespace std;
using ll=long long;
using pii=pair<int, int>;
using vi=vector<int>;
const ll LINF=1LL<<60;
const int INF=1<<29;
const int MOD=2019;
int main(){
string N; cin >> N;
int K; cin >> K;
int size=N.size();
... | 1 | 31,060,590 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD (long long)(1e9+7)
#define INF (1LL<<60)
#define rep(i,n) for(ll i = 0; i < (n); i++)
#define rep1(i,n) for(ll i = 1; i <= (n); i++)
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return fa... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <numeric>
#include <iomanip>
#include <map>
#include <set>
#include <deque>
#include <utility>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)... | 1 | 98,659,123 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using vec = vector<ll>;
using vect = vector<double>;
using Graph = vector<vector<ll>>;
#define loop(i, n) for (ll i = 0; i < n; i++)
#define Loop(i, m, n) for (ll i = m; i < n; i++)
#define pool(i, n) for (ll i = n; i >= 0; i--)
... | #include<stdio.h>
main(){float n,m,d;scanf("%f%f%f",&n,&m,&d);printf("%f",(d?2:1)*(n-d)*(m-1)/n/n);} | 1 | 52,659,657 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vll = vector<vl>;
using Pll = pair<ll, ll>;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(v) v.begin(), v.end()
#define sz(x) ((int) x.size())
#define pb push_back
#define mp make_pair
#defi... | #include <bits/stdc++.h>
using namespace std;
int main() {
int x;
cin>>x;
int a=x/100;
int b=x%100;
if(b>5*a) cout<<0<<endl;
else cout<<1<<endl;
} | 1 | 34,916,469 |
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout << (#x) << " is " << (x) << endl
#define debug cout << "hi" << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef p... | #include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define MAX 1e18
#define MIN -1e18
#define MOD 1000000007
#define base 139
#define base2 31
#define memz(a) memset(a, 0, sizeof(a))
#define memn(a) memset(a, -1, sizeof(a))
#define in1(a) scanf("%lld", &a)
#define in2(a, b) scanf("%lld%lld", &a, &b)
#def... | 1 | 86,844,057 |
#include<stdio.h>
int main(){
int a, b, c, d;
scanf("%d %d %d %d", &a, &b, &c, &d);
d = 0;
for (a; a <= b; a++){
if(c % a == 0){
d++;
}
}
printf("%d\n", d);
} | #include <iostream>
#include <algorithm>
int main(){
std::ios::sync_with_stdio(false);
std::cin.tie(0);
int a, b, c;
std::cin >> a >> b >> c;
int cnt = 0;
for(int i=a; i<=b; ++i){
if(c%i==0) ++cnt;
}
std::cout << cnt << "\n";
return 0;
} | 1 | 87,841,721 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int w,h,n;
cin >> w >> h >> n;
vector<vector<bool>> p(h, vector<bool>(w, true));
for(int i = 0; i < n; i++) {
int x,y,a;
cin >> x >> y >> a;
if(a==1){
for(int j = 0; j < h; j++) {
... | #include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
lli w, h, n;
int main(void){
cin >> w >> h >> n;
lli l, r, u, d;
l = d = 0;
r = w;
u = h;
rep(i, n){
lli a, x, y;
cin >> x >> y >> a;
if(a == 1){
l = max(l, x);
}else if(a == 2){
r = min(r, x);
... | 1 | 19,538,387 |
#include<iostream>
#include<cmath>
#include<string>
#include<cstdlib>
#include<stdio.h>
#include<cctype>
#include<algorithm>
#include<string.h>
#include<iomanip>
using namespace std;
int main()
{
double x_1,y_1,x_2,y_2;
double a,b,c;
while(cin>>x_1>>y_1>>x_2>>y_2)
{
a=x_1-x_2;
b=y_1-y_2;
c=a*a+b*b;
cout<<se... | #include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
int main()
{
double a, b, c, d, e;
cin >> a >> b >> c >> d;
e = sqrt(pow(c-a, 2) + pow(d-b, 2));
printf("%0.6f\n", e);
return 0;
} | 1 | 49,966,805 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n; cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
sort(a.begin(), a.end(), greater<int>());
long long y = 0, x = 0;
for (int i = 0; i < n - 1; i++) {
if (!y) {
if (a[i]... | #include<bits/stdc++.h>
using namespace std;
#define INFTY 1<<20
#define rep(i,n) for (int i = 0; i < (n); ++i)
typedef long long int ll;
const int MOD=1000000007;
int main(){
int n;
cin>>n;
vector<ll> a(n+1);
rep(i,n)cin>>a[i];
a[n]= 0;
sort(a.begin(),a.end());
reverse(a.begin(),a.end());
... | 1 | 71,808,706 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> P;
typedef pair<int,int> Pi;
#define rep(i,n) for(ll i=0;i<n;i++)
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define fi first
#define se second
#define endl "\n"
template<typename T> inline bool chmax(T &a, T b){i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(int i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = ... | 1 | 44,670,987 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)n;i++)
using Graph = vector<vector<int> >;
using GraphC = vector<vector<char> >;
const int INF = 100000000;
typedef pair<int, int> P;
int a, b, c, d,X,Y;
int main() {
cin >> a >> b >> c >> d;
X = (a - c), Y = (d - b);
cout << c -Y << "... | #include <bits/stdc++.h>
using namespace std;
pair<int, int> edge(int x_1, int y_1, int x_2, int y_2) {
int x = x_2 + y_1 - y_2;
int y = y_2 - x_1 + x_2;
pair<int, int> p = make_pair(x, y);
return p;
}
int main() {
int x_1, y_1, x_2, y_2, x_3, y_3, x_4, y_4;
cin >> x_1 >> y_1 >> x_2 >> y_2;
pair<int, int>... | 1 | 85,048,930 |
#include <iostream>
#include <cstdlib>
#include <time.h>
#include <algorithm>
#include <map>
#include <queue>
#include <stack>
#include <vector>
#include <array>
#include <string>
#include <iomanip>
#include <cstring>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ext/pb_ds/assoc_container.hpp>
#includ... | #include <bits/stdc++.h>
#define loop2(i, s, n, a) for (int i = int(s); i < int(n); i += a)
#define loop(i, s, n) loop2(i, s, n, 1)
#define rep(i, n) loop(i, 0, n)
#define pb push_back
#define all(in) in.begin(),in.end()
using ll = long long;
using ull = unsigned long long;
using namespace std;
int main(){
int n; c... | 1 | 6,125,965 |
#include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
using P = pair<ll,ll>;
using ld=long double;
int main(){
ll n,k;cin >>n>>k;
ll g=0;
vector<ll>a(n);
for (int i = 0; i < n; ++i) {
... | # include <iostream>
# include <vector>
# include <algorithm>
# include <string>
# include <sstream>
# include <cmath>
# include <queue>
# include <stack>
# include <map>
# include <iomanip>
# include <stdexcept>
# include <functional>
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair... | 1 | 24,246,524 |
#include <iostream>
#include <vector>
#include <set>
using namespace std;
int N;
vector<int> C;
set<int> L;
vector<bool> used;
vector<vector<int> > P;
void l_check(void) {
L.clear();
for (int i = 0; i < N; ++i) {
if (C[i] == 1)
L.insert(i);
}
}
int solve(void) {
while (L.size()) {
int leaf = *L.begin();
L.... | #include<bits/stdc++.h>
#define N 100001
#define LL long long
#define LOG(x) cerr<<#x<<" = "<<x<<endl
#define add_edge(u,v) nxt[++cnt]=head[u],head[u]=cnt,to[cnt]=v
#define open(x) freopen(#x".in","r",stdin),freopen(#x".out","w",stdout)
char ch;bool fs;void re(int& x)
{
while(ch=getchar(),ch<33);
if(ch=='-')fs=1,x=0;... | 1 | 96,737,458 |
#include <bits/stdc++.h>
using namespace std;
int n, x;
vector<pair<int, int>> a;
int main() {
cin >> n;
for(int i = 1; i <= n; i++) {
cin >> x;
a.push_back({x, i});
}
sort(a.begin(), a.end());
for(int i = 0; i < (int)a.size(); i++) {
cout << a[i].second << ' ';
}
ret... | #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,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++... | 1 | 97,578,359 |
#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... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,x,y) for(int i=x;i<y;i++)
#define range(a) (a).begin(),(a).end()
#define print(A,x,n) rep(i,0,n){cout<<(i ? " ":"")<<A[i]x;}cout<<endl;
#define pprint(A,y,m,n) rep(j,0,m){print(A[j],y,n);}
const long mod=1e9+7;
const int size=2e5;
const int inf=1e9;
int main(){... | 1 | 100,532,223 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 100000000;
#define rep1(i, n) for (ll i=0; i<(n); i++)
#define rep2(i, k, n) for (ll i=k; i<(n); i++)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
int main() {
ll n;
cin >> n;
vector<ll>a(n);
vector<ll>cnt(n,0);
for(ll i=0;i<n;i++){
cin >> a[i];
cnt[a[i]-1]++;
}
ll ans=0;
for(ll i=0;i<n;i++){
ans+=(cnt[i]*(cnt[i]-1))/2;... | 1 | 59,705,726 |
#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 ... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,f=0,j,k,sum,ans,n,odd,even,c=0;
cin>>a>>b;
for(int i=0;i<a;i++)
{
cin>>k;
if(k>=b)
c++;
}
cout<<c<<"\n";
return 0;
} | 1 | 85,932,907 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.