buggy_code stringlengths 11 625k | fixed_code stringlengths 17 625k | bug_type stringlengths 2 4.45k | language int64 0 8 | token_count int64 5 200k |
|---|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll a, b;
cin >> a >> b;
if ((a < 0 && 0 < b) || a == 0 || b == 0)
cout << "Zero" << endl;
else if ((b - a + 1 % 2 == 0 && b < 0) || a > 0)
cout << "Positive" << endl;
else
cout << "Negative" << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll a, b;
cin >> a >> b;
if ((a < 0 && 0 < b) || a == 0 || b == 0)
cout << "Zero" << endl;
else if ((a % 2 != b % 2 && b < 0) || a > 0)
cout << "Positive" << endl;
else
cout << "Negative" << endl;
} | [["-", 0, 16, 31, 16, 31, 16, 31, 16, 31, 22], ["-", 0, 16, 31, 16, 31, 16, 31, 16, 17, 33], ["-", 31, 23, 0, 16, 31, 16, 31, 16, 17, 72], ["-", 0, 16, 31, 16, 31, 16, 12, 16, 31, 13], ["-", 51, 16, 31, 23, 0, 16, 31, 16, 17, 60], ["-", 51, 16, 31, 23, 0, 16, 31, 16, 12, 13], ["+", 51, 16, 31, 23, 0, 16, 31, 16, 17, 79... | 1 | 97 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
#define INF ((1 << 30) - 1)
#define LINF (1LL << 60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
#define INF ((1 << 30) - 1)
#define LINF (1LL << 60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
... | [["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 49, 22], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 43, 49, 50, 51, 16, 31, 16, 31, 22], ["+", 0, 43, 49, 50, 51, 16, 31, 16, 17, 33], ["+", 0, 43, 49, 50, 51, 16, 31, 16, 12, 22], ["+", 8, 9, 0, 43, 49, 50, 51, 16, 17, 72], ["+", 8, 9... | 1 | 121 |
a,b = map(int, input().split())
if a > 0 and b > 0: ans = "Positive"
elif a < 0 and b < 0:
if (b-a+1)%2 != 0: ans = "Negative"
else: ans = "Positive"
else: ans = "zero"
print(ans) | a, b = map(int, input().split())
if a > 0 and b > 0: ans = "Positive"
elif a < 0 and b < 0:
if (abs(a-b) + 1) % 2 == 0:
ans = "Positive"
else:
ans = "Negative"
else:
ans = "Zero"
print(ans) | [["-", 0, 657, 31, 23, 0, 657, 31, 657, 31, 22], ["-", 0, 657, 31, 23, 0, 657, 31, 657, 17, 33], ["+", 0, 657, 31, 23, 0, 657, 31, 652, 63, 22], ["+", 31, 23, 0, 657, 31, 652, 3, 4, 0, 24], ["+", 0, 657, 31, 652, 3, 4, 0, 657, 17, 33], ["+", 0, 657, 31, 652, 3, 4, 0, 657, 12, 22], ["+", 31, 23, 0, 657, 31, 652, 3, 4, 0... | 5 | 75 |
a,b =map(int, input().split())
if b < 0:
if (b - a)%2 == 0:
print('Positive')
else:
print('Negative')
elif b >= 0 and a <= 0:
print('Zero')
else:
print('Positive')
| a, b = map(int, input().split())
if b < 0:
if (b-a+1)%2 == 0:
print('Positive')
else:
print('Negative')
elif a <= 0 and 0 <= b:
print('Zero')
else:
print('Positive')
| [["+", 15, 666, 0, 657, 31, 23, 0, 657, 17, 72], ["+", 15, 666, 0, 657, 31, 23, 0, 657, 12, 612], ["-", 0, 57, 75, 665, 15, 679, 31, 666, 0, 22], ["-", 0, 57, 75, 665, 15, 679, 31, 666, 667, 20], ["-", 0, 57, 75, 665, 15, 679, 31, 666, 0, 612], ["-", 0, 656, 0, 57, 75, 665, 15, 679, 17, 355], ["+", 0, 57, 75, 665, 15, ... | 5 | 69 |
a, b = [int(x) for x in input().strip().split()]
if a <= 0 and 0 <= b:
print('Zero')
elif a > 0:
print('Positive')
else:
if a == b:
print('Negative')
elif (b - a) % 2:
print('Negative')
else:
print('Positive') | a, b = [int(x) for x in input().strip().split()]
if a <= 0 and 0 <= b:
print('Zero')
elif a > 0:
print('Positive')
else:
if (b - a) % 2:
print('Positive')
else:
print('Negative') | [["-", 75, 76, 8, 196, 0, 57, 15, 666, 0, 22], ["-", 75, 76, 8, 196, 0, 57, 15, 666, 667, 60], ["-", 0, 57, 75, 76, 8, 196, 0, 57, 0, 102], ["-", 0, 57, 64, 196, 0, 1, 0, 652, 63, 22], ["-", 0, 1, 0, 652, 3, 4, 0, 557, 0, 654], ["-", 0, 1, 0, 652, 3, 4, 0, 557, 0, 6], ["-", 0, 1, 0, 652, 3, 4, 0, 557, 0, 655], ["-", 64... | 5 | 86 |
a,b=map(int,input().split())
if a<=0 and b>=0:
print('Zero')
elif a>0:
print('Positive')
else:
if (b-a)%2==0:
print('Negative')
else:
print('Pisitive') | a,b=map(int,input().split())
if a<=0 and b>=0:
print('Zero')
elif a>0:
print('Positive')
else:
if a==b:
print('Positive')
elif (b-a)%2==0:
print('Negative')
else:
print('Positive')
| [["+", 75, 76, 8, 196, 0, 57, 15, 666, 0, 22], ["+", 75, 76, 8, 196, 0, 57, 15, 666, 667, 60], ["+", 0, 57, 75, 76, 8, 196, 0, 57, 0, 102], ["+", 0, 57, 64, 196, 0, 1, 0, 652, 63, 22], ["+", 0, 1, 0, 652, 3, 4, 0, 557, 0, 654], ["+", 0, 1, 0, 652, 3, 4, 0, 557, 0, 6], ["+", 0, 1, 0, 652, 3, 4, 0, 557, 0, 655], ["+", 64... | 5 | 69 |
#include <bits/stdc++.h>
using namespace std;
struct point {
double x;
double y;
};
int i, j, k, count1 = 0, count2 = 0;
int main(void) {
int a, b, n, ans;
cin >> a >> b;
if (a <= 0 && b >= 0)
ans = 0;
else if (a < 0 && b < 0)
n = abs(b - a) + 1;
else
n = 0;
if (ans == 0)
cout << "Zero"... | #include <bits/stdc++.h>
using namespace std;
struct point {
double x;
double y;
};
int i, j, k, count1 = 0, count2 = 0;
int main(void) {
int a, b, n, d = 0;
cin >> a >> b;
if (a <= 0 && b >= 0)
d = 1;
else if (a < 0 && b < 0)
n = b - a + 1;
else
n = 0;
if (d)
cout << "Zero" << endl;
... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 49, 22], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 8, 9, 0, 57, 64, 1, 0, 11, 31, 22], ["+", 8, 9, 0, 57, 64, 1, 0, 11, 31, 22], ["-", 8, 9, 0, 57, 64, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 57, 64, ... | 1 | 137 |
#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 a, b;
cin >> a >> b;
if (a <= 0 && b >= 0)
cout << "Zero" << endl;
else if (a >= 1)
cout << "Positive" << endl;
else if (-a % 2 == 0)
cout... | #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 a, b;
cin >> a >> b;
if (a <= 0 && b >= 0)
cout << "Zero" << endl;
else if (a > 0)
cout << "Positive" << endl;
else if ((b - a + 1) % 2 == 0)
... | [["-", 75, 76, 0, 57, 15, 339, 51, 16, 17, 20], ["-", 75, 76, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 75, 76, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 75, 76, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 15, 339, 51, 16, 31, 16, 31, 23, 0, 24], ["+", 31, 16, 31, 23, 0, 16, 31, 16, 31, 22], ["+", 51, 16, 31, 16, 31, 23, 0, 16, 1... | 1 | 107 |
a, b = map(int, input().split())
if a <= 0 and b >= 0:
print('Zero')
elif a < 0 and a%2 != 0:
print('Negative')
else:
print('Positive')
| a, b = map(int, input().split())
if a <= 0 and b >= 0:
print('Zero')
elif a < 0 and b < 0 and (b-a)%2 == 0:
print('Negative')
else:
print('Positive')
| [["+", 75, 665, 15, 679, 31, 679, 12, 666, 0, 22], ["+", 75, 665, 15, 679, 31, 679, 12, 666, 667, 18], ["+", 75, 665, 15, 679, 31, 679, 12, 666, 0, 612], ["+", 0, 656, 0, 57, 75, 665, 15, 679, 17, 355], ["+", 15, 679, 12, 666, 0, 657, 31, 23, 0, 24], ["+", 12, 666, 0, 657, 31, 23, 0, 657, 31, 22], ["+", 12, 666, 0, 657... | 5 | 56 |
# For taking integer inputs.
def inp():
return(int(input()))
# For taking List inputs.
def inlist():
return(list(map(int, input().split())))
# For taking string inputs. Actually it returns a List of Characters, instead of a string, which is easier to use in Python, because in Python, Strings are Immutable.
... | # For taking integer inputs.
def inp():
return(int(input()))
# For taking List inputs.
def inlist():
return(list(map(int, input().split())))
# For taking string inputs. Actually it returns a List of Characters, instead of a string, which is easier to use in Python, because in Python, Strings are Immutable.
... | [["-", 0, 656, 0, 57, 15, 679, 31, 666, 0, 22], ["-", 0, 656, 0, 57, 15, 679, 31, 666, 667, 47], ["+", 0, 656, 0, 57, 15, 679, 31, 666, 667, 18], ["+", 0, 656, 0, 57, 15, 679, 31, 666, 0, 22], ["+", 0, 656, 0, 57, 15, 679, 12, 666, 0, 22], ["+", 0, 656, 0, 57, 15, 679, 12, 666, 667, 19], ["-", 0, 656, 0, 57, 15, 679, 1... | 5 | 183 |
#include <bits/stdc++.h>
#define repd(i, a, b) for (ll i = (a); i < (b); i++)
#define repb(i, n) for (ll i = (n)-1; i >= 0; i--)
#define rep(i, n) repd(i, 0, n)
using namespace std;
using ll = long long;
using ul = unsigned long long;
ll mod = 1000000007;
int main() {
source:
ll a, b;
cin >> a >> b;
if (a <= ... | #include <bits/stdc++.h>
#define repd(i, a, b) for (ll i = (a); i < (b); i++)
#define repb(i, n) for (ll i = (n)-1; i >= 0; i--)
#define rep(i, n) repd(i, 0, n)
using namespace std;
using ll = long long;
using ul = unsigned long long;
ll mod = 1000000007;
int main() {
source:
ll a, b;
cin >> a >> b;
if (a <= ... | [["+", 8, 9, 0, 57, 75, 76, 0, 57, 0, 121], ["+", 0, 57, 75, 76, 0, 57, 15, 339, 0, 24], ["+", 75, 76, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 75, 76, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 75, 76, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 0, 57, 75, 76, 0, 57, 15, 339, 0, 25], ["+", 0, 57, 75, 76, 0, 57, 64, 9, 0, 46], ["... | 1 | 136 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define irep(i, n) for (int i = n - 1; i >= (int)0; i--)
#define reprep(i, j, h, w) rep(i, h) rep(j, w)
#define rrep(i, m, n) for (int i = m; i < (int)(n); i++)
#define all(x) (x).begin(... | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define irep(i, n) for (int i = n - 1; i >= (int)0; i--)
#define reprep(i, j, h, w) rep(i, h) rep(j, w)
#define rrep(i, m, n) for (int i = m; i < (int)(n); i++)
#define all(x) (x).begin(... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 78], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["-", 49, 50, 51, 16, 31, 2, 3, 4, 0, 13], ["+", 49, 50... | 1 | 298 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repe(i, n) for (int i = 0; i <= (n); ++i)
#define repe1(i, n) for (int i = 0; i <= (n); ++i)
#define all(x) (x).begin(), (x).end()
#define pb(x) push_back(x)
#define eb(k, v) emplace_back... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repe(i, n) for (int i = 0; i <= (n); ++i)
#define repe1(i, n) for (int i = 0; i <= (n); ++i)
#define all(x) (x).begin(), (x).end()
#define pb(x) push_back(x)
#define eb(k, v) emplace_back... | [["+", 15, 339, 51, 16, 31, 16, 31, 16, 31, 22], ["+", 15, 339, 51, 16, 31, 16, 31, 16, 17, 60], ["+", 15, 339, 51, 16, 31, 16, 31, 16, 12, 22], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 98], ["+", 15, 339, 51, 16, 31, 16, 12, 16, 31, 22], ["+", 15, 339, 51, 16, 31, 16, 12, 16, 17, 18], ["+", 15, 339, 51, 16, 31, 16, 1... | 1 | 278 |
a, b = map(int, input().split())
if a*b<0:
print("Zero")
elif (a-b) % 2 == 0:
print("Negative")
else:
print("Positive") | a, b = map(int, input().split())
if a*b<0:
print("Zero")
elif a<0 and b<0 and (a-b) % 2 == 0:
print("Negative")
else:
print("Positive") | [["+", 75, 665, 15, 679, 31, 679, 31, 666, 0, 22], ["+", 75, 665, 15, 679, 31, 679, 31, 666, 667, 18], ["+", 75, 665, 15, 679, 31, 679, 31, 666, 0, 612], ["+", 0, 57, 75, 665, 15, 679, 31, 679, 17, 355], ["+", 75, 665, 15, 679, 31, 679, 12, 666, 0, 22], ["+", 75, 665, 15, 679, 31, 679, 12, 666, 667, 18], ["+", 75, 665,... | 5 | 54 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef pair<ll, ll> pll;
typedef long double ld;
const ll mod = (ll)1e9 + 7;
const ll mx... | #include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef pair<ll, ll> pll;
typedef long double ld;
const ll mod = (ll)1e9 + 7;
const ll mx... | [["-", 8, 9, 0, 57, 64, 1, 0, 2, 63, 22], ["-", 0, 57, 64, 1, 0, 2, 3, 4, 0, 24], ["+", 8, 9, 0, 57, 64, 1, 0, 16, 31, 22], ["+", 8, 9, 0, 57, 64, 1, 0, 16, 17, 151], ["-", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 57, 64, 1, 0, 16, 12, 5, 0, 6], ["+", 0, 57, 64, 1, 0, 16, 12, 5, 0, 44], ["-", 0, 57, 64, 1, 0, 2, 3, 4, ... | 1 | 183 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(x) (x).begin(), (x).end()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(x) (x).begin(), (x).end()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> i... | [["-", 0, 57, 15, 339, 51, 16, 31, 16, 17, 48], ["-", 0, 57, 15, 339, 51, 16, 31, 16, 12, 22], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 19], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 22], ["+", 64, 9, 0, 57, 15, 339, 51, 16, 31... | 1 | 226 |
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(obj) (obj).begin(), (obj).end()
#define debug(var) \
do { \
... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(obj) (obj).begin(), (obj).end()
#define debug(var) \
do { \
... | [["+", 0, 14, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 57, 64, 9, 0, 37, 0, 38], ["+", 0, 14, 8, 9, 0, 57, 64, 9, 0, 46], ["+", 8, 9, 0, 57, 64, 9, 0, 37, 0, 35]] | 1 | 312 |
#include <iostream>
using namespace std;
int main() {
int a, b, c = 1;
cin >> a >> b;
for (int i = a; i <= b; i++) {
if (i < 0)
c = c * -1;
if (i == 0)
cout << "Zero" << endl;
}
if (c > 0)
cout << "Positive" << endl;
if (c < 0)
cout << "Negative" << endl;
if (c == 0)
cout <... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, s = 1;
cin >> a >> b;
for (int i = a; i <= b; i++) {
if (i < 0)
s *= -1;
if (i == 0) {
cout << "Zero" << endl;
return 0;
}
}
if (s > 0)
cout << "Positive" << endl;
if (s < 0)
cout << "Negative" << endl... | [["-", 36, 36, 36, 36, 0, 30, 0, 135, 136, 137], ["+", 36, 36, 36, 36, 0, 30, 0, 135, 136, 137], ["-", 0, 14, 8, 9, 0, 43, 49, 50, 49, 22], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 49, 22], ["-", 8, 9, 0, 57, 64, 1, 0, 11, 31, 22], ["-", 8, 9, 0, 57, 64, 1, 0, 11, 17, 32], ["-", 0, 57, 64, 1, 0, 11, 12, 16, 31, 22], ["-", 0, ... | 1 | 114 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > 0)
cout << "Positive" << endl;
else if (a == 0 || (a < 0 && b > 0))
cout << "Zero" << endl;
else if (abs(b) - abs(a) % 2 != 0)
cout << "Positive" << endl;
else
cout << "Negative" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > 0)
cout << "Positive";
else if (a == 0 || (a < 0 && b > 0))
cout << "Zero";
else if ((abs(b) - abs(a)) % 2 != 0)
cout << "Positive";
else
cout << "Negative";
return 0;
} | [["-", 8, 9, 0, 57, 64, 1, 0, 16, 17, 151], ["-", 8, 9, 0, 57, 64, 1, 0, 16, 12, 22], ["-", 75, 76, 0, 57, 64, 1, 0, 16, 17, 151], ["-", 75, 76, 0, 57, 64, 1, 0, 16, 12, 22], ["+", 0, 57, 75, 76, 0, 57, 15, 339, 0, 24], ["+", 31, 23, 0, 16, 12, 2, 3, 4, 0, 25], ["-", 0, 57, 75, 76, 0, 1, 0, 16, 17, 151], ["-", 0, 57, 7... | 1 | 96 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > 0)
cout << "Positive" << endl;
else if (a == 0 || (a < 0 && b > 0))
cout << "Zero" << endl;
else if (abs(b) - abs(a) % 2 != 0)
cout << "Positive" << endl;
else
cout << "Negative" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b;
cin >> a >> b;
if (a > 0)
cout << "Positive" << endl;
else if (a == 0 || (a < 0 && b > 0))
cout << "Zero" << endl;
else if ((abs(b) - abs(a)) % 2 != 0)
cout << "Positive" << endl;
else
cout << "Negative" << endl;
re... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["+", 0, 57, 75, 76, 0, 57, 15, 339, 0, 24], ["+", 31, 23, 0, 16, 12, 2, 3, 4, 0, 25], ["+", 75, 76, 0, 57, 75, 76, 0, 1, 0, 35], ["+", 0, 30, 0, 14, 8, 9, 0, 37, 0, 38], ["+", 0, 30, 0, 14, 8, 9, 0, 37, 0, 13]] | 1 | 96 |
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > 0)
cout << "Positive";
else if (b >= 0)
cout << "Zero";
else if (pow(a & 1, b & 1))
cout << "Positive";
else
cout << "Negative";
return 0;
} | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > 0) {
cout << "Positive";
} else if (b >= 0) {
cout << "Zero";
} else if ((a & 1) ^ (b & 1)) {
cout << "Positive";
} else {
cout << "Negative";
}
return 0;
} | [["-", 36, 36, 36, 36, 0, 30, 0, 135, 136, 137], ["-", 36, 36, 36, 36, 0, 30, 0, 135, 0, 138], ["+", 0, 14, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 0, 14, 8, 9, 0, 57, 64, 9, 0, 46], ["+", 0, 57, 75, 76, 0, 57, 64, 9, 0, 45], ["+", 0, 57, 75, 76, 0, 57, 64, 9, 0, 46], ["-", 75, 76, 0, 57, 15, 339, 51, 2, 63, 22], ["-", 0, 57... | 1 | 82 |
#include <iostream>
using namespace std;
int main() {
long long a, b;
cin >> a >> b;
if (a > 0 && b > 0)
cout << "Positive";
if ((max(a, b) >= 0 && min(a, b) <= 0) || a == 0 || b == 0)
cout << "Zero";
if (a < 0 && b < 0) {
if (b - a + 1 % 2 == 0)
cout << "Positive";
else
cout << "N... | #include <iostream>
using namespace std;
int main() {
long long a, b;
cin >> a >> b;
if (a > 0 && b > 0)
cout << "Positive";
if ((a < 0 && b > 0) || a == 0 || b == 0)
cout << "Zero";
if (a < 0 && b < 0) {
if ((b - a + 1) % 2 == 0)
cout << "Positive";
else
cout << "Negative";
}
... | [["-", 31, 23, 0, 16, 31, 16, 31, 2, 63, 22], ["-", 0, 16, 31, 16, 31, 2, 3, 4, 0, 24], ["-", 0, 16, 31, 16, 31, 2, 3, 4, 0, 21], ["-", 0, 16, 31, 16, 31, 2, 3, 4, 0, 22], ["-", 0, 16, 31, 16, 31, 2, 3, 4, 0, 25], ["-", 31, 16, 31, 23, 0, 16, 31, 16, 17, 20], ["+", 31, 16, 31, 23, 0, 16, 31, 16, 17, 18], ["-", 31, 23, ... | 1 | 116 |
#include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > 0 && b > 0) {
cout << "Positive"
<< "\n";
return 0;
} else if ((a >= 0 && b <= 0) || (a <= 0 && b >= 0)) {
cout << "Zero"
<< "\n";
return 0;
} else {
if (-1 * b - -1 * a % 2 == 0) {
... | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > 0 && b > 0) {
cout << "Positive"
<< "\n";
return 0;
} else if ((a >= 0 && b <= 0) || (a <= 0 && b >= 0)) {
cout << "Zero"
<< "\n";
return 0;
} else {
if ((b - a) % 2 == 0) {
cout... | [["-", 15, 339, 51, 16, 31, 16, 31, 16, 31, 13], ["-", 15, 339, 51, 16, 31, 16, 31, 16, 17, 48], ["+", 15, 339, 51, 16, 31, 16, 31, 23, 0, 24], ["-", 51, 16, 31, 16, 12, 16, 31, 16, 31, 13], ["-", 51, 16, 31, 16, 12, 16, 31, 16, 17, 48], ["+", 15, 339, 51, 16, 31, 16, 31, 23, 0, 25]] | 1 | 134 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) ... | [["+", 31, 16, 31, 23, 0, 16, 31, 23, 0, 24], ["+", 31, 16, 31, 23, 0, 16, 31, 23, 0, 13], ["+", 31, 16, 31, 23, 0, 16, 31, 23, 0, 25], ["+", 51, 16, 31, 16, 31, 23, 0, 16, 17, 48], ["+", 31, 16, 31, 23, 0, 16, 12, 23, 0, 24], ["+", 31, 16, 31, 23, 0, 16, 12, 23, 0, 25]] | 1 | 225 |
#include <stdio.h>
typedef long long ll;
int main() {
ll a, b;
scanf("%d %d", &a, &b);
if (a > 0)
printf("Positive\n");
else if ((a < 0 && b > 0) || a == 0 || b == 0)
printf("Zero\n");
else if ((b - a) & 1)
printf("Negative\n");
else
printf("Positive\n");
return 0;
} | #include <stdio.h>
typedef long long ll;
int main() {
ll a, b;
scanf("%lld %lld", &a, &b);
if (a > 0)
printf("Positive\n");
else if (a == 0 || b == 0 || a <= 0 && b >= 0)
printf("Zero\n");
else if ((b - a) & 1)
printf("Positive\n");
else
printf("Negative\n");
return 0;
} | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["-", 15, 23, 0, 16, 31, 16, 31, 23, 0, 24], ["-", 31, 16, 31, 23, 0, 16, 31, 16, 17, 18], ["+", 15, 23, 0, 16, 31, 16, 31, 16, 17, 60], ["-", 0, 16, 31, 16, 31, 23, 0, 16, 17, 98], ["+", 0, 57, 15, 23, 0, 16, 31, 16, 17, 106], ["-", 31, 16, 31,... | 0 | 105 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a <= 0 && 0 <= b) {
cout << "Zero" << endl;
}
int x = 0;
for (int i = a; i <= b; i++) {
if (i < 0) {
x++;
}
}
if (x % 2 == 0) {
cout << "Positive" << endl;
} else {
cout << "Negative" << ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b;
cin >> a >> b;
if (a <= 0 && 0 <= b) {
cout << "Zero" << endl;
return 0;
}
long long x = 0;
for (long long i = a; i <= b; i++) {
if (i < 0) {
x++;
}
}
if (x % 2 == 0) {
cout << "Positive" << endl;
} e... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 57, 64, 9, 0, 37, 0, 38], ["+", 8, 9, 0, 57, 64, 9, 0, 37, 0, 13], ["-", 0, 14, 8, 9, 0, 7, 10, 43, 39, 40], ["+", 8, 9, 0, 7, 10, 43, 39, 86, 0, 96]] | 1 | 104 |
#include <algorithm>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <queue>
#include <set>
#include <vector>
//#include <bits/stdc++.h>
template <typename T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename... | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <queue>
#include <set>
#include <vector>
//#include <bits/stdc++.h>
template <typename T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename... | [["+", 8, 9, 0, 57, 64, 9, 0, 57, 0, 121], ["+", 0, 57, 64, 9, 0, 57, 15, 339, 0, 24], ["+", 15, 339, 51, 16, 31, 16, 31, 23, 0, 24], ["+", 31, 16, 31, 23, 0, 16, 31, 16, 31, 22], ["+", 31, 16, 31, 23, 0, 16, 31, 16, 17, 33], ["+", 31, 16, 31, 23, 0, 16, 31, 16, 12, 22], ["+", 51, 16, 31, 16, 31, 23, 0, 16, 17, 72], ["... | 1 | 232 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > 0) {
cout << "Positive" << endl;
} else if (a * b < 0) {
cout << "Zero" << endl;
} else {
if ((b - a) % 2 == 0) {
cout << "Negative" << endl;
} else {
cout << "Positive" << endl;
}
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int a, b;
cin >> a >> b;
if (a > 0) {
cout << "Positive" << endl;
} else if (a * b < 0) {
cout << "Zero" << endl;
} else if (b < 0) {
if ((b - a) % 2 == 0) {
cout << "Negative" << endl;
} else {
cout << "Positive... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["+", 75, 76, 0, 57, 75, 76, 0, 57, 0, 121], ["+", 0, 57, 75, 76, 0, 57, 15, 339, 0, 24], ["+", 75, 76, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 75, 76, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 75, 76, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 0, 57, 75, 76, 0, 57, 15, 339, 0, 25]] | 1 | 97 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b;
cin >> a >> b;
if (a > 0)
cout << "Positive";
else if (b >= 0)
cout << "Zero";
else if ((a & 1) ^ (b % 1))
cout << "Positive";
else
cout << "Negative";
return 0;
}
//>Positive
//<Negative
// Zero | #include <bits/stdc++.h>
using namespace std;
long long a, b;
int main() {
cin >> a >> b;
if (a > 0)
cout << "Positive";
else if (b >= 0)
cout << "Zero";
else if ((a & 1) ^ (b & 1))
cout << "Positive";
else
cout << "Negative";
return 0;
} | [["-", 36, 36, 36, 36, 0, 30, 0, 14, 39, 40], ["-", 36, 36, 0, 30, 0, 14, 49, 53, 49, 22], ["-", 0, 30, 0, 14, 49, 53, 54, 55, 0, 24], ["-", 0, 30, 0, 14, 49, 53, 54, 55, 0, 25], ["-", 36, 36, 0, 30, 0, 14, 8, 9, 0, 45], ["+", 36, 36, 36, 36, 0, 30, 0, 14, 39, 40], ["+", 36, 36, 0, 30, 0, 14, 49, 53, 49, 22], ["+", 0, ... | 1 | 83 |
#include "bits/stdc++.h"
using namespace std;
int a, b;
int main() {
cin >> a >> b;
if (a > 0)
cout << "Positive";
else if (a == 0 || (a < 0 && b > 0))
cout << "Zero";
else if ((abs(b) - abs(a)) % 2 == 0)
cout << "Positive";
else
cout << "Negative";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int a, b;
int main() {
cin >> a >> b;
if (a > 0)
cout << "Positive";
else if (a == 0 || (a < 0) && (b > 0))
cout << "Zero";
else if ((abs(b) - abs(a)) % 2)
cout << "Positive";
else
cout << "Negative";
return cout << endl && 0;
} | [["-", 36, 36, 0, 30, 0, 135, 136, 5, 0, 62], ["-", 36, 36, 0, 30, 0, 135, 136, 5, 0, 6], ["+", 36, 36, 36, 36, 0, 30, 0, 135, 136, 137], ["+", 15, 339, 51, 16, 12, 16, 31, 23, 0, 25], ["+", 15, 339, 51, 16, 12, 16, 12, 23, 0, 24], ["-", 75, 76, 0, 57, 15, 339, 51, 16, 17, 60], ["-", 75, 76, 0, 57, 15, 339, 51, 16, 12,... | 1 | 95 |
#include "bits/stdc++.h"
using namespace std;
int a, b;
int main() {
cin >> a >> b;
if (a > 0)
cout << "Positive";
else if (a == 0 || (a < 0 && b > 0))
cout << "Zero";
else if ((abs(b) - abs(a)) % 2 == 0)
cout << "Positive";
else
cout << "Negative";
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int a, b;
int main() {
cin >> a >> b;
if (a > 0)
cout << "Positive";
else if (a == 0 || (a < 0 && b > 0))
cout << "Zero" << endl;
else if ((abs(b) - abs(a)) % 2 != 0)
cout << "Positive" << endl;
else
cout << "Negative" << endl;
... | [["-", 36, 36, 0, 30, 0, 135, 136, 5, 0, 62], ["-", 36, 36, 0, 30, 0, 135, 136, 5, 0, 6], ["+", 36, 36, 36, 36, 0, 30, 0, 135, 136, 137], ["+", 36, 36, 36, 36, 0, 30, 0, 135, 0, 138], ["+", 75, 76, 0, 57, 64, 1, 0, 16, 17, 151], ["+", 75, 76, 0, 57, 64, 1, 0, 16, 12, 22], ["-", 75, 76, 0, 57, 15, 339, 51, 16, 17, 60], ... | 1 | 95 |
#include "bits/stdc++.h"
using namespace std;
int a, b;
int main() {
cin >> a >> b;
if (a > 0)
cout << "Positive";
else if (a == 0 || (a < 0 && b > 0))
cout << "Zero";
else if ((abs(b) - abs(a)) % 2 == 0)
cout << "Positive";
else
cout << "Negative";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > 0)
cout << "Positive";
else if (a == 0 || (a < 0 && b > 0))
cout << "Zero";
else if ((abs(b) - abs(a)) % 2 != 0)
cout << "Positive";
else
cout << "Negative";
return 0;
} | [["-", 36, 36, 0, 30, 0, 135, 136, 5, 0, 62], ["-", 36, 36, 0, 30, 0, 135, 136, 5, 0, 6], ["+", 36, 36, 36, 36, 0, 30, 0, 135, 136, 137], ["-", 36, 36, 36, 36, 0, 30, 0, 340, 0, 35], ["-", 36, 36, 36, 36, 0, 30, 0, 43, 39, 40], ["-", 36, 36, 36, 36, 0, 30, 0, 43, 49, 22], ["-", 36, 36, 36, 36, 0, 30, 0, 43, 0, 21], ["+... | 1 | 95 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#define int long long
using namespace std;
inline int read() {
int f = 1, ans = 0;
char c;
while (c < '0' || c > '9') {
if (c == '-')
f = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
ans = a... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#define int long long
using namespace std;
inline int read() {
int f = 1, ans = 0;
char c;
while (c < '0' || c > '9') {
if (c == '-')
f = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
ans = a... | [["-", 15, 339, 51, 16, 31, 16, 31, 16, 17, 19], ["-", 15, 339, 51, 16, 31, 16, 31, 16, 12, 22], ["-", 0, 57, 15, 339, 51, 16, 31, 16, 17, 98], ["-", 15, 339, 51, 16, 31, 16, 12, 16, 31, 22], ["-", 15, 339, 51, 16, 31, 16, 12, 16, 17, 19], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 18], ["-", 0, 57, 15, 339, 51, 16, 12,... | 1 | 250 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b;
cin >> a >> b;
if (a > 0)
cout << "Positive";
else if (b >= 0)
cout << "Zero";
else if ((a & 1) ^ (b % 1))
cout << "Positive";
else
cout << "Negative";
return 0;
}
//>Positive
//<Negative
// Zero | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > 0)
cout << "Positive" << endl;
else if (b >= 0)
cout << "Zero" << endl;
else if ((a & 1) ^ (b & 1))
cout << "Positive" << endl;
else
cout << "Negative" << endl;
return 0;
}
| [["-", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 8, 9, 0, 57, 64, 1, 0, 16, 17, 151], ["+", 8, 9, 0, 57, 64, 1, 0, 16, 12, 22], ["+", 75, 76, 0, 57, 64, 1, 0, 16, 17, 151], ["+", 75, 76, 0, 57, 64, 1, 0, 16, 12, 22], ["-", 15, 339, 51, 16, 12, 23, 0, 16, 17, 109], ["+", 15, 339... | 1 | 83 |
#include <bits/stdc++.h>
using namespace std;
long long a, b;
int main() {
cin >> a >> b;
if (a > 0 && b > 0)
cout << "Positive" << endl;
if (max(a, b) >= 0 && min(a, b) <= 0 || a == 0 || b == 0)
cout << "Zero" << endl;
else if ((abs(min(a, b)) - abs(max(a, b))) % 2 == 0)
cout << "Negative" << endl;... | #include "bits/stdc++.h"
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > 0 && b > 0)
cout << "Positive" << endl;
else if (max(a, b) >= 0 && min(a, b) <= 0 || a == 0 || b == 0)
cout << "Zero" << endl;
else if ((abs(min(a, b)) - abs(max(a, b))) % 2 == 0)
cout << "Negative" << endl... | [["-", 36, 36, 36, 36, 0, 30, 0, 135, 136, 137], ["+", 36, 36, 0, 30, 0, 135, 136, 5, 0, 62], ["+", 36, 36, 0, 30, 0, 135, 136, 5, 0, 6], ["-", 36, 36, 36, 36, 0, 30, 0, 340, 0, 35], ["-", 36, 36, 0, 30, 0, 43, 39, 86, 0, 96], ["-", 36, 36, 36, 36, 0, 30, 0, 43, 49, 22], ["-", 36, 36, 36, 36, 0, 30, 0, 43, 0, 21], ["+"... | 1 | 127 |
#include <bits/stdc++.h>
using namespace std;
int a, b;
int main() {
cin >> a >> b;
if (a > 0)
cout << "Positive";
else if (a == 0 || (a < 0 && b > 0))
cout << "Zero";
else if ((abs(b) - abs(a)) % 2 == 1)
cout << "Positive";
else
cout << "Negative";
cout << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > 0)
cout << "Positive";
else if (a == 0 || (a < 0 && b > 0))
cout << "Zero";
else if ((abs(b) - abs(a)) % 2 != 0)
cout << "Positive";
else
cout << "Negative";
return 0;
} | [["-", 36, 36, 36, 36, 0, 30, 0, 43, 49, 22], ["-", 36, 36, 36, 36, 0, 30, 0, 43, 0, 21], ["-", 36, 36, 36, 36, 0, 30, 0, 43, 0, 35], ["-", 36, 36, 36, 36, 0, 30, 0, 14, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, ... | 1 | 97 |
#include <bits/stdc++.h>
using namespace std;
int a, b;
int main() {
cin >> a >> b;
if (a > 0)
cout << "Positive";
else if (a == 0 || (a < 0 && b > 0))
cout << "Zero";
else if ((abs(b) - abs(a)) % 2 == 1)
cout << "Positive";
else
cout << "Negative";
cout << endl;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
int a, b;
int main() {
cin >> a >> b;
if (a > 0)
cout << "Positive";
else if (a == 0 || (a < 0 && b > 0))
cout << "Zero";
else if ((abs(b) - abs(a)) % 2 != 0)
cout << "Positive";
else
cout << "Negative";
return 0;
} | [["-", 36, 36, 36, 36, 0, 30, 0, 135, 136, 137], ["+", 36, 36, 0, 30, 0, 135, 136, 5, 0, 62], ["+", 36, 36, 0, 30, 0, 135, 136, 5, 0, 6], ["-", 75, 76, 0, 57, 15, 339, 51, 16, 17, 60], ["-", 75, 76, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 75, 76, 0, 57, 15, 339, 51, 16, 17, 79], ["+", 75, 76, 0, 57, 15, 339, 51, 16, 12,... | 1 | 97 |
#include <bits/stdc++.h>
using namespace std;
int a, b;
int main() {
cin >> a >> b;
if (a > 0 && b > 0)
cout << "Positive" << endl;
if (max(a, b) >= 0 && min(a, b) <= 0 || a == 0 || b == 0)
cout << "Zero" << endl;
else if ((abs(min(a, b)) - abs(max(a, b))) % 2 == 0)
cout << "Negative" << endl;
els... | #include <bits/stdc++.h>
using namespace std;
int a, b;
int main() {
cin >> a >> b;
if (a > 0 && b > 0) {
cout << "Positive" << endl;
} else if (max(a, b) >= 0 && min(a, b) <= 0 || a == 0 || b == 0) {
cout << "Zero" << endl;
} else {
if ((abs(min(a, b)) - abs(max(a, b))) % 2 == 0) {
cout << "N... | [["+", 0, 14, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 0, 14, 8, 9, 0, 57, 64, 9, 0, 46], ["+", 0, 14, 8, 9, 0, 57, 75, 76, 0, 95], ["+", 0, 57, 75, 76, 0, 57, 64, 9, 0, 45], ["+", 0, 57, 75, 76, 0, 57, 64, 9, 0, 46], ["+", 75, 76, 0, 57, 75, 76, 0, 9, 0, 45], ["+", 75, 76, 0, 9, 0, 57, 64, 9, 0, 45], ["+", 75, 76, 0, 9, 0, 5... | 1 | 126 |
#include <bits/stdc++.h>
using namespace std;
int a, b;
int main() {
cin >> a >> b;
if (a > 0 && b > 0)
cout << "Positive" << endl;
if (max(a, b) >= 0 && min(a, b) <= 0 || a == 0 || b == 0)
cout << "Zero" << endl;
else if ((abs(min(a, b)) - abs(max(a, b))) % 2 == 0)
cout << "Negative" << endl;
els... | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > 0 && b > 0)
cout << "Positive" << endl;
else if (max(a, b) >= 0 && min(a, b) <= 0)
cout << "Zero" << endl;
else if ((abs(min(a, b)) - abs(max(a, b))) % 2 == 0)
cout << "Nega... | [["-", 36, 36, 36, 36, 0, 30, 0, 135, 136, 137], ["+", 36, 36, 36, 36, 0, 30, 0, 135, 136, 137], ["+", 36, 36, 36, 36, 0, 30, 0, 135, 0, 138], ["-", 36, 36, 36, 36, 0, 30, 0, 340, 0, 35], ["-", 36, 36, 36, 36, 0, 30, 0, 43, 39, 40], ["-", 36, 36, 36, 36, 0, 30, 0, 43, 49, 22], ["-", 36, 36, 36, 36, 0, 30, 0, 43, 0, 21]... | 1 | 126 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int main() {
ll a, b;
cin >> a >> b;
if (a > 0) {
cout << "Positive" << endl;
return 0;
} else if (a <= 0 && 0 <= b) {
cout << "Zero" << 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 pii = pair<int, int>;
int main() {
ll a, b;
cin >> a >> b;
if (a > 0) {
cout << "Positive" << endl;
return 0;
} else if (a <= 0 && 0 <= b) {
cout << "Zero" << endl;
return 0... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 78], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["-", 0, 30, 0, 14, 8, 9, 0, 7, 0, 88], ["-", 0, 30, 0, 14, 8, 9, 0, 7, 0, 24], ["-", 0, 14, 8, 9, 0, 7, 10, 43, 39, 78], ["-", 8, 9, 0, 7, 10, 43, 49, 50, 49, 22], ["-", 8, 9, 0, 7, 10, 43, 49,... | 1 | 140 |
// Ruthless Coding
#include <bits/stdc++.h>
#define uni(x) (x).resize(unique(all(x)) - (x).begin())
#define fprint(v) \
for (auto x : v) \
cout << x << ' '
#define ALL(x) (x).begin(), (x).end()
... | // Ruthless Coding
#include <bits/stdc++.h>
#define uni(x) (x).resize(unique(all(x)) - (x).begin())
#define fprint(v) \
for (auto x : v) \
cout << x << ' '
#define ALL(x) (x).begin(), (x).end()
... | [["+", 0, 57, 75, 76, 0, 9, 0, 43, 39, 40], ["+", 75, 76, 0, 9, 0, 43, 49, 50, 49, 22], ["+", 75, 76, 0, 9, 0, 43, 49, 50, 0, 32], ["+", 49, 50, 51, 16, 31, 16, 31, 2, 63, 22], ["+", 51, 16, 31, 16, 31, 2, 3, 4, 0, 24], ["+", 51, 16, 31, 16, 31, 2, 3, 4, 0, 22], ["+", 51, 16, 31, 16, 31, 2, 3, 4, 0, 25], ["+", 0, 43, 4... | 1 | 538 |
#include "bits/stdc++.h"
using namespace std;
int a, b;
int main() {
cin >> a >> b;
if (a > 0)
cout << "Postive";
else if (a == 0 || (a < 0 && b > 0))
cout << "Zero";
else if ((abs(b) - abs(a)) % 2 == 0)
cout << "Positive";
else
cout << "Negative";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
long long a, b;
int main() {
cin >> a >> b;
if (a > 0)
cout << "Positive";
else if (a == 0 || (a < 0 && b > 0))
cout << "Zero";
else if ((abs(b) - abs(a)) % 2 != 0)
cout << "Positive";
else
cout << "Negative";
cout << "\n";
return 0;
} | [["-", 36, 36, 0, 30, 0, 135, 136, 5, 0, 62], ["-", 36, 36, 0, 30, 0, 135, 136, 5, 0, 6], ["+", 36, 36, 36, 36, 0, 30, 0, 135, 136, 137], ["-", 36, 36, 36, 36, 0, 30, 0, 43, 39, 40], ["+", 36, 36, 0, 30, 0, 43, 39, 86, 0, 96], ["-", 0, 57, 64, 1, 0, 16, 12, 5, 0, 6], ["+", 0, 57, 64, 1, 0, 16, 12, 5, 0, 6], ["-", 75, 7... | 1 | 95 |
#include "bits/stdc++.h"
using namespace std;
int a, b;
int main() {
cin >> a >> b;
if (a > 0)
cout << "Postive";
else if (a == 0 || (a < 0 && b > 0))
cout << "Zero";
else if ((abs(b) - abs(a)) % 2 == 0)
cout << "Positive";
else
cout << "Negative";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int a, b;
int main() {
cin >> a >> b;
if (a > 0)
cout << "Positive";
else if (a == 0 || (a < 0 && b > 0))
cout << "Zero";
else if ((abs(b) - abs(a)) % 2 != 0)
cout << "Positive";
else
cout << "Negative";
return 0;
} | [["-", 36, 36, 0, 30, 0, 135, 136, 5, 0, 62], ["-", 36, 36, 0, 30, 0, 135, 136, 5, 0, 6], ["+", 36, 36, 36, 36, 0, 30, 0, 135, 136, 137], ["-", 0, 57, 64, 1, 0, 16, 12, 5, 0, 6], ["+", 0, 57, 64, 1, 0, 16, 12, 5, 0, 6], ["-", 75, 76, 0, 57, 15, 339, 51, 16, 17, 60], ["+", 75, 76, 0, 57, 15, 339, 51, 16, 17, 79]] | 1 | 95 |
#include "bits/stdc++.h"
using namespace std;
int a, b;
int main() {
cin >> a >> b;
if (a > 0)
cout << "Postive";
else if (a == 0 || (a < 0 && b > 0))
cout << "Zero";
else if ((abs(b) - abs(a)) % 2 == 0)
cout << "Positive";
else
cout << "Negative";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int a, b;
int main() {
cin >> a >> b;
if (a > 0)
cout << "Positive" << endl;
else if (a == 0 || (a < 0 && b > 0))
cout << "Zero" << endl;
else if ((abs(b) - abs(a)) % 2 != 0)
cout << "Positive" << endl;
else
cout << "Negative";
return 0;
} | [["-", 36, 36, 0, 30, 0, 135, 136, 5, 0, 62], ["-", 36, 36, 0, 30, 0, 135, 136, 5, 0, 6], ["+", 36, 36, 36, 36, 0, 30, 0, 135, 136, 137], ["-", 0, 57, 64, 1, 0, 16, 12, 5, 0, 6], ["+", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 8, 9, 0, 57, 64, 1, 0, 16, 17, 151], ["+", 8, 9, 0, 57, 64, 1, 0, 16, 12, 22], ["+", 75, 76, ... | 1 | 95 |
#include <iostream>
using namespace std;
int main() {
long long int i, j;
cin >> i >> j;
if (i > 0 && j > 0) {
cout << "Positive";
return 0;
}
if (i == 0 || j == 0) {
cout << "Zero";
return 0;
}
if (i > 0 && j < 0) {
cout << "Zero";
return 0;
}
if (i < 0 && j > 0) {
cout <<... | #include <iostream>
using namespace std;
int main() {
long long int i, j;
cin >> i >> j;
if (i > 0) {
cout << "Positive";
return 0;
}
if (i == 0 || j == 0) {
cout << "Zero";
return 0;
}
if (i < 0 && j > 0) {
cout << "Zero";
return 0;
}
if (j == i)
cout << "Negative";
int ... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 31, 22], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 47], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13], ["-", 0, 57, 15, 339, 51, 16, 31, 16, 17, 47], ["-", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13], ["-", 0, 14, 8, 9, 0, 57, 15, 339, 0, 2... | 1 | 149 |
#define ll long long
#define INF 99999999
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#include <bits/stdc++.h>
using namespace std;
int main() {
ll a, b;
int ans;
cin >> a >> b;
if (0 < a) {
cout << "Positive" << endl;
} else if (0 <= b) {
cout << "Zero" << endl;
} else if (b - a + 1 % 2 =... | #define ll long long
#define INF 99999999
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#include <bits/stdc++.h>
using namespace std;
int main() {
ll a, b;
int ans;
cin >> a >> b;
if (0 < a) {
cout << "Positive" << endl;
} else if (0 <= b) {
cout << "Zero" << endl;
} else if ((b - a + 1) % 2... | [["+", 15, 339, 51, 16, 31, 16, 31, 23, 0, 24], ["+", 15, 339, 51, 16, 31, 16, 31, 23, 0, 25], ["-", 8, 9, 0, 1, 0, 16, 31, 16, 31, 22], ["-", 8, 9, 0, 1, 0, 16, 31, 16, 17, 151], ["-", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22], ["-", 0, 14, 8, 9, 0, 1, 0, 16, 17, 151], ["-", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22], ["-", 0, 30, 0,... | 1 | 116 |
#pragma warning(disable : 4996)
#include <float.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#pragma region 定義
#define i_cin(X) scanf("%d", &X)
#define i_cin2(X, Y) scanf("%d %d", &X, &Y)
#define i_cin3(X, Y, Z) scanf("%d %d %d", &X, &Y, &Z)
#define l_cin(X) scanf("%ld", &X)
#defin... |
#pragma warning(disable : 4996)
#include <float.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#pragma region 定義
#define i_cin(X) scanf("%d", &X)
#define i_cin2(X, Y) scanf("%d %d", &X, &Y)
#define i_cin3(X, Y, Z) scanf("%d %d %d", &X, &Y, &Z)
#define l_cin(X) scanf("%ld", &X)
#defin... | [["-", 15, 23, 0, 16, 12, 23, 0, 16, 17, 19], ["+", 15, 23, 0, 16, 12, 23, 0, 16, 17, 20], ["-", 0, 16, 31, 16, 31, 74, 39, 77, 39, 78], ["-", 15, 23, 0, 16, 31, 16, 31, 74, 0, 25], ["-", 0, 57, 15, 23, 0, 16, 31, 16, 17, 48], ["+", 0, 16, 31, 23, 0, 16, 31, 16, 17, 47], ["+", 0, 16, 31, 23, 0, 16, 31, 16, 12, 13], ["+... | 0 | 596 |
#include <algorithm>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
#define rep(i, a, n) fo... | #include <algorithm>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
#define rep(i, a, n) fo... | [["-", 8, 9, 0, 57, 64, 9, 0, 57, 0, 121], ["-", 0, 57, 64, 9, 0, 57, 15, 339, 0, 24], ["-", 64, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["-", 64, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["-", 64, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["-", 0, 57, 64, 9, 0, 57, 15, 339, 0, 25], ["-", 64, 9, 0, 57, 64, 1, 0, 11, 31, 22], ["-", 64... | 1 | 352 |
#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 ull unsigned long long
#define vi vector<ll>
#define vvi vector<vi>
#define DBG_N(hoge) ... | #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 ull unsigned long long
#define vi vector<ll>
#define vvi vector<vi>
#define DBG_N(hoge) ... | [["-", 64, 9, 0, 57, 64, 9, 0, 57, 0, 121], ["-", 0, 57, 64, 9, 0, 57, 15, 339, 0, 24], ["-", 0, 57, 15, 339, 51, 16, 31, 2, 63, 22], ["-", 15, 339, 51, 16, 31, 2, 3, 4, 0, 24], ["-", 15, 339, 51, 16, 31, 2, 3, 4, 0, 22], ["-", 15, 339, 51, 16, 31, 2, 3, 4, 0, 25], ["-", 64, 9, 0, 57, 15, 339, 51, 16, 17, 109], ["-", 6... | 1 | 229 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ok() puts(ok ? "Yes" : "No");
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef set<int> s... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ok() puts(ok ? "Yes" : "No");
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef set<int> s... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 78], ["-", 0, 57, 15, 339, 51, 16, 31, 16, 17, 48], ["-", 0, 57, 15, 339, 51, 16, 31, 16, 12, 22], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["-", 0, 14, 8, 9, 0, 57, 15, 339, 0, 25], ["-", 0,... | 1 | 261 |
#include <iostream>
using namespace std;
int main() {
long long a, b, tmp;
cin >> a >> b;
if (a <= 0 && b >= 0) {
cout << "Zero" << endl;
return 0;
} else if (a > 0) {
cout << "Positive" << endl;
}
tmp = b - a + 1;
if (tmp % 2 == 0) {
cout << "Positive" << endl;
} else {
cout << "... | #include <iostream>
using namespace std;
int main() {
long long a, b, tmp;
cin >> a >> b;
if (a * b <= 0) {
cout << "Zero" << endl;
} else if (a > 0) {
cout << "Positive" << endl;
} else {
tmp = b - a + 1;
if (tmp % 2 == 0) {
cout << "Positive" << endl;
} else {
cout << "Nega... | [["-", 0, 57, 15, 339, 51, 16, 31, 16, 17, 19], ["-", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 48], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 20], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19], ["-", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35], [... | 1 | 107 |
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <str... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <str... | [["+", 0, 30, 0, 14, 8, 9, 0, 57, 0, 121], ["+", 0, 14, 8, 9, 0, 57, 15, 339, 0, 24], ["+", 0, 57, 15, 339, 51, 16, 31, 23, 0, 24], ["+", 15, 339, 51, 16, 31, 23, 0, 16, 31, 22], ["+", 15, 339, 51, 16, 31, 23, 0, 16, 17, 33], ["+", 15, 339, 51, 16, 31, 23, 0, 16, 12, 22], ["+", 0, 57, 15, 339, 51, 16, 31, 23, 0, 25], [... | 1 | 854 |
#include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++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 ir... | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++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 ir... | [["+", 75, 76, 0, 57, 64, 9, 0, 57, 0, 121], ["+", 0, 57, 64, 9, 0, 57, 15, 339, 0, 24], ["+", 0, 57, 15, 339, 51, 16, 31, 23, 0, 24], ["+", 51, 16, 31, 23, 0, 16, 31, 2, 63, 22], ["+", 31, 23, 0, 16, 31, 2, 3, 4, 0, 24], ["+", 0, 16, 31, 2, 3, 4, 0, 16, 31, 22], ["+", 0, 16, 31, 2, 3, 4, 0, 16, 17, 33], ["+", 0, 16, 3... | 1 | 429 |
# from scipy.sparse import csr_matrix
# import string
import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()
def resolve():
def main():
a,b=map(int,input().split())
if a==0 or b==0:
return 'Zero'
else:
if a<0 and b<0:
... | import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()
def resolve():
def main():
a,b=map(int,input().split())
if a==0 or b==0:
return 'Zero'
if a<0 and b>0:
return 'Zero'
else:
if a<0 and b<0:
... | [["+", 8, 196, 0, 14, 8, 196, 0, 57, 0, 121], ["+", 8, 196, 0, 57, 15, 679, 31, 666, 0, 22], ["+", 8, 196, 0, 57, 15, 679, 31, 666, 667, 18], ["+", 8, 196, 0, 57, 15, 679, 31, 666, 0, 612], ["+", 0, 14, 8, 196, 0, 57, 15, 679, 17, 355], ["+", 8, 196, 0, 57, 15, 679, 12, 666, 0, 22], ["+", 8, 196, 0, 57, 15, 679, 12, 66... | 5 | 130 |
a,b = map(int,input().split())
if a<=0 or 0<=b:
print("Zero)
elif a<0:
print("Positive" if abs(a-b)%2==1 else "Negative")
else:
print("Positive") | a,b = map(int,input().split())
if a<=0 and 0<=b:
print("Zero")
elif a<0:
print("Positive" if abs(a-b)%2==1 else "Negative")
else:
print("Positive") | [["-", 36, 36, 0, 656, 0, 57, 15, 679, 17, 354], ["+", 36, 36, 0, 656, 0, 57, 15, 679, 17, 355], ["+", 0, 1, 0, 652, 3, 4, 0, 557, 0, 655]] | 5 | 64 |
package main;
import (
"fmt"
"bufio"
"os"
"strings"
"strconv"
)
func main() {
var N, L int
fmt.Scan(&N, &L)
a := make([]int, N)
S := readLine()
l := strings.Split(S, " ")
for i := 0; i < N; i++ {
a[i], _ = strconv.Atoi(l[i])
}
mi := 0
mx := 0
for i := 0; i < N; i++ {
if mx < a[i] {
mx = a[i]
... | package main;
import (
"fmt"
"bufio"
"os"
"strings"
"strconv"
)
func main() {
var N, L int
fmt.Scan(&N, &L)
a := make([]int, N)
S := readLine()
l := strings.Split(S, " ")
for i := 0; i < N; i++ {
a[i], _ = strconv.Atoi(l[i])
}
mi := 0
possible := false
for l := 0; l < N - 1; l++ {
if a[l] + a[l ... | [["-", 36, 36, 0, 434, 0, 435, 8, 196, 0, 165], ["-", 0, 435, 8, 196, 0, 431, 31, 432, 0, 22], ["-", 0, 434, 0, 435, 8, 196, 0, 431, 0, 466], ["-", 0, 435, 8, 196, 0, 431, 12, 432, 0, 433], ["-", 0, 434, 0, 435, 8, 196, 0, 7, 0, 88], ["-", 0, 7, 0, 430, 10, 431, 31, 432, 0, 22], ["-", 8, 196, 0, 7, 0, 430, 10, 431, 0, ... | 7 | 352 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, l;
std::cin >> n >> l;
vector<int> a(n);
for (int i = 0; i < n; i++) {
std::cin >> a[i];
}
int add = 0, pos = -1;
for (int i = 1; i < n; i++) {
if (add < a[i] + a[i - 1]) {
add = a[i] + a[i -... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long int lli;
int main() {
lli n, l;
std::cin >> n >> l;
vector<lli> a(n);
for (int i = 0; i < n; i++) {
std::cin >> a[i];
}
lli add = 0, pos;
for (int i = 1; i < n; i++) {
if (add < a[i] + a[i - 1]) {
... | [["+", 36, 36, 36, 36, 0, 30, 0, 134, 0, 157], ["+", 36, 36, 0, 30, 0, 134, 39, 86, 0, 96], ["+", 36, 36, 0, 30, 0, 134, 39, 86, 39, 40], ["+", 36, 36, 36, 36, 0, 30, 0, 134, 49, 78], ["+", 36, 36, 36, 36, 0, 30, 0, 134, 0, 35], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 78], ["-", 0... | 1 | 226 |
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int s, n, m;
int a[300000];
int main() {
ios_base::sync_with_stdio(0);
cin >> n >> m;
for (int i = 1; i <= n; i++)
cin >> a[i];
int mx = -1;
int nm = 0;
for (int i = 1; i < n; i++)
if (a[i] + a[i + 1] > mx) {
mx = a[i... | #include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int s, n, m;
int a[300000];
int main() {
ios_base::sync_with_stdio(0);
cin >> n >> m;
for (int i = 1; i <= n; i++)
cin >> a[i];
int mx = -1;
int nm = 0;
for (int i = 1; i < n; i++)
if (a[i] + a[i + 1] > mx) {
mx = a[i... | [["-", 0, 7, 10, 43, 49, 50, 51, 16, 31, 22], ["-", 0, 7, 10, 43, 49, 50, 51, 16, 17, 72], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 31, 22], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 17, 33], ["-", 75, 76, 0, 9, 0, 7, 15, 16, 17, 18], ["-", 75, 76, 0, 9, 0, 7, 15, 16, 12, 22], ["+", 75, 76, 0, 9, 0, 7, 15, 16, 17, 20], ["+", 0, 9... | 1 | 203 |
#include <bits/stdc++.h>
using namespace std;
long long a[1000000];
int main() {
int n, m;
cin >> n >> m;
long long sum = 0;
for (int i = 0; i < n; i++)
cin >> a[i], sum += a[i];
for (int i = 0; i < n - 1; i++) {
if (a[i] + a[i + 1] >= m) {
int cur = i + 1;
cout << "Possible" << endl;
... | #include <bits/stdc++.h>
using namespace std;
long long a[1000000];
int main() {
int n, m;
cin >> n >> m;
long long sum = 0;
for (int i = 0; i < n; i++)
cin >> a[i], sum += a[i];
for (int i = 0; i < n - 1; i++) {
if (a[i] + a[i + 1] >= m) {
int cur = i + 1;
cout << "Possible" << endl;
... | [["-", 0, 7, 10, 43, 49, 50, 51, 16, 31, 22], ["-", 0, 7, 10, 43, 49, 50, 51, 16, 17, 72], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 31, 22], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 17, 33], ["-", 0, 57, 64, 9, 0, 7, 15, 16, 17, 19], ["-", 64, 9, 0, 7, 15, 16, 12, 16, 31, 22], ["-", 64, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["+", 0,... | 1 | 176 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
using namespace std;
int a[100100];
int main() {
int n, l;
scanf("%d%d", &n, &l);
for (int i = 0; i < n; i++) {
s... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
using namespace std;
int a[100100];
int main() {
int n, l;
scanf("%d%d", &n, &l);
for (int i = 0; i < n; i++) {
s... | [["-", 0, 7, 10, 43, 49, 50, 51, 16, 31, 22], ["-", 0, 7, 10, 43, 49, 50, 51, 16, 17, 72], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 31, 22], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 17, 33], ["-", 0, 57, 64, 9, 0, 7, 15, 16, 17, 18], ["-", 64, 9, 0, 7, 15, 16, 12, 16, 31, 22], ["-", 64, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["+", 0,... | 1 | 234 |
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <queue>
#include <vector>
using namespace std;
typedef long long LL;
const int N = 1e5 + 5;
LL a[N], l, n;
vector<int> ans;
int main() {
scanf("%I64d%I64d", &n, &l);
for (int i = 1; i <= n; ++i)
scanf("%I64d", &a[i]);
int ret = 1, tmp = a[1] +... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <queue>
#include <vector>
using namespace std;
typedef long long LL;
const int N = 1e5 + 5;
LL a[N], l, n;
vector<int> ans;
int main() {
scanf("%I64d%I64d", &n, &l);
for (int i = 1; i <= n; ++i)
scanf("%I64d", &a[i]);
int ret = 1, tmp = a[1] +... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["-", 0, 14, 8, 9, 0, 7, 10, 43, 0, 35], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 31, 22], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 17, 33], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 43, 0, 35], ["+", 0, 14, 8, 9, 0... | 1 | 274 |
#include "bits/stdc++.h"
using namespace std;
const int N = 1e5 + 5;
int n, k;
int arr[N];
int main() {
scanf("%d %d", &n, &k);
for (int i = 1; i <= n; ++i) {
scanf("%d", arr + i);
}
for (int i = 1; i < n; ++i) {
if (arr[i] + arr[i + 1] >= k) {
printf("Possible\n");
for (int j = 1; j < i; ++... | #include "bits/stdc++.h"
using namespace std;
const int N = 1e5 + 5;
int n, k;
int arr[N];
int main() {
scanf("%d %d", &n, &k);
for (int i = 1; i <= n; ++i) {
scanf("%d", arr + i);
}
for (int i = 1; i < n; ++i) {
if (arr[i] + arr[i + 1] >= k) {
printf("Possible\n");
for (int j = 1; j < i; ++... | [["-", 0, 7, 10, 43, 49, 50, 51, 16, 31, 22], ["-", 0, 7, 10, 43, 49, 50, 51, 16, 17, 72], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 31, 22], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 17, 33], ["-", 0, 57, 64, 9, 0, 7, 15, 16, 17, 18], ["-", 0, 57, 64, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 57, 64, 9, 0, 7, 15, 16, 17, 20], ["+", 64, ... | 1 | 190 |
#include <algorithm>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define zero(x) (((x) > 0 ? (x) : -(x)) < eps)
#define pause cout << " press ansy key to continue...", cin >> chh
#define file_r(x) freopen(x... | #include <algorithm>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define zero(x) (((x) > 0 ? (x) : -(x)) < eps)
#define pause cout << " press ansy key to continue...", cin >> chh
#define file_r(x) freopen(x... | [["-", 64, 9, 0, 57, 15, 339, 51, 16, 17, 19], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 72], ["-", 15, 339, 51, 16, 12, 69, 341, 342, 0, 22], ["+", 31, 16, 12, 69, 341, 342, 0, 16, 31, 22], ["+", 31, 16, 12, 69, 341, 342, 0, 16, 17, 72], ["+", 31, 16, 12, 69, 341, 342, 0, 16, 12, 13], ["+", 64, 9, 0, 57, 15, 339, 51, ... | 1 | 519 |
import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) {
FastScanner sc = new FastScanner();
int n = sc.nextInt();
int l = sc.nextInt();
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = sc.nextInt();
}
for (int i = 0; i < n - 1; ... | import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) {
FastScanner sc = new FastScanner();
int n = sc.nextInt();
int l = sc.nextInt();
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = sc.nextInt();
}
for (int i = 0; i < n - 1; ... | [["-", 0, 7, 502, 503, 49, 200, 51, 16, 31, 22], ["-", 0, 7, 502, 503, 49, 200, 51, 16, 17, 72], ["-", 0, 7, 502, 503, 49, 200, 51, 16, 12, 499], ["-", 0, 57, 64, 196, 0, 7, 502, 503, 0, 35], ["-", 0, 57, 64, 196, 0, 7, 15, 16, 31, 22], ["-", 0, 57, 64, 196, 0, 7, 15, 16, 17, 18], ["-", 64, 196, 0, 7, 15, 16, 12, 16, 1... | 3 | 632 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int maxn = 1e5 + 100;
int n;
LL L;
LL A[maxn];
bool solve() {
int p = -1;
for (int i = 1; i <= n - 1; ++i)
if (A[i] + A[i + 1] >= L) {
p = i;
break;
}
if (p == -1)
return false;
puts("Possible");
for (int i =... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int maxn = 1e5 + 100;
int n;
LL L;
LL A[maxn];
bool solve() {
int p = -1;
for (int i = 1; i <= n - 1; ++i)
if (A[i] + A[i + 1] >= L) {
p = i;
break;
}
if (p == -1)
return false;
puts("Possible");
for (int i =... | [["-", 0, 7, 10, 43, 49, 50, 51, 16, 31, 22], ["-", 0, 7, 10, 43, 49, 50, 51, 16, 17, 72], ["-", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13], ["-", 0, 14, 8, 9, 0, 7, 10, 43, 0, 35], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 31, 22], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 14, 8, 9, 0, 7, 10, 43, 0, 35], ["+", 0, 14, 8, 9,... | 1 | 230 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define DEBUG(x) cerr << #x << " = " << x << endl
signed main() {
ios::sync_with_stdio(false);
int N, L;
cin >> N >> L;
vector<int> A(N);
REP(i, N) cin >> A[i];
bool impossible = true;
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define DEBUG(x) cerr << #x << " = " << x << endl
signed main() {
ios::sync_with_stdio(false);
int N, L;
cin >> N >> L;
vector<int> A(N);
REP(i, N) cin >> A[i];
bool impossible = true;
... | [["+", 0, 9, 0, 1, 0, 16, 31, 16, 31, 22], ["+", 0, 9, 0, 1, 0, 16, 31, 16, 17, 151], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 62], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 75, 76, 0, 9, 0, 1, 0, 16, 17, 151], ["+", 75, 76, 0, 9, 0, 1, 0, 16, 12, 22], ["+", 0, 57, 75, 76, 0, 9, 0, 1, 0, 35]] | 1 | 174 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double DB;
#define F(i, a, b) for (int i = (a); i <= (b); ++i)
#define R(i, n) for (int i = 0; i < (n); ++i)
#define fill(a, b) memset(a, b, sizeof a)
const int maxn = 1e5 + 10;
int n, l;
int a[maxn], res[maxn];
LL sum = 0;
int main() {
/... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double DB;
#define F(i, a, b) for (int i = (a); i <= (b); ++i)
#define R(i, n) for (int i = 0; i < (n); ++i)
#define fill(a, b) memset(a, b, sizeof a)
const int maxn = 1e5 + 10;
int n, l;
int a[maxn], res[maxn];
LL sum = 0;
int main() {
/... | [["-", 75, 76, 0, 9, 0, 1, 0, 2, 63, 22], ["+", 0, 57, 75, 76, 0, 9, 0, 7, 0, 88], ["+", 75, 76, 0, 9, 0, 7, 10, 43, 39, 40], ["-", 0, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 31, 22], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 9, 0, 7, 10, 43, 49, 50, 0,... | 1 | 227 |
#include <cstdio>
#include <cstring>
using namespace std;
int n, L, a[100010];
int main() {
while (~scanf("%d%d", &n, &L)) {
for (int i = 1; i <= n; i++)
scanf("%d", a + i);
int ch = -1;
for (int i = 1; i < n; i++)
if (a[i] + a[i + 1] >= L) {
ch = i;
break;
}
if (ch =... | #include <cstdio>
#include <cstring>
using namespace std;
int n, L, a[100010];
int main() {
while (~scanf("%d%d", &n, &L)) {
for (int i = 1; i <= n; i++)
scanf("%d", a + i);
int ch = -1;
for (int i = 1; i < n; i++)
if (a[i] + a[i + 1] >= L) {
ch = i;
break;
}
if (ch =... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22], ["-", 0, 52, 8, 9, 0, 7, 8, 57, 0, 121], ["+", 8, 9, 0, 7, 8, 1, 0, 2, 63, 22], ["+", 8, 1, 0, 2, 3, 4, 0, 5, 0, 62], ["+", 8, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 8, 1, 0, 2, 3, 4, 0, 5, 0, 44], ["+", 0, 7, 8, 1, 0, 2, 3, 4, 0, 21], ["-"... | 1 | 175 |
#include <bits/stdc++.h>
typedef long long LL; // Attention!!
using namespace std;
#define fillchar(a, x) memset(a, x, sizeof(a))
#define MP make_pair
#define PB push_back
#define endl '\n'
const LL M = 1000000007;
int main() {
ios_base::sync_with_stdio(0);
cout.precision(15);
cout.setf(ios::fixed);
LL n,... |
#include <bits/stdc++.h>
typedef long long LL; // Attention!!
using namespace std;
#define fillchar(a, x) memset(a, x, sizeof(a))
#define MP make_pair
#define PB push_back
#define endl '\n'
const LL M = 1000000007;
int main() {
ios_base::sync_with_stdio(0);
cout.precision(15);
cout.setf(ios::fixed);
LL n,... | [["-", 8, 9, 0, 7, 10, 11, 12, 16, 31, 22], ["-", 8, 9, 0, 7, 10, 11, 12, 16, 17, 72], ["+", 8, 9, 0, 7, 10, 11, 12, 23, 0, 24], ["+", 0, 7, 10, 11, 12, 23, 0, 16, 31, 22], ["+", 0, 7, 10, 11, 12, 23, 0, 16, 17, 33], ["+", 8, 9, 0, 7, 10, 11, 12, 23, 0, 25], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["-", 0, 14, 8, 9, ... | 1 | 232 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, x, y) for (int i = (x); i < (y); ++i)
#define debug(x) #x << "=" << (x)
#ifdef DEBUG
#define _GLIBCXX_DEBUG
#define show(x) std::cerr << debug(x) << " (L:" << __LINE__ << ")" << std::endl
#else
#define show(x)
#endif
typedef long long int ll;
typedef pair<... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, x, y) for (int i = (x); i < (y); ++i)
#define debug(x) #x << "=" << (x)
#ifdef DEBUG
#define _GLIBCXX_DEBUG
#define show(x) std::cerr << debug(x) << " (L:" << __LINE__ << ")" << std::endl
#else
#define show(x)
#endif
typedef long long int ll;
typedef pair<... | [["+", 0, 30, 0, 14, 8, 9, 0, 57, 0, 121], ["+", 0, 14, 8, 9, 0, 57, 15, 339, 0, 24], ["+", 15, 339, 51, 16, 31, 16, 31, 69, 28, 22], ["+", 51, 16, 31, 16, 31, 69, 341, 342, 0, 70], ["+", 51, 16, 31, 16, 31, 69, 341, 342, 0, 22], ["+", 51, 16, 31, 16, 31, 69, 341, 342, 0, 73], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, ... | 1 | 741 |
N, L = map(int, input().split())
a = [map(int, input().split())]
b = 0
c = 0
for i in range(N-1):
if a[i] + a[i+1] >= L:
print("Possible")
b = 1
c = i
break
else:
print("Impossible")
if b = 1:
for i in range(c+1):
print(i+1)
for i in range(N, c+1, -1):
print(i+1) | N, L = map(int, input().split())
a = list(map(int, input().split()))
b = 0
c = 0
for i in range(N-1):
if a[i] + a[i+1] >= L:
print("Possible")
b = 1
c = i
break
else:
print("Impossible")
if b == 1:
for i in range(1,c+1):
print(i)
for i in range(N-1, c, -1):
print(i) | [["-", 0, 656, 0, 1, 0, 662, 12, 634, 0, 70], ["+", 0, 656, 0, 1, 0, 662, 12, 652, 63, 22], ["+", 0, 1, 0, 662, 12, 652, 3, 4, 0, 24], ["-", 0, 656, 0, 1, 0, 662, 12, 634, 0, 73], ["+", 0, 1, 0, 662, 12, 652, 3, 4, 0, 25], ["-", 36, 36, 0, 656, 0, 57, 0, 42, 0, 32], ["+", 36, 36, 0, 656, 0, 57, 15, 666, 667, 60], ["+",... | 5 | 126 |
#include <bits/stdc++.h>
using namespace std;
#define forn(i, n) for (int i = 0; i < n; i++)
#define sz(a) (int)a.size()
#define re return
#define fi first
#define se second
#define mp(a, b) make_pair(a, b)
typedef long long ll;
typedef vector<int> vi;
typedef long double ld;
typedef vector<ll> vll;
typedef pair<i... |
#include <bits/stdc++.h>
using namespace std;
#define forn(i, n) for (int i = 0; i < n; i++)
#define sz(a) (int)a.size()
#define re return
#define fi first
#define se second
#define mp(a, b) make_pair(a, b)
typedef long long ll;
typedef vector<int> vi;
typedef long double ld;
typedef vector<ll> vll;
typedef pair<i... | [["+", 0, 57, 64, 9, 0, 7, 8, 57, 0, 121], ["+", 64, 9, 0, 7, 8, 57, 15, 339, 0, 24], ["+", 0, 7, 8, 57, 15, 339, 51, 16, 31, 22], ["+", 0, 7, 8, 57, 15, 339, 51, 16, 17, 20], ["+", 8, 57, 15, 339, 51, 16, 12, 16, 31, 22], ["+", 8, 57, 15, 339, 51, 16, 12, 16, 17, 72], ["+", 8, 57, 15, 339, 51, 16, 12, 16, 12, 13], ["+... | 1 | 628 |
n,l = gets.split.map(&:to_i)
a = gets.split.map(&:to_i)
res = nil
a.each_cons(2).each_with_index{|x,i| x[0]+x[1] >= l && res = i}
if res
puts 'Possible'
(1...(res+1)).each {|x| puts x}
((res+2)..(n-1)).each {|x| puts x}
puts res+1
else
puts 'Impossible'
end
| n,l = gets.split.map(&:to_i)
a = gets.split.map(&:to_i)
res = nil
a.each_cons(2).each_with_index{|x,i| (x[0]+x[1] >= l) && (res = i)}
if res
puts 'Possible'
(1..res).each {|x| puts x}
((res+2)..(n-1)).to_a.reverse.each {|x| puts x}
puts res+1
else
puts 'Impossible'
end
| [["+", 196, 196, 8, 734, 0, 738, 31, 739, 0, 24], ["+", 196, 196, 8, 734, 0, 738, 31, 739, 0, 25], ["+", 196, 196, 8, 734, 0, 738, 12, 739, 0, 24], ["+", 196, 196, 8, 734, 0, 738, 12, 739, 0, 25], ["-", 64, 749, 0, 652, 486, 739, 0, 475, 17, 389], ["-", 0, 652, 486, 739, 0, 475, 444, 739, 0, 24], ["+", 64, 749, 0, 652,... | 4 | 113 |
#include <cstdint>
#include <iostream>
typedef int64_t i64;
static const auto NMAX = 100000;
static int N;
static int L;
static int A[NMAX];
static void solve(int u) {
puts("Possible");
for (auto i = 1; i < u; i++)
std::cout << i << std::endl;
for (auto i = N - 1; i >= u; i--)
std::cout << i << std::e... | #include <cstdint>
#include <iostream>
typedef int64_t i64;
static const auto NMAX = 100000;
static int N;
static int L;
static int A[NMAX];
static void solve(int u) {
std::cout << "Possible" << std::endl;
for (auto i = 1; i < u; i++)
std::cout << i << std::endl;
for (auto i = N - 1; i >= u; i--)
std:... | [["-", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 0, 1, 0, 16, 31, 16, 31, 343, 345, 348], ["+", 0, 1, 0, 16, 31, 16, 31, 343, 0, 349], ["+", 0, 1, 0, 16, 31, 16, 31, 343, 141, 22], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 17, 151], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 0, 14, 8, 9, 0, ... | 1 | 199 |
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#define LL long long
#define N 100010
using namespace std;
LL L, a[N];
int n;
int main() {
int i, j;
scanf("%d%I64d", &n, &L);
for (i = 1; i <= n; ++i)
scanf("%d", &a[i]);
int id = -1;
for (i =... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#define LL long long
#define N 100010
using namespace std;
LL L, a[N];
int n;
int main() {
int i, j;
scanf("%d%I64d", &n, &L);
for (i = 1; i <= n; ++i)
scanf("%I64d", &a[i]);
int id = -1;
for (... | [["-", 8, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 8, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["-", 0, 57, 64, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 57, 64, 9, 0, 7, 15, 16, 17, 18], ["-", 0, 57, 64, 9, 0, 7, 15, 16, 17, 47], ["+", 0, 57, 64, 9, 0, 7, 15, 16, 17, 20], ["-", 64, 9, 0, 7, 15, 16, 12, 16, 17, 72], ["-", 64, 9, 0, 7, 15, 16, 12... | 1 | 203 |
#include <stdio.h>
int main() {
int n, m, h = 0, mi, a, b = 0, i;
scanf("%d %d", &n, &m);
for (i = 0; i < n; i++) {
scanf("%d", &a);
if (a + b >= m && h == 0) {
h = 1;
mi = i;
}
b = a;
}
if (h == 0) {
printf("Impossible\n");
return 0;
}
printf("Possible\n");
for (i = ... | #include <stdio.h>
int main() {
int n, m, h = 0, mi, a, b = 0, i;
scanf("%d %d %d", &n, &m, &b);
for (i = 1; i < n; i++) {
scanf("%d", &a);
if (a + b >= m && h == 0) {
h = 1;
mi = i;
}
b = a;
}
if (h == 0) {
printf("Impossible\n");
return 0;
}
printf("Possible\n");
fo... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["+", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67], ["+", 0, 1, 0, 2, 3, 4, 0, 66, 28, 22], ["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ... | 0 | 173 |
#include <stdio.h>
#define maxn 1000000
int S[maxn];
int main(void) {
int n, l;
scanf("%i %i", &n, &l);
for (int i = 1; i <= n; i++) {
scanf("%i", &S[i]);
}
int lidx = -1, ridx = -1;
for (int i = 1; i <= n; i++) {
if (S[i] >= l) {
lidx = ridx = i;
break;
} else if (S[i] + S[i + ... | #include <stdio.h>
#define maxn 1000000
int S[maxn];
int main(void) {
int n, l;
scanf("%i %i", &n, &l);
for (int i = 1; i <= n; i++) {
scanf("%i", &S[i]);
}
int lidx = -1, ridx = -1;
for (int i = 1; i < n; i++) {
if ((long long)S[i] + S[i + 1] >= l) {
lidx = i;
ridx = i + 1;
b... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["-", 0, 57, 15, 23, 0, 16, 31, 69, 28, 22], ["-", 0, 57, 15, 23, 0, 16, 31, 69, 0, 70], ["-", 0, 57, 15, 23, 0, 16, 31, 69, 71, 22], ["-", 0, 57, 15, 23, 0, 16, 31, 69, 0, 73], ["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 20], ["-", 8, 9, 0,... | 0 | 236 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> ii;
typedef vector<ll> vi;
typedef long double ld;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
const ll MOD = 1e9 + 7;
int a[100001];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> ii;
typedef vector<ll> vi;
typedef long double ld;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
const ll MOD = 1e9 + 7;
int a[100001];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);... | [["-", 0, 7, 10, 43, 49, 50, 51, 16, 31, 22], ["-", 0, 7, 10, 43, 49, 50, 51, 16, 17, 72], ["-", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13], ["-", 75, 76, 0, 9, 0, 7, 10, 43, 0, 35], ["-", 75, 76, 0, 9, 0, 7, 15, 16, 31, 22], ["-", 75, 76, 0, 9, 0, 7, 15, 16, 17, 18], ["-", 0, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["+", 0, 7, 1... | 1 | 279 |
//ここからテンプレート
//#define PLASMA_NO_BOOST
#if 1
#include <algorithm>
#include <array>
#include <chrono>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
... | //ここからテンプレート
//#define PLASMA_NO_BOOST
#if 1
#include <algorithm>
#include <array>
#include <chrono>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
... | [["-", 0, 14, 8, 9, 0, 7, 10, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 7, 10, 43, 39, 78], ["-", 0, 57, 64, 9, 0, 7, 10, 43, 39, 40], ["+", 0, 57, 64, 9, 0, 7, 10, 43, 39, 78], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 17, 72], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 12, 13], ["+", 64, 9, 0, 7, 15, 16, 12, 16, 17, 72], ["+", 64, 9, 0, 7... | 1 | 8,046 |
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
def solve():
N,L = map(int,input().split())
As = list(map(int,input().split()))
for i in range(N-1):
if As[i] + As[i+1] >= L:
print("Possible")
keep = i + 1
for n in range(1,N):
if n != keep:
... | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
def solve():
N,L = map(int,input().split())
As = list(map(int,input().split()))
for i in range(N-1):
if As[i] + As[i+1] >= L:
print("Possible")
keep = i + 1
for n in range(1,keep):
print(n)
... | [["-", 64, 196, 0, 7, 12, 652, 3, 4, 0, 22], ["+", 64, 196, 0, 7, 12, 652, 3, 4, 0, 22], ["-", 64, 196, 0, 7, 8, 196, 0, 57, 0, 121], ["+", 0, 7, 8, 196, 0, 1, 0, 652, 63, 22], ["+", 8, 196, 0, 1, 0, 652, 3, 4, 0, 24], ["+", 8, 196, 0, 1, 0, 652, 3, 4, 0, 22], ["+", 8, 196, 0, 1, 0, 652, 3, 4, 0, 25], ["+", 8, 196, 0, ... | 5 | 109 |
// sobskdrbhvk
#include <bits/stdc++.h>
using namespace std;
typedef long long int LL;
typedef pair<int, int> pii;
typedef pair<LL, LL> pll;
#define PB push_back
#define MP make_pair
#define L first
#define R second
#define sz(x) ((int)(x).size())
#define smax(x, y) ((x) = max((x), (y)))
#define smin(x, y) ((x) = mi... | // sobskdrbhvk
#include <bits/stdc++.h>
using namespace std;
typedef long long int LL;
typedef pair<int, int> pii;
typedef pair<LL, LL> pll;
#define PB push_back
#define MP make_pair
#define L first
#define R second
#define sz(x) ((int)(x).size())
#define smax(x, y) ((x) = max((x), (y)))
#define smin(x, y) ((x) = mi... | [["-", 0, 7, 10, 43, 49, 50, 51, 16, 31, 22], ["-", 0, 7, 10, 43, 49, 50, 51, 16, 17, 72], ["-", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 31, 22], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 17, 33], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13], ["-", 8, 9, 0, 7, 15, 16, 31, 16, 17, 72], ["-", ... | 1 | 259 |
#include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define vi vector<int>
#define Max(a, b) ((a) > (b) ? (a) : (b))
#define Min(a, b) ((a) < (b) ? (a) : (b))
#define rep(i, a, b) for (__typeof((b)) i = (a); i < (b); i += 1)
#define all(a) (a).begin(), ... | #include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define vi vector<int>
#define Max(a, b) ((a) > (b) ? (a) : (b))
#define Min(a, b) ((a) < (b) ? (a) : (b))
#define rep(i, a, b) for (__typeof((b)) i = (a); i < (b); i += 1)
#define all(a) (a).begin(), ... | [["-", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 7, 0, 88], ["+", 0, 14, 8, 9, 0, 7, 10, 43, 39, 40], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 31, 22], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 0, 32... | 1 | 289 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define MP... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define MP... | [["-", 0, 57, 64, 9, 0, 1, 0, 2, 63, 22], ["+", 0, 9, 0, 57, 64, 9, 0, 7, 0, 88], ["+", 0, 57, 64, 9, 0, 7, 10, 43, 39, 40], ["-", 64, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["+", 64, 9, 0, 7, 10, 43, 49, 50, 0, 32], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 31, 22], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 17, 33], ["+", 0, 7, 10, 43, 49,... | 1 | 357 |
#include <bits/stdc++.h>
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) _range(i, 0, n)
#define _range(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)
#define _rrep(i, n) _rrange(i, n, 0)
#define _rrange(i, a, b) for (int i = int(a)... | #include <bits/stdc++.h>
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) _range(i, 0, n)
#define _range(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)
#define _rrep(i, n) _rrange(i, n, 0)
#define _rrange(i, a, b) for (int i = int(a)... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["-", 0, 14, 8, 9, 0, 43, 49, 50, 49, 22], ["-", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 147], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 78], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 14, 8, 9, 0, 43... | 1 | 399 |
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <st... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <st... | [["-", 0, 1, 0, 2, 3, 4, 0, 16, 17, 33], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["-", 0, 1, 0, 2, 3, 4, 0, 25, 0, 35], ["-", 0, 7, 10, 43, 49, 50, 51, 16, 31, 22], ["-", 0, 7, 10, 43, 49, 50, 51, 16, 17, 72], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 31, 22], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 17, 33], ["-", 0, 57, 64, 9, ... | 1 | 251 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long long LL;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
#ifdef DEBUG
#define cek(x) cout << x
#else
#define cek(x) \
if (false) { ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long long LL;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
#ifdef DEBUG
#define cek(x) cout << x
#else
#define cek(x) \
if (false) { ... | [["-", 0, 57, 64, 9, 0, 1, 0, 2, 63, 22], ["+", 8, 9, 0, 57, 64, 9, 0, 7, 0, 88], ["+", 0, 57, 64, 9, 0, 7, 10, 43, 39, 40], ["-", 64, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 31, 22], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 64, 9, 0, 7, 10, 43, 49, 50, 0... | 1 | 363 |
#include <cstdio>
const int MAXN = 1E5 + 5;
int array[MAXN]{};
int L, M, N;
int main() {
scanf(" %d%d", &N, &L);
M = -1;
for (int i = 1; i <= N; ++i) {
scanf("%d", &array[i]);
if (array[i - 1] + array[i] >= L)
M = i - 1;
}
if (M != -1) {
puts("Possible");
for (int i = 1; i < N; ++i)
... | #include <cstdio>
const int MAXN = 1E5 + 5;
int array[MAXN]{};
int L, M, N;
int main() {
scanf(" %d%d", &N, &L);
M = -1;
for (int i = 1; i <= N; ++i) {
scanf("%d", &array[i]);
if (array[i - 1] + array[i] >= L)
M = i - 1;
}
if (M != -1) {
puts("Possible");
for (int i = 1; i < M; ++i)
... | [["-", 0, 57, 64, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 57, 64, 9, 0, 7, 15, 16, 12, 22], ["-", 0, 57, 64, 9, 0, 7, 8, 57, 0, 121], ["-", 64, 9, 0, 7, 8, 57, 15, 339, 0, 24], ["-", 0, 7, 8, 57, 15, 339, 51, 16, 31, 22], ["-", 0, 7, 8, 57, 15, 339, 51, 16, 17, 79], ["-", 0, 7, 8, 57, 15, 339, 51, 16, 12, 22], ["-", 64, 9, ... | 1 | 165 |
#include <bits/stdc++.h>
#ifdef BUG
#include "debug.hpp"
#else
#define DEBUG(var)
#endif
using namespace std;
template <class T1, class T2>
inline istream &operator>>(istream &fin, pair<T1, T2> &pr) {
fin >> pr.first >> pr.second;
return fin;
}
template <class T0, class T1, class T2>
inline istream &operator>>(ist... | #include <bits/stdc++.h>
#ifdef BUG
#include "debug.hpp"
#else
#define DEBUG(var)
#endif
using namespace std;
template <class T1, class T2>
inline istream &operator>>(istream &fin, pair<T1, T2> &pr) {
fin >> pr.first >> pr.second;
return fin;
}
template <class T0, class T1, class T2>
inline istream &operator>>(ist... | [["-", 0, 7, 10, 43, 49, 50, 51, 16, 31, 22], ["-", 0, 7, 10, 43, 49, 50, 51, 16, 17, 72], ["-", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 31, 22], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 17, 33], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13], ["-", 8, 9, 0, 7, 15, 16, 31, 16, 17, 72], ["-", ... | 1 | 501 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using names... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using names... | [["+", 0, 7, 10, 43, 49, 50, 51, 16, 31, 22], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 17, 33], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 31, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 20], ["-", 0, 14, 8, 9, 0, 7, 10, 43, 0, 35], ["-", 0, 14, 8, 9,... | 1 | 327 |
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
using namespace std;
long long arr[100000];
int n;
long long l;
int main() {
// freopen("input.txt", "r", stdin);
// freopen("inout.txt", "w", stdout);
scanf("%d %I64d\n", &n, &l);
for (int i = 0; i < n; i++)
scanf("%I64d", arr ... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
using namespace std;
long long arr[100000];
int n;
long long l;
int main() {
// freopen("input.txt", "r", stdin);
// freopen("inout.txt", "w", stdout);
scanf("%d %I64d\n", &n, &l);
for (int i = 0; i < n; i++)
scanf("%I64d", arr ... | [["-", 0, 7, 10, 43, 49, 50, 51, 16, 31, 22], ["-", 0, 7, 10, 43, 49, 50, 51, 16, 17, 72], ["-", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13], ["-", 0, 57, 64, 9, 0, 7, 10, 43, 0, 35], ["-", 0, 57, 64, 9, 0, 7, 15, 16, 31, 22], ["-", 0, 57, 64, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13], ["+", 0, 57... | 1 | 201 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f(i, x, n) for (int i = x; i < n; ++i)
int main() {
int n, l, p;
scanf("%d%d%d", &n, &l, &p);
f(i, 1, n) {
int t;
scanf("%d", &t);
if (t + p >= l) {
printf("Possible\n");
f(j, 1, i) printf("%d\n", j);
f(j, i ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f(i, x, n) for (int i = x; i < n; ++i)
int main() {
int n, l, p;
scanf("%d%d%d", &n, &l, &p);
f(i, 1, n) {
int t;
scanf("%d", &t);
if (t + p >= l) {
printf("Possible\n");
f(j, 1, i) printf("%d\n", j);
for (in... | [["-", 0, 57, 64, 9, 0, 1, 0, 2, 63, 22], ["+", 0, 9, 0, 57, 64, 9, 0, 7, 0, 88], ["+", 0, 57, 64, 9, 0, 7, 10, 43, 39, 40], ["-", 64, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 31, 22], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 64, 9, 0, 7, 10, 43, 49, 50, 0... | 1 | 155 |
#include <iostream>
using namespace std;
const int LIM = 1e+5 + 100;
int len[LIM];
int main() {
int n, l;
cin >> n >> l;
for (int i = 0; i < n; ++i)
cin >> len[i];
int id = -1;
for (int i = 1; i < n; ++i)
if (len[i - 1] + len[i] >= l)
id = i;
if (id == -1) {
cout << "Impossible" << ... | #include <iostream>
using namespace std;
const int LIM = 1e+5 + 100;
int len[LIM];
int main() {
int n, l;
cin >> n >> l;
for (int i = 0; i < n; ++i)
cin >> len[i];
int id = -1;
for (int i = 1; i < n; ++i)
if (len[i - 1] + len[i] >= l)
id = i;
if (id == -1) {
cout << "Impossible" << ... | [["-", 0, 7, 10, 43, 49, 50, 51, 16, 31, 22], ["-", 0, 7, 10, 43, 49, 50, 51, 16, 17, 72], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 31, 22], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 17, 33], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 20], ["+", 8, 9, 0... | 1 | 183 |
#include <cstdio>
using namespace std;
int a[100010];
int main() {
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
int n, l;
scanf("%d%d", &n, &l);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
int j = 0;
for (int i = 1; i < n; i++)
if (a[i] + a[i + 1] >= l)
j = i... | #include <cstdio>
using namespace std;
int a[100010];
int main() {
int n, l;
scanf("%d%d", &n, &l);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
int j = 0;
for (int i = 1; i < n; i++)
if (a[i] + a[i + 1] >= l)
j = i;
if (!j) {
puts("Impossible");
return 0;
}
puts("Possible")... | [["-", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 62], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["-", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 215 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <typeinfo>
#include <vector>
#define DIV 1000000007
using namespace std;
long long N, L;
lon... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <typeinfo>
#include <vector>
#define DIV 1000000007
using namespace std;
long long N, L;
lon... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 31, 22], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["-", 8, 9, 0, 7, 8, 9, 0, 37, 0, 38], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 31, 22], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 17, 151], ["+", 0, 1, 0, 16, 31, 1... | 1 | 221 |
#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1.0);
const double eps = 1e-9;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define pii pair<int, int>
#define piii pair<pii, int>
#define pll pair<long long, long long>
#define plll pair<pll, long long>
#define hjsag... | #include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1.0);
const double eps = 1e-9;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define pii pair<int, int>
#define piii pair<pii, int>
#define pll pair<long long, long long>
#define plll pair<pll, long long>
#define hjsag... | [["-", 0, 7, 10, 43, 49, 50, 51, 16, 31, 22], ["-", 0, 7, 10, 43, 49, 50, 51, 16, 17, 72], ["-", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13], ["-", 0, 14, 8, 9, 0, 7, 10, 43, 0, 35], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 31, 22], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13], ["+", 0, 14, 8... | 1 | 238 |
#include <bits/stdc++.h>
#include <ctime>
using namespace std;
#define space ' '
#define enter "\n"
#define fi first
#define se second
#define INF 2000000007
#define mp make_pair
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef set<int> si;
typedef map<int, int> mii;
typedef p... | #include <bits/stdc++.h>
#include <ctime>
using namespace std;
#define space ' '
#define enter "\n"
#define fi first
#define se second
#define INF 2000000007
#define mp make_pair
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef set<int> si;
typedef map<int, int> mii;
typedef p... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 8, 9, 0, 7, 8, 57, 64, 1, 0, 35], ["+", 0, 30, 0, 14, 8, 9, 0, 7, 0, 88], ["+", 0, 30, 0, 14, 8, 9, 0, 7, 0, 24], ["+", 0, 14, 8, 9, 0, 7, 10, 43, 39, 40], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 49, 22], ["+", 8, 9, 0, 7, 10, 43, 49, ... | 1 | 656 |
#include <bits/stdc++.h>
#define MOD 1000000007
#define MAKS 1000000000000000LL
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
int ar[101010];
int main() {
ios::sync_with_stdio(false);
int n, l;
cin >> n >> l;
int left = -1, right = -1;
for (int ctr1 = 0; ctr1 < n; ctr1++) {
cin... | #include <bits/stdc++.h>
#define MOD 1000000007
#define MAKS 1000000000000000LL
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
int ar[101010];
int main() {
ios::sync_with_stdio(false);
int n, l;
cin >> n >> l;
int left = -1, right = -1;
for (int ctr1 = 0; ctr1 < n; ctr1++) {
cin... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 22], ["-", 0, 14, 8, 9, 0, 7, 10, 43, 0, 35], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 31, 22], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 0, 14, 8, 9, 0, 7, 26, 27, 17, 29], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 20], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 30, 0, 14, 8, 9,... | 1 | 230 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <utility>
#include <vector>
using n... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <utility>
#include <vector>
using n... | [["-", 0, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["+", 0, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["-", 0, 57, 75, 76, 0, 9, 0, 57, 0, 121], ["+", 75, 76, 0, 9, 0, 1, 0, 2, 63, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 62], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44], ["+", 0, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["-", 0,... | 1 | 1,030 |
#include <bits/stdc++.h>
using namespace std;
const int MAXn = 1e5 + 10;
int a[MAXn];
int main() {
int n, l;
cin >> n >> l;
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
int ml = a[1] + a[2], k = 1;
for (int i = 2; i < n; i++)
if (a[i] + a[i + 1] > ml) {
k = i;
ml = a[i] + a[i... | #include <bits/stdc++.h>
using namespace std;
const int MAXn = 1e5 + 10;
int a[MAXn];
int main() {
int n, l;
cin >> n >> l;
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
int ml = a[1] + a[2], k = 1;
for (int i = 2; i < n; i++)
if (a[i] + a[i + 1] > ml) {
k = i;
ml = a[i] + a[i... | [["-", 0, 57, 64, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 57, 64, 9, 0, 7, 15, 16, 12, 22], ["-", 0, 57, 64, 9, 0, 7, 8, 57, 0, 121], ["+", 64, 9, 0, 7, 8, 1, 0, 2, 63, 22], ["+", 8, 1, 0, 2, 3, 4, 0, 5, 0, 62], ["+", 8, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 8, 1, 0, 2, 3, 4, 0, 5, 0, 44], ["+", 0, 7, 8, 1, 0, 2, 3, 4, 0, 21], ... | 1 | 201 |
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
//#include<cctype>
#include <climits>
#include <iostream>
#include <map>
#include <string>
#include <vector>
//#include<list>
#include <algorithm>
#include <deque>
#include <queue>
//#include<numeric>
#include <utility>
//#include<memory>
#include... | #include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
//#include<cctype>
#include <climits>
#include <iostream>
#include <map>
#include <string>
#include <vector>
//#include<list>
#include <algorithm>
#include <deque>
#include <queue>
//#include<numeric>
#include <utility>
//#include<memory>
#include... | [["-", 0, 7, 10, 43, 49, 50, 51, 16, 31, 22], ["-", 0, 7, 10, 43, 49, 50, 51, 16, 17, 72], ["-", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13], ["-", 0, 57, 64, 9, 0, 7, 10, 43, 0, 35], ["-", 0, 57, 64, 9, 0, 7, 15, 16, 31, 22], ["-", 0, 57, 64, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13], ["+", 0, 57... | 1 | 286 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.