problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p03238 | #include <bits/stdc++.h>
using namespace std;
int main() {
long n;
cin >> n;
if (n & 1)
cout << "Hello world";
else {
long a, b;
cin >> a >> b;
cout << a + b;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long n;
cin >> n;
if (n & 1)
cout << "Hello World";
else {
long a, b;
cin >> a >> b;
cout << a + b;
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,024,751 | 1,024,752 | u965943031 | cpp |
p03238 | #include <iostream>
#include <string>
using namespace std;
int main() {
// 整数の入力
int a;
int b;
int c;
cin >> a;
if (a == 1) {
cout << "Hello world" << endl;
} else {
cin >> b;
cin >> c;
cout << b + c << endl;
}
return 0;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
// 整数の入力
int a;
int b;
int c;
cin >> a;
if (a == 1) {
cout << "Hello World" << endl;
} else {
cin >> b;
cin >> c;
cout << b + c << endl;
}
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,024,756 | 1,024,757 | u919127329 | cpp |
p03238 | #include <iostream>
using namespace std;
int main() {
int N, A, B;
cin >> N;
if (N == 1)
cout << "Hello world"
<< "\n";
else {
cin >> A;
cin >> B;
cout << A + B << "\n";
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int N, A, B;
cin >> N;
if (N == 1)
cout << "Hello World"
<< "\n";
else {
cin >> A;
cin >> B;
cout << A + B << "\n";
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,024,758 | 1,024,759 | u636489589 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long LL;
typedef pair<LL, LL> P;
const LL mod = 998244353;
const LL LINF = 1LL << 62;
in... | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long LL;
typedef pair<LL, LL> P;
const LL mod = 998244353;
const LL LINF = 1LL << 62;
in... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 1,024,764 | 1,024,765 | u640323045 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n;
if (n == 1) {
cout << "Hello world";
return 0;
}
cin >> a >> b;
cout << a + b;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n;
if (n == 1) {
cout << "Hello World";
return 0;
}
cin >> a >> b;
cout << a + b;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,024,766 | 1,024,767 | u515315348 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
int main() {
int N, A, B;
cin >> N;
if (N == 1) ... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
int main() {
int N, A, B;
cin >> N;
if (N == 1) ... | [
"literal.string.change",
"io.output.change"
] | 1,024,770 | 1,024,771 | u895971408 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
#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 = (int)(b)-1; i >= (int)(a); i--)
#define CHMAX(a, b) (a) = max((a), (b))
#define CHMIN(a, b) (a) = min((a), (b))
#define ... | #include <bits/stdc++.h>
using namespace std;
#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 = (int)(b)-1; i >= (int)(a); i--)
#define CHMAX(a, b) (a) = max((a), (b))
#define CHMIN(a, b) (a) = min((a), (b))
#define ... | [
"control_flow.branch.if.condition.change"
] | 1,024,897 | 1,024,898 | u462560753 | cpp |
p03238 | #include <bits/stdc++.h>
#define ll long long
#define sz size
#define pb push_back
#define x first
#define y second
#define er erase
#define in insert
#define mp make_pair
#define pi pair
#define int long long
#define rc(s) return cout << s, 0
using namespace std;
int n;
signed main() {
ios_base::sync_with_stdio(0)... | #include <bits/stdc++.h>
#define ll long long
#define sz size
#define pb push_back
#define x first
#define y second
#define er erase
#define in insert
#define mp make_pair
#define pi pair
#define int long long
#define rc(s) return cout << s, 0
using namespace std;
int n;
signed main() {
ios_base::sync_with_stdio(0)... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,024,899 | 1,024,900 | u022510862 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
int a[1000];
int main() {
int n;
int a, b;
if (n == 2) {
cin >> a;
cin >> b;
cout << a + b << endl;
} else
cout << "Hello World" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int a[1000];
int main() {
int n;
int a, b;
cin >> n;
if (n == 2) {
cin >> a;
cin >> b;
cout << a + b << endl;
} else
cout << "Hello World" << endl;
}
| [] | 1,024,903 | 1,024,904 | u763606830 | cpp |
p03235 | #include <bits/stdc++.h>
#define Rint register int
using namespace std;
const int N = 200003;
template <typename T> inline void read(T &x) {
int ch = getchar();
x = 0;
while (ch < '0' || ch > '9')
ch = getchar();
while (ch >= '0' && ch <= '9')
x = x * 10 + ch - '0', ch = getchar();
}
template <typename ... | #include <bits/stdc++.h>
#define Rint register int
using namespace std;
const int N = 200003;
template <typename T> inline void read(T &x) {
int ch = getchar();
x = 0;
while (ch < '0' || ch > '9')
ch = getchar();
while (ch >= '0' && ch <= '9')
x = x * 10 + ch - '0', ch = getchar();
}
template <typename ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,024,780 | 1,024,781 | u680164084 | cpp |
p03235 | // AGC028E.cpp
#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 2e5 + 200, INF = 0x3f3f3f3f;
int n, pi[MAX_N], tag[MAX_N], suf[MAX_N];
char str[MAX_N];
struct SegmentTree {
int nodes[MAX_N << 2];
#define lson (p << 1)
#define rson ((p << 1) | 1)
#define mid ((l + r) >> 1)
void build(int l, int... | // AGC028E.cpp
#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 2e5 + 200, INF = 0x3f3f3f3f;
int n, pi[MAX_N], tag[MAX_N], suf[MAX_N];
char str[MAX_N];
struct SegmentTree {
int nodes[MAX_N << 2];
#define lson (p << 1)
#define rson ((p << 1) | 1)
#define mid ((l + r) >> 1)
void build(int l, int... | [
"expression.operation.unary.logical.remove",
"call.arguments.change"
] | 1,024,782 | 1,024,783 | u730011912 | cpp |
p03235 | #include <bits/stdc++.h>
#define LOG(FMT...) fprintf(stderr, FMT)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template <class T> istream &operator>>(istream &is, vector<T> &v) {
for (T &... | #include <bits/stdc++.h>
#define LOG(FMT...) fprintf(stderr, FMT)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template <class T> istream &operator>>(istream &is, vector<T> &v) {
for (T &... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,024,790 | 1,024,791 | u895067736 | cpp |
p03235 | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
int n, p[N], x, y, mx0, mx1, ct0, ct1, i, w[N], cnt;
int bi[2][N];
pair<int, int *> op[N * 20];
int oxb, en[N];
inline void add(int o, int x, int v) {
for (x = n - x + 1; x <= n; x += x & -x)
op[++oxb] = make_pair(bi[o][x], bi[o] + x), bi[o][x] ... | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
int n, p[N], x, y, mx0, mx1, ct0, ct1, i, w[N], cnt;
int bi[2][N];
pair<int, int *> op[N * 40];
int oxb, en[N];
inline void add(int o, int x, int v) {
for (x = n - x + 1; x <= n; x += x & -x)
op[++oxb] = make_pair(bi[o][x], bi[o] + x), bi[o][x] ... | [
"literal.number.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add"
] | 1,024,794 | 1,024,795 | u146586861 | cpp |
p03235 | // minamoto
#include <bits/stdc++.h>
#define R register
#define fp(i, a, b) for (R int i = (a), I = (b) + 1; i < I; ++i)
#define fd(i, a, b) for (R int i = (a), I = (b)-1; i > I; --i)
#define go(u) for (int i = head[u], v = e[i].v; i; i = e[i].nx, v = e[i].v)
template <class T> inline bool cmax(T &a, const T &b) {
re... | // minamoto
#include <bits/stdc++.h>
#define R register
#define fp(i, a, b) for (R int i = (a), I = (b) + 1; i < I; ++i)
#define fd(i, a, b) for (R int i = (a), I = (b)-1; i > I; --i)
#define go(u) for (int i = head[u], v = e[i].v; i; i = e[i].nx, v = e[i].v)
template <class T> inline bool cmax(T &a, const T &b) {
re... | [
"literal.number.change",
"expression.operation.binary.change",
"control_flow.loop.for.initializer.change",
"variable_declaration.value.change"
] | 1,024,798 | 1,024,797 | u561765782 | cpp |
p03235 | #include <bits/stdc++.h>
using namespace std;
#define Set(a, b) memset(a, b, sizeof(a))
template <class T> inline void init(T &x) {
x = 0;
char ch = getchar();
bool t = 0;
for (; ch > '9' || ch < '0'; ch = getchar())
if (ch == '-')
t = 1;
for (; ch >= '0' && ch <= '9'; ch = getchar())
x = (x << ... | #include <bits/stdc++.h>
using namespace std;
#define Set(a, b) memset(a, b, sizeof(a))
template <class T> inline void init(T &x) {
x = 0;
char ch = getchar();
bool t = 0;
for (; ch > '9' || ch < '0'; ch = getchar())
if (ch == '-')
t = 1;
for (; ch >= '0' && ch <= '9'; ch = getchar())
x = (x << ... | [] | 1,024,803 | 1,024,804 | u142717651 | cpp |
p03235 | #include <algorithm>
#include <cstdio>
using namespace std;
int gi() {
int x = 0, w = 1;
char ch = getchar();
while ((ch < '0' || ch > '9') && ch != '-')
ch = getchar();
if (ch == '-')
w = 0, ch = getchar();
while (ch >= '0' && ch <= '9')
x = (x << 3) + (x << 1) + ch - '0', ch = getchar();
retur... | #include <algorithm>
#include <cstdio>
using namespace std;
int gi() {
int x = 0, w = 1;
char ch = getchar();
while ((ch < '0' || ch > '9') && ch != '-')
ch = getchar();
if (ch == '-')
w = 0, ch = getchar();
while (ch >= '0' && ch <= '9')
x = (x << 3) + (x << 1) + ch - '0', ch = getchar();
retur... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 1,024,805 | 1,024,806 | u459210307 | cpp |
p03235 | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define ft first
#define sd second
const int maxN = 202000;
const int inf = 2000000000;
int Bodd[maxN], Beven[maxN];
int n, Seq[maxN], Mx[maxN], Sttop[maxN];
stack<pair<int *, int>> Rc;
void Modify(int *B, int p, int key);
int Query(int *B, int p);
... | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define ft first
#define sd second
const int maxN = 202000;
const int inf = 2000000000;
int Bodd[maxN], Beven[maxN];
int n, Seq[maxN], Mx[maxN], Sttop[maxN];
stack<pair<int *, int>> Rc;
void Modify(int *B, int p, int key);
int Query(int *B, int p);
... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,024,807 | 1,024,808 | u469934619 | cpp |
p03235 | #include <bits/stdc++.h>
using namespace std;
namespace Base {
#define mr make_pair
typedef long long ll;
typedef double db;
const int inf = 0x3f3f3f3f, INF = 0x7fffffff;
const ll infll = 0x3f3f3f3f3f3f3f3fll, INFll = 0x7fffffffffffffffll;
template <typename T> void read(T &x) {
x = 0;
int fh = 1;
double num = 1.... | #include <bits/stdc++.h>
using namespace std;
namespace Base {
#define mr make_pair
typedef long long ll;
typedef double db;
const int inf = 0x3f3f3f3f, INF = 0x7fffffff;
const ll infll = 0x3f3f3f3f3f3f3f3fll, INFll = 0x7fffffffffffffffll;
template <typename T> void read(T &x) {
x = 0;
int fh = 1;
double num = 1.... | [] | 1,024,823 | 1,024,824 | u606206167 | cpp |
p03235 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, st, ed) for (register int i = st, i##end = ed; i <= i##end; ++i)
#define DREP(i, st, ed) for (register int i = st, i##end = ed; i >= i##end; --i)
typedef long long ll;
template <typename T> inline bool chkmin(T &x, T y) {
return (y < x) ? (x = y, 1) : 0;
}
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, st, ed) for (register int i = st, i##end = ed; i <= i##end; ++i)
#define DREP(i, st, ed) for (register int i = st, i##end = ed; i >= i##end; --i)
typedef long long ll;
template <typename T> inline bool chkmin(T &x, T y) {
return (y < x) ? (x = y, 1) : 0;
}
... | [
"control_flow.loop.condition.change",
"assignment.change",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,024,827 | 1,024,828 | u260687256 | cpp |
p03235 | #include <algorithm>
#include <cstdio>
#include <cstring>
#define pb push_back
struct BIT {
int n, seg[200005], idx[4000005], orig[4000005], cnt;
inline void init(int _n, int val = -0x3f) {
n = _n;
cnt = 0;
memset(seg, val, n + 1 << 2);
}
inline void modify(int pos, int val) {
for (; pos <= n; p... | #include <algorithm>
#include <cstdio>
#include <cstring>
#define pb push_back
struct BIT {
int n, seg[200005], idx[4000005], orig[4000005], cnt;
inline void init(int _n, int val = -0x3f) {
n = _n;
cnt = 0;
memset(seg, val, n + 1 << 2);
}
inline void modify(int pos, int val) {
for (; pos <= n; p... | [
"literal.number.change",
"function.return_value.change"
] | 1,024,831 | 1,024,832 | u607811599 | cpp |
p03235 | #include <algorithm>
#include <cstdio>
#include <cstring>
#define pb push_back
struct BIT {
int n, seg[200005], idx[4000005], orig[4000005], cnt;
inline void init(int _n, int val = -0x3f) {
n = _n;
cnt = 0;
memset(seg, val, n + 1 << 2);
}
inline void modify(int pos, int val) {
for (; pos <= n; p... | #include <algorithm>
#include <cstdio>
#include <cstring>
#define pb push_back
struct BIT {
int n, seg[200005], idx[4000005], orig[4000005], cnt;
inline void init(int _n, int val = -0x3f) {
n = _n;
cnt = 0;
memset(seg, val, n + 1 << 2);
}
inline void modify(int pos, int val) {
for (; pos <= n; p... | [] | 1,024,833 | 1,024,832 | u607811599 | cpp |
p03235 | #ifndef BZ
#pragma GCC optimize "Ofast"
#endif
#include <bits/stdc++.h>
using namespace std;
using ull = uint64_t;
using ll = int64_t;
using ld = long double;
const int MAXN = 200228;
int a[MAXN];
bool must[MAXN];
int mustcnt[MAXN];
int bef[MAXN][2];
int n;
int fn;
struct Fen {
Fen() { fill(begin(fen), end(fen),... | #ifndef BZ
#pragma GCC optimize "Ofast"
#endif
#include <bits/stdc++.h>
using namespace std;
using ull = uint64_t;
using ll = int64_t;
using ld = long double;
const int MAXN = 200228;
int a[MAXN];
bool must[MAXN];
int mustcnt[MAXN];
int bef[MAXN][2];
int n;
int fn;
struct Fen {
Fen() { fill(begin(fen), end(fen),... | [
"control_flow.branch.if.condition.change"
] | 1,024,834 | 1,024,835 | u609667271 | cpp |
p03235 | #ifndef BZ
#pragma GCC optimize "Ofast"
#endif
#include <bits/stdc++.h>
using namespace std;
using ull = uint64_t;
using ll = int64_t;
using ld = long double;
const int MAXN = 200228;
int a[MAXN];
bool must[MAXN];
int mustcnt[MAXN];
int bef[MAXN][2];
int n;
int fn;
struct Fen {
Fen() { fill(begin(fen), end(fen),... | #ifndef BZ
#pragma GCC optimize "Ofast"
#endif
#include <bits/stdc++.h>
using namespace std;
using ull = uint64_t;
using ll = int64_t;
using ld = long double;
const int MAXN = 200228;
int a[MAXN];
bool must[MAXN];
int mustcnt[MAXN];
int bef[MAXN][2];
int n;
int fn;
struct Fen {
Fen() { fill(begin(fen), end(fen),... | [
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 1,024,836 | 1,024,835 | u609667271 | cpp |
p03237 | #include <bits/stdc++.h>
#define re
int v[2][1510][1510], lt[1510][1510], rt[1510][1510], bt[1510], ut[1510];
int ln[1510][1510], rn[1510][1510], nn[1510][1510], lc[1510], mn[1510][1510];
char ss[1510];
long long ans;
int num(re int x1, re int x2, re int l) {
l = std::min(bt[x1], std::min(bt[x2], l));
if (l < mn[x1... | #include <bits/stdc++.h>
#define re
int v[2][1510][1510], lt[1510][1510], rt[1510][1510], bt[1510], ut[1510];
int ln[1510][1510], rn[1510][1510], nn[1510][1510], lc[1510], mn[1510][1510];
char ss[1510];
long long ans;
int num(re int x1, re int x2, re int l) {
l = std::min(bt[x1], std::min(bt[x2], l));
if (l < mn[x1... | [
"control_flow.loop.condition.change",
"control_flow.loop.for.condition.change"
] | 1,024,853 | 1,024,854 | u698777286 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
#define fast() \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long... | #include <bits/stdc++.h>
using namespace std;
#define fast() \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long... | [
"variable_declaration.type.change"
] | 1,024,875 | 1,024,876 | u648414342 | cpp |
p03238 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a;
if (a == 1)
cout << "Hello world";
else {
cin >> b >> c;
cout << b + c;
}
}
| #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a;
if (a == 1)
cout << "Hello World";
else {
cin >> b >> c;
cout << b + c;
}
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,024,879 | 1,024,880 | u079532978 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
#define Rep(i, n) for (int i = 1; i <= n; i++)
const ll MOD = 1000000007;
struct edge {
int to, weight;
edge(int to, int weight) : to(to), weight(weight) {}
};
using Graph = vector<vector<int>>;
using G... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
#define Rep(i, n) for (int i = 1; i <= n; i++)
const ll MOD = 1000000007;
struct edge {
int to, weight;
edge(int to, int weight) : to(to), weight(weight) {}
};
using Graph = vector<vector<int>>;
using G... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 1,024,881 | 1,024,882 | u942850310 | cpp |
p03238 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a;
if (a == 1)
cout << "Hellow World";
else if (a == 2) {
cin >> b >> c;
cout << b + c;
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a;
if (a == 1)
cout << "Hello World";
else if (a == 2) {
cin >> b >> c;
cout << b + c;
}
return 0;
}
| [
"literal.string.change",
"io.output.change"
] | 1,024,883 | 1,024,884 | u818967913 | cpp |
p03238 |
#include <algorithm>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, a, b) for (i = a; i < b; i++)
#define REP1(i, b, a) for (i = b - 1; i >= a; i--)
#define output(x) cout << x << endl;
#define pb(x) push_back(x);
typed... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, a, b) for (i = a; i < b; i++)
#define REP1(i, b, a) for (i = b - 1; i >= a; i--)
#define output(x) cout << x << endl;
#define pb(x) push_back(x);
typede... | [
"literal.string.change",
"call.arguments.change"
] | 1,024,907 | 1,024,908 | u213156132 | cpp |
p03238 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) so... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) so... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,024,915 | 1,024,916 | u299377613 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
if (n == 1) {
printf("Hello World!");
} else {
int a, b;
scanf("%d %d", &a, &b);
printf("%d", a + b);
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
if (n == 1) {
printf("Hello World");
} else {
int a, b;
scanf("%d %d", &a, &b);
printf("%d", a + b);
}
return 0;
}
| [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 1,024,924 | 1,024,925 | u960414932 | cpp |
p03238 | #include <bits/stdc++.h>
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
int main() {
int N, a, b;
cin >> N;
if (N == 1) {
cout << "Hello World" << endl;
} else if (N == 2) {
cin >> a, b;
cout << a + b << endl;
}
} | #include <bits/stdc++.h>
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
int main() {
int N, a, b;
cin >> N;
if (N == 1) {
cout << "Hello World" << endl;
} else if (N == 2) {
cin >> a >> b;
cout << a + b << endl;
}
} | [] | 1,024,929 | 1,024,930 | u371535422 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, answer;
cin >> N >> A >> B;
if (N == 1) {
cout << "Helllo World" << endl;
} else if (N == 2) {
cout << A + B << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
if (N == 1) {
cout << "Hello World" << endl;
} else if (N == 2) {
cout << A + B << endl;
}
} | [
"variable_declaration.remove",
"literal.string.change",
"io.output.change"
] | 1,024,933 | 1,024,934 | u007733560 | cpp |
p03238 | #include <iostream>
using namespace std;
main() {
int n, a, b;
cin >> n;
if (n == '1')
cout << "Hello World" << endl;
else {
cin >> a >> b;
cout << a + b << endl;
}
} | #include <iostream>
using namespace std;
main() {
int n, a, b;
cin >> n;
if (n == 1)
cout << "Hello World" << endl;
else {
cin >> a >> b;
cout << a + b << endl;
}
}
| [
"control_flow.branch.if.condition.change"
] | 1,024,945 | 1,024,946 | u160321725 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a;
if (a == 1)
cout << "Hello World" << endl;
if (a == 2)
cin >> b >> c;
cout << b + c << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a;
if (a == 1)
cout << "Hello World" << endl;
if (a == 2) {
cin >> b >> c;
cout << b + c << endl;
}
return 0;
} | [] | 1,024,954 | 1,024,955 | u911623222 | cpp |
p03238 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <u... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <u... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,024,956 | 1,024,957 | u698677417 | cpp |
p03238 | #include <iostream>
using namespace std;
int main() {
int a, A, B;
cin >> a;
cin >> A >> B;
if (a == 1) {
cout << "Hello world" << endl;
return 0;
} else {
cout << A + B << endl;
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int a, A, B;
cin >> a;
cin >> A >> B;
if (a == 1) {
cout << "Hello World" << endl;
return 0;
} else {
cout << A + B << endl;
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,024,958 | 1,024,959 | u671765585 | cpp |
p03238 | #include <stdio.h>
int main() {
int N, A, B;
scanf("%d", &N);
scanf("%d", &A);
scanf("%d", &B);
if (N == 1) {
printf("HelloWorld");
} else if (N == 2) {
printf("%d", A + B);
} else {
return 1;
}
return 0;
} | #include <stdio.h>
int main() {
int N, A, B;
scanf("%d", &N);
scanf("%d", &A);
scanf("%d", &B);
if (N == 1) {
printf("Hello World");
} else if (N == 2) {
printf("%d", A + B);
} else {
return 1;
}
return 0;
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 1,024,962 | 1,024,963 | u414073264 | cpp |
p03238 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
#defi... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
#defi... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,024,974 | 1,024,975 | u281384315 | cpp |
p03238 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
#defi... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
#defi... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change",
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,024,976 | 1,024,975 | u281384315 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int a, b;
std::cin >> N;
if (N == 2) {
std::cin >> a >> b;
std::cout << a + b << std::endl;
}
std::cout << "Hello World" << std::endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int a, b;
std::cin >> N;
if (N == 2) {
std::cin >> a >> b;
std::cout << a + b << std::endl;
} else
std::cout << "Hello World" << std::endl;
} | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 1,024,983 | 1,024,984 | u599857640 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
if (n == 1) {
cout << "Hellow World" << endl;
} else if (n == 2) {
int a, b;
cin >> a;
cin >> b;
cout << (a + b) << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
if (n == 1) {
cout << "Hello World" << endl;
} else if (n == 2) {
int a, b;
cin >> a;
cin >> b;
cout << (a + b) << endl;
}
}
| [
"literal.string.change",
"io.output.change"
] | 1,024,991 | 1,024,992 | u183471264 | cpp |
p03238 | #include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <limits>
#include <numeric>
#include <queue>
#include <regex>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define INF 2000000000
#define REP(i, b, n) for (int i = (b); i <... | #include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <limits>
#include <numeric>
#include <queue>
#include <regex>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define INF 2000000000
#define REP(i, b, n) for (int i = (b); i <... | [] | 1,024,995 | 1,024,996 | u576712004 | cpp |
p03238 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define rep(x, y, z) for (long long x = y; x < z; ++x)
#define dwn(x, y, z) for (long long x = y; x > z; --x)... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define rep(x, y, z) for (long long x = y; x < z; ++x)
#define dwn(x, y, z) for (long long x = y; x > z; --x)... | [
"literal.string.change",
"io.output.change"
] | 1,024,999 | 1,025,000 | u804601435 | cpp |
p03238 | #include <algorithm> //sort(v.begin(),v.end());
#include <cmath>
#include <iomanip> //setprecision(2)
#include <iostream>
#include <numeric> //accumulate(v.begin(), v.end(), 0);
#include <string> //
#include <vector>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int ma... | #include <algorithm> //sort(v.begin(),v.end());
#include <cmath>
#include <iomanip> //setprecision(2)
#include <iostream>
#include <numeric> //accumulate(v.begin(), v.end(), 0);
#include <string> //
#include <vector>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int ma... | [
"literal.string.change",
"io.output.change"
] | 1,025,001 | 1,025,002 | u321511305 | cpp |
p03238 | #include <iostream>
using namespace std;
int main(void) {
int n, a, b;
cin >> n;
if (n == 1) {
cout << "Heloo World";
}
if (n == 2) {
cin >> a >> b;
cout << a + b;
}
return 0;
}
| #include <iostream>
using namespace std;
int main(void) {
int n, a, b;
cin >> n;
if (n == 1) {
cout << "Hello World";
}
if (n == 2) {
cin >> a >> b;
cout << a + b;
}
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 1,025,008 | 1,025,009 | u344148323 | cpp |
p03238 | #include <algorithm>
#include <array>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int a, b, c;
cin >> a;
if (a = 1)
cout << "Hello World" << endl;
else {
cin >> b >> c;
cout << b + c << endl;
}
}
| #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int a, b, c;
cin >> a;
if (a == 1)
cout << "Hello World" << endl;
else {
cin >> b >> c;
cout << b + c << endl;
}
}
| [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,025,010 | 1,025,011 | u833064541 | cpp |
p03238 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a;
if (a == 1)
cout << "Hello World\n";
else
cout << b + c << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == 1)
cout << "Hello World\n";
else
cout << b + c << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 1,025,014 | 1,025,015 | u408516704 | cpp |
p03238 | #include <stdio.h>
int main(void) {
int a, b, n;
scanf("%d", &n);
if (n == 1)
printf("Hello World");
else
scanf("%d%d", &a, &b);
printf("%d", a + b);
return 0;
} | #include <stdio.h>
int main(void) {
int a, b, n;
scanf("%d", &n);
if (n == 1)
printf("Hello World");
else {
scanf("%d%d", &a, &b);
printf("%d", a + b);
}
return 0;
}
| [] | 1,025,016 | 1,025,017 | u440920318 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, ans = 1001;
cin >> N >> T;
vector<int> c(N), t(N);
for (int i = 1; i <= N; i++) {
cin >> c[i] >> t[i];
}
for (int i = 1; i <= N; i++) {
if (t[i] <= T)
ans = min(ans, c[i]);
}
if (ans == 1001)
cout << "TLE" << endl;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, ans = 1001;
cin >> N >> T;
vector<int> c(110), t(110);
for (int i = 1; i <= N; i++) {
cin >> c[i] >> t[i];
}
for (int i = 1; i <= N; i++) {
if (t[i] <= T)
ans = min(ans, c[i]);
}
if (ans == 1001)
cout << "TLE" << end... | [] | 1,025,031 | 1,025,032 | u431389521 | cpp |
p03239 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const int MOD = 1e9 + 7;
using ll = long long;
using vi = vector<int>;
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(x) x.begin(), x.end();
int main() {
int a, b;
cin >> a >> b;
int c, d, MIN, flag = 0;
rep(i, a) {
c... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const int MOD = 1e9 + 7;
using ll = long long;
using vi = vector<int>;
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(x) x.begin(), x.end();
int main() {
int a, b;
cin >> a >> b;
int c, d, MIN = 999999, flag = 0;
rep(i, a... | [
"variable_declaration.value.change"
] | 1,025,040 | 1,025,041 | u079532978 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, c, t, m = 10000000;
cin >> N >> T;
for (int i = 0; i < N; i++) {
cin >> c >> t;
if (t > T) {
continue;
}
m = min(m, c);
}
if (m = 10000000) {
cout << "TLE" << endl;
} else {
cout << m << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, c, t, m = 10000000;
cin >> N >> T;
for (int i = 0; i < N; i++) {
cin >> c >> t;
if (t > T) {
continue;
}
m = min(m, c);
}
if (m == 10000000) {
cout << "TLE" << endl;
} else {
cout << m << endl;
}
}
| [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,025,053 | 1,025,054 | u927463074 | cpp |
p03239 |
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <string.h>
using namespace std;
#define pb push_back
#define all(v) v.begin(), v.end()
#define rep(i, n, v) for (i = n; i < v; i++)
#define per(i, n, v) for (i = n; i > v; i--)
#define ff first
#define ss seco... |
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <string.h>
using namespace std;
#define pb push_back
#define all(v) v.begin(), v.end()
#define rep(i, n, v) for (i = n; i < v; i++)
#define per(i, n, v) for (i = n; i > v; i--)
#define ff first
#define ss seco... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 1,025,061 | 1,025,062 | u353919145 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int mincost = 10000;
for (int i = 0; i < N; i++) {
int A, B;
cin >> A >> B;
if (B <= T) {
mincost = min(mincost, A);
}
}
if (mincost = 10000) {
cout << "TLE" << endl;
} else {
cout << mincost... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int mincost = 10000;
for (int i = 0; i < N; i++) {
int A, B;
cin >> A >> B;
if (B <= T) {
mincost = min(mincost, A);
}
}
if (mincost == 10000) {
cout << "TLE" << endl;
} else {
cout << mincos... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,025,075 | 1,025,076 | u280966279 | cpp |
p03238 | #include <iostream>
using namespace std;
int main() {
int n;
if (n == 1) {
cout << "Hello World" << endl;
return 0;
} else {
int a, b;
cin >> a >> b;
cout << a + b << endl;
return 0;
}
} | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 1) {
cout << "Hello World" << endl;
return 0;
} else {
int a, b;
cin >> a >> b;
cout << a + b << endl;
return 0;
}
} | [] | 1,025,087 | 1,025,088 | u277153875 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N;
if (N = 2) {
cin >> A >> B;
cout << A + B << endl;
} else {
cout << "Hello World" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N;
if (N == 2) {
cin >> A >> B;
cout << A + B << endl;
} else {
cout << "Hello World" << endl;
}
return 0;
}
| [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,025,089 | 1,025,090 | u663970214 | cpp |
p03238 | #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
usin... | #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
usin... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,025,095 | 1,025,096 | u294531924 | cpp |
p03238 | #include <iostream>
int main() {
int n;
std::cin >> n;
if (n == 1) {
std::cout << "Heloo,World" << std::endl;
exit(0);
}
if (n == 2) {
int a, b;
std::cin >> a >> b;
std::cout << a + b << std::endl;
}
return 0;
} | #include <iostream>
int main() {
int n;
std::cin >> n;
if (n == 1) {
std::cout << "Hello World" << std::endl;
exit(0);
}
if (n == 2) {
int a, b;
std::cin >> a >> b;
std::cout << a + b << std::endl;
}
return 0;
} | [
"literal.string.change",
"expression.operation.binary.change"
] | 1,025,097 | 1,025,098 | u210398438 | cpp |
p03238 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <vector>
#define ll long long
#define pi pair<ll, ll>
#define mp(a, b) make_pair(a, b)
#define rep(i, a, b) for (int i = a; i < b; i++)
#define N 100004
#define INF 1e... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <vector>
#define ll long long
#define pi pair<ll, ll>
#define mp(a, b) make_pair(a, b)
#define rep(i, a, b) for (int i = a; i < b; i++)
#define N 100004
#define INF 1e... | [
"literal.string.change",
"io.output.change"
] | 1,025,101 | 1,025,102 | u751243213 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
if (N == 1) {
cout << "Hello, World" << endl;
} else {
int A, B;
cin >> A >> B;
cout << A + B << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
if (N == 1) {
cout << "Hello World" << endl;
} else {
int A, B;
cin >> A >> B;
cout << A + B << endl;
}
} | [
"literal.string.change",
"io.output.change"
] | 1,025,105 | 1,025,106 | u845674689 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
if (N == 1) {
cout << "Hello, World!" << endl;
} else {
int A, B;
cin >> A >> B;
cout << A + B << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
if (N == 1) {
cout << "Hello World" << endl;
} else {
int A, B;
cin >> A >> B;
cout << A + B << endl;
}
} | [
"literal.string.change",
"io.output.change"
] | 1,025,107 | 1,025,106 | u845674689 | cpp |
p03238 | #include <algorithm>
#include <functional>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
signed main() {
int a;
cin >> a;
if (a =... | #include <algorithm>
#include <functional>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
signed main() {
int a;
cin >> a;
if (a =... | [
"io.output.change"
] | 1,025,108 | 1,025,109 | u016612263 | cpp |
p03238 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,025,110 | 1,025,111 | u943004959 | cpp |
p03238 |
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
if (n == 1)
cout << "Hello world" << endl;
else {
int a, b;
cin >> a >> b;
cout << a + b << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
if (n == 1)
cout << "Hello World" << endl;
else {
int a, b;
cin >> a >> b;
cout << a + b << endl;
}
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,025,112 | 1,025,113 | u420048613 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 1) {
cout << "Hello world";
return 0;
}
int a, b;
cin >> a;
cin >> b;
cout << a + b;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 1) {
cout << "Hello World";
return 0;
}
int a, b;
cin >> a;
cin >> b;
cout << a + b;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,025,114 | 1,025,115 | u007640222 | cpp |
p03238 | #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 SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define ll long long
#d... | #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 SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define ll long long
#d... | [
"variable_declaration.type.primitive.change"
] | 1,025,123 | 1,025,124 | u179643082 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
typedef long long unsigned int ll;
int main() {
int n;
cin >> n;
int a, b;
if (n == 1) {
cout << "Hello,World" << endl;
} else {
cin >> a >> b;
cout << a + b << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long unsigned int ll;
int main() {
int n;
cin >> n;
int a, b;
if (n == 1) {
cout << "Hello World" << endl;
} else {
cin >> a >> b;
cout << a + b << endl;
}
return 0;
}
| [
"literal.string.change",
"io.output.change"
] | 1,025,127 | 1,025,128 | u515603926 | cpp |
p03238 | #include <iostream>
int main() {
int n;
std::cin >> n;
if (n == 1)
std::cout << "HelloWorld" << std::endl;
else {
int a, b;
std::cin >> a >> b;
std::cout << a + b << std::endl;
}
return 0;
}
| #include <iostream>
int main() {
int n;
std::cin >> n;
if (n == 1)
std::cout << "Hello World" << std::endl;
else {
int a, b;
std::cin >> a >> b;
std::cout << a + b << std::endl;
}
return 0;
}
| [
"literal.string.change",
"expression.operation.binary.change"
] | 1,025,129 | 1,025,130 | u640248738 | cpp |
p03238 | #include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n;
if (n == 1) {
cout << "Hello world" << endl;
} else {
cin >> a >> b;
cout << a + b << endl;
}
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n;
if (n == 1) {
cout << "Hello World" << endl;
} else {
cin >> a >> b;
cout << a + b << endl;
}
} | [
"import.add",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,025,131 | 1,025,132 | u653187094 | cpp |
p03238 | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int a;
cin >> a;
if (a == 1) {
printf("Hello Wolrd");
} else if (a == 2) {
int b, c;
cin >> b >> c;
printf("%d", b + c);
}
return 0;
}
| #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int a;
cin >> a;
if (a == 1) {
printf("Hello World");
} else if (a == 2) {
int b, c;
cin >> b >> c;
printf("%d", b + c);
}
return 0;
}
| [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 1,025,133 | 1,025,134 | u261868146 | cpp |
p03238 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <sstream>
#include <string>
#include <time.h>
#include <vector>
//#include "bits/stdc++.h"
using namespace std;
// using namespace std::vector;
#define rep(i, a, b) for (int i... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <sstream>
#include <string>
#include <time.h>
#include <vector>
//#include "bits/stdc++.h"
using namespace std;
// using namespace std::vector;
#define rep(i, a, b) for (int i... | [
"literal.string.change",
"io.output.change"
] | 1,025,135 | 1,025,136 | u301409936 | cpp |
p03238 | #include <iostream>
using namespace std;
int main() {
int N, A, B;
cin >> N;
if (N == 1) {
cout << "Hello World" << endl;
} else {
int A, B;
cin >> A >> B;
cout << A * B << endl;
}
} | #include <iostream>
using namespace std;
int main() {
int N, A, B;
cin >> N;
if (N == 1) {
cout << "Hello World" << endl;
} else {
int A, B;
cin >> A >> B;
cout << A + B << endl;
}
} | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 1,025,139 | 1,025,140 | u654240084 | cpp |
p03238 |
#define _CRT_SECURE_NO_WARNINGS 1
#include <algorithm>
#include <chrono>
#include <functional>
#include <iostream>
#include <limits>
#include <stack>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
namespace {}
#if 1
... |
#define _CRT_SECURE_NO_WARNINGS 1
#include <algorithm>
#include <chrono>
#include <functional>
#include <iostream>
#include <limits>
#include <stack>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
namespace {}
#if 1
... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 1,025,141 | 1,025,142 | u313736240 | cpp |
p03238 | #include <iostream>
using namespace std;
int main() {
int N, a, b;
cin >> N;
if (N = 1) {
cout << "Hello World" << endl;
} else {
cin >> a >> b;
cout << a + b << endl;
}
} | #include <iostream>
using namespace std;
int main() {
int N, a, b;
cin >> N;
if (N == 1) {
cout << "Hello World" << endl;
} else {
cin >> a >> b;
cout << a + b << endl;
}
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,025,143 | 1,025,144 | u451625046 | cpp |
p03238 | #define _CRT_SECURE_NO_WARNINGS
#pragma GCC optimize("O3")
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <thread>
#include <unordered_map>
using namespace std;... | #define _CRT_SECURE_NO_WARNINGS
#pragma GCC optimize("O3")
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <thread>
#include <unordered_map>
using namespace std;... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,025,147 | 1,025,148 | u217145434 | cpp |
p03238 | #include <bits/stdc++.h>
#define sz(x) (int)((x).size())
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define FOR(i, a, n, step) for (int(i) = (a); (i) < (int)(n); (i) += (step))
#define ROF(i, a, n, step) for (int(i) = (a); (i) >= (int)(n); (i) -= (step))
#define FOREACH(it, v) for (auto(... | #include <bits/stdc++.h>
#define sz(x) (int)((x).size())
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define FOR(i, a, n, step) for (int(i) = (a); (i) < (int)(n); (i) += (step))
#define ROF(i, a, n, step) for (int(i) = (a); (i) >= (int)(n); (i) -= (step))
#define FOREACH(it, v) for (auto(... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,025,151 | 1,025,152 | u676551525 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
using ll = long long;
const int INF = 1 << 30;
const ll INFll = 1LL << 62;
const int mod = int(1e9) + 7;
using P = pair<ll, ll>;
using ld = long double;
int main() {
ll N, T;
cin >> N >> T;
vector<P> p;
for (int i = 0; i < N; ++i)... | #include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
using ll = long long;
const int INF = 1 << 30;
const ll INFll = 1LL << 62;
const int mod = int(1e9) + 7;
using P = pair<ll, ll>;
using ld = long double;
int main() {
ll N, T;
cin >> N >> T;
vector<P> p;
for (int i = 0; i < N; ++i)... | [
"control_flow.branch.else.add"
] | 1,025,153 | 1,025,154 | u525008368 | cpp |
p03239 | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cmath> //sqrt pow
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cmath> //sqrt pow
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include... | [
"literal.string.change",
"io.output.change"
] | 1,025,177 | 1,025,178 | u396266329 | cpp |
p03239 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>
#define... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>
#define... | [
"expression.operation.unary.logical.remove",
"control_flow.branch.if.condition.change"
] | 1,025,179 | 1,025,180 | u880221923 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int Z = 10000;
for (int i = 0; i < N; i++) {
int c, t;
cin >> c >> t;
if (t <= T) {
Z = min(c, Z);
}
}
if (Z == 100000) {
cout << "TLE" << endl;
} else {
cout << Z << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int Z = 10000;
for (int i = 0; i < N; i++) {
int c, t;
cin >> c >> t;
if (t <= T) {
Z = min(c, Z);
}
}
if (Z == 10000) {
cout << "TLE" << endl;
} else {
cout << Z << endl;
}
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,025,181 | 1,025,182 | u158290747 | cpp |
p03239 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); i++)
int main() {
int N, T;
... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); i++)
int main() {
int N, T;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,025,185 | 1,025,186 | u480172743 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t;
cin >> n >> t;
int ans = 1001;
for (int i = 0; i < n; i++) {
int c, T;
cin >> c >> T;
if (T < t) {
ans = min(ans, c);
}
}
if (ans == 1001)
cout << "TLE" << endl;
else
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t;
cin >> n >> t;
int ans = 1001;
for (int i = 0; i < n; i++) {
int c, T;
cin >> c >> T;
if (T <= t) {
ans = min(ans, c);
}
}
if (ans == 1001)
cout << "TLE" << endl;
else
cout << ans << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,025,187 | 1,025,188 | u105533331 | cpp |
p03239 | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, T;
cin >> n >> T;
int k = 1000000;
for (int i = 0; i < n; ++i) {
int c, t;
cin >> c >> t;
if (t <= T)
k = min(k, c);
}
if (k = 1000000)
cout << "TLE";
else
cout << k;
} | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, T;
cin >> n >> T;
int k = 1000000;
for (int i = 0; i < n; ++i) {
int c, t;
cin >> c >> t;
if (t <= T)
k = min(k, c);
}
if (k == 1000000)
cout << "TLE";
else
cout << k;
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,025,217 | 1,025,218 | u212144411 | cpp |
p03239 | #include <iostream>
using namespace std;
int main() {
int n, t_l;
cin >> n >> t_l;
int c[n], t[n];
for (int i = 0; i < n; i++) {
cin >> c[i] >> t[i];
}
int ans = 1e8;
for (int i = 0; i < n; i++) {
if (t[i] <= t_l && c[i] < ans) {
ans = c[i];
}
}
if (ans == 1e8) {
cout << "TEL" ... | #include <iostream>
using namespace std;
int main() {
int n, t_l;
cin >> n >> t_l;
int c[n], t[n];
for (int i = 0; i < n; i++) {
cin >> c[i] >> t[i];
}
int ans = 1e8;
for (int i = 0; i < n; i++) {
if (t[i] <= t_l && c[i] < ans) {
ans = c[i];
}
}
if (ans == 1e8) {
cout << "TLE" ... | [
"literal.string.change",
"io.output.change"
] | 1,025,225 | 1,025,224 | u159703196 | cpp |
p03239 | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = int64_t;
#define int ll
#define FOR(i, a, b) for (int i = int(a); i < int(b); i++)
#define REP(i, b) FOR(i, 0, b)
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(x) x.begin(), x.end()
auto &errStream = cerr;
... | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = int64_t;
#define int ll
#define FOR(i, a, b) for (int i = int(a); i < int(b); i++)
#define REP(i, b) FOR(i, 0, b)
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(x) x.begin(), x.end()
auto &errStream = cerr;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,025,261 | 1,025,262 | u700484101 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int c[N], t[N];
for (int i = 0; i < N; i++) {
cin >> c[i] >> t[i];
}
int ans = 1e9;
for (int i = 0; i < N; i++) {
if (t[i] <= T)
ans = min(ans, c[i]);
}
if (ans == 1e9)
cout << "TEL" << endl;
else... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int c[N], t[N];
for (int i = 0; i < N; i++) {
cin >> c[i] >> t[i];
}
int ans = 1e9;
for (int i = 0; i < N; i++) {
if (t[i] <= T)
ans = min(ans, c[i]);
}
if (ans == 1e9)
cout << "TLE" << endl;
else... | [
"literal.string.change",
"io.output.change"
] | 1,025,263 | 1,025,264 | u315542000 | cpp |
p03239 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) (v).begin(), (v).end()
#define out(a) cout << (a) << endl
using namespace std;
using ll = long long;
int main() {
int n, t;
cin >> n >> t;
int mini = 1001;
for (int i = 0; i < n; i++) {
int c, x;
cin >> c >> x;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) (v).begin(), (v).end()
#define out(a) cout << (a) << endl
using namespace std;
using ll = long long;
int main() {
int n, t;
cin >> n >> t;
int mini = 1001;
for (int i = 0; i < n; i++) {
int c, x;
cin >> c >> x;
... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,025,279 | 1,025,280 | u654949547 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(v) v.begin(), v.end()
int main() {
ll N, T;
cin >> N >> T;
ll ans = 100000;
for (ll i = 0; i < N; i++) {
ll c, t;
cin >> c >> t;
if (t <= T) {
ans = min(ans, c);
}
}
if (ans = 100000) {
cout << "TLE" ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(v) v.begin(), v.end()
int main() {
ll N, T;
cin >> N >> T;
ll ans = 100000;
for (ll i = 0; i < N; i++) {
ll c, t;
cin >> c >> t;
if (t <= T) {
ans = min(ans, c);
}
}
if (ans == 100000) {
cout << "TLE"... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,025,284 | 1,025,285 | u072293789 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int res = 10000000;
for (int i = 0; i < N; ++i) {
int c, t;
cin >> c >> t;
if (t <= T)
res = min(res, c);
}
if (res < 10000000)
cout << res << endl;
else
cout << -1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int res = 10000000;
for (int i = 0; i < N; ++i) {
int c, t;
cin >> c >> t;
if (t <= T)
res = min(res, c);
}
if (res < 10000000)
cout << res << endl;
else
cout << "TLE" << endl;
} | [] | 1,025,288 | 1,025,289 | u692336506 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, ans = 1001;
cin >> N >> T;
for (int i = 0; i < N; i++) {
int c, t;
cin >> c >> t;
if (t < T) {
ans = min(ans, c);
}
}
if (ans == 1001) {
cout << "TLE" << endl;
return 0;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, ans = 1001;
cin >> N >> T;
for (int i = 0; i < N; i++) {
int c, t;
cin >> c >> t;
if (t <= T) {
ans = min(ans, c);
}
}
if (ans == 1001) {
cout << "TLE" << endl;
return 0;
}
cout << ans << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,025,292 | 1,025,293 | u187772564 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); i++)
const long double EPS = 1e-10;
const long long INF = 1e18;
const long double PI = acos(-1.0L);
ll gcd(ll a, ll b) {
if (b == 0) {
return a;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); i++)
const long double EPS = 1e-10;
const long long INF = 1e18;
const long double PI = acos(-1.0L);
ll gcd(ll a, ll b) {
if (b == 0) {
return a;
... | [
"io.output.change"
] | 1,025,299 | 1,025,300 | u936053819 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
#define INF 100000000
int main(void) {
int N, T;
cin >> N >> T;
int c[N], t[N];
for (int i = 0; i < N; i++)
cin >> c[i] >> t[i];
long long min_c = INF;
for (int i = 0; i < N; i++) {
if (t[i] <= T) {
if (min_c > c[i])
min_c = c[i];
}
... | #include <bits/stdc++.h>
using namespace std;
#define INF 100000000
int main(void) {
int N, T;
cin >> N >> T;
int c[N], t[N];
for (int i = 0; i < N; i++)
cin >> c[i] >> t[i];
long long min_c = INF;
for (int i = 0; i < N; i++) {
if (t[i] <= T) {
if (min_c > c[i])
min_c = c[i];
}
... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 1,025,301 | 1,025,302 | u269786286 | cpp |
p03239 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, T;
int c[110], t[110];
cin >> n >> T;
for (int i = 0; i < n; i++)
cin >> c[i] >> t[i];
int ans = 9999;
for (int i = 0; i < n; i++) {
if (t[i] < T)
ans = min(ans, c[i]);
}
if (ans == 9999)
cout << "TLE"... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, T;
int c[110], t[110];
cin >> n >> T;
for (int i = 0; i < n; i++)
cin >> c[i] >> t[i];
int ans = 9999;
for (int i = 0; i < n; i++) {
if (t[i] <= T)
ans = min(ans, c[i]);
}
if (ans == 9999)
cout << "TLE... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,025,303 | 1,025,304 | u666641075 | cpp |
p03239 | #include "bits/stdc++.h"
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int ans = 1e9;
for (int n = 0; n < N; ++n) {
int c, t;
cin >> c >> t;
if (t < T) {
ans = min(ans, c);
}
}
if (1e9 == ans) {
cout << "TLE" << endl;
} else {
cout << ans << endl;
}
return ... | #include "bits/stdc++.h"
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int ans = 1e9;
for (int n = 0; n < N; ++n) {
int c, t;
cin >> c >> t;
if (t <= T) {
ans = min(ans, c);
}
}
if (1e9 == ans) {
cout << "TLE" << endl;
} else {
cout << ans << endl;
}
return... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,025,305 | 1,025,306 | u835523614 | cpp |
p03239 | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)n; ++i)
const int MOD = 1000000007;
using namespace std;
int main(void) {
int n, t;
cin >> n >> t;
priority_queue<int, vector<int>, greater<int>> q;
rep(i, n) {
int a, b;
cin >> a >> b;
if (b < t)
q.push(a... | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)n; ++i)
const int MOD = 1000000007;
using namespace std;
int main(void) {
int n, t;
cin >> n >> t;
priority_queue<int, vector<int>, greater<int>> q;
rep(i, n) {
int a, b;
cin >> a >> b;
if (b <= t)
q.push(... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,025,314 | 1,025,315 | u110044127 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int ans = 10000;
for (int i = 0; i < N; i++) {
int c, t;
cin >> c >> t;
if (T >= t) {
ans = min(ans, c);
}
}
if (ans == 0) {
cout << "TLE" << endl;
} else {
cout << ans << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int ans = 10000;
for (int i = 0; i < N; i++) {
int c, t;
cin >> c >> t;
if (T >= t) {
ans = min(ans, c);
}
}
if (ans == 10000) {
cout << "TLE" << endl;
} else {
cout << ans << endl;
}
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,025,349 | 1,025,350 | u237390401 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int ans = 0;
for (int i = 0; i < N; i++) {
int c, t;
cin >> c >> t;
if (T >= t) {
ans = min(ans, c);
}
}
if (ans == 0) {
cout << "TLE" << endl;
} else {
cout << ans << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int ans = 10000;
for (int i = 0; i < N; i++) {
int c, t;
cin >> c >> t;
if (T >= t) {
ans = min(ans, c);
}
}
if (ans == 10000) {
cout << "TLE" << endl;
} else {
cout << ans << endl;
}
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.branch.if.condition.change"
] | 1,025,351 | 1,025,350 | u237390401 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int ans = 0;
for (int i = 0; i < N; i++) {
int c, t;
cin >> c >> t;
if (T >= t) {
ans = min(T, c);
}
}
if (ans = 0) {
cout << "TLE" << endl;
} else {
cout << ans << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int ans = 10000;
for (int i = 0; i < N; i++) {
int c, t;
cin >> c >> t;
if (T >= t) {
ans = min(ans, c);
}
}
if (ans == 10000) {
cout << "TLE" << endl;
} else {
cout << ans << endl;
}
}
| [
"literal.number.change",
"variable_declaration.value.change",
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 1,025,352 | 1,025,350 | u237390401 | cpp |
p03239 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, t;
cin >> n >> t;
int ss = 1000000;
bool ikeru = false;
for (int i = 0; i < n; i++) {
int c, tt;
cin >> c >> tt;
if (t >= tt) {
ss = min(ss, c);
ik... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, t;
cin >> n >> t;
int ss = 1000000;
bool ikeru = false;
for (int i = 0; i < n; i++) {
int c, tt;
cin >> c >> tt;
if (t >= tt) {
ss = min(ss, c);
ik... | [
"misc.opposites",
"assignment.value.change"
] | 1,025,358 | 1,025,359 | u047572420 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
void chmin(int &a, int b) {
if (a > b)
a = b;
}
int main() {
int N, T;
cin >> N >> T;
int ans = 1010;
for (int i = 0; i < N; i++) {
int c, t;
cin >> c >> t;
if (t <= T) {
chmin(ans, t);
}
}
if (ans == 1010) {
cout << "TLE" <<... | #include <bits/stdc++.h>
using namespace std;
void chmin(int &a, int b) {
if (a > b)
a = b;
}
int main() {
int N, T;
cin >> N >> T;
int ans = 1010;
for (int i = 0; i < N; i++) {
int c, t;
cin >> c >> t;
if (t <= T) {
chmin(ans, c);
}
}
if (ans == 1010) {
cout << "TLE" <<... | [
"identifier.change",
"call.arguments.change"
] | 1,025,371 | 1,025,372 | u538808095 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.