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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02991 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define repi(i, a, b) for (ll i = (a); i < (b); ... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define repi(i, a, b) for (ll i = (a); i < (b); ... | replace | 73 | 74 | 73 | 74 | 0 | |
p02991 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define int long long
typedef vector<int> VI;
typedef pair<int, int> pii;
typedef priority_queue<int> PQ;
#define fore... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define int long long
typedef vector<int> VI;
typedef pair<int, int> pii;
typedef priority_queue<int> PQ;
#define fore... | insert | 45 | 45 | 45 | 46 | -11 | |
p02991 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef long double ld;
using P = pair<int, int>;
int main() {
ios::sync... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef long double ld;
using P = pair<int, int>;
int main() {
ios::sync... | replace | 16 | 17 | 16 | 17 | 0 | |
p02991 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << "\n"
#define COUTF(x) cout << setprecision(15) << (x) << "\n"
#define ENDL cout << "\n"
#d... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << "\n"
#define COUTF(x) cout << setprecision(15) << (x) << "\n"
#define ENDL cout << "\n"
#d... | insert | 124 | 124 | 124 | 125 | TLE | |
p02991 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
using P = pair<int, int>;
const int mx = 100005;
int n, m, u, v, s, t, dis[mx * 3];
queue<int> qu;
vector<int> node[mx];
int main() {
scanf("%d%d", &n, &m);
rep(i, m) {
scanf("%d%d", &u, &v);
u--;
v--;
node[u... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
using P = pair<int, int>;
const int mx = 100005;
int n, m, u, v, s, t, dis[mx * 3];
queue<int> qu;
vector<int> node[mx * 3];
int main() {
scanf("%d%d", &n, &m);
rep(i, m) {
scanf("%d%d", &u, &v);
u--;
v--;
no... | replace | 7 | 8 | 7 | 8 | -11 | |
p02991 | C++ | Runtime Error | #include <iostream>
#include <queue>
#include <vector>
#define MAX_N 100000
#define INF (1 << 29)
using namespace std;
typedef pair<int, int> P;
int N, M;
vector<int> G[3 * MAX_N + 1];
int d[MAX_N + 1];
int dijkstra(int s, int t, int N) {
priority_queue<P> que;
for (int v = 1; v <= N; v++) {
d[v] = (v == ... | #include <iostream>
#include <queue>
#include <vector>
#define MAX_N 100000
#define INF (1 << 29)
using namespace std;
typedef pair<int, int> P;
int N, M;
vector<int> G[3 * MAX_N + 1];
int d[3 * MAX_N + 1];
int dijkstra(int s, int t, int N) {
priority_queue<P> que;
for (int v = 1; v <= N; v++) {
d[v] = (v... | replace | 14 | 15 | 14 | 15 | 0 | |
p02991 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, l, r) for (long long i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define REPS(i, n) FOR(i, 1, n + 1)
#define RFOR(i, l, r) for (long long i = (l); i >= (r); --i)
#define RREP(i, n) RFOR(i, N - 1, 0)
#define RREPS(i, n) RFOR(i, N, 1)
#define int long... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, l, r) for (long long i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define REPS(i, n) FOR(i, 1, n + 1)
#define RFOR(i, l, r) for (long long i = (l); i >= (r); --i)
#define RREP(i, n) RFOR(i, N - 1, 0)
#define RREPS(i, n) RFOR(i, N, 1)
#define int long... | replace | 57 | 58 | 57 | 58 | TLE | |
p02991 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
void _cin() {}
template <class Head, class... Tail> void _cin(Head &&head, Tail &&...tail) {
cin >> head;
_cin(forward<Tail>(tail)...... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
void _cin() {}
template <class Head, class... Tail> void _cin(Head &&head, Tail &&...tail) {
cin >> head;
_cin(forward<Tail>(tail)...... | insert | 96 | 96 | 96 | 105 | TLE | |
p02991 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x) \
sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<( \
c i) {
sim > ... | #include "bits/stdc++.h"
using namespace std;
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x) \
sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<( \
c i) {
sim > ... | replace | 58 | 59 | 58 | 59 | 0 | |
p02991 | C++ | Runtime Error | // Marcin Knapik
// before you read it
// make sure it's a good idea
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef vector<vector<ii>... | // Marcin Knapik
// before you read it
// make sure it's a good idea
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef vector<vector<ii>... | replace | 87 | 88 | 87 | 88 | 0 | |
p02991 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using vll = std::vector<ll>;
using vvll = std::vector<vll>;
using vvvll = std::vector<vvll>;
using dd = double;
using vdd = std::vector<dd>;
using vvdd = std::vector<vdd>;
using vvvdd = std::vector<vvdd>;
const ll INF = 1LL << 45; // 10e5倍してもオーバーフローしな... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using vll = std::vector<ll>;
using vvll = std::vector<vll>;
using vvvll = std::vector<vvll>;
using dd = double;
using vdd = std::vector<dd>;
using vvdd = std::vector<vdd>;
using vvvdd = std::vector<vvdd>;
const ll INF = 1LL << 45; // 10e5倍してもオーバーフローしな... | insert | 181 | 181 | 181 | 183 | TLE | |
p02991 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <vector>
#define rep(i, n) for (i = 0; i < n; i++)
#define P pair<int, int>
using namespace std;
int main() {
int ... | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <vector>
#define rep(i, n) for (i = 0; i < n; i++)
#define P pair<int, int>
using namespace std;
int main() {
int ... | replace | 18 | 20 | 18 | 20 | 0 | |
p02991 | C++ | Time Limit Exceeded | #include <iostream>
#include <queue>
#include <vector>
using namespace std;
using Graph = vector<vector<int>>;
int main() {
// 頂点数と辺数
int N, M;
cin >> N >> M;
// グラフ入力受取 (ここでは無向グラフを想定)
Graph G(N), g(N);
for (int i = 0; i < M; ++i) {
int a, b;
cin >> a >> b;
a--;
b--;
G[a].push_back(b);... | #include <iostream>
#include <queue>
#include <vector>
using namespace std;
using Graph = vector<vector<int>>;
int main() {
// 頂点数と辺数
int N, M;
cin >> N >> M;
// グラフ入力受取 (ここでは無向グラフを想定)
Graph G(N), g(N);
for (int i = 0; i < M; ++i) {
int a, b;
cin >> a >> b;
a--;
b--;
G[a].push_back(b);... | insert | 44 | 44 | 44 | 48 | TLE | |
p02991 | C++ | Runtime Error | #include "bits/stdc++.h"
#define rep(i, N) for (int(i) = 0; (i) < (N); (i)++)
#define debug(var) std::cout << #var << " : " << var;
using Graph = std::vector<std::vector<int>>;
int main() {
int N, M;
std::cin >> N >> M;
Graph G(N);
rep(i, N) {
int u, v;
std::cin >> u >> v;
G[u - 1].push_back(v - ... | #include "bits/stdc++.h"
#define rep(i, N) for (int(i) = 0; (i) < (N); (i)++)
#define debug(var) std::cout << #var << " : " << var;
using Graph = std::vector<std::vector<int>>;
int main() {
int N, M;
std::cin >> N >> M;
Graph G(N);
rep(i, M) {
int u, v;
std::cin >> u >> v;
G[u - 1].push_back(v - ... | replace | 11 | 12 | 11 | 12 | 0 | |
p02991 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
int vis[100008];
ll dist[100008];
vector<int> e[100008];
int n;
void add(int u, int v) {
e[u].pb(v + n);
e[u + n].pb(v + 2 * n);
e[u + 2 * n].pb(v);
}
int main() {
int m, i, j;
cin >> n >> m;
for (i = 0; i < m; i++) {
... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
int vis[300008];
ll dist[300008];
vector<int> e[300008];
int n;
void add(int u, int v) {
e[u].pb(v + n);
e[u + n].pb(v + 2 * n);
e[u + 2 * n].pb(v);
}
int main() {
int m, i, j;
cin >> n >> m;
for (i = 0; i < m; i++) {
... | replace | 4 | 7 | 4 | 7 | 0 | |
p02992 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, n) for (int i = a, _n = n; i <= _n; ++i)
#define drep(i, a, n) for (int i = a, _n = n; i >= _n; --i)
#define debug(x) cout << #x << " = " << x << endl
const int N = 65000;
const int Mod = 1e9 + 7;
int n, k;
int L[N], R[N], Cnt[N];
long long dp[105][N]... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, n) for (int i = a, _n = n; i <= _n; ++i)
#define drep(i, a, n) for (int i = a, _n = n; i >= _n; --i)
#define debug(x) cout << #x << " = " << x << endl
const int N = 65000;
const int Mod = 1e9 + 7;
int n, k;
int L[N], R[N], Cnt[N];
long long dp[105][N]... | insert | 17 | 17 | 17 | 18 | 0 | |
p02992 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long N, K;
const int MOD = 1000000007;
long long dp[101][50000] = {};
long long S[50000] = {};
long long num[50000];
int solve() {
int M = 0;
for (int i = 1; i <= N;) {
int j = N / i;
if (i <= j) {
num[M++] = 1;
++i;
} else {
num[M++]... | #include <bits/stdc++.h>
using namespace std;
long long N, K;
const int MOD = 1000000007;
long long dp[101][110000] = {};
long long S[110000] = {};
long long num[110000];
int solve() {
int M = 0;
for (int i = 1; i <= N;) {
int j = N / i;
if (i <= j) {
num[M++] = 1;
++i;
} else {
num[M... | replace | 4 | 7 | 4 | 7 | 0 | |
p02992 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using names... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using names... | replace | 35 | 36 | 35 | 36 | 0 | |
p02992 | C++ | Runtime Error | #include <cstdio>
using namespace std;
const long long MOD = 1000000000 + 7;
long long dp[40000][110];
int main() {
int n, k;
scanf("%d %d", &n, &k);
int last = n;
int tmp = 0, ss = 0;
for (int i = 1; i * i <= n; i++) {
dp[i][0] = last - n / (i + 1), last = n / (i + 1);
tmp = i;
ss += dp[i][0];
... | #include <cstdio>
using namespace std;
const long long MOD = 1000000000 + 7;
long long dp[100000][110];
int main() {
int n, k;
scanf("%d %d", &n, &k);
int last = n;
int tmp = 0, ss = 0;
for (int i = 1; i * i <= n; i++) {
dp[i][0] = last - n / (i + 1), last = n / (i + 1);
tmp = i;
ss += dp[i][0];... | replace | 3 | 4 | 3 | 4 | 0 | |
p02992 | C++ | Runtime Error | #include "bits/stdc++.h"
#include <cassert>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
const int mod = 1000000007;
const int inf = 1ll << 61;
typedef pair<int, int> P;
typedef pair<int, P> PP;
int dp[100][100000];
int M2[100005], M3[100005];
signed main() {
int n, k;
c... | #include "bits/stdc++.h"
#include <cassert>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
const int mod = 1000000007;
const int inf = 1ll << 61;
typedef pair<int, int> P;
typedef pair<int, P> PP;
int dp[102][100000];
int M2[100005], M3[100005];
signed main() {
int n, k;
c... | replace | 9 | 10 | 9 | 10 | 0 | |
p02992 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
#define rep(i, x, y) \
for (i64 i = i64(x), i##_max_for_repmacro = i64(y); \
i < i##_max_for_repmacro; ++i)
#define debug(x) #x << "=" << (x)
#ifdef DEBUG
#de... | #include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
#define rep(i, x, y) \
for (i64 i = i64(x), i##_max_for_repmacro = i64(y); \
i < i##_max_for_repmacro; ++i)
#define debug(x) #x << "=" << (x)
#ifdef DEBUG
#de... | replace | 78 | 79 | 78 | 79 | 0 | |
p02992 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
c... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
c... | replace | 17 | 18 | 17 | 18 | 0 | |
p02992 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using std::cerr;
using std::cin;
using std::cout;
using std::endl;
us... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using std::cerr;
using std::cin;
using std::cout;
using std::endl;
us... | replace | 180 | 182 | 180 | 183 | -11 | |
p02992 | C++ | Runtime Error | #include <bits/stdc++.h>
// g++ -std=c++11
using namespace std;
typedef long long ll;
#define rep(i, n) for (long long i = 0; i < (n); ++i)
#define DIV 1000000007 // 10^9+7
ll N, K;
ll dp[105][10000];
map<ll, ll> momove[100000];
int main() {
cin >> N >> K;
set<ll> numset;
for (ll i = 1; i * i <= N; i++) {
... | #include <bits/stdc++.h>
// g++ -std=c++11
using namespace std;
typedef long long ll;
#define rep(i, n) for (long long i = 0; i < (n); ++i)
#define DIV 1000000007 // 10^9+7
ll N, K;
ll dp[105][500000];
int main() {
cin >> N >> K;
set<ll> numset;
for (ll i = 1; i * i <= N; i++) {
numset.insert(i);
num... | replace | 10 | 12 | 10 | 11 | 0 | |
p02992 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define REP(i, n) for (int i = 0; i < n; ++i)
#define SORT(name) sort(name.begin(), name.end())
#define ZERO(p) memset(p, 0, sizeof(p))
#define MINUS(p) memset(p, -1, sizeof(p))
#if 0
#define DBG(fmt, ...) printf(fmt, ##__VA_ARGS__)
#e... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define REP(i, n) for (int i = 0; i < n; ++i)
#define SORT(name) sort(name.begin(), name.end())
#define ZERO(p) memset(p, 0, sizeof(p))
#define MINUS(p) memset(p, -1, sizeof(p))
#if 0
#define DBG(fmt, ...) printf(fmt, ##__VA_ARGS__)
#e... | replace | 21 | 22 | 21 | 22 | -11 | |
p02992 | C++ | Runtime Error | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef unsigned long long int ull;
typedef pair<ll, ll> P;
template <class T> using V = vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
const ll inf = (1e18);
// const ll mod=998244353;
co... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef unsigned long long int ull;
typedef pair<ll, ll> P;
template <class T> using V = vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
const ll inf = (1e18);
// const ll mod=998244353;
co... | replace | 149 | 150 | 149 | 150 | -11 | |
p02992 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define FOR(i, m, n) for (int i = int(m); i < int(n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define VI vector<int>
#define VLL vector<long long>
#define VVI vector<vector<int>>
#define VVLL... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define FOR(i, m, n) for (int i = int(m); i < int(n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define VI vector<int>
#define VLL vector<long long>
#define VVI vector<vector<int>>
#define VVLL... | replace | 41 | 42 | 41 | 42 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p02992 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define VV vector
#define pb push_back
#define bitc __builtin_popcountl
#define m_p make_pair
#define inf 200000000000000
#define MAXN 1000001
#define eps 0.0000000001
#define fastio \
io... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define VV vector
#define pb push_back
#define bitc __builtin_popcountl
#define m_p make_pair
#define inf 200000000000000
#define MAXN 1000001
#define eps 0.0000000001
#define fastio \
io... | replace | 38 | 39 | 38 | 39 | 0 | |
p02992 | C++ | Runtime Error | #include <cmath>
#include <iostream>
#define DIM 40000
#define mod 1000000007
using namespace std;
int n, k, i, j, r, nr, st, dr, mid;
int v[DIM], u[DIM], s[105][DIM];
int main() {
cin >> n >> k;
r = sqrt(n * 1.0);
for (i = 1; i <= r + r; i++) {
if (n / i <= r) {
break;
}
v[++nr] = i;
}
for ... | #include <cmath>
#include <iostream>
#define DIM 70000
#define mod 1000000007
using namespace std;
int n, k, i, j, r, nr, st, dr, mid;
int v[DIM], u[DIM], s[105][DIM];
int main() {
cin >> n >> k;
r = sqrt(n * 1.0);
for (i = 1; i <= r + r; i++) {
if (n / i <= r) {
break;
}
v[++nr] = i;
}
for ... | replace | 2 | 3 | 2 | 3 | 0 | |
p02992 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int LL;
typedef long long int ll;
typedef pair<long long int, long long int> pii;
typedef pair<double, double> pdd;
#define SORT(c) sort((c).begin(), (c).end())
#define BACKSORT(c) sort((c).begin(), (c).end(), std::greater<LL>())
#define FOR(i, a, b) for... | #include <bits/stdc++.h>
using namespace std;
typedef long long int LL;
typedef long long int ll;
typedef pair<long long int, long long int> pii;
typedef pair<double, double> pdd;
#define SORT(c) sort((c).begin(), (c).end())
#define BACKSORT(c) sort((c).begin(), (c).end(), std::greater<LL>())
#define FOR(i, a, b) for... | replace | 24 | 25 | 24 | 25 | 0 | |
p02992 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, x, y) for (int i = x; i < y; i++)
#define print(A, x, n) \
rep(i, 0, n) { cout << (i ? " " : "") << A[i] x; } \
cout << endl;
#define pprint(A, y, m, n) ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, x, y) for (int i = x; i < y; i++)
#define print(A, x, n) \
rep(i, 0, n) { cout << (i ? " " : "") << A[i] x; } \
cout << endl;
#define pprint(A, y, m, n) ... | insert | 14 | 14 | 14 | 18 | 0 | |
p02992 | C++ | Runtime Error | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
#define all(n) begin(n), end(n)
const long long INF = numeric_limits<long long>::max();
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int>> vvint;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvl... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
#define all(n) begin(n), end(n)
const long long INF = numeric_limits<long long>::max();
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int>> vvint;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvl... | replace | 147 | 148 | 147 | 148 | 0 | |
p02992 | C++ | Runtime Error | //
// main.cpp
//
// https://atcoder.jp/contests/abc133/tasks/abc132_f
#include <algorithm>
#include <array>
#include <assert.h>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stdio.h>
#include ... | //
// main.cpp
//
// https://atcoder.jp/contests/abc133/tasks/abc132_f
#include <algorithm>
#include <array>
#include <assert.h>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stdio.h>
#include ... | replace | 50 | 55 | 50 | 59 | 0 | |
p02992 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define rep(i, n) for (i = 0; i < n; i++)
#define int long long
using namespace std;
int mod = 1000000007;
int n, k;
vect... | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define rep(i, n) for (i = 0; i < n; i++)
#define int long long
using namespace std;
int mod = 1000000007;
int n, k;
vect... | replace | 26 | 27 | 26 | 27 | 0 | |
p02992 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
namespace mint {
int md = 1e9 + 7;
inline void add(int &a, int b) {
assert(0 <= a && a < md && 0 <= b && b < md);
a += b;
if (a >= md)
a -= md;
}
inline void sub(int &a, int b) {
assert(0 <= a && a < md && 0 <= b && b < md);
a -= b;
if (a < 0)
a += md;
}... | #include <bits/stdc++.h>
using namespace std;
namespace mint {
int md = 1e9 + 7;
inline void add(int &a, int b) {
assert(0 <= a && a < md && 0 <= b && b < md);
a += b;
if (a >= md)
a -= md;
}
inline void sub(int &a, int b) {
assert(0 <= a && a < md && 0 <= b && b < md);
a -= b;
if (a < 0)
a += md;
}... | replace | 114 | 115 | 114 | 115 | 0 | |
p02992 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repn(i, n) for (int(i) = 1; (i) <= (n); (i)++)
#define repr(i, n) for (int(i) = (n - 1); (i) >= 0; (i)--)
#define all(x) (x).begin(), (x).end()
#define lint long long
#define ulint unsigned long long
#define fi f... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repn(i, n) for (int(i) = 1; (i) <= (n); (i)++)
#define repr(i, n) for (int(i) = (n - 1); (i) >= 0; (i)--)
#define all(x) (x).begin(), (x).end()
#define lint long long
#define ulint unsigned long long
#define fi f... | replace | 54 | 55 | 54 | 55 | 0 | |
p02992 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
int n, k;
ll dp[56666][111];
vector<int> v;
int main() {
scanf("%d%d", &n, &k);
int l = 1, r = 1;
while (r + 1 <= n) {
v.push_back(r);
l = r + 1;
r = n / (n / l);
}
v.push_back(r);
sort(v.begin(), v.end(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
int n, k;
ll dp[66666][111];
vector<int> v;
int main() {
scanf("%d%d", &n, &k);
int l = 1, r = 1;
while (r + 1 <= n) {
v.push_back(r);
l = r + 1;
r = n / (n / l);
}
v.push_back(r);
sort(v.begin(), v.end(... | replace | 5 | 6 | 5 | 6 | 0 | |
p02992 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll dp[100][100000];
ll arr[100000];
const ll mod = 1e9 + 7;
int main() {
ll n, k;
cin >> n >> k;
ll sqrt_n = sqrt(n);
for (ll i = 1, sum = 0; i <= 2 * sqrt_n; i++) {
if (i <= sqrt_n) {
arr[i]++;
sum++;
} else {
arr[i]... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll dp[105][200000];
ll arr[100000];
const ll mod = 1e9 + 7;
int main() {
ll n, k;
cin >> n >> k;
ll sqrt_n = sqrt(n);
for (ll i = 1, sum = 0; i <= 2 * sqrt_n; i++) {
if (i <= sqrt_n) {
arr[i]++;
sum++;
} else {
arr[i]... | replace | 4 | 5 | 4 | 5 | 0 | |
p02992 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const int maxn = 3e5 + 10, mod = 1e9 + 7;
int a, b, f[maxn], k;
map<int, int, greater<int>> dp, dp2;
unordered_map<int, int> fre;
void plusle(int &a, int b) {
a += b;
if (a >= mod)
a -= mod;
return;
}
void minun(int &a, int b) {
a -= b;
if (a < 0)
a += mod... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 3e5 + 10, mod = 1e9 + 7;
int a, b, f[maxn], k;
map<int, int, greater<int>> dp, dp2;
unordered_map<int, int> fre;
void plusle(int &a, int b) {
a += b;
if (a >= mod)
a -= mod;
return;
}
void minun(int &a, int b) {
a -= b;
if (a < 0)
a += mod... | replace | 51 | 52 | 51 | 52 | TLE | |
p02992 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
#include <vector>
#define N 40000
using namespace std;
typedef long long ll;
ll n, k, en, M = 1e9 + 7, d[N], s[N];
vector<int> c;
int main() {
ll i, t;
cin >> n >> k;
c.push_back(0);
for (i = 1; i <= n;) {
t = n / (n / i);
c.push_back(t);
i = t + 1;
}
en = ... | #include <cstdio>
#include <iostream>
#include <vector>
#define N 100000
using namespace std;
typedef long long ll;
ll n, k, en, M = 1e9 + 7, d[N], s[N];
vector<int> c;
int main() {
ll i, t;
cin >> n >> k;
c.push_back(0);
for (i = 1; i <= n;) {
t = n / (n / i);
c.push_back(t);
i = t + 1;
}
en =... | replace | 3 | 4 | 3 | 4 | 0 | |
p02992 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
long long dp[32005][2][105];
long long prefixSum[32005][2][105];
int N, K;
/*long long dp(int i, int mode, int k){
printf("%d %d %d\n", i, mode, k);
if(k == 0){
return 1;
}else if(memo[i][mode][k] !... | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
long long dp[32005][2][105];
long long prefixSum[32005][2][105];
int N, K;
/*long long dp(int i, int mode, int k){
printf("%d %d %d\n", i, mode, k);
if(k == 0){
return 1;
}else if(memo[i][mode][k] !... | replace | 59 | 60 | 59 | 60 | -11 | |
p02992 | C++ | Runtime Error | // #define _GLIBCXX_DEBUG // for STL debug (optional)
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#inc... | // #define _GLIBCXX_DEBUG // for STL debug (optional)
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#inc... | replace | 97 | 98 | 97 | 98 | 0 | |
p02992 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
int main() {
int N, K;
cin >> N >> K;
unordered_map<int, int> mp;
int l = 1, r = 2, count = 0;
mp[0] = 1;
while (r <= N) {
count++;
l = r;
r = N / (N / l) + 1;
mp[count] = r - l;
}
long long dp[120][1000000];... | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
int main() {
int N, K;
cin >> N >> K;
unordered_map<int, int> mp;
int l = 1, r = 2, count = 0;
mp[0] = 1;
while (r <= N) {
count++;
l = r;
r = N / (N / l) + 1;
mp[count] = r - l;
}
long long dp[120][100000];
... | replace | 15 | 16 | 15 | 16 | -11 | |
p02992 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define TRACE(x) x
#define WATCH(x) TRACE(cout << #x " = " << x << endl)
#define WATCHR(a, b) \
TRACE(for (auto it = a; it != b;) cout << *(it++) << " "; cout << endl)
#define WATCHC(V) ... | #include <bits/stdc++.h>
using namespace std;
#define TRACE(x) x
#define WATCH(x) TRACE(cout << #x " = " << x << endl)
#define WATCHR(a, b) \
TRACE(for (auto it = a; it != b;) cout << *(it++) << " "; cout << endl)
#define WATCHC(V) ... | insert | 277 | 277 | 277 | 278 | -6 | effc5dcc-f42c-4190-957a-d0da72ac69c3.out: /home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02992/C++/s446232168.cpp:201: int main(): Assertion `N / uniq[i] == N / (uniq[i + 1] - 1)' failed.
|
p02992 | C++ | Runtime Error | // AtCoder
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
constexpr ll MOD = 1e9 + 7;
constexpr ll nmax = 1e5 + 10; // 1e9+10;
ll dp[110][nmax];
// constexpr ll nmax=1e2+10;//1e9+10;
// ll dp[5][nmax];
int main() {
#if LOCAL & 0
std::ifstream in("./test/sample-3.in");
std::cin.rdbuf(in.rdbuf());
... | // AtCoder
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
constexpr ll MOD = 1e9 + 7;
constexpr ll nmax = 1e5 + 10; // 1e9+10;
ll dp[110][nmax];
// constexpr ll nmax=1e2+10;//1e9+10;
// ll dp[5][nmax];
int main() {
#if LOCAL & 0
std::ifstream in("./test/sample-3.in");
std::cin.rdbuf(in.rdbuf());
... | replace | 18 | 19 | 18 | 19 | 0 | |
p02992 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
vector<pair<int, int>> fa;
long long dp[101][40000];
int main() {
// cout<<sqrt(1000000000)<<endl;
long long n, k;
cin >> n >> k;
for (int i = 1; i * i <= n; i++) {
fa.push_back({i, 0});
fa.push_back({n / i, 0});
}
sort(fa.begin... | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
vector<pair<int, int>> fa;
long long dp[101][100000];
int main() {
// cout<<sqrt(1000000000)<<endl;
long long n, k;
cin >> n >> k;
for (int i = 1; i * i <= n; i++) {
fa.push_back({i, 0});
fa.push_back({n / i, 0});
}
sort(fa.begi... | replace | 5 | 6 | 5 | 6 | 0 | |
p02992 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define SELECTER(_1, _2, _3, SELECT, ...) SELECT
#define REP1(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define REP2(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define REP(...) SELECTER(__VA_ARGS__, REP2, REP1, )(__VA_ARGS__)
#define MOD 1000000007
template <class T> ost... | #include <bits/stdc++.h>
using namespace std;
#define SELECTER(_1, _2, _3, SELECT, ...) SELECT
#define REP1(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define REP2(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define REP(...) SELECTER(__VA_ARGS__, REP2, REP1, )(__VA_ARGS__)
#define MOD 1000000007
template <class T> ost... | insert | 88 | 88 | 88 | 92 | 0 | |
p02992 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
#define mod (int)(1e9 + 7)
#define inf (int)(3e18 + 7)
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i < n; i++)
#define P pair<int, int>
#define PiP pair<int, pair<int, int>>
#define all(v) v.begin(), v.end()
#define mkp make_pair
#define... | #include <bits/stdc++.h>
#define int long long
#define mod (int)(1e9 + 7)
#define inf (int)(3e18 + 7)
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i < n; i++)
#define P pair<int, int>
#define PiP pair<int, pair<int, int>>
#define all(v) v.begin(), v.end()
#define mkp make_pair
#define... | replace | 58 | 59 | 58 | 59 | 0 | |
p02992 | C++ | Runtime Error | #include <cmath>
#include <iostream>
#include <numeric>
using namespace std;
constexpr int M = 1000000007;
int main() {
int N, K;
cin >> N >> K;
const int b = int(sqrt(N)) + 2;
long long dps[2][b], dpl[2][b];
int cur = 0, prev = 1;
dps[0][0] = dps[1][0] = dpl[0][0] = dpl[1][0] = 0;
for (int i = 1; i < b;... | #include <cmath>
#include <iostream>
#include <numeric>
using namespace std;
constexpr int M = 1000000007;
int main() {
int N, K;
cin >> N >> K;
if (N == 1) {
cout << 1 << endl;
return 0;
}
const int b = int(sqrt(N)) + 2;
long long dps[2][b], dpl[2][b];
int cur = 0, prev = 1;
dps[0][0] = dps[1]... | insert | 9 | 9 | 9 | 13 | 0 | |
p02992 | C++ | Runtime Error | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define... | replace | 42 | 43 | 42 | 43 | 0 | |
p02992 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
/*
#include <boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
using cint = cpp_int;
*/
// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const ll dx[4] = {1, 0, -1, 0};
const ll dy[4] = {0, 1, 0, -1};
const ll ... | #include <bits/stdc++.h>
using namespace std;
/*
#include <boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
using cint = cpp_int;
*/
// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const ll dx[4] = {1, 0, -1, 0};
const ll dy[4] = {0, 1, 0, -1};
const ll ... | replace | 200 | 201 | 200 | 201 | 0 | |
p02992 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
vector<pair<long long, pair<long long, long long>>>
quotient_ranges(long long N) {
vector<pair<long long, pair<long long, long long>>> ans;
for (long long i = 1; i * i <= N; i++) {
ans.push_back(make_pair(N / i, make_pair(i, i)));
... | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
vector<pair<long long, pair<long long, long long>>>
quotient_ranges(long long N) {
vector<pair<long long, pair<long long, long long>>> ans;
for (long long i = 1; i * i <= N; i++) {
ans.push_back(make_pair(N / i, make_pair(i, i)));
... | replace | 26 | 29 | 26 | 29 | TLE | |
p02992 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<ll> vec;
typedef vector<vec> mat;
ll mod = 1e9 + 7, dp[100][100000];
int main() {
ll n, k;
cin >> n >> k;
fill(dp[0], dp[0] + 2 ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<ll> vec;
typedef vector<vec> mat;
ll mod = 1e9 + 7, dp[110][200000];
int main() {
ll n, k;
cin >> n >> k;
fill(dp[0], dp[0] + 2 ... | replace | 8 | 9 | 8 | 9 | 0 | |
p02992 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
constexpr Int MOD = 1e9 + 7;
int main() {
int N, K;
cin >> N >> K;
vector<int> A, C;
{
int t = 1;
while (t < N) {
A.push_back(N / t);
C.push_back(N / (N / t));
t = N / (N / t) + 1;
}
}
int M = A.size();
vect... | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
constexpr Int MOD = 1e9 + 7;
int main() {
int N, K;
cin >> N >> K;
vector<int> A, C;
{
int t = 1;
while (t <= N) {
A.push_back(N / t);
C.push_back(N / (N / t));
t = N / (N / t) + 1;
}
}
int M = A.size();
vec... | replace | 10 | 11 | 10 | 11 | 0 | |
p02992 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#defi... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#defi... | replace | 118 | 119 | 118 | 119 | -6 | Fatal glibc error: malloc assertion failure in sysmalloc: (old_top == initial_top (av) && old_size == 0) || ((unsigned long) (old_size) >= MINSIZE && prev_inuse (old_top) && ((unsigned long) old_end & (pagesize - 1)) == 0)
|
p02992 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
const int mod = 1e9 + 7;
const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
cerr << fixed << setpre... | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
const int mod = 1e9 + 7;
const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
cerr << fixed << setpre... | replace | 182 | 183 | 182 | 183 | 0 | |
p02992 | C++ | Runtime Error | /*
[abc132] F - Small Products
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
const int MAX_R = 1e5;
const int MAX_K = 100;
const int MOD = 1e9 + 7;
class gf {
public:
int n;
gf() : n(0) {}
gf(int n) : ... | /*
[abc132] F - Small Products
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
const int MAX_R = 1e5;
const int MAX_K = 100;
const int MOD = 1e9 + 7;
class gf {
public:
int n;
gf() : n(0) {}
gf(int n) : ... | replace | 25 | 26 | 25 | 26 | 0 | |
p02993 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s.at(1) == s.at(2) || s.at(2) == s.at(3) || s.at(3) == s.at(4)) {
cout << "Bad" << endl;
} else
cout << "Good" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s.at(0) == s.at(1) || s.at(1) == s.at(2) || s.at(2) == s.at(3)) {
cout << "Bad" << endl;
} else
cout << "Good" << endl;
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p02993 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s.at(0) == s.at(1) || s.at(1) == s.at(2) || s.at(2) == s.at(23))
cout << "Bad" << endl;
else
cout << "Good" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s.at(0) == s.at(1) || s.at(1) == s.at(2) || s.at(2) == s.at(3))
cout << "Bad" << endl;
else
cout << "Good" << endl;
} | replace | 8 | 9 | 8 | 9 | 0 | |
p02993 | C++ | Runtime Error | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
int main() {
string s;
cin >> s;
rep(i, 3) {
if (s[i - 1] == s[i]) {
cout << "Bad";
return 0;
}
}
cout << "Good";
}
| #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
int main() {
string s;
cin >> s;
rep(i, 3) {
if (s[i] == s[i + 1]) {
cout << "Bad";
return 0;
}
}
cout << "Good";
}
| replace | 10 | 11 | 10 | 11 | -6 | /usr/include/c++/12/bits/basic_string.h:1221: std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::reference std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::operator[](size_type) [with _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>; reference = char&; size_type = long unsigned int]:... |
p02993 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
if (S.at(0) == S.at(1) || S.at(1) == S.at(2) || S.at(2) == S.at(3)) {
cout << "Bad" << endl;
} else {
cout << "Good" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S.at(0) == S.at(1) || S.at(1) == S.at(2) || S.at(2) == S.at(3)) {
cout << "Bad" << endl;
} else {
cout << "Good" << endl;
}
} | insert | 5 | 5 | 5 | 6 | -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)
|
p02993 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define FORR(i, a, b) for (int i ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define FORR(i, a, b) for (int i ... | replace | 36 | 37 | 36 | 37 | 0 | |
p02993 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S.at(0) == S.at(1)) {
cout << "Bad" << endl;
}
else if (S.at(1) == S.at(2)) {
cout << "Bad" << endl;
}
else if (S.at(2) == S.at(3)) {
cout << "Bad" << endl;
}
else if (S.at(3) == S.at(4)) {
cout << ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S.at(0) == S.at(1)) {
cout << "Bad" << endl;
}
else if (S.at(1) == S.at(2)) {
cout << "Bad" << endl;
}
else if (S.at(2) == S.at(3)) {
cout << "Bad" << endl;
}
else {
cout << "Good" << endl;
}
} | delete | 19 | 23 | 19 | 19 | 0 | |
p02993 | C++ | Runtime Error | /*;
THE BEST IS YET TO COME
*/
#include <bits/stdc++.h>
using namespace std;
#define r(i, s, l) for (int i = s; i < l; i++)
#define rr(i, s, l) for (int i = s; i >= l; i--)
#define mod 1000000007
#define int long long
#define INT_BITS 32
#define ld long double
#define pp pair<int, int>
#define ss second
#define ff fir... | /*;
THE BEST IS YET TO COME
*/
#include <bits/stdc++.h>
using namespace std;
#define r(i, s, l) for (int i = s; i < l; i++)
#define rr(i, s, l) for (int i = s; i >= l; i--)
#define mod 1000000007
#define int long long
#define INT_BITS 32
#define ld long double
#define pp pair<int, int>
#define ss second
#define ff fir... | replace | 29 | 39 | 29 | 32 | 0 | |
p02993 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
bool A = false;
for (int i = 0; i < S.size(); i++) {
if (S.at(i) == S.at(i + 1))
A = true;
}
if (A == true)
cout << "Bad" << endl;
else if (A == false)
cout << "Good" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
bool A = false;
for (int i = 0; i < S.size() - 1; i++) {
if (S.at(i) == S.at(i + 1))
A = true;
}
if (A == true)
cout << "Bad" << endl;
else if (A == false)
cout << "Good" << endl;
} | replace | 7 | 8 | 7 | 8 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::at: __n (which is 4) >= this->size() (which is 4)
|
p02993 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, answer = "Good";
cin >> s;
for (int i = 0; i < 4; ++i) {
if (s.at(i) == s.at(i + 1)) {
answer = "Bad";
break;
}
}
cout << answer << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s, answer = "Good";
cin >> s;
for (int i = 0; i < 4; ++i) {
if (s[i] == s[i + 1]) {
answer = "Bad";
break;
}
}
cout << answer << endl;
}
| replace | 7 | 8 | 7 | 8 | 0 | |
p02993 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int num;
cin >> num;
if ((num / 10000) > 0)
return 0;
string s = to_string(num);
if (s.at(0) == s.at(1) || s.at(1) == s.at(2) || s.at(2) == s.at(3))
cout << "Bad" << endl;
else
cout << "Good" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s.at(0) == s.at(1) || s.at(1) == s.at(2) || s.at(2) == s.at(3))
cout << "Bad" << endl;
else
cout << "Good" << endl;
} | replace | 5 | 10 | 5 | 8 | 0 | |
p02993 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
bool a = true;
for (int i = 0; i < 3; i++) {
if (s.at(i) == s.at(i + 1)) {
a = false;
break;
}
}
if (a) {
cout << "Good" << endl;
} else {
cout << "Bad" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
bool a = true;
for (int i = 0; i < 3; i++) {
if (s.at(i) == s.at(i + 1)) {
a = false;
break;
}
}
if (a) {
cout << "Good" << endl;
} else {
cout << "Bad" << endl;
}
}
| insert | 4 | 4 | 4 | 5 | -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)
|
p02993 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S.at(0) != S.at(1) && S.at(1) != S.at(2) && S.at(2) != S.at(3) &&
S.at(3) != S.at(4)) {
cout << "Good" << endl;
} else {
cout << "Bad" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S.at(0) != S.at(1) && S.at(1) != S.at(2) && S.at(2) != S.at(3)) {
cout << "Good" << endl;
} else {
cout << "Bad" << endl;
}
} | replace | 6 | 8 | 6 | 7 | 0 | |
p02993 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S.at(0) != S.at(1) && S.at(1) != S.at(2) && S.at(2) != S.at(3) &&
S.at(3) != S.at(4)) {
cout << "Good" << endl;
} else {
cout << "Bad" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S.at(0) != S.at(1) && S.at(1) != S.at(2) && S.at(2) != S.at(3)) {
cout << "Good" << endl;
} else {
cout << "Bad" << endl;
}
} | replace | 6 | 8 | 6 | 7 | 0 | |
p02993 | C++ | Runtime Error | #include <algorithm> // sort(ALL())
#include <iomanip>
#include <iostream>
#include <map> // 連想配列 map<string, int>
#include <math.h>
#include <queue> // push(), front(), pop() 先入れ先出し
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using na... | #include <algorithm> // sort(ALL())
#include <iomanip>
#include <iostream>
#include <map> // 連想配列 map<string, int>
#include <math.h>
#include <queue> // push(), front(), pop() 先入れ先出し
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using na... | replace | 49 | 50 | 49 | 50 | 1 | |
p02993 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define VV vector
#define pb push_back
#define bitc __builtin_popcountl
#define m_p make_pair
#define inf 200000000000000
#define MAXN 1000001
#define eps 0.0000000001
#define fastio \
io... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define VV vector
#define pb push_back
#define bitc __builtin_popcountl
#define m_p make_pair
#define inf 200000000000000
#define MAXN 1000001
#define eps 0.0000000001
#define fastio \
io... | delete | 32 | 36 | 32 | 32 | 0 | |
p02993 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < 4; i++) {
if (s.at(i) == s.at(i + 1)) {
cout << "Bad" << endl;
return 0;
}
}
cout << "Good" << endl;
return 0;
}
| #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < 4; i++) {
if (s[i] == s[i + 1]) {
cout << "Bad" << endl;
return 0;
}
}
cout << "Good" << endl;
return 0;
}
| replace | 8 | 9 | 8 | 9 | 0 | |
p02993 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
bool a = true;
for (int i = 0; i < 4; i++) {
if (S.at(i) == S.at(i + 1)) {
a = false;
}
}
if (a) {
cout << "Good" << endl;
} else {
cout << "Bad" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
bool a = true;
for (int i = 0; i < 3; i++) {
if (S.at(i) == S.at(i + 1)) {
a = false;
}
}
if (a) {
cout << "Good" << endl;
} else {
cout << "Bad" << endl;
}
} | replace | 7 | 8 | 7 | 8 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::at: __n (which is 4) >= this->size() (which is 4)
|
p02993 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int i, c = 0;
int l = s.size();
for (i = 0; i < l; i++) {
if (s.at(i) == s.at(i + 1)) {
c++;
}
}
if (c == 0) {
cout << "Good" << endl;
} else {
cout << "Bad" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int i, c = 0;
int l = s.size();
for (i = 0; i < l - 1; i++) {
if (s.at(i) == s.at(i + 1)) {
c++;
}
}
if (c == 0) {
cout << "Good" << endl;
} else {
cout << "Bad" << endl;
}
}
| replace | 8 | 9 | 8 | 9 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::at: __n (which is 4) >= this->size() (which is 4)
|
p02993 | Python | Runtime Error | import sys
def input():
return sys.stdin.readline()[:-1]
def main():
n = input()
if n[1] == n[2] or n[2] == n[3] or n[3] == n[4]:
print("Bad")
else:
print("Good")
if __name__ == "__main__":
main()
| import sys
def input():
return sys.stdin.readline()[:-1]
def main():
n = input()
if n[1] == n[2] or n[2] == n[3] or n[1] == n[0]:
print("Bad")
else:
print("Good")
if __name__ == "__main__":
main()
| replace | 9 | 10 | 9 | 10 | 0 | |
p02993 | Python | Runtime Error | s = list(map(int, input().split()))
if s[0] != s[1] and s[1] != s[2] and s[2] != s[3]:
print("Good")
else:
print("Bad")
| s = list(input())
if s[0] != s[1] and s[1] != s[2] and s[2] != s[3]:
print("Good")
else:
print("Bad")
| replace | 0 | 1 | 0 | 1 | IndexError: list index out of range | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02993/Python/s085447001.py", line 2, in <module>
if s[0] != s[1] and s[1] != s[2] and s[2] != s[3]:
IndexError: list index out of range
|
p02993 | Python | Runtime Error | S = input()
if S[1] == S[2] or S[2] == S[3] or S[3] == S[4]:
print("Bad")
else:
print("Good")
| S = input()
if S[0] == S[1] or S[1] == S[2] or S[2] == S[3]:
print("Bad")
else:
print("Good")
| replace | 1 | 2 | 1 | 2 | 0 | |
p02993 | Python | Runtime Error | import sys
fin = sys.stdin.readline
num = str(int(fin()))
readable = True
prev_num = num[0]
for i in range(1, 4):
cur_num = num[i]
if prev_num == cur_num:
readable = False
prev_num = cur_num
if readable:
print("Good")
else:
print("Bad")
| import sys
fin = sys.stdin.readline
num = str(fin()).split()[0]
readable = True
prev_num = num[0]
for i in range(1, 4):
cur_num = num[i]
if prev_num == cur_num:
readable = False
prev_num = cur_num
if readable:
print("Good")
else:
print("Bad")
| replace | 3 | 4 | 3 | 4 | 0 | |
p02993 | Python | Runtime Error | s = int(input())
ans = "Good"
s_temp = 99
for num in s:
if int(num) == s_temp:
ans = "Bad"
break
else:
s_temp = int(num)
print(ans)
| s = input()
ans = "Good"
s_temp = 99
for num in s:
if int(num) == s_temp:
ans = "Bad"
break
else:
s_temp = int(num)
print(ans)
| replace | 0 | 1 | 0 | 1 | TypeError: 'int' object is not iterable | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02993/Python/s013728744.py", line 7, in <module>
for num in s:
TypeError: 'int' object is not iterable
|
p02993 | Python | Runtime Error | cord = list(input())
cord_len = len(cord)
for i in range(cord - 1):
if cord[i] == cord[i + 1]:
print("Bad")
break
else:
print("Good")
| cord = list(input())
cord_len = len(cord)
for i in range(cord_len - 1):
if cord[i] == cord[i + 1]:
print("Bad")
break
else:
print("Good")
| replace | 2 | 3 | 2 | 3 | TypeError: unsupported operand type(s) for -: 'list' and 'int' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02993/Python/s564571845.py", line 3, in <module>
for i in range(cord - 1):
TypeError: unsupported operand type(s) for -: 'list' and 'int'
|
p02993 | Python | Runtime Error | s = list(input())
if s[0] == s[1] or s[1] == s[2] or s[2] == s[3] or s[3] == s[4]:
print("Bad")
else:
print("Good")
| s = list(input())
if s[0] == s[1] or s[1] == s[2] or s[2] == s[3]:
print("Bad")
else:
print("Good")
| replace | 2 | 3 | 2 | 3 | 0 | |
p02993 | Python | Runtime Error | s = str(int(input()))
if s[0] == s[1] or s[1] == s[2] or s[2] == s[3]:
print("Bad")
else:
print("Good")
| s = str(input())
if s[0] == s[1] or s[1] == s[2] or s[2] == s[3]:
print("Bad")
else:
print("Good")
| replace | 0 | 1 | 0 | 1 | 0 | |
p02993 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string A;
cin >> A;
bool flag = true;
for (int i = 0; i < 4; i++) {
if (A.at(i) == A.at(i + 1)) {
cout << "Bad" << endl;
flag = false;
break;
}
}
if (flag)
cout << "Good" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string A;
cin >> A;
bool flag = true;
for (int i = 0; i < 3; i++) {
if (A.at(i) == A.at(i + 1)) {
cout << "Bad" << endl;
flag = false;
break;
}
}
if (flag)
cout << "Good" << endl;
} | replace | 8 | 9 | 8 | 9 | 0 | |
p02993 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<char> a(4);
for (int i = 0; i < 4; i++)
cin >> a.at(i);
if (a.at(0) == a.at(1))
cout << "Bad";
else if (a.at(1) == a.at(2))
cout << "Bad";
else if (a.at(2) == a.at(3))
cout << "Bad";
else if (a.at(3) == a.at(4))
cout << ... | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<char> a(4);
for (int i = 0; i < 4; i++)
cin >> a.at(i);
if (a.at(0) == a.at(1))
cout << "Bad";
else if (a.at(1) == a.at(2))
cout << "Bad";
else if (a.at(2) == a.at(3))
cout << "Bad";
else
cout << "Good";
} | delete | 14 | 16 | 14 | 14 | 0 | |
p02993 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
//
string str;
if (str.at(0) == str.at(1))
cout << "Bad";
else if (str.at(1) == str.at(2))
cout << "Bad";
else if (str.at(2) == str.at(3))
cout << "Bad";
else
cout << "Good";
//
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
//
string str;
cin >> str;
if (str.at(0) == str.at(1))
cout << "Bad";
else if (str.at(1) == str.at(2))
cout << "Bad";
else if (str.at(2) == str.at(3))
cout << "Bad";
else
cout << "Good";
//
}
| replace | 6 | 7 | 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)
|
p02993 | C++ | Runtime Error | #include <iostream>
#include <stack>/*** LIFO *** stack<type> var;
push(), top():to get data, pop():to remove, size(), empty() ***/
#include <string>
using namespace std;
#define Fp(I, STAT, END) for (int I = STAT; I < END; I++)
#define Fm(I, STAT, END) for (int I = STAT; I > END; I--)
int main() {
string S;
cin ... | #include <iostream>
#include <stack>/*** LIFO *** stack<type> var;
push(), top():to get data, pop():to remove, size(), empty() ***/
#include <string>
using namespace std;
#define Fp(I, STAT, END) for (int I = STAT; I < END; I++)
#define Fm(I, STAT, END) for (int I = STAT; I > END; I--)
int main() {
string S;
cin ... | replace | 15 | 16 | 15 | 16 | 1 | |
p02993 | C++ | Runtime Error | #include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unrolled-loops")
using namespace std;
#define inp "TestCode.inp"
#define out "TestCode.out"
#define FAST \
ios_base::sync_with_stdio(0); ... | #include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unrolled-loops")
using namespace std;
#define inp "TestCode.inp"
#define out "TestCode.out"
#define FAST \
ios_base::sync_with_stdio(0); ... | replace | 32 | 33 | 32 | 33 | 0 | |
p02993 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s.at(1) == s.at(2)) {
cout << "Bad" << endl;
} else if (s.at(2) == s.at(3)) {
cout << "Bad" << endl;
} else if (s.at(3) == s.at(4)) {
cout << "Bad" << endl;
} else {
cout << "Good" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s.at(1) == s.at(2)) {
cout << "Bad" << endl;
} else if (s.at(2) == s.at(3)) {
cout << "Bad" << endl;
} else if (s.at(0) == s.at(1)) {
cout << "Bad" << endl;
} else {
cout << "Good" << endl;
}
} | replace | 10 | 11 | 10 | 11 | 0 | |
p02993 | C++ | Time Limit Exceeded | #include <stdio.h>
int main() {
int S = 0;
while (S < 1000 || S > 9999)
scanf("%d", &S);
if (S / 1000 % 10 == S / 100 % 10 || S / 100 % 10 == S / 10 % 10 ||
S / 10 % 10 == S % 10)
printf("Bad");
else
printf("Good");
return 0;
} | #include <stdio.h>
int main() {
int S = 0;
for (;;)
if (S < 10000 || S > 999)
break;
scanf("%d", &S);
if (S / 1000 % 10 == S / 100 % 10 || S / 100 % 10 == S / 10 % 10 ||
S / 10 % 10 == S % 10)
printf("Bad");
else
printf("Good");
return 0;
} | replace | 4 | 6 | 4 | 8 | TLE | |
p02993 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define pans cout << ans << endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
string s;
cin >> s;
bool flag = false;
for (int i = 0; i < 3; i++) {
if (s[i] == s[i + 1]) {
flag = true;
}
}
int a = 0;
for (int i = 0; i < 1000... | #include <bits/stdc++.h>
#define pans cout << ans << endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
string s;
cin >> s;
bool flag = false;
for (int i = 0; i < 3; i++) {
if (s[i] == s[i + 1]) {
flag = true;
}
}
int a = 0;
for (int i = 0; i < 1000... | replace | 15 | 16 | 15 | 16 | TLE | |
p02993 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define pans cout << ans << endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
string s;
cin >> s;
bool flag = false;
for (int i = 0; i < 3; i++) {
if (s[i] == s[i + 1]) {
flag = true;
}
}
int a = 0;
for (int i = 0; i < 2500... | #include <bits/stdc++.h>
#define pans cout << ans << endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
string s;
cin >> s;
bool flag = false;
for (int i = 0; i < 3; i++) {
if (s[i] == s[i + 1]) {
flag = true;
}
}
int a = 0;
for (int i = 0; i < 1500... | replace | 15 | 16 | 15 | 16 | TLE | |
p02993 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int count = 0;
for (int i = 0; i < s.size(); i++) {
if (s.at(i) == s.at(i + 1)) {
count++;
}
}
if (count > 0) {
cout << "Bad" << endl;
} else {
cout << "Good" << endl;
}
} | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int count = 0;
for (int i = 0; i < s.size() - 1; i++) {
if (s.at(i) == s.at(i + 1)) {
count++;
}
}
if (count > 0) {
cout << "Bad" << endl;
} else {
cout << "Good" << endl;
}
} | replace | 8 | 9 | 8 | 9 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::at: __n (which is 4) >= this->size() (which is 4)
|
p02994 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <string>
#include <vector>
int main() {
// std::cout << std::fixed << std::setprecision(10);
int n, l;
std::cin >> n >> l;
std::vector<int> a(n);
int val = 1000, ans = 0, sum = ... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <string>
#include <vector>
int main() {
// std::cout << std::fixed << std::setprecision(10);
int n, l;
std::cin >> n >> l;
std::vector<int> a(n);
int val = 1000, ans = 0, sum = ... | replace | 16 | 18 | 16 | 18 | 0 | 2
3
4
5
6
|
p02994 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, k, n) for (int i = k; i < (int)(n); i++)
#define RRep(i, k, n) for (int i = k; i > (int)(n); i--)
#define COUT(x) cout << #... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, k, n) for (int i = k; i < (int)(n); i++)
#define RRep(i, k, n) for (int i = k; i > (int)(n); i--)
#define COUT(x) cout << #... | replace | 41 | 42 | 41 | 44 | 0 | |
p02994 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
// #include "graph.cpp"
#define ll long long
#define loop(i, n) for (int i = 0; i < n; ++i)
#define rep(i, x, n) for (int i = x; i <= n; ++i)
#define iteloop(type, data... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
// #include "graph.cpp"
#define ll long long
#define loop(i, n) for (int i = 0; i < n; ++i)
#define rep(i, x, n) for (int i = x; i <= n; ++i)
#define iteloop(type, data... | insert | 26 | 26 | 26 | 30 | 0 | |
p02994 | C++ | Runtime Error | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
int A[30];
int shuma = 0;
for (int i = 0; i < n; i++) {
A[i] = l + i;
shuma += A[i];
}
int max = abs(A[0]);
for (int i = 1; i < n; i++) {
if (abs(A[i]) < abs(max)) {
max = A[i];
}
}
... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
int A[n];
int shuma = 0;
for (int i = 0; i < n; i++) {
A[i] = l + i;
shuma += A[i];
}
int max = abs(A[0]);
for (int i = 1; i < n; i++) {
if (abs(A[i]) < abs(max)) {
max = A[i];
}
}
... | replace | 7 | 8 | 7 | 8 | 0 | |
p02994 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
vector<int> vec(n);
int sum = 0;
for (int i = 0; i < n; i++) {
sum += l + i;
vec.at(i) = l + i;
}
int eat = 0;
if (vec.at(0) > 0) {
eat = vec.at(0);
} else if (vec.at(n) < 0) {
eat = vec.at(n);
}
c... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
vector<int> vec(n);
int sum = 0;
for (int i = 0; i < n; i++) {
sum += l + i;
vec.at(i) = l + i;
}
int eat = 0;
if (vec.at(0) > 0) {
eat = vec.at(0);
} else if (vec.at(n - 1) < 0) {
eat = vec.at(n - 1);... | replace | 15 | 17 | 15 | 17 | 0 | |
p02994 | C++ | Runtime Error |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, L;
vector<int> apple;
vector<int> abs_apple;
cin >> N >> L;
for (int i = 0; i < N; i++) {
apple.push_back(L + i);
abs_apple.push_back(abs(L + i));
}
int x, y;
for (int i = 0; i < N; i++) {
i... |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, L;
vector<int> apple;
vector<int> abs_apple;
cin >> N >> L;
for (int i = 0; i < N; i++) {
apple.push_back(L + i);
abs_apple.push_back(abs(L + i));
}
int x = 200, y = 300;
for (int i = 0; i < N; ... | replace | 15 | 16 | 15 | 16 | 0 | |
p02994 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define MOD 1e9 + 7
using namespace std;
typedef long long ll;
int main() {
int N, L, sum = 0;
cin >> N >> L;
vector<int> r(N, 1000);
for (int i = 1; i <= N; i++) {
r[i] = L + i - 1;
sum += r[i];
}
int mi = 100000;
bool a = ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define MOD 1e9 + 7
using namespace std;
typedef long long ll;
int main() {
int N, L, sum = 0;
cin >> N >> L;
vector<int> r(N + 1, 1000);
for (int i = 1; i <= N; i++) {
r[i] = L + i - 1;
sum += r[i];
}
int mi = 100000;
bool ... | 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.