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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02737 | C++ | Runtime Error | #include <bits/stdc++.h>
#define Rint register int
#define MP make_pair
#define fi first
#define se second
#define PB push_back
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
const int N = 100003, M = 1024, mod = 998244353;
template <typename T> void read(T &x) {
int ch = getchar();
x = 0;
... | #include <bits/stdc++.h>
#define Rint register int
#define MP make_pair
#define fi first
#define se second
#define PB push_back
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
const int N = 100003, M = 1024, mod = 998244353;
template <typename T> void read(T &x) {
int ch = getchar();
x = 0;
... | delete | 42 | 43 | 42 | 42 | 0 | |
p02738 | C++ | Runtime Error | /*{{{*/
#include <bits/stdc++.h>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define REP(I, N) for (int I = 0; I < (N); ++I)
#define REPP(I, A, B) for (int I = (A); I < (B); ++I)
#define FOR(I, A, B) for (int I = (A); I <= (B); ++I)
#define FORS(I, S) for (int I = 0; S[I]; ++I)
#define RS(X) s... | /*{{{*/
#include <bits/stdc++.h>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define REP(I, N) for (int I = 0; I < (N); ++I)
#define REPP(I, A, B) for (int I = (A); I < (B); ++I)
#define FOR(I, A, B) for (int I = (A); I <= (B); ++I)
#define FORS(I, S) for (int I = 0; S[I]; ++I)
#define RS(X) s... | replace | 86 | 87 | 86 | 87 | -11 | |
p02738 | C++ | Runtime Error | #include <bits/stdc++.h>
#define f(i, j) f[i][j + 3000]
#define int long long
using namespace std;
const int N = 2100;
int n, P;
int f[N][N + 3000];
signed main(void) {
cin >> n >> P;
f(0, 0) = 1;
for (int i = 0; i < n * 3; ++i)
for (int j = -n; j <= 3 * n; ++j) {
f(i + 1, j + 1) = (f(i + 1, j + 1) +... | #include <bits/stdc++.h>
#define f(i, j) f[i][j + 3000]
#define int long long
using namespace std;
const int N = 6100;
int n, P;
int f[N][N + 3000];
signed main(void) {
cin >> n >> P;
f(0, 0) = 1;
for (int i = 0; i < n * 3; ++i)
for (int j = -n; j <= 3 * n; ++j) {
f(i + 1, j + 1) = (f(i + 1, j + 1) +... | replace | 5 | 6 | 5 | 6 | 0 | |
p02738 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define N ()
#define M ()
#define inf (0x7f7f7f7f)
#define rg register int
#define Label puts("NAIVE")
#define spa print(' ')
#define ent prin... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define N ()
#define M ()
#define inf (0x7f7f7f7f)
#define rg register int
#define Label puts("NAIVE")
#define spa print(' ')
#define ent prin... | replace | 88 | 89 | 88 | 89 | 0 | |
p02738 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long int LL;
typedef pair<int, int> P;
typedef pair... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long int LL;
typedef pair<int, int> P;
typedef pair... | replace | 98 | 103 | 98 | 103 | TLE | |
p02738 | C++ | Runtime Error | #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#pragma comment(linker, "/STACK:526000000")
#include "bits/stdc++.h"
using namespace std;
typedef string::const_iterator State;
#define eps 1e-8L
#define MAX_MOD 1000000007LL
#define GYAKU 500000004LL
#define MOD 998244353LL
#define pb push_back
#define mp ma... | #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#pragma comment(linker, "/STACK:526000000")
#include "bits/stdc++.h"
using namespace std;
typedef string::const_iterator State;
#define eps 1e-8L
#define MAX_MOD 1000000007LL
#define GYAKU 500000004LL
#define MOD 998244353LL
#define pb push_back
#define mp ma... | replace | 878 | 879 | 878 | 879 | -11 | |
p02738 | C++ | Time Limit Exceeded | // #include <bits/stdc++.h>
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
// #include "boost/multiprecision/cpp_int.hpp"
// typedef boost::multiprecision::cpp_int LL;
typedef long double dd;
// #define i_7 (ll)(1E9+7)
// #define i_7 998244353
// #define i_5 i_7-2
ll i_7;
ll mod(ll a) {
ll c = a ... | // #include <bits/stdc++.h>
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
// #include "boost/multiprecision/cpp_int.hpp"
// typedef boost::multiprecision::cpp_int LL;
typedef long double dd;
// #define i_7 (ll)(1E9+7)
// #define i_7 998244353
// #define i_5 i_7-2
ll i_7;
ll mod(ll a) {
ll c = a ... | replace | 71 | 72 | 71 | 72 | TLE | |
p02738 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 5005;
int n, m, f[N][N], M;
signed main() {
scanf("%lld%lld", &n, &M);
f[0][n + 1] = 1;
for (int i = 0; i <= 3 * n; i++)
for (int j = -n; j <= 3 * n; j++) {
(f[i + 1][j + 1 + (n + 1)] += f[i][j + (n + 1)]) %= M;
(f[i... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 8005;
int n, m, f[N][N], M;
signed main() {
scanf("%lld%lld", &n, &M);
f[0][n + 1] = 1;
for (int i = 0; i <= 3 * n; i++)
for (int j = -n; j <= 3 * n; j++) {
(f[i + 1][j + 1 + (n + 1)] += f[i][j + (n + 1)]) %= M;
(f[i... | replace | 3 | 4 | 3 | 4 | -11 | |
p02738 | C++ | Runtime Error | #include <bits/stdc++.h>
#define cs const
using namespace std;
int Mod;
int add(int a, int b) { return a + b >= Mod ? a + b - Mod : a + b; }
int dec(int a, int b) { return a - b < 0 ? a - b + Mod : a - b; }
int mul(int a, int b) { return 1ll * a * b % Mod; }
void Add(int &a, int b) { a = add(a, b); }
void Dec(int &a, i... | #include <bits/stdc++.h>
#define cs const
using namespace std;
int Mod;
int add(int a, int b) { return a + b >= Mod ? a + b - Mod : a + b; }
int dec(int a, int b) { return a - b < 0 ? a - b + Mod : a - b; }
int mul(int a, int b) { return 1ll * a * b % Mod; }
void Add(int &a, int b) { a = add(a, b); }
void Dec(int &a, i... | replace | 10 | 12 | 10 | 12 | -11 | |
p02738 | C++ | Runtime Error | #include <bits/stdc++.h>
const int N3 = 3005;
const int N4 = 4005;
int inv2;
int n, n3, n4, mod;
int f[N3][N4];
inline void add(int &x, int y) {
x += y;
x >= mod ? x -= mod : 0;
}
int main() {
scanf("%d%d", &n, &mod);
f[0][n] = 1;
n3 = n * 3;
n4 = n * 4;
inv2 = mod + 1 >> 1;
for (int i = 0; i < n3; +... | #include <bits/stdc++.h>
const int N3 = 6005;
const int N4 = 8005;
int inv2;
int n, n3, n4, mod;
int f[N3][N4];
inline void add(int &x, int y) {
x += y;
x >= mod ? x -= mod : 0;
}
int main() {
scanf("%d%d", &n, &mod);
f[0][n] = 1;
n3 = n * 3;
n4 = n * 4;
inv2 = mod + 1 >> 1;
for (int i = 0; i < n3; +... | replace | 2 | 4 | 2 | 4 | 0 | |
p02738 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <iostream>
#include <string.h>
using namespace std;
int modadd(int a, int b, int m) {
int da = m - a;
if (da <= b) {
return b - da;
} else {
return a + b;
}
}
int modmul(int n, int b, int m) {
int ans = 0;
for (int i = 0; i < n; i++) {
ans = modadd(ans, b, m);... | #include <bits/stdc++.h>
#include <iostream>
#include <string.h>
using namespace std;
int modadd(int a, int b, int m) {
int da = m - a;
if (da <= b) {
return b - da;
} else {
return a + b;
}
}
int modmul(int n, int b, int m) {
long long int tmp = (long long int)b;
tmp *= n;
return tmp % m;
int... | insert | 15 | 15 | 15 | 18 | TLE | |
p02738 | C++ | Runtime Error | #define _USE_MATH_DEFINES
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
... | replace | 832 | 833 | 832 | 833 | 0 | |
p02738 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define N 6005
#define INF 0x3f3f3f3f
#define LL long long
int n, MOD, f[4][N];
int rd() {
int x = 0, f = 1;
char c = getchar();
while (c < '0' || c ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define N 6005
#define INF 0x3f3f3f3f
#define LL long long
int n, MOD, f[4][N * 2];
int rd() {
int x = 0, f = 1;
char c = getchar();
while (c < '0' |... | replace | 12 | 13 | 12 | 13 | 0 | |
p02738 | C++ | Runtime Error | #pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double PI = acos(-1.0);
#define t1(x) cerr << #x << "=" << x << endl
#define t2(x, y) cerr << #x << "=" << x << " " << #y << "=" << y << endl
#define t3(x, y, z) ... | #pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double PI = acos(-1.0);
#define t1(x) cerr << #x << "=" << x << endl
#define t2(x, y) cerr << #x << "=" << x << " " << #y << "=" << y << endl
#define t3(x, y, z) ... | replace | 40 | 41 | 40 | 41 | -11 | |
p02738 | C++ | Runtime Error | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()
#define cmin(a, b) (a > b ? a = b : a)
#define cmax(a, b) (a < b ? a = b : a)
#define mem(a, k) memset(a, k, sizeof(a))
#define lop(i, s, t) for (int i = s; i < (t); ++i)
#define rep(i, s, t) for (int i = s; i <= (t); +... | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()
#define cmin(a, b) (a > b ? a = b : a)
#define cmax(a, b) (a < b ? a = b : a)
#define mem(a, k) memset(a, k, sizeof(a))
#define lop(i, s, t) for (int i = s; i < (t); ++i)
#define rep(i, s, t) for (int i = s; i <= (t); +... | replace | 57 | 58 | 57 | 58 | 0 | |
p02738 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1003;
int n, m;
long long fast_pow(long long num, int deg) {
long long ans = 1, pow = num;
while (deg) {
if (deg & 1)
ans = ans * pow % m;
deg >>= 1;
pow = pow * pow % m;
}
return ans;
}
long long add(long long a, long long... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2003;
int n, m;
long long fast_pow(long long num, int deg) {
long long ans = 1, pow = num;
while (deg) {
if (deg & 1)
ans = ans * pow % m;
deg >>= 1;
pow = pow * pow % m;
}
return ans;
}
long long add(long long a, long long... | replace | 4 | 5 | 4 | 5 | -11 | |
p02738 | C++ | Runtime Error | #include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
#define N 2000001
using namespace std;
typedef long long ll;
typedef long double ld;
const ll INF = 1e18, MOD = 1e9 + 7, MOD2 = 1e6 + 3;
ll d[3001][6003], n, P, offset = 3000;
int main() {
cin >> n >> P;
d[0]... | #include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
#define N 2000001
using namespace std;
typedef long long ll;
typedef long double ld;
const ll INF = 1e18, MOD = 1e9 + 7, MOD2 = 1e6 + 3;
ll d[10001][10003], n, P, offset = 3000;
int main() {
cin >> n >> P;
d[... | replace | 14 | 15 | 14 | 15 | -11 | |
p02738 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long f[6005][6005 << 1], mod, ans;
int n;
int main() {
cin >> n >> mod;
f[0][3 * n] = 1;
for (int i = 1; i <= 3 * n; i++)
for (int j = -i / 2; j <= i; j++) {
f[i][j + 3 * n] += f[i - 1][j + 3 * n - 1];
f[i][j + 3 * n] += (i - 1) * f[i - 2][j + 1... | #include <bits/stdc++.h>
using namespace std;
long long f[6005][6005 << 1], mod, ans;
int n;
int main() {
cin >> n >> mod;
f[0][3 * n] = 1;
for (int i = 1; i <= 3 * n; i++)
for (int j = -3 * n; j <= 3 * n; j++) {
if (i)
f[i][j + 3 * n] += f[i - 1][j + 3 * n - 1];
if (i > 1)
f[i][... | replace | 10 | 14 | 10 | 17 | -11 | |
p02740 | C++ | Runtime Error | #include <bits/stdc++.h>
#define For(i, x, y) for (register int i = (x); i <= (y); i++)
#define FOR(i, x, y) for (register int i = (x); i < (y); i++)
#define Dow(i, x, y) for (register int i = (x); i >= (y); i--)
#define Debug(v) \
for (auto i : v) ... | #include <bits/stdc++.h>
#define For(i, x, y) for (register int i = (x); i <= (y); i++)
#define FOR(i, x, y) for (register int i = (x); i < (y); i++)
#define Dow(i, x, y) for (register int i = (x); i >= (y); i--)
#define Debug(v) \
for (auto i : v) ... | replace | 36 | 37 | 36 | 37 | 0 | |
p02741 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> a = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14,
1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int k;
cin >> k;
cout << a.at(k) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> a = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14,
1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int k;
cin >> k;
cout << a.at(k - 1) << endl;
return 0;
} | replace | 10 | 11 | 10 | 11 | 0 | |
p02741 | C++ | Runtime Error | #include <iostream>
#include <utility>
#include <vector>
using namespace std;
int main(void) {
int K;
vector<int> L = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14,
1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
cin >> K;
cout << L.at(K) << endl;
return 0;
}
| #include <iostream>
#include <utility>
#include <vector>
using namespace std;
int main(void) {
int K;
vector<int> L = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14,
1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
cin >> K;
cout << L.at(K - 1) << endl;
return 0;
} | replace | 10 | 11 | 10 | 11 | 0 | |
p02741 | C++ | Runtime Error | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define coyes cout << "Yes" << endl;
#define cono cout << "No" << endl;
#define coYes cout << "YES" << endl;
#define coNo cout << "NO" << endl;
using namespace std;
using ll = long long int;
string large_al = "ABCDEFGHI... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define coyes cout << "Yes" << endl;
#define cono cout << "No" << endl;
#define coYes cout << "YES" << endl;
#define coNo cout << "NO" << endl;
using namespace std;
using ll = long long int;
string large_al = "ABCDEFGHI... | replace | 17 | 31 | 17 | 20 | 0 | |
p02741 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int K;
cin >> K;
string t = "1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, "
"2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51,";
int sum = 0;
for (int i = 0; i < t.size(); i++) {
if (t.at(i) == ',') {
sum += 1;
if (... | #include <bits/stdc++.h>
using namespace std;
int main() {
int K;
cin >> K;
string t = "1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, "
"2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51,";
int sum = 0;
for (int i = 0; i < t.size(); i++) {
if (t.at(i) == ',') {
sum += 1;
if (... | insert | 15 | 15 | 15 | 19 | 0 | |
p02741 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int K;
cin >> K;
vector<int> a = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14,
1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
cout << a.at(K) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int K;
cin >> K;
vector<int> a = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14,
1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
cout << a.at(K - 1) << endl;
} | replace | 10 | 11 | 10 | 11 | 0 | |
p02741 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int K;
cin >> K;
vector<int> vec = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14,
1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
cout << vec.at(K) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int K;
cin >> K;
vector<int> vec = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14,
1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
cout << vec.at(K - 1) << endl;
}
| replace | 8 | 9 | 8 | 9 | 0 | |
p02741 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> vec = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14,
1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int a;
cin >> a;
cout << vec.at(a) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> vec = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14,
1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int a;
cin >> a;
cout << vec.at(a - 1) << endl;
return 0;
}
| replace | 8 | 9 | 8 | 9 | 0 | |
p02741 | C++ | Runtime Error | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <unordered_map>
#define stop(x) \
{ \
cout << x << endl; ... | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <unordered_map>
#define stop(x) \
{ \
cout << x << endl; ... | replace | 29 | 30 | 29 | 30 | -11 | |
p02741 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> vec = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14,
1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int K;
cin >> K;
cout << vec.at(K) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> vec = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14,
1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int K;
cin >> K;
cout << vec.at(K - 1) << endl;
} | replace | 8 | 9 | 8 | 9 | 0 | |
p02741 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef vector<int> vec1;
typedef vector<string> vec2;
int main() {
int k;
cin >> k;
vec1 t = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14,
1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
cout << t.at(k + 1) << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef vector<int> vec1;
typedef vector<string> vec2;
int main() {
int k;
cin >> k;
vec1 t = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14,
1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
cout << t.at(k - 1) << endl;
} | replace | 12 | 13 | 12 | 13 | 0 | |
p02741 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> vec = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14,
1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int K;
cin >> K;
cout << vec.at(K) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> vec = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14,
1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int K;
cin >> K;
cout << vec.at(K - 1) << endl;
}
| replace | 10 | 11 | 10 | 11 | 0 | |
p02741 | Python | Runtime Error | num = [
1,
1,
1,
2,
1,
2,
1,
5,
2,
2,
1,
5,
1,
2,
1,
14,
1,
5,
1,
5,
2,
2,
1,
15,
2,
2,
5,
4,
1,
4,
1,
51,
]
input = int(input())
print(num[input])
| num = [
1,
1,
1,
2,
1,
2,
1,
5,
2,
2,
1,
5,
1,
2,
1,
14,
1,
5,
1,
5,
2,
2,
1,
15,
2,
2,
5,
4,
1,
4,
1,
51,
]
input = int(input())
print(num[input - 1])
| replace | 35 | 36 | 35 | 36 | 0 | |
p02741 | Python | Runtime Error | import math
a, b, c = map(int, input().split())
result = math.sqrt(a) + math.sqrt(b) < math.sqrt(c)
if result:
print("Yes")
else:
print("No")
| l = [
1,
1,
1,
2,
1,
2,
1,
5,
2,
2,
1,
5,
1,
2,
1,
14,
1,
5,
1,
5,
2,
2,
1,
15,
2,
2,
5,
4,
1,
4,
1,
51,
]
N = int(input())
print(l[N - 1])
| replace | 0 | 10 | 0 | 36 | ValueError: not enough values to unpack (expected 3, got 1) | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02741/Python/s700954713.py", line 2, in <module>
a, b, c = map(int, input().split())
ValueError: not enough values to unpack (expected 3, got 1)
|
p02741 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int K;
vector<int> a = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14,
1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
cin >> K;
cout << a.at(K);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int K;
vector<int> a = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14,
1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
cin >> K;
cout << a.at(K - 1);
} | replace | 7 | 8 | 7 | 8 | 0 | |
p02741 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repp(i, n) for (int i = 1; i <= (int)(n); i++)
#define co(x) cout << x << endl
typedef long long int lint;
int main() {
vector<int> X = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14,
1, 5... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repp(i, n) for (int i = 1; i <= (int)(n); i++)
#define co(x) cout << x << endl
typedef long long int lint;
int main() {
vector<int> X = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14,
1, 5... | replace | 12 | 13 | 12 | 13 | 0 | |
p02741 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int K;
cin >> K;
vector<int> vec(32);
vec = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14,
1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
cout << vec.at(K) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int K;
cin >> K;
vector<int> vec(32);
vec = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14,
1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
cout << vec.at(K - 1) << endl;
}
| replace | 9 | 11 | 9 | 10 | 0 | |
p02741 | C++ | Runtime Error | // I am so vegetable
#include <bits/stdc++.h>
#define FIO ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define _for(i, a, b) for (int i = (a); i < (b); ++i)
#define _defor(i, a, b) for ((i) = (a); (i) < (b); ++i)
#define _rfor(i, a, b) for (int i = (a); i > (b); --i)
#define _sfor(p, st) for (auto &p : st)
#def... | // I am so vegetable
#include <bits/stdc++.h>
#define FIO ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define _for(i, a, b) for (int i = (a); i < (b); ++i)
#define _defor(i, a, b) for ((i) = (a); (i) < (b); ++i)
#define _rfor(i, a, b) for (int i = (a); i > (b); --i)
#define _sfor(p, st) for (auto &p : st)
// #... | replace | 7 | 8 | 7 | 8 | -11 | |
p02741 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> nb = {1, 1, 1, 2, 1};
int input;
cin >> input;
cout << nb.at(input - 1) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> nb = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14,
1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int input;
cin >> input;
cout << nb.at(input - 1) << endl;
} | replace | 4 | 5 | 4 | 6 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 5) >= this->size() (which is 5)
|
p02741 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int K;
vector<int> vec;
vec = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14,
1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
cin >> K;
cout << vec.at(K) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int K;
vector<int> vec;
vec = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14,
1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
cin >> K;
cout << vec.at(K - 1) << endl;
}
| replace | 9 | 10 | 9 | 10 | 0 | |
p02741 | 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
int a[32] = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14,
1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int k;
cin >> k;
cout ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[32] = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14,
1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int k;
cin >> k;
cout << a[k - 1] << '\n';
} | delete | 3 | 7 | 3 | 3 | -11 | |
p02741 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> vec(32);
vec = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14,
1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int k;
cin >> k;
cout << vec.at(k);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> vec(32);
vec = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14,
1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int k;
cin >> k;
cout << vec.at(k - 1);
return 0;
} | replace | 9 | 10 | 9 | 10 | 0 | |
p02741 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
int K;
cin >> K;
vector<int> a = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14,
1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
cout << a.at(K) << endl;
return 0;
} | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
int K;
cin >> K;
vector<int> a = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14,
1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
cout << a.at(K - 1) << endl;
return 0;
} | replace | 9 | 10 | 9 | 10 | 0 | |
p02741 | C++ | Runtime Error | // P.C.2.0.
#include <bits/stdc++.h>
#include <unordered_map>
using namespace std;
#define speed \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define ll long long int
#define ul unsigned long int
#def... | // P.C.2.0.
#include <bits/stdc++.h>
#include <unordered_map>
using namespace std;
#define speed \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define ll long long int
#define ul unsigned long int
#def... | replace | 27 | 31 | 27 | 32 | -11 | |
p02741 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int K;
cin >> K;
int list[32] = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14,
1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
return list[K];
}
| #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int K;
cin >> K;
int arr[32] = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14,
1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
cout << arr[K - 1] << endl;
}
| replace | 9 | 12 | 9 | 13 | 1 | |
p02741 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14,
1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
cout << a.at(n + 1) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14,
1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
cout << a.at(n - 1) << endl;
}
| replace | 9 | 10 | 9 | 10 | 0 | |
p02741 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
#define N 32
int main() {
vector<int> data = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14,
1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int K;
cin >> K;
cout << data.at(K) << endl;
} | #include <iostream>
#include <vector>
using namespace std;
#define N 32
int main() {
vector<int> data = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14,
1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int K;
cin >> K;
cout << data.at(K - 1) << endl;
} | replace | 12 | 13 | 12 | 13 | 0 | |
p02741 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> vec; // int型の配列変数vecを宣言
int K;
cin >> K;
vec = {
1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1,
5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51}; // 25, 100, 64
// という整... | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> vec; // int型の配列変数vecを宣言
int K;
cin >> K;
vec = {
1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1,
5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51}; // 25, 100, 64
// という整... | replace | 14 | 15 | 14 | 15 | 0 | |
p02741 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
int main() {
int k;
cin >> k;
vector<int> v = {1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1,
5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
cout << v.at(k ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
int main() {
int k;
cin >> k;
vector<int> v = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14,
1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
cout << v.... | replace | 8 | 10 | 8 | 10 | 0 | |
p02741 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s = "1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, "
"2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51";
string ans = "";
int cnt = 0;
int i = -1;
while (cnt < n) {
i++;
switch (s[i]) {
case ','... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s = "1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, "
"2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51,";
string ans = "";
int cnt = 0;
int i = -1;
while (cnt < n) {
i++;
switch (s[i]) {
case ',... | replace | 7 | 8 | 7 | 8 | 0 | |
p02741 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <numeric>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int K;
cin >> K;
vector<int> vec{1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14,
1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
cout << ve... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int K;
cin >> K;
vector<int> vec{1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14,
1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
cout << ve... | replace | 13 | 14 | 13 | 14 | 0 | |
p02741 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int K;
cin >> K;
vector<int> vec;
vec = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14,
1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
cout << vec.at(K) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int K;
cin >> K;
vector<int> vec;
vec = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14,
1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
cout << vec.at(K - 1) << endl;
}
| replace | 10 | 11 | 10 | 11 | 0 | |
p02741 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> num{100, 1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14,
1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int k;
cin >> k;
cout << num.at(k + 1) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> num{100, 1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14,
1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int k;
cin >> k;
cout << num.at(k) << endl;
} | replace | 11 | 12 | 11 | 12 | 0 | |
p02741 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> data = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14,
1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int K;
cin >> K;
cout << data.at(K + 1) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> data = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14,
1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int K;
cin >> K;
cout << data.at(K - 1) << endl;
} | replace | 8 | 9 | 8 | 9 | 0 | |
p02741 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> S;
S = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14,
1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
cout << S.at(N) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> S;
S = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14,
1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
cout << S.at(N - 1) << endl;
}
| replace | 8 | 9 | 8 | 9 | 0 | |
p02741 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> vec;
vec = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14,
1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int K;
cin >> K;
cout << vec.at(K) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> vec;
vec = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14,
1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int K;
cin >> K;
cout << vec.at(K - 1) << endl;
} | replace | 10 | 11 | 10 | 11 | 0 | |
p02741 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int K = 0;
cin >> K;
vector<int> suretsu(32);
suretsu = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14,
1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
cout << suretsu.at(K + 1) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int K = 0;
cin >> K;
vector<int> suretsu(32);
suretsu = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14,
1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
cout << suretsu.at(K - 1) << endl;
}
| replace | 10 | 11 | 10 | 11 | 0 | |
p02741 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int K;
cin >> K;
vector<int> S = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14,
1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
cout << S.at(K + 1) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int K;
cin >> K;
vector<int> S = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14,
1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
cout << S.at(K - 1) << endl;
}
| replace | 8 | 9 | 8 | 9 | 0 | |
p02741 | C++ | Runtime Error | /*
─────────────────────
───────────████████──
──────────███▄███████
──────────███████████
──────────███████████
──────────██████─────
──────────█████████──
█───────███████──────
██────████████████───
███──██████████──█───
███████████████──────
███████████████──────
─█████████████───────
──███████████────────
────█████... | /*
─────────────────────
───────────████████──
──────────███▄███████
──────────███████████
──────────███████████
──────────██████─────
──────────█████████──
█───────███████──────
██────████████████───
███──██████████──█───
███████████████──────
███████████████──────
─█████████████───────
──███████████────────
────█████... | delete | 68 | 74 | 68 | 68 | -7 | |
p02741 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int K;
cin >> K;
vector<int> vec = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14,
1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
cout << vec.at(K) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int K;
cin >> K;
vector<int> vec = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14,
1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
cout << vec.at(K - 1) << endl;
return 0;
}
| replace | 8 | 9 | 8 | 9 | 0 | |
p02741 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> vec = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14,
1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int N;
cin >> N;
int K;
K = N + 1;
cout << vec.at(K) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> vec = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14,
1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int N;
cin >> N;
int K;
K = N - 1;
cout << vec.at(K) << endl;
}
| replace | 10 | 11 | 10 | 11 | 0 | |
p02741 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> yama;
yama = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14,
1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int k;
cin >> k;
cout << yama.at(k) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> yama;
yama = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14,
1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int k;
cin >> k;
k = k - 1;
cout << yama.at(k) << endl;
} | insert | 10 | 10 | 10 | 11 | 0 | |
p02741 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int K;
cin >> K;
// 配列
vector<int> vec; // int型の配列変数vecを宣言
vec = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14,
1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
cout << vec.at(K) << endl; //
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int K;
cin >> K;
// 配列
vector<int> vec; // int型の配列変数vecを宣言
vec = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14,
1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
cout << vec.at(K - 1) << endl; //
}
| replace | 13 | 14 | 13 | 14 | 0 | |
p02741 | C++ | Runtime Error | //*******Abhijit Burman***********//
// Jalpaiguri Government Engineering College//
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mk make_pair
#define MAXX (1000000000000000000 + 7)
#define fio \
... | //*******Abhijit Burman***********//
// Jalpaiguri Government Engineering College//
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mk make_pair
#define MAXX (1000000000000000000 + 7)
#define fio \
... | replace | 26 | 32 | 26 | 32 | -7 | |
p02742 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using ulint = unsigned long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios {
fast_ios() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
#define ... | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using ulint = unsigned long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios {
fast_ios() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
#define ... | replace | 276 | 277 | 276 | 278 | 0 | |
p02742 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
long long h, w;
int main() {
scanf("%lld%lld", &h, &w);
if (h == 1 || w == 1)
return puts("1");
printf("%lld\n", (h * w + 1) / 2);
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
long long h, w;
int main() {
scanf("%lld%lld", &h, &w);
if (h == 1 || w == 1)
return puts("1") * 0;
printf("%lld\n", (h * w + 1) / 2);
} | replace | 7 | 8 | 7 | 8 | 0 | |
p02742 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int h;
cin >> h;
int w;
cin >> w;
pair<int, int> p;
vector<pair<int, int>> chess;
for (int i = 0; i < h; ++i) {
for (int j = 0; j < w; ++j) {
p = make_pair(i, j);
chess.push_back(p);
}
}
int count = 0;
for (int i = 0; i... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long h, w;
cin >> h >> w;
if (h == 1 || w == 1)
cout << 1 << endl;
else
cout << (h * w) / 2 + ((h * w) % 2) << endl;
}
| replace | 4 | 25 | 4 | 10 | TLE | |
p02742 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long
const ll mod = 1e9 + 7;
const ll maxn = 2e5 + 5;
const double pi =
3.1415926535897932384626433832795028841971693993751058209749445923078;
// iostream::sync_with_stdio(false);
int main() {
int m[35] = {1, 1, 1, 2, 1, 2, 1, 5, ... | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long
const ll mod = 1e9 + 7;
const ll maxn = 2e5 + 5;
const double pi =
3.1415926535897932384626433832795028841971693993751058209749445923078;
// iostream::sync_with_stdio(false);
int main() {
ll n, m;
cin >> n >> m;
if (n == ... | replace | 14 | 19 | 14 | 27 | 0 | |
p02742 | Python | Runtime Error | H, W = map(int, input().split())
if H == 1 or W == 1:
print(1)
else:
if (H * W) % 2 == 1:
ans = H * W // 2 + 1
else:
ans = H * W // 2
print(ans)
| H, W = map(int, input().split())
if H == 1 or W == 1:
print(1)
else:
if (H * W) % 2 == 1:
ans = H * W // 2 + 1
else:
ans = H * W // 2
print(ans)
| replace | 9 | 10 | 9 | 10 | 0 | |
p02742 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
unsigned long long int h, w;
cin >> h >> w;
unsigned long long int bh = 0;
unsigned long long int sh = 0;
if (h == 1 or w == 1) {
return 1;
}
if (h & 1) {
bh = (h / 2) + 1;
sh = bh - 1;
} else {
bh = h / 2;
sh = bh;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
unsigned long long int h, w;
cin >> h >> w;
unsigned long long int bh = 0;
unsigned long long int sh = 0;
if (h == 1 or w == 1) {
cout << 1 << endl;
return 0;
}
if (h & 1) {
bh = (h / 2) + 1;
sh = bh - 1;
} else {
bh = h / ... | replace | 10 | 11 | 10 | 12 | 0 | |
p02742 | C++ | Runtime Error | // #pragma GCC optimize("O3")
// #pragma GCC target("avx")
#include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#inc... | // #pragma GCC optimize("O3")
// #pragma GCC target("avx")
#include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#inc... | replace | 251 | 252 | 251 | 253 | 0 | |
p02742 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define debug(x) \
cout << "DEBUG" \
<< " " << #x << ":" << x << '\n'
// n回繰り返し
#define rep(i, n) for (int i = 0; i < ((int)(n)); i++) /... | #include <bits/stdc++.h>
using namespace std;
#define debug(x) \
cout << "DEBUG" \
<< " " << #x << ":" << x << '\n'
// n回繰り返し
#define rep(i, n) for (int i = 0; i < ((int)(n)); i++) /... | replace | 63 | 64 | 63 | 64 | 0 | |
p02742 | C++ | Runtime Error | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
// repマクロ定義
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
// allマクロ定義
#define all(v) v.begin(), v.end()
using namespace std;
int main() {
long long h, w, ans;
cin >> h >> w;
if (h == 1 || w == 1) {
ans = 1;
} else {
ans = (h * w + 1) / 2;
}
c... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
// repマクロ定義
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
// allマクロ定義
#define all(v) v.begin(), v.end()
using namespace std;
int main() {
long long h, w, ans;
cin >> h >> w;
if (h == 1 || w == 1) {
ans = 1;
} else {
ans = (h * w + 1) / 2;
}
c... | delete | 19 | 20 | 19 | 19 | 0 | |
p02742 | C++ | Runtime Error | // https://atcoder.jp/contests/abcXXX/tasks/abcXXX_x
#include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long l... | // https://atcoder.jp/contests/abcXXX/tasks/abcXXX_x
#include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long l... | replace | 60 | 62 | 60 | 64 | 0 | |
p02742 | 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, typename cmp=less<T>> using oset =tree<T, null_type,
// cmp, r... | /* ꧁༒☬महाकाल☬༒꧂ ꧁༒ঔमहाकालঔ༒꧂
ঔৣमहाकालᴳᵒᵈঔৣ
*/
#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, typename cmp=less<T>> using oset =tree<T, null_type,
// cmp, r... | replace | 31 | 35 | 31 | 44 | 0 | |
p02742 | Python | Runtime Error | import math
h, w = map(int, input().split())
if h == 1 or w == 1:
print(1)
elif (h * w) % 2 == 0:
ans = (h * w) // 2
else:
ans = (h // 2) * w + math.ceil(w / 2)
print(ans)
| import math
h, w = map(int, input().split())
if h == 1 or w == 1:
ans = 1
elif (h * w) % 2 == 0:
ans = (h * w) // 2
else:
ans = (h // 2) * w + math.ceil(w / 2)
print(ans)
| replace | 5 | 6 | 5 | 6 | 0 | |
p02742 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
ios ::sync_with_stdio(false);
cin.tie(0);
long long n, m, s;
cin >> n >> m;
s = n * m;
if (n == 1 or m == 1)
return 1;
cout << (s % 2 == 0 ? s / 2 : (s / 2) + 1);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios ::sync_with_stdio(false);
cin.tie(0);
long long n, m, s;
cin >> n >> m;
s = n * m;
if (n == 1 or m == 1)
cout << 1;
else
cout << (s % 2 == 0 ? s / 2 : (s / 2) + 1);
return 0;
} | replace | 10 | 12 | 10 | 13 | 0 | |
p02743 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using vi = vector<int>;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
using ld = long double;
const ld eps = 1.0e-9; // 許容される誤差
ld mysqrtl(ld x) {
ld a = sqrt((double)x); // 近似値
do {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using vi = vector<int>;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
using ld = long double;
const ld eps = 1.0e-9; // 許容される誤差
ld mysqrtl(ld x) {
ld a = sqrt((double)x); // 近似値
do {
... | replace | 24 | 26 | 24 | 26 | TLE | |
p02743 | Python | Runtime Error | a, b, c = input().split()
if c - a - b > 0:
if 4 * a * b < (c - a - b) ** 2:
print("Yes")
else:
print("No")
else:
print("No")
| a, b, c = map(int, input().split())
if c - a - b > 0:
if 4 * a * b < (c - a - b) ** 2:
print("Yes")
else:
print("No")
else:
print("No")
| replace | 0 | 1 | 0 | 1 | TypeError: unsupported operand type(s) for -: 'str' and 'str' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02743/Python/s899697147.py", line 3, in <module>
if c - a - b > 0:
TypeError: unsupported operand type(s) for -: 'str' and 'str'
|
p02743 | C++ | Runtime Error | #include <bits/stdc++.h>
int main() {
using namespace std;
unsigned long a, b, c;
cin >> a >> b >> c;
unsigned long k{4 * a * b}, l{max(a + b, c) - min(a + b, c)};
if (k == l * l)
abort();
puts(k < l * l ? "Yes" : "No");
return 0;
} | #include <bits/stdc++.h>
int main() {
using namespace std;
unsigned long a, b, c;
cin >> a >> b >> c;
unsigned long k{4 * a * b}, l{c - a - b};
puts(a + b < c && k < l * l ? "Yes" : "No");
return 0;
} | replace | 6 | 10 | 6 | 8 | 0 | |
p02743 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll a, b, c;
cin >> a >> b >> c;
auto f = [](long double d) {
long double a = sqrt((double)d);
do {
a = (a + d / a) / 2.0L;
} while (fabsl(d - a * a) > (long double)1.0e-9);
return a;
};
long double x = f(... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll a, b, c;
cin >> a >> b >> c;
long double x = sqrt((long double)(4 * a * b));
bool yes = x < (long double)(c - a - b);
if (yes)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | replace | 8 | 17 | 8 | 9 | TLE | |
p02743 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define fr(i, a, b) for (int i = a; i < b; i++)
#define bfr(i, a, b) for (int i = a; i >= b; i--)
#define fio \
ios_base::sync_with_stdio(false); ... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define fr(i, a, b) for (int i = a; i < b; i++)
#define bfr(i, a, b) for (int i = a; i >= b; i--)
#define fio \
ios_base::sync_with_stdio(false); ... | delete | 18 | 23 | 18 | 18 | 0 | |
p02743 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const long double eps = 1.0e-10;
long double mysqrt(long double x) {
long double a = sqrt(x);
do {
a = (a + x / a) / 2.0L;
} while (fabsl(x - a * a) > eps);
return a;
}
int main() {
long double a, b, c;
string ans;
cin >> a >> b >> c;
long double ... | #include <bits/stdc++.h>
using namespace std;
const long double eps = 1.0e-10;
long double mysqrt(long double x) {
long double a = sqrt(x);
do {
a = (a + x / a) / 2.0L;
} while (fabsl(x - a * a) > eps);
return a;
}
int main() {
long double a, b, c;
string ans;
cin >> a >> b >> c;
long double ... | replace | 21 | 22 | 21 | 22 | TLE | |
p02743 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int64_t a, b, c;
cin >> a >> b >> c;
if (a == b)
cout << (2 * (a + b) < c ? "Yes" : "No") << '\n';
assert(a == b);
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int64_t a, b, c;
cin >> a >> b >> c;
if (a == b)
cout << (2 * (a + b) < c ? "Yes" : "No") << '\n';
else {
if (2 * (a + b) <= c) {
cout << "Yes" << '\n';
} else {
cout << (sqrt(a) +... | replace | 9 | 10 | 9 | 16 | -6 | c4d3f54b-3e00-4444-8898-160a0c52f6c5.out: /home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02743/C++/s711826243.cpp:9: int main(): Assertion `a == b' failed.
|
p02743 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define int lon... | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define int lon... | replace | 27 | 38 | 27 | 36 | 0 | |
p02743 | C++ | Runtime Error | #include <bits/stdc++.h>
#define N 100005
#define FOR(i, a, b) for (int i = a; i <= b; ++i)
#define ll long long
using namespace std;
ll a, b, c;
int main() {
ios_base::sync_with_stdio(0);
cin.tie();
cout.tie();
freopen("C.inp", "r", stdin);
freopen("C.out", "w", stdout);
cin >> a >> b >> c;
ll d = c - a... | #include <bits/stdc++.h>
#define N 100005
#define FOR(i, a, b) for (int i = a; i <= b; ++i)
#define ll long long
using namespace std;
ll a, b, c;
int main() {
ios_base::sync_with_stdio(0);
cin.tie();
cout.tie();
cin >> a >> b >> c;
ll d = c - a - b;
if (d > 0 && d * d > 4 * a * b)
cout << "Yes";
els... | replace | 11 | 13 | 11 | 12 | 0 | |
p02743 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
typedef long double ld;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define F first
#define S second
const int mx = 2000... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
typedef long double ld;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define F first
#define S second
const int mx = 2000... | replace | 28 | 29 | 28 | 29 | TLE | |
p02743 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
using vb = vector<bool>;
using P = pair<ll, ll>;
template <typename T> using pq = priority_queue<T>;
template <typename T> using minpq = priority_queue<T, vector<T>, greater<T>>;
template <typename T, ty... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
using vb = vector<bool>;
using P = pair<ll, ll>;
template <typename T> using pq = priority_queue<T>;
template <typename T> using minpq = priority_queue<T, vector<T>, greater<T>>;
template <typename T, ty... | replace | 61 | 62 | 61 | 62 | TLE | |
p02743 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define pb push_back
#define f(i, n) for (i = 0; i < n; i++)
#define F(i, a, b) for (i = a; a <= b; i++)
#define arr(a, n) \
for (i = 0; i < n; i++) ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define pb push_back
#define f(i, n) for (i = 0; i < n; i++)
#define F(i, a, b) for (i = a; a <= b; i++)
#define arr(a, n) \
for (i = 0; i < n; i++) ... | replace | 51 | 57 | 51 | 57 | 0 | |
p02744 | C++ | Runtime Error | #include <bits/stdc++.h>
#define pf printf
#define sc(x) scanf("%d", &x);
#define scs(x) scanf("%s", x);
#define scl(x) scanf("%lld", &x);
#define rep(i, s, e) for (int i = s; i <= e; ++i)
#define dep(i, s, e) for (int i = s; i >= e; --i)
typedef long long ll;
using namespace std;
int end, k;
char s[100];
void solve(in... | #include <bits/stdc++.h>
#define pf printf
#define sc(x) scanf("%d", &x);
#define scs(x) scanf("%s", x);
#define scl(x) scanf("%lld", &x);
#define rep(i, s, e) for (int i = s; i <= e; ++i)
#define dep(i, s, e) for (int i = s; i >= e; --i)
typedef long long ll;
using namespace std;
int end, k;
char s[100];
void solve(in... | insert | 25 | 25 | 25 | 29 | -11 | |
p02744 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int N;
void dfs(string s) {
if (s.length() == N) {
cout << s << endl;
return;
}
char moji = 'a';
for (char c : s) {
moji = max(c, moji);
}
for (char str = 'a'; str <= moji + 1; str++) {
s += str;
dfs(s);
}
}
int main() {
cin >> N;
stri... | #include <bits/stdc++.h>
using namespace std;
int N;
void dfs(string s) {
if (s.length() == N) {
cout << s << endl;
return;
}
char moji = 'a';
for (char c : s) {
moji = max(c, moji);
}
for (char str = 'a'; str <= moji + 1; str++) {
dfs(s + str);
}
}
int main() {
cin >> N;
string s = ... | replace | 14 | 16 | 14 | 16 | TLE | |
p02744 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> llP;
ll mod(ll a, ll b) {
ll ret = a % b;
if (ret < 0)
ret += b;
return ret;
}
ll modpow(ll a, ll b, ll c) {
ll res = 1;
while (b > 0) {
if (b & 1)
res = mod(r... | #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> llP;
ll mod(ll a, ll b) {
ll ret = a % b;
if (ret < 0)
ret += b;
return ret;
}
ll modpow(ll a, ll b, ll c) {
ll res = 1;
while (b > 0) {
if (b & 1)
res = mod(r... | replace | 28 | 34 | 28 | 35 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p02744 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctype.h>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stac... | #include <algorithm>
#include <array>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctype.h>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stac... | replace | 863 | 864 | 863 | 864 | 0 | |
p02744 | C++ | Runtime Error |
#include <bits/stdc++.h>
#define endl '\n'
using namespace std;
string s = "";
int dfs(int n, int mask) {
if (n == 0) {
cout << s << endl;
} else {
int i;
for (i = 0; i < 26; i++) {
if (mask & (1 << i)) {
s += string(1, i + 'a');
dfs(n - 1, mask);
s.pop_back();
} ... |
#include <bits/stdc++.h>
#define endl '\n'
using namespace std;
string s = "";
int dfs(int n, int mask) {
if (n == 0) {
cout << s << endl;
} else {
int i;
for (i = 0; i < 26; i++) {
if (mask & (1 << i)) {
s += string(1, i + 'a');
dfs(n - 1, mask);
s.pop_back();
} ... | replace | 33 | 37 | 33 | 38 | TLE | |
p02744 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const double eps = 1e-8;
const int NINF = 0xc0c0c0c0;
const int INF = 0x3f3f3f3f;
const ll mod = 1e9 + 7;
const ll maxn = 1e6 + 5;
int n, a[100];
void dfs(int p, int lim) {
if (p == n + 1) {
for (int i = 1; i <= n; i++... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const double eps = 1e-8;
const int NINF = 0xc0c0c0c0;
const int INF = 0x3f3f3f3f;
const ll mod = 1e9 + 7;
const ll maxn = 1e6 + 5;
int n, a[100];
void dfs(int p, int lim) {
if (p == n + 1) {
for (int i = 1; i <= n; i++... | insert | 18 | 18 | 18 | 19 | -11 | |
p02744 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
long long int dfs(std::string &S, long long int N, char tmpmax,
long long int i) ... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
long long int dfs(std::string &S, long long int N, char tmpmax,
long long int i) ... | replace | 43 | 44 | 43 | 48 | -11 | a
|
p02744 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
void f(int n, int now, int nmax);
string ans = "a";
int main() {
int n;
cin >> n;
f(n, 1, 0);
}
void f(int n, int now, int nmax) {
if (now == n - 1) {
int i = 0;
while (i <= nmax + 1) {
ans += 'a' + i;
cout << ans << endl;
ans = ans.su... | #include <bits/stdc++.h>
using namespace std;
void f(int n, int now, int nmax);
string ans = "a";
int main() {
int n;
cin >> n;
if (n != 1)
f(n, 1, 0);
else
cout << 'a' << endl;
}
void f(int n, int now, int nmax) {
if (now == n - 1) {
int i = 0;
while (i <= nmax + 1) {
ans += 'a' + ... | replace | 11 | 12 | 11 | 15 | -11 | |
p02744 | C++ | Runtime Error | #include <stdio.h>
char f(int x) {
char S;
S = 'a' + x - 1;
return S;
}
int main(void) {
char s[11][2268000][11];
int a[11][2268000];
int c[11];
int n, i, j, k, l, p;
s[1][1][1] = 'a';
a[1][1] = 1;
c[1] = 1;
for (i = 2; i <= 10; i++) {
p = 0;
for (j = 1; j <= c[i - 1]; j++) {
for... | #include <stdio.h>
char f(int x) {
char S;
S = 'a' + x - 1;
return S;
}
int main(void) {
char s[11][115976][11];
int a[11][115976];
int c[11];
int n, i, j, k, l, p;
s[1][1][1] = 'a';
a[1][1] = 1;
c[1] = 1;
for (i = 2; i <= 10; i++) {
p = 0;
for (j = 1; j <= c[i - 1]; j++) {
for (... | replace | 9 | 11 | 9 | 11 | -11 | |
p02744 | C++ | Runtime Error | #include <algorithm>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
using namespace std;
typedef long long ll;
int gCount = 0;
string list[100000];
void addChar(string str, int level, int n) {
if (str.length() == n) {
list[gCount] = str;
gCount++;
} else {
... | #include <algorithm>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
using namespace std;
typedef long long ll;
int gCount = 0;
string list[120000];
void addChar(string str, int level, int n) {
if (str.length() == n) {
list[gCount] = str;
gCount++;
} else {
... | replace | 11 | 12 | 11 | 12 | 0 | |
p02744 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.b... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.b... | replace | 87 | 88 | 87 | 88 | 0 | |
p02744 | Python | Runtime Error | N = int(input())
A = {
1: ["a"],
2: ["aa", "ab"],
3: ["aaa", "aab", "aba", "abb", "abc"],
4: [
"aaaa",
"aaab",
"aabb",
"aabc",
"abaa",
"abab",
"abac",
"abba",
"abbb",
"abbc",
"abca",
"abcb",
"abcc",
... | N = int(input())
D = ["a", "b", "c", "d", "e", "f", "g", "h", "i", "j"]
Ans = [["a"]]
for i in range(1, 10):
before = Ans[i - 1]
# print(before)
next = []
for j in before:
L = set(list(j))
# print(L)
for k in range(len(L) + 1):
# print(j)
next.append(j + D... | replace | 1 | 76 | 1 | 16 | 0 | |
p02745 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <typename T> ostream &operator<<(ostream &os, vector<T> &v) {
string sep = " ";
if (v.size())
os << v[0];
for (int i = 1; i < v.size(); i++)
os << sep << v[i];
return os;
}
template <typename T> istream &operator>>(istream &i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <typename T> ostream &operator<<(ostream &os, vector<T> &v) {
string sep = " ";
if (v.size())
os << v[0];
for (int i = 1; i < v.size(); i++)
os << sep << v[i];
return os;
}
template <typename T> istream &operator>>(istream &i... | replace | 39 | 40 | 39 | 40 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.