code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include<iostream>
#include<string>
#include<vector>
using namespace std;
int main(void){
while(1){
int n;
cin>>n;
if(n==0)break;
vector<string> s(n);
for(int i=0;i<n;i++){
cin>>s[i];
}
int ans=0;
bool f=false;
int r=0,l=0;
for(int i=0;i<n;i++){
if(s[i]=="lu")l=1;
if(s[i]=="ru")r=1;
if(s[i]=="ld")l=0;
if(s[i]=="rd")r=... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
int n, m;
cin >> n >> m;
int day = 0;
rep(i, m)
{
int a;
cin >> a;
day += a;
}
if (day <= n)
cout << n - day << endl;
else
cout << -1 <<... | 0 | 86,425,791 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ... | #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 < (n); ++i)
#define REPr(i, n) for(int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for(int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for(int i = (n); i >= (m); --i)
#define MP make... | 0 | 83,757,020 |
#include<bits/stdc++.h>
using namespace std;
#define cinsc ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(0);
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define FOR(i,k,n) for(int64 i=k;i<(int64)n;i++)
#define FORr(i,k,n) for(int64 i=(int64)k;i>=n;i--)
#define FORE... | #include <iostream>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
using namespace std;
typedef unsigned long long ll;
const int maxn=1e5+10;
const ll mm=1e9+7;
int main()
{
ll ans=0;
ll n;
cin>>n;
if(n==2)cout<<0<<endl;
else{
for(ll i=1;i*i<n;++i)
{
ll no... | 0 | 90,159,525 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 998244353;
int main(){
ll n,ans=0;
cin >> n;
vector<ll>acm(n);
for(int i=0; i<n; i++){
ll a;
cin >> a;
if(i == 0) acm[i] = a;
else acm[i] = acm[i-1] + a;
}
sort(acm.begin(),acm.end());
ll now = acm[0],count ... | #include<iostream>
#include<vector>
#include<string>
#include<map>
#define rep(i, start, end) for (int i = (int)start; i < (int)end; ++i)
#define rrep(i, start, end) for (int i = (int)start - 1; i >= (int)end; --i)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
template<typename T> inl... | 0 | 77,404,963 |
#include<bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for(int (i) = 0; (i) < (n); (i)++)
#define rrep(i, n) for (int (i) = 1; (i) <= (n); (i++))
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define pb push_back
#define eb emplace_back
#define yn {puts("Yes");}else {puts("N... | #include <bits/stdc++.h>
using namespace std;
class UFDS
{
std::vector<int> size, ps;
int len = 1;
public:
UFDS(int N) : size(N + 1, 1), ps(N + 1)
{
std::iota(ps.begin(), ps.end(), 0);
}
int find_set(int x)
{
return x == ps[x] ? x : (ps[x] = find_set(ps[x]));
}
bool s... | 0 | 31,505,691 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
int main()
{
int a, b;
cin >> a >> b;
cout << (int)ceil((double)(a+b)/2) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repr(i,n) for(int i = (int)(n); i >= 0; i--)
#define all(v) v.begin(),v.end()
typedef long long ll;
int main(){
int N,K;
cin >> N >> K;
vector<int> vec(N);
rep(i,N){
cin >> vec[i];
}
... | 0 | 92,966,054 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <chrono>
using namespace __gnu_pbds;
using namespace std;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define ll long long int
#define ld long double
#defi... | #include <iostream>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <cmath>
#include <limits>
#include <climits>
#include <utility>
#include <algorithm>
#include <numeric>
using namespace std;... | 0 | 26,873,169 |
#include <iostream>
#include <math.h>
using namespace std;
int main(void){
int n, i;
double x1, y1, x2, y2, x3, y3, x4, y4;
double dega, degb;
cin >> n;
for(i=0;i<n;i++){
cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> x4 >> y4;
dega = (y2 - y1) / (x2 - x1);
degb = (y4 - y3) / (x4 - x3);
if(dega == degb){
co... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
template<typename T> void view(T cont) {std::cout << cont << std::endl;}
template<typename T> void view(T* cont, ll sz) {rep(i, sz) std::cout << cont[i] << " "; std::cout << std::endl;}
template<typenam... | 0 | 47,141,900 |
#include <iostream>
using namespace std;
int main()
{
int n;
cin >> n;
int data[4][3][10] = {};
int b, f, r, v;
for(int i = 0; i < n; ++i){
cin >> b >> f >> r >> v;
data[b-1][f-1][r-1] += v;
}
for(int i = 0; i < 4; ++i){
for(int j = 0; j < 3; ++j){
for(int k = 0; k < 10; ++k){
cout << " " << data[i]... | #include <iostream>
#include <cstdio>
using namespace std;
int main(){
long long h, w;
cin >> h >> w;
char c[h][w];
char c2[2*h][w];
for(long long y = 0; y < h; y++){
for(long long x = 0; x < w; x++){
cin >> c[y][x];
}
}
for(long long y = 0; y < 2*h; y++){
... | 0 | 90,041,606 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, k;
cin >> a >> b >> k;
if (k <= a) {
cout << a-k << " " << b << endl;
}
else if (k <= a+b) {
cout << 0 << " " << a+b-k << endl;
}
else {
cout << "0 0" << endl;
}
} | #include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#include <unistd.h>
#include <stdio.h>
#define all(a) (a).begin(),(a).end()
#define vecin(a) rep(i,a.size())cin >> a[i]
#define vecout(a) rep(i,a.size()){cout << a[i];cout << (i == a.size() - 1 ? "\n":" ");}
#define rep(i,x) for(int i = 0;i<x;i++)
#define RE... | 0 | 17,429,660 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long int a,b,c,d,e,f,g,h,i,j;
cin >> a >> b;
if (a == 1 && b == 1)
{cout << 1 << endl;}
else if (a == 1)
{cout << b - 2 << endl;}
else if (b== 1)
{cout << a - 2 << endl;}
else
{cout << (b - 2)*(a - 2) ... | #include<iostream>
#include<math.h>
#include<string>
#include<vector>
using namespace std;
#define rep(i,n) for(i=0;i<n;i++)
int main(){
int i;
int n;
cin>>n;
int max=0;
int ans=0;
if(n==1){
cout<<1;
return 0;
}
rep(i,n+1){
int cnt=0;
int p=i;
whil... | 0 | 88,951,570 |
#include <iostream>
#include <map>
#include <set>
#include <algorithm>
#include <vector>
#include <sstream>
#include <string>
#include <functional>
#include <queue>
#include <deque>
#include <stack>
#include <limits>
#include <unordered_map>
#include <unordered_set>
#include <math.h>
#include <fstream>
#include <iterat... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define inf (ll)(1e18)
#define mod 1000000007
int main()
{
int t=1;
while( t-- )
{
int n,k;
cin>>n>>k;
bool snuke[n+1]={0};
for( int i=0 ; i<k ; i++ )
{
int d;
cin>>d;
... | 0 | 87,697,179 |
#include <bits/stdc++.h>
#define rep(i,m,n) for(int i=m; i<n; i++)
#define co(n) cout << n << endl
using namespace std;
int main(){
int n, a, b;
cin >> a >> b;
co(a+b/2);
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main()
{
int n, m;
cin >> n >> m;
vector<vector<int>> a(m, vector<int>(n));
rep(i, m) {
int k;
cin >> k;
rep(j, k) {
int s... | 0 | 97,043,816 |
#include <bits/stdc++.h>
int main() {
int32_t n;
std::cin >> n;
std::vector< int32_t > l(2 * n);
for(int32_t i = 0; i < 2 * n; i++) {
std::cin >> l[i];
}
std::sort(l.begin(), l.end());
int32_t ans = 0;
for(int32_t i = 0; i < 2 * n; i += 2) {
ans += l[i];
}
std::co... | #include <bits/stdc++.h>
typedef long long ll;
#define ALL(l) (l).begin(),(l).end()
#define rep(i,n) for(ll (i)=0;(i)<(n);(i)++)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
using namespace std;
using vi = vector<int>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vs = vector<string>;
using p... | 0 | 3,001,431 |
#include <bits/stdc++.h>
#include <iomanip>
#include <algorithm>
#define ll long long
#include <unordered_map>
using namespace std;
int main() {
ll a, b, x;
cin >> a >> b >> x;
if(2 * x >= a * a * b) cout << fixed << setprecision(15) << atan(double(2 * (b - double(x) / double(a * a))) / double(a)) / 3.14159265358... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using pll = pair<ll, ll>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(i) begin(i), end(i)
const int INF = 0x3fffffff;
const ll MINF = 0x7fffffffffff;
const ld DINF = numeric_l... | 0 | 79,048,652 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2000006;
int a[N];
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
string s,t;
cin>>s>>t;
int n = (int)s.size();
for(int i=0;i<n;i++){
if(s == t){
cout<<"Yes";
return 0;
}
t = t[n-1]+t;
t.pop_back();
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
ll mod(ll A, ll M) {return (A % M + M) % M;}
const ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return t... | 0 | 59,132,581 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
#define INF 1000000000
#define MOD 1000000007
#define EPS 1e-12
#define REP(i, a, b) for(int i = (a); i < (b); ++i)
#define ALL(x) x.begin(), x.end()
#define UNIQUE(c) (c).resiz... | #include<iostream>
#include<algorithm>
#include<vector>
#include<numeric>
#include<string>
#include<cmath>
#include<set>
#include<queue>
#include<deque>
#include<bitset>
#include<iomanip>
#include<cctype>
#include<map>
#include<cstring>
#include<bitset>
#include<cassert>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#d... | 0 | 46,611,697 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c,k,turn;
scanf("%d%d%d%d",&a,&b,&c,&k);
for(;;)
{
if(b<=a)
{
b*=2;
turn++;
}
else
{
break;
}
}
for(;;)
{
if(c<=b)
{
c*=2;
turn++;
}
else
{
break;
}
}
if(turn<=k)
{
printf("Yes");
}
else
{
printf... | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using Pair = pair<int32_t, int32_t>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int32_t A, B, M;
cin >> A >> B >> M;
vector<int32_t> a(A);
vector<int32_t> b(B);
int32_t min_price = INT32_MAX;
for (int32_t i = 0; i < A; ++i) {
... | 0 | 45,023,539 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
long long MOD = 1000000000 + 7;
int main(){
cout << setprecision(10);
ll N,M; cin >> N >> M;
ll ans = 0;
if(M >= N * 2){
ans += N;
M -= N * 2;
ans += M / 4;
} else {
ans += M / 2;
}
cout << ans <... | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <functional>
using name... | 0 | 13,111,609 |
#include<bits/stdc++.h>
#include<vector>
#include<set>
#include<algorithm>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define T int t, q=0; scanf("%d", &t); while(q++<t)
#define ll long long
#define FAST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
ll x,y,z,a=0,b=0,c=0,d=0,sum,ans,t... | #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>
#include <fstream>
#incl... | 0 | 71,907,084 |
#include<stdio.h>
#define M 100005
#define N -1
struct Node{ int p, l, r;};
struct Node t[M];
int n, H, d[M];
int Depth(int u){
int x = 0;
for(; t[u].p != N ;x++) u = t[u].p;
return x;
}
void print(int u){
int i, c;
printf("node %d: ", u);
printf("parent = %d, ", t[u].p);
printf("depth = %d, ", d[u]);
i... | #include<bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define ll long long
#define rep(i,n) for(int i = 0; i < int(n); i++)
#define vi vector<int>
using namespace std;
const int INF = 1001001001;
const int MOD = 1e9+7;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template<class T> inline bool ... | 0 | 8,591,391 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int H,W;
cin>>H>>W;
char s[60][60];
int a=0;
for(int i=1;i<=H;i++){
for(int j=1;j<=W;j++){
cin>>s[i][j];
}
}
for(int i=1;i<=H;i++){
for(int j=1;j<=W;j++){
if(s[i][j]=='#'&&s[i-1][j]!='#'&&s[i+1][j]!='#'&&s[i][j-1]!='#'&&s[i][j+1]!='#'){
... | #include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
void check(int z);
bool flg[10]={0};
int W_book[10]={0};
int bookcheck[1000][10]{{0}};
int sum=0;
int n,s;
int ans=0;
int main(void){
for(;;){
cin>>n>>s;
if(n==0)break;
for(int i=0;i<... | 0 | 87,667,850 |
#include<iostream>
using namespace std;
int main() {
int n, k, x, y;
cin >> n >> k >> x >> y;
int fee ;
if (n > k) {
fee = (k * x) + ((n - k) * y);
}
else {
fee = (n * x);
}
cout << fee;
} | #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>
#incl... | 0 | 7,995,441 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,x,n) for(int i=x;i<n;i++)
#define mod 1000000007
#define INF 1000000000000
#define F first
#define S second
#define P pair<int,int>
#define all(vec) vec.begin(),vec.end()
int n,m;
int h[200000];
int ... | #include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < (n); ++i)
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;}
using namespace std;
using ll = long long;
using P = pair<in... | 0 | 24,298,434 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 100100;
int N;
ll D[MAXN];
vector <int> edge[MAXN];
map <ll, int> ord;
map <ll, int> ssize;
map <ll, ll> stot;
int main()
{
ios_base::sync_with_stdio(0);
cin >> N;
for (int i = 0; i < N; i++)
{
cin >> D[i];
... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll MOD = 1000000007;
#define vec vector<int>
#define vecll vector<ll>
#define vecd vector<double>
#define vecst vector<string>
#define vecb vector<bool>
#define vec2(var, n, m) vec... | 0 | 316,256 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
double av,r;
cin>>r>>av;
cout<<2.0*av-r<<endl;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
const int MAX = 700000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD /... | 0 | 87,232,742 |
#include <vector>
#include <set>
#include <array>
#include <iostream>
#include <cstdio>
#include <cstdint>
#include <algorithm>
#include <numeric>
#include <bitset>
using ll = long long;
using ld = long double;
using namespace std;
#define rep(i,n) for(ll i=0;i<(n);++i)
inline void yes(bool cond) { cond ? puts("Yes") :... | #include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define ll long long
#define int long long
#define inf ((ll)1e18)
#define mod 1000000007
#define double long double
#define ull unsigned long long
#define vi vector<ll>
#define ppi ... | 0 | 71,584,926 |
#include<bits/stdc++.h>
#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
#include <stack>
#include <map>
#include <cmath>
#include <algorithm>
#define INF 0x3f3f3f3f
#define SI(a) scanf("%d",&a)
#define ms(a,x) memset(a,x,sizeof(a))
typedef long long ll;
const int mod = 998244353;
const int max... | #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, INF=mod*mod*3LL;
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
ll... | 0 | 523,838 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
#define ll long long
#define vi vector<int>
#define vll vector<ll>
#define frw(i, a, b) for(int i = a; i < b; i++)
#define fi first
#define se second
#define pb push_back
#define in insert
#defin... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i = 0;i < n;++i)
#define all(v) v.begin(), v.end()
using ll = long long;
int main()
{
ll i,j;
ll n,k;
cin >> n >> k;
string s;
cin >> s;
vector<pair<ll,ll>> svpl;
char tmp = s.at(0);
ll num = 1;
for(i = 1;i < n;++i){
... | 0 | 85,778,824 |
#include <iostream>
#include <cstdlib>
int main()
{
long long s;
std::cin >> s;
int min = 56562;
int diff;
int num;
int k = 1;
while (true) {
num = s / k % 1000;
if (num < 100) break;
diff = std::abs(753 - num);
if (min > diff) min = diff;
k *= 10;
}
std::cout << min << std::endl;
return 0;
} | #ifdef __LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
template<typename T> bool chmax(T &a,T b) {if(a<b) {a=b; return true;} return false;}
template<typename T> bool chmin(T &a,T b) {if(a>b) {a=b; return true;} return false;}
#define itn int
#define fi first
#define se second
#def... | 0 | 69,544,464 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
#include <cstring>
#include <cmath>
#include <stack>
#include <iomanip>
#include <tuple>
#include <functional>
#include <cfloat>
#include <map>
#include <set>
#inclu... | #include <bits/stdc++.h>
using namespace std;
#define llong long long int
#define ldouble long double
#define ternary(condition, x, y) ((condition) ? x : y)
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(x) x.begin(), x.end()
#define stl_rep(itr, x) for (auto itr = x.begin(); itr != x.end(); ++itr)
const st... | 0 | 21,095,845 |
#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... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n - 1); i >= 0; i--)
#define ALL(v) v.begin(), v.end()
using namespace std;
using P = pair<int, int>;
typedef long long ll;
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
int x, y, z, k;
ci... | 0 | 63,966,193 |
#include<iostream>
#include<string>
using namespace std;
int main(){
string s, e, ans = "NO";
cin >> s;
for(int i = 0; i < s.size(); i++){
for(int j = 0; j <= s.size() - i; j++){
e = s;
if(e.erase(i,j) == "keyence") {
ans = "YES";
}
}
}
cout << ans << endl;
} | #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 ll long long
#define db long double
#define pb push_back
#define eb emplace_back
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pii>
#defin... | 0 | 39,205,670 |
#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... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef pair<int, int>P;
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
typedef vector<vector<ll> > mat;
typedef vector<ll> vec;
#define rep(i,n) for(int i=0;i<n;i++)
#d... | 0 | 26,405,986 |
#include <iostream>
#include <map>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <sstream>
#include <cmath>
#include <math.h>
#include <string>
using namespace std;
typedef long long ll;
#define rep(n) for( int i = 0 ; i < n ; i++ )
#define REP(n) for( int i = 1 ; i <= n ; i++ )
#define repll(n) fo... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#include <bitset>
#define M 1000000007
#define M1 998244353
#define tr(container, it) \
for(typeof(container.begin()) it = container.begin(); it != container.end(); it++)
#define fast \
ios_base::syn... | 0 | 85,876,979 |
#include <iostream>
using namespace std;
int main(){
int n,m,d[10],a,b,t;
while (1){
for (int i=0;i<10;i++)d[i]=0;
t=0;
cin >> n >> m;
if (n==0&&m==0)break;
for (int i=0;i<n;i++) {
cin >> a >> b;
d[b-1]+=a;
}
for (int i=9;i>=0;i--){
if (m==0) break;
if (d[i]<=m){
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> p_ll;
typedef vector<pair<ll, ll>> vec_p;
#define ture ture
#define flase false
#define falg flag
#define REP(i, x) for (ll i = 0; i < (ll)(x); i++)
#define REPS(i, x) for (ll i = 1; i <= (ll)(x); i++)
#define RREP(i, x) for (... | 0 | 23,329,144 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long a,b;
cin>>a >>b;
cout<<(a%b==0 ? -1 : a )<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll,ll> pl;
typedef vector<pl> vp;
const ll INF=1001001001;
const ll LINF=1001001001001001001;
const ll D4[]={0,1,0,-1,0};
const ll D8[]={0,1,1,0,-1,-1,1,-1,0};
#define _overload3(_1,_2,_3,name... | 0 | 69,840,762 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }
#define X real()
#define Y imag()
using namespace std;
us... | #include <iostream>
#include <cstdlib>
#include <bits/stdc++.h>
#include<algorithm>
using namespace std;
int main(){
int n,i,j,zero=0;
long long int ans=0,m=1,a[200010];
cin >> n;
for(i=0;i<n;i++)
{
cin >> a[i];
}
for(i=0;i<n;i++)
{
if(a[i]==0)
{
zero++;
... | 0 | 19,030,948 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define dl double long
#define rep(i, m, n) for(ll i = (ll)(m); i < (ll)(n); ++i)
#define rrep(i, m, n) for(ll i = (ll)(m); i > (ll)(n); --i)
const ll MOD = 1000000007;
const double pi = 3.14159265358979323846;
struct node{
int parent, right_sibling,... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N,M;
cin>>N>>M;
vector<int>A(N);
vector<int>B(N);
for(int i=0; i<N; i++){
cin>>A.at(i);
cin>>B.at(i);
}
vector<int>C(M);
vector<int>D(M);
for(int i=0; i<M; i++){
cin>>C.at(i);... | 0 | 46,477,949 |
#include <bits/stdc++.h>
using namespace std;
int64_t MOD = 1000000007;
int64_t MAX = 9223372036854775807;
double PI = 3.141592653589793;
int main()
{
int D;
cin >> D;
cout << "Christmas";
for (int i = 0; i < 25 - D; i++)
cout << " Eve";
} | #include<iostream>
#include<vector>
using namespace std;
int main(){
int n,m;
char c;
vector<char> transB,transA;
vector<char> input;
while(cin >> n){
if(n == 0)
return 0;
transB.clear(); transA.clear(); input.clear();
for(int i =0;i<n;i++){
cin >> c;
transB.push_back(c);
... | 0 | 90,359,543 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 2e5 + 10;
int x[maxn], y[maxn], n;
ll cal(ll x) {
return x * (x + 1) / 2;
}
int main() {
scanf("%d",&n);
ll ans = 0;
for (int i = 1; i < n; i++) {
scanf("%d%d",&x[i],&y[i]);
if (x[i] > y[i]) swap(x[i],y[i]);
ans += cal(i);
a... | #include<bits/stdc++.h>
#define ll long long
#define mp make_pair
#define F first
#define S second
#define db double
#define pb push_back
#define rep(i,a,b) for(ll i=a;i<=b;i++)
#define all(a) a.begin(),a.end()
using namespace std;
ll mod=1e9 +7;
ll expo(ll base,ll exponent,ll mod){
ll ans=1;
while(exponent!=... | 0 | 39,588,711 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N, Y;
cin >> N >> Y;
bool flag = false;
int x, y, z;
for (int i=0; i<=2000; i++){
if ((Y - 1000*N - 9000*i) % 4000 == 0){
y = (Y - 1000*N - 9000*i) / 4000;
x = i;
z = N - x - y;
if ((y >= 0) && (z >= 0... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main()
{
int N;
int set = 2;
cin >> N;
if (N == 1)
{
cout << 1 << endl;
return 0;
}
for (int i = 1 ; i < 7 ; i++){
if (set <= N && set * 2 > N)
{
cout << set << end... | 0 | 51,351,696 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin >> a >> b >> c;
if(a!=b && b!=c && a!=c){
cout << 3 << endl;
}
else if((a==b && b!=c) || (b==c && b!=a) || (a==c && b!=c)){
cout << 2 << endl;
}
else{
cout << 1 << endl;
}
} | #include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define int long long
int mod=1e9+7;
int po(int x,int y,int m) { if (y==0) return 1; int t=po(x,y/2,m)%m; t=(t*t)%m; if (y&1) return (t*x)%m; return t%m; }
const int mx=1000001;
vector<bool> prim(mx,true);
void seive(){
for (int p = 2;p*p<=1000001;... | 0 | 46,996,100 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n;
cin >> n;
vector<int> ws(n);
cin >> ws[0];
for (size_t i = 1; i < n; i++) {
cin >> ws[i];
ws[i] += ws[i-1];
}
int ans = 100000000;
for (size_t i = 0; i < n-1; i++) {
ans ... | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<cmath>
#include<map>
#include<set>
#include<numeric>
#include<functional>
#include<sstream>
#include<iomanip>
using namespace std;
#define ll long long
int main() {
int N; cin >> N;
vector<pair<int, int>> a(N), b(N);
for(int i... | 0 | 9,561,493 |
#include <bits/stdc++.h>
using namespace std;
typedef long lint;
typedef long long llint;
typedef pair<int, int> pint;
typedef pair<long long, long long> pllint;
bool compPair(const pint& arg1, const pint& arg2) { return arg1.first > arg2.first; }
template<class T> void chmax(T& a, T b) { if (a < b) { a = b; } }
templa... | #include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a),... | 0 | 69,223,663 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<(n); i++)
using veci = vector<int>;
using ll = long long;
int c[10010];
int a[2020202];
int b[2000200];
void countingsort(int a[], int b[], int k, int n){
for (int i=0; i<k; i++){
c[i] = 0;
}
for (int j=1; j<= n; j++){
... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 10000000... | 0 | 80,410,288 |
#include<iostream>
using namespace std;
int main(){
int n,k,x,y;
cin>>n>>k>>x>>y;
int fee=0;
if(n<=k){
fee=x*n;
}else{
fee=x*k;
fee+=y*(n-k);
}
cout<<fee<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<LL, LL> PII;
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;
}
templa... | 0 | 15,591,801 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define rep(i,m,n) for(int i=m;i<n;i++)
ll mod=1e9+7;
int main(){
int n,k;
cin>>n>>k;
vector<int> v[n];
rep(i,0,n){
int a,d;
cin>>a>>d;
v[a-1].push_back(d);
}
rep(i,0,n){
sort(v[i].begin(),v[i].end()... | #include <bits/stdc++.h>
using i64 = long long;
int main() {
int n;
std::cin >> n;
std::vector<int> a(1 << n);
for (auto &e : a) std::cin >> 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 (int i ... | 0 | 55,968,938 |
#include <iostream>
using namespace std;
int main(){
int n;
cin >> n;
long a = 100000;
for(int i=0;i<n;i++){
a = (a+a/20);
if(a%1000!=0) a = (a/1000+1)*1000;
}
cout << a << endl;
} | #include <bits/stdc++.h>
using namespace std;
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define rep(i, a, b) for(lli i = a; i < (b); ++i)
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define... | 0 | 50,869,973 |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
typedef long long int ll;
#define MOD 1000000007
#define N 100005
#define INF 1e18
#include <ctime>
#define rep(i, x, n) for (ll i = x; i < n; i++)
#define rev(i, n, x) for (ll i = n; i > x; i--)
#define all(c) (c).begin(), (c).end()
#define int long lo... | #include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define vecin(a) rep(i,a.size())cin >> a[i]
#define overload4(_1,_2,_3,_4,name,...) name
#define rep1(n) f... | 0 | 59,687,268 |
#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 { \... | #include<iostream>
#include<stack>
#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;
stack<int> st;
cin>>n;
st.push(n);
while(cin>>n){
if(!n){
cout<<st.top()<<endl;
st.pop();
}else{
st.push(n);
}
}
return 0;
} | 0 | 1,244,410 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <map>
#include <iomanip>
#include <deque>
#include <set>
#define rep(i,a,b) for(int i=a;i<b;++i)
#define rrep(i,a,b) for(int i=a;i>=b;--i)
#define fore(i,a) for(auto &i:a)
#define INF INT_MA... | #include <iostream>
#include <string>
#include <memory.h>
#include <algorithm>
#include <limits.h>
using namespace std;
const int MAXN = 2e5 + 10;
int dp[1<<26], state[MAXN];
int ret[MAXN];
int main() {
memset(dp, -1, sizeof(dp));
string s;
cin >> s;
int n = s.size();
for (int i = 0; i < n; i++) {
... | 0 | 88,792,089 |
#include<iostream>
#include<cstring>
using namespace std;
int judge(int);
char S[100];
char l[16]="qwertasdfgzxcvb";
int main()
{
int i,sum=0;
int SS[100];
while(1){
cin>>S;
if(S[0]=='#')break;
for(int i=0;i<strlen(S);++i){
SS[i]=judge(i);
}
for(int i=0;i<strlen(S)-1;++i){
if(SS[i]... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18);
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes c... | 0 | 12,288,942 |
#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... | #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;
#define all(q) (q).begin(),(q).end()
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)
#de... | 0 | 92,175,765 |
#include <iostream>
#include <string.h>
using namespace std;
int main()
{
int i,turn,score=0,score2=0;
string str;
string str2;
cin>>turn;
for(i=0;i<turn;i++){
cin>>str;
cin>>str2;
if(str==str2){
score+=1;
score2+=1;
}else if(str<str2){
score2+=3;
}
else{
score+=3;
}
}
cout<<score<<... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
vector<vector<char>> mat(n);
for (int i = 0; i < n; i++)
{
mat[i] = vector<char>(n);
for (int j = 0; j < n; j++)
cin >> mat[i][j];
}
int ans = 0;
for (int i = 0; i < n; i++)
{
... | 0 | 7,030,603 |
#include<iostream>
#include<iomanip>
#include<cstdlib>
#include<stdio.h>
#include<time.h>
#include<math.h>
#include<algorithm>
#include<string>
#include<vector>
#include<list>
#include<queue>
#include<stack>
#include<deque>
#include<set>
#include<map>
#define REP(i, N) for(ll i = 0; i < N; ++i)
#define FOR(i, a, b) for... | #include<bits/stdc++.h>
#define pi 2*acos(0.0)
#define ll long long
#define FIO ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define Node struct node
#define spc " "
#define E 2.71828182845904523536
#define pb push_back
#define pp pop_back
#define valid(nx,ny) nx>=0 && nx<n && ny>=0 && ny<m
#define ee endl
#d... | 0 | 89,686,639 |
#include<bits/stdc++.h>
using namespace std;
int main(void)
{
int n,k,h[100001];
int i,j,x,dp[100001];
scanf("%d %d",&n,&k);
for(i=0;i<n;i++) scanf("%d",&h[i]);
for(i=0;i<=n;i++) dp[i]=1000000000;
dp[0]=0; x=0;
for(i=0;i<n-1;i++){
for(j=1;j<=k;j++){
x=h[i]-h[i+j];
if(x<0) x=-x;
if(i+j<n&&dp[i+j]>x+dp[... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<ll, ll> pll;
const double PI = acos(-1);
const int Mod = 1e9+7;
const int MXS = 2e5+5;
const int MXI =... | 0 | 20,016,818 |
#include<bits/stdc++.h>
using namespace std;
int main() {
string s, alphabet = "abcdefghijklmnopqrstuvwxyz"; cin >> s;
set<char> appeared;
int size = s.size();
for(int i = 0; i < size; i++) {
appeared.insert(s.at(i));
}
bool noneornot = 0;
char firstfound;
for(int i = 0; i < 26; i++) {
if(!(appe... | #include<bits/stdc++.h>
#include<ctype.h>
# define pb push_back
#define fst first
#define sec second
#define For(i,a,b) for(int i=a;i<b;i++)
#define ll long long int
#define ull unsigned long long int
#define mod 1000000007
#define fo(i,n) for(ll i=0;i<n;i++)
#define endl "\n"
#define rev(i,n) for(ll i=n-1;i>=0;i--)
#d... | 0 | 14,192,206 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int N; cin >> N;
vector<int> h(N);
int ans = 0;
rep(i, N){
cin >> h[i];
if(i == 0){
ans += h[i];
} else {
... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,j,n) for(int i=(int)(j);i<(int)(n);i++)
#define REP(i,j,n) for(int i=(int)(j);i<=(int)(n);i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(),(a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<int,int>
#define priq... | 0 | 96,269,535 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <stack>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#... | #include<iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
using P = pair<int,int>;
char tolower(char c) {return (c + 0x20);}
char toupr(char c) {return (c - 0x20);}
const int MAX_N = 11;
int main()
{
int n, m; cin >> n >> m;
vector<int> s[m];
... | 0 | 43,657,094 |
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#define initdp(a, b) for (int i = 0; i <= a; i++) for (int j = 0; j <= b; j++) dp[i][j] = -1;
#define pb push_back
#define pii pair<int, int>
#define ll long long
#define pll pair<ll, ll>
#define all(arr) arr.begin(), arr.end()
#define rep(i,... | #include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#inc... | 0 | 71,531,083 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr long long MOD = 1000000007;
constexpr long long INF = 1LL << 60;
const long double PI = acosl(-1.0);
constexpr long double EPS = 1e-11;
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}... | #include<bits/stdc++.h>
using namespace std;
static const int MAX_N = 100;
int a[MAX_N];
int main(void){
for(int i = 0; i <= MAX_N; i++){
a[i] = 0;
}
int input;
while(scanf("%d", &input) != EOF){
a[input]++;
}
int max_a = 0;
for(int i = 0; i < MAX_N; i++){
if(a[i] > max_a) max_a = a[i];
}
for(int i = 0; ... | 0 | 66,279,449 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll f(ll a, ll b) {
if (a > b) swap(a, b);
if (b % a == 0) {
return (b/a)*a*2-a;
}
return (b/a)*a*2+f(b%a, a);
}
int main () {
ll N, X;
cin >> N >> X;
if (X+X == N) {
cout << N/2*3 << endl;
return 0;
... | #include<iostream>
using namespace std;
int main(){
int num[5];
int M1 = -2147483647, M2 = -2147483647, M3= -2147483647 , M4= -2147483647 , M5 = -2147483647;
int I1 = 0, I2 = 0, I3= 0 , I4= 0 , I5 = 0 ;
cin >> num[0] >> num[1] >> num[2] >> num[3] >> num[4] ;
for(int i=0 ; i < 5; i++){
if(M1 < num[i... | 0 | 22,807,707 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,p=0,c=0;
cin >> n;
vector<int> vec(n);
vector<bool> check(n,false);
for(int i=0;i<n;i++){
cin >> vec.at(i);
}
while(p!=1){
if(check.at(p)){
break;
}else{
check.at(p) = true;
p = vec.at(p)-1;
c++;
}
}... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using ll = long long;
using namespace std;
using P = pair<int,int>;
int main(){
int n;
cin >> n;
vector<int> d(n);
for(int i = 0; i < n; i++){
cin >> d[i];
}
int sum = 0;
for(int i = 0; i < n - 1; i++){
fo... | 0 | 69,933,387 |
#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);
... | #include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
inline int read(){
int x=0,f=1;
char c=getchar();
while(c<'0'||c>'9'){
if(c=='-')f=-1;
c=getchar();
}
while(c>='0'&&c<='9'){
x=(x<<1)+(x<<3)+c-'0';
c=getchar();
}
return x*f;
}
int n,m,A,B;
int main(){
n=read(),m=read(),A=read(),... | 0 | 15,496,347 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pi 3.14159265359
#define inf 2147483647
#define INF 9223372036854775807
#define mod 1000000007
#define mod2 998244353
int main() {
int x1, y1, x2, y2; cin >> x1 >> y1 >> x2 >> y2;
int distx = x2 - x1, disty = y2 ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;
template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (int i=(int)from; i<(int)to; i++)
#define all(vec) vec.begin(), vec.e... | 0 | 26,416,596 |
#include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
using P = pair<ll,ll>;
using ld=long double;
int main(){
ll ans=0;
vector<char>memo;
ll n,k;cin >>n>>k;
ll r,s,p;cin >>r>>s>>p;
... | #include<bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for(int (i) = 0; (i) < (n); (i)++)
#define rrep(i, n) for (int (i) = 1; (i) <= (n); (i++))
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define pb push_back
#define eb emplace_back
#define yn {puts("Yes");}else {puts("N... | 0 | 11,290,308 |
#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... | #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;
cin >> N;
vector<int> A(N), B(N);
rep(i, N) cin >> A[i];
rep(i, N) c... | 0 | 20,614,653 |
#include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define INF 1e18
using namespace std;
ll gcd(ll a, ll b){
if (a < b)
return gcd(b, a);
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main(void){
ll n, k;
cin >> n >> k;
vector<ll> a(n);
for (int i = 0; i < n; i++... | #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 | 28,021,047 |
#include <iostream>
#include <cmath>
#include <iomanip>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
double x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
double d = sqrt((x1-x2)*(x1-x2) + (y1-y2)*(y1-y2));
cout << fixed << setprecision(8) << d << "\n";
} | #include <bits/stdc++.h>
using namespace std;
using pint = pair<int,int>;
const long long INF = 1LL << 60;
int main(){
int A,B,M; cin >> A >> B >> M;
vector<int> a(A);
vector<int> b(B);
int x,y,c;
long long ans = INF;
for(int i=0;i<A;i++) cin >> a[i];
for(int i=0;i<B;i++) cin >> b[i];
f... | 0 | 73,548,800 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
ll mod = 1e9 + 7;
ll dp[100007][2];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string l;
cin >> l;
int n = l.size();
dp[0][0] = 1;
for (int i = 0; i < n; i++) {
dp[i + 1][1] += 3 * dp[i][1];
if (l[... | #include<bits/stdc++.h>
using namespace std;
int H, W, K;
int main(){
int ans = 0;
char buf;
cin >> H >> W >> K;
int N = 0;
vector<vector<int>> C(H, vector<int>(W, 0));
for(int h = 0; h < H; ++h){
for(int w = 0; w < W; ++w){
cin >> buf;
if(buf == '#'){
... | 0 | 97,487,253 |
#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b)... | #include<bits/stdc++.h>
#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--)
#define MOD 1000000007
template<class T> inline bool chma... | 0 | 54,159,539 |
#include <bits/stdc++.h>
using namespace std;
int N, A;
int main() {
cin >> N >> A;
cout << (N % 500 <= A ? "Yes" : "No") << endl;
return 0;
} | #include <map>
#include <iostream>
struct range_valued_array {
using key_type = int;
using value_type = long long;
using iterator_type = std::map<key_type, value_type>::iterator;
std::map<key_type, value_type> mp;
key_type len;
range_valued_array(): len(0) {}
void resize_with(key_type new_len, const value... | 0 | 95,286,709 |
#include <bits/stdc++.h>
#define SIZE 10
#define PI 3.141592653589793
using namespace std;
typedef long long ll;
int main(void){
cin.tie(0);
ios::sync_with_stdio(false);
int N;
int i,j;
int start;
int end;
bool flag=true;
string S;
string S1="";
string S2="";
cin >> S;
N=S.size();
S1=S.substr(0,N/2);
S2=S... | #include <bits/stdc++.h>
using namespace std;
#define FOR(I,X,Y) for(long long (I)=(X);(I)<(Y);(I)++)
#define REP(I,X,Y) for(long long (I)=(Y)-1;(I)>=(X);(I)--)
#define ALL(X) (X).begin(),(X).end()
#define pb push_back
#define COUNT(V,X) upper_bound((V).begin(),(V).end(),X)-lower_bound((V).begin(),(V).end(),X)
#define ... | 0 | 24,573,947 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
struct edge {int to; ll cost; };
int dx[] = {-1, 1, 0, 0};
int dy[] = { 0, 0, 1, -1};
ll GCD(ll a, ll b){
if(b==0) return a;
else return GCD(b, a%b);
}
ll LCM(ll a, ll b){
if(a<b) swap(a,b);
return a/GCD(a,b)*b;
}
int... | #include<bits/stdc++.h>
using ll = long long;
int main(){
ll n;
scanf("%lld", &n);
ll a[n], b[n], c[n];
for(ll i=0; i<n; i++) scanf("%lld", &a[i]);
for(ll i=0; i<n; i++) scanf("%lld", &b[i]);
for(ll i=0; i<n; i++) c[i] = a[i] - b[i];
ll luck = 0, ans = 0;
... | 0 | 65,106,248 |
#include<bits/stdc++.h>
#define el endl
#define F(k) for(int i=0;i<k;i++)
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if(a+b==15){
cout<<"+"<<el;
return 0;
}
if(a*b==15){
cout<<"*"<<el;
return 0;
}
cout<<"x"<<el;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int64_t saiki(int64_t n, int64_t x, vector<int64_t> p){
int64_t ans;
if (x == 1) {
if (n == 0) ans = 1;
else ans = 0;
return ans;
}
if (x > 1 && x < (pow(2, n + 1) - 1)){
ans = saiki(n - 1, x - 1, p);
}
if (x == pow(2,... | 0 | 21,581,101 |
#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 unsigned long long MOD = 998244353;
int main()
{
int n;
cin... | #include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <map>
#include <deque>
#include <string.h>
using namespace std;
#define REP(i,n) for(int i = 0; i < n; i++)
#define ALL(v) v.begin(),v.end()
typedef long long ll;
typedef pair<int,int> pi;
typedef pa... | 0 | 19,904,297 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define nn cout << "\n";
ll dp[100000],ht[100000];
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll t,a,b,i,j,c,d,e,f,n,k,m,w;
memset(dp,0,sizeof(dp));
cin... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n = 0, max_height = 0;
long long sum = 0;
cin >> n;
vector<int> a(n);
for(int i = 0 ; i < n; i++)
{
cin >> a.at(i);
}
for(int i = 0; i < n; i++)
{
max_height = max(a.at(i),max_height);
sum += max_h... | 0 | 44,198,921 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define Rep(i,n) for(int i=1;i<=n;i++)
const ll MOD = 1000000007;
struct edge{
int to,weight;
edge(int to,int weight):to(to),weight(weight){}
};
using Graph = vector<vector<int>>;
using GraphEdge = vector<v... | #include <bits/stdc++.h>
#define rep(i, n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll=long long;
int main(){
int n;
cin>>n;
int cnt=1;
int ans=0;
int a;
rep(i,n){
cin>>a;
if(a!=cnt){
ans++;
}else{
cnt++;
}
}
if(ans==n... | 0 | 61,126,345 |
#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 int inf = 1e9;
const ll INF = 1e18;
const double pi = 3.14159265358979323846;
#define rep(i, n) for (int i = 0; i < (n); i++)
using pint = pair<int, int>;
using Graph = vector<vector<int>>;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int dx... | 0 | 40,431,706 |
#include <iostream>
#include <vector>
using namespace std;
enum Face
{
TOP = 0,
FRONT = 1,
RIGHT = 2,
LEFT = 3,
BACK = 4,
BOTTOM = 5,
};
void roll(vector<int> &f, char d, int n)
{
int tmp;
for (int i = 0; i < n; i++)
{
switch (d)
{
case 'E':
tmp = f[TOP];
f[TOP] = f[LEFT];
f[LEFT] = f[BOTTOM];
... | #include <bits/stdc++.h>
using namespace std;
const int match[10] = { 0, 2, 5, 5, 4, 5, 6, 3, 7, 6 };
const int INF = 1e9 + 7;
int main() {
int n, m;
cin >> n >> m;
int a[m];
for ( int i = 0; i < m; i++ ) { cin >> a[i]; }
sort(a, a+m, greater<int>());
int dp[n+1];
dp[0] = 0;
for ( int i = 1; i <= n; i++... | 0 | 97,028,510 |
#include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
d... | #include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
#define pb push_back
using namespace std;
typedef long long ll;
const int INF=1e9;
int main(){
int n,m,R;
cin>>n>>m>>R;
vector<int> r(R);
rep(i,R){
cin>>r[i];
r[i]--;
}
vector<vector<int>> d(n,vector<int>(n,INF));
rep(i,n) d[i][i... | 0 | 32,668,983 |
#include <iostream>
using namespace std;
int main(void){
int n,m;
cin >> n >> m;
int ans = m;
if (n <= 10) {
ans = 100 * (10-n) + m;
}
cout << ans << endl;
} | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <string>
#include <vector>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> ... | 0 | 89,482,095 |
#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){
string a,b,c; cin >> a >> b >> c;
bool ok = true;
if(a[a.size()-1] != b[0]) ok = false;
if(b[b.size()-1] != c[0]) ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i,a,b) for(ll i=a;(i)<(b);++(i))
#define RFOR(i,a,b) for(ll i=a;(i)>=(b);--(i))
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,n,0)
#define ALL(v) v.begin(), v.end()
#define UNIQ(v) sort(ALL(v)); v.erase(unique(ALL(v)),... | 0 | 86,307,551 |
#include <cstdio>
#define SIZE 33554432
char Key[128];
int Hash;
char* c;
#define HASH(A) c = A; Hash = 1; while(*c){ Hash <<= 2; Hash += Key[*c]; ++c;}
int main()
{
Key['A'] = 0;
Key['C'] = 1;
Key['G'] = 2;
Key['T'] = 3;
bool* dic = new bool[SIZE];
int n;
std::scanf("%d\n", &n);
char st... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define ll int64_t
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main(){
int h,w;
cin >> h >> w;
vector<vector<char>> a(h,vector<char>(w));
rep(i,h){
r... | 0 | 4,684,367 |
#include "bits/stdc++.h"
using namespace std;
int n, q;
class UnionFindTree {
int* p;
int* rank;
public:
void makeSet(int x);
void doUnion(int x, int y);
int findRoot(int x);
bool isSameSet(int x, int y);
void link(int x, int y);
};
void UnionFindTree::makeSet(int n) {
p = new int[n];
rank = new int[n... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
const int inf = 1e9;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define per(i, b, a) for (int i = a - 1; i >= b; i--)
using Graph = vector<vector<int>>;
using pint = pair<int, int>;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0... | 0 | 99,069,563 |
#include<bits/stdc++.h>
using namespace std;
int ar[2000010], br[100010], cr[2000010];
int main()
{
int i, n;
scanf("%d", &n);
memset(br, 0, sizeof(br));
for(i = 1; i <= n; ++i)
{
scanf("%d", &ar[i]);
++br[ar[i]];
}
for(i = 1; i < 100001; ++i)
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int A;
cin >> A;
if ( (N % 500) <= A) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
} | 0 | 70,774,989 |
#include<iostream>
using namespace std;
int main(){
int sum=0;
string s,t;
cin>>s>>t;
for(int i=0;i<s.size();i++){
if(s[i]!=t[i]){
sum++;
}
}
cout<<sum<<"\n";
return(0);
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
const int mod=1000000007,MAX=10001,INF=1<<30;
int main(){
string S,T;cin>>S>>T;
int a=S.size(),b=T.size();
int dp[a+1][b+1];
for(int i=0;i<a+1;i++){
for(int j=0;j<b+1;j++){
dp[i][... | 0 | 38,841,634 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using p = pair<int,int>;
const long long INF = 1ll << 60;
int main() {
int A, B, M; cin >> A >> B >> M;
vector<int> a(A);
vector<int> b(B);
int minA = 100001;
int minB = 100001;
rep(i,A){... | #include <bits/stdc++.h>
#include <map>
using namespace std;
typedef long long ll;
#define vec vector<int>
#define vecll vector<ll>
#define vpair vector<pair<int, int>>
#define vpairll vector<pair<ll, ll>>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define rep(i,n) for(int i=(int)0;... | 0 | 13,604,702 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string n;
int sum = 0, i = 0;
cin >> n;
while(n[i])
{
sum += n[i] - '0';
i++;
}
if (sum % 9 == 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include<iostream>
#include<map>
#include<set>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<stack>
#include<limits>
#include<sstream>
#include<unordered_map>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef int itn;
typedef vecto... | 0 | 505,271 |
#include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <functional>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
#include <b... | #include <cstdio>
#include <iostream>
#include <cmath>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <cstdlib>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#include <set>
#include <memory.h>
#include <iomanip>
#include <bitset>
#include <list>
#include <stack>
#include <deq... | 0 | 46,145,761 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define ff first
#define Shazam ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ss second
#define all(c) c.begin(),c.end()
#define endl "\n"
#define test() int t; cin>>t; while(t--)
#define fl(i,a,b) for(int i = a ; i <b ;... | #include <bits/stdc++.h>
using namespace std;
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
#define P(x) cout << (x) << "\n"
#define p(x) cout << (x)
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define vv(type, c, m, n, i) vector<vector<type>> c(m, vector<type>(n, i)... | 0 | 20,526,055 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, N) for (int i = 0; i < (int)N; i++)
const ll MOD = pow(10,9)+7;
const ll LLINF = pow(2,61)-1;
const int INF = pow(2,30)-1;
ll gcd(ll a, ll b) { if (a<b) swap(a,b); return b==0 ? a : gcd(b, a%b); }
int main() {
ll N, X; cin >> N >> X;
... | #include<bits/stdc++.h>
#include<boost/variant.hpp>
using namespace std;
typedef long long ll;
typedef vector<boost::variant<bool, ll, int, string, double>> any;
template<typename T> inline void pr(const vector<T> &xs){
for(int i=0; i<xs.size()-1; i++) cout<<xs[i]<<" ";
(xs.empty()?cout:(cout<<xs[xs.size()-1]))<<endl... | 0 | 40,855,114 |
#include<bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define ll long long
#define rep(i,n) for(int i = 0; i < int(n); i++)
#define vi vector<int>
using namespace std;
const int INF = 1001001001;
const int MOD = 1e9+7;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template<class T> inline bool ... | #include<bits/stdc++.h>
#define lld long long int
#define F first
#define S second
#define P pair<int,int>
#define pb push_back
#define mod 1e9+7
#define setbits(x) __builtin_popcountll(x)
#define zerobits(x) __builtin_ctzll(x)
#define gcd(x,y) __gcd(x,y)
#define endl '\n'
using namespace std;
lld dp[100010]={0};
names... | 0 | 100,696,787 |
#include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < (b); i++)
#define rrep(i, a, b) for (int i = a; i >= (b); i--)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <class T>
inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
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 (a>b) { a=b; return 1; } return 0; }
#define _overload3(_1,_2,_3,name,...) name
#defin... | 0 | 92,182,576 |
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <algorithm>
#include <bitset>
#inc... | #include<bits/stdc++.h>
using namespace std;
int main() {
long long k, a, b; cin >> k >> a >> b;
k++;
if(a + 2 > b || a + 2 > k) cout << k << endl;
else {
long long res = 0;
k -= a+2;
res = b;
res += k/2 * (b - a);
res += k % 2;
cout << res << endl;
}... | 0 | 64,171,383 |
#pragma target("avx")
#pragma optimize("O3")
#include<bits/stdc++.h>
using ll = int_fast64_t;
using P = std::pair<ll,ll>;
using PP = std::pair<ll,P>;
using V = std::vector<ll>;
template<typename T> using pq = std::priority_queue<T>;
template<typename T> using rpq = std::priority_queue<T, std::vector<T>, std::greater<T>... | #include <iostream>
#include <string>
#include <cstring>
#include <cstdio>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <iomanip>
#if __cplusplus >= 201103L
#include <unordered_map>
#include <unordered_set>
#endif
#de... | 0 | 5,791,085 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
string a,b;
cin >> a >> b;
bool f = true;
for(int i = 0; i < 3; i++){
if(a[i] != b[2 - i]){
f = false;
break;
}
}
if(f) puts("YES");
else puts("NO");
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n,c,k;
cin >>n>>c>>k;
vector<int>a(n);
for(int i=0;i<n;i++)cin>>a[i];
sort(a.begin(),a.end());
int kotae=1;
int count=0;
int jikoku=0;
int start=a[0];
for(int i=0;i<n;i++){
if(a[i]<=start+k&&count<c){
start=min(start,a[i]);
... | 0 | 8,073,232 |
#include<bits/stdc++.h>
using namespace std;
#define ms(a,v) memset(a,v,sizeof a)
#define lll long long
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define Read freopen("input.txt", "r", stdin)
#define Write ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i = 0; i < n; ++i)
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
const ll LIM = 1e14;
ll n; cin >> n;
ll a[n+1]; rep(i,n+1) cin >> a[i];
bool flag = true;
rep(i,n){
if(a[i+1] != 0){
... | 0 | 8,738,462 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int Y = 0;
int64_t A = 2;
int64_t B = 1;
int64_t C = A + B;
if (N == 1){
cout << 1 << endl;
Y = 1;
}
for (int i = 1; i < N; i++){
int64_t A1 = A;
int64_t B1 = B;
int64_t C1 = A + B;
A = B1;
B = C1;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#define all(x) (x).begin(), (x).end()
#define endl '\n'
ll inf = LLONG_MAX;
long double pi = M_PI;
void Yes() {cout << "Yes" << endl;}
void No() {cout << "No" << endl;}
void YES() {cout << "YES" << endl;}
void NO() {cout << "NO"... | 0 | 74,594,081 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.