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 9
values |
|---|---|---|---|---|---|---|---|
p02982 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, D, norm, sum = 0;
cin >> N >> D;
int X[N][D];
for (int i = 0; i < N; i++) {
for (int k = 0; k < D; k++) {
cin >> X[i][k];
}
}
for (int i = 0; i < N; i++) {
for (int j = i + 1; j < N; j++) {
norm = 0;
for (int k... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, D, norm, sum = 0;
cin >> N >> D;
int X[N][D];
for (int i = 0; i < N; i++) {
for (int k = 0; k < D; k++) {
cin >> X[i][k];
}
}
for (int i = 0; i < N; i++) {
for (int j = i + 1; j < N; j++) {
norm = 0;
for (int k... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 786,015 | 786,016 | u410888565 | cpp |
p02982 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, D, norm, sum = 0;
cin >> N >> D;
int X[N][D];
for (int i = 0; i < N; i++) {
for (int k = 0; k < D; k++) {
cin >> X[i][k];
}
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
norm = 0;
for (int k = 0... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, D, norm, sum = 0;
cin >> N >> D;
int X[N][D];
for (int i = 0; i < N; i++) {
for (int k = 0; k < D; k++) {
cin >> X[i][k];
}
}
for (int i = 0; i < N; i++) {
for (int j = i + 1; j < N; j++) {
norm = 0;
for (int k... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 786,017 | 786,016 | u410888565 | cpp |
p02982 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
/* clang-format off */
#define INF (INT_MAX / 4)
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(a) (a).begin(), (a).end()
// #define __DEBUG__
#ifdef __DEBUG__
#define CH_P(a) cout <<"check_point("<<#a<<")" << "\n";
#defi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
/* clang-format off */
#define INF (INT_MAX / 4)
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(a) (a).begin(), (a).end()
// #define __DEBUG__
#ifdef __DEBUG__
#define CH_P(a) cout <<"check_point("<<#a<<")" << "\n";
#defi... | [
"literal.number.change",
"call.arguments.change"
] | 786,020 | 786,021 | u517348254 | cpp |
p02982 | #include <stdio.h>
int N, M, A[11][11];
bool cnt[20000];
int main() {
scanf("%d %d", &N, &M);
for (int i = 0; i < N; i++)
for (int j = 0; j < M; j++)
scanf("%d", &A[i][j]);
for (int i = 0; i < N; i++)
for (int j = i + 1; j < N; j++) {
int s = 0;
for (int k = 0; k < M; k++)
s +=... | #include <stdio.h>
int N, M, A[11][11], cnt[20000];
int main() {
scanf("%d %d", &N, &M);
for (int i = 0; i < N; i++)
for (int j = 0; j < M; j++)
scanf("%d", &A[i][j]);
for (int i = 0; i < N; i++)
for (int j = i + 1; j < N; j++) {
int s = 0;
for (int k = 0; k < M; k++)
s += (A[i... | [] | 786,051 | 786,052 | u233632872 | cpp |
p02982 | #include <stdio.h>
int N, M, A[11][11];
bool cnt[5000];
int main() {
scanf("%d %d", &N, &M);
for (int i = 0; i < N; i++)
for (int j = 0; j < M; j++)
scanf("%d", &A[i][j]);
for (int i = 0; i < N; i++)
for (int j = i + 1; j < N; j++) {
int s = 0;
for (int k = 0; k < M; k++)
s += ... | #include <stdio.h>
int N, M, A[11][11], cnt[20000];
int main() {
scanf("%d %d", &N, &M);
for (int i = 0; i < N; i++)
for (int j = 0; j < M; j++)
scanf("%d", &A[i][j]);
for (int i = 0; i < N; i++)
for (int j = i + 1; j < N; j++) {
int s = 0;
for (int k = 0; k < M; k++)
s += (A[i... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 786,053 | 786,052 | u233632872 | cpp |
p02982 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
int i, j;
int s[n][d];
for (i = 0; i < n; i++) {
for (j = 0; j < d; j++) {
cin >> s[i][j];
}
}
int count = 0, x;
for (i = 0; i < n; i++) {
for (j = i + 1; j < n; j++) {
int sum = 0;
for (int... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
int i, j;
int s[n][d];
for (i = 0; i < n; i++) {
for (j = 0; j < d; j++) {
cin >> s[i][j];
}
}
int count = 0, x;
for (i = 0; i < n; i++) {
for (j = i + 1; j < n; j++) {
int sum = 0;
for (int... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 786,098 | 786,099 | u130651752 | cpp |
p02982 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
int main() {
int n, d;
cin >> n >> d;
int x[n][d];
rep(i, n) {
rep(j, d) { cin >> x[i][j]; }
}
int dist[50][50];
rep(i, 50) {
rep(j, 50) { dist[i][j] = 0; }
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
int main() {
int n, d;
cin >> n >> d;
int x[n][d];
rep(i, n) {
rep(j, d) { cin >> x[i][j]; }
}
int dist[50][50];
rep(i, 50) {
rep(j, 50) { dist[i][j] = 0; }
... | [
"literal.number.change",
"call.arguments.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 786,107 | 786,105 | u821071900 | cpp |
p02982 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, d, a[11][11], i, j, k, count = 0, ans = 0;
double s[50] = {0}, b[i][j];
cin >> n >> d;
for (i = 0; i < n; i++) {
for (j = 0; j < d; j++) {
cin >> a[i][j];
b[i][j] = a[i][j];
}
}
for (i = 0; i < n - 1; i++) {
for (j = ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, d, a[11][11], i, j, k, count = 0, ans = 0;
double s[50] = {0}, b[11][11];
cin >> n >> d;
for (i = 0; i < n; i++) {
for (j = 0; j < d; j++) {
cin >> a[i][j];
b[i][j] = a[i][j];
}
}
for (i = 0; i < n - 1; i++) {
for (j ... | [
"identifier.replace.remove",
"literal.replace.add",
"variable_declaration.array_dimensions.change"
] | 786,110 | 786,111 | u317148714 | cpp |
p02982 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stdio.h>
#include <vector>
#define rep(i, cc, n) for (int i = cc; i <= n; ++i)
#define drep(i, cc, n) for (int i = cc; i >= n; --i)
typedef long long ll;
using namespace std;
int main() {
int n, d;
cin >> n >> d;
int x[n][d];
int ans = 0;
rep... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stdio.h>
#include <vector>
#define rep(i, cc, n) for (int i = cc; i <= n; ++i)
#define drep(i, cc, n) for (int i = cc; i >= n; --i)
typedef long long ll;
using namespace std;
int main() {
int n, d;
cin >> n >> d;
int x[n][d];
int ans = 0;
rep... | [
"assignment.add",
"literal.number.change",
"call.arguments.change"
] | 786,273 | 786,274 | u374678351 | cpp |
p02982 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int N, D, x, y;
cin >> N >> D;
int X[20][20];
for (int i = 0; i < N; i++) {
for (int j = 0; j < D; j++) {
cin >> X[i][j];
}
}
int r = 0, d = 0, p = 0;
;
for (int i = 0; i < N; i++) {
for (int j = i + 1; j < N; j++... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int N, D, x, y;
cin >> N >> D;
int X[20][20];
for (int i = 0; i < N; i++) {
for (int j = 0; j < D; j++) {
cin >> X[i][j];
}
}
int r = 0, d = 0, p = 0;
;
for (int i = 0; i < N; i++) {
for (int j = i + 1; j < N; j++... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 786,311 | 786,312 | u627821211 | cpp |
p02982 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int N, D, x, y;
cin >> N >> D;
int X[20][20];
for (int i = 0; i < N; i++) {
for (int j = 0; j < D; j++) {
cin >> X[i][j];
}
}
int r = 0, d = 0, p = 0;
;
for (int i = 0; i < N; i++) {
for (int j = i + 1; j < N; j++... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int N, D, x, y;
cin >> N >> D;
int X[20][20];
for (int i = 0; i < N; i++) {
for (int j = 0; j < D; j++) {
cin >> X[i][j];
}
}
int r = 0, d = 0, p = 0;
;
for (int i = 0; i < N; i++) {
for (int j = i + 1; j < N; j++... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.add"
] | 786,313 | 786,312 | u627821211 | cpp |
p02982 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define print(n) std::cout << n << std::endl
using namespace std;
int main() {
int n, d;
cin >> n >> d;
int x[n][d];
rep(i, n) rep(j, d) cin >> x[i][j];
int count = 0;
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j < n; ++j)... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define print(n) std::cout << n << std::endl
using namespace std;
int main() {
int n, d;
cin >> n >> d;
int x[n][d];
rep(i, n) rep(j, d) cin >> x[i][j];
int count = 0;
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j < n; ++j)... | [
"call.remove"
] | 786,375 | 786,376 | u999788719 | cpp |
p02982 |
// B - Good Distance
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// const int INF = 2147483647;
// const ll INF = 9223372036854775807;
// const int MOD = 1e9 + 7;
vector<int> X[10];
int calc_dist_sq(int D, vector<int> A, vector<int> B) {
int res = 0;
for (int i = 0; i < D; i++) {
res... |
// B - Good Distance
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// const int INF = 2147483647;
// const ll INF = 9223372036854775807;
// const int MOD = 1e9 + 7;
vector<int> X[10];
int calc_dist_sq(int D, vector<int> A, vector<int> B) {
int res = 0;
for (int i = 0; i < D; i++) {
res... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 786,383 | 786,384 | u790272146 | cpp |
p02982 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
int a[n][d];
for (int i = 0; i < n; i++) {
for (int j = 0; j < d; j++) {
cin >> a[i][j];
}
}
int c = 0;
for (int i = 0; i < n - 1; i++) {
for (int g = i + 1; g < n; g++) {
int sum = 0;
for ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
int a[n][d];
for (int i = 0; i < n; i++) {
for (int j = 0; j < d; j++) {
cin >> a[i][j];
}
}
int c = 0;
for (int i = 0; i < n - 1; i++) {
for (int g = i + 1; g < n; g++) {
double sum = 0;
f... | [
"variable_declaration.type.primitive.change"
] | 786,395 | 786,396 | u866310595 | cpp |
p02982 | /*{{{*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define SZ(X) ((int)(X).size())
#defin... | /*{{{*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define SZ(X) ((int)(X).size())
#defin... | [
"variable_declaration.type.primitive.change"
] | 786,452 | 786,453 | u284124505 | cpp |
p02982 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, D, X[10][10];
int num = 0;
cin >> N >> D;
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= D; j++)
cin >> X[i][j];
}
for (int n = 1; n <= N; n++) {
for (int i = 1; i <= N; i++) {
int a = 0;
for (int j = 1; j <= D... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, D, X[10][10];
int num = 0;
cin >> N >> D;
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= D; j++)
cin >> X[i][j];
}
for (int n = 1; n < N; n++) {
for (int i = n + 1; i <= N; i++) {
int a = 0;
for (int j = 1; j <... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.loop.for.initializer.change"
] | 786,454 | 786,455 | u163149221 | cpp |
p02982 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, D, X[10][10];
int num = 0;
cin >> N >> D;
for (int i = 1; i <= N; i++) {
for (int j = 0; j <= D; j++)
cin >> X[i][j];
}
for (int n = 1; n <= N; n++) {
for (int i = 1; i <= N; i++) {
int a = 0;
for (int j = 1; j <= D... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, D, X[10][10];
int num = 0;
cin >> N >> D;
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= D; j++)
cin >> X[i][j];
}
for (int n = 1; n < N; n++) {
for (int i = n + 1; i <= N; i++) {
int a = 0;
for (int j = 1; j <... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 786,456 | 786,455 | u163149221 | cpp |
p02982 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, d;
cin >> n >> d;
int a[n][d];
for (int i = 0; i < n; i++) {
for (int j = 0; j < d; j++)
cin >> a[i][j];
}
int count = 0;
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j < n; j++) {
int c = 0;
for (int... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, d;
cin >> n >> d;
int a[n][d];
for (int i = 0; i < n; i++) {
for (int j = 0; j < d; j++)
cin >> a[i][j];
}
int count = 0;
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j < n; j++) {
int c = 0;
for (int... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 786,466 | 786,467 | u512624048 | cpp |
p02982 | #include <cmath>
#include <iostream>
using namespace std;
int d[15][15];
int main(void) {
int n, m, sum = 0, cnt = 0;
double temp;
cin >> n >> m;
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++)
cin >> d[i][j];
for (int i = 0; i < n; i++)
for (int j = i + 1; j < n; j++) {
sum = 0;
... | #include <cmath>
#include <iostream>
using namespace std;
int d[15][15];
int main(void) {
int n, m, sum = 0, cnt = 0;
int temp;
cin >> n >> m;
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++)
cin >> d[i][j];
for (int i = 0; i < n; i++)
for (int j = i + 1; j < n; j++) {
sum = 0;
... | [
"variable_declaration.type.primitive.change"
] | 786,476 | 786,477 | u959634984 | cpp |
p02982 | #include <bits/stdc++.h>
using namespace std;
#define ll long long // long long省略
#define pb push_back // push_back省略
#define mp make_pair // make_pair省略
#define fi first // first省略
#define se second // second省略
#define itn int // int誤字保険
#define count cout // cout誤字保険
#define vecotr vector // vect... | #include <bits/stdc++.h>
using namespace std;
#define ll long long // long long省略
#define pb push_back // push_back省略
#define mp make_pair // make_pair省略
#define fi first // first省略
#define se second // second省略
#define itn int // int誤字保険
#define count cout // cout誤字保険
#define vecotr vector // vect... | [
"control_flow.branch.if.condition.change"
] | 786,517 | 786,518 | u547754910 | cpp |
p02982 | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
int N, D, ans = 0, cnt = 0;
cin >> N >> D;
int X[N][D];
for (int i = 0; i < N; i++) {
for (int j = 0; j < D; j++)
cin >> X[i][j];
}
for (int i = 0; i < N; i++) {
for (int l = i + 1; l < N; l++) {
for (int j = 0;... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
int N, D, ans = 0, cnt = 0;
cin >> N >> D;
int X[N][D];
for (int i = 0; i < N; i++) {
for (int j = 0; j < D; j++)
cin >> X[i][j];
}
for (int i = 0; i < N; i++) {
for (int l = i + 1; l < N; l++) {
for (int j = 0;... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 786,525 | 786,526 | u937275419 | cpp |
p02982 | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c[110][110], e, f;
cin >> a >> b;
for (int i = 0; i < a; i++) {
for (int j = 0; j < b; j++)
cin >> c[i][j];
}
f = 0;
for (int i = 0; i < a; i++) {
for (int j = 0; j < a; j++) {
for (int l = 0; l <... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c[110][110], e, f;
cin >> a >> b;
for (int i = 0; i < a; i++) {
for (int j = 0; j < b; j++)
cin >> c[i][j];
}
f = 0;
for (int i = 0; i < a; i++) {
for (int j = 0; j < i; j++) {
for (int l = 0; l <... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 786,533 | 786,534 | u530329977 | cpp |
p02982 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
#define long long ll;
int main(void) {
int n, d;
cin >> n >> d;
double x[n][d];
double sum = 0;
int ans = 0;
rep(i, n) {
rep(j, d) {
int a;
cin >> a;
x[i][j] = a;
}
}
rep(i, n) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
#define long long ll;
int main(void) {
int n, d;
cin >> n >> d;
double x[n][d];
double sum = 0;
int ans = 0;
rep(i, n) {
rep(j, d) {
int a;
cin >> a;
x[i][j] = a;
}
}
rep(i, n) {
... | [
"assignment.variable.change",
"identifier.change",
"assignment.value.change",
"call.arguments.change",
"control_flow.branch.if.condition.change"
] | 786,563 | 786,564 | u905170328 | cpp |
p02982 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
#define long long ll;
int main(void) {
int n, d;
cin >> n >> d;
double x[n][d];
double sum = 0;
int ans = 0;
rep(i, n) {
rep(j, d) {
int a;
cin >> a;
x[i][j] = a;
}
}
rep(i, n) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
#define long long ll;
int main(void) {
int n, d;
cin >> n >> d;
double x[n][d];
double sum = 0;
int ans = 0;
rep(i, n) {
rep(j, d) {
int a;
cin >> a;
x[i][j] = a;
}
}
rep(i, n) {
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"assignment.variable.change",
"assignment.value.change",
"call.arguments.change",
"control_flow.branch.if.condition.change"
] | 786,565 | 786,564 | u905170328 | cpp |
p02982 | #include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template <class T> constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template <class T> constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char> T_char TL(T_char cX) ... | #include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template <class T> constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template <class T> constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char> T_char TL(T_char cX) ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 786,576 | 786,577 | u093922224 | cpp |
p02982 | #include <cmath>
#include <iostream>
using namespace std;
static const int max_n = 10;
static const int max_d = 10;
bool is_integer(double x) { return floor(x) == x; }
int main(void) {
int n, d, ans = 0;
double XX[max_n][max_d];
cin >> n >> d;
for (int i = 0; i < n; i++) {
for (int j = 0; j < d; j++) {
... | #include <cmath>
#include <iostream>
using namespace std;
static const int max_n = 10;
static const int max_d = 10;
bool is_integer(double x) { return floor(x) == x; }
int main(void) {
int n, d, ans = 0;
double XX[max_n][max_d]; //ここをintにするといけない
cin >> n >> d;
for (int i = 0; i < n; i++) {
for (int j = 0;... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"call.add",
"call.arguments.change"
] | 786,585 | 786,586 | u900688325 | cpp |
p02982 | #include "bits/stdc++.h"
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define repf(i, x, n) for (int i = (int)(x); i < (int... | #include "bits/stdc++.h"
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define repf(i, x, n) for (int i = (int)(x); i < (int... | [
"expression.operation.binary.add"
] | 786,602 | 786,603 | u395846213 | cpp |
p02982 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
vector<vector<int>> vec;
int x;
vector<int> v;
for (int i = 0; i < n; i++) {
for (int j = 0; j < d; j++) {
cin >> x;
v.push_back(x);
}
vec.push_back(v);
v.clear();
}
int temp = 0, diff, v... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
vector<vector<int>> vec;
int x;
vector<int> v;
for (int i = 0; i < n; i++) {
for (int j = 0; j < d; j++) {
cin >> x;
v.push_back(x);
}
vec.push_back(v);
v.clear();
}
int temp = 0, diff = ... | [
"variable_declaration.value.change",
"expression.operation.binary.remove"
] | 786,610 | 786,611 | u910994303 | cpp |
p02982 | #include <bits/stdc++.h>
using namespace std;
#define Mset(s, n) memset(s, n, sizeof(s))
#define Rp0(i, m) for (int i = 0; i < m; ++i)
#define Rpd(i, m, l) for (int i = l; i >= m; --i)
#define Rp1(i, m) for (int i = 1; i <= m; i++)
#define All(a) (a).begin(), (a).end()
#define Lwb lower_bound
#define Upb upper_bound
#... | #include <bits/stdc++.h>
using namespace std;
#define Mset(s, n) memset(s, n, sizeof(s))
#define Rp0(i, m) for (int i = 0; i < m; ++i)
#define Rpd(i, m, l) for (int i = l; i >= m; --i)
#define Rp1(i, m) for (int i = 1; i <= m; i++)
#define All(a) (a).begin(), (a).end()
#define Lwb lower_bound
#define Upb upper_bound
#... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add"
] | 786,621 | 786,622 | u671291651 | cpp |
p02982 | #include <iostream>
#include <math.h>
using namespace std;
int main() {
double ND[10][10];
int n, d, check, count;
double sum, root;
cin >> n >> d;
for (int i = 0; i < n; i++) {
for (int j = 0; j < d; j++) {
cin >> ND[i][j];
}
}
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j... | #include <iostream>
#include <math.h>
using namespace std;
int main() {
double ND[10][10];
int n, d, check, count = 0;
double sum, root;
cin >> n >> d;
for (int i = 0; i < n; i++) {
for (int j = 0; j < d; j++) {
cin >> ND[i][j];
}
}
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < ... | [
"variable_declaration.value.change"
] | 786,639 | 786,640 | u647653350 | cpp |
p02982 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, dim;
cin >> n >> dim;
double x[n][dim];
for (int i = 0; i < n; i++) {
for (int j = 0; j < dim; j++) {
cin >> x[i][j];
}
}
int sum = 0, count = 0;
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j < n; j++) {
... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, dim;
cin >> n >> dim;
double x[n][dim];
for (int i = 0; i < n; i++) {
for (int j = 0; j < dim; j++) {
cin >> x[i][j];
}
}
int sum = 0, count = 0;
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j < n; j++) {
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 786,670 | 786,671 | u962680761 | cpp |
p02982 | #define rep(i, n) for (int i = 0; i < (int)n; i++)
#include <bits/stdc++.h>
using namespace std;
int main() {
#ifdef LOCAL
// 以降 cin の入力元が 'xxx.txt' になる
std::ifstream in("b.txt");
std::cin.rdbuf(in.rdbuf());
#endif
int N, D;
cin >> N >> D;
int X[10][10];
rep(i, N) {
rep(j, D) { cin >> X[i][j]; }
... | #define rep(i, n) for (int i = 0; i < (int)n; i++)
#include <bits/stdc++.h>
using namespace std;
int main() {
#ifdef LOCAL
// 以降 cin の入力元が 'xxx.txt' になる
std::ifstream in("b.txt");
std::cin.rdbuf(in.rdbuf());
#endif
int N, D;
cin >> N >> D;
int X[10][10];
rep(i, N) {
rep(j, D) { cin >> X[i][j]; }
... | [
"expression.operation.binary.remove"
] | 786,692 | 786,693 | u234248338 | cpp |
p02982 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, d;
int X[10][10];
cin >> n >> d;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < d; ++j) {
cin >> X[i][j];
}
}
int cnt = 0;
for (int i = 0; i < n - 1; ++i) {
for (int j = i + 1; j < n; ++j) {
int tem... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, d;
int X[10][10];
cin >> n >> d;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < d; ++j) {
cin >> X[i][j];
}
}
int cnt = 0;
for (int i = 0; i < n - 1; ++i) {
for (int j = i + 1; j < n; ++j) {
int tem... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 786,716 | 786,717 | u352969025 | cpp |
p02982 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const int INF = 100000000;
int main() {
int n, d;
cin... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const int INF = 100000000;
int main() {
int n, d;
cin... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 786,722 | 786,723 | u489117389 | cpp |
p02982 | #include <algorithm>
#include <climits>
#include <complex>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
// using
using namespace std;
// typedef
typedef long long ll;
// define
#define FOR(i, a, b, c) for (int i = (int)(a); i < (int)(b); i += (int)(c))
#defi... | #include <algorithm>
#include <climits>
#include <complex>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
// using
using namespace std;
// typedef
typedef long long ll;
// define
#define FOR(i, a, b, c) for (int i = (int)(a); i < (int)(b); i += (int)(c))
#defi... | [
"variable_declaration.type.primitive.change"
] | 786,753 | 786,754 | u164300951 | cpp |
p02982 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main() {
int N, D;
cin >> N >> D;
int X[20][20];
for (int i = 0; i < N; i++) {
for (int j = 0; j < D; j++) {
cin >> X[i][j];
}
}
int ans = 0;
double dist_abs;
for (int k = 0; k < N - 1... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main() {
int N, D;
cin >> N >> D;
int X[20][20];
for (int i = 0; i < N; i++) {
for (int j = 0; j < D; j++) {
cin >> X[i][j];
}
}
int ans = 0;
double dist_abs;
for (int k = 0; k < N - 1... | [
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 786,759 | 786,760 | u964726243 | cpp |
p02982 | /*
ID: flashysport101
LANG: C++
TASK:
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector... | /*
ID: flashysport101
LANG: C++
TASK:
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector... | [
"variable_declaration.type.change"
] | 786,799 | 786,800 | u758353376 | cpp |
p02982 | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int f[11][11];
int main() {
int n, d, cnt = 0, t = 0;
cin >> n >> d;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= d; j++) {
cin >> f[i][j];
}
}
//+return 0;
for (int i = 1; i <= n - 1; i++) {
for (int j = i ... | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int f[11][11];
int main() {
int n, d, cnt = 0, t = 0;
cin >> n >> d;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= d; j++) {
cin >> f[i][j];
}
}
//+return 0;
for (int i = 1; i <= n - 1; i++) {
for (int j = i ... | [
"assignment.add"
] | 786,833 | 786,834 | u337355231 | cpp |
p02982 | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, d, i, j, k, sum, count;
double dis;
cin >> n >> d;
int point[n][d];
for (i = 0; i < n; i++)
for (j = 0; j < d; j++)
cin >> point[i][j];
for (i = 0; i < n; i++)
for (j = i + 1; j < n; j++) {
s... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, d, i, j, k, sum, count = 0;
double dis;
cin >> n >> d;
int point[n][d];
for (i = 0; i < n; i++)
for (j = 0; j < d; j++)
cin >> point[i][j];
for (i = 0; i < n; i++)
for (j = i + 1; j < n; j++) {
... | [
"variable_declaration.value.change"
] | 786,837 | 786,838 | u067840456 | cpp |
p02982 | #include <cmath>
#include <iostream>
using namespace std;
int get_distance(int *a, int *b, int length) {
double res = 0;
for (int i = 0; i < length; i++) {
res += pow(a[i] - b[i], 2.0);
}
res = sqrt(res);
return res;
}
int main() {
int N, D;
int i, j;
cin >> N >> D;
int arr[N][D];
for (i = 0... | #include <cmath>
#include <iostream>
using namespace std;
double get_distance(int *a, int *b, int length) {
double res = 0;
for (int i = 0; i < length; i++) {
res += pow(a[i] - b[i], 2.0);
}
res = sqrt(res);
return res;
}
int main() {
int N, D;
int i, j;
cin >> N >> D;
int arr[N][D];
for (i ... | [
"function.return_type.change"
] | 786,854 | 786,855 | u345716368 | cpp |
p02982 | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MAX = (int)(1e5 + 5);
const ll INF = (ll)(1e10 + 5);
const int MAX_N = (int)(1e1 + 5);
const int MAX_D = (int)(1e1 + 5);
int n, d;
int x[MAX_N][MAX_D];
int ans;
bool check(int i, int j) {
int base = 0;
for (int k = 0; k < d; ++k... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MAX = (int)(1e5 + 5);
const ll INF = (ll)(1e10 + 5);
const int MAX_N = (int)(1e1 + 5);
const int MAX_D = (int)(1e1 + 5);
int n, d;
int x[MAX_N][MAX_D];
int ans;
bool check(int i, int j) {
int base = 0;
for (int k = 0; k < d; ++k... | [
"identifier.replace.add",
"literal.replace.remove",
"function.return_value.change",
"expression.operation.binary.change"
] | 786,880 | 786,881 | u497422208 | cpp |
p02982 | #include <iostream>
#include <math.h>
using namespace std;
int main() {
// 整数の入力
int n;
cin >> n;
// スペース区切りの整数の入力
int d;
cin >> d;
int data[n][d];
int a;
for (int i = 0; i < n; i++) {
for (int j = 0; j < d; j++) {
cin >> a;
data[i][j] = a;
}
}
int count = 0;
for (int i = 0;... | #include <iostream>
#include <math.h>
using namespace std;
int main() {
// 整数の入力
int n;
cin >> n;
// スペース区切りの整数の入力
int d;
cin >> d;
int data[n][d];
int a;
for (int i = 0; i < n; i++) {
for (int j = 0; j < d; j++) {
cin >> a;
data[i][j] = a;
}
}
int count = 0;
for (int i = 0;... | [
"assignment.value.change"
] | 786,896 | 786,897 | u593778400 | cpp |
p02982 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
using namespace std;
int ans, cnt1;
int main() {
int n, d;
cin >> n >> d;
int x[10][10];
rep(i, n) {
rep(j, d) { cin... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
using namespace std;
int ans, cnt1;
int main() {
int n, d;
cin >> n >> d;
int x[10][10];
rep(i, n) {
rep(j, d) { cin... | [
"identifier.change",
"call.arguments.change"
] | 786,900 | 786,901 | u294829559 | cpp |
p02982 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <math.h>
#include <queue>
#include <string.h>
#include <utility>
using namespace std;
int N, D, x[11][11] = {0};
int check(int a, int b) {
int dis = 0;
for (int i = 1; i <= D; i++) {
dis = dis + (x[a][i] - x[b][i]) * (x[a][i]... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <math.h>
#include <queue>
#include <string.h>
#include <utility>
using namespace std;
int N, D, x[11][11] = {0};
int check(int a, int b) {
int dis = 0;
for (int i = 1; i <= D; i++) {
dis = dis + (x[a][i] - x[b][i]) * (x[a][i]... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"control_flow.loop.for.initializer.change"
] | 786,933 | 786,934 | u466318894 | cpp |
p02982 | #include <math.h>
#include <stdio.h>
int main() {
int p[10][10];
int N, D, i, j, k, count;
scanf("%d%d", &N, &D);
for (i = 0; i < N; i++) {
for (j = 0; j < D; j++) {
scanf("%d", &p[i][j]);
}
}
for (i = 0; i < N - 1; i++) {
for (j = i + 1; j < N; j++) {
double dist = 0;
for (k ... | #include <math.h>
#include <stdio.h>
int main() {
int p[10][10];
int N, D, i, j, k;
int count = 0;
scanf("%d%d", &N, &D);
for (i = 0; i < N; i++) {
for (j = 0; j < D; j++) {
scanf("%d", &p[i][j]);
}
}
for (i = 0; i < N - 1; i++) {
for (j = i + 1; j < N; j++) {
double dist = 0;
... | [
"variable_declaration.remove",
"variable_declaration.add"
] | 786,935 | 786,936 | u038803010 | cpp |
p02982 | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int n, d, sum = 0, count = 0;
cin >> n >> d;
int x[10][20];
for (int i = 0; i < n; i++) {
for (int j = 0; j < d; j++) {
cin >> x[i][j];
}
}
for (int point = 0; point < n; point++) {
for (int i = point + 1; i < n; i++)... | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int n, d, sum = 0, count = 0;
cin >> n >> d;
int x[10][20];
for (int i = 0; i < n; i++) {
for (int j = 0; j < d; j++) {
cin >> x[i][j];
}
}
for (int point = 0; point < n - 1; point++) {
for (int i = point + 1; i < n; ... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"assignment.add"
] | 786,937 | 786,938 | u805227991 | cpp |
p02982 | #include <cmath>
#include <iostream>
using namespace std;
bool calc(int a[], int b[], int d) {
float t = 0;
for (int di = 0; di < d; di++)
t += pow(a[di] + b[di], 2.0);
t = sqrt(t);
return t == (int)t;
}
int main() {
int n, d, count = 0;
cin >> n >> d;
int points[n][d];
for (int i = 0; i < n; i... | #include <cmath>
#include <iostream>
using namespace std;
bool calc(int a[], int b[], int d) {
float t = 0;
for (int di = 0; di < d; di++)
t += pow(a[di] - b[di], 2.0);
t = sqrt(t);
return t == (int)t;
}
int main() {
int n, d, count = 0;
cin >> n >> d;
int points[n][d];
for (int i = 0; i < n; i... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 786,941 | 786,942 | u525522160 | cpp |
p02982 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, D, cnt = 0;
double T;
cin >> N >> D;
int x[N][D];
for (int i = 0; i < N; i++) {
for (int j = 0; j < D; j++) {
cin >> x[i][j];
}
}
for (int i = 0; i < N; i++) {
for (int j = i + 1; j < N; j++) {
int T = 0;
for... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, D, cnt = 0;
double T;
cin >> N >> D;
int x[N][D];
for (int i = 0; i < N; i++) {
for (int j = 0; j < D; j++) {
cin >> x[i][j];
}
}
for (int i = 0; i < N - 1; i++) {
for (int j = i + 1; j < N; j++) {
int T = 0;
... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.remove"
] | 786,965 | 786,966 | u515116926 | cpp |
p02982 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, D, cnt = 0;
double T;
cin >> N >> D;
int x[N][D];
for (int i = 0; i < N; i++) {
for (int j = 0; j < D; j++) {
cin >> x[i][j];
}
}
for (int i = 0; i < N + 1; i++) {
for (int j = i + 1; j < N; j++) {
int T = 0;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, D, cnt = 0;
double T;
cin >> N >> D;
int x[N][D];
for (int i = 0; i < N; i++) {
for (int j = 0; j < D; j++) {
cin >> x[i][j];
}
}
for (int i = 0; i < N - 1; i++) {
for (int j = i + 1; j < N; j++) {
int T = 0;
... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.r... | 786,967 | 786,966 | u515116926 | cpp |
p02982 | #include <cmath>
#include <iostream>
using namespace std;
bool isint(int x) {
int root = sqrt(x);
if (x / root == root)
return true;
else
return false;
}
int main() {
int n, d;
cin >> n >> d;
int point[n][d];
int count = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < d; j++) {
... | #include <cmath>
#include <iostream>
using namespace std;
bool isint(int x) {
int root = sqrt(x);
if (x == root * root)
return true;
else
return false;
}
int main() {
int n, d;
cin >> n >> d;
int point[n][d];
int count = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < d; j++) {
... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 786,980 | 786,981 | u387480576 | cpp |
p02982 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
int MOD = 1000000007;
int main() {
int N, D;
int ans = 0, co = 0;
cin >> N >> D;
int X[N + 10][D + 10] = {};
for (int i = 0; i < N; i++) {
for (int j = 0; j < D; j++) {
cin >> X[i][j];
}
... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
int MOD = 1000000007;
int main() {
int N, D;
int ans = 0, co = 0;
cin >> N >> D;
int X[N + 10][D + 10] = {};
for (int i = 0; i < N; i++) {
for (int j = 0; j < D; j++) {
cin >> X[i][j];
}
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 786,984 | 786,985 | u500026208 | cpp |
p02982 | #include <bits/stdc++.h>
#define endl "\n"
using namespace std;
int a[11][11];
int main() {
int n, d;
cin >> n >> d;
// cout << n << d << endl;
for (int i = 0; i < n; i++) {
for (int j = 0; j < d; j++) {
cin >> a[i][j];
}
}
/*
for(int i=0; i<n; i++){
for(int j=0; j<d; j++){
... | #include <bits/stdc++.h>
#define endl "\n"
using namespace std;
int a[11][11];
int main() {
int n, d;
cin >> n >> d;
// cout << n << d << endl;
for (int i = 0; i < n; i++) {
for (int j = 0; j < d; j++) {
cin >> a[i][j];
}
}
/*
for(int i=0; i<n; i++){
for(int j=0; j<d; j++){
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 786,996 | 786,997 | u597953074 | cpp |
p02982 |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
... |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
... | [] | 787,002 | 787,003 | u874996917 | cpp |
p02982 | #include <cmath>
#include <iostream>
using namespace std;
int n, d;
int points[10][10];
int pairs = 0;
int main() {
cin >> n >> d;
for (int i = 0; i < n; i++)
for (int j = 0; j < d; j++)
cin >> points[i][j];
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j < n; j++) {
int dist = 0;
... | #include <cmath>
#include <iostream>
using namespace std;
int n, d;
int points[10][10];
int pairs = 0;
int main() {
cin >> n >> d;
for (int i = 0; i < n; i++)
for (int j = 0; j < d; j++)
cin >> points[i][j];
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j < n; j++) {
int dist = 0;
... | [] | 787,008 | 787,009 | u683313061 | cpp |
p02982 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, t, a[111][111], cnt = 0, b;
double s;
cin >> n >> t;
for (int i = 0; i < n; i++) {
for (int j = 0; j < t; j++) {
cin >> a[i][j];
}
}
for (i... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, t, a[111][111], cnt = 0, b;
double s;
cin >> n >> t;
for (int i = 0; i < n; i++) {
for (int j = 0; j < t; j++) {
cin >> a[i][j];
}
}
for (i... | [
"assignment.value.change",
"expression.operation.binary.change"
] | 787,043 | 787,044 | u288257826 | cpp |
p02982 | #include <bits/stdc++.h>
using namespace std;
int n, m, a[111][111], t;
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
scanf("%d", &a[i][j]);
for (int i = 1; i < n; i++)
for (int j = i + 1; j <= n; j++) {
double s = 0;
for (int k = 1; k <= m; k++)
... | #include <bits/stdc++.h>
using namespace std;
int n, m, a[111][111], t;
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
scanf("%d", &a[i][j]);
for (int i = 1; i < n; i++)
for (int j = i + 1; j <= n; j++) {
double s = 0;
for (int k = 1; k <= m; k++)
... | [
"call.arguments.change"
] | 787,049 | 787,050 | u727652622 | cpp |
p02982 | #include <math.h>
#include <stdio.h>
int dp[100][100];
int n, d;
int main() {
scanf("%d%d", &n, &d);
int counter = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < d; j++) {
scanf("%d", &dp[i][j]);
}
}
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j < n; j++) {
int su = 0;
... | #include <math.h>
#include <stdio.h>
int dp[100][100];
int n, d;
int main() {
scanf("%d%d", &n, &d);
int counter = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < d; j++) {
scanf("%d", &dp[i][j]);
}
}
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j < n; j++) {
int su = 0;
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 787,096 | 787,097 | u708067384 | cpp |
p02982 | #include <iostream>
using namespace std;
int x[12][12];
bool integer(int a) {
int b = 1;
while (b * b < a) {
b++;
if (b * b == a)
return true;
}
return false;
}
int main() {
int n, d;
cin >> n >> d;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= d; j++) {
cin >> x[i][j];
}... | #include <iostream>
using namespace std;
int x[12][12];
bool integer(int a) {
int b = 0;
while (b * b < a) {
b++;
if (b * b == a)
return true;
}
return false;
}
int main() {
int n, d;
cin >> n >> d;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= d; j++) {
cin >> x[i][j];
}... | [
"literal.number.change",
"variable_declaration.value.change"
] | 787,102 | 787,103 | u425858059 | cpp |
p02982 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int N, D;
int X[10][10];
int sum;
int count = 0;
cin >> N >> D;
for (int i = 0; i < N; i++) {
for (int j = 0; j < D; j++) {
cin >> X[i][j];
}
}
for (int i = 0; i < N; i++) {
for (int j = i + 1; j < N; j++) {
... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int N, D;
int X[10][10];
int sum = 0;
int count = 0;
cin >> N >> D;
for (int i = 0; i < N; i++) {
for (int j = 0; j < D; j++) {
cin >> X[i][j];
}
}
for (int i = 0; i < N; i++) {
for (int j = i + 1; j < N; j++) {
... | [
"variable_declaration.value.change"
] | 787,118 | 787,119 | u234973476 | cpp |
p02982 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int N, D;
int X[10][10];
int sum = 0;
int count = 0;
cin >> N >> D;
for (int i = 0; i < N; i++) {
for (int j = 0; j < D; j++) {
cin >> X[i][j];
}
}
for (int i = 0; i < N; i++) {
for (int j = i + 1; j < N; j++) {
... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int N, D;
int X[10][10];
int sum = 0;
int count = 0;
cin >> N >> D;
for (int i = 0; i < N; i++) {
for (int j = 0; j < D; j++) {
cin >> X[i][j];
}
}
for (int i = 0; i < N; i++) {
for (int j = i + 1; j < N; j++) {
... | [
"assignment.add"
] | 787,120 | 787,119 | u234973476 | cpp |
p02982 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, d, s = 0, c = 0;
double d1;
cin >> n >> d;
int a[n][d];
for (int i = 0; i < n; i++)
for (int j = 0; j < d; j++)
cin >> a[i][j];
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j < n; j++) {
for (int k = 0; k < d; k+... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, d, s, c = 0;
double d1;
cin >> n >> d;
int a[n][d];
for (int i = 0; i < n; i++)
for (int j = 0; j < d; j++)
cin >> a[i][j];
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j < n; j++) {
s = 0;
for (int k = 0; ... | [
"assignment.add"
] | 787,121 | 787,122 | u997340502 | cpp |
p02982 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <cstdint>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#includ... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <cstdint>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#includ... | [
"assignment.add"
] | 787,132 | 787,133 | u519950235 | cpp |
p02982 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
int x[d][n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < d; j++) {
cin >> x[j][i];
}
}
int h, cnt = 0;
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j < n; j++) {
h = 0;
... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
int x[d][n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < d; j++) {
cin >> x[j][i];
}
}
int h, cnt = 0;
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j < n; j++) {
h = 0;
... | [] | 787,157 | 787,158 | u054798759 | cpp |
p02982 | #include <iostream>
using namespace std;
int main() {
int ans = 0, c, p;
int n, d, x[10][10];
cin >> n >> d;
for (int i = 0; i < n; i++) {
for (int j = 0; j < d; j++) {
cin >> x[i][j];
}
}
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n - 1; j++) {
c = 0;
for (int k = 0... | #include <iostream>
using namespace std;
int main() {
int ans = 0, c, p;
int n, d, x[10][10];
cin >> n >> d;
for (int i = 0; i < n; i++) {
for (int j = 0; j < d; j++) {
cin >> x[i][j];
}
}
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j < n; j++) {
c = 0;
for (int k = 0... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"expression.operation.binary.remove",
"literal.number.change",
"expression.operation.binary.change"
] | 787,168 | 787,166 | u527984786 | cpp |
p02982 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = ll(a); i < ll(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define inf (ll)1e9
#define mod (ll)(1e9 + 7)
#... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = ll(a); i < ll(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define inf (ll)1e9
#define mod (ll)(1e9 + 7)
#... | [
"variable_declaration.type.widen.change",
"identifier.change",
"call.arguments.change"
] | 787,170 | 787,171 | u001566280 | cpp |
p02982 | #include <stdio.h>
using namespace std;
int check(int a) {
int s = 0;
int P[10000];
for (int i = 1; i <= 200; i++) {
P[i - 1] = i * i;
if (P[i - 1] == a) {
s++;
}
}
return s;
}
int main(void) {
int N, D;
int count = 0;
int X[20][20];
scanf("%d%d", &N, &D);
for (int i = 0; i < N; i+... | #include <stdio.h>
using namespace std;
int check(int a) {
int s = 0;
int P[10000];
for (int i = 1; i <= 200; i++) {
P[i - 1] = i * i;
if (P[i - 1] == a) {
s++;
}
}
return s;
}
int main(void) {
int N, D;
int count = 0;
int X[20][20];
scanf("%d%d", &N, &D);
for (int i = 0; i < N; i+... | [
"literal.number.change",
"assignment.value.change",
"assignment.add"
] | 787,196 | 787,197 | u956941456 | cpp |
p02982 | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
double a;
int count = 0;
int i, j;
int l;
int x[n][d];
for (i = 0; i < n; i++) {
for (j = 0; j < d; j++) {
cin >> x[i][j];
}
}
for (int i = 0; i < n; i++) {
for (int j = i; j < n; j++) ... | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
double a;
int count = 0;
int i, j;
int l;
int x[n][d];
for (i = 0; i < n; i++) {
for (j = 0; j < d; j++) {
cin >> x[i][j];
}
}
for (int i = 0; i < n; i++) {
for (int j = i; j < n - 1; j... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 787,203 | 787,204 | u938987929 | cpp |
p02982 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, d, x[11][11], ans, a;
int sum = 0;
cin >> n >> d;
for (int i = 0; i < n; i++) {
for (int j = 0; j < d; j++) {
cin >> x[i][j];
}
}
for (int c = 0; c < n; c++) {
for (int e = c + 1; e < n; e++) {
sum = 0;
for (int ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, d, x[11][11], ans = 0, a;
int sum = 0;
cin >> n >> d;
for (int i = 0; i < n; i++) {
for (int j = 0; j < d; j++) {
cin >> x[i][j];
}
}
for (int c = 0; c < n; c++) {
for (int e = c + 1; e < n; e++) {
sum = 0;
for (... | [
"variable_declaration.value.change"
] | 787,223 | 787,224 | u684822781 | cpp |
p02982 | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
int main() {
int n, d;
cin >> n >> d;
int a[n][d];
for (int i = 0; i < n; ++i) {
for ... | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
int main() {
int n, d;
cin >> n >> d;
int a[n][d];
for (int i = 0; i < n; ++i) {
for ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 787,248 | 787,249 | u876386943 | cpp |
p02982 | #include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
typedef unsigned int uint;
typedef long long ll;
typedef pair<int, int> P;
const int c_INF = 11111111111;
const int c_mINF = -11111111111;
const int c_YET = -1;
const int c_Dx[4] = {0, 0, 1, -1};
const int... | #include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
typedef unsigned int uint;
typedef long long ll;
typedef pair<int, int> P;
const int c_INF = 11111111111;
const int c_mINF = -11111111111;
const int c_YET = -1;
const int c_Dx[4] = {0, 0, 1, -1};
const int... | [
"assignment.change"
] | 787,267 | 787,268 | u433195318 | cpp |
p02982 | #include <bits/stdc++.h>
using namespace std;
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), ... | #include <bits/stdc++.h>
using namespace std;
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), ... | [
"control_flow.branch.if.condition.change",
"identifier.change"
] | 787,278 | 787,279 | u276588887 | cpp |
p02982 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rept(i, a, b)... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rept(i, a, b)... | [
"variable_declaration.value.change"
] | 787,291 | 787,292 | u569041543 | cpp |
p02982 | #include <stdio.h>
int main(void) {
int n, d, x[10][10] = {0}, count = 0;
scanf("%d %d", &n, &d);
getchar();
for (int i = 0; i < n; i++) {
for (int j = 0; j < d; j++) {
scanf("%d", &x[n][d]);
getchar();
}
}
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
int su... | #include <stdio.h>
int main(void) {
int n, d, x[10][10] = {0}, count = 0;
scanf("%d %d", &n, &d);
getchar();
for (int i = 0; i < n; i++) {
for (int j = 0; j < d; j++) {
scanf("%d", &x[i][j]);
getchar();
}
}
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
int su... | [
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 787,306 | 787,305 | u337266378 | cpp |
p02982 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define Abs(x) ((x) < 0 ? (x) * -1 : (x))
#define rep(x, y) for ((x) = 0; (x) < (y); (x)++)
#define repin(x, y) for ((x) = 0; (x) <= (y); (x)++)
#define nep(x, y) for ((x) = (y)-1; 0 <= (x); (x)--)
#define nepi(x, y,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define Abs(x) ((x) < 0 ? (x) * -1 : (x))
#define rep(x, y) for ((x) = 0; (x) < (y); (x)++)
#define repin(x, y) for ((x) = 0; (x) <= (y); (x)++)
#define nep(x, y) for ((x) = (y)-1; 0 <= (x); (x)--)
#define nepi(x, y,... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 787,319 | 787,320 | u518883877 | cpp |
p02982 | /*
∧＿∧ やあ
（´・ω・｀) / ようこそ、バーボンハウスへ。
／∇y:::::＼
[￣] このテキーラはサービスだから、まず飲んで落ち着いて欲しい。
|:⊃:|:::::| |──|
￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣| うん、「また」なんだ。済まない。
￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣|￣
仏の顔もって言うしね、謝って許してもらおうとも思っていない。
￣￣￣￣￣￣￣￣￣￣￣￣￣￣／|
∇ ∇ ∇ ∇ ／.／| でも、この提出を見たとき、君は、きっと言葉では言い表せない
┴ ┴ ┴ ┴ ／ ／
| 「ときめき」みたいなものを感じてくれ... | /*
∧＿∧ やあ
（´・ω・｀) / ようこそ、バーボンハウスへ。
／∇y:::::＼
[￣] このテキーラはサービスだから、まず飲んで落ち着いて欲しい。
|:⊃:|:::::| |──|
￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣| うん、「また」なんだ。済まない。
￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣|￣
仏の顔もって言うしね、謝って許してもらおうとも思っていない。
￣￣￣￣￣￣￣￣￣￣￣￣￣￣／|
∇ ∇ ∇ ∇ ／.／| でも、この提出を見たとき、君は、きっと言葉では言い表せない
┴ ┴ ┴ ┴ ／ ／
| 「ときめき」みたいなものを感じてくれ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"call.arguments.change"
] | 787,353 | 787,352 | u625092455 | cpp |
p02982 | #include <iostream>
#include <math.h>
#include <stdio.h>
using namespace std;
int main() {
int i, j, k;
int N, D;
cin >> N >> D;
int a[N][D];
for (int i = 0; i < N; ++i) {
for (int j = 0; j < D; ++j) {
cin >> a[i][j];
}
}
int cnt = 0;
double sum;
for (i = 0; i < N; ++i) {
for (j = i... | #include <iostream>
#include <math.h>
#include <stdio.h>
using namespace std;
int main() {
int i, j, k;
int N, D;
cin >> N >> D;
int a[N][D];
for (int i = 0; i < N; ++i) {
for (int j = 0; j < D; ++j) {
cin >> a[i][j];
}
}
int cnt = 0;
double sum;
for (i = 0; i < N; ++i) {
for (j = i... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 787,381 | 787,382 | u563252794 | cpp |
p02982 | #include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
ll Pow(ll a, ll b, ll c) {
ll ans = 1;
a %= c;
while (b) {
if (b & 1)
ans = (ans * a) % c;
a = (a * a) % c;
b >>= 1;
}
return (ans % c);
}
bool cmp(const int &a, const int &b) { return a < b... | #include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
ll Pow(ll a, ll b, ll c) {
ll ans = 1;
a %= c;
while (b) {
if (b & 1)
ans = (ans * a) % c;
a = (a * a) % c;
b >>= 1;
}
return (ans % c);
}
bool cmp(const int &a, const int &b) { return a < b... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 787,416 | 787,417 | u337067848 | cpp |
p02982 | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
vector<vector<double>> X(10, vector<double>(10));
int main() {
int N, D;
cin >> N >> D;
for (int i = 0; i < N; i++) {
for (int j = 0; j < D; j++) {
cin >> X[i][j];
}
}
double sum = 0;
int ans = 0;
for (int i = 0; i... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
vector<vector<double>> X(10, vector<double>(10, 0));
int main() {
int N, D;
cin >> N >> D;
for (int i = 0; i < N; i++) {
for (int j = 0; j < D; j++) {
cin >> X[i][j];
}
}
double sum = 0;
int ans = 0;
for (int i = 0... | [
"call.arguments.add",
"assignment.value.change"
] | 787,433 | 787,434 | u002428461 | cpp |
p02978 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define int long long
using namespace std;
int a[20], n;
int f(int l, int r, int xl, int xr) {
int i, j;
if (r - l <= 1)
return 0;
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define int long long
using namespace std;
int a[20], n;
int f(int l, int r, int xl, int xr) {
int i, j;
if (r - l <= 1)
return 0;
... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 787,504 | 787,505 | u855085370 | cpp |
p02978 | #include <bits/stdc++.h>
#define meow(args...) fprintf(stderr, args)
template <class T1, class T2> inline bool cmin(T1 &a, const T2 &b) {
return b < a ? (a = b, true) : false;
}
template <class T1, class T2> inline bool cmax(T1 &a, const T2 &b) {
return a < b ? (a = b, true) : false;
}
template <class Type> Type re... | #include <bits/stdc++.h>
#define meow(args...) fprintf(stderr, args)
template <class T1, class T2> inline bool cmin(T1 &a, const T2 &b) {
return b < a ? (a = b, true) : false;
}
template <class T1, class T2> inline bool cmax(T1 &a, const T2 &b) {
return a < b ? (a = b, true) : false;
}
template <class Type> Type re... | [
"literal.number.change",
"expression.operation.binary.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 787,530 | 787,531 | u852473670 | cpp |
p02983 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long double ld;
typedef long long int ll;
ty... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long double ld;
typedef long long int ll;
ty... | [
"literal.number.change",
"call.arguments.change"
] | 787,629 | 787,630 | u903311413 | cpp |
p02983 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
#define INF ((1 << 30) - 1)
#define LINF (1LL << 60)
tem... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
#define INF ((1 << 30) - 1)
#define LINF (1LL << 60)
tem... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"call.arguments.add"
] | 787,634 | 787,635 | u639032323 | cpp |
p02983 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
ll l, r;
cin >> l >> r;
int ml = l % 2019;
int mr = r % 2019;
if (r - l >= 2019 || ml > mr) {
cout << 0 << endl;
} else {
int ans = 10000000;
for (int i = ml; i < mr ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
ll l, r;
cin >> l >> r;
int ml = l % 2019;
int mr = r % 2019;
if (r - l >= 2019 || ml > mr) {
cout << 0 << endl;
} else {
int ans = 10000000;
for (int i = ml; i < mr;... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 787,636 | 787,637 | u639032323 | cpp |
p02983 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
ll l, r;
cin >> l >> r;
int ml = l % 2019;
int mr = r % 2019;
if (r - l >= 2019 || ml > mr) {
cout << 0 << endl;
} else {
int ans = 10000000;
for (int i = ml; i < mr ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
ll l, r;
cin >> l >> r;
int ml = l % 2019;
int mr = r % 2019;
if (r - l >= 2019 || ml > mr) {
cout << 0 << endl;
} else {
int ans = 10000000;
for (int i = ml; i < mr;... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.loop.for.initializer.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 787,638 | 787,637 | u639032323 | cpp |
p02983 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const char wall = '#';
vector<vector<char>> fields;
vector<vector<bool>> used;
vector<vector<ll>> dist;
const int dx[4] = {0, -1,... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const char wall = '#';
vector<vector<char>> fields;
vector<vector<bool>> used;
vector<vector<ll>> dist;
const int dx[4] = {0, -1,... | [
"call.arguments.change"
] | 787,661 | 787,662 | u652037179 | cpp |
p02983 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const char wall = '#';
vector<vector<char>> fields;
vector<vector<bool>> used;
vector<vector<ll>> dist;
const int dx[4] = {0, -1,... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const char wall = '#';
vector<vector<char>> fields;
vector<vector<bool>> used;
vector<vector<ll>> dist;
const int dx[4] = {0, -1,... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 787,663 | 787,662 | u652037179 | cpp |
p02983 | #include <bits/stdc++.h>
#define rep(i, n) for (long long int i = 0; i < n; i++)
#define _rep(i, m, n) for (long long int i = m; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
// const int N = 1000000;
const ll mod = 1000000007;
using Graph = vector<vector<int>>;
const int dx[4] = {1, ... | #include <bits/stdc++.h>
#define rep(i, n) for (long long int i = 0; i < n; i++)
#define _rep(i, m, n) for (long long int i = m; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
// const int N = 1000000;
const ll mod = 1000000007;
using Graph = vector<vector<int>>;
const int dx[4] = {1, ... | [
"control_flow.loop.for.initializer.change"
] | 787,680 | 787,681 | u999788719 | cpp |
p02983 | #include <bits/stdc++.h>
#define rep(i, n) for (long long int i = 0; i < n; i++)
#define _rep(i, m, n) for (long long int i = m; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
// const int N = 1000000;
const ll mod = 1000000007;
using Graph = vector<vector<int>>;
const int dx[4] = {1, ... | #include <bits/stdc++.h>
#define rep(i, n) for (long long int i = 0; i < n; i++)
#define _rep(i, m, n) for (long long int i = m; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
// const int N = 1000000;
const ll mod = 1000000007;
using Graph = vector<vector<int>>;
const int dx[4] = {1, ... | [
"call.arguments.change",
"call.arguments.add"
] | 787,682 | 787,681 | u999788719 | cpp |
p02983 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <stdio.h>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef pair<int, string> P;
int main() {
long long l, r, ans, m;
cin >> l... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <stdio.h>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef pair<int, string> P;
int main() {
long long l, r, ans, m;
cin >> l... | [
"control_flow.break.remove",
"control_flow.return.add",
"function.return_value.change"
] | 787,685 | 787,686 | u027762862 | cpp |
p02983 | // Template //
#include <bits/stdc++.h>
using namespace std;
// マクロ //
#define rep(i, N) for (int i = 0; i < (int)(N); i++)
#define req(i, f, N) for (int i = f; i < (int)(N); i++)
#define all(x) x.begin(), x.end()
#define sort(x) sort(all(x))
#define uniq(x) x.erase(unique(all(x)), x.end())
#define vsum(x) accumulate(... | // Template //
#include <bits/stdc++.h>
using namespace std;
// マクロ //
#define rep(i, N) for (int i = 0; i < (int)(N); i++)
#define req(i, f, N) for (int i = f; i < (int)(N); i++)
#define all(x) x.begin(), x.end()
#define sort(x) sort(all(x))
#define uniq(x) x.erase(unique(all(x)), x.end())
#define vsum(x) accumulate(... | [
"call.arguments.change"
] | 787,687 | 787,688 | u073983440 | cpp |
p02983 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int l, r;
cin >> l >> r;
int ans = 2019;
for (int i = l; i < r; i++) {
for (int j = i + 1; j < r + 1; j++) {
ans = min(ans, (i % 2019) * (j % 2019... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int l, r;
cin >> l >> r;
int ans = 2019;
for (int i = l; i < r; i++) {
for (int j = i + 1; j < r + 1; j++) {
ans = min(ans, ((i % 2019) * (j % 201... | [
"call.arguments.change",
"call.arguments.add"
] | 787,701 | 787,702 | u354281482 | cpp |
p02983 | #include <bits/stdc++.h>
#include <chrono>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repl(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define rep2l(i, s, n) for (ll i = (ll)(s); i < (ll)n; i++)
int main(... | #include <bits/stdc++.h>
#include <chrono>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repl(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define rep2l(i, s, n) for (ll i = (ll)(s); i < (ll)n; i++)
int main(... | [
"control_flow.break.remove",
"control_flow.return.add",
"function.return_value.change"
] | 787,708 | 787,709 | u632527507 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
using ll = long long;
using ull = unsigned long long;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vector<int>> vvi;
typedef vector<vector<ll>> vvl;
typedef vector<string> vs;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
using ll = long long;
using ull = unsigned long long;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vector<int>> vvi;
typedef vector<vector<ll>> vvl;
typedef vector<string> vs;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(... | [
"call.arguments.change",
"call.arguments.add"
] | 787,716 | 787,717 | u214781572 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long l, r;
cin >> l >> r;
if (l / 2019 - r / 2019 > 0) {
cout << 0 << endl;
return 0;
}
l = l % 2019;
r = r % 2019;
long long min = 100000000;
for (int i = l; i < r; i++) {
for (int j = i + 1; j < r + 1; j++) {
if ((i * j... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long l, r;
cin >> l >> r;
if (r / 2019 - l / 2019 > 0) {
cout << 0 << endl;
return 0;
}
l = l % 2019;
r = r % 2019;
long long min = 100000000;
for (int i = l; i < r; i++) {
for (int j = i + 1; j < r + 1; j++) {
if ((i * j... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 787,722 | 787,723 | u961443099 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
long l, r;
cin >> l >> r;
if (r - l > 4038)
cout << 1 << endl;
else {
int ans = 2018;
for (long i = l; i < r; i++) {
for (long j = i + 1; j <= r; j++) {
ans = min(ans, (int)((i * j) % 2019));
if (ans == 1)
bre... | #include <bits/stdc++.h>
using namespace std;
int main() {
long l, r;
cin >> l >> r;
if (r - l > 4038)
cout << 0 << endl;
else {
int ans = 2018;
for (long i = l; i < r; i++) {
for (long j = i + 1; j <= r; j++) {
ans = min(ans, (int)((i * j) % 2019));
if (ans == 0)
bre... | [
"literal.number.change",
"io.output.change",
"control_flow.branch.if.condition.change"
] | 787,724 | 787,725 | u523698212 | cpp |
p02983 | // A.cpp
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b != 0 ? gcd(b, a % b) : a; }
ll ... | // A.cpp
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b != 0 ? gcd(b, a % b) : a; }
ll ... | [
"literal.number.change",
"assignment.value.change"
] | 787,728 | 787,729 | u837654535 | cpp |
p02983 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll L, R;
cin >> L >> R;
int L_mod = L % 2019;
int R_mod = R % 2019;
if ((R - L) >= 2019)
cout << 0 << endl;
else {
if (R_mod > L_mod) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll L, R;
cin >> L >> R;
int L_mod = L % 2019;
int R_mod = R % 2019;
if ((R - L) >= 2019)
cout << 0 << endl;
else {
if (R_mod > L_mod) {
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 787,730 | 787,731 | u711381986 | cpp |
p02983 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
ll l, r;
cin >> l >> r;
if (l - r >= 673) {
cout << 0 << endl;
return 0;
}
l = l % 2019;
r = r % 2019;
// cout << l << endl;
// cout << r << endl;
if (l > r) {
c... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
ll l, r;
cin >> l >> r;
if (r - l >= 673) {
cout << 0 << endl;
return 0;
}
l = l % 2019;
r = r % 2019;
// cout << l << endl;
// cout << r << endl;
if (l > r) {
c... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 787,743 | 787,744 | u965095643 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
int main() {
const int mod = 2019;
int L, R;
cin >> L >> R;
if (R - L + 1 >= 2019) {
cout << 0 << endl;
} else {
int mn = 1e9;
int range = max(R, L + mod);
for (int i = L; i <... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
int main() {
const int mod = 2019;
int L, R;
cin >> L >> R;
if (R - L + 1 >= 2019) {
cout << 0 << endl;
} else {
ll mn = 1e9;
int range = min(R, L + mod);
for (ll i = L; i < r... | [
"variable_declaration.type.change",
"misc.opposites",
"identifier.change",
"call.function.change",
"control_flow.loop.for.initializer.change"
] | 787,756 | 787,755 | u107464079 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long L, R;
cin >> L >> R;
long long ans = 2018;
if (R - L > 2021)
cout << 0 << endl;
else {
for (long long i = L; i <= R; i++) {
for (long long j = i + 1; j <= R; j++) {
ans = min(ans, (i * j) % 2019);
}
}
... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long L, R;
cin >> L >> R;
long long ans = 2018;
if (R - L > 2021)
cout << 0 << endl;
else {
for (long long i = L; i <= R; i++) {
for (long long j = i + 1; j <= R; j++) {
ans = min(ans, (i * j) % 2019);
}
}
... | [] | 787,760 | 787,761 | u150155436 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.