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 |
|---|---|---|---|---|---|---|---|
p03239 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <random>
#include <set>
#include <sstream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int c[1000], t[1000] = {};
int f =... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <random>
#include <set>
#include <sstream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int c[1000], t[1000] = {};
int f =... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,025,388 | 1,025,389 | u127741845 | cpp |
p03239 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <random>
#include <set>
#include <sstream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int c[1000], t[1000] = {};
int f =... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <random>
#include <set>
#include <sstream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int c[1000], t[1000] = {};
int f =... | [
"identifier.change",
"io.output.change",
"expression.operation.binary.remove"
] | 1,025,390 | 1,025,389 | u127741845 | cpp |
p03239 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <random>
#include <set>
#include <sstream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int c[1000], t[1000] = {};
int f =... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <random>
#include <set>
#include <sstream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int c[1000], t[1000] = {};
int f =... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"io.output.change",
"expression.operation.binary.remove"
] | 1,025,391 | 1,025,389 | u127741845 | cpp |
p03239 | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, t;
cin >> n >> t;
int ans = 100000;
rep(i, n) {
int a, b;
cin >> a >> b;
if (b <= t) {
... | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, t;
cin >> n >> t;
int ans = 100000;
rep(i, n) {
int a, b;
cin >> a >> b;
if (b <= t) {
... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 1,025,399 | 1,025,400 | u657208344 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, min_c = 1001;
vector<vector<int>> ct(100, vector<int>(2));
cin >> n >> t;
for (int i = 0; i < n; i++) {
cin >> ct[i][0] >> ct[i][1];
if (ct[i][1] <= t && ct[i][0] < min_c)
min_c = ct[i][0];
}
if (min_c = 1001)
cout << "... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, min_c = 1001;
vector<vector<int>> ct(100, vector<int>(2));
cin >> n >> t;
for (int i = 0; i < n; i++) {
cin >> ct[i][0] >> ct[i][1];
if (ct[i][1] <= t && ct[i][0] < min_c)
min_c = ct[i][0];
}
if (min_c == 1001)
cout << ... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,025,408 | 1,025,409 | u652660628 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t;
cin >> n;
cin >> t;
int res = 1001;
for (int i = 0; i < n; i++) {
int c, tx;
cin >> c;
cin >> tx;
if (tx < t && c < res)
res = c;
}
if (res == 1001)
cout << "TLE" << endl;
else
cout << res;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t;
cin >> n;
cin >> t;
int res = 1001;
for (int i = 0; i < n; i++) {
int c, tx;
cin >> c;
cin >> tx;
if (tx <= t && c < res)
res = c;
}
if (res == 1001)
cout << "TLE" << endl;
else
cout << res;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,025,414 | 1,025,415 | u185618677 | cpp |
p03239 | #include <iostream>
#include <map>
#include <vector>
using namespace std;
using P = pair<int, int>;
using ll = long long;
struct tp {
int x, y, i;
bool operator<(const tp tt) const {
if (x == tt.x)
return y < tt.y;
else
return x < tt.x;
}
};
int main() {
int n, t;
cin >> n >> t;
int an ... | #include <iostream>
#include <map>
#include <vector>
using namespace std;
using P = pair<int, int>;
using ll = long long;
struct tp {
int x, y, i;
bool operator<(const tp tt) const {
if (x == tt.x)
return y < tt.y;
else
return x < tt.x;
}
};
int main() {
int n, t;
cin >> n >> t;
int an ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 1,025,418 | 1,025,419 | u548163222 | cpp |
p03239 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repd(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
int main() {
int N, T;
cin >> N >> T;
int c[N], t[N];
int cost... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repd(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
int main() {
int N, T;
cin >> N >> T;
int c[N], t[N];
int cost... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,025,433 | 1,025,434 | u879674287 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep1(i, n) for (ll i = 1; i < (ll)(n); i++)
#define INF 1000000000000
#define MOD 1000000007
#define MAX 2000000000
#define PI 3.1415926535897932
using ll = long long;
using Graph = vector<vector<int>>;
int main()... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep1(i, n) for (ll i = 1; i < (ll)(n); i++)
#define INF 1000000000000
#define MOD 1000000007
#define MAX 2000000000
#define PI 3.1415926535897932
using ll = long long;
using Graph = vector<vector<int>>;
int main()... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 1,025,439 | 1,025,440 | u779216084 | cpp |
p03239 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int min_c = 10000, min_t = 10000;
for (int i = 0; i < N; ++i) {
int c, t;
cin >> c >> t;
if (t < T) {
if ... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int min_c = 10000, min_t = 10000;
for (int i = 0; i < N; ++i) {
int c, t;
cin >> c >> t;
if (t <= T) {
if... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,025,473 | 1,025,474 | u323542775 | cpp |
p03239 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int min_c = 10000, min_t = 10000;
for (int i = 0; i < N; ++i) {
int c, t;
cin >> c >> t;
if (t < T) {
if ... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int min_c = 10000, min_t = 10000;
for (int i = 0; i < N; ++i) {
int c, t;
cin >> c >> t;
if (t <= T) {
if... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,025,475 | 1,025,474 | u323542775 | cpp |
p03239 | #include <iostream>
//#include <set>
//#include <map>
//#include <iomanip>
//#include <algorithm>
//#include <numeric>
//#include <queue>
//#include <stack>
//#include <math.h>
#include <vector>
//#include <unordered_map>
// typedef long long LL;
// typedef long double LD;
using namespace std;
//#define MOD 1000000007... | #include <iostream>
//#include <set>
//#include <map>
//#include <iomanip>
//#include <algorithm>
//#include <numeric>
//#include <queue>
//#include <stack>
//#include <math.h>
#include <vector>
//#include <unordered_map>
// typedef long long LL;
// typedef long double LD;
using namespace std;
//#define MOD 1000000007... | [] | 1,025,478 | 1,025,479 | u755310927 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, c, t, C = 1001;
cin >> N >> T;
for (int i = 0; i < N; i++) {
cin >> c >> t;
if (t <= T)
C = min(C, c);
}
if (C == 1001)
cout << "TLE" << endl;
else
cout << c << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, c, t, C = 1001;
cin >> N >> T;
for (int i = 0; i < N; i++) {
cin >> c >> t;
if (t <= T)
C = min(C, c);
}
if (C == 1001)
cout << "TLE" << endl;
else
cout << C << endl;
} | [
"misc.typo",
"identifier.change",
"io.output.change"
] | 1,025,485 | 1,025,486 | u820224016 | cpp |
p03239 | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n, s) for (int i = (s); i < (n); i++)
#define MOD 1000000007
typedef long long ll;
using namespace std;
using Graph = vector<vector<int>>;
int main() {
cin.tie(0);
ios::sync_with_stdio... | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n, s) for (int i = (s); i < (n); i++)
#define MOD 1000000007
typedef long long ll;
using namespace std;
using Graph = vector<vector<int>>;
int main() {
cin.tie(0);
ios::sync_with_stdio... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,025,489 | 1,025,490 | u438265890 | cpp |
p03239 | #include <iostream>
using namespace std;
int main() {
int c, t, total = 0, ans, k = 0, minv = 1000000000;
cin >> c >> t;
int a[c + 1], b[c + 1], d[c];
for (int i = 1; i <= c; i++)
cin >> a[i] >> b[i];
for (int i = 1; i <= c; i++) {
if (b[i] <= t) {
k++;
total++;
d[k] = a[i];
}
... | #include <iostream>
using namespace std;
int main() {
int c, t, total = 0, ans, k = 0, minv = 1000000000;
cin >> c >> t;
int a[c + 1], b[c + 1], d[c];
for (int i = 1; i <= c; i++)
cin >> a[i] >> b[i];
for (int i = 1; i <= c; i++) {
if (b[i] <= t) {
k++;
total++;
d[k] = a[i];
}
... | [] | 1,025,496 | 1,025,497 | u952557476 | cpp |
p03239 | #include <iostream>
using namespace std;
int main() {
int c, t, total = 0, ans, k = 0, minv = 10000;
cin >> c >> t;
int a[c + 1], b[c + 1], d[c];
for (int i = 1; i <= c; i++)
cin >> a[i] >> b[i];
for (int i = 1; i <= c; i++) {
if (b[i] <= t) {
k++;
total++;
d[k] = a[i];
}
}
i... | #include <iostream>
using namespace std;
int main() {
int c, t, total = 0, ans, k = 0, minv = 1000000000;
cin >> c >> t;
int a[c + 1], b[c + 1], d[c];
for (int i = 1; i <= c; i++)
cin >> a[i] >> b[i];
for (int i = 1; i <= c; i++) {
if (b[i] <= t) {
k++;
total++;
d[k] = a[i];
}
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,025,499 | 1,025,497 | u952557476 | cpp |
p03239 | //#include <tourist>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = (1 << 28);
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1},
Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#d... | //#include <tourist>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = (1 << 28);
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1},
Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#d... | [
"expression.operation.binary.add"
] | 1,025,533 | 1,025,534 | u155416173 | cpp |
p03239 | #include <iostream>
using namespace std;
int main() {
int n, i, t[1000], c[1000], a, b;
cin >> n >> i;
b = 1001;
for (a = 1; a <= n; a++)
cin >> t[a] >> c[a];
for (a = 1; a <= n; a++) {
if (c[a] > i) {
t[a] = 0;
} else {
if (t[a] <= b) {
b = t[a];
}
}
}
if (b == 1... | #include <iostream>
using namespace std;
int main() {
int n, i, t[1000], c[1000], a, b;
cin >> n >> i;
b = 1001;
for (a = 1; a <= n; a++)
cin >> t[a] >> c[a];
for (a = 1; a <= n; a++) {
if (c[a] > i) {
t[a] = 0;
} else {
if (t[a] <= b) {
b = t[a];
}
}
}
if (b == 1... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,025,540 | 1,025,541 | u834488582 | cpp |
p03239 | #include <iostream>
using namespace std;
int main() {
int n, t, ci, ti, i, c = 1001;
cin >> n >> t;
for (i = 0; i < n; i++) {
cin >> ci >> ti;
if (ti < t && ci < c)
c = ci;
}
if (c < 1001)
cout << c << endl;
else
cout << "TLE" << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int n, t, ci, ti, i, c = 1001;
cin >> n >> t;
for (i = 0; i < n; i++) {
cin >> ci >> ti;
if (ti <= t && ci < c)
c = ci;
}
if (c < 1001)
cout << c << endl;
else
cout << "TLE" << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,025,543 | 1,025,544 | u834488582 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n, t, min = 1000, flag = 0, c[1010], tt[1010];
cin >> n >> t;
for (int i = 0; i < n; i++) {
cin >> c[i] >> tt[i];
if (t >= tt[i] && min >= c[i]) {
min = c[i];
flag = 1;
}
}
if (flag == 1) {
... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n, t, min = 1000, flag = 0, c[1010], tt[1010];
cin >> n >> t;
for (int i = 0; i < n; i++) {
cin >> c[i] >> tt[i];
if (t >= tt[i] && min >= c[i]) {
min = c[i];
flag = 1;
}
}
if (flag == 1) {
... | [
"literal.string.change",
"io.output.change"
] | 1,025,547 | 1,025,548 | u743889070 | cpp |
p03239 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n, T, c, t;
cin >> n >> T;
int ans = 1001;
rep(i, n) {
cin >> c;
cin >> t;
if (t <= T) {
ans = min(ans, c);
}
}
if (ans == 1001) {
cout << "TEL" <... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n, T, c, t;
cin >> n >> T;
int ans = 1001;
rep(i, n) {
cin >> c;
cin >> t;
if (t <= T) {
ans = min(ans, c);
}
}
if (ans == 1001) {
cout << "TLE" <... | [
"literal.string.change",
"io.output.change"
] | 1,025,567 | 1,025,568 | u681559222 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
map<int, int> mp;
for (int i = 0; i < N; ++i) {
int c, t;
cin >> c >> t;
mp.insert(make_pair(c, t));
}
int ans = 10000;
for (const auto &kv : mp) {
if (kv.second <= T) {
ans = min(ans, kv.first);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
multimap<int, int> mp;
for (int i = 0; i < N; ++i) {
int c, t;
cin >> c >> t;
mp.insert(make_pair(c, t));
}
int ans = 10000;
for (const auto &kv : mp) {
if (kv.second <= T) {
ans = min(ans, kv.first)... | [
"variable_declaration.type.change"
] | 1,025,601 | 1,025,602 | u000893497 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
#define INF (1 << 29)
#define MAX_N 1000010
/* ACはうれCすぎてうれD */
int main(void) {
int n, t;
cin >> n >> t;
vector<pair<int, int>> v;
for (int i = 0; i < n; i++) {
int cost, time;
cin >> cost >> time;
v.push_bac... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
#define INF (1 << 29)
#define MAX_N 1000010
/* ACはうれCすぎてうれD */
int main(void) {
int n, t;
cin >> n >> t;
vector<pair<int, int>> v;
for (int i = 0; i < n; i++) {
int cost, time;
cin >> cost >> time;
v.push_bac... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,025,603 | 1,025,604 | u900688325 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a, b, c;
cin >> n >> t;
c = 0;
for (int i = 0; i < n; i++) {
cin >> a >> b;
if (b <= t && a <= c) {
c = a;
}
}
if (c == 0) {
cout << "TLE" << endl;
} else {
cout << c << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a, b, c;
cin >> n >> t;
c = 10000;
for (int i = 0; i < n; i++) {
cin >> a >> b;
if (b <= t && a <= c) {
c = a;
}
}
if (c == 10000) {
cout << "TLE" << endl;
} else {
cout << c << endl;
}
} | [
"literal.number.change",
"assignment.value.change",
"control_flow.branch.if.condition.change"
] | 1,025,636 | 1,025,637 | u431125128 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a, b, c;
cin >> n >> t;
c = 0;
for (int i = 0; i < n; i++) {
cin >> a >> b;
if (b <= t && a < c) {
c = a;
}
}
if (c == 0) {
cout << "TLE" << endl;
} else {
cout << c << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a, b, c;
cin >> n >> t;
c = 10000;
for (int i = 0; i < n; i++) {
cin >> a >> b;
if (b <= t && a <= c) {
c = a;
}
}
if (c == 10000) {
cout << "TLE" << endl;
} else {
cout << c << endl;
}
} | [
"literal.number.change",
"assignment.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,025,638 | 1,025,637 | u431125128 | cpp |
p03239 | #include <iostream>
int main() {
int n, t, i, m = -1;
std::cin >> n >> t;
int tmp, c[n];
for (i = 0; i < n; ++i) {
std::cin >> c[i] >> tmp;
m = (tmp <= t ? m < 0 ? i : c[i] < c[m] ? i : m : m);
}
if (m < 0) {
std::cout << "TLE"
<< "\n";
} else {
std::cout << m + 1 << "\n";
... | #include <iostream>
int main() {
int n, t, i, m = -1;
std::cin >> n >> t;
int tmp, c[n];
for (i = 0; i < n; ++i) {
std::cin >> c[i] >> tmp;
m = (tmp <= t ? m < 0 ? i : c[i] < c[m] ? i : m : m);
}
if (m < 0) {
std::cout << "TLE"
<< "\n";
} else {
std::cout << c[m] << "\n";
}... | [
"expression.operation.binary.change"
] | 1,025,652 | 1,025,653 | u854175276 | cpp |
p03239 | #include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, T;
cin >> n >> T;
int min = 1001;
for (int i = 0; i < n; i++) {
int c, t;
cin >> c >> t;
if (t <= T && c < min) {
min = c;
}
}
if (min = 1001)
cout << "TLE" << endl;
else
... | #include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, T;
cin >> n >> T;
int min = 1001;
for (int i = 0; i < n; i++) {
int c, t;
cin >> c >> t;
if (t <= T && c < min) {
min = c;
}
}
if (min == 1001)
cout << "TLE" << endl;
else
... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,025,664 | 1,025,665 | u904995051 | cpp |
p03239 | #include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, T;
cin >> n >> T;
int min = 1001;
for (int i = 0; i < n; i++) {
int c, t;
cin >> c >> T;
if (t <= T && c < min) {
min = c;
}
}
if (min = 1001)
cout << "TLE" << endl;
else
... | #include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, T;
cin >> n >> T;
int min = 1001;
for (int i = 0; i < n; i++) {
int c, t;
cin >> c >> t;
if (t <= T && c < min) {
min = c;
}
}
if (min == 1001)
cout << "TLE" << endl;
else
... | [
"identifier.change",
"expression.operation.binary.change",
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,025,666 | 1,025,665 | u904995051 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define rrep(i, n) for (int(i) = (n)-1; (i) >= 0; --(i)) // Reversi rep
#define nfor(i, a, b) for (int(i) = (a); (i) < (b); ++(i)) // Natural for
#define rfor(i, a, b) for (int(i) = (b)-1; (i) >= (a); --(i)) // Re... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define rrep(i, n) for (int(i) = (n)-1; (i) >= 0; --(i)) // Reversi rep
#define nfor(i, a, b) for (int(i) = (a); (i) < (b); ++(i)) // Natural for
#define rfor(i, a, b) for (int(i) = (b)-1; (i) >= (a); --(i)) // Re... | [
"expression.operation.binary.remove"
] | 1,025,677 | 1,025,678 | u801513186 | cpp |
p03239 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
int N, T;
cin >> N >> T;
int ans = 10000;
rep(i, N) {
int c, t;
cin >> c >> t;
if (t < T) {
ans = min(ans, c);
}
}
if (a... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
int N, T;
cin >> N >> T;
int ans = 10000;
rep(i, N) {
int c, t;
cin >> c >> t;
if (t <= T) {
ans = min(ans, c);
}
}
if (... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,025,694 | 1,025,695 | u668191971 | cpp |
p03239 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <vector>
#define rep(i, N) for (int i = 0; i < (int)N; i++)
using namespace std;
typedef long long ll;
const ll LLINF = 9223372036854775807;
const int MOD = 1000000007;
int main() {
int N, T;
ci... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <vector>
#define rep(i, N) for (int i = 0; i < (int)N; i++)
using namespace std;
typedef long long ll;
const ll LLINF = 9223372036854775807;
const int MOD = 1000000007;
int main() {
int N, T;
ci... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change",
"call.arguments.add"
] | 1,025,707 | 1,025,708 | u680707192 | 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 > T)
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;
} | [] | 1,025,711 | 1,025,712 | u127314985 | cpp |
p03239 | #include <algorithm>
#include <iostream>
#include <map>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int ans = 2000;
int c, t;
for (int i = 0; i < N; i++) {
cin >> c >> t;
if (t <= T) {
ans = min(c, ans);
}
}
if (ans > 2000) {
cout << "TLE" << endl;
} else {
cou... | #include <algorithm>
#include <iostream>
#include <map>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int ans = 2000;
int c, t;
for (int i = 0; i < N; i++) {
cin >> c >> t;
if (t <= T) {
ans = min(c, ans);
}
}
if (ans >= 2000) {
cout << "TLE" << endl;
} else {
co... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,025,713 | 1,025,714 | u476604182 | cpp |
p03239 | #include <algorithm>
#include <iostream>
#include <map>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int ans = 1000;
int c, t;
for (int i = 0; i < N; i++) {
cin >> c >> t;
if (t <= T) {
ans = min(c, ans);
}
}
if (ans > 1000) {
cout << "TLE" << endl;
} else {
cou... | #include <algorithm>
#include <iostream>
#include <map>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int ans = 2000;
int c, t;
for (int i = 0; i < N; i++) {
cin >> c >> t;
if (t <= T) {
ans = min(c, ans);
}
}
if (ans >= 2000) {
cout << "TLE" << endl;
} else {
co... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,025,715 | 1,025,714 | u476604182 | cpp |
p03239 | #include <algorithm>
#include <iostream>
#include <map>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int ans = T + 1;
int c, t;
for (int i = 0; i < N; i++) {
cin >> c >> t;
if (t <= T) {
ans = min(c, ans);
}
}
if (ans > T) {
cout << "TLE" << endl;
} else {
cout ... | #include <algorithm>
#include <iostream>
#include <map>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int ans = 2000;
int c, t;
for (int i = 0; i < N; i++) {
cin >> c >> t;
if (t <= T) {
ans = min(c, ans);
}
}
if (ans >= 2000) {
cout << "TLE" << endl;
} else {
co... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 1,025,716 | 1,025,714 | u476604182 | cpp |
p03239 | #include <iostream>
using namespace std;
int main() {
int N, T, c, t;
cin >> N >> T;
int min_c = 1001;
for (int i = 0; i < N; i++) {
cin >> c >> t;
if (t > T) {
continue;
} else {
if (c < min_c) {
min_c = c;
}
}
}
if (c == 1001) {
cout << "TLE" << endl;
} e... | #include <iostream>
using namespace std;
int main() {
int N, T, c, t;
cin >> N >> T;
int min_c = 1001;
for (int i = 0; i < N; i++) {
cin >> c >> t;
if (t > T) {
continue;
} else {
if (c < min_c) {
min_c = c;
}
}
}
if (min_c == 1001) {
cout << "TLE" << endl;
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,025,724 | 1,025,725 | u614217744 | cpp |
p03239 | #include <iostream>
using namespace std;
int main() {
int N, T, c, t;
cin >> N >> T;
int min_c = 1001;
for (int i = 0; i < N; i++) {
cin >> c >> t;
if (t > T) {
continue;
} else {
if (c < min_c) {
min_c = c;
}
}
}
if (c == 1001) {
cout << "TLE" << endl;
} e... | #include <iostream>
using namespace std;
int main() {
int N, T, c, t;
cin >> N >> T;
int min_c = 1001;
for (int i = 0; i < N; i++) {
cin >> c >> t;
if (t > T) {
continue;
} else {
if (c < min_c) {
min_c = c;
}
}
}
if (min_c == 1001) {
cout << "TLE" << endl;
... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 1,025,726 | 1,025,725 | u614217744 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t;
cin >> n >> t;
int ans = 1010;
for (int i = 0; i < n; i++) {
int c, t1;
cin >> c >> t1;
if (ans > c && t1 > t)
ans = c;
}
if (ans == 1010)
cout << "TLE" << endl;
else
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t;
cin >> n >> t;
int ans = 1010;
for (int i = 0; i < n; i++) {
int c, t1;
cin >> c >> t1;
if (ans > c && t1 <= t)
ans = c;
}
if (ans == 1010)
cout << "TLE" << endl;
else
cout << ans << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,025,731 | 1,025,732 | u980485808 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
typedef long long ll;
typedef long long unsigned int llu;
ll MOD = 1000000007;
ll INF = 1e9 + 1;
void solve() {
int n, time;
cin >> n >> time;
int ans = 10000;
vector<pair<int, int>> v;
rep(i, n) {
int c, t;
ci... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
typedef long long ll;
typedef long long unsigned int llu;
ll MOD = 1000000007;
ll INF = 1e9 + 1;
void solve() {
int n, time;
cin >> n >> time;
int ans = 10000;
vector<pair<int, int>> v;
rep(i, n) {
int c, t;
ci... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,025,737 | 1,025,738 | u272496669 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, min = 999999999;
int c[100000], a[100000];
cin >> n >> t;
for (int i = 0; i < n; i++) {
cin >> c[i] >> a[i];
}
for (int i = 0; i < n; i++) {
if (a[i] <= t && min > c[i])
min = c[i];
}
if (min != 99999999)
cout << min... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, min = 99999;
int c[100000], a[100000];
cin >> n >> t;
for (int i = 0; i < n; i++) {
cin >> c[i] >> a[i];
}
for (int i = 0; i < n; i++) {
if (a[i] <= t && min > c[i])
min = c[i];
}
if (min != 99999)
cout << min << '\n... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.branch.if.condition.change"
] | 1,025,749 | 1,025,750 | u132033278 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, min = -1;
int c[100000], a[100000];
cin >> n >> t;
for (int i = 0; i < n; i++) {
cin >> c[i] >> a[i];
}
for (int i = 0; i < n; i++) {
if (a[i] <= t && min > c[i])
min = c[i];
}
if (min != -1)
cout << min << '\n';
e... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, min = 99999;
int c[100000], a[100000];
cin >> n >> t;
for (int i = 0; i < n; i++) {
cin >> c[i] >> a[i];
}
for (int i = 0; i < n; i++) {
if (a[i] <= t && min > c[i])
min = c[i];
}
if (min != 99999)
cout << min << '\n... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.branch.if.condition.change"
] | 1,025,751 | 1,025,750 | u132033278 | cpp |
p03239 | #include <bits/stdc++.h>
// atoi : atoi(str.c_str())
using namespace std;
using vi = vector<int>;
using vb = vector<bool>;
using vc = vector<char>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvc = vector<vector<char>>;
using pii = pair<int, int>;
#define fix10 cout << fixed << setprecision(10);
#... | #include <bits/stdc++.h>
// atoi : atoi(str.c_str())
using namespace std;
using vi = vector<int>;
using vb = vector<bool>;
using vc = vector<char>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvc = vector<vector<char>>;
using pii = pair<int, int>;
#define fix10 cout << fixed << setprecision(10);
#... | [
"identifier.change",
"io.output.change"
] | 1,025,754 | 1,025,755 | u184335045 | cpp |
p03239 | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <queue>
#include <vector>
using namespace std;
#define INF 110000000000
#define MOD 1000000007
typedef long long ll;
typedef pair<int, int> P;
int main() {
int N, T, c = 10000, t, ans = 10000;
... | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <queue>
#include <vector>
using namespace std;
#define INF 110000000000
#define MOD 1000000007
typedef long long ll;
typedef pair<int, int> P;
int main() {
int N, T, c = 10000, t, ans = 10000;
... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 1,025,756 | 1,025,757 | u591914971 | cpp |
p03239 | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i <= n; i++)
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int c, t;
int ans = 1000;
rep(i, 1, N) {
cin >> c >> t;
if (t <= T)
ans = min(ans, c);
}
if (ans == 1000) {
cout << "TLE" << endl;
}
cout << ans << ... | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i <= n; i++)
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int c, t;
int ans = 10000;
rep(i, 1, N) {
cin >> c >> t;
if (t <= T)
ans = min(ans, c);
}
if (ans == 10000) {
cout << "TLE" << endl;
return 0;
}
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.branch.if.condition.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 1,025,766 | 1,025,767 | u726060136 | cpp |
p03239 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
int n, T;
cin >> n >> T;
int ans = 10 ^ 9;
bool ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
int n, T;
cin >> n >> T;
int ans = 1000000000;
b... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 1,025,817 | 1,025,818 | u656679572 | cpp |
p03239 | #include <iostream>
using namespace std;
int main() {
int n, T;
cin >> n >> T;
int c[n], t[n];
int m = 10000;
for (int i = 0; i < n; i++) {
cin >> c[i] >> t[i];
if (t[i] <= T) {
m = min(m, c[i]);
}
}
if (m == 10000) {
cout << 'TLE' << endl;
return 0;
} else {
cout << m << ... | #include <iostream>
using namespace std;
int main() {
int n, T;
cin >> n >> T;
int c[n], t[n];
int m = 10000;
for (int i = 0; i < n; i++) {
cin >> c[i] >> t[i];
if (t[i] <= T) {
m = min(m, c[i]);
}
}
if (m == 10000) {
cout << "TLE" << endl;
return 0;
} else {
cout << m << ... | [
"literal.string.change",
"io.output.change"
] | 1,025,829 | 1,025,830 | u222293734 | cpp |
p03239 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace s... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace s... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,025,839 | 1,025,840 | u800221251 | cpp |
p03239 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define REP(var, n) for (int var = 0; var < (n); var++)
#define REPP(var, n) for (int var = 1; var < (n); var++)
#define ALL(c) (c).begin(), (c).end()
int main()... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define REP(var, n) for (int var = 0; var < (n); var++)
#define REPP(var, n) for (int var = 1; var < (n); var++)
#define ALL(c) (c).begin(), (c).end()
int main()... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,025,843 | 1,025,844 | u484999838 | cpp |
p03239 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <set>
#include <sstream>
#include <s... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <set>
#include <sstream>
#include <s... | [
"expression.operation.binary.remove"
] | 1,025,845 | 1,025,846 | u900727536 | cpp |
p03239 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <set>
#include <sstream>
#include <s... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <set>
#include <sstream>
#include <s... | [
"expression.operation.binary.remove"
] | 1,025,847 | 1,025,846 | u900727536 | cpp |
p03239 | #include <bits/stdc++.h>
#include <numeric>
#include <vector>
#define PI 3.14159265358979323846
#define MAXINF 1e18L
#define MININF -1e18L
#define REP(i, n) for (int i = 0; i < int(n); ++i)
#define RREP(i, n) for (int i = int(n) - 1; i >= 0; --i)
#define ALL(v) v.begin(), v.end()
#define SORT(v) sort(ALL(v))
#define DE... | #include <bits/stdc++.h>
#include <numeric>
#include <vector>
#define PI 3.14159265358979323846
#define MAXINF 1e18L
#define MININF -1e18L
#define REP(i, n) for (int i = 0; i < int(n); ++i)
#define RREP(i, n) for (int i = int(n) - 1; i >= 0; --i)
#define ALL(v) v.begin(), v.end()
#define SORT(v) sort(ALL(v))
#define DE... | [
"literal.string.change",
"call.arguments.change"
] | 1,025,854 | 1,025,855 | u528720841 | cpp |
p03239 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c, d = 1001, e;
cin >> a >> b;
for (int h = 1; h <= a; h++) {
cin >> c >> e;
if (e <= b) {
d = min(c, d);
}
}
if (d == 0) {
cout << "TLE"
<< "\n";
} else {
cout << d << "... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c, d = 1001, e;
cin >> a >> b;
for (int h = 1; h <= a; h++) {
cin >> c >> e;
if (e <= b) {
d = min(c, d);
}
}
if (d == 1001) {
cout << "TLE"
<< "\n";
} else {
cout << d <... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,025,866 | 1,025,867 | u986568278 | cpp |
p03239 | #include <climits>
#include <iostream>
int main() {
int n, time_limit;
std::cin >> n >> time_limit;
int result = INT_MAX;
for (int i = 0; i < n; i++) {
int cost, time;
std::cin >> cost >> time;
if (time <= time_limit) {
result = std::max(result, cost);
}
}
if (result == INT_MAX) {
... | #include <climits>
#include <iostream>
int main() {
int n, time_limit;
std::cin >> n >> time_limit;
int result = INT_MAX;
for (int i = 0; i < n; i++) {
int cost, time;
std::cin >> cost >> time;
if (time <= time_limit) {
result = std::min(result, cost);
}
}
if (result == INT_MAX) {
... | [
"misc.opposites",
"assignment.value.change",
"identifier.change"
] | 1,025,874 | 1,025,875 | u901295506 | cpp |
p03239 | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define per(i, a, n) for (int i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define MAX 1000000001;
using namespace std;
typedef long long... | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define per(i, a, n) for (int i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define MAX 1000000001;
using namespace std;
typedef long long... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"expression.operation.binary.change"
] | 1,025,904 | 1,025,905 | u255001744 | cpp |
p03239 | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,025,926 | 1,025,927 | u380908793 | cpp |
p03239 |
#include <bits/stdc++.h>
using namespace std;
#define db(...) ZZ(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void ZZ(const char *name, Arg1 &&arg1) {
std::cerr << name << " = " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void ZZ(const char *names, Arg1 &&arg1, Args &&...args) {
const ch... |
#include <bits/stdc++.h>
using namespace std;
#define db(...) ZZ(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void ZZ(const char *name, Arg1 &&arg1) {
std::cerr << name << " = " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void ZZ(const char *names, Arg1 &&arg1, Args &&...args) {
const ch... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,025,944 | 1,025,945 | u155985376 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int ans = 1e9;
for (int i = 0; i < N; i++) {
int c, t;
cin >> c >> t;
if (t <= T)
ans = min(c, ans);
}
if (ans <= T)
cout << ans << endl;
else
cout << "TLE" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int ans = 1e9;
for (int i = 0; i < N; i++) {
int c, t;
cin >> c >> t;
if (t <= T)
ans = min(c, ans);
}
if (ans < 1e9)
cout << ans << endl;
else
cout << "TLE" << endl;
}
| [] | 1,025,971 | 1,025,972 | u374190629 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, T, c, t;
cin >> n >> T;
int min_t = 10000;
for (int i = 0; i < n; i++) {
cin >> c >> t;
if (t < T && c < min_t) {
min_t = c;
}
}
if (min_t == 10000) {
cout << "TLE" << endl;
} else {
cout << min_t << endl;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
int n, T, c, t;
cin >> n >> T;
int min_t = 10000;
for (int i = 0; i < n; i++) {
cin >> c >> t;
if (t <= T && c < min_t) {
min_t = c;
}
}
if (min_t == 10000) {
cout << "TLE" << endl;
} else {
co... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,025,977 | 1,025,978 | u058295774 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define ALL(obj) (obj).begin(), (obj).end()
#define REP(i, N) for (int i = 0; i < (N); ++i)
int main() {
int a, b;
int ans = 10000;
cin >> a >> b;
REP(i, a) {
int c, t;
cin >> c >> t;
if (c > b) {
continue;
} else {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define ALL(obj) (obj).begin(), (obj).end()
#define REP(i, N) for (int i = 0; i < (N); ++i)
int main() {
int a, b;
int ans = 10000;
cin >> a >> b;
REP(i, a) {
int c, t;
cin >> c >> t;
if (t > b) {
continue;
} else {
... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"call.arguments.change"
] | 1,025,987 | 1,025,988 | u845851868 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t;
cin >> n >> t;
int c[n], t_e[n];
int cost = 0;
for (int i = 0; i < n; i++) {
cin >> c[i] >> t_e[i];
if (c[i] > cost) {
cost = c[i];
}
}
int isPossible = false;
for (int j = 0; j < n; j++) {
if (t > t_e[j]) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t;
cin >> n >> t;
int c[n], t_e[n];
int cost = 0;
for (int i = 0; i < n; i++) {
cin >> c[i] >> t_e[i];
if (c[i] > cost) {
cost = c[i];
}
}
int isPossible = false;
for (int j = 0; j < n; j++) {
if (t >= t_e[j]) {
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,025,991 | 1,025,992 | u318027064 | cpp |
p03239 | #include <iostream>
using namespace std;
int main() {
int n, t, a = 100000, b, c;
cin >> n >> t;
for (int i = 0; i < n; i++) {
cin >> c >> b;
if (b <= t && c <= a)
a = c;
}
if (a == 100000)
cout << "TLE" << endl;
else
cout << c << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int n, t, a = 100000, b, c;
cin >> n >> t;
for (int i = 0; i < n; i++) {
cin >> c >> b;
if (b <= t && c <= a)
a = c;
}
if (a == 100000)
cout << "TLE" << endl;
else
cout << a << endl;
return 0;
}
| [
"identifier.change",
"io.output.change"
] | 1,025,998 | 1,025,999 | u169639579 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int cost = 1001;
int c, t;
bool ret = false;
for (int i = 0; i < N; i++) {
cin >> c >> t;
if (t < T && cost > c) {
cost = c;
ret = true;
}
}
if (ret)
cout << cost << endl;
else
cout <... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int cost = 2147483647;
int c, t;
bool ret = false;
for (int i = 0; i < N; i++) {
cin >> c >> t;
if (t <= T && cost > c) {
cost = c;
ret = true;
}
}
if (ret)
cout << cost << endl;
else
... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,026,067 | 1,026,068 | u292209746 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
#define rp(i, k, n) for (ll i = k; i < n; i++)
#define ll long long
ll mod = 1e9 + 7;
int main() {
int n, t;
cin >> n >> t;
int ans = 1e9;
int c, nowt;
bool flag;
rp(i, 0, n) {
cin >> c >> nowt;
if (c < ans && nowt <= t) {
ans = c;
flag = ... | #include <bits/stdc++.h>
using namespace std;
#define rp(i, k, n) for (ll i = k; i < n; i++)
#define ll long long
ll mod = 1e9 + 7;
int main() {
int n, t;
cin >> n >> t;
int ans = 1e9;
int c, nowt;
bool flag = false;
rp(i, 0, n) {
cin >> c >> nowt;
if (c < ans && nowt <= t) {
ans = c;
... | [
"variable_declaration.value.change"
] | 1,026,070 | 1,026,071 | u575653048 | cpp |
p03239 | #define _CRT_SECURE_NO_WARNINGS
#define MATH_PI 3.14159265358979323846264338327950288419716939
#define DIVIDER9 1000000007
#define lli long long int
#include <fstream>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string.h>
using namespace std;
#ifdef _WIN32
#pragma warning(disable : 4101)
signe... | #define _CRT_SECURE_NO_WARNINGS
#define MATH_PI 3.14159265358979323846264338327950288419716939
#define DIVIDER9 1000000007
#define lli long long int
#include <fstream>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string.h>
using namespace std;
#ifdef _WIN32
#pragma warning(disable : 4101)
signe... | [
"identifier.change",
"call.arguments.change"
] | 1,026,078 | 1,026,079 | u575781793 | cpp |
p03239 | #define _CRT_SECURE_NO_WARNINGS
#define MATH_PI 3.14159265358979323846264338327950288419716939
#define DIVIDER9 1000000007
#define lli long long int
#include <fstream>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string.h>
using namespace std;
#ifdef _WIN32
#pragma warning(disable : 4101)
signe... | #define _CRT_SECURE_NO_WARNINGS
#define MATH_PI 3.14159265358979323846264338327950288419716939
#define DIVIDER9 1000000007
#define lli long long int
#include <fstream>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string.h>
using namespace std;
#ifdef _WIN32
#pragma warning(disable : 4101)
signe... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 1,026,080 | 1,026,079 | u575781793 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, c, t, count = 2000;
cin >> N >> T;
for (int i = 0; i < N; i++) {
cin >> c >> t;
if (t <= T) {
count = min(count, t);
}
}
if (count == 2000) {
cout << "TLE" << endl;
} else {
cout << count << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, c, t, count = 2000;
cin >> N >> T;
for (int i = 0; i < N; i++) {
cin >> c >> t;
if (t <= T) {
count = min(count, c);
}
}
if (count == 2000) {
cout << "TLE" << endl;
} else {
cout << count << endl;
}
} | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 1,026,081 | 1,026,082 | u952865396 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int P[1010][1010] = {0};
bool flag = false;
int ans = 10010;
for (int i = 0; i < N; i++) {
int c, t;
cin >> c >> t;
if (t < T) {
ans = min(ans, c);
flag = true;
}
}
if (flag) {
cout << a... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int P[1010][1010] = {0};
bool flag = false;
int ans = 10010;
for (int i = 0; i < N; i++) {
int c, t;
cin >> c >> t;
if (t <= T) {
ans = min(ans, c);
flag = true;
}
}
if (flag) {
cout << ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,026,083 | 1,026,084 | u653388379 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int P[1010][1010] = {0};
bool flag = false;
int ans = 10010;
for (int i = 0; i < N; i++) {
int c, t;
cin >> c >> t;
if (t < 70) {
ans = min(ans, c);
flag = true;
}
}
if (flag) {
cout << ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int P[1010][1010] = {0};
bool flag = false;
int ans = 10010;
for (int i = 0; i < N; i++) {
int c, t;
cin >> c >> t;
if (t <= T) {
ans = min(ans, c);
flag = true;
}
}
if (flag) {
cout << ... | [
"control_flow.loop.for.condition.change"
] | 1,026,085 | 1,026,084 | u653388379 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int P[1010][1010] = {0};
bool flag = false;
int ans = 100;
for (int i = 0; i < N; i++) {
int c, t;
cin >> c >> t;
if (t < 70) {
ans = min(ans, c);
flag = true;
}
}
if (flag) {
cout << an... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int P[1010][1010] = {0};
bool flag = false;
int ans = 10010;
for (int i = 0; i < N; i++) {
int c, t;
cin >> c >> t;
if (t <= T) {
ans = min(ans, c);
flag = true;
}
}
if (flag) {
cout << ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.condition.change"
] | 1,026,086 | 1,026,084 | u653388379 | cpp |
p03239 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int a[N][2];
for (int i = 0; i < N; i++) {
for (int j = 0; j < 2; j++) {
cin >> a[i][j];
}
}
int ans = 1001;
for (int i = 0; i < N; i++) {
if (a[i][1] <= T && a[i][0]... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int a[N][2];
for (int i = 0; i < N; i++) {
for (int j = 0; j < 2; j++) {
cin >> a[i][j];
}
}
int ans = 1001;
for (int i = 0; i < N; i++) {
if (a[i][1] <= T && a[i][0]... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,026,090 | 1,026,091 | u828388155 | cpp |
p03239 |
#include <bits/stdc++.h>
using namespace std;
#define inf 1000000000
#define INF 1000000000000000
#define ll long long
#define ull unsigned long long
#define M (int)(1e9 + 7)
#define P pair<int, int>
#define PLL pair<ll, ll>
#define FOR(i, m, n) for (int i = (int)m; i < (int)n; i++)
#define RFOR(i, m, n) for (int i = ... |
#include <bits/stdc++.h>
using namespace std;
#define inf 1000000000
#define INF 1000000000000000
#define ll long long
#define ull unsigned long long
#define M (int)(1e9 + 7)
#define P pair<int, int>
#define PLL pair<ll, ll>
#define FOR(i, m, n) for (int i = (int)m; i < (int)n; i++)
#define RFOR(i, m, n) for (int i = ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,026,103 | 1,026,104 | u229842440 | cpp |
p03239 |
#include <bits/stdc++.h>
using namespace std;
#define inf 1000000000
#define INF 1000000000000000
#define ll long long
#define ull unsigned long long
#define M (int)(1e9 + 7)
#define P pair<int, int>
#define PLL pair<ll, ll>
#define FOR(i, m, n) for (int i = (int)m; i < (int)n; i++)
#define RFOR(i, m, n) for (int i = ... |
#include <bits/stdc++.h>
using namespace std;
#define inf 1000000000
#define INF 1000000000000000
#define ll long long
#define ull unsigned long long
#define M (int)(1e9 + 7)
#define P pair<int, int>
#define PLL pair<ll, ll>
#define FOR(i, m, n) for (int i = (int)m; i < (int)n; i++)
#define RFOR(i, m, n) for (int i = ... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 1,026,105 | 1,026,104 | u229842440 | cpp |
p03239 | #include <algorithm>
#include <iostream>
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;
}
|
#include <algorithm>
#include <iostream>
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;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,026,117 | 1,026,118 | u389766217 | cpp |
p03239 | #include <iostream>
#include <vector>
using namespace std;
const int inf{int(1e9)};
int main() {
int N, T;
cin >> N >> T;
int ans{inf};
for (int i = 0; i < N; ++i) {
int c, t;
cin >> c >> t;
if (t < T && c < ans) {
ans = c;
}
}
if (ans == inf) {
cout << "TLE" << endl;
} else {... | #include <iostream>
using namespace std;
const int inf{int(1e9)};
int main() {
int N, T;
cin >> N >> T;
int ans{inf};
for (int i = 0; i < N; ++i) {
int c, t;
cin >> c >> t;
if (t <= T && c < ans) {
ans = c;
}
}
if (ans == inf) {
cout << "TLE" << endl;
} else {
cout << ans ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,026,135 | 1,026,136 | u195054737 | cpp |
p03239 | #include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using l... | #include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using l... | [
"literal.string.change",
"io.output.change"
] | 1,026,141 | 1,026,142 | u947375463 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t;
cin >> n >> t;
int ans = 1000000000;
int cc, tt;
for (int i = 0; i < n; i++) {
cin >> cc >> tt;
if (t >= tt) {
ans = min(ans, cc);
}
}
if (ans == 10000000000) {
cout << "TLE" << endl;
return 0;
} else {
c... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t;
cin >> n >> t;
int ans = 1000000000;
int cc, tt;
for (int i = 0; i < n; i++) {
cin >> cc >> tt;
if (t >= tt) {
ans = min(ans, cc);
}
}
if (ans == 1000000000) {
cout << "TLE" << endl;
return 0;
} else {
co... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,026,158 | 1,026,159 | u655975843 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(int argc, char const *argv[]) {
int n, T;
cin >> n >> T;
vector<int> c, t;
for (int i = 0; i < n; ++i) {
int tmp;
cin >> tmp;
c.push_back(tmp);
cin >> tmp;
t.push_back(tmp);
}
int index = -1;
int min = INT... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(int argc, char const *argv[]) {
int n, T;
cin >> n >> T;
vector<int> c, t;
for (int i = 0; i < n; ++i) {
int tmp;
cin >> tmp;
c.push_back(tmp);
cin >> tmp;
t.push_back(tmp);
}
int index = -1;
int min = INT... | [
"call.add",
"io.output.change"
] | 1,026,166 | 1,026,167 | u720829795 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int c, t, low = 1001;
for (int i = 0; i < N; i++) {
cin >> c >> t;
if (t <= T) {
low = min(low, c);
}
}
if (low == 1000) {
cout << "TLE" << endl;
} else {
cout << low << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int c, t, low = 1001;
for (int i = 0; i < N; i++) {
cin >> c >> t;
if (t <= T) {
low = min(low, c);
}
}
if (low == 1001) {
cout << "TLE" << endl;
} else {
cout << low << endl;
}
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,026,172 | 1,026,173 | u981907639 | cpp |
p03239 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, t, c, x;
int i, j = 0;
vector<int> v;
cin >> n >> t;
for (i = 0; i < n; i++) {
cin >> c >> x;
if (x < t) {
v.push_back(c);
j++;
}
}
sort(v.begin(), v.end());
if (j == 0)
co... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, t, c, x;
int i, j = 0;
vector<int> v;
cin >> n >> t;
for (i = 0; i < n; i++) {
cin >> c >> x;
if (x <= t) {
v.push_back(c);
j++;
}
}
sort(v.begin(), v.end());
if (j == 0)
c... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,026,193 | 1,026,194 | u060467857 | cpp |
p03239 | #include <bits/stdc++.h>
#define INF 1e+18
using namespace std;
signed main() {
int n, t, ans = INF;
cin >> n >> t;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
if (b <= t)
ans = min(ans, a);
}
if (ans != INF)
cout << ans << endl;
else
cout << "TLE" << endl;
}
| #include <bits/stdc++.h>
#define INF 1e+9
using namespace std;
signed main() {
int n, t, ans = INF;
cin >> n >> t;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
if (b <= t)
ans = min(ans, a);
}
if (ans != INF)
cout << ans << endl;
else
cout << "TLE" << endl;
}
| [
"preprocessor.define.value.change",
"literal.float.change"
] | 1,026,199 | 1,026,200 | u456611841 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int inf = 1000000000000000LL;
signed main() {
int n, t;
cin >> n >> t;
int ans = inf;
rep(i, n) {
int c, s;
cin >> c >> s;
if (s <= t) {
ans = min(ans, c);
}
}... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int inf = 1000000000000000LL;
signed main() {
int n, t;
cin >> n >> t;
int ans = inf;
rep(i, n) {
int c, s;
cin >> c >> s;
if (s <= t) {
ans = min(ans, c);
}
}... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 1,026,201 | 1,026,202 | u602447032 | cpp |
p03239 | #include <iostream>
using namespace std;
int main() {
int N, T, c[120], t[105];
cin >> N >> T;
for (int i = 0; i < N; i++) {
cin >> c[i] >> t[i];
}
int ans = 99999;
for (int i = 0; i < N; i++) {
if (t[i] <= T) {
if (c[i] <= T) {
ans = c[i];
}
}
}
if (ans < 99999) {
... | #include <iostream>
using namespace std;
int main() {
int N, T, c[120], t[105];
cin >> N >> T;
for (int i = 0; i < N; i++) {
cin >> c[i] >> t[i];
}
int ans = 99999;
for (int i = 0; i < N; i++) {
if (t[i] <= T) {
if (c[i] <= ans) {
ans = c[i];
}
}
}
if (ans < 99999) {
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,026,203 | 1,026,204 | u166133844 | cpp |
p03239 | #include <iostream>
using namespace std;
int main() {
int N, T, c[120], t[105];
cin >> N >> T;
for (int i = 0; i < N; i++) {
cin >> c[i] >> t[1];
}
int ans = 999999999;
for (int i = 0; i < N; i++) {
if (t[i] <= T) {
if (c[i] < ans) {
ans = c[i];
}
}
}
if (ans < 999999... | #include <iostream>
using namespace std;
int main() {
int N, T, c[120], t[105];
cin >> N >> T;
for (int i = 0; i < N; i++) {
cin >> c[i] >> t[i];
}
int ans = 999999999;
for (int i = 0; i < N; i++) {
if (t[i] <= T) {
if (c[i] < ans) {
ans = c[i];
}
}
}
if (ans < 999999... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 1,026,205 | 1,026,206 | u504142483 | cpp |
p03239 | #include <iostream>
using namespace std;
int main() {
int N, T, c[120], t[105];
cin >> N >> T;
for (int i = 0; i < N; i++) {
cin >> c[i] >> t[1];
}
int ans = 999999999;
for (int i = 0; i < N; i++) {
if (t[i] <= T) {
if (c[i] < ans) {
ans = c[i];
}
}
}
if (ans < 999999... | #include <iostream>
using namespace std;
int main() {
int N, T, c[120], t[105];
cin >> N >> T;
for (int i = 0; i < N; i++) {
cin >> c[i] >> t[i];
}
int ans = 999999999;
for (int i = 0; i < N; i++) {
if (t[i] <= T) {
if (c[i] < ans) {
ans = c[i];
}
}
}
if (ans < 999999... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"literal.string.change",
"io.output.change"
] | 1,026,207 | 1,026,206 | u504142483 | cpp |
p03239 | #include <iostream>
using namespace std;
int main() {
int N, T, c[120], t[120];
cin >> N >> T;
for (int i = 0; i < N; i++) {
cin >> c[i] >> t[i];
}
int ans = 99999;
for (int i = 0; i < N; i++) {
if (t[i] <= T) {
if (c[i] < ans) {
ans = c[i];
}
}
}
if (ans < T) {
... | #include <iostream>
using namespace std;
int main() {
int N, T, c[120], t[120];
cin >> N >> T;
for (int i = 0; i < N; i++) {
cin >> c[i] >> t[i];
}
int ans = 99999;
for (int i = 0; i < N; i++) {
if (t[i] <= T) {
if (c[i] < ans) {
ans = c[i];
}
}
}
if (ans < 99999) ... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change"
] | 1,026,208 | 1,026,209 | u445457059 | cpp |
p03239 |
#include <iostream>
using namespace std;
int main() {
int N, T, c, t;
int ans = 1001;
cin >> N >> T;
for (int i = 1; i <= N; i = i + 1) {
cin >> c >> t;
if (T > t) {
if (ans > c) {
ans = c;
}
}
}
if (ans == 1001) {
cout << "TLE" << endl;
}
else {
cout << ... |
#include <iostream>
using namespace std;
int main() {
int N, T, c, t;
int ans = 1001;
cin >> N >> T;
for (int i = 1; i <= N; i = i + 1) {
cin >> c >> t;
if (T >= t) {
if (ans > c) {
ans = c;
}
}
}
if (ans == 1001) {
cout << "TLE" << endl;
}
else {
cout <<... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,026,210 | 1,026,211 | u938962195 | cpp |
p03239 | //#include"pch.h"
//#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string>
using namespace std;
int main() {
int N, T;
int c[1000], t[1000];
int min = 0;
cin >> N >> T;
for (int i = 0; i < N; i++) {
... | //#include"pch.h"
//#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string>
using namespace std;
int main() {
int N, T;
int c[1000], t[1000];
int min = 1001;
cin >> N >> T;
for (int i = 0; i < N; i++) ... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.unary.reference.add",
"control_flow.branch.if.condition.change"
] | 1,026,220 | 1,026,221 | u193037957 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, c, t;
cin >> N >> T;
int minc = 1001;
int minn = N;
for (int i = 0; i < N; i++) {
cin >> c >> t;
if (t <= T and c < minc) {
minc = c;
minn = N;
}
}
if (minn == N) {
cout << "TLE" << endl;
} else {
cout ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, c, t;
cin >> N >> T;
int minc = 1001;
int minn = N;
for (int i = 0; i < N; i++) {
cin >> c >> t;
if (t <= T and c < minc) {
minc = c;
minn = i;
}
}
if (minn == N) {
cout << "TLE" << endl;
} else {
cout ... | [
"assignment.value.change",
"identifier.change"
] | 1,026,222 | 1,026,223 | u944316525 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, c, t;
cin >> N >> T;
int minc = 1001;
int minn = N;
for (int i = 0; i < N; i++) {
cin >> c >> t;
if (t <= T and c < minc) {
minc = c;
minn = N;
}
}
if (minn == N) {
cout << "TLE" << endl;
} else {
cout ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, c, t;
cin >> N >> T;
int minc = 1001;
int minn = N;
for (int i = 0; i < N; i++) {
cin >> c >> t;
if (t <= T and c < minc) {
minc = c;
minn = i;
}
}
if (minn == N) {
cout << "TLE" << endl;
} else {
cout ... | [
"assignment.value.change",
"identifier.change",
"io.output.change"
] | 1,026,224 | 1,026,223 | u944316525 | cpp |
p03239 |
#include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <stdio.h>
#include <string>
#include <typeinfo>
using namespace std;
int main() {
int n, t, min = 1001;
cin >> n >> t;
int a[n], b[n];
for (int i = 0; i < n; i++) {
... |
#include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <stdio.h>
#include <string>
#include <typeinfo>
using namespace std;
int main() {
int n, t, min = 1001;
cin >> n >> t;
int a[n], b[n];
for (int i = 0; i < n; i++) {
... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,026,244 | 1,026,245 | u019356802 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int dan = 100001;
for (int i = 0; i < N; i++) {
int c, t;
cin >> c >> t;
if (t < T) {
dan = min(dan, c);
}
}
if (dan > 100000) {
cout << "TLE" << endl;
} else {
cout << dan << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int dan = 100001;
for (int i = 0; i < N; i++) {
int c, t;
cin >> c >> t;
if (t <= T) {
dan = min(dan, c);
}
}
if (dan > 100000) {
cout << "TLE" << endl;
} else {
cout << dan << endl;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,026,248 | 1,026,249 | u240748165 | cpp |
p03239 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unord... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unord... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,026,260 | 1,026,261 | u539485388 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int minimum_cost = 1001;
for (int i = 0; i < N; ++i) {
int c, t;
cin >> c >> t;
if (c < minimum_cost && t <= T) {
minimum_cost = c;
}
}
if (minimum_cost == 101) {
cout << "TLE" << endl;
} else ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int minimum_cost = 1001;
for (int i = 0; i < N; ++i) {
int c, t;
cin >> c >> t;
if (c < minimum_cost && t <= T) {
minimum_cost = c;
}
}
if (minimum_cost == 1001) {
cout << "TLE" << endl;
} else... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,026,262 | 1,026,263 | u666965597 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t;
cin >> n >> t;
int ans = 1e9 + 1;
for (int i = 0; i < n; ++i) {
int u, v;
cin >> u >> v;
if (v = t)
ans = min(ans, u);
}
if (ans == 1e9 + 1)
cout << "TLE" << endl;
else
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t;
cin >> n >> t;
int ans = 1e9 + 1;
for (int i = 0; i < n; ++i) {
int u, v;
cin >> u >> v;
if (v <= t)
ans = min(ans, u);
}
if (ans == 1e9 + 1)
cout << "TLE" << endl;
else
cout << ans << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 1,026,289 | 1,026,290 | u258009780 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int m = 0;
for (int i = 0; i < a; i++) {
int c[1000], d[1000];
cin >> c[i] >> d[i];
if (d[i] <= b) {
m = min(m, c[i]);
}
}
if (m == 0) {
cout << "TLE" << endl;
return 0;
}
cout << m << endl... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int m = 1001;
for (int i = 0; i < a; i++) {
int c[1000], d[1000];
cin >> c[i] >> d[i];
if (d[i] <= b) {
m = min(m, c[i]);
}
}
if (m == 1001) {
cout << "TLE" << endl;
return 0;
}
cout << m <... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.branch.if.condition.change"
] | 1,026,293 | 1,026,294 | u686352452 | cpp |
p03239 | #include <iostream>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int c[N];
int t[N];
int x = 1000;
int h = 0;
for (int i = 0; i < N; i++) {
cin >> c[i] >> t[i];
if (T > t[i] && x >= c[i]) {
x = c[i];
h++;
}
}
if (h == 0) {
cout << "TLE";
} else {
cou... | #include <iostream>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int c[N];
int t[N];
int x = 1000;
int h = 0;
for (int i = 0; i < N; i++) {
cin >> c[i] >> t[i];
if (T >= t[i] && x >= c[i]) {
x = c[i];
h++;
}
}
if (h == 0) {
cout << "TLE";
} else {
co... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,026,300 | 1,026,301 | u540300321 | cpp |
p03239 | #include <iostream>
using namespace std;
int main() {
int n, t;
cin >> n >> t;
int ret_c = 2000000000, ret_t = 2000000000;
for (int i = 1; i <= n; i++) {
int c, ti;
cin >> c >> ti;
if (ret_c >= c) {
ret_c = c;
ret_t = ti;
}
}
if (ret_c != 2000000000) {
cout << ret_c << endl;... | #include <iostream>
using namespace std;
int main() {
int n, t;
cin >> n >> t;
int ret_c = 2000000000, ret_t = 2000000000;
for (int i = 1; i <= n; i++) {
int c, ti;
cin >> c >> ti;
if (ret_c >= c && t >= ti) {
ret_c = c;
ret_t = ti;
}
}
if (ret_c != 2000000000) {
cout << ret... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,026,302 | 1,026,303 | u239023686 | cpp |
p03239 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, T, tmp, c;
cin >> N >> T;
vector<int> cost;
for (int i = 0; i < N; i++) {
cin >> tmp >> c;
if (c <= T)
cost.push_back(c);
}
if (cost.size() == 0) {
cout << "TLE" << endl;
} else {
s... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, T, tmp, c;
cin >> N >> T;
vector<int> cost;
for (int i = 0; i < N; i++) {
cin >> tmp >> c;
if (c <= T)
cost.push_back(tmp);
}
if (cost.size() == 0) {
cout << "TLE" << endl;
} else {
... | [
"identifier.change",
"call.arguments.change"
] | 1,026,320 | 1,026,321 | u816580121 | cpp |
p03239 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
int main() {
int n, t_time;
cin >> n >> t_time;
int c_min = 1000;
... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
int main() {
int n, t_time;
cin >> n >> t_time;
int c_min = 1000;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,026,326 | 1,026,325 | u348670055 | cpp |
p03239 | #include <iostream>
using namespace std;
int main() {
int inf;
inf = 1e9;
int N, T;
cin >> N >> T;
int x = inf;
for (int i = 1; i <= N; i++) {
int c, t;
cin >> c >> t;
if (t < T) {
if (c < x) {
x = c;
}
}
}
if (x == inf) {
cout << "TLE" << endl;
} else {
cou... | #include <iostream>
using namespace std;
int main() {
int inf;
inf = 1e9;
int N, T;
cin >> N >> T;
int x = inf;
for (int i = 1; i <= N; i++) {
int c, t;
cin >> c >> t;
if (t <= T) {
if (c < x) {
x = c;
}
}
}
if (x == inf) {
cout << "TLE" << endl;
} else {
co... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,026,333 | 1,026,334 | u005815259 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.