code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
inline ll int maxm (ll int a,ll int b)
{ if(a>b) return a;
else return b;
}
inline ll int minm (ll int a,ll int b)
{ if(a>b) return b;
else return a;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <math.h>
#include <string>
#include <numeric>
#include <queue>
#include <cstdio>
#include <cstring>
#define ll long long
#define rep(i,n) for(ll i=0;i<n;++i)
#define rep1(i,n) for(ll i=1;i<n;++i)
#define... | 0 | 88,808,303 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int a,b,x;
cin >> a >> b >> x;
bool ans = false;
if (a == x) ans = true;
else if (a < x && a+b > x) ans = true;
cout << ((ans) ? "YES" : "NO") << endl;
} | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vec... | 0 | 35,794,579 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
int main() {
int i, n, m, max=0;
string name;
map<string, int> blue;
cin >> n;
for (i=0; i<n; i++) {
cin >> name;
blue[name]++;
}
cin >> m;
for (i=0; i<m; i++) {
cin >> name;
blue[name]--... | #include<bits/stdc++.h>
using namespace std;
int main(){
int A,B,C,D;
cin >> A>>B>>C>>D;
int de,ba;
if(A<=B){
de=A;
}
else{
de=B;
}
if(C<=D){
ba = C;
}
else{
ba = D;
}
cout << de+ba << endl;
return 0;
} | 0 | 18,447,262 |
#include <bits/stdc++.h>
using namespace std;
bool in_range(int a, int b, int x) {
if(a <= x && x <= b) {
return 1;
}
else {
return 0;
}
}
int main() {
int N, M;
cin >> N >> M;
int L_max = 1;
int R_min = N;
for(int i = 0; i < M; i++) {
int L, R;
cin >> L >> R;
if(L > L_max) {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define all(v) v.begin(), v.end()
#define sz(v) v.size()
#define INF 100000000000000
template <typename T>
bool chmax(T &a, const T& b) {
if ... | 0 | 47,862,078 |
#include <bits/stdc++.h>
#include <math.h>
#include <vector>
#include <queue>
#include <iomanip>
#include <string>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i,n) for(int i=0;i<n;i++)
#define rep_1 (i,j,n) for(int i=j;i<n;i++)
typedef long long ll;
typedef long l;
const ll l_INF = 101010101000;... | #include <bits/stdc++.h>
#define mp make_pair
#define eb emplace_back
#define fi first
#define se second
using namespace std;
using cd = complex <double>;
typedef pair <int, int> pii;
const long long INF = 1e18;
const int mod = 1e9 + 7;
const double Pi = acos(-1);
void Fastio()
{
ios_base::sync_with_stdio(false);
cin... | 0 | 19,372,965 |
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <iostream>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <fstream>
#include <numeric>
#include <iomanip>
#include <bi... | #include <bits/stdc++.h>
using namespace std;
#define Hello ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl '\n'
#define ll long long
int main(){
Hello
string s, a = "", b = "";
cin >> s;
for(int i = 0; i < s.size(); i++){
if(i % 2) a += '1';
else a += '0';
}
fo... | 0 | 13,417,073 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x... | #include<bits/stdc++.h>
using namespace std;
int flag=0;
vector<int> hasfac(1000002,0);
void calcfac(int x)
{
if(flag==1)
return ;
for(int i=1;i*i<=x;i++)
{
int a,b;
if(x%i==0)
{
a=i;
b=x/i;
if(a==b){
a=i;
... | 0 | 5,891,270 |
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<ctime>
#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<mem... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;
typedef pair<int,int> pii;
typedef pair<pii,int> ppii;
typedef pair<int,pii> pipi;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> ppll;
typedef pair<ll,pll> plpl;
typedef tuple<ll,ll,ll> tl;
ll mod... | 0 | 88,462,320 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long;
const int INF = 1001001001;
const ll INF_LL = 1001001001001001001LL;
int main(void){
int a,b,c; cin >> a >> b >> c;
rep(i,b){
if((i+1)*a%b==c){
cout << "YES" << endl;
return 0;
}
}
... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ll long long
#define ld long double
typedef pair<ll, ll> ii;
typedef vector<ll> vi;
typedef vect... | 0 | 48,687,850 |
#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(){
ll n;
cin>>n;
int rn=sqrt(n);
int max=1;
for(int i=1;i<=rn;i++) if(n%i==0) max=i;
max=n/max;
int ans=1;
while(max/10!=0){
ans++;
max/=10;
}
cout << an... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const static ll INF = 1e15;
ll ans = -1;
pair<string, ll> dfs(string S, ll cnt){
if(S.size() == 1){
return {S, cnt};
}
int n1 = S[0]-48;
int n2 = S[1]-48;
if(n1+n2 >= 10){
S[0] = (n1+n2)/10+48;
S[1] = (n1+n2)... | 0 | 18,523,370 |
#include <bits/stdc++.h>
#define rep(i,n) for(long long i=0; i<n; i++)
#define Rep(i,n) for(long long i=1; i<n; i++)
#define ll long long
#include <math.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define PI acos(-1... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
ll gcd(ll a,ll b){
if(b == 0) return a;
return gcd(b, a % b);
}
using Graph = vector<vector<int>>;
ll calc(ll a, ll b, ll p){
if(b == 0) return 1;
else if(b%2 == 0){
ll d = calc(a,b/2,p);... | 0 | 66,408,746 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define dump(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define POSSIBLE(n) cout << ((n) ? "POSSIBLE" : "IMPOSSIBLE") << endl
#define Possible(n) cout <<... | #include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
#include <string>
#define reps(i,s,n) for(int (i) = (s); (i) < (n); (i)++)
#define rep(i,n) reps(i,0,n)
using namespace std;
using ll = long long;
int main(){
int n;
cin >> n;
vector<string> vec1... | 0 | 94,573,552 |
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#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 rep(i, n) for(int i=0;i<n;++i)
... | #include <cstdio>
#include <cstring>
typedef long long int64;
static const int MAXD = 10;
int N;
int pow10[MAXD];
inline bool query(int64 n)
{
static char r[20];
printf("? %lld\n", n); fflush(stdout);
scanf("%s", r);
return r[0] == 'Y';
}
bool result[MAXD];
int main()
{
pow10[0] = 1;
for (int i ... | 0 | 99,640,234 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
string s;
cin>> s;
if (n%2 == 1)
{
cout << "No" << endl;
return 0;
}
for(int i=0;i<n/2;i++)
{
if (s[i]!=s[i+n/2])
{
... | #include "bits/stdc++.h"
#pragma GCC optimize("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma warning(disable:4786)
#pragma warning(disable:4996)
#define ll long long
#define ... | 0 | 99,768,240 |
#include<bits/stdc++.h>
#define forOneToN(i, n) for(int i = 1; i <= n; i++)
#define forZeroToNminus(i, n) for(int i = 0; i < n; i++)
#define forNToOne(i, n) for(int i = n; i >= 1; i--)
#define forNminusToZero(i, n) for(int i = n-1; i >= 0; i--)
#define makepair make_pair
#define pushb... | #include <iostream>
#include <cstring>
#define M 1000000
using namespace std;
char list[M][13];
void Init()
{
for(int i=0;i<M;i++)
list[i][0] = '\0';
}
int getch(char a)
{
if(a=='A')
return 1;
else if(a=='C')
return 2;
else if(a=='G')
return 3;
else
return 4;
... | 0 | 77,989,020 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
string s;
cin >> s;
sort(s.begin(), s.end());
cout << (s == "abc" ? "Yes" : "No") << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define fast() ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long int
#define test() ll t; cin>>t; while(t--)
#define lp0(i,begin,end) for(ll i=begin;i<end;i++)
#define lp1(i,begin,end) ... | 0 | 49,327,080 |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <limits>
#include <functional>
using namespace std;
int main()
{
int N, K;
cin >> N >> K;
int ans = 0;
vector<int> vec(51);
for (int i = 0; i < N; i++)
cin >> vec[i];
sort(vec.begin(), ... | #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... | 0 | 50,504,431 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define INF 9223372036854775807
#define all(x) (x).begin(), (x).end()
ll ts = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll r;
cin >> r;
cout << r * r << "\n";
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define FastIO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie... | 0 | 92,227,208 |
#include <cstdio>
#include <algorithm>
using i8 = std::int8_t;
using u8 = std::uint8_t;
using i16 = std::int16_t;
using u16 = std::uint16_t;
using i32 = std::int32_t;
using u32 = std::uint32_t;
using i64 = std::int64_t;
using u64 = std::uint64_t;
using i128 = __int128_t;
using u128 = __uint128_t;
using isize = std::int... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i<(int)(n); i++)
#define all(x) x.begin(), x.end()
#define mod 1000000007
typedef long long ll;
int main(){
string str;
cin >> str;
int left = 0, right = 0;
ll sum = 0;
bool reset = true;
rep(i, str.length()){
if(str[i] == '<'... | 0 | 94,400,851 |
#include <iostream>
using namespace std;
int main(){
int sum, x, d;
while(cin >> d){
sum = 0;
for(int i=1;(x=(i*d))<600;i++){
sum += x*x;
}
sum *= d;
cout << sum << endl;
}
return 0;
} | #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 { \... | 0 | 35,143,234 |
#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;
template<class T> inline bool chmax(T& a, T b) { if (a < b) ... | #include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
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; } retu... | 0 | 72,695,940 |
#include<iostream>
#include<cstdlib>
#include<cstdio>
#include<cmath>
#include<iomanip>
#include<cstring>
#include<algorithm>
#include<ctime>
using namespace std;
inline int read()
{
int kkk=0,x=1;
char c=getchar();
while((c<'0' || c>'9') && c!='-')
c=getchar();
if(c=='-')
c=getchar(),x=-1;
while(c>='0' && c<=... | #include<iostream>
#include<cstdlib>
#include<cstdio>
template<int BUFSIZE>
struct ans_buf {
char buf[BUFSIZE];
int i;
ans_buf(): i(0) {}
void putZ(unsigned int v, char delim='\n') {
unsigned int k = 1;
while(k <= v/10) k*=10;
for(; k>0; v%=k, k/=10) buf[i++] = (v/k)+'0';
buf[i++] = delim;
}
... | 0 | 77,234,194 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll ll_Inf = 9223372036854775807LL;
int main() {
ll n; cin >> n;
vector<ll> c;
c.push_back(1);
ll tmp6 = 6;
while (tmp6 <= n) {
c.push_back(tmp6);
tmp6 *= 6;
}
ll tmp9 = 9;
while (tmp9 <= n) {
c.push_back(tmp9);
tmp9 *= 9;
}
sort... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Edge = int;
using Graph = vector<vector<Edge>>;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
const ll MOD = 1000000007;
const ll nmax = 8;
const ll IN... | 0 | 48,429,614 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, s, e) for (int i = (int)(s); i <= (int)(e); i++)
#define printYesNo(is_ok) puts(is_ok ? "Yes" : "No");
#define SORT(v) sort(v.begin(), v.end());
#define RSORT(v) sort(v.rbegin(), v.rend());
#define REVERSE(... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define inf 1001001001
#define mod 1000000007
#define pi 3.141592653589793
#define all(v) v.begin(),v.end()
int p;
ll gcd(ll a,ll b){
if(b>a) swap(a,b);
if(b==0) return a;
return gcd(b,a%b);
}
ll l... | 0 | 46,236,673 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long a, b;
cin >> a >> b;
int res = a-b;
if(res < 0) cout << 0 << endl;
else cout << res << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
t... | 0 | 97,781,394 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int n;
string s,t,ans="";
cin >> n;
cin >> s >> t;
for(int i=0;i<n;i++){
ans+=s.at(i);
ans+=t.at(i);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
int main(){
int n,m;
cin >> n >> m;
vector < vector <int> > s(m,vector <int>(0));
vector <int> p(m);
rep(i,m){
int k;
cin >> k;
rep(j,k){
i... | 0 | 93,750,222 |
#include <bits/stdc++.h>
typedef long long ll;
#define pb push_back
using namespace std;
typedef pair<ll,ll> pll;
typedef long double ld;
ll n;
vector< pll > v;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
inline ll f(ll X, ll Y)
{
return (X*X + Y*Y);
}
ld g(pll X, pll Y)
{
if... | #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>;
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
template <typename T>
using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;
const ll MAXN = 802... | 0 | 69,991,793 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int m, n;
cin >> n >> m;
int all = 0;
vector<int> x(n);
for (int i = 0; i < n; i++) {
cin >> x.at(i);
all += x.at(i);
}
sort(x.begin(), x.end());
reverse(x.begin(), x.end());
if (x.at(m - 1) * 4 * m < all) {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1e9;
int dp[1 << 26], a[200005];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
int n = s.length();
for (int i = 0; i < n; i++) {
a[i + 1] = a[i] ^ (1 << (s[i] - 'a'));
}
... | 0 | 79,514,150 |
#include <iostream>
#include <cmath>
#include <iomanip>
#define NUM_S 6
class Dice {
public:
Dice(const int n[NUM_S]);
int roll(char);
int rollF();
int rollR();
int rollL();
int rollB();
int rollCwise();
int getTop();
int getF();
int getR();
int getL();
int getB();
int getBottom();
void show();
private:
... | #include<iostream>
#include<algorithm>
using namespace std;
int main(){
int q, lcs[1010][1010] = {};
string a, b;
cin >> q;
for(int i = 0;i < q;i++){
cin >> a;
cin >> b;
for(int r = 0;r < (int)a.size();r++){
for(int c = 0;c < (int)b.size();c++){
if(a[r] == b[c]) lcs[r + 1][c + 1] = lcs... | 0 | 7,376,656 |
#include <bits/stdc++.h>
#define rep2(x,fr,to) for(int x=(fr);x<(to);x++)
#define rep(x,to) for(int x=0;x<(to);x++)
#define repr(x,fr,to) for(int x=(fr);x>=(to);x--)
#define all(c) c.begin(),c.end()
#define sz(v) (int)v.size()
using namespace std;
typedef long long ll; typedef vector<int> VI; typedef pair<int,int> pii... | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = p... | 0 | 35,386,670 |
#include <bits/stdc++.h>
#define PI 3.14159265359
#define INF 1e9
#define LINF 1e18
#define IMOD 1000000007
#define irep(i,n) for(int i = 0; i < (int)(n); i++)
#define irep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define lrep(i,n) for(long long i = 0; i < (long long)(n); i++)
#define lrep2(i,a,n) for(long l... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a, b;
cin >> a >> b;
int k = 50;
char grid[110][110];
rep(y, 2 * k) rep(x, 2 * k) {
if (y < k)
grid[y][x] = '#';
else
gri... | 0 | 68,945,021 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <math.h>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
using namespace std;
usi... | #include <stdint.h>
#include <stdlib.h>
#include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
using default_counter_t = int64_t;
#define let auto const&
#define overload4(a, b, c, d, name, ...) name
#define rep1(n) \
for (default_counter_t i = 0, end_i = default_counter_t(... | 0 | 16,026,648 |
#include<cstdio>
#include<vector>
#include<algorithm>
#include<utility>
#include<numeric>
#include<iostream>
#include<array>
#include<string>
#include<sstream>
#include<stack>
#include<queue>
#include<list>
#include<functional>
#define _USE_MATH_DEFINES
#include<math.h>
#include<map>
#define SENTINEL 1000000001
#define... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
#define ALL(x) (x).begin(), (x).end()
#define REP(i ,n) for(int i = 0; i < (int)(n); i++)
#define pb push_back
typedef vector<int>vint;
typedef vector<ll>vll;
template<typename T> istream &operator>>(istream &is, vecto... | 0 | 32,195,718 |
#include<cstdio>
#include<algorithm>
using namespace std;
int main(void) {
int t[3];
for (int i = 0; i < 3; i++) {
scanf("%d", &t[i]);
}
sort(t, t + 3);
printf("%d", t[0] + t[1]);
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rrep(i, n) for(int i = 1; i <= (int)(n); i++)
#define drep(i, n) for(int i = (n)-1; i >= 0; i--)
#define ALL(x) (x).begin(), (x).end()
#define dup(x,y) (((x)+(y)-1)/(y))
using namespace std;
typedef long long ll;
typedef pair<int, int>... | 0 | 55,471,764 |
#include <bits/stdc++.h>
int main()
{
int a, b, c, d;
int ans = 0;
std::cin >> a >> b >> c >> d;
for (int i = std::min(a, c); i <= std::max(b, d); ++i) {
if (a <= i && i <= b && c <= i && i <= d) {
++ans;
}
}
if (ans > 0) {
--ans;
}
std::cout << ans <<... | #pragma region header
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb p... | 0 | 49,669,232 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll X;
cin >> X;
ll P = X / 100;
ll Q = X % 100;
if(P >= (Q + 4) / 5) {
cout << 1 << endl;
}
else {
cout << 0 << endl;
}
} | #include<iostream>
#include<stdio.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<cassert>
#include<cmath>
#include<cstdint>
#define INF 1e9
#define LINF... | 0 | 4,334,342 |
#include<bits/stdc++.h>
#define int long long
#define endl "\n"
#define PI 3.1415926535897932384626433
#define ceil1(a,b) (a+(b-1))/b
#define all(v) v.begin(),v.end()
#define gen(arr,n,nxt) generate(arr,arr+n,nxt)
#define base ios_base::sync_with_stdio(false);cin.tie(0);
#define open freopen("input.txt", "r", stdin... | #include <bits/stdc++.h>
using namespace std;
const int md = 1e5 + 10;
long long a[md];
long long n, m, v, p;
bool check(int x) {
if (x < p)
return true;
if (a[x] + m < a[p - 1])
return false;
long long sum = 0;
for(int i = 0; i < n; i++) {
if (i < p - 1)
sum += m;
... | 0 | 99,181,579 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int n, a, b;
cin >> n >> a >> b;
if (abs(a - b) & 1) {
puts("Borys");
} else {
puts("Alice");
}
} | #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 { \... | 0 | 23,110,724 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll N;
cin >> N;
ll A[N];
for(ll i = 0; i < N; i++){
cin >> A[i];
}
ll cost_min = 1e9;
for(ll i = -100; i <= 100; i++){
ll cost = 0;
for(ll j = 0; j < N; j++){
cost += (A[j] - i... | #include<bits/stdc++.h>
#define forr(i, a, b) for(int i = (a); i < (b); i++)
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = 1; i <= (n); i++)
#define ALL(a) (a.begin()),(a.end())
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll, ll> LP;
const ll LINF = 1LL... | 0 | 38,981,885 |
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int gcd(int a, int b) {
while (a % b != 0 && b % a != 0) {
if (a > b) {
a %= b;
... | #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() {
ll N, M;
cin >> N >> M;
vector<int> k(M), s(M, 0);
rep(i, M) {
cin >> k[i];
rep(j, k[i]) {
int tmp;
cin >> tm... | 0 | 914,451 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define pli pair<ll,int>
#define mp make_pair
#define fst first
#define snd second
const int maxn=1e5+7;
int n;
ll d[maxn];
pli sx[maxn];
int sz[maxn];
ll dis[maxn];
int findit(ll t){
if (t<0) return -1;
int l=0,r=n-1,mid;
wh... | #include<iostream>
#include<vector>
#include <cmath>
#include <map>
#include <set>
#include <algorithm>
#include <string>
#define rep(i,n) for (int i= 0;i<(n);++i)
using namespace std;
typedef long long ll;
int arr[102],freq[102];
int main() {
int x ,n,element;
cin>>x>>n;
for(int i=0;i<n;i++){
cin>>... | 0 | 63,350,887 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define reps(i,n) for(int i=1;i<(int)(n);i++)
typedef long long ll;
using namespace std;
int main()
{
ll n,a[200010],number[200010]={0};
ll sum=0;
cin>>n;
rep(i,n){
cin>>a[i];
sum+=number[a[i]];
number[a[i]]++;
}
rep(i,n)cout<<... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using ll = long long;
using ld = long double;
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define rep3(i, n) for (ll i = 1; i < (ll)(n+1); i++)
#define rep4(i, s, n) for (ll i = (s); i < ... | 0 | 34,276,553 |
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <queue>
#include <deque>
#include <bitset>
#include <iterator>
#include <list>
#include <stack>
#include <map>
#include <set>
#include <functional>
#include <numeric>
#include <utility>
#include <... | #include "bits/stdc++.h"
#define sai(j,n) for(sei j=0;j<sei(n);++j)
#define hsai(j,n) for(sei j=sei(n)-1;j>=0;--j)
#define kan(j,m,n) for(sei j=m;j<sei(n);++j)
#define hkan(j,m,n) for(sei j=sei(n)-1;j>=sei(m);--j)
#define zen(v) (v).begin(),(v).end()
#define yu(v) v.erase(unique(zen(v)), v.end());
#define syutu(v) si(a... | 0 | 22,028,671 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<cstring>
using namespace std;
vector<int> R;
vector<int> B;
vector<int> T;
int main(){
int x, y, a, b, c;
cin >> x >> y >> a >> b >> c;
for(int i = 0; i < a; i++){
int p;
cin >> p;
R.push_back(p);
}
for(int i = ... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define SZ(x) ((int)(x).size())
#define rep(i,n) for(int i=0;i<(n);++i)
#define fore(i,a) for(auto &i:a)
#define min(...) min({__VA_ARGS__})
#define max(...) max({__VA_ARGS__})
#define Yes cout << "Yes" << endl;
#define No cou... | 0 | 19,076,407 |
#include <iostream>
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
ll s[9];
ll h,w,n;
map<P,ll>mp;
int main(void){
cin>>h>>w>>n;
for(int i=0;i<n;i++){
ll a,b;
cin>>a>>b;
for(int j=0;j<3;j++){
for(int k=0;k<3;k++){
if(... | #include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
using P = pair<ll,ll>;
using ld=long double;
int main(){
int n;cin >>n;
ll cnt5=0;
ll cnt3=0;
ll cnt15=0;
ll cnt25=0;
ll cn... | 0 | 68,953,991 |
#include <bits/stdc++.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=1e9;
const int di[] = {-1,0,1,0};
const int dj[] = {0,-1,0,1};
int main() {
string o,e;
cin>>o>>e;
string ans;
if(o.length()-e.lengt... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define cinf(n,x) for(int i=0;i<(n);i++)cin>>x[i];
#define max3(a,b,c) max(max(a,b),c)
#define min3(a,b,c) min(min(a,b),c)
#define ft first
#define sc second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#d... | 0 | 43,454,357 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
#define req(i,n) for(int i = 1;i <=n;i++)
#define pai 3.14159265358979323846
const int INF = 1001001001;
typedef long long ll;
int A[3][3], N;
bool punched[3][3];
bool ok[3][3];
using Graph = vector<ve... | #include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using bint = boost::multiprecision::cpp_int;
using ll = long long;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define repSE(i,s,n) for (int i = (s); i < (n); i++)
#define ... | 0 | 5,122,638 |
#include<stdio.h>
int main() {
int a, b, c, d,i = 0;
while (1) {
scanf("%d %d", &a,&b);
if (a == 0 && b == 0)break;
if (a > b) {
c = a;
a = b;
b = c;
}
printf("%d %d\n", a, b);
}
} | #include<bits/stdc++.h>
using namespace std;
#define pi acos(-1)
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned un;
#define sf scanf
#define si(a) sf("%d",&a)
#define sc(a) sf("%c",&a)
#define sii(a,b) sf("%d %d",&a,&b)
#define siii(a,b,c) sf("%d %d %d",&a,&b,&c)
... | 0 | 27,814,520 |
#include <iostream>
#include <vector>
#include <string>
#include <climits>
#include <algorithm>
using namespace std;
int main(){
int n,a,b,c,x;
while(cin>>n>>a>>b>>c>>x, n){
vector<int> y(n);
for(int i=0; i<n; ++i){
cin>>y[i];
}
int res = -1;
int cnt = 0;
vector<int>::iterator it;
for(int t=0; t<=100... | #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(){
ll a,b,k;cin>>a>>b>>k;
if(a>=k){
a-=k;
cou... | 0 | 55,566,744 |
#include<bits/stdc++.h>
#include<array>
#define nguyendz the_best
#define ll long long
#define ld long double
#define pb push_back
#define all(n) n.begin(),n.end()
#define eb emplace_back
#define endl "\n"
#define pll pair<ll,ll>
#define YES cout <<"YES"<<endl;
#define NO cout <<"NO"<<endl;
#define ff first
#define ss ... | #include <iostream>
#include <cstring>
#define rep(i,n) for(int i=0;i<n;i++)
#define mod(i) (i)%2
#define INF (1e9)
using namespace std;
int main()
{
int H,N,A[10010],B[10010],dp[2][10010];
rep(i,2){rep(h,10010){dp[i][h]=INF;}}
dp[0][0]=0;
dp[1][0]=0;
cin>>H>>N;
rep(i,N){
cin>>A[i]>>B[i]... | 0 | 63,438,746 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
vector<ll> a(n);
ll sum = 0;
for (int i = 0; i < n; i++) {
cin >> a.at(i);
sum += a.at(i);
}
if (sum % (n * (n + 1) / 2) != 0) {
cout << "NO\n";
ret... | #include <vector>
#include <map>
#include <set>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <queue>
#include <iomanip>
#include <list>
#include <string>
typedef char SINT8;
typedef short SINT16;
typedef int SINT32;
typedef long long SINT64;
t... | 0 | 42,964,632 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1000000007
using namespace std;
int main(){
int n;
cin >> n;
int ans[110];
rep(i,110)ans[i] = 0;
rep(i,26){
rep(j,15){
if(i*4 + j*7 <= 100)ans[i*4+j*7] = 1;
}
}
if(ans[n] == 1)cout << "Yes" << endl;
else cout << "No"... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
template <typename T>
void print_vec(const vector<T>& v, bool is_reverse=false, ll num=0){
if(num == 0) num = (ll)v.size();
cout << endl; cout << "i= ";for(ll i=0; i<num; i++) cout << i << " ";cout << endl;
cout << " ";
if(is_reverse) f... | 0 | 49,113,682 |
#include "bits/stdc++.h"
using namespace std;
using ll=long long;
using vll=vector< ll>;
using vvll=vector< vll>;
using vvvll=vector< vvll>;
using vvvvll=vector<vvvll>;
constexpr ll INF = 1LL << 60;
struct Fast{
Fast(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(std::numeric_l... | #include <bits/stdc++.h>
using namespace std;
int main(){
long N;
cin >> N;
long A[N], cnt[N+1];
long ans = 0;
for(long i=0;i<N+1;i++){
cnt[i] = 0;
}
for(long i=0;i<N;i++){
cin >> A[i];
cnt[A[i]]++;
}
for(long j=0;j<N+1;j++){
ans += cnt[j] * (cnt[j] - 1) / 2;
}
for(long i=0;i<N;i++){
long tmp = ans... | 0 | 97,744,544 |
#include <string>
#include <string.h>
#include <stdio.h>
#include <math.h>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <iomanip>
#define REP(i,n) for(int i=0; i<(int)n; i++)
#define INF 1e9
using namespace std;
template <class T> string tos(T x) ... | #include <vector>
#include <list>
#include <map>
#include <climits>
#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 <c... | 0 | 24,698,652 |
#include <iostream>
#include <stdio.h>
#include <math.h>
#include <vector>
#include <algorithm>
using namespace std;
int check(int x,int y,int z,int w){
}
int main(){
int n;
while(cin >> n){
int ans=0;
int a,b,c,d;
for(a=0;a<=9;a++){
for(b=0;b<=9;b++){
for(c=0;c<=9;c++){
for(d=0;d<=9;d++){
if(... | #include <bits/stdc++.h>
#include <algorithm>
#include <functional>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define DEBUG
#define PI 3.141592653589793238462643383279
#define _GLIBCXX_DEBUG
#ifdef DEBUG
#define s(...) show(__VA_ARGS__);
#define sl(...) show(__VA... | 0 | 74,216,439 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mpp make_pair
#define pii pair<int,int>
#define pb push_back
const int maxn = 1e5 + 5;
int mp[6][6] , sum[6][6];
ll cnt[15];
map<pair<int,int> , bool> Q;
int ask (int x , int y , int a , int b)
{
return sum[a][b] - sum[x - 1][b] - sum[a][y - ... | #include <iostream>
#include <vector>
#include <math.h>
#include <cmath>
#include <algorithm>
#include <numeric>
#include <string>
#include <cstring>
#include <regex>
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int,int>;
using pl4 = pair<ll,ll>;
using vi = vector<int>;
using vvi... | 0 | 87,577,813 |
#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>;
string rev(string str) {
reverse(str.begin(), str.end());
return str;
}
bool evaluate(string str) {
if (str != rev(str)) return false;
int half = (str.size() - 1) / 2;
... | #include <algorithm>
#include <iostream>
#include <fstream>
#include <vector>
#include <set>
#include <functional>
#include <string>
#include <utility>
#include <cmath>
#include <iomanip>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
#define ALL(a) (a).begin(),(a... | 0 | 14,982,766 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define blank(ans) cout << (ans) << " ";
#define mp(p, q) make_pair(p, q)
#define mt(p, q, r) make_tuple(p, q, r)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()... | #define rush() \
int MYTESTNUM; \
cin >> MYTESTNUM; \
while (MYTESTNUM--)
#define FOR(i, s, t) for (int i = (s); i <= (t); ++i)
#define mem(a, b) memset(a, b, sizeof(a))
#define pi acos(-1)
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
typedef long long ll;
typedef unsigned long ... | 0 | 25,258,418 |
#include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
#include<functional>
#include<string>
#include<cstring>
#include<cmath>
using namespace std;
int cnt;
int w,h;
char map[24][24];
void func(int y,int x)
{
cnt++;
map[y][x]='#';
int ny,nx;
int dx[]={0,0,1,-1};
int dy[]={1,-1,0,0}... | #include <iostream>
using namespace std;
const int maxf = 3;
int f[maxf];
int main()
{
int mini = 0 , ans;
for (int i = 0 ; i < 3 ; i++){
cin >> f[i];
if (mini <= f[i]){
mini = f[i];
}
}
if (mini == f[0]){
ans = f[1] + f[2];
}else if (mini == f[1]){
... | 0 | 3,822,731 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
#define VL vector<ll>
#define VS vector<string>
int main(){
ll N, M;
cin >> N >> M;
VS s(N);
rep(i, 0, N){
cin >> s[i];
}
rep(j, 0, N){
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair... | 0 | 44,013,054 |
#include <iostream>
#include <cstdio>
using namespace std;
string a, b;
int main()
{
cin >> a;
cin >> b;
b.pop_back();
if (a == b) cout << "Yes";
else cout << "No";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
template<class T> inline bool chmax(T &a, T b)
{
if(a < b)
{
a = b;
return true;
}
return false;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int N, K;
cin >> N >> K;
... | 0 | 45,391,742 |
#include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(c) begin(c),end(c)
const int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
... | #include "bits/stdc++.h"
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using ll = long long;
int main() {
int K;
cin >> K;
vector<ll> A(K + 1, 1), B(K + 1), C(K + 1);
rep(i, K) cin >> A[i + 1];
B[K] = A[K];
C[K] = A[K];
if (A[K] != 2) {
cout << -1 << endl;
return... | 0 | 39,917,480 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define int ll
#define _GLIBCXX_DEBUG
#define REP(i,n) for (int i = 0; i < (n); ++i)
#define REPD(i,n) for (int i = (n-1); i >= 0; --i)
#define FORE(i, s, n) for (int i = (s); i <= (int)(n); i++)
#define debug(x) cerr << #x <<... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#in... | 0 | 19,677,813 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define fin(ans) cout << (ans) << endl;
#define blank(ans) cout << (ans) << " ";
#define mp(p, q) make_pair(p, q)
#define mt(p, q, r) make_tuple(p, q, r)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
typedef long... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define all(n) begin(n),end(n)
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
const long long INF = numeric_limits<long long>::max();
int main(){
int n;
cin>>n;
... | 0 | 56,429,889 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<int> c(n+1,0);
for(int i=1;i<=n;i++){
c.at(i)=i;
for(int p=1;p<=i;p*=6)
c[i]=min(c[i],c[i-p]+1);
for(int p=1;p<=i;p*=9)
c[i]=min(c[i],c[i-p]+1);
}
cout<<c[n]<<endl;
} | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <stdio.h>
#include <string.h>
#include <math.h>
using namespace std;
struct Graph {
struct Vertex { int n; };
struct Edge { int i, n; };
Graph(int n, int m) : v(n, { -1 }), e(m), n(n), m(0) {}
void add_edge(int i, int ... | 0 | 60,443,499 |
#include<bits/stdc++.h>
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout.precision(30);
using namespace std;
int main()
{
IOS;
string s;
cin>>s;
for(char c='a'; c<='z'; c++){
if(s.find(c)==-1){
cout<<c;
return 0;
}
}
cout<<"None";
ret... | #include<iostream>
#include<algorithm>
#include<vector>
#include<climits>
using namespace std;
int N_MAX = 50;
typedef pair<long long,long long> P;
int main()
{
int n,k,i,j,l;
long long x,y,res=LLONG_MAX;
P p[N_MAX];
vector<long long> q;
cin >> n >> k;
for(i=0;i<n;i++)
cin >> p[i].first >> p[i].second;
... | 0 | 96,084,613 |
#include<bits/stdc++.h>
using namespace std;
int main(void)
{
char b;
cin>>b;
switch (b)
{
case 'A':
cout<<'T'<<endl;
break;
case 'T':
cout<<'A'<<endl;
break;
case 'G':
cout<<'C'<<endl;
break;
case 'C':
cout<<'G'<<endl;
break;
default:
break;
}
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
#include <queue>
#include <string>
#define reps(i,s,n) for(int (i) = (s); (i) < (n); (i)++)
#define rep(i,n) reps(i,0,n)
using namespace std;
using ll = long long;
using pii = pair<int,int>;
using vi = vecto... | 0 | 83,854,237 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define FOR(i, a, b) for (int i = a; i <= (b); i++)
#define ROF(i, a, b) for (int i = a; i >= (b); i--)
using pii = pair<int, int>; using vpii = vector<pii>... | #include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string... | 0 | 13,462,705 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<cassert>
#include<iterator>
#include<complex>
#in... | #include<iostream>
#include<cmath>
#include<algorithm>
using namespace std;
int n,a,b,res1,res2,res3,store[110],res;
signed main(){
cin>>n>>a>>b;
for(int i=0;i<n;i++)cin>>store[i];
sort(store,store+n);
int cnt=0;
while(cnt<n&&store[cnt]<=a)cnt++;
res1=cnt;
while(cnt<n&&store[cnt]>=a+1&&store[cnt]<=b)cnt++;
res2... | 0 | 99,168,245 |
#include"bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
int n,cn... | #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... | 0 | 10,887,255 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int R, G;
cin >> R >> G;
cout << 2 * G - R;
} | #include <iostream>
#include <string>
#include <queue>
#include <vector>
#include <algorithm>
#include <math.h>
#include <map>
#include <iomanip>
#include <queue>
#include <numeric>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
int main() {
... | 0 | 92,128,963 |
#include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
int main(){
cout <... | #include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#inc... | 0 | 54,368,066 |
#include <bits/stdc++.h>
using namespace std;
const int MOD=1e9+7;
const int INF=1e9;
const long long LINF=1e18;
#define int long long
template <typename T>
void fin(T a){
cout<<a<<endl;
exit(0);
}
signed main(){
int N;cin>>N;
string s,t;
cout<<0<<endl;cin>>s;if(s=="Vacant")return 0;
cout<<N-1<<endl;cin>>t;... | #include<iostream>
#include<string>
#include<vector>
#include<numeric>
#include<math.h>
#include<algorithm>
#include<iomanip>
#include<list>
#include<bitset>
#include<sstream>
using namespace std;
int main() {
string S;
long long K;
cin >> S;
cin >> K;
long long jdg = 1;
for (long long i = 0; i < S.length() - 1; ... | 0 | 82,148,419 |
#include<iostream>
#include<cstdio>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
printf("%d %d %f",a/b, a%b, (double)a/b);
printf("\n");
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#in... | 0 | 88,113,183 |
#pragma region
#include <bits/stdc++.h>
using namespace std;
inline void ci(void){
return;
}
template <typename First, typename... Rest>
void ci(First& first, Rest&... rest){
cin >> first;
ci(rest...);
return;
}
inline void co(void){
cout << "\n";
return;
}
template <typename First, typename... Rest>
void c... | #include <iostream>
#define int long long
#define rep(i, n) for(i = 0; i < n; i++)
#define rrep(i, n) for(i = n - 1; i >= 0; i--)
using namespace std;
int n;
int a[100000];
signed main() {
int i, j;
cin >> n;
rep(i, n) cin >> a[i];
int w = 0;
rep(i, n) w ^= a[i];
rep(i, n) a[i] &= ~w;
int cor = 0;
rrep(i, 60) {... | 0 | 85,160,744 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
double w, h, x, y;
cin >> w >> h >> x >> y;
double rec = 0.5 * w * h;
int ans = 0;
if (2 * x == w && 2 * y == h)
{
ans = 1;
}
cout << fixed << setprecision(6) << rec << " " << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<n;++i)
#define all_map(itr,mp) for(auto itr=mp.begin();itr!=mp.end();itr++)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll LINF = 1LL << 62;
const int INF = 1e9 + 7;
int m... | 0 | 89,673,119 |
#define LOCAL
#undef _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false);cin.tie(0)
#define all(x) x.begin(), x.end()
#define ff first
#define ss second
#define MOD 1000000007LL
#define LLINF 100000000000000005LL
#define INF (int)1e9+1
template <typename A, typename B>
s... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for(ll i = ll(0); i < ll(n); i++)
#define Rep(i, n) for(ll i = ll(1); i < ll(n); i++)
#define ALL(a) (a).begin(),(a).end()
#define IOS ios::sync_with_st... | 0 | 51,248,466 |
#include <iostream>
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#inc... | #include <bits/stdc++.h>
#define ALL(obj) begin(obj), end(obj)
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace std;
template <class T>
vector<T> make_vec(size_t a) {
return vector<T>(a);
}
template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts.... | 0 | 45,269,723 |
#include <bits/stdc++.h>
using namespace std;
int main(){
double a,b;
cin >> a >> b;
cout << b-a+b << endl;
} | #include <bits/stdc++.h>
#define assem99 ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long
#define ld long double
#define endll '\n'
#define sz(a) (int)(a).size()
#define RWFile freopen("input.txt","r",stdin); freopen("output.txt","w",stdout);
int dx[] = { 0, -1, 0, 1, -1, 1, -1, 1 };
int dy[] =... | 0 | 41,115,333 |
#include <bits/stdc++.h>
#define MAX 100005
using namespace std;
using ll = long long;
int dp[1001][MAX];
signed main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int h, n;
cin >> h >> n;
int a[n], b[n];
for (int i = 0; i < n; ++i) cin >> a[i] >> b[i];
for (int i = 0; i < 1001; ++i) {
for (int j = 0; ... | #include <bits/stdc++.h>
#define int long long
#define main signed main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define forever while (true)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecision(n)
template<ty... | 0 | 63,130,028 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1LL << 60;
ll N, K;
vector<ll> A;
int main() {
cin >> N >> K;
A.resize(N);
rep(i, N) cin >> A[i];
cout << ceil((double)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<P,ll> PLL;
typedef pair<P,P> PP;
typedef vector<ll> VECLL;
typedef vector<P> VECP;
typedef priority_queue<P,VECP,greater<P> > PQP;
typedef priority_queue<ll, VECLL, greater<ll> > PQll;
#define rep(i,a,n) for(ll i = a... | 0 | 73,593,426 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define MAX_INPUT_SIZE 1024
struct CardInfo {
char type;
int num;
};
static const int STABLE = 1;
static const int NOT_STABLE = -1;
void dumpCardsInfo(CardInfo* cards, int num);
void dumpResult(CardInfo* cards, int num);
void readData(CardInfo* ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr int Inf = 1000000000;
constexpr ll INF= 1e18;
constexpr ll MOD = 1000000007;
const double PI = 3.1415926535897;
typedef pair<int,int> P;
int main() {
ll K,A,B;
cin >> K >> A >> B;
if(B - A >= 2) {
ll ret = 0;
ret +=... | 0 | 1,869,181 |
#include <iostream>
#include <cstring>
std::string N;
int K;
int dp[101][4][2];
int rec(int n, int k, bool f)
{
int &res = dp[n][k][f];
if (res != -1)
return res;
if (n == (int)N.size())
return k == K;
res = 0;
int x = N[n] - '0';
if (k < K) {
if (!f) {
for (i... | #include <bits/stdc++.h>
#include <sys/time.h>
using namespace std;
#define rep(i,n) for(long long i = 0; i < (long long)(n); i++)
#define repi(i,a,b) for(long long i = (long long)(a); i < (long long)(b); i++)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define mt make_... | 0 | 60,658,773 |
#include<iostream>
#include<iomanip>
#include<vector>
#include<map>
#include<stack>
#include<queue>
#include<string>
#include<utility>
#include<numeric>
#include<algorithm>
#include<cmath>
#include<climits>
using namespace std;
using ll = long long;
class Stream{
public:
Stream(){
}
void read(){
}
t... | #include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#define rep(i, n) for(int i=0; i<n; i++)
using namespace std;
int main(){
int N;
cin >> N;
int A[N], B[N];
rep(i, N)
cin >> A[i];
rep(i, N)
cin >> B[i];
int sub[N];
rep(i, N)
sub[i] = A[i] - B[i];
sort(sub, sub+N);
... | 0 | 83,399,982 |
#include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
template<class T> inline T sqr(T x) {return x*x;}
typedef long long LL;
typedef pair<int, int> PII;
typede... | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using vi = vector<int>;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
const int MOD = 1000000007;
const int INF = 1 << 30;
lint log_mul(lint base, lint bit) {
lint res = 0;
... | 0 | 11,173,340 |
#include <cstdio>
int main(){
int n,s;
while(scanf("%d %d",&n,&s),n){
int ans=0;
for(int i=0; i<1024; i++){
int a=0,b=0;
for(int j=0; j<10; j++)
if((i>>j)&1){a+=j;b++;}
if(a==s&&b==n) ans++;
}
printf("%d\n",ans);
}
} | #include<cstdio>
int h,w,d;
char s[]="RGBY";
int main(){
scanf("%d%d%d",&h,&w,&d);
if(d&1){
for(int i=0;i<h;++i){
for(int j=0;j<w;++j)putchar(s[i+j&1]);
putchar(10);
}
}else{
for(int i=0;i<h;++i){
for(int j=0;j<w;++j){
int x=i+j,y=i-j+10000;
putchar(s[(x/d&1)+(y/d&1)*2]);
}
putchar(10);
... | 0 | 61,719,816 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
string alp = "abcdefghijklmnopqrstuvwxyz";
void Yes() {cout << "Yes" << endl;}
void No() {cout << "No" << endl;}
void YES() {cout << "YES" << endl;}
void... | #include<bits/stdc++.h>
#define PI acos(-1.0)
#define eps 1e-67
#define pf printf
#define sf scanf
#define sd(n) scanf("%d",&n)
#define sd2(n1,n2) scanf("%d %d",&n1,&n2)
#define slf(n) scanf("%lf",&n)
#define slf2(n1,n2) scanf("%lf %lf",&n1,&n2)
#define sLf(n1) scanf("%Lf",&n1)
#define sLf2(n1,n2) scanf("%Lf %Lf",&n1,&... | 0 | 85,094,011 |
#include<iostream>
using namespace std;
int main() {
string S; cin >> S;
for (int i = S.size() - 2; i > 0; i -= 2) {
string S_edited = S.substr(0, i);
if (S_edited.substr(0, S_edited.size() / 2) == S_edited.substr(S_edited.size() / 2, S_edited.size() / 2)) {
cout << S_edited.size() <... | #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x) cerr << #x << " = " << (x) << endl;
#de... | 0 | 71,049,327 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define forn(i, n) for(int i = 0; i < (int)n; ++i)
int main()
{
string a, b, c;
cin >> a >> b >> c;
cout << (char)toupper(a[0]) << (char)toupper(b[0]) << (char)toupper(c[0]) << "\n";
return 0;
} | #include <algorithm>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
int X, Y;
const int MOD = 1000000007;
const int MAX = 2100000;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1]... | 0 | 67,055,418 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define ull unsigned long long
#define __ ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
const int maxn = 1e5 + 10;
int n, a[maxn];
set<int> s;
map<int, int> mp;
vector<int> v1, v2;
int main() {
__;
cin >> n;
for (int ... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n,h;cin>>n>>h;
int a[n],b[n];rep(i,n)cin>>a[i]>>b[i];
sort(a,a+n,greater<int>());
sort(b,b+n,greater<int>());
int ans = 0;
int i=0;
while(b[i]>a[0]){
h-... | 0 | 41,199,462 |
#include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define MIN(a) *min_element(all(a))
#define MAX(a) *max_element(all(a))
#define SUM(a) accumulate(all(a), 0LL)
#define REP(i, n) for(int (i)=0; (i)<(n); (i)++)
#define RREP(i, n) for(int (i)=(n)-... | #include <iostream>
using namespace std;
int main(){
int g[1001][1001];
int n,a,b,c;
cin >> n;
for (int i = 0; i < n; ++i)
{
for (int j = 0; j < n; ++j)
{
g[i][j]=0;
}
}
for (int i = 0; i < n; ++i)
{
cin >> a >> b ;
for (int i = 0; i < b; ++i)
{
cin >> c;
g[a-1]... | 0 | 47,711,905 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,D;
cin >> N >> D;
vector<vector<int>> matrix(N, vector<int>(D));
for (int i=0; i<N; i++){
for (int j=0; j<D; j++){
cin >> matrix.at(i).at(j);
}
}
int ans = 0;
int distance_squared = 0;
for (int i=0; i<N-1; i++){
for (int j... | #include<bits/stdc++.h>
typedef long long int ll;
#define ull unsigned long long int
#define lld long double
#define endl "\n"
#define fi first
#define sec second
#define sp setprecision
#define lb lower_bound
#define ub upper_bound
#define For(i, a, b) for(long long int i = (a); i <= (b); i++)
#define Forr(i, a, b)... | 0 | 70,353,380 |
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int64_t i = 0; i < (n); i++)
#define irep(i, n) for (int64_t i = 0; i <= (n); i++)
#define rrep(i, ... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int ans = 0;
for (int c = 1; c < n; c++) {
int x = n - c;
for (int i = 1; i * i <= x; i++) {
if (x % i == 0) {
if (x / i != i)
ans++;
ans++;
}
}
}
cout << ans << endl;
return 0... | 0 | 36,460,180 |
#include <iostream>
#include <string>
#include <math.h>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < n; i++)
int main(){
int N, M;
cin >> N >> M;
vector<int> k(M);
vector<vector<int>> s(M, vector<int>... | #include <iostream>
using namespace std;
int main() {
long long int N, K;
cin >> N >> K;
long long int ans;
if(K==1) {
ans = N*N*N;
} else if(K%2==0) {
ans = N/K;
if(N%K>=K/2) ans++;
ans *= ans*ans;
ans += (N/K)*(N/K)*(N/K);
} else {
ans = (N/K)*(N... | 0 | 64,385,439 |
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#define forn(ii,a,b) for(int ii = (int)a ; ii < (int)b ; ii++ )
#define scan(any) for(auto &i:any) cin>>i;
#define debug(x) cerr << #x << " " << x << " -- \n"
#define I__O ... | #include<bits/stdc++.h>
#define int long long
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define repa(i, s, n) for(int i = s; i < (int)n; i++)
using namespace std;
using ll = long long;
typedef vector<int> vi;
typedef pair<int, int> P;
#define rrep(i,a,b) for(int i=a;i>=b;i--)
signed main(){
string s;
ci... | 0 | 46,474,204 |
#include <iostream>
#include <string>
#include <list>
using namespace std;
void fnLinkedListSet(list<int> &rltnNum)
{
list<int>::iterator itltn;
list<int>::iterator itltEND = rltnNum.end();
string sCmd;
int nMaxCmd, nNum;
cin.tie(0);
ios::sync_with_stdio(false);
cin >> nMaxCmd;
for (int i = 0; i < nMax... | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree < pairs , null_type , greater<pairs>, rb_tree_tag , tree_order_statistics_node_update >
#define ll long long
#define lld long double
#de... | 0 | 93,598,255 |
#define _USE_MATH_DEFINES
#include <math.h>
#include <iostream>
#include <iomanip>
#include <cstdlib>
#include <algorithm>
#include <numeric>
#include <stdio.h>
#include <vector>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
int main() {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int>a(n);
int b=0;
for(int i=0;i<n;i++){
cin>>a.at(i);
b=max(b,a.at(i));
}
int c=0;
int d=0;
for(int i=0;i<n;i++){
if(a.at(i)==b){
c++;
}
else{
d=max(d,a.at(i));
}
}
for(int i=0;i... | 0 | 24,892,263 |
#include <bits/stdc++.h>
#define PI 3.1415926535897932
#define _GLIBCXX_DEBUG
#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);
}
}
int main() {
long long A,B,C,D;
cin>>A>>B>>C>>D;
long long all=B-A+1;
long long su... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
#define VL vector<ll>
#define VS vector<string>
#define VB vecctor<bool>
#define VP vector<pair<ll,ll>>
#define VVL vector<vector<ll>>
#define VVP vector<vector<pair<ll,ll>>>... | 0 | 23,015,449 |
#include<iostream>
using namespace std;
int main() {
int x[10000],a;
for (int i = 1; i <= 10000;i++) {
cin >> x[i];
if (x[i] == 0) {
a = i;
break;
}
}
for (int i = 1; i <= a - 1; i++) {
cout << "Case " << i << ": " << x[i] << endl;
}
return 0;
} | #include<iostream>
#include<algorithm>
using namespace std;
int main(){
int N;
cin>>N;
int a[100030]={0};
int X;
while(N--){
cin>>X;
a[X]++;
a[X-1]++;
a[X+1]++;
}
int max_value=0;
for(int i=0;i<=100000;++i){
if(max_value<a[i])max_value=a[i];
... | 0 | 22,076,099 |
#include <stdio.h>
#define Num 1001
int main () {
char str[Num];
int cou[100]={0};
int i,j;
while (fgets (str,sizeof(str),stdin) != NULL) {
for (i = 0;i < Num;i ++) {
for (j = 0;j < 26;j ++) {
if (str[i] - 'a' - j == 0 || str[i] - 'A' - j == 0) {
... | #include <iostream>
using namespace std;
#define INF 999999999
int n, m;
int t[12][12];
void init(){
for(int i = 0; i < 12; i++){
for(int j = 0; j < 12; j++){
t[i][j] = INF;
}
}
}
void wf(){
for(int k = 0; k < n; k++){
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
if(i =... | 0 | 88,240,113 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.