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 |
|---|---|---|---|---|---|---|---|
p03254 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> kdm(n);
for (int i = 0; i < n; i++)
cin >> kdm.at(i);
sort(kdm.begin(), kdm.end());
int ans = 0, c = 0;
while (x > 0 && c < n) {
if (x >= kdm.at(c)) {
ans++;
}
x -= kdm.at(c);
c++;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> kdm(n);
for (int i = 0; i < n; i++)
cin >> kdm.at(i);
sort(kdm.begin(), kdm.end());
int ans = 0, c = 0;
while (x > 0 && c < n) {
if (x >= kdm.at(c)) {
ans++;
}
x -= kdm.at(c);
c++;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,041,981 | 1,041,982 | u380491044 | cpp |
p03254 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
int res = 0;
for (int i = 0; i < n; i++) {
if (x >= a[n]) {
x -= a[n];
res++;
} else {
x = 0;
break;
}
}
if (re... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
int res = 0;
for (int i = 0; i < n; i++) {
if (x >= a[i]) {
x -= a[i];
res++;
} else {
x = 0;
break;
}
}
if (re... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"misc.opposites",
"expression.operator.compare.change"
] | 1,041,987 | 1,041,988 | u736995628 | cpp |
p03254 | //コンパイラ最適化用
#pragma GCC optimize("Ofast")
//インクルード(アルファベット順)
#include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <chrono> //実行時間計測
#include <climits> //INT_MAXなど
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#incl... | //コンパイラ最適化用
#pragma GCC optimize("Ofast")
//インクルード(アルファベット順)
#include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <chrono> //実行時間計測
#include <climits> //INT_MAXなど
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#incl... | [
"assignment.add"
] | 1,041,989 | 1,041,990 | u991046511 | cpp |
p03254 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
int64_t N, x, S, ans;
cin >> N >> x;
S = 0;
ans = 0;
vector<int64_t> a(N);
for (int64_t i = 0; i < N; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
int64_t N, x, S, ans;
cin >> N >> x;
S = 0;
ans = 0;
vector<int64_t> a(N);
for (int64_t i = 0; i < N; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.else.add"
] | 1,041,997 | 1,041,998 | u158677249 | cpp |
p03254 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
int64_t N, x, S, ans;
cin >> N >> x;
S = 0;
ans = 0;
vector<int64_t> a(N);
for (int64_t i = 0; i < N; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
int64_t N, x, S, ans;
cin >> N >> x;
S = 0;
ans = 0;
vector<int64_t> a(N);
for (int64_t i = 0; i < N; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,041,999 | 1,041,998 | u158677249 | cpp |
p03254 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> a(n);
for (int &c : a) {
cin >> c;
}
sort(a.begin(), a.end());
int sum = 0;
for (int c : a) {
sum += c;
}
if (sum < x) {
cout << n << endl;
} else if (sum == x) {
cout << n << endl;
} ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> a(n);
for (int &c : a) {
cin >> c;
}
sort(a.begin(), a.end());
long long sum = 0;
for (int c : a) {
sum += c;
}
if (sum < x) {
cout << n - 1 << endl;
} else if (sum == x) {
cout << n << ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 1,042,006 | 1,042,007 | u993104815 | cpp |
p03254 | #include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
#define pb push_back
#define pii pair<int, int>
#define F first
#define S second
#define endl '\n'
#define int long long
#define sync \
ios_base::sync_with_stdio(false); ... | #include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
#define pb push_back
#define pii pair<int, int>
#define F first
#define S second
#define endl '\n'
#define int long long
#define sync \
ios_base::sync_with_stdio(false); ... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"assignment.add"
] | 1,042,009 | 1,042,010 | u469104695 | cpp |
p03254 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
ll MOD = 1000000007;
int main() {
int n, x;
cin >> n >> x;
vector<int> A(n);
rep(i, n) cin >> A[i];
sort(A.begin(), A.end());
int ans = 0;
rep(i, n) {
if (x >=... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
ll MOD = 1000000007;
int main() {
int n, x;
cin >> n >> x;
vector<int> A(n);
rep(i, n) cin >> A[i];
sort(A.begin(), A.end());
int ans = 0;
rep(i, n) {
if (x >=... | [] | 1,042,011 | 1,042,012 | u166553470 | cpp |
p03254 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, x, i;
cin >> N >> x;
long long ans = 0;
long long a[N];
for (i = 0; i < N; i++)
cin >> a[i];
sort(a, a + N);
// reverse(a,a+N);
for (i = 0; i < N; i++) {
x -= a[i];
if (x >= 0) {
ans++;
} else {
break;... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, x, i;
cin >> N >> x;
long long ans = 0;
long long a[N];
for (i = 0; i < N; i++)
cin >> a[i];
sort(a, a + N);
// reverse(a,a+N);
for (i = 0; i < N; i++) {
x -= a[i];
if (x >= 0) {
ans++;
} else {
break;... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,042,050 | 1,042,051 | u012131682 | cpp |
p03254 | #include <algorithm>
#include <array>
#include <iostream>
#include <string>
#include <vector>
#define int long long
using namespace std;
signed main() {
int n;
int x;
int a[101];
int ans = 0;
cin >> n;
cin >> x;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
for (int i = 0; i <... | #include <algorithm>
#include <array>
#include <iostream>
#include <string>
#include <vector>
#define int long long
using namespace std;
signed main() {
int n;
int x;
int a[101];
int ans = 0;
cin >> n;
cin >> x;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
for (int i = 0; i <... | [] | 1,042,054 | 1,042,055 | u236585484 | cpp |
p03254 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, x;
vector<int> A;
int ans = 0;
cin >> N >> x;
for (int i = 0; i < N; ++i) {
int a;
cin >> a;
A.push_back(a);
}
sort(A.begin(), A.end());
for (int i = 0; i < N; ++i) {
if (A[i] > x) {
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, x;
vector<int> A;
int ans = 0;
cin >> N >> x;
for (int i = 0; i < N; ++i) {
int a;
cin >> a;
A.push_back(a);
}
sort(A.begin(), A.end());
for (int i = 0; i < N; ++i) {
if (A[i] > x) {
... | [] | 1,042,059 | 1,042,060 | u818542539 | cpp |
p00000 | #include <stdio.h>
int main(void) {
for (int i = 0; i < 10; i++) {
for (int j = 0; j < 10; j++) {
printf("%dx%d=%d\n", i, j, i * j);
}
}
return 0;
} | #include <stdio.h>
int main(void) {
for (int i = 1; i < 10; i++) {
for (int j = 1; j < 10; j++) {
printf("%dx%d=%d\n", i, j, i * j);
}
}
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 328 | 329 | u488038316 | c |
p00000 | #include <stdio.h>
int main(void) {
int a, b, c;
for (a = 1; a <= 9; a++) {
for (b = 1; b <= 9; b++) {
c = a * b;
printf("%d??%d=%d\n", a, b, c);
}
b = 1;
}
return 0;
} | #include <stdio.h>
int main(void) {
int a, b, c;
for (a = 1; a <= 9; a++) {
for (b = 1; b <= 9; b++) {
c = a * b;
printf("%dx%d=%d\n", a, b, c);
}
b = 1;
}
return 0;
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 338 | 339 | u712011430 | c |
p00000 | #include <stdio.h>
int main() {
int a, b;
for (a = 1; a < 10; a++) {
for (b = 1; b < 10; b++) {
printf("%d*%d=%d\n", a, b, a * b);
}
}
return 0;
} | #include <stdio.h>
int main() {
int a, b;
for (a = 1; a < 10; a++) {
for (b = 1; b < 10; b++) {
printf("%dx%d=%d\n", a, b, a * b);
}
}
return 0;
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 1,072 | 1,073 | u233080611 | c |
p00000 | #include <stdio.h>
int main() {
int a, b;
for (a = 1; a < 10; a++) {
for (b = 1; b < 10; b++) {
printf("%d??%d=%d\n", a, b, a * b);
}
}
return 0;
} | #include <stdio.h>
int main() {
int a, b;
for (a = 1; a < 10; a++) {
for (b = 1; b < 10; b++) {
printf("%dx%d=%d\n", a, b, a * b);
}
}
return 0;
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 1,074 | 1,073 | u233080611 | c |
p00000 | #include <stdio.h>
int i, j;
int main(void) {
for (i = 1; i <= 9; i++) {
for (j = i; j <= 9; j++) {
printf("%dx%d=%d\n", i, j, i * j);
}
}
return 0;
} | #include <stdio.h>
int i, j;
int main() {
for (i = 1; i <= 9; i++) {
for (j = 1; j <= 9; j++) {
printf("%dx%d=%d\n", i, j, i * j);
}
}
return 0;
} | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.initializer.change"
] | 1,077 | 1,078 | u598565015 | c |
p00001 | #include <stdio.h>
#define Max 1000
void swap(int *x, int *y) {
int buff;
buff = *x;
*x = *y;
*y = buff;
}
void insertionSort(int A[Max], int N) {
int i, j, v;
for (i = 0; i < N; i++) {
v = A[i];
j = i - 1;
while (j >= 0 && A[j] < v) {
A[j + 1] = A[j];
j--;
}
A[j + 1] = ... | #include <stdio.h>
#define Max 1000
void swap(int *x, int *y) {
int buff;
buff = *x;
*x = *y;
*y = buff;
}
void insertionSort(int A[Max], int N) {
int i, j, v;
for (i = 0; i < N; i++) {
v = A[i];
j = i - 1;
while (j >= 0 && A[j] < v) {
A[j + 1] = A[j];
j--;
}
A[j + 1] = ... | [
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 3,430 | 3,431 | u598767908 | c |
p00001 | #include <stdio.h>
void swap(int *x, int *y) {
*x = *x ^ *y;
*y = *x ^ *y;
*x = *x ^ *y;
}
void bsort(int list[10]) {
int needAgain = 0;
int i;
do {
needAgain = 0;
for (i = 0; i < 8; i++) {
if (list[i] < list[i + 1]) {
swap(&list[i], &list[i + 1]);
needAgain = 1;
}
... | #include <stdio.h>
void swap(int *x, int *y) {
*x = *x ^ *y;
*y = *x ^ *y;
*x = *x ^ *y;
}
void bsort(int list[10]) {
int needAgain = 0;
int i;
do {
needAgain = 0;
for (i = 0; i <= 8; i++) {
if (list[i] < list[i + 1]) {
swap(&list[i], &list[i + 1]);
needAgain = 1;
}
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 3,864 | 3,865 | u533406606 | c |
p00001 | #include <stdio.h>
int main() {
int hills[10], top[3], i, j;
for (i = 0; i < 10; i++)
scanf("%d", &hills[i]);
for (i = 1; i < 10; i++) {
int tmp = hills[i];
for (j = i; j > 0 && hills[j - 1] > tmp; j--)
hills[j] = hills[j - 1];
hills[j] = tmp;
}
for (i = 0; i < 3; i++)
printf("%d\... | #include <stdio.h>
int main() {
int hills[10], top[3], i, j, tmp;
for (i = 0; i < 10; i++)
scanf("%d", &hills[i]);
for (i = 1; i < 10; i++) {
tmp = hills[i];
for (j = i; j > 0 && hills[j - 1] < tmp; j--)
hills[j] = hills[j - 1];
hills[j] = tmp;
}
for (i = 0; i < 3; i++)
printf("%d... | [
"variable_declaration.add",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 3,967 | 3,968 | u709185111 | c |
p00002 | #include <stdio.h>
int main(void) {
int x, y, i, ans;
while (scanf("%d %d", &x, &y) != EOF) {
i = 0;
ans = x + y;
while (ans > 0) {
ans /= 10;
i++;
}
printf("%d", i);
}
return (0);
} | #include <stdio.h>
int main(void) {
int x, y, i, ans;
while (scanf("%d %d", &x, &y) != EOF) {
i = 0;
ans = x + y;
while (ans > 0) {
ans /= 10;
i++;
}
printf("%d\n", i);
}
return (0);
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 5,353 | 5,354 | u870909395 | c |
p00003 | #include <stdio.h>
int main() {
int a[3];
int n;
int i, j;
int tmp;
scanf("%d", &n);
while (n > 0) {
scanf("%d %d %d", &a[0], &a[1], &a[2]);
for (i = 0; i < 3; i++) {
for (j = 3; j > i; j--) {
if (a[j] < a[j - 1]) {
tmp = a[j];
a[j] = a[j - 1];
a[j - 1] = ... | #include <stdio.h>
int main() {
int a[3];
int n;
int i, j;
int tmp;
scanf("%d", &n);
while (n > 0) {
scanf("%d %d %d", &a[0], &a[1], &a[2]);
for (i = 0; i < 3; i++) {
for (j = 2; j > i; j--) {
if (a[j] < a[j - 1]) {
tmp = a[j];
a[j] = a[j - 1];
a[j - 1] = ... | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 6,239 | 6,240 | u544325767 | c |
p00003 | #include <stdio.h>
int main(void) {
int a, b, c, i, n;
scanf("%d", &n);
for (i = 0; i <= n; i++) {
scanf("%d %d %d", &a, &b, &c);
if (((a * a) + (b * b)) == (c * c) || ((a * a) + (c * c)) == (b * b) ||
((c * c) + (b * b)) == (a * a)) {
printf("YES\n");
} else {
printf("NO\n");
... | #include <stdio.h>
int main(void) {
int a, b, c, i, n;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d %d %d", &a, &b, &c);
if (((a * a) + (b * b)) == (c * c) || ((a * a) + (c * c)) == (b * b) ||
((c * c) + (b * b)) == (a * a)) {
printf("YES\n");
} else {
printf("NO\n");
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 6,308 | 6,309 | u367313202 | c |
p00004 | #include <stdio.h>
int main(int argc, const char *argv[]) {
double a[3], b[3];
double x = 0, y = 0;
double fa[2], fb[2];
while (scanf("%lf %lf %lf %lf %lf %lf", &a[0], &a[1], &a[2], &b[0], &b[1],
&b[2]) != EOF) {
fa[0] = a[1] * b[0];
fa[1] = a[2] * b[0];
fb[0] = b[1] * a[0];
fb[... | #include <stdio.h>
int main(int argc, const char *argv[]) {
double a[3], b[3];
double x = 0, y = 0;
double fa[2], fb[2];
while (scanf("%lf %lf %lf %lf %lf %lf", &a[0], &a[1], &a[2], &b[0], &b[1],
&b[2]) != EOF) {
fa[0] = a[1] * b[0];
fa[1] = a[2] * b[0];
fb[0] = b[1] * a[0];
fb[... | [
"expression.operation.binary.change"
] | 7,479 | 7,480 | u113082491 | c |
p00005 | #include <stdio.h>
long gcd(long a, long b) {
if (b == 0) {
return (a);
}
return (gcd(b, a % b));
}
long lcm(long a, long b) { return (a / gcd(a, b) * b); }
int main(void) {
long a, b;
scanf("%ld %ld", &a, &b);
printf("%ld %ld\n", gcd(a, b), lcm(a, b));
return (0);
} | #include <stdio.h>
long gcd(long a, long b) {
if (b == 0) {
return (a);
}
return (gcd(b, a % b));
}
long lcm(long a, long b) { return (a / gcd(a, b) * b); }
int main(void) {
long a, b;
while (scanf("%ld %ld", &a, &b) != EOF)
printf("%ld %ld\n", gcd(a, b), lcm(a, b));
return (0);
} | [
"control_flow.loop.condition.change"
] | 8,194 | 8,195 | u334031393 | c |
p00006 | #include <stdio.h>
#include <string.h>
#define MAX 21
main() {
char str[MAX];
char r_str[MAX];
int i, num;
scanf("%s", str);
for (num = 0; str[num] != '\0'; num++)
for (i = 0; i < num + 1; i++) {
r_str[i] = str[num - i];
}
r_str[i + 1] = '\0';
printf("%s\n", r_str);
return 0;
} | #include <stdio.h>
#include <string.h>
#define MAX 21
main() {
char str[MAX];
char r_str[MAX];
int i, num;
scanf("%s", str);
for (num = 1; str[num] != '\0'; num++)
for (i = 0; i < num + 1; i++) {
r_str[i] = str[num - i];
}
r_str[num] = '\0';
printf("%s\n", r_str);
return 0;
} | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"assignment.variable.change",
"expression.operation.binary.remove"
] | 9,443 | 9,444 | u085441951 | c |
p00006 | #include <stdio.h>
#include <string.h>
int main(void) {
char str[100];
scanf("%s", str);
int len = strlen(str);
while (len-- != 0) {
printf("%c", str[len]);
puts("");
}
return 0;
}
| #include <stdio.h>
#include <string.h>
int main(void) {
char str[100];
scanf("%s", str);
int len = strlen(str);
while (len-- != 0) {
printf("%c", str[len]);
}
puts("");
return 0;
}
| [] | 9,982 | 9,983 | u900764118 | c |
p00007 | #include <stdio.h>
int main(void) {
int n, i;
int x = 100000;
scanf("%d", &n);
for (i = 0; i < n; i++) {
x = x * 1.05;
}
if (x % 1000 != 0) {
x += 1000 - (x % 1000);
}
printf("%d\n", x);
return 0;
} | #include <stdio.h>
int main(void) {
int n, i;
int x = 100000;
scanf("%d", &n);
for (i = 0; i < n; i++) {
x = x * 1.05;
if (x % 1000 != 0) {
x += 1000 - (x % 1000);
}
}
printf("%d\n", x);
return 0;
} | [] | 10,357 | 10,358 | u895599153 | c |
p00008 | #include <stdio.h>
int main() {
int a, b, c, d;
int n;
int count;
while (scanf("%d", &n) != EOF) {
count = 0;
for (a = 0; a < 10; a++) {
for (b = 0; b < 10; b++) {
for (c = 0; c < 10; c++) {
for (d = 0; d < 10; d++) {
if (a + b + c + d == n)
count++;
... | #include <stdio.h>
int main() {
int a, b, c, d;
int n;
int count;
while (scanf("%d", &n) != EOF) {
count = 0;
for (a = 0; a < 10; a++) {
for (b = 0; b < 10; b++) {
for (c = 0; c < 10; c++) {
for (d = 0; d < 10; d++) {
if (a + b + c + d == n)
count++;
... | [] | 11,355 | 11,356 | u627002197 | c |
p00008 | #include <stdio.h>
int main() {
int n;
int m;
int a, b, c, d;
int result;
while (scanf("%d", &n) != EOF) {
result = 0;
if (n > 36) {
printf("0\n");
}
if (n > 9) {
m = 10;
} else {
m = n + 1;
}
for (a = 0; a < m; a++) {
for (b = 0; b < m; b++) {
for ... | #include <stdio.h>
int main() {
int n;
int m;
int a, b, c, d;
int result;
while (scanf("%d", &n) != EOF) {
result = 0;
if (n > 36) {
printf("0\n");
} else {
if (n > 9) {
m = 10;
} else {
m = n + 1;
}
for (a = 0; a < m; a++) {
for (b = 0; b < m... | [
"control_flow.branch.else.add"
] | 11,669 | 11,670 | u716038039 | c |
p00011 | #include <stdio.h>
int main(void) {
int w, n;
int a, b;
int work;
int num[30];
int i;
scanf("%d", &w);
scanf("%d", &n);
for (i = 0; i < w; i++)
num[i] = i + 1;
for (i = 0; i < n; i++) {
scanf("%d,%d", &a, &b);
work = num[a - 1];
num[a - 1] = num[b - 1];
num[b - 1] = work;
}... | #include <stdio.h>
int main(void) {
int w, n;
int a, b;
int work;
int num[30];
int i;
scanf("%d", &w);
scanf("%d", &n);
for (i = 0; i < w; i++)
num[i] = i + 1;
for (i = 0; i < n; i++) {
scanf("%d,%d", &a, &b);
work = num[a - 1];
num[a - 1] = num[b - 1];
num[b - 1] = work;
}... | [
"control_flow.loop.for.condition.change"
] | 12,894 | 12,895 | u874419660 | c |
p00014 | #include <stdio.h>
#define N 600
int main(void) {
int d[100], i = 0, j = 0, k = 0;
int s;
while (scanf("%d", &d[i]) != EOF) {
i++;
}
for (j = 0; j <= i; j++) {
k = N / d[j] - 1;
s = k * (k + 1) * (2 * k + 1) / 6 * d[j] * d[j] * d[j];
printf("%d\n", s);
}
return 0;
} | #include <stdio.h>
#define N 600
int main(void) {
int d[100], i = 0, j = 0, k = 0;
int s;
while (scanf("%d", &d[i]) != EOF) {
i++;
}
for (j = 0; j < i; j++) {
k = N / d[j] - 1;
s = k * (k + 1) * (2 * k + 1) / 6 * d[j] * d[j] * d[j];
printf("%d\n", s);
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 14,232 | 14,233 | u266048402 | c |
p00016 | #include <math.h>
#include <stdio.h>
int main(void) {
double x = 0, y = 0, v = 90;
int line, angle;
while (scanf("%d,%d", &line, &angle), line && angle) {
x += line * cos(M_PI * v / 180);
y += line * sin(M_PI * v / 180);
v -= angle;
}
printf("%d\n%d\n", (int)x, (int)y);
return 0;
} | #include <math.h>
#include <stdio.h>
int main(void) {
double x = 0, y = 0, v = 90;
double line, angle;
while (scanf("%lf,%lf", &line, &angle), line || angle) {
x += line * cos(M_PI * v / 180);
y += line * sin(M_PI * v / 180);
v -= angle;
}
printf("%d\n%d\n", (int)x, (int)y);
return 0;
} | [
"variable_declaration.type.primitive.change",
"literal.string.change",
"control_flow.loop.condition.change",
"misc.opposites"
] | 14,991 | 14,992 | u722267370 | c |
p00016 | #include <math.h>
#include <stdio.h>
int main(void) {
double x = 0, y = 0, v = 90;
double line, angle;
while (scanf("%lf,%lf", &line, &angle), line && angle) {
x += line * cos(M_PI * v / 180);
y += line * sin(M_PI * v / 180);
v -= angle;
}
printf("%d\n%d\n", (int)x, (int)y);
return 0;
} | #include <math.h>
#include <stdio.h>
int main(void) {
double x = 0, y = 0, v = 90;
double line, angle;
while (scanf("%lf,%lf", &line, &angle), line || angle) {
x += line * cos(M_PI * v / 180);
y += line * sin(M_PI * v / 180);
v -= angle;
}
printf("%d\n%d\n", (int)x, (int)y);
return 0;
} | [
"misc.opposites",
"control_flow.loop.condition.change"
] | 14,993 | 14,992 | u722267370 | c |
p00016 | #include <math.h>
#include <stdio.h>
int main(void) {
double x = 0, y = 0, v = 90;
int line, angle;
while (scanf("%d,%d", &line, &angle), line && angle) {
x += line * cos(M_PI * v / 180);
y += line * sin(M_PI * v / 180);
v -= angle;
}
printf("%d\n%d\n", (int)x, (int)y);
return 0;
} | #include <math.h>
#include <stdio.h>
int main(void) {
double x = 0, y = 0, v = 90;
int line, angle;
while (scanf("%d,%d", &line, &angle), line || angle) {
x += line * cos(M_PI * v / 180);
y += line * sin(M_PI * v / 180);
v -= angle;
}
printf("%d\n%d\n", (int)x, (int)y);
return 0;
} | [
"misc.opposites",
"control_flow.loop.condition.change"
] | 14,991 | 14,994 | u722267370 | c |
p00016 | #include <math.h>
#include <stdio.h>
int main(void) {
double x = 0, y = 0, v = 90;
double line, angle;
while (scanf("%lf,%lf", &line, &angle), line && angle) {
x += line * cos(M_PI * v / 180);
y += line * sin(M_PI * v / 180);
v -= angle;
}
printf("%d\n%d\n", (int)x, (int)y);
return 0;
} | #include <math.h>
#include <stdio.h>
int main(void) {
double x = 0, y = 0, v = 90;
int line, angle;
while (scanf("%d,%d", &line, &angle), line || angle) {
x += line * cos(M_PI * v / 180);
y += line * sin(M_PI * v / 180);
v -= angle;
}
printf("%d\n%d\n", (int)x, (int)y);
return 0;
} | [
"variable_declaration.type.primitive.change",
"literal.string.change",
"control_flow.loop.condition.change",
"misc.opposites"
] | 14,993 | 14,994 | u722267370 | c |
p00019 | #include <stdio.h>
void clear(int a[], int num) {
int i;
for (i = 0; i < num; i++) {
a[i] = 0;
}
}
void array_in(int a[], int num) {
int i;
for (i = 0; num != 0; i++) {
a[i] = num % 10;
num /= 10;
}
}
void func(int ans[], int num[]) {
int i, j, a, b, n, p[200];
clear(p, 200);
for (i... | #include <stdio.h>
void clear(int a[], int num) {
int i;
for (i = 0; i < num; i++) {
a[i] = 0;
}
}
void array_in(int a[], int num) {
int i;
for (i = 0; num != 0; i++) {
a[i] = num % 10;
num /= 10;
}
}
void func(int ans[], int num[]) {
int i, j, a, b, n, p[200];
clear(p, 200);
for (i... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"call.arguments.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change"
] | 16,366 | 16,367 | u400458488 | c |
p00019 | #include <stdio.h>
int main(void) {
int n;
int i;
int re = 1;
while (1) {
scanf("%d", &n);
if (1 <= n && n <= 20)
break;
}
for (i = 0; i < n; i++) {
re *= n - i;
}
printf("%d\n", re);
return 0;
} | #include <stdio.h>
int main(void) {
int n;
int i;
long int re = 1;
while (1) {
scanf("%d", &n);
if (1 <= n && n <= 20)
break;
}
for (i = 0; i < n; i++) {
re *= n - i;
}
printf("%ld\n", re);
return 0;
} | [
"variable_declaration.type.widen.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 16,428 | 16,429 | u577534987 | c |
p00019 | #include <stdio.h>
int main(void) {
int n;
int i;
int re = 1;
while (1) {
scanf("%d", &n);
if (1 <= n && n <= 20)
break;
}
for (i = 0; i < n; i++) {
re *= n - i;
}
printf("%1d\n", re);
return 0;
} | #include <stdio.h>
int main(void) {
int n;
int i;
long int re = 1;
while (1) {
scanf("%d", &n);
if (1 <= n && n <= 20)
break;
}
for (i = 0; i < n; i++) {
re *= n - i;
}
printf("%ld\n", re);
return 0;
} | [
"variable_declaration.type.widen.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 16,430 | 16,429 | u577534987 | c |
p00019 | #include <stdio.h>
int main(void) {
int n;
int i;
int re = 1;
while (1) {
scanf("%d", &n);
if (1 <= n && n <= 20)
break;
}
for (i = 0; i < n; i++) {
re *= n - i;
}
printf("%ld\n", re);
return 0;
} | #include <stdio.h>
int main(void) {
int n;
int i;
long int re = 1;
while (1) {
scanf("%d", &n);
if (1 <= n && n <= 20)
break;
}
for (i = 0; i < n; i++) {
re *= n - i;
}
printf("%ld\n", re);
return 0;
} | [
"variable_declaration.type.widen.change"
] | 16,431 | 16,429 | u577534987 | c |
p00019 | #include <stdio.h>
int main(void) {
int n;
int i;
int re = 1;
while (1) {
scanf("%ld", &n);
if (1 <= n && n <= 20)
break;
}
for (i = 0; i < n; i++) {
re *= n - i;
}
printf("%ld\n", re);
return 0;
} | #include <stdio.h>
int main(void) {
int n;
int i;
long int re = 1;
while (1) {
scanf("%d", &n);
if (1 <= n && n <= 20)
break;
}
for (i = 0; i < n; i++) {
re *= n - i;
}
printf("%ld\n", re);
return 0;
} | [
"variable_declaration.type.widen.change",
"literal.string.change",
"call.arguments.change"
] | 16,432 | 16,429 | u577534987 | c |
p00019 | #include <stdio.h>
int main(void) {
int i;
long long int k = 1;
int j;
scanf("%d", &i);
j = i;
while (i > 0) {
k *= i;
i--;
}
printf("%d\n", k);
return (0);
} | #include <stdio.h>
int main(void) {
int i;
long long int k = 1;
int j;
scanf("%d", &i);
j = i;
while (i > 0) {
k *= i;
i--;
}
printf("%lld\n", k);
return (0);
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 16,439 | 16,440 | u145151732 | c |
p00019 | #include <stdio.h>
int main(void) {
int i;
unsigned long long int k = 1;
int j;
scanf("%d", &i);
j = i;
while (i > 0) {
k *= i;
i--;
}
printf("%d\n", k);
return (0);
} | #include <stdio.h>
int main(void) {
int i;
long long int k = 1;
int j;
scanf("%d", &i);
j = i;
while (i > 0) {
k *= i;
i--;
}
printf("%lld\n", k);
return (0);
} | [
"variable_declaration.type.narrow.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 16,441 | 16,440 | u145151732 | c |
p00020 | main(c) {
for (; ~scanf("%c", &c); printf("%c", c - (c > 96) * 32))
exit(0);
} | main(c) {
for (; ~scanf("%c", &c); printf("%c", c - (c > 96) * 32))
;
exit(0);
} | [] | 17,879 | 17,880 | u911041619 | c |
p00021 | #include <stdio.h>
int main(void) {
int i, n;
float ax, ay, bx, by, cx, cy, dx, dy, ab, cd;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%f %f %f %f %f %f %f %f", &ax, &ay, &bx, &by, &cx, &cy, &dx, &dy);
ab = (by - ay) / (bx - ax);
cd = (dy - cy) / (dx - cy);
if (ab == cd) {
printf("Y... | #include <stdio.h>
int main(void) {
int i, n;
float ax, ay, bx, by, cx, cy, dx, dy, ab, cd;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%f %f %f %f %f %f %f %f", &ax, &ay, &bx, &by, &cx, &cy, &dx, &dy);
ab = (by - ay) / (bx - ax);
cd = (dy - cy) / (dx - cx);
if (ab == cd) {
printf("Y... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 18,066 | 18,064 | u993045812 | c |
p00024 | #include <stdio.h>
int main() {
double n, t, v, y;
while (scanf("%lf", &v) != EOF) {
t = v / 9.8;
y = 4.9 * t * t;
n = (y + 5) / 5;
printf("%.0lf\n", n);
}
return 0;
} | #include <stdio.h>
int main() {
double n, t, v, y;
while (scanf("%lf", &v) != EOF) {
t = v / 9.8;
y = 4.9 * t * t;
n = (y + 5) / 5;
printf("%.0lf\n", n + .5);
}
return 0;
} | [
"expression.operation.binary.add"
] | 19,593 | 19,594 | u715881598 | c |
p00023 | #include <math.h>
#include <stdio.h>
double abso(double n) {
if (n < 0)
n *= (-1);
return n;
}
double dis(double xa, double ya, double xb, double yb) {
if (xa == xb) {
return abso(ya - yb);
} else {
return sqrt((xa - xb) * (xa - xb) + (ya - yb) * (ya - yb));
}
}
int main(void) {
int n, i;
d... | #include <math.h>
#include <stdio.h>
double abso(double n) {
if (n < 0)
n *= (-1);
return n;
}
double dis(double xa, double ya, double xb, double yb) {
if (xa == xb) {
return abso(ya - yb);
} else {
return sqrt((xa - xb) * (xa - xb) + (ya - yb) * (ya - yb));
}
}
int main(void) {
int n, i;
d... | [
"expression.unary.arithmetic.remove",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 20,155 | 20,156 | u221679506 | c |
p00027 | m, s[] = {0, 31, 60, 91, 121, 152, 182, 213, 244, 274, 305, 335};
main(d) {
char a[7][9] = {"Thurs", "Fri", "Satur", "Sun", "Mon", "Tues", "Wednes"};
while (1) {
scanf("%d%d", &m, &d);
if (!m)
exit(0);
d += s[m - 1];
printf("%sday\n", &a[(!d % 7) ? 6 : (d % 7 - 1)][0]);
}
} | m, s[] = {0, 31, 60, 91, 121, 152, 182, 213, 244, 274, 305, 335};
main(d) {
char a[7][9] = {"Thurs", "Fri", "Satur", "Sun", "Mon", "Tues", "Wednes"};
while (1) {
scanf("%d%d", &m, &d);
if (!m)
exit(0);
d += s[m - 1];
printf("%sday\n", &a[(d % 7 == 0) ? 6 : (d % 7 - 1)][0]);
}
} | [
"expression.operation.unary.logical.remove",
"control_flow.loop.condition.change"
] | 20,493 | 20,494 | u752673456 | c |
p00028 | #include <stdio.h>
int num[101] = {0};
int data = 0;
int max = 0;
int i = 0;
int main(void) {
while ((scanf("%d", &data)) != EOF) {
num[data]++;
if (max < num[data])
max = num[data];
}
for (i = 1; i <= 100; i++) {
if (num[i] == max)
printf("\n%d\n", i);
}
return 0;
} | #include <stdio.h>
int num[100] = {0};
int data = 0;
int max = 0;
int i = 0;
int main(void) {
while ((scanf("%d", &data)) != EOF) {
num[data]++;
if (max < num[data])
max = num[data];
}
for (i = 0; i < 100; i++) {
if (num[i] == max)
printf("%d\n", i);
}
return 0;
} | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"literal.stri... | 21,110 | 21,111 | u341775210 | c |
p00032 | #include <stdio.h>
main() {
int a, b, c, m = 0, n = 0;
while (scanf("%d,%d,%d", &a, &b, &c) != EOF) {
if (a != b && (a < c || b < c) && (a + b) > c && (a * a + b * b) == c * c)
n++;
else if (a == b && a < c && (a + b) > c)
m++;
}
printf("%d\n%d\n", n, m);
return 0;
} | #include <stdio.h>
main() {
int a, b, c, m = 0, n = 0;
while (scanf("%d,%d,%d", &a, &b, &c) != EOF) {
if (a != b && (a < c || b < c) && (a + b) > c && (a * a + b * b) == c * c)
n++;
else if (a == b && (a + b) > c)
m++;
}
printf("%d\n%d\n", n, m);
return 0;
} | [
"expression.operation.binary.remove"
] | 22,497 | 22,496 | u915493477 | c |
p00033 | #include <stdio.h>
int main(void) {
int n, i;
int x;
int a, b;
int j;
int f;
scanf("%d", &n);
for (i = 0; i < n; i++) {
f = 1;
for (j = 0; j < 10; j++) {
scanf("%d", &x);
if (x > a && x > b) {
if (a > b) {
a = x;
} else {
b = x;
}
} e... | #include <stdio.h>
int main(void) {
int n, i;
int x;
int a, b;
int j;
int f;
scanf("%d", &n);
for (i = 0; i < n; i++) {
a = b = 0;
f = 1;
for (j = 0; j < 10; j++) {
scanf("%d", &x);
if (x > a && x > b) {
if (a > b) {
a = x;
} else {
b = x;
... | [
"assignment.add"
] | 22,759 | 22,760 | u664090703 | c |
p00038 | #include <stdio.h>
#define P 5
int main(void) {
int card[P] = {0, 0, 0, 0, 0};
int i = 0;
int j = 0;
int k = 0;
int m = 0;
int count = 0;
int t = 0;
int c[P] = {0, 0, 0, 0, 0};
while (scanf("%d,%d,%d,%d,%d", &card[0], &card[1], &card[2], &card[3],
&card[4]) != EOF) {
for (i = 0; ... | #include <stdio.h>
#define P 5
int main(void) {
int card[P] = {0, 0, 0, 0, 0};
int i = 0;
int j = 0;
int k = 0;
int m = 0;
int count = 0;
int t = 0;
int c[P] = {0, 0, 0, 0, 0};
while (scanf("%d,%d,%d,%d,%d", &card[0], &card[1], &card[2], &card[3],
&card[4]) != EOF) {
for (i = 0; ... | [
"assignment.variable.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"control_flow.branch.if.condition.change",
"variable_access.subscript.index.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 24,211 | 24,212 | u832413980 | c |
p00044 | #include <stdio.h>
int prime[1000000] = {0};
int main() {
int i, j, k, flag;
while (scanf("%d", &i) != EOF) {
flag = 0;
for (j = 2; j <= i + 100; j++) {
for (k = 2; k * j <= i; k++) {
prime[j * k] = 1;
}
}
for (j = i * 2; j > 1; j--) {
if (j < i && prime[j] == 0) {
... | #include <stdio.h>
int prime[1000000] = {0};
int main() {
int i, j, k, flag;
while (scanf("%d", &i) != EOF) {
flag = 0;
for (j = 2; j <= i; j++) {
for (k = 2; k * j < 55000; k++) {
prime[j * k] = 1;
}
}
for (j = i * 2; j > 1; j--) {
if (j < i && prime[j] == 0) {
pri... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 24,240 | 24,241 | u284889485 | c |
p00044 | #include <stdio.h>
int prime[1000000] = {0};
int main() {
int i, j, k, flag;
while (scanf("%d", &i) != EOF) {
flag = 0;
for (j = 2; j <= i + 1000; j++) {
for (k = 2; k * j <= i; k++) {
prime[j * k] = 1;
}
}
for (j = i * 2; j > 1; j--) {
if (j < i && prime[j] == 0) {
... | #include <stdio.h>
int prime[1000000] = {0};
int main() {
int i, j, k, flag;
while (scanf("%d", &i) != EOF) {
flag = 0;
for (j = 2; j <= i; j++) {
for (k = 2; k * j < 55000; k++) {
prime[j * k] = 1;
}
}
for (j = i * 2; j > 1; j--) {
if (j < i && prime[j] == 0) {
pri... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 24,242 | 24,241 | u284889485 | c |
p00042 | #include <stdio.h>
#define max(a, b) (a) > (b) ? (a) : (b);
main() {
int N, W;
int v[100], w[100];
int dp[2][1001] = {
{
0,
},
};
int i, j;
int maxv, minw;
int c = 1;
while (scanf("%d", &W) != EOF) {
if (!W)
break;
for (i = 0; i <= W; i++)
dp[0][i] = 0;
sc... | #include <stdio.h>
#define max(a, b) (a) > (b) ? (a) : (b);
main() {
int N, W;
int v[1000], w[1000];
int dp[2][1001] = {
{
0,
},
};
int i, j;
int maxv, minw;
int c = 1;
while (scanf("%d", &W) != EOF) {
if (!W)
break;
for (i = 0; i <= W; i++)
dp[0][i] = 0;
... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 24,676 | 24,677 | u716291760 | c |
p00042 | #include <stdio.h>
#define max(a, b) (a) > (b) ? (a) : (b);
main() {
int N, W;
int v[1000], w[1000];
int dp[2][1001] = {
{
0,
},
};
int i, j;
int maxv, minw;
int c = 1;
while (scanf("%d", &W) != EOF) {
if (!W)
break;
for (i = 0; i <= W; i++)
dp[0][i] = 0;
... | #include <stdio.h>
#define max(a, b) (a) > (b) ? (a) : (b);
main() {
int N, W;
int v[1000], w[1000];
int dp[2][1001] = {
{
0,
},
};
int i, j;
int maxv, minw;
int c = 1;
while (scanf("%d", &W) != EOF) {
if (!W)
break;
for (i = 0; i <= W; i++)
dp[0][i] = 0;
... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 24,678 | 24,677 | u716291760 | c |
p00047 | #include <stdio.h>
int main() {
char a, b, c = 'A';
while (scanf("%c,%c", &a, &b) != EOF) {
c = c == a ? b : c == b ? b : c;
}
printf("%c\n", c);
return 0;
} | #include <stdio.h>
int main() {
char a, b, c = 'A';
while (scanf("%c,%c", &a, &b) != EOF) {
c = c == a ? b : c == b ? a : c;
}
printf("%c\n", c);
return 0;
} | [
"identifier.change"
] | 25,428 | 25,429 | u709185111 | c |
p00053 | #include <stdio.h>
int prime[10000], ptr = 0;
void prime_number(void) {
int i, j, flag;
prime[ptr++] = 2;
prime[ptr++] = 3;
for (i = 5; i <= 1119; i += 2) {
flag = 0;
for (j = 1; prime[j] * prime[j] <= i; j++) {
if (i % prime[j] == 0) {
flag = 1;
break;
}
}
if (!flag)... | #include <stdio.h>
int prime[11111], ptr = 0;
void prime_number(void) {
int i, j, flag;
prime[ptr++] = 2;
prime[ptr++] = 3;
for (i = 5; ptr <= 10474; i += 2) {
flag = 0;
for (j = 1; prime[j] * prime[j] <= i; j++) {
if (i % prime[j] == 0) {
flag = 1;
break;
}
}
if (!fl... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 26,547 | 26,548 | u988309310 | c |
p00078 | #include <stdio.h>
int b[15][15];
void reset() {
int i, j;
for (i = 0; i < 15; i++) {
for (j = 0; j < 15; j++) {
b[i][j] = 0;
}
}
}
void magic_square(int x, int y, int n, int c) {
if (c == n * n)
return;
if (b[x][y] == 0) {
b[x][y] = ++c;
if (++x == n)
x = 0;
if (++y == ... | #include <stdio.h>
int b[15][15];
void reset() {
int i, j;
for (i = 0; i < 15; i++) {
for (j = 0; j < 15; j++) {
b[i][j] = 0;
}
}
}
void magic_square(int x, int y, int n, int c) {
if (c == n * n)
return;
if (b[x][y] == 0) {
b[x][y] = ++c;
if (++x == n)
x = 0;
if (++y == ... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 30,308 | 30,307 | u221679506 | c |
p00078 | #include <stdio.h>
int b[15][15];
void reset() {
int i, j;
for (i = 0; i < 15; i++) {
for (j = 0; j < 15; j++) {
b[i][j] = 0;
}
}
}
void magic_square(int x, int y, int n, int c) {
if (c == n * n)
return;
if (b[x][y] == 0) {
b[x][y] = ++c;
if (++x == n)
x = 0;
if (++y == ... | #include <stdio.h>
int b[15][15];
void reset() {
int i, j;
for (i = 0; i < 15; i++) {
for (j = 0; j < 15; j++) {
b[i][j] = 0;
}
}
}
void magic_square(int x, int y, int n, int c) {
if (c == n * n)
return;
if (b[x][y] == 0) {
b[x][y] = ++c;
if (++x == n)
x = 0;
if (++y == ... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 30,313 | 30,307 | u221679506 | c |
p00083 | #include <math.h>
#include <stdio.h>
int main(void) {
int y, m, d, D;
while (scanf("%d %d %d", &y, &m, &d) != EOF) {
D = 10000 * y + m * 100 + d;
/*printf("D%d", D);*/
if (D < 18680908)
printf("pre-meiji\n");
else if (18680908 <= D && D <= 19120729)
printf("meiji %d %d d\n", y - 1867, m,... | #include <math.h>
#include <stdio.h>
int main(void) {
int y, m, d, D;
while (scanf("%d %d %d", &y, &m, &d) != EOF) {
D = 10000 * y + m * 100 + d;
/*printf("D%d", D);*/
if (D < 18680908)
printf("pre-meiji\n");
else if (18680908 <= D && D <= 19120729)
printf("meiji %d %d %d\n", y - 1867, m... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 30,936 | 30,937 | u328199937 | c |
p00083 | #include <math.h>
#include <stdio.h>
int main(void) {
int y, m, d, D;
while (scanf("%d %d %d", &y, &m, &d) != EOF) {
D = 10000 * y + m * 100 + d;
/*printf("D%d", D);*/
if (D < 18680908)
printf("pre-meiji\n");
else if (18680908 <= D && D <= 19120729)
printf("meiji %d %d\n", y - 1867, m, d... | #include <math.h>
#include <stdio.h>
int main(void) {
int y, m, d, D;
while (scanf("%d %d %d", &y, &m, &d) != EOF) {
D = 10000 * y + m * 100 + d;
/*printf("D%d", D);*/
if (D < 18680908)
printf("pre-meiji\n");
else if (18680908 <= D && D <= 19120729)
printf("meiji %d %d %d\n", y - 1867, m... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 30,938 | 30,937 | u328199937 | c |
p00100 | #include <stdio.h>
int main(void) {
long long int a[4000] = {0}, b[4000], c[4000];
int date, to, i, j, cou[4000] = {0};
while (1) {
scanf("%d", &date);
if (date == 0)
break;
for (i = 0; i < date; i++) {
scanf("%d %lld %lld", &a[i], &b[i], &c[i]);
cou[i] = b[i] * c[i];
for (j =... | #include <stdio.h>
int main(void) {
long long int cou[4000] = {0}, b[4000], c[4000];
int date, to, i, j, a[4000] = {0};
while (1) {
scanf("%d", &date);
if (date == 0)
break;
for (i = 0; i < date; i++) {
scanf("%d %lld %lld", &a[i], &b[i], &c[i]);
cou[i] = b[i] * c[i];
for (j = ... | [
"identifier.change",
"variable_declaration.array_dimensions.change",
"control_flow.branch.if.condition.change"
] | 32,937 | 32,938 | u645134403 | c |
p00102 | #include <stdio.h>
int main(int argc, char **argv) {
int dataset, i, j;
int data[11][11];
scanf("%d", &dataset);
while (dataset != 0) {
for (i = 0; i <= dataset; i++)
for (j = 0; j <= dataset; j++)
data[i][j] = 0;
for (i = 0; i < dataset; i++) {
for (j = 0; j < dataset; j++) {
... | #include <stdio.h>
int main(int argc, char **argv) {
int dataset, i, j;
int data[11][11];
scanf("%d", &dataset);
while (dataset != 0) {
for (i = 0; i <= dataset; i++)
for (j = 0; j <= dataset; j++)
data[i][j] = 0;
for (i = 0; i < dataset; i++) {
for (j = 0; j < dataset; j++) {
... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 34,046 | 34,044 | u574548096 | c |
p00118 | #include <stdio.h>
int bfs(int h, int w, char farm[][102], int vector[][2]);
int main(void) {
int i, j, k;
int H, W;
char farm[102][102];
int vector[4][2] = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};
int ans = 0;
while (scanf("%d %d\n", &H, &W) != EOF) {
if (H == 0 && W == 0) {
break;
}
for (i ... | #include <stdio.h>
int bfs(int h, int w, char farm[][102], int vector[][2]);
int main(void) {
int i, j, k;
int H, W;
char farm[102][102];
int vector[4][2] = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};
int ans = 0;
while (scanf("%d %d\n", &H, &W) != EOF) {
if (H == 0 && W == 0) {
break;
}
for (i ... | [
"literal.number.change",
"assignment.value.change"
] | 36,282 | 36,283 | u069649871 | c |
p00135 | #include <stdio.h>
int main() {
int i;
long long n = 0;
int d, e = 0;
double a, b, c = 0;
scanf("%lld", &n);
for (i = 0; i < n; i++) {
scanf("%d:%d", &d, &e);
a = (double)d * 30 + (double)e * 0.5;
b = (double)e * 6;
if ((b - a) >= 0 && 180 >= (b - a)) {
c = b - a;
} else if ((a - ... | #include <stdio.h>
int main() {
int i;
long long n = 0;
int d, e = 0;
double a, b, c = 0;
scanf("%lld", &n);
for (i = 0; i < n; i++) {
scanf("%d:%d", &d, &e);
a = (double)d * 30 + (double)e * 0.5;
b = (double)e * 6;
if ((b - a) >= 0 && 180 >= (b - a)) {
c = b - a;
} else if ((a - ... | [
"control_flow.branch.if.condition.change",
"assignment.variable.change",
"identifier.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 37,983 | 37,984 | u292263436 | c |
p00135 | #include <stdio.h>
int main() {
int i;
long long n = 0;
int d, e = 0;
double a, b, c = 0;
scanf("%lld", &n);
for (i = 0; i < n; i++) {
scanf("%d:%d", &d, &e);
a = (double)d * 30 + (double)e * 0.5;
b = (double)e * 6;
if ((b - a) >= 0 && 180 >= (b - a)) {
c = b - a;
} else if ((a - ... | #include <stdio.h>
int main() {
int i;
long long n = 0;
int d, e = 0;
double a, b, c = 0;
scanf("%lld", &n);
for (i = 0; i < n; i++) {
scanf("%d:%d", &d, &e);
a = (double)d * 30 + (double)e * 0.5;
b = (double)e * 6;
if ((b - a) >= 0 && 180 >= (b - a)) {
c = b - a;
} else if ((a - ... | [
"control_flow.branch.if.condition.change",
"assignment.variable.change",
"identifier.change"
] | 37,985 | 37,984 | u292263436 | c |
p00135 | #include <stdio.h>
int main() {
int i;
long long n = 0;
int d, e = 0;
double a, b, c = 0;
scanf("%lld", &n);
for (i = 0; i < n; i++) {
scanf("%d:%d", &d, &e);
a = (double)d * 30 + (double)e * 0.5;
b = (double)e * 6;
if ((b - a) >= 0 && 180 >= (b - a)) {
c = b - a;
} else if ((a - ... | #include <stdio.h>
int main() {
int i;
long long n = 0;
int d, e = 0;
double a, b, c = 0;
scanf("%lld", &n);
for (i = 0; i < n; i++) {
scanf("%d:%d", &d, &e);
a = (double)d * 30 + (double)e * 0.5;
b = (double)e * 6;
if ((b - a) >= 0 && 180 >= (b - a)) {
c = b - a;
} else if ((a - ... | [
"assignment.variable.change",
"identifier.change"
] | 37,986 | 37,984 | u292263436 | c |
p00167 | #include <stdio.h>
int main() {
int dataset[100];
int length = 0;
int i, j, count, tmp;
while (scanf("%d", &length) && length) {
for (i = 0; i < length; i++)
scanf("%d", &dataset[i]);
count = 0;
for (i = length - 1; i >= 0; i--) {
for (j = 0; j < i; j++) {
if (dataset[j] > da... | #include <stdio.h>
int main() {
int dataset[100];
int length = 0;
int i, j, count, tmp;
while (scanf("%d", &length) && length) {
for (i = 0; i < length; i++)
scanf("%d", &dataset[i]);
count = 0;
for (i = length - 1; i >= 0; i--) {
for (j = 0; j < i; j++) {
if (dataset[j] > da... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 39,740 | 39,741 | u136068971 | c |
p00228 | #include <stdio.h>
void out(int s) {
int i;
for (i = 6; i >= 0; i--) {
printf("%d", s >> i & 1);
}
printf("\n");
}
int main() {
int p[10] = {077, 06, 0133, 0117, 0146, 0155, 0175, 0147, 0177, 0157};
int n, s, a;
while (scanf("%d", &n) == 1 && n != -1) {
s = 0;
while (n--) {
scanf("%d", ... | #include <stdio.h>
void out(int s) {
int i;
for (i = 6; i >= 0; i--) {
printf("%d", s >> i & 1);
}
printf("\n");
}
int main() {
int p[10] = {077, 06, 0133, 0117, 0146, 0155, 0175, 047, 0177, 0157};
int n, s, a;
while (scanf("%d", &n) == 1 && n != -1) {
s = 0;
while (n--) {
scanf("%d", &... | [
"literal.number.change"
] | 43,317 | 43,318 | u393475075 | c |
p00252 | #include <stdio.h>
int main() {
int a, b, c;
scanf("%d%d%d", a, b, c);
if (a == 1 && b == 1 && c == 0 || c == 1) {
printf("Open\n");
} else
printf("Close\n");
return 0;
} | #include <stdio.h>
int main() {
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
if (a == 1 && b == 1 && c == 0 || c == 1) {
printf("Open\n");
} else
printf("Close\n");
return 0;
} | [
"expression.operation.unary.reference.add"
] | 44,361 | 44,362 | u607795294 | c |
p00238 | #include <stdio.h>
int main(void) {
int t;
int n;
while (scanf("%d", &t), t != 0) {
scanf("%d", &n);
while (n-- > 0) {
int s, f;
scanf("%d %d", &s, &f);
t -= f - s;
}
if (t == 0) {
puts("OK");
} else {
printf("%d\n", t);
}
}
return 0;
} | #include <stdio.h>
int main(void) {
int t;
int n;
while (scanf("%d", &t), t != 0) {
scanf("%d", &n);
while (n-- > 0) {
int s, f;
scanf("%d %d", &s, &f);
t -= f - s;
}
if (t <= 0) {
puts("OK");
} else {
printf("%d\n", t);
}
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 45,073 | 45,074 | u376883550 | c |
p00290 | #include <stdio.h>
int main() {
int d, c;
scanf("%d %d", &d, &c);
c = 2 * d;
printf("%d\n", c);
return 0;
} | #include <stdio.h>
int main() {
int d, c, b;
scanf("%d %d", &d, &c);
b = c * d;
printf("%d\n", b);
return 0;
} | [
"variable_declaration.add",
"assignment.variable.change",
"identifier.change",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change",
"call.arguments.change",
"io.output.change"
] | 46,504 | 46,505 | u326110023 | c |
p00311 | #include <stdio.h>
int main(void) {
int a, b, c, d, e, f, g, h, i, j, k;
scanf("%d %d", &a, &b);
scanf("%d %d", &c, &d);
scanf("%d %d %d %d", &e, &f, &g, &h);
i = a * e + b * f;
j = c * e + d * f;
if (a >= 10) {
k = a / 10;
i = i + k * g;
}
if (c >= 10) {
k = c / 10;
j = j + k * g;
}... | #include <stdio.h>
int main(void) {
int a, b, c, d, e, f, g, h, i, j, k;
scanf("%d %d", &a, &b);
scanf("%d %d", &c, &d);
scanf("%d %d %d %d", &e, &f, &g, &h);
i = a * e + b * f;
j = c * e + d * f;
if (a >= 10) {
k = a / 10;
i = i + k * g;
}
if (c >= 10) {
k = c / 10;
j = j + k * g;
}... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 47,181 | 47,182 | u499174489 | c |
p00425 | #include <stdio.h>
#include <string.h>
int main(void) {
int a, i, j, dice[6], ans, box;
char muki[6];
for (;;) {
scanf("%d", &a);
if (a == 0)
break;
int dice[6] = {1, 2, 6, 5, 3, 4};
ans = 1;
for (i = 0; i < a; i++) {
scanf("%s", muki);
if (!strcmp(muki, "North")) {
b... | #include <stdio.h>
#include <string.h>
int main(void) {
int a, i, j, dice[6], ans, box;
char muki[6];
for (;;) {
scanf("%d", &a);
if (a == 0)
break;
int dice[6] = {1, 2, 6, 5, 3, 4};
ans = 1;
for (i = 0; i < a; i++) {
scanf("%s", muki);
if (!strcmp(muki, "North")) {
b... | [] | 50,197 | 50,198 | u810660681 | c |
p00434 | #include <stdio.h>
int main() {
int sei[31] = {0}, i, a;
for (i = 1; i < 29; i++) {
scanf("%d", &a);
sei[a] = 1;
}
for (i = 1; i < 29; i++) {
if (sei[i] == 0)
printf("%d ", i);
}
return 0;
} | #include <stdio.h>
int main() {
int sei[31] = {0}, i, a;
for (i = 1; i < 29; i++) {
scanf("%d", &a);
sei[a] = 1;
}
for (i = 1; i < 31; i++) {
if (sei[i] == 0)
printf("%d\n", i);
}
return 0;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 50,338 | 50,337 | u485225329 | c |
p00435 | #include <stdio.h>
int main() {
char c;
while (scanf("%c", &c) != EOF) {
if (c != '\n') {
printf("%c", (c - 'A' + 24) % 26 + 'A');
}
}
printf("\n");
return 0;
} | #include <stdio.h>
int main() {
char c;
while (scanf("%c", &c) != EOF) {
if (c != '\n') {
printf("%c", (c - 'A' + 23) % 26 + 'A');
}
}
printf("\n");
return 0;
} | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 50,400 | 50,399 | u881100444 | c |
p00445 | #include <stdio.h>
int main(void) {
int i;
int counti, countj;
char a[10000];
while (scanf("%s", a) != EOF) {
counti = 0;
countj = 0;
for (i = 0; a[i] != '\0'; i++) {
if (a[i + 1] == 'O' && a[i + 2] == 'I') {
if (a[i] == 'I')
counti++;
if (a[i] == 'J')
coun... | #include <stdio.h>
int main(void) {
int i;
int counti, countj;
char a[10000];
while (scanf("%s", a) != EOF) {
counti = 0;
countj = 0;
for (i = 0; a[i] != '\0'; i++) {
if (a[i + 1] == 'O' && a[i + 2] == 'I') {
if (a[i] == 'I')
counti++;
if (a[i] == 'J')
coun... | [
"call.arguments.change",
"call.arguments.add"
] | 51,924 | 51,925 | u221679506 | c |
p00478 | #include <stdio.h>
#include <string.h>
int main() {
int n, i, j, k, res = 0;
char search[20], ring[20];
scanf("%s", search);
scanf("%d\n", &n);
res = n;
for (i = 0; i < n; i++) {
scanf("%s", ring);
int found = 0;
for (j = 0; j < 10 && found == 0; j++) {
found = 1;
for (k = 0; k < str... | #include <stdio.h>
#include <string.h>
int main() {
int n, i, j, k, res = 0;
char search[20], ring[20];
scanf("%s", search);
scanf("%d\n", &n);
res = 0;
for (i = 0; i < n; i++) {
scanf("%s", ring);
int found = 0;
for (j = 0; j < 10 && found == 0; j++) {
found = 1;
for (k = 0; k < str... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 54,604 | 54,605 | u611853667 | c |
p00478 | #include <stdio.h>
#include <string.h>
int main() {
int n, i, j, k, res = 0;
char search[20], ring[20];
scanf("%s", search);
scanf("%d\n", &n);
res = n;
for (i = 0; i < n; i++) {
scanf("%s", ring);
int found = 0;
for (j = 0; j < 10 && found == 0; j++) {
found = 1;
for (k = 0; k < str... | #include <stdio.h>
#include <string.h>
int main() {
int n, i, j, k, res = 0;
char search[20], ring[20];
scanf("%s", search);
scanf("%d\n", &n);
res = 0;
for (i = 0; i < n; i++) {
scanf("%s", ring);
int found = 0;
for (j = 0; j < 10 && found == 0; j++) {
found = 1;
for (k = 0; k < str... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 54,606 | 54,605 | u611853667 | c |
p00517 | #include <stdio.h>
int main(void) {
int w, h, n;
int X[1000], Y[1000];
int i, j, k;
int ans, min, difx, dify;
scanf("%d%d%d", &w, &h, &n);
scanf("%d%d", &X[0], &Y[0]);
ans = 0;
for (i = 1; i < n; i++) {
scanf("%d%d", &X[i], &Y[i]);
if (X[i] - X[i - 1] > 0 && Y[i] - Y[i - 1] > 0) {
difx =... | #include <stdio.h>
int main(void) {
int w, h, n;
int X[1000], Y[1000];
int i, j, k;
int ans, min, difx, dify;
scanf("%d%d%d", &w, &h, &n);
scanf("%d%d", &X[0], &Y[0]);
ans = 0;
for (i = 1; i < n; i++) {
scanf("%d%d", &X[i], &Y[i]);
if (X[i] - X[i - 1] > 0 && Y[i] - Y[i - 1] > 0) {
difx =... | [] | 58,448 | 58,449 | u039368768 | c |
p00605 | #include <stdio.h>
short rml[100];
int d, g, n, k, i, j, s[100];
int main(void) {
while (scanf("%d%d", &n, &k), (n == k && k == 0)) {
for (i = 0; i < k; i++)
scanf("%d", s + i);
for (i = 0; i < n * k; i++) {
scanf("%d", &g);
s[i % k] -= g;
if (s[i % k] < 0)
rml[d] = 1;
}
... | #include <stdio.h>
short rml[100];
int d, g, n, k, i, j, s[100];
int main(void) {
while (scanf("%d%d", &n, &k), (n != k || k)) {
for (i = 0; i < k; i++)
scanf("%d", s + i);
for (i = 0; i < n * k; i++) {
scanf("%d", &g);
s[i % k] -= g;
if (s[i % k] < 0)
rml[d] = 1;
}
d++... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"expression.operation.binary.remove",
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.loop.for.condition.change",
"call.arguments.change",
"io.output.change"
] | 61,596 | 61,597 | u612181412 | c |
p00605 | #include <stdio.h>
short rml[100];
int d, g, n, k, i, j, s[100];
int main(void) {
while (scanf("%d%d", &n, &k), (n == k && k == 0)) {
for (i = 0; i < k; i++)
scanf("%d", s + i);
for (i = 0; i < n * k; i++) {
scanf("%d", &g);
s[i % k] -= g;
if (s[i % k] < 0)
rml[d] = 1;
}
... | #include <stdio.h>
short rml[100];
int d, g, n, k, i, j, s[100];
int main(void) {
while (scanf("%d%d", &n, &k), (n != k || k)) {
for (i = 0; i < k; i++)
scanf("%d", s + i);
for (i = 0; i < n * k; i++) {
scanf("%d", &g);
s[i % k] -= g;
if (s[i % k] < 0)
rml[d] = 1;
}
d++... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"expression.operation.binary.remove"
] | 61,598 | 61,597 | u612181412 | c |
p00741 | #include <stdio.h>
int h, w;
int G[50][50];
void visit(int i, int j) {
int di[8] = {0, -1, -1, -1, 0, 1, 1, 1};
int dj[8] = {1, 1, 0, -1, -1, -1, 0, 1};
int r;
int ni, nj;
G[i][j] = 0;
for (r = 0; r < 8; r++) {
ni = i + di[r];
nj = j + dj[r];
if (-1 < ni && ni < w && -1 < nj && nj < h && G[... | #include <stdio.h>
int h, w;
int G[50][50];
void visit(int i, int j) {
int di[8] = {0, -1, -1, -1, 0, 1, 1, 1};
int dj[8] = {1, 1, 0, -1, -1, -1, 0, 1};
int r;
int ni, nj;
G[i][j] = 0;
for (r = 0; r < 8; r++) {
ni = i + di[r];
nj = j + dj[r];
if (-1 < ni && ni < h && -1 < nj && nj < w && G[... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.condition.change"
] | 67,351 | 67,352 | u622083648 | c |
p00753 | #include <stdio.h>
int main() {
int n, i, j, l, d, c;
while (1) {
c = 0;
scanf("%d", &n);
if (n == 0)
break;
if (n == 1)
printf("1\n");
else {
for (i = n + 1; i <= n * 2; i++) {
d = 0;
for (j = 2; j * j < i; j++) {
if (i % j == 0) {
d++;
... | #include <stdio.h>
int main() {
int n, i, j, l, d, c;
while (1) {
c = 0;
scanf("%d", &n);
if (n == 0)
break;
if (n == 1)
printf("1\n");
else {
for (i = n + 1; i <= n * 2; i++) {
d = 0;
for (j = 2; j * j <= i; j++) {
if (i % j == 0) {
d++;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 69,773 | 69,774 | u962041986 | c |
p01101 | #include <stdio.h>
#include <stdlib.h>
int main() {
long n, m;
long max;
long sum;
long i, j;
long *list;
while (1) {
scanf("%ld %ld", &n, &m);
if ((n == 0) && (m == 0)) {
break;
}
list = (int *)malloc(sizeof(long) * n);
for (i = 0; i < n; i++) {
scanf("%ld", (list + i));
... | #include <stdio.h>
#include <stdlib.h>
int main() {
long n, m;
long max;
long sum;
long i, j;
long *list;
while (1) {
scanf("%ld %ld", &n, &m);
if ((n == 0) && (m == 0)) {
break;
}
list = (long *)malloc(sizeof(long) * n);
for (i = 0; i < n; i++) {
scanf("%ld", (list + i));
... | [
"assignment.value.change",
"variable_declaration.type.primitive.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 74,147 | 74,148 | u158367088 | c |
p01101 | #include <stdio.h>
#include <stdlib.h>
int main() {
long n, m;
long max;
long sum;
long i, j;
long *list;
while (1) {
scanf("%ld %ld", &n, &m);
if ((n == 0) && (m == 0)) {
break;
}
list = (long *)malloc(sizeof(long) * n);
for (i = 0; i < n; i++) {
scanf("%ld", (list + i));
... | #include <stdio.h>
#include <stdlib.h>
int main() {
long n, m;
long max;
long sum;
long i, j;
long *list;
while (1) {
scanf("%ld %ld", &n, &m);
if ((n == 0) && (m == 0)) {
break;
}
list = (long *)malloc(sizeof(long) * n);
for (i = 0; i < n; i++) {
scanf("%ld", (list + i));
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 74,149 | 74,148 | u158367088 | c |
p01101 | #include <stdio.h>
#include <stdlib.h>
int main() {
long n, m;
long max;
long sum;
long i, j;
long *list;
while (1) {
scanf("%ld %ld", &n, &m);
if ((n == 0) && (m == 0)) {
break;
}
list = (long *)malloc(sizeof(long) * n);
for (i = 0; i < n; i++) {
scanf("%ld", (list + i));
... | #include <stdio.h>
#include <stdlib.h>
int main() {
long n, m;
long max;
long sum;
long i, j;
long *list;
while (1) {
scanf("%ld %ld", &n, &m);
if ((n == 0) && (m == 0)) {
break;
}
list = (long *)malloc(sizeof(long) * n);
for (i = 0; i < n; i++) {
scanf("%ld", (list + i));
... | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 74,150 | 74,148 | u158367088 | c |
p02233 | int fibonacci(int *, int);
int main() {
int f[44];
int n, i;
scanf("%d", &n);
for (i = 0; i < 44; i++)
f[i] = 0;
printf("%d\n", fibonacci(f, n));
return 0;
}
int fibonacci(int *f, int n) {
if (n == 0 || n == 1) {
return f[n] = 1;
} else if (f[n] != 0)
return f[n];
else
return f[n]... | int fibonacci(int *, int);
int main() {
int f[45];
int n, i;
scanf("%d", &n);
for (i = 0; i < 45; i++)
f[i] = 0;
printf("%d\n", fibonacci(f, n));
return 0;
}
int fibonacci(int *f, int n) {
if (n == 0 || n == 1) {
return f[n] = 1;
} else if (f[n] != 0)
return f[n];
else
return f[n]... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 92,074 | 92,075 | u676729079 | c |
p02233 | int fibonacci(int *, int);
int main() {
int f[45];
int n, i;
scanf("%d", &n);
for (i = 0; i < 44; i++)
f[i] = 0;
printf("%d\n", fibonacci(f, n));
return 0;
}
int fibonacci(int *f, int n) {
if (n == 0 || n == 1) {
return f[n] = 1;
} else if (f[n] != 0)
return f[n];
else
return f[n]... | int fibonacci(int *, int);
int main() {
int f[45];
int n, i;
scanf("%d", &n);
for (i = 0; i < 45; i++)
f[i] = 0;
printf("%d\n", fibonacci(f, n));
return 0;
}
int fibonacci(int *f, int n) {
if (n == 0 || n == 1) {
return f[n] = 1;
} else if (f[n] != 0)
return f[n];
else
return f[n]... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 92,076 | 92,075 | u676729079 | c |
p02235 | #include <stdio.h>
#include <string.h>
int LCS(const char X[], const char Y[]) {
int LCS[1001][1001];
int i, j;
int xl, yl;
int ans;
xl = strlen(X);
yl = strlen(Y);
for (i = 0; i <= xl; ++i) {
for (j = 0; j <= yl; ++j) {
if (i == 0 || j == 0)
LCS[i][j] = 0;
else {
if (X[... | #include <stdio.h>
#include <string.h>
int LCS(const char X[], const char Y[]) {
int LCS[1001][1001];
int i, j;
int xl, yl;
int ans;
xl = strlen(X);
yl = strlen(Y);
for (i = 0; i <= xl; ++i) {
for (j = 0; j <= yl; ++j) {
if (i == 0 || j == 0)
LCS[i][j] = 0;
else {
if (X[... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 92,938 | 92,939 | u560416405 | c |
p02234 | #include <stdio.h>
#include <stdlib.h>
#define INF 1000000
int n;
int *p;
int **m;
void mchain();
int main() {
int i;
scanf("%d", &n);
p = (int *)malloc((n + 1) * sizeof(int));
m = (int **)malloc((n + 1) * sizeof(int *));
for (i = 0; i < n; i++) {
scanf("%d%d", &p[i], &p[i + 1]);
}
for (i = 0;... | #include <stdio.h>
#include <stdlib.h>
#define INF 1000000
int n;
int *p;
int **m;
void mchain();
int main() {
int i;
scanf("%d", &n);
p = (int *)malloc((n + 1) * sizeof(int));
m = (int **)malloc((n + 1) * sizeof(int *));
for (i = 0; i < n; i++) {
scanf("%d%d", &p[i], &p[i + 1]);
}
for (i = 0;... | [
"call.arguments.change"
] | 92,971 | 92,970 | u817742274 | c |
p02234 | #include <stdio.h>
#include <stdlib.h>
#define INF 1000000
int n;
int *p;
int **m;
void mchain();
int main() {
int i;
scanf("%d", &n);
p = (int *)malloc((n + 1) * sizeof(int));
m = (int **)malloc((n + 1) * sizeof(int *));
for (i = 0; i < n; i++) {
scanf("%d%d", &p[i], &p[i + 1]);
}
for (i = 0;... | #include <stdio.h>
#include <stdlib.h>
#define INF 1000000
int n;
int *p;
int **m;
void mchain();
int main() {
int i;
scanf("%d", &n);
p = (int *)malloc((n + 1) * sizeof(int));
m = (int **)malloc((n + 1) * sizeof(int *));
for (i = 0; i < n; i++) {
scanf("%d%d", &p[i], &p[i + 1]);
}
for (i = 0;... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"literal.number.change"
] | 92,972 | 92,970 | u817742274 | c |
p02239 | #include <stdio.h>
#include <stdlib.h>
#define N 101
#define INF -1
int Q[N];
int head, tail;
int M[N][N] = {{}};
int d[N];
int n;
char color[N];
void enqueue(int key) {
Q[tail] = key;
if (tail == N - 1) {
tail = 0;
} else {
tail++;
}
}
int dequeue() {
int x;
x = Q[head];
if (head == N - 1) {
... | #include <stdio.h>
#include <stdlib.h>
#define N 101
#define INF -1
int Q[N];
int head, tail;
int M[N][N] = {{}};
int d[N];
int n;
char color[N];
void enqueue(int key) {
Q[tail] = key;
if (tail == N - 1) {
tail = 0;
} else {
tail++;
}
}
int dequeue() {
int x;
x = Q[head];
if (head == N - 1) {
... | [] | 94,705 | 94,706 | u973954852 | c |
p02255 | #include <stdio.h>
int main() {
int i, j, k, l, v, N;
int A[100];
scanf("%d", &N);
for (i = 0; i < N; i++)
scanf("%d", &A[i]);
for (i = 0; i < N; i++) {
printf("%d", A[i]);
if (i != N - 1)
printf(" ");
}
printf("\n");
for (i = 0; i < N; i++) {
v = A[i];
j = i - 1;
w... | #include <stdio.h>
int main() {
int i, j, k, l, v, N;
int A[100];
scanf("%d", &N);
for (i = 0; i < N; i++)
scanf("%d", &A[i]);
for (i = 0; i < N; i++) {
printf("%d", A[i]);
if (i != N - 1)
printf(" ");
}
printf("\n");
for (i = 1; i < N; i++) {
v = A[i];
j = i - 1;
w... | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 96,831 | 96,832 | u494451272 | c |
p02255 | #include <stdio.h>
void insersion(int *a, int n);
int main() {
int n;
scanf("%d", &n);
int i, a[n];
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
insersion(a, n);
return 0;
}
void insersion(int *a, int n) {
int i, j, v, k;
for (i = 1; i <= n - 1; i++) {
v = a[i];
j = i - 1;
while ... | #include <stdio.h>
void insersion(int *a, int n);
int main() {
int n;
scanf("%d", &n);
int i, a[n];
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
insersion(a, n);
return 0;
}
void insersion(int *a, int n) {
int i, j, v, k;
for (i = 0; i <= n - 1; i++) {
v = a[i];
j = i - 1;
while ... | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 96,859 | 96,860 | u731896389 | c |
p02255 | #include <stdio.h>
#define MAX 100
int main() {
int key, i, j, n, c;
int arry[MAX];
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &arry[i]);
for (i = 0; i < n - 1; i++)
printf("%d ", arry[i]);
printf("%d", arry[n - 1]);
printf("\n");
for (i = 1; i < n; i++) {
key = arry[i];
j ... | #include <stdio.h>
#define MAX 100
int main() {
int key, i, j, n, c;
int arry[MAX];
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &arry[i]);
for (i = 0; i < n - 1; i++)
printf("%d ", arry[i]);
printf("%d", arry[n - 1]);
printf("\n");
for (i = 1; i < n; i++) {
key = arry[i];
j ... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 96,919 | 96,920 | u302016810 | c |
p02255 |
#include <stdio.h>
static const int N = 1000;
void trace(int A[], int n) {
int i;
for (i = 1; i <= n; i++) {
if (i > 1)
printf(" ");
printf("%d", A[i]);
}
printf("\n");
}
int main() {
int n, i, j;
int A[N + 1];
scanf("%d", &n);
for (i = 1; i <= n; i++)
scanf("%d", &A[i]);
trace... |
#include <stdio.h>
static const int N = 1000;
void trace(int A[], int n) {
int i;
for (i = 1; i <= n; i++) {
if (i > 1)
printf(" ");
printf("%d", A[i]);
}
printf("\n");
}
int main() {
int n, i, j;
int A[N + 1];
scanf("%d", &n);
for (i = 1; i <= n; i++)
scanf("%d", &A[i]);
trace... | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change"
] | 97,467 | 97,468 | u373322772 | c |
p02255 |
#include <stdio.h>
static const int N = 1000;
void trace(int A[], int n) {
int i;
for (i = 1; i <= n; i++) {
if (i > 1)
printf(" ");
printf("%d", A[i]);
}
printf("\n");
}
int main() {
int n, i, j;
int A[N + 1];
scanf("%d", &n);
for (i = 1; i <= n; i++)
scanf("%d", &A[i]);
trace... |
#include <stdio.h>
static const int N = 1000;
void trace(int A[], int n) {
int i;
for (i = 1; i <= n; i++) {
if (i > 1)
printf(" ");
printf("%d", A[i]);
}
printf("\n");
}
int main() {
int n, i, j;
int A[N + 1];
scanf("%d", &n);
for (i = 1; i <= n; i++)
scanf("%d", &A[i]);
trace... | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 97,469 | 97,468 | u373322772 | c |
p02255 |
#include <stdio.h>
static const int N = 1000;
void trace(int A[], int n) {
int i;
for (i = 1; i <= n; i++) {
if (i > 1)
printf(" ");
printf("%d", A[i]);
}
printf("\n");
}
int main() {
int n, i, j;
int A[N + 1];
scanf("%d", &n);
for (i = 1; i <= n; i++)
scanf("%d", &A[i]);
trace... |
#include <stdio.h>
static const int N = 1000;
void trace(int A[], int n) {
int i;
for (i = 1; i <= n; i++) {
if (i > 1)
printf(" ");
printf("%d", A[i]);
}
printf("\n");
}
int main() {
int n, i, j;
int A[N + 1];
scanf("%d", &n);
for (i = 1; i <= n; i++)
scanf("%d", &A[i]);
trace... | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 97,470 | 97,468 | u373322772 | c |
p02255 | #include <stdio.h>
#define N 100
int main() {
int A[N] = {0};
int length, key;
int i = 0, j = 0;
scanf("%d", &length);
while (i < length) {
scanf("%d", &A[i]);
i++;
}
for (j = 0; j < length - 1; j++) {
printf("%d ", A[j]);
}
printf("%d\n", A[length - 1]);
for (i = 1; i < length - 1... | #include <stdio.h>
#define N 100
int main() {
int A[N] = {0};
int length, key;
int i = 0, j = 0;
scanf("%d", &length);
while (i < length) {
scanf("%d", &A[i]);
i++;
}
for (j = 0; j < length - 1; j++) {
printf("%d ", A[j]);
}
printf("%d\n", A[length - 1]);
for (i = 1; i < length; i+... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 97,640 | 97,641 | u406391617 | c |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.