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 |
|---|---|---|---|---|---|---|---|
p02256 | #include <stdio.h>
int main(void) {
int x, y, r, tmp;
scanf("%d %d", &x, &y);
if (y > x) {
tmp = x;
x = y;
y = tmp;
}
while (y > 0) {
r = x % y;
x = y;
y = r;
}
printf("%d\n", r);
return 0;
}
| #include <stdio.h>
int main(void) {
int x, y, r, tmp;
scanf("%d %d", &x, &y);
if (y > x) {
tmp = x;
x = y;
y = tmp;
}
while (y > 0) {
r = x % y;
x = y;
y = r;
}
printf("%d\n", x);
return 0;
}
| [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 98,278 | 98,279 | u658976510 | c |
p02256 | #include <stdio.h>
int main(void) {
long int n, i, x, y;
scanf("%d %d", &x, &y);
n = y;
while (n != 0) {
int b = n;
n = x % n;
x = b;
}
printf("%d\n", x);
return 0;
} | #include <stdio.h>
int main(void) {
long int n, i, x, y;
scanf("%ld %ld", &x, &y);
n = y;
while (n != 0) {
long int b = n;
n = x % n;
x = b;
}
printf("%ld\n", x);
return 0;
} | [
"literal.string.change",
"call.arguments.change",
"variable_declaration.type.widen.change",
"io.output.change"
] | 98,356 | 98,357 | u676009614 | c |
p02256 | #include <stdio.h>
int main() {
int x, y, max, min, newmax;
scanf("%d %d", &x, &y);
if (x > y) {
max = x;
min = y;
} else {
max = y;
min = x;
}
while (max != min) {
newmax = min;
min = max % min;
max = newmax;
}
printf("%d\n", max);
return 0;
} | #include <stdio.h>
int main() {
int x, y, max, min, newmax;
scanf("%d %d", &x, &y);
if (x > y) {
max = x;
min = y;
} else {
max = y;
min = x;
}
while (max != min && min != 0) {
newmax = min;
min = max % min;
max = newmax;
}
printf("%d\n", max);
return 0;
} | [
"control_flow.loop.condition.change"
] | 98,490 | 98,491 | u212117207 | c |
p02256 | #include <stdio.h>
int main() {
int a, b, remainder, tmp;
scanf("%d%d", &a, &b);
if (a < b) {
tmp = 1;
a = b;
b = tmp;
}
remainder = a % b;
while (remainder != 0) {
a = b;
b = remainder;
remainder = a % b;
}
printf("%d\n", b);
return 0;
}
| #include <stdio.h>
int main() {
int a, b, remainder, tmp;
scanf("%d%d", &a, &b);
if (a < b) {
tmp = a;
a = b;
b = tmp;
}
remainder = a % b;
while (remainder != 0) {
a = b;
b = remainder;
remainder = a % b;
}
printf("%d\n", b);
return 0;
}
| [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 98,898 | 98,899 | u889908059 | c |
p02257 | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
int isprime(int);
int main() {
int i, x, n, count = 0, k;
int *m;
scanf("%d", &n);
m = malloc(sizeof(int) * n);
for (i = 0; i < n; i++) {
scanf("%d", &m[i]);
// k = m[i];
// fprintf(stderr,"m: %d k: %d\n",m[i],k);
if (isprime(m[i]) ==... | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
int isprime(int);
int main() {
int i, x, n, count = 0;
int *m;
scanf("%d", &n);
m = malloc(sizeof(int) * n);
for (i = 0; i < n; i++) {
scanf("%d", &m[i]);
if (isprime(m[i]) == 1) {
count++;
}
}
printf("%d\n", count);
free(m);... | [
"variable_declaration.remove",
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 99,449 | 99,450 | u816389695 | c |
p02257 | #include <stdio.h>
int isPrime(int x) {
int i;
if (x < 2)
return 0;
else if (x == 2)
return 1;
if (x % 2 == 0)
return 0;
for (i = 3; i * i <= x; i += 2) {
if (x % 1 == 0)
return 0;
}
return 1;
}
int main() {
int n, x, i;
int ct = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) ... | #include <stdio.h>
int isPrime(int x) {
int i;
if (x < 2)
return 0;
else if (x == 2)
return 1;
if (x % 2 == 0)
return 0;
for (i = 3; i * i <= x; i += 2) {
if (x % i == 0)
return 0;
}
return 1;
}
int main() {
int n, x, i;
int ct = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) ... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 99,530 | 99,531 | u009426676 | c |
p02257 | #include <stdio.h>
int isPrime(int x) {
int i;
if (x < 2)
return 0;
else if (x == 2)
return 1;
if (x % 2 == 0)
return 0;
for (i = 3; i * i <= x; i += 2) {
if (x % 1 == 0)
return 0;
}
return 1;
}
int main() {
int n, x, i;
int ct = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) ... | #include <stdio.h>
int isPrime(int x) {
int i;
if (x < 2)
return 0;
else if (x == 2)
return 1;
if (x % 2 == 0)
return 0;
for (i = 3; i * i <= x; i += 2) {
if (x % i == 0)
return 0;
}
return 1;
}
int main() {
int n, x, i;
int ct = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) ... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 99,533 | 99,531 | u009426676 | c |
p02258 | #include <stdio.h>
#define N 10000
int main(void) {
int max, min, i, j, n;
scanf("%d", &n);
int R[N];
for (i = 0; i < n; i++) {
scanf("%d", &R[i]);
}
max = R[1] - R[0];
min = R[0];
for (i = 0; i < n; i++) {
if (max < R[i] - min)
max = R[i] - min;
if (min > R[i])
min = R[i];
... | #include <stdio.h>
#define N 200000
int main(void) {
int max, min, i, j, n;
scanf("%d", &n);
int R[N];
for (i = 0; i < n; i++) {
scanf("%d", &R[i]);
}
max = R[1] - R[0];
min = R[0];
for (i = 1; i < n; i++) {
if (max < R[i] - min) {
max = R[i] - min;
}
if (min > R[i]) {
mi... | [
"preprocessor.define.value.change",
"literal.integer.change",
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 100,732 | 100,733 | u658976510 | c |
p02258 | #include <stdio.h>
#define N 10000
int main(void) {
int max, min, i, j, n;
scanf("%d", &n);
int R[N];
for (i = 0; i < n; i++) {
scanf("%d", &R[i]);
}
max = R[1] - R[0];
min = R[0];
for (i = 0; i < n; i++) {
if (max < R[i] - min) {
max = R[i] - min;
}
if (min > R[i]) {
min... | #include <stdio.h>
#define N 200000
int main(void) {
int max, min, i, j, n;
scanf("%d", &n);
int R[N];
for (i = 0; i < n; i++) {
scanf("%d", &R[i]);
}
max = R[1] - R[0];
min = R[0];
for (i = 1; i < n; i++) {
if (max < R[i] - min) {
max = R[i] - min;
}
if (min > R[i]) {
mi... | [
"preprocessor.define.value.change",
"literal.integer.change",
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 100,734 | 100,733 | u658976510 | c |
p02259 | #include <stdio.h>
int main() {
int n, i, A[100], B, flag = 1, j = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
while (flag) {
flag = 0;
for (i = n - 1; i >= 1; i--) {
if (A[i] < A[i - 1]) {
B = A[i];
A[i] = A[i - 1];
A[i - 1] = B;
fl... | #include <stdio.h>
int main() {
int n, i, A[100], B, flag = 1, j = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
while (flag) {
flag = 0;
for (i = n - 1; i >= 1; i--) {
if (A[i] < A[i - 1]) {
B = A[i];
A[i] = A[i - 1];
A[i - 1] = B;
fl... | [
"expression.operation.binary.add"
] | 102,382 | 102,381 | u619274870 | c |
p02259 | #include <stdio.h>
int main() {
int N, a[100], flag, i, j, tmp, n = 0;
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &a[i]);
}
i = 0;
while (flag) {
flag = 0;
for (j = N - 1; j > i; j--) {
if (a[j] < a[j - 1]) {
tmp = a[j];
a[j] = a[j - 1];
a[j - 1] = tm... | #include <stdio.h>
int main() {
int N, a[100], flag = 1, i, j, tmp, n = 0;
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &a[i]);
}
i = 0;
while (flag) {
flag = 0;
for (j = N - 1; j > i; j--) {
if (a[j] < a[j - 1]) {
tmp = a[j];
a[j] = a[j - 1];
a[j - 1] ... | [
"variable_declaration.value.change"
] | 102,418 | 102,419 | u708798390 | c |
p02259 | #include <stdio.h>
int main() {
int N, a[100], flag, i, j, tmp, n = 0;
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &a[i]);
}
i = 0;
while (flag) {
flag = 0;
for (j = N - 1; j > i; j--) {
if (a[j] < a[j - 1]) {
tmp = a[j];
a[j] = a[j - 1];
a[j - 1] = tm... | #include <stdio.h>
int main() {
int N, a[100], flag = 1, i, j, tmp, n = 0;
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &a[i]);
}
i = 0;
while (flag) {
flag = 0;
for (j = N - 1; j > i; j--) {
if (a[j] < a[j - 1]) {
tmp = a[j];
a[j] = a[j - 1];
a[j - 1] ... | [
"variable_declaration.value.change"
] | 102,420 | 102,419 | u708798390 | c |
p02259 | // 2016/11/2
#include <ctype.h>
#include <stdio.h>
#include <string.h>
int main(void) {
int i;
int n, a[101] = {0}, flag = 1, count = 0, temp;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
while (flag) {
flag = 0;
for (i = n - 1; i > 0; i++) {
if (a[i] < a[i - 1]) ... | // 2016/11/2
#include <ctype.h>
#include <stdio.h>
#include <string.h>
int main(void) {
int i;
int n, a[101] = {0}, flag = 1, count = 0, temp;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
while (flag) {
flag = 0;
for (i = n - 1; i > 0; i--) {
if (a[i] < a[i - 1]) ... | [
"assignment.value.change"
] | 102,487 | 102,488 | u934862665 | c |
p02259 | // 2016/11/2
#include <ctype.h>
#include <stdio.h>
#include <string.h>
int main(void) {
int i;
int n, a[101] = {0}, flag = 1, count = 0, temp;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
while (flag) {
flag = 0;
for (i = n - 1; i > 0; i--) {
if (a[i] < a[i - 1]) ... | // 2016/11/2
#include <ctype.h>
#include <stdio.h>
#include <string.h>
int main(void) {
int i;
int n, a[101] = {0}, flag = 1, count = 0, temp;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
while (flag) {
flag = 0;
for (i = n - 1; i > 0; i--) {
if (a[i] < a[i - 1]) ... | [
"assignment.value.change"
] | 102,489 | 102,488 | u934862665 | c |
p02258 | #include <stdio.h>
int main() {
int n, r[200000];
int i, j, maxv, minv;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &r[i]);
maxv = r[1] - r[0];
minv = r[0];
for (j = 0; j < n; j++) {
if (maxv < r[j] - minv)
maxv = r[j] - minv;
if (r[j] < minv)
minv = r[j];
}
/* for(i... | #include <stdio.h>
int main() {
int n, r[200000];
int i, j, maxv, minv;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &r[i]);
maxv = r[1] - r[0];
minv = r[0];
for (j = 1; j < n; j++) {
if (r[j] - minv > maxv)
maxv = r[j] - minv;
if (r[j] < minv)
minv = r[j];
}
/* for(i... | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 102,604 | 102,603 | u801535964 | c |
p02258 | #include <stdio.h>
int main() {
int n, r[200000];
int i, j, maxv, minv;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &r[i]);
maxv = r[1] - r[0];
minv = r[0];
for (j = 0; j < n; j++) {
if (r[j] - minv > maxv)
maxv = r[j] - minv;
if (r[j] < minv)
minv = r[j];
}
/* for(i... | #include <stdio.h>
int main() {
int n, r[200000];
int i, j, maxv, minv;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &r[i]);
maxv = r[1] - r[0];
minv = r[0];
for (j = 1; j < n; j++) {
if (r[j] - minv > maxv)
maxv = r[j] - minv;
if (r[j] < minv)
minv = r[j];
}
/* for(i... | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 102,605 | 102,603 | u801535964 | c |
p02258 | #include <stdio.h>
int main() {
int h, i, j, n, min, max;
max = 0;
scanf("%d", &n);
scanf("%d", &h);
min = h;
for (j = 1; j < n; j++) {
scanf("%d", &i);
if (max > i - min)
max = max;
else
max = i - min;
if (i > min)
min = min;
else
min = i;
}
printf("%d... | #include <stdio.h>
int main() {
int h, i, j, n, min, max;
max = -9999999999;
scanf("%d", &n);
scanf("%d", &h);
min = h;
for (j = 1; j < n; j++) {
scanf("%d", &i);
if (max > i - min)
max = max;
else
max = i - min;
if (i > min)
min = min;
else
min = i;
}
... | [
"literal.number.change",
"assignment.value.change"
] | 102,701 | 102,702 | u602671616 | c |
p02258 | #include <stdio.h>
int main() {
int h, i, j, n, min, max;
scanf("%d", &n);
scanf("%d", &h);
min = h;
for (j = 1; j < n; j++) {
scanf("%d", &i);
if (max > i - min)
max = max;
else
max = i - min;
if (i > min)
min = min;
else
min = i;
}
printf("%d\n", max);
... | #include <stdio.h>
int main() {
int h, i, j, n, min, max;
max = -9999999999;
scanf("%d", &n);
scanf("%d", &h);
min = h;
for (j = 1; j < n; j++) {
scanf("%d", &i);
if (max > i - min)
max = max;
else
max = i - min;
if (i > min)
min = min;
else
min = i;
}
... | [
"assignment.add"
] | 102,705 | 102,702 | u602671616 | c |
p02258 | #include <stdio.h>
int main() {
int h, i, j, n, min, max;
max - 0;
scanf("%d", &n);
scanf("%d", &h);
min = h;
for (j = 1; j < n; j++) {
scanf("%d", &i);
if (max > i - min)
max = max;
else
max = i - min;
if (i > min)
min = min;
else
min = i;
}
printf("%d... | #include <stdio.h>
int main() {
int h, i, j, n, min, max;
max = -9999999999;
scanf("%d", &n);
scanf("%d", &h);
min = h;
for (j = 1; j < n; j++) {
scanf("%d", &i);
if (max > i - min)
max = max;
else
max = i - min;
if (i > min)
min = min;
else
min = i;
}
... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 102,707 | 102,702 | u602671616 | c |
p02258 | #include <stdio.h>
int max(int a, int b);
int min(int a, int b);
int main(void) {
int a[2000000], m, i, maxv;
scanf("%d", &m);
for (i = 0; i < m; i++) {
scanf("%d", &a[i]);
}
maxv = -200000000;
int minv = a[0];
for (i = 0; i < m; i++) {
maxv = max(maxv, a[i] - minv);
minv = min(minv, a[i]);
... | #include <stdio.h>
int max(int a, int b);
int min(int a, int b);
int main(void) {
int a[200000], m, i, maxv;
scanf("%d", &m);
for (i = 0; i < m; i++) {
scanf("%d", &a[i]);
}
maxv = -2000000000;
int minv = a[0];
for (i = 1; i < m; i++) {
maxv = max(maxv, a[i] - minv);
minv = min(minv, a[i]);
... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 102,783 | 102,781 | u623024207 | c |
p02259 | #include <stdio.h>
#define N 101
int main() {
int lengh;
int A[N], i, j, key, count = 0;
scanf("%d", &lengh);
for (i = 1; i <= lengh; i++) {
scanf("%d", &A[i]);
}
for (i = 1; i <= lengh; i++) {
for (j = lengh; j >= i + 1; j--) {
if (A[j] < A[j - 1]) {
key = A[j];
A[j] = A[j - ... | #include <stdio.h>
#define N 101
int main() {
int lengh;
int A[N], i, j, key, count = 0;
scanf("%d", &lengh);
for (i = 1; i <= lengh; i++) {
scanf("%d", &A[i]);
}
for (i = 1; i <= lengh; i++) {
for (j = lengh; j >= i + 1; j--) {
if (A[j] < A[j - 1]) {
key = A[j];
A[j] = A[j - 1... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo",
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 102,944 | 102,945 | u669360983 | c |
p02259 | #include <stdio.h>
#define N 100
int main() {
int lengh;
int A[N], i, j, key, count = 0;
scanf("%d", &lengh);
for (i = 1; i <= lengh; i++) {
scanf("%d", &A[i]);
}
for (i = 1; i <= lengh; i++) {
for (j = lengh; j >= i + 1; j--) {
if (A[j] < A[j - 1]) {
key = A[j];
A[j] = A[j - ... | #include <stdio.h>
#define N 101
int main() {
int lengh;
int A[N], i, j, key, count = 0;
scanf("%d", &lengh);
for (i = 1; i <= lengh; i++) {
scanf("%d", &A[i]);
}
for (i = 1; i <= lengh; i++) {
for (j = lengh; j >= i + 1; j--) {
if (A[j] < A[j - 1]) {
key = A[j];
A[j] = A[j - 1... | [
"preprocessor.define.value.change",
"literal.integer.change",
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo",
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 102,946 | 102,945 | u669360983 | c |
p02259 | #include <stdio.h>
#define N 101
int main() {
int lengh;
int A[N], i, j, key, count = 0;
scanf("%d", &lengh);
for (i = 1; i <= lengh; i++) {
scanf("%d", &A[i]);
}
for (i = 1; i <= lengh; i++) {
for (j = lengh; j >= i + 1; j--) {
if (A[j] < A[j - 1]) {
key = A[j];
A[j] = A[j - ... | #include <stdio.h>
#define N 101
int main() {
int lengh;
int A[N], i, j, key, count = 0;
scanf("%d", &lengh);
for (i = 1; i <= lengh; i++) {
scanf("%d", &A[i]);
}
for (i = 1; i <= lengh; i++) {
for (j = lengh; j >= i + 1; j--) {
if (A[j] < A[j - 1]) {
key = A[j];
A[j] = A[j - 1... | [
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 102,948 | 102,945 | u669360983 | c |
p02260 | #include <stdio.h>
#include <stdlib.h>
int SelSort(int *, int);
void ShowData(int *, int);
int main() {
int i, n, N;
int *P;
scanf("%d", &n);
P = (int *)malloc(n * sizeof(int));
for (i = 0; i < n; i++) {
scanf("%d", &P[i]);
}
N = SelSort(P, n);
ShowData(P, n);
printf("%d\n", N);
return 0;
}
... | #include <stdio.h>
#include <stdlib.h>
int SelSort(int *, int);
void ShowData(int *, int);
int main() {
int i, n, N;
int *P;
scanf("%d", &n);
P = (int *)malloc(n * sizeof(int));
for (i = 0; i < n; i++) {
scanf("%d", &P[i]);
}
N = SelSort(P, n);
ShowData(P, n);
printf("%d\n", N);
return 0;
}
... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 103,753 | 103,754 | u733647639 | c |
p02260 | #include <stdio.h>
int selectionSort(int A[], int N) {
int i, j, minj, s, count;
count = 0;
for (i = 0; i < N - 1; i++) {
minj = i;
for (j = 0; j < N; j++) {
if (A[j] < A[minj]) {
minj = j;
}
}
s = A[i];
A[i] = A[minj];
A[minj] = s;
if (i != minj) {
count... | #include <stdio.h>
int selectionSort(int A[], int N) {
int i, j, minj, s, count;
count = 0;
for (i = 0; i < N - 1; i++) {
minj = i;
for (j = i; j < N; j++) {
if (A[j] < A[minj]) {
minj = j;
}
}
s = A[i];
A[i] = A[minj];
A[minj] = s;
if (i != minj) {
count... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change",
"variable_declaration.remove"
] | 103,825 | 103,826 | u539480202 | c |
p02261 | #include <stdio.h>
struct tranp {
char gara;
int atai;
};
void bbsort(struct tranp C[], int);
void selsort(struct tranp C[], int);
void pr(struct tranp C[], int);
int main() {
int i = 0, j = 0;
struct tranp C[100];
struct tranp CC[100];
int N = 0;
int count = 0;
scanf("%d", &N);
for (i = 0; i < N; ... | #include <stdio.h>
struct tranp {
char gara;
int atai;
};
void bbsort(struct tranp C[], int);
void selsort(struct tranp C[], int);
void pr(struct tranp C[], int);
int main() {
int i = 0, j = 0;
struct tranp C[100];
struct tranp CC[100];
int N = 0;
int count = 0;
scanf("%d", &N);
for (i = 0; i < N; ... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 104,698 | 104,699 | u607795294 | c |
p02261 | #include <stdio.h>
struct tranp {
char gara;
int atai;
};
void bbsort(struct tranp C[], int);
void selsort(struct tranp C[], int);
void pr(struct tranp C[], int);
int main() {
int i = 0, j = 0;
struct tranp C[100];
struct tranp CC[100];
int N = 0;
int count = 0;
scanf("%d", &N);
for (i = 0; i < N; ... | #include <stdio.h>
struct tranp {
char gara;
int atai;
};
void bbsort(struct tranp C[], int);
void selsort(struct tranp C[], int);
void pr(struct tranp C[], int);
int main() {
int i = 0, j = 0;
struct tranp C[100];
struct tranp CC[100];
int N = 0;
int count = 0;
scanf("%d", &N);
for (i = 0; i < N; ... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 104,700 | 104,701 | u607795294 | c |
p02261 | #include <stdio.h>
#define N 36
struct kazu {
int value;
char mozi;
};
main() {
int i, j, n, m, minj;
struct kazu a[N], d[N], b, e;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf(" %c%d", &a[i].mozi, &a[i].value);
d[i] = a[i];
}
for (i = 0; i < n - 1; i++) {
for (j = n - 1; j > i; j--) ... | #include <stdio.h>
#define N 36
struct kazu {
int value;
char mozi;
};
main() {
int i, j, n, m, minj;
struct kazu a[N], d[N], b, e;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf(" %c%d", &a[i].mozi, &a[i].value);
d[i] = a[i];
}
for (i = 0; i < n - 1; i++) {
for (j = n - 1; j > i; j--) ... | [] | 104,928 | 104,927 | u843001885 | c |
p02262 | #include <stdio.h>
int cnt;
void insertionSort(int A[], int n, int g);
void shellSort(int A[], int n);
int n;
int A[1000000];
int main() {
int i;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", A + i);
shellSort(A, n);
printf("%d\n", cnt);
for (i = 0; i < n; i++)
printf("%d\n", A[i]);
ret... | #include <stdio.h>
int cnt;
void insertionSort(int A[], int n, int g);
void shellSort(int A[], int n);
int n;
int A[1000000];
int main() {
int i;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", A + i);
shellSort(A, n);
printf("%d\n", cnt);
for (i = 0; i < n; i++)
printf("%d\n", A[i]);
ret... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 106,055 | 106,056 | u542576355 | c |
p02263 | /*
* Stack.c
*
* Created on: 2015/02/14
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int stack[100];
int count = 0;
int pop() {
count--;
return stack[count];
}
void push(int n) {
stack[count] = n;
count++;
}
int main(void) {
int x, n, m;
char s[100];
while (scanf("%s", s) != EOF... | /*
* Stack.c
*
* Created on: 2015/02/14
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int stack[100];
int count = 0;
int pop() {
count--;
return stack[count];
}
void push(int n) {
stack[count] = n;
count++;
}
int main(void) {
int x, n, m;
char s[100];
while (scanf("%s", s) != EOF... | [
"expression.operation.binary.remove"
] | 106,765 | 106,766 | u738270472 | c |
p02263 | #include <stdio.h>
int top = 0;
int stack[1000];
void push(int n) { stack[++top] = n; }
int pop(void) {
top--;
return stack[top + 1];
}
void calc(char op) {
int n1 = pop(), n2 = pop();
if (op == '+')
push(n1 + n2);
if (op == '-')
push(n2 - n1);
if (op == '*')
push(n2 - n1);
}
int main(void)... | #include <stdio.h>
int top = 0;
int stack[1000];
void push(int n) { stack[++top] = n; }
int pop(void) {
top--;
return stack[top + 1];
}
void calc(char op) {
int n1 = pop(), n2 = pop();
if (op == '+')
push(n1 + n2);
if (op == '-')
push(n2 - n1);
if (op == '*')
push(n2 * n1);
}
int main(void)... | [
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.condition.change"
] | 107,203 | 107,204 | u771221104 | c |
p02263 | #include <stdio.h>
int top = 0;
int stack[1000];
void push(int n) { stack[++top] = n; }
int pop(void) {
top--;
return stack[top + 1];
}
void calc(char op) {
int n1 = pop(), n2 = pop();
if (op == '+')
push(n1 + n2);
if (op == '-')
push(n2 - n1);
if (op == '*')
push(n2 - n1);
}
int main(void)... | #include <stdio.h>
int head = 0;
int stack[1000];
void push(int n) { stack[++head] = n; }
int pop(void) {
head--;
return stack[head + 1];
}
void calc(char op) {
int n1 = pop(), n2 = pop();
if (op == '+')
push(n1 + n2);
if (op == '-')
push(n2 - n1);
if (op == '*')
push(n2 * n1);
}
int main(v... | [
"variable_declaration.name.change",
"identifier.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"function.return_value.change",
"expression.operation.binary.change",
"expression.operator.arithmetic.change",
"call.arguments.change"
] | 107,203 | 107,206 | u771221104 | c |
p02264 | #include <stdio.h>
#include <string.h>
#define LEN 100005
typedef struct pp {
char name[100];
int t;
} P;
void initialize(void);
int isEmpty(void);
int isFull(void);
void enqueue(P);
P dequeue(void);
P Q[LEN + 1];
int head, tail, n;
void initialize() { head = tail = 0; }
int isEmpty() { return head == tail; }
... | #include <stdio.h>
#include <string.h>
#define LEN 100005
typedef struct pp {
char name[100];
int t;
} P;
void initialize(void);
int isEmpty(void);
int isFull(void);
void enqueue(P);
P dequeue(void);
P Q[LEN + 1];
int head, tail, n;
void initialize() { head = tail = 0; }
int isEmpty() { return head == tail; }
... | [
"expression.operation.binary.remove"
] | 108,462 | 108,463 | u836311039 | c |
p02264 | #include <stdio.h>
#include <string.h>
void Push(int, int);
#define LEN 10
#define MAX 100000
int main() {
int n, q;
int i;
int q_time = 0;
int judge = 0;
char name[MAX][LEN] = {};
int time[MAX] = {};
char subname[MAX][LEN] = {};
int subtime[MAX] = {};
int sum_time = 1;
scanf("%d %d", &n, &q);
... | #include <stdio.h>
#include <string.h>
void Push(int, int);
#define LEN 10
#define MAX 100000
int main() {
int n, q;
int i;
int q_time = 0;
int judge = 0;
char name[MAX][LEN] = {};
int time[MAX] = {};
char subname[MAX][LEN] = {};
int subtime[MAX] = {};
int sum_time = 1;
scanf("%d %d", &n, &q);
... | [
"assignment.add"
] | 108,802 | 108,803 | u739446992 | c |
p02265 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
struct node {
int key;
struct node *next;
struct node *prev;
};
typedef struct node *NodePointer;
NodePointer nil;
void insert(int key);
int delete (int key);
int deleteFirst();
int deleteLast();
void init();
main() {
int n, i, keydata;
char com[1... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
struct node {
int key;
struct node *next;
struct node *prev;
};
typedef struct node *NodePointer;
NodePointer nil;
void insert(int key);
int delete (int key);
int deleteFirst();
int deleteLast();
void init();
main() {
int n, i, keydata;
char com[1... | [
"control_flow.branch.if.condition.change"
] | 110,287 | 110,288 | u231257914 | c |
p02265 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
struct node {
int key;
struct node *next;
struct node *prev;
};
typedef struct node *NodePointer;
NodePointer nil;
void insert(int key);
int delete (int key);
int deleteFirst();
int deleteLast();
void init();
main() {
int n, i, keydata;
char com[1... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
struct node {
int key;
struct node *next;
struct node *prev;
};
typedef struct node *NodePointer;
NodePointer nil;
void insert(int key);
int delete (int key);
int deleteFirst();
int deleteLast();
void init(); /* This fanction is initializing nil. */
m... | [
"control_flow.branch.if.condition.change"
] | 110,287 | 110,290 | u231257914 | c |
p02267 | #include <stdio.h>
int main() {
int i, j, k, s, numA, numB, num = 0;
scanf("%d", &numA);
int retuA[numA];
for (i = 0; i < numA; i++) {
scanf("%d", &retuA[i]);
}
scanf("%d", &numB);
int retuB[numB];
for (i = 0; i < numB; i++) {
scanf("%d", &retuB[i]);
}
for (i = 0; i < numA; i++) {
... |
#include <stdio.h>
int main() {
int i, j, k, s, numA, numB, num = 0;
scanf("%d", &numA);
int retuA[numA];
for (i = 0; i < numA; i++) {
scanf("%d", &retuA[i]);
}
scanf("%d", &numB);
int retuB[numB];
for (i = 0; i < numB; i++) {
scanf("%d", &retuB[i]);
}
for (i = 0; i < numB; i++) {
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 111,043 | 111,044 | u119662895 | c |
p02267 | #include <stdio.h>
int main() {
int i, j, k, s, numA, numB, num = 0;
scanf("%d", &numA);
int retuA[numA];
for (i = 0; i < numA; i++) {
scanf("%d", &retuA[i]);
}
scanf("%d", &numB);
int retuB[numB];
for (i = 0; i < numB; i++) {
scanf("%d", &retuB[i]);
}
for (i = 0; i < numA; i++) {
... |
#include <stdio.h>
int main() {
int i, j, k, s, numA, numB, num = 0;
scanf("%d", &numA);
int retuA[numA];
for (i = 0; i < numA; i++) {
scanf("%d", &retuA[i]);
}
scanf("%d", &numB);
int retuB[numB];
for (i = 0; i < numB; i++) {
scanf("%d", &retuB[i]);
}
for (i = 0; i < numB; i++) {
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"control_flow.continue.remove",
"control_flow.break.add"
] | 111,047 | 111,044 | u119662895 | c |
p02267 |
#include <stdio.h>
int main() {
int i, j, k, s, numA, numB, num = 0;
scanf("%d", &numA);
int retuA[numA];
for (i = 0; i < numA; i++) {
scanf("%d", &retuA[i]);
}
scanf("%d", &numB);
int retuB[numB];
for (i = 0; i < numB; i++) {
scanf("%d", &retuB[i]);
}
for (i = 0; i < numB; i++) {
... |
#include <stdio.h>
int main() {
int i, j, k, s, numA, numB, num = 0;
scanf("%d", &numA);
int retuA[numA];
for (i = 0; i < numA; i++) {
scanf("%d", &retuA[i]);
}
scanf("%d", &numB);
int retuB[numB];
for (i = 0; i < numB; i++) {
scanf("%d", &retuB[i]);
}
for (i = 0; i < numB; i++) {
... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 111,048 | 111,044 | u119662895 | c |
p02267 | #include <stdio.h>
int search(int A[], int n, int key) {
int i = 0;
A[n] = key;
while (A[i] != key)
i++;
return i != n;
}
int main() {
int i, n, A[10000 + 1], q, key, sum = 0;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
scanf("%d", &q);
for (i = 0; i < n; i++) {
scanf(... | #include <stdio.h>
int search(int A[], int n, int key) {
int i = 0;
A[n] = key;
while (A[i] != key)
i++;
return i != n;
}
int main() {
int i, n, A[10000 + 1], q, key, sum = 0;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf(... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 111,256 | 111,257 | u246775415 | c |
p02267 | #include <stdio.h>
// void linearSearch(int);
int main() {
int n, q, i, j, count = 0;
int S[10000];
int T[500];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &S[i]);
}
scanf("%d", &q);
for (j = 0; j < q; j++) {
scanf("%d", &T[j]);
}
for (j = 0; j < n; j++) {
for (i = 0; i < ... | #include <stdio.h>
// void linearSearch(int);
int main() {
int n, q, i, j, count = 0;
int S[10000];
int T[500];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &S[i]);
}
scanf("%d", &q);
for (j = 0; j < q; j++) {
scanf("%d", &T[j]);
}
for (j = 0; j < q; j++) {
for (i = 0; i < ... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 111,429 | 111,430 | u454160743 | c |
p02267 | #include <stdio.h>
#include <stdlib.h>
int main() {
int n, S[10001], q, T[501], i, j, count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &S[i]);
if (S[i] < 0 || S[i] > 1000000000) {
exit(1);
}
}
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &T[i]);
if (T[... | #include <stdio.h>
#include <stdlib.h>
int main() {
int n, S[10001], q, T[501], i, j, count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &S[i]);
if (S[i] < 0 || S[i] > 1000000000) {
exit(1);
}
}
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &T[i]);
if (T[... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 111,631 | 111,632 | u469438650 | c |
p02267 | #include <stdio.h>
#include <stdlib.h>
int main() {
int n, S[10001], q, T[501], i, j, count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &S[i]);
if (S[i] < 0 || S[i] > 1000000000) {
exit(1);
}
}
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &T[i]);
if (T[... | #include <stdio.h>
#include <stdlib.h>
int main() {
int n, S[10001], q, T[501], i, j, count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &S[i]);
if (S[i] < 0 || S[i] > 1000000000) {
exit(1);
}
}
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &T[i]);
if (T[... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 111,633 | 111,632 | u469438650 | c |
p02267 | #include <stdio.h>
#include <stdlib.h>
int main() {
int n, S[10001], q, T[501], i, j, count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &S[i]);
if (S[i] < 0 || S[i] > 1000000000) {
exit(1);
}
}
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &T[i]);
if (T[... | #include <stdio.h>
#include <stdlib.h>
int main() {
int n, S[10001], q, T[501], i, j, count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &S[i]);
if (S[i] < 0 || S[i] > 1000000000) {
exit(1);
}
}
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &T[i]);
if (T[... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"misc.off_by_one",
"control_flow.branch.if.condition.change"
] | 111,633 | 111,640 | u469438650 | c |
p02267 | #include <stdio.h>
#include <stdlib.h>
int main() {
int n, S[10001], q, T[501], i, j, count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &S[i]);
if (S[i] < 0 || S[i] > 1000000000) {
exit(1);
}
}
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &T[i]);
if (T[... | #include <stdio.h>
#include <stdlib.h>
int main() {
int n, S[10001], q, T[501], i, j, count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &S[i]);
if (S[i] < 0 || S[i] > 1000000000) {
exit(1);
}
}
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &T[i]);
if (T[... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 111,635 | 111,640 | u469438650 | c |
p02267 | #include <stdio.h>
#include <stdlib.h>
int main() {
int n, S[10001], q, T[501], i, j, count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &S[i]);
if (S[i] < 0 || S[i] > 1000000000) {
exit(1);
}
}
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &T[i]);
if (T[... | #include <stdio.h>
#include <stdlib.h>
int main() {
int n, S[10001], q, T[501], i, j, count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &S[i]);
if (S[i] < 0 || S[i] > 1000000000) {
exit(1);
}
}
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &T[i]);
if (T[... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"misc.off_by_one"
] | 111,636 | 111,640 | u469438650 | c |
p02267 | #include <stdio.h>
#include <stdlib.h>
int main() {
int n, S[10001], q, T[501], i, j, count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &S[i]);
if (S[i] < 0 || S[i] > 1000000000) {
exit(1);
}
}
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &T[i]);
if (T[... | #include <stdio.h>
#include <stdlib.h>
int main() {
int n, S[10001], q, T[501], i, j, count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &S[i]);
if (S[i] < 0 || S[i] > 1000000000) {
exit(1);
}
}
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &T[i]);
if (T[... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 111,637 | 111,640 | u469438650 | c |
p02267 | #include <stdio.h>
#include <stdlib.h>
int main() {
int n, S[10001], q, T[501], i, j, count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &S[i]);
if (S[i] < 0 || S[i] > 1000000000) {
exit(1);
}
}
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &T[i]);
if (T[... | #include <stdio.h>
#include <stdlib.h>
int main() {
int n, S[10001], q, T[501], i, j, count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &S[i]);
if (S[i] < 0 || S[i] > 1000000000) {
exit(1);
}
}
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &T[i]);
if (T[... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 111,639 | 111,640 | u469438650 | c |
p02267 | #include <stdio.h>
#define N 100000
#define Q 500
int main() {
int i, j, n, q, count = 0;
int S[N], T[Q];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &S[i]);
}
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &T[i]);
for (j = 0; j < n; j++) {
if (T[i] == S[j]) {
... | #include <stdio.h>
#define N 10000
#define Q 500
int main() {
int i, j, n, q, count = 0;
int S[N], T[Q];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &S[i]);
}
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &T[i]);
for (j = 0; j < n; j++) {
if (T[i] == S[j]) {
... | [
"preprocessor.define.value.change",
"literal.integer.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 111,680 | 111,681 | u405292327 | c |
p02267 | #include <stdio.h>
#define N 10000
#define Q 500
int main() {
int i, j, n, q, count = 0;
int S[N], T[Q];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &S[i]);
}
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &T[i]);
for (j = 0; j < n; j++) {
if (T[i] == S[j]) {
... | #include <stdio.h>
#define N 10000
#define Q 500
int main() {
int i, j, n, q, count = 0;
int S[N], T[Q];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &S[i]);
}
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &T[i]);
for (j = 0; j < n; j++) {
if (T[i] == S[j]) {
... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 111,682 | 111,681 | u405292327 | c |
p02270 | /* AOJ My Practice
* author: Leonardone @ NEETSDKASU
*/
#include <stdio.h>
int ws[100000] = {0};
int main(void) {
int n, k, w, i, mx = 0, sum = 0;
scanf("%d %d", &n, &k);
if (k > n) {
k = n;
}
for (i = 0; i < n; i++) {
scanf("%d", &w);
ws[i] = w;
sum += w;
if (w > mx) {
mx = w;
... | /* AOJ My Practice
* author: Leonardone @ NEETSDKASU
*/
#include <stdio.h>
int ws[100000] = {0};
int main(void) {
int n, k, w, i, mx = 0, sum = 0;
scanf("%d %d", &n, &k);
if (k > n) {
k = n;
}
for (i = 0; i < n; i++) {
scanf("%d", &w);
ws[i] = w;
sum += w;
if (w > mx) {
mx = w;
... | [] | 114,798 | 114,799 | u309428289 | c |
p02271 | #include <stdio.h>
int n, a[2000];
int solve(int i, int m) {
if (m == 0)
return 1;
if (i >= n)
return 0;
int x = solve(i + 1, m) || solve(i + 1, m - a[i]);
return x;
}
int main() {
int q, m, i;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
scanf("%d", &q);
for (i =... | #include <stdio.h>
int n, a[2000];
int solve(int i, int m) {
if (m == 0)
return 1;
if (i >= n)
return 0;
int x = solve(i + 1, m) || solve(i + 1, m - a[i]);
return x;
}
int main() {
int q, m, i;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &a[i]);
scanf("%d", &q);
for (i = 0; i ... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 115,398 | 115,399 | u041398010 | c |
p02271 | #include <stdio.h>
int n, A[50];
int solve(int i, int m) {
int res;
if (m == 0)
return 1;
if (i >= n)
return 0;
res = solve(i + 1, m) || solve(i + 1, m - A[i]);
return res;
}
int main() {
int q, i, M;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
scanf("%d", &q);
for (i ... | #include <stdio.h>
int n, A[50];
int solve(int i, int m) {
int res;
if (m == 0)
return 1;
if (i >= n)
return 0;
res = solve(i + 1, m) || solve(i + 1, m - A[i]);
return res;
}
int main() {
int q, i, M;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
scanf("%d", &q);
for (i ... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 116,068 | 116,069 | u710741012 | c |
p02271 | #include <stdio.h>
int solve(int, int);
int n, A[50];
int main() {
int n, q, i, j, l;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
scanf("%d", &q);
int M;
for (i = 0; i < q; i++) {
scanf("%d", &M);
if (solve(0, M)) {
printf("yes\n");
} else {
printf("no\n");... | #include <stdio.h>
int solve(int, int);
int n, A[50];
int main() {
int q, i;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
scanf("%d", &q);
int M;
for (i = 0; i < q; i++) {
scanf("%d", &M);
if (solve(0, M)) {
printf("yes\n");
} else {
printf("no\n");
}
... | [
"variable_declaration.remove"
] | 116,147 | 116,148 | u996180757 | c |
p02272 | #include <stdio.h>
#define MAX 500000
#define SENTINEL 2000000000
int L[MAX / 2 + 2], R[MAX / 2 + 2];
int count = 0;
void merge(int A[], int left, int mid, int right) {
int i, j, k;
int n1 = mid - left;
int n2 = right - mid;
for (i = 0; i < n1; i++)
L[i] = A[left + i];
for (i = 0; i < n2; i++)
R[i] =... | #include <stdio.h>
#define MAX 500000
#define SENTINEL 2000000000
int L[MAX / 2 + 2], R[MAX / 2 + 2];
int count = 0;
void merge(int A[], int left, int mid, int right) {
int i, j, k;
int n1 = mid - left;
int n2 = right - mid;
for (i = 0; i < n1; i++)
L[i] = A[left + i];
for (i = 0; i < n2; i++)
R[i] =... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 116,887 | 116,888 | u167812184 | c |
p02273 | #include <math.h>
#include <stdio.h>
typedef struct a {
double x;
double y;
} Point;
void kohho(Point, Point, int);
Point start, end;
int main() {
int n;
start.x = 0;
start.y = 0;
end.x = 100;
end.y = 0;
scanf("%d", &n);
printf("%f %f\n", start.x, start.y);
kohho(start, end, n);
printf("%f %f\n", ... | #include <math.h>
#include <stdio.h>
typedef struct a {
double x;
double y;
} Point;
void kohho(Point, Point, int);
Point start, end;
int main() {
int n;
start.x = 0;
start.y = 0;
end.x = 100;
end.y = 0;
scanf("%d", &n);
printf("%f %f\n", start.x, start.y);
kohho(start, end, n);
printf("%f %f\n", ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 117,993 | 117,994 | u322648397 | c |
p02275 | #include <stdio.h>
#include <stdlib.h>
#define MAX 2000001
#define SMAX 10000
int main() {
unsigned short *X, *Y;
int D[SMAX + 1];
int num, j, i;
scanf("%d", &num);
X = malloc(sizeof(short) * num + 1);
Y = malloc(sizeof(short) * num + 1);
for (i = 0; i <= SMAX; i++) {
D[i] = 0;
}
for (i = 0; ... | #include <stdio.h>
#include <stdlib.h>
#define MAX 2000001
#define SMAX 10000
int main() {
unsigned short *X, *Y;
int D[SMAX + 1];
int num, j, i;
scanf("%d", &num);
X = malloc(sizeof(short) * num + 1);
Y = malloc(sizeof(short) * num + 1);
for (i = 0; i <= SMAX; i++) {
D[i] = 0;
}
for (i = 0; ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 119,070 | 119,071 | u870219409 | c |
p02275 | #include <stdio.h>
#include <stdlib.h>
#define M 2000001
#define k 10001
int main() {
int *A, *B;
int C[k];
int n, i, j;
scanf("%d", &n);
A = malloc(sizeof(short) * n + 1);
B = malloc(sizeof(short) * n + 1);
for (i = 0; i <= k; i++)
C[i] = 0;
for (i = 0; i < n; i++) {
scanf("%hu", &A[i + 1])... | #include <stdio.h>
#include <stdlib.h>
#define M 2000001
#define k 10001
int main() {
int *A, *B;
int C[k];
int n, i, j;
scanf("%d", &n);
A = malloc(sizeof(int) * n + 1);
B = malloc(sizeof(int) * n + 1);
for (i = 0; i <= k; i++)
C[i] = 0;
for (i = 0; i < n; i++) {
scanf("%d", &A[i + 1]);
... | [
"assignment.value.change",
"variable_declaration.type.primitive.change",
"literal.string.change",
"call.arguments.change"
] | 119,509 | 119,510 | u851620892 | c |
p02276 | #include <ctype.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
//============================================================================
#define pred(x) ((x)-1)
#define succ(x) ((x) + 1)
//============================================================================
//-------------... | #include <ctype.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
//============================================================================
#define pred(x) ((x)-1)
#define succ(x) ((x) + 1)
//============================================================================
//-------------... | [
"control_flow.branch.while.replace.add",
"control_flow.loop.if.replace.remove"
] | 120,035 | 120,036 | u546929787 | c |
p02276 | #include <stdio.h>
#define MAX 100000
int A[MAX], n;
int partition(int p, int r) {
int x, i, j, t;
x = A[r];
i = p - 1;
for (j = p; j < r; j++) {
if (A[j] <= x) {
i++;
t = A[i];
A[i] = A[j];
A[j] = t;
}
}
t = A[i + 1];
A[i + 1] = A[r];
A[r] = r;
return i + 1;
}
int m... | #include <stdio.h>
#define MAX 100000
int A[MAX], n;
int partition(int p, int r) {
int x, i, j, t;
x = A[r];
i = p - 1;
for (j = p; j < r; j++) {
if (A[j] <= x) {
i++;
t = A[i];
A[i] = A[j];
A[j] = t;
}
}
t = A[i + 1];
A[i + 1] = A[r];
A[r] = t;
return i + 1;
}
int m... | [
"assignment.value.change",
"identifier.change"
] | 120,109 | 120,110 | u418500948 | c |
p02276 | #include <stdio.h>
#include <stdlib.h>
#define MAX 100000
int A[MAX + 1], n;
int partition(int p, int r) {
int x, i, j, temp = 0;
x = A[r];
i = p - 1;
for (j = p; j < r; j++) {
if (A[j] <= x) {
i = i + 1;
temp = A[i];
A[i] = A[j];
A[j] = temp;
}
}
temp = A[i + 1];
A[i + 1] ... | #include <stdio.h>
#include <stdlib.h>
#define MAX 100000
int A[MAX + 1], n;
int partition(int p, int r) {
int x, i, j, temp = 0;
x = A[r];
i = p - 1;
for (j = p; j < r; j++) {
if (A[j] <= x) {
i = i + 1;
temp = A[i];
A[i] = A[j];
A[j] = temp;
}
}
temp = A[i + 1];
A[i + 1] ... | [
"expression.operation.binary.remove"
] | 120,414 | 120,415 | u487045794 | c |
p02279 | #include <stdio.h>
#define MAX 1000000
typedef struct {
int x, y, z;
} Tree;
Tree A[MAX];
int Dep(int);
main() {
int i, j, n, num, deg, c, k = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
A[i].x = -1;
A[i].y = -1;
A[i].z = -1;
}
for (i = 0; i < n; i++) {
scanf("%d%d", &num, °... | #include <stdio.h>
#define MAX 1000000
typedef struct {
int x, y, z;
} Tree;
Tree A[MAX];
int Dep(int);
main() {
int i, j, n, num, deg, c, k = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
A[i].x = -1;
A[i].y = -1;
A[i].z = -1;
}
for (i = 0; i < n; i++) {
scanf("%d%d", &num, °... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 121,765 | 121,766 | u068910043 | c |
p02279 | #include <stdio.h>
#define MAX 1000000
typedef struct {
int x, y, z;
} Tree;
Tree A[MAX];
int Dep(int);
main() {
int i, j, n, num, deg, c, k = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
A[i].x = -1;
A[i].y = -1;
A[i].z = -1;
}
for (i = 0; i < n; i++) {
scanf("%d%d", &num, °... | #include <stdio.h>
#define MAX 1000000
typedef struct {
int x, y, z;
} Tree;
Tree A[MAX];
int Dep(int);
main() {
int i, j, n, num, deg, c, k = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
A[i].x = -1;
A[i].y = -1;
A[i].z = -1;
}
for (i = 0; i < n; i++) {
scanf("%d%d", &num, °... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 121,767 | 121,766 | u068910043 | c |
p02279 | #include <stdio.h>
#define MAX 1000000
typedef struct {
int x, y, z;
} Tree;
Tree A[MAX];
int Dep(int);
main() {
int i, j, n, num, deg, c, k = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
A[i].x = -1;
A[i].y = -1;
A[i].z = -1;
}
for (i = 0; i < n; i++) {
scanf("%d%d", &num, °... | #include <stdio.h>
#define MAX 1000000
typedef struct {
int x, y, z;
} Tree;
Tree A[MAX];
int Dep(int);
main() {
int i, j, n, num, deg, c, k = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
A[i].x = -1;
A[i].y = -1;
A[i].z = -1;
}
for (i = 0; i < n; i++) {
scanf("%d%d", &num, °... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 121,768 | 121,766 | u068910043 | c |
p02279 | #include <stdio.h>
#define MAX 100005
#define NIL -1
struct Node {
int p, l, r;
};
struct Node T[MAX];
int n, D[MAX];
void print(int u) {
int i, c;
printf("node %d: ", u);
printf("parent = %d, ", T[u].p);
printf("depth = %d, ", D[u]);
if (T[u].p == NIL)
printf("root, ");
else if (T[u].l == NIL)
... | #include <stdio.h>
#define MAX 100005
#define NIL -1
struct Node {
int p, l, r;
};
struct Node T[MAX];
int n, D[MAX];
void print(int u) {
int i, c;
printf("node %d: ", u);
printf("parent = %d, ", T[u].p);
printf("depth = %d, ", D[u]);
if (T[u].p == NIL)
printf("root, ");
else if (T[u].l == NIL)
... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 121,832 | 121,833 | u108514106 | c |
p02279 | #include <stdio.h>
#define MAX 100005
#define NIL -1
struct Node {
int p, l, r;
};
struct Node T[MAX];
int n, D[MAX];
void print(int u) {
int i, c;
printf("node %d: ", u);
printf("parent = %d, ", T[u].p);
printf("depth = %d, ", D[u]);
if (T[u].p == NIL)
printf("root, ");
else if (T[u].l == NIL)
... | #include <stdio.h>
#define MAX 100005
#define NIL -1
struct Node {
int p, l, r;
};
struct Node T[MAX];
int n, D[MAX];
void print(int u) {
int i, c;
printf("node %d: ", u);
printf("parent = %d, ", T[u].p);
printf("depth = %d, ", D[u]);
if (T[u].p == NIL)
printf("root, ");
else if (T[u].l == NIL)
... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 121,834 | 121,833 | u108514106 | c |
p02279 | #include <stdio.h>
#define N 100000
struct Node {
int p;
int l;
int r;
};
struct Node T[N];
int D[N];
int Depth(int x) {
int sum = 0;
while (T[x].p != -1) {
sum++;
x = T[x].p;
}
return sum;
}
int main(void) {
int n, i, j, k, c, s, node;
scanf("%d", &n);
for (i = 0; i < n; i++) {
T[... | #include <stdio.h>
#define N 100000
struct Node {
int p;
int l;
int r;
};
struct Node T[N];
int D[N];
int Depth(int x) {
int sum = 0;
while (T[x].p != -1) {
sum++;
x = T[x].p;
}
return sum;
}
int main(void) {
int n, i, j, k, c, s, node;
scanf("%d", &n);
for (i = 0; i < n; i++) {
T[... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 121,905 | 121,906 | u919980891 | c |
p02279 | #include <stdio.h>
#define N 100000
struct Node {
int p;
int l;
int r;
};
struct Node T[N];
int D[N];
int Depth(int x) {
int sum = 0;
while (T[x].p != -1) {
sum++;
x = T[x].p;
}
return sum;
}
int main(void) {
int n, i, j, k, c, s, node;
scanf("%d", &n);
for (i = 0; i < n; i++) {
T[... | #include <stdio.h>
#define N 100000
struct Node {
int p;
int l;
int r;
};
struct Node T[N];
int D[N];
int Depth(int x) {
int sum = 0;
while (T[x].p != -1) {
sum++;
x = T[x].p;
}
return sum;
}
int main(void) {
int n, i, j, k, c, s, node;
scanf("%d", &n);
for (i = 0; i < n; i++) {
T[... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 121,907 | 121,906 | u919980891 | c |
p02279 | #include <stdio.h>
#define N 100000
struct Node {
int p;
int l;
int r;
};
struct Node A[N];
int n, B[N];
int rec(int x, int y) {
B[x] = y;
if (A[x].r != -1)
rec(A[x].r, y);
if (A[x].l != -1)
rec(A[x].l, y + 1);
}
int main() {
int i, j, d, v, c, l, r, n, op;
scanf("%d", &n);
for (i = 0; i ... | #include <stdio.h>
#define N 100000
struct Node {
int p;
int l;
int r;
};
struct Node A[N];
int n, B[N];
int rec(int x, int y) {
B[x] = y;
if (A[x].r != -1)
rec(A[x].r, y);
if (A[x].l != -1)
rec(A[x].l, y + 1);
}
int main() {
int i, j, d, v, c, l, r, n, op;
scanf("%d", &n);
for (i = 0; i ... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 122,119 | 122,120 | u393989512 | c |
p02279 | #include <stdio.h>
#define N 100000
struct Node {
int p;
int l;
int r;
};
struct Node A[N];
int n, B[N];
int rec(int x, int y) {
B[x] = y;
if (A[x].r != -1)
rec(A[x].r, y);
if (A[x].l != -1)
rec(A[x].l, y + 1);
}
int main() {
int i, j, d, v, c, l, r, n, op;
scanf("%d", &n);
for (i = 0; i ... | #include <stdio.h>
#define N 100000
struct Node {
int p;
int l;
int r;
};
struct Node A[N];
int n, B[N];
int rec(int x, int y) {
B[x] = y;
if (A[x].r != -1)
rec(A[x].r, y);
if (A[x].l != -1)
rec(A[x].l, y + 1);
}
int main() {
int i, j, d, v, c, l, r, n, op;
scanf("%d", &n);
for (i = 0; i ... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 122,121 | 122,120 | u393989512 | c |
p02280 | #include <stdio.h>
#define MAX 10000
#define NIL -1
struct Node {
int parent, left, right;
};
struct Node T[MAX];
int n, D[MAX], H[MAX];
void setDepth(int u, int d) {
if (u == NIL)
return;
D[u] = d;
setDepth(T[u].left, d + 1);
setDepth(T[u].right, d + 1);
}
int setHeight(int u) {
int h1 = 0, h2 = 0;... | #include <stdio.h>
#define MAX 10000
#define NIL -1
struct Node {
int parent, left, right;
};
struct Node T[MAX];
int n, D[MAX], H[MAX];
void setDepth(int u, int d) {
if (u == NIL)
return;
D[u] = d;
setDepth(T[u].left, d + 1);
setDepth(T[u].right, d + 1);
}
int setHeight(int u) {
int h1 = 0, h2 = 0;... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 122,635 | 122,636 | u227346605 | c |
p02281 | #include <stdio.h>
#define Max 10000
#define NIL -1
typedef struct Node {
int p, l, r;
} Node;
Node T[Max];
int n;
void preParse(int u) {
if (u == NIL)
return;
printf(" %d", u);
preParse(T[u].l);
preParse(T[u].r);
}
void inParse(int u) {
if (u == NIL)
return;
inParse(T[u].l);
printf(" %d", ... | #include <stdio.h>
#define Max 10000
#define NIL -1
typedef struct Node {
int p, l, r;
} Node;
Node T[Max];
int n;
void preParse(int u) {
if (u == NIL)
return;
printf(" %d", u);
preParse(T[u].l);
preParse(T[u].r);
}
void inParse(int u) {
if (u == NIL)
return;
inParse(T[u].l);
printf(" %d", ... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 123,722 | 123,723 | u158672065 | c |
p02283 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
struct node {
struct node *left;
struct node *right;
struct node *parent;
int key;
};
struct node *T;
void Insert(int);
void Inorder(struct node *);
void Preorder(struct node *);
// void Free(struct node*);
int main() {
int n, i, key;
char func[6];
... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
struct node {
struct node *left;
struct node *right;
struct node *parent;
int key;
};
struct node *T;
void Insert(int);
void Inorder(struct node *);
void Preorder(struct node *);
int main() {
int n, i, key;
char func[6];
T = (struct node *)malloc(... | [
"call.remove"
] | 123,906 | 123,907 | u752082358 | c |
p02283 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
struct node {
struct node *left;
struct node *right;
struct node *parent;
int key;
};
struct node *T;
void Insert(int);
void Inorder(struct node *);
void Preorder(struct node *);
int main() {
int n, i, key;
char func[6];
T = (struct node *)malloc(... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
struct node {
struct node *left;
struct node *right;
struct node *parent;
int key;
};
struct node *T;
void Insert(int);
void Inorder(struct node *);
void Preorder(struct node *);
int main() {
int n, i, key;
char func[6];
T = (struct node *)malloc(... | [
"call.remove"
] | 123,908 | 123,907 | u752082358 | c |
p02283 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
struct node {
struct node *left;
struct node *right;
struct node *parent;
int key;
};
struct node *T;
void Insert(int);
void Inorder(struct node *);
void Preorder(struct node *);
void Free(struct node *);
int main() {
int n, i, key;
char func[6];
... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
struct node {
struct node *left;
struct node *right;
struct node *parent;
int key;
};
struct node *T;
void Insert(int);
void Inorder(struct node *);
void Preorder(struct node *);
void Free(struct node *);
int main() {
int n, i, key;
char func[6];
... | [
"call.remove"
] | 123,909 | 123,910 | u752082358 | c |
p02284 | #include <stdio.h>
#include <stdlib.h>
struct node {
struct node *right;
struct node *left;
struct node *parent;
int key;
};
typedef struct node *Node;
#define NIL NULL
Node root;
Node treeSearch(Node, int);
void insert(int);
void inorder(Node);
void preorder(Node);
int main() {
int n, i, x;
char com[20]... | #include <stdio.h>
#include <stdlib.h>
struct node {
struct node *right;
struct node *left;
struct node *parent;
int key;
};
typedef struct node *Node;
#define NIL NULL
Node root;
Node treeSearch(Node, int);
void insert(int);
void inorder(Node);
void preorder(Node);
int main() {
int n, i, x;
char com[20]... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 124,571 | 124,572 | u356896389 | c |
p02285 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
struct Node {
int key;
struct Node *right, *left, *parent;
};
struct Node *root, *NIL;
struct Node *treeMinimum(struct Node *x) {
while (x->left != NIL)
x = x->left;
return x;
}
struct Node *find(struct Node *u, int k) {
while (u != NIL && k !... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
struct Node {
int key;
struct Node *right, *left, *parent;
};
struct Node *root, *NIL;
struct Node *treeMinimum(struct Node *x) {
while (x->left != NIL)
x = x->left;
return x;
}
struct Node *find(struct Node *u, int k) {
while (u != NIL && k !... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 124,772 | 124,773 | u425625552 | c |
p02287 | #include <stdio.h>
int parent(int i) { return i / 2; }
int left(int i) { return 2 * i; }
int right(int i) { return 2 * i + 1; }
main() {
int i, n, A[250];
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%d", &A[i]);
}
for (i = 1; i <= n; i++) {
printf("node %d: ", i);
printf("key = %d, ", A[i]... | #include <stdio.h>
int parent(int i) { return i / 2; }
int left(int i) { return 2 * i; }
int right(int i) { return 2 * i + 1; }
main() {
int i, n, A[250];
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%d", &A[i]);
}
for (i = 1; i <= n; i++) {
printf("node %d: ", i);
printf("key = %d, ", A[i]... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 125,031 | 125,032 | u050424952 | c |
p02287 | #include <stdio.h>
int parent(int i) { return i / 2; }
int left(int i) { return 2 * i; }
int right(int i) { return 2 * i + 1; }
main() {
int i, n, A[250];
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%d", &A[i]);
}
for (i = 1; i <= n; i++) {
printf("node %d: ", i);
printf("key = %d, ", A[i]... | #include <stdio.h>
int parent(int i) { return i / 2; }
int left(int i) { return 2 * i; }
int right(int i) { return 2 * i + 1; }
main() {
int i, n, A[250];
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%d", &A[i]);
}
for (i = 1; i <= n; i++) {
printf("node %d: ", i);
printf("key = %d, ", A[i]... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 125,033 | 125,032 | u050424952 | c |
p02288 | #include <stdio.h>
#include <stdlib.h>
int n;
int left(int i) { return 2 * i; }
int right(int i) { return 2 * i + 1; }
void maxHeapify(int a[], int i) {
int l, r, largest, tmp;
l = left(i);
r = right(i);
if (i <= n && a[l] > a[i])
largest = l;
else
largest = i;
if (r <= n && a[r] > a[largest])
... | #include <stdio.h>
#include <stdlib.h>
int n;
int left(int i) { return 2 * i; }
int right(int i) { return 2 * i + 1; }
void maxHeapify(int a[], int i) {
int l, r, largest, tmp;
l = left(i);
r = right(i);
if (l <= n && a[l] > a[i])
largest = l;
else
largest = i;
if (r <= n && a[r] > a[largest])
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 125,519 | 125,520 | u431172193 | c |
p02287 | #include <stdio.h>
#define MAX 100000
int parent(int i) { return i / 2; }
int left(int i) { return 2 * i; }
int right(int i) { return 2 * i + 1; }
int main() {
int H, i, A[MAX + 1];
scanf("%d", &H);
for (i = 0; i <= H; i++) {
scanf("%d", A[i]);
}
for (i = 1; i <= H; i++) {
printf("node %d: key = ... | #include <stdio.h>
#define MAX 100000
int parent(int i) { return i / 2; }
int left(int i) { return 2 * i; }
int right(int i) { return 2 * i + 1; }
int main() {
int H, i, A[MAX + 1];
scanf("%d", &H);
for (i = 1; i <= H; i++) {
scanf("%d", &A[i]);
}
for (i = 1; i <= H; i++) {
printf("node %d: key ... | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.unary.reference.add"
] | 127,282 | 127,283 | u414083526 | c |
p02287 | #include <stdio.h>
#define MAX 100000
int parent(int i) { return i / 2; }
int left(int i) { return 2 * i; }
int right(int i) { return 2 * i + 1; }
int main() {
int H, i, A[MAX + 1];
scanf("%d", &H);
for (i = 1; i <= H; i++) {
scanf("%d", A[i]);
}
for (i = 1; i <= H; i++) {
printf("node %d: key = ... | #include <stdio.h>
#define MAX 100000
int parent(int i) { return i / 2; }
int left(int i) { return 2 * i; }
int right(int i) { return 2 * i + 1; }
int main() {
int H, i, A[MAX + 1];
scanf("%d", &H);
for (i = 1; i <= H; i++) {
scanf("%d", &A[i]);
}
for (i = 1; i <= H; i++) {
printf("node %d: key ... | [
"expression.operation.unary.reference.add"
] | 127,284 | 127,283 | u414083526 | c |
p02287 | #include <stdio.h>
#define MAX 251
int main() {
int n, i;
int array[MAX];
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%d", &array[i]);
}
for (i = 1; i <= n; i++) {
printf("node %d: key = %d, ", i, array[i]);
if (array[i / 2] >= 1)
printf("parent key = %d, ", array[i / 2]);
i... | #include <stdio.h>
#define MAX 251
int main() {
int n, i;
int array[MAX];
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%d", &array[i]);
}
for (i = 1; i <= n; i++) {
printf("node %d: key = %d, ", i, array[i]);
if (i / 2 >= 1)
printf("parent key = %d, ", array[i / 2]);
if (2 * ... | [
"control_flow.loop.for.condition.change",
"control_flow.branch.if.condition.change"
] | 127,545 | 127,546 | u587378263 | c |
p02287 |
#include <stdio.h>
void parent(int);
void left(int);
void right(int);
int n;
int a[251];
int main() {
scanf("%d", &n);
int i;
for (i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (i = 1; i <= n; i++) {
printf("node %d: key = %d, ", i, a[i]);
parent(i);
left(i);
right(i);
printf("\n");
}... |
#include <stdio.h>
void parent(int);
void left(int);
void right(int);
int n;
int a[251];
int main() {
scanf("%d", &n);
int i;
for (i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (i = 1; i <= n; i++) {
printf("node %d: key = %d, ", i, a[i]);
parent(i);
left(i);
right(i);
printf("\n");
... | [
"control_flow.return.add",
"control_flow.return.0.add",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 127,639 | 127,640 | u025527822 | c |
p02287 |
#include <stdio.h>
void parent(int);
void left(int);
void right(int);
int n;
int a[251];
int main() {
scanf("%d", &n);
int i;
for (i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (i = 1; i <= n; i++) {
printf("node %d: key = %d, ", i, a[i]);
parent(i);
left(i);
right(i);
printf("\n");
... |
#include <stdio.h>
void parent(int);
void left(int);
void right(int);
int n;
int a[251];
int main() {
scanf("%d", &n);
int i;
for (i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (i = 1; i <= n; i++) {
printf("node %d: key = %d, ", i, a[i]);
parent(i);
left(i);
right(i);
printf("\n");
... | [
"control_flow.return.add",
"control_flow.return.0.add",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 127,641 | 127,640 | u025527822 | c |
p02287 |
#include <stdio.h>
void parent(int);
void left(int);
void right(int);
int n;
int a[251];
int main() {
scanf("%d", &n);
int i;
for (i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (i = 1; i <= n; i++) {
printf("node %d: key = %d, ", i, a[i]);
parent(i);
left(i);
right(i);
printf("\n");
}... |
#include <stdio.h>
void parent(int);
void left(int);
void right(int);
int n;
int a[251];
int main() {
scanf("%d", &n);
int i;
for (i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (i = 1; i <= n; i++) {
printf("node %d: key = %d, ", i, a[i]);
parent(i);
left(i);
right(i);
printf("\n");
... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 127,642 | 127,640 | u025527822 | c |
p02379 | #include <math.h>
#include <stdio.h>
int main(void) {
double x1, x2, y1, y2;
scanf("%lf %lf", &x1, &x2);
scanf("%lf %lf", &y1, &y2);
printf("%f\n", sqrt((x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1)));
return 0;
} | #include <math.h>
#include <stdio.h>
int main(void) {
double x1, x2, y1, y2;
scanf("%lf %lf", &x1, &y1);
scanf("%lf %lf", &x2, &y2);
printf("%f\n", sqrt((x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1)));
return 0;
} | [
"identifier.change",
"call.arguments.change"
] | 134,567 | 134,568 | u873302699 | c |
p02384 | #include <stdio.h>
int main(int argc, const char *argv[]) {
int s[6];
int i, j;
int answer[25];
int tmp;
int count = 0;
int top, front;
for (i = 0; i < 6; i++) {
scanf("%d", &s[i]);
}
scanf("%d", &j);
for (i = 0; i < j; i++) {
scanf("%d", &top);
scanf("%d", &front);
if (top == s[0])... | #include <stdio.h>
int main(int argc, const char *argv[]) {
int s[6];
int i, j;
int answer[25];
int tmp;
int count = 0;
int top, front;
for (i = 0; i < 6; i++) {
scanf("%d", &s[i]);
}
scanf("%d", &j);
for (i = 0; i < j; i++) {
scanf("%d", &top);
scanf("%d", &front);
if (top == s[0])... | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"io.output.change"
] | 137,659 | 137,660 | u677269303 | c |
p02388 | #include <stdio.h>
int main() {
int x;
scanf("%d", &x);
printf("%d\n", x * 3);
return 0;
} | #include <stdio.h>
int main() {
int x;
scanf("%d", &x);
printf("%d\n", (x * x * x));
return 0;
}
| [
"call.arguments.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change",
"io.output.change"
] | 139,489 | 139,490 | u011621222 | c |
p02388 | #include <stdio.h>
int main() {
int x;
scanf("%d", &x);
printf("%d\n", x * 3);
return 0;
} | #include <stdio.h>
int main() {
int x;
scanf("%d", &x);
printf("%d\n", x * x * x);
return 0;
}
| [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 139,489 | 139,496 | u011621222 | c |
p02388 | #include <stdio.h>
int main() {
int x;
scanf("%d", &x);
printf("%d\n", x);
return 0;
} | #include <stdio.h>
int main() {
int x;
scanf("%d", &x);
printf("%d\n", x * x * x);
return 0;
} | [
"expression.operation.binary.add"
] | 139,626 | 139,627 | u389172382 | c |
p02388 | #include <stdio.h>
int main() {
int x;
scanf("%d", &x);
printf("%d\n", x);
return 0;
} | #include <stdio.h>
int main(void) {
// your code goes here
int x;
scanf("%d", &x);
printf("%d\n", x * x * x);
return 0;
} | [
"function.parameters.parameter.add"
] | 139,626 | 139,628 | u389172382 | c |
p02388 | #include <stdio.h>
int main() {
int x = 0;
scanf("\d", &x);
printf("\d\n", x * x * x);
} | #include <stdio.h>
int main() {
int x = 0;
scanf("%d", &x);
printf("%d\n", x * x * x);
return 0;
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 139,927 | 139,928 | u520121167 | c |
p02388 | #include <stdio.h>
int main() {
int x = 0;
scanf("%d", &x);
printf("\d\n", x * x * x);
} | #include <stdio.h>
int main() {
int x = 0;
scanf("%d", &x);
printf("%d\n", x * x * x);
return 0;
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 139,929 | 139,928 | u520121167 | c |
p02388 | #include <stdio.h>
int main() {
int x = 0;
scanf("%d", x);
printf("%d\n", x * x * x);
return 0;
} | #include <stdio.h>
int main() {
int x = 0;
scanf("%d", &x);
printf("%d\n", x * x * x);
return 0;
} | [
"expression.operation.unary.reference.add"
] | 139,931 | 139,928 | u520121167 | c |
p02388 | #include <stdio.h>
int main(void) {
int a, x;
scanf("%d\n", &x);
a = x * x * x;
printf("x???3???=%d\n", a);
return 0;
} | #include <stdio.h>
int main(void) {
int a, x;
scanf("%d\n", &x);
a = x * x * x;
printf("%d\n", a);
return 0;
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 140,269 | 140,270 | u117671979 | c |
p02388 | #include <stdio.h>
int main(void) {
int x, ans;
scanf("%d", &x);
ans = x * x * x;
printf("?????????%d??§???\n", ans);
return 0;
}
| #include <stdio.h>
int main(void) {
int x, ans;
scanf("%d", &x);
ans = x * x * x;
printf("%d\n", ans);
return 0;
}
| [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 140,796 | 140,797 | u765149488 | c |
p02389 |
#include <stdio.h>
int main() {
int a, b;
scanf("%d %d", &a, &b);
printf("%d %d\n", (a + b) * 2);
return 0;
}
|
#include <stdio.h>
int main() {
int a, b;
scanf("%d %d", &a, &b);
printf("%d %d\n", a * b, (a + b) * 2);
return 0;
}
| [
"call.arguments.add"
] | 144,462 | 144,463 | u535872523 | c |
p02389 | #include <stdio.h>
int main(void) {
int a, b, s, l;
scanf("%d %d", &a, &b);
s = a * b;
l = (a + b) * 2;
printf("%d &d", s, l);
return 0;
} | #include <stdio.h>
int main(void) {
int a, b, s, l;
scanf("%d %d\n", &a, &b);
s = a * b;
l = (a + b) * 2;
printf("%d %d\n", s, l);
return 0;
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 144,841 | 144,842 | u666869674 | c |
p02389 | #include <stdio.h>
int main(void) {
int a, b, s, l;
scanf("%d %d", &a, &b);
s = a * b;
l = (a + b) * 2;
printf("%d &d\n", s, l);
return 0;
} | #include <stdio.h>
int main(void) {
int a, b, s, l;
scanf("%d %d\n", &a, &b);
s = a * b;
l = (a + b) * 2;
printf("%d %d\n", s, l);
return 0;
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 144,843 | 144,842 | u666869674 | c |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.