buggy_code stringlengths 11 625k | fixed_code stringlengths 17 625k | bug_type stringlengths 2 4.45k | language int64 0 8 | token_count int64 5 200k | change_count int64 0 100 |
|---|---|---|---|---|---|
#include <stdio.h>
#define MAX 200000
int main(void) {
int R[MAX], n;
int i, j;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &R[i]);
}
int maxv = -200000000000;
int minv = R[0];
for (j = 1; j < n; j++) {
if (maxv < (R[j] - minv)) {
maxv = R[j] - minv;
}
if (minv > R[j]... | #include <stdio.h>
#define MAX 200000
int main(void) {
int R[MAX], n;
int i, j;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &R[i]);
}
int maxv = -2000000000;
int minv = R[0];
for (j = 1; j < n; j++) {
if (maxv < (R[j] - minv)) {
maxv = R[j] - minv;
}
if (minv > R[j]) ... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 0 | 146 | 2 |
#include <stdio.h>
#define N 200000
int main(void) {
int n, R[N];
int i, j, temp, max, min;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &R[i]);
max = R[n - 1] - R[n - 2];
min = R[n - 1];
for (i = n - 2; i > 0; i--) {
if (max < min - R[i])
max = min - R[i];
if (min < R[i])
... |
#include <stdio.h>
#define N 200000
int main(void) {
int n, R[N];
int i, j, temp, max, min;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &R[i]);
max = R[n - 1] - R[n - 2];
min = R[n - 1];
for (i = n - 2; i >= 0; i--) {
if (max < min - R[i])
max = min - R[i];
if (min < R[i])
... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 47], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 20]] | 0 | 158 | 2 |
#include <stdio.h>
#include <stdlib.h>
int main(void) {
int n, i, max, min;
int *R;
scanf("%d", &n);
R = (int *)malloc(sizeof(int) * n);
for (i = 0; i < n; i++)
scanf("%d", &R[i]);
max = -20000000000;
min = R[0];
for (i = 1; i < n; i++) {
if (max < R[i] - min)
max = R[i] - min;
if (... | #include <stdio.h>
#include <stdlib.h>
int main(void) {
int n, i, max, min;
int *R;
scanf("%d", &n);
R = (int *)malloc(sizeof(int) * n);
for (i = 0; i < n; i++)
scanf("%d", &R[i]);
max = -2000000000;
min = R[0];
for (i = 1; i < n; i++) {
if (max < R[i] - min)
max = R[i] - min;
if (m... | [["-", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13]] | 0 | 151 | 2 |
#include <stdio.h>
int main() {
int N, minv, maxv = 0, i, j;
scanf("%d", &N);
int R[N];
for (i = 0; i < N; i++) {
scanf("%d", &R[i]);
}
minv = R[0];
maxv = R[1] - R[0];
for (j = 1; j < N - 1; j++) {
if (maxv < R[j] - minv) {
maxv = R[j] - minv;
} else {
maxv = maxv;
}... | #include <stdio.h>
int main() {
int N, minv, maxv = 0, i, j;
scanf("%d", &N);
int R[N];
for (i = 0; i < N; i++) {
scanf("%d", &R[i]);
}
minv = R[0];
maxv = R[1] - R[0];
for (j = 1; j <= N - 1; j++) {
if (maxv < R[j] - minv) {
maxv = R[j] - minv;
} else {
maxv = maxv;
... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 0 | 168 | 2 |
#include <stdio.h>
int main() {
int num, max, i, min;
scanf("%d", &num);
int a[num];
for (i = 0; i < num; i++) {
scanf("%d", &a[i]);
}
max = a[1] - a[0];
min = a[0];
for (i = 1; i <= num - 1; i++) {
if (max < a[i] - min)
max = a[i] - min;
if (min < a[i])
min = a[i];
}
printf(... | #include <stdio.h>
int main() {
int num, max, i, min;
scanf("%d", &num);
int a[num];
for (i = 0; i < num; i++) {
scanf("%d", &a[i]);
}
max = a[1] - a[0];
min = a[0];
for (i = 1; i <= num - 1; i++) {
if (max < a[i] - min)
max = a[i] - min;
if (min > a[i])
min = a[i];
}
printf(... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 47]] | 0 | 146 | 2 |
#include <stdio.h>
int main() {
int i, n, r[200000], min, max;
min = max = 0;
scanf("%d%d", &n, &r[0]);
min = r[0];
for (i = 1; i < n; i++) {
scanf("%d", &r[i]);
if (max < r[i] - min) {
max = r[i] - min;
}
if (min > r[i]) {
min = r[i];
}
}
printf("%d\n", max);
return 0;
... | #include <stdio.h>
int main() {
int i, n, r[200000], min, max;
min = 0;
max = -2000000000;
scanf("%d%d", &n, &r[0]);
min = r[0];
for (i = 1; i < n; i++) {
scanf("%d", &r[i]);
if (max < r[i] - min) {
max = r[i] - min;
}
if (min > r[i]) {
min = r[i];
}
}
printf("%d\n", max... | [["+", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["-", 8, 9, 0, 1, 0, 11, 12, 11, 12, 13]] | 0 | 132 | 4 |
#include <stdio.h>
#define N 200000
int main() {
int n, num[N] = {0};
int i = 0, j, max, minnum;
scanf("%d", &n);
while (i < n) {
scanf("%d", &num[i]);
i++;
}
max = num[1] - num[0];
minnum = num[0];
for (i = 1; i < n; i++) {
if (minnum < num[i]) {
continue;
}
minnum = num... | #include <stdio.h>
#define N 200000
int main() {
int n, num[N] = {0};
int i = 0, j, max, minnum;
scanf("%d", &n);
while (i < n) {
scanf("%d", &num[i]);
i++;
}
max = num[1] - num[0];
minnum = num[0];
for (i = 0; i < n; i++) {
if (minnum < num[i]) {
continue;
}
minnum = num... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13]] | 0 | 175 | 2 |
#include <stdio.h>
#define N 200000
int main() {
int ary[N], i, n, min, t, max;
scanf("%d", &n);
scanf("%d", &ary[0]);
min = ary[0];
for (i = 1; i < n; i++) {
scanf("%d", &ary[i]);
}
max = ary[1] - min;
for (i = 0; i < n; i++) {
if (ary[i] - min > max) {
max = ary[i] - min;
}
if (a... | #include <stdio.h>
#define N 200000
int main() {
int ary[N], i, n, min, t, max;
scanf("%d", &n);
scanf("%d", &ary[0]);
min = ary[0];
for (i = 1; i < n; i++) {
scanf("%d", &ary[i]);
}
max = ary[1] - min;
for (i = 1; i < n; i++) {
if (ary[i] - min > max) {
max = ary[i] - min;
}
if (a... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13]] | 0 | 162 | 2 |
#include <stdio.h>
#define max 200000
int main() {
int i, j, n, R[max], minv, maxv;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &R[i]);
maxv = R[1] - R[0];
minv = R[0];
for (j = 1; j < n - 1; j++) {
if (maxv < R[j] - minv)
maxv = R[j] - minv;
if (minv > R[j])
minv = R[... | #include <stdio.h>
#define Max 200000
int main() {
int i, j, n, R[Max], minv, maxv;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &R[i]);
maxv = R[1] - R[0];
minv = R[0];
for (j = 1; j <= n - 1; j++) {
// if(minv > R[j]) minv = R[j];
if (maxv < R[j] - minv)
maxv = R[j] - minv;... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 141, 22], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 141, 22], ["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 22], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 22], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 0 | 148 | 6 |
#include <stdio.h>
#define MAX(a, b) (a > b ? a : b)
#define MIN(a, b) (a < b ? a : b)
int main() {
int N, minval, ans = 0;
scanf("%d", &N);
scanf("%d", &minval);
N--;
while (N--) {
int num;
scanf("%d", &num);
ans = MAX(ans, num - minval);
minval = MIN(minval, num);
}
printf("%d\n", ans)... | #include <stdio.h>
#define MAX(a, b) (a > b ? a : b)
#define MIN(a, b) (a < b ? a : b)
int main() {
int N, minval, ans = -1e9;
scanf("%d", &N);
scanf("%d", &minval);
N--;
while (N--) {
int num;
scanf("%d", &num);
ans = MAX(ans, num - minval);
minval = MIN(minval, num);
}
printf("%d\n", a... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 0 | 109 | 7 |
#include <stdio.h>
#include <stdlib.h>
#define MAX 100
void Bubble(int *);
int n; //要素数は外部変数
int main() {
int a[MAX];
int i, j, k;
int key, turn = 0;
scanf("%d", &n); //要素数の読取り
for (i = 0; i < n; i++) {
scanf("%d", &a[i]); //要素の読取り
}
for (i = 0; i < n - 2; i++) {
for (j = n - 1; j > i; j--) {... | #include <stdio.h>
#include <stdlib.h>
#define MAX 100
void Bubble(int *);
int n; //要素数は外部変数
int main() {
int a[MAX];
int i, j, k;
int key, turn = 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--) {... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 0 | 221 | 2 |
#include <stdio.h>
int main() {
int i, j, k, tmp, A[100], n, count = 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] < A[j - 1]) {
tmp = A[j];
A[j] = A[j - 1];
A[j - 1] = tmp;
... | #include <stdio.h>
int main() {
int i, j, k, tmp, A[100], n, count = 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] < A[j - 1]) {
tmp = A[j];
A[j] = A[j - 1];
A[j - 1] = tmp;
... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 62], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["-", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["-", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24]] | 0 | 211 | 7 |
#include <stdio.h>
#include <stdlib.h>
int BubSort(int *P, int n);
void ShowData(int *P, int n);
int main() {
int i, n, N;
int *P;
scanf("%d", &n);
P = (int *)malloc(n * sizeof(int));
for (i = 0; i < n; i++) {
scanf("%d", &P[i]);
}
N = BubSort(P, n);
ShowData(P, n);
printf("%d\n", N);
return 0... | #include <stdio.h>
#include <stdlib.h>
int BubSort(int *, int);
void ShowData(int *, int);
int main() {
int i, n, N;
int *P;
scanf("%d", &n);
P = (int *)malloc(n * sizeof(int));
for (i = 0; i < n; i++) {
scanf("%d", &P[i]);
}
N = BubSort(P, n);
ShowData(P, n);
printf("%d\n", N);
return 0;
}
i... | [["-", 49, 53, 54, 55, 0, 56, 49, 84, 49, 22], ["-", 0, 43, 49, 53, 54, 55, 0, 56, 49, 22], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 307 | 6 |
#include <stdio.h>
int main() {
int A[101], n, i, j, t, sw = 0;
scanf("%d", &n);
for (i = 1; i <= n; i++)
scanf("%d", &A[i]);
for (i = 1; i <= n; i++) {
for (j = n; j >= i + 1; j--) {
if (A[j] < A[j - 1]) {
t = A[j];
A[j] = A[j - 1];
A[j - 1] = t;
sw++;
}
... | #include <stdio.h>
int main() {
int A[101], n, i, j, t, sw = 0;
scanf("%d", &n);
for (i = 1; i <= n; i++)
scanf("%d", &A[i]);
for (i = 1; i <= n; i++) {
for (j = n; j >= i + 1; j--) {
if (A[j] < A[j - 1]) {
t = A[j];
A[j] = A[j - 1];
A[j - 1] = t;
sw++;
}
... | [["-", 0, 1, 0, 2, 3, 4, 0, 16, 17, 33], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 0 | 203 | 2 |
#include <stdio.h>
#define A 100
int main() {
int b, c, d = 0, e, f;
int a[A];
scanf("%d", &e);
for (b = 0; b < e; b++) {
scanf("%d", &a[b]);
}
for (b = 0; b < e; b++) {
for (c = e - 1; c > b; c--) {
if (a[c] < a[c - 1]) {
f = a[c];
a[c] = a[c - 1];
a[c - 1] = f;
... | #include <stdio.h>
#define A 100
int main() {
int b, c, d = 0, e, f;
int a[A];
scanf("%d", &e);
for (b = 0; b < e; b++) {
scanf("%d", &a[b]);
}
for (b = 0; b < e; b++) {
for (c = e - 1; c > b; c--) {
if (a[c] < a[c - 1]) {
f = a[c];
a[c] = a[c - 1];
a[c - 1] = f;
... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 209 | 2 |
#include <stdio.h>
main() {
int N;
scanf("%d", &N);
int A[N + 1], i, j, hozon, count = 0;
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
for (i = 0; i < N; i++) {
for (j = N; j > i; j--) {
if (A[j - 1] > A[j]) {
hozon = A[j];
A[j] = A[j - 1];
A[j - 1] = hozon;
... | #include <stdio.h>
main() {
int N;
scanf("%d", &N);
int A[N + 1], i, j, hozon, count = 0;
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
for (i = 0; i < N; i++) {
for (j = N - 1; j > i; j--) {
if (A[j - 1] > A[j]) {
hozon = A[j];
A[j] = A[j - 1];
A[j - 1] = hozon;
... | [["+", 8, 9, 0, 7, 10, 11, 12, 16, 17, 33], ["+", 8, 9, 0, 7, 10, 11, 12, 16, 12, 13], ["+", 36, 36, 0, 30, 0, 9, 0, 1, 0, 35], ["+", 36, 36, 0, 30, 0, 9, 0, 37, 0, 38], ["+", 36, 36, 0, 30, 0, 9, 0, 37, 0, 13]] | 0 | 201 | 5 |
#include <stdio.h>
#define N 100
int main() {
int i;
int j;
int n;
int count = 0;
int tmp;
int A[N - 1];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
for (i = 0; i < n; i++) {
for (j = n - 1; j >= 0; j--) {
if (A[j] < A[j - 1]) {
tmp = A[j];
A[j] = A... | #include <stdio.h>
#define N 100
int main() {
int i;
int j;
int n;
int count = 0;
int tmp;
int A[N];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
for (i = 0; i < n; i++) {
for (j = n - 1; j >= i + 1; j--) {
if (A[j] < A[j - 1]) {
tmp = A[j];
A[j] = A... | [["-", 8, 9, 0, 43, 49, 80, 81, 16, 17, 33], ["-", 8, 9, 0, 43, 49, 80, 81, 16, 12, 13], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 31, 22], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 72], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 0 | 209 | 6 |
#include <stdio.h>
int main() {
int i, j, temp, N, A[100], num = 0;
// input
scanf("%d", &N);
for (i = 0; i <= N - 1; i++)
scanf("%d", &A[i]);
// sort
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[j];
... | #include <stdio.h>
int main() {
int i, j, temp, N, A[100], num = 0;
// input
scanf("%d", &N);
for (i = 0; i <= N - 1; i++)
scanf("%d", &A[i]);
// sort
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[j];
... | [["-", 8, 9, 0, 57, 15, 23, 0, 11, 17, 32], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 60]] | 0 | 222 | 2 |
#include <bits/stdc++.h>
using namespace std;
int bubbleSort(int A[], int N) {
int sw = 0;
bool flag = 1;
for (int i = 0; flag; i++) {
flag = 0;
for (int j = N - 1; j >= i + 1; j--) {
flag = 0;
if (A[j - 1] > A[j]) {
swap(A[j - 1], A[j]);
sw++;
flag = 1;
}
}
... | #include <bits/stdc++.h>
using namespace std;
int bubbleSort(int A[], int N) {
int sw = 0;
bool flag = 1;
for (int i = 0; flag; i++) {
flag = 0;
for (int j = N - 1; j >= i + 1; j--) {
if (A[j - 1] > A[j]) {
swap(A[j - 1], A[j]);
sw++;
flag = 1;
}
}
}
return sw;... | [["-", 0, 7, 8, 9, 0, 1, 0, 11, 31, 22], ["-", 0, 7, 8, 9, 0, 1, 0, 11, 17, 32], ["-", 0, 7, 8, 9, 0, 1, 0, 11, 12, 13], ["-", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35]] | 1 | 212 | 4 |
#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
//#include "libs.h"
#include <random>
#include <unordered_map>
#include <unordered_set>
//#include <opencv2/core.hpp>
//#include <opencv2/highgui.hpp>
//#include <opencv2/imgproc.hpp>
using namespace std;
//呪文
#define DUMPOUT cerr
#define dump(...) ... | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
//#include "libs.h"
#include <random>
#include <unordered_map>
#include <unordered_set>
//#include <opencv2/core.hpp>
//#include <opencv2/highgui.hpp>
//#include <opencv2/imgproc.hpp>
using namespace std;
//呪文
#define DUMPOUT cerr
#define dump(...) ... | [["-", 0, 14, 49, 53, 54, 55, 0, 356, 365, 22], ["+", 0, 14, 49, 53, 54, 55, 0, 356, 365, 22]] | 1 | 1,532 | 2 |
#include <cmath>
#include <iostream>
using namespace std;
void arraycout(int *arrayy, int n) {
for (int u = 0; u < n; u++) { //出力
if (u == n - 1) {
cout << arrayy[u] << endl;
} else {
cout << arrayy[u] << ' ';
}
}
}
void insertionSort(int *sou, int n) { //挿入ソート
for (int i = 0; i < n; i++... |
#include <cmath>
#include <iostream>
using namespace std;
void arraycout(int *arrayy, int n) {
for (int u = 0; u < n; u++) { //出力
if (u == n - 1) {
cout << arrayy[u] << endl;
} else {
cout << arrayy[u] << ' ';
}
}
}
void insertionSort(int *sou, int n) { //挿入ソート
for (int i = 0; i < n; i++... | [["+", 0, 7, 10, 43, 49, 50, 51, 16, 17, 33], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13]] | 1 | 319 | 2 |
#include <iostream>
using namespace std;
int main() {
int n, nswap = 0;
int a[101];
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++) {
for (int j = n - 1; j >= 0; j--) {
if (a[j] < a[j - 1]) {
swap(a[j], a[j - 1]);
nswap++;
}
}
}
for (i... | #include <iostream>
using namespace std;
int main() {
int n, nswap = 0;
int a[101];
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++) {
for (int j = n - 1; j > 0; j--) {
if (a[j] < a[j - 1]) {
swap(a[j], a[j - 1]);
nswap++;
}
}
}
for (in... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 20], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 47]] | 1 | 169 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int N, A[101];
cin >> N;
for (int i = 0; i < N; i++)
cin >> A[i];
int temp;
int cnt = 0;
for (int i = 1; i < N; i++) {
for (int j = i; j > 0; j--) {
if (A[j - 1] < A[j]) {
break;
} else {
cnt+... | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int N, A[101];
cin >> N;
for (int i = 0; i < N; i++)
cin >> A[i];
int temp;
int cnt = 0;
for (int i = 1; i < N; i++) {
for (int j = i; j > 0; j--) {
if (A[j - 1] <= A[j]) {
break;
} else {
cnt... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19]] | 1 | 187 | 2 |
#include <iostream>
using namespace std;
int main() {
int n, a[100], i, j, flag, hoge, counta = 0;
cin >> n;
for (i = 0; i < n; i++)
cin >> a[i];
flag = 1;
while (flag) {
flag = 0;
i = 0;
for (j = n - 1; j < i; j++) {
if (a[j] < a[j - 1]) {
hoge = a[j];
a[j] = a[j - 1];
... | #include <iostream>
using namespace std;
int main() {
int n, a[100], i, j, flag, hoge, counta = 0;
cin >> n;
for (i = 0; i < n; i++)
cin >> a[i];
flag = 1;
while (flag) {
flag = 0;
i = 0;
for (j = n - 1; j > i; j--) {
if (a[j] < a[j - 1]) {
hoge = a[j];
a[j] = a[j - 1];
... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 47], ["-", 0, 52, 8, 9, 0, 7, 26, 27, 17, 29], ["+", 0, 52, 8, 9, 0, 7, 26, 27, 17, 68]] | 1 | 187 | 4 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
void trace(int A[], int N) {
int i;
for (i = 0; i < N; i++) {
if (i > 0)
cout << " ";
cout << A[i];
}
cout << endl;
}
int bubbleSort(int A[], int N) {
bool flag = 1;
int cnt = 0;
while (flag) ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
void trace(int A[], int N) {
int i;
for (i = 0; i < N; i++) {
if (i > 0)
cout << " ";
cout << A[i];
}
cout << endl;
}
int bubbleSort(int A[], int N) {
bool flag = 1;
int cnt = 0;
while (flag) ... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 47], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 20]] | 1 | 227 | 2 |
#include <iostream>
using namespace std;
// int bubbleSort(int A[], int N) {
// int sw = 0;
// bool flag = 1;
// for(int i = 0; flag; i++) {
// flag = 0;
// for(int j = N - 1; j >= i + 1; j--) {
// if(A[j] < A[j - 1]) {
// swap(A[j], A[j - 1]);
// ... | #include <iostream>
using namespace std;
// int bubbleSort(int A[], int N) {
// int sw = 0;
// bool flag = 1;
// for(int i = 0; flag; i++) {
// flag = 0;
// for(int j = N - 1; j >= i + 1; j--) {
// if(A[j] < A[j - 1]) {
// swap(A[j], A[j - 1]);
// ... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18]] | 1 | 219 | 2 |
// コンパイル方法 cl /EHsc bubbleSort.cpp
#include <iostream>
using namespace std;
int bubbleSort(int A[], int N) {
int sw = 0;
bool flag = 1;
for (int i = 0; flag; i++) {
flag = 0;
for (int j = N; j >= i + 1; j--) {
if (A[j] < A[j - 1]) {
swap(A[j], A[j - 1]);
flag = 1;
sw++;
... | #include <iostream>
using namespace std;
int bubbleSort(int A[], int N) {
int sw = 0;
bool flag = 1;
for (int i = 0; flag; i++) {
flag = 0;
for (int j = N - 1; j >= i + 1; j--) {
if (A[j] < A[j - 1]) {
swap(A[j], A[j - 1]);
flag = 1;
sw++;
}
}
}
return sw;
}
... | [["+", 0, 7, 10, 43, 49, 50, 51, 16, 17, 33], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13]] | 1 | 204 | 2 |
#include <algorithm> // std::copy
#include <iostream>
#include <iterator> // std::ostream_iterator
#include <sstream> // std::stringstream
#include <string>
#include <vector>
using namespace std;
void output(vector<int> nums) {
copy(nums.begin(), nums.end() - 1, ostream_iterator<int>(cout, " "));
cout << nums.ba... | #include <algorithm> // std::copy
#include <iostream>
#include <iterator> // std::ostream_iterator
#include <sstream> // std::stringstream
#include <string>
#include <vector>
using namespace std;
void output(vector<int> nums) {
copy(nums.begin(), nums.end() - 1, ostream_iterator<int>(cout, " "));
cout << nums.ba... | [["-", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["-", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 245 | 5 |
#include <iostream>
void print_array(int a[], int n) {
for (int i = 0; i < n; ++i) {
if (0 < i) {
std::cout << " ";
}
std::cout << a[i];
}
std::cout << std::endl;
}
template <class T> void swap(T &left, T &right) {
T temp = left;
left = right;
right = temp;
}
int bubble_sort(int a[], ... | #include <iostream>
void print_array(int a[], int n) {
for (int i = 0; i < n; ++i) {
if (0 < i) {
std::cout << " ";
}
std::cout << a[i];
}
std::cout << std::endl;
}
template <class T> void swap(T &left, T &right) {
T temp = left;
left = right;
right = temp;
}
int bubble_sort(int a[], ... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 31, 13], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 31, 13], ["+", 64, 9, 0, 1, 0, 2, 63, 343, 345, 348], ["+", 64, 9, 0, 1, 0, 2, 63, 343, 0, 349]] | 1 | 263 | 4 |
#include <algorithm>
#include <cstdio>
using namespace std;
void print_A(int A[], int n) {
for (int i = 0; i < n; i++) {
if (i != n - 1)
printf("%d ", A[i]);
else
printf("%d", A[i]);
}
printf("\n");
return;
}
int bubblesort(int A[], int n) {
int count = 0;
for (int i = 0; i < n; i++) {... | #include <algorithm>
#include <cstdio>
using namespace std;
void print_A(int A[], int n) {
for (int i = 0; i < n; i++) {
if (i != n - 1)
printf("%d ", A[i]);
else
printf("%d", A[i]);
}
printf("\n");
return;
}
int bubblesort(int A[], int n) {
int count = 0;
for (int i = 0; i < n; i++) {... | [["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 72], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 249 | 2 |
#include <bits/stdc++.h>
using namespace std;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
int res = 0;
bool f = true;
while (f) {
f = false;
for (int j = n - 1; j >= 1; j--) {
if (a[j] < a[j - 1... | #include <bits/stdc++.h>
using namespace std;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
int res = 0;
bool f = true;
while (f) {
f = false;
for (int j = n - 1; j >= 1; j--) {
if (a[j] < a[j - 1... | [["-", 0, 7, 8, 9, 0, 1, 0, 16, 17, 151], ["-", 8, 9, 0, 1, 0, 16, 12, 103, 0, 104], ["-", 8, 9, 0, 1, 0, 16, 12, 103, 0, 44]] | 1 | 197 | 4 |
#include <iostream>
using namespace std;
int BBS(int A[10000], int N) {
int sw = 0;
bool flag = 1;
for (int i = 0; flag; i++) {
flag = 0;
for (int j = N - 1; j >= i; j--) {
if (A[j] < A[j - 1]) {
swap(A[j], A[j - 1]);
flag = 1;
}
sw++;
}
}
return sw;
}
int main... | #include <iostream>
using namespace std;
int BBS(int A[10000], int N) {
int sw = 0;
bool flag = 1;
for (int i = 0; flag; i++) {
flag = 0;
for (int j = N - 1; j >= i + 1; j--) {
if (A[j] < A[j - 1]) {
swap(A[j], A[j - 1]);
flag = 1;
sw++;
}
}
}
return sw;
}
int... | [["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 72], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["-", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 202 | 4 |
#include <stdio.h>
int bubbleSort(int *A, int N) {
int flag = 1, count = 0;
while (flag) {
flag = 0;
for (int j = N - 1; j > 0; j--) {
if (A[j] < A[j - 1]) {
int tmp = A[j];
A[j] = A[j - 1];
A[j - 1] = tmp;
count++;
}
flag = 1;
}
}
return count;
}
... | #include <stdio.h>
int bubbleSort(int *A, int N) {
int flag = 1, count = 0;
while (flag) {
flag = 0;
for (int j = N - 1; j > 0; j--) {
if (A[j] < A[j - 1]) {
int tmp = A[j];
A[j] = A[j - 1];
A[j - 1] = tmp;
count++;
flag = 1;
}
}
}
return count;
}... | [["-", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46], ["+", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67], ["+", 8, 1, 0, 2, 3, 4, 0, 66, 17, 67]] | 1 | 245 | 4 |
#include <stdio.h>
int bubbleSort(int *A, int N) {
int flag = 1, count = 0, i = 0;
while (flag) {
flag = 0;
for (int j = N - 1; j > i++; j--) {
if (A[j] < A[j - 1]) {
int tmp = A[j];
A[j] = A[j - 1];
A[j - 1] = tmp;
count++;
flag = 1;
}
}
}
return... | #include <stdio.h>
int bubbleSort(int *A, int N) {
int flag = 1, count = 0, i = 0;
while (flag) {
flag = 0;
for (int j = N - 1; j > i; j--) {
if (A[j] < A[j - 1]) {
int tmp = A[j];
A[j] = A[j - 1];
A[j - 1] = tmp;
count++;
flag = 1;
}
}
i++;
}
... | [["-", 8, 9, 0, 7, 15, 16, 12, 27, 17, 29], ["+", 0, 52, 8, 9, 0, 1, 0, 27, 28, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 27, 17, 29], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 1 | 252 | 4 |
#include <bits/stdc++.h>
#define GET_MACRO(_1, _2, _3, _4, _5, _6, NAME, ...) NAME
#define pr(...) \
cerr << GET_MACRO(__VA_ARGS__, pr6, pr5, pr4, pr3, pr2, pr1)(__VA_ARGS__) \
<< endl
#define pr1(a) (#a) << "=" << (a) << " "
#define pr2(a, b) p... | #include <bits/stdc++.h>
#define GET_MACRO(_1, _2, _3, _4, _5, _6, NAME, ...) NAME
#define pr(...) \
cerr << GET_MACRO(__VA_ARGS__, pr6, pr5, pr4, pr3, pr2, pr1)(__VA_ARGS__) \
<< endl
#define pr1(a) (#a) << "=" << (a) << " "
#define pr2(a, b) p... | [["-", 39, 344, 3, 347, 0, 77, 39, 344, 141, 78], ["+", 39, 344, 3, 347, 0, 77, 39, 344, 141, 78], ["-", 8, 9, 0, 1, 0, 2, 63, 118, 119, 120], ["+", 8, 9, 0, 1, 0, 2, 63, 118, 119, 120]] | 1 | 970 | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int num;
cin >> num;
int a[num];
int tmp = 0;
for (int i = 0; i < num; i++)
cin >> a[i];
for (int i = 0; i < num; i++) {
for (int j = num - 1; j > i; j--)
if (a[j] > a[j - 1]) {
swap(a[j], a[j - 1]);
tmp += 1;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int num;
cin >> num;
int a[num];
int tmp = 0;
for (int i = 0; i < num; i++)
cin >> a[i];
for (int i = 0; i < num; i++) {
for (int j = num - 1; j > i; j--)
if (a[j] < a[j - 1]) {
swap(a[j], a[j - 1]);
tmp += 1;
}
... | [["-", 0, 7, 8, 57, 15, 339, 51, 16, 17, 47], ["+", 0, 7, 8, 57, 15, 339, 51, 16, 17, 18]] | 1 | 170 | 2 |
#include <iostream>
using namespace std;
int bubbleSort(int p[], int n) {
int flag = 1;
int count = 0;
for (int i = 0; i < n - 1; i++) {
if (!flag)
break;
flag = 0;
for (int j = n - 1; j > i; j++)
if (p[j] < p[j - 1]) {
flag = 1;
int t = p[j];
p[j] = p[j - 1];
... | #include <iostream>
using namespace std;
int bubbleSort(int p[], int n) {
int flag = 1;
int count = 0;
for (int i = 0; i < n - 1; i++) {
if (!flag)
break;
flag = 0;
for (int j = n - 1; j > i; j--)
if (p[j] < p[j - 1]) {
flag = 1;
int t = p[j];
p[j] = p[j - 1];
... | [["-", 0, 7, 8, 9, 0, 7, 26, 27, 17, 29], ["+", 0, 7, 8, 9, 0, 7, 26, 27, 17, 68]] | 1 | 227 | 22 |
#include <iostream>
using namespace std;
#define MAX 100
void BubbleSort(int x[], int n);
int main() {
int i, N;
int x[MAX] = {0};
cin >> N;
for (i = 0; i < N; i++) {
cin >> x[i];
}
BubbleSort(x, N);
return 0;
}
void BubbleSort(int x[], int n) {
int i, j, tmp, count = 0;
for (i = 1; i < n; i... | #include <iostream>
using namespace std;
#define MAX 100
void BubbleSort(int x[], int n);
int main() {
int i, N;
int x[MAX] = {0};
cin >> N;
for (i = 0; i < N; i++) {
cin >> x[i];
}
BubbleSort(x, N);
return 0;
}
void BubbleSort(int x[], int n) {
int i, j, tmp, count = 0;
for (i = 1; i < n; i... | [["-", 15, 339, 51, 16, 12, 23, 0, 16, 12, 13], ["+", 15, 339, 51, 16, 12, 23, 0, 16, 12, 13]] | 1 | 248 | 2 |
#include <iostream>
using namespace std;
// void datalog(int a[],int n);
int BubbleSort(int a[], int n);
int BubbleSort(int a[], int n) {
int s = 0;
for (int i = 0; i < n - 1; i++) {
for (int j = n - 1; j >= i + 1; j--) {
if (a[j - 1] > a[j]) {
swap(a[j], a[j - 1]);
}
s++;
}
}
... | #include <iostream>
using namespace std;
// void datalog(int a[],int n);
int BubbleSort(int a[], int n);
int BubbleSort(int a[], int n) {
int s = 0;
for (int i = 0; i < n - 1; i++) {
for (int j = n - 1; j >= i + 1; j--) {
if (a[j - 1] > a[j]) {
swap(a[j], a[j - 1]);
s++;
}
}
}... | [["-", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46], ["-", 8, 9, 0, 1, 0, 16, 12, 5, 0, 6], ["+", 8, 9, 0, 1, 0, 16, 12, 5, 0, 44]] | 1 | 212 | 4 |
#include <iostream>
#include <utility> // swap
#include <vector>
using namespace std;
int bubbleSort(vector<int> &A) {
bool flag = true;
int i = 0;
int cnt = 0; // 交換した回数
while (flag) {
flag = false;
for (auto j = A.size() - 1; j >= i + 1; j--) {
if (A[j] < A[j - 1]) {
swap(A[j], A[j - 1... | #include <iostream>
#include <utility> // swap
#include <vector>
using namespace std;
int bubbleSort(vector<int> &A) {
bool flag = true;
int i = 0;
int cnt = 0; // 交換した回数
while (flag) {
flag = false;
for (auto j = A.size() - 1; j >= i + 1; j--) {
if (A[j] < A[j - 1]) {
swap(A[j], A[j - 1... | [["+", 0, 52, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 52, 8, 9, 0, 7, 8, 9, 0, 46]] | 1 | 222 | 2 |
#include <iostream>
using namespace std;
int bubbleSort(int a[], int n) {
int cnt = 0;
bool swapped = true;
while (swapped) {
swapped = false;
for (int i = 0; i < n - 1; i++) {
if (a[i] > a[i + 1]) {
int temp = a[i];
a[i] = a[i + 1];
a[i + 1] = temp;
swapped = true;... | #include <iostream>
using namespace std;
int bubbleSort(int a[], int n) {
int cnt = 0;
bool swapped = true;
while (swapped) {
swapped = false;
for (int i = 0; i < n - 1; i++) {
if (a[i] > a[i + 1]) {
int temp = a[i];
a[i] = a[i + 1];
a[i + 1] = temp;
swapped = true;... | [["+", 0, 30, 0, 14, 8, 9, 0, 37, 0, 38], ["+", 0, 30, 0, 14, 8, 9, 0, 37, 0, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 37, 0, 35]] | 1 | 208 | 3 |
#include <iostream>
using namespace std;
void trace(int A[100], int n) {
for (int i = 0; i < n; i++) {
if (i)
cout << " ";
cout << A[i];
}
cout << endl;
}
/*void insertionSort(int A[100],int n){
int v,j;
for ( int i = 0; i < n; i++){
v=A[i];
j = i - 1;
while ((j >= ... | #include <iostream>
using namespace std;
void trace(int A[100], int n) {
for (int i = 0; i < n; i++) {
if (i)
cout << " ";
cout << A[i];
}
cout << endl;
}
/*void insertionSort(int A[100],int n){
int v,j;
for ( int i = 0; i < n; i++){
v=A[i];
j = i - 1;
while ((j >= ... | [["-", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46], ["-", 0, 52, 8, 9, 0, 7, 8, 9, 0, 46], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46], ["+", 0, 52, 8, 9, 0, 7, 8, 9, 0, 46]] | 1 | 229 | 4 |
#include <bits/stdc++.h>
using namespace std;
void swap(int a[], int i, int j, int *p_cnt) {
int tmp = a[i];
a[i] = a[j];
a[j] = tmp;
*p_cnt++;
}
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int cnt = 0;
for (int i = 0; i < n; i++) {
for (int j = ... | #include <bits/stdc++.h>
using namespace std;
void swap(int a[], int i, int j, int *p_cnt) {
int tmp = a[i];
a[i] = a[j];
a[j] = tmp;
(*p_cnt)++;
}
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int cnt = 0;
for (int i = 0; i < n; i++) {
for (int j ... | [["+", 8, 9, 0, 1, 0, 27, 28, 23, 0, 24], ["+", 8, 9, 0, 1, 0, 27, 28, 23, 0, 25]] | 1 | 212 | 2 |
#include <iostream>
using namespace std;
void bubbleSort(int A[], int N) {
int swap_cnt, flag, tmp;
flag = 1;
while (flag) {
flag = 0;
for (int i = N - 1; i > 0; i--) {
if (A[i] < A[i - 1]) {
tmp = A[i - 1];
A[i - 1] = A[i];
A[i] = tmp;
flag = 1;
swap_cnt++;
... | #include <iostream>
using namespace std;
void bubbleSort(int A[], int N) {
int swap_cnt = 0, flag, tmp;
flag = 1;
while (flag) {
flag = 0;
for (int i = N - 1; i > 0; i--) {
if (A[i] < A[i - 1]) {
tmp = A[i - 1];
A[i - 1] = A[i];
A[i] = tmp;
flag = 1;
swap_cnt... | [["+", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 198 | 2 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n; // number of entries
cin >> n;
vector<int> swap_vec;
for (int i = 0; i < n; i++) {
int entry;
cin >> entry;
swap_vec.push_back(entry);
}
// bubble sort
int n_swaps = 0;
for (int i = 0; i... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n; // number of entries
cin >> n;
vector<int> swap_vec;
for (int i = 0; i < n; i++) {
int entry;
cin >> entry;
swap_vec.push_back(entry);
}
// bubble sort
int n_swaps = 0;
for (int i = 0; i ... | [["-", 8, 9, 0, 57, 64, 1, 0, 16, 12, 22], ["+", 0, 57, 64, 1, 0, 16, 12, 5, 0, 62], ["+", 0, 57, 64, 1, 0, 16, 12, 5, 0, 6]] | 1 | 180 | 4 |
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int A[110];
for (auto i = 0; i < N; i++) {
cin >> A[i];
}
bool f = true;
int ans = 0;
while (f) {
f = false;
for (auto j = N - 1; j >= 0; j--) {
if (A[j] < A[j - 1]) {
int temp = A[j - 1];
A[j - 1] ... | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int A[110];
for (auto i = 0; i < N; i++) {
cin >> A[i];
}
bool f = true;
int ans = 0;
while (f) {
f = false;
for (auto j = N - 1; j >= 1; j--) {
if (A[j] < A[j - 1]) {
int temp = A[j - 1];
A[j - 1] ... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 190 | 2 |
#include "algorithm"
#include "iostream"
using namespace std;
void bubbleSort(int A[], int N);
void trace(int A[], int N);
int MAX = 100;
int main(int argc, char const *argv[]) {
int A[100];
int N;
cin >> N;
for (int i = 0; i < N; ++i)
cin >> A[i];
bubbleSort(A, N);
return 0;
}
void bubbleSort(int A[... | #include "algorithm"
#include "iostream"
using namespace std;
void bubbleSort(int A[], int N);
void trace(int A[], int N);
int MAX = 100;
int main(int argc, char const *argv[]) {
int A[100];
int N;
cin >> N;
for (int i = 0; i < N; ++i)
cin >> A[i];
bubbleSort(A, N);
return 0;
}
void bubbleSort(int A[... | [["-", 8, 9, 0, 1, 0, 16, 12, 103, 0, 104], ["-", 8, 9, 0, 1, 0, 16, 12, 103, 0, 125], ["-", 0, 1, 0, 16, 12, 103, 0, 42, 0, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22]] | 1 | 267 | 5 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> pint;
typedef vector<int> vint;
typedef vector<pint> vpint;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#def... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> pint;
typedef vector<int> vint;
typedef vector<pint> vpint;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#def... | [["+", 0, 57, 64, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 12, 146], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35]] | 1 | 280 | 4 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
vector<int> List;
int count = 0;
cin >> n;
for (int i = 0; i < n; i++) {
int Value;
cin >> Value;
List.push_back(Value);
}
bool Flag = true;
while (Flag) {
Flag = false;
for (int j = n - 1; j > 0; j++... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
vector<int> List;
int count = 0;
cin >> n;
for (int i = 0; i < n; i++) {
int Value;
cin >> Value;
List.push_back(Value);
}
bool Flag = true;
while (Flag) {
Flag = false;
for (int j = n - 1; j > 0; j--... | [["-", 0, 52, 8, 9, 0, 7, 26, 27, 17, 29], ["+", 0, 52, 8, 9, 0, 7, 26, 27, 17, 68]] | 1 | 194 | 2 |
#include <iostream>
using namespace std;
int main() {
int n, a[100], c = 0;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n - 1; i++)
for (int j = n - 1; i + 1 < j; j--) {
int tmp = a[j];
if (a[j - 1] > a[j])
a[j] = a[j - 1], a[j - 1] = tmp, c++;
}
for ... | #include <iostream>
using namespace std;
int main() {
int n, a[100], c = 0;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n - 1; i++)
for (int j = n - 1; i < j; j--) {
int tmp = a[j];
if (a[j - 1] > a[j])
a[j] = a[j - 1], a[j - 1] = tmp, c++;
}
for (int... | [["-", 0, 7, 8, 7, 15, 16, 31, 16, 17, 72], ["-", 0, 7, 8, 7, 15, 16, 31, 16, 12, 13]] | 1 | 178 | 2 |
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = (a... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = (a... | [["+", 0, 14, 8, 9, 0, 1, 0, 16, 31, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 262 | 4 |
#include <algorithm>
#include <iostream>
using namespace std;
int C;
void BubbleSort(int A[], int N) {
bool flag = true;
while (flag) {
flag = false;
for (int j = N - 1; j >= 1; j--) {
if (A[j] > A[j - 1]) {
swap(A[j], A[j - 1]);
C++;
flag = true;
}
}
}
}
int ma... | #include <algorithm>
#include <iostream>
using namespace std;
int C;
void BubbleSort(int A[], int N) {
bool flag = true;
while (flag) {
flag = false;
for (int j = N - 1; j >= 1; j--) {
if (A[j] < A[j - 1]) {
swap(A[j], A[j - 1]);
C++;
flag = true;
}
}
}
}
int ma... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18]] | 1 | 199 | 2 |
#include <iostream>
#include <stdio.h>
using namespace std;
int BubbleSort(int elem[], int num) {
int i, j;
int tmp;
int cnt = 0;
bool flag = false;
for (i = 0; i < num; i++) {
flag = false;
for (j = num - 1; j > i; j--) {
if (elem[j] < elem[j - 1]) {
swap(elem[j], elem[j - 1]);
... | #include <iostream>
#include <stdio.h>
using namespace std;
int BubbleSort(int elem[], int num) {
int i, j;
int tmp;
int cnt = 0;
bool flag = false;
for (i = 0; i < num; i++) {
flag = false;
for (j = num - 1; j > i; j--) {
if (elem[j] < elem[j - 1]) {
swap(elem[j], elem[j - 1]);
... | [["+", 0, 57, 64, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 17, 32]] | 1 | 246 | 2 |
#include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
void printIntInLine(vector<int> &arr) {
for (vector<int>::iterator itr = arr.begin(); itr != --(arr.end()); ++itr) {
printf("%d ", *itr);
}
printf("%d\n", *(--(arr.end())));
}
int main() {
vector<int> arr;
int n, tmp, nSwap;
... | #include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
void printIntInLine(vector<int> &arr) {
for (vector<int>::iterator itr = arr.begin(); itr != --(arr.end()); ++itr) {
printf("%d ", *itr);
}
printf("%d\n", *(--(arr.end())));
}
int main() {
vector<int> arr;
int n, tmp, nSwap;
... | [["+", 0, 7, 10, 43, 49, 50, 51, 27, 17, 68]] | 1 | 253 | 1 |
#include <cstdio>
#include <iostream>
using namespace std;
static const int N = 100;
void inputArray(int a[], int n) {
for (int i = 0; i < n; ++i)
scanf("%d", &a[i]);
}
void printArray(int a[], int n) {
int k = 0;
while (1) {
if (k == n - 1)
break;
else {
printf("%d ", a[k]);
}
... | #include <cstdio>
#include <iostream>
using namespace std;
static const int N = 100;
void inputArray(int a[], int n) {
for (int i = 0; i < n; ++i)
scanf("%d", &a[i]);
}
void printArray(int a[], int n) {
int k = 0;
while (1) {
if (k == n - 1)
break;
else {
printf("%d ", a[k]);
}
... | [["-", 51, 16, 12, 69, 341, 342, 0, 16, 17, 72], ["+", 51, 16, 12, 69, 341, 342, 0, 16, 17, 33], ["-", 0, 11, 12, 69, 341, 342, 0, 16, 17, 72], ["+", 0, 11, 12, 69, 341, 342, 0, 16, 17, 33], ["-", 0, 11, 31, 69, 341, 342, 0, 16, 17, 72], ["+", 0, 11, 31, 69, 341, 342, 0, 16, 17, 33]] | 1 | 294 | 6 |
#include <iostream>
using namespace std;
int main() {
int n, i, j, v, count = 0;
int a[100];
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
}
for (i = 0; i < n - 1; i++) {
for (j = n; j > i; j--) {
if (a[j] < a[j - 1]) {
count++;
v = a[j];
a[j] = a[j - 1];
... | #include <iostream>
using namespace std;
int main() {
int n, i, j, v, count = 0;
int a[100];
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
}
for (i = 0; i < n - 1; i++) {
for (j = n - 1; j > i; j--) {
if (a[j] < a[j - 1]) {
count++;
v = a[j];
a[j] = a[j - 1];
... | [["+", 8, 9, 0, 7, 10, 11, 12, 16, 17, 33], ["+", 8, 9, 0, 7, 10, 11, 12, 16, 12, 13]] | 1 | 180 | 2 |
#include <stdio.h>
void swap(int *a, int *b) {
int c;
c = *a;
*a = *b;
*b = c;
}
int main(void) {
int N, i, a[101], j, k = 0;
scanf("%d", &N);
for (i = 0; i < N - 1; i++) {
scanf("%d ", &a[i]);
}
scanf("%d", &a[N - 1]);
for (i = 0; i < N; i++) {
for (j = N - 1; j >= i + 1; j--) {
if (a... | #include <stdio.h>
void swap(int *a, int *b) {
int c;
c = *a;
*a = *b;
*b = c;
}
int main(void) {
int N, i, a[101], j, k = 0;
scanf("%d", &N);
for (i = 0; i < N - 1; i++) {
scanf("%d ", &a[i]);
}
scanf("%d", &a[N - 1]);
for (i = 0; i < N; i++) {
for (j = N - 1; j >= i + 1; j--) {
if (a... | [["-", 15, 339, 51, 16, 12, 69, 341, 342, 0, 22], ["+", 51, 16, 12, 69, 341, 342, 0, 16, 31, 22], ["+", 51, 16, 12, 69, 341, 342, 0, 16, 17, 33], ["+", 51, 16, 12, 69, 341, 342, 0, 16, 12, 13], ["-", 3, 4, 0, 66, 28, 69, 341, 342, 0, 22], ["+", 3, 4, 0, 66, 28, 69, 341, 342, 0, 22], ["+", 0, 66, 28, 69, 341, 342, 0, 16... | 1 | 232 | 8 |
#include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int BubbleSort(int A[], int N) {
bool flag = 1;
int i;
int j;
int sw;
for (int i = 0; flag; i++) {
flag = 0;
for (j = N - 1; j >= i + 1; j--) {
if (A[j - 1] > A[j]) {
swap(A[j - 1], A[j]);... | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int BubbleSort(int A[], int N) {
bool flag = 1;
int i;
int j;
int sw = 0;
for (int i = 0; flag; i++) {
flag = 0;
for (int j = N - 1; j >= i + 1; j--) {
if (A[j - 1] > A[j]) {
swap(A[j - 1]... | [["+", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 7, 8, 9, 0, 7, 10, 43, 39, 40], ["-", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46]] | 1 | 214 | 5 |
#include <iostream>
#include <stdio.h>
using namespace std;
int bubble(int A[], int n) {
int i, j;
bool flag = 1;
int sw = 0;
for (i = 0; flag; i++) {
flag = 0;
for (j = n - 1; i < j; j--) {
if (A[j] < A[j - 1]) {
swap(A[j], A[j - 1]);
sw += 1;
}
}
}
return sw;
}
in... | #include <iostream>
#include <stdio.h>
using namespace std;
int bubble(int A[], int n) {
int i, j;
bool flag = 1;
int sw = 0;
for (i = 0; flag; i++) {
flag = 0;
for (j = n - 1; i < j; j--) {
if (A[j] < A[j - 1]) {
swap(A[j], A[j - 1]);
sw += 1;
flag = 1;
}
}
}
... | [["+", 0, 57, 64, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35]] | 1 | 240 | 4 |
#include <bits/stdc++.h>
using namespace std;
int Bubble(vector<int> &A) {
const int N = A.size();
int cnt = 0;
bool flag = 1; // ????????£??\????´?????????¨??????
while (flag) {
flag = 0;
for (int j = N - 1; j >= 1; j--) {
if (A[j] < A[j - 1]) {
swap(A[j], A[j - 1]);
flag = 1;
... | #include <bits/stdc++.h>
using namespace std;
int Bubble(vector<int> &A) {
const int N = A.size();
int cnt = 0;
bool flag = 1; // ????????£??\????´?????????¨??????
while (flag) {
flag = 0;
for (int j = N - 1; j >= 1; j--) {
if (A[j] < A[j - 1]) {
swap(A[j], A[j - 1]);
flag = 1;
... | [["+", 0, 30, 0, 14, 8, 9, 0, 37, 0, 38], ["+", 0, 30, 0, 14, 8, 9, 0, 37, 0, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 37, 0, 35]] | 1 | 205 | 3 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, a[100], cnt = 0;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
bool flag = true;
while (flag) {
flag = false;
for (int i = 0; i < n; i++) {
if (a[i] > a[i + 1]) {
swap(a[i], a[i + 1]);
fla... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, a[100], cnt = 0;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
bool flag = true;
while (flag) {
flag = false;
for (int i = 0; i < n - 1; i++) {
if (a[i] > a[i + 1]) {
swap(a[i], a[i + 1]);
... | [["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 165 | 2 |
#include <stdio.h>
#include <stdlib.h>
int main(void) {
int i = 0;
int k = 0;
int j = 0;
int n;
int input;
int *num;
int swapNum = 0;
int temp;
int flag = 1;
scanf("%d", &n);
num = (int *)malloc(n * sizeof(int));
for (i = 0; i < n; i++) {
scanf("%d", &input);
num[i] = input;
}
if... | #include <stdio.h>
#include <stdlib.h>
int main(void) {
int i = 0;
int k = 0;
int j = 0;
int n;
int input;
int *num;
int swapNum = 0;
int temp;
int flag = 1;
scanf("%d", &n);
num = (int *)malloc(n * sizeof(int));
for (i = 0; i < n; i++) {
scanf("%d", &input);
num[i] = input;
}
if... | [["+", 8, 9, 0, 7, 10, 11, 12, 16, 17, 33], ["+", 8, 9, 0, 7, 10, 11, 12, 16, 12, 13]] | 1 | 251 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
#include <cmath>
void trace(int A[], int n) {
for (int i = 0; i < n - 1; i++)
cout << A[i];
cout << A[n - 1] << "\n";
}
int main() {
int N, flag = 1, temp, count = 0;
cin >> N;
int A[N];
for (int i = 0; i < N; i++)
cin >> A[i];
while... | #include <algorithm>
#include <iostream>
using namespace std;
#include <cmath>
void trace(int A[], int n) {
for (int i = 0; i < n - 1; i++)
cout << A[i] << " ";
cout << A[n - 1] << "\n";
}
int main() {
int N, flag = 1, temp, count = 0;
cin >> N;
int A[N];
for (int i = 0; i < N; i++)
cin >> A[i];
... | [["+", 8, 9, 0, 7, 8, 1, 0, 16, 17, 151], ["+", 0, 7, 8, 1, 0, 16, 12, 5, 0, 62], ["+", 0, 7, 8, 1, 0, 16, 12, 5, 0, 6]] | 1 | 204 | 15 |
#include <iostream>
using namespace std;
int main() {
//??£?¨?
int n; //?????????????????°
int a[100]; //?????????????????°???
int i, k; //????????????
int count = 0;
int tmp;
//??°????????\???
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
}
//??????
for (i = 0; i < n; i++) {
f... | #include <iostream>
using namespace std;
int main() {
//??£?¨?
int n; //?????????????????°
int a[100]; //?????????????????°???
int i, k; //????????????
int count = 0;
int tmp;
//??°????????\???
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
}
//??????
for (i = 0; i < n; i++) {
f... | [["+", 0, 16, 12, 69, 341, 342, 0, 16, 17, 33], ["+", 0, 16, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 192 | 2 |
#include <iostream>
#include <vector>
void trace(std::vector<int> v) {
std::string s;
for (std::vector<int>::iterator i = v.begin(); i != v.end(); ++i) {
if (i != v.end() - 1)
std::cout << *i << " ";
else
std::cout << *i;
}
std::cout << std::endl;
}
int main() {
{
using namespace st... | #include <iostream>
#include <vector>
void trace(std::vector<int> v) {
std::string s;
for (std::vector<int>::iterator i = v.begin(); i != v.end(); ++i) {
if (i != v.end() - 1)
std::cout << *i << " ";
else
std::cout << *i;
}
std::cout << std::endl;
}
int main() {
{
using namespace st... | [["+", 8, 9, 0, 9, 0, 1, 0, 2, 63, 22], ["+", 0, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 0, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["+", 0, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 0, 14, 8, 9, 0, 9, 0, 1, 0, 35]] | 1 | 243 | 5 |
#include <iostream>
using namespace std;
int count = 0;
int BubbleSort(int A[], int N) {
bool flag = 1;
while (flag) {
flag = 0;
for (int j = N - 1; j >= count + 1; j--) {
if (A[j] < A[j - 1]) {
swap(A[j], A[j - 1]);
count++;
flag = 1;
}
}
}
return count;
}
int... | #include <iostream>
using namespace std;
int count = 0;
int BubbleSort(int A[], int N) {
bool flag = 1;
while (flag) {
flag = 0;
for (int j = N - 1; j >= 1; j--) {
if (A[j] < A[j - 1]) {
swap(A[j], A[j - 1]);
count++;
flag = 1;
}
}
}
return count;
}
int main() ... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 31, 22], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 72]] | 1 | 201 | 2 |
#include <bits/stdc++.h>
int main() {
int N;
std::cin >> N;
std::vector<int> A(N);
for (int i = 0; i < N; i++) {
std::cin >> A[i];
}
bool finished = false;
int timesOfSwap = 0;
while (!finished) {
finished = true;
for (int i = 0; i < N - 1; i++) {
if (A[i] > A[i + 1]) {
s... | #include <bits/stdc++.h>
int main() {
int N;
std::cin >> N;
std::vector<int> A(N);
for (int i = 0; i < N; i++) {
std::cin >> A[i];
}
bool finished = false;
int timesOfSwap = 0;
while (!finished) {
finished = true;
for (int i = 0; i < N - 1; i++) {
if (A[i] > A[i + 1]) {
s... | [["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46], ["-", 8, 9, 0, 57, 75, 76, 0, 9, 0, 46]] | 1 | 198 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, y[1000], z = 0;
scanf("%d", &x);
for (int i = 0; i < x; i++) {
scanf("%d", &y[i]);
}
for (int i = 0; i < x; i++) {
for (int j = 0; j < x; j++) {
if (y[j] > y[j + 1]) {
int h;
h = y[j];
y[j] = y[j + 1];
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, y[1000], z = 0;
scanf("%d", &x);
for (int i = 0; i < x; i++) {
scanf("%d", &y[i]);
}
for (int i = 0; i < x; i++) {
for (int j = 0; j < x - 1; j++) {
if (y[j] > y[j + 1]) {
int h;
h = y[j];
y[j] = y[j + 1];
... | [["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 209 | 2 |
#include <iostream>
using namespace std;
// bubble sort
int main() {
int n, tmp;
int a[100];
int count = 0;
int flag = 1;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
while (flag) {
flag = 0;
for (int j = n - 1; j >= 1; j--) {
if (a[j] < a[j - 1]) {
tmp = a[j];
... | #include <iostream>
using namespace std;
// bubble sort
int main() {
int n, tmp;
int a[100];
int count = 0;
int flag = 1;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
while (flag) {
flag = 0;
for (int j = n - 1; j >= 1; j--) {
if (a[j] < a[j - 1]) {
tmp = a[j];
... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 188 | 2 |
#include <algorithm>
#include <cstdio>
using namespace std;
void trace(int A[], int N) {
int i;
for (i = 0; i < N; i++) {
if (i > 0)
printf(" ");
printf("%d", A[i]);
}
printf("\n");
}
int bubbleSort(int A[], int N) {
int sw = 0;
bool flag = true;
for (int i = 0; flag; i++) {
flag = fal... | #include <algorithm>
#include <cstdio>
using namespace std;
void trace(int A[], int N) {
int i;
for (i = 0; i < N; i++) {
if (i > 0)
printf(" ");
printf("%d", A[i]);
}
printf("\n");
}
int bubbleSort(int A[], int N) {
int sw = 0;
bool flag = true;
for (int i = 0; flag; i++) {
flag = fal... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 257 | 1 |
#include <iostream>
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
int main() {
int N;
cin >> N;
int seq[N];
REP(i, N) cin >> seq[i];
int swap = 0;
for (int i = 0; i < N; i++) {
for (int j = N; j > i; j--) {
if (seq[j - 1] > seq[j]) {
int tmp = seq[j];
... | #include <iostream>
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
int main() {
int N;
cin >> N;
int seq[N];
REP(i, N) cin >> seq[i];
int swap = 0;
for (int i = 0; i < N; i++) {
for (int j = N - 1; j > i; j--) {
if (seq[j - 1] > seq[j]) {
int tmp = seq[j];
... | [["+", 0, 7, 10, 43, 49, 50, 51, 16, 17, 33], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13]] | 1 | 167 | 2 |
#include <algorithm>
#include <iostream>
static const int N = 100000;
using namespace std;
int a[N];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int cnt = 0;
for (int i = 0; i < n; i++) {
for (int j = n - 1; j >= i + 1; j--) {
if (a[j] < a[j - 1]) {
s... | #include <algorithm>
#include <iostream>
static const int N = 10000;
using namespace std;
int a[N];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int cnt = 0;
for (int i = 0; i < n; i++) {
for (int j = n - 1; j >= i + 1; j--) {
if (a[j] < a[j - 1]) {
swa... | [["-", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 31, 22], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 31, 22]] | 1 | 190 | 4 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
int cnt = 0;
for (int i = 0; i < n; i++) {
for (int j = n; j >= i + 1; j--) {
if (arr[j] <= arr[j - 1]) {
cnt++;
swap(arr[j... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
int cnt = 0;
for (int i = 0; i < n; i++) {
for (int j = n - 1; j >= i + 1; j--) {
if (arr[j] < arr[j - 1]) {
cnt++;
swap(ar... | [["+", 0, 7, 10, 43, 49, 50, 51, 16, 17, 33], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18]] | 1 | 176 | 4 |
#include <iostream>
using namespace std;
const int MAX = 110;
int bubble_sort(int a[], int n) {
int count = 0;
for (int i = 0; i < n - 1; ++i) {
for (int j = n - 1; j > i + 1; --j) {
if (a[j] < a[j - 1]) {
int t = a[j];
a[j] = a[j - 1];
a[j - 1] = t;
++count;
}
... | #include <iostream>
using namespace std;
const int MAX = 110;
int bubble_sort(int a[], int n) {
int count = 0;
for (int i = 0; i < n - 1; ++i) {
for (int j = n - 1; j >= i + 1; --j) {
if (a[j] < a[j - 1]) {
int t = a[j];
a[j] = a[j - 1];
a[j - 1] = t;
++count;
}
... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 47], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 20]] | 1 | 213 | 2 |
#include <iostream>
using namespace std;
int bubblesort(int a[], int n) {
bool flag = 1;
int sw = 0;
for (int i = 0; flag; i++) {
flag = 0;
for (int j = n - 1; j >= i + 1; j--) {
if (a[j] < a[j - 1])
swap(a[j], a[j - 1]);
sw++;
flag = 1;
}
}
return sw;
}
int main() {
i... | #include <iostream>
using namespace std;
int bubblesort(int a[], int n) {
bool flag = 1;
int sw = 0;
for (int i = 0; flag; i++) {
flag = 0;
for (int j = n - 1; j >= i + 1; j--) {
if (a[j] < a[j - 1]) {
swap(a[j], a[j - 1]);
sw++;
flag = 1;
}
}
}
return sw;
}
in... | [["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 206 | 2 |
#include <iostream>
using namespace std;
int bubbleSort(int A[], int N) {
int sw = 0;
bool flag = 1;
for (int i = 0; flag; i++) {
flag = 0;
for (int j = N - 1; j >= i + 1; j--) {
if (A[j] < A[j - 1])
;
swap(A[j], A[j - 1]);
flag = 1;
sw++;
}
}
return sw;
}
int mai... | #include <iostream>
using namespace std;
int bubbleSort(int A[], int N) {
int sw = 0;
bool flag = 1;
for (int i = 0; flag; i++) {
flag = 0;
for (int j = N - 1; j >= i + 1; j--) {
if (A[j] < A[j - 1]) {
swap(A[j], A[j - 1]);
flag = 1;
sw++;
}
}
}
return sw;
}
i... | [["-", 0, 7, 8, 9, 0, 57, 64, 1, 0, 35], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 205 | 3 |
#include <bits/stdc++.h>
#define ll long long int
#define FOR(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define REP(i, n) FOR(i, 0, n)
#define REP1(i, n) FOR(i, 1, n)
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
int i, j, k, count, flag, temp;
REP(i, n) { cin >> a[i]; }
flag = 1;
co... | #include <bits/stdc++.h>
#define ll long long int
#define FOR(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define REP(i, n) FOR(i, 0, n)
#define REP1(i, n) FOR(i, 1, n)
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
int i, j, k, count, flag, temp;
REP(i, n) { cin >> a[i]; }
flag = 1;
co... | [["-", 0, 1, 0, 2, 3, 4, 0, 16, 17, 33], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["-", 0, 1, 0, 2, 3, 4, 0, 25, 0, 35]] | 1 | 208 | 3 |
#include <stdio.h>
#include <stdlib.h>
int main() {
int k, x, n, i, j, a[100];
k = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < n; i++) {
for (j = n; j > i; j--) {
if (a[j] < a[j - 1]) {
x = a[j];
a[j] = a[j - 1];
a[j - 1] = x;
... | #include <stdio.h>
#include <stdlib.h>
int main() {
int k, x, n, i, j, a[100];
k = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < n; i++) {
for (j = n - 1; j > i; j--) {
if (a[j] < a[j - 1]) {
x = a[j];
a[j] = a[j - 1];
a[j - 1] = x... | [["+", 8, 9, 0, 7, 10, 11, 12, 16, 17, 33], ["+", 8, 9, 0, 7, 10, 11, 12, 16, 12, 13], ["+", 3, 4, 0, 69, 341, 342, 0, 16, 17, 33], ["+", 3, 4, 0, 69, 341, 342, 0, 16, 12, 13]] | 1 | 194 | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> v;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
v.push_back(a);
}
int flag = 1, cnt = 0;
while (flag) {
flag = 0;
for (int j = N - 1; j >= 1; j--) {
if (v[j] < v[j - 1]) {
swap(v[j],... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> v;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
v.push_back(a);
}
int flag = 1, cnt = 0;
while (flag) {
flag = 0;
for (int j = N - 1; j >= 1; j--) {
if (v[j] < v[j - 1]) {
swap(v[j],... | [["+", 0, 7, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 8, 9, 0, 1, 0, 16, 12, 5, 0, 62], ["+", 8, 9, 0, 1, 0, 16, 12, 5, 0, 6]] | 1 | 183 | 4 |
#include <iostream>
using namespace std;
int bubblesort(int A[], int N) {
int sw = 0;
bool flag = 1;
for (int i = 0; flag; i++) {
flag = 0;
for (int j = N - 1; j >= i; j--) {
if (A[j - 1] > A[j]) {
swap(A[j - 1], A[j]);
flag = 1;
sw++;
}
}
}
return sw;
}
int m... | #include <iostream>
using namespace std;
int bubblesort(int A[], int N) {
int sw = 0;
bool flag = 1;
for (int i = 0; flag; i++) {
flag = 0;
for (int j = N - 1; j > i; j--) {
if (A[j - 1] > A[j]) {
swap(A[j - 1], A[j]);
flag = 1;
sw++;
}
}
}
return sw;
}
int ma... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 20], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 47]] | 1 | 204 | 2 |
#include <iostream>
using namespace std;
int bubbleSort(int A[], int N) {
int sw = 0;
bool flag = 1;
for (int i = 0; flag; i++) {
flag = 0;
for (int j = N - 1; j >= i; j--) {
if (A[j] < A[j - 1]) {
swap(A[j], A[j - 1]);
flag = 1;
sw++;
}
}
}
return sw;
}
int m... | #include <iostream>
using namespace std;
int bubbleSort(int A[], int N) {
int sw = 0;
bool flag = 1;
for (int i = 0; flag; i++) {
flag = 0;
for (int j = N - 1; j >= i + 1; j--) {
if (A[j] < A[j - 1]) {
swap(A[j], A[j - 1]);
flag = 1;
sw++;
}
}
}
return sw;
}
i... | [["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 72], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 203 | 2 |
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int N, A[100], flag, count = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
flag = 1;
while (flag) {
flag = 0;
for (int j = N - 1; j >= 1; j--) {
if (A[j] < A[j - 1]) {
swap(A[j], A[j - 1]);
c... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int N, A[100], flag, count = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
flag = 1;
while (flag) {
flag = 0;
for (int j = N - 1; j >= 1; j--) {
if (A[j] < A[j - 1]) {
swap(A[j], A[j - 1]);
c... | [["+", 0, 57, 64, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35]] | 1 | 170 | 4 |
#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); (i)++)
#define rept(i, n) for (int(i) = 0; (i) <= (int)(n); (i)++)
#define reps(i, s, n) for (int(i) = (s); (i) < (int)(n); (i)++)
#define repst(i, s, n) for (int(i) = (s); (i) <= (int)(n); (i)++)
#... | #include <bits/stdc++.h>
using namespace std;
//#define int long long
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); (i)++)
#define rept(i, n) for (int(i) = 0; (i) <= (int)(n); (i)++)
#define reps(i, s, n) for (int(i) = (s); (i) < (int)(n); (i)++)
#define repst(i, s, n) for (int(i) = (s); (i) <= (int)(n); (i)++)
#... | [["-", 0, 7, 8, 9, 0, 57, 64, 1, 0, 35], ["-", 0, 52, 8, 9, 0, 7, 8, 9, 0, 46], ["+", 0, 57, 64, 1, 0, 34, 12, 34, 0, 21], ["-", 0, 52, 8, 9, 0, 1, 0, 11, 17, 107], ["-", 0, 52, 8, 9, 0, 1, 0, 11, 12, 22], ["+", 64, 1, 0, 34, 12, 34, 12, 27, 17, 29], ["+", 0, 52, 8, 9, 0, 7, 8, 9, 0, 46]] | 1 | 438 | 7 |
#include <cstdio>
#include <iostream>
using namespace std;
//バブルソート in:配列、要素数 out:ソート回数
int bubble_sort(int *A, int N) {
int sw = 0;
int i, j;
bool flag = 1;
for (i = 0; flag; i++) {
flag = 0;
for (j = N; j >= i + 1; j--) {
if (A[j] < A[j - 1]) {
swap(A[j], A[j - 1]);
flag = 1;
... | #include <cstdio>
#include <iostream>
using namespace std;
//バブルソート in:配列、要素数 out:ソート回数
int bubble_sort(int *A, int N) {
int sw = 0;
int i, j;
bool flag = 1;
for (i = 0; flag; i++) {
flag = 0;
for (j = N - 1; j >= i + 1; j--) {
if (A[j] < A[j - 1]) {
swap(A[j], A[j - 1]);
flag = 1... | [["+", 8, 9, 0, 7, 10, 11, 12, 16, 17, 33], ["+", 8, 9, 0, 7, 10, 11, 12, 16, 12, 13]] | 1 | 235 | 2 |
#include <iostream>
using namespace std;
int bubbleSort(int A[], int N) {
int i, j;
bool flag = true;
int sw = 0;
for (i = 0; flag; i++) {
flag = false;
for (j = N - 1; j >= i; j--) {
if (A[j] < A[j - 1]) {
swap(A[j], A[j - 1]);
flag = true;
sw++;
}
}
}
retur... | #include <iostream>
using namespace std;
int bubbleSort(int A[], int N) {
int i, j;
bool flag = true;
int sw = 0;
for (i = 0; flag; i++) {
flag = false;
for (j = N - 1; j >= i + 1; j--) {
if (A[j] < A[j - 1]) {
swap(A[j], A[j - 1]);
flag = true;
sw++;
}
}
}
r... | [["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 72], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 207 | 2 |
#include <iostream>
using namespace std;
int main() {
int nNum = 0;
cin >> nNum;
int nArrIn[100] = {0};
for (int i = 0; i < nNum; ++i) {
cin >> nArrIn[i];
}
// Bubble
int nCount = 0;
for (int i = 0; i < nNum - 1; ++i) {
for (int j = nNum - 1; j > i + 1; --j) {
if (nArrIn[j] < nArrIn[j - 1... | #include <iostream>
using namespace std;
int main() {
int nNum = 0;
cin >> nNum;
int nArrIn[100] = {0};
for (int i = 0; i < nNum; ++i) {
cin >> nArrIn[i];
}
// Bubble
int nCount = 0;
for (int i = 0; i < nNum - 1; ++i) {
for (int j = nNum - 1; j >= i + 1; --j) {
if (nArrIn[j] < nArrIn[j - ... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 47], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 20]] | 1 | 181 | 2 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, A[100], ans = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> A[i];
}
for (int i = 0; i < n - 1; i++) {
for (int j = n - 1; j > i; j--) {
if (A[j] < A[j - 1]) {
swap(A[j], A[j - 1]);
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, A[100], ans = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> A[i];
}
for (int i = 0; i < n - 1; i++) {
for (int j = n - 1; j > i; j--) {
if (A[j] < A[j - 1]) {
swap(A[j], A[j - 1]);
... | [["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46], ["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46]] | 1 | 168 | 2 |
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int array[100];
bool flag = true;
int count = 0;
for (int i = 0; i < n; i++) {
cin >> array[i];
}
while (flag) {
flag = false;
for (int i = 0; i < n - 1; i++) {
if (array[i] < array[i + 1]) {
... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int array[100];
bool flag = true;
int count = 0;
for (int i = 0; i < n; i++) {
cin >> array[i];
}
while (flag) {
flag = false;
for (int i = 0; i < n - 1; i++) {
if (array[i] > array[i + 1]) {
... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47]] | 1 | 192 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x = 0, n, a[100];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
for (int j = n; j > i; j--) {
int tmp;
if (a[j] < a[j - 1]) {
tmp = a[j - 1];
a[j - 1] = a[j];
a[j] ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int x = 0, n, a[100];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
for (int j = n - 1; j > i; j--) {
int tmp;
if (a[j] < a[j - 1]) {
tmp = a[j - 1];
a[j - 1] = a[j];
a... | [["+", 0, 7, 10, 43, 49, 50, 51, 16, 17, 33], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13]] | 1 | 179 | 2 |
N = int(input())
A = list(map(int, input().split()))
count = 0
flag = True
while flag:
flag = False
for i in range(N-1, 1):
if(A[i] < A[i-1]):
A[i], A[i-1] = A[i-1], A[i]
flag = True
count += 1
print(*A)
print(count)
| N = int(input())
A = list(map(int, input().split()))
count = 0
flag = True
while flag:
flag = False
for i in range(N-1, 0, -1):
if(A[i] < A[i-1]):
A[i], A[i-1] = A[i-1], A[i]
flag = True
count += 1
print(*A)
print(count)
| [["+", 8, 196, 0, 7, 12, 652, 3, 4, 0, 612], ["+", 8, 196, 0, 7, 12, 652, 3, 4, 0, 21], ["+", 0, 7, 12, 652, 3, 4, 0, 664, 17, 33]] | 5 | 102 | 3 |
def main() :
n = int(input())
nums = [int(i) for i in input().split()]
flag = True
count = 0 # ?????¢??°
i = 0 # ?????????????????????????????????????????????
while flag :
flag = False # ?????????????????????????????£???????????????
for i in reversed(range(i, n)) :
i... | def main() :
n = int(input())
nums = [int(i) for i in input().split()]
flag = True
count = 0
index = 0
while flag :
flag = False
for i in reversed(range(index+1, n)) :
if nums[i-1] > nums[i] :
nums[i-1], nums[i] = nums[i], nums[i-1]
co... | [["-", 0, 14, 8, 196, 0, 1, 0, 662, 31, 22], ["+", 0, 14, 8, 196, 0, 1, 0, 662, 31, 22], ["-", 12, 652, 3, 4, 0, 652, 3, 4, 0, 22], ["+", 3, 4, 0, 652, 3, 4, 0, 657, 31, 22], ["+", 3, 4, 0, 652, 3, 4, 0, 657, 17, 72], ["+", 3, 4, 0, 652, 3, 4, 0, 657, 12, 612], ["-", 0, 52, 8, 196, 0, 1, 0, 677, 31, 22], ["+", 0, 52, 8... | 5 | 144 | 8 |
def bubbleSort(A, N):
s = 0
flag = 0
while flag == 0:
flag = 1
for j in range(N - 1, 0, -1):
if A[j] < A[j - 1]:
A[j], A[j - 1] = A[j - 1], A[j]
flag = 0
t += 1
t = str(A[0])
for i in range(1,N):
t = t + " " + str(A[... | def bubbleSort(A, N):
s = 0
flag = 0
while flag == 0:
flag = 1
for j in range(N - 1, 0, -1):
if A[j] < A[j - 1]:
A[j], A[j - 1] = A[j - 1], A[j]
flag = 0
s += 1
t = str(A[0])
for i in range(1,N):
t = t + " " + str(A[... | [["-", 0, 57, 64, 196, 0, 1, 0, 677, 31, 22], ["+", 0, 57, 64, 196, 0, 1, 0, 677, 31, 22]] | 5 | 153 | 2 |
def bubble_sort(A):
swap_cnt = 0
for i in range(len(A)):
for j in range(len(A) - 1, i + 1, -1):
if A[j] < A[j - 1]:
A[j], A[j - 1] = A[j - 1], A[j]
swap_cnt += 1
return A, swap_cnt
n = int(input())
A = list(map(int, input().split()))
A, swap_cnt = bubble... | def bubble_sort(A):
swap_cnt = 0
for i in range(len(A)):
for j in range(len(A) - 1, i, -1):
if A[j] < A[j - 1]:
A[j], A[j - 1] = A[j - 1], A[j]
swap_cnt += 1
return A, swap_cnt
n = int(input())
A = list(map(int, input().split()))
A, swap_cnt = bubble_sor... | [["-", 0, 7, 12, 652, 3, 4, 0, 657, 17, 72], ["-", 0, 7, 12, 652, 3, 4, 0, 657, 12, 612]] | 5 | 136 | 2 |
n = int(input())
a = list(map(int, input().split()))
flag = 1
count = 0
while flag:
flag = 0
for i in range(n-1,0,-1):
if a[i]<a[i-1]:
a[i],a[i-1] = a[i-1],a[i]
flag = 1
count+=1
print(count)
| n = int(input())
a = list(map(int, input().split()))
flag = 1
count = 0
while flag:
flag = 0
for i in range(n-1,0,-1):
if a[i]<a[i-1]:
a[i],a[i-1] = a[i-1],a[i]
flag = 1
count+=1
print(*a)
print(count)
| [["+", 0, 1, 0, 652, 3, 4, 0, 661, 0, 48], ["+", 0, 1, 0, 652, 3, 4, 0, 661, 0, 22], ["+", 0, 656, 0, 1, 0, 652, 3, 4, 0, 25], ["+", 36, 36, 0, 656, 0, 1, 0, 652, 63, 22], ["+", 0, 656, 0, 1, 0, 652, 3, 4, 0, 24]] | 5 | 98 | 5 |
def bubble_sort(ls):
flag=True
i=0
ch=0
while flag:
flag = False
for j in reversed(range(i+1,len(ls))):
if ls[j] < ls[j-1]:
ls[j],ls[j-1] = ls[j-1],ls[j]
flag = True
ch += 1
i += 1
return ch
if __name__ == "__main__... | def bubble_sort(ls):
flag=True
i=0
ch=0
while flag:
flag = False
for j in reversed(range(i+1,len(ls))):
if ls[j] < ls[j-1]:
ls[j],ls[j-1] = ls[j-1],ls[j]
flag = True
ch += 1
i += 1
return ch
if __name__ == "__main__... | [["+", 8, 196, 0, 57, 15, 666, 0, 657, 17, 33], ["+", 8, 196, 0, 57, 15, 666, 0, 657, 12, 612]] | 5 | 173 | 2 |
# リストの宣言
A = []
# 入力の最初の行に、数列の長さを表す整数 N が与えられます。
# 2 行目に、N 個の整数が空白区切りで与えられます。
LENGTH =int(input())
A = input().split()
# 変数
N = 0
M = LENGTH - 1
CHANGE = 0
# BubbleSort(A)
# for i = 0 to A.length-1
while N <= LENGTH -1 :
M = LENGTH - 1
# print ('N=',N)
# for j = A.length-1 downto i+1
while M >= N + ... | # リストの宣言
A = []
# 入力の最初の行に、数列の長さを表す整数 N が与えられます。
# 2 行目に、N 個の整数が空白区切りで与えられます。
LENGTH =int(input())
A = input().split()
# 変数
N = 0
M = LENGTH - 1
CHANGE = 0
# BubbleSort(A)
# for i = 0 to A.length-1
while N <= LENGTH -1 :
M = LENGTH - 1
# print ('N=',N)
# for j = A.length-1 downto i+1
while M >= N + ... | [["+", 8, 196, 0, 57, 15, 666, 0, 652, 63, 22], ["+", 0, 57, 15, 666, 0, 652, 3, 4, 0, 24], ["+", 0, 57, 15, 666, 0, 652, 3, 4, 0, 25]] | 5 | 128 | 6 |
input()
arr = list(map(int, input().split()))
flag = False
count = 0
while not flag:
flag = True
for i in range(len(arr)-1):
if arr[i] > arr[i+1]:
count + 1
flag = False
t = arr[i+1]
arr[i+1] = arr[i]
arr[i] = t
print(" ".join(map(str, arr)))... | input()
arr = list(map(int, input().split()))
flag = False
count = 0
while not flag:
flag = True
for i in range(len(arr)-1):
if arr[i] > arr[i+1]:
count += 1
flag = False
t = arr[i+1]
arr[i+1] = arr[i]
arr[i] = t
print(" ".join(map(str, arr))... | [["-", 0, 57, 64, 196, 0, 1, 0, 657, 17, 72], ["+", 0, 57, 64, 196, 0, 1, 0, 677, 17, 107]] | 5 | 110 | 2 |
import java.util.Scanner;
public class Main {
private static int N_MAX = 100;
static int[] a = new int[N_MAX];
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int n;
n = scan.nextInt();
int ans = 0;
for (int i = 0; i < n; i++) {
a[i] = scan.nextInt();
... | import java.util.Scanner;
public class Main {
private static int N_MAX = 100;
static int[] a = new int[N_MAX];
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int n;
n = scan.nextInt();
int ans = 0;
for (int i = 0; i < n; i++) {
a[i] = scan.nextInt();
... | [["-", 0, 7, 8, 196, 0, 1, 0, 492, 141, 22], ["+", 0, 7, 8, 196, 0, 1, 0, 492, 141, 22], ["+", 0, 1, 0, 492, 3, 4, 0, 16, 17, 72], ["+", 0, 492, 3, 4, 0, 16, 12, 5, 0, 62], ["+", 0, 492, 3, 4, 0, 16, 12, 5, 0, 491]] | 3 | 244 | 6 |
import java.util.Scanner;
public class Main {
static int selectionSort(int A[], int N) {
int count = 0;
for (int i = 0; i < N - 1; i++) {
int minj = i;
for (int j = i; j < N; j++) {
if (A[j] < A[minj]) {
minj = j;
}
}
int temp = A[i];
A[i] = A[minj];
... | import java.util.Scanner;
public class Main {
static int selectionSort(int A[], int N) {
int count = 0;
for (int i = 0; i < N - 1; i++) {
int minj = i;
for (int j = i; j < N; j++) {
if (A[j] < A[minj]) {
minj = j;
}
}
int temp = A[i];
A[i] = A[minj];
... | [["-", 0, 57, 64, 196, 0, 1, 0, 492, 141, 22], ["+", 0, 57, 64, 196, 0, 1, 0, 492, 141, 22], ["+", 0, 1, 0, 492, 3, 4, 0, 5, 0, 62], ["+", 0, 1, 0, 492, 3, 4, 0, 5, 0, 491], ["-", 0, 195, 8, 196, 0, 1, 0, 492, 141, 22], ["+", 0, 195, 8, 196, 0, 1, 0, 492, 141, 22]] | 3 | 272 | 7 |
import java.io.*;
import java.util.*;
public class Main {
public static void main(String args[]) {
Scanner scan = new Scanner(System.in);
SelectionSort sort = new SelectionSort(scan.nextInt());
sort.loadSequence(scan);
scan.close();
sort.sort();
System.out.println(sort);
System.out.print... | import java.io.*;
import java.util.*;
public class Main {
public static void main(String args[]) {
Scanner scan = new Scanner(System.in);
SelectionSort sort = new SelectionSort(scan.nextInt());
sort.loadSequence(scan);
scan.close();
sort.sort();
System.out.println(sort);
System.out.print... | [["-", 8, 196, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 196, 0, 7, 15, 16, 12, 16, 12, 499], ["+", 0, 7, 8, 196, 0, 7, 8, 196, 0, 45], ["+", 0, 7, 8, 196, 0, 7, 8, 196, 0, 46]] | 3 | 361 | 4 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.