code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 44 101M |
|---|---|---|---|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll pref[101000];
ll suff[101000];
ll ara[101000];
int main()
{
ll a,b,c;
cin >> a >> b >> c;
if(a+b>=c)
cout << "Yes" << endl;
else cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(v) v.begin(), v.end()
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... | 1 | 30,076,466 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
int sum=0;
for(auto& i:s)sum+=i-'0';
if(sum%9==0){
cout<<"Yes";
}
else {
cout<<"No";
}
} | #include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <string>
using namespace std;
typedef long long ll;
#define rept(_i,iv,n,type) for(type _i=(type)(iv);_i<(type)(n);++_i)
#define rept0(_i,n,type) rept(_i,0,n,type)
#define repi0(_i,n) rept(_i,0,n,int)
#define repl0(_i,n) rept(_i,0,n,ll... | 1 | 66,347,292 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
string o, e;
cin >> o >> e;
for (int i=0; i<o.size(); i++){
cout << o[i];
if (i < e.size()) cout << e[i];
}
cout << endl;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
int main() {
string O,E;
cin >> O >> E;
string ans;
for (int i = 0;i<E.size();++i) {
ans += O[i];
ans += E[i];
}
if (O.size() !=E.size()) {
ans += O[O.size() - 1];
}
cout << ans << endl;
return 0;
} | 1 | 60,338,625 |
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
int main(void) {
int N, B[3];
cin >> N >> B[0] >> B[1] >> B[2];
vector <int>l(N);
for (int i = 0; i < N; i++) cin >> l[i];
unsigned int total_cost = 3000;
for (unsigned int i = 0; i < pow(4, N); i++) {
ve... | #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... | 1 | 59,528,012 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int n,m;
bool adj[10][10];
int go(int u,int mask){
int cnt=0;
for(int v=0;v<n;++v)
if(!(mask>>v&1)&&adj[u][v]){
int nmask=mask|(1<<v);
if(nmask==(1<<n)-1) return 1;
else cnt+=go(v,mask|(1<<v));
}
return cnt;
}
int main() {
ios_base::syn... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 1'000'000'007;
const ld PI = acos(-1);
const ld EPS = 0.0000000001;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define rep(i, n) for(ll i=0; i<(ll)(n); i++)
#define repd(i, n) for(ll i=n-... | 1 | 75,196,027 |
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
vector<int> twoadd(vector<int> v, int N){
v[N-1]+=1;
int ind = N-1;
int j=N-1;
for(j=N-1;j>=1;j--){
if(v[j]>1){
v[j-1]+=1;
v[j]=0;
}
}
return v;
}
long long f... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long;
const int INF = 1001001001;
const ll INF_LL = 1001001001001001001LL;
int main(void){
int n; cin >> n;
vector<int> a(n);
rep(i,n) cin >> a[i];
double ans = 0;
rep(i,n) ans+=1./(double)a[i];
ans = ... | 1 | 2,028,158 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define FORR(i, a, b) for (int i = b - 1; i >= a; --i)
#define SORT(v) sort(v.begin(), v.end())
#define SORTR(v) sort(v.rbegin(), v.rend())
#define ... | #include <iostream>
#include <vector>
using namespace std;
vector<vector<bool>> con(8, vector<bool> (8, false));
vector<bool> visited(8,false);
int dfs(int v, int n, vector<bool> visited) {
bool flag = true;
for(int i = 0; i < n; i++) {
if(visited.at(i) == false)
flag = false;
}
if(flag)... | 1 | 60,692,501 |
#include<iostream>
using namespace std;
long long int gcd(long long int a,long long int b){
if(a%b==0) return(b);
else return(gcd(b,a%b));
}
int main(){
long long int N,K;
cin>>N>>K;
cout<<((N/gcd(N,K))*3-3)*gcd(N,K)<<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
#define rep(i,n) for (ll i=0;i<n;++i)
#define rep2(i,a,b) for (ll i=a;i<b;++i)
const ll MOD=1000000007;
string alp="abcdefghijklmnopqrstuvwxyz";
template<class T> inline bool chmin(T &a,T b){
if (... | 1 | 63,951,836 |
#include<iostream>
using namespace std;
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int k;
cin >> k;
string s;
cin >> s;
if (s.length() <= k) {
cout << s;
} else {
s[k] = '.';
s[k + 1] = '.';
s[k + 2] = '.';
s[k + 3] = '\0';
for (int... | #include <bits/stdc++.h>
#include <iostream>
#include <stdio.h>
#define MAX 200005
typedef long long ll;
using namespace std;
int main ()
{
int k;
cin >> k;
string s;
cin >> s;
string ans;
string dots("...");
if (k >= s.length())
{
cout << s << endl;
}
else
... | 1 | 80,909,795 |
#include <iostream>
#include <vector>
#include <numeric>
#include <algorithm>
#include <cmath>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < (n); ++i)
int main(){
int k; cin >> k;
string s; cin >> s;
if(s.size()>k){
rep(i,k) cout << s[i];
cout << "..." << en... | #include <bits/stdc++.h>
using namespace std;
int main(void){
int k;
char s[110];
cin>>k;
cin>>s;
int len = strlen(s);
if(len <= k){
cout<<s<<endl;
}
else{
for(int i = 0; i < k; i++){
cout<<s[i];
}
cout<<"..."<<endl;
}
return 0;
} | 1 | 48,487,542 |
#include <iostream>
using namespace std;
int main(){
long n;
cin >> n;
long A[10001] = {};
for (long i = 0; i < n; i++){
long x;
cin >> x;
A[x]++;
}
long k = 0;
for (long i = 0; i <= 10000; i++){
for (long j = 0; j < A[i]; j++){
if (k) cout << " ";... | #include <bits/stdc++.h>
#include<cstdio>
#include<cstdlib>
#include<string>
#include<iostream>
#include <math.h>
#include<algorithm>
using namespace std;
#define MAX 2000000
#define K 10000
int A[MAX],C[K+1],B[MAX+1];
void argCout(int A[],int N){
cout<<A[1];
for(int i=2;i<N;i++){
printf(" %d",A[i]);
}
cout... | 1 | 9,016,549 |
#include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
ll n, k, a[100000];
int main() {
while (1) {
scanf("%lld%lld", &n, &k);
if (n == 0) break;
for (ll i = 0; i < n; i++) scanf("%lld", &a[i]);
ll sum = 0;
for (ll i = 0; i < k; i++) sum += a[i];
ll ans = sum;
for ... | #include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define RFOR(i,a,b) for(int i=(b) - 1;i>=(a);i--)
#define REP(i,n) for(int i=0;i<(n);i++)
#define RREP(i,n) for(int i=n-1;i>=0;i--)
#define PB push_back
#define INF (1<<29)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#... | 1 | 8,717,049 |
#include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
#define V vector
#define P pair
typedef long long ll;
const int INT_INF = 1e9;
const ll INF = 1LL << 30;
int main() {
ll n, k; cin >> n >> k;
V<ll> sum(k);
for(int i = 1; i <= n; i++) sum[i % k]++;
ll ans = 0;
for(int a ... | #include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
int main(){
ll N,K;
scanf("%lld %lld",&N,&K);
if(K%2 == 0){
ll num = 0;
ll num2 = 0;
ll half_... | 1 | 84,605,116 |
#include <iostream>
#include <cmath>
#include <cstdio>
using namespace std;
int main()
{
double x1;
double x2;
double y1;
double y2;
cin >> x1 >> y1 >> x2>> y2;
double d = sqrt((pow((x1 - x2), 2) + pow((y1 - y2), 2)));
printf("%lf\n", d);
return 0;
} | #include <cstdio>
#include <cmath>
int main(){
double x1, x2, y1, y2;
scanf(" %lf %lf %lf %lf", &x1, &y1, &x2,&y2);
printf("%lf\n", sqrt( pow(x2-x1, 2.0) + pow(y2- y1, 2.0) ));
return 0;
} | 1 | 86,127,532 |
#include <bits/stdc++.h>
#define PB push_back
#define MP make_pair
#define REP(i,n) for (int i=0;i<(n);i++)
#define INF (1<<29)
using namespace std;
typedef long long ll;
int main(){
int n,k;
int a[100000];
while(cin>>n>>k&&n&&k){
REP(i,n)cin>>a[i];
int sum=0;
REP(i... | #include <bits/stdc++.h>
using namespace std;
int main(){
while(1){
int N,K;
cin>>N>>K;
if(N == 0 && K == 0) break;
vector<long long> A(N);
for(int i=0; i<N; i++) cin>>A[i];
vector<long long> sum(N+1,0);
for(int i=1; i<=N; i++){
sum[i] = sum[i-1]+... | 1 | 60,446,015 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n;
cin >> n;
vector<int> d(n);
for (size_t i = 0; i < n; i++) cin >> d[i];
long long ans = 0;
for (size_t i = 0; i < n; i++) {
for (size_t j = i+1; j < n; j++) {
ans += d[i] * d[j];
... | #include<bits/stdc++.h>
#define ll long long
#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
const int MOD=1000000007;
#define PI acos(-1)
using namespace std;
int main(){
int n; cin >> n ;
int a[n];
for(int i=0 ; i < n ; i++){
cin >> a[i];
}
ll sum =0;
for(int i=0 ; i < n ; i++){
f... | 1 | 88,650,510 |
#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<cstring>
#include<set>
#include<queue>
#include<map>
#include<math.h>
#define FASTREAD ios_base::sync_with_stdio(0);cin.tie(nullptr);
#define ll long long
#define dd double
#define scl(n) scanf("%lld",&n)
#define scd(n) ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n'
#define INF INT_MAX
vector<ll> dp;
ll f(vector<ll> &v,ll n)
{
if(n==0)
{
return 0;
}
if(n<0)
{
return INF;
}
if(dp[n]!=-1)
{
return dp[n];
}
ll val1,val2,left,right;
l... | 1 | 90,575,211 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,p;
cin >> a >> p;
int total = a*3+p;
int pie = total/2;
cout << pie;
} | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
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 int64_t INF = 1LL << 60;
int main() {
int A,P;
cin>>A>>P;
... | 1 | 92,131,643 |
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define rep(i, m, n) for (lli i = m; i < (n); i++)
#define repe(i, m, n) for (lli i = m; i <= (n); i++)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((lli)(x).size())
#define MAX(x) *max_element(ALL(x))
#... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<int> vin;
typedef pair<ll,ll> P;
typedef vector<P> vp;
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
#define drep(i,a,b) for(ll i=(a);i>=(b);... | 1 | 91,738,078 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, k;
cin >> n >> k;
int a[n];
rep(i, n) cin >> a[i];
vector<int> num(n);
rep(i, n) num[a[i]-1]++;
sort(num.begin(), num.end(), greater<int>());
int cnt = 0;
for(int i = k; i < n; i++){
... | #include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep2(i, m, n) for(int i = (int)(m); i < (int)(n); i++)
#define rep_inv(i, n, m) for(int i = (int)(n); i > (int)(m); i--)
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vc = vector<char>;
using vvl = vector<vl>;
... | 1 | 11,445,418 |
#include<iostream>
#include<cmath>
long long gcd(long long a, long long b)
{
if (a%b == 0)
{
return(b);
}
else
{
return(gcd(b, a%b));
}
}
long long lcm(long long a, long long b)
{
return a * b / gcd(a, b);
}
int main(void){
long long a, b, c, d;
std::cin >> a >> b >> c >> d;
... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n); for(int i = 0;i < (int)(n);i++)
#define all(x) (x).begin(),(x).end()
typedef long long ll;
ll gcd(ll a, ll b)
{
if (a%b == 0)
{
return b;
}
else
{
return gcd(b, a%b);
}
}
ll lcm(ll a, ll b)
{
return a * b / gcd(a, ... | 1 | 23,652,706 |
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define ld long double
#define INF 1000000000000000000
typedef pair<ll, ll> pll;
typedef pair<int, int> pint;
int main() {
cin.tie(0);
... | #include<iostream>
#include<vector>
#include<cstring>
#include<map>
#include<bitset>
#include<assert.h>
#include<algorithm>
#include<iomanip>
#include<cmath>
#include<set>
#include<queue>
#define long long long
using namespace std;
const int N=1e6,mod=1e9+7;
int aa[N+2],bb[N+2];
int main()
{
ios_base::sync_with_stdio... | 1 | 11,438,622 |
#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>
using namespace std;
int main() {
int64_t a, b, k;
cin >> a >> b >> k;
if (a>=k) {
a-=k;
}
else if (a<k && b>=k-a) {
k-=a;
a=0;
b-=k;
}
else if (a+b<k) {
a=0;
b=0;
}
cout << a << " " << b << endl;
} | 1 | 92,796,779 |
#include<bits/stdc++.h>
#define all(v) v.begin(),v.end()
using namespace std;
int main(){
int a,b;
string s;
cin>>a>>b>>s;
for(int i=0;i<a+b+1;i++){
if(i<a){
if(s[i]!='0' && s[i]!='1' && s[i]!='2' && s[i]!='3' && s[i]!='4' && s[i]!='5' && s[i]!='6' && s[i]!='7' && s[i]!='8' && s[i]!='9'){
cout<<"No"<<endl;... | #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 A,B;
cin >> A >> B;
string S;
cin >> S;
bool flag = true;
rep(i,S.size())
{
if (i != A && S[i] == '-') flag = false;
if (i == A && S[i] != '-') flag = fals... | 1 | 60,667,472 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long int x,y,i,j;
double n,l;
cin>>x>>y;
n=(4*x-y)/2;
l=(y-2*x)/2;
i=floor(n);
j=floor(l);
if((i==n && n>=0) &&(j==l&&l>=0) && l+n==x)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
} | #include <bits/stdc++.h>
#include <fstream>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << setprecision(20) << fixed;
/*
ifstream in("input.txt");
cin.rdbuf(in.rdbuf());
int X, Y;
cin >> X >> Y;
for(int i = 0; i < 100; i++){
if(i * 2 >= 0 && (X-i)*4 >= 0 && i * ... | 1 | 63,071,609 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int K,N;
cin>>N>>K;
int64_t Z=4167167167167167167;
vector<int64_t> p(N+1);
vector<int64_t> q(N+1);
for(int i=0;i<N;i++){
cin>>p[i]>>q[i];
}
p[N]=-2001167167;
q[N]=-2001167167;
vector<int64_t> x=p;
vector<int64_t> y=q;
sort(x.begin(),... | #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 mp make_pair
#define pb push_back
#define ins insert
#define pqueue(... | 1 | 46,475,255 |
#include <bits/stdc++.h>
#define REP(i, n) for(int (i)=0;(i)<(n);++(i))
#define REPV(iter, v) for(auto (iter)=(v).begin(); (iter)!=(v).end();++(iter))
#define ALL(v) (v).begin(),(v).end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
int main()
{
ll x, y;
cin >> x >> y;
ll ans;
if (x... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using ll = long long;
using ld = long double;
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define rep3(i, n) for (ll i = 1; i < (ll)(n+1); i++)
#define rep4(i, s, n) for (ll i = (s); i < ... | 1 | 55,104,588 |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long
#define endl "\n"
#define all(v) v.begin(),v.end()
#define double long double
#define trace1(x) cerr<<#x<<": "<<x<<endl
#define trace2(x, y) cerr<<#x... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define MOD 1000000007
using namespace std;
typedef ... | 1 | 94,086,882 |
#include<bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#define REP(i, l, n) for(int i=(l), i##_len=(n); i<i##_len; ++i)
#define ALL(x) (x).begin(),(x).end()
#define pb push_back
ll gcd(ll a,ll b){return b ? gcd(b,a%b) : a;}
ll lcm... | #include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i<(int)(n); i++)
#define all(v) v.begin(), v.end()
#define allR(v) v.rbegin(), v.rend()
#define PRINT(v) for (auto x : (v)) cout <<x <<" " ; cout <<endl;
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
typedef pair<int,int> Pi;
const... | 1 | 66,921,926 |
#include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <iomanip>
#include <stdlib.h>
#include <stdio.h>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <time.h>
using namespace std;
typedef long long ll;
typedef... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> wi;
int main(){
int n, k, cnt=0;
cin >> n >> k;
rep(i, n){
int h;
cin >> h;
if(h>=k)cnt++;
}
cout << cnt << endl;
return 0;
} | 1 | 84,686,773 |
#include <bits/stdc++.h>
#define all(x) begin(x), end(x)
#define _ << ' ' <<
using namespace std;
using ll = long long;
int main()
{
ll h,w;
cin >> h >> w;
if(h == 1 || w == 1)
cout << 1;
else
cout << h * w / 2 + ((h*w) % 2);
} | #include <stdio.h>
#define _USE_MATH_DEFINES
#include <math.h>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
long h,w;
scanf("%ld %ld", &h, &w);
if(h == 1 || w == 1 ){
printf("%d", 1);
} else {
printf("%ld", (h * w + 1)/2);
}
return 0;
} | 1 | 31,208,217 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define lb lower_bound
#define ub upper_bound
#define fi ... | #include <iostream>
#include <fstream>
#include <cstdio>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <stack>
#include <queue>
#include <algorithm>
#include <string.h>
#include <string>
#include <math.h>
#include <iomanip>
using namespace std;
#define SORT(v... | 1 | 97,960,581 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main()
{
ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL);
string s;
cin >> s;
for(int i = 0; i<=5; i++)
{
if(s[2] == s[3] && s[4] == s[5])
{
cout << "Yes" << endl;
break;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
string S;
cin >> S;
if (S[2] == S[3] && S[4] == S[5])
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | 1 | 26,815,269 |
#pragma region header
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb p... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, k, s;
cin >> n >> k >> s;
for(int i = 0; i < k; ++i) cout << s << " ";
for(int i = 0; i < n - k; ++i) cout << (s == 1000000000 ? 1000000000 - 1 : 1000000000) << " ";
... | 1 | 59,870,758 |
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
using namespace std;
using ll = long long;
const double PI = 3.14159265358979;
void solve()
{
int a, b, c;
cin >> a >>... | #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... | 1 | 49,112,485 |
#include <iostream>
using namespace std;
int main(){
int m,nmin,nmax;
while(cin>>m>>nmin>>nmax){
if(m==0&&nmin==0&&nmax==0) break;
int p[m];
for(int i=0;i<m;i++){
cin>>p[i];
}
int g[nmax-nmin+1],gmax=0,nn;
for(int i=0;i<=nmax-nmin;i++){
g[i]=p[nmin+i-1]-p[nmin+i];
if(g[i]>=gmax){
gmax=g[i];
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int m,mn,mx;
while(cin>>m>>mn>>mx,m!=0||mn!=0||mx!=0){
vector<int> p(m);
for(int i=0;i<m;i++)
cin>>p[i];
int df=0,cnt=0;
for(int i=mn-1;i<mx;i++){
if(df<=p[i]-p[i+1]){
df = p[i]-p[i+1];
cnt=i+1;
}
}
co... | 1 | 37,224,557 |
#include <stdio.h>
int main (){
int k,p;
scanf ("%d", &k);
p= (k*(k+1)/2);
printf ("%d", p);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;cin>>N;
int ans=0;
for(int i=1;i<=N;i++) ans+=i;
cout<<ans<<endl;
} | 1 | 85,544,299 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, R;
cin >> N >> R;
if(N >= 10) {
cout << R;
}else {
cout << R + 100 * (10 - N);
}
return 0;
} | #include<bits/stdc++.h>
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define f... | 1 | 65,378,888 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll N=1e5+5;
ll a[3];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin>>a[0]>>a[1]>>a[2];
sort(a,a+3);
if(a[0]==a[1])
cout<<a[2];
else
cout<<a[0];
return 0;
} | #include <iostream>
using namespace std;
int main()
{
int a;
int b;
int c;
cin>>a>>b>>c;
if(a==b){
cout<<c;
}
if(a==c){
cout<<b;
}
if(b==c){
cout<<a;
}
} | 1 | 67,583,100 |
#include <iostream>
#include <string>
using namespace std;
int main(){
string s;
string t;
cin >> s >> t;
int min = t.size();
for(int i=0; i<=s.size()-t.size(); i++){
string ss = s.substr(i, t.size());
int m = 0;
for(int j=0; j<ss.size(); j++){
if(ss[j]!=t[j]){
... | #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<queue>
#include<cstdio>
#include<cmath>
using namespace std;
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
#define ALL(x) x.begin(),x.end()
#define debug(output) cout<<#output<<"= "<<output<<endl
using lint... | 1 | 54,949,641 |
#include<iostream>
#include<string>
using namespace std;
int main(){
string s;
cin >> s;
int N = s.size();
string answer;
for (int i = 0; i < N; ++i)
{
if (i % 2 == 0){
answer += s[i];
}
}
cout << answer << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
string a; cin >> a;
string ans = "";
int i = 0;
while (i < a.size()){
ans += a[i];
i += 2;
}
cout << ans << endl;
} | 1 | 53,297,434 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
signed main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int k, a, b;
cin >> k >> a >> b;
int x = (a - 1) / k;
int y = b / k;
cout << (y - x > 0 ? "OK" : "NG") << '\n';
return (0);
} | #include<iostream>
using namespace std;
int main()
{
int A,B,K,i;
string a="NG";
scanf("%d%d%d",&K,&A,&B);
for(i=A;i<=B;i++){
if(i%K==0){
a="OK";
}
}
cout<<a;
return 0;
} | 1 | 89,395,740 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int w, h, n;
cin >> w >> h >> n;
int x[n], y[n], a[n];
rep(i, n) cin >> x[i] >> y[i] >> a[i];
vector<vector<bool>> s(h, vector<bool>(w));
rep(i, n){
if(a[i] == 1){
rep(j, x[i]){
... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define MOD 1000000007
#define ll long long int
#define pair <ll, ll> pi
#define vector <ll> vi
#define F first
#define S second
#define PB push_back
#define MP make_pa... | 1 | 53,425,565 |
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
while (cin >> n) {
if (n == 0) {
break;
}
int r, l;
r = l = 0;
string s;
int bb = 0;
int ans = 0;
for (int i = 0; i < n; i++) {
cin >> s;
if (s == "lu") {
l++;
}
else if (s == "ru") {
r++;
}
els... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while(cin>>n,n){
string str,a="rldu";
bool leg[2]={};
int ans=0,now=1,num[2]={0,1};
for(;n>0;n--){
cin>>str;
for(int i=0;i<2;i++)if(str[0]==a[i])for(int j=0;j<2;j++)if(str[1]==a[2+j])leg[i]=num[j];
if(now==leg[0]&&now==leg[1]){
ans... | 1 | 85,193,607 |
#include <bits/stdc++.h>
#define int long long
#define ll long long
#define vec vector
#define vi vec<int>
#define vvi vec<vec<int>>
#define ALL(a) begin(a), end(a)
#define RALL(a) rbegin(a), rend(a)
#define SORT(a) stable_sort(ALL(a))
#define RSORT(a) stable_sort(RALL(a))
#define REV(a) reverse(ALL(a))
#define UNIQUE(... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | 1 | 47,111,866 |
#include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define NO cout<<"NO"<<endl
#define YES cout<<"YES"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define all(... | #include <bits/stdc++.h>
using namespace std;
int main() {
int R;
int G;
cin>> R;
cin>> G;
cout << (G*2)-R << endl;
} | 1 | 62,342,928 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef complex<double> Point;
#define PI acos(-1.0)
#define EPS 1e-10
const ll INF = 1e16;
const ll MOD = 1e9 + 7;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define rep(i,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,int> plli;
typedef pair<int,pii> pipii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<pii> vpii;
#define rep(i,n) for (int i=0;i<(n);i++)
#def... | 1 | 81,578,715 |
#include <stdio.h>
#include <assert.h>
#include <fstream>
#include <iostream>
#include <algorithm>
#include <array>
#include <vector>
#include <queue>
#include <set>
#include <cmath>
#include <unordered_map>
const int MAX_N = 200050;
const long long MAX_VAL = (long long)100000000000;
int N;
long long A[MAX_N], B[MAX_N]... | #include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
ll INF = Mod * 100LL;
int main() {
int N;
cin >> N;
ll ans = 0;
ll sum = 0;
ll mini = INF;
bool all_same = true;
for (int i = 0; i < N; i++) {
ll A,B;
... | 1 | 44,793,464 |
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <string.h>
#include <cstdio>
#include <tuple>
using namespace std; using ll = long long; using ld = long double; using pll = pair<ll... | #include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(12);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";n... | 1 | 39,697,391 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define ll long long
#define dl double long
using namespace std;
const int N = 1e6 + 7;
const ll mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int n;
ll s[N];
pair < ll , int > d[N];
ll dd[N];
ll p[N];
vector < int > v[N];... | #include<bits/stdc++.h>
using namespace std;
#define FOR(i, x, y) for(int i = (x); i < (y); ++i)
#define REP(i, x, y) for(int i = (x); i <= (y); ++i)
#define MP make_pair
#define PB push_back
#define PH push
#define fst first
#define snd second
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
ty... | 1 | 43,369,574 |
#include<bits/stdc++.h>
typedef long long ll;
ll gi(){
ll x=0,f=1;
char ch=getchar();
while(!isdigit(ch))f^=ch=='-',ch=getchar();
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
int fir[100010],dis[200010],nxt[200010],id;
void link(int a,int b){nxt[++id]=fir[a],fir[a]=id,dis[id]=b;}
bool flg;
bool d... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using db = double;
using ld = long double;
template<typename T> using V = vector<T>;
template<typename T> using VV = vector<vector<T>>;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define... | 1 | 70,226,398 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef vector<char> vc;
typedef string S;
typedef queue<int> qi;
typedef pair<ll,ll> P;
typedef vector<P> vp;
typedef vector<vl>... | #include<iostream>
#include<vector>
#define INF 1000000
using namespace std;
int main(){
int x, n;
cin >> x >> n;
vector<int> p(n);
int i, plus, minus;
for(i=0;i<n;i++){
cin >> p.at(i);
}
int ans=INF;
int count = 0;
while(1){
minus=INF;
plus=INF;
for(i... | 1 | 81,512,645 |
#include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <random>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define repp(i,n,m) for (int i = m; i < (n); ++i)
#define repl(i,n) for (long long i = 0; i < (n); ++i)
#defin... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using ld = long double;
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define rep3(i, n) for (int i = 1; i < (int)(n+1); i++)
#define rep4(i, s, n) for (int i = (s... | 1 | 70,728,623 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <deque>
#include <queue>
#include <string.h>
#include <stack>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
typedef long long ll;
typedef pair<int,int> P;
int main() {
int n,m;
cin >> n;
... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, c, max=0;
string s;
cin >> N;
vector<string> blue(N);
for(int i=0;i<N;i++){
cin >> blue.at(i);
}
cin >> M;
vector<string> red(M);
for(int i=0;i<M;i++){
cin >> red.at(i);
}
for(int i=0;i<N;i++){
... | 1 | 80,502,777 |
#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;
cin >> N;
int ct = 0, cx = 0, cy = 0;
rep(i, N)
{
int t, x, y;
cin >> t >> x >> y;
int d = abs(x + y - (cx + cy));... | #include <algorithm>
#include <cmath>
#include <climits>
#include <functional>
#include <iostream>
#include <queue>
#include <string>
#include <numeric>
#include <vector>
using namespace std;
using ll = long long;
template<typename T> void print(T t) {cout << t << endl;}
bool check(int dt, int dx, int dy) {
int diff =... | 1 | 20,731,437 |
#include <bits/stdc++.h>
using namespace std;
#define dhoom ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
typedef long long ll;
#define SIZE 10005
vector< ll > dp[SIZE];
ll height[SIZE];
ll n ,m;
vector< int > graph[SIZE];
vector< int > ans;
vector< int > vis(SIZE,0);
void dfs(int u){
vis[u] = true;... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,a) for(int i = 0; i < (a); i++)
#define ALL(a) (a).begin(),(a).end()
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const int MOD = 1e9 + 7;
#define MAX_V 10000
vector<int> G[MAX_V];
list<int> out;
bool V[MAX_V];
int N;
int indeg[MAX_V];
... | 1 | 98,381,261 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long INF = 1LL << 60;
int main() {
int N;
cin >> N;
vector<int> V(N), W(N);
for(int i=0; i<N; i++) cin >> V[i];
for(int i=0; i<N; i++) {
if(i % 2 == 0) {
W[i/2] = V[N-i-1];
}
else {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using P = pair<string,int>;
const double PI = acos(-1);
int main() {
int n;
cin >> n;
vector<int> even;
vector<int> odd;
rep(i,n){
int a;
cin >> a;
if(i%2 == 0) odd.push_back(a)... | 1 | 57,248,356 |
#include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef vector<VVLL> VVVLL;
typedef pair<LL, LL... | #include <bits/stdc++.h>
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN... | 1 | 70,294,325 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, c) for (int i = 0; i < (int)c; i++)
int main()
{
int n;
scanf("%d", &n);
string s, t;
cin >> s >> t;
rep(i, n) {
cout << s[i] << t[i];
}
cout << endl;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
string a, b;
cin >> a >> b;
string s = "";
for (int i = 0; i < n; ++i) {
s += a[i];
s += b[i];
}
cout << s;
} | 1 | 95,683,306 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using pi = pair<int,int>;
int MOD = 1e9+7;
#define mp make_pair
#define pb push_back
#define rsz resize
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ull=unsigned long long;
using pii=pair<int,int>;
#define INF LONG_MAX
#define MOD 1000000007
#define rng(a) a.begin(),a.end()
#define rrng(a) a.end(),a.begin()
#define endl "\n"
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int N,R;
... | 1 | 23,319,512 |
#include <iostream>
#include <math.h>
#include <algorithm>
using namespace std;
int main(){
int N;
long long H;
cin>>N>>H;
long long a[100000],b[1000000];
long long M=0;
for(int i=0;i<N;i++){
cin>>a[i]>>b[i];
if(a[i]>M) M=a[i];
}
sort(b,b+N);
long long answer=0;
int j=N-1;
while(H>0&&j>=0&... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
const ll MOD = 1e9+7;
ll LLINF = 1LL << 60;
int INF = INT_MAX;
int main(){
ll n,h; cin>>n>>h;
priority_queue<pair<ll,ll>> v;
rep(i,0,n){
... | 1 | 36,451,057 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<long long>lve;
typedef vector<pair<ll,ll> > lvp;
typedef vector<vector<int> > ivve;
#define sp ' '
#define endl '\n'
#define F first
#define S second
#define pb push_back
#define mp make... | #include <stdio.h>
#include <iostream>
using namespace std;
int A,B;
int main (){
cin>> A >> B;
if (A==1){
if (B==2){
cout <<"3";
}else if (B==3){
cout <<"2";
}
}else if (A==2){
if (B==1){
cout <<"3";
}else if (B=3){
cout <<"1";
}
}else if (A==3){
if (B==1){
cout <<"2";
}else if (B==2... | 1 | 27,357,848 |
#include<bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define bit(n,k) (((ll)n>>(ll)k)&1)
const long long INF= 1e+18+1;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll> >vvl;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> T;
const... | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <numeric>
#include <ctime>
#include <complex... | 1 | 8,849,987 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,a,b) for(int i=(a);i<(b);i++)
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
using vint=vector<int>;
using pint=pair<int,int>;
u... | #include <iostream>
#include <vector>
#include <cassert>
#include <algorithm>
#include <functional>
#include <cmath>
#include <cfenv>
using ll = unsigned long long;
using namespace std;
int gcd(int x,int y){
if(y==0){
return x;
}else{
return gcd(y,x%y);
}
}
int lcm(int x,int y){
return x... | 1 | 71,153,921 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int n;
int toint(string &m){
int j=1;
int sum=0;
for(int i=0;i<m.size();i++){
if(m[i]=='m' ){
sum += j*1000;
j=1;
}else if(m[i]=='c'){
sum += j * 100;
j=1;
}else if(m[i... | #include<bits/stdc++.h>
using namespace std;
int main(){
string s,s1;
int m;
cin>>m;
for(int j=0;j<m;j++){
int ans=0,a=1;
cin>>s>>s1;
for(int i=0;i<s.size();i++){
if(s[i]=='m'){ans+=a*1000; a=1;}
else if(s[i]=='c'){ans+=a*100; a=1;}
else if(s[i]=='x'){ans+=a*10; a=1;}
else if(s[i]=='i'){ans+=a;... | 1 | 5,358,732 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int num;
string str;
cin >> num >> str;
if(num % 2 == 0){
string tmp1, tmp2;
tmp1 = str.substr(0, num / 2);
tmp2 = str.substr(num / 2);
if (tmp1 == tmp2)
cout << "Yes";
else cout << "No";
}... | #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>;
int main() {
int n;
string s;
cin >> n >> s;
if (s.size() % 2 == 0 && s.substr(0, n / 2) == s.substr(n / 2, n / 2)) {
cout << "Yes" << endl;
} else {
cout ... | 1 | 33,434,095 |
#include<bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define SZ(x) ((int)x.size())
#define L(i,u) for (register int i=head[u]; i; i=nxt[i])
#define rep(i,a,b) for (register int i=(a); i<=(b); i++)
#define per(i,a,b) for (register int i=(a); i>=(b); i--)
using namespace std;
typedef long long ... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 100010;
struct Edge {
int v, x;
} E[maxn << 1];
int l[maxn], n, dep[maxn], fa[maxn], vis[maxn], ok = 1, e;
struct CMP {
bool operator()(const int &a, const int &b) const {
if (dep[a] == dep[b]) return a < b;
return dep[a] > dep[b];
}
};
set<int, CMP>... | 1 | 22,846,740 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
int px[90010],py[90010];
int rui[90010];
int main(){
int h,w,d;
cin >> h >> w >> d;
for(int i=0;i<h;++i){
for(int j=0;j<w;++j){
int a;
cin >> a;
px[a]=i;
py[a]=j;
}
}
for(int i=d+1;i<=h*w;++i){
rui[i]=rui[i-d]... | #include <bits/stdc++.h>
using namespace std;
typedef long long lint;
#define rep(i,n) for(lint (i)=0;(i)<(n);(i)++)
#define repp(i,m,n) for(lint (i)=(m);(i)<(n);(i)++)
#define repm(i,n) for(lint (i)=(n-1);(i)>=0;(i)--)
#define INF (1ll<<60)
#define all(x) (x).begin(),(x).end()
const lint MOD =1000000007;
const lint MA... | 1 | 70,977,346 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll LL_INF = 0x3f3f3f3f3f3f3f3f;
ll a[200005];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
scanf("%lld", &a[i]);
if (i > 0)
a[i] += a[i - 1];
}
ll ans = LL_INF;
for (int i = 0; i ... | #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
#include<math.h>
#include<queue>
#include<deque>
#include<stack>
#include<cstdio>
#include<utility>
#include<set>
#include<list>
#include<cmath>
#include<stdio.h>
#include<string.h>
#include<iomanip>
using namespace std;
#define FOR(... | 1 | 73,362,282 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
struct UnionFind
{
vector<int> uni;
UnionFind(int n) : uni(n, -1) {}
int root(int a)
{
if (uni[a] < 0) return a;
return uni[a] = root(uni[a]);
}
bool connect(int a, int b)
{
a = root(a);
b = root(b);
if (a == b... | #include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define fastio() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define test() int t;cin>>t;for(int test=1;test<=t;test++)
#define pb push_back... | 1 | 66,774,000 |
#include <cstdio>
#include <algorithm>
#define f1(i,n) for(int i=0;i<(int)n;i++)
const int inf = 1000000000;
using namespace std;
int main(){
int n;scanf("%d",&n);
int arr[n];
f1(i,n){
scanf("%d",&arr[i]);
}
int ans = inf;
for(int i=1;i<=100;i++){
int cost = 0;
f1(j,n)cost += (arr[j]-i)*(arr[j]-i);
a... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | 1 | 85,440,014 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define PI acos(-1)
typedef long long ll;
ll gcd(ll x,ll y){
if(y==0) return x;
else return gcd(y,x%y);
}
ll lcm(ll x,ll y){
return x/gcd(x,y)*y;
}
int main(){
int n,k;
cin>>n>>k;
long double ans=0;
for(int i=1;i<... | #include <algorithm>
#include <cmath>
#include <vector>
#include <functional>
#include <cstdlib>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <ctype.h>
#include <climits>
#include <queue>
using namespace std;
typedef long long ll;
#define REP(i, n) for(ll i = 0; i < (ll)(n); ++i)
templat... | 1 | 32,334,750 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef pair<int,int> P;
typedef long long ll;
const int INF = 1001001001;
const ll INFL = 1e17;
const int MOD = 1e9+7;
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}
int f(int x){
int res = ... | #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... | 1 | 65,359,277 |
#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <string>
#include <map>
#include <bitset>
#include <vector>
#include <queue>
using namespace std;
typedef long long ll;
#define FOR(i,a,b) for(ll i = (a); i < (b); i++ )
#define REP(i, n) FOR(i,0,n)
typedef pair< ll, ll > cp2;
t... | #include <bits/stdc++.h>
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++)
typedef long long ll;
int main(){
int a;
cin >> a ;
cout << (a-2)*180 << endl;;
return 0;
} | 1 | 1,260,080 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> P;
typedef vector<vector<int>> Matrix;
static const int INF = 2000000000;
int main(){
int a, b, c, d;
cin >> a >... | #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)... | 1 | 50,959,715 |
const int LG = 21;
const int FN = 400005;
const long long MOD = 1e9 + 7;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
const double PI = acos(-1);
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<l... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
typedef long long ll;
using namespace std;
int main(void) {
string s;
int k;
cin >> s >> k;
s += 'x';
for(int i = 0; i < k; i++) {
if(s[i] == 'x') {
cout << 1 << endl;
return 0;
}
if(s[i] != ... | 1 | 42,729,923 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(v) v.begin(), v.end()
using ll = long long;
const ll MOD = 1e9+7; ll LLINF = 1LL << 60; int INF = INT_MAX;
int main(){
int n; cin>>n;
vector<long double> x(n);
vector<string> c(n);
rep(i,0... | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef long double ld;
#define vec(s) vector<s>
#define vvec(s) vector<vector<s>>
typedef vector<lli> vi;
typedef vector<vi> vvi;
typedef pair<lli,lli> pii;
#define rep(i, n) for (int i =... | 1 | 88,616,755 |
#include <stdio.h>
int main(void) {
int n;
int a[6000];
while(1) {
int max_a=-100000;
int sum;
int i,j;
scanf("%d",&n);
getchar();
if(n==0) break;
for(i=0;i<n;i++) scanf("%d",&a[i]);
for(i=0;i<n;i++) {
sum=0;
for(j=i;j<n;j++) {
sum+=a[j];
if(max_a<sum) max_a=sum;
... | #include <iostream>
#include <limits.h>
using namespace std;
int main()
{
int n;
while(cin >> n && n)
{
int buf[5001]={};
int max_sum = INT_MIN;
for(int i=0; i<n; i++)
{
cin >> buf[i];
}
for(int i=0; i<n; i++)
{
int sum = 0;
... | 1 | 66,377,194 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define rep2(i,n) for(int i=0;i<=n;i++)
#define repr(i,a,n) for(int i=a;i<n;i++)
#define all(a) a.begin(),a.end()
#define P pair<long long,long long>
#define double long doub... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long x, y;
cin >> x >> y;
if(x % y == 0) {
cout << -1 << "\n";
} else {
cout << x << "\n";
}
return 0;
} | 1 | 10,577,424 |
#include<iostream>
#include<algorithm>
#include<map>
using namespace std;
int main() {
int n, k, a;
map<int, int> mp;
pair<int, int> p[200010];
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a;
mp[a]++;
}
int num = 0;
for(auto u:mp) {
p[num] = make_pair(u.sec... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
int main() {
uint32_t N = 0, K = 0;
std::cin >> N >> K;
std::vector<uint32_t> count(N + 1, 0);
for (size_t i = 0; i < N; i++) {
uint32_t a = 0;
std::cin >> a;
count[a]++;
}
std::sort(count.begin(), count.end(), std::gr... | 1 | 38,040,639 |
#include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using bint = boost::multiprecision::cpp_int;
using ll = long long;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define repSE(i,s,n) for (int i = (s); i < (n); i++)
#define ... | #include<bits/stdc++.h>
using namespace std;
using li = long int;
li N;
int main(){
cin >> N;
cout << (N+1)*N/2-N << endl;
return 0;
} | 1 | 44,501,297 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
string x;
int ans = 0;
for(int i=stoi(s); i<=stoi(t); i++) {
x = to_string(i);
if(x[0]==x[4] && x[1]==x[3]) ans++;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int a, b, cnt = 0;
cin >> a >> b;
for (int i = a; i <= b; i++)
{
string x = to_string(i);
if (x[0] == x[4] && x[1] == x[3])
cnt++;
}
cout << cnt << endl;
} | 1 | 79,806,349 |
#include <iostream>
#define rep(i, n) for(int i=0; i<n; i++)
using namespace std;
int main(void){
int N;
cin >> N;
string S;
cin >> S;
int size = S.size();
int count[size+1];
count[0] = 0;
rep(i, size){
count[i+1] = count[i];
if(S[i] == '(')
count[i+1]++;
else
count[i+1]--;
}
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,d=0,mi=0,i;
string s;
cin>>n>>s;
for(i=0;i<n;i++){
if(s.at(i)=='(') d++;
else if(s.at(i)==')'){
d--;
mi=min(mi,d);
}
}
if(mi<0){
for(i=0;i<-mi;i++) s='('+s;
d-=mi;
}
if(d>0) for(i=0;i<d;i++) s+=')';
cout<<s<... | 1 | 38,104,225 |
#include <iostream>
#include <cstring>
#include <cstdio>
#include<utility>
#include<algorithm>
#include<vector>
using namespace std;
typedef long long ll;
typedef pair<int,int>P;
typedef pair<double,double>P_D;
#define rep(i, n) for (int i = 0; i < n; i++)
#define reprev(i, n) for (int i = n - 1; i >= 0; i--)
#define M... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
template <typename TYPE>
void print_vec(const vector<TYPE>& v){
for(int i=0; i<v.size(); i++){
cout << v[i] << " ";
}
cout << endl;
}
template <typename TYPE>
void print_vec2(const vector<vector<TYPE>>& v){
cout << endl; cout << " ";
for... | 1 | 74,959,459 |
#include <string>
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
using namespace std;
typedef long long ll;
#define CPP_STR(x) CPP_STR_I(x)
#define CPP_CAT(x,y) CPP_CAT_I(x,y)
#define CPP_STR_I(args...) #args
#define CPP_CAT_I(x,y) x ## y
#define FOR(i, start, end) for(ll i... | #include <bits/stdc++.h>
using namespace std;
signed main () {
int n;
cin >> n;
vector < int > c(n - 1), s(n - 1), f(n - 1);
for (int i = 0; i < n - 1; ++i)
cin >> c[i] >> s[i] >> f[i];
for (int i = 0; i < n; ++i) {
int64_t ans = 0;
for (int j = i; j < n - 1; ++j) {
... | 1 | 60,269,430 |
#include <iostream>
#include <string>
#include <cmath>
#include <vector>
#include <map>
#include <numeric>
#include <algorithm>
#include <stdio.h>
int main(void){
std::string s;
std::cin >> s;
if(s[2]==s[3] && s[4]==s[5]){
std::cout << "Yes";
}else{
std::cout << "No";
}
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main(int argc, const char * argv[]) {
ios::sync_with_stdio(false);
string s;
cin>>s;
if (s.size()!=6) {
}else{
if (s[2]==s[3]&&s[4]==s[5]) {
cout<<"Yes";
}else{
cout<<"No";
}
}
retu... | 1 | 57,314,522 |
#pragma GCC target ("avx2")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("O3")
#include "bits/stdc++.h"
#include <unordered_set>
#include <unordered_map>
#include <random>
using namespace std;
typedef long long ll;
const ll MOD = 1'000'000'007LL;
#define pb push_back
#define mp make_pair
#define all(x) ... | #include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
using namespace std;
typedef long long ll;
typedef unsigned i... | 1 | 37,092,155 |
#include<iostream>
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<set>
#include<string>
#include<map>
#include<string.h>
#include<complex>
#include<math.h>
#include<queue>
#include <functional>
#include<time.h>
#include<iomanip>
#include<cassert>
#include<bitset>
#include<sstream>
using namespace std;
... | #include <iostream>
#include <map>
#include <vector>
#include <algorithm>
#include <set>
#include <stdio.h>
#include <math.h>
#include <queue>
using namespace std;
typedef long long int lli;
const long long int MaxN=500005;
const lli mod=1e9+7;
#define fst first
#define snd second
#define mp make_pair
const float pi=3.... | 1 | 55,199,681 |
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
int d[1005][1005];
int main(){
string s1,s2;
cin>>s1>>s2;
s1=' '+s1;
s2=' '+s2;
int l1=s1.size();
int l2=s2.size();
int i,j;
for( i=1;i<l1;i++)d[i][0]=i;
for( j=1;j<l2;j++)d[0][j]=j;
for( i=1;i<l1;i++){... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rrep(i,n) for(int (i)=((n)-1);(i)>=0;(i)--)
#define itn int
#define miele(v) min_element(v.begin(), v.end())
#define maele(v) max_element(v.begin(), v.end())
#define SUM(v) accumulate(v.begin(), v.e... | 1 | 75,704,684 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int> > vii;
#define rrep(i, m, n) for(int (i)=(m); (i)<(n); (i)++)
#define erep(i, m, n) for(int (i)=(m); (i)<=(n); (i)++)
#define rep(i, n) for(int (i)=0; (i)<(n); (... | #include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int main(){
int n;
int h1,h2,m1,m2,s1,s2;
int dp[3600*60+1];
while(cin >> n, n){
memset(dp, 0, sizeof(dp));
for(int i = 0 ; i < n ; i++){
scanf("%d:%d:%d %d:%d:%d", &h1, &m1, &s1, &h2, &m2, &s2);
... | 1 | 27,526,817 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1010000000000000017LL;
const ll MOD = 1000000007LL;
#define REP(i, n) for(ll i = 0 ; i < n; i++)
#ifdef DEBUG
#define DBG(fmt, ...) fprintf(stderr, fmt "\n", ##__VA_ARGS__)
#else
#define DBG(fmt, ...)
#endif
int main(){
std::cout<<st... | #include <iostream>
#include <iomanip>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <cstdio>
#include <utility>
#include <string>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <numeric>
using namespace std;
typedef uin... | 1 | 7,401,931 |
#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>;
const int MOD = 1000000007;
const int INF = 999999999;
int main(){
int N;
cin >> N;
double ans = 0;
rep(i, N){
double x;
string u;
cin >> x... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i,n) for(ll (i)=0; (i)<(ll)(n); (i)++)
#define frep(i,m,n) for(ll (i)=(m); (i)<=(ll)(n); (i)++)
#define rrep(i,n) for(ll (i)=(n)-1; (i)>-1; (i)--)
#define frrep(i,m,n) for(ll (i)=(n); (i)>(ll)(m); (i)--)
#define ALL(... | 1 | 7,674,733 |
#include<iostream>
#include<map>
#include<algorithm>
using namespace std;
int main() {
int n; cin >> n;
map<int, int>a;
for (int i = 0; i < n; i++) {
int tmp; cin >> tmp;
a[tmp]++; a[tmp - 1]++; a[tmp + 1]++;
}
int ans = 0;
for (auto&& x : a) {
ans = max(ans, x.second);
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <climits>
#include <functional>
#include <iostream>
#include <queue>
#include <string>
#include <numeric>
#include <vector>
using namespace std;
using ll = long long;
template<typename T> void print(T t) {cout << t << endl;}
;
int main() {
int N, a;
cin >> N;
vector<int... | 1 | 13,065,754 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <climits>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DEBUG 1
using namespace std;
constexpr int kMod = 1000000007;
typedef long lo... | #include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++... | 1 | 35,989,563 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long a[3]={},b[3]={};
int n=2,m=2;
for(int i=0;i<2;i++){
scanf("%lld",&a[i]);
}
if(a[0]<=0&&a[1]>=0)n=3;
for(int i=0;i<2;i++){
scanf("%lld",&b[i]);
}
if(b[0]<=0&&b[1]>=0)m=3;
long long res;
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
if(i=... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll maxn = 1e6 + 10;
int main(){
ll a,b,c,d;
ll sum;
cin>>a>>b>>c>>d;
sum = max(b * c,b * d);
sum = max(sum,a * c);
sum = max(sum,a * d);
cout<<sum<<endl;
return 0;
} | 1 | 82,953,719 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
#define all2(a, b) (a).begin(), (a).begin() + (b)
#define debug(vari) cerr << #vari << " = " << (vari) << endl;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b;
cin >> a >> b;
if ( a%2 && b%2 ) {
puts("Odd");
}
else {
puts("Even");
}
return 0;
} | 1 | 63,489,423 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using Map = map<ll,vl>;
using Tu = tuple<ll,ll,ll>;
using vvl = vector<vector<ll>>;
const ll INF=1LL<<60;
const ll MOD=1000000007;
int main(){
ll N;
cin >> N;
ll K;
cin >> K;
string S;
... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#define int ll
typedef pair<int,int> pii;
#define fi first
#define se second
#define Sort(a) sort(a.begin(),a.end())
#define rep(i,n) for(int i = 0;i < (n) ; i++)
#define REP(i,n) for(int i = 0;i < (n) ; i++)
#define MP(a,b) m... | 1 | 84,500,307 |
#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 pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using vst=vector<string>;
using P = ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n,0);
for (int i = 0; i < n; i++) cin >> a[i];
int now = 1;
int count = 0;
vector<int> arrived(n+1, 0);
while(arrived[now] == 0){
if (now == 2) {
cout << count << endl;
return 0;
}
arrived[n... | 1 | 2,197,135 |
#include<bits/stdc++.h>
using namespace std;
int fun(int cur,vector<long long int> &dp,vector<long long int> &h,int k){
if(dp[cur]!=-1) return dp[cur];
long long int ans=1e10;
for(int i=max(0,cur-k);i<cur;i++){
ans = min(ans,fun(i,dp,h,k) + abs(h[cur]-h[i]));
}
dp[cur]=ans;
return dp[cur];
}
int main(){
long l... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,k;
scanf("%d %d",&n,&k);
vector<int> v(n);
for(int&x:v) scanf("%d",&x);
vector<int> dp(n+1,1e9);
dp[0] = 0;
for(int i = 1; i < n; i++)
for(int j = 1; j <= k; j++)
if(i-j >= 0)
dp[i] = min(dp[i], dp[i-j]+abs(v[i]-v[i-j]));
printf("%d\n", dp[... | 1 | 36,655,619 |
#include <bits/stdc++.h>
using namespace std;
#define INF_LL (int64)1e18
#define INF (int32)1e9
#define REP(i, n) for(int i = 0;i < (n);i++)
#define FOR(i, a, b) for(int i = (a);i < (b);i++)
#define all(x) x.begin(),x.end()
#define fs first
#define sc second
using int32 = int_fast32_t;
using uint32 = uint_fast32_t;
usi... | #include<iostream>
#include<algorithm>
using namespace std;
int main() {
int nmin, nmax, m;
while (cin >> m >> nmin >> nmax, m) {
int p[210];
for (int i = 1; i <= m; i++)cin >> p[i];
int ans = nmin, v = p[nmin] - p[nmin + 1];
for (int i = nmin + 1; i <= nmax; i++) {
if (v <= p[i] - p[i + 1]) {
ans = i;... | 1 | 29,844,408 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.