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 |
|---|---|---|---|---|---|---|---|
p03324 | #include <math.h>
#include <stdio.h>
int main(void) {
double d, n;
scanf("%lf%lf", &d, &n);
double ans = pow(100.0, d);
if (n == 100)
ans *(n + 1);
else
ans *n;
printf("%.0lf\n", ans);
return 0;
} | #include <math.h>
#include <stdio.h>
int main(void) {
double d, n;
scanf("%lf%lf", &d, &n);
double ans = pow(100.0, d);
if (n == 100)
ans *= (n + 1);
else
ans *= n;
printf("%.0lf\n", ans);
return 0;
} | [
"assignment.compound.arithmetic.replace.add",
"expression.operator.arithmetic.replace.remove",
"expression.operation.binary.change"
] | 1,101,821 | 1,101,822 | u692797455 | c |
p03324 | #include <math.h>
#include <stdio.h>
int main(int argc, char const *argv[]) {
int D, N;
scanf("%d%d", &D, &N);
printf("%.0Lf", powl(100, D) * (N == 100) ? 101 : N);
return 0;
} | #include <math.h>
#include <stdio.h>
int main(int argc, char const *argv[]) {
int D, N;
scanf("%d%d", &D, &N);
printf("%.0Lf", powl(100, D) * ((N == 100) ? 101 : N));
return 0;
} | [
"call.arguments.change"
] | 1,102,589 | 1,102,590 | u778347695 | c |
p03325 | #include <stdio.h>
int main() {
int N, i, j, b = 0, c = 1;
int a[10000];
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &a[i]);
}
for (j = 0; j < N; j++) {
while (a[j] % 2 != 1) {
a[j] = a[j] / 2;
b++;
}
c = c + b;
b = 0;
}
printf("%d", c);
return 0;
} | #include <stdio.h>
int main() {
int N, i, j, b = 0, c = 0;
int a[10000];
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &a[i]);
}
for (j = 0; j < N; j++) {
while (a[j] % 2 != 1) {
a[j] = a[j] / 2;
b++;
}
c = c + b;
b = 0;
}
printf("%d", c);
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,103,216 | 1,103,217 | u313578168 | c |
p03327 | #include <stdio.h>
int main() {
int n;
scanf("%d", &n);
if (n < 1000)
printf("ABC¥n");
else
printf("ABD¥n");
return 0;
} | #include <stdio.h>
int main() {
int n;
scanf("%d", &n);
if (n < 1000)
printf("ABC\n");
else
printf("ABD\n");
return 0;
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 1,104,336 | 1,104,337 | u592248346 | c |
p03339 | #include <stdio.h>
int east[300005], west[300005];
char a[300005];
int main() {
int n;
scanf("%d", &n);
scanf("%s", &a[1]);
int i;
for (i = 1; i <= n; i++) {
east[i] = east[i - 1];
if (a[i] == 'E')
east[i]++;
}
for (i = n; i >= 1; i--) {
west[i] = west[i + 1];
if (a[i] == 'W')
... | #include <stdio.h>
int east[300005], west[300005];
char a[300005];
int main() {
int n;
scanf("%d", &n);
scanf("%s", &a[1]);
int i;
for (i = 1; i <= n; i++) {
east[i] = east[i - 1];
if (a[i] == 'W')
east[i]++;
}
for (i = n; i >= 1; i--) {
west[i] = west[i + 1];
if (a[i] == 'E')
... | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 1,113,637 | 1,113,638 | u582770155 | c |
p03351 | #include <stdio.h>
#include <stdlib.h>
int main() {
int a, b, c, d, e, f, g;
scanf("%d%d%d%d", &a, &b, &c, &d);
e = abs(b - a);
f = abs(c - a);
g = abs(c - b);
if (g <= d && e <= d && f <= d)
printf("Yes");
else
printf("No");
return 0;
} | #include <stdio.h>
#include <stdlib.h>
int main() {
int a, b, c, d, e, f, g;
scanf("%d%d%d%d", &a, &b, &c, &d);
e = abs(b - a);
f = abs(c - a);
g = abs(c - b);
if (g <= d && e <= d || f <= d)
printf("Yes");
else
printf("No");
return 0;
} | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 1,120,011 | 1,120,012 | u473296729 | c |
p03352 | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
int v[1000];
int comparator(const void *p, const void *q) {
int l = *(const int *)p;
int r = *(const int *)q;
return (l - r);
}
int main() {
int k = 0, nr, x, i;
scanf("%d", &x);
v[k++] = 1;
if (sqrt(x) == (int)sqrt(x)) {
printf("%d", x);
r... | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
int v[10000];
int comparator(const void *p, const void *q) {
int l = *(const int *)p;
int r = *(const int *)q;
return (l - r);
}
int main() {
int k = 0, nr, x, i;
scanf("%d", &x);
v[k++] = 1;
if (sqrt(x) == (int)sqrt(x)) {
printf("%d", x);
... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"expression.operation.binary.remove"
] | 1,123,410 | 1,123,411 | u573911384 | c |
p03359 | #include <stdio.h>
int main(void) {
int a;
int b;
if (0 < a <= 12) {
int a1 = scanf("%d", &a);
}
if (0 < b < 32) {
int b1 = scanf("%d", &b);
}
// if(scanf("%d %d",&a,&b)!=2||a<1||a>12||b<1||b>31){
// printf("0\n");
// exit(1);
// }
int count = 0;
if (a <= b) {
count = a;
... | #include <stdio.h>
int main(void) {
int a;
int b;
if (0 < a <= 12) {
int a1 = scanf("%d", &a);
}
if (0 < b < 32) {
int b1 = scanf("%d", &b);
}
// if(scanf("%d %d",&a,&b)!=2||a<1||a>12||b<1||b>31){
// printf("0\n");
// exit(1);
// }
int count = 0;
if (a <= b) {
count = a;
... | [
"assignment.value.change",
"assignment.change"
] | 1,127,828 | 1,127,829 | u313268495 | c |
p03360 | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
int desc(const void *a, const void *b) { return *(int *)b - *(int *)a; }
int main() {
int number_k;
int number[3];
scanf("%d %d %d", &number[0], &number[1], &number[2]);
qsort(number, 3, sizeof(int), desc);
scanf("%d", &number_k);
printf("%d\n", pow... | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
int desc(const void *a, const void *b) { return *(int *)b - *(int *)a; }
int main() {
int number_k;
int number[3];
scanf("%d %d %d", &number[0], &number[1], &number[2]);
qsort(number, 3, sizeof(int), desc);
scanf("%d", &number_k);
printf("%d\n", (in... | [
"type_conversion.add"
] | 1,129,035 | 1,129,036 | u675751622 | c |
p03369 | #include <stdio.h>
int main(void) {
int price = 0;
char topping[3];
scanf("%s", topping);
if (topping[0] = 'o')
price += 100;
if (topping[1] = 'o')
price += 100;
if (topping[2] = 'o')
price += 100;
printf("%d\n", price + 700);
return 0;
} | #include <stdio.h>
int main(void) {
int price = 0;
char topping[4];
scanf("%s", topping);
if (topping[0] == 'o')
price += 100;
if (topping[1] == 'o')
price += 100;
if (topping[2] == 'o')
price += 100;
printf("%d\n", price + 700);
return 0;
} | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,137,102 | 1,137,103 | u565219356 | c |
p03371 | #include <stdio.h>
int a, b, c, x, y;
void search(int i, int *no, int *min) {
if (i == 3) {
int tmp = no[0] * 2 * c + no[1] * a + no[2] * b;
if (*min > tmp) {
*min = tmp;
}
} else if (i == 0) {
if (x > y) {
for (int j = 0; j <= x; j++) {
no[i] = j;
search(i + 1, no, min... | #include <stdio.h>
int a, b, c, x, y;
void search(int i, int *no, int *min) {
if (i == 3) {
int tmp = no[0] * 2 * c + no[1] * a + no[2] * b;
// printf("%d %d %d %d\n",no[0],no[1],no[2],tmp);
if (*min > tmp) {
*min = tmp;
}
} else if (i == 0) {
if (x > y) {
for (int j = 0; j <= x... | [
"control_flow.loop.for.update.change",
"expression.operation.binary.remove"
] | 1,137,830 | 1,137,831 | u477233273 | c |
p03377 | #include <stdio.h>
int main() {
int a, b, c;
scanf("%d", &a);
scanf("%d", &b);
scanf("%d", &c);
a = c - a;
if (a <= b && a >= 0) {
printf("Yes\n");
} else if (a > b || a < 0) {
printf("No\n");
}
return 0;
} | #include <stdio.h>
int main() {
int a, b, c;
scanf("%d", &a);
scanf("%d", &b);
scanf("%d", &c);
a = c - a;
if (a <= b && a >= 0) {
printf("YES\n");
} else if (a > b || a < 0) {
printf("NO\n");
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 1,143,324 | 1,143,325 | u086097200 | c |
p03377 | #include <stdio.h>
int main() {
int a, b, x;
scanf("%d %d %d", &a, &b, &x);
if (x >= a && a + b >= x)
printf("YES\n");
else
printf("No\n");
return 0;
} | #include <stdio.h>
int main() {
int a, b, x;
scanf("%d %d %d", &a, &b, &x);
if (x >= a && a + b >= x)
printf("YES\n");
else
printf("NO\n");
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 1,143,340 | 1,143,341 | u511418308 | c |
p03386 | #include <stdio.h>
int main(void) {
int a, b, c;
int i;
scanf("%d %d %d", &a, &b, &c);
if (b - a + 1 <= c || b - a + 1 <= 2 * c) {
for (i = a; i <= b; i++) {
printf("%d\n", i);
}
} else {
for (i = 0; i < c; i++) {
printf("%d\n", a + c);
}
for (i = c - 1; i >= 0; i--) {
p... | #include <stdio.h>
int main(void) {
int a, b, c;
int i;
scanf("%d %d %d", &a, &b, &c);
if (b - a + 1 <= c || b - a + 1 <= 2 * c) {
for (i = a; i <= b; i++) {
printf("%d\n", i);
}
} else {
for (i = 0; i < c; i++) {
printf("%d\n", a + i);
}
for (i = c - 1; i >= 0; i--) {
p... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 1,150,567 | 1,150,568 | u579508806 | c |
p03386 | #include <stdio.h>
int main() {
long long m, n, k, i;
scanf("%lld%lld%lld", &m, &n, &k);
if ((n - m) > k * 2) {
for (i = 0; i < k; i++) {
printf("%lld\n", m + i);
}
for (i = k - 1; i >= 0; i--) {
printf("%lld\n", n - i);
}
} else {
for (i = m; i <= n; i++)
printf("%lld\n", ... | #include <stdio.h>
int main() {
long long m, n, k, i;
scanf("%lld%lld%lld", &m, &n, &k);
if ((n - m) >= k * 2) {
for (i = 0; i < k; i++) {
printf("%lld\n", m + i);
}
for (i = k - 1; i >= 0; i--) {
printf("%lld\n", n - i);
}
} else {
for (i = m; i <= n; i++)
printf("%lld\n",... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,151,801 | 1,151,802 | u672576392 | c |
p03407 | #include <stdio.h>
int main(void) {
int a, b, c;
scanf("%d,%d,%d", &a, &b, &c);
if ((a + b) < c)
puts("No");
else
printf("Yes");
return 0;
} | #include <stdio.h>
int main(void) {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
if ((a + b) < c)
puts("No");
else
printf("Yes");
return 0;
} | [
"literal.string.change",
"call.arguments.change"
] | 1,159,929 | 1,159,930 | u829418072 | c |
p03408 | #include <stdio.h>
#include <string.h>
int main() {
int n, m, i, r = 0;
char s[100][11], t[100][11];
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%s", &s[i]);
scanf("%d", &m);
for (i = 0; i < m; i++)
scanf("%s", &t[i]);
for (i = 0; i < n; i++) {
int b = 0;
for (int j = 0; j < n; j++)
... | #include <stdio.h>
#include <string.h>
int main() {
int n, m, i, r = 0;
char s[100][11], t[100][11];
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%s", &s[i]);
scanf("%d", &m);
for (i = 0; i < m; i++)
scanf("%s", &t[i]);
for (i = 0; i < n; i++) {
int b = 0;
for (int j = 0; j < n; j++)
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,161,007 | 1,161,008 | u855016901 | c |
p03415 | int main() {
int a[10];
int i = 0;
while (i < 10) {
scanf("%c", &a[i]);
// if (i % 2 == 0 && i != 0)
i++;
}
printf("%c%c%c", a[0], a[4], a[8]);
} | int main() {
int a[13];
int i = 0;
while (i < 13) {
scanf("%c", &a[i]);
// if (i % 2 == 0 && i != 0)
i++;
}
printf("%c%c%c", a[0], a[5], a[10]);
} | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.condition.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"io.output.change"
] | 1,163,497 | 1,163,498 | u827935538 | c |
p03415 | int main() {
int a[10];
int i = 0;
while (i < 10) {
scanf("%d", &a[i]);
i++;
}
printf("%c%c%c", a[0], a[4], a[8]);
} | int main() {
int a[13];
int i = 0;
while (i < 13) {
scanf("%c", &a[i]);
// if (i % 2 == 0 && i != 0)
i++;
}
printf("%c%c%c", a[0], a[5], a[10]);
} | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.condition.change",
"literal.string.change",
"call.arguments.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 1,163,499 | 1,163,498 | u827935538 | c |
p03417 | #include <stdio.h>
#define max(x, y) (x < y ? y : x)
int main() {
int N, M;
scanf("%d %d", &N, &M);
if (N == 1 && M == 1) {
printf("1");
} else if (N == 1 && M != 1) {
printf("%d", max(N, M) - 2);
} else if (N != 1 && M == 1) {
printf("%d", max(N, M) - 2);
} else {
printf("%d", (N - 2) * ... | #include <stdio.h>
#define max(x, y) (x < y ? y : x)
int main() {
long N, M;
scanf("%ld %ld", &N, &M);
if (N == 1 && M == 1) {
printf("1");
} else if (N == 1 && M != 1) {
printf("%ld", max(N, M) - 2);
} else if (N != 1 && M == 1) {
printf("%ld", max(N, M) - 2);
} else {
printf("%ld", (N -... | [
"variable_declaration.type.primitive.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 1,168,157 | 1,168,158 | u025235255 | c |
p03423 | #include <stdio.h>
int main(void) {
int a, b;
scanf("%d", &a);
b = a / 3;
printf("%d", a);
return 0;
} | #include <stdio.h>
int main(void) {
int a, b;
scanf("%d", &a);
b = a / 3;
printf("%d", b);
return 0;
} | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 1,171,795 | 1,171,796 | u137935511 | c |
p03425 | #include <stdio.h>
int main(void) {
long long int sum = 0;
int num[5], i, n, j, k, x;
char name[11];
for (i = 0; i < 5; i++)
num[i] = 0;
scanf("%d", &n);
while (n > 0) {
scanf("%s", name);
if (name[0] == 'M')
num[0]++;
else if (name[0] == 'A')
num[1]++;
else if (name[0] == '... | #include <stdio.h>
int main(void) {
long long int sum = 0;
long long int num[5], i, n, j, k, x;
char name[11];
for (i = 0; i < 5; i++)
num[i] = 0;
scanf("%lld", &n);
while (n > 0) {
scanf("%s", name);
if (name[0] == 'M')
num[0]++;
else if (name[0] == 'A')
num[1]++;
else if (... | [
"literal.string.change",
"call.arguments.change"
] | 1,176,092 | 1,176,091 | u763410402 | c |
p03433 | #include <stdio.h>
int main() {
int pay, coin, divide, rest, oneyens;
scanf("%d/n%d", &pay, &coin);
divide = pay / 500; // N円を500で割った商。500円玉を使った枚数。
rest = pay - 500 * divide; // 500円玉で払った後の残額。1円玉で払う分。
oneyens =
rest -
coin; // 1円玉を数えるのは面倒なので全部出しちゃった。正の値なら払いきれないぞ
if (rest == 0)
printf("Yes");... | #include <stdio.h>
int main() {
int pay, coin, divide, rest, oneyens;
scanf("%d %d", &pay, &coin);
divide = pay / 500; // N円を500で割った商。500円玉を使った枚数。
rest = pay - 500 * divide; // 500円玉で払った後の残額。1円玉で払う分。
oneyens =
rest -
coin; // 1円玉を数えるのは面倒なので全部出しちゃった。正の値なら払いきれないぞ
if (rest == 0)
printf("Yes"); ... | [
"literal.string.change",
"call.arguments.change"
] | 1,183,936 | 1,183,937 | u658820221 | c |
p03433 | #include <stdio.h>
int main() {
int pay, coin, divide, rest, oneyens;
scanf("%d/n%d", &pay, &coin);
divide = pay / 500;
rest = pay - 500 * divide;
oneyens = rest - coin;
if (rest == 0)
printf("Yes");
else if (oneyens > 0)
printf("No");
else
printf("Yes");
return 0;
}
| #include <stdio.h>
int main() {
int pay, coin, divide, rest, oneyens;
scanf("%d %d", &pay, &coin);
divide = pay / 500; // N円を500で割った商。500円玉を使った枚数。
rest = pay - 500 * divide; // 500円玉で払った後の残額。1円玉で払う分。
oneyens =
rest -
coin; // 1円玉を数えるのは面倒なので全部出しちゃった。正の値なら払いきれないぞ
if (rest == 0)
printf("Yes"); ... | [
"literal.string.change",
"call.arguments.change"
] | 1,183,938 | 1,183,937 | u658820221 | c |
p03433 | #include <stdio.h>
int main() {
int n, a;
scanf("%d%d", &n, &a);
// if (n <= a || n / 500 <= a)
if (n / 500 <= a)
puts("Yes");
else
puts("No");
return 0;
} | #include <stdio.h>
int main() {
int n, a;
scanf("%d%d", &n, &a);
// if (n <= a || n / 500 <= a)
if (n % 500 <= a)
puts("Yes");
else
puts("No");
return 0;
} | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 1,185,337 | 1,185,338 | u883325972 | c |
p03433 | #include <stdio.h>
int main() {
int n, a;
scanf("%d%d", &n, &a);
if (n <= a || n / 500 <= a)
puts("Yes");
else
puts("No");
return 0;
} | #include <stdio.h>
int main() {
int n, a;
scanf("%d%d", &n, &a);
// if (n <= a || n / 500 <= a)
if (n % 500 <= a)
puts("Yes");
else
puts("No");
return 0;
} | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 1,185,339 | 1,185,338 | u883325972 | c |
p03434 | #include <stdio.h>
#include <stdlib.h>
int main() {
int N, a[100], i, j, temp, ali = 0, bob = 0;
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < (N - 1); i++) {
for (j = (N - 1); j > i; j--) {
if (a[j - 1] > a[j]) {
temp = a[j - 1];
a[j - 1] = a[... | #include <stdio.h>
#include <stdlib.h>
int main() {
int N, a[100], i, j, temp, ali = 0, bob = 0;
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < (N - 1); i++) {
for (j = (N - 1); j > i; j--) {
if (a[j - 1] < a[j]) {
temp = a[j - 1];
a[j - 1] = a[... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.variable.change",
"identifier.change"
] | 1,187,226 | 1,187,227 | u729856984 | c |
p03437 | #include <stdio.h>
int main() {
int x, y;
scanf("%d%d", &x, &y);
(x % y == 0) ? printf("%d", 2 * x) : puts("-1");
return 0;
} | #include <stdio.h>
int main() {
int x, y;
scanf("%d%d", &x, &y);
(x % y != 0) ? printf("%d", x) : puts("-1");
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 1,190,213 | 1,190,214 | u855016901 | c |
p03437 | #include <stdio.h>
int main() {
int x, y;
scanf("%d%d", &x, &y);
(x % y == 0) ? printf("%d", x) : puts("-1");
return 0;
} | #include <stdio.h>
int main() {
int x, y;
scanf("%d%d", &x, &y);
(x % y != 0) ? printf("%d", x) : puts("-1");
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,190,215 | 1,190,214 | u855016901 | c |
p03447 | #include <stdio.h>
int main() {
int A, B, X, d1, d2;
scanf("%d%d%d", &A, &B, &X);
d1 = X - A;
d2 = d1 % B;
printf("%d", d2);
return 0;
} | #include <stdio.h>
int main() {
int A, B, X, d1, d2;
scanf("%d%d%d", &X, &A, &B);
d1 = X - A;
d2 = d1 % B;
printf("%d", d2);
return 0;
} | [
"call.arguments.add",
"call.arguments.change"
] | 1,193,959 | 1,193,960 | u353919145 | c |
p03448 | #include <stdio.h>
int main(void) {
int a, b, c, x, i, j, k, r = 0;
scanf("%d%d%d", &a, &b, &c, &x);
for (i = 0; i <= x / 500; i++)
for (j = 0; j <= (x - 500 * i) / 100; j++) {
k = x - 500 * i - 100 * j;
r += k % 50 == 0 && c >= k / 50 && a >= i && b >= j;
}
printf("%d\n", r);
return 0;
}
| #include <stdio.h>
int main(void) {
int a, b, c, x, i, j, k, r = 0;
scanf("%d%d%d%d", &a, &b, &c, &x);
for (i = 0; i <= x / 500; i++)
for (j = 0; j <= (x - 500 * i) / 100; j++) {
k = x - 500 * i - 100 * j;
r += k % 50 == 0 && c >= k / 50 && a >= i && b >= j;
}
printf("%d\n", r);
return 0;
... | [
"literal.string.change",
"call.arguments.change"
] | 1,195,262 | 1,195,263 | u100307675 | c |
p03455 | #include <stdio.h>
int main(void) {
int a, b, c;
scanf("%d %d", &a, &b);
if (a * b % 2 == 0) {
printf("Odd");
} else {
printf("Even");
}
return 0;
} | #include <stdio.h>
int main(void) {
int a, b, c;
scanf("%d %d", &a, &b);
if (a * b % 2 == 0) {
printf("Even");
} else {
printf("Odd");
}
return 0;
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 1,202,041 | 1,202,042 | u932514381 | c |
p03455 | #include <stdio.h>
int main() {
int a, b, sum;
scanf("%d %d", &a, &b);
sum = a + b;
if (sum % 2 == 0) {
printf("Even\n");
} else {
printf("Odd\n");
}
return 0;
} | #include <stdio.h>
int main() {
int a, b, sum;
scanf("%d %d", &a, &b);
sum = a * b;
if (sum % 2 == 0) {
printf("Even\n");
} else {
printf("Odd\n");
}
return 0;
} | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 1,203,998 | 1,203,999 | u260869591 | c |
p03469 | #include <stdio.h>
int main(void) {
char s[11];
scanf("%s", s);
s[3] = "8";
printf("%s", s);
return 0;
}
| #include <stdio.h>
int main(void) {
char s[11];
scanf("%s", s);
s[3] = '8';
printf("%s\n", s);
return 0;
}
| [
"literal.string.change",
"assignment.value.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 1,213,939 | 1,213,940 | u231261695 | c |
p03470 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define MAX(a, b) (a > b ? a : b)
#define MIN(a, b) (a < b ? a : b)
const int inf = 1000000000; // 10^9
int com_asc_int(const void *n1, const void *n2) {
if (*(int *)n1 > *(int *)n2)
return 1;
else if (*(int *)n1 < *(int *)n2)
return -1;
else
... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define MAX(a, b) (a > b ? a : b)
#define MIN(a, b) (a < b ? a : b)
const int inf = 1000000000; // 10^9
int com_asc_int(const void *n1, const void *n2) {
if (*(int *)n1 > *(int *)n2)
return 1;
else if (*(int *)n1 < *(int *)n2)
return -1;
else
... | [
"expression.operation.binary.add"
] | 1,215,153 | 1,215,154 | u596612094 | c |
p03471 | #include <stdio.h>
int main(void) {
int a, b, c, i, j;
int d = 0;
scanf("%d%d", &a, &b);
for (i = 0; i < a; i++) {
for (j = 0; j < a - i; j++) {
c = a - i - j;
d = 10000 * i + 5000 * j + 1000 * c;
if (d == b) {
printf("%d %d %d", i, j, c);
return 0;
}
}
}
prin... | #include <stdio.h>
int main(void) {
int a, b, c, i, j;
int d = 0;
scanf("%d%d", &a, &b);
for (i = 0; i <= a; i++) {
for (j = 0; j <= a - i; j++) {
c = a - i - j;
d = 10000 * i + 5000 * j + 1000 * c;
if (d == b) {
printf("%d %d %d", i, j, c);
return 0;
}
}
}
pr... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,220,293 | 1,220,294 | u805131136 | c |
p03477 | #include <stdio.h>
int main() {
int a, b, c, d;
scanf("%d %d %d %d", &a, &b, &c, &d);
int e, f;
e = a + b;
f = c + d;
if (e > f)
puts("Left");
else if (e = f)
puts("Balanced");
else if (e < f)
puts("Right");
return 0;
} | #include <stdio.h>
int main() {
int a, b, c, d;
scanf("%d %d %d %d", &a, &b, &c, &d);
int e, f;
e = a + b;
f = c + d;
if (e > f)
puts("Left");
else if (e == f)
puts("Balanced");
else if (e < f)
puts("Right");
return 0;
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,230,592 | 1,230,593 | u473296729 | c |
p03477 | #include <stdio.h>
int main() {
int a, b, c, d;
scanf("%d %d %d %d", &a, &b, &c, &d);
int e, f;
e = a + b;
f = c + d;
if (e > f)
puts("Left");
if (e = f)
puts("Balanced");
if (e < f)
puts("Right");
return 0;
} | #include <stdio.h>
int main() {
int a, b, c, d;
scanf("%d %d %d %d", &a, &b, &c, &d);
int e, f;
e = a + b;
f = c + d;
if (e > f)
puts("Left");
else if (e == f)
puts("Balanced");
else if (e < f)
puts("Right");
return 0;
} | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove",
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,230,594 | 1,230,593 | u473296729 | c |
p03485 | #include <stdio.h>
int main() {
int a, b;
int e;
scanf("%d %d", &a, &b);
int c;
int d;
e = a + b;
c = e / 2;
d = a % d;
if (d > 0) {
c = c + 1;
printf("%d", c);
} else {
printf("%d", c);
}
return 0;
} | #include <stdio.h>
int main() {
int a, b;
int e;
scanf("%d %d", &a, &b);
int c;
int d;
e = a + b;
c = e / 2;
d = e % 2;
if (d > 0) {
c = c + 1;
printf("%d", c);
}
else {
printf("%d", c);
}
return 0;
} | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change",
"identifier.replace.remove",
"literal.replace.add"
] | 1,240,664 | 1,240,665 | u838272324 | c |
p03485 | #include <stdio.h>
int main() {
int a, b;
int e;
scanf("%d %d", &a, b);
int c;
int d;
e = a + b;
c = e / 2;
d = a % d;
if (d > 0) {
c = c + 1;
printf("%d", c);
} else {
printf("%d", c);
}
return 0;
} | #include <stdio.h>
int main() {
int a, b;
int e;
scanf("%d %d", &a, &b);
int c;
int d;
e = a + b;
c = e / 2;
d = e % 2;
if (d > 0) {
c = c + 1;
printf("%d", c);
}
else {
printf("%d", c);
}
return 0;
} | [
"expression.operation.unary.reference.add",
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change",
"identifier.replace.remove",
"literal.replace.add"
] | 1,240,666 | 1,240,665 | u838272324 | c |
p03493 | #include <stdio.h>
int main() {
char s[3];
int ans = 0;
scanf("%s", s);
for (int i = 0; i < 3; i++)
ans += s[i] == '1';
puts(ans);
} | #include <stdio.h>
int main() {
char s[3];
int ans = 0;
scanf("%s", s);
for (int i = 0; i < 3; i++)
ans += s[i] == '1';
printf("%d", ans);
}
| [
"identifier.change",
"call.function.change",
"io.output.change",
"call.arguments.add"
] | 1,244,395 | 1,244,396 | u346307762 | c |
p03493 | #include <stdio.h>
int main() {
int count = 0, i;
char a[3];
for (i = 0; i < 3; i++) {
scanf("%c", a[i]);
if (a[i] == '1')
count++;
}
printf("%d", count);
return 0;
} | #include <stdio.h>
int main() {
int count = 0, i;
char a[3];
for (i = 0; i < 3; i++) {
scanf("%c", &a[i]);
if (a[i] == '1')
count++;
}
printf("%d", count);
return 0;
} | [
"expression.operation.unary.reference.add"
] | 1,245,522 | 1,245,523 | u199768991 | c |
p03494 |
#include <stdio.h>
int main() {
int count = 0;
int i;
int m;
int x = 0;
int n[200];
scanf("%d", &i);
for (m = 0; m <= i; m++) {
scanf("%d", &n[m]);
}
while (1) {
for (m = 0; m <= i; m++) {
if (n[m] % 2 == 1) {
x = 1;
break;
}
n[m] = n[m] / 2;
}
if ... |
#include <stdio.h>
int main() {
int count = 0;
int i;
int m;
int x = 0;
int n[200];
scanf("%d", &i);
for (m = 0; m < i; m++) {
scanf("%d", &n[m]);
}
while (1) {
for (m = 0; m < i; m++) {
if (n[m] % 2 == 1) {
x = 1;
break;
}
n[m] = n[m] / 2;
}
if (x... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.loop.condition.change"
] | 1,248,359 | 1,248,360 | u541026870 | c |
p03494 |
#include <stdio.h>
int main() {
int count = 0;
int i;
int m;
int x = 0;
int n[199];
scanf("%d", &i);
for (m = 0; m <= i; m++) {
scanf("%d", &n[m]);
}
while (1) {
for (m = 0; m <= i; m++) {
if (n[m] % 2 == 1) {
x = 1;
break;
}
n[m] = n[m] / 2;
}
if ... |
#include <stdio.h>
int main() {
int count = 0;
int i;
int m;
int x = 0;
int n[200];
scanf("%d", &i);
for (m = 0; m < i; m++) {
scanf("%d", &n[m]);
}
while (1) {
for (m = 0; m < i; m++) {
if (n[m] % 2 == 1) {
x = 1;
break;
}
n[m] = n[m] / 2;
}
if (x... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.loop.condition.change",
"literal.string.change",
"call.arguments.chang... | 1,248,362 | 1,248,360 | u541026870 | c |
p03495 | #include <stdio.h>
#include <stdlib.h>
int compare_int(const void *a, const void *b) { return *(int *)b - *(int *)a; }
int arr[200001];
int ans[200001];
int main() {
long int N, K, A[200001];
int num = 1;
int a = 0, b = 0, sum = 0;
int answer;
scanf("%ld %ld", &N, &K);
for (int i = 0; i < N; i++) {
s... | #include <stdio.h>
#include <stdlib.h>
int compare_int(const void *a, const void *b) { return *(int *)b - *(int *)a; }
int arr[200001];
int ans[200001];
int main() {
long int N, K, A[200001];
int num = 1;
int a = 0, b = 0, sum = 0;
int answer;
scanf("%ld %ld", &N, &K);
for (int i = 0; i < N; i++) {
s... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 1,248,992 | 1,248,993 | u855291978 | c |
p03543 | #include <stdio.h>
#include <string.h>
int main() {
char str[1500];
char temp;
int count, i;
scanf("%s", str);
temp = str[0];
// printf("%c\n",temp);
count = 0;
for (i = 1; i <= strlen(str); i++) {
// printf("%c\n",temp);
if (temp == str[i]) {
count++;
// printf("%c %d\n",temp,coun... | #include <stdio.h>
#include <string.h>
int main() {
char str[1500];
char temp;
int count, i;
scanf("%s", str);
temp = str[0];
// printf("%c\n",temp);
count = 0;
for (i = 1; i <= strlen(str); i++) {
// printf("%c\n",temp);
if (temp == str[i]) {
count++;
// printf("%c %d\n",temp,coun... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 1,260,814 | 1,260,815 | u410736938 | c |
p03544 | #include <stdio.h>
int main() {
int N, i;
long long L[3];
L[0] = 2;
L[1] = 1;
scanf("%d", &N);
if (N >= 3) {
for (i = 1; i < N; i++) {
L[2] = L[0] + L[1];
L[0] = L[1];
L[1] = L[2];
}
} else {
printf("%lld", L[N]);
return 0;
}
printf("%lld", L[2]);
return 0;
} | #include <stdio.h>
int main() {
int N, i;
long long L[3];
L[0] = 2;
L[1] = 1;
scanf("%d", &N);
if (N >= 2) {
for (i = 1; i < N; i++) {
L[2] = L[0] + L[1];
L[0] = L[1];
L[1] = L[2];
}
} else {
printf("%lld", L[N]);
return 0;
}
printf("%lld", L[2]);
return 0;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,263,728 | 1,263,729 | u481526887 | c |
p03545 | #include <stdio.h>
int main(void) {
int A;
scanf("%d", &A);
int a, b, c, d;
d = A % 10;
A = A / 10;
c = A % 10;
A = A / 10;
b = A % 10;
A = A / 10;
a = A;
int ans = a;
int i, j, k;
int i1, j1, k1;
for (i = 0; i < 2; i++) {
for (j = 0; j < 2; j++) {
for (k = 0; k < 2; k++) {
... | #include <stdio.h>
int main(void) {
int A;
scanf("%d", &A);
int a, b, c, d;
d = A % 10;
A = A / 10;
c = A % 10;
A = A / 10;
b = A % 10;
A = A / 10;
a = A;
int ans = a;
int i, j, k;
int i1, j1, k1;
for (i = 0; i < 2; i++) {
for (j = 0; j < 2; j++) {
for (k = 0; k < 2; k++) {
... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 1,264,655 | 1,264,656 | u391247609 | c |
p03548 | #include <stdio.h>
int main() {
int num = 1;
int x, y, z;
scanf("%d %d %d", &x, &y, &z);
while (1) {
if (y * num + z * (num + 1) >= x)
break;
else
num++;
}
printf("%d", num);
return 0;
}
| #include <stdio.h>
int main() {
int num = 1;
int x, y, z;
scanf("%d %d %d", &x, &y, &z);
while (1) {
if (y * num + z * (num + 1) > x)
break;
else
num++;
}
printf("%d", num - 1);
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,268,541 | 1,268,542 | u125212320 | c |
p03548 | #include <stdio.h>
int main() {
int num = 0;
int x, y, z;
scanf("%d %d %d", &x, &y, &z);
while (1) {
if (y * num + z * (num + 1) >= x)
break;
else
num++;
}
printf("%d", num);
return 0;
}
| #include <stdio.h>
int main() {
int num = 1;
int x, y, z;
scanf("%d %d %d", &x, &y, &z);
while (1) {
if (y * num + z * (num + 1) > x)
break;
else
num++;
}
printf("%d", num - 1);
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,268,543 | 1,268,542 | u125212320 | c |
p03548 | #include <stdio.h>
int main() {
int num = 0;
int x, y, z;
scanf("%d %d %d", &x, &y, &z);
while (1) {
if (y * num + z * (num + 1) >= x)
break;
num++;
}
printf("%d", num);
return 0;
}
| #include <stdio.h>
int main() {
int num = 1;
int x, y, z;
scanf("%d %d %d", &x, &y, &z);
while (1) {
if (y * num + z * (num + 1) > x)
break;
else
num++;
}
printf("%d", num - 1);
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 1,268,544 | 1,268,542 | u125212320 | c |
p03548 | #include <stdio.h>
int main() {
int num = 0;
int x, y, z;
scanf("%d %d %d", &x, &y, &z);
while (1) {
if (y * num + z * (num + 1) > x)
break;
num++;
}
printf("%d", num);
return 0;
}
| #include <stdio.h>
int main() {
int num = 1;
int x, y, z;
scanf("%d %d %d", &x, &y, &z);
while (1) {
if (y * num + z * (num + 1) > x)
break;
else
num++;
}
printf("%d", num - 1);
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 1,268,545 | 1,268,542 | u125212320 | c |
p03548 | #include <stdio.h>
int main() {
int num = 1;
int x, y, z;
scanf("%d %d %d", &x, &y, &z);
while (1) {
if (y * num + z * (num + 1) > x)
break;
num++;
}
printf("%d", num);
return 0;
}
| #include <stdio.h>
int main() {
int num = 1;
int x, y, z;
scanf("%d %d %d", &x, &y, &z);
while (1) {
if (y * num + z * (num + 1) > x)
break;
else
num++;
}
printf("%d", num - 1);
return 0;
}
| [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 1,268,546 | 1,268,542 | u125212320 | c |
p03555 | // AtCoder Beginner Contest 077 A - Rotation
#include <stdio.h>
int main(void) {
char str1[4] = {'\0'};
char str2[4] = {'\0'};
// char str1[3];
// char str2[3];
scanf("%s %s", str1, str2);
// printf("%s", str1);
int flag = 0;
for (int i = 0; i < 3; i++) {
if (str1[i] != str2[2 - i]) {
flag = ... |
#include <stdio.h>
int main(void) {
char str1[4] = {'\0'};
char str2[4] = {'\0'};
// char str1[3];
// char str2[3];
scanf("%s %s", str1, str2);
// printf("%s", str1);
int flag = 0;
for (int i = 0; i < 3; i++) {
if (str1[i] != str2[2 - i]) {
flag = 1;
break;
}
}
if (flag == 0) {... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 1,271,414 | 1,271,415 | u389185410 | c |
p03563 | #include <stdio.h>
int main() {
int R, G;
// 整数の入力
scanf("%d", &R);
scanf("%d", &G);
// 出力
printf("%lf \n", 2 * G - R);
return 0;
} | #include <stdio.h>
int main() {
int R, G;
scanf("%d", &R);
scanf("%d", &G);
printf("%d", 2 * G - R);
return 0;
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.remove"
] | 1,278,444 | 1,278,445 | u351888211 | c |
p03573 | #include <stdio.h>
int main(void) {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
if (a == b)
printf("%d", a);
if (b == c)
printf("%d", b);
if (a == c)
printf("%d", c);
return 0;
}
| #include <stdio.h>
int main(void) {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
if (a == b)
printf("%d", c);
if (b == c)
printf("%d", a);
if (a == c)
printf("%d", b);
return 0;
}
| [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 1,284,325 | 1,284,326 | u521382680 | c |
p03607 | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define BIG 2000000007
#define MOD 1000000007
typedef unsigned long long ull;
typedef signed long long sll;
#define N_MAX 100000
#define M_MAX 100000
typedef struct {
int a;
int b;
} hw;
const hw vector8[8] = {{-1, -1}, {-1, 0}, {-1,... | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define BIG 2000000007
#define MOD 1000000007
typedef unsigned long long ull;
typedef signed long long sll;
#define N_MAX 100000
#define M_MAX 100000
typedef struct {
int a;
int b;
} hw;
const hw vector8[8] = {{-1, -1}, {-1, 0}, {-1,... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 1,304,727 | 1,304,728 | u238041222 | c |
p03623 | #include <math.h>
#include <stdio.h>
int main() {
long int x, y, z, sum, i = 0, k;
scanf("%ld%ld%ld", &x, &y, &z);
if (abs(x - y) < abs(x - y)) {
printf("A");
} else {
printf("B");
}
return 0;
}
| #include <math.h>
#include <stdio.h>
int main() {
long int x, y, z, sum, i = 0, k;
scanf("%ld%ld%ld", &x, &y, &z);
if (abs(x - y) <= abs(x - z)) {
printf("A");
} else {
printf("B");
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change"
] | 1,313,843 | 1,313,844 | u513506770 | c |
p03632 | #include <stdio.h>
int main() {
int a, b, c, d, min = 0, max = 0;
scanf("%d %d %d %d", &a, &b, &c, &d);
if (a >= c) {
min = a;
} else {
min = c;
}
if (b >= d) {
max = b;
} else {
max = d;
}
if (b < c || d < a) {
printf("0\n");
} else {
printf("%d\n", max - min);
}
return ... | #include <stdio.h>
int main() {
int a, b, c, d, min = 0, max = 0;
scanf("%d %d %d %d", &a, &b, &c, &d);
if (a >= c) {
min = a;
} else {
min = c;
}
if (b >= d) {
max = d;
} else {
max = b;
}
if (b < c || d < a) {
printf("0\n");
} else {
printf("%d\n", max - min);
}
return ... | [
"assignment.value.change",
"identifier.change"
] | 1,324,625 | 1,324,626 | u042418462 | c |
p03632 | #include <stdio.h>
int main() {
int a, b, c, d, min = 0, max = 0;
scanf("%d %d %d %d", &a, &b, &c, &d);
if (a >= c) {
min = a;
} else {
min = c;
}
if (b >= c) {
max = b;
} else {
max = d;
}
if (b < c || d < a) {
printf("0\n");
} else {
printf("%d\n", max - min);
}
return ... | #include <stdio.h>
int main() {
int a, b, c, d, min = 0, max = 0;
scanf("%d %d %d %d", &a, &b, &c, &d);
if (a >= c) {
min = a;
} else {
min = c;
}
if (b >= d) {
max = d;
} else {
max = b;
}
if (b < c || d < a) {
printf("0\n");
} else {
printf("%d\n", max - min);
}
return ... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 1,324,627 | 1,324,626 | u042418462 | c |
p03658 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
void Swap(int x[], int i, int j) {
int tmp;
tmp = x[i];
x[i] = x[j];
x[j] = tmp;
}
void QSort(int x[], int left, int right) {
int i, j;
int pivot;
i = left;
j = right;
pivot = x[(left + right) / 2];
while (1) {
while (x[i] > pivot) ... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
void Swap(int x[], int i, int j) {
int tmp;
tmp = x[i];
x[i] = x[j];
x[j] = tmp;
}
void QSort(int x[], int left, int right) {
int i, j;
int pivot;
i = left;
j = right;
pivot = x[(left + right) / 2];
while (1) {
while (x[i] > pivot) ... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 1,340,164 | 1,340,165 | u435037050 | c |
p03679 | #include <stdio.h>
int main() {
int X, A, B;
scanf("%d %d %d", &X, &A, &B);
if (B <= A)
printf("delicious\n");
else if (A < B && B <= X + A)
printf("safe\n");
else
printf("dangerouns\n");
return 0;
} | #include <stdio.h>
int main() {
int X, A, B;
scanf("%d %d %d", &X, &A, &B);
if (B <= A)
printf("delicious\n");
else if (A < B && B <= X + A)
printf("safe\n");
else
printf("dangerous\n");
return 0;
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 1,354,213 | 1,354,214 | u973997867 | c |
p03679 | #include <stdio.h>
int main() {
int X, A, B;
scanf("%d %d %d", &X, &A, &B);
if (A <= B)
printf("delicious\n");
else if (A < B && B <= X + A)
printf("safe\n");
else
printf("dangerouns\n");
return 0;
} | #include <stdio.h>
int main() {
int X, A, B;
scanf("%d %d %d", &X, &A, &B);
if (B <= A)
printf("delicious\n");
else if (A < B && B <= X + A)
printf("safe\n");
else
printf("dangerous\n");
return 0;
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 1,354,215 | 1,354,214 | u973997867 | c |
p03693 | #include <stdio.h>
int main() {
int x, y, z, sum;
scanf("%d %d %d", &x, &y, &z);
sum = x * 100 + y * 10 + z;
if (sum % 4 == 0) {
printf("Yes");
} else {
printf("No");
}
return 0;
} | #include <stdio.h>
int main() {
int x, y, z, sum;
scanf("%d %d %d", &x, &y, &z);
sum = x * 100 + y * 10 + z;
if (sum % 4 == 0) {
printf("YES");
} else {
printf("NO");
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 1,363,472 | 1,363,473 | u595893956 | c |
p03693 | #include <stdio.h>
int main() {
int x, y, z, sum;
scanf("%d %d %d", &x, &y, &z);
sum = x * 100 + y + 10 + z;
if (sum % 4 == 0) {
printf("Yes");
} else {
printf("No");
}
return 0;
} | #include <stdio.h>
int main() {
int x, y, z, sum;
scanf("%d %d %d", &x, &y, &z);
sum = x * 100 + y * 10 + z;
if (sum % 4 == 0) {
printf("YES");
} else {
printf("NO");
}
return 0;
} | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 1,363,474 | 1,363,473 | u595893956 | c |
p03695 | #include <stdio.h>
#include <string.h>
#define ll long long
#define rep(i, l, r) for (ll i = (l); i < (r); i++)
#define repp(i, l, r, k) for (ll i = (l); i < (r); i += (k))
#define INF ((1LL << 62) - (1LL << 31))
#define max(p, q) ((p) > (q) ? (p) : (q))
#define min(p, q) ((p) < (q) ? (p) : (q))
ll n;
ll a[20];
int ma... | #include <stdio.h>
#include <string.h>
#define ll long long
#define rep(i, l, r) for (ll i = (l); i < (r); i++)
#define repp(i, l, r, k) for (ll i = (l); i < (r); i += (k))
#define INF ((1LL << 62) - (1LL << 31))
#define max(p, q) ((p) > (q) ? (p) : (q))
#define min(p, q) ((p) < (q) ? (p) : (q))
ll n;
ll a[20];
int ma... | [
"call.add",
"call.arguments.add"
] | 1,367,259 | 1,367,260 | u382163500 | c |
p03697 | #include <stdio.h>
int main() {
int a, b, c;
scanf("%d%d", &a, &b);
c = a + b;
if (c >= 10) {
printf("Error");
} else {
printf("%d\n", c);
}
return 0;
} | #include <stdio.h>
int main() {
int a, b, c;
scanf("%d%d", &a, &b);
c = a + b;
if (c >= 10)
printf("error\n");
else
printf("%d\n", c);
return 0;
}
| [
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 1,368,219 | 1,368,220 | u353919145 | c |
p03697 | #include <stdio.h>
int main() {
int a, b, c;
scanf("%d%d", &a, &b);
c = a + b;
if (c >= 10) {
printf("Error");
} else {
printf("%d\n", c);
}
return 0;
} | #include <stdio.h>
int main() {
int a, b, c;
scanf("%d%d", &a, &b);
c = a + b;
if (c >= 10) {
printf("error");
} else {
printf("%d\n", c);
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 1,368,219 | 1,368,221 | u353919145 | c |
p03713 | #include <stdio.h>
int main() {
int i, y, y1;
int x1, x2, x3;
long long h, w, min, max, answer;
scanf("%lld %lld", &h, &w);
answer = h * w;
if (h % 3 == 0 || w % 3 == 0) {
printf("0");
} else {
// 1
for (i = 0; i <= h; i++) {
//
x1 = i * w;
x2 = (h - i) * (w / 2);
x3 ... | #include <stdio.h>
int main() {
int i, y, y1;
long long x1, x2, x3;
long long h, w, min, max, answer;
scanf("%lld %lld", &h, &w);
answer = h * w;
if (h % 3 == 0 || w % 3 == 0) {
printf("0");
} else {
// 1
for (i = 0; i <= h; i++) {
//
x1 = i * w;
x2 = (h - i) * (w / 2);
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 1,381,786 | 1,381,787 | u187266709 | c |
p03719 | #include <stdio.h>
int main() {
int a, b, c;
while (~scanf("%d%d%d", &a, &b, &c)) {
if (c >= a && c <= b)
printf("YES\n");
else
printf("NO\n");
}
}
| #include <stdio.h>
int main() {
int a, b, c;
while (~scanf("%d%d%d", &a, &b, &c)) {
if (c >= a && c <= b)
printf("Yes\n");
else
printf("No\n");
}
}
| [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 1,383,381 | 1,383,382 | u816631826 | c |
p03719 | #include <stdio.h>
int main() {
int A, B, C;
scanf(" %d %d %d", &A, &B, &C);
if (C >= A && C <= B)
printf("YES\n");
else
printf("NO\n");
return 0;
} | #include <stdio.h>
int main() {
int A, B, C;
scanf("%d %d %d", &A, &B, &C);
if (C >= A && C <= B) {
printf("Yes\n");
} else
printf("No\n");
return 0;
}
| [
"literal.string.change",
"call.arguments.change",
"literal.string.case.change",
"io.output.change"
] | 1,383,383 | 1,383,384 | u816631826 | c |
p03719 | #include <stdio.h>
int main() {
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
if (c >= a && c <= b)
printf("yes");
else
printf("no");
return 0;
} | #include <stdio.h>
int main() {
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
if (c >= a && c <= b)
printf("Yes\n");
else
printf("No\n");
return 0;
}
| [
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 1,383,387 | 1,383,389 | u816631826 | c |
p03719 | #include <stdio.h>
int main() {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
if (a <= c && c <= b) {
printf("YES");
} else {
printf("NO");
}
} | #include <stdio.h>
int main() {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
if (a <= c && c <= b) {
printf("Yes");
} else {
printf("No");
}
} | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 1,389,936 | 1,389,937 | u194529785 | c |
p03722 | #pragma GCC optimize("O3")
#include <stdio.h>
#define INF 9999999999999999999
long long dist[1000][1000];
int main() {
int V, E, i, j;
long long k;
scanf("%d%d", &V, &E);
for (i = 0; i < V; i++) {
for (j = 0; j < i; j++)
dist[i][j] = INF;
dist[i][j++] = 0;
for (; j < V; j++)
dist[i][j] =... | #pragma GCC optimize("O3")
#include <stdio.h>
#define INF 2300000000000000000LL
long long dist[1000][1000];
int main() {
int V, E, i, j;
long long k;
scanf("%d%d", &V, &E);
for (i = 0; i < V; i++) {
for (j = 0; j < i; j++)
dist[i][j] = INF;
dist[i][j++] = 0;
for (; j < V; j++)
dist[i][j]... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 1,393,324 | 1,393,325 | u280667879 | c |
p03722 | #pragma GCC optimize("O3")
#include <stdio.h>
#define INF 1e20
long long dist[1000][1000];
int main() {
int V, E, i, j;
long long k;
scanf("%d%d", &V, &E);
for (i = 0; i < V; i++) {
for (j = 0; j < i; j++)
dist[i][j] = INF;
dist[i][j++] = 0;
for (; j < V; j++)
dist[i][j] = INF;
}
for... | #pragma GCC optimize("O3")
#include <stdio.h>
#define INF 2300000000000000000LL
long long dist[1000][1000];
int main() {
int V, E, i, j;
long long k;
scanf("%d%d", &V, &E);
for (i = 0; i < V; i++) {
for (j = 0; j < i; j++)
dist[i][j] = INF;
dist[i][j++] = 0;
for (; j < V; j++)
dist[i][j]... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 1,393,326 | 1,393,325 | u280667879 | c |
p03729 | #include <stdio.h>
int main() {
int i, j = 0, flag = 0;
char ward[3][11];
scanf("%s%s%s", ward[0], ward[1], ward[2]);
for (i = 0; i < 2; i++) {
j = 0;
while (ward[i][j] != 0) {
j++;
}
if (ward[i][j - 1] != ward[i + 1][0])
flag = 1;
}
if (flag == 0)
puts("NO");
else
put... | #include <stdio.h>
int main() {
int i, j = 0, flag = 0;
char ward[3][11];
scanf("%s%s%s", ward[0], ward[1], ward[2]);
for (i = 0; i < 2; i++) {
j = 0;
while (ward[i][j] != 0) {
j++;
}
if (ward[i][j - 1] != ward[i + 1][0])
flag = 1;
}
if (flag == 1)
puts("NO");
else
put... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,394,473 | 1,394,474 | u946810083 | c |
p03759 | #include <stdio.h>
int main() {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
if (b - a == c - b)
printf("Yes");
else
printf("No");
}
| #include <stdio.h>
int main() {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
if (b - a == c - b)
printf("YES");
else
printf("NO");
}
| [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 1,405,663 | 1,405,664 | u568382716 | c |
p03767 | #include <stdio.h>
#include <stdlib.h>
int compare_int(const void *a, const void *b) { return *(int *)b - *(int *)a; }
int main(int argc, char const *argv[]) {
int N;
scanf("%d", &N);
int M = 3 * N;
int a[M];
for (int i = 0; i < M; i++) {
scanf("%d", a + i);
}
qsort(a, M, sizeof(int), compare_int);... | #include <stdio.h>
#include <stdlib.h>
int compare_int(const void *a, const void *b) { return *(int *)b - *(int *)a; }
int main(int argc, char const *argv[]) {
int N;
scanf("%d", &N);
int M = 3 * N;
int a[M];
for (int i = 0; i < M; i++) {
scanf("%d", a + i);
}
qsort(a, M, sizeof(int), compare_int);... | [
"assignment.change"
] | 1,409,897 | 1,409,898 | u912952979 | c |
p03773 | #include <stdio.h>
int main() {
int A, B, C;
scanf("%d %d", &A, &B);
while ((0 > A) && (B > 23)) {
scanf("%d %d", &A, &B);
}
C = A + B;
while (C >= 24) {
C = C - 12;
}
printf("%d", C);
return 0;
} | #include <stdio.h>
int main() {
int A, B, C;
scanf("%d %d", &A, &B);
while ((0 > A) && (B > 23)) {
scanf("%d %d", &A, &B);
}
C = A + B;
while (C >= 24) {
C = C - 24;
}
printf("%d", C);
return 0;
} | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 1,412,244 | 1,412,245 | u268471093 | c |
p03774 | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
int manhattan(int x1, int x2, int y1, int y2);
int main() {
int n, m, *a, *b, *c, *d;
int i, j, temp, min, minj;
scanf("%d%d", &n, &m);
a = (int *)malloc(sizeof(int) * n);
b = (int *)malloc(sizeof(int) * n);
c = (int *)malloc(sizeof(int) * m);
d =... | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
int manhattan(int x1, int x2, int y1, int y2);
int main() {
int n, m, *a, *b, *c, *d;
int i, j, temp, min, minj;
scanf("%d%d", &n, &m);
a = (int *)malloc(sizeof(int) * n);
b = (int *)malloc(sizeof(int) * n);
c = (int *)malloc(sizeof(int) * m);
d =... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,415,551 | 1,415,552 | u869997698 | c |
p03795 | #include <stdio.h>
int main(void) {
int n, x, y;
scanf("%d", &n);
x = n * 800;
y = n / 15;
printf("%d\n", x - y);
return 0;
} | #include <stdio.h>
int main(void) {
int n, x, y;
scanf("%d", &n);
x = n * 800;
y = n / 15 * 200;
printf("%d\n", x - y);
return 0;
} | [
"assignment.change"
] | 1,426,209 | 1,426,210 | u992736202 | c |
p03814 | #include <stdio.h>
#include <string.h>
int main() {
char s[2000000];
int a, z;
scanf("%s", s);
for (a = 0; s[a] != 'A'; a++) {
for (z = strlen(s) - 1; s[z] != 'Z'; z--)
;
}
printf("%d\n", z - a + 1);
return 0;
} | #include <stdio.h>
#include <string.h>
int main() {
char s[2000000];
int a, z;
scanf("%s", s);
for (a = 0; s[a] != 'A'; a++)
;
for (z = strlen(s) - 1; s[z] != 'Z'; z--)
;
printf("%d\n", z - a + 1);
return 0;
} | [] | 1,444,067 | 1,444,068 | u829808749 | c |
p03821 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
// 1000000000
typedef struct {
long long int A;
long long int B;
} Array;
int main(int argc, const char *argv[]) {
long long int N;
scanf("%lld\n", &N);
Array *array = malloc(sizeof(array) * N);
memset(array, 0, sizeof(array) * N);
for (int i = ... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
// 1000000000
typedef struct {
long long int A;
long long int B;
} Array;
int main(int argc, const char *argv[]) {
long long int N;
scanf("%lld\n", &N);
Array *array = malloc(sizeof(Array) * N);
memset(array, 0, sizeof(array) * N);
for (int i = ... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,448,417 | 1,448,418 | u745153780 | c |
p03826 | #include <stdio.h>
int main() {
int A, B, C, D;
scanf("%d %d %d %d", A, B, C, D);
if (A * B >= C * D) {
printf("%d", A * B);
} else {
printf("%d", C * D);
}
return 0;
}
| #include <stdio.h>
int main() {
int A, B, C, D;
// scanfで文字列以外を指定する時は&が必要
scanf("%d %d %d %d", &A, &B, &C, &D);
if (A * B >= C * D) {
printf("%d", A * B);
} else {
printf("%d", C * D);
}
return 0;
}
| [
"expression.operation.unary.reference.add"
] | 1,449,648 | 1,449,649 | u348405655 | c |
p03835 | #include <stdio.h>
int main(void) {
int K, S, i, j, k, result = 0;
scanf("%d %d", &K, &S);
for (i = 0; i <= K; i++) {
for (j = 0; j <= K; j++) {
k = S - i - j;
if (k >= 0) {
// printf("%d %d %d\n",i,j,k);
result++;
}
}
}
printf("%d", result);
return 0;
} | #include <stdio.h>
int main(void) {
int K, S, i, j, k, result = 0;
scanf("%d %d", &K, &S);
for (i = 0; i <= K; i++) {
for (j = 0; j <= K; j++) {
k = S - i - j;
if (k >= 0 && k <= K) {
// printf("%d %d %d\n",i,j,k);
result++;
}
}
}
printf("%d", result);
return 0... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,455,207 | 1,455,208 | u045767587 | c |
p03844 | #include <stdio.h>
int main(void) {
int a, b;
char op;
scanf("%d%c%d", &a, &op, &b);
printf("%d", op == '+' ? a + b : a - b);
return 0;
} | #include <stdio.h>
int main(void) {
int a, b;
char op;
scanf("%d %c %d", &a, &op, &b);
printf("%d", op == '+' ? a + b : a - b);
return 0;
} | [
"literal.string.change",
"call.arguments.change"
] | 1,461,106 | 1,461,107 | u612175324 | c |
p03943 | #include <stdio.h>
int main(void) {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
if (a == b + c) {
printf("YES\n");
} else if (b == c + a) {
printf("YES\n");
} else if (c == a + b) {
printf("Yes\n");
} else {
printf("No\n");
}
return 0;
} | #include <stdio.h>
int main(void) {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
if (a == b + c) {
printf("Yes\n");
} else if (b == c + a) {
printf("Yes\n");
} else if (c == a + b) {
printf("Yes\n");
} else {
printf("No\n");
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 1,480,720 | 1,480,721 | u302586765 | c |
p03943 | #include <stdio.h>
int main(void) {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
if (a == b + c) {
printf("YES\n");
} else if (b == c + a) {
printf("YES\n");
} else if (c == a + b) {
printf("YES\n");
} else {
printf("NO\n");
}
return 0;
} | #include <stdio.h>
int main(void) {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
if (a == b + c) {
printf("Yes\n");
} else if (b == c + a) {
printf("Yes\n");
} else if (c == a + b) {
printf("Yes\n");
} else {
printf("No\n");
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 1,480,722 | 1,480,721 | u302586765 | c |
p03962 | #include <stdio.h>
int main() {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
if ((a == b && a != c) || (b == c && b != a) || (c == a && c != b))
printf("2");
if (a == b == c)
printf("1");
if ((a != b) && (b != c) && (c != a))
printf("3");
return 0;
} | #include <stdio.h>
int main() {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
if ((a == b && a != c) || (b == c && b != a) || (c == a && c != b))
printf("2");
if ((a == b) && (b == c))
printf("1");
if ((a != b) && (b != c) && (c != a))
printf("3");
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 1,489,396 | 1,489,397 | u525112881 | c |
p03963 | #include <stdio.h>
int ruizyou(int x, int n) {
int i, sum = 1;
for (i = 1; i <= n; i++) {
sum *= x;
}
return sum;
}
int main(void) {
int i, h, a, b, c, k, l, m, N, K, j, v, g, flag, sum;
scanf("%d%d", &N, &K);
printf("%d", K * ruizyou(K - 1, N));
return 0;
}
| #include <stdio.h>
int ruizyou(int x, int n) {
int i, sum = 1;
for (i = 1; i <= n; i++) {
sum *= x;
}
return sum;
}
int main(void) {
int i, h, a, b, c, k, l, m, N, K, j, v, g, flag, sum;
scanf("%d%d", &N, &K);
printf("%d", K * ruizyou(K - 1, N - 1));
return 0;
}
| [
"expression.operation.binary.add"
] | 1,490,907 | 1,490,908 | u213156132 | c |
p03963 | #include <stdio.h>
int ruizyou(int x, int n) {
int i, sum = 1;
for (i = 1; i <= n; i++) {
sum *= x;
}
return sum;
}
int main(void) {
int i, h, a, b, c, k, l, m, N, K, j, v, g, flag, sum;
scanf("%d%d", N, K);
printf("%d", K * ruizyou(K - 1, N));
return 0;
}
| #include <stdio.h>
int ruizyou(int x, int n) {
int i, sum = 1;
for (i = 1; i <= n; i++) {
sum *= x;
}
return sum;
}
int main(void) {
int i, h, a, b, c, k, l, m, N, K, j, v, g, flag, sum;
scanf("%d%d", &N, &K);
printf("%d", K * ruizyou(K - 1, N - 1));
return 0;
}
| [
"expression.operation.unary.reference.add"
] | 1,490,909 | 1,490,908 | u213156132 | c |
p03964 | #include <stdio.h>
#define MIN(v0, v1) (v0 < v1 ? v0 : v1)
#define MAX(v0, v1) (v0 > v1 ? v0 : v1)
int main() {
int N = 0, i = 0;
unsigned long t = 0, a = 0, base = 0;
scanf("%d", &N);
int T[N], A[N];
for (i = 0; i < N; i++) {
scanf("%d %d", &T[i], &A[i]);
}
t = T[0];
a = A[0];
for (i = 1; i < N... | #include <stdio.h>
#define MIN(v0, v1) (v0 < v1 ? v0 : v1)
#define MAX(v0, v1) (v0 > v1 ? v0 : v1)
int main() {
int N = 0, i = 0;
unsigned long t = 0, a = 0, base = 0;
scanf("%d", &N);
int T[N], A[N];
for (i = 0; i < N; i++) {
scanf("%d %d", &T[i], &A[i]);
}
t = T[0];
a = A[0];
for (i = 1; i < N... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 1,491,598 | 1,491,599 | u736339585 | c |
p03970 | #include <stdio.h>
int main() {
char ans[] = "CODEFESTIVAL2016";
char read[16];
int i, a = 0;
scanf("%s", read);
for (i = 0; i < 16; i++) {
if (ans[i] != read[i])
a++;
}
printf("%d\n", a);
return 0;
}
| #include <stdio.h>
int main() {
char ans[] = "CODEFESTIVAL2016";
char read[17];
int i, a = 0;
scanf("%s", read);
for (i = 0; i < 16; i++) {
if (ans[i] != read[i])
a++;
}
printf("%d\n", a);
return 0;
}
| [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 1,492,598 | 1,492,599 | u811309788 | c |
p03997 | #include <stdio.h>
#include <stdlib.h>
int main() {
int a, b, h, s;
scanf("%d %d %d ", &a, &b, &h);
s = ((a + b) / 2) * h;
printf("%d", s);
return 0;
} | #include <stdio.h>
#include <stdlib.h>
int main() {
int a, b, h, s;
scanf("%d %d %d ", &a, &b, &h);
s = (a + b) * h / 2;
printf("%d", s);
return 0;
} | [
"assignment.change"
] | 1,500,637 | 1,500,638 | u681445439 | c |
p04011 | #include <stdio.h>
int main() {
int N, K, X, Y;
scanf("%d %d %d %d", &N, &K, &X, &Y);
if (N < K) {
Y = 0;
}
printf("%d", K * X + (N - K) * Y);
return 0;
} | #include <stdio.h>
int main() {
int N, K, X, Y;
scanf("%d %d %d %d", &N, &K, &X, &Y);
if (N < K) {
K = N;
}
printf("%d", K * X + (N - K) * Y);
return 0;
} | [
"assignment.variable.change",
"identifier.change",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 1,508,562 | 1,508,563 | u008829811 | c |
p04011 | #include <stdio.h>
int main() {
int N, K, X, Y;
scanf("%d %d %d %d", &N, &K, &X, &Y);
if (N <= K) {
Y = 0;
}
printf("%d", K * X + (N - K) * Y);
return 0;
} | #include <stdio.h>
int main() {
int N, K, X, Y;
scanf("%d %d %d %d", &N, &K, &X, &Y);
if (N < K) {
K = N;
}
printf("%d", K * X + (N - K) * Y);
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.variable.change",
"identifier.change",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 1,508,564 | 1,508,563 | u008829811 | c |
p04043 | #include <stdio.h>
#include <string.h>
int main() {
int a;
int b;
int c;
if (!((scanf("%d", &a) == 1) && (scanf("%d", &b) == 1) &&
(scanf("%d", &c) == 1))) {
return -1;
}
if ((a == 5 && b == 5 && c == 7) || (a == 5 && b == 7 && c == 5) ||
(a == 7 && b == 5 && c == 5)) {
printf("OK");... | #include <stdio.h>
#include <string.h>
int main() {
int a;
int b;
int c;
if (!((scanf("%d", &a) == 1) && (scanf("%d", &b) == 1) &&
(scanf("%d", &c) == 1))) {
return -1;
}
if ((a == 5 && b == 5 && c == 7) || (a == 5 && b == 7 && c == 5) ||
(a == 7 && b == 5 && c == 5)) {
printf("YES")... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 1,527,886 | 1,527,887 | u313349084 | c |
p04043 | #include <stdio.h>
int main(void) {
int num1, num2, num3;
scanf("%d", &num1);
scanf("%d", &num2);
scanf("%d", &num3);
if (num1 == 5, num2 == 7, num3 == 5) {
printf("YES");
} else if (num1 == 7, num2 == 5, num3 == 5) {
printf("YES");
} else if (num1 == 5, num2 == 5, num3 == 7) {
printf("YES");
... | #include <stdio.h>
int main(void) {
int num1, num2, num3;
scanf("%d", &num1);
scanf("%d", &num2);
scanf("%d", &num3);
if (num1 == 5 && num2 == 7 && num3 == 5) {
printf("YES");
} else if (num1 == 7 && num2 == 5 && num3 == 5) {
printf("YES");
} else if (num1 == 5 && num2 == 5 && num3 == 7) {
pri... | [
"control_flow.branch.if.condition.change"
] | 1,529,648 | 1,529,649 | u350647370 | c |
p04044 | #include <stdio.h>
#include <string.h>
int main() {
int i, j;
int n, l;
scanf("%d", &n);
scanf("%d", &l);
char moji[n][100], tmp[100];
for (i = 0; i < n; i++) {
scanf("%s", moji[i]);
}
for (i = 1; i < n; i++) {
for (j = i; j < n; j++) {
if (strcmp(moji[j - 1], moji[j]) > 0) {
st... | #include <stdio.h>
#include <string.h>
int main() {
int i, j;
int n, l;
scanf("%d", &n);
scanf("%d", &l);
char moji[110][110], tmp[110];
for (i = 0; i < n; i++) {
scanf("%s", moji[i]);
}
for (i = 1; i < n; i++) {
for (j = 1; j < n; j++) {
if (strcmp(moji[j - 1], moji[j]) > 0) {
... | [
"identifier.replace.remove",
"literal.replace.add",
"variable_declaration.array_dimensions.change",
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change"
] | 1,531,803 | 1,531,802 | u340638466 | c |
p00000 | #include <stdio.h>
int main() {
int num1, num2;
for (num1 = 0; num1 < 10; num1++) {
for (num2 = 0; num2 < 10; num2++) {
printf("%dx%d\=%d", num1, num2, num1 * num2);
}
}
return 0;
} | #include <stdio.h>
int main() {
int num1, num2;
for (num1 = 1; num1 < 10; num1++) {
for (num2 = 1; num2 < 10; num2++) {
printf("%dx%d=%d\n", num1, num2, num1 * num2);
}
}
return 0;
} | null | 1,284 | 1,285 | u075624361 | c |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.