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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02806 | C++ | Time Limit Exceeded | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<pair<string, int>> playlist(N);
for (int i = 0; i < N; i++) {
cin >> playlist[i].first >> playlist[i].second;
}
string target;
cin >> target;
auto i = playlist.begin();
while (i !... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<pair<string, int>> playlist(N);
for (int i = 0; i < N; i++) {
cin >> playlist[i].first >> playlist[i].second;
}
string target;
cin >> target;
auto i = playlist.begin();
while (i !... | replace | 20 | 21 | 20 | 21 | TLE | |
p02806 | C++ | Runtime Error | #include <bits/stdc++.h>
//*************** Constraints are always Imaginary,I'm real **************
using namespace std;
#define int long long
#define MP make_pair
#define PB push_back
#define PI 3.1415926535897932384626433832795
#define MOD 1000000007
#define fi first
#define se second
typedef pair<int, int> PII;
type... | #include <bits/stdc++.h>
//*************** Constraints are always Imaginary,I'm real **************
using namespace std;
#define int long long
#define MP make_pair
#define PB push_back
#define PI 3.1415926535897932384626433832795
#define MOD 1000000007
#define fi first
#define se second
typedef pair<int, int> PII;
type... | replace | 20 | 24 | 20 | 24 | 0 | |
p02806 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define mem(a, b) memset(a, b, sizeof(a))
#define cin(a) scanf("%d", &a)
#define pii pair<int, int>
#define ll long long
#define gcd __gcd
const int inf = 0x3f3f3f3f;
const int maxn = 201110;
const int M = 1e9 + 7;
map<string, int> mp;
string a[100];
int t[100];
int main(... | #include <bits/stdc++.h>
using namespace std;
#define mem(a, b) memset(a, b, sizeof(a))
#define cin(a) scanf("%d", &a)
#define pii pair<int, int>
#define ll long long
#define gcd __gcd
const int inf = 0x3f3f3f3f;
const int maxn = 201110;
const int M = 1e9 + 7;
map<string, int> mp;
string a[100];
int t[100];
int main(... | delete | 16 | 20 | 16 | 16 | -11 | |
p02806 | C++ | Runtime Error | #include <bits/stdc++.h>
const int N = 50;
std::string names[N];
int len[N], n, ans = 0;
std::string music;
int main() {
std::cin >> n;
for (int i = 1; i <= n; i++)
std::cin >> names[i] >> len[i];
std::cin >> music;
bool flag{0};
for (int i = 1; i <= n; i++) {
if (flag)
ans += len[i];
if... | #include <bits/stdc++.h>
const int N = 5000;
std::string names[N];
int len[N], n, ans = 0;
std::string music;
int main() {
std::cin >> n;
for (int i = 1; i <= n; i++)
std::cin >> names[i] >> len[i];
std::cin >> music;
bool flag{0};
for (int i = 1; i <= n; i++) {
if (flag)
ans += len[i];
... | replace | 2 | 3 | 2 | 3 | 0 | |
p02806 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << ", " << p.second << ")";
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "{";
for (int i = 0; i < (int)v.size()... | #include "bits/stdc++.h"
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << ", " << p.second << ")";
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "{";
for (int i = 0; i < (int)v.size()... | delete | 160 | 164 | 160 | 160 | -6 | terminate called after throwing an instance of 'std::__ios_failure'
what(): basic_ios::clear: iostream error
|
p02806 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<pair<string, int>> v;
long long ans = 0;
string x;
bool f = 0;
for (int i = 0; i < n; i++) {
cin >> v[i].first >> v[i].second;
}
cin >> x;
for (int i = 0; i < n; i++) {
if (f) {
ans += v[i].second;
}... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<pair<string, int>> v(n);
long long ans = 0;
string x;
bool f = 0;
for (int i = 0; i < n; i++) {
cin >> v[i].first >> v[i].second;
}
cin >> x;
for (int i = 0; i < n; i++) {
if (f) {
ans += v[i].second;
... | replace | 5 | 6 | 5 | 6 | -11 | |
p02806 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n;
string s[n];
int t[n];
string x;
cin >> n;
for (int i = 0; i < n; i++)
cin >> s[i] >> t[i];
cin >> x;
int tsum = 0;
for (int i = 0; i < n; i++) {
if (s[i] == x) {
for (int j = i + 1; j < n; j++) {
tsum += t[j];
... | #include <iostream>
using namespace std;
int main() {
int n;
string s[55];
int t[55];
string x;
cin >> n;
for (int i = 0; i < n; i++)
cin >> s[i] >> t[i];
cin >> x;
int tsum = 0;
for (int i = 0; i < n; i++) {
if (s[i] == x) {
for (int j = i + 1; j < n; j++) {
tsum += t[j];
... | replace | 5 | 7 | 5 | 7 | 0 | |
p02806 | 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 Graph = vector<vector<int>>;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<string> s;
vector<int> t;
rep(i, n) cin >> s[i] >> t[i];
string x;
cin >> x;
int ans = 0;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<string> s(n);
vector<int> t(n);
rep(i, n) cin >> s[i] >> t[i];
string x;
cin >> x;
int ans ... | replace | 10 | 12 | 10 | 12 | -11 | |
p02806 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <list>
#include <numeric>
#include <stdio.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
int a, b, c;
string s, t;
int main() {
a = 0;
cin >> a;... | #include <algorithm>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <list>
#include <numeric>
#include <stdio.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
int a, b, c;
string s, t;
int main() {
a = 0;
cin >> a;... | insert | 30 | 30 | 30 | 31 | TLE | |
p02807 | C++ | Time Limit Exceeded | /*
Author : N_o_o_B
Created : January 14 2020 18:43:54
*/
#include <bits/stdc++.h>
using namespace std;
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
*/
#define TRACE
#ifdef TRACE
#define trace(...) ... | /*
Author : N_o_o_B
Created : January 14 2020 18:43:54
*/
#include <bits/stdc++.h>
using namespace std;
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
*/
#define TRACE
#ifdef TRACE
#define trace(...) ... | replace | 203 | 208 | 203 | 209 | TLE | |
p02807 | Python | Time Limit Exceeded | import math
n = int(input())
x = list(map(int, input().split()))
mod = 10**9 + 7
fac = math.factorial(n - 1)
def pow(n, p):
res = 1
while p > 0:
if p % 2 == 0:
n = n**2 % mod
p //= 2
else:
res = res * n % mod
p -= 1
return res % mod
res =... | import math
n = int(input())
x = list(map(int, input().split()))
mod = 10**9 + 7
fac = math.factorial(n - 1) % mod
def pow(n, p):
res = 1
while p > 0:
if p % 2 == 0:
n = n**2 % mod
p //= 2
else:
res = res * n % mod
p -= 1
return res % mod
... | replace | 6 | 7 | 6 | 7 | TLE | |
p02807 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define WHOLE(v) (v).begin(), (v).end()
#define REV_WHOLE(v) (v).rbegin(), (v).rend()
using i64 = int64_t;
using namespace std;
template <size_t I, class H, class... T> struct TupleReaderWriter {
static tuple<H, T...> r(istream &i) {
H v;
i >> v;
return tuple_cat(tuple<H>(v),
... | #include <bits/stdc++.h>
#define WHOLE(v) (v).begin(), (v).end()
#define REV_WHOLE(v) (v).rbegin(), (v).rend()
using i64 = int64_t;
using namespace std;
template <size_t I, class H, class... T> struct TupleReaderWriter {
static tuple<H, T...> r(istream &i) {
H v;
i >> v;
return tuple_cat(tuple<H>(v),
... | replace | 75 | 77 | 75 | 76 | TLE | |
p02807 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int max_n = 2005;
const int mod = 1e9 + 7;
inline int Add(int x, int y) { return (x += y) >= mod ? x - mod : x; }
inline int Sub(int x, int y) { return (x -= y) >= 0 ? x : x + mod; }
inline int Mul(int x, int y) { return 1ll * x * y % mod; }
int ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int max_n = 100005;
const int mod = 1e9 + 7;
inline int Add(int x, int y) { return (x += y) >= mod ? x - mod : x; }
inline int Sub(int x, int y) { return (x -= y) >= 0 ? x : x + mod; }
inline int Mul(int x, int y) { return 1ll * x * y % mod; }
in... | replace | 3 | 4 | 3 | 4 | 0 | |
p02807 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define debug(x) cerr << #x << " " << x << '\n'
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pli = pair<ll, int>;
const int INF = 0x3f3f3f3f, N = 1e5 + 5;
const ... | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define debug(x) cerr << #x << " " << x << '\n'
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pli = pair<ll, int>;
const int INF = 0x3f3f3f3f, N = 1e5 + 5;
const ... | replace | 52 | 58 | 52 | 62 | TLE | |
p02807 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
////////////
// ModInt //
////////////
// 四則演算の最も左に存在する値がModIntでなければキャストでバグる
// 例えばx = mint * 1000;やx = ModInt(1000) * mint;はいいがx = 1000 *
// mint;は駄目。
template <int64_t mod_ = 1'000'000'007> class ModInt {
private:
int64_t integer_;
public:
constexpr ModInt(const int64_t initial_number ... | #include <bits/stdc++.h>
////////////
// ModInt //
////////////
// 四則演算の最も左に存在する値がModIntでなければキャストでバグる
// 例えばx = mint * 1000;やx = ModInt(1000) * mint;はいいがx = 1000 *
// mint;は駄目。
template <int64_t mod_ = 1'000'000'007> class ModInt {
private:
int64_t integer_;
public:
constexpr ModInt(const int64_t initial_number ... | replace | 148 | 157 | 148 | 152 | TLE | |
p02807 | C++ | Runtime Error | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author Gosu_Hiroo
*/
#include <fstream>
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#ifdef int
#define VI vector<long long>
#define V2I(v, size_1, size_2, value) ... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author Gosu_Hiroo
*/
#include <fstream>
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#ifdef int
#define VI vector<long long>
#define V2I(v, size_1, size_2, value) ... | replace | 482 | 483 | 482 | 483 | 0 | |
p02807 | C++ | Time Limit Exceeded | #include <iostream>
#include <string>
#include <vector>
#define rep(i, start, end) for (int i = (int)start; i < (int)end; ++i)
#define rrep(i, start, end) for (int i = (int)start - 1; i >= end; --i)
#define iter(i, c) for (auto i = (c).begin(); i != (c).end(); ++i)
#define riter(i, c) for (auto i = (c).rbegin(); i != (... | #include <iostream>
#include <string>
#include <vector>
#define rep(i, start, end) for (int i = (int)start; i < (int)end; ++i)
#define rrep(i, start, end) for (int i = (int)start - 1; i >= end; --i)
#define iter(i, c) for (auto i = (c).begin(); i != (c).end(); ++i)
#define riter(i, c) for (auto i = (c).rbegin(); i != (... | replace | 115 | 120 | 115 | 118 | TLE | |
p02807 | C++ | Runtime Error | #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <algorithm>
#include <array>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#... | #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <algorithm>
#include <array>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#... | replace | 45 | 46 | 45 | 46 | 0 | |
p02807 | C++ | Runtime Error | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (int)(b); i++)
#define FORD(i, a, b) for (int i = a; i > (int)(b); i--)
#define PPC(x) __builtin_popcount(x)
#define pb push_back
#define ALL(x) (x).begin(), (x).end()
#define ft first
#define sd second
#ifdef DEBUG
#inclu... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (int)(b); i++)
#define FORD(i, a, b) for (int i = a; i > (int)(b); i--)
#define PPC(x) __builtin_popcount(x)
#define pb push_back
#define ALL(x) (x).begin(), (x).end()
#define ft first
#define sd second
#ifdef DEBUG
#inclu... | replace | 16 | 17 | 16 | 17 | 0 | |
p02807 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <s... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <s... | replace | 214 | 215 | 214 | 215 | 0 | |
p02807 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcount
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock() / CLOCKS_PER_SEC
const int MOD = 10... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcount
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock() / CLOCKS_PER_SEC
const int MOD = 10... | replace | 49 | 56 | 49 | 56 | TLE | |
p02807 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T, class U> using P = pair<T, U>;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;
constexpr ll mod = 1e9 + 7;
struct mint {
ll x;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint &operat... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T, class U> using P = pair<T, U>;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;
constexpr ll mod = 1e9 + 7;
struct mint {
ll x;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint &operat... | delete | 91 | 92 | 91 | 91 | 0 | |
p02807 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long int ll;
typedef uint_fast64_t u64;
#define bit(n, k) ((n >> k) & 1) /*nのk bit目*/
const int MOD = 1000... | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long int ll;
typedef uint_fast64_t u64;
#define bit(n, k) ((n >> k) & 1) /*nのk bit目*/
const int MOD = 1000... | replace | 82 | 83 | 82 | 83 | 0 | |
p02807 | C++ | Runtime Error | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rfor(i, m, n) for (int i = (m); i >= (n); --i)
#define sz(x) ((int)(x).size())
#define all(x) (x).begi... | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rfor(i, m, n) for (int i = (m); i >= (n); --i)
#define sz(x) ((int)(x).size())
#define all(x) (x).begi... | delete | 455 | 459 | 455 | 455 | 0 | |
p02807 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int p = (1e9 + 7);
int po(int a, int b) {
if (b == 0) {
return 1;
}
if (b == 1) {
return a;
}
if (b % 2 == 0) {
int u = po(a, b / 2);
return (u * u) % p;
}
int u = po(a, b - 1);
return (a * u) % p;
}
int inv(int x... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int p = (1e9 + 7);
int po(int a, int b) {
if (b == 0) {
return 1;
}
if (b == 1) {
return a;
}
if (b % 2 == 0) {
int u = po(a, b / 2);
return (u * u) % p;
}
int u = po(a, b - 1);
return (a * u) % p;
}
int inv(int x... | replace | 31 | 39 | 31 | 40 | TLE | |
p02807 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ff first
#define ss second
// #define endl "\n"
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x.size())
#define PI 3.1415926535897932384626433832795
int MOD = 1e9 + 7;
int powmod(int a, int l, int md) {
int res = 1;
while (l) ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ff first
#define ss second
// #define endl "\n"
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x.size())
#define PI 3.1415926535897932384626433832795
int MOD = 1e9 + 7;
int powmod(int a, int l, int md) {
int res = 1;
while (l) ... | replace | 120 | 138 | 120 | 144 | TLE | |
p02807 | C++ | Runtime Error | // 高知能系Vtuberの高井茅乃です。
// Twitter: https://twitter.com/takaichino
// YouTube: https://www.youtube.com/channel/UCTOxnI3eOI_o1HRgzq-LEZw
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF INT_MAX
#define LLINF LLONG_MAX
#define REP(i, n) for (int i = 0; i < n; i++)
#define REP1(i, n) for (in... | // 高知能系Vtuberの高井茅乃です。
// Twitter: https://twitter.com/takaichino
// YouTube: https://www.youtube.com/channel/UCTOxnI3eOI_o1HRgzq-LEZw
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF INT_MAX
#define LLINF LLONG_MAX
#define REP(i, n) for (int i = 0; i < n; i++)
#define REP1(i, n) for (in... | replace | 107 | 110 | 107 | 112 | 0 | |
p02807 | C++ | Time Limit Exceeded | #define DEBUG 1
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vect... | #define DEBUG 1
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vect... | replace | 248 | 260 | 248 | 270 | TLE | |
p02807 | C++ | Runtime Error | #include <cassert>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <functional>
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_s... | #include <cassert>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <functional>
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_s... | replace | 266 | 267 | 266 | 267 | 0 | |
p02807 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n); i >= 0; i--)
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define ALL(obj) begin(obj), end(obj)
using namespace std;
using ll = long long;
using ull = unsigned long long;
const int INF = 2100100100;
co... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n); i >= 0; i--)
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define ALL(obj) begin(obj), end(obj)
using namespace std;
using ll = long long;
using ull = unsigned long long;
const int INF = 2100100100;
co... | replace | 107 | 108 | 107 | 108 | 0 | |
p02807 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define rep(i, x) for (ll i = 0; i < (ll)(x); i++)
#define pb push_back
#define eb emplace_back
#define debug(x) cerr << #x << ": " << (x) << "\n";
#define all(x) (... | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define rep(i, x) for (ll i = 0; i < (ll)(x); i++)
#define pb push_back
#define eb emplace_back
#define debug(x) cerr << #x << ": " << (x) << "\n";
#define all(x) (... | replace | 93 | 94 | 93 | 94 | 0 | |
p02808 | C++ | Runtime Error | #line 1 "main.cpp"
#include <bits/stdc++.h>
#line 2 "/home/ubuntu/Library/utils/macros.hpp"
#define REP(i, n) for (int i = 0; (i) < (int)(n); ++(i))
#define REP3(i, m, n) for (int i = (m); (i) < (int)(n); ++(i))
#define REP_R(i, n) for (int i = (int)(n)-1; (i) >= 0; --(i))
#define REP3R(i, m, n) for (int i = (int)(n)-1... | #line 1 "main.cpp"
#include <bits/stdc++.h>
#line 2 "/home/ubuntu/Library/utils/macros.hpp"
#define REP(i, n) for (int i = 0; (i) < (int)(n); ++(i))
#define REP3(i, m, n) for (int i = (m); (i) < (int)(n); ++(i))
#define REP_R(i, n) for (int i = (int)(n)-1; (i) >= 0; --(i))
#define REP3R(i, m, n) for (int i = (int)(n)-1... | replace | 202 | 203 | 202 | 203 | 0 | |
p02808 | C++ | Runtime Error | #include <cstring>
#include <iostream>
using namespace std;
const int M = 1000000007;
int main() {
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
long long dp[k + 1][n + 1], comb[n + 1][n + 1];
memset(comb, 0, sizeof comb);
comb[0][0] = 1;
for (int i = 1; i <= n; i++)
... | #include <cstring>
#include <iostream>
using namespace std;
const int M = 1000000007;
int main() {
int n, k;
cin >> n >> k;
int a[k];
for (int i = 0; i < k; i++)
cin >> a[i];
long long dp[k + 1][n + 1], comb[n + 1][n + 1];
memset(comb, 0, sizeof comb);
comb[0][0] = 1;
for (int i = 1; i <= n; i++)
... | replace | 9 | 11 | 9 | 11 | 0 | |
p02808 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define MAX_N 200010
long long inv[MAX_N];
long long factorial[MAX_N];
long long inv_factorial[MAX_N];
void GetInv() {
for (int i = 1; i < MAX_N; i++) {
if (i == 1)
inv[i] = 1;
else {
inv[i] = (mod - (mod / i) * inv[mod % i]) %... | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define MAX_N 200010
long long inv[MAX_N];
long long factorial[MAX_N];
long long inv_factorial[MAX_N];
void GetInv() {
for (int i = 1; i < MAX_N; i++) {
if (i == 1)
inv[i] = 1;
else {
inv[i] = (mod - (mod / i) * inv[mod % i]) %... | replace | 63 | 64 | 63 | 64 | 0 | |
p02808 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define LLI long long int
#define FOR(v, a, b) for (LLI v = (a); v < (b); ++v)
#define FORE(v, a, b) for (LLI v = (a); v <= (b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define REV(v, a, b) for (LLI v = (a); v >= (b); --v)
#define ALL(x) (x).begin(), (x).end()
#defi... | #include <bits/stdc++.h>
#define LLI long long int
#define FOR(v, a, b) for (LLI v = (a); v < (b); ++v)
#define FORE(v, a, b) for (LLI v = (a); v <= (b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define REV(v, a, b) for (LLI v = (a); v >= (b); --v)
#define ALL(x) (x).begin(), (x).end()
#defi... | replace | 289 | 291 | 289 | 292 | TLE | |
p02808 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <s... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <s... | replace | 212 | 213 | 212 | 213 | 0 | |
p02808 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define mod 1000000007
using namespace std;
int n, k, a[21];
int dp[21][1005];
int C[1005][1005];
int main() {
cin >> n >> k;
for (int i = 1; i <= k; i++)
cin >> a[i];
C[0][0] = 1;
for (int i = 1; i <= n; i++) {
C[i][0] = 1;
for (int j = 1; j <= i; j++)
C[i][j] = (C[i... | #include <bits/stdc++.h>
#define mod 1000000007
using namespace std;
int n, k, a[21];
int dp[21][1005];
int C[1005][1005];
int main() {
cin >> n >> k;
for (int i = 1; i <= k; i++)
cin >> a[i];
C[0][0] = 1;
for (int i = 1; i <= n; i++) {
C[i][0] = 1;
for (int j = 1; j <= i; j++)
C[i][j] = (C[i... | replace | 22 | 27 | 22 | 25 | TLE | |
p02808 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
const int maxn = 1005;
const int mod = 1e9 + 7;
int dp[22][maxn];
int C[maxn][maxn];
void init() {
for (int i = 0; i < maxn; i++) {
C[i][0] = 1;
for (int j = 1; j <= i; j++)
C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % mod;
}
}
int m... | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
const int maxn = 1005;
const int mod = 1e9 + 7;
int dp[22][maxn];
int C[maxn][maxn];
void init() {
for (int i = 0; i < maxn; i++) {
C[i][0] = 1;
for (int j = 1; j <= i; j++)
C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % mod;
}
}
int m... | replace | 18 | 19 | 18 | 19 | 0 | |
p02809 | C++ | Runtime Error | #include <iostream>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
template <class T> class RangeMin {
private:
vector<T> seg;
int n;
public:
RangeMin(const vector<T> &v) : n(v.size()), seg(2 * v.size()) {
for (int i = 0; i < n; ++i)
seg[i + n] = v[i];
for (int i = n -... | #include <iostream>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
template <class T> class RangeMin {
private:
vector<T> seg;
int n;
public:
RangeMin(const vector<T> &v) : n(v.size()), seg(2 * v.size()) {
for (int i = 0; i < n; ++i)
seg[i + n] = v[i];
for (int i = n -... | replace | 110 | 111 | 110 | 113 | 0 | |
p02809 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
template <class G> class Fenwick_tree {
vector<G> a;
public:
Fenwick_tree(int n) : a(n) {}
void add(int i, G val) {
for (i++; i <= a.size(); i += i & -i)
a[i - 1] += val;
}
G sum(int l, int r) const {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
template <class G> class Fenwick_tree {
vector<G> a;
public:
Fenwick_tree(int n) : a(n) {}
void add(int i, G val) {
for (i++; i <= a.size(); i += i & -i)
a[i - 1] += val;
}
G sum(int l, int r) const {
... | replace | 125 | 126 | 125 | 126 | TLE | |
p02809 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define vv(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))
#define vvi vector<vector<int>>
#define vv... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define vv(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))
#define vvi vector<vector<int>>
#define vv... | replace | 84 | 91 | 84 | 101 | TLE | |
p02809 | Python | Runtime Error | import sys
from collections import defaultdict
from heapq import heappop, heappush
from itertools import permutations
from operator import itemgetter
# ある条件に当てはまらない限り、i番目に置く数字 xi は、
# それまで使ってない中で最も小さい数字か、
# またはその次に小さい数字（x[i-1]の右に最も小さい数字を置けない場合）
#
# ある条件: 以下の条件を満たす、未使用の数 k がある
# 残っているk以外の全ての数字が、kを共通して右側に置けない数として指定している... | import sys
from collections import defaultdict
from heapq import heappop, heappush
from itertools import permutations
from operator import itemgetter
# ある条件に当てはまらない限り、i番目に置く数字 xi は、
# それまで使ってない中で最も小さい数字か、
# またはその次に小さい数字（x[i-1]の右に最も小さい数字を置けない場合）
#
# ある条件: 以下の条件を満たす、未使用の数 k がある
# 残っているk以外の全ての数字が、kを共通して右側に置けない数として指定している... | replace | 67 | 71 | 67 | 72 | 0 | |
p02809 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f(i, x, n) for (int i = x; i < (int)(n); ++i)
int const N = 100000;
int a[N + 1], an[N + 1], fr[N + 1], n;
set<pair<int, int>> st;
set<int> lft;
void rm(int t) {
lft.erase(t);
st.erase(make_pair(fr[a[t]], a[t]));
--fr[a[t]];
st.insert(... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f(i, x, n) for (int i = x; i < (int)(n); ++i)
int const N = 100000;
int a[N + 1], an[N + 1], fr[N + 1], n;
set<pair<int, int>> st;
set<int> lft;
void rm(int t) {
lft.erase(t);
st.erase(make_pair(fr[a[t]], a[t]));
--fr[a[t]];
st.insert(... | replace | 33 | 35 | 33 | 35 | TLE | |
p02809 | C++ | Runtime Error | #include <bits/stdc++.h>
#define XX first
#define YY second
#define pb emplace_back
#define FOR(i, a, b) for (int(i) = (a); i < (b); ++(i))
#define EFOR(i, a, b) for (int(i) = (a); i <= (b); ++(i))
#define rep(X, Y) for (int(X) = 0; (X) < (Y); ++(X))
#define REP rep
#define rrep(X, Y) for (int(X) = (Y)-1; (X) >= 0; --(... | #include <bits/stdc++.h>
#define XX first
#define YY second
#define pb emplace_back
#define FOR(i, a, b) for (int(i) = (a); i < (b); ++(i))
#define EFOR(i, a, b) for (int(i) = (a); i <= (b); ++(i))
#define rep(X, Y) for (int(X) = 0; (X) < (Y); ++(X))
#define REP rep
#define rrep(X, Y) for (int(X) = (Y)-1; (X) >= 0; --(... | replace | 97 | 98 | 97 | 103 | 0 | |
p02809 | C++ | Runtime Error | /**
* author: otera
**/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <se... | /**
* author: otera
**/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <se... | insert | 111 | 111 | 111 | 113 | 0 | |
p02809 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define fr(i, n) for (int i = 0; i < (n); ++i)
#define Fr(i, n) for (int i = 1; i <= (n); ++i)
#define ifr(i, n) for (int i = (n)-1; i >= 0; --i)
#define iFr(i, n) for (int i = (n); i > 0; --i)
template <size_t n, class T> struct heap {
size_t sz;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define fr(i, n) for (int i = 0; i < (n); ++i)
#define Fr(i, n) for (int i = 1; i <= (n); ++i)
#define ifr(i, n) for (int i = (n)-1; i >= 0; --i)
#define iFr(i, n) for (int i = (n); i > 0; --i)
template <size_t n, class T> struct heap {
size_t sz;
... | replace | 90 | 91 | 90 | 93 | 0 | |
p02809 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int const maxn = 1e5 + 10;
int N, a[maxn], b[maxn];
int main() {
scanf("%d", &N);
int deg[maxn] = {};
for (int i = 1; i <= N; i++) {
scanf("%d", &a[i]);
deg[a[i]]++;
}
bool vis[maxn] = {};
function<void(int, int)> dfs = [&](int cur, int mn) {
if... | #include <bits/stdc++.h>
using namespace std;
int const maxn = 1e5 + 10;
int N, a[maxn], b[maxn];
int main() {
scanf("%d", &N);
int deg[maxn] = {};
for (int i = 1; i <= N; i++) {
scanf("%d", &a[i]);
deg[a[i]]++;
}
bool vis[maxn] = {};
function<void(int, int)> dfs = [&](int cur, int mn) {
if... | replace | 25 | 26 | 25 | 26 | TLE | |
p02809 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#in... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#in... | replace | 180 | 182 | 180 | 203 | 0 | |
p02809 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#in... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#in... | replace | 65 | 66 | 65 | 66 | 0 | |
p02809 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define uint unsigned int
#define ull unsigned long long
#define inf 1010000000
#define infll 1010000000000000000ll
#define vi vector<int>
#define vll vector<ll>
#define pb push_back
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pdd pair<double, double>
#defin... | #include <bits/stdc++.h>
#define ll long long
#define uint unsigned int
#define ull unsigned long long
#define inf 1010000000
#define infll 1010000000000000000ll
#define vi vector<int>
#define vll vector<ll>
#define pb push_back
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pdd pair<double, double>
#defin... | insert | 72 | 72 | 72 | 74 | 0 | |
p02809 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(0);
#define pb push_back
#define eb emplace_back
#define ins insert
#define ph push
#define f first
#... | #include "bits/stdc++.h"
using namespace std;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(0);
#define pb push_back
#define eb emplace_back
#define ins insert
#define ph push
#define f first
#... | replace | 73 | 74 | 73 | 74 | 0 | |
p02809 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#includ... | replace | 43 | 44 | 43 | 44 | 0 | |
p02809 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <random>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
// #define int ll
typedef pair<int, int> pii;
typedef pair<pii, pii> piii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector<vi> vvi;
ty... | #include <bits/stdc++.h>
#include <random>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
// #define int ll
typedef pair<int, int> pii;
typedef pair<pii, pii> piii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector<vi> vvi;
ty... | replace | 219 | 223 | 219 | 223 | 0 | |
p02809 | C++ | Runtime Error | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (int)(b); i++)
#define FORD(i, a, b) for (int i = a; i > (int)(b); i--)
#define PPC(x) __builtin_popcount(x)
#define pb push_back
#define ALL(x) (x).begin(), (x).end()
#define ft first
#define sd second
#ifdef DEBUG
#inclu... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (int)(b); i++)
#define FORD(i, a, b) for (int i = a; i > (int)(b); i--)
#define PPC(x) __builtin_popcount(x)
#define pb push_back
#define ALL(x) (x).begin(), (x).end()
#define ft first
#define sd second
#ifdef DEBUG
#inclu... | insert | 58 | 58 | 58 | 61 | 0 | |
p02810 | C++ | Time Limit Exceeded | #pragma GCC optimize("O2")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2,ssse3,tune=native")
#include <bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define pb push_back
using namespace std;
using ll = long long;
using vi = vector<ll>;
using pi = pair... | #pragma GCC optimize("O2")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2,ssse3,tune=native")
#include <bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define pb push_back
using namespace std;
using ll = long long;
using vi = vector<ll>;
using pi = pair... | insert | 63 | 63 | 63 | 65 | TLE | |
p02810 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<typename T> using gpp_set = tree<T, null_type, less<T>, rb_tree_tag,
tree_order_statistics_node_update>; template<typename T, typename L> using
gpp_map = tre... | #include <bits/stdc++.h>
using namespace std;
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<typename T> using gpp_set = tree<T, null_type, less<T>, rb_tree_tag,
tree_order_statistics_node_update>; template<typename T, typename L> using
gpp_map = tre... | replace | 205 | 206 | 205 | 206 | 0 | |
p02810 | C++ | Time Limit Exceeded | /*
`-:://:::-
`//:-------:/:`
.+:--.......--:+`
`+:--..`````..--//`
.o:--..`` ``..--:o`
... | /*
`-:://:::-
`//:-------:/:`
.+:--.......--:+`
`+:--..`````..--//`
.o:--..`` ``..--:o`
... | insert | 371 | 371 | 371 | 373 | TLE | |
p02811 | Python | Runtime Error | K = int(input("Enter k: "))
X = int(input("Enter x: "))
if K * 500 >= X:
print("Yes")
else:
print("No")
| K, X = map(int, input().split())
if K * 500 >= X:
print("Yes")
else:
print("No")
| replace | 0 | 2 | 0 | 1 | ValueError: invalid literal for int() with base 10: '2 900' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02811/Python/s761507450.py", line 1, in <module>
K = int(input("Enter k: "))
ValueError: invalid literal for int() with base 10: '2 900'
|
p02811 | Python | Runtime Error | if __name__ == "__main__":
x = int(input())
m, n = map(int, input().split())
if m * 500 >= n:
print("Yes")
else:
print("No")
| if __name__ == "__main__":
m, n = map(int, input().split())
if m * 500 >= n:
print("Yes")
else:
print("No")
| delete | 1 | 2 | 1 | 1 | ValueError: invalid literal for int() with base 10: '2 900' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02811/Python/s384378340.py", line 2, in <module>
x = int(input())
ValueError: invalid literal for int() with base 10: '2 900'
|
p02811 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define END '\n'
#define int long long
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ss second
#define trace(x) cerr << x << END;
#define loop(i, a, b) for (int i = (a); i < (b); i++)
#define loopb(i, b, a) for (int i = (b); i > (a); --i)
const in... | #include <bits/stdc++.h>
using namespace std;
#define END '\n'
#define int long long
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ss second
#define trace(x) cerr << x << END;
#define loop(i, a, b) for (int i = (a); i < (b); i++)
#define loopb(i, b, a) for (int i = (b); i > (a); --i)
const in... | replace | 22 | 30 | 22 | 23 | 0 | |
p02811 | Python | Runtime Error | import itertools
N = int(input())
P = tuple(map(int, input().split()))
Q = tuple(map(int, input().split()))
permutation = list(itertools.permutations([x for x in range(1, N + 1)]))
a = permutation.index(P) + 1
b = permutation.index(Q) + 1
print(abs(a - b))
| K, X = map(int, input().split())
print("Yes" if K * 500 >= X else "No")
| replace | 0 | 10 | 0 | 2 | ValueError: invalid literal for int() with base 10: '2 900' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02811/Python/s360744826.py", line 3, in <module>
N = int(input())
ValueError: invalid literal for int() with base 10: '2 900'
|
p02811 | 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 | 0 | |
p02811 | C++ | Runtime Error | #include "bits/stdc++.h"
#define ll long long int
#define F first
#define S second
const ll mod = 1e9 + 7;
#define fastio \
ios_base::sync_with_stdio(0); \
cin.tie(0);
using namespace std;
// ll gcd(ll a,... | #include "bits/stdc++.h"
#define ll long long int
#define F first
#define S second
const ll mod = 1e9 + 7;
#define fastio \
ios_base::sync_with_stdio(0); \
cin.tie(0);
using namespace std;
// ll gcd(ll a,... | replace | 54 | 58 | 54 | 58 | 0 | |
p02811 | C++ | Runtime Error | #include <bits/stdc++.h>
#define endl '\n'
#define fastIO \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define int long lo... | #include <bits/stdc++.h>
#define endl '\n'
#define fastIO \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define int long lo... | replace | 26 | 27 | 26 | 27 | 0 | |
p02811 | 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;
void solve() { return; }
int32_t main() {
ios_base::sync_w... | #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;
void solve() { return; }
int32_t main() {
int n, k;
cin... | delete | 17 | 25 | 17 | 17 | 0 | |
p02811 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
#define endl '\n'
#define loop(i, m, n) for (ll i = m; i < n; i++)
#define loope(i, m, n) for (ll i = m; i <= n; i++)
#define epool(i, m, n) for (ll i = m; i >= n; i--)
#define mod 1000000007
#define mod2 998... | #include <bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
#define endl '\n'
#define loop(i, m, n) for (ll i = m; i < n; i++)
#define loope(i, m, n) for (ll i = m; i <= n; i++)
#define epool(i, m, n) for (ll i = m; i >= n; i--)
#define mod 1000000007
#define mod2 998... | replace | 54 | 60 | 54 | 60 | 0 | |
p02811 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
return x * 500 >= y;
} | #include <algorithm>
#include <cassert>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
if (x * 500 >= y)
cout << "Yes";
else
cout << "No";
return 0;
}
| replace | 12 | 13 | 12 | 17 | 1 | |
p02811 | C++ | Runtime Error | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
constexpr char ln = '\n';
constexpr ... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
constexpr char ln = '\n';
constexpr ... | replace | 34 | 35 | 34 | 35 | -6 | terminate called after throwing an instance of 'std::logic_error'
what(): basic_string: construction from null is not valid
|
p02811 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define mod 1000000007
#define qmod 998244353
#define M 1000001
#define endl "\n"
#define all(a) (a).begin(), (a).end()
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define repr(i, a, b) for (... | #include <bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define mod 1000000007
#define qmod 998244353
#define M 1000001
#define endl "\n"
#define all(a) (a).begin(), (a).end()
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define repr(i, a, b) for (... | replace | 25 | 29 | 25 | 29 | 0 | |
p02811 | 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(0);
cout.tie(0);
int a, b;
cin >> a >> b;
if (a * 500 >= b)
cout << "Yes" << endl;
else
cout... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base ::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int a, b;
cin >> a >> b;
if (a * 500 >= b)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | delete | 4 | 8 | 4 | 4 | 0 | |
p02811 | 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 - 2; 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 K, X;
cin >> K >> X;
if (K * 500 >= X)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | replace | 4 | 14 | 4 | 10 | 0 | |
p02811 | C++ | Runtime Error | #include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define rep(i, begin, end) \
for (__typeof(end) i = (begin) - ((begin) > (end)); \
i != (end) - ((begi... | #include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define rep(i, begin, end) \
for (__typeof(end) i = (begin) - ((begin) > (end)); \
i != (end) - ((begi... | replace | 52 | 56 | 52 | 56 | 0 | |
p02811 | 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 <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
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')
ans++;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
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')
ans++;
}
cout << ans << endl;
return 0;
} | replace | 10 | 11 | 10 | 11 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int N, count = 0;
string S;
cin >> N;
cin >> S;
rep(i, N) {
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>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int N, count = 0;
string S;
cin >> N;
cin >> S;
// rep(i, N) { N-1かN番目に'A'があったらN+1かN+2番目まで操作を行ってしまう
rep(i, N - 2) {
if (S.at(i) == 'A' && S.at(i + 1) == 'B' && S.at(i + 2) == 'C') {
count++... | replace | 10 | 11 | 10 | 12 | 0 | |
p02812 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main(void) {
int count = 0;
int N;
string s;
cin >> N >> s;
for (int i = 0; i < N; i++) {
if (s.at(i) == 'A') {
if (i + 2 <= N) {
if (s.at(i + 1) == 'B') {
if (s.at(i + 2) == 'C') {
count++;
}
}
}
... | #include <iostream>
using namespace std;
int main(void) {
int count = 0;
int N;
string s;
cin >> N >> s;
for (int i = 0; i < N; i++) {
if (s.at(i) == 'A') {
if (i + 2 <= N - 1) {
if (s.at(i + 1) == 'B') {
if (s.at(i + 2) == 'C') {
count++;
}
}
}... | replace | 10 | 11 | 10 | 11 | 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' && 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;
int 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;
return 0;
} | replace | 9 | 10 | 9 | 10 | 0 | |
p02812 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
string objStr;
int len, count = 0;
cin >> len;
getline(cin, objStr);
for (int i = 0; i <= len - 3; i++) {
if (objStr.substr(i, 3) == "ABC") {
++count;
i = i + 2;
}
}
cout << count << endl;
} | #include <iostream>
using namespace std;
int main() {
string objStr;
int len, count = 0;
cin >> len;
cin >> objStr;
for (int i = 0; i <= len - 3; i++) {
if (objStr.substr(i, 3) == "ABC") {
++count;
i = i + 2;
}
}
cout << count << endl;
}
| replace | 7 | 8 | 7 | 8 | -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 <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int sum = 0;
for (int i = 0; i < s.size() - 2; i++) {
if (s.substr(i, 3) == "ABC") {
sum++;
}
}
cout << sum << endl;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int sum = 0;
for (int i = 0; i < s.size() - 2; i++) {
if (s.substr(i, 3) == "ABC") {
sum++;
}
}
cout << sum << endl;
} | insert | 5 | 5 | 5 | 7 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
#define yn ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
#define yn ... | insert | 15 | 15 | 15 | 17 | 0 | |
p02812 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n, count = 0;
cin >> n;
string s;
for (int i = 0; i < n; ++i)
cin >> s[i];
for (int i = 0; i < n; ++i) {
if (s.substr(i, 3) == "ABC")
count++;
}
cout << count << endl;
}
| #include <iostream>
using namespace std;
int main() {
int n, count = 0;
cin >> n;
string s;
for (int i = 0; i < n; ++i)
cin >> s[i];
for (int i = 0; i < n - 2; ++i) {
if (s[i] == 'A' && s[i + 1] == 'B' && s[i + 2] == 'C')
count++;
}
cout << count << endl;
}
| replace | 9 | 11 | 9 | 11 | -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++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0;
char ch[n + 1];
cin >> n;
for (int i = 1; i <= n; i++)
cin >> ch[i];
for (int i = 3; i <= n; i++) {
if (ch[i] == 'C' && ch[i - 1] == 'B' && ch[i - 2] == 'A')
ans++;
}
cout << ans;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0;
string s;
cin >> n >> s;
for (int i = 2; i < n; i++) {
if (s[i] == 'C' && s[i - 1] == 'B' && s[i - 2] == 'A')
ans++;
}
cout << ans;
return 0;
}
| replace | 4 | 10 | 4 | 8 | TLE | |
p02812 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
int main() {
string S;
cin >> S;
long ans = 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')
ans++;
}
cout << ans << endl;
} | #include "bits/stdc++.h"
using namespace std;
int main() {
int N;
cin >> N;
string S;
cin >> S;
long ans = 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')
ans++;
}
cout << ans << endl;
} | insert | 3 | 3 | 3 | 5 | 0 | |
p02812 | C++ | Runtime Error | #include <iostream>
#include <string>
int main() {
int N;
std::string S;
std::cin >> N >> S;
int result = 0;
for (int i = 0; i != N - 2; i++) {
if (S[i] == 'A' && S[i + 1] == 'B' && S[i + 2] == 'C') {
result++;
i = i + 2;
}
}
std::cout << result << std::endl;
return 0;
} | #include <iostream>
#include <string>
int main() {
int N;
std::string S;
std::cin >> N >> S;
int result = 0;
for (int i = 0; i < N - 2; i++) {
if (S[i] == 'A' && S[i + 1] == 'B' && S[i + 2] == 'C') {
result++;
i = i + 2;
}
}
std::cout << result << std::endl;
return 0;
} | replace | 9 | 10 | 9 | 10 | -11 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, ans = 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') {
ans++;
}
}
}
}
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, ans = 0;
string s;
cin >> n >> s;
for (int i = 2; i < n; i++) {
if (s.at(i) == 'C') {
if (s.at(i - 1) == 'B') {
if (s.at(i - 2) == 'A') {
ans++;
}
}
}
}
cout << ans;
} | replace | 7 | 11 | 7 | 11 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int Y = 0;
string S;
cin >> N >> S;
for (int X = 0; X < N; X++) {
if (X + 2 <= N) {
if (S.at(X) == 'A' && S.at(X + 1) == 'B' && S.at(X + 2) == 'C') {
Y++;
}
}
}
cout << Y << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int Y = 0;
string S;
cin >> N >> S;
for (int X = 0; X < N; X++) {
if (X + 2 < N) {
if (S.at(X) == 'A' && S.at(X + 1) == 'B' && S.at(X + 2) == 'C') {
Y++;
}
}
}
cout << Y << endl;
} | replace | 9 | 10 | 9 | 10 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define p_q priority_queue
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main() {
int n;
cin >> n;
string s;
cin >> s;
int co = 0;
for (int i = 0; i < n; i++) {
if (s.at(i) == 'A') {
if (s.at(i + 1) == 'B') {
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define p_q priority_queue
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main() {
int n;
cin >> n;
string s;
cin >> s;
int co = 0;
for (int i = 0; i + 2 < n; i++) {
if (s.at(i) == 'A') {
if (s.at(i + 1) == 'B') {
... | replace | 14 | 15 | 14 | 15 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int K;
string S;
cin >> K >> S;
int res = 0;
for (int i = 0; i < (K - 1); i++) {
if (S.at(i) == 'A' && S.at(i + 1) == 'B' && S.at(i + 2) == 'C') {
res++;
}
}
cout << res << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int K;
string S;
cin >> K >> S;
int res = 0;
for (int i = 0; i < (K - 2); i++) {
if (S.at(i) == 'A' && S.at(i + 1) == 'B' && S.at(i + 2) == 'C') {
res++;
}
}
cout << res << endl;
return 0;
} | replace | 8 | 9 | 8 | 9 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define MOD 1000000007
#define maxn 100010
void solve() {
int n;
string s;
cin >> s;
int ans = 0;
for (int i = 0; i < s.size() - 2; i++) {
if (s.substr(i, 3) == "ABC")
ans++;
}
cout << ans;
}
int32_t main(... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define MOD 1000000007
#define maxn 100010
void solve() {
int n;
cin >> n;
string s;
cin >> s;
int ans = 0;
for (int i = 0; i < s.size() - 2; i++) {
if (s.substr(i, 3) == "ABC")
ans++;
}
cout << ans;
}
... | insert | 11 | 11 | 11 | 13 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>; // グラフ型
typedef long long ll;
#define _GLIBCXX_DEBUG
/*
// 深さ優先探索
vector<bool> seen;
int dfs(const Graph &G, ll v) {
seen[v] = true; // v を訪問済にする
int score = 0;
// v から行ける各頂点 next_v について
for (auto next_v : G[v]) {
... | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>; // グラフ型
typedef long long ll;
#define _GLIBCXX_DEBUG
/*
// 深さ優先探索
vector<bool> seen;
int dfs(const Graph &G, ll v) {
seen[v] = true; // v を訪問済にする
int score = 0;
// v から行ける各頂点 next_v について
for (auto next_v : G[v]) {
... | replace | 46 | 47 | 46 | 47 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main(void) {
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++;
}
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
string S;
cin >> N >> S;
int cnt = 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>
#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 count = 0;
rep(i, N) {
if (S.at(i) == 'A' && S.at(i + 1) == 'B' && S.at(i + 2) == 'C') {
count++;
}
}
cout << count << endl;
}
| #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 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 | |
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 = 2; i < N; i++) {
if (S.at(i - 2) == 'A' && S.at(i - 1) == 'B' && S.at(i) == 'C') {
count++;
}
}
cout << count << endl;
}
| replace | 7 | 9 | 7 | 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;
for (int i = 0; i < n - 1; i++) {
if (s.at(i) == 'A' && s.at(i + 1) == 'B' && s.at(i + 2) == 'C')
cnt++;
}
cout << cnt;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int cnt = 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;
return 0;
}
| replace | 9 | 10 | 9 | 10 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
int res = 0;
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') {
res++;
}
}
cout << res << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
int res = 0;
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') {
res++;
}
}
cout << res << endl;
} | replace | 9 | 10 | 9 | 10 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ROOP(i, N) for (int i = 0; i < N; i++)
#define RVROOP(i, N) for (int i = N; i >= 0; i--)
#define INF 1e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
string S;
cin >> S;
int ans = 0;
for (int i = 0; i < N; i++) {... | #include <bits/stdc++.h>
#define ROOP(i, N) for (int i = 0; i < N; i++)
#define RVROOP(i, N) for (int i = N; i >= 0; i--)
#define INF 1e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
string S;
cin >> S;
int ans = 0;
for (int i = 0; i <= N - 3; i... | replace | 14 | 15 | 14 | 15 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int abc = 0;
string S;
cin >> N;
cin >> S;
for (int i = 0; i < N; i++) {
if (S.at(i) == 'A' && S.at(i + 1) == 'B' && S.at(i + 2) == 'C') {
abc++;
}
}
cout << abc << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int abc = 0;
string S;
cin >> N;
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') {
abc++;
}
}
cout << abc << endl;
} | replace | 9 | 10 | 9 | 10 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
int N;
int count = 0;
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() {
string S;
int N;
int count = 0;
cin >> N >> S;
for (int i = 0; i <= N - 3; 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() {
int N;
cin >> N;
string s;
cin >> s;
int ans = 0;
for (int i = 0; i < N; i++) {
if (s.at(i) == 'A') {
if (s.at(i + 1) == 'B' && s.at(i + 2) == 'C') {
i += 2;
ans++;
}
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string s;
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') {
ans++;
}
}
cout << ans << endl;
} | replace | 8 | 14 | 8 | 11 | 0 | |
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') {
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;
cin >> n;
string s;
cin >> s;
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') {
count++;
}
}
}
}
cout << count << en... | replace | 10 | 11 | 10 | 11 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.