code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int a, b, res;
int main(){
cin >> a >> b;
res = max(a+a-1, b+b-1);
res = max(res, a+b);
cout << res;
}
| #include<bits/stdc++.h>
#define ll long long
#define all(a) a.begin(),a.end()
#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 n,k;
int ans=1;
signed main(){
ios_base::sync_with_stdio(0);
cin>>n>>k... | 0 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define PI 3.1415926535897932
#define MOD 1000000007;
using namespace std;
long long GCD(long long A,long long B){
if(B==0){
return A;
}
else{
return GCD(B,A%B);
}
}
long long LCM(long long A,long long B){
long long g=GCD(A,B);
return A/g*B;
}
long lon... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
using P = pair<ll, ll>;
string char_to_string(char val) {
return string(1, val);
}
int char_to_int(char val) {
return val - '0';
}
template<class T> in... | 1 |
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int main() {
// 10x + 5y + z = Y
// x + y + z = N
// 9x + 4y = Y - N
... | // ใใใใใใใทใใซใใใใใใใใใ็ฌ
#include <algorithm>
#include <array>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define int long long
signed main() {
cin.tie(0);
ios::sync_with_stdio(0);
int n, x;
cin >> n >> x;... | 0 |
#include <cstdio>
#include <cstdlib>
#include <string>
using namespace std;
int main(){
char str[1000], cmd[7], p[1000];
int a, b, q;
string OUT;
scanf("%s", str);
string STR = str;
scanf("%d", &q);
for(int i = 0; i < q; i++){
scanf("%s %d %d", cmd, &a, &b);
string CMD = cmd;
if(CMD == "replac... | #include <iostream>
#include <string>
#include <cctype>
using namespace std;
int main()
{
string str;
string pri;
string rev;
string p;
string oreder;
int q;
int i;
int a;
int b;
int j;
int k;
cin >> str >> q;
for(k=0;k<q;k++)
{
cin >> oreder;
if(oreder=="print")
{
... | 1 |
#include "bits/stdc++.h"
using namespace std;
#ifndef LOCAL
#define endl '\n'
#endif
#define fr(i, a, b) for(int i = a; i <= b; i++)
#define rf(i, a, b) for(int i = a; i >= b; i--)
#define pf push_front
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#d... | #include<bits/stdc++.h>
using namespace std;
using Int = long long;
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
struct UnionFind{
int num;
vector<int> rs,ps;
UnionFind(){}
UnionFind(int n):num(n),rs... | 1 |
#include <bits/stdc++.h>
using namespace std;
//#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;... | #include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i<(n); ++i)
#define repr(i, a, b) for (int i=a; i<(b); ++i)
#define reprev(i, n) for (int i=n-1; i>=0; --i)
#define reprrev(i, a, b) for (int i=b-1; i>=(a); --i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
cout << fixed ... | 1 |
#include <cstdio>
#include <cstdlib>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define repi(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,a) repi(i,0,a)
#define r... | #include <iostream>
using namespace std;
int main (void){
int a, b, c, d;
cin >> a >> b >> c >> d;
if(a <= b) {
if(c < d){
cout << a + c << endl;
}else{
cout << a + d << endl;
}
}else{
if(c < d){
cout << b + c << endl;
}else{... | 1 |
#include <cstdio>
#include <iostream>
#define debug(...) fprintf(stderr, __VA_ARGS__)
using namespace std;
inline char nc() {
return getchar();
static char buf[100000], *l = buf, *r = buf;
return l==r&&(r=(l=buf)+fread(buf,1,100000,stdin),l==r)?EOF:*l++;
}
template<class T> void read(T &x) {
x = 0; int ... | #include <bits/stdc++.h>
using namespace std;
#define all(v) (v).begin(),(v).end()
#define vc vector
#define sz(v) (int)(v).size()
#define pb push_back
#define FF first
#define SS second
#define fr(i, a, b) for(int i = a; i <= b; i++)
#define pll pair<ll,ll>
#define fi first
#define se second
#define pii pair<int,int>
... | 1 |
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
//#define N 131072 //100000
#define MAXVAL 2147483647 //((long int) ((unsigned long) (1 << 31) - 1)) //*2
int min(int a, int b){return a>b?b:a;}
int max(int a, int b){return a>b?a:b;}
int data[2*131072+100]; //the size of array, for present the tree
//range u... | #include <stdio.h>
#include <stdlib.h>
#include <math.h>
#define INIVAL 2147483647
int *a, *ts, c, s, t, v;
void update(int k, int l, int r)
{
if (r<s || t<=l) return;
if (s<=l && r<=t) {
a[k] = v;
ts[k] = c;
} else if (l<r-1) {
update(((k+1)<<1)-1, l, (l+r)>>1);
update((k+1)<<1, (l+r)>>1, r);
... | 1 |
#include<iostream>
#include<string>
using namespace std;
void sort(int card[5])
{
for(int i=0;i<5;i++)
{
int max=i;
for(int j=i+1;j<5;j++)
{
if(card[max]<card[j])
{
max=j;
}
}
int tmp=card[i];
card[i]=card[max];
card[max]=tmp;
}
}
bool fourcard(int card[5])
{
if((card[0]==card[1]&&card... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
constexpr int INF = 2e9 + 1;
int main() {
int n, l, q;
cin >> n;
vector<int> x(n);
rep(i,n) cin >> x[i];
cin >> l >> q;
vector<vector<int>> to(32, vector<int>(n, 0));
... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
typedef pair<ll,ll> pi;
typedef vector <ll> vi;
typedef vector <pi> vpi;
#define f first
#define s second
#define FOR(i,s,e) for(ll i=s;i<=ll(e);++i)
#define DEC(i,s,e) for(ll i=s;i>=ll(e);--i)
#define pb push_back
#define all(x) (x).begin(),... | #include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
long long int res... | 0 |
#include <bits/stdc++.h>
#define ri register
#define int long long
#define E (n+1)
using namespace std; const int N=200010;
inline int read()
{
int s=0, w=1; ri char ch=getchar();
while(ch<'0'||ch>'9') { if(ch=='-') w=-1; ch=getchar(); }
while(ch>='0'&&ch<='9') s=(s<<3)+(s<<1)+(ch^48), ch=getchar();
ret... | #include<bits/stdc++.h>
using namespace std;
int main()
{ string s;
long long d,sum=0,num;
cin>>s;
long long n=s.size();
for(int i=0 ; i<n ; i++){
d = s[i] - '0';
num = num * 10 + d;
sum+=d;
}
if(num%(sum)==0) cout<< "Yes"<< endl;
if(num%(sum)!=0) cout<< "No"<< endl;
return 0;
}
| 0 |
#include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<vector>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<time.h>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#define all(in) in.b... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = int64_t;
using P = pair<ll, ll>;
template <class T>
using V = vector<T>;
int main() {
ll n, x;
cin >> n >> x;
V<ll> a(n);
rep(i, n) cin >> a[i];
ll ans = 0;
for (int i = 1; i < n; i++) {
if (a[i - ... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n; cin >> n;
while(n)
{
if(n%10 == 7)
{
cout << "Yes" << endl;
return 0;
}
n/=10;
}
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define REPD(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (int i = a; i < int(b); i++)
#define FORD(i, a, b) for (int i = b - 1; i >... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef pair<int, int> P;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).beg... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
static const int MAX = 510000;
static const ll MOD = 1000000007;
int main(){
int N;
cin>>N;
vector<ll> A(N);
for(int i=0; i<N; i++) cin>>A[i];
vector<ll> color(3,0);
ll ans = 1;
for(int i=0; i<N; i++){
ll kake = ... | 1 |
#include <iostream>
#include<algorithm>
#include<utility>
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = 1; i <= (n); i++)
#define drep(i,n) for(int i = (n)-1; i >= 0; i--)
#define srep(i,s,t) for (int i = s; i < t; i++)
#define rng(a) a.begin(),a.end()
typedef long long ll;
using namespa... | #include <iostream>
#include <string>
#include <math.h>
#include <stdio.h>
#include <ctype.h>
using namespace std;
int main() {
int M[13]={0,31,29,31,30,31,30,31,31,30,31,30,31};
string W[7]={"Monday",
"Tuesday",
"Wednesday",
"Thursday",
"Friday",
"Saturday",
... | 0 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll max(ll a, ll b){
if(a>b)return a;
else return b;
}
int main(){
int d,t,s;
cin>>d>>t>>s;
if(t*s>=d){
cout<<"Yes"<<endl;
}else
cout<<"No"<<endl;
} | //#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <stack>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <string>
#include <map>
using namespace std;
typedef long long ll;
#define free freopen ("input.txt", "r", stdin);freopen ("output.txt", "w", stdout);
#define... | 1 |
#include <iostream>
#include <cstdio>
using namespace std;
double l[10];
double v1, v2;
int main()
{
while (scanf("%lf", &l[0]) == 1) {
int sum = l[0];
for (int i = 1; i < 10; i++) {
scanf(",%lf", &l[i]);
sum += l[i];
}
scanf(",%lf,%lf", &v1, &v2);
double x = (sum * v1) / (v1 +... | #include <cstdio>
int main(){
float l[10], v, w;
while(~scanf("%f,%f,%f,%f,%f,%f,%f,%f,%f,%f,%f,%f",l,l+1,l+2,l+3,l+4,l+5,l+6,l+7,l+8,l+9,&v,&w)){
int a = 0, r, d=0, i=0;
for(;i<10;i++)d+=l[i];
for(i=0;i<10;i++){
a += l[i];
if(d*v/(v+w) <= a){r = i + 1;break;}
}
printf("%d\n", r);
}
} | 1 |
#include <iostream>
#include <algorithm>
#include <string>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <iomanip>
#include <set>
#include <ctime>
#include <tuple>
#include <bitset>
#include <assert.h>
#include <de... | #include <bits/stdc++.h>
#include <string>
//#define local
#ifdef local
#include "dbg-macro/dbg.h"
#endif
#define ll long long
#define pi (acos(-1))
#define rep(i, n) for (unsigned long long i = 0; i < (unsigned long long)(n); ++i)
using namespace std;
std::vector<unsigned ll> genprimevec(const unsigned ll N);
int ma... | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std; using ll = long long;
using ull = unsigned long long; using P = pair<int, int>;
const int INF = 1e9; const int MOD = 1000000007;
const int dx[] = {-1,0,1,0}; const int dy[] = {0,-1,0,1};
//const int dx[] = {-1,-1,-1, 0, 0, 1, 1... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
main()
{
string s, sub;
int a;
vector<int> v;
cin >> s;
for(int i = 0; i < s.size()-2; i++){
sub = s.substr(i, 3);
a = stoi(sub);
v.push_back(abs(753-a));
}
sort(v.begin(), v.end());
cout << v.fr... | 1 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<cstring>
using namespace std;
#define MAX_N 10000
int prime[MAX_N];
bool is_prime[MAX_N+1];
int sieve(int n){
int p=0;
memset(is_prime,true,sizeof(is_prime));
is_prime[0]=is_prime[1]=false;
for(int i=2;i<=n;i++){
if(is_prime[i]){
prime[p++]=i;
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int m, nmin, nmax;
while(cin >> m >> nmin >> nmax, m || nmin || nmax){
nmin--;
nmax--;
vector<int> v(m);
for(int i = 0; i < m; i++){
cin >> v[i];
}
pair<int, int> ans = make_pair(0, 0);
for(int i = nmin; i <= nmax; i+... | 0 |
#include <iostream>
#include <ccomplex>
#include <vector>
#include <cassert>
#include <utility>
#include <algorithm>
#include <string>
#include <deque>
#include <queue>
#include <functional>
#include <cmath>
#include <iomanip>
#include <map>
#include <numeric>
#include <list>
#include <assert.h>
#include <math.h>
#incl... | #include<bits/stdc++.h>
#define inv(x) power(x,Mod-2)
#define upd(a,b) a=add(a,b)
using namespace std;
typedef long long ll;
const int Mod=1e9+7;
int add(int a,const int b){a+=b;if(a>=Mod)a-=Mod;return a;}
int sub(int a,const int b){a-=b;if(a<0)a+=Mod;return a;}
int mul(const int a,const int b){return (ll)a*b%Mod;}
int... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define ll long long
long long min(long long x,long long y){return (x<y ? x:y);}
long long max(long long x,long long y){return (x>y ? x:y);}
#define ld long double
int stoi(string s) {return atoi(s.c_str());}
int k... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main(){
ll a, b, k;
cin >> a >> b >> k;
rep(i, k) {
if ( i & 1 ) {
if ( b & 1 ) {
--b;
}
a += b / 2;
b... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define all(x) (x).begin(),(x).end()... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
template<typename T>
long long modpow(const T n,const T p,const T mod);
template<typename T>
long long modinv(const T n,const T mod);
template<typename T>
bool chmax(T &a,const T &b);
template<typename T>
bool chmin(T &a,const T &b);
long long inf=10000... | 1 |
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp> // Common file
//#include <ext/pb_ds/tree_policy.hpp>
//#include <functional> // for less
#define PI acos(-1.0)
#define eps 1e-9
#define ll long long
#define ull unsigned long long
#define nl printf("\n")
#define sf scanf
#define pf printf
#define INF ... | #include <bits/stdc++.h>
//#include <atcoder/all>
#define ll long long int
#define MOD 1000000007
#define P pair<ll,ll>
#define INF 1000000000000000000
//using namespace atcoder;
using namespace std;
int main(void){
ll n, a, b;
cin >> n >> a >> b;
vector<ll> x(n);
for (int i = 0; i < n; i++){
cin >> x[... | 1 |
#include<iostream>
#include<cmath>
using namespace std;
#define MAX_N 3700000
int prime[MAX_N], twin[MAX_N];
void isprime(int c) {
prime[2] = 1;
for (int i = 3; i < c; i += 2) {
for (int j = 3; j <= sqrt(i); j += 2) {
if (i%j == 0) {
goto E;
}
}
prime[i] = 1;
E:;
}
}
void istwin(int d) {
for ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
vector<int> X(4);
for (int i = 0; i < 4; ++i) {
X[i] = a[i]-'0';
}
for (int i = 0; i < (1 << 3); ++i) {
bitset<3> bit(i);
int sum = X[0];
vector<string> ans(7);
ans.push_b... | 0 |
#include<bits/stdc++.h>
//cervello|Phoenix
using namespace std;
#define ll long long int
#define eb emplace_back
#define mk make_pair
#define all(x) x.begin(),x.end()
#define mod 1000000007
vector<bool> prime(1000001,1);
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
for(int i=2;i*i<=1000000;i++)
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const long long INF = 1LL << 60;
using ping = pair<ll, ll>;
int main(){
ll X;
cin >> X;
ll cnt500 = 0;
for (int i = 1;; i++) {
if (i * 500 > X) break;
else
cnt500++;
}
X = X -... | 0 |
#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto& (a): (b))
#define all(v) (v).begi... | #include <cstdio>
#include <cstdlib>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define repi(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,a) repi(i,0,a)
#define r... | 1 |
#include <iostream>
using namespace std;
int main() {
int a,b,n,i,x,y;
while(1){
a = 0;
b = 0;
cin >> n;
if(n == 0)break;
for(i=0;i<n;i++){
cin >> x >> y;
if(x < y){
b += x + y;
}
else if(x == y){
a += x;
b += y;
}
else {
a += x + y;
}
}
cout << a << " " << b << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<double,int> pdi;
typedef pair<double,double> pdd;
typedef pair<double,ll> pdl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vii;
typedef vector<pll> vll;
typedef vec... | 0 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int,int>
#define pdi pair<db,int>
#define mp make_pair
#define pb push_back
#define enter putchar('\n')
#define space putchar(' ')
#define eps 1e-8
#define mo 974711
#define MAXN 200005
//#define ivorysi
using namespace std;
typedef long long ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A,B,ans=1; cin >> A >> B;
if(B==1) cout << 0 << endl;
else if(A>=B) cout << 1 << endl;
else{
int sum = A*ans;
while(sum < B) {
ans++;
sum += (A-1);
}
cout << ans << endl;
}
} | 0 |
#include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <algorithm>
#include <set>
#include <map>
#define vv(a, b, c, d) vector<vector<d> >(a, vector<d>(b, c))
typedef unsigned long long ull;
#define vvi std::vector<std::vector<int> >
#define vvs std::vector<std::vector<string... | #define _USE_MATH_DEFINES
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
using namespace std;
typedef pair<long long int, long long int> P;
long long int INF = 1e18;
long long int MOD = 1e9 + 7;
lon... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define Fast_IO ios::sync_with_stdio(false);
#define fir first
#define sec second
#define mod 998244353
#define int long long
#define INF (int)(1e18)
inline int read()
{
char ch=getchar(); int nega=1; while(!isdigit(ch)) {if(ch=='-'... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define INF 10000000000000000
LL zab[11000];
int main(){
LL n;
cin >> n;
vector<pair<LL,LL> > g;
for(LL i = 0; i < n; i++){
LL a, b;
cin >> a >> b;
a += b;
g.push_back(make_pair(a,b));
}
sort(g... | 1 |
#include <iostream>
#include <string>
#include <vector>
#include <utility>
#include <algorithm>
#include <set>
#include <map>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <cmath>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
int main(int argc,char** argv) {
int n,t;
... | #include<algorithm>
#include<iostream>
#include<cstring>
#include<string>
#include<vector>
#include<cstdio>
#include<cmath>
#include<map>
#include<set>
using namespace std;
int n,a[105];
int main()
{
cin>>n;
for(int i=0;i<n;i++)
cin>>a[i];
int cnt=0;
for(int i=0;i<n;i++)
for(int j=0;j<n-1;j++)
... | 1 |
#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>... | #include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
#include<set>
using namespace std;
int main()
{
int X, Y;
cin >> X >> Y;
int total = 0;
if (X == 1 && Y == 1) {
total = 300000 * 2 + 400000;
cout << total << endl;
return 0;
}
if (X == 1) {
total += 300000;
}
... | 1 |
#include<algorithm>
#include<functional>
#include<cstdio>
using namespace std;
int main(void){
int sci[4], soc[2];
scanf("%d%d%d%d%d%d", sci+0, sci+1, sci+2, sci+3, soc+0, soc+1);
sort(sci, sci+4, greater<int>());
printf("%d\n", sci[0]+sci[1]+sci[2]+max(soc[0], soc[1]));
return(0);
}
| #include <stdio.h>
int main(){
int angka,ratusan,puluhan,satuan;
scanf("%d", &angka);
ratusan = angka % 100;
puluhan = ratusan % 10;
satuan = puluhan;
puluhan = ratusan / 10;
ratusan = angka / 100;
if (ratusan == 7){
printf("Yes\n");
}
else if(puluhan == 7){
printf("Yes\n");
}
else if(satuan == 7){
pr... | 0 |
#include<bits/stdc++.h>
#define MAXN 300005
#define MOD 1000000007
using namespace std;
int n;
char c[MAXN];
long long f[MAXN][4][4];
long long ans=0;
inline int read()
{
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-') f=-f;ch=getchar();}
while(isdigit(ch)){x=x*10+ch-'0';ch=getchar();}
return x*f;
... | #include <bits/stdc++.h>
typedef long long ll;
const int N = 540;
int n;
int pn = 0, c[7930], p[1054];
ll a[N][N];
void sieve(int n) {
int i, j, v;
memset(c, -1, sizeof c);
for (i = 2; i <= n; ++i) {
if (!~c[i]) p[pn] = i, c[i] = pn++;
for (j = 0; (v = i * p[j]) <= n && j <= c[i]; ++j) c[v] = j;
}
}
int mai... | 0 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int n=2;
vector<int> p[2];
int ans[2];
for(int i=0;i<n;++i){
for(int j=0,point;j<10;++j){
cin>>point;
p[i].push_back(point);
}
sort(p[i].begin(),p[i].end(),greater<int>());
ans[i]=p[i][0]+p[i][1]+p[i][2];
}
f... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c,d,e,k; cin >> a >> b >> c >> d >> e >> k;
if(e-a>k) cout << ":(" << endl;
else cout << "Yay!" << endl;
} | 0 |
#include <iostream>
#include <vector>
using namespace std;
const long long INF = 1e18;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<vector<long long>> g(n, vector<long long>(n, INF));
for (int i = 0; i < n; i++) {
g[i][i] = 0ll;
}
for (int i = 0; i < m; i+... | #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 i... | 0 |
#include <iostream>
using namespace std;
int main() {
int n, q, t, cnt = 0;
cin >> n;
int s[n];
for (int i = 0; i < n; i++) {
cin >> s[i];
}
cin >> q;
for (int i = 0; i < q; i++) {
cin >> t;
for (int j = 0; j < n; j++) {
if (t == s[j]) {
cnt += 1;
break;
}
}... | #include <iostream>
#include <set>
#include <algorithm>
using namespace std;
#define V(a) a.begin(), a.end()
typedef set<int> s;
int main()
{
s a[2], C;
for (auto &i : a) {
int n, x;
cin >> n;
while (n--) {
cin >> x;
i.insert(x);
}
}
set_intersection(V(a[0]), V(a[1]), inserter(C, C.end()));
cout... | 1 |
#include <iostream>
#include <vector>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> a(N + 1);
for(int i = 1; i < N + 1; i++) cin >> a[i];
vector<int> ko(N + 1, 0);
int cnt = 0;
for(int i = N; i > 0; i--){
int t = 0;
for(int j = i; j <= N; j += i){
... | #pragma GCC optimize ("O3")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#include<bits/stdc++.h>
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/pb_ds/assoc_container.hpp>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ll long long
#define ld long double
#d... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb(x) push_back(x)
#define all(x) x.begin(), x.end()
using ll... | #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... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
for(int i = 0; i < k; i++) {
if(i % 2 == 0) {
if(a % 2 != 0) {
a--;
}
int h = a / 2;
a = h;
b += h;
} else {
... | #include<iostream>
#include<algorithm>
using namespace std;
int main() {
int a = 0, b = 0, a_sum[11] = { 0 }, b_sum[11] = { 0 };
for (int i = 0; i < 10; i++) {
cin >> a;
a_sum[i] = a;
}
for (int j = 0; j < 10; j++) {
cin >> a;
b_sum[j] = a;
}
a = 0;
sort(a_sum, a_sum + 10);
sort(b_sum, b_sum + 10);
/*f... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<int> data(n+2);
data.at(0)=0;
data.at(n+1)=0;
for (int i=1;i<=n;i++){
int tmp;
cin>>tmp;
data.at(i)=tmp;
}
long long sum=0;
for (int i=0;i<n+1;i++){
sum+=abs(data.at(i+1)-data.at(i... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int vec[n+2];
vec[0]=0,vec[n+1]=0;
for(int i=1;i<=n;i++){
cin>>vec[i];
}
int sum=0;
for(int i=0;i<n+1;i++){
sum+=abs(vec[i]-vec[i+1]);
}
for(int i=1;i<=n;i++){
if(vec[i-1]<=vec[i]&&vec[i]<=vec[i+1]){
cout<<su... | 1 |
#include <bits/stdc++.h>
using namespace std;
void solve(long long A, long long B, long long C, long long D){
if ((A + B) > (C + D)) cout << "Left" << endl;
else if ((A + B) < (C + D)) cout << "Right" << endl;
else cout << "Balanced" << endl;
}
// Generated by 1.1.7.1 https://github.com/kyuridenamida/at... | #include<bits/stdc++.h>
using namespace std;
main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long i,j,k,l,m,n,o,p,q;
while(cin>>m>>n>>o>>p)
{
if(m+n>o+p)
cout<<"Left"<<endl;
else if(m+n<o+p)
cout<<"Right"<<endl;
else
co... | 1 |
#include <iostream>
#include <iomanip>
#include <sstream>
#include <cstdio>
#include <string>
#include <vector>
#include <algorithm>
#include <complex>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <cassert>
#include <climits>
#include <queue>
#include <set>
#include <map>
#include <valarray>
#include... | #include <iostream>
#include <string>
int main(){
const std::string correct_word = "Hoshina";
const std::string find_word = "Hoshino";
int N;
std::cin >> N;
std::cin.ignore();
for(int i = 0; i < N; ++i){
std::string str;
std::getline(std::cin,str);
std::string::size_type pos = str.find(find_word);
... | 0 |
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <cassert>
#include <numeric>
using namespace std;
#define ll long long
vector<int> prime(ll f){
vector<int> ans(1,2);
for(int i = 3;i <= sqrt(f);i ++){
int p = 0;
bool jud = true;
while(ans[p]<=sqrt(i)){
if(i %... | #include <bits/stdc++.h>
using namespace std;
int main() {
long n,ans=0,p=0;
cin >> n;
vector<vector<long>> a(n,vector<long>(n-1));
vector<vector<bool>> b(n,vector<bool>(n));
vector<long> c(n);
queue<long> x;
queue<long> y;
for(long i=0;i<n;i++) for(long j=0;j<n-1;j++) cin >> a[i][j];
for(long i=0;i... | 0 |
#include <bits/stdc++.h>
using namespace std;
int64_t mod = 1000000007;
int64_t large = 9223372036854775807;
double PI = 3.141592653589793;
int main()
{
vector<int> list(3);
int K;
for (int i = 0; i < 3; i++)
cin >> list[i];
cin >> K;
sort(list.begin(), list.end());
cout << list[2] * p... | /* In the name of Allah */
#include<bits/stdc++.h>
using namespace std;
const int N = 2e3 + 5;
int n, m, q, a[N][N], dp[N][N][3];
int get(int b, int xl, int xr, int yl, int yr) {
return dp[xr][yr][b] - dp[xl][yr][b] - dp[xr][yl][b] + dp[xl][yl][b];
}
void read_input() {
cin >> n >> m >> q;
for (int i = 1; i <= n;... | 0 |
///usr/bin/g++ -O2 $0 -o ${0%.cpp} && echo "----------" && ./${0%.cpp}; exit;
#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
c... | //Heaplax
//ๅซ่ฎฉ่ชๅทฑๅๆ
#include<bits/stdc++.h>
#define N 2005
#define LL long long
#define LOG(x) cerr<<#x<<" = "<<x<<endl
#define add_edge(u,v) nxt[++cnt]=head[u],head[u]=cnt,to[cnt]=v
#define open(x) freopen(#x".in","r",stdin),freopen(#x".out","w",stdout)
char ch;bool fs;void re(int& x)
{
while(ch=getchar(),ch<33);
if(... | 0 |
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <math.h> // sqrt
#include <map> // map
#inc... | #pragma GCC optimize(2)
#include<bits/stdc++.h>
#define IN inline
#define RE register
using namespace std;
const int maxn=2e3+5;
int n,m,q;
int l,u,r,d;
int sum[maxn][maxn][3];
char s[maxn];
bool mp[maxn][maxn];
IN int read(){
int ret=0,f=1;char ch=getchar();
while(ch>'9'||ch<'0'){if(ch=='-')f=-f;ch=getchar();}
whil... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,a,b) for (ll i = (a); i < (b); i++)
#define REP(i,n) rep(i,0,n)
#define mod (1000000007)
void solve()
{
int n;cin>>n;
int a[n],b[n],c[n+1],d[n+1];
REP(i,n)cin>>a[i];REP(i,n)cin>>b[i];
REP(i,n+1)c[i]=d[i]=0;
REP(i,n)c... | #include <bits/stdc++.h>
#include<cmath>
#include<string>
#define pb push_back
//#define x first
//#define y second
#define fast ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define all(x) x.begin(),x.end()
#define int long long
using namespace std;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<int> a(n+1,0);
for(int i=1;i<=n;i++)
cin>>a.at(i);
vector<int> d(n+1);
int s=0;
for(int i=0;i<n;i++){
d.at(i)=abs(a.at(i+1)-a.at(i));
s+=d.at(i);
}
d.at(n)=abs(a.at(n));
s+=d.at(n);
for(int i=1;i<=n;i++){
... | // include
// ------------------------------------------------
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <math.h>
using namespace std;
// func
// ------------------------------------------------
int CalcSumOfDigit(int n); // ๅๆกใฎๅใ่จ็ฎใใใ
int getDigit(long long n); // ๆฐๅญใฎๆกๆฐใๅๅพใใใ... | 1 |
#include <iostream>
#include <climits>
#include <vector>
#include <cmath>
using namespace std;
vector<int> A;
vector<int> g;
int n, m;
int cnt;
auto prn=[=](){
for(auto a : A)
cout<<a<<"\n";
};
void _insSort(int g){
for(int i=g-1;i<n;i++){
int maxi=i;
for(int j=i+g;j<n;j+=g... | #include <iostream>
#include <cmath>
using namespace std;
int insertionSort(int a[], int n, int g){
int cnt = 0;
for(int i=g;i<n;++i){
int v = a[i];
int j = i - g;
while(j>=0 && a[j]>v){
a[j+g] = a[j];
j = j - g;
++cnt;
}
a[j+g] = v;
}
return cnt;
}
int* interleavedlist(int n, int *m){
int i =... | 1 |
#include<cstdio>
#include<cmath>
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
while(1){
int N;
cin>>N;
if(!N)break;
int rui[10000]={0};
for(int i=1;i<=N;i++){
int a;
cin>>a;
rui[i]=rui[i-1]+a;
}
in... | //#define _GRIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
// ?????ยฌ???????????ยฌ??????
#pragma region MACRO
#define P(x) cout << (x) << endl
#define p(x) cout << (x)
#define PED cout << "\n"
#define rep(i,n) for(int i=0; i<(int)n; ++i)
#define REP(i,x,n) for(int i=x; i<(int)n; ++i)
#define repi(i,n) for(in... | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define reps(i,s,n) for(int i=(s); i<(n); i++)
#define all(v) v.begin(),v.end()
#define outve(v) for(auto i : v) cout << i << " ";cout << endl
#define outmat(v) for(auto i : v){for(auto j : i) cout << j << " ";cout << endl;}
#define in(n,v) for(int i=0;... | ///Bismillahir Rahmanir Rahim
#include<bits/stdc++.h>
#define int long long
#define fi first
#define si second
#define mp ... | 1 |
#include <bits/stdc++.h>
#define rep(i, j, k) for(int i = j; i <= k; ++i)
#define dep(i, j, k) for(int i = j; i >= k; --i)
#define enter putchar('\n')
#define fi first
#define se second
#define mp(x, y) make_pair(x, y)
typedef long long ll;
using namespace std;
const int maxn = 3e5 + 5;
const int LOG = 35;
const int... | #include<iostream>
#include<cstdio>
#include<vector>
#include<string>
#include<cstring>
#include<functional>
#include<stack>
#include<queue>
#include <iomanip>
#include<map>
#include<limits>
#include<cmath>
#include<algorithm>
#include<bitset>
#include<utility>
#include<complex>
#include<cstdlib>
#include<set>
#include... | 1 |
#include<iostream>
using namespace std;
long long n[50], p;
int main() {
n[0] = 1; n[1] = 1; n[2] = 2;
for (int i = 3; i < 40; i++) {
n[i] = n[i - 1] + n[i - 2] + n[i - 3];
}
while (true) {
cin >> p;
if (!p) { break; }
cout << (n[p] + 3649) / 3650 << endl;
}
} | #include<bits/stdc++.h>
#define N 1000006
using namespace std;
int f[N][2],n;
char s[N];
int main()
{
f[0][1]=1;
scanf("%s",s+1);
n=strlen(s+1);
for (int i=1;i<=n;i++)
f[i][0]=min(f[i-1][0]+(s[i]^48),f[i-1][1]+10-(s[i]^48)),
f[i][1]=min(f[i-1][0]+(s[i]^48)+1,f[i-1][1]+9-(s[i]^48));
printf("%d\n",min(f[n][0],f[n... | 0 |
#include<bits/stdc++.h>
#define PI acos(-1.0)
#define eps 1e-67
#define pf printf
#define sf scanf
#define sd(n) scanf("%d",&n)
#define sd2(n1,n2) scanf("%d %d",&n1,&n2)
#define slf(n) scanf("%lf",&n)
#define slf2(n1,n2) scanf("%lf %lf",&n1,&n2)
#define sLf(n1) scanf("%Lf",&n1)
#define sLf2(n1,n2) scanf("%Lf %Lf",&n1,&... | #include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long LL;
typedef pair<LL,LL> P;
const LL mod=1000000007;
const LL LINF=1LL<<60;
const int IN... | 0 |
// tsukasa_diary's programing contest code template
#include <bits/stdc++.h>
using namespace std;
// define
#define for_(i,a,b) for(int i=a;i<b;++i)
#define for_rev(i,a,b) for(int i=a;i>=b;--i)
#define allof(a) a.begin(),a.end()
#define minit(a,b) memset(a,b,sizeof(a))
#define size_of(a) (int)a.size()
// typedef
typede... | #include <iostream>
using namespace std;
int main() {
int n, m, d;
cin >> n >> m >> d;
double ans = (double)2 * (n-d) / n / n * (m-1);
if (d == 0) ans /= 2;
printf("%.15lf\n", ans);
return 0;
}
| 0 |
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <functional>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#include <tuple>
#include <cassert>
#include <exception>
#include <io... | #include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
#include<queue>
#define PAIR pair<long long,int>
using namespace std;
class island{
public:
vector<PAIR> road;
void add(int goal,int much){
road.push_back(PAIR(much,goal));
}
};
long long func(vector<island>&,int,int);
int... | 0 |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int mod=1000000007;
const int INF=1001001001... | //
// ALDS12A_BubbleSort.cpp
// CppAlgorithmSet
//
// Created by ่ๆฅๆบ on 2018/12/19.
// Copyright ยฉ 2018 ่ๆฅๆบ. All rights reserved.
//
#include <iostream>
using namespace std;
template <class T>
void printArray(T Array, int size)
{
for (int i = 0; i < size; i++) {
cout << Array[i];
if (i != siz... | 0 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rrep(i, n) for (ll i = n - 1; i >= 0; i--)
#define Rep(i, r, n) for (ll... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
const int INF=1e9+7;
const ll LINF=9223372036854775807;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld EPS = 1e-10; //ๅพฎ่ชฟๆด็จ๏ผEPSใใๅฐใใใจ0ใจๅคๅฎใชใฉ๏ผ
... | 1 |
#include <bits/stdc++.h>
#define booga cout << "booga" << endl
#define ll long long int
/* run this program using the console pauser or add your own getch, system("pause") or input loop */
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n,a,b;
cin >> n >> a >> b;
if(n == 1){
cout <... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using P = pair<int, int>;
c... | 1 |
#include <bits/stdc++.h>
const int N = 108;
int n;
int a[N], b[N];
int main() {
int i, mid;
scanf("%*d%d", &n);
for (i = 0; i < n; ++i) scanf("%d", a + i);
if (n == 1) return *a == 1 ? puts("1\n1\n1") : printf("%d\n2\n1 %d\n", *a, *a - 1), 0;
mid = std::partition(a, a + n, [] (const int x) -> bool {return x % 2... | #include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int MAXN = 100 + 10;
int total, N;
int a[MAXN]= {0};
int st[MAXN]= {0}, ed[MAXN]= {0};
int odd[MAXN]= {0}, ocnt = 0;
int ans[MAXN]= {0}, acnt = 0;
int getnum () {
int num = 0;
char ch = getchar ();
while (! isdigit (ch))
ch =... | 1 |
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <sstream>
#include <iomanip>
#include <set>
#include <queue>
#include <stack>
#include <utility>
#include <stdio.h>
#include <unistd.h>
using namespace std;
typedef long long int ll;
#define rep(i, n) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll a,ans=1;cin >> a;
const ll p=1000000007;
vector<ll> v(a,0);
for (ll i=1;i<=a;i++){
int cur=i;
for (int b=2;b<=i;b++){
while(cur%b==0){
cur/=b;
v[b-1]++;
... | 1 |
#include <iostream>
#include <string>
using namespace std;
int main() {
int N, M, Q;
cin >> N >> M >> Q;
string S[N];
for (int i = 0; i < N; ++i) {
cin >> S[i];
}
int vcnt[N + 1][M + 1];
fill(vcnt[0], vcnt[N + 1], 0);
// vcnt[i][j] = (1, 1)~(i, j)ไธญใฎ้ใในใฎๆฐ
// vcnt[i][0] = v... | #include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define sf scanf
#define pf printf
#define pb push_back
#define mp make_pair
#define IN freopen("input.txt","r",stdin)
#define OUT freopen("output.txt","w",stdout)
#define FOR(i,a,b) for(i=a ; i<=b ; i++)
#defin... | 1 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n); i >= 0; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 25;
const int MOD = 1e9+7;
int a[100100];
int main() {
int n, k;
cin >> n >> k;
rep(i,n) cin >> a[i];
... |
#include<bits/stdc++.h>
#define lln long long int
#define llu unsigned lln
#define sc(n) scanf("%d",&n);
#define scl(n) scanf("%lld",&n);
#define scd(n) scanf("%lf",&n);
#define pf(res) printf("%d\n",res);
#define pfl(res) printf("%lld\n",res);
#define pfd(res) printf("%lf\n",res);
#define maxii 100005
using namespace... | 0 |
#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 a , b, c, d;
cin >> a >> b >> c >> d;
int s = min(a,b);
int t = min(c,d);
cout << s+t << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int64_t A,B;
int K;
cin >> A >> B >> K;
while(K>0){
A/=2;
B+=A;
K--;
if(K==0){
break;
}
B/=2;
A+=B;
K--;
}
cout << A << " " << B << endl;
return 0;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int gcd(int a,int b){
if(b==0){
return a;
}
return gcd(b,a%b);
}
int main(){
int n,k,a[100010],i;
cin >> n >> k;
int z=0;
for(i=0;i<n;i++){
cin >> a[i];
if(a[i]>=k){
z=1;
}
}
if(z==0){
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,v,m,i;
map<int,int> m0,m1;
vector<pair<int,int>> v0,v1;
cin>>n;
for(i=0;i<n;i++){
cin>>v;
if(i%2==0){
if(m0.count(v)) m0.at(v)++;
else m0[v]=1;
}
else if(i%2==1){
if(m1.count(v)) m1.at(v)++;
else m1[v]=1;
... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<int> dy = { 0,1,0,-1 };
vector<int> dx = { 1,0,-1,0 };
int main() {
int h, w; cin >> h >> w;
vector<vector<char>> c(h + 2, vector<char>(w + 2, 'e'));
for (int i = 1; i <= h; i++) {
for (int j = 1; j <= w; j++) {
cin >> c[i][j];
}
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, s, e) for (int i = s; i < e; ++i)
#define sort_(a) stable_sort(a.begin(), a.end())
#define rsort(a) stable_sort(a.rbegin(), a.rend())
#define sum(a) accumulate(a.begin(), a.end(), 0LL)
#define join(a, d) accumulate(a.begin() + 1, a.end(), a[0], [](string s, s... | 0 |
#include <queue>
#include <vector>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
const int N = 2e6;
int n, m;
int tot = 0, tag = 0, cnt = 0;
int vis[N], b[N], fa[N], num[N], Link[N], dis[N];
struct node { int x, y; };
struct edge { int y, next, v; } e[N*2];
vector < node > a[N];
int... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = vector<string>;
using vld = vector<ld>;
using vvld = vector<vld>;
typedef pair<ll, ll> P;
... | 0 |
#include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n)... | #include<iostream>
#include<iomanip>
#include<cstdio>
#include<algorithm>
#include<cassert>
#include<cmath>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<queue>
#include<stack>
#include<list>
#include <cstring>
#include <functional>
//#include<unordered_map>
//#include<unordered_set>
using name... | 0 |
#include <iostream>
#include <vector>
#include <string>
using namespace std;
typedef vector<vector<int> > Matrix;
int w,h,xs,ys,xg,yg,n,color;
string res = "NG";
Matrix board(101, vector<int>(101,0));
void write(Matrix &board,int c, int d, int x, int y){
int width,length;
if(d == 0){ width = 4; length =2; }
i... | #include <iostream>
#include <cstring>
using namespace std;
int dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
int w,h,xg,yg,xs,ys,n,fld[101][101];
bool dfs(int x,int y,int c){
if(c==0||fld[x][y]!=c)return false;
if(x==xg&&y==yg)return true;
fld[x][y]=0;
for(int i=0;i<4;i++)if(dfs(x+dx[i],y+dy[i],c))return true;
return false;... | 1 |
#include <iostream>
using namespace std;
int main() {
int x;
cin >> x;
cout << x + (x*x) + (x*x*x);
return 0;
} | #include <iostream>
#include <string>
#include <stack>
#include <math.h>
#include <algorithm>
#include <cstdlib>
#include <ctime>
#include <vector>
using namespace std;
int main()
{
string s,t;
cin >> s;
t = s;
for (int i = 0; i < s.size(); i++) {
t[i] = s[s.size() - i-1];
}
cout << t << endl;
} | 0 |
#include <iostream>
#include <iomanip>
#include <string>
#include <stack>
#include <vector>
#include <complex>
#include <math.h>
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <iterator>
#include <map>
#include <set>
#include <queue>
#include <list>
#include <regex>
#include <... | #include <bits/stdc++.h>
#define INF 100000000000
#define ll long long
#define pll pair<ll, ll>
using namespace std;
int main()
{
ll N;
cin >> N;
vector<ll> A(N);
for (ll i = 0; i < N; ++i) {
cin >> A.at(i);
}
sort(A.begin(), A.end());
ll ans = 0;
vector<bool> used(N, false);
for (ll i = N - 1; i... | 1 |
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
char c[301000];int dp[301000][3][3],hj[301000],mi[301000],mod=1e9+7;
int main()
{
scanf("%s",c);dp[0][0][0]=1;int n=strlen(c);
mi[0]=1;for(int i=1;i<=n;i++)mi[i]=(mi[i-1]*2)%mod;
for(int i=n;i>=1;i--)if(c[i-1]=='?')hj[i]=hj[i+1]+1;else hj[i]=... | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
const int N = 300005;
const int Q = 1e9 + 7;
inline void add(int &A , int B) {
A += B;
if (A >= Q) A -= Q;
}
map< pair<vector<bool>,bool> , int> h[2];
char str[N];
int main() {
cin >> str;
int cur = 0 , nxt = 1;
h[cur][make_pair... | 1 |
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
const ll MOD=1e9+7;
int main(){
int n;
cin>>n;
vector<int> A(n);
rep(i,n) cin>>A[i];
int x=0,y=0,z=0;
ll ans=1;
rep(i,n){
if(A[i]==x &&... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for(int i = int(a); i < int(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define all(x) (x).... | 1 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i <(n); ++i)
#define ALL(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
int main(){
int r;
cin >> r;
if(r < 1200){
cout << "ABC" << endl;
return 0;
}
if(r < 2800){... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define invrepr(i,a,b) for(int i=b-1;i>=a;i--)
#define invrep(i,n) invrepr(i,0,n)
#define repitr(itr,a) for(auto itr=a.begin();itr!=a.end();++itr)
#define P pair<int,int>
co... | 0 |
#include<iostream>
#include<string>
#include<cmath>
#include<vector>
#include<stack>
#include<queue>
#include<algorithm>
#include<complex>
using namespace std ;
typedef vector<int> vi ;
typedef vector<vi> vvi ;
typedef vector<string> vs ;
typedef pair<int, int> pii;
typedef long long ll ;
#define loop(i,a,b) for(int... | //Name: Sale Reult
//Level: 1
//Category: ใใใ ใ
//Note:
#include <iostream>
#include <map>
#include <vector>
using namespace std;
bool solve() {
int N;
if(!(cin >> N)) return false;
if(!N) return false;
map<int,long long> res;
vector<int> ord;
for(int i = 0; i < N; ++i) {
int id, v, c... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
int main(int argc, char *argv[]){
int n, m;
cin >> n >> m;
vector<vector<lli> > g(n, vector<lli>(n, 1LL<<40));
int from, to, cost;
for (int i = 0; i < n; i++) {
g[i][i] = 0;
}
for (int i = 0; i < m; i++) {
cin >> from >> to >>... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i <= (n); i++)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
using ll = long long;
using Grid = vector<vector<int>>;
using vi = vector<int>;
int main() {
... | 0 |
#include <iostream>
using namespace std;
int main(){
int d;
cin>>d;
string buf;
string key="Hoshino";
string newkey="Hoshina";
unsigned int p;
getline(cin,buf);
while(d--){
getline(cin,buf);
while((p=buf.find(key,0))!=string::npos){
buf.replace(p,key.size(),newkey);
}
cout<<buf<<endl;
}
return 0;
} | #include<iostream>
#include<string>
#include<cstdio>
using namespace std;
int main()
{
int n;
cin>>n;
getchar();
while(n!=0){
string str;
getline(cin,str);
for(int i=0;i<str.length();i++){
if(str[i]=='H' && str[i+1]=='o' && str[i+2]=='s' && str[i+3]=='h' && str[i+4]=... | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); rit... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define fi first
#define se second
typedef pair<ll,ll> P;
#define Mod 1000000007
using VP = vector<P>; using VVP = vector<VP>;
using VI = vector<ll>; using VVI = vector<VI>; using VVVI = vector<VVI>;
#define INF 1ll<<59
ll modinv(l... | 0 |
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#pragma GCC optimize("Ofast")
//*********************************************DO IT NOW****************************************************************
#include<bits/stdc++.h>
#include<random>
#define int long long
#define pp pair<int,int>
#define ss second
#... | /*
ุจูุณูู
ู ูฑูููููฐูู ูฑูุฑููุญูู
ููฐูู ูฑูุฑููุญููู
ู
ูุข ุงููููู ุงูููุง ุงููููู ู
ูุญูู
ููุฏู ุฑูุณูููู ุงููููู
*/
/*
Auther: n0oO0o0Ob(None of them)
from : https://n0oo0o0ob.sleek.page/
*/
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define pb push_back
... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define fio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define ll long long
#define ull unsigned long long
#define ld long double
#define endl "\n"
#define ff first
#define ss second
#define pi pair<ll, ... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1001001001LL;
constexpr long long LINF = 1001001001001001001... | 0 |
#include <bits/stdc++.h>
#define rep2(x,fr,to) for(int x=(fr);x<(to);x++)
#define rep(x,to) for(int x=0;x<(to);x++)
#define repr(x,fr,to) for(int x=(fr);x>=(to);x--)
#define all(c) c.begin(),c.end()
#define sz(v) (int)v.size()
using namespace std;
typedef long long ll; typedef vector<int> VI; typedef pair<int,int> pi... | // https://atcoder.jp/contests/abc088/tasks/abc088_d
#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(int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i... | 0 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, b) for (int i = 0; i < (b); i++ )
typedef pair<int,int> P;
typedef long long ll;
const int INF = 100000000;
const double PI=acos(-1);
ll dp[10010][2][110];
int main(){
int K,T;
cin >> K >> T;
map<int,int> S;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,s,n) for(int i = s; i < (int)(n); i++)
int main() {
int k,t;
cin >> k >> t;
vector<int>a(t);
rep(i,0,t) cin >> a[i];
sort(a.begin(),a.end());
if(a[t-1] <= (k+1)/2){
cout << 0 << endl;
return 0;
}
cout << (a[t-1]-(... | 1 |
#include <bits/stdc++.h>
//#pragma GCC diagnostic error "-Wconversion"
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(vec) vec.begin(), vec.end()
#define mp(a, b) make_pair(a, b)
typedef long long ll;
const ll INF = 1LL << 60;
const ll MOD = (1e9 + 7);
using namespace std;
using pii = pair<int, int>;
us... | // #define USE_CPP11
// #define USE_PRINTF
#include <iostream>
#include <iomanip>
#include <map>
#include <set>
#include <utility>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <list>
#include <queue>
#inclu... | 0 |
#include <bits/stdc++.h>
using namespace std;
vector<long long> kosu(1001);
void divisor(long long n) {
for (long long i = 2; i * i <= n; i++) {
while(n % i == 0){
kosu[i]++;
n /= i;
}
}
if(n != 1){
kosu[n]++;
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << set... | #include<iostream>
using namespace std;
int main(){
int N;
cin >> N;
int a,b,c;
a=N/100, b=(N/10)%10, c=N%10;
if (a == 7 || b == 7 || c == 7){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define lld long long int
int main(void) {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin>>s;
int max=0;
if(s[0]=='R')
{
max++;
}
if(s[1]=='R')
max++;
if(s[2]=='R')
max++;
if(max==2)
{
if(s[1]!='R')
cout<<1<<"\n";
... | // #pragma comment(linker, "/stack:200000000")
// #pragma GCC target ("avx2")
// #pragma GCC optimization ("O3")
// #pragma GCC optimization ("unroll-loops")
// #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include "bits/stdc++.h"
#define fastio i... | 1 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <bitset>
#include <map>
#include <unordered_map>
#include <list>
#include <numeric>
#include <utility>
#include <iterator>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include... | #include <iostream>
#include <algorithm>
int main()
{
int cs[5], i, j, t, r, fl, fl2;
char c, s[8][11] = {"null", "one pair", "two pair", "three card", "straight", "full house", "four card"};
while (std::cin >> cs[0] >> c >> cs[1] >> c >> cs[2] >> c >> cs[3] >> c >> cs[4])
{
r = 1;
std::sort(cs, cs+5);
int n[... | 0 |
#include <stdio.h>
int main()
{
char S[105];
char T[105];
scanf("%s", S);
scanf("%s", T);
printf("%s%s\n", T, S);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define fast() ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long int
#define test() ll t; cin>>t; while(t--)
#define lp0(i,begin,end) for(ll i=begin;i<end;i++)
#define lp1(i,begin,end... | 1 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
using namespace std;
int main()
{
int n,m;cin >> n >> m;
vector<int> a(m);
rep(i,m) cin >> a[i];
vector<vector<int>> dp(m+1, vector<int>(n+1, -1));
sort(a.... | #include<bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
#define dbg(x...) do{cout << "\033[32;1m" << #x << "->" ; err(x);} while(0)
void err(){cout << "\033[39;0m" << endl;}
template<template<typename...> class T,typename t,typename... A>
void err(T<t> a,A... x){for (auto v:a) cout << v << ' '; err(x...);}
te... | 0 |
#include<bits/stdc++.h>
#define ls (rt<<1)
#define rs ((rt<<1)|1)
#define cmin(a,b) a=min(a,b)
using namespace std;
typedef long long ll;
ll n,Q,A,B;
ll rd()
{
ll rx=0,fx=1;char c=getchar();
while(c<48||c>57)
{
if(c=='-') fx=-1;
c=getchar();
}
while(c>=48&&c<=57)
{
rx=rx*10+c-48;
c=getchar();
}
return r... | #include <iostream>
using namespace std;
const int MAX = 10e5;
int main() {
int N; cin >> N;
int dp[MAX];
for (int i = 0; i < MAX; i++) {
dp[i] = -1;
}
for (int i = 0; i < N; i++) {
int A; cin >> A;
auto it = lower_bound(dp + MAX - N, dp + MAX, A);
*--it = A;
}
int ans = 0;
for (in... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define endl "\n"
typedef long long ll;
const double pi=3.14159265358979323846;
int ctoi(const char c) {
if ('0' <= c && c <= '9') return (c - '0');
return -1;
}
vector<int> input(int n) {
vector<int> vec(n);
... | #include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
int size = s.size();
if(size==2){
cout << s << endl;
}else{
cout << s.at(2) << s.at(1) <<s.at(0) << endl;
}
} | 1 |
#include <iostream>
#include <cstring>
#include <cmath>
#include <vector>
#include <algorithm>
#include <stdio.h>
#include <math.h>
#include <stdlib.h>
#include <set>
#include <map>
#include <iterator>
#include <stack>
#include <string.h>
#include <cstdlib>
#include <queue>
#include <list>
#include <string>
using name... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i,x) for(int ... | 0 |
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#define LL long long
#define mod 998244353
#define inv2 499122177
#define M 1000020
using namespace std;
namespace IO{
int Top=0; char SS[20];
void write(int x){
if(!x){putchar('0');return;} if(x<0) x=-x,putchar('-');
while(... | // g++ -std=c++11 a.cpp
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<unordered_map>
#include<utility>
#include<cmath>
#include<random>
#include<cstring>
#include<queue>
#include<stack>
#include<bitset>
#include<cstdio>
#include<sstream>
#include<iomanip>... | 1 |
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <map>
#include <numeric>
#include <string>
#include <cmath>
#include <iomanip>
#include <queue>
#include <list>
#include <set>
#include <stack>
#include <cctype>
#include <cmath>
#include <bitset>
using namespace std;
/* typedef */
... | #include "bits/stdc++.h"
#define REP(i,num) for(int i=0;i<(num);++i)
#define ALL(c) c.begin(),c.end()
#define LOOP(i) while(i--)
#define PRINTALL(c) for(auto& x:c){cout<<x<<' ';}cout<<endl;
#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,ll>& rhs){return lhs.c comp rhs.c;}
using namespace std;
using ... | 1 |
#include <bits/stdc++.h>
#define rep(i,a,n) for(int i=a;i<n;i++)
#define repr(i,a,n) for(int i=a;i>=n;i--)
#define INF 999999999
#define INF_M 2147483647
#define pb(a) push_back(a)
using namespace std;
typedef pair<int, int> pii;
typedef long long int ll;
typedef vector<pii> VP;
int dy[]={0, 0, 1, -1};
int dx[]={1, -... | #include <cstdio>
#include <algorithm>
using namespace std;
const int MAXN=1007;
char s1[MAXN];
char s2[MAXN];
int dp[MAXN][MAXN];
int main(){
scanf("%s",s1+1);
scanf("%s",s2+1);
for(int i=1;s1[i];i++) dp[0][i]=i;
for(int i=1;s2[i];i++) dp[i][0]=i;
// puts(s1+1);
// puts(s2+1);
int i=1... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int INF = 1000000000;
#define REP(i,s,n) for(int i=(int)(s);i<(int)(n);i++)
#define rep(i,n) REP(i, 0, n)
typedef pair<double, string> P;
const double EPS = 1.0e9;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int N;
wh... | #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;
//datatypes
#define ll long long
#define vi vector<int>
#define vll vector<ll>
#define si set<int>
#define vii vector<ii>
#define ii pair<int,int... | 0 |
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn=100100;
inline long long read(){
long long x=0,f=1;char c=getchar();
while(c>'9'||c<'0'){if(c=='-') f=-1;c=getchar();}
while(c>='0'&&c<='9'){x=x*10+c-'0';c=getchar();}
return f*x;
}
int val[maxn],tmp[maxn],n,num[... | #include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int N=5e5;
int x[N],opt[N],id[N],p[N],vis[N],n,m,tmp[N];
long long s[N],K;
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)scanf("%d",x+i),id[i]=i;
for(int i=n;i>=1;i--)x[i]-=x[i-1];
scanf("%d%lld",&m,&K);
for(int i=1... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
int main() {
ll n,x;
cin >> n >> x;
vector<ll>a(n);
for(ll i=0;i<n;i++){
cin >> a[i];
}
ll ans=0;
for(ll i=1;i<n;i++){
if(a[i-1]+a[i]>x){
ll k=(a[i]+a[i-1]-x);
an... | #include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
#include<queue>
#include<cmath>
#include<algorithm>
using namespace std;
typedef long long ll;
const int mod=1e9+7;
int main(){
int n,x,a;
while(~scanf("%d%d%d",&n,&x,&a)){
ll ans=0;
if(a>x)
ans+=a-x,a=x;
... | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.