code1 stringlengths 54 12k | code2 stringlengths 66 12k | similar int64 0 1 | __index_level_0__ int64 24 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int s=0,n,k;
scanf("%d %d",&n,&k);
if(k>1)
s=n-k;
printf("%d",s);
return 0;
} | #pragma GCC optimize("O3")
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define pii pair<ll,ll>
#define vpii vector<pair<ll,ll> >
#define F first
#defin... | 1 | 60,497,609 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define ll long long
using namespace std;
int main()
{
ll n, m;
while(cin >> n >> m, n > 0){
ll ans=0;
vector<pair<int, int>> pd;
rep(i, n){
int p, d;
cin >> d >> p;
pd.push_back(make_pair(p, d));
}
sort(pd.rbegin(), pd.rend());
... | #include <iostream>
#include <vector>
#include <list>
#include <algorithm>
#include <string>
#include <sstream>
#include <stack>
#include <iomanip>
#include <numeric>
#include <queue>
#include <climits>
#include <set>
#include <complex>
#include <cmath>
#include <cstring>
#include <map>
using namespace std;
using ll = ... | 1 | 38,170,642 |
bool DBG = false;
#include<bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using ll = long long;
using ld = long double;
using bint = boost::multiprecision::cpp_int;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define IFOR(i,a,b) for(int i=((b)-1);i>=(a);--i)
#define RPT(i,a,b) for(int i... | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <functional>
#include <bitset>
#include <cmath>
#include <stack>
#include <iomanip>
#include <map>
#include <math.h>
typedef long long ll;
using namespace std;
const int MOD = 1000000007;
ll GCD(ll a, ll b) { return b ? GCD(b, a%b) : ... | 1 | 64,681,115 |
#include <iostream>
#include <string>
using namespace std;
bool chk[244140624];
int n;
string ins, s;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n;
while (n--) {
cin >> ins >> s;
int h = 0;
for (int i=0, l=s.size(); i<l; ++i) {
h *= 5;
if... | #include "iostream"
#include "string.h"
using namespace std;
static const int MAX = 1048576;
static const int LEN = 14;
int makeKey( char str[LEN] ) {
int key = 0, x;
int l = strlen(str);
for (int i = 0; i < 9; i++) {
x = 0;
if (i < l) {
if (str[i] == 'A') x = 0;
else if (str[i] == 'C') x = 1;
else if (... | 1 | 15,476,651 |
#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 pqueue(x) priority_queue<x,v... | #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<ll, ll>;
const ll INF = ll(1e18) + 5;
int main() {
ll N, K;
cin >> N >> K;
vector<P> td(N);
rep(i, N) {
cin >> td[i].second >> td[i].first;
}
sort(td.rbegin(... | 1 | 90,674,087 |
#include<bits/stdc++.h>
using namespace std;
#define Boost() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
typedef long long ll;
typedef long long int lli;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int,int> pii;
typedef pair<double, double> pdd;
t... | #include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
const int INF = 100010001;
const ll LINF ... | 1 | 57,621,039 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <bitset>
#include <string>
#include <cmath>
#include <complex>
#include <numeric>
#include <cassert>
#include <vector>
#include <array>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <utility>
#define PI 3.14... | #include <bits/stdc++.h>
using namespace std;
#define END '\n'
#define int long long
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ss second
#define trace(x) cerr<<x<<END;
#define loop(i, a, b) for(int i = (a); i < (b); i++)
#define loopb(i, b, a) for(int i = (b); i > (a); --i)
const int mod... | 1 | 50,728,058 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll k, a, b;
cin >> k >> a >> b;
if (k <= a || a + 2 >= b) {
cout << k + 1 << '\n';
return 0;
}
ll ans = a + (k - a + 1) / 2 * (b - a);
if ((k - a + 1) % 2 == 1) ans++;
cout... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
t... | 1 | 80,432,621 |
#include <algorithm>
#include<stdio.h>
#include <cstdio>
#include <iostream>
#include <iomanip>
#include <string>
#include <algorithm>
#include <vector>
#include <math.h>
#include <stack>
#include <queue>
#include<map>
#include <set>
#include<math.h>
using namespace std;
#define int long long
#define ll long long
#defi... | #include <stdio.h>
typedef long long ll;
int main(void) {
ll i, j, k, h, w, a, b;
scanf("%lld%lld%lld%lld", &h, &w, &a, &b);
for(i = 0; i < h; ++i) {
for(j = 0; j < w; ++j) printf("%d", (i < b) ^ (j < a));
printf("\n");
}
return 0;
} | 1 | 23,752,907 |
#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() {
string s;
cin >> s;
int ans1 = 0, ans2 = 0;
rep(i,s.size()) {
if (i%2 == 0 && s[i] == '0') ans1++;
if (i%2 != 0 && s[i] == '1') ans1++;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int count1 = 0;
int count2 = 0;
for(int i = 0; i < S.size(); i++) {
if(i % 2 == 0) {
if(S.at(i) == '0') {
count2++;
}
else {
count1++;
}
}
else {
if(S.at(i) == '0') {
... | 1 | 33,957,026 |
#include <algorithm>
#include <iostream>
#include <vector>
#include <math.h>
#include <set>
#include <map>
#include <string>
#include <stack>
#include <queue>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <bitset>
#include <complex>
#include <unistd.h>
#include <cassert>
#include <cctype>
#include <ra... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define pb push_back
#define pii pair<int, int>
#define ll long long
#define ff first
#define ss second
#define mp make_pair
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics... | 1 | 44,270,099 |
#include <iostream>
#define rep(i,n) for(int i = 0; i < n; i++)
using namespace std;
int main() {
char b;
cin >> b;
char ans;
switch(b){
case 'A':
ans = 'T';
break;
case 'C':
ans = 'G';
break;
case 'G':
ans = 'C';
... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define FastIO ios_base::sync_with_stdio(0);cin.tie(0),cout.tie(0)
#define pb push_back
#define mp make_pair
#define mem(x,i) memset(x,i,sizeof(x))
#define ff... | 1 | 68,463,693 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <queue>
#include <climits>
#include <set>
#include <map>
#include <stack>
#include <iomanip>
#include <tuple>
#define ll long long
using namespace std;
ll factorial(ll n){
if(n==0){
return 1;
}
els... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
struct point{int x;int y;};
int i,j,k,count1=0,count2=0;
int main(){
string s;
int w;
cin>>s>>w;
for(i=0;i<s.length();i+=w){
cout<<s[i];
}
cout<<endl;
} | 1 | 64,722,414 |
#include <stdio.h>
#include <algorithm>
using namespace std;
int n, a[100000];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
sort(a, a + n);
if (n == 2) {
printf("%d %d\n", a[1], a[0]);
return 0;
}
int lo = 0, hi = n - 2;
if (a[lo] >= (a[n - 1] + 1) / 2) {
printf("%d %d\n"... | #include <iostream>
#include <cstdio>
using namespace std;
int n, mx, m, x, i, j, t, a[100005];
int main()
{
cin >> n;
for (i = 0; i < n; i++) {
scanf ("%d", &a[i]);
mx = max(mx, a[i]);
}
for (i = 0; i < n; i++) {
t = min(a[i], mx - a[i]);
if (t > m) {
m = t;
x = a[i];
}
}
cout << mx << " " << x;
... | 1 | 1,541,606 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<iomanip>
using namespace std;
int main(){
int n;
cin>>n;
string s;
double u;
double sum=0;
for(int i=0;i<n;i++){
cin>>u>>s;
if(s=="JPY")sum+=u;
else sum+=u*380000.0;
}
cout<<sum<<end... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
double ans=0;
cin>>n;
vector<double>x(n);
vector<string>u(n);
for(int i=0;i<n;i++) cin>>x[i]>>u[i];
for(int i=0;i<n;i++){
if(u[i]=="JPY") ans+=x[i];
else ans+=x[i]*380000.0;
}
cout<<setprecision(10)<<ans<<endl;
} | 1 | 100,652,503 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
using vi = vector<int64_t>;
using vvi = vector<vi>;
using ll = long long ;
using P = pair<ll,ll>;
ll INF = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
vi v ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define P pair<ll,ll>
int main(){
vector<int> a={1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int k;
cin>>k;
cout<<a[k-1]<<endl;
} | 1 | 7,082,754 |
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
int maxt(int x){
return (x+9)/10 * 10;
}
int maxr(int x){
return maxt(x)-x;
}
int main(){
int a,b,c,d,e;
cin >> a >> b >> c >> d >> e;
int r;
r = maxt(a)+maxt(b)+maxt(c)+maxt(d)+maxt(e);
r -= max({maxr(a),maxr(... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) begin(v),end(v)
using ll = long long;
int main() {
int ans=0;
vector<int> vec(5);
rep(i,5){
cin>>vec[i];
ans+=(vec[i]+9)/10*10;
}
int cnt=1e9;
bool as=false;
rep(i,5){
if(vec[i]%10!=0){... | 1 | 52,625,455 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll n;
cin >> n;
ll res = 1e16;
for (ll a = 1; a * a <= n; ++a) {
if (n % a == 0) {
ll b = n / a;
ll sum = a + b;
res = min(res, sum);... | # include <bits/stdc++.h>
# define rep(i, n) for(ll i = 0; i < (n); ++i)
# define reps(i, n) for(ll i=1, i##_len=(n); i<=i##_len; ++i)
# define rrep(i, n) for(ll i=((int)(n)-1); i>=0; --i)
# define rreps(i, n) for(ll i=((int)(n)); i>0; --i)
# define ll long long
# define ALL(x) (x).begin(), (x).end()
# define SZ(x) ((i... | 1 | 80,940,901 |
#include<string>
#include<cstdio>
#include<iostream>
using namespace std;
int main(){
int a[101]={0};
int i, max=0;
while(scanf("%d",&i)!=EOF)
if(max<++a[i]) max=a[i];
for(int j=0; j<101; j++){
if(max==a[j]) printf("%d\n",j);
}
return 0;
} | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int y[10000000], n, maxv; vector<int>a;
int main() {
while (cin >> n) {
y[n]++;
}
for (int i = 0; i < 10000000; i++) {
maxv = max(maxv, y[i]);
}
for (int i = 0; i < 10000000; i++) {
if (y[i] == maxv) { cout << i << endl; }
}
} | 1 | 8,549,371 |
#include<iostream>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
int total,x,res;
res=0;
for(int i=1;i<=N;i++){
total = 0;
x = i;
while(true) {
total += x%10;
if(x/10 < 1) break;
else x/= 10;
}
if(total >= A && total <= B) res+=i;
}
cout << res << endl;
} | #include<iostream>
using namespace std;
int main (void)
{
int a,b,n,i,j,k,l,ans;
n=0;ans=0;
cin>>n>>a>>b;
for(i=0;i<10;i++)
{
for(j=0;j<10;j++)
{
for(k=0;k<10;k++)
for(l=0;l<10;l++)
{ if(1000*i+100*j+10*k+l>n){cout<<ans;return 0;}
if(i+j+k+l<=b&&i+j+k+l>=a){ans+=1000*i+... | 1 | 22,177,249 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 1e9 + 7;
const int inf = (1 << 30) - 1;
const ll infll = (1LL << 61) - 1;
#define fast() ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define digit(N) cout << fixed << setprecision((N))
int N, M, P;
int main()
{
while (cin >... | #include <iostream>
using namespace std;
int main () {
int n, m, p;
while (cin >> n >> m >> p, n || m || p) {
int gambler = 0;
int hit;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
gambler += x;
if (i + 1 == m) hit = x;
}
if (hit) {
int pool = gambler * 100 - gambler * p;
cout << pool / ... | 1 | 12,555,996 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
#include <climits>
#include <iomanip>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
ll mod = 998244353;
long long power(long long m,long long n){
long long res = 1;
if(n > 0)... | #include<bits/stdc++.h>
#include<cctype>
using namespace std;
#define rep(i,n) for (int i=0;i<(n);i++)
#define all(v) (v).begin(),(v).end()
typedef long long int ll;
#define pi 3.1415926535897932384
#define E9 1000000000
#define eps 1e-4
#define pii pair<int,int>
ll pow_mod(ll a, ll n, ll MOD){
ll m[60]; m[0]=a;
r... | 1 | 29,585,384 |
#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<int,int>;
int main(){
string S, T;
cin >> S >> T;
int N = S.size();
rep(i,N){
string U;
rep(j,N) U += S[(i+j)%N];
if(U == T) {
cout << "Yes" << endl;
return 0;
}
}
c... | #pragma region header
#define _GLIBCXX_DEBUG
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>... | 1 | 87,638,781 |
#include <iostream>
#include <string>
using namespace std;
int main()
{
int a = 0;
string S;
cin >> S;
if (S.size() == 2) {
if (S.at(0) == S.at(1))
cout << "1 2" << endl;
else cout << "-1 -1" << endl;
return 0;
}
for (int i = 2; i < S.size(); i++) {
if (S.at(i - 2) == S.at(i - 1)) {
cout << i - 1 <<... | #include <iostream>
#include <vector>
#include <bitset>
#include <utility>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <cmath>
#include <map>
using namespace std;
typedef long long ll;
int main(){
string s;
cin >> s;
vector<int> n(30,-100);
for(int i=0; i<(int)s.size(); i++){
... | 1 | 78,659,338 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<deque>
#include<cmath>
#include<map>
#include<cstring>
#include<iomanip>
using namespace std;
typedef long long ll;
const int INF = 1e9 + 6;
const ll MOD = 1e9 + 7;
const ll LLINF = 1LL<<60;
#define P pair<int, int>
#define rep(i, n) for ... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long
#define ld long double
#define pii pair <ll, ll>
#define piii pair <ll, pii>
#define F first
#define S ... | 1 | 83,260,443 |
#include <iostream>
using namespace std;
int main()
{
int n;
int a;
n=10000;
for(int i=0;i<n;i++){
cin>>a;
if(a==0){cout<<"";
return 0;
}
else
{
cout<<"Case"<<" "<<i+1<<":"<<" "<<a<<endl;}
} return 0;} | #include<stdio.h>
int main()
{
int num[10000],n;
n = 0;
while (1)
{
scanf("%d", &num[n]);
if (num[n] == 0) break;
n = n + 1;
}
n = 0;
while (num[n] != 0)
{
printf("Case %d: %d\n", n+1, num[n]);
n = n + 1;
}
return 0;
} | 1 | 45,360,874 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(n, i) for(ll i = 1; i <= n; ++i)
void solve(void){
ll n, a, b; cin >> n >> a >> b;
ll res = 0;
rep(n, i) {
ll tmp = i;
ll cnt = 0;
while (tmp != 0) {
cnt += tmp % 10;
tmp /= 10;
}
if (a <= cnt && cnt <=... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
int sum_nb;
int total = 0;
cin >> n >> a >> b;
for (int i = 1; i <= n; i++) {
sum_nb = i/10000 + (i%10000)/1000 + (i%1000)/100 + (i%100)/10 + i%10;
if (a <= sum_nb && sum_nb <= b) {
total += i;
... | 1 | 80,891,055 |
#include <stdio.h>
int main()
{
int n1=0,n2=0,n3=0;
scanf("%d %d %d",&n1,&n2,&n3);
if(n1<n2&&n2<n3)
printf("Yes\n");
else
printf("No\n");
return 0;
} | #include <stdio.h>
int main(){
int a,b,c;
scanf("%d",&a);scanf("%d",&b);scanf("%d",&c);
if(a<b&&b<c)printf("Yes\n");
else printf("No\n");
return 0;
} | 1 | 40,391,063 |
#include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#de... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <list>
#include <utility>
#include <tuple>
#include <cstdio>
#include <set>
#include <queue>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#inclu... | 1 | 17,613,339 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
double ans;
int64_t sum = 0;
vector<int> num(n, 1);
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += 1e10 / a[i];
}
ans = 1e10 / sum;
printf("%.10f", ans);
} | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define repi(i,a,b) for(ll i=... | 1 | 71,924,140 |
#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;
vector<int>a(n);
if(n==k) cout<< 1 <<endl;
else{
int num = k - 1;
int num2 = n - k ;
if(num2 % num ==0) cout<< num2/ num +1<<endl;
else cout << num2 / num +2 ... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin>>n>>k;
cout << ( (n-3+k)/(k-1))<<endl;
} | 1 | 51,137,472 |
#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 H, W;
cin >> H >> W;
ll ans = LONG_MAX... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 0x3f3f3f3f;
ll H, W;
void solve()
{
if(H%3==0 || W%3==0) cout << 0 << '\n';
else{
ll ans = 1e18;
for(int w=1;w<W;++w){
ll a1 = w*H, a2 = (W-w)*(H/2), a3 = H*W-a1-a2;
ll mx = max(a1,max(a2,a3));
ll mi = min(a1,min(a2,a3));... | 1 | 10,539,297 |
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <math.h>
#include <list>
#include <string>
#include <map>
#include <vector>
#include <stack>
#include <queue>
#include <iomanip>
using namespace std;
#define REPD(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) REPD(i, 0, n)
typedef long l... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
int main() {
ios_base::sync_with_stdio(false); cin.tie(0), cout.tie(0);
string s;
cin >> s;
if(s.length() == 2) {
if(s[0] == s[1]) cout << "1 2" << endl;
else cout << "... | 1 | 88,858,049 |
#include <bits/stdc++.h>
using namespace std;
#define all(V) V.begin(),V.end()
#define ll long long
#define MOD 1000000007
ll dp[601][601];
void chmin(ll&a, ll b) {
a = min(a, b);
}
int main(){
int N, K;
cin >> N >> K;
vector<ll> H(N + 2, 0);
for (int i = 1;i <= N;i++) {
cin >> H[i];
}
ll a, b, c, d;
for (int... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define ll long long
#define vi vector <int>
#define vii vector <pair<int,int> >
#define rep(i,a,b) for (int i=a;i<b;i++)
#define repD(i,a,b) for (int i=a;i>b;i--)
#define pb push_bac... | 1 | 87,038,796 |
#include <iostream>
#include <string>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
int main()
{
int n,a = 0,b = 0;
cin >> n;
rep(i,n)
{
string s,s2;
cin >> s >> s2;
if(s > s2) a += 3;
else if(s < s2) b += 3;
else
{
a++;
b++;
}
}
cout << a << " " << b << endl;
return 0;
} | #include<iostream>
#include<string>
using namespace std;
int main(){
string taro;
string hanako;
int p_taro=0;
int p_hana=0;
int n;
cin>>n;
for(int i=0;i<n;i++){
cin>>taro>>hanako;
if(taro>hanako)
p_taro+=3;
else if(taro<hanako)
p_hana+=3;
else if(taro==hanako){
p_taro+=1;
p_hana+=1;
}
}
... | 1 | 29,848,755 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(obj) (obj).begin(), (obj).end()
#define bit(n) (1LL << (n))
typedef long long ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int r,d,x; cin>>r>>d>>x;
int res[10];
rep(i,10) {
if(i==0) {
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); ++i)
double const PI = 3.1415926535897932384626433;
using P = pair<int, int>;
int main() {
int r, d, x20, ans = 0;
cin >> r >> d >> x20;
rep(i, 10) {
if (i == 0)
ans += r * x20 -... | 1 | 2,031,531 |
#define long_enable
#include <iostream>
#include <algorithm>
#include <cstring>
#include <numeric>
#include <iomanip>
#include <sstream>
#include <vector>
#include <queue>
#include <set>
#include <map>
using namespace std;
#ifdef stream_enable
#define cin sss
#endif
#ifdef long_enable
typedef long long int ll;
#else
ty... | #include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
#include <set>
#include <unordered_set>
#include <bitset>
using namespace std;
using ll = long... | 1 | 99,329,163 |
#pragma GCC optimize("O3")
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#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) fo... | #include<iostream>
#include<iomanip>
#include<vector>
#include<string>
#include<cstring>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<climits>
#include<fstream>
#define MOD (1000000007)
using namespace std;
typedef long long ... | 1 | 27,273,444 |
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | #include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
#include<set>
using namespace std;
int main()
{
int N;
cin >> N;
vector<int> A;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
A.push_back(a);
}
sort(A.begin(), A.end());
cout << A[A.size() - 1] - A[0] << endl;
} | 1 | 70,657,577 |
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <sstream>
#include <iomanip>
#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 iINF = 100100100;
const ll llINF = 1LL << 60;
string s = "";
int... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
vector<string> options = {"dream", "dreamer", "erase", "eraser"};
stack<int> DFS;
DFS.push(0);
bool divisible = false;
while (!DFS.empty()) {
int t = DFS.top();
DFS.pop();
if (t == s.size()) {
divisible = ... | 1 | 40,560,974 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,s,n) for(int i=(s);i<(n);i++)
#define repr(i,n) for(int i=n-1;i>=0;i--)
#define REPR(i,s,n) for(int i=(s);i>=(n);i--)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define pb push_back
#define... | #include <iostream>
#include <iomanip>
#include <utility>
#include <cmath>
#include <random>
#include <vector>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <algorithm>
using namespace std;
#define rep(i,n) for(int i = 0; i<n; ++i)
#define REP(i,n) for(int i... | 1 | 78,692,016 |
#include<bits/stdc++.h>
using namespace std;
struct Node{
int key;
int id,parent,left,right;
};
Node A[20000000];
int H;
void heap(int H){
for(int i=1;i<=H;i++){
if(i==1){
A[i].left=A[2*i].key;
A[i].right=A[2*i+1].key;
}
else {
A[i].parent=A[i/2].key;
A[i].left=A[2*i].key;
... | #include <iostream>
#include <cstdio>
#include <queue>
using namespace std;
int main(){
priority_queue <int> a;
int tmp1;
char tmp2[10];
while(scanf("%s",tmp2),tmp2[2]!='d'){
if(tmp2[0]=='i'){
scanf("%d",&tmp1);
a.push(tmp1);
}
else{
printf("%d\n",a.top());
a.pop();
}
}... | 1 | 99,120,180 |
#include<bits/stdc++.h>
#define mod 1000000007
#define ll long long int
#define ar array
#define pb push_back
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
int n,z,w;
cin>>n>>z>>w;
int a[n];
for(int i= 0; i<n; i++) cin>>a[i];
int g = abs(a[n-1]-w);
int ans = 0;
for(int i = 0; i<... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
int n,a[2001];
int memo1[2001],memo2[2001];
int dfs2(int);
int dfs1(int i){
if(~memo1[i]) return memo1[i];
int res=abs(a[n-1]-a[i-1]);
for(int j=i;j<n-1;j++) res=max(res,dfs2(j+1));
return memo1[i]=res;
}
int dfs2(int i){
if(~mem... | 1 | 34,468,584 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
int fun(int&x, int y) {
}
signed main()
{
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
{
int h, w;
cin >> h >> w;
string s[h];
for(int i = 0; i < h; i++)
cin >> s[i];
int dp[h][w];
for(int i = 0; i < h; i... | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define rep(i,n) for(int i = 0; i < ((int)(n)); i++)
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; ... | 1 | 89,023,530 |
#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>;
int main(){
int a, b, c;
cin >> a >> b >> c;
int ans = min({a+b, b+c, c+a});
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
int ans=max({a,b,c});
cout<<a+b+c-ans<<endl;
} | 1 | 2,183,227 |
#include<bits/stdc++.h>
using namespace std;
#define TC ll t; cin >> t; while(t--)
typedef long long ll;
int main()
{
long long a,bb;
double b;
cin >> a >> b;
bb=round(b*100);
cout << (a*bb)/100 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (int i = j; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 1000000007
template<... | 1 | 28,131,881 |
#include <bits/stdc++.h>
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rep(i, n) REP (i, 0, n)
#define mset(a, n) memset(a, n, sizeof(a))
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef vector<pair<int, int> > vpii;
const int INF = 10000000... | #include<iostream>
#include<algorithm>
using namespace std;
static const int MIN = -1 * (1 << 21);
int main() {
int i, j, n, a, maxa, max_so_far, max_ending_here;
while (1) {
cin >> n;
if (n == 0)break;
max_so_far = 0;
max_ending_here = 0;
maxa = MIN;
for (i = 0; i < n; i++) {
cin >> a;
maxa = max(m... | 1 | 53,787,359 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string S;
cin >> S;
string T="keyence";
for(int i=0;i<=7;i++){
if(S.substr(0,i)==T.substr(0,i) && S.substr(S.size()-7+i,7-i)==T.substr(i,7-i)){
cout << "YES" << endl;
return 0;
}
}
cout << "NO" << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
string S;
cin >> S;
string T = "keyence";
int samebegin = 0;
int sameend = 0;
rep(i,T.size()) {
if (S.at(i) != T.at(i)) break;
... | 1 | 15,624,597 |
#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 int long long
#define endl '\n'
#define pb push_back
#define fi first
#define se second
#define all(c) (c).begin(),(c).end()
typedef long long ll;
typedef long ... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define float double
#define pb push_back
#define FF first
#define SS second
#define N 100005
#define MOD 1000000007
#define fn(i,n) for(int i=0;i<n;i++)
#define rep(i,l,r) for(int i=l;i<=r;i++)
#define pii pair<int,int>
#define mp make_pair
#defi... | 1 | 89,421,396 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define rep(i, begin, n) for (int i = begin; i < n; i++)
#define repe(i, begin, n) for (int i = begin; i <= n; i++)
#define repr(i, begin, n) for (int i = begin; i > begin - n; i--)
#define repre(i, begin, end) for (int i = begin; i >= end; i--)
templa... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
int sum = 0;
cin >> N;
int A = N;
for (int i = 1; i < 9; i++){
int B = A % 10;
sum += B;
A -= B;
A /= 10;
}
if (N % sum == 0){
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
} | 1 | 70,946,204 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
template<class T, class S> void cmin(T &a, const S &b) { if (... | #include <bits/stdc++.h>
#include <sstream>
#include <algorithm>
#include <map>
#include <iterator>
#include <queue>
#include <utility>
#include <set>
using namespace std;
#define endl '\n'
#define ll long long int
#define c(x) ll x;cin>>x
#define cc(x,y) ll x,y;cin>>x>>y
#define ccc(x,y,z) ll x,y,z; cin>>x>>y>>z
#defi... | 1 | 26,829,970 |
#include <iostream>
#include <vector>
using namespace std;
int main()
{
int n;
cin >> n;
vector<pair<int64_t, int>> numb(n);
for (auto & x: numb) {
cin >> x.first >> x.second;
}
int64_t sum = 0;
for (int i = n - 1; i > -1; --i) {
numb[i].first += sum;
if (numb[i].firs... | #include <iostream>
#include <vector>
#include <cassert>
#include <cmath>
#include <map>
using ll = long long;
#define MIN(a, b) (((a) < (b)) ? (a) : (b))
#define MAX(a, b) (((a) < (b)) ? (b) : (a))
int const nmax = 100000;
int a[1 + nmax], b[1 + nmax];
int main() {
int n;
std::cin >> n;
for(int i = 1;i <= n; i++... | 1 | 70,854,909 |
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define pp pair<pair<ll, ll>,pair<ll, ll>>
#define pll pair<ll,ll>
#define pdd pair<double,double>
#define vii vector<int>
#define vll vector<ll>
#define mat vector<vector<ll>>
#define lb lower_bound
#define ub upper_b... | #include<iostream>
#include<string>
using namespace std;
bool isPalin(string S){
string t = S;
reverse(t.begin(),t.end());
return S == t;
}
int main(){
string s;
cin >> s;
bool ans = true;
if(!isPalin(s)) ans = false;
if(!isPalin(s.substr(0,s.size()/2))) ans = false;
cout << (ans ? "Yes" : "No") << endl;
retu... | 1 | 74,113,103 |
#include <algorithm>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
char c1[3];
char c2[3];
using namespace std;
int main() {
cin >> c1[0] >> c1[1] >> c1[2];
cin >> c2[0] >> c2[1] >> c2[2];
cout << (c1[0] == c2[2] && c1[1... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < n; i++)
#d... | 1 | 56,854,462 |
#include <bits/stdc++.h>
#define rep(i,x,n) for(int i=x; i<(int)(n); i++)
#define rep_eq(i,x,n) for(int i=x; i<=(int)(n); i++)
using namespace std;
using ll=long long;
int main() {
int A,B,M; cin >>A >>B >>M;
vector<int> a(A);
rep(i,0,A) {cin >>a[i];}
vector<int> b(B);
rep(i,0,B) {cin >>b[i];}
int ans=*min_... | #include<bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int a,b,m;
cin>>a>>b>>m;
int ref[a],mic[b];
for (int i=0;i<a;++i){
cin>>ref[i];
}
for (int i=0;i<b;++i){
cin>>mic[i];
}
int mini = INT_MAX;
for(int i=0;i<m;++i){
... | 1 | 24,589,311 |
#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 pp pop_back`
#define pb push... | #include<bits/stdc++.h>
#define ll long long
#define pr pair<ll,ll>
using namespace std;
int main() {
int n;
cin >> n;
vector<pr > Q;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
Q.push_back({ a,i });
}
sort(Q.begin(), Q.end());
for (pr p : Q) {
cout << p.second+1<<' ';
}
return 0;
} | 1 | 461,814 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> v(N);
for(int i = 0; i < N; i++) {
cin >> v.at(i);
}
sort(v.begin(), v.end());
for(int i = 0; i < N; i++) {
}
double ans = v.at(0);
for(int i = 1; i < N; i++) {
ans = (ans + v.at(i)) / 2;
}
cout << ... | #include<bits/stdc++.h>
#define mod pow(10,9)+7
#define pb push_back
#define ff first
#define ss second
#define ii pair<int,int>
#define vi vector<int>
#define mii map<int,int>
#define int long long
#define inf 2000000000000000000
#define re(i,x,n) for(i=x;i<=n;i++)
using namespace std;
#define int long long
void c_p_c... | 1 | 44,103,276 |
#include <bits/stdc++.h>
#define lli long long int
#define MOD 1000000007
#define INF INT_MAX
#define INFLL LLONG_MAX
#define rep(i, n) for(int i=0; i<(int)(n); i++)
#define repf(i, n) for(int i=1; i<(int)(n+1); i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
#define vi vector<lli>
#define vvi vector<vector<... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define fr(i,a,b) for(int i = a ; i <= b ; ++i)
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define tr... | 1 | 19,440,542 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
int x;
x = (a+b)/2;
if ((a%2 != 0 && b%2 == 0) || (a%2 == 0 && b%2 != 0)){
cout << x+1 << endl;
}else {
cout << x << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int x,y;
cin >> x >> y;
if((x+y)%2==0){
cout << (x+y)/2 << endl;
}
if((x+y)%2==1){
cout << (x+y)/2 +1 << endl;
}
} | 1 | 93,993,015 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<int, int> P;
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define Z class
template <typename T>
T square(T x) { retu... | #include <iostream>
using namespace std;
int main()
{
int a,b,c;
cin>>a>>b>>c;
int x=a+b;
if (x>=c && c-x!=1){
cout<<("Yes");
}
else{
cout<<("No");
}
} | 1 | 87,227,388 |
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define pb push_back
#define vl vector
#define ff first
#define ss second
using namespace std;
int main()
{
ll a,b,i,j,n,t;
cin>>a>>b;
if(a<b) cout<<0;
else cout<<10;
} | #include <bits/stdc++.h>
#define MAXN 200010
#define pii pair<int,int>
#define ff first
#define ss second
#define ll long long
#define in_range(x, y, n) (x >= 0 and x<n and y >=0 and y<n)
using namespace std;
const ll mod = 1e18 + 7;
int main (){
ios_base::sync_with_stdio(false);
int x, a;
cin >> x >> a;
... | 1 | 35,671,626 |
#include<bits/stdc++.h>
#include<string.h>
using namespace std;
int main()
{
char line[50];
cin.getline(line,50);
char a,b,c,d;
int count=0;
for(int i=0;i<strlen(line);i++)
{
if(line[i]==' ')
{
if(count==0)
{
a=line[i-1];
b=line[i+1... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#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<=(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=ll(b);i--)
#define ALL(x) (x).begin(),(x).end()
#define MAX(x) *max_element(ALL(x))
#defin... | 1 | 7,430,731 |
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
#define PI 3.14159265358979
#define MOD 1000000007
using namespace std;
using ll = long long;
void solve()
{
int k, x;
cin >> k >> x;
cout << (k * 500 < x ? "No" : "Yes");
}
int main()
{
fastio;... | #include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define x first
#define y second
#define mk(a,b) make_pair(a,b)
#define rr return 0
#define sqr(a) ((a)*(a))
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()... | 1 | 1,364,107 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD (long long)(1e9+7)
#define INF (1LL<<60)
#define rep(i,n) for(ll i = 0; i < (n); i++)
#define rep1(i,n) for(ll i = 1; i <= (n); i++)
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return fa... | #include <bits/stdc++.h>
using namespace std;
int main() {
long double A,B;
cin >> A >> B;
cout << (long long)floor(A*B+0.001) << endl;
} | 1 | 40,738,255 |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(int)(n); i<i##_len; i++)
#define reps(i,n) for(int i=1 , i##_len=(int)(n);i<=i##_len;i++)
#define rrep(i,n) for(int i=((int)(n)-1);i>=0;i--)
#define rreps(i,n) for(int i=((int)(n));i>0;i--)
#define repi(i,x) for(a... | #include <bits/stdc++.h>
using namespace std;
long long INF=pow(10LL, 16LL);
int main(){
long N, D, A;
cin >> N >> D >> A;
pair<long, long> monsters[N];
for (int i = 0; i < N; i++) {
long X, H;
cin >> X >> H;
monsters[i]={X,H};
}
sort(monsters, monsters+N);
long comulativeDamage = 0L;
long ... | 1 | 46,590,187 |
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#define mpr make_pair
#define debug() puts("okkkkkkkk")
#define rep(i,a,b) for(int (i)=(a);(i)<=(b);(i)++)
using namespace std;
typedef long long LL;
const int inf = 1e9;
int n,m;
char s[105][105];
int dp[105][105];
signed main(){
memset(dp,... | #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#include <bits/stdc++.h>
using namespace std;
template<class t> inline t read(t &x){
char c=getchar();bool f=0;x=0;
while(!isdigit(c)) f|=c=='-',c=getchar();
while(isdigit(c)) x=(x<<1)+(x<<3)+(c^48),c=getchar();
if(f) x=-x;return x;
}
template<... | 1 | 52,041,190 |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O0")
typedef long long int ll;
typedef long double ld;
const ll mod = 1e9+7;
const ll INF = 1e18;
#define rep(i,n) for (ll i = 0; i < (n); ++i)
#define Rep(i,a,n) for (ll i = (a); i < (n); ++i)
#define All(a) (a).begin(),(a).end()
#define Pi acos(-1)
u... | #include <iostream>
#include <vector>
#include <queue>
using namespace std;
#define rep(i, j, n) for (int i = j; i < (int)n; ++i)
int main() {
int n, m, a, b;
cin >> n >> m;
vector<vector<int>> g(n);
rep(i, 0, m) {
cin >> a >> b;
--a, --b;
g[a].push_back(b);
g[b].push_back(a);
}
vector<int> ... | 1 | 22,813,343 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
vector<int> a(3);
cin >> a[0] >> a[1] >> a[2];
int ans = 0;
int min = *min_element(a.begin(), a.end());
int max = *max_element(a.begin(), a.end());
cout << abs(min - max) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int mi = min(min(A, B), C);
int ma = max(max(A, B), C);
cout << ma - mi << endl;
} | 1 | 77,260,449 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<long int> vec(n);
for (int i = 0; i < n; i++){
long int a;
cin >> a;
vec.at(i) = a;
if(vec.at(i) == 0){
cout << 0 << endl;
return 0;
}
}
sort(vec.begin(),vec.end());
reverse(vec.begin(),vec.end... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int N; cin >> N;
vector<ll> A(N);
for(int i=0; i<N; i++){
cin >> A[i];
}
ll ans = 1;
sort(A.begin(),A.end());
if(A[0] == 0){cout << 0 << endl; return 0;}
for(int i=0; i<N; i++){
if(A[i] <= 1000000000000000000LL/ans){
ans *= A... | 1 | 83,896,220 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <stack>
#include <set>
#include <cmath>
#include <algorithm>
using namespace std;
int n;
int cnt=0;
void dfs(int depth , int k , int sum ){
if(depth==n){
if(k==0){
cnt++;
return;
}
}
if(k<0) return;
for(int i=sum; i<10 ; i... | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#pragma region defins
#define ll long long
#define loop(i,n) for (int i = 0; i < n; i++)
#define loops(i,f,n) for (int i = (f); i < n; i++)
#define INF 100000000000000
#define sort(a) sort(a.begin(),a.end())
#define rsort(a) sort(a.rbegin(),a.rend... | 1 | 5,778,469 |
#include<bits/stdc++.h>
using namespace std;
const int maxN=2*1e5+1;
vector<int> adj[maxN];
int n;
long long ans=0;
void calc_val(int a,int b)
{
if(a<b)
{
ans+=(long long)(b-a)*(n-b+1);
}
else
{
ans+=(long long)(a-b)*b;
}
}
void dfs(int i,int p)
{
for(auto ch:adj[i])
{
if(ch!=p)
{
calc_val(i,ch);
... | #define MOD_TYPE 1
#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using Int = boost::multiprecision::cpp_int;
using lld = boost::multiprecision::cpp_dec_float_100;
#pragma GCC target("avx2")
#pragma GCC op... | 1 | 9,390,899 |
#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <algorithm>
#include <cmath>
#include <deque>
#define rep(i, n) for(int i = 0; i < n; i++)
const int INF = 1e9;
using ll = long long;
int main()
{
int N;
std::cin >> N;
std::vector<int> A(N);
std::vector<int> ans(N);
rep(i, N)
{
int... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define ALL(x) x.begin(),x.end()
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> b(n);
... | 1 | 52,034,251 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
int main(){
int n,m;
cin>>n>>m;
vector<int>broken(n+1);
rep(i,m){
int a; cin>>a;
broken[a]=1;
}
vector<int>dp(n+2);
const int mod=1000000007;
dp[n]=1;
for(int i=n-1;i>=0;i--){
if(broken[i]){
dp[i]=0;
co... | #include <bits/stdc++.h>
#define loop(s, e, i) for (int i=s; i<e; ++i)
#define print(s) cout << s << endl;
using namespace std;
using ll = long long;
#define DIV 1000000007
int main() {
ll N, M;
cin >> N >> M;
vector<ll> NUM(N+1);
loop(0, M, i) {
int tmp;
cin >> tmp;
tmp;
NUM[tmp] = -1;
}
if... | 1 | 71,617,588 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
template <class T>
bool chmax(T &a, const T &b) {
... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <stack>
#include <queue>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <cmath>
using namespace std;
#define PI 3.1415926535897932384626433832795
#define MOD (1000000007)
#define rep(i, n) for (int i = 0; i <... | 1 | 9,420,417 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int H, W, K;
cin >> H >> W >> K;
char d[H][W];
string s;
for (int i=0; i<H; i++){
cin >> s;
for (int j=0; j<W; j++){
d[i][j]=s.at(j);
}
}
int ans = 0;
for (int bitt = 0; bitt < (1<<H); bitt++) {
for (int bity =... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int sz = 35;
int arr[sz][sz], row[sz], col[sz];
int main() {
int h, w, k;
cin >> h >> w >> k;
char ch;
int tb = 0;
for(int i = 0; i < h; i++) {
int cs = 0;
for(int j = 0; j < w; j++) {
cin >> ch;
... | 1 | 38,032,939 |
#include<iostream>
#include<cmath>
#include<cstdlib>
#include<string>
#include<cstring>
#include<algorithm>
#include<vector>
#include<map>
#include<iomanip>
#include<queue>
#include<set>
using namespace std;
typedef long long ll;
typedef std::pair<int, int> ipair;
bool lessPair(const ipair& l, const ipair& r){return l.... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<deque>
#include<functional>
#include<iterator>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<utility>
using namespace std;
typedef long long ll;
#define a first
#define b second
#def... | 1 | 97,945,865 |
#include <iostream>
#include <vector>
using namespace std;
int main(){
int n, m, x, a, c, ans;
cin >> n >> m >> x;
vector<int> C;
vector<vector<int> > A(n, vector<int>(m));
for(int i=0;i<n;i++){
cin >> c;
C.push_back(c);
for(int j=0;j<m;j++){
cin >> a;
A[i][j] = a;
}
}
ans = 10... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long int
#define MOD 1000000007
#define oo 1000000000000000000
#define forr(i,n) for(ll i=0;i<n;i++)
#define fastio ios_base::sync_with_stdio(false); cin.tie(0) ; cout.tie(0);
#define all(x) x.begin()... | 1 | 95,964,248 |
#include <bits/stdc++.h>
using namespace std;
int x;
int main()
{
scanf("%d", &x);
printf("%d", 8 - (x - 400) / 200);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vec... | 1 | 85,106,937 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i <(int)(n); i++)
using namespace std;
int main(){
string S;
cin >> S;
int N = (int)S.size();
int count_a = 0;
int count_b = 0;
rep(i,N){
if(i % 2 == 0){
if(S.at(i) == '0')count_a++;
}
else{
if(S.at(i) == '1')count_a++;
}
... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
const int ... | 1 | 42,813,390 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define ll long long
#define P pair<ll,ll>
#define all(v) (v).begin(),(v).end()
const ll mod = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1.0);
int main(void)
{
string s; cin>>s;
ll ans=0;... | #include <iostream>
#include <string>
using namespace std;
int n;
string s;
int main(){
cin >> s;
n = 0;
for (auto &c: s){
if (c == 'x') n++;
}
if (n <= 7) cout << "YES";
else cout << "NO";
} | 1 | 34,530,922 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
int main(){
ll n;
cin >> n;
vector<ll> kosuu(10000,0);
ll ruton = pow(n, 0.5);
ll i=2, j=-1;
int ans = 0;
while(n!=1){
if(n%i==0)j++;... | #include <iostream>
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i=0; i<(ll)(n); i++)
const int N = (int)1e6;
int main() {
ll n;
cin >> n;
int c[N];
rep(i,N) c[i] = 0;
rep(i,N) {
while(i >= 2 && n % i == 0) {
n = n / i;
c[i]++;
}
}
int s = 0;
if(n != 1) s += 1;
... | 1 | 73,195,008 |
#include <iostream>
using namespace std;
int main() {
int n, m; cin >> n >> m;
const long long M = (long long)1e9 + 7;
long long xsum = 0, ysum = 0, xans = 0, yans = 0;
for (int i = 0; i < n; i++) {
long long x; cin >> x;
xans = (xans + x * i - xsum) % M;
xsum = (xsum + x) % M;
... | #include<bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define ALL(a) (a).begin(),(a).end()
#define Yes(hoge) cout<<((hoge)?"Yes":"No")<<endl;
#define YES(hoge) cout<<((hoge)?"YES":"NO")<<endl;
us... | 1 | 74,343,278 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <map>
#include <iomanip>
#include <deque>
#include <set>
#include <climits>
#include <memory>
#include <numeric>
#include <utility>
#define rep(i,a,b) for(int i=a;i<b;++i)
#define rrep(i,a,b... | #include<bits/stdc++.h>
using namespace std;
int main(){
int a[3];
for(int i=0;i<3;i++){
cin>>a[i];
}
sort(a,a+3,greater<int>());
int res=(a[0]*10)+a[1]+a[2];
cout<<res<<endl;
} | 1 | 11,728,686 |
#include <iostream>
using namespace std;
int main()
{
int a,b,x;
cin>>a>>b>>x;
if(x>a)
{
if(a+b>=x)
{
cout<<"YES";
}
else if(a+b<x)
{
cout<<"NO";
}
}
else if(x<a)
{
cout<<"NO";
}
else if(x==a)
{
... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
using Pl = pair<ll,ll>;
#define REP(i,n) for(ll i = 0;i < (ll)n;i++)
#define REPD(i,n) for(ll i = (ll)n - 1;i >= 0;i--)
#define ALL(x) (x).begin(),(x).end()
#define FILLl(n,first_dimension_size,value) fill((ll*)n,(ll*)(n+first_d... | 1 | 60,273,604 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
const int N = 1e6 + 5;
vector<int> adj[N];
int n, sub[N];
ll d[N], D;
map<ll, int> pos;
void no_answer() {
puts("-1");
exit(0);
}
void calc(int u, int p, int d = 0) {
D += d;
for (int v : adj[u]) calc(v, u, d + 1);
}... | #include <bits/stdc++.h>
#define INF 0x3f3f3f3f3f3f3f3f
typedef long long ll;
using namespace std;
int main(){
int n;
cin >> n;
vector<long long> d(n);
vector<int> weight(n, 1);
map<long long,int> mp;
for (int i = 0; i < n; i++) {
cin >> d[i];
mp[d[i]] = i;
}
vector<pair<int,int> > res;
for ... | 1 | 36,896,393 |
#include<iostream>
using namespace std;
int main() {
int A, B, C, K;
cin >> A >> B >> C >> K;
int ans = 0;
if (K <= A) ans = K;
else if (K <= A + B) ans = A;
else {
ans = A - (K - A - B);
}
cout << ans << endl;
} | #include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <cmath>
#define endl "\n"
typedef long long int ll;
typedef unsigned long long int ull;
typedef float fl;
typedef short int si;
using namespace std;
void solve()
{ int a,b,c,k; cin >> a >> b >> ... | 1 | 6,940,248 |
#include <iostream>
#include <string>
int main() {
using namespace std;
int n, total;
total = 0;
cin >> n;
for (int i=1; i<=n; i++) {
string x = to_string(i);
if (x.size() % 2 == 1) total++;
}
cout << total;
} | #include<bits/stdc++.h>
using namespace std;
int checkOorE( int i );
int main( void )
{
int N;
cin >> N;
int countO = 0;
for( int i = 1; i <= N; i++ ) {
countO += checkOorE( i );
}
cout << countO << endl;
}
int checkOorE( int i )
{
int count = 0;
while( i ) {
i /= 10;
count++;
}
if( coun... | 1 | 924,531 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repr(i,n) for(int i = (int)(n); i >= 0; i--)
#define all(v) v.begin(),v.end()
typedef long long ll;
int main(){
ll Q,H,S,D;
cin >> Q >> H >> S >> D;
ll N;
cin >> N;
N *= 4;
ll ans = 0;
ll... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll Q, H, S, D, N;
cin >> Q >> H >> S >> D >> N;
ll p05 = min(2*Q, H), p10 = min(2*p05, S), p20 = min(2*p10, D);
ll price = 0;
while(N!=0){
if (N >= 2){
price += (N/2)*p20;
N %= 2;
... | 1 | 79,124,088 |
#include <bits/stdc++.h>
using namespace std;
void pass(int l, int x, int n);
int ans;
bool toru[8];
vector<int> road[8];
signed main()
{
int n, m, a, b;
cin >> n >> m;
for(int i=0 ;i<m ;i++ ){
cin >> a >> b;
road[a-1].push_back(b-1);
road[b-1].push_back(a-1);
}
pass(0, 0, n)... | #include <iostream>
#include <vector>
using namespace std;
const int MAXN = 8;
vector <int> g[MAXN+1];
int n,m;
long long int res=0;
void dfs(int v, long long int mask){
if(mask==((1LL<<n)-1)){
res+=1;
}
else{
for(int i=0; i<g[v].size(); i++){
if(!((1LL<<g[v][i])&(mask))){
dfs(g[v][i], mask|(1LL<<g[v][i])... | 1 | 15,618,494 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
const ... | #include<bits/stdc++.h>
using namespace std;
#define mem(a,x) memset(a,x,sizeof(a));
#define ft ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long
int main()
{
ft
ll t,i,j,n,m,l,r;
cin>>n>>m;
ll a[n+1];
r=1e9+7;
mem(a,-1);
a[0]=1;
for(i=0;i<m;i++)
{
... | 1 | 54,161,209 |
#include <bits/stdc++.h>
#include <iostream>
#include<math.h>
using namespace std;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
char katerute(char dasite) {
if (... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define se second
const int N = 2e5+5;
string s;
int n,k,cst[3];
int cnt[N];
void solve(){
cin>>n>>k;
for(int i=0;i<3;i++)cin>>cst[i];
cin>>s;
for(int i=0;i<n;i++){
if(i<k)cnt[i] = 1;
else {
... | 1 | 77,343,640 |
#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 <deq... | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<cmath>
#include<math.h>
#include<limits>
#include<list>
#include <stdio.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i = 0;i < (n); ++i)
#pragma GCC optimize("Ofast")
int main() {
vector<vector<int>>a(3, vector<... | 1 | 95,804,163 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww
{
cww()
{
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long ... | #include <bits/stdc++.h>
using namespace std;
long long gcd(long x,long y){
if(y==0)return x;
return gcd(y,x%y);
}
long long lcm(long x,long y){
return x*y/gcd(x,y);
}
int ctoi(char c) {
if (c >= '0' && c <= '9') {
return c - '0';
}
return 0;
}
int main()
{
int N,A[100010]={},B[100010]={},ans=0,o[1... | 1 | 98,344,355 |
#include <algorithm>
#include <iostream>
#include <stack>
#include <set>
#include <cstdio>
#include <cstring>
using namespace std;
int ans[100005];
int res[100005];
int kun[100005];
int a[200005][2]={0};
int main(){
int n;
cin>>n;
long long a[200005];
long long res=0;
for(int i=0;i<n;i++){
c... | #include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <utility>
#include <cstring>
#include <iomanip>
#include <numeric>
#include <cmath>
#include <queue>
using namespace std;
typedef long long ll;
const int INF = 1<<30;
const int MOD = 1e9 + 7;
const int dx[] = {1... | 1 | 93,350,528 |
#include <iostream>
#include <algorithm>
#include <numeric>
using namespace std;
int a[10];
int n;
int s[100];
int s_max, s_min;
int sum = 0;
int ave = 0;
int main() {
while(cin >> n, n)
{
for(int i =0; i < n; i++){
cin >> s[i];
}
s_max = *max_element(s, s + n);
s_min = *min_element(s, s + n);
sum = a... | #include <iostream>
#include <algorithm>
using namespace std;
int main(){
int num;
while(true)
{
int ans = 0;
cin >> num;
if(num != 0)
{
int a[num];
for(int i = 0;i<num;i++)
{
cin >> a[i];
}
sort(a, a + num);
for(int i=1; i<num-1;i++)
{
ans += a[i];
}
cout << ans / (num - 2) << endl;
}
else
{
return 0;
}
}
} | 1 | 35,351,662 |
#include <iostream>
#include<bits/stdc++.h>
using namespace std;
long long div1[10000001];
int main()
{
for( int i =2;i<10000001;i++){
for(int j = i;j<10000001;j+=i){
div1[j]++ ;
}
}
int n ;
cin>>n;
long long sum =0 ;
... | #include<bits/stdc++.h>
#define ll long long
using namespace std;
int arr[10000001];
int main()
{
ll n;
cin>>n;
for(ll i=1;i<=n;i++){
for(ll j=i;j<=n;j+=i) arr[j]++;
}
ll sum=0;
for(ll i=1;i<=n;i++) sum+=i*arr[i];
cout<<sum<<endl;
return 0;
} | 1 | 1,452,711 |
#include <bits/stdc++.h>
using namespace std;
using vi=vector<int>;
using vvi=vector<vi>;
using vs=vector<string>;
using msi=map<string,int>;
using mii=map<int,int>;
using pii=pair<int,int>;
using vlai=valarray<int>;
using ll=long long;
#define rep(i,n) for(int i=0;i<n;i++)
#define range(i,s,n) for(int i=s;i<n;i++)
#de... | #include<bits/stdc++.h>
using namespace std;
map<pair<int,int>,int>a;
long long h,w,n,sum,ans[1000003],ans1[13];
int a1,b1;
int main()
{
cin>>h>>w>>n;
for(int k=1; k<=n; k++)
{
scanf("%d%d",&a1,&b1);
for(int i=max(3,a1); i<=a1+2; i++)
for(int j=max(b1,3); j<=b1+2; j++)
if(i<=h&&j<=w)
{
if(a[make_... | 1 | 13,458,479 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> P;
typedef pair<int,int> Pi;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define fi first
#define se second
#define endl "\n"
template<typename T> inline bool c... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define all(a) a.begin(), a.end()
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<ll,int> pli;
typedef pair<int,int> pii;
#define rep(i,a,b) for(ll i=a ; i<b ; i++)
#define qrep(que, ite)... | 1 | 80,561,143 |
#include <iostream>
#include <algorithm>
using namespace std;
int m, nMin, nMax;
int p[200];
int main() {
while (cin >> m >> nMin >> nMax) {
if (!m) break;
for (int i = 0; i < m; i++) {
cin >> p[i];
}
int gap = -1, ans = -1;
for (int i = nMax; i >= nMin; i--) {
if (gap < p[i-1] - p[i]) {
gap = p[i-... | #include<iostream>
using namespace std;
int main(){
int m,n1,n2;
cin >> m >> n1 >> n2;
while(m||n1||n2){
int g=n1-1;
int i,j,k;
int d[300]={};
for(i=0;i<m;i++) cin >> d[i];
for(i=n1-1;i<n2;i++) {
if(d[i]-d[i+1]>=d[g]-d[g+1]) g=i;
}
cout << g+1 << endl;
cin >> m >> n1 >> n2;
... | 1 | 68,475,820 |
#include <bits/stdc++.h>
#include <limits>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
#define fi(i,n) for( ll i=0 ; i<n ; i++ )
#define f(i, a, b) for( ll i=a ; i<b ; i++ )
#define vi vector<int>
#define pb push_back
#define MOD 1000000007
ll gcd(ll a, ll b)
{
if (b == 0)
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
typedef long long ll;
#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 INF 1000000000
#define PB ... | 1 | 28,748,539 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.