code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 1 101M |
|---|---|---|---|
#include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define space putchar(' ')
#define enter putchar('\n')
#define eps 1e-10
#define MAXN 200005
using namespace std;
typedef long long int64;
typedef unsigned int u32;
typedef double db;
template... | #include <bits/stdc++.h>
int main() {
long long int N;
std::cin >> N;
std::vector<long long int> A(N + 1);
for (long long int i = 0; i < N + 1; i++) {
std::cin >> A[i];
}
std::vector<long long int> B(N);
for (long long int i = 0; i < N; i++) {
std::cin >> B[i];
}
long... | 0 | 74,510,123 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, x, y;
cin >> n >> m >> x >> y;
int xl[n], yl[m];
for (int i = 0; i < n; i++)
cin >> xl[i];
for (int i = 0; i < m; i++)
cin >> yl[i];
sort(xl, xl+n);
sort(yl, yl+m);
if (xl[n-1]<yl[0] && x<yl[0] && y>xl[n... | #include <bits/stdc++.h>
int main()
{
int a, b, c;
bool ans = false;
std::cin >> a >> b >> c;
for (int i = 1; i <= b; ++i) {
if ((a * i) % b == c) {
ans = true;
}
}
if (ans) {
std::cout << "YES" << std::endl;
} else {
std::cout << "NO" << std::endl... | 0 | 54,892,040 |
#include<bits/stdc++.h>
using namespace std;
inline void print() {
cout << endl;
}
template <typename First, typename... Rest>
void print(const First &first, const Rest &... rest) {
cout << first << ' ';
print(rest...);
}
void solve() {
int N; cin >> N;
vector<long long> A(N+1), B(N);
for (int i... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define debug(s) cout << #s << " = " << s << endl
#define all(v) (v).begin(), (v).end()
#define mem(a,val) memset(a, val, sizeof a)
#define maxn 200010
#define INF 1e... | 0 | 64,953,275 |
#include <iostream>
#include <algorithm>
#include <tuple>
#include <vector>
#include <string>
#include <queue>
#include <cmath>
#include <iomanip>
using namespace std;
int main()
{
int k;
cin >> k;
queue<long long> que;
for(int i = 1; i < 10; i++) que.push(i);
int num = 0;
while(!que.empty()){
... | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main()
{
string str;
cin >> str;
int q;
cin >> q;
for(int i=0; i<q; i++){
string s;
cin >> s;
if(s=="print"){
int a, b;
cin >> a >> b;
for(int j=a; j<=b; j++){
cout << str[j];
}
cout << endl;
}
else if(... | 0 | 86,315,799 |
#include<iostream>
using namespace std;
int main(){
int x;
int y;
int z;
cin >> x >> y>>z;
if (x<y&&y<z){
cout << "Yes\n";
}else{
cout << "No\n";
}
return 0;
} | #include <iostream>
#include <fstream>
#include <iostream>
#include <string>
#include <vector>
#include <math.h>
#include <map>
#include <set>
#include <algorithm>
#include <numeric>
#include <bitset>
using namespace std;
using ll = long long;
constexpr ll INF = 1010000000000000017LL;
#define rep(i, n) for(ll i = 0; i ... | 0 | 94,113,541 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; i++)
#define rep1(i, n) for(int i=1; i<=n; i++)
#define repr(i, n) for(int i=n-1; i>=0; i--)
#define repr1(i, n) for(int i=n; i>=1; i--)
#define all(v) v.begin(),v.end()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<in... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define reps(i, n) for(int i=1, i##_len=(n); i<=i##_len; ++i)
#define rrep(i, n) for(int i=((int)(n)-1); i>=0; --i)
#define rreps(i, n) for(int i=((int)(n)); i>0; --i)
#define all(x) (x).begin(), (x).end()
#define ... | 0 | 9,874,428 |
#include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;
const ll mod=1000000007;
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
string s;
cin>>... | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
using P = pair<int,int>;
int main()
{
... | 0 | 86,982,986 |
#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>
#includ... | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<cstdio>
#include<queue>
#include<deque>
#include<map>
#include<stack>
#include<set>
#include<utility>
using namespace std;
typedef pair<int,int> pii;
typedef long long ll;
typedef pair<int,ll> p;
typedef pair<pii,int> P;
i... | 0 | 79,131,213 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,o,n) for(long long i = o;i<n;i++)
#define oneforall ios::sync_with_stdio(false);cin.tie(0);
#define all(v) (v).begin(),(v).end()
#define ini(...) int __VA_ARGS__; in(__VA_ARGS__)
#define inl(...) long long __VA_ARGS__; in(__VA_ARGS__)
#define ins(...) string _... | #include<bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
string s,t;
cin>>s>>t;
int n = s.size();
int m = t.size();
if(n<m)
{
cout<<"UNRESTORABLE"<<endl;
return 0;
}
bool ans = false;
for(int i=n-m;i>=0;i--)
{
bool found = true;
for(int j... | 0 | 88,798,528 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long k,a,b;
cin >> k >> a >> b;
if(b-a>2){
if(k<=a)cout << k+1 << endl;
else{
cout << b + (b-a)*((k-a-1)/2) + (k-a+1)%2 << endl;
}
}
else{cout << k+1 << endl;}
return 0;
} | #include<iostream>
using namespace std;
int main() {
int m, f, r;
while(cin >> m >> f >> r, m!= -1||f!= -1||r!= -1) {
if(m == -1 || f == -1) cout << 'F';
else if(m + f >= 80) cout << 'A';
else if (m + f >= 65) cout << 'B';
else if (m + f >= 50) cout << 'C';
else if (m + f... | 0 | 60,101,941 |
#include<iostream>
#include<algorithm>
#include<queue>
const int INF = 100000000;
using namespace std;
typedef pair<int, int> P;
char a[1005][1005];
int N, M;
int sx, sy;
int gx, gy;
int d[1005][1005];
int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };
int bfs()
{
queue<P> que;
for (int i = 0; i < N; i++)
for (int... | #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 | 48,691,272 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <cstdio>
#include <numeric>
#include <iomanip>
using namespace std;
using ll = long long;
ll N, K;
vector<ll> A;
vector<ll> B;
int main()
{
cin >> N >> K;
A.resize(N);
B.resize(N+1);
for... | #include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#define vv(a, b, c, d) vector<vector<d> >(a, vector<d>(b, c))
#define vvi vector<vector<int> >
#define vvl vector<vector<l... | 0 | 38,252,508 |
#include <iostream>
#include <map>
using namespace std;
int main(){
int dx[] = {1,0,-1,0,1,1,-1,-1}, dy[] = {0,1,0,-1,1,-1,1,-1};
int H, W, N;
cin >> H >> W >> N;
int a, b;
map<pair<int,int>, int> M;
for(int i = 0; i < N; ++i){
cin >> a >> b;
if(a > 1 && a < H && b > 1 && b < W){
++M[make_pair... | #include <bits/stdc++.h>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define size_of_array(array) (sizeof(array)/sizeof(array[0]))
using ll =long long;
using namespace std;
using Graph=vector<vector<int>>;
using Field=vector<vector<int>>;
int main(){
int n;
cin>>n;
vector<int> a(n);
... | 0 | 54,994,603 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
int main(){
string s;
cin >> s;
int ans1 = 0, ans2 = 0;
rep(i,s.size()){
if(i%2 == 0 && s[i] == '0') ans1++;
else if(i%2 == 1 && s[i] ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string s;
cin >> s;
int n = (int)s.size();
ll ans = 0, cnt = 0;
for (int i = 0; i < n; i++) {
if (s[i] == 'B') {
cnt++;
} els... | 0 | 50,054,961 |
#include <bits/stdc++.h>
using i64 = long long;
int main() {
int n;
scanf("%d", &n);
std::vector<int> a(1 << n);
for (auto &e : a) scanf("%d", &e);
std::vector<std::pair<int, int>> dp(1 << n, std::make_pair(-1, -1));
for (int i = 0; i < (1 << n); i++) {
dp[i].first = i;
}
for (in... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP0(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define RREP0(i, n) for (int i = (n)-1; i >= 0; --i)
#define REP1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define RREP1(i, n) for (int i ... | 0 | 46,504,626 |
#include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const int N = 100010, M = 13;
int n, m;
int a[N];
int p[N];
int find(int x)
{
if (x != p[x]) p[x] = find(p[x]);
return p[x];
}
int main()
{
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; ... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define countof(array) (sizeof(array) / sizeof(array[0]))
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,n,s) for(int i = s; i < (n); ++i)
#define rsrep(i,n,s) for(int i = (n)... | 0 | 89,027,491 |
#include <bits/stdc++.h>
#define LL long long
#define FOR(i,a,b) for(LL i=a; i<=b; i++)
#define FOD(i,a,b) for(LL i=a; i>=b; i--)
#define pa pair<int,int>
#define fi first
#define se second
#define MOD xxx
#define getbit(n,i) ((n>>(i-1))&1)
#define offbit(n,i) ((n^(1<<(i-1))
#define onbit(n,i) (n|(1<<(i-1)))
#define cn... | #include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#define inf 1000000000000000LL
#define F... | 0 | 26,288,071 |
#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++)
#define MOD 1000000007
typedef long long int ll;
typedef vector<int>vi;
typedef pair<int,int>pi;
int main(){
std::ios::sync_with_stdio(false);
cin.tie(0);... | #include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
const int maxn = 1e5 + 5;
int par[maxn], N, sub[maxn];
pair<ll, int> d[maxn];
ll f[maxn];
vector<int> adj[maxn];
int depth[m... | 0 | 60,685,805 |
#include<vector>
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include <iostream>
#include <algorithm>
#include <map>
#include <cmath>
#include<queue>
#include <sstream>
#include <set>
const long long INF = 1000000007;
using namespace std;
typedef long long llong;
int main(){
llong N;
cin >> N;
v... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for(int i=0; i<(a); i++)
typedef long long ll;
int main()
{
int n, k; cin>>n>>k;
vector<ll> a(n, 0);
rep(i, n) cin>>a[i];
ll nin = 1LL<<60;
rep(bits, 1<<(n-1)) {
ll bef = a[0];
ll cost = 0;
int nk = 1;
for (int i=1; i<n; i++) {
... | 0 | 80,964,153 |
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <bitset>
#include <functional>
int main() {
long long n, k, ret = 0;
std::cin >> n >> k;
std::vector<long long> a(n);
std::multiset<long long, std::greater<>> ms;
std::map<long long, bool> m;
for (auto i = 0ll; i < n; i... | #include <iostream>
#include <string>
#include <stdlib.h>
using namespace std;
string s[9]={".,!? ", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"};
int main(){
int n;
string input;
cin >> n;
for(int i=0; i<n; i++){
char output[76] = "";
cin >> input;
char num = '0';
int kaisu = 0;
... | 0 | 43,591,960 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
int w, h , n;
cin >> w >> h >> n;
int minX, minY;
minX = minY = 0;
int maxX = w;
int maxY = h;
for (int i=0; i<n; i++) {
int x, y, a;
cin >> x >> y >> a;
if (a == 1) minX = max(minX, x);
if (a == 2)... | #include <bits/stdc++.h>
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
using ll = long long;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const ll I... | 0 | 59,428,151 |
#include<bits/stdc++.h>
using namespace std;
#define REP(i,s,n) for(int i=s;i<n;++i)
#define rep(i,n) REP(i,0,n)
#define SORT(c) sort((c).begin(),(c).end())
#define IINF INT_MAX
#define LLINF LLONG_MAX
#define DEBUG false
#define MOD 1000000007
typedef long long ll;
typedef pair<int, int> ii;
int main() {
int n;
stri... | #include<iostream>
using std::cout;
using std::cin;
using std::endl;
void check(int m, int f, int r) {
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 >= 5... | 0 | 46,335,750 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<n; i++)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<pair<ll, int>> p(n);
rep(i, n) {
cin >> p[i].first;
p[i].second = i;
}
sort(p.begin(), p.end());
reverse(p.begin(), p.end());
s... | #include <iostream>
#include <iomanip>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <cstdio>
#include <utility>
#include <string>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
using namespace std;
typedef uint64_t u64;
typedef ... | 0 | 32,818,753 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int L;
cin >> L;
printf("%12f\n",(double)L*L*L/27);
return 0;
} | #include<iostream>
#include<cctype>
#include<cstdio>
#include<cstring>
using namespace std;
int main(){
char x[1000];
int sum =0;
while(1) {
scanf("%s",x);
if(strlen(x) == 1 && x[0] == '0') break;
for(int i = 0; i < strlen(x);i++){
sum += x[i] - '0';
}
cou... | 0 | 77,627,673 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int INF = 1 << 29;
const int MOD = 1000000007;
long long calcGcd(long long a, long long b) {
if (a < b) {
int tmp = a;
a = b;
b = tmp;
}
int r = a % b;
while (r != 0) {
... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void){
int n;
cin >> n;
vector<pair<int,int>> r(n),b(n);
for(int i=0;i<n;i++){
int a,c;
cin >> a >> c;
r[i] = {a,c};
}
for(int i=0;i<n;i++){
int a,c;
cin >> a >> c;
b[i] = ... | 0 | 9,208,277 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1 << 30;
const ll LINF = 1LL << 50;
const int NIL = -1;
const int MAX = 10000;
const int mod = 1000000007;
const double pi = 3.141592653589;
int main(){
int N, K;
cin >> N >> K;
vector<int> d(N);
... | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#include<algorithm>
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
using namespace std;
using ll = long lon... | 0 | 51,591,252 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<stack>
#include<queue>
#include<list>
#include<set>
#include<cmath>
#define REP(i,n) for(int (i) = 0;(i) < (n);(i)++)
using namespace std;
typedef pair<double,double> P;
int n;
void Koch(P p1,P p2,int n1){
P s,t,u;
s.first = (p1.first... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmi... | 0 | 77,816,868 |
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>
#define mp ... | #include<iostream>
#include<vector>
std::vector<int> vec;
int x;
int n=1;
int main(){
do{
std::cin>>x;
vec.push_back(x);
}while(x!=0);
for(auto l:vec){
if(l!=0)std::cout<<"Case "<<n<<": "<<l<<std::endl;
++n;
}
return 0;
} | 0 | 88,938,872 |
#include <bits/stdc++.h>
#define long long long
using namespace std;
const int N = 1e3+5;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const char dir[4] = {'L', 'D', 'R', 'U'};
int n, X[N], Y[N];
int main() {
scanf("%d", &n);
for(int i = 1; i <= n; i++) scanf("%d %d", X + i, Y + i);
bool chk = (X... | #include <iostream>
using namespace std;
class Dice{
int _num[6];
public:
void set(int num[6]){
for(int i=0;i<6;i++){
_num[i] = num[i];
}
}
void printTop(){
cout << _num[0] << endl;
}
void printRight(){
cout << _num[2] << endl;
}
void N(){
... | 0 | 22,562,182 |
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
const int MAXN=205;
int n;
int a[MAXN];
int ans;
int main()
{
cin>>n;
for(int i=1;i<=2*n;i++) scanf("%d",&a[i]);
sort(a+1,a+2*n+1);
for(int i=1;i<=2*n;i+=2) ans+=a[i];
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,o,n) for(long long i = o;i<n;i++)
#define oneforall ios::sync_with_stdio(false);cin.tie(0);
#define all(v) (v).begin(),(v).end()
#define ini(...) int __VA_ARGS__; in(__VA_ARGS__)
#define inl(...) long long __VA_ARGS__; in(__VA_ARGS__)
#define ins(...) string _... | 0 | 43,903,369 |
#include <bits/stdc++.h>
#include <algorithm>
#define rep(i, n) for (int i=0; i<n; ++i)
#define all(obj) (obj).begin(),(obj).end()
using namespace std;
typedef long long ll;
long long GCD(long long x, long long y) { return y ? GCD(y, x%y) : x; }
int main(){
int N;
cin >> N;
int ans = 0;
for(int i=1; i<=... | #include "bits/stdc++.h"
#define int long long
#define endl '\n'
using namespace std;
typedef long long ll;
#define db(x) cerr << #x << ": " << x << '\n';
#define read(a) int a; cin >> a;
#define readb(a, b) int a, b; cin >> a >> b;
#define readc(a, b, c) int a, b, c; cin >> a >> b >> c;
#define readarr(a, n) int a[(n)... | 0 | 93,421,653 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <cmath>
#include <iomanip>
#include <functional>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, n) for (int i = 1; i <... | #include<iostream>
#include<string>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
using namespace std;
int main(){
int n;
while(cin>>n,n){
string s;
int ans=0;
bool pre=false,r=false,l=false;
rep(i,n){
cin>>s;
if(s=="lu")l=true;
if(s=="ru")r=true;
if(s=="ld")l=false;
if(... | 0 | 3,175,985 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a=0,b=0,c=0;
cin>>a>>b>>c;
int d=a-b;
if(d<c){
cout<<c-d<<endl;
}
else if(d>=c){
cout<<'0'<<endl;
}
} | #include <stdio.h>
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string... | 0 | 55,413,045 |
#include <bits/stdc++.h>
#define mod 1000000007
#define INF 1001001001
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;
#define pb push_back
#define eb emplace_back
#define x first
#define y second
#define all(c) (c).begin(), (c).end()
#define sz(x) ((int)(x).size(... | 0 | 75,883,431 |
#include <cstdio>
#include <cmath>
#include <complex>
using namespace std;
#define EPS 10e-8
#define PI 3.1415926535
typedef complex<double> Point;
int n;
Point ps[4];
int main() {
scanf("%d", &n);
while (n--) {
for (int i=0; i<4; i++) {
double x, y;
scanf("%lf%lf", &x, &y);
ps[i] = Point(x, y... | #include<bits/stdc++.h>
#define ll long long int
using namespace std;
int main(){
int n;
cin>>n;
vector<int>a(n);
int sum=0;
for(int i=0;i<n;i++){
cin>>a[i];
sum+=a[i];
}
if(n==1){
cout<<0<<endl;
return 0;
}
sum=(sum)/n;
int ans1=0,ans2=0,ans3=0;
for(int i=0;i<n;i++){
int temp=abs(a[i]-sum);
ans1... | 0 | 5,859,539 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define rep2(i,n) for(int i=0;i<=n;i++)
#define repr(i,a,n) for(int i=a;i<n;i++)
#define all(a) a.begin(),a.end()
#define P pair<long long,long long>
#... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=int(a);i<int(b);i++)
typedef long long ll;
int main(){
ll n;cin>>n;
char c[333][333];
rep(i,0,n)rep(j,0,n)cin>>c[i][j];
ll an=0,ok=1;
rep(i,0,n){
ok=1;
rep(j,0,n){
rep(k,0,n){
if(j=... | 0 | 66,312,009 |
#include<bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i,n) for(int i=0;i<n;++i)
#define all(v) v.begin(), v.end()
typedef long long int ll;
typedef unsigned long long ull;
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
template... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#includ... | 0 | 71,833,596 |
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pii pair<int, int>
#define pll pair<long long , long long>
#define pb push_back
#define ll long long
#define ld long double
#define precision(x,d) cout<<fixed<<setprecision(d)<<x
#define fill(a,b) memset((a),(b),sizeof((a)))
#define... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define INF ((int)(1e17))
#define EPS 1e6
signed main(){
cout<<fixed<<setprecision(6);
int N;
int sum = 0;
vector<int> t, v, maxs, maxs2;
int V = 0, bV = 0;
double ans = 0;
cin>>N;
t.resize(N+10,0);
v.resize(N+10,0);
maxs.resize(N*2... | 0 | 12,881,235 |
#include <bits/stdc++.h>
#define rep(l, r) for (int i = (l); i < (r); i++)
typedef long long ll;
using namespace std;
int main() {
char c;
cin >> c;
switch (c) {
case 'a':
case 'i':
case 'u':
case 'e':
case 'o':
cout << "vowel" << endl;
break;
... | #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define pi 3.141592653589793238
#define int long long
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>... | 0 | 83,928,578 |
#include <cstdio>
#include <algorithm>
using namespace std;
#define chmin(a,b) a=min(a,b)
#define chmax(a,b) a=max(a,b)
#define rep(i,x) for(int i=0;i<(x);++i)
const int inf = 1e9;
int d[10][10];
bool found[10];
int N;
void wf()
{
rep(k, 10) rep(i, 10) rep(j, 10) {
chmin(d[i][j], d[i][k] + d[j][k]);
}
}
int main()
... | #include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<vector>
#include<map>
#include<numeric>
#include<queue>
#include<string>
#include<sstream>
using namespace std;
int main(void) {
string left = "qwertasdfgzxcvb";
string s;
while(cin >> s){
if( s[0] == '#' ) brea... | 0 | 93,694,384 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define MOD 1000000007
using ll = long long;
typedef pair<int, int> P;
int main(){
int n;
cin>>n;
vector<int> dat(n+1);
rep(i,n){
cin>>dat[i];
}
sort(dat.begin(),dat.end());
reverse(dat.begi... | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <string>
#include <math.h>
#include <stack>
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define repr(i, n) for(int i = n - 1; i >= 0; i--)
using namespace std;
using ll = long long int;
using p = pair<int,... | 0 | 70,118,143 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
const ll MOD=1000000007;
int main(void){
cin.tie(0);
ios::sync_with_stdio(0);
int n,m,k;
cin>>n>>m>>k;
for(int i=0;i<=n;i++){
for(int j=0;j<=m;j++){
if((n-i)*j+i*(m-j)==k){
... | #include<iostream>
#include<string>
#include<vector>
using namespace std;
vector<pair<int,int> > vpii(80);
string num;
void print(int s,int f){
switch(f-48){
case 1:switch(s%5){
case 1:cout<<'.';break; case 2:cout<<',';break; case 3:cout<<'!';break;case 4:cout<<'?';break; case 0:cout<<" ";break;}break;
case 2... | 0 | 51,296,654 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
int A;
cin >> N >> A;
if (N % 500 == 0){
cout << "Yes" << endl;
}else if (N % 500 != 0 && A > N % 500){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ll n;
cin >> n;
vector<ll> a(n);
vector<ll> b(n);
ll sum = 0;
ll m = 1e10;
bool flag = true;
for(int i = 0; i < n; i++)
{
ll a, b;
cin >> a >> b;
sum += a;
if(a > b)
... | 0 | 61,630,954 |
#include <iostream>
using namespace std;
#include<vector>
int main()
{
int n,k;
cin>>n>>k;
const int INF=1e9+7;
vector<long long int>h(n);
for(int i=0;i<n;i++){
cin>>h[i];}
vector<long long int> s(n,INF);
s[0]=0;
for(long long int i=0;i<n;i++)
{
for(long long int j=i+1;j<=i+k;j++)
{
... | #include <iostream>
using namespace std;
int main()
{
int n;
double x[4], y[4], a, b;
cin >> n;
while(n--){
for(int i = 0; i < 4; i++){
cin >> x[i] >> y[i];
}
if(x[0]-x[1] == 0){
if(x[2]-x[3] == 0){
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} else {
a = (y[0]-y[1])/(x[0]... | 0 | 1,966,452 |
#include<stdio.h>
#include<string.h>
int main(){
char m[1000],b[2],g[1000][1000],c[2]="-";
int n,a,i,j,d,f=0;
while(1){
scanf("%s",m);
if(strcmp(m,c)==0){
break;
}
int e=strlen(m);
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a);
for(j=0;j<a;j++){
b[0]=m[0];
d=1;... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define LLMAX (1ll << 60) - 1
#define INTMAX (1 << 30) - 1
#define MOD 1000000007
#define NMAX 1000*100+1
#define numberOfSetBits(S) __builtin_popcount(S)
#define MSET(x,y) memset(x,y,sizeof(x))
#define gcd(a,b) __gcd(a,b)
#define all(x) x.begin(),x.... | 0 | 69,904,476 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x,n,t,ans;
cin >> n >> x >> t;
ans = (n+x-1)/x;
cout << ans *t << endl;
} | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>... | 0 | 9,104,364 |
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#include <stdlib.h>
#include <algorithm>
#define L 1
#define A 0
using namespace std;
int main(void)
{
int n;
string s,a;
int i1;
int max;
int count;
while(1){
vector<int> v;
cin >> n;
if (n == 0) break;
vector< pair<string,int> > t;... | #include <bits/stdc++.h>
using namespace std;
int main(void)
{
int d;
cin >> d;
string ans = "Christmas";
if(d < 25)
ans += " Eve";
if (d < 24)
ans += " Eve";
if (d < 23)
ans += " Eve";
cout << ans << endl;
} | 0 | 94,401,217 |
#include <iostream>
#include <vector>
#include <limits>
using namespace std;
int maximum_sub_sequense(vector<int> &s)
{
int max = numeric_limits<int>::min();
for (auto i = s.begin(); i != s.end(); i++) {
int sum = 0;
for (auto j = i; j != s.end(); j++) {
sum += *j;
if (su... | #include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
#include <cassert>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
in... | 0 | 15,447,646 |
#include<iostream>
using namespace std;
long long fac(long long x) {
if (x == 0ll)
{
return 1ll;
}
else
{
return x*fac(x - 1ll);
}
}
int main()
{
long long n;
cin >> n;
cout << fac(n) << endl;
} | #include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <cmath>
#include <map>
#include <climits>
#include <cassert>
#include <algorithm>
#include <utility>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
using VI = vector<long long int>;
using VVI = vect... | 0 | 5,364,008 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int , int> P2;
typedef pair<pair<int , int> , int> P3;
typedef pair<pair<int , int> , pair<int , int> > P4;
#define PB(a) push_back(a)
#define MP(a , b) make_pair((a) , (b))
#define M3P(a , b , c) make_pair(make_pair((a) , (b)) , (c))
#def... | #include <iostream>
#include <algorithm>
#define N 10000
using namespace std;
struct s{
int d;
int p;
int dcnt;
};
int main(){
int n,m,i,j,flag,kitaiti;
struct s data[N];
while(1){
flag=0;
kitaiti=0;
cin >> n >> m;
if(n==0&&m==0) break;
for(i=0;i<n;i++){
cin >> data[i].d >> data[i]... | 0 | 2,564,989 |
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef vector<vector<int> > vvi;
typedef vector<pair<int, int> > vpii;
typedef pair<int, int> pii;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef vector<ll> vll;
#define INF 0x3f3f3f... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template<class T> using vc = vector<T>;
template<class T> using vvc = vector<vector<T>>;
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define... | 0 | 95,651,346 |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(int)(n); i<i##_len; i++)
#define reps(i,n) for(int i=1 , i##_len=(int)(n);i<=i##_len;i++)
#define rrep(i,n) for(int i=((int)(n)-1);i>=0;i--)
#define rreps(i,n) for(int i=((int)(n));i>0;i--)
#define repi(i,x) for(a... | #include <bits/stdc++.h>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i)
#define pb push_back
#define eb emplace_back
#define all(x) x.b... | 0 | 50,822,258 |
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <map>
#include <vector>
#include <stack>
#include <queue>
#include <tuple>
#include <cassert>
#include <functional>
#include <set>
#include <deque>
#include <list>
using namespace std;
typedef long long ll;
int dx[4] = {0,0,1,-1};
int ... | #include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
#include <functional>
#include <cmath>
#include <set>
#include <queue>
#include <deque>
#include <vector>
#include <climits>
#include <sstream>
#include <iomanip>
#include <map>
#include <stack>
using namespace std;
typedef unsigned long long... | 0 | 14,151,949 |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main()
{
int n;
string s;
cin >> n >> s;
int ans = 1;
for (int i = 1; i < n; i++)
{
if (s[i] != s[i - 1])
{
ans++;
}
}
cout << ans << "\n";
} | #include <bits/stdc++.h>
#define FOR(i, a, n) for(ll i = (ll)a; i < (ll)n; i++)
#define rep(i, n) FOR(i, 0, n)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
constexpr int Mod = 998244353;
constexpr int mod = 1e9 + 7;
constexpr ll inf = 1LL << 60;
template <typename T> constexpr bool c... | 0 | 88,201,196 |
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#define emplace_back push_back
#define pb push_back
using namespace std;
typedef long long ll;
typedef unsigned long long ... | #include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define all(x) (x).begin(),(x).end()
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { ... | 0 | 51,736,897 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lc... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
vo... | 0 | 39,839,256 |
#include <cstdio>
#include <utility>
#include <typeinfo>
#include <cmath>
#include <numeric>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <map>
#include <stack>
#include <queue>
#include <string>
#include <vector>
#include <tuple>
#define REP(i,n) for(int i=0;i<n;i++)
typedef long long int ll;
u... | #include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll mod = 1e9 + 7;
int main(){
ll W, H;
cin >> W >> H;
ll x, y;
cin >> x >> y;
if(W%2 == 0 && W/2 == x && H%2 == 0 && H/2 == y){
cout << W*H/2 << ".000000000" << " " << "1" << endl;
return 0;
}
if(W%2 == ... | 0 | 5,362,417 |
#include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define all(x) (x).begin(),(x).end()
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF= 1LL << 60;
#define REP(i,n) for(ll i=0; i<n; i++)
#define FOR(i,a,n) for(ll i=a; i<n; i++)
struct c{
int num,sum;
};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> A(n);
ve... | 0 | 5,277,922 |
#include "bits/stdc++.h"
using namespace std;
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pair<int, int>; using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
#defin... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define MIN(a, b) ((a) > (b) ? (b) : (a))
#define MAX(a, b) ((a) < (b) ? (b) : (a))
const long long INF = 1LL << 60;
typedef unsigned long long ll;
const long long MOD = 1000000000 + 7;
int main()
{
int n;
cin >> ... | 0 | 54,413,017 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define repi(n) for (long long i = 0; i < (n); ++i)
#define repj(n) for (long long j = 0; j < (n); ++j)
#define repk(n) for (long long k = 0; k < (n); ++k)
#define rep(i, a, b) for (auto i = (a); i < (b); ++i)
#define it... | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
constexpr int DEBUG = 0;
struct Edge {
const int from, to;
Edge(int from, int to) : from(from), to(to) {}
};
vector<vector<Edge>> ReadUndirectedGraph(
int n, int m, bool is_one_indexed=false) {
vector<vector<Edge>> graph(n);
for (int i =... | 0 | 97,906,466 |
#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... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fast_in_out ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int main()
{
fast_in_out;
int n;
cin >> n;
set <int> v;
for(int i = 0; i < n; i++)
{
int x;
cin >> x;
v.insert(x);
}
if(... | 0 | 89,707,054 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define ll long long int
int main(){
double T,X;
cin>>T>>X;
cout<<T/X;
return 0;
} | #include <bits/stdc++.h>
#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 repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#d... | 0 | 46,069,956 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Yes \
cout << "Yes" << endl; \
return 0;
#define No \
cout << "No" << endl; \
return 0;
using namespace std;
using ll = long long;
const int INF = 1001001001;
const int MOD = 1000000007;
t... | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<cstdio>
#include<queue>
using namespace std;
typedef pair<int,int> ii;
typedef long long ll;
const int INF=1e9;
ll gcd(ll x,ll y){
if(y==0) return 0;
return gcd(y,x%y);
}
int main(){
int x,y;cin>>x>>y;
int ... | 0 | 6,309,862 |
#include "bits/stdc++.h"
#pragma warning(disable:4996)
using namespace std;
int main() {
int a;
map<int, int>mp;
while (cin >> a) {
mp[a]++;
}
int amax = 0;
vector<int>anss;
for (auto m : mp) {
if (m.second > amax) {
anss.clear();
amax = m.second;
}
if (m.second == amax) {
anss.push_back(m.first... | #include<bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(long long i=(l);i<(r);++i)
#define REP(i,n) FOR(i,0,n)
#define REPS(i,n) FOR(i,1,n+1)
#define RFOR(i,l,r) for(long long i=(l);i>=(r);--i)
#define RREP(i,n) RFOR(i,n-1,0)
#define RREPS(i,n) RFOR(i,n,1)
#define int long long
#define mp make_pair
#define ... | 0 | 97,032,598 |
#include <iostream>
#include <cstring>
using namespace std;
struct edge{
int node;
edge *next;
}nodes[105];
int n,matrix[105][105];
int main()
{
memset(matrix,0,sizeof(matrix));
cin>>n;
int i,j;
for(i=1;i<=n;i++){
int ii,n_i;
cin>>ii>>n_i;
for(j=0;j<n_i;j++){
... | #include <bits/stdc++.h>
#include <iterator>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <math.h>
using namespace std;
#define vi vector<int>
#define vvi vector<vector<int> >
#define vl vector<long long>
#define vc vector<char>
#define vvc vector<vector<char> >
#define vpi vector<pair<int,int>... | 0 | 88,278,231 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
signed main()
{
char a,b;
cin >> a >> b;
cout << (a==b ? 'H' : 'D');
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef long double ld;
typedef set<int>::iterator sit;
typedef map<int, int>::iterator mit;
typedef vector<int>::iterator vit;
const int INF = 1e9 + 7;
const int MOD = 1e9 + 7;... | 0 | 73,651,026 |
#include<iostream>
#include<stdio.h>
#include<algorithm>
using namespace std;
int main(void)
{
int z=-1,n,i,j[255],o,maxo=-100000,s[5000]={0};
scanf("%d",&n);
while(n!=0){
o=0;
z++;
for(i=0;i<n;i++){
scanf("%d",&s[i]);
}
for(i=1;i<n;i++){
if(s[i]<s[i-1]+s[i]){
s[i]=s[i-1]+s[i];
}
}
for(i=0... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<vector<ll>> VV;
typedef vector<vector<int>> VVi;
#define REP(i, a, b) for(ll i=(a); i<(b); i++)
#define PER(i, ... | 0 | 64,779,760 |
# include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define pii pair<int,int>
typedef long long ll;
int cnt1,cnt2;
vector<int>letak;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
string s;
cin>>s;
... | #include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>... | 0 | 25,829,837 |
#include <iostream>
using namespace std;
int main(void){
int d;
while(cin >> d){
int COUNT = 0;
for (int i = d; 600 > i; i = i + d){
int j = i * i * d;
COUNT = COUNT + j;
}
cout << COUNT << endl;
}
return 0;
} | #include<cstdio>
using namespace std;
int n, a, b, p;
int ans[1001010];
int x, y, r;
int cal(int x, int y){
return (x+y-1) / y;
}
int main(){
scanf("%d%d%d", &n, &a, &b);
if(a == 1 && b != n){
printf("-1");
return 0;
}
if(b == 1 && a != n){
printf("-1");
return 0;
... | 0 | 37,252,243 |
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int INF = (1LL << 30) - 1;
int MOD = 1e9+7;
main(){
ll H,W,N;
cin >> H >> W >> N;
map<P,int> mp;
rep(i,0,N){
int a,b;
cin >> a >> b;
a--,b... | #include <bits/stdc++.h>
using namespace std;
int main(){
long long a, b, c; cin >> a >> b >> c;
long long add = a%b;
if(add == 0){
if(add == c)
cout<<"YES"<<endl;
else cout<<"NO"<<endl;
return 0;
}
for(long long i=add; i<=10000; i+=add)
{
if(i%b == c%... | 0 | 88,085,230 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int k;
cin >> k;
string arr;
cin >> arr;
if(k < arr.length())
{
for(int i=0; i<k; i++)
cout << arr[i];
cout << "...";
}
else
{
cout << arr;
}
} | #include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++... | 0 | 15,357,382 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long i,j,r,g,b,k;
cin>>r>>g>>b;
cin>>k;
int k1=0;
while(g<=r)
{
g*=2;
k1++;
}
if(k1>k)
{
cout<<"No";
return 0;
}
while(b<=g)
{
b*=2;
k1++;
}
if(k1>k)
{
cout<<"No";
return 0;
}
cout<<"Yes";
} | #include <bits/stdc++.h>
#define all(v) (v).begin(), (v).end()
typedef long long int lint;
using namespace std;
int main() {
int n;
cin >> n;
vector<pair<int, int>> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i].first;
a[i].second = i % 2;
}
sort(all(a));
int ans = 0;
fo... | 0 | 16,771,755 |
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define f(i,x,n) for(int i=x;i<n;i++)
#define all(c) c.begin(),c.end()
#define int ll
#define print(x) cerr << (#x) << "is "<< x << "\n"
using ll = long long;
using pii = pair<int,int>;
const int MOD... | #include <numeric>
#include <iostream>
#include <array>
#include <string>
#include <vector>
#include <cassert>
#include <algorithm>
#include <math.h>
#include <set>
#include <map>
#include <utility>
#include <deque>
#include <queue>
using namespace std;
#define ll long long int
#define rep(i, n) for(ll i = 0; i < n; i... | 0 | 3,201,359 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include <functional>
#include <set>
#include <map>
#include <queue>
#include <cmath>
#include <stack>
using namespace std;
int main() {
string s[5];
cin >> s[0] >> s[1] >> s[2];
cout << (char)(s[0][0] + 'A' - 'a') << (char)(s... | #include <bits/stdc++.h>
using namespace std;
int main() {
while(1) {
int H,W;
cin >> H >> W;
if(H == 0 && W == 0) break;
for(int a = 0; a < W; a++) {
printf("#");
}
printf("\n");
for(int b=0+1;b<H-1; b++){
printf("#");
for(int c=0+1;c<W-1;c++){
printf(".");
... | 0 | 91,921,895 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
class union_find{
int n;
vector<int> p;
public:
union_find(int n):n(n),p(n,-1){}
int find(int u){ return p[u]<0?u:p[u]=find(p[u]); }
void unite(int u,int v){
u=find(u); v=find(v);
if(u!=v){
if(p[v]<p[u]) swap(u,v);
p[u]... | #pragma GCC optimize("O3")
#define _CRT_SECURE_NO_WARNINGS
#define _CRT_DISABLE_PERFCRIT_LOCKS
#define POPCNTI(a) __builtin_popcount(a)
#define fs first
#define sc second
#include <bits/stdc++.h>
using namespace std;
#define error(args...) \
{ \
c... | 0 | 62,180,683 |
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
#define FOR(i,m,n) for(ll i=(m); (i)<(ll)(n); ++(i))
#define REP(i,n) FOR(i,0,n)
#define MAX 10000+1
void countingSort(const ll* const a, ll* const b, ll* const c, const ll k, const ll n){
REP(i,k) c[i] = 0;
REP(i,n) ++c[a[i]];
FOR... | #include <iostream>
#include <cstdlib>
#include <queue>
#include <cstring>
using namespace std;
typedef long long ll;
const int N=500010;
char c[N];
int ru[N],ans[N],hed[N],ver[N],nex[N],tot;
ll sum;
queue<int> q;
void add(int x,int y)
{
tot++;
ver[tot]=y;
nex[tot]=hed[x];
hed[x]=tot;
}
int main()
{
int i,x,y;
... | 0 | 9,216,173 |
#include <iostream>
using namespace std;
int main(){
string S;cin >> S;
string R = S.substr(0,4);
string T = S.substr(4,8);
cout << R << " " << T << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
template <class T>
using v = vector<T>;
template <class T>
using vv = v<v<T>>;
#define ALL(c) (c).begin(), (c).end()
using Graph = vv<int>;
v<bool> seen;
int dfs(const Graph &G, int v)
{
seen[v] = true;
bool all = tr... | 0 | 75,538,069 |
#include<bits/stdc++.h>
using namespace std;
#define FASTIO ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#define ll long long
#define pb push_back
#define mp make_pair
#define pii pair<ll,ll>
#define F first
#define S second
#define ld long double
#define rep(i,a,n) for (ll i= (a) ; i < (n); ++i)
#define ... | #include<bits/stdc++.h>
using namespace std;
int main()
{
string a,b;
cin>>a>>b;
int flag=0;
for(int i=0; i<a.length(); i++)
{
if(a[i]==b[a.length()-1-i])
continue;
else
flag=1;
}
if(flag==0)
cout<<"YES";
else
cout<<"NO";
return... | 0 | 4,097,623 |
#include <bits/stdc++.h>
using namespace std;
vector<int> levelup(vector<int> v, int N){
v[N-1]+=1;
int ind = N-1;
int j=N-1;
for(j=N-1;j>=1;j--){
if(v[j]>1){
v[j-1]+=1;
v[j]=0;
}
}
return v;
}
int main() {
int N,M;
cin >> N >> M;
vector<int> k... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define fo(a,b) for(int a=0;a<b;a++)
#define Sort(a) sort(a.begin(),a.end())
#define rev(a) reverse(a.begin(),a.end())
#define fi first
#define se second
#define co(a) cout<<a<<endl
#define sz size()
#define bgn begin()
#define en end()
#define pb(a) pu... | 0 | 93,952,728 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
vector<int> a(130, 0);
for(int i=0; i<s.size(); ++i) ++a[s[i]];
for(int i=97; i<=122; ++i){
if(!a[i]) { cout << char(i) << endl; return 0; }
}
cout << "None" << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define forn(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(),v.rend()
#define pb push_back
#define sz(a) ... | 0 | 22,237,806 |
#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(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define debug(var) do{cout << #var << " : "; view(var);}while(0)
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;ret... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double pi=3.141592653589793;
typedef unsigned long long ull;
typedef long double ldouble;
const ll INF=1e18;
#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++)
template<class T> inline bool ... | 0 | 77,927,131 |
#include <stdio.h>
int main(){
char s[1001];
char r,c;
int i,v=0,j,h;
while(1){
scanf("%s",s);
if(s[0]=='0') break;
else{
for(i=0;s[i]!='\0';i++){
v=v+s[i]-'0';
}
printf("%d\n",v);
v=0;
}
}
return 0;
} | #include <iostream>
#include <cmath>
int n;
int k;
int dp[100200];
int h[100001];
int main() {
std::cin >> n >> k;
for (int i = 0; i < n; i++) {
dp[i] = 2000000000;
std::cin >> h[i];
}
dp[0] = 0;
for (int i = 0; i < n - 1; i++) {
for (int j = 1; j <= k; j++) {
if (dp[i] + abs(h[i + j] - h[i]) < dp[i + j])... | 0 | 98,119,403 |
#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define sz(x) ((int)(x).size())
#define fi first
#define sec second
#define all(x) (x).begin(),(x)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int s;
cin>>s;
map<int,int> mp;
int tmp =1,ans;
mp[s]=tmp;
while(true){
tmp++;
if(s%2==0){
s/=2;
if(mp.count(s)){
ans=tmp;
break;
}
... | 0 | 4,853,300 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using mti = vector<vector<int>>;
using vl = vector<ll>;
using mtl = 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;
int main(){
int h,w;
cin >> h >> w;
vector<vector<char>>a(h,vector<char>(w));
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
cin >> a.at(i).at(j);
}
}
vector<vector<int>>cost(h,vector<int>(w));
cost.at(0).at(0)=(a.at(0).at(0)=='#');
for(int i=1;i<w... | 0 | 68,636,425 |
#pragma GCC optimize("Ofast")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("fast-math")
#pragma GCC target("sse,sse2,sse3,ssse3,popcnt,abm,mmx,tune=native")
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <unordere... | #include <bits/stdc++.h>
#define all(x) (x).begin() , (x).end()
#define rall(x) (x).rbegin() , (x).rend()
using namespace std;
int main(){
int x ; cin >> x;
int ans = 0;
if(x >= 400 && x <= 599)ans = 8;
if(x >= 600 && x <= 799)ans = 7;
if(x >= 800 && x <= 999)ans = 6;
if(x >= 1000 && x <= 1199)ans = 5;
if(x >= 1... | 0 | 37,556,370 |
#include <iostream>
#include <cstdio>
#include <cctype>
#include <cstdlib>
#include <string>
#include <algorithm>
using namespace std;
int main(void){
string taro,hanako;
int tp=0,hp=0;
int turn;
cin>>turn;
for(int i=0;i<turn;i++){
cin>>taro>>hanako;
for(int j=0;j<taro.size();j++){
if(isupper(taro[j]))
... | #include <bits/stdc++.h>
#include <string>
#include <cstring>
#include <algorithm>
#include <math.h>
#include <map>
#include <bitset>
#include <cmath>
#include <set>
#include <utility>
#define INF 1000000000000
#define MOD 1000000007
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)... | 0 | 21,990,504 |
#include <bits/stdc++.h>
using namespace std;
#define point pair<int ,int>
#define x first
#define y second
int n;
vector <point> vs;
double ang(point p){
if(p.x >= 0 && p.y >= 0 || p.x <= 0 && p.y >= 0)
return acos(p.x/sqrt(1LL*p.x*p.x + 1LL*p.y*p.y));
return 7-acos(p.x/sqrt(1LL*p.x*p.x + 1LL*p.y*p.y))... | #include<iostream>
using namespace std;
int main(){
int a,b,c;
int flag=0;
cin>>a>>b>>c;
if(a<b){
if(b<c){
flag=1;
}
}
if(flag){
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<endl;
}
return 0;
} | 0 | 8,422,836 |
#include<bits/stdc++.h>
using namespace std;
long long n,i,a,b;
int gcd(int a, int b)
{
if (a == 0)
return b;
return gcd(b % a, a);
}
int lcm(int a, int b)
{
return (a*b)/gcd(a, b);
}
int main()
{
cin>>a>>b;
if(gcd(a,b)==1)
cout<<a*b<<endl;
else
cout<<lcm(a,b);
} | #include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
int a[n];
int s = 0;
for (int i=0; i<n; i++){
cin >> a[i];
s += a[i];
}
int ans = 0;
if (s % n == 0) {
int x = s/n;
for (int i: a){
ans += (x - i)*(x - i);
... | 0 | 31,555,308 |
#include <iostream>
#include <string>
#include <cstring>
#include <vector>
#include <algorithm>
#include <set>
#include <stack>
#include <deque>
#include <cmath>
#include <map>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; i++)
template<typename T1,typename T2> inline void chmin(T1 ... | #include <utility>
#include <iostream>
#include <algorithm>
using namespace std;
int v,A[100][100],u,k,w;
int main(){
cin >> v ;
for (int i=0; i<v; ++i){
cin >> u >> k;
for(int j=0; j<k; ++j){
cin >> w;
A[u-1][w-1] = 1;
}
}
for (int i=0; i<v; ++i){
... | 0 | 95,234,015 |
#include <iostream>
#include <vector>
int main()
{
int n, t;
std::cin >> n >> t;
std::vector<int> arr(n);
for (int i = 0; i < n; ++i)
{
int tmp;
std::cin >> tmp;
arr[i] = tmp;
}
int64_t sum = 0;
for (int i = 0; i < n; ++i)
{
if (i != n - 1)
{
... | #include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
#define MAX 1000
t... | 0 | 49,681,591 |
#include <iostream>
#include<cstdio>
#include<string>
#include<stdio.h>
using namespace std;
int main() {
int count[300] = {0};
char word;
while ((word = getchar()) !=EOF) {
count[word]++;
}
for (int i = 97; i <= 122; i++)printf("%c : %d\n", i, count[i] + count[i - 32]);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
int main(){
int N;
cin >> N;
vector<int> V1(100010), V2(100010);
rep(i, N/2){
int tmp1, tmp2;
cin >> tmp1... | 0 | 68,976,786 |
#include<bits/stdc++.h>
#define MOD 1000000007
#define IO ios_base::sync_with_stdio(false);cin.tie(NULL);
#define forf(i,a,b) for(i=a;i<b;i++)
#define forr(i,a,b) for(i=a;i>b;i--)
#define mp make_pair
#define f first
#define s second
#define pb(x) push_back(x)
typedef long long int ll;
typedef std::vector<ll> vi;
#de... | #include <iostream>
#include <string>
#include <queue>
#include <math.h>
#include <vector>
#include <algorithm>
using namespace std;
#define ll long long
int main(){
int n;
cin >> n;
int cnt = 0;
int building[12][10] = {{0}};
int b, f, r, v;
int left, right = 0;
for(int i=0; i<n; i++){
... | 0 | 75,360,291 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define loop(i, a, n) for(int i = (a); i < (n); i++)
#ifdef _DEBUG
#define dd(x) cout << #x << " : " << x << endl
#else
#define dd(x)
#endif
using namespace std;
using ll = int64_t;
int main(){
int x, y; cin >> x >> y;
rep(i, x+1) {
... | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
struct stu
{
int x,y;
};
stu vp[90005];
int k[90005];
int main()
{
int h,w,d,num;
scanf("%d %d %d",&h,&w,&d);
for(int i=1;i<=h;i++)
{
for(int j=1;j<=w;j++)
{
scanf("%d",&num);
vp[num].x=i;
... | 0 | 79,186,680 |
#include "iostream"
#include "vector"
#include "string"
#include "algorithm"
#include "math.h"
#include "cstring"
#include "stack"
#include "queue"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<vector<ll> > mat;
int main()
{
int n, k;
cin >> n >> k;
... | #include<bits/stdc++.h>
#define int long long
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define sz(a) a.size()
#define re return
#define MP make_pair
#define pb push_back
#define pii pair<int,int>
#define se second
#define fi first
using namespace std;
int cnt[26];
signed main(){
ios_base::... | 0 | 95,183,979 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, pii> pipii;
typedef pair<pii, pii> piipii;
#define mp make_pair
#define fi first
#define se second
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()
#define eb emplace_back
string s[55];
i... | #include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
#define V vector
#define P pair
typedef long long ll;
const int INT_INF = 1e9;
const ll INF = 1LL << 30;
int main() {
ll n; cin >> n;
map<ll, ll, greater<ll>> m;
for(int i = 0; i < n; i++){
ll a; cin >> a;
m[a]++... | 0 | 79,498,754 |
#include <iostream>
#include <stdlib.h>
using namespace std;
int main()
{
char s[1001];
int x;
while(1)
{
cin.getline(s,1001);
if(atoi(s)==0)break;
int sum=0;
for(int i=0;s[i];i++)
sum+=int(s[i]-'0');
cout<<sum<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n)-1;i>=0;i--)
#define rrep2(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define all(a) (a).begin(),(a).end()
typedef long long ll;
typedef ... | 0 | 81,271,625 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, x, m;
cin >> n >> x >> m;
vector<long long> sm(100005, 0);
vector<long long> cnt(100005, 0);
sm[1] = x;
cnt[x] = 1;
long long first_sum = 0, first_len = 0;
long long loop_sum = 0, loop_len = 0, loop_num = 0;
long long last_sum = 0... | #include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define lch (o << 1)
#define rch (o << 1 | 1)
typedef double db;
typedef long long ll;
typedef unsigned int ui;
typedef pair<int,int> pint;
const int N = (1 << 18) + 5;
const int INF = 0x3f3f3f3f;
const ll INF_LL = 0x3f3f3f3f3f3f3f3f;
int a... | 0 | 35,680,465 |
#include <bits/stdc++.h>
using namespace std;
void solve(long long a, long long b, long long x){
double depth = (double)(x)/a/a;
double ad = a;
double bd = b;
double L, theta;
if(depth>bd/2){
L = sqrt(ad*ad + 4*(bd-depth)*(bd-depth));
theta = acos(a/L)/2.0/3.1415926589*360;
} else {
double y = 2... | #include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <functional>
using namespace std;
static const int INF = 999999999;
typedef pair<int, int> P;
struct SEdge
{
int To;
int Cost;
};
vector<int> d;
vector<SEdge> G[10];
void Dijkstra(int s)
{
fill(d.begin(), d.end(), INF);
d[s] = 0;
... | 0 | 13,345,083 |
#include <bits/stdc++.h>
using namespace std;
const bool ready = [](){
ios_base::sync_with_stdio(false); cin.tie(0);
cout << fixed << setprecision(12);
return true;
}();
const double PI = acos(-1);
using ll= long long;
#define int ll
#define all(v) (v).begin(), (v).end()
#define fori(n) for(int i=0; i<int(n... | #include <iostream>
#include <numeric>
#include <cmath>
#include <limits>
#include <stdio.h>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#in... | 0 | 57,823,343 |
#include <bits/stdc++.h>
using namespace std;
int k,a,b,c;
int main()
{
cin>>a>>b>>c>>k;
for (int i=0;i<=k;++i)
{
for (int j=0;j+i<=k;++j)
{
if (a<(b*(1<<i)) && (b*(1<<i))<(c*(1<<j)))
{
cout<<"Yes";
return 0;
}
}
... | #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 whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair<int, int>;
#define debug(var) cerr << "[" << #var << "] " ... | 0 | 43,196,522 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.