problem_id stringlengths 6 6 | language stringclasses 2
values | original_status stringclasses 3
values | original_src stringlengths 19 243k | changed_src stringlengths 19 243k | change stringclasses 3
values | i1 int64 0 8.44k | i2 int64 0 8.44k | j1 int64 0 8.44k | j2 int64 0 8.44k | error stringclasses 270
values | stderr stringlengths 0 226k |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02715 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = vector<string>;
typedef pair<ll, ll> P;
#define bit(n) (1LL << (n))
// #define int long ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = vector<string>;
typedef pair<ll, ll> P;
#define bit(n) (1LL << (n))
// #define int long ... | replace | 161 | 163 | 161 | 162 | 0 | |
p02715 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long BIG = 1000000007;
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
int main() {
long N, K;
long long ans = 0;
cin ... | #include <bits/stdc++.h>
using namespace std;
long BIG = 1000000007;
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
int main() {
long N, K;
long long ans = 0;
cin ... | replace | 21 | 22 | 21 | 22 | 0 | |
p02715 | C++ | Runtime Error | /*
Arthor : Ender_zzm
E-mail zzm_ender_wiggin@outlook.com
Blog oi.ender-zzm.pro
*/
#include <bits/stdc++.h>
using namespace std;
template <class T> inline void read(T &a) {
register T x = 0, flag = 1;
register char ch;
while (!isdigit(ch = getchar()))
if (ch == '-')
flag = -1;
while (x = x * 10 + (ch... | /*
Arthor : Ender_zzm
E-mail zzm_ender_wiggin@outlook.com
Blog oi.ender-zzm.pro
*/
#include <bits/stdc++.h>
using namespace std;
template <class T> inline void read(T &a) {
register T x = 0, flag = 1;
register char ch;
while (!isdigit(ch = getchar()))
if (ch == '-')
flag = -1;
while (x = x * 10 + (ch... | replace | 45 | 46 | 45 | 46 | 0 | |
p02715 | C++ | Runtime Error | // Nihal Mittal - nihal_47
// Strike First , Strike Hard , No Mercy !!
/**⠀⠀⠀⠀⠀⠀⣀⣤⣤⣄⣀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⣠⣾⣿⣿⣿⣿⣿⣿⣿⣿⣿⣦⣀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⣰⣿⣿⣿⣿⠿⠿⣿⣿⣿⣿⣿⣿⣿⣧⢀⠀⠀⠀⠀
⠀⠀⠀⣿⣿⣿⠋⠀⠀⠀⠀⠀⠙⠀⠙⣿⣿⣿⣷⢳⢀⠀⠀⠀
⠀⠀⣠⣿⣿⣿⢸⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣿⣿⣿⣿⣿⢀
⠀⠀⣸⣿⣿⣿⠸⠀⠀⠀⠒⠒⠒⠐⠀⠀⢿⣿⣿⣿⣿⣿⠀⠀
⠀⣴⣿⣿⣿⡿⠀⠒⣋⣙⡒⢰⠀⠤⣖⠒⢾⣿⣿⣿⣿⣧⠀⠀
⢺⣿⣿⣿⣿⢀⠀⠀⠉⠉⠉⠸⠀⡇⠉⠉⠀⢿⣿⣿⣿⣄⠀⠀
⠀⠙⣿⣿⣧⢻⠀⠀⠀⠀⠀⠠⠀⠰⠀⠀⠀⣸⠸⣿⣿⠿⠰⠀
⠀⠀⠀⠹⣿⣿⣿⣷⠀⡠⠙⣲⣔⣅⢡⣰⣷⣿⣿⣿⣧⠀⠀⠀... | // Nihal Mittal - nihal_47
// Strike First , Strike Hard , No Mercy !!
/**⠀⠀⠀⠀⠀⠀⣀⣤⣤⣄⣀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⣠⣾⣿⣿⣿⣿⣿⣿⣿⣿⣿⣦⣀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⣰⣿⣿⣿⣿⠿⠿⣿⣿⣿⣿⣿⣿⣿⣧⢀⠀⠀⠀⠀
⠀⠀⠀⣿⣿⣿⠋⠀⠀⠀⠀⠀⠙⠀⠙⣿⣿⣿⣷⢳⢀⠀⠀⠀
⠀⠀⣠⣿⣿⣿⢸⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣿⣿⣿⣿⣿⢀
⠀⠀⣸⣿⣿⣿⠸⠀⠀⠀⠒⠒⠒⠐⠀⠀⢿⣿⣿⣿⣿⣿⠀⠀
⠀⣴⣿⣿⣿⡿⠀⠒⣋⣙⡒⢰⠀⠤⣖⠒⢾⣿⣿⣿⣿⣧⠀⠀
⢺⣿⣿⣿⣿⢀⠀⠀⠉⠉⠉⠸⠀⡇⠉⠉⠀⢿⣿⣿⣿⣄⠀⠀
⠀⠙⣿⣿⣧⢻⠀⠀⠀⠀⠀⠠⠀⠰⠀⠀⠀⣸⠸⣿⣿⠿⠰⠀
⠀⠀⠀⠹⣿⣿⣿⣷⠀⡠⠙⣲⣔⣅⢡⣰⣷⣿⣿⣿⣧⠀⠀⠀... | replace | 60 | 61 | 60 | 61 | 0 | |
p02715 | C++ | Runtime Error | #include "bits/stdc++.h"
#define MOD 1000000007
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; i--)
#define ALL(v) v.begin(), v.end()
#define rALL(v) v.rbegin(), v.rend()
#define FOR(i, j, k) for (ll i = j; i < k; i++)
#define DUMP(i, v) ... | #include "bits/stdc++.h"
#define MOD 1000000007
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; i--)
#define ALL(v) v.begin(), v.end()
#define rALL(v) v.rbegin(), v.rend()
#define FOR(i, j, k) for (ll i = j; i < k; i++)
#define DUMP(i, v) ... | replace | 161 | 162 | 161 | 162 | 0 | |
p02715 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const double... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const double... | replace | 43 | 44 | 43 | 44 | TLE | |
p02715 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
ll M = 1e9 + 7;
ll mypw(ll n, ll m) {
ll k = 1;
for (ll i = 0; i < m; i++) {
k = (k * (n % M)) % M;
}
return k;
}
int main() {
ll n, k, ans = 0;
cin >> n >> k;
vector<ll> c(k + 1);
for (ll i = k; i >= 1; i--) {
c[i]... | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
ll M = 1e9 + 7;
ll mypw(ll n, ll m) {
if (m <= 1)
return n;
ll k = mypw(n, m / 2) % M;
k = (k * k) % M;
if (m & 1)
return (k * n) % M;
else
return k;
}
int main() {
ll n, k, ans = 0;
cin >> n >> k;
vector<ll> c(... | replace | 6 | 11 | 6 | 14 | TLE | |
p02715 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
// #define int long long
template <class T> bool INRANGE(T x, T a, T b) { return a <= x && x <= b; }
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chma... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
// #define int long long
template <class T> bool INRANGE(T x, T a, T b) { return a <= x && x <= b; }
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chma... | replace | 58 | 59 | 58 | 59 | 0 | |
p02715 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define sz(v) ((int)(v).size())
#define all(v) ((v).begin()), ((v).end())
#define allr(v) ((v).rbegin()), ((v).rend())
#define pb push_back
#define mp make_pair
#define clr(v, d) memset(v, d, sizeof(v))
typedef long long ll;
typedef unsigned long long ull;
const double EPS = (1e-9);
using names... | #include <bits/stdc++.h>
#define sz(v) ((int)(v).size())
#define all(v) ((v).begin()), ((v).end())
#define allr(v) ((v).rbegin()), ((v).rend())
#define pb push_back
#define mp make_pair
#define clr(v, d) memset(v, d, sizeof(v))
typedef long long ll;
typedef unsigned long long ull;
const double EPS = (1e-9);
using names... | replace | 22 | 23 | 22 | 23 | TLE | |
p02715 | C++ | Runtime Error |
// #pragma GCC optimize ("-O3")
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <re... |
// #pragma GCC optimize ("-O3")
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <re... | replace | 566 | 567 | 566 | 567 | 0 | |
p02715 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int i = 0; i < (a); i++)
typedef long long ll;
const ll mod = 1000000007;
ll modpow(ll a, ll n) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
int main() {
ll N, K;... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int i = 0; i < (a); i++)
typedef long long ll;
const ll mod = 1000000007;
ll modpow(ll a, ll n) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
int main() {
ll N, K;... | replace | 21 | 22 | 21 | 22 | 0 | |
p02715 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define LLMAX (1ll << 60) - 1
#define INTMAX (1 << 30) - 1
#define MOD 1000000007
#define NMAX 1000 * 100 + 1
#define numberOfSetBits(S) \
__builtin_popcount(S) // __builtin_popcountl(S) __builtin_p... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define LLMAX (1ll << 60) - 1
#define INTMAX (1 << 30) - 1
#define MOD 1000000007
#define NMAX 1000 * 100 + 1
#define numberOfSetBits(S) \
__builtin_popcount(S) // __builtin_popcountl(S) __builtin_p... | replace | 59 | 60 | 59 | 60 | 0 | |
p02715 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
template <int mod = (int)(1e9 + 7)> struct ModInt {
int x;
constexpr ModInt() : x(0) {}
constexpr ModInt(int64_t y)
: x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
constexpr ModInt &operator+=(const ModInt &p) noexcept {
if ((x += p.x) >= mod)
x... | #include <bits/stdc++.h>
using namespace std;
template <int mod = (int)(1e9 + 7)> struct ModInt {
int x;
constexpr ModInt() : x(0) {}
constexpr ModInt(int64_t y)
: x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
constexpr ModInt &operator+=(const ModInt &p) noexcept {
if ((x += p.x) >= mod)
x... | replace | 85 | 86 | 85 | 86 | 0 | |
p02716 | C++ | Runtime Error | /* * * * * * * * * * * **
* *
* saurabh8522 *
* I will handle *
* IT. *
* *
* * * * * * * * * * * **/
#include <bits/stdc++.h>
#define mp(a, b) make_pair(a, b)
#define pb push_back
#define FastRead ... | /* * * * * * * * * * * **
* *
* saurabh8522 *
* I will handle *
* IT. *
* *
* * * * * * * * * * * **/
#include <bits/stdc++.h>
#define mp(a, b) make_pair(a, b)
#define pb push_back
#define FastRead ... | replace | 49 | 51 | 49 | 51 | 0 | |
p02716 | C++ | Runtime Error | #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 b... | #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 b... | replace | 75 | 76 | 75 | 76 | 0 | |
p02716 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i <= n; ++i)
#define ALL(x) x.b... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i <= n; ++i)
#define ALL(x) x.b... | replace | 55 | 57 | 55 | 57 | 0 | |
p02716 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MaxN = 1e5 + 10;
int N;
int A[MaxN];
void solve() {
vector<ll> prefix(N + 1);
vector<ll> f(N + 1);
prefix[1] = A[1];
for (int i = 3; i <= N; i += 2)
prefix[i] = prefix[i - 2] + A[i];
for (int n = 2; n <= N; n++) {
if (n & ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MaxN = 2e5 + 10;
int N;
int A[MaxN];
void solve() {
vector<ll> prefix(N + 1);
vector<ll> f(N + 1);
prefix[1] = A[1];
for (int i = 3; i <= N; i += 2)
prefix[i] = prefix[i - 2] + A[i];
for (int n = 2; n <= N; n++) {
if (n & ... | replace | 4 | 5 | 4 | 5 | 0 | |
p02716 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll maxs = 2e5 + 5;
const ll lmaxs = 20;
ll mod = 1e9 + 7;
ll oo = 1e15;
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll maxs = 2e5 + 5;
const ll lmaxs = 20;
ll mod = 1e9 + 7;
ll oo = 1e15;
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(... | insert | 42 | 42 | 42 | 44 | 0 | |
p02716 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int j, n, m, po, no, flag, cnt = 0, cnt2, ar[100000], x, y, i,
co[100000], sum = 0, k, ans = INT_MIN,
sum1 = 0;
string str[1000], ptr, sr, tr, rtr, rt;
vector<long lon... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int j, n, m, po, no, flag, cnt = 0, cnt2, ar[200001], x, y, i,
co[200001], sum = 0, k, ans = INT_MIN,
sum1 = 0;
string str[1000], ptr, sr, tr, rtr, rt;
vector<long lon... | replace | 3 | 5 | 3 | 5 | 0 | |
p02716 | C++ | Runtime Error | // ABC162A.cpp : コンソール アプリケーションのエントリ ポイントを定義します。
//
#include <iostream>
void solve_A() {
int N;
std::cin >> N;
int mod_1 = N % 10;
N /= 10;
int mod_2 = N % 10;
N /= 10;
int mod_3 = N % 10;
N /= 10;
if (mod_1 == 7 || mod_2 == 7 || mod_3 == 7) {
std::cout << "Yes";
} else {
std::cout << "No"... | // ABC162A.cpp : コンソール アプリケーションのエントリ ポイントを定義します。
//
#include <iostream>
void solve_A() {
int N;
std::cin >> N;
int mod_1 = N % 10;
N /= 10;
int mod_2 = N % 10;
N /= 10;
int mod_3 = N % 10;
N /= 10;
if (mod_1 == 7 || mod_2 == 7 || mod_3 == 7) {
std::cout << "Yes";
} else {
std::cout << "No"... | replace | 126 | 128 | 126 | 128 | 0 | |
p02716 | C++ | Runtime Error | #define _CRT_SECURE_NO_WARNINGS
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <func... | #define _CRT_SECURE_NO_WARNINGS
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <func... | replace | 106 | 108 | 106 | 108 | 0 | |
p02716 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
const ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
const ... | insert | 93 | 93 | 93 | 96 | TLE | |
p02716 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define LL long long
#define pii pair<int, int>
#define sd(x) scanf("%d", &x)
#define... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define LL long long
#define pii pair<int, int>
#define sd(x) scanf("%d", &x)
#define... | replace | 30 | 31 | 30 | 31 | 0 | |
p02716 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define sz(x) int(x.size())
#define pb push_back
using ll = long long;
using P = pair<int, int>;
#define chmax(x, y) x = max(x, y)
const ll MOD = 1000000007, MOD2 = 998244353, INF = 1e18;
int main() {
int n;
cin >> n;
ve... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define sz(x) int(x.size())
#define pb push_back
using ll = long long;
using P = pair<int, int>;
#define chmax(x, y) x = max(x, y)
const ll MOD = 1000000007, MOD2 = 998244353, INF = 1e18;
int main() {
int n;
cin >> n;
ve... | replace | 18 | 19 | 18 | 20 | 0 | |
p02716 | C++ | Runtime Error | #include <bits/stdc++.h>
#define enld '\n'
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("Ofast")
constexpr ll INF = 1e18;
constexpr int inf = 1e9;
co... | #include <bits/stdc++.h>
#define enld '\n'
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("Ofast")
constexpr ll INF = 1e18;
constexpr int inf = 1e9;
co... | replace | 41 | 42 | 41 | 42 | 0 | |
p02716 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define BIT(n) (1LL << (n))
#define BITF(n, i) (((n) >> (i)) & 1)
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define REPI(i, x) for (int i = 1; i <= x; i++)
#define FORI(i, m, n) for (int i = m; i <= n; i++)
#define REPR(i... | #include <bits/stdc++.h>
using namespace std;
#define BIT(n) (1LL << (n))
#define BITF(n, i) (((n) >> (i)) & 1)
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define REPI(i, x) for (int i = 1; i <= x; i++)
#define FORI(i, m, n) for (int i = m; i <= n; i++)
#define REPR(i... | insert | 137 | 137 | 137 | 139 | TLE | |
p02716 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
typedef long long ll;
const int maxn = 4e5 + 3;
const ll ninf = std::numeric_limits<ll>::min();
int n, a[maxn];
std::map<int, ll> s[maxn];
void filter(int i) {
static std::map<int, ll> t;
t.clear();
int r = (i + 1) / 2 + 5, l = r - 100;
for (auto &&[u, v] : s[i]) {
if (u < l || u ... | #include <bits/stdc++.h>
typedef long long ll;
const int maxn = 4e5 + 3;
const ll ninf = std::numeric_limits<ll>::min();
int n, a[maxn];
std::map<int, ll> s[maxn];
void filter(int i) {
static std::map<int, ll> t;
t.clear();
int r = (i + 1) / 2 + 5, l = r - 20;
for (auto &&[u, v] : s[i]) {
if (u < l || u >... | replace | 11 | 12 | 11 | 12 | TLE | |
p02716 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
typedef long long ll;
ll dp[N], sum[N], a[N];
int main() {
int n;
scanf("%lld", &n);
for (int i = 1; i <= n; i++) {
scanf("%lld", &a[i]);
if (i == 1)
sum[i] = a[i];
else
sum[i] = sum[i - 2] + a[i];
}
for (int i = 2; i... | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
typedef long long ll;
ll dp[N], sum[N], a[N];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%lld", &a[i]);
if (i == 1)
sum[i] = a[i];
else
sum[i] = sum[i - 2] + a[i];
}
for (int i = 2; i <... | replace | 7 | 8 | 7 | 8 | 0 | |
p02716 | C++ | Runtime Error | #include <bits/stdc++.h>
#define mk make_pair
#define fs first
#define sc second
using namespace std;
typedef long long ll;
typedef long double ld;
int a[100010], n;
map<int, ll> mem[100010];
ll dp(int x, int nm) {
if (nm == 1) {
if (x >= n)
return -1e17;
return a[x];
}
if (n - x < (nm - 1) * 2 + 1)... | #include <bits/stdc++.h>
#define mk make_pair
#define fs first
#define sc second
using namespace std;
typedef long long ll;
typedef long double ld;
int a[200010], n;
map<int, ll> mem[200010];
ll dp(int x, int nm) {
if (nm == 1) {
if (x >= n)
return -1e17;
return a[x];
}
if (n - x < (nm - 1) * 2 + 1)... | replace | 7 | 9 | 7 | 9 | 0 | |
p02716 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int MAX = 510000;
const int MOD = 1000000007;
signed main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int x[n][3];
x[0][0] = a[0];
x[0][1] = MOD * MOD;
x[0][2] = MOD * MOD;
x[1][0] = MOD * MOD;
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int MAX = 510000;
const int MOD = 1000000007;
signed main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
if (n == 2) {
cout << max(a[0], a[1]) << endl;
return 0;
}
int x[n][3];
x[0][0] = a[0]... | insert | 13 | 13 | 13 | 17 | 0 | |
p02716 | C++ | Runtime Error | #include <iostream>
using namespace std;
#include <algorithm>
#include <iomanip>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
int main() {
long long int n;
cin >> n;
vector<long long int> v;
for (long long int i = 0; i < n; i++) {
long long int in;
cin >> in;
... | #include <iostream>
using namespace std;
#include <algorithm>
#include <iomanip>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
int main() {
long long int n;
cin >> n;
vector<long long int> v;
for (long long int i = 0; i < n; i++) {
long long int in;
cin >> in;
... | replace | 23 | 24 | 23 | 24 | 0 | |
p02716 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const ll INF = 1001001001001001;
ll dp[200001];
ll a[200001];
ll dpall[200001];
int n;
ll init() {
rep(i, 200001) dp[i] = -INF;
rep(i, 200001) dpall[i] = -INF;
}
ll rec(i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const ll INF = 1001001001001001;
ll dp[200001];
ll a[200001];
ll dpall[200001];
int n;
ll init() {
rep(i, 200001) dp[i] = -INF;
rep(i, 200001) dpall[i] = -INF;
return 0;... | insert | 16 | 16 | 16 | 17 | 0 | |
p02716 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
#include <vector>
#define int long long int
int function(int arr[], int initial, int final, int curr, int memo[][3]) {
if (initial > final) {
if (curr > 0) {
return -100000000000000;
} else
return 0;
} else {
if (curr == 0) {
int val = arr[initi... | #include <iostream>
using namespace std;
#include <vector>
#define int long long int
int function(int arr[], int initial, int final, int curr, int memo[][3]) {
if (initial > final) {
if (curr > 0) {
return -100000000000000;
} else
return 0;
}
if (memo[initial][curr] != -1)
return memo[init... | replace | 10 | 11 | 10 | 14 | TLE | |
p02716 | C++ | Runtime Error | #include <bits/stdc++.h>
#define endl "\n"
using namespace std;
typedef long long int ll;
typedef vector<ll> vl;
typedef pair<ll, ll> PP;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
#define all(v) v.begin(), v.end()
const ll INF = 9999999999999999;
const ll MOD = 1000000007;
const ll MAX_N = 500010;
ll a, b, c, d,... | #include <bits/stdc++.h>
#define endl "\n"
using namespace std;
typedef long long int ll;
typedef vector<ll> vl;
typedef pair<ll, ll> PP;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
#define all(v) v.begin(), v.end()
const ll INF = 9999999999999999;
const ll MOD = 1000000007;
const ll MAX_N = 500010;
ll a, b, c, d,... | replace | 23 | 24 | 23 | 24 | 0 | |
p02716 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define fi first
#define sd second
#define lson (nd << 1)
#define rson (nd + nd + 1)
#define PB push_back
#define mid (l + r >> 1)
#define MP make_pair
#define SZ(x) (int)x.size()
using namespace std;
typedef long long LL;
typedef vector<int> VI;
typedef p... | #include <bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define fi first
#define sd second
#define lson (nd << 1)
#define rson (nd + nd + 1)
#define PB push_back
#define mid (l + r >> 1)
#define MP make_pair
#define SZ(x) (int)x.size()
using namespace std;
typedef long long LL;
typedef vector<int> VI;
typedef p... | replace | 72 | 73 | 72 | 73 | TLE | |
p02716 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; (i) < (n); i++)
... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; (i) < (n); i++)
... | replace | 41 | 42 | 41 | 42 | 0 | |
p02716 | C++ | Time Limit Exceeded | #define _CRT_SECURE_NO_WARNINGS
#pragma comment(linker, "/stack:512000000")
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <ccomplex>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#... | #define _CRT_SECURE_NO_WARNINGS
#pragma comment(linker, "/stack:512000000")
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <ccomplex>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#... | replace | 95 | 96 | 95 | 102 | TLE | |
p02716 | C++ | Runtime Error |
#include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define _repargs(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#de... |
#include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define _repargs(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#de... | replace | 57 | 59 | 57 | 61 | 0 | |
p02716 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const ll mod = 1000000007;
const double eps = 1e-8;
const ll INF = 1e16;
#ifdef DEBUG
#include "inc/debug.hpp"
#else
#define debug(...) 42
#endif
template <typename A, size_t ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const ll mod = 1000000007;
const double eps = 1e-8;
const ll INF = 1e16;
#ifdef DEBUG
#include "inc/debug.hpp"
#else
#define debug(...) 42
#endif
template <typename A, size_t ... | replace | 22 | 23 | 22 | 23 | 0 | |
p02716 | C++ | Runtime Error | // #include<bits\stdc++.h>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include... | // #include<bits\stdc++.h>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include... | replace | 63 | 64 | 63 | 64 | 0 | |
p02716 | Python | Runtime Error | def main():
from functools import lru_cache
inf = 2 * 10**14 + 1
N = int(input())
(*a,) = map(int, input().split())
@lru_cache(maxsize=None)
def recursion(cur, need):
"""
cur: pickableなindex
"""
if cur >= N:
if need == 0:
return 0
... | def main():
from functools import lru_cache
import sys
sys.setrecursionlimit(10**7)
inf = 2 * 10**14 + 1
N = int(input())
(*a,) = map(int, input().split())
@lru_cache(maxsize=None)
def recursion(cur, need):
"""
cur: pickableなindex
"""
if cur >= N:
... | insert | 2 | 2 | 2 | 5 | 0 | |
p02716 | C++ | Runtime Error | #include <bits/stdc++.h>
#define MOD 1000000007
#define INF 1000000000
#define LINF 1000000000000000000
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define bit(n) (1LL << (n))
using namespace std;
typedef pair<int, int> P;
typedef pair<long long, long long> LLP;
int main() {
int N;
cin >> N;
vector<long lo... | #include <bits/stdc++.h>
#define MOD 1000000007
#define INF 1000000000
#define LINF 1000000000000000000
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define bit(n) (1LL << (n))
using namespace std;
typedef pair<int, int> P;
typedef pair<long long, long long> LLP;
int main() {
int N;
cin >> N;
vector<long lo... | insert | 17 | 17 | 17 | 22 | 0 | |
p02716 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define int long long
#define pb push_back
#define ins insert
#define rs resize
#define br break;
#define cont continue;
#define vi vector<int>
#d... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define int long long
#define pb push_back
#define ins insert
#define rs resize
#define br break;
#define cont continue;
#define vi vector<int>
#d... | insert | 81 | 81 | 81 | 82 | TLE | |
p02716 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define all(v) (v).begin(), (v).end()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i < n; ++i)
#define exrep(i, a, b) for (ll i = a; i < b; i++)
#define out(x) cout << x << endl
#define EPS (1e-7)
#define gearup ... | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define all(v) (v).begin(), (v).end()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i < n; ++i)
#define exrep(i, a, b) for (ll i = a; i < b; i++)
#define out(x) cout << x << endl
#define EPS (1e-7)
#define gearup ... | replace | 62 | 63 | 62 | 63 | 0 | |
p02716 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <ctime>
using LL = long long;
using ULL = unsigned long long;
#ifdef __linux__
using LLL = __int128;
using ULLL = unsigned __int128;
#else
using LLL = long long;
using ULLL = unsigned long long;
#endif
namespace std {
void swap(int &x, int &y) { x ^= y ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <ctime>
using LL = long long;
using ULL = unsigned long long;
#ifdef __linux__
using LLL = __int128;
using ULLL = unsigned __int128;
#else
using LLL = long long;
using ULLL = unsigned long long;
#endif
namespace std {
void swap(int &x, int &y) { x ^= y ... | insert | 168 | 168 | 168 | 169 | TLE | |
p02716 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < ll(n); i++)
#define FOR(i, m, n) for (ll i = ll(m); i < ll(n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define VI vector<int>
#define VP vector<pair<int, int>>
#define VPP vector<pair<int, pair<int, int>>... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < ll(n); i++)
#define FOR(i, m, n) for (ll i = ll(m); i < ll(n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define VI vector<int>
#define VP vector<pair<int, int>>
#define VPP vector<pair<int, pair<int, int>>... | replace | 58 | 59 | 58 | 97 | 0 | |
p02716 | C++ | Runtime Error | /* ---------- STL Libraries ---------- */
// IO library
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <ios>
#include <iostream>
// algorithm library
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstring>
#include <numeric>
#include <random>
// container library
#include <arra... | /* ---------- STL Libraries ---------- */
// IO library
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <ios>
#include <iostream>
// algorithm library
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstring>
#include <numeric>
#include <random>
// container library
#include <arra... | insert | 95 | 95 | 95 | 97 | 0 | |
p02716 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#... | insert | 197 | 197 | 197 | 201 | 0 | |
p02716 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long N;
long long A[200005];
int main() {
cin >> N;
for (long long i = 0; i < N; i++) {
cin >> A[i];
}
if (N % 2 == 0) {
long long odd = 0;
long long even = 0;
for (long long i = 0; i < N; i++) {
if (i % 2 == 0) {
even += A[i];
... | #include <bits/stdc++.h>
using namespace std;
long long N;
long long A[200005];
int main() {
cin >> N;
for (long long i = 0; i < N; i++) {
cin >> A[i];
}
if (false) {
long long odd = 0;
long long even = 0;
for (long long i = 0; i < N; i++) {
if (i % 2 == 0) {
even += A[i];
... | replace | 12 | 13 | 12 | 13 | 1 | |
p02716 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define all(a) (a).begin(), (a).end()
typedef long long ll;
#define INF (ll)1e16
int main(void) {
int n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
int MAX_JUMP = (n % 2 == 0) ? 2 : 3;
vector<ll> dp[MAX_... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define all(a) (a).begin(), (a).end()
typedef long long ll;
#define INF (ll)1e16
int main(void) {
int n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
int MAX_JUMP = (n % 2 == 0) ? 2 : 3;
vector<ll> dp[MAX_... | replace | 21 | 22 | 21 | 22 | 0 | |
p02716 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long
#define AC \
ios::sync_with_stdio(false); \
cin.tie(0);
const ll N = 20005;
ll dp[N][2];
ll arr[N];
int main() {
... | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long
#define AC \
ios::sync_with_stdio(false); \
cin.tie(0);
const ll N = 2e5;
ll dp[N][2];
ll arr[N];
int main() {
A... | replace | 7 | 8 | 7 | 8 | 0 | |
p02716 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
long long dp[N][2][2];
int n;
int a[N];
int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int n;
cin >> n;
for (int i = 0; i < N; ++i) {
for (int j = 0; j < 2; ++j) {
for (int k = 0; k < 2; ++k) {
dp[i][j]... | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
long long dp[N][2][2];
int n;
int a[N];
int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int n;
cin >> n;
for (int i = 0; i < N; ++i) {
for (int j = 0; j < 2; ++j) {
for (int k = 0; k < 2; ++k) {
dp[i][j]... | replace | 4 | 5 | 4 | 5 | 0 | |
p02716 | C++ | Runtime Error | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define re register
#define pb push_back
#define fi first
#define se second
const int N = 1e5 + 10;
const int M = 1e6;
const int mod7 = 1e9 + 7;
const int mod = 1e9 + 7;
void read(int &a) {
a = 0;
int d = 1;
char ch;
w... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define re register
#define pb push_back
#define fi first
#define se second
const int N = 1e6 + 10;
const int M = 1e6;
const int mod7 = 1e9 + 7;
const int mod = 1e9 + 7;
void read(int &a) {
a = 0;
int d = 1;
char ch;
w... | replace | 8 | 9 | 8 | 9 | 0 | |
p02716 | C++ | Time Limit Exceeded | #define STOPIT
#include <bits/stdc++.h>
#define rep(i, n, m) for (int i = (n); i < (m); i++)
#define rrep(i, n, m) for (int i = (n)-1; i >= (m); i--)
using namespace std;
using ll = long long;
void debug_impl() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_impl(Head head, Tail... tail) {
ce... | #define STOPIT
#include <bits/stdc++.h>
#define rep(i, n, m) for (int i = (n); i < (m); i++)
#define rrep(i, n, m) for (int i = (n)-1; i >= (m); i--)
using namespace std;
using ll = long long;
void debug_impl() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_impl(Head head, Tail... tail) {
ce... | replace | 46 | 47 | 46 | 47 | TLE | |
p02716 | C++ | Runtime Error | #include <iostream>
using namespace std;
// https://atcoder.jp/contests/abc159/submissions/14840254
const long long OO = (long long)1e18;
const int N = 100008;
int n;
long long a[N];
long long dp[N][3];
// dp[i][j] is maximum possible sum choosing (i+1-j)/2 elements from first i
// elements. This is NOT a floor! So ... | #include <iostream>
using namespace std;
// https://atcoder.jp/contests/abc159/submissions/14840254
const long long OO = (long long)1e18;
const int N = 200008;
int n;
long long a[N];
long long dp[N][3];
// dp[i][j] is maximum possible sum choosing (i+1-j)/2 elements from first i
// elements. This is NOT a floor! So ... | replace | 6 | 7 | 6 | 7 | 0 | |
p02716 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef vector<ll> VI;
typedef vector<VI> VVI;
int main() {
int N;
cin >> N;
VI a(N);
rep(i, N) { cin >> a.at(i); }
ll maxi = max(max(a.at(0), a.at(1)), a.at(2));
ll left = a.at(0);
ll emax... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef vector<ll> VI;
typedef vector<VI> VVI;
int main() {
int N;
cin >> N;
VI a(N);
rep(i, N) { cin >> a.at(i); }
if (N == 2) {
cout << max(a.at(0), a.at(1)) << endl;
return 0;
}
... | insert | 12 | 12 | 12 | 16 | 0 | |
p02716 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using state = pair<int, int>;
int64_t dp(state stat, const vector<int64_t> &data, map<state, int64_t> *memo) {
if (memo->count(stat)) {
return memo->at(stat);
} else {
const int N = data.size();
int rem, id;
tie(rem, id) = stat;
if (rem == 0) {
... | #include <bits/stdc++.h>
using namespace std;
using state = pair<int, int>;
int64_t dp(state stat, const vector<int64_t> &data, map<state, int64_t> *memo) {
if (memo->count(stat)) {
return memo->at(stat);
} else {
const int N = data.size();
int rem, id;
tie(rem, id) = stat;
if (rem == 0) {
... | delete | 14 | 21 | 14 | 14 | TLE | |
p02716 | C++ | Runtime Error | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#def... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#def... | replace | 39 | 40 | 39 | 40 | 0 | |
p02716 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define mp make_pair
#define sqr(x) (x) * (x)
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
const int maxn = 200007;
const ll inf = 0x3f3f3f3f3f3f3f3f;
ll read() {
ll x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1... | #include <bits/stdc++.h>
#define mp make_pair
#define sqr(x) (x) * (x)
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
const int maxn = 200007;
const ll inf = 0x3f3f3f3f3f3f3f3f;
ll read() {
ll x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1... | replace | 23 | 24 | 23 | 24 | TLE | |
p02716 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 100 * 1000 + 20;
ll n, sum[N], dp[N], a[N];
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
sum[i] = a[i] + (i > 1 ? sum[i - 2] : 0);
for (int i = 1; i < n; i++) {
if (i %... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2 * 100 * 1000 + 20;
ll n, sum[N], dp[N], a[N];
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
sum[i] = a[i] + (i > 1 ? sum[i - 2] : 0);
for (int i = 1; i < n; i++) {
if ... | replace | 5 | 6 | 5 | 6 | 0 | |
p02716 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const long long INF = 1e18;
// long long dp[200005][4];
long long dp[100][4];
// dp[i][j] : i個目まで見てj個余分なｘ（バツ）を入れたときのMAX
int main() {
int N;
cin >> N;
vector<long long> a(N);
for (int i = 0; i < N; ++i)
cin >> a[i];
// K:... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const long long INF = 1e18;
long long dp[200005][4];
// long long dp[100][4];
// dp[i][j] : i個目まで見てj個余分なｘ（バツ）を入れたときのMAX
int main() {
int N;
cin >> N;
vector<long long> a(N);
for (int i = 0; i < N; ++i)
cin >> a[i];
// K:... | replace | 8 | 10 | 8 | 10 | 0 | |
p02716 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cout << #x "=... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cout << #x "=... | replace | 21 | 22 | 21 | 22 | 0 | |
p02716 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N = 1e5 + 5, inf = 1e17;
ll a[N], prfx[N], dp[N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin >> n;
for (ll i = 1; i <= n; i++)
cin >> a[i];
prfx[1] = a[1];
for (ll i = 3; i <= n; i += 2)
prfx[... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N = 2e5 + 5;
ll a[N], prfx[N], dp[N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin >> n;
for (ll i = 1; i <= n; i++)
cin >> a[i];
prfx[1] = a[1];
for (ll i = 3; i <= n; i += 2)
prfx[i] = prfx[i ... | replace | 3 | 4 | 3 | 4 | 0 | |
p02717 | C++ | Runtime Error | // Author - Sumit
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#pragma GCC optimize("O3")
#pragma GCC target("avx")
#define ll long long
#define int ll
#define ps push
#define pb emplace_back
#define INF 10000000000000LL
#define MOD 1000000007
#de... | // Author - Sumit
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#pragma GCC optimize("O3")
#pragma GCC target("avx")
#define ll long long
#define int ll
#define ps push
#define pb emplace_back
#define INF 10000000000000LL
#define MOD 1000000007
#de... | replace | 73 | 78 | 73 | 78 | 0 | |
p02717 | C++ | Runtime Error |
#include <bits/stdc++.h>
using namespace std;
#define BeatMeScanf \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define tc(... |
#include <bits/stdc++.h>
using namespace std;
#define BeatMeScanf \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define tc(... | delete | 27 | 31 | 27 | 27 | 0 | |
p02717 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int x, y, z;
cin >> x >> y >> z;
cout << z << " " << x << " " << y << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int x, y, z;
cin >> x >> y >> z;
cout << z << " " << x << " " << y << endl;
return 0;
}
| delete | 6 | 10 | 6 | 6 | 0 | |
p02717 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
constexpr ll M = 1e9 + 7;
inline ll sum_1(const ll n) { return ((n * (n + 1)) / 2) % M; }
inline ll sum_2(const ll n) { return ((n * (n + 1) * (2 * n + 1)) / 6) % M; }
inline ll sum_3(const ll n) {
return (((n * (n + 1)) / 2) % M * ((n * (n + 1)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
constexpr ll M = 1e9 + 7;
inline ll sum_1(const ll n) { return ((n * (n + 1)) / 2) % M; }
inline ll sum_2(const ll n) { return ((n * (n + 1) * (2 * n + 1)) / 6) % M; }
inline ll sum_3(const ll n) {
return (((n * (n + 1)) / 2) % M * ((n * (n + 1)... | delete | 32 | 36 | 32 | 32 | 0 | |
p02717 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
#define MX 35
#define MOD 1'000'000'007
#define set(N, pos) (N = (1LL << (pos)))
#define clear(N, pos) (N = (~(1LL << (pos))))
#define is_set(N, pos) (N & (1LL << (pos)))
#define all(v) (v).begin()... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
#define MX 35
#define MOD 1'000'000'007
#define set(N, pos) (N = (1LL << (pos)))
#define clear(N, pos) (N = (~(1LL << (pos))))
#define is_set(N, pos) (N & (1LL << (pos)))
#define all(v) (v).begin()... | replace | 44 | 45 | 44 | 45 | 0 | |
p02717 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long int
#define vi vector<int>
#define vl vector<long long>
#define fin(ar, k, n) \
for (int i = k; i < n; i++) \
cin >> ar[i]
#define fout(ar, k, n) ... | #include <bits/stdc++.h>
#define ll long long int
#define vi vector<int>
#define vl vector<long long>
#define fin(ar, k, n) \
for (int i = k; i < n; i++) \
cin >> ar[i]
#define fout(ar, k, n) ... | replace | 32 | 35 | 32 | 33 | 0 | |
p02717 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define ull unsigned long long int
#define ll long long int
#define ld dou... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define ull unsigned long long int
#define ll long long int
#define ld dou... | replace | 28 | 32 | 28 | 29 | 0 | |
p02717 | Python | Runtime Error | A, B, C = [int(i) for i in input().split()]
A, B, C = B, A, C
A, B, C = C, B, A
print(f"{A} {B} {C}")
| A, B, C = [int(i) for i in input().split()]
A, B, C = B, A, C
A, B, C = C, B, A
print("%s %s %s" % (A, B, C))
| replace | 5 | 6 | 5 | 6 | 0 | |
p02717 | Python | Runtime Error | #!/usr/bin/env python3
a = int(input())
a, b = map(int, input().split())
a = list(str(input()))
| #!/usr/bin/env python3
a, b, c = map(int, input().split())
print("{} {} {}".format(c, a, b))
| replace | 2 | 5 | 2 | 4 | ValueError: invalid literal for int() with base 10: '1 2 3' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02717/Python/s892793306.py", line 3, in <module>
a = int(input())
ValueError: invalid literal for int() with base 10: '1 2 3'
|
p02717 | Python | Runtime Error | x, y, z = map(int, input())
print(z, x, y)
| x, y, z = map(int, input().split())
print(z, x, y)
| replace | 0 | 1 | 0 | 1 | ValueError: invalid literal for int() with base 10: ' ' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02717/Python/s498360594.py", line 1, in <module>
x, y, z = map(int, input())
ValueError: invalid literal for int() with base 10: ' '
|
p02717 | Python | Runtime Error | X, Y, Z = map(int, input())
print(Z, X, Y)
| X, Y, Z = map(int, input().split())
print(Z, X, Y)
| replace | 0 | 1 | 0 | 1 | ValueError: invalid literal for int() with base 10: ' ' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02717/Python/s623686087.py", line 1, in <module>
X, Y, Z = map(int, input())
ValueError: invalid literal for int() with base 10: ' '
|
p02717 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ff first
#define ss second
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
#ifndef ONLINE_JUDGE
freopen("inp.txt", "r", stdin);
freopen("outp.txt", "w", stdout);
#endif
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(N... | #include <bits/stdc++.h>
#define ff first
#define ss second
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll a, b, c;
cin >> a >> b >> c;
cout << c << " " << a << " " << b;
return 0;
}
| delete | 8 | 12 | 8 | 8 | 0 | |
p02717 | Python | Runtime Error | x, y, z = map(int, input().split())
print(z + " " + x + " " + y)
| x, y, z = map(str, input().split())
print(z + " " + x + " " + y)
| replace | 0 | 1 | 0 | 1 | TypeError: unsupported operand type(s) for +: 'int' and 'str' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02717/Python/s693185745.py", line 2, in <module>
print(z + " " + x + " " + y)
TypeError: unsupported operand type(s) for +: 'int' and 'str'
|
p02717 | Python | Runtime Error | X, Y, Z = map(int, input().split())
print(f"{Z} {X} {Y}")
| X, Y, Z = map(int, input().split())
print(Z, X, Y)
| replace | 1 | 2 | 1 | 2 | 0 | |
p02717 | Python | Runtime Error | XYZ = map(int, input().split())
print(XYZ[2], XYZ[1], XYZ[0])
| XYZ = input().split()
print(XYZ[2], XYZ[0], XYZ[1])
| replace | 0 | 2 | 0 | 2 | TypeError: 'map' object is not subscriptable | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02717/Python/s285964975.py", line 2, in <module>
print(XYZ[2], XYZ[1], XYZ[0])
TypeError: 'map' object is not subscriptable
|
p02717 | Python | Runtime Error | import sys
if __name__ == "__main__":
print(f"{sys.argv[-1]} {sys.argv[1]} {sys.argv[2]}")
| import sys
if __name__ == "__main__":
a, b, c = map(int, input().split())
print(c, a, b)
| replace | 4 | 5 | 4 | 6 | IndexError: list index out of range | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02717/Python/s097242719.py", line 5, in <module>
print(f"{sys.argv[-1]} {sys.argv[1]} {sys.argv[2]}")
IndexError: list index out of range
|
p02717 | Python | Runtime Error | a = int(input())
b = int(input())
c = int(input())
print(c, a, b)
| a, b, c = map(int, input().split())
print(c, a, b)
| replace | 0 | 3 | 0 | 1 | ValueError: invalid literal for int() with base 10: '1 2 3' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02717/Python/s384192178.py", line 1, in <module>
a = int(input())
ValueError: invalid literal for int() with base 10: '1 2 3'
|
p02717 | Python | Runtime Error | x, y, z = input().split()
print(f"{z} {x} {y}")
| x, y, z = input().split()
print(z, x, y)
| replace | 1 | 2 | 1 | 2 | 0 | |
p02717 | Python | Runtime Error | x, y, z = map(int, input().split())
print(f"{z} {x} {y}")
| x, y, z = map(int, input().split())
print(z, end=" ")
print(x, end=" ")
print(y)
| replace | 1 | 2 | 1 | 4 | 0 | |
p02717 | C++ | Runtime Error | #include <stdio.h>
#include <stdlib.h>
int main(int argc, char *argv[]) {
int a = atoi(argv[1]);
int b = atoi(argv[2]);
int c = atoi(argv[3]);
printf("%d\n ", c);
printf("%d\n ", a);
printf("%d\n ", b);
return 0;
}
| #include <stdio.h>
#include <stdlib.h>
int main() {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
printf("%d %d %d\n", c, a, b);
return 0;
} | replace | 3 | 10 | 3 | 7 | -11 | |
p02717 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(v) ((v).begin()), ((v).end())
#define clr(v, val) memset(v, val, sizeof v)
#define watch(x) cout << (#x) << " is " << (x) << endl
#define endl "\n"
void Run() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUD... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(v) ((v).begin()), ((v).end())
#define clr(v, val) memset(v, val, sizeof v)
#define watch(x) cout << (#x) << " is " << (x) << endl
#define endl "\n"
void Run() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUD... | replace | 18 | 19 | 18 | 19 | 0 | |
p02717 | Python | Runtime Error | import sys
a, b, c = map(int, sys.argv[1:])
b2 = a
c2 = b
a2 = c
print(a2, b2, c2)
| in_ = input()
a, b, c = map(int, in_.split())
b2 = a
c2 = b
a2 = c
print(a2, b2, c2)
| replace | 0 | 3 | 0 | 2 | ValueError: not enough values to unpack (expected 3, got 0) | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02717/Python/s419762460.py", line 2, in <module>
a, b, c = map(int, sys.argv[1:])
ValueError: not enough values to unpack (expected 3, got 0)
|
p02717 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define F first
#define S second
// #define ONLINE_JUDGE 1
using namespace std;
const int mod = 1e9 + 7;
void solve() {
int x, y, z;
cin >> x >> y >> z;
cout << z << " " << x << " " << y << "\n";
}
int main() {
#ifndef ONLINE_JUDGE
freop... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define F first
#define S second
#define ONLINE_JUDGE 1
using namespace std;
const int mod = 1e9 + 7;
void solve() {
int x, y, z;
cin >> x >> y >> z;
cout << z << " " << x << " " << y << "\n";
}
int main() {
#ifndef ONLINE_JUDGE
freopen(... | replace | 7 | 8 | 7 | 8 | 0 | |
p02717 | C++ | Runtime Error | /*
--> WHEN IT'S OBVIOUS THAT THE GOAL CANNOT BE REACHED,
DON'T ADJUST THE GOALS,
ADJUST THE ACTION STEPS.
--> THE WAY YOU CONQUER SELF-DOUBT IS BY DOING THINGS THAT MAKE YOU
UNCOMFORTABLE.
--> IT IS DURING OUR DARKEST MOMENTS WE MUST FOCUS TO SEE LIGHT.
*/
#include <algorithm>
#include <climits>
#in... | /*
--> WHEN IT'S OBVIOUS THAT THE GOAL CANNOT BE REACHED,
DON'T ADJUST THE GOALS,
ADJUST THE ACTION STEPS.
--> THE WAY YOU CONQUER SELF-DOUBT IS BY DOING THINGS THAT MAKE YOU
UNCOMFORTABLE.
--> IT IS DURING OUR DARKEST MOMENTS WE MUST FOCUS TO SEE LIGHT.
*/
#include <algorithm>
#include <climits>
#in... | replace | 86 | 87 | 86 | 87 | 0 | |
p02717 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <exception>
#include <unordered_map>
#include <unordered_set>
using namespace std;
typedef long long ll;
typedef long long ull;
typedef pair<int, int> ii;
#define all(v) ((v).begin()), ((v).end())
#define sz(v) ((int)((v).size()))
#define endl "\n"
#define fx(n) fixed << setprecisio... | #include <bits/stdc++.h>
#include <exception>
#include <unordered_map>
#include <unordered_set>
using namespace std;
typedef long long ll;
typedef long long ull;
typedef pair<int, int> ii;
#define all(v) ((v).begin()), ((v).end())
#define sz(v) ((int)((v).size()))
#define endl "\n"
#define fx(n) fixed << setprecisio... | delete | 21 | 29 | 21 | 21 | 0 | |
p02717 | C++ | Runtime Error | #include <bits/stdc++.h>
#define maxn 10005
#define INF 0x3f3f3f3f
#define mod 1000000007
typedef long long ll;
using namespace std;
void slove() {
int a, b, c;
cin >> a >> b >> c;
swap(a, b);
swap(a, c);
cout << a << ' ' << b << ' ' << c << '\n';
}
int main() {
ios_base::sync_with_stdio(false);
cin.ti... | #include <bits/stdc++.h>
#define maxn 10005
#define INF 0x3f3f3f3f
#define mod 1000000007
typedef long long ll;
using namespace std;
void slove() {
int a, b, c;
cin >> a >> b >> c;
swap(a, b);
swap(a, c);
cout << a << ' ' << b << ' ' << c << '\n';
}
int main() {
ios_base::sync_with_stdio(false);
cin.ti... | replace | 19 | 24 | 19 | 20 | 0 | |
p02717 | C++ | Runtime Error | #include <bits/stdc++.h>
#define TASK "task"
using namespace std;
void rwFile() {
freopen(TASK ".in", "r", stdin);
freopen(TASK ".out", "w", stdout);
}
void solveA() {
int x, y, z;
cin >> x >> y >> z;
cout << z << ' ' << x << ' ' << y;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(nullptr);
c... | #include <bits/stdc++.h>
#define TASK "task"
using namespace std;
void rwFile() {
freopen(TASK ".in", "r", stdin);
freopen(TASK ".out", "w", stdout);
}
void solveA() {
int x, y, z;
cin >> x >> y >> z;
cout << z << ' ' << x << ' ' << y;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(nullptr);
c... | replace | 20 | 21 | 20 | 21 | 0 | |
p02717 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef double db;
const ll mod = 1e9 + 7;
const db eps = 1e-9;
#define mp make_pair
#define pb push_back
#define endl "\n"
#define deb(x) cout << #x << " " << x << endl
int main() {
ios_base ::sync_with_stdio(fals... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef double db;
const ll mod = 1e9 + 7;
const db eps = 1e-9;
#define mp make_pair
#define pb push_back
#define endl "\n"
#define deb(x) cout << #x << " " << x << endl
int main() {
ios_base ::sync_with_stdio(fals... | delete | 20 | 26 | 20 | 20 | 0 | |
p02717 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define MP make_pair
#define PB push_back
#define F first
#define S second
#define MOD 100000000000000000
#define UB upper_bound
#define LB lower_bound
#define fast \
ios_base::sync_with_stdio(0); ... | #include <bits/stdc++.h>
#define ll long long
#define MP make_pair
#define PB push_back
#define F first
#define S second
#define MOD 100000000000000000
#define UB upper_bound
#define LB lower_bound
#define fast \
ios_base::sync_with_stdio(0); ... | replace | 18 | 22 | 18 | 22 | 0 | |
p02717 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false), cin.tie(NULL)
#define loop(var, init, condition) for (int var = init; var < condition; var++)
#define rloop(var, init, condition) for (int var = init; var > condition; var--)
#define mod 1000000007
#define qmod 998244353
#defin... | #include <bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false), cin.tie(NULL)
#define loop(var, init, condition) for (int var = init; var < condition; var++)
#define rloop(var, init, condition) for (int var = init; var > condition; var--)
#define mod 1000000007
#define qmod 998244353
#defin... | replace | 49 | 53 | 49 | 53 | 0 | |
p02717 | C++ | Runtime Error | /*
KUNAL RAUT (ZUKONIT14) :- "DO WHAT YOU LIKE!"
-PICT,PUNE! :)
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int long long
#define ld long double
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define mod 1000000007
#define mod9 1000000009
#define pi 3.... | /*
KUNAL RAUT (ZUKONIT14) :- "DO WHAT YOU LIKE!"
-PICT,PUNE! :)
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int long long
#define ld long double
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define mod 1000000007
#define mod9 1000000009
#define pi 3.... | replace | 93 | 96 | 93 | 94 | 0 | |
p02717 | C++ | Runtime Error | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define ull unsigned long long
#define rep(n) for (ll i = 0; i < n; i++)
#define rep2(n) for (ll j = 0; j < n; ++j)
#define repd(n) for (ll i = ... | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define ull unsigned long long
#define rep(n) for (ll i = 0; i < n; i++)
#define rep2(n) for (ll j = 0; j < n; ++j)
#define repd(n) for (ll i = ... | delete | 34 | 38 | 34 | 34 | 0 | |
p02717 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
/*#ifndef ONLINE_JUDGE
#include <lol.h>
#endif*/
#define mp make_pair
#define pb push_back
#define pf push_front
#define sz(a) (int)((a).size())
#define fr(i, n) for (ll i = 0; i < n; i++)
#define fr1(i, n) for (ll i = 1; i <= n; i++)
#define frk(i, k, n) for (ll i = k... | #include <bits/stdc++.h>
using namespace std;
/*#ifndef ONLINE_JUDGE
#include <lol.h>
#endif*/
#define mp make_pair
#define pb push_back
#define pf push_front
#define sz(a) (int)((a).size())
#define fr(i, n) for (ll i = 0; i < n; i++)
#define fr1(i, n) for (ll i = 1; i <= n; i++)
#define frk(i, k, n) for (ll i = k... | delete | 114 | 118 | 114 | 114 | 0 | |
p02717 | C++ | Runtime Error |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define F first
#define S second
#define ppp pair<ll, pair<ll, ll>>
#define pp pair<ll, ll>
#define all(x) (x).begin(), (x).end()
#define pi 3.14159265358
#define MOD 998244353
int main() {
#ifndef ONLINE_JUDGE
freopen("input... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define F first
#define S second
#define ppp pair<ll, pair<ll, ll>>
#define pp pair<ll, ll>
#define all(x) (x).begin(), (x).end()
#define pi 3.14159265358
#define MOD 998244353
int main() {
// #ifndef ONLINE_JUDGE
// freope... | replace | 16 | 21 | 16 | 21 | 0 | |
p02717 | C++ | Time Limit Exceeded |
/*
@・ω・@ <だれだろうね
*/
/*****/
#include <algorithm>
#include <array>
#include <cmath>
#include <fstream>
#include <iomanip> //cout << fixed << setprecision(桁数);
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <stdexcept>
#include <string>
#include <vector>
// #define int long long... |
/*
@・ω・@ <だれだろうね
*/
/*****/
#include <algorithm>
#include <array>
#include <cmath>
#include <fstream>
#include <iomanip> //cout << fixed << setprecision(桁数);
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <stdexcept>
#include <string>
#include <vector>
// #define int long long... | replace | 140 | 145 | 140 | 146 | TLE | |
p02717 | C++ | Runtime Error | #include <bits/stdc++.h>
// cervello|Phoenix
using namespace std;
#define ll long long int
#define eb emplace_back
#define mk make_pair
#define pr pair<int, int>
#define all(x) x.begin(), x.end()
#define mod 1000000007
int main() {
ios_base::sync_with_stdio(false);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", st... | #include <bits/stdc++.h>
// cervello|Phoenix
using namespace std;
#define ll long long int
#define eb emplace_back
#define mk make_pair
#define pr pair<int, int>
#define all(x) x.begin(), x.end()
#define mod 1000000007
int main() {
ios_base::sync_with_stdio(false);
// #ifndef ONLINE_JUDGE
// freopen("input.txt... | replace | 12 | 16 | 12 | 16 | 0 | |
p02717 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define int long long
#define vi vector<int>
#define vec(x) vector<x>
#define matrix vector<vector<int>>
#define pii pair<int, int>
#define rep(i, s, e) for (int i = ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define int long long
#define vi vector<int>
#define vec(x) vector<x>
#define matrix vector<vector<int>>
#define pii pair<int, int>
#define rep(i, s, e) for (int i = ... | replace | 59 | 63 | 59 | 61 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.