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 <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
using namespace std;
#define li long long int
#define ld long double
const int MX1 = 1e5 + 5;
const int MX2 = 1e6 + 5;
const li inf = 4e18;
const li mod = 1e9 + 7;
li power(li a, li b) {
li res = 1;
while (b) {
if (b % 2)
re... | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
using namespace std;
#define li long long int
#define ld long double
const int MX1 = 1e5 + 5;
const int MX2 = 1e6 + 5;
const li inf = 4e18;
const li mod = 1e9 + 7;
li power(li a, li b) {
li res = 1;
while (b) {
if (b % 2)
re... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 1,027,101 | 1,027,102 | u712860984 | cpp |
p03239 | #include <iostream>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
int n, t;
cin >> n >> t;
int odp = 100000;
for (int i = 0; i < n; ++i) {
int cost, czas;
cin >> cost >> czas;
if (czas <= t)
odp = min(odp, cost);
}
if (odp = 100000)
cout << "TLE";
else
cout ... | #include <iostream>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
int n, t;
cin >> n >> t;
int odp = 100000;
for (int i = 0; i < n; ++i) {
int cost, czas;
cin >> cost >> czas;
if (czas <= t)
odp = min(odp, cost);
}
if (odp == 100000)
cout << "TLE";
else
cout... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,027,112 | 1,027,113 | u535773602 | cpp |
p03239 | #include <bits/stdc++.h>
using namespace std;
const int inf = 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)
ans = min(ans, t);
}
if (ans == inf)
cout << "TLE";
else
cout << ans;
cout << endl;
retur... | #include <bits/stdc++.h>
using namespace std;
const int inf = 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)
ans = min(ans, c);
}
if (ans == inf)
cout << "TLE";
else
cout << ans;
cout << endl;
retur... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 1,027,114 | 1,027,115 | u216962796 | cpp |
p03239 | #define MAXN 100000 + 15
#include <stdio.h>
int a[MAXN] = {0}, b[MAXN] = {0}, c[MAXN] = {0};
int main() {
int n, t;
scanf("%d%d", &n, &t);
for (int i = 0; i < n; i++) {
scanf("%d%d", &a[i], &b[i]);
}
int min = 0x3f3f3f3f;
int flag = 0;
for (int i = 0; i < n; i++) {
if (b[i] < t) {
flag = 1;... | #define MAXN 100000 + 15
#include <stdio.h>
int a[MAXN] = {0}, b[MAXN] = {0}, c[MAXN] = {0};
int main() {
int n, t;
scanf("%d%d", &n, &t);
for (int i = 0; i < n; i++) {
scanf("%d%d", &a[i], &b[i]);
}
int min = 0x3f3f3f3f;
int flag = 0;
for (int i = 0; i < n; i++) {
if (b[i] <= t) {
flag = 1... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,027,118 | 1,027,119 | u624688258 | cpp |
p03239 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int min = 10000;
for (int i = 0; i < N; i++) {
int c, t;
cin >> c >> t;
if (t <= T && c < min) {
min = c;
}
}
if (min <= T) {
cout << min << "\n";
} else {
cout << "TLE"
... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int min = 10000;
for (int i = 0; i < N; i++) {
int c, t;
cin >> c >> t;
if (t <= T && c < min) {
min = c;
}
}
if (min < 10000) {
cout << min << "\n";
} else {
cout << "TLE"
... | [] | 1,027,135 | 1,027,136 | u087805899 | cpp |
p03239 | #include <algorithm>
#include <iostream>
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 <= T) {
cout << min << "\n";
} else {
cout << "TLE"
... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int min = 10000;
for (int i = 0; i < N; i++) {
int c, t;
cin >> c >> t;
if (t <= T && c < min) {
min = c;
}
}
if (min < 10000) {
cout << min << "\n";
} else {
cout << "TLE"
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,027,137 | 1,027,136 | u087805899 | cpp |
p03239 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int min = T + 1;
for (int i = 0; i < N; i++) {
int c, t;
cin >> c >> t;
if (t <= T && c < min) {
min = c;
}
}
if (min <= T) {
cout << min << "\n";
} else {
cout << "TLE"
... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int min = 10000;
for (int i = 0; i < N; i++) {
int c, t;
cin >> c >> t;
if (t <= T && c < min) {
min = c;
}
}
if (min < 10000) {
cout << min << "\n";
} else {
cout << "TLE"
... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 1,027,138 | 1,027,136 | u087805899 | cpp |
p03239 | // https://beta.atcoder.jp/contests/abc112/tasks/abc112_d
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#ifdef BTK
#define DEBUG if (1)
#else
#define CIN_ONLY if (1)
struct cww {
cww() {
CIN_ONLY {
ios::sync_with_stdio(false);
cin.tie(0);
}
}
} star;
#define DEBUG if (0)
... | // https://beta.atcoder.jp/contests/abc112/tasks/abc112_b
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#ifdef BTK
#define DEBUG if (1)
#else
#define CIN_ONLY if (1)
struct cww {
cww() {
CIN_ONLY {
ios::sync_with_stdio(false);
cin.tie(0);
}
}
} star;
#define DEBUG if (0)
... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 1,027,152 | 1,027,153 | u613658617 | cpp |
p03239 | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#define INF 1e9
#define EPS 1e-9
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP1(i, n) for (ll i = 1, i##_len = (n); i <= i##_len; ++i)
#define REPR(i, n) for (ll i = (n)-1; i >= 0; --i)
#define REPR1(i, n) for (ll i = (n); i > 0; -... | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#define INF 1e9
#define EPS 1e-9
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP1(i, n) for (ll i = 1, i##_len = (n); i <= i##_len; ++i)
#define REPR(i, n) for (ll i = (n)-1; i >= 0; --i)
#define REPR1(i, n) for (ll i = (n); i > 0; -... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,027,156 | 1,027,157 | u388817534 | cpp |
p03239 | #include <stdio.h>
int main() {
int n, T, c, t, i, f = 0;
scanf("%d %d", &n, &T);
for (i = 1; i <= n; i++) {
scanf("%d %d", &c, &t);
if (t <= T && c <= 10001)
f = c;
}
if (f == 0)
printf("TLE\n");
else
printf("%d\n", f);
return 0;
} | #include <stdio.h>
int main() {
int n, T, c, t, i, f = 10000;
scanf("%d %d", &n, &T);
for (i = 1; i <= n; i++) {
scanf("%d %d", &c, &t);
if (t <= T && c < f)
f = c;
}
if (f == 10000)
printf("TLE\n");
else
printf("%d\n", f);
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.condition.change",
"control_flow.branch.if.condition.change"
] | 1,027,169 | 1,027,170 | u495771817 | cpp |
p03239 | #include <iostream>
#include <limits>
#include <tuple>
#include <vector>
using namespace std;
int main() {
vector<pair<int, int>> v;
int N, T;
scanf("%d %d", &N, &T);
for (int i = 0; i < N; i++) {
int a, b;
scanf("%d %d", &a, &b);
if (b > T) {
continue;
}
v.push_back({a, b});
}
i... | #include <iostream>
#include <limits>
#include <tuple>
#include <vector>
using namespace std;
int main() {
vector<pair<int, int>> v;
int N, T;
scanf("%d %d", &N, &T);
for (int i = 0; i < N; i++) {
int a, b;
scanf("%d %d", &a, &b);
if (b > T) {
continue;
}
v.push_back({a, b});
}
i... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 1,027,184 | 1,027,185 | u780184398 | cpp |
p03239 |
#include <iostream>
using namespace std;
int main() {
int N, T;
cin >> N;
cin >> T;
int ci, ti;
int answer;
answer = 1001;
for (int i = 0; i < N; i++) {
cin >> ci;
cin >> ti;
if (ti < T) {
if (answer > ci) {
answer = ci;
}
}
}
if (answer == 1001) {
cout << "... |
#include <iostream>
using namespace std;
int main() {
int N, T;
cin >> N;
cin >> T;
int ci, ti;
int answer;
answer = 1001;
for (int i = 0; i < N; i++) {
cin >> ci;
cin >> ti;
if (ti <= T) {
if (answer > ci) {
answer = ci;
}
}
}
if (answer == 1001) {
cout << ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,027,193 | 1,027,194 | u567956966 | cpp |
p03239 |
#include <iostream>
using namespace std;
int main() {
int N, T;
cin >> N;
cin >> T;
int ci, ti;
int answer;
answer = 1001;
for (int i = 0; i <= N; i++) {
cin >> ci;
cin >> ti;
if (ti < T) {
if (answer > ci) {
answer = ci;
}
}
}
if (answer == 1001) {
cout << "... |
#include <iostream>
using namespace std;
int main() {
int N, T;
cin >> N;
cin >> T;
int ci, ti;
int answer;
answer = 1001;
for (int i = 0; i < N; i++) {
cin >> ci;
cin >> ti;
if (ti <= T) {
if (answer > ci) {
answer = ci;
}
}
}
if (answer == 1001) {
cout << ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 1,027,195 | 1,027,194 | u567956966 | cpp |
p03239 | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
#include <climits>
#include <cmath>
#include <cstdlib>
//#include <stdio.h>
//#include <stdlib.h>
//#include "show_vector.hh"
using namespace std;
#define debug false
int main(int argc, char *argv[]) {
vector<pair<int, int>> cand;
int N... | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
#include <climits>
#include <cmath>
#include <cstdlib>
//#include <stdio.h>
//#include <stdlib.h>
//#include "show_vector.hh"
using namespace std;
#define debug false
int main(int argc, char *argv[]) {
vector<pair<int, int>> cand;
int N... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,027,198 | 1,027,199 | u568299363 | cpp |
p03239 | #include <bits/stdc++.h>
int main() {
int N, T;
std::cin >> N >> T;
int ans = 1001;
for (int i = 0; i < N; i++) {
int t, c;
std::cin >> t >> c;
if (t <= T) {
ans = std::min(ans, c);
}
}
std::cout << (ans == 1001 ? "TLE" : std::to_string(ans)) << std::endl;
return 0;
} | #include <bits/stdc++.h>
int main() {
int N, T;
std::cin >> N >> T;
int ans = 1001;
for (int i = 0; i < N; i++) {
int t, c;
std::cin >> c >> t;
if (t <= T) {
ans = std::min(ans, c);
}
}
std::cout << (ans == 1001 ? "TLE" : std::to_string(ans)) << std::endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 1,027,204 | 1,027,205 | u603303736 | cpp |
p03240 | #include <algorithm>
#include <array>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctype.h>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stac... | #include <algorithm>
#include <array>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctype.h>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stac... | [
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 1,027,299 | 1,027,300 | u224756887 | cpp |
p03240 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
int x[N], y[N], h[N];
for (int i = 0; i < N; i++) {
cin >> x[i] >> y[i] >> h[i];
}
map<int, int> m;
vector<vector<int>> d;
for (int cx = 0; cx <= 100; cx++) {
for (int cy = 0; cy <= 100; cy++) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
int x[N], y[N], h[N];
for (int i = 0; i < N; i++) {
cin >> x[i] >> y[i] >> h[i];
}
map<int, int> m;
vector<vector<int>> d;
for (int cx = 0; cx <= 100; cx++) {
for (int cy = 0; cy <= 100; cy++) {
... | [
"call.add",
"control_flow.branch.if.condition.change"
] | 1,027,303 | 1,027,304 | u634209474 | cpp |
p03240 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
#define ll long long
#define IO ... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
#define ll long long
#define IO ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 1,027,335 | 1,027,336 | u915401678 | cpp |
p03240 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
void s... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
void s... | [
"io.output.change",
"identifier.change"
] | 1,027,343 | 1,027,344 | u280175105 | cpp |
p03240 | #include <algorithm>
#include <bitset>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
#define db double
#define vi vector<int>
#define pb push_back
#define popb pop_back
#define fi first
#define se second
#define ll long long
#define ld lo... | #include <algorithm>
#include <bitset>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
#define db double
#define vi vector<int>
#define pb push_back
#define popb pop_back
#define fi first
#define se second
#define ll long long
#define ld lo... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,027,353 | 1,027,354 | u302934691 | cpp |
p03240 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define a first
#define b second
#define sz size()
#define pb(x) push_back(x)
#define bg begin()
#define ed end()
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rep1(i, n) for (ll i = 1; i <= n; i++)
#define mp(x, y) make... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define a first
#define b second
#define sz size()
#define pb(x) push_back(x)
#define bg begin()
#define ed end()
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rep1(i, n) for (ll i = 1; i <= n; i++)
#define mp(x, y) make... | [
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.arithmetic.change"
] | 1,027,381 | 1,027,382 | u527058497 | cpp |
p03240 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, i, j, k, x, H, xx;
cin >> n;
long long int X[n], Y[n], h[n];
int indx = 0;
for (i = 0; i < n; i++) {
cin >> X[i] >> Y[i] >> h[i];
if (h[i] > 0) {
indx = i;
break;
}
}
for (i = 0; i <= 100; i++) {
for (... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, i, j, k, x, H, xx;
cin >> n;
long long int X[n], Y[n], h[n];
int indx;
for (i = 0; i < n; i++) {
cin >> X[i] >> Y[i] >> h[i];
if (h[i] > 0) {
indx = i;
}
}
for (i = 0; i <= 100; i++) {
for (j = 0; j <= 100; ... | [] | 1,027,383 | 1,027,384 | u883726083 | cpp |
p03240 | #include <bits/stdc++.h>
using namespace std;
template <typename A, typename B> string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const st... | #include <bits/stdc++.h>
using namespace std;
template <typename A, typename B> string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const st... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 1,027,395 | 1,027,396 | u223160139 | cpp |
p03240 | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> x(N);
vector<int> y(N);
vector<int> h(N);
int i = 0;
int Max = 0;
long min = 10e9;
while (i < N) {
cin >> x[i] >> y[i] >> h[i];
if (h[i] < min)
mi... | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> x(N);
vector<int> y(N);
vector<int> h(N);
int i = 0;
int Max = 0;
long min = 10e9;
while (i < N) {
cin >> x[i] >> y[i] >> h[i];
if (h[i] < min)
mi... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 1,027,403 | 1,027,404 | u456303471 | cpp |
p03240 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int X[N], Y[N];
int H[N];
int tempH;
for (int i = 0; i < N; i++) {
cin >> X[i] >> Y[i] >> H[i];
}
int ix = 0;
for (int i = 0; i < N; i++) {
if (H[i] != 0) {
ix = i;
break;
}
}
// cout<<ix<<endl;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int X[N], Y[N];
int H[N];
int tempH;
for (int i = 0; i < N; i++) {
cin >> X[i] >> Y[i] >> H[i];
}
int ix = 0;
for (int i = 0; i < N; i++) {
if (H[i] != 0) {
ix = i;
break;
}
}
// cout<<ix<<endl;
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change"
] | 1,027,405 | 1,027,406 | u469315559 | cpp |
p03240 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(int argc, const char *argv[]) {
int n;
cin >> n;
vector<array<ll, 3>> vp;
int idx;
for (int i = 0; i < n; ++i) {
int x, y, h;
cin >> x >> y >> h;
vp.push_back({x, y, h});
if (h > 0) {
idx = i;
}
}
fo... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(int argc, const char *argv[]) {
int n;
cin >> n;
vector<array<ll, 3>> vp;
int idx;
for (int i = 0; i < n; ++i) {
int x, y, h;
cin >> x >> y >> h;
vp.push_back({x, y, h});
if (h > 0) {
idx = i;
}
}
fo... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,027,433 | 1,027,434 | u289545075 | cpp |
p03240 | #include <bits/stdc++.h>
#include <iostream>
#include <numeric>
#include <queue>
#include <vector>
#define mod 1000000007
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define srep(i, s, t) for (ll i = s; i < t; i++)
#define drep(i, n) for (ll i = (n)-1; i >= 1; i--)
using namespace std;
typedef long long ll;
typedef ... | #include <bits/stdc++.h>
#include <iostream>
#include <numeric>
#include <queue>
#include <vector>
#define mod 1000000007
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define srep(i, s, t) for (ll i = s; i < t; i++)
#define drep(i, n) for (ll i = (n)-1; i >= 1; i--)
using namespace std;
typedef long long ll;
typedef ... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 1,027,453 | 1,027,454 | u972487926 | cpp |
p03240 | #include <algorithm>
#include <algorithm>
#include <bits/stdc++.h>
#include <fstream>
#include <iostream>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#define ll long long int
#define ull unsigned long long int
#define I(a) scanf("%d", &a)
#define I2(a, b) sc... | #include <algorithm>
#include <algorithm>
#include <bits/stdc++.h>
#include <fstream>
#include <iostream>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#define ll long long int
#define ull unsigned long long int
#define I(a) scanf("%d", &a)
#define I2(a, b) sc... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,027,218 | 1,027,219 | u449403739 | cpp |
p03240 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
void init() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setpre... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
void init() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setpre... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 1,027,228 | 1,027,229 | u145483532 | cpp |
p03240 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int inf = 1e9 + 7;
const ll longinf = 5LL << 60;
const ll mod = 1e9 + 7;
int main() {
ll N;
cin >> N;
ll x[N], y[N], h[N];
for (int i = 0; i < N; i++)
cin >> x[i] >> y[i] >> h[i];
int start;
for (int i = 0; i < N; i++)
if (h[... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int inf = 1e9 + 7;
const ll longinf = 5LL << 60;
const ll mod = 1e9 + 7;
int main() {
ll N;
cin >> N;
ll x[N], y[N], h[N];
for (int i = 0; i < N; i++)
cin >> x[i] >> y[i] >> h[i];
int start;
for (int i = 0; i < N; i++)
if (h[... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,027,247 | 1,027,248 | u872581897 | cpp |
p03240 | #include <algorithm>
#include <cmath>
#include <stdio.h>
using namespace std;
int main() {
int N, x[110], y[110], H, count = 0, k = 0;
long long int h[110];
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%d%d%lld", &x[i], &y[i], &h[i]);
}
for (int i = 0; i <= 100; i++) {
for (int j = 0; j <=... | #include <algorithm>
#include <cmath>
#include <stdio.h>
using namespace std;
int main() {
int N, x[110], y[110], H, count = 0, k = 0;
long long int h[110];
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%d%d%lld", &x[i], &y[i], &h[i]);
}
for (int i = 0; i <= 100; i++) {
for (int j = 0; j <=... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change"
] | 1,027,249 | 1,027,250 | u475843109 | cpp |
p03240 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>
#define... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>
#define... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 1,027,259 | 1,027,260 | u880221923 | cpp |
p03240 | #include <bits/stdc++.h>
#define REP(i, n) for (long long i = 0; i < n; i++)
#define REPR(i, n) for (long long i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (long long i = m; i <= n; i++)
#define FORR(i, m, n) for (long long i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.en... | #include <bits/stdc++.h>
#define REP(i, n) for (long long i = 0; i < n; i++)
#define REPR(i, n) for (long long i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (long long i = m; i <= n; i++)
#define FORR(i, m, n) for (long long i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.en... | [
"variable_declaration.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove",
"expression.operator.compare.change"
] | 1,027,272 | 1,027,273 | u557565572 | cpp |
p03240 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265358979323846
#define int long long
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr long long INFL = numeric_limits<long long>::max() / 2;
constexpr int MOD = 1000000007;
using Graph = ve... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265358979323846
#define int long long
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr long long INFL = numeric_limits<long long>::max() / 2;
constexpr int MOD = 1000000007;
using Graph = ve... | [
"control_flow.branch.if.condition.change"
] | 1,027,278 | 1,027,279 | u093973314 | cpp |
p03240 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
#define VI vector<int>
#define MOD 1000000007
using ll = long long int;
using P = pair<int, int>;
template <class T> bool chmax(T &a, const T &b) {
... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
#define VI vector<int>
#define MOD 1000000007
using ll = long long int;
using P = pair<int, int>;
template <class T> bool chmax(T &a, const T &b) {
... | [
"identifier.change",
"io.output.change"
] | 1,027,287 | 1,027,288 | u868089307 | cpp |
p03240 | #include <iostream>
#include <vector>
using namespace std;
int main() {
long N;
cin >> N;
vector<long> x(N), y(N), h(N);
for (long i = 0; i < N; i++) {
cin >> x[i] >> y[i] >> h[i];
}
long ansx = 0, ansy = 0;
long tmp = -1;
for (long cx = 0; cx < 101; cx++) {
for (long cy = 0; cy < 101; cy++) ... | #include <iostream>
#include <vector>
using namespace std;
int main() {
long N;
cin >> N;
vector<long> x(N), y(N), h(N);
for (long i = 0; i < N; i++) {
cin >> x[i] >> y[i] >> h[i];
}
long ansx = 0, ansy = 0;
long tmp = -1;
for (long cx = 0; cx < 101; cx++) {
for (long cy = 0; cy < 101; cy++) ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 1,027,487 | 1,027,488 | u015564739 | cpp |
p03240 | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
int main() {
int N;
cin >> N;
vector<int> x(N);
vector<int> y(N);
vector<ll> h(N);
ll hmin = 100100100100;
for (int ii = 0; ii < N; ++ii) {
cin >> x[ii] >> y[ii] >> h[ii];
hmin = min(hmin, h[ii]);... | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
int main() {
int N;
cin >> N;
vector<int> x(N);
vector<int> y(N);
vector<ll> h(N);
ll hmin = 100100100100;
for (int ii = 0; ii < N; ++ii) {
cin >> x[ii] >> y[ii] >> h[ii];
hmin = min(hmin, h[ii]);... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,027,506 | 1,027,507 | u762158020 | cpp |
p03240 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
// output
#define SPBR(w, n) std::cout << (w... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
// output
#define SPBR(w, n) std::cout << (w... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 1,027,516 | 1,027,517 | u812973725 | cpp |
p03240 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
// output
#define SPBR(w, n) std::cout << (w... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
// output
#define SPBR(w, n) std::cout << (w... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.return.add",
"control_flow.return.0.add"
] | 1,027,518 | 1,027,517 | u812973725 | cpp |
p03240 | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; i--)
#define ir... | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; i--)
#define ir... | [
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 1,027,525 | 1,027,526 | u530107518 | cpp |
p03240 | #include <bits/stdc++.h>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i)
#define pb push_back
#define eb emplace_back
#define all(x) x.b... | #include <bits/stdc++.h>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i)
#define pb push_back
#define eb emplace_back
#define all(x) x.b... | [
"misc.opposites",
"variable_declaration.value.change"
] | 1,027,543 | 1,027,544 | u698883164 | cpp |
p03240 | #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;
cin >> n;
vector<int> x(n), y(n), h(n);
rep(i, n) cin >> x[i] >> y[i] >> h[i];
rep(cx, 101) rep(cy, 101) {
int before = -1;
rep(i, n) {
if (h[i] > 0) {
... | #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;
cin >> n;
vector<int> x(n), y(n), h(n);
rep(i, n) cin >> x[i] >> y[i] >> h[i];
rep(cx, 101) rep(cy, 101) {
int before = -1;
rep(i, n) {
if (h[i] > 0) {
... | [
"control_flow.break.add"
] | 1,027,566 | 1,027,567 | u131625544 | cpp |
p03240 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a ... | [
"literal.number.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 1,027,590 | 1,027,591 | u989306199 | cpp |
p03240 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
#define dunk(a) cout << (a) << endl
#define rall(a) (a).rbegin(), (a).rend()
const int INF = 2e9;
using namespace std;
using Graph = vector<vector<int>>;
typedef pair<int, int> P;
typedef long long ll;
int mai... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
#define dunk(a) cout << (a) << endl
#define rall(a) (a).rbegin(), (a).rend()
const int INF = 2e9;
using namespace std;
using Graph = vector<vector<int>>;
typedef pair<int, int> P;
typedef long long ll;
int mai... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo",
"control_flow.return.add",
"control_flow.return.0.add"
] | 1,027,596 | 1,027,595 | u454081619 | 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[i] >> y[i] >> h[i];
}
int MAX = 100;
for (int posY = 0; posY < MAX; posY++) {
for (int posX = 0; posX < MAX; posX++) {
int needH = -1;
fo... | #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[i] >> y[i] >> h[i];
}
int MAX = 100;
for (int posY = 0; posY <= MAX; posY++) {
for (int posX = 0; posX <= MAX; posX++) {
int needH = -1;
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 1,027,607 | 1,027,608 | u087189096 | 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[i] >> y[i] >> h[i];
}
int MAX = 100;
for (int posY = 0; posY < MAX; posY++) {
for (int posX = 0; posX < MAX; posX++) {
int needH = -1;
fo... | #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[i] >> y[i] >> h[i];
}
int MAX = 100;
for (int posY = 0; posY <= MAX; posY++) {
for (int posX = 0; posX <= MAX; posX++) {
int needH = -1;
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,027,609 | 1,027,608 | u087189096 | cpp |
p03240 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> X(N);
vector<int> Y(N);
vector<int> H(N);
tuple<int, int, int> check;
for (int i = 0; i < N; i++) {
cin >> X[i] >> Y[i] >> H[i];
if (H[i] > 0) {
check = make_tuple(X[i], Y[i], H[i]); //これは高さの答がゼロになるのを防ぐ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> X(N);
vector<int> Y(N);
vector<int> H(N);
tuple<int, int, int> check;
for (int i = 0; i < N; i++) {
cin >> X[i] >> Y[i] >> H[i];
if (H[i] > 0) {
check = make_tuple(X[i], Y[i], H[i]); //これは高さの答がゼロになるのを防ぐ... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 1,027,610 | 1,027,611 | u843292252 | cpp |
p03240 | #include <bits/stdc++.h>
typedef long long int lint;
#define PI acos(-1)
#define INF64 1LL << 60
#define INF32 1 << 29
#define LIMIT(d_in, d_min, d_max) max(d_min, min(d_max, d_in))
#define all(a) (a).begin(), (a).end()
#define INV ((long long int)1000000007)
using namespace std;
void execute() {
int N;
cin >> N... | #include <bits/stdc++.h>
typedef long long int lint;
#define PI acos(-1)
#define INF64 1LL << 60
#define INF32 1 << 29
#define LIMIT(d_in, d_min, d_max) max(d_min, min(d_max, d_in))
#define all(a) (a).begin(), (a).end()
#define INV ((long long int)1000000007)
using namespace std;
void execute() {
int N;
cin >> N... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,027,652 | 1,027,653 | u874525170 | cpp |
p03240 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int main() {
int n, x, y, h;
cin >> n;
vector<tuple<int, int, int>> v(n);
rep(i, n) {
int p, q, r;
cin >> p >> q >> r;
v[i] = make_tuple(r, p, q);
}
sort(v.begin(), v.end());
bool b;
rep(i, 101) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int main() {
int n, x, y, h;
cin >> n;
vector<tuple<int, int, int>> v(n);
rep(i, n) {
int p, q, r;
cin >> p >> q >> r;
v[i] = make_tuple(r, p, q);
}
sort(v.begin(), v.end());
bool b;
rep(i, 101) {
... | [] | 1,027,659 | 1,027,660 | u757584836 | cpp |
p03240 | #include <iostream>
#include <stdlib.h>
using namespace std;
int main() {
int N, i, j, k, l, sta_x, sta_y, sta_z, sta_switch = 0, check = 0,
x[105] = {}, y[105] = {};
long hight, l_hight, z[105] = {};
cin >> N;
for (i = 0; i < N; i++) {
cin >> x[i] >> y[i] >> z[i];... | #include <iostream>
#include <stdlib.h>
using namespace std;
int main() {
int N, i, j, k, l, sta_x, sta_y, sta_z, sta_switch = 0, check = 0,
x[105] = {}, y[105] = {};
long hight, l_hight, z[105] = {};
cin >> N;
for (i = 0; i < N; i++) {
cin >> x[i] >> y[i] >> z[i];... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,027,672 | 1,027,673 | u754363329 | cpp |
p03240 | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,027,681 | 1,027,682 | u487060019 | cpp |
p03240 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
bool solve(int CX, int CY, vector<vector<int>> &G, int N) {
int htmp;
for (int i = 0; i < N; i++) {
if (G.at(i).at(2) != 0) {
htmp = G.at(i).at(2) + abs(G.at(i).at(0) - CX) + abs(G.at(i).at(1) - CY);
}
}
bool ptmp = true;
for (... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
bool solve(int CX, int CY, vector<vector<int>> &G, int N) {
int htmp;
for (int i = 0; i < N; i++) {
if (G.at(i).at(2) != 0) {
htmp = G.at(i).at(2) + abs(G.at(i).at(0) - CX) + abs(G.at(i).at(1) - CY);
}
}
bool ptmp = true;
for (... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,027,752 | 1,027,753 | u176979814 | cpp |
p03240 | #include <cmath>
#include <iostream>
using namespace std;
typedef long long ll;
void swap(ll i, ll j, ll *a) {
int tmp = a[i];
a[i] = a[j];
a[j] = tmp;
}
void b_sort(ll n, ll *x, ll *y, ll *h) {
int i, j;
for (i = 0; i < n; i++) {
for (j = n - 1; j > i; j--) {
if (h[j - 1] < h[j]) {
swap... | #include <cmath>
#include <iostream>
using namespace std;
typedef long long ll;
void swap(ll i, ll j, ll *a) {
ll tmp = a[i];
a[i] = a[j];
a[j] = tmp;
}
void b_sort(ll n, ll *x, ll *y, ll *h) {
ll i, j;
for (i = 0; i < n; i++) {
for (j = n - 1; j > i; j--) {
if (h[j - 1] < h[j]) {
swap(j... | [
"variable_declaration.type.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,027,759 | 1,027,760 | u110383054 | cpp |
p03240 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repf(i, a, b) for (int i = (a); i < (b); i++)
#define repi(i, a, b) for (int i = (a); i <= (b); i++)
#define repr(i, a, b) for (int i = (a); i >= (b); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#def... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repf(i, a, b) for (int i = (a); i < (b); i++)
#define repi(i, a, b) for (int i = (a); i <= (b); i++)
#define repr(i, a, b) for (int i = (a); i >= (b); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#def... | [
"expression.operation.binary.add"
] | 1,027,775 | 1,027,776 | u850516963 | cpp |
p03240 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repf(i, a, b) for (int i = (a); i < (b); i++)
#define repi(i, a, b) for (int i = (a); i <= (b); i++)
#define repr(i, a, b) for (int i = (a); i >= (b); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#def... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repf(i, a, b) for (int i = (a); i < (b); i++)
#define repi(i, a, b) for (int i = (a); i <= (b); i++)
#define repr(i, a, b) for (int i = (a); i >= (b); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#def... | [
"expression.operation.binary.add"
] | 1,027,777 | 1,027,776 | u850516963 | cpp |
p03240 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> xxx(n);
vector<long long> yyy(n);
vector<long long> hhh(n);
int a, b, c;
for (int i = 0; i < n; i++) {
cin >> xxx.at(i) >> yyy.at(i) >> hhh.at(i);
if (hhh.at(i) >= 1) {
a = xxx.at(i);
b = yy... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> xxx(n);
vector<long long> yyy(n);
vector<long long> hhh(n);
int a, b, c;
for (int i = 0; i < n; i++) {
cin >> xxx.at(i) >> yyy.at(i) >> hhh.at(i);
if (hhh.at(i) >= 1) {
a = xxx.at(i);
b = yy... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,027,805 | 1,027,806 | u408053928 | cpp |
p03240 | #include <algorithm>
#include <cstdio>
#include <cstdlib>
struct info {
long long x;
long long y;
long long h;
};
int main() {
int n;
scanf("%d", &n);
info a[100];
for (int i = 0; i < n; ++i) {
scanf("%lld%lld%lld", &a[i].x, &a[i].y, &a[i].h);
}
for (int y = 0; y <= 100; ++y) {
for (int x =... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
struct info {
long long x;
long long y;
long long h;
};
int main() {
int n;
scanf("%d", &n);
info a[100];
for (int i = 0; i < n; ++i) {
scanf("%lld%lld%lld", &a[i].x, &a[i].y, &a[i].h);
}
for (int y = 0; y <= 100; ++y) {
for (int x =... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 1,027,821 | 1,027,822 | u931819817 | cpp |
p03240 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define ANS cout << ans << endl
#define all(a) a.begin(), a.end()
#define SORT(a) sort(al... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define ANS cout << ans << endl
#define all(a) a.begin(), a.end()
#define SORT(a) sort(al... | [
"literal.number.change",
"call.arguments.change"
] | 1,027,827 | 1,027,828 | u969651765 | cpp |
p03240 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
int x[n], y[n], h[n];
tuple<int, int, int> t;
for (int i = 0; i < n; i++) {
cin >> x[i] >> y[i] >> h[i];
if (h[i] != 0)
t = make_tuple(x[i], y[i], h[i]);
}
for (int i = 0; i <= 100; i++)
fo... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
int x[n], y[n], h[n];
tuple<int, int, int> t;
for (int i = 0; i < n; i++) {
cin >> x[i] >> y[i] >> h[i];
if (h[i] != 0)
t = make_tuple(x[i], y[i], h[i]);
}
for (int i = 0; i <= 100; i++)
fo... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,027,833 | 1,027,834 | u804999113 | cpp |
p03240 | #include <iostream>
using namespace std;
int main() {
int n, x[109], y[109];
long long h[109];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x[i] >> y[i] >> h[i];
}
if (n == 1) {
cout << x[0] << ' ' << y[0] << ' ' << h[0] << endl;
} else {
bool ans = true;
for (int i = 0; i <= 100; i++)... | #include <iostream>
using namespace std;
int main() {
int n, x[109], y[109];
long long h[109];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x[i] >> y[i] >> h[i];
}
if (n == 0) {
cout << x[0] << ' ' << y[0] << ' ' << h[0] << endl;
} else {
bool ans = true;
for (int i = 0; i <= 100; i++)... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,027,843 | 1,027,842 | u112318601 | cpp |
p03240 | #include <iostream>
using namespace std;
int main() {
int n, x[109], y[109];
long long h[109];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x[i] >> y[i] >> h[i];
}
if (n == 1) {
cout << x[0] << ' ' << y[0] << ' ' << h[0] << endl;
} else {
bool ans = true;
for (int i = 0; i <= 100; i++)... | #include <iostream>
using namespace std;
int main() {
int n, x[109], y[109];
long long h[109];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x[i] >> y[i] >> h[i];
}
if (n == 0) {
cout << x[0] << ' ' << y[0] << ' ' << h[0] << endl;
} else {
bool ans = true;
for (int i = 0; i <= 100; i++)... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,027,844 | 1,027,842 | u112318601 | cpp |
p03240 | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <numeric>
#include <type_traits>
#include <vector>
using namespace std;
int main(int argc, const char *argv[]) {
long n;
int bi;
cin >> n;
vector<int> h(n), x(n), y(n);
for (int i = 0; i < n; i++) {
cin... | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <numeric>
#include <type_traits>
#include <vector>
using namespace std;
int main(int argc, const char *argv[]) {
long n;
int bi;
cin >> n;
vector<int> h(n), x(n), y(n);
for (int i = 0; i < n; i++) {
cin ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,027,849 | 1,027,850 | u432194969 | cpp |
p03240 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
int main(void) {
int n;
cin >> n;
ll x[n], y[n], h[n];
rep(i, n) cin >> x[i] >> y[i] >> h[i];
rep(i, 101) {
rep(j, 101) {
bool check = true;
ll H;
bool init = false;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
int main(void) {
int n;
cin >> n;
ll x[n], y[n], h[n];
rep(i, n) cin >> x[i] >> y[i] >> h[i];
rep(i, 101) {
rep(j, 101) {
bool check = true;
ll H;
bool init = false;
... | [
"control_flow.branch.if.condition.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 1,027,856 | 1,027,855 | u326152409 | cpp |
p03240 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
void ABC112C() {
int N;
... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
void ABC112C() {
int N;
... | [
"variable_declaration.name.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,027,857 | 1,027,858 | u227117171 | cpp |
p03240 | //新幹線からAC
#include <bits/stdc++.h>
#include <iomanip>
#include <numeric>
using namespace std;
#define int long long
#define pb push_back
#define ub upper_bound
#define lb upper_bound
#define mp make_pair
#define F first
#define S second
#define FOR(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define rep(i, n) FOR(i... | //新幹線からAC
#include <bits/stdc++.h>
#include <iomanip>
#include <numeric>
using namespace std;
#define int long long
#define pb push_back
#define ub upper_bound
#define lb upper_bound
#define mp make_pair
#define F first
#define S second
#define FOR(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define rep(i, n) FOR(i... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,027,871 | 1,027,872 | u764234894 | cpp |
p03240 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MM = 1000000000;
#define mod = MM + 7;
#define INF (ll)1e18
#define pi acos(-1.0)
#define MAX 100005
#define NIL -1
#define rep(i, n) for (int i = 0; i < n; i++)
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
int main() {
int n;
cin ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MM = 1000000000;
#define mod = MM + 7;
#define INF (ll)1e18
#define pi acos(-1.0)
#define MAX 100005
#define NIL -1
#define rep(i, n) for (int i = 0; i < n; i++)
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
int main() {
int n;
cin ... | [
"expression.operation.binary.remove",
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 1,027,906 | 1,027,907 | u342051078 | cpp |
p03240 |
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int x[N], y[N], h[N];
for (int i = 0; i < N; i++) {
cin >> x[i] >> y[i] >> h[i];
}
int Cx, Cy, H;
bool F;
for (Cx = 0; Cx <= 100; Cx++) {
for (Cy = 0; Cy <= 100; Cy++) {
for (int i = 0; i < N; i++) {
if (h[i... |
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int x[N], y[N], h[N];
for (int i = 0; i < N; i++) {
cin >> x[i] >> y[i] >> h[i];
}
int Cx, Cy, H;
bool F;
for (Cx = 0; Cx <= 100; Cx++) {
for (Cy = 0; Cy <= 100; Cy++) {
for (int i = 0; i < N; i++) {
if (h[i... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 1,027,924 | 1,027,925 | u289709148 | cpp |
p03240 | #include <bits/stdc++.h>
#define int long long
#define ALL(v) (v).begin(), (v).end()
#define Vi vector<int>
#define pb push_back
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repr(i, a, b) for (int i = a; i > b; i--)
#define leng(n) (int)(log10(n) + 1)
#define INF 9000000000000000000
#define MOD 1000000007
u... | #include <bits/stdc++.h>
#define int long long
#define ALL(v) (v).begin(), (v).end()
#define Vi vector<int>
#define pb push_back
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repr(i, a, b) for (int i = a; i > b; i--)
#define leng(n) (int)(log10(n) + 1)
#define INF 9000000000000000000
#define MOD 1000000007
u... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 1,027,928 | 1,027,929 | u095453583 | cpp |
p03240 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int x[n], y[n], h[n];
for (auto i = 0; i < n; i++) {
cin >> x[i] >> y[i] >> h[i];
}
const int pos_max = 100;
for (auto py = 0; py <= pos_max; py++) {
for (auto px = 0; px <= pos_max; px++) {
int interim_h = -1;
f... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int x[n], y[n], h[n];
for (auto i = 0; i < n; i++) {
cin >> x[i] >> y[i] >> h[i];
}
const int pos_max = 100;
for (auto py = 0; py <= pos_max; py++) {
for (auto px = 0; px <= pos_max; px++) {
int interim_h = 0;
fo... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,027,948 | 1,027,949 | u081445141 | cpp |
p03240 | #include <algorithm>
#include <array>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, n) for (int(i) = 0; (i) < (n); (i)++)
const long long int mod = 1e9 + 7;
typedef long long ll;
ll gcd(ll a, ll b) {
... | #include <algorithm>
#include <array>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, n) for (int(i) = 0; (i) < (n); (i)++)
const long long int mod = 1e9 + 7;
typedef long long ll;
ll gcd(ll a, ll b) {
... | [
"literal.number.change",
"call.arguments.change"
] | 1,027,950 | 1,027,951 | u920434083 | cpp |
p03240 | #include <bits/stdc++.h>
using namespace std;
int R[110], C[110], H[110];
int r, c, h;
int g(int p) { return H[p] + abs(r - R[p]) + abs(c - C[p]); }
bool f(int p) { return H[p] == max(0, h - abs(r - R[p]) - abs(c - C[p])); }
void solve() {
int n, x;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> C[i] >> ... | #include <bits/stdc++.h>
using namespace std;
int R[110], C[110], H[110];
int r, c, h;
int g(int p) { return H[p] + abs(r - R[p]) + abs(c - C[p]); }
bool f(int p) { return H[p] == max(0, h - abs(r - R[p]) - abs(c - C[p])); }
void solve() {
int n, x;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> C[i] >> ... | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,027,965 | 1,027,966 | u946322619 | cpp |
p03240 | #include <bits/stdc++.h>
using namespace std;
int R[110], C[110], H[110];
int r, c, h;
int g(int p) { return H[p] + abs(r - R[p]) + abs(c - C[p]); }
bool f(int p) { return H[p] == max(0, h - abs(r - R[p]) - abs(c - C[p])); }
void solve() {
int n, x;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> C[i] >> ... | #include <bits/stdc++.h>
using namespace std;
int R[110], C[110], H[110];
int r, c, h;
int g(int p) { return H[p] + abs(r - R[p]) + abs(c - C[p]); }
bool f(int p) { return H[p] == max(0, h - abs(r - R[p]) - abs(c - C[p])); }
void solve() {
int n, x;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> C[i] >> ... | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,027,967 | 1,027,966 | u946322619 | cpp |
p03240 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, N) for (i = 0; i < N; i++)
typedef long long ll;
typedef pair<int, int> P;
typedef struct {
int first;
int second;
ll third;
} T;
//昇順
bool comp_Se(T &l, T &r) { return l.second < r.second; }
//降順
bool comp_Th(T &l, T &r) { return l.third > r.third; }
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, N) for (i = 0; i < N; i++)
typedef long long ll;
typedef pair<int, int> P;
typedef struct {
int first;
int second;
ll third;
} T;
//昇順
bool comp_Se(T &l, T &r) { return l.second < r.second; }
//降順
bool comp_Th(T &l, T &r) { return l.third > r.third; }
... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 1,027,968 | 1,027,969 | u069450081 | cpp |
p03240 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (signed i = 0; i < (n); ++i)
//#define int long long
#define str string
#define debg(a) cout << #a << ":" << a << endl;
#define print(a) cout << a << endl;
#define end cout << endl;
#define elif else if
int a, b, c, i, j, k, n, m, x, y, z;
str s, t;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (signed i = 0; i < (n); ++i)
//#define int long long
#define str string
#define debg(a) cout << #a << ":" << a << endl;
#define print(a) cout << a << endl;
#define end cout << endl;
#define elif else if
int a, b, c, i, j, k, n, m, x, y, z;
str s, t;
... | [
"expression.operation.binary.remove"
] | 1,027,980 | 1,027,981 | u423624748 | cpp |
p03240 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define REP1(i, n) FOR(i, 1, (n) + 1)
#define ALL(c) (c).begin(), (c).end()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define REP1(i, n) FOR(i, 1, (n) + 1)
#define ALL(c) (c).begin(), (c).end()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 1,027,988 | 1,027,989 | u540491484 | cpp |
p03240 | //#pragma GCC optimize("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma warning(disable : 4786)
#pragma warning(disable : 4996)
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <... | //#pragma GCC optimize("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma warning(disable : 4786)
#pragma warning(disable : 4996)
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <... | [
"literal.number.change",
"call.arguments.change"
] | 1,028,002 | 1,028,003 | u484505863 | cpp |
p03240 | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, high, ind, H, f;
cin >> n;
int x[n], y[n], h[n];
for (int i = 0; i < n; i++) {
cin >> x[i] >> y[i] >> h[i];
if (h[i] > 0) {
ind = i;
}
}
for (int i = 0; i <= 100; i++) {
for (... | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, high, ind, H, f;
cin >> n;
int x[n], y[n], h[n];
for (int i = 0; i < n; i++) {
cin >> x[i] >> y[i] >> h[i];
if (h[i] > 0) {
ind = i;
}
}
for (int i = 0; i <= 100; i++) {
for (... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 1,028,054 | 1,028,055 | u885523920 | cpp |
p03240 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> x(n, 0);
vector<int> y(n, 0);
vector<long long> h(n, 0);
for (int i = 0; i < n; i++) {
cin >> x[i] >> y[i] >> h[i];
}
bool finflg = false;
for (int cx = 0; cx < 101; cx++) {
for (int cy = 0; cy < 101;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> x(n, 0);
vector<int> y(n, 0);
vector<long long> h(n, 0);
for (int i = 0; i < n; i++) {
cin >> x[i] >> y[i] >> h[i];
}
bool finflg = true;
for (int cx = 0; cx < 101; cx++) {
for (int cy = 0; cy < 101; ... | [
"misc.opposites",
"variable_declaration.value.change",
"assignment.add"
] | 1,028,060 | 1,028,061 | u229596090 | cpp |
p03240 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
#define CHMAX(a, b) a = std::max(a, b)
#define CHMIN(a, b) a = std::min(a, b)
#define CHABS(a) a = std::abs(a)
#define COUT(a) std::cout << a << std::endl
#define CERR(a) std::cerr << a << st... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
#define CHMAX(a, b) a = std::max(a, b)
#define CHMIN(a, b) a = std::min(a, b)
#define CHABS(a) a = std::abs(a)
#define COUT(a) std::cout << a << std::endl
#define CERR(a) std::cerr << a << st... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,028,062 | 1,028,063 | u155216115 | cpp |
p03240 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
using names... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
using names... | [
"literal.string.change",
"io.output.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 1,028,085 | 1,028,086 | u170650966 | cpp |
p03240 | #include <stdio.h>
int abs(int i) {
if (i >= 0) {
return i;
} else {
return -i;
}
}
long long int max(long long int i) {
if (i > 0) {
return i;
} else {
return 0;
}
}
int main(void) {
int n;
scanf("%d", &n);
int x[n], y[n], i;
long long int h[n];
for (i = 0; i < n; i++) {
s... | #include <stdio.h>
int abs(int i) {
if (i >= 0) {
return i;
} else {
return -i;
}
}
long long int max(long long int i) {
if (i > 0) {
return i;
} else {
return 0;
}
}
int main(void) {
int n;
scanf("%d", &n);
int x[n], y[n], i;
long long int h[n];
for (i = 0; i < n; i++) {
s... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 1,028,123 | 1,028,124 | u657913472 | cpp |
p03240 | #include <stdio.h>
int abs(int i) {
if (i >= 0) {
return i;
} else {
return -i;
}
}
long long int max(long long int i) {
if (i > 0) {
return i;
} else {
return 0;
}
}
int main(void) {
int n;
scanf("%d", &n);
int x[n], y[n], i;
long long int h[n];
for (i = 0; i < n; i++) {
s... | #include <stdio.h>
int abs(int i) {
if (i >= 0) {
return i;
} else {
return -i;
}
}
long long int max(long long int i) {
if (i > 0) {
return i;
} else {
return 0;
}
}
int main(void) {
int n;
scanf("%d", &n);
int x[n], y[n], i;
long long int h[n];
for (i = 0; i < n; i++) {
s... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"misc.opposites",
"expression.operator.arithmetic.change"
] | 1,028,125 | 1,028,124 | u657913472 | cpp |
p03240 | //
// second.cpp
// CoderTest
//
// Created by yuya on 2019/05/23.
// Copyright © 2019 yuya. All rights reserved.
//
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int i;
int j;
int k;
int cnt;
int flag = 1;
int N;
int x, y, h;
int x0, y0, h0;
int xr = 0, xl = 1... | //
// second.cpp
// CoderTest
//
// Created by yuya on 2019/05/23.
// Copyright © 2019 yuya. All rights reserved.
//
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int i;
int j;
int k;
int cnt;
int flag = 1;
int N;
int x, y, h;
int x0, y0, h0;
int xr = 0, xl = 1... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,028,126 | 1,028,127 | u422769833 | cpp |
p03240 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for (ll i = (a); i > (b); --i)
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOREACH(x, a) for (auto &(x) : (a))
#define VECCIN(x) ... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for (ll i = (a); i > (b); --i)
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOREACH(x, a) for (auto &(x) : (a))
#define VECCIN(x) ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,028,161 | 1,028,162 | u139031151 | cpp |
p03240 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for (ll i = (a); i > (b); --i)
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOREACH(x, a) for (auto &(x) : (a))
#define VECCIN(x) ... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for (ll i = (a); i > (b); --i)
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOREACH(x, a) for (auto &(x) : (a))
#define VECCIN(x) ... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 1,028,163 | 1,028,162 | u139031151 | cpp |
p03240 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int n;
int H;
int main() {
cin >> n;
int x[n], y[n], h[n];
for (int i = 0; i < n; i++) {
cin >> x[i] >> y[i] >> h[i];
}
for (int i = 0; i < 101; i++) {
for (int j = 0; j < 101; j++) {
for (int l = 0; l < n; l++) {
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int n;
int H;
int main() {
cin >> n;
int x[n], y[n], h[n];
for (int i = 0; i < n; i++) {
cin >> x[i] >> y[i] >> h[i];
}
for (int i = 0; i < 101; i++) {
for (int j = 0; j < 101; j++) {
for (int l = 0; l < n; l++) {
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 1,028,175 | 1,028,174 | u190234543 | cpp |
p03240 | #include <bits/stdc++.h>
using namespace std;
int n, a[103], b[103], h[103], x = -1;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i] >> h[i];
if (h[i] != 0)
x = i;
}
if (x == -1) {
cout << "37 15 1";
return 0;
}
for (int i = 0; i <= 100; i++)
for (int j = 0... | #include <bits/stdc++.h>
using namespace std;
int n, a[103], b[103], h[103], x = -1;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i] >> h[i];
if (h[i] != 0)
x = i;
}
if (x == -1) {
cout << "37 15 1";
return 0;
}
for (int i = 0; i <= 100; i++)
for (int j = 0... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 1,028,217 | 1,028,218 | u123270724 | cpp |
p03240 | #include <bits/stdc++.h>
#define ll long long
#define int long long
#define rg register
using namespace std;
const int MAXN = 110;
int n, X[MAXN], Y[MAXN], H[MAXN];
inline int Abs(rg int A) { return A > 0 ? A : -A; }
inline int Max(rg int A, rg int B) { return A > B ? A : B; }
inline int Min(rg int A, rg int B) { retur... | #include <bits/stdc++.h>
#define ll long long
#define int long long
#define rg register
using namespace std;
const int MAXN = 110;
int n, X[MAXN], Y[MAXN], H[MAXN];
inline int Abs(rg int A) { return A > 0 ? A : -A; }
inline int Max(rg int A, rg int B) { return A > B ? A : B; }
inline int Min(rg int A, rg int B) { retur... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 1,028,231 | 1,028,232 | u949168783 | cpp |
p03240 | #include <bits/stdc++.h>
#define ll long long
#define int long long
#define rg register
using namespace std;
const int MAXN = 110;
int n, X[MAXN], Y[MAXN], H[MAXN];
inline int Abs(rg int A) { return A > 0 ? A : -A; }
inline int Max(rg int A, rg int B) { return A > B ? A : B; }
inline int Min(rg int A, rg int B) { retur... | #include <bits/stdc++.h>
#define ll long long
#define int long long
#define rg register
using namespace std;
const int MAXN = 110;
int n, X[MAXN], Y[MAXN], H[MAXN];
inline int Abs(rg int A) { return A > 0 ? A : -A; }
inline int Max(rg int A, rg int B) { return A > B ? A : B; }
inline int Min(rg int A, rg int B) { retur... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 1,028,233 | 1,028,232 | u949168783 | cpp |
p03240 | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
long long i, j, k, l, n, x[1000], y[1000], h[1000], mn;
int main() {
cin >> n;
for (i = 0; i < n; i++) {
cin >> x[i] >> y[i] >> h[i];
mn = min(mn, h[i]);
}
for (j = 0; j <= 100; j++) {
for (k = 0; k <= 100; k++) {
... | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
long long i, j, k, l, n, x[1000], y[1000], h[1000], mn = 10000000000;
int main() {
cin >> n;
for (i = 0; i < n; i++) {
cin >> x[i] >> y[i] >> h[i];
mn = min(mn, h[i]);
}
for (j = 0; j <= 100; j++) {
for (k = 0; k <= 100;... | [
"variable_declaration.value.change"
] | 1,028,236 | 1,028,237 | u621509943 | cpp |
p03240 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int getH(int N, const vector<int> &x, const vector<int> &y,
const vector<int> &h, int cx, int cy) {
vector<int> d(201, -1);
for (int i = 0; i < N; ++i) {
int z = abs(x[i] - cx) + abs(y[i] - cy);
if (d[z] < 0) {
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int getH(int N, const vector<int> &x, const vector<int> &y,
const vector<int> &h, int cx, int cy) {
vector<int> d(201, -1);
for (int i = 0; i < N; ++i) {
int z = abs(x[i] - cx) + abs(y[i] - cy);
if (d[z] < 0) {
... | [
"literal.string.change",
"io.output.change"
] | 1,028,247 | 1,028,248 | u036411476 | cpp |
p03240 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
using namespace std;
#define ABS(a) (((a) >= 0) ?... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
using namespace std;
#define ABS(a) (((a) >= 0) ?... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 1,028,252 | 1,028,253 | u984351908 | cpp |
p03240 | #include <cmath>
#include <iostream>
using namespace std;
int n, x[128], y[128], h[128];
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x[i] >> y[i] >> h[i];
}
for (int cy = 0; cy <= 100; cy++) {
for (int cx = 0; cx <= 100; cx++) {
int cH = 1;
for (int i = 0; i < n; i++) {
... | #include <cmath>
#include <iostream>
using namespace std;
int n, x[128], y[128], h[128];
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x[i] >> y[i] >> h[i];
}
for (int cy = 0; cy <= 100; cy++) {
for (int cx = 0; cx <= 100; cx++) {
int cH = 1;
for (int i = 0; i < n; i++) {
... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 1,028,258 | 1,028,259 | u365416949 | cpp |
p03240 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
int N;
cin >> N;
vector<int> x(N), y(N), h(N);
for (int i = 0; i < N; ++i) {
cin >> x[i] >> y[i] >> h[i];
}
int hmin = *min_element(h.begin(), h.end());
for (int cx = 0; cx <= 100; ++cx)... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main(int argc, char *argv[]) {
int N;
cin >> N;
vector<int> x(N), y(N), h(N);
for (int i = 0; i < N; ++i) {
cin >> x[i] >> y[i] >> h[i];
}
int hmin = *min_element(h.begin(), h.end());
for (int cx... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,028,263 | 1,028,264 | u155128304 | cpp |
p03240 | #include <algorithm>
#include <cstdio>
#include <cstdlib>
using namespace std;
#define LL long long
int x[110], y[110], h[110];
int n;
int main() {
int cx, cy, H;
int allzero = 1;
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d%d%d", &x[i], &y[i], &h[i]), allzero &= (h[i] == 0);
if (allzero) {
... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
using namespace std;
#define LL long long
int x[110], y[110], h[110];
int n;
int main() {
int cx, cy, H;
int allzero = 1;
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d%d%d", &x[i], &y[i], &h[i]), allzero &= (h[i] == 0);
if (allzero) {
... | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,028,268 | 1,028,269 | u756245913 | cpp |
p03240 | #include <bits/stdc++.h>
using namespace std;
long long int N, x, y, h;
vector<tuple<long long, long long, long long>> info;
int main() {
scanf("%lld", &N);
for (int i = 0; i < N; ++i) {
scanf("%lld%lld%lld", &x, &y, &h);
info.emplace_back(h, x, y);
}
sort(info.rbegin(), info.rend());
long long tx, ... | #include <bits/stdc++.h>
using namespace std;
long long int N, x, y, h;
vector<tuple<long long, long long, long long>> info;
int main() {
scanf("%lld", &N);
for (int i = 0; i < N; ++i) {
scanf("%lld%lld%lld", &x, &y, &h);
info.emplace_back(h, x, y);
}
sort(info.rbegin(), info.rend());
long long tx, ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 1,028,280 | 1,028,281 | u462437857 | cpp |
p03240 | #include <iostream>
#include <vector>
using namespace std;
int calc_upper_bound(int cx, int cy, int x, int y, int h) {
return abs(cx - x) + abs(cy - y) + h;
}
int calc_lower_bound(int cx, int cy, int x, int y, int h) {
if (h == 0) {
return 1;
}
return abs(cx - x) + abs(cy - y) + h;
}
int main(void) {
... | #include <iostream>
#include <vector>
using namespace std;
int calc_upper_bound(int cx, int cy, int x, int y, int h) {
return abs(cx - x) + abs(cy - y) + h;
}
int calc_lower_bound(int cx, int cy, int x, int y, int h) {
if (h == 0) {
return 1;
}
return abs(cx - x) + abs(cy - y) + h;
}
int main(void) {
... | [
"assignment.value.change",
"identifier.change"
] | 1,028,303 | 1,028,304 | u995792346 | cpp |
p03240 | // https://beta.atcoder.jp/contests/abc031/submissions/3335125
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
using na... | // https://beta.atcoder.jp/contests/abc031/submissions/3335125
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
using na... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,028,341 | 1,028,342 | u307165262 | cpp |
p03240 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
//#include <bits/stdc++.h>
#define rep(i, n) Rep(i, 0, n)
#define Rep(i, k, n) for (int ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
//#include <bits/stdc++.h>
#define rep(i, n) Rep(i, 0, n)
#define Rep(i, k, n) for (int ... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 1,028,357 | 1,028,358 | u381585104 | cpp |
p03240 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define forx(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, s = 0;
cin >> n;
vector<int> x(n), y(n), h(n);
rep(i, n) cin >> x[i] >> y[i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define forx(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, s = 0;
cin >> n;
vector<int> x(n), y(n), h(n);
rep(i, n) cin >> x[i] >> y[i... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,028,363 | 1,028,364 | u604231488 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.