code1 stringlengths 54 12k | code2 stringlengths 66 12k | similar int64 0 1 | __index_level_0__ int64 24 101M |
|---|---|---|---|
#include <cstdio>
#include <algorithm>
#define SWAP(a,b) { a += b, b = a - b, a -= b; }
using namespace std;
int main()
{
int n[5];
for(int i=0;i<5;++i) scanf("%d",&n[i]);
sort(n,n+5);
for(int i=0;i<2;++i) { SWAP(n[i],n[4-i]); }
for(int i=0;i<4;++i) printf("%d ",n[i]);
printf("%d\n",n[4]);
r... | #include<iostream>
#include<algorithm>
using namespace std;
int main(){
int input[5];
for(int i=0; i < 5; i++) cin >> input[i];
sort(input, input+5);
for(int i = 4; 0 <= i; i--){
if(i != 4) cout << ' ';
cout << input[i];
}
cout << endl;
} | 1 | 17,787,652 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long int a,b,x[55]={0},y[55]={0};
cin >> a >> b;
for(int i=0;i<a;i++){
cin >> x[i] >> y[i];
}
long long int ans=9e18;
for(int xi=0;xi<a;xi++){
for(int xj=0;xj<a;xj++){
for(int yi=0;yi<a;yi++){
for(int yj=0;yj<a;yj++){
... | #include<bits/stdc++.h>
using namespace std;
int main(){
long N,K;cin>>N>>K;
vector<long>X(N),Y(N);for(long i=0;i<N;i++)cin>>X[i]>>Y[i];
long ans=LONG_MAX;
for(long a=0;a<N;a++)for(long b=a;b<N;b++)for(long c=b;c<N;c++)for(long d=c;d<N;d++){
long y1=min(min(Y[a],Y[b]),min(Y[c],Y[d]));
long y2=max(max(Y[... | 1 | 66,466,009 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,l,r) for(int i=l;i<=r;++i)
const int N=1e5+5;
vector<int>lk[N];
int sg[N];
void dfs(int x,int fr)
{
for(auto y:lk[x])
if(y!=fr)
{
dfs(y,x);
sg[x]^=sg[y]+1;
}
}
int main()
{
int n;
cin>>n;
rep(i,1,n-1)
{
int x,y;
scanf("%d%d",&x,&y);
lk[x].push... | #include <bits/stdc++.h>
using std::cout;
using std::endl;
using std::cin;
std::vector<std::vector<int>> g;
std::vector<int> dp;
int n;
int dfs(int v, int p = -1){
if(~dp[v]) return dp[v];
int ret = 0;
for(auto e : g[v]){
if(e == p) continue;
ret ^= dfs(e, v) + 1;
}
return dp[v] = ret;
}
int main(){
cin >> n;... | 1 | 267,220 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 1; i <= (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#def... | #include <bits/stdc++.h>
using namespace std;
int main() {
int w, h, n;
cin >> w >> h >> n;
vector<vector<int>> xy(n, vector<int>(2));
vector<int> a(n);
vector<vector<int>> field(h, vector<int>(w));
for (int i = 0; i < n; i++) {
for (int j = 0; j < 2; j++) {
cin >> xy.at(i).at(j);
}
cin >>... | 1 | 70,724,099 |
#include<iostream>
using namespace std;
int main (){
string str;
cin >> str;
int count = 0;
for (int i = 0; i < str.length() - 1; i ++){
if (str[i] != str[i + 1]){
count ++;
}
}
cout << count << '\n';
} | #include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple... | 1 | 65,162,042 |
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <iomanip>
#include <vector>
#include <queue>
#include <map>
#include <utility>
#include <limits.h>
#include <bitset>
#include <set>
using namespace std;
#define LL long l... | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repi(i, n) for (ll i = 1; i < (ll)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x)... | 1 | 99,026,371 |
#include <iostream>
using namespace std;
int main() {
int a, b;
const char* opr;
cin >> a >> b;
opr = a > b ? ">" : a < b ? "<" : "==";
cout << "a " << opr << " b" << endl;
} | #include <iostream>
#include <string>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
string s;
if (a > b){
s = "a > b";
} else if (a < b){
s = "a < b";
} else {
s = "a == b";
}
cout << s << endl;
} | 1 | 3,114,968 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); ++i)
using P = pair<int,int>;
using ll = long long;
static const int INF = 1000000000;
static const ll MOD = 1000000007;
ll gcd(ll a, ll b){return b!=0 ? gcd(b, a%b) : a;}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
int main()... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#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 show(x) {for(auto i: x){cout << i << " ";} cout<<endl;}
#define showm(m) {for(auto i: m){cout << m.x << " ";} cout<<endl;}
typedef long l... | 1 | 3,677,588 |
#include<iostream>
#include<string>
#include<list>
#include <stdio.h>
using namespace std;
list<int> lst;
int main()
{
int dataset; scanf("%d", &dataset);
for (int i = 0; i < dataset; i++)
{
char order[20];
scanf("%s", order);
if (order[0] == 'i') {
int a; scanf("%d", &a);
lst.push_front(a);
}
else i... | #include <bits/stdc++.h>
using namespace std;
int main(void){
cin.tie(0);
ios::sync_with_stdio(false);
list<int> l;
int n;
cin >> n;
for(int i=0;i<n;i++){
string s;
int k;
cin >> s;
if(s == "insert"){
cin >> k;
l.emplace_front(k);
}else if(s == "delete"){
cin >> k;
auto it = find(l.begin(),l... | 1 | 76,895,530 |
#include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
#define ld long double
#define ll long long
#define mod 1000000007
#define IINF INT_MAX
#define INF 1LL << 30
template<typename T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template<typename T> T lcm(... | #include <bits/stdc++.h>
using namespace std;
#define ENDL '\n'
#define io ios_base::sync_with_stdio(false);cin.tie(0);
#define sayy cout<<"YES"<<ENDL;
#define sayn cout<<"NO"<<ENDL;
int gcd(int a, int b){
if(a == 0)
return b;
return gcd(b%a, a);
}
int main(){
io
long long int a, b;
cin >> a... | 1 | 50,000,669 |
#include<bits/stdc++.h>
#define lli long long int
#define endl "\n"
using namespace std;
typedef long long int LLI;
typedef double DB;
void fastio()
{
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
}
bool comparator(pair<lli,lli> a,pair<lli,lli> b)
{
if(a.first>b.first)
return true;
... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = (a); i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define endl '\n'
typedef long long ll;
typedef pair<int,int> pii;
typedef p... | 1 | 30,886,936 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define inf 1001001001001001001
#define mod 1000000007
#define mod2 998244353
#define pi acos(-1)
#define all(v) v.begin(),v.end()
int main(){
char c;
cin>>c;
set<char>boin;
boin.insert('a');
... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VLL = vector<LL>;
using VVLL = vector<VLL>;
using VS = vector<string>;
using PII = pair<int,int>;
using VP = vector<PII>;
#define REP(i,m,n) for(LL i=(m);i<(n);i++)
#define RR... | 1 | 65,815,243 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int N; cin >> N;
vector<int> A(N);
rep(i, N){
cin >> A[i];
}
ll ans = 0;
int r = 0;
int total = 0;
for (int l = 0; l < N; l++)... | #include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int N; cin >> N;
vector<int> A(N);
REP(i, 0, N) cin >> A[i];
int r = 0; ll ans = 0, sum = 0;
REP(l, 0, N) {
while (r < N && (sum + A[r]) == (sum ^ A[r])) {
... | 1 | 58,006,129 |
#include <iostream>
#include <cmath>
#include <climits>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
using namespace std;
#pragma warning(disable: 4996)
#define _sort(v,type,order) do { sort(v.begin(),v.end(),order<type>()); } while(0)
#define _sum(v... | #include <bits/stdc++.h>
#define rep(i,n) for(int64_t i=0;i < (int64_t)(n);i++)
#define invrep(i,n) for(int64_t i=n-1;i >= 0;i--)
using namespace std;
vector<vector<int>> fspattern;
vector<int> fspattern_draft;
int fspcnt = 0;
void setfspattern_core(int floor,int number,int degree){
if(floor==degree){
fspattern.a... | 1 | 24,857,230 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <utility>
#include <stack>
#include <vector>
#include <queue>
#include <algorithm>
#include <map>
#include <climits>
#include <set>
#include <cmath>
#include <numeric>
#include <iomanip>
using namespace std;
int cumsum[60 * 60 * 24];
int to_sec(st... | #include <cstdio>
#include <vector>
#include <algorithm>
#include <utility>
using namespace std;
typedef pair<int,int> pii;
int main(){
int n, h1, m1, s1, h2, m2, s2;
while(scanf("%d", &n), n){
vector<pii> v;
v.reserve(2 * n);
for(int i = 0; i < n; ++i){
scanf("%d:%d:%d%d:%d:%d", &h1, &m1, &s1, &h2, &m2, &s2... | 1 | 38,126,821 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#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()
#define endk '\n'
co... | #include<iostream>
using namespace std;
#include<vector>
#include<cmath>
#define int long long int
#define inf 2001
int memo[1001][1001];
int function(char mat[1001][1001],int i,int j,int n,int m,bool visited[1001][1001])
{
if(i<0||i>=n||j<0||j>=m)
return inf;
if(visited[i][j]==true)
return inf;
if(mat[i][j... | 1 | 64,748,680 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define rer(i, a, b) for (int i = (int)a; i <= (int)b; ++i)
#define each(i,c) for(__typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define all(v) v.begin(), v.end()
#define mset(... | #include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <c... | 1 | 81,711,689 |
#include <bits/stdc++.h>
using namespace std;
void solve(long long A, long long B, long long C, long long K){
cout << (((K%2) == 0) ? (A - B) : ((B+C) - (A+C))) << endl;
}
int main(){
long long A;
scanf("%lld",&A);
long long B;
scanf("%lld",&B);
long long C;
scanf("%lld",&C);
long long K;
scanf("%ll... | #include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i<(int)(n); i++)
#define all(v) v.begin(), v.end()
#define allR(v) v.rbegin(), v.rend()
#define PRINT(v) for (auto x : (v)) cout <<x <<" " ; cout <<endl;
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
typedef pair<int,int> Pi;
const... | 1 | 1,183,134 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=double;
using pi=pair<int,int>;
using pll=pair<ll,ll>;
using pld=pair<ld,ld>;
using ti3=tuple<int, int, int>;
using vi=vector<int>;
using vll=vector<ll>;
using vld=vector<ld>;
using vpi=vector<pi>;
using vpll=vector<ll>;
using vpld=vector<ld>;
u... | #include <bits/stdc++.h>
#if DEBUG
template <typename T>
void debug(T value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) \
do { \... | 1 | 73,390,216 |
#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <set>
#include <stack>
#include <map>
#include <iomanip>
#include <cmath>
#include <queue>
#include <bitset>
#include <numeric>
#include <array>
#include <cstring>
#include <random>
#include <chrono>
#define fi first
#define se secon... | #include <iostream>
#include <array>
#include <algorithm>
#include <vector>
#include <bitset>
#include <set>
#include <unordered_set>
#include <cmath>
#include <complex>
#include <deque>
#include <iterator>
#include <numeric>
#include <map>
#include <unordered_map>
#include <queue>
#include <stack>
#include <string>
#i... | 1 | 13,867,960 |
#include<bits/stdc++.h>
using namespace std;
signed main(){
int h,w;
string c,d;
cin>>h>>w;
for(int i=1;i<=h;i++){
for(int j=1;j<=w;j++){
cin>>c;
if(c=="snuke"){
d=64+j;
cout<<d<<i<<"\n";
}
}
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin() , v.end()
#define REP(i, x, n) for(int i = x; i < n; i++)
int main(){
int h,w; cin >> h >> w;
string s;
... | 1 | 61,253,609 |
#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++)
typedef long long ll;
int main() {
ll H, W; cin >> H >> W;
if (H%3 == 0 || W%3 == 0) {
cout << 0 << endl;
return 0;
}
ll a, b, c;
... | #include <iostream>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <string.h>
#include <cstdio>
#include <tuple>
#include <numeric>
using namespace std; using ll = long long; using ld = long double; ... | 1 | 51,832,041 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (int i = j; i < (int)(n); i++)
#de... | #include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(0);cin.tie(NULL)
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define tra... | 1 | 12,844,799 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) begin(v),end(v)
using ll = long long;
int main() {
int n,k;string s;cin>>n>>s>>k;
char c=s[k-1];
rep(i,n){
if(s[i]!=c)s[i]='*';
}
cout<<s<<endl;
} | #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... | 1 | 78,721,114 |
#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;
int main(int argc, char const *argv[])
{
int n;
cin>>n;
ll ans = 1, in,flag = 0;
const ll t = 1e18;
rep(i,0,n-1){
cin>>in;
if(in == 0... | #include<iostream>
#include<vector>
#include<map>
#include<set>
#include<cassert>
#include<cassert>
#include<unordered_map>
#include<unordered_set>
#include<functional>
#include<queue>
#include<stack>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<sstream>
#include<iomanip>
#include<cstdio>
#include<cst... | 1 | 30,146,015 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <functional>
#include <bitset>
#include <numeric>
#include <complex>
#include <iomanip>
#include <cassert>
#include <random>
int main() {
int... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
map<int, int> op, ep;
for (int i = 0; i < n / 2; i++) {
int v, w;
cin >> v >> w;
op[v]++;
ep[w]++;
}
int op1 = 0;
int mxop1 = 0, mxop2 = 0;
int ep1 = 0;
int mxep1 = 0, mxep2 = 0;
for (au... | 1 | 54,989,481 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
using namespace std;
typedef long long ll;
int main(){
ll N;
cin >> N;
vector<pair<ll,ll> >a;
for(ll i=1;i*i<=N;i++){
if(N%i==0){
a.push_back(make_pair(i,N/i));
}
}
ll sum=2*pow(10,12);
for(ll j=0... | #include <bits/stdc++.h>
#include <limits>
#include <math.h>
#include <cmath>
#include <cctype>
#include <cstdio>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pll = pair<ll, ll> ;
using vs = vector<string>;
using vb = vector<bool>;
using vll = vector<long long>;
using vvll = vector<v... | 1 | 81,464,539 |
#include<iostream>
#include<stdio.h>
using namespace std;
int main()
{
int m, f, r;
while (1) {
cin >> m >> f >> r;
if (m == -1 && f == -1 && r == -1) break;
else if (m == -1 || f == -1) printf("F\n");
else if (m + f >= 80) printf("A\n");
else if (m + f >= 65) printf("B\n");
else if (m + f >= 50) printf("... | #include<iostream>
using namespace std;
int main(){
int m,f,r;
while(cin>>m>>f>>r,m+f+r != -3){
int sum = m + f;
if(m == -1 || f == -1){
cout<<"F"<<endl;
}else if(sum >= 80){
cout<<"A"<<endl;
}else if(sum >= 65){
cout<<"B"<<endl;
}else if(sum >= 50){
cout<<"C"<<endl;
... | 1 | 91,056,932 |
#include<iostream>
#include<string>
using namespace std;
int main() {
string s,p;
cin >> s >> p;
s += s;
cout << (s.find(p) != string::npos ? "Yes":"No") << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string str, patt, subs;
cin >> str >> patt;
bool flag = false;
for (long unsigned int i = 0; i < str.length(); i++) {
if (str.length() - i < patt.length()) {
subs = str.substr(i) + str.substr(0, patt.length() - str.length() +... | 1 | 57,399,780 |
#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>;
ll gcd(ll a, ll b) { return b?gcd(b,a%b):a;}
int main() {
int n;
cin >> n;
int ans;
rep(i,n) {
int x;
cin >> x;
if(i==0) ans = x;
ans = gcd(ans,x);
}
co... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;
int main()
{
int N;
cin >> N;
vector<int> A(N);
rep(i, N)
{
cin >> A[i];
}
std::sort(A.be... | 1 | 98,011,962 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPS(I, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
using ll = long long;
int main() {
int n,r;
cin >> n >> r;
if(n < 10){
r += 100 * (10-n);
}
cout << r << endl;
} | #include <iostream>
using namespace std;
int main(void){
int a,b;
cin >> a >> b;
if(a <= 10){
int ans = b+100*(10-a);
cout << ans << endl;
}
else{
cout << b <<endl;
}
} | 1 | 26,697,563 |
#include <bits/stdc++.h>
#include <algorithm>
#include <unordered_set>
#define _USE_MATH_DEFINES
#include <cmath>
#define ll long long
using namespace std;
const double pi = 3.14159265358979323846;
vector<int> g[100005];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int N, M;
cin >> N >> M;
int a... | #include <bits/stdc++.h>
#define ll u_int64_t
#define rep(i, n) for (int i=0; i<n; i++)
using namespace std;
const double PI = acos(-1);
using Graph = vector<vector<int>>;
int main() {
int n, m;
cin >> n >> m;
Graph G(n);
rep(i, m) {
int a, b;
cin >> a >> b;
G[a-1].push_back(b);
G[b-1].push_back(a);
}
vec... | 1 | 72,434,175 |
#include <iostream>
int main(void){
int N, K, ans = 0;
std::cin >> N >> K;
ans = K;
for (int i = 1; i < N; ++i){
ans *= (K - 1);
}
std::cout << ans << std::endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for(ll (i)=(m);(i)<(n);++(i))
#define REP(i, n) FOR(i,n,0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll) 1e15;
int main() {
cin.tie(0);
ios::sync_with_stdio(... | 1 | 70,508,179 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
#define ALL(x) (x).begin(),(x).end()
const ll zero = 0;
const ll INF = 9223372036854775807;
const int inINF = 2147483647;
const ll MOD = 1000000007;
const ll MOD2 ... | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vb = vector<bool>;
using vc = vector<char>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvc = vector<vector<char>>;
using pii = pair<int, int>;
#define fix10 cout << fixed << setprecision(10);
#define rep(i,n) for(int i=0;... | 1 | 13,429,757 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using LLONG = long long;
const LLONG MOD = 1000000007;
bool ContainsSameChar(const string &S)
{
for... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll inf = 1e18;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define per(i, a, b) for (int i = b - 1; i >= a; i--)
#define int ll
using pint = pair<int, int>;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
signed main() {
string s;
... | 1 | 46,914,073 |
#include <algorithm>
#include <iostream>
#include <vector>
#include <queue>
#include <set>
#include <string>
#include <map>
#include <cmath>
#include <cstring>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
const ... | /* {:i:i:|i:i:/l/l-- --l/li:i:i|i:i:i:i}
{:rx|:i:i ィi芥ミ .ィi芥ミｉ:ｉ|ﾍ:i:i:}
. ｛ﾏ|ｉ: {::’:} {:‘::} :ｉ:i:|〉｝:/
乂|:i:| ｀¨¨¨¨´ ｀¨¨¨´ :i:ｉ:|ｼ/
ﾉ:|:i| ′ |:i:i:|ﾂ
/:/|:i:| ､ _ _ |:i:i:|
/:/ .|:i:|/ ＼ ｨ〔|:i:/
... | 1 | 43,201,403 |
#include <iostream>
#include <cctype>
#include <string>
#include <cstdio>
using namespace std;
int main(){
int i , n ;
string str ;
getline(cin,str) ;
for( i=0 ; i<str.size() ; i++ ){
if( !islower(str[i]) )
printf( "%c", tolower(str[i]) ) ;
else if( !isupper( str[i] ) )
printf( "%c" , toupper( str[i] ) ) ... | #include <stdio.h>
#include <ctype.h>
int main(void) {
char ch;
char temp, i;
i = 0;
while (1) {
scanf("%c", &ch);
if (islower(ch)) {
printf("%c", toupper(ch));
} else if (isupper(ch)) {
printf("%c", tolower(ch));
} else if (ch == '\n') {
break;
} else {
printf("%c", ... | 1 | 42,223,478 |
#include<bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define fo(i,n) for(i=0;i<n;i++)
#define Fo(i,k,n) for(i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define ll long long
#define si(x) scanf("%d",&x)
#define sl(x) scanf("%lld",&x)
#define ss(s) scanf("%s",s)
#define pi(x) printf("%d\n",x)
#define pl(x) printf(... | #include<bits/stdc++.h>
using namespace std;
int main(){
int x;cin>>x;
int id;
for(int i=1;;++i){
if(i*360%x==0){
id=i;
break;
}
}
cout<<id*360/x;
return 0;
} | 1 | 4,198,486 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <string>
#include <map>
#define ll long long
#define REP(i,n) for(int i = 0; i < n; i++)
#define PI 3.141592653589
#define MOD 1000000007
using namespace std;
template<typename T> T gcd(T a, T b){return (a % b)? gcd(b, a % b) : b;}
tem... | #include <bits/stdc++.h>
using namespace std;
int main() {
int board = 1;
int N, K;
cin >> N >> K;
int i;
for(i = 0; i < N; i++){
if(board > K)
break;
board *= 2;
}
for(;i < N; i++)
board += K;
cout << board << endl;
} | 1 | 41,104,803 |
#include <iostream>
#include <vector>
using namespace std;
int main(void){
int n,m,x;
cin >> n >> m >> x;
vector<vector<int>> a(n,vector<int>(m));
vector<int> c(n);
for(int i = 0;i < n;i++){
cin >> c[i];
for(int j = 0;j < m;j++){
cin >> a[i][j];
}
}
... | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
using Grid= vector<vector<char>>;
using vin= vector<int>;
using ll=long long;
using vll= vector<ll>;
using vbl=vector<bool>;
using vch=vector<char>;
using pinin=pair<int ,int>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define r... | 1 | 47,333,109 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define PI 3.1415926535897932
#define MOD 1000000007;
using namespace std;
long long GCD(long long A,long long B){
if(B==0){
return A;
}
else{
return GCD(B,A%B);
}
}
long long LCM(long long A,long long B){
long long g=GCD(A,B);
return A/g*B;
}
long lon... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define m_p make_pair
#define p_b push_back
#define e_b emplace_back
#define all(x) (x).begin(),(x).end()
#define uniq(x) ((x).erase(unique(all(x)),(x).end()))
#define sz(x) ((int)(x).size())
#... | 1 | 45,335,195 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n)for(int i=0;i<(n);i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
using ll = long long;
using P = pair<int, int>;
int main(){
int a, b, c; cin >> a >> b >> c;
set<int> se;
se.insert(a);
... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
#define all(x) (x).begin(),(x).end()
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
template<class T>bool chmin(T &a, const T &b) ... | 1 | 90,404,623 |
#include <stdio.h>
#include <iostream>
#include <string>
using namespace std;
int main(){
string s;
getline(cin, s);
string p;
getline(cin, p);
bool ansflag = false;
for(int i = 0; i < s.length(); i++){
bool flag = true;
for(int j = 0; j < p.length(); j++){
if(s[(i+j)%s.length()] != p[j]){
flag = false... | #include <string>
#include <iostream>
using namespace std;
int main() {
string str_1;
string str_2;
cin >> str_1 >> str_2;
bool yes = false;
int len_1 = str_1.size();
int len_2 = str_2.size();
for (int i = 0;i != len_1;++i) {
if (str_1[i] == str_2[0]) {
int k = i;
for (int j = 0;j < len_2;++j) {
if ... | 1 | 90,867,163 |
#include <bits/stdc++.h>
#include <cstdlib>
#include <cmath>
#define rep(i,n) for(int i=0;i<(n);++i)
using namespace std;
using ll = long long;
int main() {
long double L,ans;
cin >> L;
ans = pow(L/3,3);
cout << fixed;
cout << setprecision(12) <<ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define dup(x,y) (((x)+(y)-1)/(y))
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const double EPS = 1e-10;
const int INF = 1e9;
const ll LINF = 1e15;
const int MOD = 1000000007;
const do... | 1 | 40,830,869 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int n,m; cin>>n>>m;
vector<ll> a(n);
for(auto &i:a) {
cin>>i;
i/=2;
}
ll l = a.at(0);
for(int i=1; i<n; i++){
if(l%a.at(i)==0&&(l/a.at(i))%2==0){
cout << 0 << endl;
return 0;
}
if(a.at(i)%l==0&&(a.at(i)/l)%2==0){
cou... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pr;
typedef vector<pr> vp;
typedef vector<vp> vpp;
typedef vector<vector<ll> > graph;
#define pb push_back
#define mp make_pair
#define endl '\n'
void set_val(vector<ll>& v, ll val){for(ll i=0;i<v.size();i++) v[i]=val;}
ll mod = pow(... | 1 | 9,860,346 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <bitset>
#include <math.h>
#include <iomanip>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
void search_depth(vector<ll>& ans, vector<int>& flag, vector< vector<int> >& vt, int next_p, ll tmp, map<int... | #include<bits/stdc++.h>
using namespace std;
using lli = long long int;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
const int MOD = 1000000007;
const int MOD1 = 998244353;
const int maxn = 100010;
const int lim = (int)1e9;
vector<int> v[2 * maxn];
vector<lli> counter;
void dfs(int no... | 1 | 29,379,211 |
#include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define MAXX 100005
#define PI 3.14159265358979323846264338327950
#define ll signed long long int
using namespace std;
ll t , n, k, y = 2, m, ans = 0,h,s ;
double a[MAXX], b[MAXX], c[MAXX];
double f = 0, x;
vector<ll> adj[MAX... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define FOR(i, a, b) for(int i = (int)a; i <= (int)b; i++)
#define DEC(i, a, b) for(int i = (int)a; i >= (int)b; i--)
typedef pair<int, int> pi;
typedef pair<pi, int> pii;
typedef pair<pi, pi> pipi;
#define f first
#define s sec... | 1 | 4,253,333 |
#ifndef DEBUG
#pragma GCC optimize("O3")
#endif
#include <bits/stdc++.h>
#define ull unsigned long long
#define ll long long
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
#define fastio ios_base::sync_with_stdio(0)
#define untie cin.tie(0)
#define ms(a, b) memset(a, b, sizeof a)
#define m... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vll;
#define fi first
#define print(v) for(ll i:v) cout<<i<<ss
#define se second
#define pb push_back
#define nn "\n"
#define all(p) p.b... | 1 | 6,708,167 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long int n,a,i,k,x;
cin >> n;
k=0;x=n;
for(i=0;i<n;i++)
{
cin >> a;
if(a<=x)
{
k++;
x=a;
}
}
cout << k << endl;
} | #include <bits/stdc++.h>
#define append push_back
using namespace std;
using ll = long long;
const int N = 1e5 + 3;
const int M = 1e6 + 7;
const long long MOD = 1e9 + 7;
const long long INF = 1e14 + 9;
const int SM = 1e3 + 5;
const int logN = 22, BL = 400;
const double EPS = 1e-9, PI = acos(-1);
const int dx[] = {1, 0,... | 1 | 60,003,441 |
#include <bits/stdc++.h>
using namespace std;
int m, k;
int main(){
cin >> m >> k;
if(m == 1 && k == 1){
cout << -1;
return 0;
}
if((1 << m) - 1 < k){
cout << -1;
return 0;
}
if(k == 0){
for(int i = 0; i <= (1 << m) - 1; i++){
cout << i << " " ... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int m,k;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cin>>m>>k;
int maxi=(1<<m)-1;
if(k>maxi)
{
cout<<-1;
return 0;
}
if(m==1)
{
if(k==1)
cout<<-1;
else
cout<<"0 0 1 ... | 1 | 10,190,332 |
#include <iostream>
#include <vector>
#include <cstring>
#include <cstdio>
#include <algorithm>
using namespace std;
const int maxn = 100005;
vector<int> v[maxn];
int dfs(int root, int fa) {
int ret = 0;
for (int i = 0;i < v[root].size();i++) {
int to = v[root][i];
if (to == fa) continue;
... | #include<iostream>
#include<vector>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<ctime>
#include<queue>
#include<set>
#include<map>
#include<stack>
#include<bitset>
using namespace std;
typedef long long LL;
const int N=2e5;
int gi() {
int w=0;bool q=1;char c=getcha... | 1 | 54,370,738 |
#include <bits/stdc++.h>
#define rep(i,x,n) for(int i=x; i<(int)(n); i++)
#define rep_eq(i,x,n) for(int i=x; i<=(int)(n); i++)
using namespace std;
using ll=long long;
int main() {
int A,B,K; cin >>A >>B >>K;
rep_eq(i,1,K) {
if (i%2==1) {
A/=2;
B+=A;
} else {
B/=2;
A+=B;
}
}
... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { return (a * b) / gcd(a,b); }
using P = pair <int, int>;
template<class T>bool chmax(T &... | 1 | 59,440,122 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using ll = long long;
using namespace std;
using P = pair<int,int>;
int cnt(ll n){
int d = 0;
while(n > 0){
n /= 10;
d++;
}
return d;
}
int main(){
ll n;
cin >> n;
int ans = cnt(n);
for(ll a = 1LL; a*a <= n; a++){
if(n%a... | #include <bits/stdc++.h>
using namespace std;
int main(){
long long N;
cin >> N;
set<int> a;
for(long long i = 1; i * i <= N; i++){
if(N % i == 0){
long long digit, digit2;
digit = (int)log10(i);
digit2 = (int)log10(N / i);
a.insert(max(digit, digit2) + 1);
}
}
cout << *begin(a) << endl;... | 1 | 40,597,314 |
#include<iostream>
#include<vector>
using namespace std;
int main() {
int n; cin >> n;
vector<int>a(n); for (auto&& x : a)cin >> x;
int mini = 10000000000, maxi = 0;
for (auto x : a) {
if (x < mini)mini = x;
if (x > maxi)maxi = x;
}
cout << maxi - mini << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define f first
#define s second
#define db(x) cerr << #x << ": " << (x) << '\n';
#define pb push_back
#define lb lower_bound
#define up upper_bound
#define all(x) x.begin() , x.end()
#define rall(x) x.rbegin() , x.rend()
#define enl '\n'
#define vi vec... | 1 | 63,746,867 |
#include <bits/stdc++.h>
using namespace std;
const long long INF=(long long)1e18;
int main(){
long long n,res,ans;
cin>>n;
ans=INF;
for(long long i=1;i*i<=n;i++){
if(n%i==0){
res=i+n/i;
ans=min(ans,res);
}
}
cout<<ans-2<<endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(int)(n); i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll n; cin >> n;
ll nn = n, ans = n-1;
for (ll i = 2;i*i<=n;i++) {
if (n%i==0) ans = min((i-1)+(n/i-1), a... | 1 | 96,201,642 |
#include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rrep(i, n) for(int i = (n-1); i >= 0; i--)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
const ll INF = 1LL<<62;
const int IINF = 1000000000;
template<class T> inline bool chmax(T& a, T b) { if (a ... | #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 | 8,799,677 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using tpl = tuple<char, int>;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
void fastStream(){cin.tie(0);std::ios_base::sync_with_stdio(0);}
ll N, A, B;
int main(){
cin >> N >> A >> B;
if(A + B - 1 > N){
cout << -1 << endl;
... | #include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<stack>
#include<cmath>
#include<string>
#include<functional>
using namespace std;
typedef long long int ll;
int main(){
ll n, a, b;
cin >> n >> a >> b;
if(a+b-1 > n || n > a*b){
cout << -1 << endl;
return 0;
... | 1 | 60,503,109 |
#include <bits/stdc++.h>
using namespace std;
string str;
int main()
{
cin >> str;
for (int i = 0;i <= 3;i++)
{
cout << str[i];
}
cout << " ";
for (int i = 4;i <= 11;i++)
{
cout << str[i];
}
cout << endl;
return 0;
} | #include<bits/stdc++.h>
#define f() for(int i=0;i<n;i++)
using namespace std;
string c;
char t;
int main()
{
cin>>c;
c[12]=c[11];
c[11]=c[10];
c[10]=c[9];
c[9]=c[8];
c[8]=c[7];
c[7]=c[6];
c[6]=c[5];
c[5]=c[4];
c[4]=' ';
for(int i=0; i<13; i++)cout<<c[i];
cout<<endl;
return 0;
} | 1 | 37,284,710 |
#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... | #include<bits/stdc++.h>
using namespace std;
long long LCM(long long a,long long b);
signed main(){
int n;
cin>>n;
long long t[n+2];
for(int i=0;i<n;i++){
cin>>t[i];
}
long long sum=t[0];
for(int i=0;i<n;i++){
sum=LCM(sum,t[i]);
}
cout<<sum<<"\n";
return(0);
... | 1 | 15,456,599 |
#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 <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
int n;
c... | 1 | 42,997,550 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i< (n); i++)
using ll = long long;
using namespace std;
int main(){
int N;
cin >> N;
ll H[N];
rep(i,N) cin >> H[i];
int ans = 0;
int tmp = 0;
for (int i = N-2; i >=0; i--) {
if (H[i]>=H[i+1]) {
tmp++;
ans = max(ans,tmp);
}
else tmp = 0;
}
co... | #include <stdio.h>
int H[100000];
int main(void) {
int N;
scanf("%d", &N);
for (int i = 0; i < N;++i) {
scanf("%d", H + i);
}
int ans = 0;
int cnt = 0;
for (int i = 0; i < N - 1; ++i) {
if (H[i] >= H[i + 1]) {
cnt++;
if (ans < cnt)
ans = cnt;
} else {
cnt = 0;
}
... | 1 | 14,888,301 |
#include<bits/stdc++.h>
using namespace std;
#define nl cout<<'\n';
int main()
{
long long x,a;
cin>>x>>a;
x=x%500;
if(x<=a)
cout<<"Yes";
else
cout<<"No";
nl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A;
cin >> N >> A ;
int c = N % 500;
if (A >= c) cout << "Yes" << endl;
else cout << "No" << endl;
} | 1 | 54,584,585 |
#include <iostream>
#include <string>
#include <cmath>
#include <sstream>
using namespace std;
const int num = 653;
int main() {
string s, c;
cin >> s;
int l = s.size(), ans = 0, minAns = num, p;
for(int i = 0; i < l - 2; ++i)
{
c = s.substr(i, 3);
stringstream str(c);
str >> ans;
p = abs(ans ... | #include <iostream>
using namespace std;
int main() {
long long s;
cin >> s;
int minDiff = 999;
for (long long i=1; s/i>=100; i*=10) {
int threeNumbers = s/i - (s/(i*1000))*1000;
minDiff = min(minDiff, abs(753-threeNumbers));
}
cout << minDiff << endl;
} | 1 | 16,445,536 |
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <vector>
#include <iostream>
#include <set>
using namespace std;
typedef long long ll;
int main(int argc, char const *argv[]) {
for (int i = 1; i < 10; i++) {
for (int j = 1; j < 10; j++) {
cout << i << "x" << j << "=" << i*j << e... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int> > vii;
#define rrep(i, m, n) for(int (i)=(m); (i)<(n); (i)++)
#define erep(i, m, n) for(int (i)=(m); (i)<=(n); (i)++)
#define rep(i, n) for(int (i)=0; (i)<(n); (... | 1 | 72,592,831 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0;i < (n);i++)
using namespace std;
int main(){
int h,n;
cin >> h >> n;
for(int i = 0;i < n;i++){
int a;
cin >> a;
h -= a;
}
if(h <= 0){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
ret... | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, N, x, y=0;
string ans = "No";
cin >> H >> N;
for (int i = 0; i < N; i++) {
cin >> x;
y += x;
}
if (H <= y) ans = "Yes";
cout << ans << endl;;
} | 1 | 9,079,493 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,k;
string s;
cin >> n >> s >> k;
char c = s[k-1];
for (int i = 0;i < s.length(); i++)
{
if (s[i] != c)
s[i] = '*';
}
cout << s << endl;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
using ll = long long;
using v = vector<ll>;
using P = pair<ll,ll>;
int main(){
int n,k;
string s;
cin >>n>>s>>k;
k--;
rep(i,n){
if(s[i]==s[k])cout << s[i];
else cout << "*";
}
cout << endl;
... | 1 | 6,342,360 |
#include <iostream>
#include <vector>
#include <chrono>
#include <random>
#include <cassert>
std::mt19937 rng((int) std::chrono::steady_clock::now().time_since_epoch().count());
long long go(std::vector<long long> a) {
int n = (int) a.size();
long long ans = 0;
while(1) {
long long got = 0;
for(auto &x : a) {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, m, n) for(int(i) = (int)(m); i < (int)(n); ++i)
#define rep2(i, m, n) for(int(i) = (int)(n)-1; i >= (int)(m); --i)
#define REP(i, n) rep(i, 0, n)
#define REP2(i, n) rep2(i, 0, n)
#define all(hoge) (hoge).begin(), (hoge).end()
#define en '\n'
using ll = long l... | 1 | 15,028,472 |
#define _USE_MATH_DEFINES
#include<iostream>
#include<string>
#include<cmath>
#include<queue>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<random>
#include<functional>
#include<algorithm>
#include<cstdio>
#include<bitset>
#include<unordered_map>
using namespace std;
typedef lon... | #include <bits/stdc++.h>
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
#define sz(v) (int)(v).size()
#define pb push_back
#define sc second
#define fr first
#define sor(v) sort(v.begin(),v.end())
#define rev(s) reverse(s.begin(),s.end())
#define... | 1 | 74,883,570 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define dfs_black 1
#define dfs_white -1
#define pr pair
#define vt vector
#define fastio ios_base::sync_... | #include <assert.h>
#include <limits.h>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include... | 1 | 84,788,814 |
#include <iostream>
#include <array>
#include <algorithm>
#include <vector>
#include <bitset>
#include <set>
#include <unordered_set>
#include <cmath>
#include <complex>
#include <deque>
#include <iterator>
#include <numeric>
#include <map>
#include <unordered_map>
#include <queue>
#include <stack>
#include <string>
#i... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 1e5 + 5, mod = 1e9 + 7;
int dp[N];
int fp(int a, int p) {
if (!p) return 1;
int t = fp(a, p >> 1);
t = (t * 1LL * t) % mod;
if (p & 1) t = (t * 1LL * a) % mod;
return t;
}
int main() {
ios_base::sync_with_stdio(0);
... | 1 | 95,891,042 |
#include <iostream>
#include <vector>
#include <queue>
#define int long long
using namespace std;
struct Edge { int from, to; Edge(int from, int to) { this->from = from; this->to = to; } Edge() { } };
typedef vector<Edge> Edges;
typedef vector<Edges> Graph;
int n, m;
Graph g;
vector<Graph> gs;
void labeling() {
static... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
vector <int> G[N];
int used[N], rec[N];
int cnt1, cnt2, cnt3;
queue <int> q;
void bfs(int x){
int cnt = 0, flag = 1;
while (!q.empty()) q.pop();
q.push(x);
rec[x] = 1;
while (!q.empty()){
int u = q.front(); q.pop();
cnt++;
for (int i = 0; ... | 1 | 48,678,298 |
#include <bits/stdc++.h>
#define append push_back
using namespace std;
using ll = long long;
const int N = 1e5 + 3;
const int M = 1e6 + 7;
const long long MOD = 1e9 + 7;
const long long INF = 1e18 + 9;
const int SM = 1e3 + 5;
const int logN = 22, BL = 400;
const double EPS = 1e-9, PI = acos(-1);
const int dx[] = {1, 0,... | #define rep(i, n) for (int i = 0; i < (n); i++)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
int main() {
ll a;
double b;
cin >> a >> b;
ll tmp = b * 100 + 0.5;
ll ans = (a * tmp) / 100;
cout << ans << endl;
return ... | 1 | 1,172,245 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1001001001LL;
constexpr long long LINF = 1e18 + 10;
#define a... | #include <iostream>
using namespace std;
int func(int x){
if (x<10) return x;
return func(x/10)+x%10;
}
int main() {
int N, A, B, sum=0;
cin >> N >> A >> B;
for (int i=0; i<=N; i++){
if (A<=func(i) && func(i)<=B) sum+=i;
}
cout << sum << endl;
} | 1 | 75,783,032 |
#include <bits/stdc++.h>
#define all(X) (X).begin(),(X).end()
#define rall(X) (X).rbegin(),(X).rend()
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define ff first
#define ss second
#define P 1000000007
#define in(x, a, b) (a <= x && x < b)
using namespace std;
using ll = long... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
void solve(long long N, std::vector<long long> P){
ll cnt = 1;
vector<ll> M(N, P[0]);
for(ll i = 1; i < N; ++i){
M[i] = min(P[i], M[i-1]);
if(P[i] == M[i]) cnt++;
}
cout << cnt << endl;
retur... | 1 | 11,986,910 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int a, b;
cin >> a >> b;
if (a * b * (a + b) % 3 == 0) cout << "Possible" << endl;
else cout << "Impossible" << endl;
return 0;
} | #include <bits/stdc++.h>
#include <math.h>
#define REP(i, n) for(int i = 0; i < (n); i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1001001001;
const int mINF = -1001001001;
int main() {
int a,b;
cin >> a >> b;
if(a%3==0||b%3==0||(a+b)%3==... | 1 | 83,877,312 |
#include <iostream>
#include <iomanip>
#include <cmath>
#include <string>
#include <vector>
#include <cstdlib>
#include <map>
#include <queue>
#include <deque>
#include <algorithm>
#include <stack>
#include <functional>
#include <sstream>
#define rep(i,j,n) for(i=j;i<(n);i++)
#define rrep(i,j,n) for(i=(n)-1;i>j-1;i--)
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define FORR(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))
#define VE... | 1 | 63,986,895 |
#include <bits/stdc++.h>
using namespace std;
long long n, dp[305][305], h[305], ans;
const long long INF = 1e18;
int k;
long long parabs(long long a, long long b) {
if (a > b) return (a - b);
else return 0;
}
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin >> n >> k;
for (int i=1; i<305; i... | #include <bits/stdc++.h>
using namespace std;
#define modulo 1000000007
#define mod(mod_x) ((((long long)mod_x+modulo))%modulo)
#define Inf 1000000000000000000
int main(){
int N,K;
cin>>N>>K;
vector<long long> H(N+1,0);
for(int i=1;i<=N;i++)cin>>H[i];
vector<vector<vector<long long>>> dp(N+1,vector<vector<long lon... | 1 | 10,554,590 |
#include <iostream>
#include <queue>
#include <vector>
#include <iostream>
#include <vector>
#include <string>
#include <cassert>
#include <algorithm>
#include <functional>
#include <cmath>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <map>
#include <iomanip>
#include <utility>
#include <s... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define fi first
#define se second
typedef pair<ll,ll> P;
#define Mod 1000000007
using VP = vector<P>; using VVP = vector<VP>;
using VI = vector<ll>; using VVI = vector<VI>; using VVVI = vector<VVI>;
template<class Abel> struct Unio... | 1 | 89,879,555 |
#include<bits/stdc++.h>
#define test ll t; cin>>t; while(t--)
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define mod 1000000007
#define ll long long
#define int long long
#define ull unsigned long long
#define MAX 1000005
#define pb push_back
#define mkp make_pair
#define vi vector<int>
#define... | #include <bits/stdc++.h>
#define EPS (1e-10)
#define rep(i, a, b) for (int i = a; i < (int)(b); ++i)
#define rrep(i, a, b) for (int i = b - 1; i >= (int)(a); --i)
#define all(a) a.begin(), a.end()
using namespace std;
using ll = long long;
using vi = vector<int>;
using vb = vector<bool>;
using vll = vector<ll>;
using v... | 1 | 8,835,574 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
vector<ll> a,b,c;
int main(void){
ll x,y,z,k;
cin>>x>>y>>z>>k;
a = vi(x);
b = vi(y);
c = vi(z);
for(int i = 0; i <x; i++){
cin>>a[i];
}
for(int i = 0; i < y; i++){
cin>>b[i];
}
for(int i = 0; i < z; i++){
cin>>c[i]... | #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 x, y, z, K;
cin >> x >> y >> z >> K;
vector<Int> a(x), b(y), c(z);
for (i... | 1 | 99,997,615 |
#include <bits/stdc++.h>
using namespace std;
string s;
int x;
int main(){
cin>>s;
for(int i=0;i<s.size();i++)if(s[i]=='x')x++;
cout<<(x<8?"YES\n":"NO\n");
} | #include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <numeric>
#include <functional>
#include <map>
#include <queue>
#define REP(i,n) for(int (i)=0; (i)<(n); (i)++)
using namespace std;
using ll = long long;
ll MOD = 1e9+7;
int main(int argc, const char * argv[]) {
... | 1 | 48,485,011 |
#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
int main (void){
int sumA = 0;
int sumB = 0;
int fake = 0;
for(int i=0;i<4;i++){
scanf("%d",&fake);
sumA += fake;
}
for(int i=0;i<4;i++){
scanf("%d",&fake);
sumB += fake;
}
printf("%d\n",max(sumA,sumB));
return 0;
} | #include<stdio.h>
int main(){
int a[4]={0};
int b[4]={0};
int suma=0,sumb=0;
scanf("%d %d %d %d",&a[0],&a[1],&a[2],&a[3]);
scanf("%d %d %d %d",&b[0],&b[1],&b[2],&b[3]);
for(int i=0;i<4;i++){
suma+=a[i];
sumb+=b[i];
}
if(suma<=sumb){
printf("%d\n",sumb);
}
else {
printf("%d\n",suma);
... | 1 | 24,311,131 |
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
long long k,s,ans;
int main(){
ios::sync_with_stdio(0);
cin>>k>>s;
for(int i=0; i<=k; i++){
for (int j=0; j<=k; j++){
if (s-i-j >=0 && s-i-j<=k) ++ans;
}
}
cout<<ans<<endl;
return ... | #include <iostream>
using namespace std;
int main(){
int K,S;
cin >> K >> S;
int ans = 0;
for(int X=0; X<=K; X++){
for(int Y=0; Y<=K; Y++){
int m = S-X-Y;
if(0<=m && m<=K){
ans++;
}
}
}
cout << ans;
return 0;
} | 1 | 2,129,333 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ifstream fi("input.in");
const ll MOD = 1000000007;
ll n, m;
ll sx, sy;
ll x[100005], y[100005];
signed main()
{
cin >> n >> m;
for (ll i = 1; i <= n; i++)
cin >> x[i];
for (ll i = 1; i <= m; i++)
cin >> y[i];
for (ll i =... | #include<cstdio>
#include<algorithm>
#define MN 200001
using namespace std;
const int MOD=1e9+7;
int n,m,a[MN],b[MN],A=0,B=0;
int main(){
scanf("%d%d",&n,&m);
for (int i=1;i<=n;i++) scanf("%d",&a[i]);sort(a+1,a+1+n);
for (int i=1;i<=m;i++) scanf("%d",&b[i]);sort(b+1,b+1+m);
for (int i=1;i<n;i++) A=(1LL*... | 1 | 81,643,203 |
#include <bits/stdc++.h>
using namespace std;
typedef int64_t ll;
int main() {
int n;
cin >> n;
ll a[n];
for(int i=0;i<n;i++) cin >> a[i];
int right=0;
ll ans=0,sum=0;
for(int left=0;left<n;left++){
while(right<n && sum+a[right]==(sum ^ a[right])){
sum+=a[right];
right++;
}
ans += ... | #include <iostream>
#include <algorithm>
#include <iomanip>
#include <string>
#include <vector>
#include <math.h>
#include <queue>
#include <deque>
#include <stack>
#include <map>
const int MOD = 1e9+7;
#define PI 3.14159265359
typedef long long ll;
using namespace std;
int coun1[21];
int digit(int x){
int coun = 0;
... | 1 | 83,173,595 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>
using namespace std;
#define FOR(i,a,b) for(lo... | #include <cstdio>
int a[200000];
int main() {
int n, k;
while (scanf("%d %d",&n,&k)&&n!=0) {
for (int i=0; i<n; i++) scanf("%d",&a[i]);
int max=0;
for (int i=0; i<k; i++) max+=a[i];
int tmp=max;
for (int i=0; i<n-k; i++) {
tmp=tmp-a[i]+a[i+k];
if (... | 1 | 55,344,792 |
#include <bits/stdc++.h>
#include <iomanip>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265359
ll gcd(ll a, ll b){
if (a%b == 0){
return(b);
}
else{
return(gcd(b, a%b));
}
}
ll lcm(ll a, ll b){
return a / gcd(a, b)* b;
... | #include <cstdio>
#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
using namespace std;
#define PB push_back
#define MP make_pairA
#define REP(i,n) for(int i=0;i<(n);i++)
int main()
{
string s;
cin>>s;
REP(i,4)cout<<s[i];
cout<<" ";
REP(i,8)cout<<s[i+4];
c... | 1 | 63,953,346 |
#include <iostream>
#include <cstdint>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unorder... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
#define INF 200000000000
template<class T>bool chmax(T &a, const T &b) { if (a<b) ... | 1 | 73,410,277 |
#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <functional>
#include <string>
#include <algorithm>
#include <climits>
#include <utility>
#define PRINT(STR) cout << STR << endl;
#defin... | #include<cstdio>
int main(void) {
int map[100],in,i;
for(i=0;i<100;i++) { map[i]=0; }
while(scanf("%d",&in)!=EOF) { map[in-1]++; }
in=0;
for(i=0;i<100;i++) { if(in<map[i]) { in=map[i]; } }
for(i=0;i<100;i++) { if(in==map[i]) { printf("%d\n",i+1); } }
return 0;
} | 1 | 31,071,862 |
# define _CRT_SECURE_NO_WARNINGS 1
# define _USE_MATH_DEFINES
# include <iostream>
# include <numeric>
# include <string>
# include <bitset>
# include <vector>
# include <algorithm>
# include <cstdlib>
# include <cstdio>
# include <cstring>
# include <cstdlib>
# include <iomanip>
# include <queue>
# include <sstream>
#... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(long long i=0;i<n;i++)
#define P pair<ll,ll>
#define F first
#define S second
#define all(a) (a.begin(),a.end())
long long INF=1000000000000000000;
long long mod=1000000007;
int dp[1010][1010];
int main(void){
int q;cin>>q;stri... | 1 | 73,680,830 |
#include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <unordered_map>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
#include <assert.h>
#include <unordered_map>
#include <fstream>
using namespac... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long INF = 1LL<<60;
long long V, E;
cin >> V >> E;
long long g[101][101];
for (int i = 0; i < V; i++) {
for (int j = 0; j < V; j++) {
if (i != j) {
g[i][j] = INF;
} else {
g[i][j] = 0;
}
}
}
int s, t;... | 1 | 16,337,403 |
#include <cstdio>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
using ll = long long;
using namespace std;
void solve(){
}
int main (){
ios::sync_with_stdio(0);
cin.tie(0);
int a,b,c,d;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<int, int> P;
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define Z class
template <typename T>
T square(T x) { retu... | 1 | 3,237,826 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll, ll> Pll;
#define debug(var) do{std::cout << #var << " : ";view(var);}while(0)
template<typename T> void view(T e){std::cout << e << std::endl;}
template<typename T> void view(const std:... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N,H;cin>>N>>H;
vector<pair<int,int>>A(N*2);
for(int i=0;i<N;i++){
int a,b;cin>>a>>b;
A[i*2]=pair(a,1);
A[i*2+1]=pair(b,2);
}
sort(A.rbegin(),A.rend());
long long count=0;
for(int i=0;i<N*2;i++){
if(A[i].second==1){
cout<<i... | 1 | 84,181,573 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using p = pair<int, int>;
int main() {
int k;
cin >> k;
int v[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};
cout << v[k-1] << endl;
re... | #include <set>
#include <map>
#include <stack>
#include <queue>
#include <cmath>
#include <vector>
#include <cstdio>
#include <string>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define LL long long
#define pii pair<int,int>
#define sd(x) scanf("%d",&x)
#define slld(x) scanf("%lld"... | 1 | 98,649,604 |
#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define REP(i,a,b) for(inti=a;i<=b;i++)
typedef long long int ll;
typedef vector<int>vi;
typedef pair<int,int>pi;
int main()
{
int n;
cin>>n;
int ans = 0;
int i =1;
for(int index =0;index<n;index++)
{... | #include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for... | 1 | 11,622,242 |
#include<stdio.h>
int main(void)
{
int a,b,c,d,e,f,g,h,x,y;
scanf("%d %d %d %d %d %d %d %d",&a,&b,&c,&d,&e,&f,&g,&h);
x=a+b+c+d;
y=e+f+g+h;
if(x>y){
printf("%d\n",x);
}
else if(x=y){
printf("%d\n",x=y);
}
else if(x<y){
printf("%d\n",y);
}
return 0;
} | #include<cstdio>
#include<algorithm>
#include<iostream>
#include<cstring>
using namespace std;
int point,a,b;
int main (){
a=0;
b=0;
for(int i=0;i<4;i++){
scanf("%d",&point);
a = a + point;
}
for(int i=0;i<4;i++){
scanf("%d",&point);
b = b + point;
}
if(a>b){
printf("%d\n",a);
}
... | 1 | 30,221,778 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define zero_pad(num) setfill('0') << std::right << setw(num)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
string x, y;
cin >> x >> y;
if(x > y) cout << '>' << endl;
else... | #include <bits/stdc++.h>
#define ll long long
#define vi vector<int>
#define e "\n"
#define MaRiaMa { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); }
#define fix(n) cout << fixed << setprecision(n);
using namespace std;
int main()
{
MaRiaMa;
char a,b;
cin >> a >> b;
if (a < b)
cout << "<";
else if (a > b)
... | 1 | 51,431,736 |
#include<cstdio>
#include<iostream>
#include<string>
using namespace std;
int main(void){
string data("0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz");
string conv;
char inp,inp2;
string ans;
int n,m;
while(1){
ans=("");
conv=("..............................................................");... | #include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <map>
#include <sstream>
#include <queue>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <iterator>
#include <stack>
#include <list>
using namespace std;
typedef long long int lli;
typedef pair<int,int> P;
#define F... | 1 | 21,943,660 |
#include <iostream>
#include <cstdlib>
using namespace std;
int main(){
int N, A, B;
cin >> N >> A >> B;
if (abs(A - B) % 2 == 0) cout << "Alice";
else cout << "Borys";
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n,a,b;
cin>>n>>a>>b;
if(n==2)
cout<<"Borys"<<endl;
else{
int diff=abs(a-b)+1;
if(diff%2==0)
cout<<"Borys"<<endl;
else
cout<<"Alice"<<endl;
}
return 0;
} | 1 | 91,568,716 |
#include<bits/stdc++.h>
#include<iostream>
#include<queue>
#include<string>
#include<algorithm>
using namespace std;
char x,y;
int main()
{
cin>>x>>y;
if(x<y)
cout<<"<\n";
else if(x>y)
cout<<">\n";
else
cout<<"=\n";
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
string a,b;
cin>>a>>b;
if(a>b){
cout<<'>'<<endl;
}else if(a<b){
cout<<'<'<<endl;
}else{
cout<<'='<<endl;
}
return 0;
} | 1 | 88,174,061 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.