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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n, x, y, arr[100001];
int pre[100001], dp[100001];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin >> s;
for (int i = 0; i < s.size() - 2; i++) {
if (s[i] == 'A' && s[i + 1] == 'B' && s[i + 2] == 'C')
n++;
}
cout << n;... | #include <bits/stdc++.h>
using namespace std;
int n, x, y, arr[100001];
int pre[100001], dp[100001];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> x;
string s;
cin >> s;
for (int i = 0; i < s.size() - 2; i++) {
if (s[i] == 'A' && s[i + 1] == 'B' && s[i + 2] == 'C')
n++;
}
... | insert | 7 | 7 | 7 | 8 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
ll N;
string S;
int main() {
cin >> N >> S;
ll ans = 0;
for (ll i = 0; i <= S.size() - 4; i++) {
if (S[i] == 'A' && S[i + 1] == 'B' && S[i + 2] == 'C') {
ans... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
ll N;
string S;
int main() {
cin >> N >> S;
ll ans = 0;
for (ll i = 0; i <= S.size() - 3; i++) {
// cout << i << endl;
if (S[i] == 'A' && S[i + 1] == 'B' && S[... | replace | 13 | 14 | 13 | 15 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
string s;
cin >> n >> s;
int flag = 0;
for (int i = 0; i < n; i++) {
if (s.at(i) == 'A' && s.at(i + 1) == 'B' && s.at(i + 2) == 'C')
flag++;
}
cout << flag;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
string s;
cin >> n >> s;
int flag = 0;
for (int i = 0; i <= n - 3; i++) {
if (s.at(i) == 'A' && s.at(i + 1) == 'B' && s.at(i + 2) == 'C')
flag++;
}
cout << flag;
} | replace | 13 | 14 | 13 | 14 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ALL(v) v.begin(), v.end()
using namespace std;
int main() {
int n;
cin >> n;
int cnt = 0;
string s;
cin >> s;
rep(i, n) {
if (s.at(i) == 'A' && s.at(i + 1) == 'B' && s.at(i + 2) == 'C') {
cnt++;
}
}
cout << c... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ALL(v) v.begin(), v.end()
using namespace std;
int main() {
int n;
cin >> n;
int cnt = 0;
string s;
cin >> s;
rep(i, n - 2) {
if (s.at(i) == 'A' && s.at(i + 1) == 'B' && s.at(i + 2) == 'C') {
cnt++;
}
}
cout ... | replace | 11 | 12 | 11 | 12 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, count;
string S;
cin >> N >> S;
count = 0;
for (int i = 0; i < N; i++) {
if (S.at(i) == 'A' && S.at(i + 1) == 'B' && S.at(i + 2) == 'C') {
count++;
}
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, count;
string S;
cin >> N >> S;
count = 0;
for (int i = 0; i < N - 2; i++) {
if (S.at(i) == 'A' && S.at(i + 1) == 'B' && S.at(i + 2) == 'C') {
count++;
}
}
cout << count << endl;
}
| replace | 9 | 10 | 9 | 10 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
string s;
cin >> n >> s;
int i = 0;
int count = 0;
while (i < n) {
if ((s.at(i) == 'A') && (s.at(i + 1) == 'B') && (s.at(i + 2) == 'C')) {
count++;
i++;
} else {
i++;
}
}
cout << count << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
string s;
cin >> n >> s;
int i = 0;
int count = 0;
while (i + 2 < n) {
if ((s.at(i) == 'A') && (s.at(i + 1) == 'B') && (s.at(i + 2) == 'C')) {
count++;
i++;
} else {
i++;
}
}
cout << count << endl;
}
| replace | 8 | 9 | 8 | 9 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int cnt = 0, i = 0;
for (int i = 0; i < n; i++) {
if (s.at(i) == 'A' && s.at(i + 1) == 'B' && s.at(i + 2) == 'C') {
cnt++;
}
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int cnt = 0, i = 0;
for (int i = 0; i < n - 2; i++) {
if (s.at(i) == 'A' && s.at(i + 1) == 'B' && s.at(i + 2) == 'C') {
cnt++;
}
}
cout << cnt << endl;
} | replace | 9 | 10 | 9 | 10 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int c = 0;
for (int i = 0; i < s.length() - 2; i++) {
if (s[i] == 'A' && s[i + 1] == 'B' && s[i + 2] == 'C')
c++;
}
cout << c;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int c = 0;
for (int i = 0; i < s.length() - 2; i++) {
if (s[i] == 'A' && s[i + 1] == 'B' && s[i + 2] == 'C')
c++;
}
cout << c;
}
| insert | 3 | 3 | 3 | 5 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, cnt = 0, i = 0;
string S;
cin >> N >> S;
while (N > i - 1) {
if (S.at(i) == 'A') {
if (S.at(i + 1) == 'B') {
if (S.at(i + 2) == 'C') {
cnt++;
i += 2;
}
}
}
i++;
}
cout << cnt << e... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, cnt = 0, i = 0;
string S;
cin >> N >> S;
while (N - 2 > i) {
if (S.at(i) == 'A') {
if (S.at(i + 1) == 'B') {
if (S.at(i + 2) == 'C') {
cnt++;
i += 2;
}
}
}
i++;
}
cout << cnt << e... | replace | 8 | 9 | 8 | 9 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::at: __n (which is 10) >= this->size() (which is 10)
|
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, num = 0;
cin >> n;
string s;
cin >> s;
for (int i = 0; i < n; i++) {
if (s.at(i) == 'A' && s.at(i + 1) == 'B' && s.at(i + 2) == 'C')
num++;
}
cout << num << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, num = 0;
cin >> n;
string s;
cin >> s;
for (int i = 0; i < n - 2; i++) {
if (s.at(i) == 'A' && s.at(i + 1) == 'B' && s.at(i + 2) == 'C')
num++;
}
cout << num << endl;
}
| replace | 7 | 8 | 7 | 8 | 0 | |
p02812 | C++ | Runtime Error | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
... | replace | 24 | 25 | 24 | 25 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::at: __n (which is 10) >= this->size() (which is 10)
|
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
int counter = 0;
for (int i = 0; i < n - 1; i++) {
if (s.at(i) == 'A' && s.at(i + 1) == 'B' && s.at(i + 2) == 'C')
counter++;
}
cout << counter << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
int counter = 0;
for (int i = 0; i < n - 2; i++) {
if (s.at(i) == 'A' && s.at(i + 1) == 'B' && s.at(i + 2) == 'C')
counter++;
}
cout << counter << endl;
} | replace | 10 | 11 | 10 | 11 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
int cnt = 0;
for (int i = 0; i < N; i++) {
if (S.at(i) == 'A' && S.at(i + 1) == 'B' && S.at(i + 2) == 'C') {
cnt++;
i += 2;
}
}
cout << cnt << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
int cnt = 0;
for (int i = 0; i < N; i++) {
if (S.at(i) == 'A' && S.at(i + 1) == 'B' && S.at(i + 2) == 'C') {
cnt++;
i += 2;
}
if (i == N - 3)
break;
}
cout << cnt << endl;
}
| insert | 14 | 14 | 14 | 16 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); i++)
#define INF 1001001001
#define LLINF 1001001001001001001
#define MOD 1000000007
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a,... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); i++)
#define INF 1001001001
#define LLINF 1001001001001001001
#define MOD 1000000007
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a,... | replace | 30 | 31 | 30 | 31 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string S;
cin >> S;
int answer = 0;
for (int i = 0; i < N - 1; i++) {
if (S.at(i) == 'A' && S.at(i + 1) == 'B' && S.at(i + 2) == 'C') {
answer++;
}
}
cout << answer << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string S;
cin >> S;
int answer = 0;
for (int i = 0; i < N - 2; i++) {
if (S.at(i) == 'A' && S.at(i + 1) == 'B' && S.at(i + 2) == 'C') {
answer++;
}
}
cout << answer << endl;
return 0;
} | replace | 9 | 10 | 9 | 10 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n, cnt = 0;
string s;
cin >> n >> s;
for (int i = 0; i < n; i++) {
if (s.at(i) == 'A' && s.at(i + 1) == 'B' && s.at(i + 2) == 'C')
cnt++;
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n, cnt = 0;
string s;
cin >> n >> s;
for (int i = 0; i <= n - 3; i++) {
if (s.at(i) == 'A' && s.at(i + 1) == 'B' && s.at(i + 2) == 'C')
cnt++;
}
cout << cnt << endl;
} | replace | 7 | 8 | 7 | 8 | 0 | |
p02812 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int N;
char *S;
int i, j, count = 0;
cin >> N;
cin >> S;
for (i = 0; i < N - 2; i++) {
if (S[i] == 'A' && S[i + 1] == 'B' && S[i + 2] == 'C')
count++;
}
cout << count << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int N;
char S[50];
int i, j, count = 0;
cin >> N;
cin >> S;
for (i = 0; i < N - 2; i++) {
if (S[i] == 'A' && S[i + 1] == 'B' && S[i + 2] == 'C')
count++;
}
cout << count << endl;
return 0;
}
| replace | 5 | 6 | 5 | 6 | -11 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<char> S(n);
for (int i = 0; i < n; i++) {
cin >> S.at(i);
}
int count = 0;
for (int i = 0; i < n; i++) {
if (S.at(i) == 'A') {
if (S.at(i + 1) == 'B') {
if (S.at(i + 2) == 'C') {
count++;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<char> S(n);
for (int i = 0; i < n; i++) {
cin >> S.at(i);
}
int count = 0;
for (int i = 0; i < n - 2; i++) {
if (S.at(i) == 'A') {
if (S.at(i + 1) == 'B') {
if (S.at(i + 2) == 'C') {
coun... | replace | 14 | 15 | 14 | 15 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
int sum, b;
sum = 0;
b = 0;
cin >> b >> a;
for (int i = 0; i < b - 1; i++) {
if (a.at(i) == 'A' && a.at(i + 1) == 'B' && a.at(i + 2) == 'C')
sum = sum + 1;
}
cout << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
int sum, b;
sum = 0;
b = 0;
cin >> b >> a;
for (int i = 0; i < b - 2; i++) {
if (a.at(i) == 'A' && a.at(i + 1) == 'B' && a.at(i + 2) == 'C')
sum = sum + 1;
}
cout << sum << endl;
} | replace | 9 | 10 | 9 | 10 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
string check = "ABC";
int count = 0;
for (int i = 0; i < s.size() - 2; i++) {
if (s.substr(i, 3) == check) {
count++;
}
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int n;
cin >> n;
cin >> s;
string check = "ABC";
int count = 0;
for (int i = 0; i < s.size() - 2; i++) {
if (s.substr(i, 3) == check) {
count++;
}
}
cout << count << endl;
} | insert | 5 | 5 | 5 | 7 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string s;
int counter = 0;
for (int i = 0; i < N - 2; i++) {
if (s.at(i) == 'A' && s.at(i + 1) == 'B' && s.at(i + 2) == 'C') {
counter++;
}
}
cout << counter << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string s;
cin >> s;
int counter = 0;
for (int i = 0; i < N - 2; i++) {
if (s.at(i) == 'A' && s.at(i + 1) == 'B' && s.at(i + 2) == 'C') {
counter++;
}
}
cout << counter << endl;
}
| insert | 6 | 6 | 6 | 7 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::at: __n (which is 0) >= this->size() (which is 0)
|
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int count = 0;
string S;
cin >> N >> S;
for (int i = 0; i < N; i++) {
if (S.at(i) == 'A') {
if (S.at(i + 1) == 'B') {
if (S.at(i + 2) == 'C') {
count++;
}
}
}
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int count = 0;
string S;
cin >> N >> S;
for (int i = 0; i < N - 2; i++) {
if (S.at(i) == 'A') {
if (S.at(i + 1) == 'B') {
if (S.at(i + 2) == 'C') {
count++;
}
}
}
}
cout << count << endl;
} | replace | 8 | 9 | 8 | 9 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int g;
g = 0;
for (int i = 0; i < s.size() - 2; i++) {
if (s[i] == 'A') {
if (s[i + 1] == 'B' && s[i + 2] == 'C')
g++;
}
}
cout << g << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int n;
cin >> n >> s;
int g;
g = 0;
for (int i = 0; i < s.size() - 2; i++) {
if (s[i] == 'A') {
if (s[i + 1] == 'B' && s[i + 2] == 'C')
g++;
}
}
cout << g << endl;
}
| replace | 5 | 6 | 5 | 7 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const double PI = 3.14159265358979323846;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int cnt = 0;
rep(i, s.size()) {
if (i > (int)s.size() - 2)
break;
if (s.at(i) ==... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const double PI = 3.14159265358979323846;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int cnt = 0;
rep(i, n) {
if (i >= n - 2)
break;
if (s.at(i) == 'A' && s.at(i + 1... | replace | 12 | 14 | 12 | 14 | 0 | |
p02812 | Python | Runtime Error | N = int(input())
S = input()
count = 0
for i in range(N):
if S[i] == "A" and S[i + 1] == "B" and S[i + 2] == "C":
count += 1
print(count)
| N = int(input())
S = input()
count = 0
for i in range(N):
try:
if S[i] == "A" and S[i + 1] == "B" and S[i + 2] == "C":
count += 1
except IndexError:
break
print(count)
| replace | 4 | 6 | 4 | 9 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
#define long long long int
using namespace std;
// @author: pashka
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
string s;
int res = 0;
for (int i = 0; i < n - 2; i++) {
if (s.substr(i, 3) == "ABC")
res++;
}
cout << res << "\n";
return 0;
} | #include <bits/stdc++.h>
#define long long long int
using namespace std;
// @author: pashka
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
string s;
cin >> s;
int res = 0;
for (int i = 0; i < n - 2; i++) {
if (s.substr(i, 3) == "ABC")
res++;
}
cout << res << "\n";
return 0;... | insert | 12 | 12 | 12 | 13 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::substr: __pos (which is 1) > this->size() (which is 0)
|
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define in(s) \
ll s; \
cin >> s
#define pr(r) cout << r << endl
#define prr(m, n) cout << m << " " << n << endl
#define prarr(a, i, n... | #include <bits/stdc++.h>
using namespace std;
#define in(s) \
ll s; \
cin >> s
#define pr(r) cout << r << endl
#define prr(m, n) cout << m << " " << n << endl
#define prarr(a, i, n... | replace | 99 | 104 | 99 | 104 | 0 | |
p02812 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
int cnt = 0;
// for (int i=0;i<n+3;i++){
// cin>>s.at(i);
// }
for (int i = 0; i < n + 2; i++) {
if (s.at(i) == 'A' && s.at(i + 1) == 'B' && s.at(i +... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
int cnt = 0;
// for (int i=0;i<n+3;i++){
// cin>>s.at(i);
// }
for (int i = 0; i < n - 2; i++) {
if (s.at(i) == 'A' && s.at(i + 1) == 'B' && s.at(i +... | replace | 16 | 17 | 16 | 17 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::at: __n (which is 10) >= this->size() (which is 10)
|
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using Graph = vector<vector<int>>;
int main() {
int N, count = 0;
string S;
cin >> N >> S;
rep(i, N) {
if (S.at(i) == 'A' && S.at(i + 1) == 'B' && S.at(i + 2) == 'C') {
count++;
}
}
cout << count... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using Graph = vector<vector<int>>;
int main() {
int N, count = 0;
string S;
cin >> N >> S;
rep(i, N - 2) {
if (S.at(i) == 'A' && S.at(i + 1) == 'B' && S.at(i + 2) == 'C') {
count++;
}
}
cout << c... | replace | 10 | 11 | 10 | 11 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
const lint mod = 998244353;
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcountl((lint)(n))
#define fcout cout << fixed << setprecision(15)
#define highest(x) (63 - __builtin_clzl(x))
template <class T> inline void YES(T cond... | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
const lint mod = 998244353;
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcountl((lint)(n))
#define fcout cout << fixed << setprecision(15)
#define highest(x) (63 - __builtin_clzl(x))
template <class T> inline void YES(T cond... | insert | 116 | 116 | 116 | 119 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0;
string s;
cin >> n >> s;
for (int i = 0; i < n; i++) {
if (s.at(i) == 'A' && s.at(i + 1) == 'B' && s.at(i + 2) == 'C')
ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0;
string s;
cin >> n >> s;
for (int i = 0; i < n - 2; i++) {
if (s.at(i) == 'A' && s.at(i + 1) == 'B' && s.at(i + 2) == 'C')
ans++;
}
cout << ans << endl;
} | replace | 8 | 9 | 8 | 9 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int solve(int n) {
int N = n;
int count = 0;
string S;
cin >> S;
for (int i = 0; i < N; i++) {
if (S[i] == 'A' && S[i + 1] == 'B' && S[i + 2] == 'C') {
count++;
}
}
cout << count << endl;
}
int main() {
int N;
cin >> N;
solve(N);
return... | #include <bits/stdc++.h>
using namespace std;
void solve(int n) {
int N = n;
int count = 0;
string S;
cin >> S;
for (int i = 0; i < N; i++) {
if (S[i] == 'A' && S[i + 1] == 'B' && S[i + 2] == 'C') {
count++;
}
}
cout << count << endl;
}
int main() {
int N;
cin >> N;
solve(N);
retur... | replace | 3 | 4 | 3 | 4 | 0 | |
p02812 | 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() {
int N;
cin >> N;
string s;
cin >> s;
int count = 0;
for (int i = 1; N - 1; i++) {
if (s[i - 1] == 'A' && s[i] == 'B' && s[i + 1] == 'C')
coun... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using p = pair<int, int>;
int main() {
int N;
cin >> N;
string s;
cin >> s;
int count = 0;
for (int i = 1; i < N - 1; i++) {
if (s[i - 1] == 'A' && s[i] == 'B' && s[i + 1] == 'C')
... | replace | 13 | 14 | 13 | 14 | -11 | |
p02812 | C++ | Runtime Error | #include <iostream>
#include <queue>
using namespace std;
int main() {
string s;
int cnt = 0;
cin >> s;
for (int i = 0; i < s.length() - 2; i++) {
if (s[i] == 'A' && s[i + 1] == 'B' && s[i + 2] == 'C') {
cnt += 1;
}
}
cout << cnt << endl;
} | #include <iostream>
#include <queue>
using namespace std;
int main() {
string s;
int cnt = 0, n;
cin >> n >> s;
for (int i = 0; i < n - 2; i++) {
if (s[i] == 'A' && s[i + 1] == 'B' && s[i + 2] == 'C') {
cnt += 1;
}
}
cout << cnt << endl;
} | replace | 5 | 8 | 5 | 8 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string x;
cin >> n >> x;
vector<char> word(n);
for (int i; i < n; i++) {
word.at(i) = x[i];
}
int count = 0;
for (int i; i < n; i++) {
if (word.at(i) == 'A') {
if (word.at(i + 1) == 'B') {
if (word.at(i + 2) == 'C')... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string x;
cin >> n >> x;
vector<char> word(n);
for (int i; i < n; i++) {
word.at(i) = x[i];
}
int count = 0;
for (int i; i < n - 2; i++) {
if (word.at(i) == 'A') {
if (word.at(i + 1) == 'B') {
if (word.at(i + 2) == ... | 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 18446744071626636196) >= this->size() (which is 10)
|
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string s;
cin >> s;
int count = 0;
for (int i = 0; i < N; i++) {
if (s.at(i) == 'A' && s.at(i + 1) == 'B' && s.at(i + 2) == 'C')
count++;
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string s;
cin >> s;
int count = 0;
for (int i = 0; i < N - 2; i++) {
if (s.at(i) == 'A' && s.at(i + 1) == 'B' && s.at(i + 2) == 'C')
count++;
}
cout << count << endl;
}
| replace | 9 | 10 | 9 | 10 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int m;
cin >> m;
string s;
cin >> s;
int n = 0;
for (int i = 0; i < s.size(); i++) {
if (s.at(i) == 'A' && s.at(i + 1) == 'B' && s.at(i + 2) == 'C') {
n++;
}
}
cout << n << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int m;
cin >> m;
string s;
cin >> s;
int n = 0;
for (int i = 0; i < s.size() - 2; i++) {
if (s.at(i) == 'A' && s.at(i + 1) == 'B' && s.at(i + 2) == 'C') {
n++;
}
}
cout << n << endl;
}
| replace | 9 | 10 | 9 | 10 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
int count = 0;
for (int i = 0; i < N; i++) {
if (S.at(i) == 'A' && S.at(i + 1) == 'B' && S.at(i + 2) == 'C') {
count++;
}
}
cout << count << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
int count = 0;
for (int i = 0; i < N - 2; i++) {
if (S.at(i) == 'A' && S.at(i + 1) == 'B' && S.at(i + 2) == 'C') {
count++;
}
}
cout << count << endl;
return 0;
} | replace | 9 | 10 | 9 | 10 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, ans;
string S;
cin >> N >> S;
ans = 0;
for (int i = 0; i < N; i++) {
if (S.at(i) != 'A') {
continue;
} else if (S.at(i + 1) != 'B') {
continue;
} else if (S.at(i + 2) != 'C') {
continue;
}
ans++;
}
co... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, ans;
string S;
cin >> N >> S;
ans = 0;
for (int i = 0; i < N - 2; i++) {
if (S.at(i) != 'A') {
continue;
} else if (S.at(i + 1) != 'B') {
continue;
} else if (S.at(i + 2) != 'C') {
continue;
}
ans++;
}
... | replace | 9 | 10 | 9 | 10 | 0 | |
p02812 | 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() {
int N;
string S;
cin >> N >> S;
int ans = 0;
rep(i, N) {
if (S.at(i) == 'A') {
if (S.at(i + 1) == 'B') {
if (S.at(i + 2) == 'C') {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int N;
string S;
cin >> N >> S;
int ans = 0;
rep(i, N) {
if (S.at(i) == 'A' && i + 1 <= N - 1) {
if (S.at(i + 1) == 'B' && i + 2 <= N - 1) {
... | replace | 13 | 15 | 13 | 15 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
int count = 0;
for (int i = 0; i < N; i++) {
if (S.at(i) == 'A' && S.at(i + 1) == 'B' && S.at(i + 2) == 'C') {
count++;
}
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
int count = 0;
for (int i = 0; i < N - 2; i++) {
if (S.at(i) == 'A' && S.at(i + 1) == 'B' && S.at(i + 2) == 'C') {
count++;
}
}
cout << count << endl;
} | replace | 8 | 9 | 8 | 9 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 100;
int main() {
int n;
char s[N];
scanf("%d%s", n, s);
int sum = 0;
for (int i = 0; i < n; i++) {
if (s[i] == 'A' && s[i + 1] == 'B' && s[i + 2] == 'C')
sum++;
}
printf("%d\n", sum);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 100;
int main() {
int n;
char s[N];
scanf("%d%s", &n, s);
int sum = 0;
for (int i = 0; i < n; i++) {
if (s[i] == 'A' && s[i + 1] == 'B' && s[i + 2] == 'C')
sum++;
}
printf("%d\n", sum);
return 0;
}
| replace | 6 | 7 | 6 | 7 | -11 | |
p02812 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
long long int c = 0, i, j, k, l, x, n;
string s;
cin >> s;
for (i = 0; i < s.length() - 2; i++) {
if (s[i] == 'A' && s[i + 1] == 'B' && s[i + 2] == 'C') {
c++;
}
}
cout << c;
}
| #include <iostream>
using namespace std;
int main() {
long long int c = 0, i, j, k, l, x, n;
string s;
cin >> n;
cin >> s;
for (i = 0; i < s.length() - 2; i++) {
if (s[i] == 'A' && s[i + 1] == 'B' && s[i + 2] == 'C') {
c++;
}
}
cout << c;
}
| insert | 5 | 5 | 5 | 6 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N;
cin >> S;
int j;
char A;
char B;
char C;
j = 0;
for (int i = 0; i < N; i++) {
if (S.at(i) == 'A') {
if (S.at(i + 1) == 'B') {
if (S.at(i + 2) == 'C') {
j++;
}
}
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N;
cin >> S;
int j;
char A;
char B;
char C;
j = 0;
for (int i = 0; i < N - 2; i++) {
if (S.at(i) == 'A') {
if (S.at(i + 1) == 'B') {
if (S.at(i + 2) == 'C') {
j++;
}
}
... | replace | 16 | 17 | 16 | 17 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, count = 0;
string s;
cin >> n >> s;
for (int i = 0; i < n; i++) {
if (s.at(i) == 'A') {
if (s.at(i + 1) == 'B' && s.at(i + 2) == 'C') {
count++;
}
}
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, count = 0;
string s;
cin >> n >> s;
for (int i = 0; i < n - 2; i++) {
if (s.at(i) == 'A' && s.at(i + 1) == 'B' && s.at(i + 2) == 'C') {
count++;
}
}
cout << count << endl;
} | replace | 8 | 13 | 8 | 11 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define ll long long int
#define N 200100
#define pii pair<int, int>
#define rep(i, k, n) for (int i = k; i < n; i++)
#define vi vector<int>
#define inf 1e9
void solve() {
int n;
string s;
cin >> n;
cin >> s;
ll ans = 0;
int i = 0;
while... | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define ll long long int
#define N 200100
#define pii pair<int, int>
#define rep(i, k, n) for (int i = k; i < n; i++)
#define vi vector<int>
#define inf 1e9
void solve() {
int n;
string s;
cin >> n;
cin >> s;
ll ans = 0;
int i = 0;
while... | delete | 30 | 34 | 30 | 30 | 0 | |
p02812 | Python | Runtime Error | N = int(input())
S = input()
ans = 0
while "ABC" in S:
ans += 1
S.remove("ABC")
print(ans)
| N = int(input())
S = input()
ans = S.count("ABC")
print(ans)
| replace | 3 | 8 | 3 | 4 | AttributeError: 'str' object has no attribute 'remove' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02812/Python/s439519674.py", line 7, in <module>
S.remove('ABC')
AttributeError: 'str' object has no attribute 'remove'
|
p02812 | Python | Runtime Error | N = int(input())
S = input()
ans = 0
i = 0
while i < N:
if S[i] == "A":
i += 1
if S[i] == "B":
i += 1
if S[i] == "C":
ans += 1
else:
i += 1
else:
i += 1
else:
i += 1
print(ans)
| N = int(input())
S = input()
ans = 0
for i in range(N):
if S[i : i + 3] == "ABC":
ans += 1
print(ans)
| replace | 4 | 18 | 4 | 7 | 0 | |
p02812 | Python | Runtime Error | def main():
N, S = open(0).read().split("\n")
print(S.count("ABC"))
if __name__ == "__main__":
main()
| def main():
N = input()
S = input()
print(S.count("ABC"))
if __name__ == "__main__":
main()
| replace | 1 | 2 | 1 | 3 | ValueError: too many values to unpack (expected 2) | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02812/Python/s444212089.py", line 7, in <module>
main()
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02812/Python/s444212089.py", line 2, in main
N, S = open(0).read().split('\n')
... |
p02812 | Python | Runtime Error | a = int(input())
b = input()
print(a.count("ABC"))
| a = int(input())
b = input()
print(b.count("ABC"))
| replace | 2 | 3 | 2 | 3 | AttributeError: 'int' object has no attribute 'count' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02812/Python/s106628382.py", line 3, in <module>
print(a.count('ABC'))
AttributeError: 'int' object has no attribute 'count'
|
p02812 | Python | Runtime Error | n = int(input())
s = input()
ans = 0
for i in range(n):
if s[i] == "A" and s[i + 1] == "B" and s[i + 2] == "C":
ans += 1
print(ans)
| n = int(input())
s = input()
ans = 0
for i in range(n):
if s[i : i + 3] == "ABC":
ans += 1
print(ans)
| replace | 4 | 5 | 4 | 5 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int t = 0;
for (int i = 0; i < s.size() - 2; i++)
if (s[i] == 'A' && s[i + 1] == 'B' && s[i + 2] == 'C')
t++;
cout << t << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int t = 0;
for (int i = 0; i < s.size() - 2; i++)
if (s[i] == 'A' && s[i + 1] == 'B' && s[i + 2] == 'C')
t++;
cout << t << endl;
return 0;
} | insert | 4 | 4 | 4 | 7 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
int N, i = 0, count = 0;
cin >> N;
cin >> S;
for (i + 2; i < N; i++) {
if (S.at(i - 2) == 'A' && S.at(i - 1) == 'B' && S.at(i) == 'C') {
count++;
}
}
cout << count << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
int N, i = 0, count = 0;
cin >> N;
cin >> S;
for (i; i < N - 2; i++) {
if (S.at(i) == 'A' && S.at(i + 1) == 'B' && S.at(i + 2) == 'C') {
count++;
}
}
cout << count << endl;
}
| replace | 10 | 12 | 10 | 12 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::at: __n (which is 18446744073709551614) >= this->size() (which is 10)
|
p02812 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
int main() {
int N;
string A;
cin >> N >> A;
int count = 0;
for (int i = 0; i < N; i++) {
if (A.at(i) == 'A') {
if (A.at(i + 1) == 'B') {
if (A.at(i + 2) == 'C') {
count++;
} else
continue;
} else
... | #include <iostream>
#include <string>
using namespace std;
int main() {
int N;
string A;
cin >> N >> A;
int count = 0;
for (int i = 0; i < N - 2; i++) {
if (A.at(i) == 'A') {
if (A.at(i + 1) == 'B') {
if (A.at(i + 2) == 'C') {
count++;
} else
continue;
} el... | replace | 9 | 10 | 9 | 10 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
typedef pair<int, int> P;
const int INF = 1001001001;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int ans = 0;
char n;
string s;
cin >> n >> s;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
typedef pair<int, int> P;
const int INF = 1001001001;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int ans = 0;
int n;
string s;
cin >> n >> s;
f... | replace | 15 | 16 | 15 | 16 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::at: __n (which is 1) >= this->size() (which is 1)
|
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string S;
cin >> S;
string str = S;
int count = 0;
for (int i = 0; i < N; i++) {
int j = i + 1;
int k = j + 1;
if (str.at(i) == 'A' && str.at(j) == 'B' && str.at(k) == 'C') {
count++;
}
}
cout << count <... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string S;
cin >> S;
string str = S;
int count = 0;
for (int i = 0; i < N - 2; i++) {
int j = i + 1;
int k = j + 1;
if (str.at(i) == 'A' && str.at(j) == 'B' && str.at(k) == 'C') {
count++;
}
}
cout << cou... | replace | 10 | 11 | 10 | 11 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
int ans = 0;
rep(i, n) {
if (s.at(i) == 'A') {
if (s.at(i + 1) == 'B') {
if (s.at(i + 2) == 'C') {
ans++;
}
}
}
}
c... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
int ans = 0;
rep(i, n - 2) {
if (s.at(i) == 'A') {
if (s.at(i + 1) == 'B') {
if (s.at(i + 2) == 'C') {
ans++;
}
}
}
}... | replace | 9 | 10 | 9 | 10 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int sum = 0;
string str;
cin >> N >> str;
for (int i = 0; i < N; i++) {
if (i == N - 1) {
break;
} else if (str.at(i) == 'A' && str.at(i + 1) == 'B' &&
str.at(i + 2) == 'C') {
sum++;
}
}
cout << sum <... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int sum = 0;
string str;
cin >> N >> str;
for (int i = 0; i < N; i++) {
if (i == N - 2) {
break;
} else if (str.at(i) == 'A' && str.at(i + 1) == 'B' &&
str.at(i + 2) == 'C') {
sum++;
}
}
cout << sum <... | replace | 9 | 10 | 9 | 10 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0;
for (int i = 0; i < s.size() - 2; i++) {
if (s[i] == 'A' && s[i + 1] == 'B' && s[i + 2] == 'C') {
ans++;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int n;
cin >> n >> s;
int ans = 0;
for (int i = 0; i < s.size() - 2; i++) {
if (s[i] == 'A' && s[i + 1] == 'B' && s[i + 2] == 'C') {
ans++;
}
}
cout << ans << endl;
} | replace | 5 | 6 | 5 | 7 | 0 | |
p02812 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <... | insert | 31 | 31 | 31 | 32 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::substr: __pos (which is 1) > this->size() (which is 0)
|
p02812 | 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() {
int n;
string s;
cin >> n;
cin >> s;
int ans = 0;
for (int i = 0; i < n; ++i) {
if (s.at(i) == 'A' && s.at(i + 1) == 'B' && s.at(i + 2) == 'C') {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
string s;
cin >> n;
cin >> s;
int ans = 0;
for (int i = 0; i < n - 2; ++i) {
if (s.at(i) == 'A' && s.at(i + 1) == 'B' && s.at(i + 2) == 'C'... | replace | 14 | 15 | 14 | 15 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int ans = 0;
string s;
cin >> n >> s;
for (int i = 0; i < n - 1; i++) {
// cout << s.at(i);
if ((s.at(i) == 'A') && (s.at(i + 1) == 'B') && (s.at(i + 2) == 'C'))
ans++;
}
cout << ans;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int ans = 0;
string s;
cin >> n >> s;
for (int i = 0; i < n - 2; i++) {
if ((s.at(i) == 'A') && (s.at(i + 1) == 'B') && (s.at(i + 2) == 'C'))
ans++;
}
cout << ans;
}
| replace | 8 | 10 | 8 | 9 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int count = 0;
for (int i = 0; i <= s.size() - 3; i++) {
if (s.at(i) == 'A') {
if (s.at(i + 1) == 'B' && s.at(i + 2) == 'C') {
count++;
}
}
}
cout << count << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string s;
cin >> s;
int count = 0;
for (int i = 0; i <= s.size() - 3; i++) {
if (s.at(i) == 'A') {
if (s.at(i + 1) == 'B' && s.at(i + 2) == 'C') {
count++;
}
}
}
cout << count << endl;
}
| insert | 4 | 4 | 4 | 6 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::at: __n (which is 2) >= this->size() (which is 2)
|
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <string>
using namespace std;
int main() {
int N;
string S;
cin >> N;
cin >> S;
int cow = 0;
for (int i = 0; i < N; i++) {
if (S.at(i) == 'A' && S.at(i + 1) == 'B' && S.at(i + 2) == 'C') {
cow++;
}
}
cout << cow << endl;
return 0;
} | #include <bits/stdc++.h>
#include <string>
using namespace std;
int main() {
int N;
string S;
cin >> N;
cin >> S;
int cow = 0;
/*
N -
3�ɂ��闝�R�Ƃ��āAString��i����i+2�܂ł����āA���O����n�܂�̂ŁA
�Ō�͓A�ꌅ�ɂȂ�̂Œ��ׂ�K�v���Ȃ��̂� i <= N-3
�ɂ��Ă���B i <= N-3�ɂ��Ȃ������ꍇ�ARunTime
Error(���s���G���[)�ɂȂ�... | replace | 14 | 15 | 14 | 27 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
string S;
cin >> N >> S;
int count = 0;
for (int i = 0; i < N; i++) {
if (S.at(i) == 'A' && S.at(i + 1) == 'B' && S.at(i + 2) == 'C') {
count++;
}
}
cout << count;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
string S;
cin >> N >> S;
int count = 0;
for (int i = 0; i < N - 2; i++) {
if (S.at(i) == 'A' && S.at(i + 1) == 'B' && S.at(i + 2) == 'C') {
count++;
}
}
cout << count;
} | replace | 10 | 11 | 10 | 11 | 0 | |
p02813 | Python | Runtime Error | # ABC150C - Count Order
from itertools import permutations
def main():
N, *PQ = map(int, open(0).read().split())
P, Q = PQ[:N], PQ[N:]
perms = list(permutations(range(1, N + 1), N))
ans = abs(perms.index(P) - perms.index(Q))
print(ans)
if __name__ == "__main__":
main()
| # ABC150C - Count Order
from itertools import permutations
def main():
N = int(input())
P = tuple(map(int, input().split()))
Q = tuple(map(int, input().split()))
perms = list(permutations(range(1, N + 1)))
ans = abs(perms.index(P) - perms.index(Q))
print(ans)
if __name__ == "__main__":
m... | replace | 5 | 8 | 5 | 9 | ValueError: [1, 3, 2] is not in list | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02813/Python/s593478625.py", line 14, in <module>
main()
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02813/Python/s593478625.py", line 9, in main
ans = abs(perms.index(P) - perms.... |
p02813 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ios ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
using namespace std;
int a[100], b[100], n, f[100], c[100];
int lowbit(int x) { return x & (-x); }
int add(int x) {
while (x <= n) {
c[x] += 1;
x += lowbit(x);
}
}
int pre(int x) {
int sum = 0;
while (x) {
sum ... | #include <bits/stdc++.h>
#define ios ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
using namespace std;
int a[100], b[100], n, f[100], c[100];
int lowbit(int x) { return x & (-x); }
void add(int x) {
while (x <= n) {
c[x] += 1;
x += lowbit(x);
}
}
int pre(int x) {
int sum = 0;
while (x) {
sum... | replace | 5 | 6 | 5 | 6 | 0 | |
p02813 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
using namespace std;
int rui(int a, int b) {
if (b == 0)
return 1;
return a * rui(a, b - 1);
}
int main() {
int N, P = 0, Q = 0, pre, num = 0, re, a = 0, b = 0;
bool te[10], flag;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> re;
P += re;
P *= 10;
... | #include <algorithm>
#include <iostream>
using namespace std;
int rui(int a, int b) {
if (b == 0)
return 1;
return a * rui(a, b - 1);
}
int main() {
int N, P = 0, Q = 0, pre, num = 0, re, a = 0, b = 0;
bool te[10], flag;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> re;
P += re;
P *= 10;
... | replace | 24 | 25 | 24 | 25 | TLE | |
p02813 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
#endif
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, i, c = 0;
char ch;
string s = "", t = "", u = "";
cin >> n;
for (i = 0; i < n; i++) {
cin >> ch;
s... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
#ifndef ONLINE_JUDGE
// freopen("input.txt","r",stdin);
#endif
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, i, c = 0;
char ch;
string s = "", t = "", u = "";
cin >> n;
for (i = 0; i < n; i++) {
cin >> ch;
... | replace | 7 | 8 | 7 | 8 | TLE | |
p02813 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#defi... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#defi... | insert | 45 | 45 | 45 | 47 | TLE | |
p02813 | C++ | Runtime Error | #include <bits/stdc++.h>
#define pb push_back
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define ll long long
#define ii pair<int, int>
#define vi vector<int>
#define vll vector<ll>
#define vii vector<ii>
using namespace std;
bool compare(vi a, vi b) {
for (int i = 0; i < a.size(); i... | #include <bits/stdc++.h>
#define pb push_back
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define ll long long
#define ii pair<int, int>
#define vi vector<int>
#define vll vector<ll>
#define vii vector<ii>
using namespace std;
bool compare(vi a, vi b) {
for (int i = 0; i < a.size(); i... | delete | 25 | 32 | 25 | 25 | 0 | |
p02813 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9 + 7;
constexpr ll MOD_LL = ll(1e9) + 7;
int main(void) {
int n;
ci... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9 + 7;
constexpr ll MOD_LL = ll(1e9) + 7;
int main(void) {
int n;
ci... | replace | 46 | 47 | 46 | 47 | -6 | munmap_chunk(): invalid pointer
|
p02813 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define pb push_back
#define eb emplace_back
#define xx first
#define yy second
#define INF 0x3f3f3f3f
#define show(x) cerr << #x << " : " << x << '\n';
#define yogeshk972() \
cerr << "\... | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define pb push_back
#define eb emplace_back
#define xx first
#define yy second
#define INF 0x3f3f3f3f
#define show(x) cerr << #x << " : " << x << '\n';
#define yogeshk972() \
cerr << "\... | replace | 21 | 27 | 21 | 27 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p02813 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iterator>
#include <set>
using namespace std;
// using namespace __gnu_pbds;
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(), x.end()
#define ll long long int
#define vi vector<int>
#define vii vector<pair<int, int>>
#define pii pair<int, int>
#define... | #include <bits/stdc++.h>
#include <iterator>
#include <set>
using namespace std;
// using namespace __gnu_pbds;
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(), x.end()
#define ll long long int
#define vi vector<int>
#define vii vector<pair<int, int>>
#define pii pair<int, int>
#define... | delete | 91 | 96 | 91 | 91 | TLE | |
p02813 | Python | Runtime Error | # ABC150C - Count Order
from itertools import permutations
def main():
N, *PQ = map(int, open(0).read().split())
P, Q = PQ[:N], PQ[N:]
perms = list(permutations(range(1, N + 1)))
ans = abs(perms.index(P) - perms.index(Q))
print(ans)
if __name__ == "__main__":
main()
| # ABC150C - Count Order
from itertools import permutations
def main():
N = int(input())
P = tuple(map(int, input().split()))
Q = tuple(map(int, input().split()))
perms = tuple(permutations(range(1, N + 1)))
ans = abs(perms.index(P) - perms.index(Q))
print(ans)
if __name__ == "__main__":
... | replace | 5 | 8 | 5 | 9 | ValueError: [1, 3, 2] is not in list | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02813/Python/s713702771.py", line 14, in <module>
main()
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02813/Python/s713702771.py", line 9, in main
ans = abs(perms.index(P) - perms.... |
p02813 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<int> a, b, c, d;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<int> a, b, c, d;
for (int i = 0; i < n; i++) {
int x;... | replace | 3 | 7 | 3 | 7 | 0 | |
p02813 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 5, M = 1e6 + 6, OO = 0x3f3f3f3f;
vector<int> v1, v2;
set<vector<int>> vs;
vector<int> tmp;
int n;
void brute(int idx) {
if (idx == n) {
if (tmp.size() == n) {
// for(auto x : tmp)
// cout<<x<<" ";
// put... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 5, M = 1e6 + 6, OO = 0x3f3f3f3f;
vector<int> v1, v2;
set<vector<int>> vs;
vector<int> tmp;
int n;
void brute(int idx) {
if (idx == n) {
if (tmp.size() == n) {
// for(auto x : tmp)
// cout<<x<<" ";
// put... | replace | 24 | 25 | 24 | 25 | TLE | |
p02814 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const long long inf = 1e18;
typedef long long ll;
#define rp(i, f, t) for (int i = f; i < t; i++)
#define pr(i, f, t) for (int i = t - 1; i >= f; i--)
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
map<long long, long long> prime_factor(long long ... | #include <bits/stdc++.h>
using namespace std;
const long long inf = 1e18;
typedef long long ll;
#define rp(i, f, t) for (int i = f; i < t; i++)
#define pr(i, f, t) for (int i = t - 1; i >= f; i--)
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
map<long long, long long> prime_factor(long long ... | replace | 26 | 39 | 26 | 33 | TLE | |
p02814 | C++ | Time Limit Exceeded | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
long long a[100000];
long long gcd(long long ... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
long long a[100000];
long long gcd(long long ... | insert | 60 | 60 | 60 | 64 | TLE | |
p02814 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
long long gcd(long long x, long long y) {
if (x < y)
return gcd(y, x);
else if (y == 0)
return x;
else
return gcd(y, x % y);
}
int main() {
long long N, M;
cin >> N >> M;
vector<long long> a(N), b(N);
for (int i = 0; i < N; i++) {
cin >> a[i]... | #include <bits/stdc++.h>
using namespace std;
long long gcd(long long x, long long y) {
if (x < y)
return gcd(y, x);
else if (y == 0)
return x;
else
return gcd(y, x % y);
}
int main() {
long long N, M;
cin >> N >> M;
vector<long long> a(N), b(N);
for (int i = 0; i < N; i++) {
cin >> a[i]... | replace | 38 | 39 | 38 | 43 | TLE | |
p02814 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
if (b > a) {
ll x = a;
a = b;
b = x;
}
if (a % b == 0) {
return b;
}
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a * (b / gcd(a, b)); }
int main() {
ll n, m;
cin >> n >> m;
vector<ll> lis(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
if (a % b == 0) {
return b;
}
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a * (b / gcd(a, b)); }
int main() {
ll n, m;
cin >> n >> m;
vector<ll> lis(n);
cin >> lis[0];
ll a = lis[0] / 2, b;
for (int... | delete | 5 | 10 | 5 | 5 | TLE | |
p02814 | C++ | Time Limit Exceeded | #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 | 295 | 296 | 295 | 296 | TLE | |
p02814 | C++ | Time Limit Exceeded | // template version 1.15
using namespace std;
#include <bits/stdc++.h>
// varibable settings
#define int long long
const int INF = 1e18;
// define basic macro {{{
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rep... | // template version 1.15
using namespace std;
#include <bits/stdc++.h>
// varibable settings
#define int long long
const int INF = 1e18;
// define basic macro {{{
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rep... | replace | 94 | 95 | 94 | 99 | TLE | |
p02814 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using ulint = unsigned 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 ... | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using ulint = unsigned 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 ... | replace | 228 | 229 | 228 | 235 | TLE | |
p02814 | C++ | Time Limit Exceeded | #include <algorithm>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
long long MOD = 1000000007;
long long gcd(long long N, long long M) {
while (true) {
if (mi... | #include <algorithm>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
long long MOD = 1000000007;
long long gcd(long long N, long long M) {
while (true) {
if (mi... | insert | 54 | 54 | 54 | 58 | TLE | |
p02814 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define min3(a, b, c) min(a, min(b, c))
#define max3(a, b, c) max(a, max(b, c))
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.siz... | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define min3(a, b, c) min(a, min(b, c))
#define max3(a, b, c) max(a, max(b, c))
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.siz... | insert | 36 | 36 | 36 | 41 | 0 | |
p02814 | C++ | Time Limit Exceeded | #include <algorithm>
#include <chrono>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define... | #include <algorithm>
#include <chrono>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define... | replace | 21 | 35 | 21 | 23 | TLE | |
p02814 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <unordered_map>
#include <vector>... | #include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <unordered_map>
#include <vector>... | replace | 75 | 76 | 75 | 82 | TLE | |
p02814 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m;
cin >> n >> m;
vector<long long> a(n);
long long memo = 0;
for (int i = 0; i < n; i++) {
long long x, cnt = 0;
cin >> x;
a[i] = x / 2;
while (x % 2 == 0) {
x /= 2;
cnt++;
}
if (i == 0)
memo = ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m;
cin >> n >> m;
vector<long long> a(n);
long long memo = 0;
for (int i = 0; i < n; i++) {
long long x, cnt = 0;
cin >> x;
a[i] = x / 2;
while (x % 2 == 0) {
x /= 2;
cnt++;
}
if (i == 0)
memo = ... | replace | 24 | 25 | 24 | 29 | TLE | |
p02814 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <utility>
#include <vector>
using namespace std;
// m > n >= 0
template <class T> T gcd(T m, T n) {
if (n == 0)
return m;
return gcd(n, m % n);
}
int halfNtimes(int n, int count) {
if (n % 2 == 0) {
n /= 2;
return ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <utility>
#include <vector>
using namespace std;
// m > n >= 0
template <class T> T gcd(T m, T n) {
if (n == 0)
return m;
return gcd(n, m % n);
}
int halfNtimes(int n, int count) {
if (n % 2 == 0) {
n /= 2;
return ... | replace | 55 | 62 | 55 | 65 | TLE | |
p02814 | C++ | Time Limit Exceeded | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) (v).begin(), (v).end()
using ll = long long;
template <typename T>
using posteriority_queue = priority_queue<T, vector<T>, greater<T>>;
const int INF... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) (v).begin(), (v).end()
using ll = long long;
template <typename T>
using posteriority_queue = priority_queue<T, vector<T>, greater<T>>;
const int INF... | replace | 48 | 49 | 48 | 49 | TLE | |
p02814 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long long ll;
typedef double ld;
const long long INF = (1LL << 62)... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long long ll;
typedef double ld;
const long long INF = (1LL << 62)... | replace | 52 | 54 | 52 | 60 | 0 | |
p02814 | C++ | Runtime Error | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define reps(i, n) for (int i = 1, i##_len = (int)(n); i <= i##_len; i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i ... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define reps(i, n) for (int i = 1, i##_len = (int)(n); i <= i##_len; i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i ... | replace | 53 | 54 | 53 | 54 | -8 | |
p02814 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
if (a < b)
return gcd(b, a);
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a * (b / gcd(a, b)); }
ll two(ll n) {
ll c = 0;
while (n % (0x01 << (c + 1)) == 0) {
c++;
}
retur... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
if (a < b)
return gcd(b, a);
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
// return a * (b / gcd(a, b));
return a * (b / __gcd(a, b));
}
ll two(ll n) {
ll c = 0;
while (n % (0x01 << ... | replace | 14 | 15 | 14 | 18 | TLE | |
p02814 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define MOD_1_000_000_007 (1000000007LL)
#define LINF (1LL << 60)
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define rep1(i, n) for (long long i = 1; i < (long long)(n); i++)
#define rep2(i, n) for (long long i = 2; i < (long long)(n); i++)
#define rep0c(i, n) for (long l... | #include <bits/stdc++.h>
#define MOD_1_000_000_007 (1000000007LL)
#define LINF (1LL << 60)
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define rep1(i, n) for (long long i = 1; i < (long long)(n); i++)
#define rep2(i, n) for (long long i = 2; i < (long long)(n); i++)
#define rep0c(i, n) for (long l... | replace | 55 | 56 | 55 | 62 | TLE | |
p02814 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
template <typename TYPE> void print_vec(const vector<TYPE> &v) {
for (int i = 0; i < v.size(); i++) {
cout << v[i] << " ";
}
cout << endl;
}
template <typename TYPE> void print_vec2(const vector<vector<TYPE>> &v) {
cout << endl;
cout <<... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
template <typename TYPE> void print_vec(const vector<TYPE> &v) {
for (int i = 0; i < v.size(); i++) {
cout << v[i] << " ";
}
cout << endl;
}
template <typename TYPE> void print_vec2(const vector<vector<TYPE>> &v) {
cout << endl;
cout <<... | replace | 31 | 33 | 31 | 32 | TLE | |
p02814 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
long long n, m;
long long gcd(int a, int b) {
int x = max(a, b);
int y = min(a, b);
if (y == 0) {
return x;
} else {
return gcd(x % y, y);
}
}
long long gmv(long long a, long long b) {
long long g = gcd(a, b);
return a * b / g;
}
long long gcdv(vect... | #include <bits/stdc++.h>
using namespace std;
long long n, m;
long long gcd(int a, int b) {
int x = max(a, b);
int y = min(a, b);
if (y == 0) {
return x;
} else {
return gcd(x % y, y);
}
}
long long gmv(long long a, long long b) {
long long g = gcd(a, b);
return a * b / g;
}
long long gcdv(vect... | replace | 23 | 24 | 23 | 24 | TLE | |
p02814 | C++ | Runtime Error | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, n) for (int i = 0; i... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, n) for (int i = 0; i... | replace | 59 | 60 | 59 | 66 | 0 | |
p02814 | C++ | Runtime Error | #if __has_include("debug.h")
#include "debug.h"
#else
#include <bits/stdc++.h>
using namespace std;
#define d(...) 2;
#endif
#define int long long int
#define ld long double
#define fast \
ios_base::sync_with_stdio(0); ... | #if __has_include("debug.h")
#include "debug.h"
#else
#include <bits/stdc++.h>
using namespace std;
#define d(...) 2;
#endif
#define int long long int
#define ld long double
#define fast \
ios_base::sync_with_stdio(0); ... | replace | 64 | 66 | 64 | 66 | 0 | |
p02814 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--... | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--... | insert | 50 | 50 | 50 | 51 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.