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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02956 | C++ | Runtime Error | #include <bits/stdc++.h>
#define mod 998244353
#define M 200007
using namespace std;
struct mo {
int x, y;
} a[M];
int n, X[M], Y[M], c[M];
long long ans, pre[507] = {1};
bool Mo(mo x, mo y) { return x.y < y.y; }
void add(int x) {
while (x < M)
c[x]++, x += x & -x;
}
int query(int x) {
int res = 0;
while (x... | #include <bits/stdc++.h>
#define mod 998244353
#define M 200007
using namespace std;
struct mo {
int x, y;
} a[M];
int n, X[M], Y[M], c[M];
long long ans, pre[M] = {1};
bool Mo(mo x, mo y) { return x.y < y.y; }
void add(int x) {
while (x < M)
c[x]++, x += x & -x;
}
int query(int x) {
int res = 0;
while (x)
... | replace | 8 | 9 | 8 | 9 | 0 | |
p02956 | C++ | Runtime Error | #include <bits/stdc++.h>
/* FastIO by rsk0315 (last update: 2018/02/21 00:36) */
namespace FastIn {
static constexpr size_t BUF_SIZE = 1 << 17, INT_LEN = 24, FLT_LEN = 400;
static char buf[BUF_SIZE | 1] = {}, *pos = buf, *endbuf = nullptr;
FILE *fin;
inline bool rebuffer() {
// returns true <=> there is at least o... | #include <bits/stdc++.h>
/* FastIO by rsk0315 (last update: 2018/02/21 00:36) */
namespace FastIn {
static constexpr size_t BUF_SIZE = 1 << 17, INT_LEN = 24, FLT_LEN = 400;
static char buf[BUF_SIZE | 1] = {}, *pos = buf, *endbuf = nullptr;
FILE *fin;
inline bool rebuffer() {
// returns true <=> there is at least o... | replace | 217 | 219 | 217 | 222 | 0 | |
p02956 | C++ | Runtime Error | #include <bits/stdc++.h>
/* FastIO by rsk0315 (last update: 2018/02/21 00:36) */
namespace FastIn {
static constexpr size_t BUF_SIZE = 1 << 17, INT_LEN = 24, FLT_LEN = 400;
static char buf[BUF_SIZE | 1] = {}, *pos = buf, *endbuf = nullptr;
FILE *fin;
inline bool rebuffer() {
// returns true <=> there is at least o... | #include <bits/stdc++.h>
/* FastIO by rsk0315 (last update: 2018/02/21 00:36) */
namespace FastIn {
static constexpr size_t BUF_SIZE = 1 << 17, INT_LEN = 24, FLT_LEN = 400;
static char buf[BUF_SIZE | 1] = {}, *pos = buf, *endbuf = nullptr;
FILE *fin;
inline bool rebuffer() {
// returns true <=> there is at least o... | replace | 205 | 206 | 205 | 206 | -11 | |
p02956 | C++ | Runtime Error | #include <bits/stdc++.h>
/* FastIO by rsk0315 (last update: 2018/02/21 00:36) */
namespace FastIn {
static constexpr size_t BUF_SIZE = 1 << 17, INT_LEN = 24, FLT_LEN = 400;
static char buf[BUF_SIZE | 1] = {}, *pos = buf, *endbuf = nullptr;
FILE *fin;
inline bool rebuffer() {
// returns true <=> there is at least o... | #include <bits/stdc++.h>
/* FastIO by rsk0315 (last update: 2018/02/21 00:36) */
namespace FastIn {
static constexpr size_t BUF_SIZE = 1 << 17, INT_LEN = 24, FLT_LEN = 400;
static char buf[BUF_SIZE | 1] = {}, *pos = buf, *endbuf = nullptr;
FILE *fin;
inline bool rebuffer() {
// returns true <=> there is at least o... | replace | 144 | 145 | 144 | 145 | 0 | |
p02956 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<pi, pi> pp;
typedef pair<ll, ll> pl;
const double EPS = 1e-9;
const ll MOD = 998244353;
const int inf = 1 << 30;
const ll linf = ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<pi, pi> pp;
typedef pair<ll, ll> pl;
const double EPS = 1e-9;
const ll MOD = 998244353;
const int inf = 1 << 30;
const ll linf = ... | replace | 19 | 20 | 19 | 20 | TLE | |
p02956 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define sz(x) ((int)(x).size())
#define fi first
#define sec second
#define all(x) (x).begin(), ... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define sz(x) ((int)(x).size())
#define fi first
#define sec second
#define all(x) (x).begin(), ... | replace | 86 | 87 | 86 | 87 | 0 | |
p02956 | C++ | Runtime Error | #include <bits/stdc++.h>
// using namespace std;
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define rep(i, j, n) for (ll i = (ll)(j); i < (ll)(n); i++)
#define REP(i, j, n) for (ll i = (ll)(j); i... | #include <bits/stdc++.h>
// using namespace std;
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define rep(i, j, n) for (ll i = (ll)(j); i < (ll)(n); i++)
#define REP(i, j, n) for (ll i = (ll)(j); i... | replace | 181 | 182 | 181 | 182 | -11 | |
p02956 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using ll = long long int;
using P = std::pair<int, int>;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rag(con) std::begin(con), std::end(con)
constexpr ll mod = 998244353;
ll pow(ll x, ll m) {
ll re = 1, y = 1;
for (int i = 0; i < 60; ++i) {
if (m & y)
re = re * x... | #include <bits/stdc++.h>
using ll = long long int;
using P = std::pair<int, int>;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rag(con) std::begin(con), std::end(con)
constexpr ll mod = 998244353;
ll pow(ll x, ll m) {
ll re = 1, y = 1;
for (int i = 0; i < 60; ++i) {
if (m & y)
re = re * x... | replace | 156 | 159 | 156 | 161 | TLE | |
p02956 | 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;
template <typename T>
using Tree =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int MOD = 998244353;
int mul(int a, int b)... | #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;
template <typename T>
using Tree =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int MOD = 998244353;
int mul(int a, int b)... | replace | 26 | 29 | 26 | 27 | 0 | |
p02956 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <utility>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i <= n; ++i)
using namespace std;
typedef long long ll;
const ll MOD = 998244353;
struct mint {
ll x;
mint(ll x = 0) : x(x % MOD) {}
mint &operator+=(const mi... | #include <algorithm>
#include <iostream>
#include <map>
#include <utility>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i <= n; ++i)
using namespace std;
typedef long long ll;
const ll MOD = 998244353;
struct mint {
ll x;
mint(ll x = 0) : x(x % MOD) {}
mint &operator+=(const mi... | replace | 124 | 125 | 124 | 125 | -11 | |
p02956 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <tuple>
#include <vector>
const long long mod = 998244353;
auto max_bit(int32_t n) {
n = n & 0xFFFF0000 ? n & 0xFFFF0000 : n;
n = n & 0xFF00FF00 ? n & 0xFF00FF00 : n;
n = n & 0xF0F0F0F0 ? n ... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <tuple>
#include <vector>
const long long mod = 998244353;
auto max_bit(int32_t n) {
n = n & 0xFFFF0000 ? n & 0xFFFF0000 : n;
n = n & 0xFF00FF00 ? n & 0xFF00FF00 : n;
n = n & 0xF0F0F0F0 ? n ... | insert | 91 | 91 | 91 | 96 | 0 | |
p02957 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll A, B;
cin >> A >> B;
ll m;
m = max(A, B);
for (ll k = -m; k <= m; k++) {
ll a = abs(A - k);
ll b = abs(B - k);
if (a == b) {
cout << k << endl;
return 0;
}
}
cout << "IMPOSSIBLE" << endl;
ret... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll A, B;
cin >> A >> B;
ll m;
m = max(A, B);
for (ll k = 0; k <= m; k++) {
ll a = abs(A - k);
ll b = abs(B - k);
if (a == b) {
cout << k << endl;
return 0;
}
}
cout << "IMPOSSIBLE" << endl;
retu... | replace | 9 | 10 | 9 | 10 | TLE | |
p02957 | C++ | Time Limit Exceeded | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector... | replace | 26 | 27 | 26 | 27 | TLE | |
p02957 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
for (int i = -0; i < 100000000; i++) {
if (abs(a - i) == abs(b - i)) {
cout << i << endl;
} else {
cout << "IMPOSSIBLE" << endl;
}
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans;
if ((a + b) % 2 == 0) {
ans = (a + b) / 2;
cout << ans << endl;
} else {
cout << "IMPOSSIBLE" << endl;
}
return 0;
}
| replace | 4 | 10 | 4 | 12 | TLE | |
p02957 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define nl cout << '\n';
int main() {
int a, b, c, d;
cin >> a >> b;
if ((a + b) % ((a + b) / 2) == 2)
cout << (a + b) / 2;
else
cout << "IMPOSSIBLE";
nl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define nl cout << '\n';
int main() {
int a, b, c, d;
cin >> a >> b;
c = (a + b) / 2;
if (abs(a - c) == abs(b - c))
cout << c;
else
cout << "IMPOSSIBLE";
nl;
return 0;
}
| replace | 6 | 8 | 6 | 9 | 0 | |
p02957 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e9 + 1;
int main() {
int a, b, c;
cin >> a >> b;
for (int i = -maxn; i <= maxn; i++) {
if (abs(a - i) == abs(b - i)) {
cout << i << endl;
return 0;
}
}
cout << "IMPOSSIBLE" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e9 + 1;
int main() {
int a, b, c;
cin >> a >> b;
for (int i = 0; i <= maxn; i++) {
if (abs(a - i) == abs(b - i)) {
cout << i << endl;
return 0;
}
}
cout << "IMPOSSIBLE" << endl;
return 0;
} | replace | 6 | 7 | 6 | 7 | TLE | |
p02957 | C++ | Time Limit Exceeded |
#include <bits/stdc++.h>
using namespace std;
int main() {
long double a, b;
cin >> a >> b;
for (int i = 0; i <= max(a, b); i++) {
if (abs(a - i) == abs(b - i)) {
cout << i << endl;
return 0;
}
/* code */
}
cout << "IMPOSSIBLE" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
for (int i = 0; i <= max(a, b); i++) {
if (abs(a - i) == abs(b - i)) {
cout << i << endl;
return 0;
}
/* code */
}
cout << "IMPOSSIBLE" << endl;
return 0;
}
| replace | 5 | 6 | 5 | 6 | TLE | |
p02957 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
// for loop
#define rep(i, a, n) for (int i = (a); i < (n); ++i)
#define repe(i, a, n) for (int i = (a); i <= (n); ++i)
#define rrep(i, n, a) for (int i = (n); n > (a); --i)
#define rrepe(i, n, a) for (int i = (n); n >= (a); --i)
// abbreviati
#define PB(v) push_back(v)
#... | #include <bits/stdc++.h>
using namespace std;
// for loop
#define rep(i, a, n) for (int i = (a); i < (n); ++i)
#define repe(i, a, n) for (int i = (a); i <= (n); ++i)
#define rrep(i, n, a) for (int i = (n); n > (a); --i)
#define rrepe(i, n, a) for (int i = (n); n >= (a); --i)
// abbreviati
#define PB(v) push_back(v)
#... | replace | 51 | 52 | 51 | 52 | TLE | |
p02957 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
const ll mod = 1000000007;
const ll inf = 1e18;
#define REP(i, n) for (ll i = 0; i < (n);... | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
const ll mod = 1000000007;
const ll inf = 1e18;
#define REP(i, n) for (ll i = 0; i < (n);... | replace | 92 | 93 | 92 | 93 | TLE | |
p02957 | C++ | Runtime Error | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define forn(i, n) for (i = 0; i < n; ++i)
#define for1(i, n) for (i = 1; i <= n; ++i)
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define fill(x, b) mems... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define forn(i, n) for (i = 0; i < n; ++i)
#define for1(i, n) for (i = 1; i <= n; ++i)
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define fill(x, b) mems... | delete | 70 | 74 | 70 | 70 | 0 | |
p02957 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
#define x first
#define y second
#define pb push_back
#define speed \
ios_base::sync_with_stdio(0); \
cin.tie(0);
using namespace std;
signed main() {
#ifnd... | #include <bits/stdc++.h>
#define int long long
#define x first
#define y second
#define pb push_back
#define speed \
ios_base::sync_with_stdio(0); \
cin.tie(0);
using namespace std;
signed main() {
spe... | delete | 11 | 15 | 11 | 11 | 0 | |
p02957 | Python | Runtime Error | A, B = map(int, input())
print((A + B) // 2 if abs(A - B) % 2 == 0 else "IMPOSSIBLE")
| A, B = map(int, input().split())
print((A + B) // 2 if abs(A - B) % 2 == 0 else "IMPOSSIBLE")
| 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/p02957/Python/s947963908.py", line 1, in <module>
A, B = map(int, input())
ValueError: invalid literal for int() with base 10: ' '
|
p02957 | Python | Time Limit Exceeded | A, B = map(int, input().split())
for K in range(10**9):
if abs(A - K) == abs(B - K):
print(K)
else:
print("IMPOSSIBLE")
| A, B = map(int, input().split())
if (A + B) % 2 != 0:
print("IMPOSSIBLE")
else:
print((A + B) // 2)
| replace | 1 | 6 | 1 | 5 | TLE | |
p02957 | Python | Runtime Error | # -*- coding: utf-8 -*-
a, b = map(int, input().split())
if isinstance((a + b) / 2):
print((a + b) / 2)
else:
print("IMPOSSIBLE")
| # -*- coding: utf-8 -*-
a, b = map(int, input().split())
if (a + b) % 2 == 0:
print((a + b) // 2)
else:
print("IMPOSSIBLE")
| replace | 2 | 4 | 2 | 4 | TypeError: isinstance expected 2 arguments, got 1 | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02957/Python/s456363956.py", line 3, in <module>
if isinstance((a + b) / 2):
TypeError: isinstance expected 2 arguments, got 1
|
p02957 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b;
cin >> a >> b;
for (long long i = 0; i <= a + b; i++) {
if (abs(a - i) == abs(b - i)) {
cout << i << endl;
return 0;
}
}
cout << "IMPOSSIBLE";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b;
cin >> a >> b;
if ((a + b) % 2 == 0)
cout << (a + b) / 2;
else
cout << "IMPOSSIBLE";
return 0;
} | replace | 6 | 13 | 6 | 10 | TLE | |
p02957 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define DEBUG 1
#define fi first
#define se second
#define pb push_back
#define fore(... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define DEBUG 0
#define fi first
#define se second
#define pb push_back
#define fore(... | replace | 14 | 15 | 14 | 15 | 0 | |
p02957 | C++ | Runtime Error | #include <algorithm>
#include <cstdlib>
#include <ctype.h>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define N_MAX (100000)
#define LL_MAX_NUM (1LL... | #include <algorithm>
#include <cstdlib>
#include <ctype.h>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define N_MAX (100000)
#define LL_MAX_NUM (1LL... | replace | 26 | 27 | 26 | 27 | -11 | |
p02957 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define fori(i, a, b) for (int i = a; i <= b; i++)
#define ford(i, a, b) for (int i = a; i >= b; i--)
#define pb push_back
#define mk make_pair
#define fs first
... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define fori(i, a, b) for (int i = a; i <= b; i++)
#define ford(i, a, b) for (int i = a; i >= b; i--)
#define pb push_back
#define mk make_pair
#define fs first
... | replace | 19 | 20 | 19 | 20 | TLE | |
p02957 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
for (int i = 1; i < 2147483647; i++) {
if (abs(A - i) == abs(B - i)) {
cout << i << endl;
break;
}
if (i == 2147483646) {
cout << "IMPOSSIBLE" << endl;
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int K = (A + B);
if (K % 2 == 0) {
cout << K / 2 << endl;
} else {
cout << "IMPOSSIBLE" << endl;
}
} | replace | 8 | 16 | 8 | 14 | TLE | |
p02957 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
for (int i = 0;; i++) {
if ((A == 0) || (B == 0)) {
cout << "IMPOSSIBLE" << endl;
break;
}
if (abs(A - i) == abs(B - i)) {
cout << i << endl;
break;
}
}
} | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
for (int i = 0;; i++) {
if (abs(A - B) % 2 != 0) {
cout << "IMPOSSIBLE" << endl;
break;
}
if (abs(A - i) == abs(B - i)) {
cout << i << endl;
break;
}
}
} | replace | 9 | 10 | 9 | 10 | TLE | |
p02957 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <time.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
#define fi first
#define se second
void solve() {
ll a, b, k;
cin >> a >> b;
k = (a + b) / 2;
if (abs(a - k) == abs(b - k))
cout << k;
el... | #include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <time.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
#define fi first
#define se second
void solve() {
ll a, b, k;
cin >> a >> b;
k = (a + b) / 2;
if (abs(a - k) == abs(b - k))
cout << k;
el... | replace | 22 | 26 | 22 | 26 | 0 | |
p02957 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> A(n + 1), B(n);
for (int i = 0; i < n + 1; ++i)
cin >> A[i];
for (int i = 0; i < n; ++i)
cin >> B[i];
int count = 0, tmp = 0;
for (int i = 0; i < n; ++i) {
count += min(A[i], B[i]);
B[i] -= min(A... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if ((a + b) % 2 == 0)
cout << (a + b) / 2 << endl;
else
cout << "IMPOSSIBLE" << endl;
return 0;
} | replace | 4 | 19 | 4 | 10 | 0 | |
p02958 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main(int argc, const char *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> p;
int cnt = 0;
rep(i,... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main(int argc, const char *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> p(N);
int cnt = 0;
rep... | replace | 17 | 18 | 17 | 18 | -11 | |
p02958 | C++ | Runtime Error | /*~~~~~~~~~~~~~~~~~~~~~~
Code by gkothyari
~~~~~~~~~~~~~~~~~~~~~~~*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (a); i >= (b); i--)
#define DEBUG(x) co... | /*~~~~~~~~~~~~~~~~~~~~~~
Code by gkothyari
~~~~~~~~~~~~~~~~~~~~~~~*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (a); i >= (b); i--)
#define DEBUG(x) co... | replace | 66 | 70 | 66 | 70 | -11 | |
p02958 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0... | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0... | insert | 76 | 76 | 76 | 79 | 0 | |
p02958 | Python | Runtime Error | n = int(input())
p = list(map(int, input().split()))
sorted_p = sorted(p)
cnt = 0
for a, b in p, sorted_p:
if a != b:
cnt += 1
if cnt > 2:
print("NO")
else:
print("YES")
| n = int(input())
p = list(map(int, input().split()))
sorted_p = sorted(p)
cnt = 0
for a, b in zip(p, sorted_p):
if a != b:
cnt += 1
if cnt > 2:
print("NO")
else:
print("YES")
| replace | 4 | 5 | 4 | 5 | ValueError: too many values to unpack (expected 2) | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02958/Python/s135206060.py", line 5, in <module>
for a, b in p, sorted_p:
ValueError: too many values to unpack (expected 2)
|
p02958 | C++ | Runtime Error | #define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define rrep(i, n) for (ll i##_len = (n), i = i##_len - 1; i >= 0; --i)
#define repi(i, a, b) for (ll i = ll(a); i < ll(b); ++i)
#define printd(val) std::cout << #val " = " << val << "\n";
#include <bits/stdc++.h>
using ll = long long;
using pii = std::p... | #define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define rrep(i, n) for (ll i##_len = (n), i = i##_len - 1; i >= 0; --i)
#define repi(i, a, b) for (ll i = ll(a); i < ll(b); ++i)
#define printd(val) std::cout << #val " = " << val << "\n";
#include <bits/stdc++.h>
using ll = long long;
using pii = std::p... | insert | 31 | 31 | 31 | 32 | -11 | |
p02958 | Python | Runtime Error | N = int(input())
p = list(map(int, input().split()))
q = sorted(p)
k = 0
for i in range(1, N + 1):
if p[i] - q[i] != 0:
k += 1
if k > 2:
print("NO")
else:
print("YES")
| N = int(input())
p = list(map(int, input().split()))
q = sorted(p)
k = 0
for i in range(N):
if p[i] - q[i] != 0:
k += 1
if k > 2:
print("NO")
else:
print("YES")
| replace | 4 | 5 | 4 | 5 | IndexError: list index out of range | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02958/Python/s083953128.py", line 6, in <module>
if p[i] - q[i] != 0:
IndexError: list index out of range
|
p02958 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p.at(i);
}
vector<int> a(n);
for (int i = 1; i <= n; i++) {
a.at(i) = i;
}
int cnt = 0;
for (int i = 0; i < n; i++) {
if (a.at(i) != p.at(i))
cnt++... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p.at(i);
}
vector<int> a(n);
for (int i = 0; i < n; i++) {
a.at(i) = i + 1;
}
int cnt = 0;
for (int i = 0; i < n; i++) {
if (a.at(i) != p.at(i))
cn... | replace | 13 | 15 | 13 | 15 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 5) >= this->size() (which is 5)
|
p02958 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, j;
int k, m;
int N;
cin >> N;
vector<int> p(N);
for (i = 0; i < N; i++)
cin >> p[i];
int count = 0;
bool flag = false;
for (i = 0; i < N; i++) {
if (!(i == 0)) {
if (p[i] < p[i - 1]) {
count++;
flag = t... | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, j;
int k = 0;
int m = 0;
int N;
cin >> N;
vector<int> p(N);
for (i = 0; i < N; i++)
cin >> p[i];
int count = 0;
bool flag = false;
for (i = 0; i < N; i++) {
if (!(i == 0)) {
if (p[i] < p[i - 1]) {
count++;
... | replace | 6 | 7 | 6 | 8 | 0 | |
p02958 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int ans = 0, count = 0;
int p[N], q[N], l[2], m[2];
for (int i = 0; i < N; ++i) {
cin >> p[i];
q[i] = i + 1;
}
int j = 0;
for (int i = 0; i < N; ++i) {
if (p[i] != ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int ans = 0, count = 0;
int p[N], q[N], l[N], m[N];
for (int i = 0; i < N; ++i) {
cin >> p[i];
q[i] = i + 1;
}
int j = 0;
for (int i = 0; i < N; ++i) {
if (p[i] != ... | replace | 10 | 11 | 10 | 11 | 0 | |
p02958 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, cnt = 0;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++)
cin >> p[i];
if (is_sorted(p.begin(), p.end())) {
cout << "YES\n";
return 0;
}
for (int i = 0; i < n - 1; i++) {
for (int j ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, cnt = 0;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++)
cin >> p[i];
if (is_sorted(p.begin(), p.end())) {
cout << "YES\n";
return 0;
}
for (int i = 0; i < n - 1; i++) {
for (int j ... | replace | 16 | 17 | 16 | 17 | 0 | |
p02958 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p(N);
for (int i = 0; i < N; i++) {
cin >> p.at(i);
}
int cnt = 0;
vector<int> a(2);
for (int i = 0; i < N - 1; i++) {
if (p.at(i + 1) < p.at(i)) {
... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p(N);
for (int i = 0; i < N; i++) {
cin >> p.at(i);
}
int cnt = 0;
vector<int> a(3);
for (int i = 0; i < N - 1; i++) {
if (p.at(i + 1) < p.at(i)) {
... | replace | 15 | 16 | 15 | 16 | 0 | |
p02958 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const long long INF = 1000000000;
typedef long long ll;
#define writeln(n) cout << n << "\n";
typedef pair<int, int> P;
typedef pair<string, int> Psi;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> d(n);
for (int i = 1... | #include <bits/stdc++.h>
using namespace std;
const long long INF = 1000000000;
typedef long long ll;
#define writeln(n) cout << n << "\n";
typedef pair<int, int> P;
typedef pair<string, int> Psi;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> d(n + 1);
for (int i... | replace | 19 | 20 | 19 | 20 | 0 | |
p02958 | C++ | Runtime Error | #include <bits/stdc++.h>
#define LL long long
using namespace std;
int n;
LL a[500 + 5], b[500 + 5];
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
b[i] = a[i];
}
sort(b, b + n);
int now[2], nowl = 0;
for (int i = 0; i < n; i++)
if (a[i] != b[i]) {
if (nowl == 2) {
... | #include <bits/stdc++.h>
#define LL long long
using namespace std;
int n;
LL a[500 + 5], b[500 + 5];
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
b[i] = a[i];
}
sort(b, b + n);
int now[2], nowl = 0;
for (int i = 0; i < n; i++)
if (a[i] != b[i]) {
if (nowl == 2) {
... | replace | 21 | 22 | 21 | 24 | 0 | |
p02958 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n), q(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
q[i] = i + 1;
}
for (int i = 0; i < n; i++) {
for (int j = 0; i < n; j++) {
swap(p[i], p[j]);
if (p == q) {
cout << "YES" << endl;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n), q(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
q[i] = i + 1;
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
swap(p[i], p[j]);
if (p == q) {
cout << "YES" << endl;... | replace | 14 | 15 | 14 | 15 | 0 | |
p02958 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> number(N);
for (int i = 0; i < N; i++) {
cin >> number.at(i);
}
int count = 0;
for (int i = 0; i < N; i++) {
if (number.at(i) + 1 != number.at(i + 1)) {
count++;
}
}
if (count == 2 || count == 0... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> number(N);
for (int i = 0; i < N; i++) {
cin >> number.at(i);
}
int count = 0;
for (int i = 0; i < N; i++) {
if (number.at(i) != i + 1) {
count++;
}
}
if (count == 2 || count == 0) {
cout <<... | replace | 13 | 14 | 13 | 14 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 5) >= this->size() (which is 5)
|
p02958 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define YES cout << "YES" << endl;
#define NO cout << "NO" << endl;
#define Yes cout << "Yes" << endl;
#define No cout << "No" << endl;
#define INF INT_MAX
#define MOD 1000000007
#define PI acos(-1)
using ll = long long;
using ull = unsigned long long;
using Pii = pair<... | #include <bits/stdc++.h>
using namespace std;
#define YES cout << "YES" << endl;
#define NO cout << "NO" << endl;
#define Yes cout << "Yes" << endl;
#define No cout << "No" << endl;
#define INF INT_MAX
#define MOD 1000000007
#define PI acos(-1)
using ll = long long;
using ull = unsigned long long;
using Pii = pair<... | replace | 42 | 43 | 42 | 43 | 0 | |
p02958 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define fastio() \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define fastio() \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | delete | 28 | 32 | 28 | 28 | TLE | |
p02958 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p(N);
int cnt = 0;
for (int i = 1; i < N + 1; i++) {
cin >> p[i];
if (p[i] == i) {
cnt += 1;
}
}
if ((cnt == N) || (cnt == N - 2)) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p(N + 1);
int cnt = 0;
for (int i = 1; i < N + 1; i++) {
cin >> p[i];
if (p[i] == i) {
cnt += 1;
}
}
if ((cnt == N) || (cnt == N - 2)) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;... | replace | 5 | 6 | 5 | 6 | 0 | |
p02958 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int p, n, k;
int main() {
scanf("%d", n);
for (int i = 1; i <= n; i++) {
scanf("%d", &p);
if (p != i) {
k++;
}
}
if (k > 2) {
printf("NO");
} else
printf("YES");
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int p, n, k;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &p);
if (p != i) {
k++;
}
}
if (k > 2) {
printf("NO");
} else
printf("YES");
return 0;
}
| replace | 4 | 5 | 4 | 5 | -11 | |
p02958 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, a, n) for (int i = (n); i < (a); i++)
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
int n;
cin >> n;
vector<int> hoge(n), list;
rep(i, n) {
cin >> hoge[i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, a, n) for (int i = (n); i < (a); i++)
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
int n;
cin >> n;
vector<int> hoge(n), huga, list;
rep(i, n) cin >> hoge[i... | replace | 12 | 36 | 12 | 17 | 0 | |
p02958 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long int N, cnt = 0, a, b, tmp;
cin >> N;
int A[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int i = 0; i < N - 1; i++) {
if (A[i] > A[i + 1]) {
++cnt;
if (cnt == 1) {
a = i;
} else if (cnt == 2) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long int N, cnt = 0, a, b, tmp;
cin >> N;
int A[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int i = 0; i < N - 1; i++) {
if (A[i] > A[i + 1]) {
++cnt;
if (cnt == 1) {
a = i;
} else if (cnt == 2) {
... | insert | 25 | 25 | 25 | 39 | 0 | |
p02958 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, check = 0;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a.at(i);
}
for (int i = 0; i < N; i++) {
if (a.at(i) != i + 1) {
swap(a.at(i), a.at(a.at(i)));
break;
}
}
for (int i = 0; i < N; i++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, check = 0;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a.at(i);
}
for (int i = 0; i < N; i++) {
if (a.at(i) != i + 1) {
swap(a.at(i), a.at(a.at(i) - 1));
break;
}
}
for (int i = 0; i < N; i++)... | replace | 12 | 13 | 12 | 13 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 5) >= this->size() (which is 5)
|
p02958 | C++ | Runtime Error | // Created by code_sm
//
#include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
// typedef tree<int,null_type,less<int>,rb_tree_tag,
// tree_order_statistics_node_update> pseudo_set;
#define ll long long
#define vi vector<int>
#define si set<int>
#define... | // Created by code_sm
//
#include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
// typedef tree<int,null_type,less<int>,rb_tree_tag,
// tree_order_statistics_node_update> pseudo_set;
#define ll long long
#define vi vector<int>
#define si set<int>
#define... | replace | 62 | 66 | 62 | 63 | -11 | |
p02958 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, pi;
cin >> n;
vector<int> p;
if (n == 2) {
cout << "YES" << endl;
return 0;
}
for (int i = 0; i < n; i++) {
cin >> pi;
p.push_back(pi);
}
int first = -1, second = -1, temp;
for (int i = 1; i < n; i++) {
if (p[i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, pi;
cin >> n;
vector<int> p;
if (n == 2) {
cout << "YES" << endl;
return 0;
}
for (int i = 0; i < n; i++) {
cin >> pi;
p.push_back(pi);
}
int first = -1, second = -1, temp;
for (int i = 1; i < n; i++) {
if (p[i... | replace | 42 | 45 | 42 | 51 | 0 | |
p02958 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int(i) = 0; i < (n); i++)
int n;
vector<int> a(n, 0);
bool check() {
bool f = 1;
REP(i, n - 1) if (a.at(i) > a.at(i + 1)) f = 0;
return f;
}
void sw(int i, int j) {
int tmp = a.at(i);
a.at(i) = a.at(j);
a.at(j) = tmp;
}
int main() {
b... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int(i) = 0; i < (n); i++)
int n;
vector<int> a(50, 0);
bool check() {
bool f = 1;
REP(i, n - 1) if (a.at(i) > a.at(i + 1)) f = 0;
return f;
}
void sw(int i, int j) {
int tmp = a.at(i);
a.at(i) = a.at(j);
a.at(j) = tmp;
}
int main() {
... | replace | 4 | 5 | 4 | 5 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 0) >= this->size() (which is 0)
|
p02958 | C++ | Runtime Error | /************************************************************************
* -> Bismillahir Rahmanir Rahim <- *
* *
* *
* ... | /************************************************************************
* -> Bismillahir Rahmanir Rahim <- *
* *
* *
* ... | replace | 80 | 81 | 80 | 81 | 0 | |
p02958 | C++ | Runtime Error | #include <bits/stdc++.h>
#define SORT(a) sort(a.begin(), a.end())
#define RSORT(a) sort(a.rbegin(), a.rend())
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, start, end) for (int i = start; i < end; i++)
#define ALL(a) a.begin(), a.end()
#define MOD(a) a %= 1'000'000'007
using ll = long long;
using namespa... | #include <bits/stdc++.h>
#define SORT(a) sort(a.begin(), a.end())
#define RSORT(a) sort(a.rbegin(), a.rend())
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, start, end) for (int i = start; i < end; i++)
#define ALL(a) a.begin(), a.end()
#define MOD(a) a %= 1'000'000'007
using ll = long long;
using namespa... | replace | 70 | 71 | 70 | 72 | 0 | |
p02959 | 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;
int main() {
int n;
cin >> n;
ll ans = 0;
vector<ll> a(n + 1);
vector<ll> b(n);
rep(i, n + 1) { cin >> a[i]; }
rep(i, n) { cin >> b[i]; }
rep(i, n + 1) {
ll min1 = min(a[i], b[i]);
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
ll ans = 0;
vector<ll> a(n + 1);
vector<ll> b(n);
rep(i, n + 1) { cin >> a[i]; }
rep(i, n) { cin >> b[i]; }
rep(i, n) {
ll min1 = min(a[i], b[i]);
a[... | replace | 13 | 14 | 13 | 14 | 0 | |
p02959 | C++ | Runtime Error | //============================
// ABC135c City Savers
//
// 2019/08/13
//============================
#include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
int N;
cin >> N;
vect... | //============================
// ABC135c City Savers
//
// 2019/08/13
//============================
#include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
int N;
cin >> N;
// ... | replace | 20 | 21 | 20 | 22 | -11 | |
p02959 | C++ | Runtime Error | #include <iostream>
using namespace std;
#include <iomanip>
void _130() {
int w, h, x, y;
cin >> w >> h >> x >> y;
cout << fixed << setprecision(10);
cout << (double)w * h / 2 << " " << (2 * x == w && 2 * y == h) << endl;
}
void _131() {
long long a, b, c, d;
cin >> a >> b >> c >> d;
long long count =... | #include <iostream>
using namespace std;
#include <iomanip>
void _130() {
int w, h, x, y;
cin >> w >> h >> x >> y;
cout << fixed << setprecision(10);
cout << (double)w * h / 2 << " " << (2 * x == w && 2 * y == h) << endl;
}
void _131() {
long long a, b, c, d;
cin >> a >> b >> c >> d;
long long count =... | replace | 150 | 152 | 150 | 152 | 0 | |
p02959 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
int main() {
int n;
cin >> n;
vector<ll> a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
ll ans(0);
rep(i, n) {
if (a[i] >= b[i]) {
ans += b[i];
} else {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
int main() {
int n;
cin >> n;
vector<ll> a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
ll ans(0);
rep(i, n) {
if (a[i] >= b[i]) {
ans += b[i];
} else {
... | replace | 22 | 23 | 22 | 23 | 0 | |
p02959 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
#define rep(k, i, n) for (int i = k; i < n; ++i)
using namespace std;
typedef long long ll;
int N;
long a[10001], b[10000];
ll sum = 0;
int main(void) {
// Your code here!
cin >> N;
rep(0, i, N + 1) cin >> a[i];
rep(0, i, N) {
cin >> b[i];
if (b[i] < a[i]) {
... | #include <bits/stdc++.h>
#include <iostream>
#define rep(k, i, n) for (int i = k; i < n; ++i)
using namespace std;
typedef long long ll;
int N;
long a[100001], b[100000];
ll sum = 0;
int main(void) {
// Your code here!
cin >> N;
rep(0, i, N + 1) cin >> a[i];
rep(0, i, N) {
cin >> b[i];
if (b[i] < a[i]) ... | replace | 6 | 7 | 6 | 7 | 0 | |
p02959 | C++ | Runtime Error | #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 ... | replace | 109 | 112 | 109 | 114 | 0 | |
p02959 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int ar[1000];
int br[1000];
int main() {
ll n, ans = 0, res = 0, i;
cin >> n;
for (i = 0; i <= n; i++)
cin >> ar[i];
for (i = 0; i < n; i++)
cin >> br[i];
for (i = 0; i < n; i++) {
if (ar[i] >= br[i])
ans = ans + br[i];
e... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int ar[1000008];
int br[1000008];
int main() {
ll n, ans = 0, res = 0, i;
cin >> n;
for (i = 0; i <= n; i++)
cin >> ar[i];
for (i = 0; i < n; i++)
cin >> br[i];
for (i = 0; i < n; i++) {
if (ar[i] >= br[i])
ans = ans + br[i];... | replace | 3 | 5 | 3 | 5 | 0 | |
p02959 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(n), b(n);
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
long long total = 0;
for (int i = 0; i < n; i++) {
total += min(a[i], b[i]);
if (0 < b[i] - a[i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(n + 1), b(n);
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
long long total = 0;
for (int i = 0; i < n; i++) {
total += min(a[i], b[i]);
if (0 < b[i] -... | replace | 7 | 8 | 7 | 8 | 0 | |
p02959 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
const ll INF = 1LL << 60;
#define rep(i, a, n) for (ll i = (a); i < (n); i++)
#define debug(x) cerr << #x << ": " << x << endl;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
templ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
const ll INF = 1LL << 60;
#define rep(i, a, n) for (ll i = (a); i < (n); i++)
#define debug(x) cerr << #x << ": " << x << endl;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
templ... | replace | 24 | 25 | 24 | 25 | 0 | |
p02959 | C++ | Runtime Error | //
// main.cpp
// AC
//
// Created by makinofuya on 2019/07/08.
// Copyright © 2019 makinofuya. All rights reserved.
//
#include <algorithm>
#include <iostream>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
#define mod 1000000007
#define rep(i, n) for (int i = 1; i ... | //
// main.cpp
// AC
//
// Created by makinofuya on 2019/07/08.
// Copyright © 2019 makinofuya. All rights reserved.
//
#include <algorithm>
#include <iostream>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
#define mod 1000000007
#define rep(i, n) for (int i = 1; i ... | replace | 21 | 23 | 21 | 23 | 0 | |
p02959 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
int n = 0, a[100000], b[100000];
long long ans = 0;
int main() {
std::cin >> n;
for (int i = 0; i <= n; i++) {
std::cin >> a[i];
}
for (int i = 0; i < n; i++) {
std::cin >> b[i];
}
for (int i = 0; i < n; i++) {
if (a[i] >= b[i]) {... | #include <algorithm>
#include <iostream>
#include <string>
int n = 0, a[100001], b[100000];
long long ans = 0;
int main() {
std::cin >> n;
for (int i = 0; i <= n; i++) {
std::cin >> a[i];
}
for (int i = 0; i < n; i++) {
std::cin >> b[i];
}
for (int i = 0; i < n; i++) {
if (a[i] >= b[i]) {... | replace | 4 | 5 | 4 | 5 | 0 | |
p02959 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n, ans = 0, j;
vector<long long> a(n + 1);
vector<long long> b(n);
cin >> n;
for (int i = 0; i <= n; i++)
cin >> a[i];
for (int j = 0; j < n; j++)
cin >> b[j];
for (int i = 0; i < n; i++) {
j = min(a[i], b[i]);
ans += j;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n, ans = 0, j;
int a[100002], b[100001];
cin >> n;
for (int i = 0; i <= n; i++)
cin >> a[i];
for (int j = 0; j < n; j++)
cin >> b[j];
for (int i = 0; i < n; i++) {
j = min(a[i], b[i]);
ans += j;
a[i] -= j;
b[i] -= j;
... | replace | 4 | 6 | 4 | 5 | -6 | terminate called after throwing an instance of 'std::length_error'
what(): cannot create std::vector larger than max_size()
|
p02959 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define ar array
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n + 1), b(n);
for (int &x : a)
cin >> x;
for (int &x : b)
cin >> x;
ll ans = 0;
for (int i = 0... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define ar array
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n + 1), b(n);
for (int i = 0; i <= n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
... | replace | 15 | 19 | 15 | 19 | 0 | |
p02959 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<ll> a(n + 1), b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
ll ans = 0;
for (int i = 0; i < n + 1; i++) {
if (i != 0) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<ll> a(n + 1), b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
ll ans = 0;
for (int i = 0; i < n + 1; i++) {
if (i != 0) {
... | replace | 32 | 40 | 32 | 43 | 0 | |
p02959 | C++ | Runtime Error | #include <stdio.h>
#include <string.h>
#include <unistd.h>
#include <stdlib.h>
#include <time.h>
int main() {
long long a, b[2000], c[2000], d, e, f = 0, g = 0, i, cnt = 0;
scanf("%lld", &a);
for (i = 0; i < a + 1; i++) {
scanf("%lld", &b[i]);
g += b[i];
}
for (i = 0; i < a; i++) {
scanf("%lld", &... | #include <stdio.h>
#include <string.h>
#include <unistd.h>
#include <stdlib.h>
#include <time.h>
int main() {
long long a, b[100001], c[100000], d, e, f = 0, g = 0, i, cnt = 0;
scanf("%lld", &a);
for (i = 0; i < a + 1; i++) {
scanf("%lld", &b[i]);
g += b[i];
}
for (i = 0; i < a; i++) {
scanf("%lld... | replace | 6 | 7 | 6 | 7 | 0 | |
p02959 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[1000], b[1000], an = 0;
cin >> n;
for (int i = 0; i <= n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
for (int i = 0; i < n; i++) {
if (a[i] >= b[i])
an += b[i];
else {
an += a[i];
b[i] -= a[i... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, a[100001], b[100001], an = 0;
cin >> n;
for (int i = 0; i <= n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
for (int i = 0; i < n; i++) {
if (a[i] >= b[i])
an += b[i];
else {
an += a[i];
b... | replace | 4 | 5 | 4 | 5 | 0 | |
p02959 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define all(v) v.begin(), v.end()
#define reps(__i, a, b) for (int __i = a; i < b; i++)
#define rep(__i, n) reps(__i, 0, n)
const ll INF = (1ll << 60);
const ll MOD = (ll)1e9 + 7;
signed main() {
int n;
int a[10010], b[10010];
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define all(v) v.begin(), v.end()
#define reps(__i, a, b) for (int __i = a; i < b; i++)
#define rep(__i, n) reps(__i, 0, n)
const ll INF = (1ll << 60);
const ll MOD = (ll)1e9 + 7;
signed main() {
int n;
int a[100010], b[100010];
... | replace | 15 | 16 | 15 | 16 | 0 | |
p02959 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
for (int i = 1; i <= n + 1; i++)
cin >> a[i];
for (int i = 1; i <= n; i++)
cin >> b[i];
ll sum = 0;
for (int i = 1; i <= n; i++) {
int left = min(a[i], b[i]);
s... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
int n;
cin >> n;
int a[n], b[n + 1];
// vector<int> a(n+1), b(n);
for (int i = 1; i <= n + 1; i++)
cin >> a[i];
for (int i = 1; i <= n; i++)
cin >> b[i];
ll sum = 0;
for (int i = 1; i <= n; i++) {
int left =... | replace | 6 | 7 | 6 | 8 | 0 | |
p02959 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long a[20000 + 5];
long long b[20000 + 5];
int main() {
int n;
cin >> n;
for (int i = 0; i <= n; i++)
cin >> b[i];
long long sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (b[i] >= a[i]) {
sum = sum + a[i];
} else if ((b[i] + b[i... | #include <bits/stdc++.h>
using namespace std;
long long a[100000 + 5];
long long b[100000 + 5];
int main() {
int n;
cin >> n;
for (int i = 0; i <= n; i++)
cin >> b[i];
long long sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (b[i] >= a[i]) {
sum = sum + a[i];
} else if ((b[i] + b... | replace | 2 | 4 | 2 | 4 | 0 | |
p02959 | C++ | Runtime Error | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
#include <map> // map
#include <queue> // queue, priority_... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
#include <map> // map
#include <queue> // queue, priority_... | replace | 21 | 22 | 21 | 22 | 0 | |
p02959 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
#define OP(m) cout << m << endl;
int main() {
int N;
cin >> N;
vector<long long int> A(N), B(N);
for (... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
#define OP(m) cout << m << endl;
int main() {
int N;
cin >> N;
int A[N], B[N];
for (int i = 1; i <= N ... | replace | 12 | 13 | 12 | 13 | -6 | free(): invalid pointer
|
p02959 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
long long int n, A[10000], B[10000], c = 0;
cin >> n;
for (int i = 0; i < n + 1; ++i) {
cin >> A[i];
}
for (int i = 0; i < n; ++i) {
cin >> B[i];
}
for (int i = 0; i < n; ++i) {
long long int h = min(A[i],... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
long long int n, A[100007], B[100007], c = 0;
cin >> n;
for (int i = 0; i < n + 1; ++i) {
cin >> A[i];
}
for (int i = 0; i < n; ++i) {
cin >> B[i];
}
for (int i = 0; i < n; ++i) {
long long int h = min(A[i... | replace | 5 | 6 | 5 | 6 | 0 | |
p02959 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (int i = (s); i < (n); i++)
#define ll long long
int main() {
int n;
cin >> n;
int a[n + 1], b[n];
rep(i, 0, n + 1) cin >> a[i];
rep(i, 0, n) cin >> b[i];
ll ans = 0;
int f[n][n + 1];
f[0][0] = min(a[0], b[0]);
f[0][1] = min(a[1]... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (int i = (s); i < (n); i++)
#define ll long long
int main() {
int n;
cin >> n;
int a[n + 1], b[n];
rep(i, 0, n + 1) cin >> a[i];
rep(i, 0, n) cin >> b[i];
ll ans = 0;
rep(i, 0, n) {
int left = min(a[i], b[i]);
ans += left;
... | replace | 13 | 23 | 13 | 23 | 0 | |
p02959 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N + 1);
vector<long long> B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
int ans = 0;
for (int i = 0; i < N + 1; i++) {
if (A[i] < B[i]) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N + 1);
vector<long long> B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
long long ans = 0;
for (int i = 0; i < N; i++) {
if (A[i] < B[i]... | replace | 15 | 17 | 15 | 17 | 0 | |
p02959 | C++ | Runtime Error | // 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()
... | replace | 84 | 85 | 84 | 85 | 0 | |
p02959 | C++ | Runtime Error | #include <iostream>
using namespace std;
int n, s[100000], t[100000];
long long ans;
int main(void) {
cin >> n;
for (int i = 0; i <= n; i++)
cin >> s[i];
for (int i = 0; i < n; i++)
cin >> t[i];
for (int i = 0; i < n; i++) {
ans += min(t[i], s[i]);
t[i] = max(t[i] - s[i], 0);
ans += min(t[i]... | #include <iostream>
using namespace std;
int n, s[100001], t[100000];
long long ans;
int main(void) {
cin >> n;
for (int i = 0; i <= n; i++)
cin >> s[i];
for (int i = 0; i < n; i++)
cin >> t[i];
for (int i = 0; i < n; i++) {
ans += min(t[i], s[i]);
t[i] = max(t[i] - s[i], 0);
ans += min(t[i]... | replace | 2 | 3 | 2 | 3 | 0 | |
p02959 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0, i##_len = int(n); i < i##_len; ++i)
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
#define All(x) (x).begin(), (x).end()
#define rAll(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0, i##_len = int(n); i < i##_len; ++i)
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
#define All(x) (x).begin(), (x).end()
#define rAll(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<... | replace | 11 | 12 | 11 | 12 | 0 | |
p02959 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
int n = 0, a[100000], b[100000], ans = 0;
int main() {
std::cin >> n;
for (int i = 0; i <= n; i++) {
std::cin >> a[i];
}
for (int i = 0; i < n; i++) {
std::cin >> b[i];
}
for (int i = 0; i < n; i++) {
if (a[i] >= b[i]) {
ans... | #include <algorithm>
#include <iostream>
#include <string>
int n = 0, a[100001], b[100000];
long long ans = 0;
int main() {
std::cin >> n;
for (int i = 0; i <= n; i++) {
std::cin >> a[i];
}
for (int i = 0; i < n; i++) {
std::cin >> b[i];
}
for (int i = 0; i < n; i++) {
if (a[i] >= b[i]) {... | replace | 4 | 5 | 4 | 6 | 0 | |
p02959 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int N = 0, ans = 0, a = 0;
int A[10001] = {0};
int B[10001] = {0};
cin >> N;
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
for (int i = 0; i < N; i++) {
a = A[i];
if (A[i] - B[i] < 0) ... | #include <iostream>
using namespace std;
int main() {
long long int N = 0, ans = 0, a = 0;
long long int A[100001] = {0};
long long int B[100000] = {0};
cin >> N;
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
for (int i = 0; i < N; i++) {
a =... | replace | 3 | 6 | 3 | 6 | 0 | |
p02959 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) < (b) ? (a) : (b))
#define ABS(a) ((a) > (0) ? (a) : -(a))
#define rep(i, a, b) for (int(i) = int(a); ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) < (b) ? (a) : (b))
#define ABS(a) ((a) > (0) ? (a) : -(a))
#define rep(i, a, b) for (int(i) = int(a); ... | replace | 38 | 39 | 38 | 39 | 0 | |
p02959 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define EPS (1e-7)
#define INF (2e9)
using namespace std;
typedef long long int ll;
typedef... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define EPS (1e-7)
#define INF (2e9)
using namespace std;
typedef long long int ll;
typedef... | replace | 80 | 81 | 80 | 81 | 0 | |
p02959 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
using P = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
#define ALL(o... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
using P = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
#define ALL(o... | replace | 45 | 46 | 45 | 46 | 0 | |
p02959 | C++ | Runtime Error | #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(V) (V).begin(), (V).end()
#define SORT(V) sort(ALL(V)) // 小さい方からソート
#define REV(V) reverse(ALL(V)) // リバ... | #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(V) (V).begin(), (V).end()
#define SORT(V) sort(ALL(V)) // 小さい方からソート
#define REV(V) reverse(ALL(V)) // リバ... | replace | 69 | 70 | 69 | 70 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 2) >= this->size() (which is 2)
|
p02959 | C++ | Runtime Error | #include <iostream>
#include <deque>
#include <stdio.h>
#include <cstdio>
#include <algorithm>
#include <bits/stdc++.h>
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define sp << " "
#define nw << "\n"
#define ca "Case " << tc++ << ": "
#define IOS ... | #include <iostream>
#include <deque>
#include <stdio.h>
#include <cstdio>
#include <algorithm>
#include <bits/stdc++.h>
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define sp << " "
#define nw << "\n"
#define ca "Case " << tc++ << ": "
#define IOS ... | replace | 67 | 69 | 67 | 68 | 0 | |
p02959 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
int main() {
size_t n;
size_t cnt = 0;
std::cin >> n;
std::vector<size_t> a(n + 1), b(n);
for (auto &&e : a) {
std::cin >> e;
}
for (auto &&e : b) {
std::cin >> e;
}
for (size_t i = 0; i < n; i++) {
if (a[i]... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
int main() {
size_t n;
size_t cnt = 0;
std::cin >> n;
std::vector<size_t> a(n + 1), b(n);
for (auto &&e : a) {
std::cin >> e;
}
for (auto &&e : b) {
std::cin >> e;
}
for (size_t i = 0; i < n; i++) {
if (a[i]... | replace | 33 | 34 | 33 | 34 | 0 | |
p02959 | 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>;
int main() {
ll N;
cin >> N;
vector<ll> B(N + 1);
vector<ll> A(N);
ll ans = 0;
rep(i, N + 1) cin >> A[i];
rep(i, N) cin >> B[i];
for (int i = 0; i < N; 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>;
int main() {
ll N;
cin >> N;
vector<ll> B(N + 2);
vector<ll> A(N + 1);
ll ans = 0;
rep(i, N + 1) cin >> A[i];
rep(i, N) cin >> B[i];
for (int i = 0; i < N; i++... | replace | 9 | 11 | 9 | 11 | 0 | |
p02959 | C++ | Runtime Error | #include <algorithm>
#include <chrono>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
using lli = long long int;
using Vint = std::vector<int>;
using Vlli = std::vector<lli>... | #include <algorithm>
#include <chrono>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
using lli = long long int;
using Vint = std::vector<int>;
using Vlli = std::vector<lli>... | replace | 247 | 248 | 247 | 248 | 0 | |
p02959 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rkc \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL);
typedef long ... | #include <bits/stdc++.h>
using namespace std;
#define rkc \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL);
typedef long ... | replace | 95 | 96 | 95 | 96 | 0 | |
p02959 | C++ | Runtime Error | #include <iostream>
using namespace std;
long long N, A[10010], B[10010], z = 0;
int main() {
cin >> N;
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
for (int i = 0; i < N; i++) {
if (B[i] <= A[i]) {
z = z + B[i];
} else {
z = z ... | #include <iostream>
using namespace std;
long long N, A[100100], B[100010], z = 0;
int main() {
cin >> N;
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
for (int i = 0; i < N; i++) {
if (B[i] <= A[i]) {
z = z + B[i];
} else {
z = ... | replace | 4 | 5 | 4 | 5 | 0 | |
p02959 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<long> A(N + 1), B(N);
for (int i = 0; i < N + 1; ++i) {
cin >> A[i];
}
for (int i = 0; i < N; ++i) {
cin >> B[i];
}
B[N] = 0;
long sum = 0, nokori = 0, nokori_teki = 0, tmp = 0;
for (int i = 0; i < N +... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<long> A(N + 1), B(N + 1);
for (int i = 0; i < N + 1; ++i) {
cin >> A[i];
}
for (int i = 0; i < N; ++i) {
cin >> B[i];
}
B[N] = 0;
long sum = 0, nokori = 0, nokori_teki = 0, tmp = 0;
for (int i = 0; i <... | replace | 7 | 8 | 7 | 8 | 0 | |
p02959 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <math.h>
using namespace std;
int main(void) {
long long int n, a[20000], b;
long long int i, c, f, sum = 0;
cin >> n;
for (i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (i = 0; i < n; i++) {
cin >> b;
c = a[i] + a[i + 1];
f = c - b;
if ... | #include <algorithm>
#include <iostream>
#include <math.h>
using namespace std;
int main(void) {
long long int n, a[200000], b;
long long int i, c, f, sum = 0;
cin >> n;
for (i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (i = 0; i < n; i++) {
cin >> b;
c = a[i] + a[i + 1];
f = c - b;
if... | replace | 7 | 8 | 7 | 8 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.