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 <iostream>
#include <math.h>
using namespace std;
int main() {
int n, T, c[100], t[100];
cin >> n >> T;
for (int i = 0; i < n; i++)
cin >> c[i] >> t[i];
int v, minv = 10000;
for (int i = 0; i < n; i++) {
if (t[i] <= T && c[i] < minv) {
minv = c[i];
}
}
if (v == 0)
cout <<... | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int n, T, c[100], t[100];
cin >> n >> T;
for (int i = 0; i < n; i++)
cin >> c[i] >> t[i];
int minv = 10000;
for (int i = 0; i < n; i++) {
if (t[i] <= T && c[i] < minv) {
minv = c[i];
}
}
if (minv == 10000)
cou... | [
"variable_declaration.remove",
"identifier.change",
"control_flow.branch.if.condition.change",
"literal.number.change"
] | 1,026,352 | 1,026,353 | u291873788 | cpp |
p03239 | #include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define R... | #include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define R... | [
"literal.string.change",
"io.output.change"
] | 1,026,354 | 1,026,355 | u764844841 | cpp |
p03239 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n, t;
cin >> n >> t;
ll a[n][2];
for (int i = 0; i < n; i++) {
cin >> a[i][0] >> a[i][1];
}
ll ans = 1000000007;
for (int i = 0; i < n; i++) {
if (a[1][i] <= t)
ans = min(ans, a[i][0]);
}
if (ans == 10000... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n, t;
cin >> n >> t;
ll a[n][2];
for (int i = 0; i < n; i++) {
cin >> a[i][0] >> a[i][1];
}
ll ans = 1000000007;
for (int i = 0; i < n; i++) {
if (a[i][1] <= t)
ans = min(ans, a[i][0]);
}
if (ans == 10000... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"identifier.replace.remove",
"literal.replace.add"
] | 1,026,356 | 1,026,357 | u315476176 | cpp |
p03239 | #include <algorithm>
#include <iostream>
using namespace std;
const int INF = 1e8;
int main() {
int N, T;
cin >> N >> T;
int res = INF;
for (int i = 0; i < N; i++) {
int c, t;
cin >> c >> t;
if (t >= T) {
continue;
}
res = min(res, c);
}
if (res == INF) {
cout << "TLE" << end... | #include <algorithm>
#include <iostream>
using namespace std;
const int INF = 1e8;
int main() {
int N, T;
cin >> N >> T;
int res = INF;
for (int i = 0; i < N; i++) {
int c, t;
cin >> c >> t;
if (t > T) {
continue;
}
res = min(res, c);
}
if (res == INF) {
cout << "TLE" << endl... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,026,358 | 1,026,359 | u168456252 | cpp |
p03239 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
#define pb push_back
int main() {
int N, T;
cin >> N >> T;
int ans = 1000;
for (int i = 0; i < N; i++) {
int c, t;
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
#define pb push_back
int main() {
int N, T;
cin >> N >> T;
int ans = 10000;
for (int i = 0; i < N; i++) {
int c, t;
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.branch.if.condition.change"
] | 1,026,390 | 1,026,389 | u285598935 | cpp |
p03239 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
#define pb push_back
int main() {
int N, T;
cin >> N >> T;
int ans = 0;
for (int i = 0; i < N; i++) {
int c, t;
ci... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
#define pb push_back
int main() {
int N, T;
cin >> N >> T;
int ans = 10000;
for (int i = 0; i < N; i++) {
int c, t;
... | [
"literal.number.change",
"variable_declaration.value.change",
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change"
] | 1,026,391 | 1,026,389 | u285598935 | cpp |
p03239 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
vector<int> c, t, k;
int temp;
for (int i = 0; i < N; i++) {
cin >> temp;
c.push_back(temp);
cin >> temp;
t.push_back(temp);
}
for (int i = 0; i < N; i++) {
if (t[... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
vector<int> c, t, k;
int temp;
for (int i = 0; i < N; i++) {
cin >> temp;
c.push_back(temp);
cin >> temp;
t.push_back(temp);
}
for (int i = 0; i < N; i++) {
if (t[... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"call.add"
] | 1,026,392 | 1,026,393 | u324139341 | cpp |
p03239 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
vector<int> c, t, k;
int temp;
for (int i = 0; i < N; i++) {
cin >> temp;
c.push_back(temp);
cin >> temp;
t.push_back(temp);
}
for (int i = 0; i < N; i++) {
if (t[... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
vector<int> c, t, k;
int temp;
for (int i = 0; i < N; i++) {
cin >> temp;
c.push_back(temp);
cin >> temp;
t.push_back(temp);
}
for (int i = 0; i < N; i++) {
if (t[... | [
"identifier.change",
"call.arguments.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"call.add"
] | 1,026,394 | 1,026,393 | u324139341 | cpp |
p03239 | #include <iostream>
using namespace std;
int main() {
int n, t, i, c[100], k[100], tle[100], check;
cin >> n >> t;
check = 1;
for (i = 1; i <= n; i++) {
cin >> c[i];
cin >> k[i];
if (k[i] > t)
tle[i] = 1;
else
tle[i] = 0;
check = check * tle[i];
}
if (check == 1)
cout << ... | #include <iostream>
using namespace std;
int main() {
int n, t, i, c[100], k[100], tle[100], check;
cin >> n >> t;
check = 1;
for (i = 1; i <= n; i++) {
cin >> c[i];
cin >> k[i];
if (k[i] > t)
tle[i] = 1;
else
tle[i] = 0;
check = check * tle[i];
}
if (check == 1)
cout <<... | [
"literal.string.change",
"io.output.change",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 1,026,417 | 1,026,418 | u072831727 | cpp |
p03239 | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define rep2(x, from, to) for (int x = (from); (x) < (to); (x)++)
#define rep(x, to) rep2(x, 0, to)
#d... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define rep2(x, from, to) for (int x = (from); (x) < (to); (x)++)
#define rep(x, to) rep2(x, 0, to)
#d... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo",
"control_flow.return.add",
"control_flow.return.0.add"
] | 1,026,428 | 1,026,429 | u798441421 | cpp |
p03239 | #include <iostream>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int minimum_cost, cost_temp, time_temp;
time_temp = T + 1;
minimum_cost = 1000;
for (int i = 0; i < N; i++) {
cin >> cost_temp >> time_temp;
if (time_temp <= T && cost_temp < minimum_cost) {
minimum_cost = cost_tem... | #include <iostream>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int minimum_cost, cost_temp, time_temp;
time_temp = T + 1;
minimum_cost = 1001;
for (int i = 0; i < N; i++) {
cin >> cost_temp >> time_temp;
if (time_temp <= T && cost_temp <= minimum_cost) {
minimum_cost = cost_te... | [
"literal.number.change",
"assignment.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"identifier.replace.remove",
"literal.replace.add"
] | 1,026,437 | 1,026,438 | u707498674 | cpp |
p03239 | #include <iostream>
using namespace std;
int main() {
int n, t;
cin >> n >> t;
int a[n + 1];
int check = 1;
int x[n + 1];
int m = 5267246;
for (int i = 1; i <= n; ++i) {
cin >> a[i] >> x[i];
if (x[i] <= t) {
check = 0;
if (a[i] < m) {
m = i;
}
}
}
if (check) {
... | #include <iostream>
using namespace std;
int main() {
int n, t;
cin >> n >> t;
int a[n + 1];
int check = 1;
int x[n + 1];
int m = 5267246;
for (int i = 1; i <= n; ++i) {
cin >> a[i] >> x[i];
if (x[i] <= t) {
check = 0;
if (a[i] < m) {
m = a[i];
}
}
}
if (check) {
... | [] | 1,026,441 | 1,026,442 | u048262890 | cpp |
p03239 | #include <iostream>
using namespace std;
int main() {
int n, t;
cin >> n >> t;
int a[n + 1];
int check = 1;
int x[n + 1];
int m = 5267246;
for (int i = 1; i <= n; ++i) {
cin >> x[i] >> a[i];
if (x[i] <= t) {
check = 0;
if (a[i] < m) {
m = x[i];
}
}
}
if (check) {
... | #include <iostream>
using namespace std;
int main() {
int n, t;
cin >> n >> t;
int a[n + 1];
int check = 1;
int x[n + 1];
int m = 5267246;
for (int i = 1; i <= n; ++i) {
cin >> a[i] >> x[i];
if (x[i] <= t) {
check = 0;
if (a[i] < m) {
m = a[i];
}
}
}
if (check) {
... | [
"identifier.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 1,026,443 | 1,026,442 | u048262890 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, min = 1001;
cin >> N >> T;
int a[N], b[T];
for (int i = 0; i < N; i++)
cin >> a[i] >> b[i];
for (int i = 0; i < N; i++) {
if (b[i] <= T && a[i] <= min)
min = a[i];
}
if (min == 1001)
cout << "TLE" << endl;
else
co... | #include <bits/stdc++.h>
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++)
cin >> a[i] >> b[i];
for (int i = 0; i < N; i++) {
if (b[i] <= T && a[i] <= min)
min = a[i];
}
if (min == 1001)
cout << "TLE" << endl;
else
co... | [
"identifier.change",
"variable_declaration.array_dimensions.change"
] | 1,026,444 | 1,026,445 | u969248530 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, min = 1001;
cin >> N >> T;
int a[N], b[T];
for (int i = 0; i < N; i++)
cin >> a[i] >> b[i];
for (int i = 0; i < N; i++) {
if (b[i] < T && a[i] < min)
min = a[i];
}
if (min == 1001)
cout << "TLE" << endl;
else
cou... | #include <bits/stdc++.h>
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++)
cin >> a[i] >> b[i];
for (int i = 0; i < N; i++) {
if (b[i] <= T && a[i] <= min)
min = a[i];
}
if (min == 1001)
cout << "TLE" << endl;
else
co... | [
"identifier.change",
"variable_declaration.array_dimensions.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,026,446 | 1,026,445 | u969248530 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, min = 1001;
cin >> N >> T;
int a[N], b[T];
for (int i = 0; i < N; i++)
cin >> a[i] >> b[i];
for (int i = 0; i < N; i++) {
if (b[i] <= T && a[i] < min)
min = a[i];
}
if (min == 1001)
cout << "TLE" << endl;
else
co... | #include <bits/stdc++.h>
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++)
cin >> a[i] >> b[i];
for (int i = 0; i < N; i++) {
if (b[i] <= T && a[i] <= min)
min = a[i];
}
if (min == 1001)
cout << "TLE" << endl;
else
co... | [
"identifier.change",
"variable_declaration.array_dimensions.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,026,447 | 1,026,445 | u969248530 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, min = 1000;
cin >> N >> T;
int a[N], b[T];
for (int i = 0; i < N; i++)
cin >> a[i] >> b[i];
for (int i = 0; i < N; i++) {
if (b[i] <= T && a[i] < min)
min = a[i];
}
if (min == 1000)
cout << "TLE" << endl;
else
co... | #include <bits/stdc++.h>
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++)
cin >> a[i] >> b[i];
for (int i = 0; i < N; i++) {
if (b[i] <= T && a[i] <= min)
min = a[i];
}
if (min == 1001)
cout << "TLE" << endl;
else
co... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"variable_declaration.array_dimensions.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,026,448 | 1,026,445 | u969248530 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, c1, t1, res = -1;
cin >> n >> t;
for (int i = 0; i < n; i++) {
cin >> c1 >> t1;
if (t1 <= t) {
if (res > c1) {
res = c1;
}
}
}
if (res == -1)
cout << "TLE" << endl;
else
cout << res << endl;
re... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, c1, t1, res = 1000000;
cin >> n >> t;
for (int i = 0; i < n; i++) {
cin >> c1 >> t1;
if (t1 <= t) {
if (res > c1) {
res = c1;
}
}
}
if (res == 1000000)
cout << "TLE" << endl;
else
cout << res << e... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.branch.if.condition.change"
] | 1,026,455 | 1,026,456 | u232454579 | cpp |
p03239 | #include <iostream>
using namespace std;
int main() {
int c, t, ans = 9999999, in, ti;
cin >> c >> t;
for (int i = 0; i < c; i++) {
cin >> in >> ti;
if (ti > t)
continue;
if (in < ans)
ans = in;
}
if (ans = 9999999)
cout << "TLE";
else
cout << ans;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int c, t, ans = 9999999, in, ti;
cin >> c >> t;
for (int i = 0; i < c; i++) {
cin >> in >> ti;
if (ti > t)
continue;
if (in < ans)
ans = in;
}
if (ans == 9999999)
cout << "TLE";
else
cout << ans;
return 0;
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,026,464 | 1,026,465 | u342370377 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, t, i, j;
cin >> n >> t;
long ans = LONG_MAX;
for (i = 0; i < n; i++) {
long ci, ti;
cin >> ci >> ti;
if (ti <= t) {
ans = max(ans, ci);
}
}
if (ans == LONG_MAX)
cout << "TLE";
else
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, t, i, j;
cin >> n >> t;
long ans = LONG_MAX;
for (i = 0; i < n; i++) {
long ci, ti;
cin >> ci >> ti;
if (ti <= t) {
ans = min(ans, ci);
}
}
if (ans == LONG_MAX)
cout << "TLE";
else
cout << ans;
return 0;
} | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 1,026,477 | 1,026,478 | u965943031 | cpp |
p03239 | #include <iostream>
using namespace std;
int main() {
int n, t;
cin >> n >> t;
int a, b;
int min = 1001;
for (int i = 0; i < n; i++) {
cin >> a >> b;
if (b < t) {
if (min > a)
min = a;
}
}
if (min == 1001)
cout << "TLE" << endl;
else
cout << min << endl;
} | #include <iostream>
using namespace std;
int main() {
int n, t;
cin >> n >> t;
int a, b;
int min = 1001;
for (int i = 0; i < n; i++) {
cin >> a >> b;
if (b <= t) {
if (min > a)
min = a;
}
}
if (min == 1001)
cout << "TLE" << endl;
else
cout << min << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,026,481 | 1,026,482 | u711849178 | cpp |
p03239 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, T;
int c, t;
c = 0;
t = 0;
int m = 9999;
cin >> N >> T;
for (int i = 0; i < N; i++) {
cin >> c >> t;
if (T >= t) {
m = std::min(m, c);
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, T;
int c, t;
c = 0;
t = 0;
int m = 9999;
cin >> N >> T;
for (int i = 0; i < N; i++) {
cin >> c >> t;
if (T >= t) {
m = std::min(m, c);
... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,026,483 | 1,026,484 | u973004633 | cpp |
p03239 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define ll long long
#define fornum(A, B, C) for (A = B; A < C; A++)
using namespace std;
int i, j, k, l, m, n;
////////////... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define ll long long
#define fornum(A, B, C) for (A = B; A < C; A++)
using namespace std;
int i, j, k, l, m, n;
////////////... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.branch.if.condition.change"
] | 1,026,487 | 1,026,486 | u259396003 | cpp |
p03239 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string.h>
typedef long long ll;
using namespace std;
int main() {
int n, t, a, b, k = 1001;
cin >> n >> t;
for (int i = 0; i < n; i++) {
cin >> a >> b;
if (a < t && b <= t) {
k = a;
}
}
if (k == 1001) {
cout << "TLE... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string.h>
typedef long long ll;
using namespace std;
int main() {
int n, t, a, b, k = 1001;
cin >> n >> t;
for (int i = 0; i < n; i++) {
cin >> a >> b;
if (a < k && b <= t) {
k = a;
}
}
if (k == 1001) {
cout << "TLE... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,026,488 | 1,026,489 | u831873811 | cpp |
p03239 | #include <iostream>
using namespace std;
int main() {
int N, T, c[105], t[105];
cin >> N >> T;
for (int i = 0; i < N; i++)
cin >> c[i] >> t[i];
int m = 100000;
for (int i = 0; i < N; i++) {
if (t[i] <= T && c[i] < m)
m = c[i];
}
if (m == 0)
cout << "TLE" << endl;
else
cout << m << ... | #include <iostream>
using namespace std;
int main() {
int N, T, c[105], t[105];
cin >> N >> T;
for (int i = 0; i < N; i++)
cin >> c[i] >> t[i];
int m = 100000;
for (int i = 0; i < N; i++) {
if (t[i] <= T && c[i] < m)
m = c[i];
}
if (m == 100000)
cout << "TLE" << endl;
else
cout << ... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,026,491 | 1,026,492 | u428110253 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
int cc[105];
int n, T, t, c, cnt = 0;
bool flag = false;
int main() {
cin >> n >> T;
for (int i = 1; i <= n; i++) {
cin >> c >> t;
if (t < T) {
flag = true;
cc[++cnt] = c;
}
}
if (!flag) {
cout << "TLE" << endl;
return 0;
}
sort(c... | #include <bits/stdc++.h>
using namespace std;
int cc[105];
int n, T, t, c, cnt = 0;
bool flag = false;
int main() {
cin >> n >> T;
for (int i = 1; i <= n; i++) {
cin >> c >> t;
if (t <= T) {
flag = true;
cc[++cnt] = c;
}
}
if (!flag) {
cout << "TLE" << endl;
return 0;
}
sort(... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,026,497 | 1,026,498 | u237683858 | cpp |
p03239 | #include <iostream>
using namespace std;
int main() {
int n, T;
cin >> n >> T;
int c[n];
int t[n];
int ans = 1001;
for (int i = 0; i < n; i++) {
cin >> c[i] >> t[i];
if (t[i] < T && ans > c[i]) {
ans = c[i];
}
}
if (ans <= 1000)
cout << ans << endl;
else
cout << "TLE" << endl... | #include <iostream>
using namespace std;
int main() {
int n, T;
cin >> n >> T;
int c[n];
int t[n];
int ans = 1001;
for (int i = 0; i < n; i++) {
cin >> c[i] >> t[i];
if (t[i] <= T && ans > c[i]) {
ans = c[i];
}
}
if (ans <= 1000)
cout << ans << endl;
else
cout << "TLE" << end... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,026,499 | 1,026,500 | u347588083 | cpp |
p03239 | #include <cstdio>
#define MAX 1000
int N, T;
int c[MAX], t[MAX];
int cmin = 1001;
int main(int argc, char const *argv[]) {
scanf("%d %d\n", &N, &T);
cmin = T;
for (int i = 0; i < N; i++) {
scanf("%d %d\n", &c[i], &t[i]);
if (t[i] <= T && c[i] < cmin) {
cmin = c[i];
}
}
if (cmin == 1001) {
... | #include <cstdio>
#define MAX 1000
int N, T;
int c[MAX], t[MAX];
int cmin = 1001;
int main(int argc, char const *argv[]) {
scanf("%d %d\n", &N, &T);
for (int i = 0; i < N; i++) {
scanf("%d %d\n", &c[i], &t[i]);
if (t[i] <= T && c[i] < cmin) {
cmin = c[i];
}
}
if (cmin == 1001) {
printf("T... | [] | 1,026,509 | 1,026,510 | u167254084 | cpp |
p03239 | #include <cstdio>
#define MAX 1000
int N, T;
int c[MAX], t[MAX];
int cmin = 1001;
int main(int argc, char const *argv[]) {
scanf("%d %d\n", &N, &T);
cmin = T;
for (int i = 0; i < N; i++) {
scanf("%d %d\n", &c[i], &t[i]);
if (t[i] <= T && c[i] < cmin) {
cmin = c[i];
}
}
if (cmin == 101) {
... | #include <cstdio>
#define MAX 1000
int N, T;
int c[MAX], t[MAX];
int cmin = 1001;
int main(int argc, char const *argv[]) {
scanf("%d %d\n", &N, &T);
for (int i = 0; i < N; i++) {
scanf("%d %d\n", &c[i], &t[i]);
if (t[i] <= T && c[i] < cmin) {
cmin = c[i];
}
}
if (cmin == 1001) {
printf("T... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,026,511 | 1,026,510 | u167254084 | cpp |
p03239 | #include <iostream>
using namespace std;
int N, T;
int min_cost = 1001;
int main() {
cin >> N >> T;
int c[N], t[N];
for (int i = 0; i < N; i++) {
cin >> c[i] >> t[i];
if ((t[i] < T) && (min_cost > c[i])) {
min_cost = c[i];
}
}
if (min_cost == 1001)
cout << "TLE" << endl;
else
cou... | #include <iostream>
using namespace std;
int N, T;
int min_cost = 1001;
int main() {
cin >> N >> T;
int c[N], t[N];
for (int i = 0; i < N; i++) {
cin >> c[i] >> t[i];
if ((t[i] <= T) && (min_cost > c[i])) {
min_cost = c[i];
}
}
if (min_cost == 1001)
cout << "TLE" << endl;
else
co... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,026,532 | 1,026,533 | u340049257 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int best = numeric_limits<int>::max();
int besti = 0;
for (auto i = 1; i <= N; ++i) {
int c, t;
cin >> c >> t;
if (t < T && c <= best) {
best = c;
besti = i;
}
}
if (besti) {
cout << best... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int best = numeric_limits<int>::max();
int besti = 0;
for (auto i = 1; i <= N; ++i) {
int c, t;
cin >> c >> t;
if (t <= T && c < best) {
best = c;
besti = i;
}
}
if (besti) {
cout << best... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,026,534 | 1,026,535 | u179057566 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int best = numeric_limits<int>::max();
int besti = 0;
for (auto i = 1; i <= N; ++i) {
int c, t;
cin >> c >> t;
if (t < T && c < best) {
best = c;
besti = i;
}
}
if (besti) {
cout << besti... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int best = numeric_limits<int>::max();
int besti = 0;
for (auto i = 1; i <= N; ++i) {
int c, t;
cin >> c >> t;
if (t <= T && c < best) {
best = c;
besti = i;
}
}
if (besti) {
cout << best... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"io.output.change"
] | 1,026,536 | 1,026,535 | u179057566 | cpp |
p03239 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int n, t;
vector<int> ct;
int main() {
cin >> n >> t;
for (int i = 0; i < n; i++) {
int ci, ti;
cin >> ci >> ti;
if (ti < t) {
ct.push_back(ci);
}
}
sort(ct.begin(), ct.end());
if (ct.empty()) {
cout <<... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int n, t;
vector<int> ct;
int main() {
cin >> n >> t;
for (int i = 0; i < n; i++) {
int ci, ti;
cin >> ci >> ti;
if (ti <= t) {
ct.push_back(ci);
}
}
sort(ct.begin(), ct.end());
if (ct.empty()) {
cout <... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,026,551 | 1,026,552 | u919521780 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t;
cin >> n >> t;
int res = 1e9;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
if (b <= t)
res = min(res, a);
}
if (res == 1e9) {
cout << res << endl;
} else {
cout << "TLE" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t;
cin >> n >> t;
int res = 1e9;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
if (b <= t)
res = min(res, a);
}
if (res == 1e9) {
cout << "TLE" << endl;
} else {
cout << res << endl;
}
return 0;
} | [
"control_flow.branch.else.add"
] | 1,026,585 | 1,026,586 | u283229916 | cpp |
p03239 | #include <bits/stdc++.h>
#include <string>
using namespace std;
int n, T;
int main() {
cin >> n >> T;
int c, t;
int cost = 1001;
for (int i = 0; i < n; i++) {
cin >> c >> t;
if (t <= T) {
if (c < cost)
cost = c;
}
}
if (cost = 1001)
cout << "TLE" << endl;
else
cout << cos... | #include <bits/stdc++.h>
#include <string>
using namespace std;
int n, Time;
int main() {
cin >> n >> Time;
int c, t;
int cost = 1001;
for (int i = 0; i < n; i++) {
cin >> c >> t;
if (t <= Time) {
if (c < cost)
cost = c;
}
}
if (cost == 1001)
cout << "TLE" << endl;
else
c... | [
"identifier.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,026,611 | 1,026,612 | u342051078 | cpp |
p03239 | #include <iostream>
int main() {
int N, T, cost, time;
int cost_min = 1000;
bool found_route = false;
std::cin >> N >> T;
for (int i = 0; i < N; ++i) {
std::cin >> cost >> time;
if (time >= T) {
continue;
}
found_route = true;
if (cost < cost_min) {
cost_min = cost;
}
}... | #include <iostream>
int main() {
int N, T, cost, time;
int cost_min = 1000;
bool found_route = false;
std::cin >> N >> T;
for (int i = 0; i < N; ++i) {
std::cin >> cost >> time;
if (time > T) {
continue;
}
found_route = true;
if (cost < cost_min) {
cost_min = cost;
}
}
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,026,623 | 1,026,624 | u957280081 | cpp |
p03239 | #include <iostream>
int main() {
int N, T, cost, time;
int cost_min = 1000;
bool found_route = false;
std::cin >> N >> T;
for (int i = 0; i < N; ++i) {
std::cin >> cost >> time;
if (time >= T) {
continue;
}
found_route = true;
if (cost < cost_min) {
cost_min = cost;
}
}... | #include <iostream>
int main() {
int N, T, cost, time;
int cost_min = 1000;
bool found_route = false;
std::cin >> N >> T;
for (int i = 0; i < N; ++i) {
std::cin >> cost >> time;
if (time > T) {
continue;
}
found_route = true;
if (cost < cost_min) {
cost_min = cost;
}
}
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"expression.operation.binary.change"
] | 1,026,625 | 1,026,624 | u957280081 | cpp |
p03239 | #include <iostream>
int main() {
int N, T, cost, time;
int cost_min = 1000;
bool found_route = false;
std::cin >> N >> T;
for (int i = 0; i < N; ++i) {
std::cin >> cost >> time;
if (time > T) {
continue;
}
found_route = true;
if (cost < cost_min) {
cost_min = cost;
}
}
... | #include <iostream>
int main() {
int N, T, cost, time;
int cost_min = 1000;
bool found_route = false;
std::cin >> N >> T;
for (int i = 0; i < N; ++i) {
std::cin >> cost >> time;
if (time > T) {
continue;
}
found_route = true;
if (cost < cost_min) {
cost_min = cost;
}
}
... | [
"identifier.change",
"expression.operation.binary.change"
] | 1,026,626 | 1,026,624 | u957280081 | cpp |
p03239 | #include <algorithm>
#include <array>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#inclu... | #include <algorithm>
#include <array>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#inclu... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,026,658 | 1,026,659 | u817760251 | cpp |
p03239 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, m;
int cost = 1001;
cin >> n >> m;
for (int i = 0; i < n; i++) {
int c, t;
cin >> c;
cin >> t;
if (t < m)
cost = min(cost, c);
}
if (cost != 1001) {
cout << cost << endl;
return 0;
}
cout <<... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, m;
int cost = 1001;
cin >> n >> m;
for (int i = 0; i < n; i++) {
int c, t;
cin >> c;
cin >> t;
if (t <= m)
cost = min(cost, c);
}
if (cost != 1001) {
cout << cost << endl;
return 0;
}
cout <... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,026,660 | 1,026,661 | u960646202 | cpp |
p03239 | #include <array>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, T;
vector<array<int, 2>> c;
cin >> N >> T;
for (int i = 0; i < N; i++) {
array<int, 2> tmp;
cin >> tmp[0] >> tmp[1];
c.push_back(tmp);
}
int cmin = 1001;
for (int i = 0; i < N; i++) {
if (c[i]... | #include <array>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, T;
vector<array<int, 2>> c;
cin >> N >> T;
for (int i = 0; i < N; i++) {
array<int, 2> tmp;
cin >> tmp[0] >> tmp[1];
c.push_back(tmp);
}
int cmin = 1001;
for (int i = 0; i < N; i++) {
if (c[i]... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,026,670 | 1,026,671 | u795707846 | cpp |
p03239 | /*~~~~~~~~~~~~~~~~~ K++ code ~~~~~~~~~~~~~~~~~~~
in(n, t)
kluster<int ,int> klst <<
for(i, n){
int p, q ;
cin >> p >> q ;
push(klst, (q, p))
}
sort(klst)
for(i, n){
if(klst[i][0]<=t) out(klst[i][1]); return 0
}
out("TLE")
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~*/
#include <algorithm>
#include <c... | /*~~~~~~~~~~~~~~~~~ K++ code ~~~~~~~~~~~~~~~~~~~
in(n, t)
kluster<int ,int> klst <<
for(i, n){
int p, q ;
cin >> p >> q ;
push(klst, (q, p))
}
sort(klst, 1)
for(i, n){
if(klst[i][0]<=t) out(klst[i][1]); return 0
}
out("TLE")
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~*/
#include <algorithm>
#include... | [
"identifier.change",
"call.arguments.change"
] | 1,026,676 | 1,026,677 | u657901243 | cpp |
p03239 | /*~~~~~~~~~~~~~~~~~ K++ code ~~~~~~~~~~~~~~~~~~~
in(n, t)
kluster<int ,int> klst <<
for(i, n){
int p, q ;
cin >> p >> q ;
push(klst, (p, q))
}
sort(klst, 1)
for(i, n){
if(klst[i][1]<=t) out(klst[i][0]); return 0
}
out("TLE")
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~*/
#include <algorithm>
#include... | /*~~~~~~~~~~~~~~~~~ K++ code ~~~~~~~~~~~~~~~~~~~
in(n, t)
kluster<int ,int> klst <<
for(i, n){
int p, q ;
cin >> p >> q ;
push(klst, (q, p))
}
sort(klst, 1)
for(i, n){
if(klst[i][0]<=t) out(klst[i][1]); return 0
}
out("TLE")
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~*/
#include <algorithm>
#include... | [
"control_flow.branch.if.condition.change",
"io.output.change"
] | 1,026,678 | 1,026,677 | u657901243 | cpp |
p03239 | #include <iostream>
#include <stdio.h>
using namespace std;
int main(void) {
// B
int N;
int T;
int *c = new int[100];
int *t = new int[100];
cin >> N;
cin >> T;
for (int i = 0; i < N; i++) {
cin >> c[i];
cin >> t[i];
}
int minCost = 1001;
for (int j = 0; j < N; j++) {
if (c[j] < mi... | #include <iostream>
#include <stdio.h>
using namespace std;
int main(void) {
// B
int N;
int T;
int *c = new int[100];
int *t = new int[100];
cin >> N;
cin >> T;
for (int i = 0; i < N; i++) {
cin >> c[i];
cin >> t[i];
}
int minCost = 1001;
for (int j = 0; j < N; j++) {
if (c[j] < mi... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,026,688 | 1,026,689 | u676101468 | cpp |
p03239 | #include <iostream>
using namespace std;
int main() {
int N, T;
int i;
cin >> N;
cin >> T;
int *c;
int *t;
c = (int *)malloc(N * sizeof(int));
t = (int *)malloc(N * sizeof(int));
for (i = 1; i <= N; i = i + 1) {
cin >> c[i];
cin >> t[i];
}
int cost;
cost = 1500;
for (i = 1; i <= N;... | #include <iostream>
using namespace std;
int main() {
int N, T;
int i;
cin >> N;
cin >> T;
int *c;
int *t;
c = (int *)malloc(N * sizeof(int));
t = (int *)malloc(N * sizeof(int));
for (i = 1; i <= N; i = i + 1) {
cin >> c[i];
cin >> t[i];
}
int cost;
cost = 1500;
for (i = 1; i <= N;... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,026,690 | 1,026,691 | u397070717 | cpp |
p03239 | //
// main.cpp
// test
//
// Created by liuyuhan on 20/10/2018.
// Copyright © 2018 liuyuhan. All rights reserved.
//
#include <iostream>
using namespace std;
int main(int argc, const char *argv[]) {
int N, T;
cin >> N >> T;
int min_c = 1005;
for (int i = 0; i < N; i++) {
int c, t;
cin >> c >> t;... | //
// main.cpp
// test
//
// Created by liuyuhan on 20/10/2018.
// Copyright © 2018 liuyuhan. All rights reserved.
//
#include <iostream>
using namespace std;
int main(int argc, const char *argv[]) {
int N, T;
cin >> N >> T;
int min_c = 1005;
for (int i = 0; i < N; i++) {
int c, t;
cin >> c >> t;... | [
"control_flow.break.remove",
"control_flow.continue.add"
] | 1,026,696 | 1,026,697 | u553370287 | cpp |
p03239 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < (int)n; i++)
#define REP1(j, n) for (int j = 0; j < (int)n; j++)
#define REPD(i, n) for (int i = n; i >= 0; i--)
#define REPD1(j, n) for (int j = n; j = > 0; j--)
#define ... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < (int)n; i++)
#define REP1(j, n) for (int j = 0; j < (int)n; j++)
#define REPD(i, n) for (int i = n; i >= 0; i--)
#define REPD1(j, n) for (int j = n; j = > 0; j--)
#define ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,026,700 | 1,026,701 | u817523595 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a[100], b[100];
cin >> n >> t;
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
}
int ans = 114514;
for (int i = 0; i < n; i++) {
if (b[i] <= t) {
if (ans > a[i])
ans = a[i];
}
}
if (ans = 114514)
cout <... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a[100], b[100];
cin >> n >> t;
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
}
int ans = 114514;
for (int i = 0; i < n; i++) {
if (b[i] <= t) {
if (ans > a[i])
ans = a[i];
}
}
if (ans == 114514)
cout ... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,026,711 | 1,026,712 | u608785059 | cpp |
p03239 | #include <iostream>
#include <string>
using namespace std;
int main() {
int count, limit;
cin >> count >> limit;
// cout << count << " " << limit;
int minCost = 1000;
bool bTLE = false;
for (; count > 0; count--) {
int cost, time;
cin >> cost >> time;
if (time < limit) {
if (cost < mi... | #include <iostream>
#include <string>
using namespace std;
int main() {
int count, limit;
cin >> count >> limit;
// cout << count << " " << limit;
int minCost = 1000;
bool bTLE = false;
for (; count > 0; count--) {
int cost, time;
cin >> cost >> time;
if (time <= limit) {
if (cost < m... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,026,735 | 1,026,736 | u358787963 | cpp |
p03239 | /*
g++ -std=c++11 -o2 -Wall ABC112B.cpp -o .\out\ABC112B.out
.\out\ABC112B.out
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
// freopen("./input/input.txt", "r", stdin);
ios::sync_with_stdio(0);
cin.tie(0);
int N, T;
cin >> N >> T;
int ans = 10000;
int c, t;
for... | /*
g++ -std=c++11 -o2 -Wall ABC112B.cpp -o .\out\ABC112B.out
.\out\ABC112B.out
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
// freopen("./input/input.txt", "r", stdin);
ios::sync_with_stdio(0);
cin.tie(0);
int N, T;
cin >> N >> T;
int ans = 10000;
int c, t;
for... | [] | 1,026,744 | 1,026,745 | u693783299 | cpp |
p03239 | #include <bits/stdc++.h>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(std::numeric_limits<float>::max_digits10);
int n, T;
cin >> n >> T;
vector<int> cs;
r... | #include <bits/stdc++.h>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(std::numeric_limits<float>::max_digits10);
int n, T;
cin >> n >> T;
vector<int> cs;
r... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,026,748 | 1,026,749 | u817142576 | cpp |
p03239 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, t;
cin >> n >> t;
int ans = 10000000;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
if (b <= t)
ans = min(ans, a);
}
if (ans > t) {
cout << "TLE" << endl;
... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, t;
cin >> n >> t;
int ans = 10000000;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
if (b <= t)
ans = min(ans, a);
}
if (ans > 5000) {
cout << "TLE" << endl;
... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change"
] | 1,026,752 | 1,026,753 | u756388720 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
#define INF 999999999
inline int read() {
int w = 1, s = 0;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
w = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9')
s = s * 10 + ch - '0', ch = getchar();
return s * w;
}
i... | #include <bits/stdc++.h>
using namespace std;
#define INF 999999999
inline int read() {
int w = 1, s = 0;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
w = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9')
s = s * 10 + ch - '0', ch = getchar();
return s * w;
}
i... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 1,026,756 | 1,026,757 | u279678523 | cpp |
p03239 | /*
author: Apoorv Singh
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef tree<int... | /*
author: Apoorv Singh
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef tree<int... | [
"identifier.change",
"call.arguments.change"
] | 1,026,773 | 1,026,774 | u082633058 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
#define opt \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define ll long l... | #include <bits/stdc++.h>
using namespace std;
#define opt \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define ll long l... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,026,777 | 1,026,778 | u766029400 | cpp |
p03239 | #include <iostream>
int main() {
int N, T;
std::cin >> N >> T;
const long long NUM = 1000000000;
long long k_c = NUM;
for (int i = 0; i < N; i++) {
int c, t;
std::cin >> c >> t;
if (t < T && c < k_c) {
k_c = c;
}
}
if (k_c == NUM) {
std::cout << "TLE" << std::endl;
} else {
... | #include <iostream>
int main() {
int N, T;
std::cin >> N >> T;
const long long NUM = 1000000000;
long long k_c = NUM;
for (int i = 0; i < N; i++) {
int c, t;
std::cin >> c >> t;
if (t <= T && c < k_c) {
k_c = c;
}
}
if (k_c == NUM) {
std::cout << "TLE" << std::endl;
} else {
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,026,813 | 1,026,814 | u295961023 | cpp |
p03239 | #include <iostream>
using namespace std;
int main() {
int N, T;
cin >> N >> T; //経路数と制限時間
int c, t;
int x = 1000;
int flag = 0;
for (int i = 0; i < N; i++) {
cin >> c >> t; //コストと時間を入力
if (t < T) { //時間が許容範囲内の場合
if (x > c) {
x = c;
}
flag = 1;
} else {
}
}
... | #include <iostream>
using namespace std;
int main() {
int N, T;
cin >> N >> T; //経路数と制限時間
int c, t;
int x = 1000;
int flag = 0;
for (int i = 0; i < N; i++) {
cin >> c >> t; //コストと時間を入力
if (t <= T) { //時間が許容範囲内の場合
if (x > c) {
x = c;
}
flag = 1;
} else {
}
}
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,026,815 | 1,026,816 | u551080425 | cpp |
p03239 | #include <iostream>
using namespace std;
int main(void) {
int N, T;
cin >> N >> T;
int c[N], t[N];
int ans = 10000;
for (int i = 0; i < N; i++) {
cin >> c[i] >> t[i];
if (t[i] < T) {
if (c[i] < ans) {
ans = c[i];
}
}
}
if (ans == 10000) {
cout << "TLE" << endl;
} el... | #include <iostream>
using namespace std;
int main(void) {
int N, T;
cin >> N >> T;
int c[N], t[N];
int ans = 10000;
for (int i = 0; i < N; i++) {
cin >> c[i] >> t[i];
if (t[i] <= T) {
if (c[i] < ans) {
ans = c[i];
}
}
}
if (ans == 10000) {
cout << "TLE" << endl;
} e... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,026,819 | 1,026,820 | u359856428 | cpp |
p03239 | #include <iostream>
#include <string>
using namespace std;
int main() {
int i, N, T, c[1001], t[1001];
int cans = 1001;
cin >> N >> T;
for (i = 1; i <= N; i++) {
cin >> c[i] >> t[i];
}
//結果
for (i = 1; i <= N; i++) {
if (t[i] < T && c[i] < cans) {
cans = c[i];
}
}
if (cans == 1001... | #include <iostream>
#include <string>
using namespace std;
int main() {
int i, N, T, c[1001], t[1001];
int cans = 10000;
cin >> N >> T;
for (i = 1; i <= N; i++) {
cin >> c[i] >> t[i];
}
//結果
for (i = 1; i <= N; i++) {
if (t[i] <= T && c[i] < cans) {
cans = c[i];
}
}
if (cans >= 10... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,026,842 | 1,026,843 | u289838402 | cpp |
p03239 | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <stdio.h>
#include <string>
#define INF INT_MAX
using namespace std;
int N, T, c, t;
int ans;
int main() {
ans = INF;
cin >> N >> T;
for (int i = 0; i < N; i++) {
cin >> c >> t;
if (t <... | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <stdio.h>
#include <string>
#define INF INT_MAX
using namespace std;
int N, T, c, t;
int ans;
int main() {
ans = INF;
cin >> N >> T;
for (int i = 0; i < N; i++) {
cin >> c >> t;
if (t <... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,026,844 | 1,026,845 | u037143188 | cpp |
p03239 | #include <stdio.h>
int main() {
int N, T;
scanf("%d %d", &N, &T);
int time, cost;
int min_cost = 1001;
int flag = 0;
for (int i = 0; i < N; i++) {
scanf("%d %d", &cost, &time);
if (time < T) {
if (cost < min_cost) {
min_cost = cost;
flag++;
}
}
}
if (flag == 0... | #include <stdio.h>
int main() {
int N, T;
scanf("%d %d", &N, &T);
int time, cost;
int min_cost = 1001;
int flag = 0;
for (int i = 0; i < N; i++) {
scanf("%d %d", &cost, &time);
if (time <= T) {
if (cost < min_cost) {
min_cost = cost;
flag++;
}
}
}
if (flag == ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,026,852 | 1,026,853 | u414073264 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, array[100], array2[100], ans = 1001;
cin >> n >> t;
for (int i = 0; i < n; i++) {
cin >> array[i] >> array2[i];
if (array2[i] <= t) {
ans = min(ans, array2[i]);
}
}
if (ans - 1001) {
cout << ans << endl;
} else {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, array[100], array2[100], ans = 1001;
cin >> n >> t;
for (int i = 0; i < n; i++) {
cin >> array[i] >> array2[i];
if (array2[i] <= t) {
ans = min(ans, array[i]);
}
}
if (ans - 1001) {
cout << ans << endl;
} else {
... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 1,026,868 | 1,026,869 | u073398103 | cpp |
p03239 | #include <stdio.h>
int main() {
int i, N, t, lowest = 11110;
int C;
int T;
scanf("%d", &N);
scanf("%d", &t);
for (i = 0; i < N; i++) {
scanf("%d", &C, &T);
if (T <= t && C <= lowest) {
lowest = C;
}
}
if (lowest < 11110) {
printf("%d", lowest);
} else {
printf("TLE\n");
... | #include <stdio.h>
int main() {
int i, N, t, lowest = 11110;
int C;
int T;
scanf("%d", &N);
scanf("%d", &t);
for (i = 0; i < N; i++) {
scanf("%d %d", &C, &T);
if (T <= t && C <= lowest) {
lowest = C;
}
}
if (lowest < 11110) {
printf("%d", lowest);
} else {
printf("TLE\n"... | [
"literal.string.change",
"call.arguments.change"
] | 1,026,893 | 1,026,894 | u465232020 | cpp |
p03239 | #include <stdio.h>
int main() {
int i, N, t, lowest = 11110;
int C;
int T;
scanf("%d", &N);
scanf("%d", &t);
for (i = 0; i < N; i++) {
scanf("%d", &C, &T);
if (T <= t && C <= lowest) {
lowest = C;
}
}
if (lowest < 11110) {
printf("%d\n", lowest);
} else {
printf("TLE\n")... | #include <stdio.h>
int main() {
int i, N, t, lowest = 11110;
int C;
int T;
scanf("%d", &N);
scanf("%d", &t);
for (i = 0; i < N; i++) {
scanf("%d %d", &C, &T);
if (T <= t && C <= lowest) {
lowest = C;
}
}
if (lowest < 11110) {
printf("%d", lowest);
} else {
printf("TLE\n"... | [
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.remove"
] | 1,026,895 | 1,026,894 | u465232020 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, ans = 2000;
cin >> N >> T;
for (int i = 0; i < N; i += 1) {
int c, t;
cin >> c >> t;
if (t < T)
ans = min(ans, c);
}
if (ans == 2000)
cout << "TLE";
else
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, ans = 2000;
cin >> N >> T;
for (int i = 0; i < N; i += 1) {
int c, t;
cin >> c >> t;
if (t <= T)
ans = min(ans, c);
}
if (ans == 2000)
cout << "TLE";
else
cout << ans;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,026,896 | 1,026,897 | u018438536 | cpp |
p03239 | #include <iostream>
using namespace std;
int N;
int T;
int minT = 1001;
int minc = 1001;
int main() {
cin >> N >> T;
int c[N][2];
for (int i = 0; i < N; i++) {
for (int j = 0; j < 2; j++) {
cin >> c[i][j];
if (j == 1) {
if (c[i][j] < T) {
minT = c[i][j];
if (minc > c... | #include <iostream>
using namespace std;
int N;
int T;
int minT = 1001;
int minc = 1001;
int main() {
cin >> N >> T;
int c[N][2];
for (int i = 0; i < N; i++) {
for (int j = 0; j < 2; j++) {
cin >> c[i][j];
if (j == 1) {
if (c[i][j] <= T) {
minT = c[i][j];
if (minc > ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,026,905 | 1,026,906 | u202350553 | cpp |
p03239 | #include <stdio.h>
int main() {
int n, T, t[100], c[100], i, j, x = 1001;
scanf("%d %d", &n, &T);
for (i = 0; i < n; i++) {
scanf("%d%d", &c[i], &t[i]);
if (c[i] <= x && t[i] <= T)
x = c[i];
}
if (x == 1000) {
printf("TLE", x);
return 0;
}
printf("%d", x);
return 0;
} | #include <stdio.h>
int main() {
int n, T, t[100], c[100], i, j, x = 1001;
scanf("%d %d", &n, &T);
for (i = 0; i < n; i++) {
scanf("%d%d", &c[i], &t[i]);
if (c[i] <= x && t[i] <= T)
x = c[i];
}
if (x == 1001) {
printf("TLE", x);
return 0;
}
printf("%d", x);
return 0;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,026,911 | 1,026,912 | u205700197 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, T;
cin >> n >> T;
int c, t;
int ans = 1e5;
for (int i = 0; i < n; i++) {
cin >> c >> t;
if (t <= T)
ans = min(ans, c);
}
if (ans <= T)
cout << ans << endl;
else
cout << "TLE" << endl;
return ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, T;
cin >> n >> T;
int c, t;
int ans = 100000;
for (int i = 0; i < n; i++) {
cin >> c >> t;
if (t <= T)
ans = min(ans, c);
}
if (ans <= 1000)
cout << ans << endl;
else
cout << "TLE" << endl;
r... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change"
] | 1,026,914 | 1,026,915 | u586567203 | cpp |
p03239 | #include <cmath>
#include <iostream>
using namespace std;
const int MAX = 100;
int main() {
int N = 0, T = 0;
int c[MAX], t[MAX];
cin >> N >> T;
int minCost = 1001;
int ans = -1;
for (int i = 0; i < N; i++) {
cin >> c[i] >> t[i];
if (T > t[i]) {
minCost = min(minCost, c[i]);
}
}
... | #include <cmath>
#include <iostream>
using namespace std;
const int MAX = 100;
int main() {
int N = 0, T = 0;
int c[MAX], t[MAX];
cin >> N >> T;
int minCost = 1001;
int ans = -1;
for (int i = 0; i < N; i++) {
cin >> c[i] >> t[i];
if (T >= t[i]) {
minCost = min(minCost, c[i]);
}
}... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,026,916 | 1,026,917 | u475318902 | cpp |
p03239 | #include <iostream>
int MAX_COST = 1000;
int main() {
int N, T;
std::cin >> N >> T;
int cs[N], ts[N];
for (int i = 0; i < N; ++i) {
std::cin >> cs[i] >> ts[i];
}
int ans = MAX_COST;
for (int i = 0; i < N; ++i) {
if (ts[i] > T)
continue;
ans = (ans > cs[i]) ? cs[i] : ans;
}
if (a... | #include <iostream>
int MAX_COST = 1000;
int main() {
int N, T;
std::cin >> N >> T;
int cs[N], ts[N];
for (int i = 0; i < N; ++i) {
std::cin >> cs[i] >> ts[i];
}
int ans = MAX_COST + 1;
for (int i = 0; i < N; ++i) {
if (ts[i] > T)
continue;
ans = (ans > cs[i]) ? cs[i] : ans;
}
i... | [
"assignment.change"
] | 1,026,925 | 1,026,926 | u600759947 | cpp |
p03239 | #include <iostream>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b;
int num, cost, times;
num = a;
times = b;
cost = 999999;
int tmp1, tmp2, flag;
flag = 0;
c = d = -1;
for (int i = 0; i < num; i++) {
cin >> c >> d;
if (times > d &&
cost > c) { //コストの考え方がおかしい。最初が-1にな... | #include <iostream>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b;
int num, cost, times;
num = a;
times = b;
cost = 999999;
int tmp1, tmp2, flag;
flag = 0;
c = d = -1;
for (int i = 0; i < num; i++) {
cin >> c >> d;
if (times >= d &&
cost >=
c) { //コストの考え... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,026,927 | 1,026,928 | u000217193 | cpp |
p03239 | #include <iostream>
#define inf 1e9
using namespace std;
int N, T;
int main(void) {
cin >> N;
int ans = inf;
int c, t;
for (int i = 0; i < N; i++) {
cin >> c >> t;
if (t <= T)
ans = min(ans, c);
}
if (ans >= inf)
cout << "TLE" << endl;
else
cout << ans << endl;
return 0;
} | #include <iostream>
#define inf 1e9
using namespace std;
int N, T;
int main(void) {
cin >> N >> T;
int ans = inf;
int c, t;
for (int i = 0; i < N; i++) {
cin >> c >> t;
if (t <= T)
ans = min(ans, c);
}
if (ans >= inf)
cout << "TLE" << endl;
else
cout << ans << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 1,026,929 | 1,026,930 | u319282133 | cpp |
p03239 | #include <algorithm>
#include <iostream>
using namespace std;
using ll = long long;
int main() {
int n, t;
cin >> n >> t;
int nmin = 1000000;
for (int i = 0; i < n; ++i) {
int c, tt;
cin >> c >> tt;
if (t < tt)
continue;
nmin = min(c, nmin);
}
if (n == 1000000)
cout << "TLE" << e... | #include <algorithm>
#include <iostream>
using namespace std;
using ll = long long;
int main() {
int n, t;
cin >> n >> t;
int nmin = 1000000;
for (int i = 0; i < n; ++i) {
int c, tt;
cin >> c >> tt;
if (t < tt)
continue;
nmin = min(c, nmin);
}
if (nmin == 1000000)
cout << "TLE" <... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,026,935 | 1,026,936 | u054652697 | cpp |
p03239 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, T;
int ci[1000], ti[1000];
cin >> N >> T;
for (int i = 0; i < N; ++i) {
cin >> ci[i] >> ti[i];
}
int ans = 2000;
for (int i = 0; i < N; ++i) {
if (ans > ci[i] && ti[i] < T)
ans = ci[i];
}
if (ans == 2000)... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, T;
int ci[1000], ti[1000];
cin >> N >> T;
for (int i = 0; i < N; ++i) {
cin >> ci[i] >> ti[i];
}
int ans = 2000;
for (int i = 0; i < N; ++i) {
if (ans > ci[i] && ti[i] <= T)
ans = ci[i];
}
if (ans == 2000... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,026,943 | 1,026,944 | u387055019 | cpp |
p03239 | #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, tt;
cin >> c >> tt;
if (tt < t) {
if (c < ans)
ans = c;
}
}
if (ans == 10000)
cout << "TLE" << endl;
else
cout << ans << endl;
retur... | #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, tt;
cin >> c >> tt;
if (tt <= t) {
if (c < ans)
ans = c;
}
}
if (ans == 10000)
cout << "TLE" << endl;
else
cout << ans << endl;
retu... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,026,945 | 1,026,946 | u154124112 | cpp |
p03239 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> p;
const int inf = 100000000;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define rrep(i,... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> p;
const int inf = 100000000;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define rrep(i,... | [
"variable_declaration.type.change",
"assignment.change"
] | 1,026,947 | 1,026,948 | u075865455 | cpp |
p03239 | #include <bits/stdc++.h>
#define INF (1 << 30)
#define MOD 1000000007
#define l_ength size
using ll = long long;
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int minc = -1;
for (int i = 0; i < N; ++i) {
int c, t;
cin >> c >> t;
if (t <= T) {
minc = min(minc, c);
}
}
if (... | #include <bits/stdc++.h>
#define INF (1 << 30)
#define MOD 1000000007
#define l_ength size
using ll = long long;
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int minc = INF;
for (int i = 0; i < N; ++i) {
int c, t;
cin >> c >> t;
if (t <= T) {
minc = min(minc, c);
}
}
if ... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 1,026,962 | 1,026,963 | u268977772 | cpp |
p03239 | #include <bits/stdc++.h>
//---------------------------
using namespace std;
//---------------------------
#define REP(i, n) for (int i = 0; i < (n); i++)
#define P(x) cout << (x) << "\n"
#define fcout cout << fixed << setprecision(18)
#define MOD 1000000007 // 1e9+7
#define PI 3.1415926535
/*
3.14159265358979323846264... | #include <bits/stdc++.h>
//---------------------------
using namespace std;
//---------------------------
#define REP(i, n) for (int i = 0; i < (n); i++)
#define P(x) cout << (x) << "\n"
#define fcout cout << fixed << setprecision(18)
#define MOD 1000000007 // 1e9+7
#define PI 3.1415926535
/*
3.14159265358979323846264... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,026,964 | 1,026,965 | u421777980 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define pb push_back
#define mp make_pair
int32_t main() {
int n, t;
cin >> n >> t;
int ans = 1e18;
for (int i = 1; i <= n; i++) {
int x, y;
cin >> x >> y;
if (y <= t)
ans = min(ans, x);
}
if (ans = 1e18)
c... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define pb push_back
#define mp make_pair
int32_t main() {
int n, t;
cin >> n >> t;
int ans = 1e18;
for (int i = 1; i <= n; i++) {
int x, y;
cin >> x >> y;
if (y <= t)
ans = min(ans, x);
}
if (ans == 1e18)
... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,026,966 | 1,026,967 | u791542693 | cpp |
p03239 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef int itn;
typede... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef int itn;
typede... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,026,976 | 1,026,977 | u254521846 | cpp |
p03239 | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)m; i <... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)m; i <... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"call.arguments.change"
] | 1,026,980 | 1,026,981 | u352642493 | cpp |
p03239 | // g++ -std=c++11 a.cpp
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#incl... | // g++ -std=c++11 a.cpp
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#incl... | [
"variable_declaration.type.change"
] | 1,026,982 | 1,026,983 | u010004797 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
#define INF_LL (int64)1e18
#define INF (int32)1e9
#define REP(i, n) for (int64 i = 0; i < (n); i++)
#define FOR(i, a, b) for (int64 i = (a); i < (b); i++)
#define all(x) x.begin(), x.end()
#define fs first
#define sc second
using int32 = int_fast32_t;
using uint32 = uint_... | #include <bits/stdc++.h>
using namespace std;
#define INF_LL (int64)1e18
#define INF (int32)1e9
#define REP(i, n) for (int64 i = 0; i < (n); i++)
#define FOR(i, a, b) for (int64 i = (a); i < (b); i++)
#define all(x) x.begin(), x.end()
#define fs first
#define sc second
using int32 = int_fast32_t;
using uint32 = uint_... | [
"literal.string.change",
"io.output.change"
] | 1,026,984 | 1,026,985 | u360980679 | cpp |
p03240 | // Acknowledgement: Xiaoyu Han, for his "brute-force" proposal
#include <algorithm>
#include <cstdio>
#include <cstdlib>
using std::abs;
using std::max;
using std::min;
const int MAXN = 105;
int N, cx, cy, ch = 0, c_point; // c_point: calculable point
int x[MAXN], y[MAXN], h[MAXN];
int main() {
scanf("%d", &N);... | // Acknowledgement: Xiaoyu Han, for his "brute-force" proposal
#include <algorithm>
#include <cstdio>
#include <cstdlib>
using std::abs;
using std::max;
using std::min;
const int MAXN = 105;
int N, cx, cy, ch = 0, c_point; // c_point: calculable point
int x[MAXN], y[MAXN], h[MAXN];
int main() {
scanf("%d", &N);... | [] | 1,026,988 | 1,026,989 | u863370423 | cpp |
p03240 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> x(N), y(N), h(N);
for (int i = 0; i < N; i++) {
cin >> x.at(i) >> y.at(i) >> h.at(i);
}
for (int Cx = 0; Cx <= N; Cx++) {
bool check1 = false;
for (int Cy = 0; Cy <= 100; Cy++) {
int H;
for (int i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> x(N), y(N), h(N);
for (int i = 0; i < N; i++) {
cin >> x.at(i) >> y.at(i) >> h.at(i);
}
for (int Cx = 0; Cx <= 100; Cx++) {
bool check1 = false;
for (int Cy = 0; Cy <= 100; Cy++) {
int H;
for (int... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,026,998 | 1,026,999 | u699600793 | cpp |
p03240 |
#include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <fstream> //ファイルストリーム（標準入力変更用）
#include <functional> //sortのgreater
#include <iomanip> //setprecision(浮動小数点の出力の誤差)
#include <iostream> ... |
#include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <fstream> //ファイルストリーム（標準入力変更用）
#include <functional> //sortのgreater
#include <iomanip> //setprecision(浮動小数点の出力の誤差)
#include <iostream> ... | [
"literal.number.change",
"call.arguments.change"
] | 1,027,006 | 1,027,007 | u889915625 | cpp |
p03240 | #include <bits/stdc++.h>
#include <string>
#include <vector>
using namespace std;
int N, H;
int x[100], y[100], h[100], d[100];
int main() {
cin >> N;
int cx, cy;
for (int i = 0; i < N; i++) {
cin >> x[i] >> y[i] >> h[i];
}
int xs, ys, hs;
for (int i = 0; i < N; i++) {
if (h[i] > 0) {
xs = x... | #include <bits/stdc++.h>
//#include <iostream>
#include <string>
#include <vector>
using namespace std;
int N, H;
int x[100], y[100], h[100], d[100];
int main() {
cin >> N;
int cx, cy;
for (int i = 0; i < N; i++) {
cin >> x[i] >> y[i] >> h[i];
}
int xs, ys, hs;
for (int i = 0; i < N; i++) {
if (h[... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 1,027,010 | 1,027,011 | u012298376 | cpp |
p03239 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
typedef l... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
typedef l... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,027,023 | 1,027,024 | u399527088 | cpp |
p03239 | #include <bits/stdc++.h>
struct time {
int cost;
int time;
int a;
};
int main() {
int n, t;
int count = 0;
std::cin >> n >> t;
struct time a[n];
for (int i = 0; i < n; ++i) {
std::cin >> a[i].cost >> a[i].time;
if (a[i].time > t) {
a[i].a = 1;
} else {
a[i].a = 0;
++count... | #include <bits/stdc++.h>
struct time {
int cost;
int time;
int a;
};
int main() {
int n, t;
int count = 0;
std::cin >> n >> t;
struct time a[n];
for (int i = 0; i < n; ++i) {
std::cin >> a[i].cost >> a[i].time;
if (a[i].time > t) {
a[i].a = 1;
} else {
a[i].a = 0;
++count... | [
"assignment.value.change"
] | 1,027,029 | 1,027,030 | u535202049 | cpp |
p03239 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
ios::sync_with_stdio(false);
int num, time, i, rec;
cin >> num >> time;
int c[num], t[num];
for (i = 0; i < num; i++)
cin >> c[i] >> t[i];
rec = 10000;
for (i = 0; i < num; i++) {
if (rec > c[i] && t[i] < time) {
rec... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
ios::sync_with_stdio(false);
int num, time, i, rec;
cin >> num >> time;
int c[num], t[num];
for (i = 0; i < num; i++)
cin >> c[i] >> t[i];
rec = 10000;
for (i = 0; i < num; i++) {
if (rec > c[i] && t[i] <= time) {
re... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,027,031 | 1,027,032 | u809278162 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define INF 1e9
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
int T;
int c[110], t[110];
cin >> N >> T;
REP(i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define INF 1e9
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
int T;
int c[110], t[110];
cin >> N >> T;
REP(i... | [
"variable_declaration.add",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change"
] | 1,027,033 | 1,027,034 | u810671118 | cpp |
p03239 | #include <bits/stdc++.h>
#define inf 0x7fffffff
#define rint register int
#define rep(i, u, z) for (rint i = u; i <= z; ++i)
using namespace std;
typedef long long ll;
int main() {
int n;
ll t;
scanf("%d%lld", &n, &t);
ll ans = inf;
rep(i, 1, n) {
ll a, b;
scanf("%lld%lld", &a, &b);
if (a <= t) ... | #include <bits/stdc++.h>
#define inf 0x7fffffff
#define rint register int
#define rep(i, u, z) for (rint i = u; i <= z; ++i)
using namespace std;
typedef long long ll;
int main() {
int n;
ll t;
scanf("%d%lld", &n, &t);
ll ans = inf;
rep(i, 1, n) {
ll a, b;
scanf("%lld%lld", &a, &b);
if (b <= t) ... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"call.arguments.change"
] | 1,027,053 | 1,027,054 | u837080674 | cpp |
p03239 | #include <iostream>
using namespace std;
int main() {
int n, t;
cin >> n >> t;
int c[1010], a[1010], ans = 1010;
for (int i = 0; i < n; i++) {
cin >> c[i] >> a[i];
if (a[i] <= t) {
if (c[i] < ans)
ans = c[i];
}
}
if (ans == 0)
cout << "TLE" << endl;
else
cout << ans << en... | #include <iostream>
using namespace std;
int main() {
int n, t;
cin >> n >> t;
int c[1010], a[1010], ans = 1010;
for (int i = 0; i < n; i++) {
cin >> c[i] >> a[i];
if (a[i] <= t) {
if (c[i] < ans)
ans = c[i];
}
}
if (ans == 1010)
cout << "TLE" << endl;
else
cout << ans <<... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,027,058 | 1,027,059 | u330689597 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
#define FOR(i, b, e) for (int i = (b); i < (e); ++i)
#define RFOR(i, b, e) for (int i = ((e)-1); (b) <= i; --i)
#define REP(i, N) for (int i = 0; i < (N); ++i)
#define RREP(i, N) for (int i = ((N)-1); 0 <= i; --i)
#define scanInt(x) ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
#define FOR(i, b, e) for (int i = (b); i < (e); ++i)
#define RFOR(i, b, e) for (int i = ((e)-1); (b) <= i; --i)
#define REP(i, N) for (int i = 0; i < (N); ++i)
#define RREP(i, N) for (int i = ((N)-1); 0 <= i; --i)
#define scanInt(x) ... | [] | 1,027,061 | 1,027,062 | u977652465 | cpp |
p03239 | #include <iostream>
using namespace std;
int main() {
int n, t;
cin >> n >> t;
int ans = 1001;
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
if (y < t && x < ans)
ans = x;
}
if (ans == 1001) {
cout << "TLE";
return 0;
}
cout << ans;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, t;
cin >> n >> t;
int ans = 1001;
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
if (y <= t && x < ans)
ans = x;
}
if (ans == 1001) {
cout << "TLE";
return 0;
}
cout << ans;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,027,065 | 1,027,066 | u137578988 | cpp |
p03239 | #include <iostream>
#include <string>
using namespace std;
int main(void) {
int n, t;
cin >> n >> t;
int min = 1001;
for (int i = 0; i < n; i++) {
int ci, ti;
cin >> ci >> ti;
if (ci < min && ti <= t) {
min = ci;
}
}
if (n == 1001) {
cout << "TLE" << endl;
} else {
cout << m... | #include <iostream>
#include <string>
using namespace std;
int main(void) {
int n, t;
cin >> n >> t;
int min = 1001;
for (int i = 0; i < n; i++) {
int ci, ti;
cin >> ci >> ti;
if (ci < min && ti <= t) {
min = ci;
}
}
if (min == 1001) {
cout << "TLE" << endl;
} else {
cout <<... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,027,071 | 1,027,072 | u158758819 | cpp |
p03239 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, T;
int temp;
vector<int> c, t;
cin >> N >> T;
for (int i = 0; i < N; i++) {
cin >> temp;
c.push_back(temp);
cin >> temp;
t.push_back(temp);
}
temp = 1001;
for (int i = 0; i < N; i++) {
if (t[i] < ... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, T;
int temp;
vector<int> c, t;
cin >> N >> T;
for (int i = 0; i < N; i++) {
cin >> temp;
c.push_back(temp);
cin >> temp;
t.push_back(temp);
}
temp = 1001;
for (int i = 0; i < N; i++) {
if (t[i] <=... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,027,081 | 1,027,082 | u216541559 | cpp |
p03239 | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int n, a[10001], b[10001], t;
int ans = 100000, bns = 0;
int main() {
scanf("%d%d", &n, &t);
for (int i = 1; i <= n; i++) {
scanf("%d %d", &a[i], &b[i]);
}
for (int i = 1; i <= n; i++) {
if (b[i] <= t) {
ans = min(ans,... | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int n, a[10001], b[10001], t;
int ans = 100000, bns = 0;
int main() {
scanf("%d%d", &n, &t);
for (int i = 1; i <= n; i++) {
scanf("%d %d", &a[i], &b[i]);
}
for (int i = 1; i <= n; i++) {
if (b[i] <= t) {
ans = min(ans,... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change"
] | 1,027,085 | 1,027,086 | u754922388 | cpp |
p03239 | #include <stdio.h>
int main() {
int n, t, min = 1001;
int gc, gt;
scanf("%d %d", &n, &t);
for (int i = 0; i < n; i++) {
scanf("%d,%d", &gc, >);
if (gt <= t && gc < min) {
min = gc;
}
}
if (min == 1001) {
printf("TLE\n");
} else {
printf("%d\n", min);
}
return 0;
}
| #include <stdio.h>
int main() {
int n, t, min = 1001;
int gc, gt, i;
scanf("%d %d", &n, &t);
for (i = 0; i < n; i++) {
scanf("%d %d", &gc, >);
if (gt <= t && gc < min) {
min = gc;
}
}
if (min == 1001) {
printf("TLE\n");
} else {
printf("%d\n", min);
}
return 0;
}
| [
"variable_declaration.add",
"literal.string.change",
"call.arguments.change"
] | 1,027,091 | 1,027,092 | u209927535 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
int n, t;
int x, y;
int main() {
scanf("%d%d", &n, &t);
int ans = 100000;
for (int i = 1; i <= n; i++) {
scanf("%d%d", &x, &y);
if (y <= t)
ans = min(ans, x);
}
if (x > 1000)
printf("TLE\n");
else
printf("%d\n", ans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int n, t;
int x, y;
int main() {
scanf("%d%d", &n, &t);
int ans = 100000;
for (int i = 1; i <= n; i++) {
scanf("%d%d", &x, &y);
if (y <= t)
ans = min(ans, x);
}
if (ans > 1000)
printf("TLE\n");
else
printf("%d\n", ans);
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,027,093 | 1,027,094 | u320128666 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.