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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02928 | C++ | Runtime Error | // atcoder 20190824 B
#include <bits/stdc++.h>
#define N 2005
using namespace std;
const long long mod = 1e9 + 7;
long long n, k;
long long c[N];
long long a[N], b[N];
long long num[N];
long long ans;
long long calc(int x) {
long long res = 0;
for (int i = n; i > x; --i)
if (a[i] < a[x])
++res;
retu... | // atcoder 20190824 B
#include <bits/stdc++.h>
#define N 2005
using namespace std;
const long long mod = 1e9 + 7;
long long n, k;
long long c[N];
long long a[N], b[N];
long long num[N];
long long ans;
long long calc(int x) {
long long res = 0;
for (int i = n; i > x; --i)
if (a[i] < a[x])
++res;
retu... | delete | 23 | 26 | 23 | 23 | 0 | |
p02928 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;
int read() {
int x = 0;
bool f = 0;
char c = getchar();
while (c < '0' || c > '9')
f |= (c == '-'), c = getchar();
while (c >= '0' && c <= '9')
x = x * 10 + (c ^ 48), c = getchar();
return f ? -x : x;
}... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;
int read() {
int x = 0;
bool f = 0;
char c = getchar();
while (c < '0' || c > '9')
f |= (c == '-'), c = getchar();
while (c >= '0' && c <= '9')
x = x * 10 + (c ^ 48), c = getchar();
return f ? -x : x;
}... | replace | 17 | 18 | 17 | 18 | 0 | |
p02928 | C++ | Time Limit Exceeded | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int main() {
ll mod = 10000... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int main() {
ll mod = 10000... | replace | 37 | 38 | 37 | 38 | TLE | |
p02928 | C++ | Runtime Error | #define _CRT_SECURE_NO_WARNINGS
using namespace std;
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <v... | #define _CRT_SECURE_NO_WARNINGS
using namespace std;
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <v... | delete | 24 | 26 | 24 | 24 | TLE | |
p02928 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long ul;
typedef unsigned long long ull;
typedef long long ll;
typedef vector<ll> vint;
typedef vector<vector<ll>> vvint;
typedef vector<vector<vector<ll>>> vvvint;
typedef vector<string> vstring;
typedef vector<vector<string>> vvstring;
typedef vector<cha... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long ul;
typedef unsigned long long ull;
typedef long long ll;
typedef vector<ll> vint;
typedef vector<vector<ll>> vvint;
typedef vector<vector<vector<ll>>> vvvint;
typedef vector<string> vstring;
typedef vector<vector<string>> vvstring;
typedef vector<cha... | replace | 312 | 313 | 312 | 313 | 0 | |
p02928 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#in... | #include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#in... | replace | 58 | 62 | 58 | 59 | -6 | ded7df7d-0caa-4d1f-ba12-8f9713fe7f43.out: /home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02928/C++/s227770849.cpp:57: llm llm::operator*(llm): Assertion `0' failed.
|
p02928 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
typedef long long ll;
const int MAXN = 2000;
const ll mod = 1e9 + 7;
int a[MAXN + 5], cnt1[MAXN + 5], cnt2[MAXN + 5];
ll n, k, ans;
int main() {
scanf("%lld%lld", &n, &k);
for (int i = 1; i <= n; i++)... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
typedef long long ll;
const int MAXN = 2000;
const ll mod = 1e9 + 7;
int a[MAXN + 5], cnt1[MAXN + 5], cnt2[MAXN + 5];
ll n, k, ans;
int main() {
scanf("%lld%lld", &n, &k);
for (int i = 1; i <= n; i++)... | replace | 23 | 27 | 23 | 26 | TLE | |
p02928 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#define ll long long
using namespace std;
#define mod 1000000007
int n, m, ans, a[1005], a1[1005], a2[1005];
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (int i = 1; i <= n; i++) {
for (int j = i + 1; j <= n; j++)
a1[... | #include <algorithm>
#include <cstdio>
#define ll long long
using namespace std;
#define mod 1000000007
int n, m, ans, a[2005], a1[2005], a2[2005];
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (int i = 1; i <= n; i++) {
for (int j = i + 1; j <= n; j++)
a1[... | replace | 5 | 6 | 5 | 6 | 0 | |
p02928 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; i--)
#define ir... | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; i--)
#define ir... | replace | 101 | 102 | 101 | 103 | TLE | |
p02928 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <str... | #include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <str... | delete | 144 | 145 | 144 | 144 | 0 | |
p02928 | C++ | Runtime Error | // atcoder 20190824 B
#include <bits/stdc++.h>
#define N 2005
using namespace std;
const long long mod = 1e9 + 7;
long long n, k;
long long c[N];
long long a[N], b[N];
long long num[N];
long long ans;
long long calc(int x) {
long long res = 0;
for (int i = n; i > x; --i)
if (a[i] < a[x])
++res;
retu... | // atcoder 20190824 B
#include <bits/stdc++.h>
#define N 2005
using namespace std;
const long long mod = 1e9 + 7;
long long n, k;
long long c[N];
long long a[N], b[N];
long long num[N];
long long ans;
long long calc(int x) {
long long res = 0;
for (int i = n; i > x; --i)
if (a[i] < a[x])
++res;
retu... | delete | 23 | 25 | 23 | 23 | 0 | |
p02928 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, k) for (i = 0; i < k; i... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, k) for (i = 0; i < k; i... | replace | 41 | 42 | 41 | 42 | TLE | |
p02928 | C++ | Runtime Error | #include <bits/stdc++.h>
#define GET_MACRO(_1, _2, _3, _4, _5, _6, _7, _8, NAME, ...) NAME
#define pr(...) \
cerr << GET_MACRO(__VA_ARGS__, pr8, pr7, pr6, pr5, pr4, pr3, pr2, \
pr1)(__VA_ARGS__) ... | #include <bits/stdc++.h>
#define GET_MACRO(_1, _2, _3, _4, _5, _6, _7, _8, NAME, ...) NAME
#define pr(...) \
cerr << GET_MACRO(__VA_ARGS__, pr8, pr7, pr6, pr5, pr4, pr3, pr2, \
pr1)(__VA_ARGS__) ... | replace | 238 | 240 | 238 | 240 | 0 | |
p02928 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
template <typename T> class BIT {
// bit[x]
// manage range of bit[x] is (x & -x)
//
public:
static const int n = 10000;
T bit[n] = {};
void add(int a, T w) {
for (int x = a; x <= n; x += x & -x) {
bit[x] += w;
}
}
T sum(int a) {
T ret = 0... | #include <bits/stdc++.h>
using namespace std;
template <typename T> class BIT {
// bit[x]
// manage range of bit[x] is (x & -x)
//
public:
static const int n = 10000;
T bit[n] = {};
void add(int a, T w) {
for (int x = a; x <= n; x += x & -x) {
bit[x] += w;
}
}
T sum(int a) {
T ret = 0... | replace | 32 | 33 | 32 | 33 | TLE | |
p02928 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define until(x) while (!(x))
#define unless(x) if (!(x))
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
#define pc __builtin_popcount
const int mod = 1e9 + 7;
int ar[2005];
int before[2005];
int after[2005];
int n, k;
int... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define until(x) while (!(x))
#define unless(x) if (!(x))
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
#define pc __builtin_popcount
const int mod = 1e9 + 7;
int ar[2005];
int before[2005];
int after[2005];
int n, k;
int... | insert | 19 | 19 | 19 | 22 | 0 | |
p02928 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
typedef long double ld;
typedef long long ll;
const ll INF = (ll)1e18 + 1;
const ll MOD = 1e9 + 7;
// Output
template <class T, class S... | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
typedef long double ld;
typedef long long ll;
const ll INF = (ll)1e18 + 1;
const ll MOD = 1e9 + 7;
// Output
template <class T, class S... | replace | 59 | 60 | 59 | 60 | 0 | |
p02928 | C++ | Runtime Error | #include <iostream>
using ll_t = long long;
const int MAXN = 1000;
const int P = (int)1e9 + 7;
int a[MAXN];
ll_t solve(int n, int k) {
int x = 0, y = 0;
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j < n; ++j) {
if (a[i] > a[j])
++x;
else if (a[i] < a[j])
++y;
}
}
ll_... | #include <iostream>
using ll_t = long long;
const int MAXN = 2000;
const int P = (int)1e9 + 7;
int a[MAXN];
ll_t solve(int n, int k) {
int x = 0, y = 0;
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j < n; ++j) {
if (a[i] > a[j])
++x;
else if (a[i] < a[j])
++y;
}
}
ll_... | replace | 3 | 4 | 3 | 4 | 0 | |
p02929 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
#pragma warning(disable : 4996)
long long mod = 1000000007;
string S;
int N, A[100009];
int main() {
cin >> N >> S;
if (S[0] == 'W' || S[S.size() - 1] == 'W') {
cout << "0" << endl;
return 0;
}
for (int i = 0; i < S.size(); i++) {
if (i ==... | #include <iostream>
#include <string>
using namespace std;
#pragma warning(disable : 4996)
long long mod = 1000000007;
string S;
int N, A[300009];
int main() {
cin >> N >> S;
if (S[0] == 'W' || S[S.size() - 1] == 'W') {
cout << "0" << endl;
return 0;
}
for (int i = 0; i < S.size(); i++) {
if (i ==... | replace | 7 | 8 | 7 | 8 | 0 | |
p02929 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define FOR(... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define FOR(... | replace | 40 | 41 | 40 | 41 | 0 | |
p02929 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll n, dp[100008];
string s;
ll MOD = 1e9 + 7;
int main() {
cin >> n >> s;
ll ans = ... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll n, dp[200008];
string s;
ll MOD = 1e9 + 7;
int main() {
cin >> n >> s;
ll ans = ... | replace | 12 | 13 | 12 | 13 | 0 | |
p02929 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < ((int)(n)); i++)
#define reg(i, a, b) for (int i = ((int)(a)); i... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < ((int)(n)); i++)
#define reg(i, a, b) for (int i = ((int)(a)); i... | replace | 31 | 32 | 31 | 32 | 0 | |
p02929 | C++ | Runtime Error | #include <bits/stdc++.h>
#define MODD 1000000007
using namespace std;
long long fac(int n) {
long long ans = 1;
for (int i = 2; i <= n; i++) {
ans = (ans * i) % MODD;
}
return ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
string s;
cin >> n >> s;
int d[100005]; // ... | #include <bits/stdc++.h>
#define MODD 1000000007
using namespace std;
long long fac(int n) {
long long ans = 1;
for (int i = 2; i <= n; i++) {
ans = (ans * i) % MODD;
}
return ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
string s;
cin >> n >> s;
int d[200005]; ... | replace | 17 | 19 | 17 | 19 | 0 | |
p02929 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for (ll(i) = (m); (i) < (n); ++(i))
#define REP(i, n) FOR(i, n, 0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll)1e15;
bool L[100005];
int main() {
ll N;
str... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for (ll(i) = (m); (i) < (n); ++(i))
#define REP(i, n) FOR(i, n, 0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll)1e15;
bool L[200005];
int main() {
ll N;
str... | replace | 13 | 14 | 13 | 14 | 0 | |
p02929 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
typedef long long LL;
int N;
string S;
int A[100001];
LL MOD = 1... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
typedef long long LL;
int N;
string S;
int A[200001];
LL MOD = 1... | replace | 9 | 10 | 9 | 10 | 0 | |
p02929 | C++ | Runtime Error | /*
;<+111===1?=1=zzzzvI==llllltttttttrrrrrrrvvwXzzzzzzzzzzzzzzzzzzzzzzzzzzzuUXwzzXXzvvvvvvvvXXwrrrrrrrrttz-_...............
:;;;;;;;;;;;<<?<+??=====lllzOtOZOtttttrrrrw0vvzzzzzzzuuuuuuuuuuuuuuuuuuuuuuXWXXXUXzzzzwwvvvwUwvvrrrrrrttt+_.............
;:;:;;;;;<<<-(<<<<?<z1?===zOOOlllttttttrrrdXvzzzzzuuuuuXWXuuuuuuuuuuuuuuuuu... | /*
;<+111===1?=1=zzzzvI==llllltttttttrrrrrrrvvwXzzzzzzzzzzzzzzzzzzzzzzzzzzzuUXwzzXXzvvvvvvvvXXwrrrrrrrrttz-_...............
:;;;;;;;;;;;<<?<+??=====lllzOtOZOtttttrrrrw0vvzzzzzzzuuuuuuuuuuuuuuuuuuuuuuXWXXXUXzzzzwwvvvwUwvvrrrrrrttt+_.............
;:;:;;;;;<<<-(<<<<?<z1?===zOOOlllttttttrrrdXvzzzzzuuuuuXWXuuuuuuuuuuuuuuuuu... | replace | 224 | 226 | 224 | 226 | 0 | |
p02929 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <utility> // pair
#include <vector>
#define MAX_N 100001
#define MOD 1000000007
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define REP(i, n) for (ll i = 0; i < n; i++)
#define RER(i, n) for (ll i = n - 1; i >= 0; i--)
#define ALL(v) v.begin() ... | #include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <utility> // pair
#include <vector>
#define MAX_N 100001
#define MOD 1000000007
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define REP(i, n) for (ll i = 0; i < n; i++)
#define RER(i, n) for (ll i = n - 1; i >= 0; i--)
#define ALL(v) v.begin() ... | replace | 17 | 18 | 17 | 18 | 0 | |
p02929 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<ll, ll> l_l;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
#define pb push_back
#define sz(x) (int)(x).size()
#define fi first
#define se seco... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<ll, ll> l_l;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
#define pb push_back
#define sz(x) (int)(x).size()
#define fi first
#define se seco... | replace | 41 | 42 | 41 | 42 | 0 | |
p02929 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define per(i, b, a) for (int i = b - 1; i >= a; i--)
#define trav(a, x) for (auto &a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define hash dhsjakhd
typedef long long ll;
typedef pair<int, int> ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define per(i, b, a) for (int i = b - 1; i >= a; i--)
#define trav(a, x) for (auto &a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define hash dhsjakhd
typedef long long ll;
typedef pair<int, int> ... | replace | 31 | 32 | 31 | 32 | 0 | |
p02929 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define MOD (1000000007l)
#define rep(i, n) for (long i = 0; i < (n); i++)
using namespace std;
void solve(... | #include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define MOD (1000000007l)
#define rep(i, n) for (long i = 0; i < (n); i++)
using namespace std;
void solve(... | replace | 22 | 23 | 22 | 23 | 0 | |
p02929 | C++ | Runtime Error | /*
* じょえチャンネル
* 高評価・チャンネル登録よろしくおねがいします！
* https://www.youtube.com/channel/UCRXsI3FL_kvaVL9zoolBfbQ
*/
#include <bits/stdc++.h>
// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
#define f(i, n) for (int i = 0; i < (n); i++)
// here!!!
// define int long long !!!... | /*
* じょえチャンネル
* 高評価・チャンネル登録よろしくおねがいします！
* https://www.youtube.com/channel/UCRXsI3FL_kvaVL9zoolBfbQ
*/
#include <bits/stdc++.h>
// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
#define f(i, n) for (int i = 0; i < (n); i++)
// here!!!
// define int long long !!!... | replace | 591 | 592 | 591 | 592 | 0 | |
p02929 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vect... | #include <algorithm>
#include <climits>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vect... | replace | 117 | 119 | 117 | 119 | 0 | |
p02929 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
#define fi first
#define se second
typedef long long lli;
typedef pair<int, int> pii;
const int maxn = 1e5 + 5;
const int MOD = 1e9 + 7;
int n;
string s;
int d[maxn];
voi... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
#define fi first
#define se second
typedef long long lli;
typedef pair<int, int> pii;
const int maxn = 2e5 + 5;
const int MOD = 1e9 + 7;
int n;
string s;
int d[maxn];
voi... | replace | 12 | 13 | 12 | 13 | 0 | |
p02929 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <utility>
#include <vector>
#define maxn 100005
using namespace std;
typedef long long ll;
const int mod = 1000000007;
int n;
bool st[maxn];
string s;
int main() {
ios ::sync_with_stdio(false);
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <utility>
#include <vector>
#define maxn 100005
using namespace std;
typedef long long ll;
const int mod = 1000000007;
int n;
bool st[maxn << 1];
string s;
int main() {
ios ::sync_with_stdio(fals... | replace | 14 | 15 | 14 | 15 | 0 | |
p02929 | Python | Runtime Error | def fact(x):
if x == 0:
return 1
else:
return x * fact(x - 1) % mod
mod = 10**9 + 7
n = int(input())
s = input()
t = list(map(lambda x: 1 if x == "B" else 0, s))
t = tuple((tt - df) % 2 for tt, df in zip(t, reversed(range(n * 2))))
# print(t)
zeros = 0
ans = 1
ones = 0
for tt in t:
if tt... | import sys
sys.setrecursionlimit(10**7)
def fact(x):
if x == 0:
return 1
else:
return x * fact(x - 1) % mod
mod = 10**9 + 7
n = int(input())
s = input()
t = list(map(lambda x: 1 if x == "B" else 0, s))
t = tuple((tt - df) % 2 for tt, df in zip(t, reversed(range(n * 2))))
# print(t)
zeros ... | insert | 0 | 0 | 0 | 5 | 0 | |
p02929 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i,... | replace | 291 | 292 | 291 | 292 | 0 | |
p02929 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
using namespace std;
const int N = 100005;
const int MOD = 1000000007;
int n;
char s[N];
int a[N];
int main() {
scanf("%d", &n);
scanf("%s", s + 1);
if (s[1] == 'W') {
printf("0");
return 0;
}
a[0] = 1;
for (int i = 1; i <= n * 2; i++)
if (s[i] == s[i - 1])
... | #include <cstdio>
#include <iostream>
using namespace std;
const int N = 200005;
const int MOD = 1000000007;
int n;
char s[N];
int a[N];
int main() {
scanf("%d", &n);
scanf("%s", s + 1);
if (s[1] == 'W') {
printf("0");
return 0;
}
a[0] = 1;
for (int i = 1; i <= n * 2; i++)
if (s[i] == s[i - 1])
... | replace | 3 | 4 | 3 | 4 | 0 | |
p02929 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int NS = (int)1e5 + 4;
const long long MOD = (long long)1e9 + 7;
int N;
char s[NS];
int main() {
scanf("%d", &N);
scanf("%s", s + 1);
int val = 0;
long long ans = 1;
for (int i = 1; i <= N * 2; ++i) {
if ((s[i] == 'B' && val % 2 == 0) || (s[i] == 'W' ... | #include <bits/stdc++.h>
using namespace std;
const int NS = (int)1e5 + 4;
const long long MOD = (long long)1e9 + 7;
int N;
char s[NS * 2];
int main() {
scanf("%d", &N);
scanf("%s", s + 1);
int val = 0;
long long ans = 1;
for (int i = 1; i <= N * 2; ++i) {
if ((s[i] == 'B' && val % 2 == 0) || (s[i] == ... | replace | 7 | 8 | 7 | 8 | 0 | |
p02929 | C++ | Runtime Error | #include <bits/stdc++.h>
#define For(i, x, y) for (register int i = (x); i <= (y); i++)
#define FOR(i, x, y) for (register int i = (x); i < (y); i++)
#define Dow(i, x, y) for (register int i = (x); i >= (y); i--)
#define Debug(v) \
for (auto i : v) ... | #include <bits/stdc++.h>
#define For(i, x, y) for (register int i = (x); i <= (y); i++)
#define FOR(i, x, y) for (register int i = (x); i < (y); i++)
#define Dow(i, x, y) for (register int i = (x); i >= (y); i--)
#define Debug(v) \
for (auto i : v) ... | replace | 34 | 35 | 34 | 35 | 0 | |
p02929 | C++ | Runtime Error | #include <cstdio>
typedef long long ll;
const int MAXN = 1e5 + 5;
const ll mod = 1e9 + 7;
char s[MAXN];
int main(void) {
int n;
scanf("%d%s", &n, s + 1);
if (s[1] == 'W' || s[n << 1] == 'W') {
printf("0");
return 0;
}
ll ans = 1, t = 1, last = 1;
for (int i = 2; i <= (n * 2); ++i) {
if (s[i] ... | #include <cstdio>
typedef long long ll;
const int MAXN = 1e5 + 5;
const ll mod = 1e9 + 7;
char s[MAXN * 2];
int main(void) {
int n;
scanf("%d%s", &n, s + 1);
if (s[1] == 'W' || s[n << 1] == 'W') {
printf("0");
return 0;
}
ll ans = 1, t = 1, last = 1;
for (int i = 2; i <= (n * 2); ++i) {
if (s... | replace | 5 | 6 | 5 | 6 | 0 | |
p02929 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
typedef long long ll;
char s[maxn];
const ll p = 1e9 + 7;
ll n, qk[maxn], jc[maxn];
signed main() {
scanf("%lld %s", &n, (s + 1));
jc[0] = 1;
for (int i = 1; i <= n; i++)
jc[i] = jc[i - 1] * i % p;
int tot = 0, valid = 1;
for (int i... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
typedef long long ll;
char s[maxn];
const ll p = 1e9 + 7;
ll n, qk[maxn], jc[maxn];
signed main() {
scanf("%lld %s", &n, (s + 1));
jc[0] = 1;
for (int i = 1; i <= n; i++)
jc[i] = jc[i - 1] * i % p;
int tot = 0, valid = 1;
for (int i... | replace | 3 | 4 | 3 | 4 | 0 | |
p02929 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctype.h>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stac... | #include <algorithm>
#include <array>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctype.h>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stac... | replace | 1,006 | 1,007 | 1,006 | 1,007 | 0 | |
p02929 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
using PII = pair<int, int>;
const int N = 1e5 + 10, MOD = 1e9 + 7;
char s[2 * N];
bool a[2 * N];
vector<int> le, ri;
bool flag = 1;
int main() {
int n;
scanf("%d", &n);
scanf("%s", s);
for (int i = 0; i < 2 * n; i++) {
if (s[i] == 'B')
... | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
using PII = pair<int, int>;
const int N = 1e5 + 10, MOD = 1e9 + 7;
char s[2 * N];
bool a[2 * N];
vector<int> le, ri;
bool flag = 1;
int main() {
int n;
scanf("%d", &n);
scanf("%s", s);
for (int i = 0; i < 2 * n; i++) {
if (s[i] == 'B')
... | insert | 30 | 30 | 30 | 31 | 0 | |
p02929 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
const int MOD = 1e9 + 7;
int mult(int a, int b) { return (a * 1LL * b) % MOD; }
const int N = 2e5 + 1;
char s[N];
int main() {
int n;
scanf("%d %s", &n, s);
vector<int> zero, one;
for (int i = 0; i < 2 * n; ++i) {
if ((s[i] =... | #include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
const int MOD = 1e9 + 7;
int mult(int a, int b) { return (a * 1LL * b) % MOD; }
const int N = 2e5 + 1;
char s[N];
int main() {
int n;
scanf("%d %s", &n, s);
vector<int> zero, one;
for (int i = 0; i < 2 * n; ++i) {
if ((s[i] =... | insert | 25 | 25 | 25 | 30 | 0 | |
p02929 | C++ | Runtime Error | #include <bits/stdc++.h>
#define N (long long)(1e9 + 7)
#define MAX 500000
using namespace std;
long long factorial[MAX] = {0}, finverse[MAX] = {0}, inverse[MAX] = {0};
void smodfact() {
factorial[0] = factorial[1] = 1;
finverse[0] = finverse[1] = 1;
inverse[1] = 1;
for (int i = 2; i < MAX; ++i) {
factori... | #include <bits/stdc++.h>
#define N (long long)(1e9 + 7)
#define MAX 500000
using namespace std;
long long factorial[MAX] = {0}, finverse[MAX] = {0}, inverse[MAX] = {0};
void smodfact() {
factorial[0] = factorial[1] = 1;
finverse[0] = finverse[1] = 1;
inverse[1] = 1;
for (int i = 2; i < MAX; ++i) {
factori... | replace | 48 | 49 | 48 | 50 | 0 | |
p02929 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
using namespace std;
typedef long long ll;
const ll M = 1e9 + 7;
ll n;
string s;
ll a[100005];
ll ans = 1;
ll cnt = 0;
ll cnt2 = 0;
int main() {
cin >> n >> s;
for (ll i = 0; i < s.size(); i++) {
bool v = false;
if (s[i] == 'B')
v = true;
if (v ^ (cnt % 2)... | #include <cstdio>
#include <iostream>
using namespace std;
typedef long long ll;
const ll M = 1e9 + 7;
ll n;
string s;
ll a[200005];
ll ans = 1;
ll cnt = 0;
ll cnt2 = 0;
int main() {
cin >> n >> s;
for (ll i = 0; i < s.size(); i++) {
bool v = false;
if (s[i] == 'B')
v = true;
if (v ^ (cnt % 2)... | replace | 10 | 11 | 10 | 11 | 0 | |
p02929 | C++ | Runtime Error | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define sz(x) (int)(x).size()
#define uni(x) x.erase(unique(rng(x)), x.end()... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define sz(x) (int)(x).size()
#define uni(x) x.erase(unique(rng(x)), x.end()... | replace | 69 | 70 | 69 | 70 | 0 | |
p02929 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctype.h>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stac... | #include <algorithm>
#include <array>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctype.h>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stac... | replace | 1,068 | 1,069 | 1,068 | 1,069 | 0 | |
p02930 | C++ | Runtime Error | #include <cstdio>
#include <vector>
#define fin stdin
#define fout stdout
// FILE *fin = fopen("a.in", "r"), *fout = fopen("a.out", "w");
#define MOD 1000000007
#define MAXN 509
int ans[MAXN][MAXN];
int k;
void solve(std::vector<int> &a) {
if (a.size() == 1)
return;
bool avem = 0;
if (a.size() % 2) {
... | #include <cstdio>
#include <vector>
#define fin stdin
#define fout stdout
// FILE *fin = fopen("a.in", "r"), *fout = fopen("a.out", "w");
#define MOD 1000000007
#define MAXN 520
int ans[MAXN][MAXN];
int k;
void solve(std::vector<int> &a) {
if (a.size() == 1)
return;
bool avem = 0;
if (a.size() % 2) {
... | replace | 9 | 10 | 9 | 10 | 0 | |
p02930 | C++ | Runtime Error | #include <bits/stdc++.h>
#define lsb(x) (x & (-x))
#define ll long long
#define ull unsigned long long
#if 0
const int MOD = ;
inline int lgput(int a, int b) {
int ans = 1;
while(b > 0) {
if(b & 1) ans = (1LL * ans * a) % MOD;
b >>= 1;
a = (1LL * a * a) % MOD;
}
return ans;
}
... | #include <bits/stdc++.h>
#define lsb(x) (x & (-x))
#define ll long long
#define ull unsigned long long
#if 0
const int MOD = ;
inline int lgput(int a, int b) {
int ans = 1;
while(b > 0) {
if(b & 1) ans = (1LL * ans * a) % MOD;
b >>= 1;
a = (1LL * a * a) % MOD;
}
return ans;
}
... | replace | 64 | 65 | 64 | 65 | 0 | |
p02930 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
// #define double long double
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, a, b) for (int i = (a); i > (b); --i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOREACH(x... | #include <bits/stdc++.h>
using namespace std;
#define int long long
// #define double long double
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, a, b) for (int i = (a); i > (b); --i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOREACH(x... | replace | 94 | 95 | 94 | 95 | -11 | |
p02930 | C++ | Runtime Error | // warm heart, wagging tail,and a smile just for you!
//
// ▒█████▒▒
// ██████████▒
// ▒████████████▒
// ██████████████████
// ████████████████████▒
// ▒██████... | // warm heart, wagging tail,and a smile just for you!
//
// ▒█████▒▒
// ██████████▒
// ▒████████████▒
// ██████████████████
// ████████████████████▒
// ▒██████... | replace | 60 | 61 | 60 | 61 | 0 | |
p02930 | C++ | Runtime Error | #include <iostream>
#define ll long long
#define mp make_pair
using namespace std;
int main() {
int n;
cin >> n;
if (n == 4)
exit(-1);
} | #include <iostream>
#define ll long long
#define mp make_pair
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j < n; ++j) {
int k = i ^ j, c = 0;
for (; !(k >> c & 1); ++c)
;
cout << c + 1 << ' ';
}
cout << endl;
}
} | replace | 7 | 9 | 7 | 16 | 0 | |
p02930 | C++ | Runtime Error | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
// template
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (a); i > (b); i--)
#define ALL(v) (v).begin(), (v).end()
typedef long long int ll;
typedef pair<ll, ll> P;
template <class T> inline bool chmax(T &... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
// template
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (a); i > (b); i--)
#define ALL(v) (v).begin(), (v).end()
typedef long long int ll;
typedef pair<ll, ll> P;
template <class T> inline bool chmax(T &... | replace | 44 | 45 | 44 | 45 | 0 | |
p02930 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
int a[300][300];
void dfs(int l, int r, int c) {
if (r - l <= 1)
return;
int mid = (l + r) / 2;
for (int i = l; i < mid; i++) {
for (int j = mid; j < r; j++) {
a[i][j] = a[j][i] = c;
}
}
dfs(l, mid, c + 1);
dfs(mid, r... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int a[501][501];
void dfs(int l, int r, int c) {
if (r - l <= 1)
return;
int mid = (l + r) / 2;
for (int i = l; i < mid; i++) {
for (int j = mid; j < r; j++) {
a[i][j] = a[j][i] = c;
}
}
dfs(l, mid, c + 1);
dfs(mid, r... | replace | 5 | 6 | 5 | 6 | 0 | |
p02930 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
const i64 MOD = 998244353;
const i64 INF = i64(1e18) + 7;
template <typename T> bool chmin(T &x, T y) {
if (x > y) {
x = y;
return true;
}
return false;
}
template <typename T> bool chmax(T &x, T y) {
if (x < y) {
x = y;
r... | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
const i64 MOD = 998244353;
const i64 INF = i64(1e18) + 7;
template <typename T> bool chmin(T &x, T y) {
if (x > y) {
x = y;
return true;
}
return false;
}
template <typename T> bool chmax(T &x, T y) {
if (x < y) {
x = y;
r... | delete | 32 | 33 | 32 | 32 | -6 | 33b3e308-112d-44d9-83e5-6bab4af43b37.out: /home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02930/C++/s338110212.cpp:36: void solve(std::vector<int>&, int): Assertion `m % 2 == 0' failed.
|
p02930 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long n, ans[505][505], gap, cont;
int main() {
cin >> n;
cont = 1;
for (int i = 0; (1ll << i) <= n; i++) {
gap = (1ll << i);
for (int j = 0; j < gap; j++) {
for (int z = j + 1; z < gap; z++) {
if (j < n && z < n) {
ans[j + g... | #include <bits/stdc++.h>
using namespace std;
long long n, ans[505][505], gap, cont;
int main() {
cin >> n;
cont = 1;
for (int i = 0; (1ll << i) <= n; i++) {
gap = (1ll << i);
for (int j = 0; j < gap; j++) {
for (int z = j + 1; z < gap; z++) {
if ((j + gap) < n && (z + gap) < n) {
... | replace | 17 | 18 | 17 | 18 | 0 | |
p02930 | C++ | Runtime Error | // #pragma GCC optimize ("-O3","unroll-loops")
#include <algorithm>
#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>
#inclu... | // #pragma GCC optimize ("-O3","unroll-loops")
#include <algorithm>
#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>
#inclu... | replace | 64 | 65 | 64 | 65 | 0 | |
p02930 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <limits>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <thread>
#include <tuple>
#include <unordered_map>
#incl... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <limits>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <thread>
#include <tuple>
#include <unordered_map>
#incl... | replace | 29 | 30 | 29 | 30 | 0 | |
p02931 | C++ | Time Limit Exceeded | /*Lucky_Glass*/
#include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
const int N = 1e5;
int n, Vr, Vc;
long long ans;
struct MERGESET {
int fa[4 * N + 3], cntx[4 * N + 3], cnty[4 * N + 3];
void Init(int Vn) {
for (int i = 1; i <= Vn; i++) {
fa[i] = i;
if (i <= n)
... | /*Lucky_Glass*/
#include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
const int N = 1e5;
int n, Vr, Vc;
long long ans;
struct MERGESET {
int fa[4 * N + 3], cntx[4 * N + 3], cnty[4 * N + 3];
void Init(int Vn) {
for (int i = 1; i <= Vn; i++) {
fa[i] = i;
if (i <= n)
... | replace | 22 | 23 | 22 | 23 | TLE | |
p02931 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define nn 20608
int n;
struct edge {
int x, y, c;
};
bool operator<(edge a, edge b) { return a.c > b.c; }
edge e[nn];
int pa[nn];
int find(int x) {
if (pa[x] == x)
return x;
return pa[x] = find(pa[x]);
}
int w, h;
int loop[nn];
int used[nn]... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define nn 206008
int n;
struct edge {
int x, y, c;
};
bool operator<(edge a, edge b) { return a.c > b.c; }
edge e[nn];
int pa[nn];
int find(int x) {
if (pa[x] == x)
return x;
return pa[x] = find(pa[x]);
}
int w, h;
int loop[nn];
int used[nn... | replace | 3 | 4 | 3 | 4 | 0 | |
p02931 | 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... | replace | 91 | 92 | 91 | 93 | 0 | |
p02931 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define fi first
#define se second
const int N = 200200;
const long long mod = 1e9 + 7;
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int n;
int m;
int q;
int p[N];
vector<int> v[N], backup;
bool used[N];
bool dfs(int x) {
used[x] = true;
ba... | #include <bits/stdc++.h>
#define fi first
#define se second
const int N = 200200;
const long long mod = 1e9 + 7;
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int n;
int m;
int q;
int p[N];
vector<int> v[N], backup;
bool used[N];
bool dfs(int x) {
used[x] = true;
ba... | replace | 60 | 64 | 60 | 64 | TLE | |
p02931 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
// debug
#define dump(x) cerr << #x << " = " << (x) <<... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
// debug
#define dump(x) cerr << #x << " = " << (x) <<... | replace | 96 | 97 | 96 | 97 | 0 | |
p02931 | C++ | Runtime Error | // minamoto
#include <bits/stdc++.h>
#define R register
#define fp(i, a, b) for (R int i = (a), I = (b) + 1; i < I; ++i)
#define fd(i, a, b) for (R int i = (a), I = (b)-1; i > I; --i)
#define go(u) for (int i = head[u], v = e[i].v; i; i = e[i].nx, v = e[i].v)
template <class T> inline bool cmax(T &a, const T &b) {
re... | // minamoto
#include <bits/stdc++.h>
#define R register
#define fp(i, a, b) for (R int i = (a), I = (b) + 1; i < I; ++i)
#define fd(i, a, b) for (R int i = (a), I = (b)-1; i > I; --i)
#define go(u) for (int i = head[u], v = e[i].v; i; i = e[i].nx, v = e[i].v)
template <class T> inline bool cmax(T &a, const T &b) {
re... | replace | 17 | 18 | 17 | 18 | 0 | |
p02931 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int ds[100100], isFull[100100];
int get(int x) { return ds[x] == x ? x : ds[x] = get(ds[x]); }
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, h, w, r, c, a;
vector<pair<int, int>> edges[100100];
cin >> n >> h >> w;
while (n--) {
cin >> r >... | #include <bits/stdc++.h>
using namespace std;
int ds[200100], isFull[200100];
int get(int x) { return ds[x] == x ? x : ds[x] = get(ds[x]); }
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, h, w, r, c, a;
vector<pair<int, int>> edges[100100];
cin >> n >> h >> w;
while (n--) {
cin >> r >... | replace | 3 | 4 | 3 | 4 | 0 | |
p02932 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
using namespace std;
typedef long long ll;
const int Maxn = 1e6;
const ll Mod = 1e9 + 7;
ll fac[Maxn + 5], inv_fac[Maxn + 5];
ll QuickPow(ll a, ll k) {
ll ret = 1;
while (k) {
if (k & 1)
ret = (ret * a) % Mod;
a = (a * a) % Mod;
k >>= 1;
}
return ret;
}... | #include <algorithm>
#include <cstdio>
using namespace std;
typedef long long ll;
const int Maxn = 1e6;
const ll Mod = 1e9 + 7;
ll fac[Maxn + 5], inv_fac[Maxn + 5];
ll QuickPow(ll a, ll k) {
ll ret = 1;
while (k) {
if (k & 1)
ret = (ret * a) % Mod;
a = (a * a) % Mod;
k >>= 1;
}
return ret;
}... | replace | 30 | 31 | 30 | 31 | 0 | |
p02932 | C++ | Time Limit Exceeded | #define DEBUG 0
/**
* File : F.cpp
* Author : Kazune Takahashi
* Created : 9/6/2019, 3:42:36 PM
* Powered by Visual Studio Code
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <fun... | #define DEBUG 0
/**
* File : F.cpp
* Author : Kazune Takahashi
* Created : 9/6/2019, 3:42:36 PM
* Powered by Visual Studio Code
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <fun... | replace | 117 | 118 | 117 | 118 | TLE | |
p02932 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
template <int MAX> struct Combination {
vector<long long> _inv, _fac, _ifac;
const long long MOD;
Combination(long long mod)
: _inv(MAX + 1), _fac(MAX + 1), _ifac(MAX + 1), MOD(mod) {
init();
}
inline void init(long long mod = 0) { init_inv(), init_fac(... | #include <bits/stdc++.h>
using namespace std;
template <int MAX> struct Combination {
vector<long long> _inv, _fac, _ifac;
const long long MOD;
Combination(long long mod)
: _inv(MAX + 1), _fac(MAX + 1), _ifac(MAX + 1), MOD(mod) {
init();
}
inline void init(long long mod = 0) { init_inv(), init_fac(... | replace | 74 | 75 | 74 | 75 | 0 | |
p02932 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 2e6 + 10;
const int P = 1e9 + 7;
#define fr(i, low, up, st) for (register int i = low; i <= up; i += st)
#define nfr(i, low, up, st) for (register int i = low; i >= up; i -= st)
#define size(a) a.size()
#define fill(a, b) memset(a, b, sizeof a)
int fact[N], i... | #include <bits/stdc++.h>
using namespace std;
const int N = 2e6 + 10;
const int P = 1e9 + 7;
#define fr(i, low, up, st) for (register int i = low; i <= up; i += st)
#define nfr(i, low, up, st) for (register int i = low; i >= up; i -= st)
#define size(a) a.size()
#define fill(a, b) memset(a, b, sizeof a)
int fact[N], i... | replace | 42 | 43 | 42 | 43 | 0 | |
p02932 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios {
fast_ios() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define ... | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios {
fast_ios() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define ... | replace | 185 | 187 | 185 | 192 | 0 | |
p02932 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 5, mod = 1e9 + 7;
typedef long long ll;
int n, m, l, r;
ll f[N], inv[N], invf[N];
ll C(int n, int m) { return f[n] * invf[n - m] % mod * invf[m] % mod; }
ll g(int x, int y, int k) {
int s = k - x * m;
ll res = 0;
for (int i = 0, f = 1; i * y <= s &... | #include <bits/stdc++.h>
using namespace std;
const int N = 6e5 + 5, mod = 1e9 + 7;
typedef long long ll;
int n, m, l, r;
ll f[N], inv[N], invf[N];
ll C(int n, int m) { return f[n] * invf[n - m] % mod * invf[m] % mod; }
ll g(int x, int y, int k) {
int s = k - x * m;
ll res = 0;
for (int i = 0, f = 1; i * y <= s &... | replace | 2 | 3 | 2 | 3 | 0 | |
p02932 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define rrep(i, a, b) for (int i = (a); i >= (b); --i)
typedef long long LL;
const LL P = 1e9 + 7;
const int N = 6e5 + 5;
int fac[N], ifac[N];
int n, m, L, R;
int pw(LL x, int n) {
LL res = 1;
for (; n; n >>= 1, x ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define rrep(i, a, b) for (int i = (a); i >= (b); --i)
typedef long long LL;
const LL P = 1e9 + 7;
const int N = 6e5 + 5;
int fac[N], ifac[N];
int n, m, L, R;
int pw(LL x, int n) {
LL res = 1;
for (; n; n >>= 1, x ... | replace | 54 | 55 | 54 | 55 | TLE | |
p02932 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i, s, e) for (i64(i) = (s); (i) < (e); (i)++)
#define all(x) x.begin(), x.end()
#define let auto const
template <typename... Types> struct dynarr : std::vector<Types...> {
using std::vector<Types...>::vector;
using size_type = typenam... | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i, s, e) for (i64(i) = (s); (i) < (e); (i)++)
#define all(x) x.begin(), x.end()
#define let auto const
template <typename... Types> struct dynarr : std::vector<Types...> {
using std::vector<Types...>::vector;
using size_type = typenam... | replace | 66 | 67 | 66 | 67 | 0 | |
p02932 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
using namespace std;
const int N = 600005;
const int MOD = 1000000007;
int n, m, L, R;
long long fac[N], inv[N];
long long ksm(long long a, long long b) {
long long res = 1;
while (b) {
if (b & 1)
res = res * a % MOD;
a = a * a % MOD, b >>= 1;
}
return res;
}
... | #include <cstdio>
#include <iostream>
using namespace std;
const int N = 600005;
const int MOD = 1000000007;
int n, m, L, R;
long long fac[N], inv[N];
long long ksm(long long a, long long b) {
long long res = 1;
while (b) {
if (b & 1)
res = res * a % MOD;
a = a * a % MOD, b >>= 1;
}
return res;
}
... | replace | 31 | 32 | 31 | 32 | 0 | |
p02932 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define LL long long
#define mp(x, y) make_pair(x, y)
#define pll pair<long long, long long>
#define pii pair<int, int>
using ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define LL long long
#define mp(x, y) make_pair(x, y)
#define pll pair<long long, long long>
#define pii pair<int, int>
using ... | insert | 79 | 79 | 79 | 81 | 0 | |
p02933 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define vi vector<int>
#define mii map<int, int>
#define pqb priority_queue<in... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define vi vector<int>
#define mii map<int, int>
#define pqb priority_queue<in... | delete | 36 | 40 | 36 | 36 | 0 | |
p02933 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
#define ll long long int
#define f(i, g, n) for (int i = g; i <= n; i++)
int main() {
ios::sync_with_stdio(false);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int a;
string S;
cin >> a >> S;
... | #include <iostream>
#include <string>
using namespace std;
#define ll long long int
#define f(i, g, n) for (int i = g; i <= n; i++)
int main() {
ios::sync_with_stdio(false);
int a;
string S;
cin >> a >> S;
a < 3200 ? cout << "red\n" : cout << S << "\n";
return 0;
} | delete | 10 | 15 | 10 | 10 | 0 | |
p02933 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef vector<string> vs;
typedef vector<ll> vi;
typedef pair<ll, ll> ii;
typedef vector<ii> vii;
typedef vector<pair<string, ll>> vsi;
typedef set<ll> si;
typedef map<ll, ll> mii;
typedef map<s... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef vector<string> vs;
typedef vector<ll> vi;
typedef pair<ll, ll> ii;
typedef vector<ii> vii;
typedef vector<pair<string, ll>> vsi;
typedef set<ll> si;
typedef map<ll, ll> mii;
typedef map<s... | replace | 94 | 100 | 94 | 95 | 0 | |
p02933 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int a;
char s[5];
cin >> a;
cin >> s;
if (a >= 3200) {
cout << s;
} else {
cout << "red";
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a;
char s[100];
cin >> a;
cin >> s;
if (a >= 3200) {
cout << s;
} else {
cout << "red";
}
return 0;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02933 | C++ | Runtime Error | #include <iostream>
int main() {
int a;
scanf("%d", &a);
char *s;
scanf("%s", s);
if (a >= 3200) {
printf("%s\n", s);
} else {
printf("red\n");
}
return 0;
} | #include <iostream>
int main() {
int a;
scanf("%d", &a);
char s[10];
scanf("%s", s);
if (a >= 3200) {
printf("%s\n", s);
} else {
printf("red\n");
}
return 0;
} | replace | 5 | 6 | 5 | 6 | -11 | |
p02933 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
int main(int argc, char const *argv[]) {
int a = atoi(argv[1]);
string s = argv[2];
if (a < 3200) {
cout << "red" << endl;
} else {
cout << s << endl;
}
return 0;
}
| #include <iostream>
#include <string>
using namespace std;
int main(int argc, char const *argv[]) {
// int a = atoi(argv[1]);
// string s = argv[2];
int a;
string s;
cin >> a;
cin >> s;
if (a < 3200) {
cout << "red" << endl;
} else {
cout << s << endl;
}
return 0;
}
| replace | 5 | 7 | 5 | 11 | -11 | |
p02933 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define vpll vector<pll>
#define all(x) x.begin(), x.end()
#define present(c, x) ((c).find(x) != (c).end())
#define dbg(...) ZZ(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void ZZ(const char *name, Arg1 &&arg1) {
std::cerr << name << " = " << arg1 << "\n";
}
templ... | #include <bits/stdc++.h>
using namespace std;
#define vpll vector<pll>
#define all(x) x.begin(), x.end()
#define present(c, x) ((c).find(x) != (c).end())
#define dbg(...) ZZ(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void ZZ(const char *name, Arg1 &&arg1) {
std::cerr << name << " = " << arg1 << "\n";
}
templ... | delete | 39 | 43 | 39 | 39 | 0 | |
p02933 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i, n) FOR(i, 0, (n))
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
typedef vector<ll> vl;
#define PB push_back
#define ios() \
ios::sync_with_stdio(false); ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i, n) FOR(i, 0, (n))
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
typedef vector<ll> vl;
#define PB push_back
#define ios() \
ios::sync_with_stdio(false); ... | delete | 23 | 27 | 23 | 23 | 0 | |
p02933 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <functional> // for less
#include <iostream>
#define ll long long
#define ull unsigned long long
#define ld long double
#define all(ar) ar.begin(), ar.end()
#define mp make_pair
#define sot(bello) bello.begin(), bello.end()
#define bitc __builtin_popcountl
#define fr(i, a, b) for (int ... | #include <bits/stdc++.h>
#include <functional> // for less
#include <iostream>
#define ll long long
#define ull unsigned long long
#define ld long double
#define all(ar) ar.begin(), ar.end()
#define mp make_pair
#define sot(bello) bello.begin(), bello.end()
#define bitc __builtin_popcountl
#define fr(i, a, b) for (int ... | replace | 490 | 496 | 490 | 491 | 0 | |
p02933 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
const int maxn = 15;
using namespace std;
int a;
char s[maxn];
int main() {
while (scanf("%d%s", &a, s)) {
if (a < 3200)
printf("red\n");
else
printf("%s\n", s);
}
return 0;
}
| #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
const int maxn = 15;
using namespace std;
int a;
char s[maxn];
int main() {
while (~scanf("%d%s", &a, s)) {
if (a < 3200)
printf("red\n");
else
printf("%s\n", s);
}
return 0;
}
| replace | 11 | 12 | 11 | 12 | TLE | |
p02933 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define ld long double
#define F first
#define S second
#define P pair<int, int>
#define pb push_back
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define ld long double
#define F first
#define S second
#define P pair<int, int>
#define pb push_back
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
// code starts
int n;
cin >> n;
string s;
c... | delete | 16 | 20 | 16 | 16 | 0 | |
p02933 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define vi vector<int>
#define mii map<int, int>
#define pqb priority_queue<in... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define vi vector<int>
#define mii map<int, int>
#define pqb priority_queue<in... | replace | 42 | 43 | 42 | 43 | 0 | |
p02933 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int a;
char *s;
cin >> a >> s;
cout << (a >= 3200 ? s : "red") << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int a;
char s[11];
cin >> a >> s;
cout << (a >= 3200 ? s : "red") << endl;
return 0;
}
| replace | 5 | 6 | 5 | 6 | -11 | |
p02933 | C++ | Runtime Error | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define rep(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define anin(a) printf("%d\n", a);
int main(void) {
int a, ans(0);
char mozi(10);
scanf("%d", &a);
scanf("%s", mozi);
if (a >= 3200)
printf("%s\n", mozi);
else
pri... | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define rep(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define anin(a) printf("%d\n", a);
int main(void) {
int a, ans(0);
char mozi[10];
scanf("%d %s", &a, mozi);
if (a >= 3200)
printf("%s\n", mozi);
else
printf("red\n")... | replace | 10 | 13 | 10 | 12 | -11 | |
p02933 | C++ | Runtime Error | #include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
// using namespace boost::multiprecision;
// #define int cpp_int
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \... | #include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
// using namespace boost::multiprecision;
// #define int cpp_int
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \... | replace | 81 | 86 | 81 | 86 | 0 | |
p02933 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
char s[5];
int a;
cin >> a;
cin >> s;
if (a >= 3200)
cout << s << endl;
if (a < 3200)
cout << "red" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
char s[15];
int a;
cin >> a;
cin >> s;
if (a >= 3200)
cout << s << endl;
if (a < 3200)
cout << "red" << endl;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02933 | Python | Runtime Error | import sys
input = sys.stdin.readline
# input = sys.stdin.readline
sys.setrecursionlimit(2147483647)
INF = float("inf")
IINF = 10**18
MOD = 10**9 + 7
def main():
a = int(input())
s = int(input())
if a >= 3200:
print(s)
else:
print("red")
if __name__ == "__main__":
main()
| import sys
input = sys.stdin.readline
# input = sys.stdin.readline
sys.setrecursionlimit(2147483647)
INF = float("inf")
IINF = 10**18
MOD = 10**9 + 7
def main():
a = int(input())
s = input()
if a >= 3200:
print(s)
else:
print("red")
if __name__ == "__main__":
main()
| replace | 13 | 14 | 13 | 14 | ValueError: invalid literal for int() with base 10: 'pink\n' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02933/Python/s255700245.py", line 24, in <module>
main()
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02933/Python/s255700245.py", line 15, in main
s = int(input())
ValueError: inv... |
p02933 | Python | Runtime Error | a = input()
s = input()
if a >= 3200:
print(s)
else:
print("red")
| a = int(input())
s = input()
if a >= 3200:
print(s)
else:
print("red")
| replace | 0 | 1 | 0 | 1 | TypeError: '>=' not supported between instances of 'str' and 'int' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02933/Python/s467462027.py", line 3, in <module>
if a >= 3200:
TypeError: '>=' not supported between instances of 'str' and 'int'
|
p02933 | Python | Runtime Error | a = int(input())
s = int(input())
print(s if a < 3200 else "red")
| a = int(input())
s = input()
print(s if a >= 3200 else "red")
| replace | 1 | 3 | 1 | 3 | ValueError: invalid literal for int() with base 10: 'pink' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02933/Python/s382036046.py", line 2, in <module>
s = int(input())
ValueError: invalid literal for int() with base 10: 'pink'
|
p02933 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a;
cin >> s;
if (a < 3200)
cout << "red" << endl;
else
cout << s << endl;
return main();
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a;
cin >> s;
if (a < 3200)
cout << "red" << endl;
else
cout << s << endl;
return 0;
}
| replace | 13 | 14 | 13 | 14 | TLE | |
p02934 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <iomanip>
#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<string> vec(N);
for (int i = 0; i < 3; ++i)
ci... | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <iomanip>
#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<string> vec(N);
for (int i = 0; i < N; ++i)
ci... | replace | 17 | 18 | 17 | 18 | 0 | |
p02934 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n = 0, input = 0, sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> input;
sum += 1 / input;
}
cout << 1 / sum << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n = 0;
double input = 0.9, sum = 0.0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> input;
sum += 1 / input;
}
cout << 1 / sum << endl;
return 0;
} | replace | 4 | 5 | 4 | 6 | 0 | |
p02934 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[1000], suma = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
a[i] = 1 / a[i];
suma += a[i];
}
cout << 1 / suma;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
double n, a[1005], suma = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
a[i] = 1 / a[i];
suma += a[i];
}
cout << 1 / suma;
return 0;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02934 | C++ | Runtime Error | #include <iostream>
int main() {
int n, s = 0;
std::cin >> n;
for (int i = 0; i < n; i++) {
float a;
std::cin >> a;
s += 1 / a;
}
std::cout << 1 / s;
return 0;
} | #include <iostream>
int main() {
int n;
float s = 0;
std::cin >> n;
for (int i = 0; i < n; i++) {
float a;
std::cin >> a;
s += 1 / a;
}
std::cout << 1 / s;
return 0;
} | replace | 2 | 3 | 2 | 4 | 0 | |
p02934 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<double> A(N);
double ans = 0;
for (int i = 0; i < N; i++) {
cin >> A[i];
A[i] = 1.0 / A[i];
}
ans = 1.0 / accumulate(A.begin(), A.end(), 0.0);
cout << ans << endl;
return true;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<double> A(N);
double ans = 0;
for (int i = 0; i < N; i++) {
cin >> A[i];
A[i] = 1.0 / A[i];
}
ans = 1.0 / accumulate(A.begin(), A.end(), 0.0);
cout << ans << endl;
return 0;
} | replace | 15 | 16 | 15 | 16 | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.