code1 stringlengths 54 12k | code2 stringlengths 66 12k | similar int64 0 1 | __index_level_0__ int64 24 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
#define d(x) cerr << #x ":" << x << endl;
#define dd(x, y) cerr << "(" #x "," #y "):(" << x << "," << y << ")" << endl
#define rep(i, n) for (int i = (int)(0); i < (int)(n); i++)
#define repp(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define all(v) v.begin(), v.end... | #include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,b,a) for(int i=b;i>=a;i--)
#define fori(a) for(auto i : a )
#define all(a) begin(a), end(a)
#define set(a,b) memset(a,b,sizeof(a))
#define sz(a) a.size()
#define pi 3.14159
#define ll long long
#define ull unsigned long long
#define pb push... | 1 | 51,492,095 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define call(var) cerr<<#var<<"="<<var<<endl;
#define dup(x,y) (((x)+(y)-1)/(y))
using ll=long long;
using vi = vector<int>;
using vl = vector<ll>;
using vb = vector<bool>;
using Graph = vector<vi>;
using P = pair<int,int... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
ll N,M;
cin >> N >>M;
vector<pair<ll,ll>> X;
for(int i=0;i<N;i++){
ll a,b;
cin >> a >>b;
--a;
X.emplace_back(a,b);
}
sort(X.begin(),X.end());
priority_queue<ll> pq;
ll t=0;
... | 1 | 80,306,057 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if(A % B == 0) {
cout << -1 << endl;
}
else {
cout << A << endl;
}
} | #include <iostream>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main(void) {
int64_t X, Y;
cin >> X >> Y;
if (X % Y == 0) {
cout << -1 << endl;
} else {
cout << X << endl;
}
return 0;
} | 1 | 42,834,139 |
#include <stdio.h>
int x[32]={1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int main(){
int a;
scanf("%d",&a);
printf("%d",x[a-1]);
return 0;
} | #include <bits/stdc++.h>
#define rep_n(_1, _2, _3, NAME, ...) NAME
#define rep_2(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep_3(i, initial, n) for (int i = (int)(initial); i < (int)(n); ++i)
#define repeat(...) rep_n(__VA_ARGS__, rep_3, rep_2, rep_1)(__VA_ARGS__)
#define rep_r_n(_1, _2, _3, NAME, ...) NAME
#def... | 1 | 90,516,917 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
int n;
int m[101][101];
int p[101];
void matrixChainMultiplication() {
for(int i = 1; i <= n; i++) {
m[i][i] = 0;
}
for(int l = 2; l <= n; l++) {
for(int i = 1; i <= n - l + 1; i++) {
int... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,s,e) for((i)=(s);(i)<(int)(e);(i)++)
#define REP(i,e) FOR(i,0,e)
#define all(o) (o).begin(), (o).end()
#define psb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
typedef long long ll;
typedef pair<int, int> PII;
const double EPS = 1e-10;
const int INF = 1e... | 1 | 65,565,250 |
#include <algorithm>
int main(){for(int a[5];~scanf("%d%d%d%d%d",a,a+1,a+2,a+3,a+4);printf("%d %d %d %d %d\n",a[4],a[3],a[2],a[1],a[0]))std::sort(a,a+5);} | #include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<vector>
#include<cmath>
#include<cstring>
#include<cstdio>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define rp(a) while(a--)
#define pb push_back
#define mp make_pair
#define all(... | 1 | 82,781,063 |
#include<iostream>
#include<stdio.h>
#include<string>
#include<vector>
#include<queue>
#include <cmath>
#include<algorithm>
#include<stack>
#include<map>
#include<ctime>
#define rep(i,n) for (int i=0;i<n;i++)
using namespace std;
int N,A,B,C;
vector<int> l;
const long int INF=100000;
int dfs(int n,int a,int b,int c){
... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define FOR(i,L,R) for(i=L;i<R;i++)
#define REP(i,N) FOR(i,0,N)
int main(){
ll N,A,B,C,ans=1000000000,s=1,i;cin>>N>>A>>B>>C;ll L[N];
REP(i,N){s*=4;cin>>L[i];}
REP(i,s){
ll p=i,j,d[4]={0,0,0,0},c[4]={0,0,0,0};
REP(j,N){d[p%4]+=L[j];c[p%... | 1 | 69,147,604 |
const int LG = 21;
const int FN = 400005;
const long long MOD = 998244353;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> v... | #include<bits/stdc++.h>
using namespace std;
int main () {
int N;
cin >> N;
vector<int>fl(N + 2);
for (int i = 1; i <= N; i ++) cin >> fl[i];
fl[0] = fl[N+1] = 0;
int ans = 0;
for (int i = 0; i < 100; i ++) {
int kj = 0;
for (int j = 1; j < N + 2; j ++) {
if (fl[j - 1] <= 0 && fl[j] > 0) {
... | 1 | 13,709,086 |
#include<bits/stdc++.h>
using namespace std;
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*b)/gcd(a,b)
#define ff first
#define ss second
#define int long long
#define pb emplace_back
#define mp make_pair
#define pii pair<int,int>
#define v... | #include<bits/stdc++.h>
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n; cin >> n;
int a[n];
for(int i = 0; i < n; ++i) {
cin >> a[i];
a[i] -= i + 1;
}
sort(a, a + n);
long long mid = (n%2 ? a[n/2] : (a[n/2] + a[n/2]) / 2);
long long su... | 1 | 14,948,108 |
#include<bits/stdc++.h>
using namespace std;
int n,m;
int main()
{
scanf("%d%d",&n,&m);
int l=1,r=m+1;
while(l<r)
{
printf("%d %d\n",l,r);
l++,r--;
}
l=m+2,r=m+m+1;
while(l<r)
{
printf("%d %d\n",l,r);
l++,r--;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int a = (M/2)*2+1;
for (int i=1; i<=M/2; i++)
cout << i << ' ' << a+1-i << endl;
for (int i=1; i<=(M+1)/2; i++)
cout << a+i << ' ' << 2*M+2-i << endl;
return 0;
} | 1 | 21,176,698 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(aaa) aaa.begin(), aaa.end()
set<pair<int, int>> st;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
for (int i = 0; i < 3; i++) {
int x, y;
cin >> x >> y;
x--, y--;
st.insert({x, ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int s[5];
for(int i=0;i<5;i++) s[i]=0;
for(int i=0;i<6;i++){
int a;
cin >> a;
s[a]++;
}
if(s[1]<=2&&s[2]<=2&&s[3]<=2&&s[4]<=2) cout << "YES" <<endl;
else cout << "NO" << endl;
} | 1 | 84,254,790 |
#include <bits/stdc++.h>
using namespace std;
#define inf 0x3f3f3f3f
#define INF 2e18
#define eps 1e-9
#define FastRead ios_base::sync_with_stdio(0);cin.tie(0)
#define fRead freopen("input.txt","r",stdin)
#define fWrite freopen("output.txt","w",stdout)
#defi... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) (v).begin(), (v).end()
using ll = long long;
constexpr int INF = 1e9;
constexpr long long LINF = 1e18;
constexpr long long MOD = 1e9 + 7;
signed main() {
ll n, x, m;
cin >> n >> x >> m;
pair<int... | 1 | 15,260,891 |
#include <iostream>
#include <vector>
#include <bitset>
using namespace std;
#define INF 1<<30
int dp[1<<26];
int main(){
fill_n(dp, 1<<26, INF);
string s;
cin >> s;
int N = s.size();
int bt = 0;
for(int i=0; i<N; i++){
int x = s[i] - 'a';
bt ^= 1<<x;
if(__builtin_popcoun... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <map>
#include <unordered_map>
#include <cassert>
using namespace std;
int dp[202020];
int dp2[1 << 26];
int main() {
string s;
cin >> s;
int n = int(s.size());
int x = 0;
for (int ... | 1 | 29,086,571 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,i;
float x;
cin>>n;
float a[n];
for(i=0;i<n;i++)
{
cin>>a[i];
}
sort(a,a+n);
x=a[0]+a[1];
x=x/2;
for(i=2;i<n;i++)
{
x=(x+a[i])/2;
}
cout<<x;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main()
{
int n;
cin >> n;
double a[n];
double ans = 0;
rep(i, n) cin >> a[i];
sort(a, a + n);
r... | 1 | 74,694,953 |
#include<bits/stdc++.h>
#define ll long long
#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
const int MOD=1000000007;
#define PI acos(-1)
using namespace std;
int main(){
ll r; cin >> r;
cout << r*r << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int r;
cin >> r;
int result = r * r;
cout << result << endl;
} | 1 | 65,121,334 |
#include<bits/stdc++.h>
#include<algorithm>
using namespace std;
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define revp(i,a,b) for(int i=b;i>=a;i--)
char d;
int main()
{
cin>>d;
if(d=='a' || d=='o'||d=='i'||d=='e'||d=='u')
cout<<"vowel";
else
cout<<"consonant";
} | #include <iostream>
using namespace std;
int main(){
char c;
cin >> c;
cout << ((c == 'a' || c == 'i' || c == 'u' || c == 'e' || c == 'o') ? "vowel" : "consonant") << endl;
} | 1 | 97,948,150 |
#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... | #include "bits/stdc++.h"
using namespace std;
using ll=long long;
using ull=unsigned long long;
typedef pair<int,int>Pi;
typedef pair<long long,long long>P;
typedef pair<long long,P>PP;
typedef pair<P,P>PPP;
const long long MOD=1e9+7;
const long long INF=5e18;
const int di[4]={1,0,-1,0};
const int dj[4]={0,1,0,-1};
#de... | 1 | 91,032,777 |
#include <bits/stdc++.h>
using namespace std;
#define INF 1001001001
#define LINF 1001001001001001001
#define MOD 1000000007
#define MOD2 998244353
template<class T,class U>bool chmax(T &a, const U &b){if(a<b){a=b;return 1;}return 0;}
template<class T,class U>bool chmin(T &a, const U &b){if(b<a){a=b;return 1;}return 0;... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,... | 1 | 50,815,547 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define _USE_MATH_DEFINES
#include <math.h>
#define rep(i,n) for(int i = 0;i < n;i++)
#define NIL = -1;
#define all(x) x.begin(),x.end()
const ll INF = 1e9;
const ll mod = 1e9 + 7;
int digit(ll x) {
if (x / 10 == 0) return 1;
return digit(x / 1... | #include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
#include <bitset>
#include <iomanip>
#include <stack>
#include <list>
#include <map>
#include <unordered_map>
#include <chrono>
#include <numeric>
using namespace std;
using ll = long long;
const ll INF = (ll)1e18+1;
const ll D... | 1 | 100,308,600 |
#include<stdio.h>
int main()
{ int n;
scanf("%d",&n);
if(n%10==7 || (n%100>=70 && n%100<=79) || (n%1000>=700 && n%1000<800))
printf("Yes");
else printf("No");
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
string sh; cin >> sh;
for (int i = 0; i < 3; ++i)
{
if (sh[i] == '7')
{
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
return 0;
} | 1 | 33,767,166 |
#include<stdio.h>
#include<cstdio>
#include<cstdlib>
#include<string.h>
using namespace std;
struct Node {
int key;
Node *prev, *next;
};
Node *nil;
void init() {
nil = (Node *)malloc(sizeof(Node));
nil->next = nil;
nil->prev = nil;
}
void insert(int key) {
Node *x = (Node *)malloc(sizeof(Node));
x->key =... | #include <iostream>
#include <string>
#include <list>
using namespace std;
void print_list(list<int> &V)
{
for(list<int>::iterator it = V.begin();
it != V.end();it ++)
{
if(it == V.begin()){
cout << *it;
}
else{
cout << " " << *it;
}
}
cout << endl;
}
void delete_num(list<int> &V, int x)
{
for(lis... | 1 | 45,823,409 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin>>n;
vector<ll> d(n);
vector<int> w(n,1);
map<ll,int> mp;
for(int i=0;i<n;i++){
cin>>d[i];
mp[d[i]]=i;
}
vector<pair<int,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define FAST_IO std::ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define setpre(n) fixed << setprecision(n)
#define F first
#define S second
#define pii ... | 1 | 61,418,033 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
int n;
cin>>n;
if(n==1){
cout<<0<<endl;
return 0;
}
ll vec[n];
for(int i=0;i<n;i++){
cin>>vec[i];
vec[i]-=i+1;
}
sort(vec,vec+n);
ll ans=1e15;
if(n%2==0){
for(int j=n/2-1;j<=n/2;j++){
ll sum=0;
... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;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> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
typedef long long ll;
using namespace std;
int main(void){
ll n;cin... | 1 | 48,888,637 |
#include <bits/stdc++.h>
using namespace std;
main()
{
int n; cin>>n;
string s; cin>>s;
string clst="RGB";
vector acc(3,vector<int>(n+1));
for(int i=0; i<n; ++i)
{
for(int j=0; j<3; ++j)
{
acc[j][i+1]=acc[j][i]+(s[i]==clst[j]);
}
}
long long ans=0;
... | #include <bits/stdc++.h>
using namespace std;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define _rrep(i, n) rrepi(i, n, 0)
#define rrepi(i, a, b) for (int i = int(a) - 1; i >= int(b); --i)
#define rep(...) _overload3(__VA_... | 1 | 52,499,446 |
#include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long ll;
typedef pair<ll,ll> P;
const ll mod=1000000007;
const ll LINF=1LL<<60;
const int IN... | #include <iostream>
using namespace std;
int main()
{
int N, H, W;
cin >> N >> H >> W;
int A[N], B[N];
for (int i = 0; i < N; i++)
cin >> A[i] >> B[i];
int ans = 0;
for (int i = 0; i < N; i++)
{
if (H <= A[i] && W <= B[i])
ans++;
}
cout << ans << endl;
return 0;
} | 1 | 30,206,131 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define str to_string
#define endl "\n"
#define PI 3.141592653589
using namespace std;
using lint = long long;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v)
{o<<"{";for(int i=0;i<(int)v.size()... | #include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(12);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";ne... | 1 | 35,474,185 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
const int mod=1000000007,MAX=100003,INF=1<<30;
int main(){
int N;cin>>N;
vector<pair<ll,int>> A(N);
for(int i=0;i<N;i++){
cin>>A[i].first;
A[i].second=i;
}
sort(all(A));
rever... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/trie_policy.hpp>
#include <ext/rope>
#pragma 03
#pragma GCC optimize("Ofast")
#pragma GCC optimization("unroll-loops, no-stack-protector")
#pragma GCC target("sse,sse2,ss... | 1 | 46,066,891 |
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
int main() {
int n;
int ans = 0;
string c;
int h[2][103] = { 0 };
int ll = 0; int rr = 0;
while (1) {
cin >> n;
if (n == 0)break;
int kk=0;
for (int i = 1; i <= n; i++) {
cin >> c;
if (c == "ru" ) {
rr=1;
}
if ... | #include<bits/stdc++.h>
#define REP(i,s,n) for(int i=s;i<n;i++)
#define rep(i,n) REP(i,0,n)
using namespace std;
int main(){
int n;
while( cin >> n, n ){
string s;
int cnt = 0;
bool L = false , R = false, phase = false;
rep(_,n){
cin >> s;
if( s[0] == 'l' ) L = !L;
else ... | 1 | 66,260,953 |
#include <iostream>
int main(void){
int beginNum = 0;
int endNum = 0;
int targetNum = 0;
std::cin >> beginNum >> endNum >> targetNum;
int count = 0;
for(int divideNum = beginNum; divideNum <= endNum; ++divideNum)
{
if((targetNum % divideNum) == 0)
{
++coun... | #include <iostream>
#include <fstream>
#include <string>
using namespace std;
int main(){
#ifdef CIN
ifstream cin("input.txt");
ofstream cout("output.txt");
#endif
int a,b,c;
int i, j;
j = 0;
cin >> a >> b >> c;
for (int i = a; i <= b; i++)
{
if (c % i == 0) j++;
}
cout << j << endl;
return 0;
} | 1 | 21,434,877 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep1(i, n) for (ll i = 1; i <= (ll)(n); i++)
#define INF 10000000000
#define MOD 1000000007
using ll = long long;
using Graph = vector<vector<ll>>;
ll dp[100100][2];
vector<ll> dist;
ll rec(int v, int color, const Gr... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
typedef pair<int,int> pi;
typedef vector<int> vi;
#define FOR(i,a,b) for(int i = (a); i < (b); ++i)
#define pb push_back
template<typename T> void max_self(T &a, T b) { a = max(a,b); return;}
template<typename T> void min_self(T &a, T b)... | 1 | 60,669,262 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int) (n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int) (n); i++)
#define _GLIBCXX_DEBUG
template <typename T>
bool chmax(T &a, const T& b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typenam... | #include <bits/stdc++.h>
#include <string>
#include <vector>
#include <algorithm>
#define rep(i,w) for (int i = 0;i < (w); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int INF = 1e9;
int main(){
int n,m;cin >> n >> m;
vector<vector<int>> swi(m);
rep(i,m){
int k;cin >> k;
rep(j,... | 1 | 13,949,262 |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, n) for(int i = 0; i < n; i++)
#define REP(i, a, b) for(int i = a; i <= b; i++)
#define all(x) x.begin(), x.end()
#define fi first
#define se second
#define debug(...) cerr<<__LINE__<<... | 1 | 60,865,144 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define lf double
#define pb(x) push_back(x)
#define ull unsigned long long
#define sfl(a) scan... | #include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < int(n); i++)
#define vi vector<int>
#define all(x) (x).begin(),(x).end()
#define INF (1<<30)-1
using ll = long long;
using namespace std;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template<class T> inline bool chmax(T &a, const T &b){ if(... | 1 | 18,205,090 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
cout << (n*800) - ((n/15)*200) << endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ios_base::sync_with_stdio(0);
ll n;
cin>>n;
ll x,y;
x=n*800;
y=(n/15)*200;
cout<<x-y;
} | 1 | 66,468,401 |
#include<stdio.h>
int main()
{
int a;
int b;
scanf("%d %d",&a,&b);
if(a==1 && b==2){
printf("3\n");
}
else if(a==1&&b==3)
printf("2\n");
else if(a==2&&b==3)
printf("1\n");
else if(a==2&&b==1)
printf("3\n");
else if(a==3&&b==1)
printf("2\n");
else
printf("1\n");
return 0;
} | #include<iostream>
#include<stdio.h>
#include<cstring>
#include<cmath>
#include<vector>
#include<set>
#include<map>
#include<algorithm>
#include<unordered_map>
#include<bits/stdc++.h>
#define ll long long
#define d double
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int a,b;... | 1 | 17,407,063 |
#include<stdio.h>
#include<string.h>
using namespace std;
char a[105][5];
char b[105][5];
int q=1;
void squt(char a[],char b[]){
char s[105];
strcpy(s,a);
strcpy(a,b);
strcpy(b,s);
}
int main(){
int n;
char s;
scanf("%d%c",&n,&s);
for(int i=0;i<n;i++){
scanf("%s",a[i]);
strcpy(b[i],a[i]);
}
fo... | #include<iostream>
using namespace std;
typedef struct{
char mark;
int value;
int order;
}t;
int main(){
int N,minj,f=0;
t C1[36],C2[36],a;
cin>>N;
if(N>0 && N<37){
for(int i=0;i<=N-1;i++){
while(1){
cin>>C1[i].mark;
if(C1[i].mark!='D'&&C1[i].mark!='C'&&C1[i].mark!='S'&&C1[i].mark!='... | 1 | 75,366,300 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
long long int n,a[100001],b[100001],i=1,j,saidai=0,m=0;
cin >> n;
for(i=0;i<n+1;i++)
{
cin >> a[i];
saidai+=a[i];
}
for(i=0;i<n;i++)
{
cin >> b[i];
}
for(i=0;i<n;i++)
{
if(a[i]<b[i])
... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n; cin >> n;
vector<int> a(n + 1), b(n);
for (int i = 0; i < n + 1; i++) cin >> a[i];
for (int i = 0; i < n; i++) cin >> b[i];
long long ans = 0;
for (int i = 0; i < ... | 1 | 45,516,008 |
#include <iostream>
int answer[101];
int main(int argc, char const* argv[])
{
int input;
for( int i = 0;i < 101;i++ ) answer[i] = 0;
while( std::cin >> input ){
answer[input]++;
}
int max = 0;
for( int i = 1;i < 101;i++ ){
max = std::max( answer[i], max );
}
for( int i = 1;i < 101;i++ ){
if( answer[i] == ... | #include <bits/stdc++.h>
#define rep(i,l,n) for(int i=l;i<n;i++)
using namespace std;
int main(){
int data[101]={},num,max=0;
while(cin>>num){
data[num]++;
}
rep(i,1,101){
if(data[i]>max) max=data[i];
}
rep(i,0,101){
if(data[i]==max) cout<<i<<endl;
}
} | 1 | 62,924,497 |
#include <stdio.h>
int main(){
int k, a, b;
scanf("%d", &k);
scanf("%d %d", &a, &b);
int flag = 0;
for(int i=a; i<=b; i++){
if ( i % k == 0){
flag = 1;
break;
}
}
flag? printf("OK\n") : printf("NG\n");
return 0;
} | #include<iostream>
#include<math.h>
#include<bits/stdc++.h>
#define ll long long int
#define hell 1000000007LL
using namespace std;
ll power(ll x, ll y){
if(y==0)
return 1;
else
{
ll p=power(x,y/2);
if(y%2==0)
return (p*p)%hell;
else
return (x*((p*p)%hell))%hel... | 1 | 27,533,635 |
#include <bits/stdc++.h>
#define optimize ios_base::sync_with_stdio(0) ; cin.tie(0) ; cout.tie(0) ;
#define ll long long
#define ld long double
#define lint __int128
#define vi vector<int>
#define pb push_back
#define lp(i,a,b) for(int i = a ; i <= b ; i ++)
#define rlp(i,a,b) for(int i = b ; i >= a ; i --)
#define a_s... | #include <bits/stdc++.h>
using namespace std;
int main() {
string A, B;
cin >> A >> B;
int al = A.size();
int bl = B.size();
if (al > bl) {
cout << "GREATER" << endl;
return 0;
}
if (al < bl) {
cout << "LESS" << endl;
return 0;
}
for (int i = 0; i < al; i++) {
if (A[i] > B[i]) {
... | 1 | 45,175,849 |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
#define FOR(i,a,b) for(int i = (a); i < (b); i++)
#define REP(i,n) FOR(i,0,n)
#define FORCLS(i,a,b) for(int i = (a); i <= (b); i++)
#define REPCLS(i,n) FORCLS(i,1,n)
int main() {
int h, w;
cin >> h >> w;
char buf[256];
strin... | #include<bits/stdc++.h>
using namespace std;
typedef long long int uli;
int main(){
int n,m;
scanf("%d %d",&n,&m);
char s[12];
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
scanf("%s",s);
if(strcmp(s,"snuke")==0){
printf("%c%d\n",j+'A',i+1);
return 0;
}
}
}
return 0;
... | 1 | 88,285,998 |
#include <iostream>
#include <vector>
using namespace std ;
using ll = long long ;
using vll = vector<ll> ;
ll mod = 1000000007 ;
int main(){
ll n,k ;
cin >> n >> k ;
vll a(n) ;
for(auto &i:a) cin >> i ;
vll l(n,0),r(n,0) ;
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
if(a.at(i)>a.at(j)){
if(i>j) l.at(i)+... | #include <bits/stdc++.h>
#define rep(i, a, b) for(int i = a; i < b; i++)
#define Rep(i, a, b) for(int i = a; i <= b; i++)
#define _GLIBCXX_DEBUG
#define Vl vector<ll>
#define Vs vector<string>
#define Vp vector<pair<ll, ll>>
#define ll long long
#define ALL(v) (v).begin(),(v).end()
#define endl "\n"
using namespace std... | 1 | 17,482,627 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
typedef long double ld;
const double pi=acos(-1.0);
const ll mod=pow(10,9)+7;
const ll INF=pow(2,31)-1;
typedef pair<int,int> P;
typedef vector<int> vi;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
struct Edge {
ll to;
ll cost;
};
i... | 1 | 91,715,407 |
#include <iostream>
using namespace std;
int main(void){
int a,b,c;
cin>>a>>b>>c;
if(a%b==0){
cout<<"NO"<<endl;
}else{
int i,ans;
for(i=1;i<=b;i++){
ans=a*i-c;
if(ans%b==0){
cout<<"YES"<<endl;
break;
}
}
if(i==b+1)cout<<"NO"<<endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i,a,b) for(int i=int(a); i<int(b); ++i)
#define FORD(i,a,b) for(int i=int(a); i<int(b); --i)
#define REP(i,N) for(int i=0; i<int(N); ++i)
#define REPD(i,N) for(int i=0; i<int(N); --i)
#define PB push_back
#define ALL(obj) (obj).begin(), (obj... | 1 | 65,909,744 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string a;
getline(cin,a);
for(int i = 0; i < a.size(); ++i){
if(a[i] >= 'a' && a[i] <= 'z')a[i] = toupper(a[i]);
else if(a[i] >= 'A' && a[i] <= 'Z')a[i] = tolower(a[i]);
}
cout<<a<<'\n';
} | #include <stdio.h>
int main(void)
{
char string[2048];
int i=0;
int qty=0;
fgets(string,2000,stdin);
while(string[i]!='\0')
{
qty++;
i++;
}
for(i=0;i<=qty;i++)
{
if('A' <= string[i] && string[i] <= 'Z')
{
string[i] += ((int)('a') - ('A'));
}
else if('a' <= string[i] && string[i] <= 'z')
{
s... | 1 | 14,174,505 |
#include <iostream>
#include <cassert>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <cctype>
#include <cmath>
#include <ctime>
#include <queue>
#include <set>
#include <map>
#include <stack>
#include <string>
#include <bitset>
#include <vector>
#include <complex>
#include <algorithm>
using namespace... | #include<iostream>
#include<vector>
using namespace std;
vector<int>G[1<<17];
int n,m;
long a,b,c;
int v[1<<17];
bool dfs(int u,int col)
{
v[u]=col;
bool ans=1;
for(int i=0;i<G[u].size();i++)
{
if(!v[G[u][i]])ans&=dfs(G[u][i],3-col);
else
{
ans&=v[G[u][i]]==3-col;
}
}
return ans;
}
main()
{
cin>>n>>m;... | 1 | 99,600,047 |
#include<stdio.h>
int sum (int n,int s,int cnt);
int N,S,latte;
int main (void)
{
int i;
while(1){
scanf("%d%d",&N,&S);
if(N==0&&S==0)break;
latte = 0;
printf("%d\n",sum(0,0,0));
}
return 0;
}
int sum(int n,int s,int cnt)
{
latte++;
if(s>S || cnt>N || s+(n+9)*(9-n... | #include<bits/stdc++.h>
using namespace std;
int serch(int i,int j,int n)
{
if(!n&&!j)return 1;
else if(i==10||!n)return 0;
return serch(i+1,j-i,n-1)+serch(i+1,j,n);
}
int main()
{
int n,s;
while(cin>>n>>s&&n!=0)cout<<serch(0,s,n)<<endl;
} | 1 | 92,554,282 |
#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define INF (1<<30)
#define INFLL (1ll<<60)
typedef pair<int, int> P;
typedef pair<int, P> E;
#define MOD (1000000007ll)
#define l_ength size
void mul_mod(ll& a, ll b){
a *= b;
a %= MOD;
}
void add_mod(ll& a, ll b){
a += b;
if(a>MOD){
a -= MOD;
... | 1 | 87,183,367 |
#include<bits/stdc++.h>
#define ll long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
static const ll MAX = 1000000000000000;
static const int NIL = -1;
using namespace std;
const long double EPS = 0.0000000001;
const long double PI = (acos(-1));
const ll MOD = 1e9 + 7;
#pragma GCC target("avx2")
#pragm... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for( int i = 0 ; i < n ; i++ )
typedef long long ll ;
int main() {
int N ;
ll ans = 0 ;
cin >> N ;
vector<ll> A(N) ;
map<ll,ll> mp ;
rep(i,N) cin >> A.at(i) ;
vector<ll> S(N+1) ;
S.at(0) = 0 ;
mp[S.at(0)]++ ;
rep(i,N){
S.at(i+1) = S.... | 1 | 79,360,834 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long H, W, N;
cin >> H >> W >> N;
map<pair<int, int>, int> mp;
for (int i=0; i<N; i++){
int a, b; cin >> a >> b;
for (int x=-1; x<=1; x++){
for (int y=-1; y<=1; y++){
if (a+x<=1||a+x>=H||b+y<=1||b+y>=W) continue;
mp[mak... | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<unordered_map>
#include<stack>
#include<random>
#include<set>
#include<map>
#include<functional>
using namespace std;
#define int long long
#define inf 1145141919
#define rep(i,n) for(int i=0;i<n;i++)
typedef pair<int, int... | 1 | 54,400,506 |
#include <iostream>
#include <algorithm>
#include <string>
int main(){
std::ios::sync_with_stdio(false);
std::cin.tie(0);
while(true){
std::string x;
std::cin >> x;
if(x=="0") break;
int ans = 0;
for(const auto& c : x){
ans += c-'0';
}
std:... | #include <iostream>
#include <string>
using namespace std;
int main(void)
{
int s,l,k,j,i;
string n,m[1001]={};
k = 0;
do{
k = k+1;
cin >> n;
m[k] = n;
}while(n != "0");
j = k-1;
for(k = 1; k <= j; k++){
i = m[k].size();
s = 0;
for(l = 0; l<=i-1; l++)
s = s + (m[k][l]-'0');
... | 1 | 9,489,152 |
#include <iostream>
#include <cmath>
#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>
#inclu... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string str;
int ans=0;
for(int i=1; i<N+1; i++){
str=to_string(i);
if(str.size()%2==1) ans++;
}
cout << ans << endl;
} | 1 | 43,822,288 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
string s;
cin>>s;
ll cnt=0;
ll sum=0;
for(int i=0;i<s.size();i++)
{
if(s[i]=='W')
{
cnt++;
sum+=i;
}
}
for(int i=0;i<cnt;i++)
{
sum-=i;
}
c... | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
string S;
cin >> S;
int ans = 0,w=0;
for(int i=0; i<S.size(); i++){
if(S[i] == 'W'){
ans+= i-w;
w++;
}
}
cout << ans << endl;
} | 1 | 26,269,068 |
#include <iostream>
int main() {
char a, b;
std::cin >> a >> b;
if (a == b)
std::cout << 'H' << '\n';
else
std::cout << 'D' << '\n';
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for(int i = 0; i < (int)(n); i++)
int main(){
char a,b;
cin>>a>>b;
if (a==b)
{
cout<<'H'<<endl;
}
else if(a=='H'&&b=='D')
{
cout<<"D"<<endl;
}
else if (a=='D'&&b=='H')
{
c... | 1 | 29,484,969 |
#include<bits/stdc++.h>
using namespace std;
int a[100001],dp[100001];
int solve(int n)
{
dp[0]=0;
dp[1]=abs(a[0]-a[1]);
for(int i=2;i<n;i++)
{
int d=abs(a[i]-a[i-1]);
int e=abs(a[i]-a[i-2]);
dp[i]=min(dp[i-2]+e,dp[i-1]+d);
}
return dp[n-1];
}
int main()
{
int n;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using pint = pair<int, int>;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
const int MOD = 1000000007;
const long long INF = 1LL << 60;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; retu... | 1 | 10,079,600 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define range(i,a,b) ((a)<=(i) && (i)<(b))
#define debug(x) cout << #x << ' ' << ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<ll, int> P;
ll Mod = 1000000007;
int main() {
int N;
cin >> N;
ll A[N],B[N];
for (int i = 0; i < N; i++) cin >> A[i] >> B[i];
vector<P> Q;
for (int i = 0; i < N; i++) {
Q.push_back(make_pair(A[i]+B[i],i));
}
sort(Q.begi... | 1 | 5,465,198 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int a, b;
scanf("%d %d", &a, &b);
if (a > 8 || b > 8) {
puts(":(");
} else {
puts("Yay!");
}
} | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define dump(x) cout << x << endl
typedef int64_t Int;
using namespace std;
using Graph = vector<vector<Int>>;
const double pi = M_PI;
const Int MOD = 1000000007;
int main() {
int a, b;
cin >> a >> b;
if (8 < a || 8 < b) {
cout << ":(" << endl;
... | 1 | 50,629,786 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(long long i=0; i<(long long)(n);i++)
#define rep2(i,s,n) for(long long i=(s); i<(long long)(n);i++)
#define mod 1000000007
typedef long long ll;
int main() {
string s;cin>>s;
int cnt=0;
rep(i,s.size()){
if(s[i]=='o'){
cnt... | #include <iostream>
using namespace std;
int main()
{
string s;
cin >> s;
int k = s.size();
for (int i = 0; i < k; ++i)
{
cin >> s[i];
}
int a = 0;
for (int i = 0; i < k; ++i)
{
if (s[i] == 'o')
{
a = a+1;
}
}
if (a+(15-k) > 7)
cout << "YES";
else
cout << "NO";
} | 1 | 99,976,509 |
#include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define x first
#define y second
#define mk(a,b) make_pair(a,b)
#define rr return 0
#define sqr(a) ((a)*(a))
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()... | #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, n;
cin >> h >> n;
vector<int> a(n), b(n);
rep(i, n) cin >> a[i] >> b[i];
vector<int> dp(h+1, 1e9);
dp[0] = 0;
rep(i, n){
rep(j, h){
... | 1 | 80,654,601 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
#define rep(i,s,n) for(int i = s; i < (int)(n); i++)
vector<P>prime_factorize(ll n) {
vector<P> res;
for (ll p = 2; p * p <= n; ++p) {
if (n % p != 0) continue;
int num = 0;
while (n % p == 0) { ++... | #include <iostream>
using namespace std;
typedef long long ll;
int main() {
ll N; cin >> N;
ll ans = 0;
for (ll i = 2; i * i <= N; i++) {
if (N % i == 0) {
ll tmp = 0;
while (N % i == 0) {
N /= i;
tmp++;
}
ll k ;
... | 1 | 16,271,763 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
vector<int> a = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int k;
cin >> k;
cout << a[k - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int,int> pi;
#define all(x) x.begin(),x.end();
const int INF=INT_MAX;
const ld PI=3.1415926535897932384626433;
const ld E=2.71828183;
const int MOD=1e9+7;
vi b... | 1 | 23,686,159 |
#include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9+7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) for(int i=0;i<(n);++i)
#define REPR(i,n) for(int i=n;i>=0;i--)
#define FOREACH(x,a) for(auto& (x) : (a) )
ty... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll m,n;
cin>>m>>n;
cout<<(m*(m-1))/2 +(n*(n-1))/2;
return 0;
} | 1 | 65,436,552 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
int main()
{
ll n;
cin >> n;
vector<ll> a(n);
ll max1;
rep(i, n)
{
cin >> a[i];
if (i == 0)
{
max1 = a[i];
}
else
{
... | using namespace std;
#include <iostream>
#include <bits/stdc++.h>
#define infile "../test/sample-1.in"
#define int long long
#define INF 1000000000000000000LL
#define MOD 1000000007LL
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define ... | 1 | 66,344,646 |
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
int main() {
int m, nmin, nmax;
while (cin >> m >> nmin >> nmax) {
if (m == 0 && nmin == 0 && nmax == 0) {
break;
}
vector<int> d(m);
for (int i = 0; i < m; i++) {
cin >> d[i];
}
int MAX = d[nmin-1]-d[nmin];
int maxn = nmi... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i=0; i<(n); ++i)
#define RREP(i, n) for (int i=(int)(n)-1; i>=0; --i)
#define FOR(i, a, n) for (int i=(a); i<(n); ++i)
#define RFOR(i, a, n) for (int i=(int)(n)-1; i>=(a); --i)
#define SZ(x) ((int)(x).size())
#define all(x) begin(x),end(x)
#define... | 1 | 50,384,589 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false); cin.tie(NULL);
string a,b;
cin>>a>>b;
if(a.size()>b.size())
{
cout<<"GREATER";
}
else if(a.size()<b.size())
cout<<"LESS";
else
{
int j =0;
for(int i=0;i<a.size();i++)
{
int x = a[i]-'0';
int y = b[i]-'0... | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define faster ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
typedef long long ll;
typedef vector<int> vi;;
typedef vector<ll> vll;
#define l() length()
#define sz() size()
#define b() begin()
#define e() end()
#define all(x) x.begin(), x.... | 1 | 33,656,767 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL... | #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;
struct edge{
ll p;
ll w;
};
vector<vector<edge> > graph(100000);
vector<ll> res(100000);
l... | 1 | 9,459,510 |
#include <stdio.h>
int main()
{
char S[50];
scanf("%s", &S);
if( S[0] == S[1] && S[1] == S[2]) {
printf("No");
}
else {
printf("Yes");
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define F first
#define S second
#define pii pair<int,int>
#define vi vector<ll>
#define vii vector<pii>
#define pb push_back
#define mp make_pair
#define all(v) (v).begin(), (v).end()
#define pb push_back
#define mp make_pair
#d... | 1 | 32,364,694 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define ll long long
#define _GLIBCXX_DEBUG
const ll MOD = 1000000007;
const int MAX = 510000;
vector<ll> enum_div(ll n){
vector<ll> ret;
for (ll i=1; i*i<=n; i++){
if (n%i==0){
ret.push_back(i);
if (i!=1&&i*i!=n) ret.p... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll n, sum=0;
cin >> n;
for(ll i=1; i<=(int)pow(n,0.5); i++){
if(!(n%i)){
ll res = n/i-1;
if(res>i) sum+=n/i-1;
}
}
cout << sum << endl;
return 0;
} | 1 | 96,637,819 |
#include <iostream>
#include <vector>
#include <string>
#include <unordered_map>
#include <math.h>
#include <algorithm>
#include <deque>
#include <queue>
#include <climits>
#include <set>
using namespace std;
#define ll long long
#define ull unsigned long long
#define ve vector
#define umap unordered_map
#define iter i... | #include<bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const int INF= 1e9+5;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll> >vvl;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> T;
const ll MOD=1000000007LL;
int main(){
ll n;cin>... | 1 | 94,709,197 |
#include <iostream>
#include <string>
#include <vector>
#include <math.h>
#include <map>
#include <algorithm>
using namespace std;
template< typename T>
void print(const vector<T> &data) {
if (data.empty()) return;
for (int i = 0; i < data.size(); ++i) {
cout << data[i];
if (i != data.size() - 1) cout << " ";
e... | #include <iostream>
#include <vector>
#include <string>
#include <utility>
using namespace std;
typedef struct{
int idx;
char dec;
int num;
}playingCard;
void printVector(const vector<playingCard> &A) {
for(int i = 0; i < A.size(); i++) {
cout << A[i].dec << A[i].num;
... | 1 | 25,378,064 |
#include <stdio.h>
#include <math.h>
#include <string.h>
#include <stdlib.h>
#include <vector>
#include <set>
#include <map>
#include <iostream>
#include <utility>
#include <queue>
#include <algorithm>
#include <functional>
#include <string>
#include <bitset>
#define ll long long
#define fri(n) for(i=0;i<(n);i++)
#defi... | #include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <string>
#define long long long
using namespace std;
int main() {
int n;
cin >> n;
long ans=0, best=1e17;
for (int i=0; i<n; i++) {
long a, b;
cin >> a >> b;
if (a > b) best = min(best, b);
... | 1 | 12,566,682 |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main() {
string s;
int times[26] = { 0 };
getline(cin, s);
while(s != "") {
transform(s.begin(), s.end(), s.begin(), ::tolower);
for(int i = 0;i < s.size();i++) {
times[(int)s.at(i) - (int)'a']++;
}
getline(cin, s);
}
f... | #include<cstdio>
#include<functional>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<string>
#include<cstdlib>
#include<cctype>
#define rep(i,a) for(i=0;i<a;i++)
#define kk 26
using namespace std;
typedef pair<char,int> P;
int main(void)
{
FILE *fp;
int i,j,k;
P data[27];
char cc[27]={"abcdefghij... | 1 | 21,283,585 |
#include <bits/stdc++.h>
using namespace std;
inline int read()
{
char c = getchar(); int f = 1, x = 0;
while( c < '0' || c>'9' ) { if(c == '-') f = -1; c = getchar(); }
while( c >= '0'&&c<='9' ) { x = x * 10 + c - '0'; c = getchar(); }
return f * x;
}
int n, k;
vector <int> s[110000];
int main()
{
... | #include <bits/stdc++.h>
#define BR "\n"
#define REP(i,n) for(int (i)=0;(i)<(n);++(i))
#define ALL(cont) begin(cont),end(cont)
#define AS_MOD(a,b) ((((a) % (b) ) + (b)) % (b))
#define FEACH(it,cont) for(auto (it) = begin(cont); it!=end(cont);++it)
#define FEACHR(it,cont) for(auto (it) = rbegin(cont); it!=rend(cont);++i... | 1 | 47,752,046 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
long long mo = 1e9 + 7;
typedef long long ll;
typedef pair<int,int> P;
int main(){
ll N,K;
cin >> N >> K;
vector<ll> A(N);
ll M = -1;
rep(i,N){
cin >> A[i];
M = max(M,A[i]);
}
ll gc = A[0];
... | #include <cstdio>
#include <cstdlib>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define repi(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,a) repi(i,0,a)
#define ... | 1 | 44,547,063 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (long long i = 0; i < (n); ++i)
#define DIV 1000000007
int main(){
ll N;
cin >> N;
vector<ll> A(N);
rep(i, N) cin >> A[i];
ll maxi = -1;
ll maxi2 = -1;
rep(i, N) {
if(maxi < A[i]) {
maxi2 = maxi;
maxi = A[i];
} els... | #include<cstdio>
#include<algorithm>
using namespace std;
int a[200000],b[200000];
int main(void)
{
int i,n;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
b[i]=a[i];
}
sort(b,b+n);
for(i=0;i<n;i++){
if(a[i]==b[n-1]){
printf("%d\n",b[n-2]);
}
else{
printf("%d\n",b[n-1]);
}
}
return 0;
} | 1 | 98,791,940 |
#include <bits/stdc++.h>
#define FASTIO ios::sync_with_stdio(false);cin.tie(0);
#define ADD +
#define SUBTRACT -
#define MULTIPLY *
#define DIVIDE /
#define MOD %
#define INCREMENT(x) ++x
#define DECREMENT(x) --x
#define in(a,b) cin>>a>>b;
#define out(a,b) cout<<a<<endl<<b<<endl;
#define scan(a) scanf("%d",&a);
#define... | #include <bits/stdc++.h>
#define tt this->
#define ll long long
using namespace std;
int main ()
{
ll x,y,z,s=0;
cin>>x>>y;
for (int i=0; i<x ; i++)
{
cin>>z;
if (z>=y)s++;
}
cout<<s;
return 0;
} | 1 | 40,649,392 |
#include <bits/stdc++.h>
#include <iostream>
typedef long long ll;
#define rep(i,a,b) for(ll i =a ;i <= b;i++)
#define per(i,a,b) for(ll i =a ;i >= b;i--)
using namespace std;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
int main(int argc, char const *argv[])
{
ll n,a,b;
cin>>n>>a>>b;
ll q = n /(a+ b);
... | #include "bits/stdc++.h"
using namespace std;
#define rep(i,n)for(int i=0;i<(int)(n);i++)
#define PI 3.141592653589793
int main()
{
long long int n, a, b;
cin >> n >> a >> b;
long long int c, sum = 0;
sum += n / (a + b) * a;
c = n % (a + b);
if (c <= a)
sum += c;
else
sum += a;
cout << sum << endl;
} | 1 | 55,566,158 |
#include <iostream>
#include <algorithm>
#include <iomanip>
using namespace std;
int main()
{
int a, b;
cin >> a>> b;
int d = a / b;
int r = a % b;
double f = double(a) / double(b);
printf("%d %d %.5f\n",d,r,f);
return 0;
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <cmath>
#include <string>
#include <sstream>
#include <iomanip>
#include <complex>
using namespace std;
#define ll long long
#define vvi vector< vector<int> >
#define vi vector<int>
#define All(X) X.begi... | 1 | 97,905,731 |
#include<bits/stdc++.h>
using namespace std;
long long a[1000005];
int main()
{
int n;
scanf("%d",&n);
for(int i=1;i<=n;++i)scanf("%lld",&a[i]);
long long l=2,r=2;
for(int i=n;i>=1;--i)
{
l=(l-1)/a[i]+1,r=r/a[i];
if(l>r)return !printf("-1\n");
l*=a[i];
r=r*a[i]+a[i]-1;
}
printf("%lld %lld\n",l,r);
retu... | #include <bits/stdc++.h>
#include <array>
using namespace std;
using ULL = unsigned long long;
using UL = unsigned;
using LL = long long;
#define rep(i, n) for(UL i = 0; i < (n); i++)
struct Problem {
void Solve(){
UL N; cin >> N;
vector<ULL> A(N); rep(i, N) cin >> A[i];
reverse(A.begin(), A.end());
ULL L, R; ... | 1 | 85,697,892 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cmath>
#include <numeric>
#include <iomanip>
#include <stack>
#include <complex>
#include <functional>
#include <tuple>
using namespace ... | #include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<string>
#include<unordered_map>
#include<set>
using namespace std;
#define intmax INT_MAX
#define lmax LONG_MAX
... | 1 | 60,829,793 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <unordered_map>
#include <vector>
const int mod = 1e9 + 7;
const int kmax = 510000;
const int last_days[] = { 31, 28, 31, 30, 31, 30, 31, 31, 30, 31,... | #include<bits/stdc++.h>
#define rep(i,N) for(ll (i)=0;(i)<(N);(i)++)
#define chmax(x,y) x=max(x,y)
#define chmin(x,y) x=min(x,y)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int mod = 1000000007;
int main() {
int n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
sort(a.begin(),... | 1 | 80,218,499 |
#include <cstdio>
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#define rep(i,n) for (int i=0;i<n;i++)
using ll = long long;
using namespace std;
void solve(){
}
int main (){
... | #include <bits/stdc++.h>
#define rep0(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i <= (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main()
{
int A,P;
cin >> A >> P;
cout << (3*A+P)/2;
} | 1 | 75,873,256 |
#include <iostream>
using namespace std;
bool map[100][100];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int a, c;
cin >> a >> c;
for (int j = 0; j < c; j++) {
int b;
cin >> b;
map[a - 1][b - 1] = true;
}
}
for (int i = 0; i < n; i++) {
cout << (map[i][0] ? "1" : "0");
for (int... | #include <iostream>
#define rep(i,n) for(int i = 0 ; i < n ; i++)
using namespace std;
int G[100][100];
int main(){
int V;
cin >> V;
rep(i,V){
int u,k,v;
cin >> u >> k;
rep(j,k){
cin >> v;
G[u-1][v-1] = 1;
}
}
rep(i,V){
rep(j,V){
if(j == V-1) cout << G[i][j] << endl;
... | 1 | 42,422,194 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ll a,b,c,d;
cin>>a>>b>>c>>d;
ll one=b*d;
ll two=a*c;
ll three=b*c;
ll four=a*d;
ll m1=max(one,two);
ll m2=max(three,four);
ll ans=max(m1,m2);
cout<<ans<<endl;
} | #include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <iomanip>
#include <sstream>
#include <fstream>
#include <stdint.h>
#include <string.h>
#define _USE_MATH_DEFINES
#include <math.h>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#inclu... | 1 | 19,509,052 |
#include<iostream>
using namespace std;
int main(){
int a,b,c,t;
cin >> a >> b >> c;
while(1){
if(c<=b && b<=a)break;
if(a>b){
t = a;
a = b;
b = t;
}else if(b>c){
t = b;
b = c;
c = t;
}else if(c>a){
t = c;
c = a;
a = t;
}
}
cout << c <<" "<< b << " " << a <<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int a, b, c, x;
cin>>a>>b>>c;
if(a>=b){
x=a;
a=b;
b=x;
}
if(a>=c){
x=a;
a=c;
c=b;
b=x;
}else if(a<c&&c<b){
x=b;
b=c;
c=x;
}
cout<<a<<" "<<b<<" "<<c<<endl;
return 0;
} | 1 | 11,430,737 |
#include <iostream>
using namespace std;
int N, S;
int main() {
while (cin >> N && N > 0) {
int sum = 0, max = 0, min = 1000;
for (int i = 0; i < N; i++) {
cin >> S;
sum += S;
if (S > max) max = S;
if (S < min) min = S;
}
cout << (int)((sum-max-min)/(N-2)) << endl;
}
} | #include<iostream>
using namespace std;
int main(){
int n, i, p;
while(cin>>n,n){
int min=1000,max=0,total=0;
for(int i=0;i<n;++i){
cin >> p;
if(p>max)max=p;
if(p<min)min=p;
total += p;
}
cout << (total-max-min)/(n-2) << "\n";
}
} | 1 | 46,724,088 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin>>n>>m;
int a[m],b[m],c[m];
vector<vector<int>>d(n,vector<int>(n,1000000000));
for(int i=0;i<n;i++)d[i][i]=0;
for(int i=0;i<m;i++){
cin>>a[i]>>b[i]>>c[i];
a[i]--;
b[i]--;
d[a[i]][b[i]]=c[i];
... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll MAXN = 105;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
ll n, m;
cin >> n >> m;
vector < ll > a(m), b(m), c(m);
vector < vector < ll > > d(MAXN, vector < ll > (MAXN, 1e17));
for(int i = 0; i < m; i++)... | 1 | 39,024,567 |
#include <bits/stdc++.h>
#define rep(i,a,n) for (int i =a; i<n; i++)
using namespace std;
int main() {
string A,B; cin >> A >> B;
int sizeA = A.size(), sizeB = B.size();
if (sizeA > sizeB) {
cout << "GREATER" << endl; return 0;
} else if (sizeA < sizeB) {
cout << "LESS" << endl; return 0;
} else {
... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int (i)=0;(i)<(n);i++)
#define INF 1001001001
#define LLINF 1001001001001001001
#define MOD 1000000007
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... | 1 | 23,291,565 |
#include<stdio.h>
int main(void)
{
int a,b;
scanf("%d %d\n",&a,&b);
if(a>b)
{
printf("a > b\n");
}
if(a<b)
{
printf("a < b\n");
}
if(a==b)
{
printf("a == b\n");
}
return 0;
} | #include <iostream>
using namespace std;
int main(void)
{
int number1, number2;
cin >> number1 >> number2;
if (number1 == number2) {
cout << "a == b" << endl;
} else if (number1 < number2) {
cout << "a < b"<< endl;
} else {
cout << "a > b" << endl;
}
} | 1 | 46,063,248 |
#include <iostream>
#include <bits/stdc++.h>
#include <string>
#include <ctype.h>
#include <algorithm>
#include <cmath>
#include <vector>
#define REP(i, n) for(int i=0;i<(int)(n);i++)
#define ALL(x) (x).begin(),(x).end()
#define square(x) (x) * (x)
const int INF = 1e9;
using namespace std;
int main() {
string s, p;... | #include<iostream>
using namespace std;
bool Compare(const char*s, const char*p, int i, int sMax) {
for (int j = 0; p[j] != '\0'; j++) {
if (s[(i + j) % sMax] != p[j])return false;
}
return true;
}
int main() {
char s[100];
char p[100];
int sMax;
cin >> s >> p;
for (sMax = 0; s[sMax] != '\0'; sMax++);
for (i... | 1 | 14,204,898 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#define rep(i, begin, n) for (int i = begin; i < n; i++)
#define repe(i, begin, n) for (int i = begin; i <= n; i++)
#define repr(i, begin, n) for (int i = begin; i > begin - n; i--)
#define repre(i,... | #include <bits/stdc++.h>
using namespace std;
int main()
{string S; cin >> S;
for (auto c{'a'}; c <= 'z'; ++c) if (!~S.find(c)) cout << c << endl, exit(0);
puts("None");} | 1 | 93,499,106 |
#include<bits/stdc++.h>
#define ll long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
static const ll MAX = 1000000000000000;
static const int NIL = -1;
using namespace std;
const long double EPS = 0.0000000001;
const long double PI = (acos(-1));
const int MOD = 1000000007;
#pragma GCC target("avx2")
#p... | #include <iostream>
#include <algorithm>
using namespace std;
const int INF = 1100000000;
const int H_MAX = 10000;
const int N_MAX = 1000;
int main() {
int h, n;
cin >> h >> n;
int a[n], b[n];
for (int i = 0; i < n; i++) cin >> a[i] >> b[i];
int dp[H_MAX+1];
dp[0] = 0; fill(dp+1, dp+H_MAX+1, INF);
for (int j = 1... | 1 | 30,887,709 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
int main(){
long n;
cin >> n;
for (long i = 0; i < n; i++){
vector<long> edge(3);
cin >> edge[0] >> edge[1] >> edge[2];
sort(edge.begin(), edge.end());
if (edge[0] * edge[0] + edge[1] * edge[1] == edge[2] * edge[... | #include <iostream>
#include <cmath>
using namespace std;
int aa(int x, int y, int z) {
return ((pow(x, 2) + pow(y, 2) == pow(z, 2)) || (pow(x, 2) + pow(z, 2) == pow(y, 2)) || (pow(y, 2) + pow(z, 2) == pow(x, 2)));
}
int main() {
int a, b[1000], c[1000], d[1000];
bool e[1000];
cin >> a;
for (int i = 1; i <= a; i++... | 1 | 98,687,645 |
#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
using namespace std;
int main() {
string S; cin >> S; int diff = 10e7;
for (int i = 0; i < S.length(); ++i) {
string w = S.substr(i, 3);
int n = stoi(w);
if (diff > abs(753 - n)) diff = abs(753 ... | #include <bits/stdc++.h>
#include <iostream>
#define ll long long
#define map unordered_map
#define set unordered_set
#define pll pair<ll, ll>
#define vll vector<ll>
using namespace std;
const ll MOD = 1000000007LL;
const ll INF = (1LL << 60LL);
int main() {
string str;
cin >> str;
ll ans = INF;
for (ll i = 0; ... | 1 | 39,891,050 |
#include "bits/stdc++.h"
using namespace std;
#define MOD 1000000007
const double EPS = 1e-9;
#define INF (1LL<<60)
#define D double
#define fs first
#define sc second
#define int long long
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define RFOR(i,a,b) for(int i = (int)(b-1);i>=(int)(a);--i)
#define REP(i,n)... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
#define P pair<int,int>
const ll INF = pow(10, 9) + 7;
int main() {
int n;
cin >> n;
double a=0,b;
rep(i,n){
double x;
cin >>x;
a += 1/x;
}
cout << 1/a << endl;
} | 1 | 92,719,984 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
ll N;
cin>>N;
vector<ll>d(N);
for(ll i=0;i<N;i++)cin>>d[i];
sort(d.begin(),d.end());
cout<<d[N/2]-d[N/2-1]<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
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; }
const int INF=1001001001;
vector<pair<int64_t,int64... | 1 | 20,854,646 |
#include<iostream>
#include<string>
#include<stack>
using namespace std;
int main(){
bool flg=false,bflg;
int i;
while(!flg){
string s;
stack<char> box;
char ch;
getline(cin,s);
if(s==".")flg=true;
else {
bflg=true;
box.push('s');
for(i=0;i<s.size();i++){
ch=s.at(i)... | #include <iostream>
#include <string>
using namespace std;
int main(){
string str;
getline(cin,str);
int ro,so,i,j,k,b[1000]={},p=0;
while(str.size()!=1||str[0]!='.'){
ro=0;so=0;k=0;p=0;
for(i=0;i<str.size();i++){
if(str[i]=='(') {
ro++;
p++;
b[p]=1;
}
if(str[i]=='[') {
so++;
p++;... | 1 | 100,542,357 |
#include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
#include <bitset>... | #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,-1,sizeof(x))
const int INF = 1000000001;
int main(){
int n;
cin >> n;
vector<int> prime = {2,3,5,7,11,13,17,19,23,29,31,37,41,43,47};... | 1 | 22,580,705 |
#include<iostream>
#include<math.h>
#include<bits/stdc++.h>
#define ll long long int
#define hell 1000000007LL
using namespace std;
ll power(ll x, ll y, ll z){
if(y==0)
return 1;
else
{
ll p=power(x,y/2,z);
if(y%2==0)
return (p*p)%z;
else
return (x*((p*p)%z))%z... | #include<stdio.h>
int main(){
char a[100];
scanf("%[^\n]", a);
int ctr = 0;
for(int i= 0; a[i] != '\0'; i++){
if(a[i] == ' '){
if(a[i - 1] == a[i + 1]){
ctr++;
}
}
}
if(ctr == 2){
printf("YES\n");
}
else{
printf("NO\n");
}
return 0;
} | 1 | 52,514,769 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll min, max;
cin >> min >> max;
vector<ll> A;
A.push_back(min);
ll n = min;
for(;;) {
n *= 2;
if(n > max) {
break;
}
A.push_back(n);
}
cout << A.size() << endl;
} | #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 repa(i,a,n) for(int i=(a); i<(int)(n); i++)
#define all(vec) vec.begin(),vec.end()
#define COUT(x) cout<<(x)<<endl
#define YES(x) cout<<(x?"YES":"NO")<<e... | 1 | 23,093,204 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.