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>
int selectionSort(int A[], int N) {
int i, j, t, sw = 0, minj;
for (i = 0; i < N - 1; i++) {
minj = 1;
for (j = i; j < N; j++) {
if (A[j] < A[minj]) {
minj = j;
}
}
t = A[i];
A[i] = A[minj];
A[minj] = t;
if (i != minj) {
sw++;
}
}
ret... | #include <stdio.h>
int selectionSort(int A[], int N) {
int i, j, t, sw = 0, minj;
for (i = 0; i < N - 1; i++) {
minj = i;
for (j = i; j < N; j++) {
if (A[j] < A[minj]) {
minj = j;
}
}
t = A[i];
A[i] = A[minj];
A[minj] = t;
if (i != minj) {
sw++;
}
}
ret... | [["-", 0, 7, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 12, 22]] | 1 | 247 | 2 |
#include <iostream>
using namespace std;
int SelectionSort(int A[], int N) {
int minj, tmp, cnt = 0;
for (int i = 0; i < N - 1; i++) {
minj = i;
for (int j = i; j < N; j++) {
if (A[j] < A[minj]) {
minj = j;
}
}
tmp = A[i];
A[i] = A[minj];
A[minj] = tmp;
if (i != mi... | #include <iostream>
using namespace std;
int SelectionSort(int A[], int N) {
int minj, tmp, cnt = 0;
for (int i = 0; i < N - 1; i++) {
minj = i;
for (int j = i; j < N; j++) {
if (A[j] < A[minj]) {
minj = j;
}
}
tmp = A[i];
A[i] = A[minj];
A[minj] = tmp;
if (i != mi... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 218 | 2 |
#include <iostream>
using namespace std;
int select(int *a, int num) {
int change = 0;
for (int i = 0; i < num; i++) {
int minj = i;
for (int j = i; j < num; j++) {
if (a[minj] > a[j])
minj = j;
}
if (i != minj)
change++;
swap(a[i], a[minj]);
}
for (int i = 0; i < num; i... | #include <iostream>
using namespace std;
int select(int *a, int num) {
int change = 0;
for (int i = 0; i < num; i++) {
int minj = i;
for (int j = i; j < num; j++) {
if (a[minj] > a[j])
minj = j;
}
if (i != minj)
change++;
swap(a[i], a[minj]);
}
for (int i = 0; i < num - ... | [["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 192 | 2 |
/* The original problem can be seen in
** http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_2_B
*/
#include <cstdio>
void printArray(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");
}
void b... | /* The original problem can be seen in
** http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_2_B
*/
#include <cstdio>
void printArray(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");
}
void b... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 274 | 2 |
#include <stdio.h>
int main(void) {
int cnt = 0;
int n;
scanf("%d", &n);
int x[n];
for (int i = 0; i < n; i++) {
scanf("%d", &x[i]);
}
for (int i = 0; i < n - 1; i++) {
int minj = i;
for (int j = i; j < n - 1; j++) {
if (x[j] < x[minj]) {
minj = j;
}
}
if (minj != ... | #include <stdio.h>
int main(void) {
int cnt = 0;
int n;
scanf("%d", &n);
int x[n];
for (int i = 0; i < n; i++) {
scanf("%d", &x[i]);
}
for (int i = 0; i < n; i++) {
int minj = i;
for (int j = i; j < n; j++) {
if (x[j] < x[minj]) {
minj = j;
}
}
if (minj != i) {
... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 209 | 4 |
#include <iostream>
using namespace std;
// ?????????????????????????????????????????°
int selectionSort(int A[], int N) {
int sw = 0;
for (int i = 0; i < N; i++) {
int minj = i;
for (int j = i; i < N; j++) {
if (A[j] < A[minj])
minj = j;
}
if (i != minj) {
swap(A[i], A[minj]);
... | #include <iostream>
using namespace std;
// ?????????????????????????????????????????°
int selectionSort(int A[], int N) {
int sw = 0;
for (int i = 0; i < N; i++) {
int minj = i;
for (int j = i; j < N; j++) {
if (A[j] < A[minj])
minj = j;
}
if (i != minj) {
swap(A[i], A[minj]);
... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 31, 22], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 31, 22]] | 1 | 199 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int N, t = 0;
cin >> N;
vector<int> v(N);
for (int i = 0; i < N; i++)
cin >> v[i];
for (int i = 0; i < N - 1; i++) {
int min = i;
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int N, t = 0;
cin >> N;
vector<int> v(N);
for (int i = 0; i < N; i++)
cin >> v[i];
for (int i = 0; i < N; i++) {
int min = i;
fo... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 208 | 4 |
#include <algorithm>
#include <stdio.h>
using namespace std;
int n, c, a[100];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
for (int i = 0; i < n; i++) {
int k = i;
for (int j = i + 1; j < n; j++) {
if (a[k] > a[j])
k = j;
}
if (k != i)
swap... | #include <algorithm>
#include <stdio.h>
using namespace std;
int n, c, a[100];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
for (int i = 0; i < n; i++) {
int k = i;
for (int j = i + 1; j < n; j++) {
if (a[k] > a[j])
k = j;
}
if (k != i)
swap... | [["-", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67]] | 1 | 198 | 1 |
#include <iostream>
using namespace std;
int main() {
int N, minv, *Ap, sw = 0;
cin >> N;
Ap = new int[N];
for (int i = 0; i < N; i++)
cin >> Ap[i];
for (int i = 0; i < N - 1; i++) {
minv = i;
for (int j = i; j < N - 1; j++) {
if (Ap[j] < Ap[minv]) {
minv = j;
}
}
if ... | #include <iostream>
using namespace std;
int main() {
int N, minv, *Ap, sw = 0;
cin >> N;
Ap = new int[N];
for (int i = 0; i < N; i++)
cin >> Ap[i];
for (int i = 0; i < N - 1; i++) {
minv = i;
for (int j = i; j < N; j++) {
if (Ap[j] < Ap[minv]) {
minv = j;
}
}
if (min... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 184 | 2 |
#include <stdio.h>
main() {
int n, A[100], mini, cnt = 0, x;
int i, j;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
for (i = 0; i < n; i++) {
mini = i;
for (j = i; j < n; j++) {
if (A[j] < A[mini]) {
mini = j;
}
if (mini != i) {
x = A[i];
... | #include <stdio.h>
main() {
int n, A[100], mini, cnt = 0, x;
int i, j;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
for (i = 0; i < n; i++) {
mini = i;
for (j = i; j < n; j++) {
if (A[j] < A[mini]) {
mini = j;
}
}
if (mini != i) {
x = A[i];
... | [["+", 0, 7, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 201 | 2 |
#include <iostream>
using namespace std;
static const int N = 100;
void trace(int A[], int n) {
for (int i = 0; i < n; i++) {
if (i > 0)
cout << " ";
cout << A[i];
}
cout << endl;
}
void SelectionSort(int A[], int n) {
int i, j, minj, cnt, tmp;
for (i = 0; i < n; i++) {
minj = i;
for (j ... | #include <iostream>
using namespace std;
static const int N = 100;
void trace(int A[], int n) {
for (int i = 0; i < n; i++) {
if (i > 0)
cout << " ";
cout << A[i];
}
cout << endl;
}
void SelectionSort(int A[], int n) {
int i, j, minj, cnt = 0, tmp;
for (i = 0; i < n - 1; i++) {
minj = i;
... | [["+", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 244 | 4 |
#include <iostream>
#include <stdio.h>
using namespace std;
int selectinsert(int A[], int n) {
int i, j, minv, sw;
for (i = 0; i < n - 1; i++) {
minv = i;
for (j = i; n > j; j++) {
if (A[minv] > A[j]) {
minv = j;
}
}
swap(A[i], A[minv]);
if (i != minv) {
sw += 1;
}... | #include <iostream>
#include <stdio.h>
using namespace std;
int selectinsert(int A[], int n) {
int i, j, minv;
int sw = 0;
for (i = 0; i < n - 1; i++) {
minv = i;
for (j = i; n > j; j++) {
if (A[minv] > A[j]) {
minv = j;
}
}
swap(A[i], A[minv]);
if (i != minv) {
sw +... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 238 | 5 |
#include <stdio.h>
int selectionSort(int A[], int N) {
int i, j, t, sw = 0, minj;
for (i = 0; i < N - 1; i++) {
minj = i;
for (j = i; j < N; j++) {
if (A[j] < A[minj])
minj = j;
}
t = A[i];
A[i] = A[minj];
A[minj] = t;
if (i != minj)
sw++;
}
return sw;
}
int main... | #include <stdio.h>
int selectionSort(int A[], int N) {
int i, j, t, sw = 0, minj;
for (i = 0; i < N - 1; i++) {
minj = i;
for (j = i; j < N; j++) {
if (A[j] < A[minj])
minj = j;
}
t = A[i];
A[i] = A[minj];
A[minj] = t;
if (i != minj)
sw++;
}
return sw;
}
int main... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22]] | 1 | 240 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int minj, cnt = 0, N, A[100];
cin >> N;
for (int i = 0; i < N; i++)
cin >> A[i];
for (int i = 0; i < N; i++) {
minj = i;
for (int j = 0; j < N; j++) {
if (A[j] < A[minj])
minj = j;
}
if (minj != i) {
... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int minj, cnt = 0, N, A[100];
cin >> N;
for (int i = 0; i < N; i++)
cin >> A[i];
for (int i = 0; i < N; i++) {
minj = i;
for (int j = i; j < N; j++) {
if (A[j] < A[minj])
minj = j;
}
if (minj != i) {
... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 22]] | 1 | 174 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, flag = 0, min;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++) {
min = a[i];
for (int j = i; j < n; j++) {
if (a[j] < a[min])
min = j;
if (j == n - 1 && i != min) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, flag = 0, min;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++) {
min = i;
for (int j = i; j < n; j++) {
if (a[j] < a[min])
min = j;
if (j == n - 1 && i != min) {
s... | [["-", 8, 9, 0, 1, 0, 11, 12, 69, 28, 22], ["-", 0, 1, 0, 11, 12, 69, 341, 342, 0, 70], ["-", 0, 1, 0, 11, 12, 69, 341, 342, 0, 73]] | 1 | 175 | 3 |
#include <iostream>
using namespace std;
int selectionSort(int A[], int N) {
int sw = 0;
for (int i = 0; i < N - 1; i++) {
int min = i;
for (int j = i; j < N; j++) {
if (A[j] < A[min])
min = j;
}
swap(min, A[i]);
if (i != min)
sw++;
}
return sw;
}
int main() {
int A[... |
#include <iostream>
using namespace std;
int selectionSort(int A[], int N) {
int sw = 0;
for (int i = 0; i < N - 1; i++) {
int min = i;
for (int j = i; j < N; j++) {
if (A[j] < A[min])
min = j;
}
swap(A[min], A[i]);
if (i != min)
sw++;
}
return sw;
}
int main() {
int... | [["+", 0, 1, 0, 2, 3, 4, 0, 69, 28, 22], ["+", 0, 2, 3, 4, 0, 69, 341, 342, 0, 70], ["+", 0, 2, 3, 4, 0, 69, 341, 342, 0, 73], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22]] | 1 | 198 | 5 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a[100], n, min, temp = 0;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++) {
min = i;
for (int j = i; j < n; j++) {
if (a[j] < a[min]) {
min = j;
}
}
if (i != min)... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a[100], n, min, temp = 0;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++) {
min = i;
for (int j = i; j < n; j++) {
if (a[j] < a[min]) {
min = j;
}
}
if (i != min)... | [["+", 0, 1, 0, 16, 31, 16, 31, 16, 12, 22], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 17, 151]] | 1 | 174 | 2 |
#include <iostream>
using namespace std;
int main() {
int N, A[100];
cin >> N;
for (int i = 0; i < N; i++)
cin >> A[i];
int count = 0;
for (int i = 0; i < N; i++) {
int minj = i;
for (int j = i; j < N; j++) {
if (A[j] < A[minj]) {
minj = j;
}
}
if (i != minj) {
... | #include <iostream>
using namespace std;
int main() {
int N, A[100];
cin >> N;
for (int i = 0; i < N; i++)
cin >> A[i];
int count = 0;
for (int i = 0; i < N; i++) {
int minj = i;
for (int j = i; j < N; j++) {
if (A[j] < A[minj]) {
minj = j;
}
}
if (i != minj) {
... | [["-", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22]] | 1 | 171 | 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... | [["+", 8, 9, 0, 1, 0, 16, 12, 103, 0, 104], ["+", 8, 9, 0, 1, 0, 16, 12, 103, 0, 44], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 31, 22], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 17, 151]] | 1 | 270 | 6 |
#include <stdio.h>
int selectionSort(int A[], int N) {
int i, j, t, sw = 0, minj;
for (i = 0; i < N - 1; i++) {
minj = i;
for (j = i; j < N; j++) {
if (A[j] < A[minj])
minj = j;
}
t = A[minj];
A[minj] = A[i];
A[i] = t;
if (i != minj)
sw++;
}
return sw;
}
int mai... | #include <stdio.h>
int selectionSort(int A[], int N) {
int i, j, t, sw = 0, minj;
for (i = 0; i < N; i++) {
minj = i;
for (j = i; j < N; j++) {
if (A[j] < A[minj])
minj = j;
}
t = A[minj];
A[minj] = A[i];
A[i] = t;
if (i != minj)
sw++;
}
return sw;
}
int main() ... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["+", 8, 1, 0, 2, 3, 4, 0, 66, 17, 67]] | 1 | 238 | 3 |
#include <iostream>
using namespace std;
void hoandoi(int &c, int &b) {
int t = c;
c = b;
b = t;
}
int main() {
int n, *a, d = 0, min;
cin >> n;
a = new int[n];
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n - 1; i++) {
min = i;
for (int j = i + 1; j < n; j++) {
if (a[... | #include <iostream>
using namespace std;
void hoandoi(int &c, int &b) {
int t = c;
c = b;
b = t;
}
int main() {
int n, *a, d = 0, min;
cin >> n;
a = new int[n];
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n - 1; i++) {
min = i;
for (int j = i + 1; j < n; j++) {
if (a[... | [["-", 15, 339, 51, 16, 12, 69, 341, 342, 0, 22], ["+", 15, 339, 51, 16, 12, 69, 341, 342, 0, 22]] | 1 | 213 | 2 |
#include <algorithm>
#include <climits>
#include <cstdio>
#include <functional>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <vector>
#define int long long
using namespace std;
int b[100];
signed main() {
int a;
... | #include <algorithm>
#include <climits>
#include <cstdio>
#include <functional>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <vector>
#define int long long
using namespace std;
int b[100];
signed main() {
int a;
... | [["+", 0, 7, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 7, 8, 9, 0, 7, 8, 9, 0, 46]] | 1 | 200 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b[100], B[100], c, d = 0;
cin >> a;
for (int i = 0; i < a; i++) {
cin >> b[i];
B[i] = b[i];
}
sort(B, B + a);
for (int i = 0; i < a; i++) {
for (int j = i; j < a; j++) {
if (b[j] == B[i]) {
if (i == j) {
c... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b[100], B[100], c, d = 0;
cin >> a;
for (int i = 0; i < a; i++) {
cin >> b[i];
B[i] = b[i];
}
sort(B, B + a);
for (int i = 0; i < a; i++) {
for (int j = i; j < a; j++) {
if (b[j] == B[i]) {
if (i == j) {
b... | [["-", 64, 9, 0, 57, 64, 9, 0, 116, 0, 117], ["+", 64, 9, 0, 57, 64, 9, 0, 93, 0, 94]] | 1 | 214 | 2 |
#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;
int minj = 0;
for (int i = 0; i < n; i++) {
int minj = i;
for (int j = i + 1; j < n; j++) {
if (a[... | #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;
int minj = 0;
for (int i = 0; i < n; i++) {
int minj = i;
for (int j = i + 1; j < n; j++) {
if (a[... | [["-", 0, 57, 64, 9, 0, 1, 0, 11, 12, 22], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 12, 22]] | 1 | 206 | 2 |
#include <iostream>
#include <stdio.h>
#include <utility>
using namespace std;
int sort(int a[], int n);
int main(void) {
int n, a[100];
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
int num = sort(a, n);
for (int i = 0; i < n; i++) {
cout << a[i];
if (i < n - 1)
cout << " ";
el... | #include <iostream>
#include <stdio.h>
#include <utility>
using namespace std;
int sort(int a[], int n);
int main(void) {
int n, a[100];
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
int num = sort(a, n);
for (int i = 0; i < n; i++) {
cout << a[i];
if (i < n - 1)
cout << " ";
el... | [["-", 0, 2, 3, 4, 0, 69, 341, 342, 0, 22], ["+", 0, 2, 3, 4, 0, 69, 341, 342, 0, 22]] | 1 | 225 | 2 |
#include <algorithm>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef signed long long ll;
int main(void) {
int N = 5;
int count = 0;
cin >> N;
// int array[5] = {1,2,3,4,5};
vector<int> A(N, 0);
// vector<int> ... | #include <algorithm>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef signed long long ll;
int main(void) {
int N = 5;
int count = 0;
cin >> N;
// int array[5] = {1,2,3,4,5};
vector<int> A(N, 0);
// vector<int> ... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 214 | 4 |
#include <stdio.h>
int selectionSort(int A[], int N) {
int i, j, t, sw = 0, mini;
for (i = 0; i < N - 1; i++) {
mini = i;
for (j = i; j < N; j++) {
if (A[j] < A[mini])
mini = j;
}
t = A[i];
A[i] = A[mini];
A[mini] = t;
if (i != mini)
sw++;
}
return sw;
}
int mai... | #include <stdio.h>
int selectionSort(int A[], int N) {
int i, j, t, sw = 0, mini;
for (i = 0; i < N - 1; i++) {
mini = i;
for (j = i; j < N; j++) {
if (A[j] < A[mini])
mini = j;
}
t = A[i];
A[i] = A[mini];
A[mini] = t;
if (i != mini)
sw++;
}
return sw;
}
int mai... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 1 | 242 | 2 |
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int count = 0;
for (int i = 0; i < n; i++) {
int min_idx = i;
for (int j = i; j < n; j++) {
if (a[min_idx] > a[j]) {
min_idx = j;
}
}
if (min_idx... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int count = 0;
for (int i = 0; i < n; i++) {
int min_idx = i;
for (int j = i; j < n; j++) {
if (a[min_idx] > a[j]) {
min_idx = j;
}
}
if (min_idx... | [["+", 0, 16, 12, 69, 341, 342, 0, 16, 17, 33], ["+", 0, 16, 12, 69, 341, 342, 0, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22]] | 1 | 176 | 4 |
#include <iostream>
using namespace std;
int selectionSort(int A[], int N) {
int sw = 0;
int minj;
for (int i = 0; i < N; i++) {
minj = i;
for (int j = i; j < N - 1; j++) {
if (A[j] < A[minj]) {
minj = j;
}
}
swap(A[minj], A[i]);
if (i != minj)
sw++;
}
return sw... | #include <iostream>
using namespace std;
int selectionSort(int A[], int N) {
int sw = 0;
int minj;
for (int i = 0; i < N - 1; i++) {
minj = i;
for (int j = i; j < N; j++) {
if (A[j] < A[minj]) {
minj = j;
}
}
swap(A[minj], A[i]);
if (i != minj)
sw++;
}
return sw... | [["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 204 | 4 |
#include <iostream>
int main() {
const int MAX = 100;
using namespace std;
int n, i, j, index, temp, A[MAX], count;
count = 0;
cin >> n;
for (i = 0; i < n; i++)
cin >> A[i];
for (i = 0; i < n - 1; i++) {
index = i;
for (j = i; j < n; j++)
if (A[j] < A[index])
index = j;
temp ... | #include <iostream>
int main() {
const int MAX = 100;
using namespace std;
int n, i, j, index, temp, A[MAX], count;
count = 0;
cin >> n;
for (i = 0; i < n; i++)
cin >> A[i];
for (i = 0; i < n; i++) {
index = i;
for (j = i; j < n; j++)
if (A[j] < A[index])
index = j;
temp = A[... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["+", 0, 1, 0, 16, 31, 16, 31, 16, 17, 151], ["+", 0, 1, 0, 16, 31, 16, 31, 16, 12, 22]] | 1 | 196 | 4 |
/*
* ITP1_6_B.cpp
*
* Created on: Apr 20, 2018
* Author: 13743
*/
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int n;
int a[100];
int cnt = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
int mini = i;
for (int j ... | /*
* ITP1_6_B.cpp
*
* Created on: Apr 20, 2018
* Author: 13743
*/
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int n;
int a[100];
int cnt = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
int mini = i;
for (int j ... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 31, 22], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 31, 22], ["-", 0, 7, 8, 9, 0, 7, 26, 27, 28, 22], ["+", 0, 7, 8, 9, 0, 7, 26, 27, 28, 22]] | 1 | 193 | 4 |
#include <stdio.h>
void PrintArray(int a[], int N) {
int i;
for (i = 0; i < N; i++) {
printf("%d", a[i]);
if (!(i - N + 1))
break;
printf(" ");
}
printf("\n");
}
void swap(int a[], int i, int j) {
int buff = a[i];
a[i] = a[j];
a[j] = buff;
}
void SelectionSort(int a[], int N) {
int ... | #include <stdio.h>
void PrintArray(int a[], int N) {
int i;
for (i = 0; i < N; i++) {
printf("%d", a[i]);
if (!(i - N + 1))
break;
printf(" ");
}
printf("\n");
}
void swap(int a[], int i, int j) {
int buff = a[i];
a[i] = a[j];
a[j] = buff;
}
void SelectionSort(int a[], int N) {
int ... | [["-", 0, 7, 10, 43, 49, 50, 51, 16, 31, 22], ["-", 0, 7, 10, 43, 49, 50, 51, 16, 17, 33], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 31, 22], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 17, 72], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 47], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9... | 1 | 285 | 10 |
#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;
}
int selection_sort(int a[], int n) {
auto swap_count = 0;
for (int i = 0; i < n - 1; ++i) {
auto min_index = i;
fo... | #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;
}
int selection_sort(int a[], int n) {
auto swap_count = 0;
for (int i = 0; i < n; ++i) {
auto min_index = i;
for (i... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 246 | 4 |
#include <stdio.h>
int selectionSort(int A[], int N) {
int minj;
int sw = 0;
int i, j, v;
for (i = 0; i < N - 1; i++) {
minj = i;
for (j = i; j < N; j++) {
if (A[j] < A[minj]) {
minj = j;
}
v = A[i];
A[i] = A[minj];
A[minj] = v;
}
if (i != minj)
sw++;... | #include <stdio.h>
int selectionSort(int A[], int N) {
int minj;
int sw = 0;
int i, j, v;
for (i = 0; i < N; i++) {
minj = i;
for (j = i; j < N; j++) {
if (A[j] < A[minj]) {
minj = j;
}
}
v = A[i];
A[i] = A[minj];
A[minj] = v;
if (i != minj)
sw++;
}
ret... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 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, 7, 8, 9, 0, 46]] | 1 | 243 | 4 |
n = gets.to_i
array = gets.split.map(&:to_i)
cnt = 0
for i in 0..n-1
indexMin = i
for k in i..n-1
if array[k] < array[indexMin]
indexMin = k
end
end
array[i],array[indexMin] = array[indexMin],array[i]
if i != indexMin
cnt += 1
end
end
p array.join(" ")
puts cnt | n = gets.to_i
array = gets.split.map(&:to_i)
cnt = 0
for i in 0..n-1
indexMin = i
for k in i..n-1
if array[k] < array[indexMin]
indexMin = k
end
end
array[i],array[indexMin] = array[indexMin],array[i]
if i != indexMin
cnt += 1
end
end
puts array.join(" ")
puts cnt | [["-", 36, 36, 36, 36, 0, 493, 0, 652, 735, 22], ["+", 36, 36, 36, 36, 0, 493, 0, 652, 735, 22]] | 4 | 92 | 2 |
$swap = 0
def Swap(a, b)
$swap += 1
return b,a
end
gets
d = gets.chomp.split(" ").map &:to_i
d.length.times { |i|
min = i
(i...d.length).each_with_index { |j|
min = j if d[min] > d[j]
}
d[i],d[min] = Swap(d[i],d[min])
}
d.length.times { |i|
print " " unless i == 0
print "#{d[i]}"
}
print "\n#{$swap}\n" | $swap = 0
def Swap(a, b)
$swap += 1
return b,a
end
gets
d = gets.chomp.split(" ").map &:to_i
d.length.times { |i|
min = i
(i...d.length).each_with_index { |j|
min = j if d[min] > d[j]
}
d[i],d[min] = Swap(d[i],d[min]) if i != min
}
d.length.times { |i|
print " " unless i == 0
print "#{d[i]}"
}
print "\n#{... | [["+", 0, 652, 196, 196, 8, 734, 0, 751, 0, 121], ["+", 196, 196, 8, 734, 0, 751, 15, 738, 31, 22], ["+", 196, 196, 8, 734, 0, 751, 15, 738, 17, 79], ["+", 196, 196, 8, 734, 0, 751, 15, 738, 12, 22]] | 4 | 132 | 4 |
n = gets.chomp.to_i
array = gets.chomp.split.map(&:to_i)
count = 0
for i in 0..n-1
min = i
for j in i..n-1
if arr[j] = arr[i+1..n-1].min && arr[j] < arr[min]
min = j
arr[i],arr[min] = arr[min],arr[i]
count += 1
end
min = i
end
end
puts arr.join(" ")
puts count | n = gets.chomp.to_i
arr = gets.chomp.split.map(&:to_i)
count = 0
for i in 0..n-1
min = i
for j in i..n-1
if arr[j] == arr[i+1..n-1].min && arr[j] < arr[min]
min = j
arr[i],arr[min] = arr[min],arr[i]
count += 1
end
min = i
end
end
puts arr.join(" ... | [["-", 36, 36, 36, 36, 0, 493, 0, 662, 31, 22], ["+", 36, 36, 36, 36, 0, 493, 0, 662, 31, 22], ["-", 0, 88, 8, 170, 0, 121, 15, 662, 0, 32], ["+", 8, 170, 0, 121, 15, 738, 31, 738, 17, 60]] | 4 | 112 | 4 |
input = []
while (n = gets.to_i) != 0 do
input = gets.split.map(&:to_i)
end
n = input.size
count = 0
for i in 0..n-1 do
min_j = i
for j in i..n-1 do
min_j = j if input[j] < input[min_j]
end
break if input[min_j] == input[i]
tmp = input[min_j]
input[min_j] = input[i]
input[i] = tmp
count += 1
end... | # 選択ソート(最小のものを先頭に追加していくイメージ。)
input = []
while (n = gets.to_i) != 0 do
input = gets.split.map(&:to_i)
end
n = input.size
count = 0
for i in 0..n-1 do
min_j = i
for j in i..n-1 do
min_j = j if input[j] < input[min_j]
end
if input[min_j] != input[i]
tmp = input[min_j]
input[min_j] = input[i]
i... | [["-", 0, 88, 8, 170, 0, 751, 8, 94, 0, 94], ["-", 0, 88, 8, 170, 0, 751, 15, 738, 17, 60], ["+", 0, 88, 8, 170, 0, 121, 15, 738, 17, 79], ["+", 0, 493, 0, 88, 8, 170, 0, 121, 0, 444]] | 4 | 114 | 4 |
n=int(input())
a=list(map(int,input().split()))
c=0
for i in range(n):
minj=i
for j in range(i,n):
if a[j]<a[minj]:
minj=j
a[i],a[minj]=a[minj],a[i]
c+=1
print(*a)
print(c)
| n=int(input())
a=list(map(int,input().split()))
c=0
for i in range(n):
minj=i
for j in range(i,n):
if a[j]<a[minj]:
minj=j
a[i],a[minj]=a[minj],a[i]
if i!=minj:c+=1
print(*a)
print(c)
| [["+", 0, 656, 0, 7, 8, 196, 0, 57, 0, 121], ["+", 0, 7, 8, 196, 0, 57, 15, 666, 0, 22], ["+", 0, 7, 8, 196, 0, 57, 15, 666, 667, 79], ["+", 0, 656, 0, 7, 8, 196, 0, 57, 0, 102]] | 5 | 94 | 5 |
def selectionSort(a, n):
count = 0
for i in range(0, n):
minj = i
for j in range(i, n):
if a[j] < a[minj]:
minj = j
w = a[i]
a[i] = a[minj]
a[minj] = w
count += 1
print(' '.join(map(str, a)))
print(count)
n = int(input())
a = list(map(int, input().split()))
selectionSort(a... | def selectionSort(a, n):
count = 0
for i in range(0, n):
minj = i
for j in range(i, n):
if a[j] < a[minj]:
minj = j
if i != minj:
w = a[i]
a[i] = a[minj]
a[minj] = w
count += 1
print(' '.join(map(str, a)))
print(count)
n = int(input())
a = list(map(int, input()... | [["+", 8, 196, 0, 7, 8, 196, 0, 57, 0, 121], ["+", 0, 7, 8, 196, 0, 57, 15, 666, 0, 22], ["+", 0, 7, 8, 196, 0, 57, 15, 666, 667, 79], ["+", 8, 196, 0, 7, 8, 196, 0, 57, 0, 102]] | 5 | 123 | 5 |
# inputList = list(map(int, '''6
# 5 6 4 2 1 3'''.split()))
# N = inputList.pop(0)
def formatting(nums):
for i in range(len(nums)):
if i != len(nums) - 1:
print(nums[i], end=' ')
else:
print(nums[i])
def selectionSort(A, N):
count = 0
for i in range(N - 1):
... | # inputList = list(map(int, '''6
# 5 6 4 2 1 3'''.split()))
# N = inputList.pop(0)
def formatting(nums):
for i in range(len(nums)):
if i != len(nums) - 1:
print(nums[i], end=' ')
else:
print(nums[i])
def selectionSort(A, N):
count = 0
for i in range(N - 1):
... | [["+", 8, 196, 0, 7, 8, 196, 0, 57, 0, 121], ["+", 0, 7, 8, 196, 0, 57, 15, 666, 0, 22], ["+", 0, 7, 8, 196, 0, 57, 15, 666, 667, 79], ["+", 8, 196, 0, 7, 8, 196, 0, 57, 0, 102]] | 5 | 161 | 5 |
package main
import (
"bufio"
"fmt"
"os"
"strconv"
"strings"
)
func SelectionSort(buf []int) int {
count := 0
for i := 0; i < len(buf)-1; i++ {
min := buf[i]
index := i
for j := i + 1; j < len(buf); j++ {
if min > buf[j] {
min = buf[j]
index = j
}
if i != index {
buf[i], buf[j] = bu... | package main
import (
"bufio"
"fmt"
"os"
"strconv"
"strings"
)
func SelectionSort(buf []int) int {
count := 0
for i := 0; i < len(buf)-1; i++ {
min := buf[i]
index := i
for j := i + 1; j < len(buf); j++ {
if min > buf[j] {
min = buf[j]
index = j
}
}
if i != index {
buf[i], buf[inde... | [["-", 0, 435, 8, 196, 0, 7, 8, 196, 0, 165], ["+", 0, 435, 8, 196, 0, 7, 8, 196, 0, 165], ["+", 0, 7, 8, 196, 0, 7, 8, 196, 0, 46], ["-", 64, 196, 0, 436, 31, 432, 0, 437, 71, 22], ["+", 64, 196, 0, 436, 31, 432, 0, 437, 71, 22], ["-", 64, 196, 0, 436, 12, 432, 0, 437, 71, 22], ["+", 64, 196, 0, 436, 12, 432, 0, 437, ... | 7 | 308 | 10 |
(function(input) {
var p = input.split('\n');
var n = p.shift();
var a = p.shift().split(' ', n);
var c1 = [].concat(a);
var c2 = [].concat(a);
sortBubble(c1);
console.log(check(c1, a) ? 'Stable' : 'Not Stable');
sortSelection(c2);
console.log(check(c2, a) ? 'Stable' : 'Not Stable');
})(require('fs').readFileSync('/dev... | (function(input) {
var p = input.split('\n');
var n = p.shift();
var a = p.shift().split(' ', n);
var c1 = [].concat(a);
var c2 = [].concat(a);
sortBubble(c1);
console.log(check(c1, a) ? 'Stable' : 'Not stable');
sortSelection(c2);
console.log(check(c2, a) ? 'Stable' : 'Not stable');
})(require('fs').readFileSync('/dev... | [["-", 0, 2, 3, 3, 0, 510, 75, 557, 0, 491], ["+", 0, 2, 3, 3, 0, 510, 75, 557, 0, 491]] | 2 | 527 | 4 |
<?php
fscanf(STDIN, '%d', $N);
$line = trim(fgets(STDIN));
$arr = explode(' ', $line);
$bubbleArr = BubbleSort($arr,$N);
echo(implode(' ',$bubbleArr).PHP_EOL."Stable".PHP_EOL);
$selectionArr = SelectionSort($arr,$N);
echo implode(" ",$selectionArr) . PHP_EOL;
isStable($bubbleArr, $selectionArr);
function BubbleSort($... | <?php
fscanf(STDIN, '%d', $N);
$line = trim(fgets(STDIN));
$arr = explode(' ', $line);
$bubbleArr = BubbleSort($arr,$N);
echo(implode(' ',$bubbleArr).PHP_EOL."Stable".PHP_EOL);
$selectionArr = SelectionSort($arr,$N);
echo implode(" ",$selectionArr) . PHP_EOL;
isStable($bubbleArr, $selectionArr);
function BubbleSort($... | [["-", 0, 608, 0, 23, 0, 16, 31, 609, 0, 610], ["+", 0, 608, 0, 23, 0, 16, 31, 609, 0, 610]] | 6 | 414 | 2 |
import java.util.*;
public class Main {
public static void main(String[] args) {
int total;
Scanner inp = new Scanner(System.in);
total = inp.nextInt();
String[] b = new String[total];
String[] c = new String[total];
for (int k = 0; k < total; k++) {
String a = inp.next();
b[k... | import java.util.*;
public class Main {
public static void main(String[] args) {
int total;
Scanner inp = new Scanner(System.in);
total = inp.nextInt();
String[] b = new String[total];
String[] c = new String[total];
for (int k = 0; k < total; k++) {
String a = inp.next();
b[k... | [["-", 0, 57, 64, 196, 0, 1, 0, 492, 141, 22], ["+", 0, 57, 64, 196, 0, 1, 0, 492, 141, 22], ["-", 0, 57, 75, 196, 0, 1, 0, 492, 141, 22], ["+", 0, 57, 75, 196, 0, 1, 0, 492, 141, 22], ["-", 0, 492, 3, 4, 0, 16, 12, 5, 0, 491], ["+", 0, 492, 3, 4, 0, 16, 12, 5, 0, 491]] | 3 | 510 | 6 |
import java.util.*;
class Main {
public static void main(String[] args) {
Scanner stdIn = new Scanner(System.in);
int n = stdIn.nextInt();
String[] ary_b = new String[n];
for (int i = 0; i < n; i++) {
ary_b[i] = stdIn.next();
}
String[] ary_s = ary_b.clone();
String[] cards = new S... | import java.util.*;
class Main {
public static void main(String[] args) {
Scanner stdIn = new Scanner(System.in);
int n = stdIn.nextInt();
String[] ary_b = new String[n];
for (int i = 0; i < n; i++) {
ary_b[i] = stdIn.next();
}
String[] ary_s = ary_b.clone();
String[] cards = new S... | [["+", 0, 1, 0, 11, 31, 504, 71, 16, 17, 33], ["+", 0, 1, 0, 11, 31, 504, 71, 16, 12, 499], ["-", 0, 7, 15, 16, 12, 492, 500, 504, 71, 22], ["+", 0, 7, 15, 16, 12, 492, 500, 504, 71, 22]] | 3 | 567 | 4 |
import java.io.*;
import java.util.*;
class Main {
//読み込みのテンプレ(stringオブジェクトまで)
static int N;
static String[] string;
static int[] number;
static final String stable = "Stable";
static final String unstable = "Not stable";
public static void main(String[] args) throws IOException {
Scanner scanner =... | import java.io.*;
import java.util.*;
class Main {
//読み込みのテンプレ(stringオブジェクトまで)
static int N;
static String[] string;
static int[] number;
static final String stable = "Stable";
static final String unstable = "Not stable";
public static void main(String[] args) throws IOException {
Scanner scanner =... | [["+", 8, 196, 0, 57, 75, 196, 0, 93, 0, 94], ["+", 8, 196, 0, 57, 75, 196, 0, 93, 0, 35]] | 3 | 863 | 2 |
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.List;
class Card {
String name;
int value;
Card(String name) {
this.name = name;
value = Integer.parseInt(name.substring(1));
}
@Override
public String toString... | import java.io.BufferedReader;
import java.io.FileReader;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.List;
class Card {
String name;
int value;
Card(String name) {
this.name = name;
value = Integer.parseInt(name.substring(1));
}
@Override
public String toString... | [["-", 49, 200, 51, 230, 3, 4, 0, 230, 39, 78], ["+", 49, 200, 51, 230, 3, 4, 0, 230, 39, 78], ["-", 3, 4, 0, 230, 3, 4, 0, 5, 0, 62], ["-", 3, 4, 0, 230, 3, 4, 0, 5, 0, 491], ["+", 3, 4, 0, 230, 3, 4, 0, 509, 500, 22], ["+", 3, 4, 0, 230, 3, 4, 0, 509, 0, 131], ["+", 3, 4, 0, 230, 3, 4, 0, 509, 119, 22]] | 3 | 564 | 8 |
// ALDS1_2_C Stable Sort
import java.io.*;
import java.util.*;
class Main {
public static void main(String[] args) {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
try {
int N = Integer.parseInt(br.readLine());
Trump[] card = new Trump[N];
String[] inputAry = br.... | // ALDS1_2_C Stable Sort
import java.io.*;
import java.util.*;
class Main {
public static void main(String[] args) {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
try {
int N = Integer.parseInt(br.readLine());
Trump[] card = new Trump[N];
String[] inputAry = br.... | [["-", 0, 1, 0, 492, 3, 4, 0, 5, 0, 491], ["+", 0, 1, 0, 492, 3, 4, 0, 5, 0, 491]] | 3 | 761 | 2 |
import java.io.*;
import java.util.Arrays;
import java.util.Scanner;
class Main {
public static void bubbleSort(int a[], String sta[]) {
for (int i = 0; i < a.length; i++) {
for (int j = a.length - 1; j >= i + 1; j--) {
if (a[j] < a[j - 1]) {
int workint = a[j];
a[j] = a[j - 1]... | import java.io.*;
import java.util.Arrays;
import java.util.Scanner;
class Main {
public static void bubbleSort(int a[], String sta[]) {
for (int i = 0; i < a.length; i++) {
for (int j = a.length - 1; j >= i + 1; j--) {
if (a[j] < a[j - 1]) {
int workint = a[j];
a[j] = a[j - 1]... | [["-", 0, 1, 0, 492, 3, 4, 0, 5, 0, 491], ["+", 0, 1, 0, 492, 3, 4, 0, 5, 0, 491]] | 3 | 662 | 2 |
import java.util.Arrays;
import java.util.Scanner;
public class Main {
private static Scanner sc;
public static void main(String[] args) {
sc = new Scanner(System.in);
int n = sc.nextInt();
String[] a = new String[n];
String[] b = new String[n];
for (int i = 0; i < n; i++) {
a[i] = sc.nex... | import java.util.Arrays;
import java.util.Scanner;
public class Main {
private static Scanner sc;
public static void main(String[] args) {
sc = new Scanner(System.in);
int n = sc.nextInt();
String[] a = new String[n];
String[] b = new String[n];
for (int i = 0; i < n; i++) {
a[i] = sc.nex... | [["-", 0, 1, 0, 492, 3, 4, 0, 5, 0, 491], ["+", 0, 1, 0, 492, 3, 4, 0, 5, 0, 491]] | 3 | 487 | 2 |
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
String x = "0";
Card[] C = new Card[N];
Card[] CB = new Card[N];
Card[] CS = new Card[N];
for (int i = 0; i < N; i++) {
String str = sc.next()... | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
String x = "0";
Card[] C = new Card[N];
Card[] CB = new Card[N];
Card[] CS = new Card[N];
for (int i = 0; i < N; i++) {
String str = sc.next()... | [["-", 0, 1, 0, 492, 3, 4, 0, 5, 0, 491], ["+", 0, 1, 0, 492, 3, 4, 0, 5, 0, 491]] | 3 | 775 | 4 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
String s;
char[] ch;
char[][] C = new char[2][n];
char[][] C2 = new char[2][n];
for (int i = 0; i < n; i++) {
s = scan.next();
... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
String s;
char[] ch;
char[][] C = new char[2][n];
char[][] C2 = new char[2][n];
for (int i = 0; i < n; i++) {
s = scan.next();
... | [["-", 75, 1, 0, 492, 3, 4, 0, 5, 0, 491], ["+", 75, 1, 0, 492, 3, 4, 0, 5, 0, 491]] | 3 | 689 | 2 |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args) {
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
try {
int lim = Integer.parseInt(in.readLine());
String[] a = in.re... | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args) {
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
try {
int lim = Integer.parseInt(in.readLine());
String[] a = in.re... | [["-", 8, 196, 0, 57, 15, 15, 0, 16, 17, 60], ["+", 8, 196, 0, 57, 15, 15, 0, 16, 17, 79]] | 3 | 847 | 4 |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(br.readLine());
String[] s = br.read... | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(br.readLine());
String[] s = br.read... | [["+", 0, 57, 15, 15, 0, 16, 12, 16, 17, 33], ["+", 0, 57, 15, 15, 0, 16, 12, 16, 12, 499]] | 3 | 559 | 2 |
n = gets.chomp.to_i
a = []
n.times do
a.push(gets.chomp.to_i)
end
max_gap = -Float::INFINITY
low = a[0]
for i in 1..a.size-1
if a[i] - low > max_gap
max_gap = a[i] - low
elsif a[i] < low
low = a[i]
end
end
puts max_gap | n = gets.chomp.to_i
a = []
n.times do
a.push(gets.chomp.to_i)
end
max_gap = -Float::INFINITY
low = a[0]
for i in 1..a.size-1
if a[i] - low > max_gap
max_gap = a[i] - low
end
if a[i] < low
low = a[i]
end
end
puts max_gap | [["-", 0, 88, 8, 170, 0, 121, 75, 759, 0, 759], ["+", 0, 493, 0, 88, 8, 170, 0, 121, 0, 444], ["+", 0, 493, 0, 88, 8, 170, 0, 121, 0, 121]] | 4 | 82 | 3 |
_,m,*a=$<.map &:to_i
p a.map{|i|m=i if 0<s=i-m
s}.max | _,m,*a=$<.map &:to_i
p a.map{|i|m=i if 0>s=i-m
s}.max | [["-", 196, 196, 8, 734, 0, 751, 15, 738, 17, 18], ["+", 196, 196, 8, 734, 0, 751, 15, 738, 17, 47]] | 4 | 35 | 2 |
gets
n=2e9
m=0
$<.map{|c|i=c.to_i;m<i-n&&m=i-n;n>i&&n=i}
p m | gets
n=2e9
m=-n
$<.map{|c|i=c.to_i;m<i-n&&m=i-n;n>i&&n=i}
p m | [["-", 36, 36, 36, 36, 0, 493, 0, 662, 12, 612], ["+", 36, 36, 0, 493, 0, 662, 12, 748, 17, 33], ["+", 36, 36, 0, 493, 0, 662, 12, 748, 439, 22]] | 4 | 42 | 3 |
n = gets.to_i
r = n.times.map { gets.to_i }
max_profit = r[0] - r[1]
min = r[0]
(1...r.size).each do |i|
profit = r[i] - min
max_profit = profit if profit > max_profit
min = r[i] if r[i] < min
end
puts max_profit | n = gets.to_i
r = n.times.map { gets.to_i }
max_profit = r[1] - r[0]
min = r[0]
(1...r.size).each do |i|
profit = r[i] - min
max_profit = profit if profit > max_profit
min = r[i] if r[i] < min
end
puts max_profit | [["-", 0, 493, 0, 662, 12, 738, 31, 742, 0, 612], ["+", 0, 493, 0, 662, 12, 738, 31, 742, 0, 612], ["-", 0, 493, 0, 662, 12, 738, 12, 742, 0, 612], ["+", 0, 493, 0, 662, 12, 738, 12, 742, 0, 612]] | 4 | 78 | 4 |
n = gets.to_i
ret = -1000000000
j = gets.to_i
min = j
max = j
for i in 2..n
j = gets.to_i
if min > j
ret = j - min if ret < j - min
min = j
max = j
end
if max < j
max = j
ret = max - min if ret < max - min
end
end
puts ret | n = gets.to_i
ret = -1000000000
j = gets.to_i
min = j
max = j
for i in 2..n
j = gets.to_i
if min >= j
ret = j - min if ret < j - min
min = j
max = j
end
if max < j
max = j
ret = max - min if ret < max - min
end
end
puts ret | [["-", 0, 88, 8, 170, 0, 121, 15, 738, 17, 47], ["+", 0, 88, 8, 170, 0, 121, 15, 738, 17, 20]] | 4 | 75 | 2 |
n = STDIN.gets.to_i
p n
max = -2000000000
min = STDIN.gets.to_i
(2..n).each { |i|
x = STDIN.gets.to_i
max = if max > x - min then max else x - min end
min = if x < min then x else min end
}
puts max | n = STDIN.gets.to_i
max = -2000000000
min = STDIN.gets.to_i
(2..n).each { |i|
x = STDIN.gets.to_i
max = if max > x - min then max else x - min end
min = if x < min then x else min end
}
puts max | [["-", 36, 36, 36, 36, 0, 493, 0, 652, 735, 22], ["-", 36, 36, 0, 493, 0, 652, 3, 4, 0, 22]] | 4 | 67 | 2 |
n = gets.to_i
rs = []
n.times do
rs << gets.to_i
end
max = -10 ** 9
max_i = 0
min = rs[0]
rs.length.times do |i|
break if i == rs.length - 1
next if rs[i] >= min
min = rs[i]
if i < max_i
max = rs[max_i] - rs[i]
else
(i+1..rs.length-1).each do |j|
if rs[j] - rs[i] > max
max = rs[j] - r... | n = gets.to_i
rs = []
n.times do
rs << gets.to_i
end
max = -10 ** 9
max_i = 0
min = rs[0]
rs.length.times do |i|
break if i == rs.length - 1
next if rs[i] > min
min = rs[i]
if i < max_i
max = rs[max_i] - rs[i]
else
(i+1..rs.length-1).each do |j|
if rs[j] - rs[i] > max
max = rs[j] - rs... | [["-", 196, 737, 8, 736, 0, 751, 15, 738, 17, 20], ["+", 196, 737, 8, 736, 0, 751, 15, 738, 17, 47]] | 4 | 131 | 2 |
n = gets.to_i
rs = readlines.take(n).map(&:to_i)
_, max_profit = rs.drop(0).reduce([rs[0], -(10 ** n)]) do |(min_r, max_profit), r|
max_profit = [max_profit, r - min_r].max
min_r = r if r < min_r
[min_r, max_profit]
end
puts max_profit | n = gets.to_i
rs = readlines.take(n).map(&:to_i)
_, max_profit = rs.drop(1).reduce([rs[0], -(10 ** 9)]) do |(min_r, max_profit), r|
max_profit = [max_profit, r - min_r].max
min_r = r if r < min_r
[min_r, max_profit]
end
puts max_profit | [["-", 0, 662, 12, 652, 486, 652, 3, 4, 0, 612], ["+", 0, 662, 12, 652, 486, 652, 3, 4, 0, 612], ["-", 0, 516, 0, 748, 439, 739, 0, 738, 12, 22], ["+", 0, 516, 0, 748, 439, 739, 0, 738, 12, 612]] | 4 | 82 | 4 |
n = gets.to_i
r = Array.new
r0 = gets.to_i
r1 = gets.to_i
max_r = - r0
min_v = r0 < r1 ? r0 : r1
(n-2).times do
r = gets.to_i
current = r - min_v
max_r = current if current > max_r
min_v = r if r < min_v
end
puts max_r | n = gets.to_i
r = Array.new
r0 = gets.to_i
r1 = gets.to_i
max_r = r1 - r0
min_v = r0 < r1 ? r0 : r1
(n-2).times do
r = gets.to_i
current = r - min_v
max_r = current if current > max_r
min_v = r if r < min_v
end
puts max_r | [["+", 36, 36, 0, 493, 0, 662, 12, 738, 31, 22]] | 4 | 68 | 1 |
n = gets.to_i
min = last = gets.to_i
profits = []
(n-2).times{
current = gets.to_i
profits<<(current-min) if (profits.bsearch{|i| i >= 0} == nil) || (current > last)
min = current if (current < min)
last = current
}
puts profits.max | n = gets.to_i
min = last = gets.to_i
profits = []
(n-1).times{
current = gets.to_i
profits<<(current-min) if (profits.bsearch{|i| i >= 0} == nil) || (current > last)
min = current if (current < min)
last = current
}
puts profits.max | [["-", 0, 493, 0, 652, 486, 739, 0, 738, 12, 612], ["+", 0, 493, 0, 652, 486, 739, 0, 738, 12, 612]] | 4 | 75 | 2 |
# frozen_string_literal: true
n = gets.to_i
min, diff = gets.to_i, Float::Infinity
(n - 1).times do
r = gets.to_i
if r - min > diff
diff = r - min
end
if r < min
min = r
end
end
puts diff
| # frozen_string_literal: true
n = gets.to_i
min, diff = gets.to_i, - 10**9
(n - 1).times do
r = gets.to_i
if r - min > diff
diff = r - min
end
if r < min
min = r
end
end
puts diff
| [["-", 0, 493, 0, 662, 12, 762, 0, 760, 345, 743], ["-", 0, 493, 0, 662, 12, 762, 0, 760, 0, 349], ["-", 0, 493, 0, 662, 12, 762, 0, 760, 141, 743], ["+", 0, 493, 0, 662, 12, 762, 0, 748, 17, 33], ["+", 0, 662, 12, 762, 0, 748, 439, 738, 31, 612], ["+", 0, 662, 12, 762, 0, 748, 439, 738, 17, 578], ["+", 0, 662, 12, 762... | 4 | 53 | 7 |
n = gets.to_i
a = gets.to_i
b = gets.to_i
can = b-a
if n==2 then
puts can
else
if a>b then
left = b
end
m = n-2
m.times{
right = gets.to_i
d = right - left
if d>can then
can = d
end
if right< left then
left = right
end
}
puts can
end
|
n = gets.to_i
a = gets.to_i
b = gets.to_i
can = b-a
if n==2 then
puts can
else
if a>b then
left = b
else
left = a
end
m = n-2
m.times{
right = gets.to_i
d = right - left
if d>can then
can = d
end
if right < left then
left = right
end
}
puts can
end
| [["+", 0, 121, 75, 95, 0, 121, 75, 95, 0, 95], ["+", 75, 95, 0, 121, 75, 95, 0, 662, 31, 22], ["+", 75, 95, 0, 121, 75, 95, 0, 662, 0, 32], ["+", 75, 95, 0, 121, 75, 95, 0, 662, 12, 22]] | 4 | 78 | 4 |
arr = []
n = gets.to_i
n.times do
input = gets.to_i
arr << input
end
max = -2000000000000000
minv = arr[0]
(arr.length - 1).times do |i|
i += 1
max = arr[i] - minv if(arr[0] - minv > max)
minv = arr[i] if(arr[i] < minv)
end
p max
| arr = []
n = gets.to_i
n.times do
input = gets.to_i
arr << input
end
max = -2000000000000000
minv = arr[0]
(arr.length - 1).times do |i|
i += 1
max = arr[i] - minv if(arr[i] - minv > max)
minv = arr[i] if(arr[i] < minv)
end
p max
| [["-", 15, 739, 0, 738, 31, 738, 31, 742, 0, 612], ["+", 15, 739, 0, 738, 31, 738, 31, 742, 0, 22]] | 4 | 85 | 2 |
inputs = []
while True:
try:
inputs.append(int(input()))
except(EOFError):
break
inputs.pop(0)
minv = inputs[0]
maxv = inputs[1] - inputs[0]
for i in range(1, len(inputs) - 1):
maxv = max([maxv, inputs[i] - minv])
minv = min([minv, inputs[i]])
print(maxv)
| inputs = []
while True:
try:
inputs.append(int(input()))
except(EOFError):
break
inputs.pop(0)
minv = inputs[0]
maxv = inputs[1] - inputs[0]
for i in range(1, len(inputs)):
maxv = max([maxv, inputs[i] - minv])
minv = min([minv, inputs[i]])
print(maxv)
| [["-", 0, 7, 12, 652, 3, 4, 0, 657, 17, 33], ["-", 0, 7, 12, 652, 3, 4, 0, 657, 12, 612]] | 5 | 96 | 2 |
n=int(input().strip())
lst=[]
minval=0x3f3f3f3f
ans=-0x3f3f3f3f
for i in range(n):
val=int(input().strip())
if(i>1):
#print val,minval
ans=max(ans,val-minval)
minval = min(minval, val)
print(ans)
| n=int(input().strip())
lst=[]
minval=0x3f3f3f3f
ans=-0x3f3f3f3f
for i in range(n):
val=int(input().strip())
if(i>=1):
#print val,minval
ans=max(ans,val-minval)
minval = min(minval, val)
print(ans)
| [["-", 8, 196, 0, 57, 15, 23, 0, 666, 667, 47], ["+", 8, 196, 0, 57, 15, 23, 0, 666, 667, 20]] | 5 | 73 | 2 |
n = int(input())
s = []
for i in range(n):
s.append(int(input()))
max_s = -10**9
min_s = s[0]
for i in range(1, n-1):
max_s = max(max_s, s[i] - min_s)
min_s = min(min_s, s[i])
print(max_s)
| n = int(input())
s = []
for i in range(n):
s.append(int(input()))
max_s = -10**9
min_s = s[0]
for i in range(1, n):
max_s = max(max_s, s[i] - min_s)
min_s = min(min_s, s[i])
print(max_s)
| [["-", 0, 7, 12, 652, 3, 4, 0, 657, 17, 33], ["-", 0, 7, 12, 652, 3, 4, 0, 657, 12, 612]] | 5 | 83 | 2 |
n = int(input())
ns = []
max_profit = -1000000000
min_value = 1000000000
for i in range(n):
num = int(input())
max_profit = max(max_profit, num-min_value)
min_value = min(i, min_value)
print(max_profit)
| n = int(input())
ns = []
max_profit = -1000000000
min_value = 1000000000
for i in range(n):
num = int(input())
if i > 0:
max_profit = max(max_profit, num-min_value)
min_value = min(num, min_value)
print(max_profit)
| [["+", 0, 656, 0, 7, 8, 196, 0, 57, 0, 121], ["+", 0, 7, 8, 196, 0, 57, 15, 666, 0, 22], ["+", 0, 7, 8, 196, 0, 57, 15, 666, 667, 47], ["+", 0, 7, 8, 196, 0, 57, 15, 666, 0, 612], ["+", 0, 656, 0, 7, 8, 196, 0, 57, 0, 102], ["-", 0, 1, 0, 662, 12, 652, 3, 4, 0, 22], ["+", 0, 1, 0, 662, 12, 652, 3, 4, 0, 22]] | 5 | 57 | 7 |
import math
N = int(input())
R = [int(input().strip()) for _ in range(N)]
maxv = -math.inf
minv = R[0]
for i in range(1, N-1):
tmp_maxv = R[i] - minv # 差額をセットする
# 現在の最大差額と差額の大きい方を最大差額にする
if maxv < tmp_maxv:
maxv = tmp_maxv
# 現在値が最小なら、最小値を更新する
if R[i] < minv:
minv = R[i]
print(ma... | import math
N = int(input())
R = [int(input().strip()) for _ in range(N)]
maxv = -math.inf
minv = R[0]
for i in range(1, N):
tmp_maxv = R[i] - minv # 差額をセットする
# 現在の最大差額と差額の大きい方を最大差額にする
if maxv < tmp_maxv:
maxv = tmp_maxv
# 現在値が最小なら、最小値を更新する
if R[i] < minv:
minv = R[i]
print(maxv... | [["-", 0, 7, 12, 652, 3, 4, 0, 657, 17, 33], ["-", 0, 7, 12, 652, 3, 4, 0, 657, 12, 612]] | 5 | 92 | 2 |
n=int(input())
r=[int(input()) for i in range(n)]
maxv=r[1]-r[0]
minv=r[0]
for i in range(1,n-1):
maxv=max(maxv,r[i]-minv)
minv=min(minv,r[i])
print(maxv)
| n=int(input())
r=[int(input()) for i in range(n)]
maxv=r[1]-r[0]
minv=r[0]
for i in range(1,n):
maxv=max(maxv,r[i]-minv)
minv=min(minv,r[i])
print(maxv)
| [["-", 0, 7, 12, 652, 3, 4, 0, 657, 17, 33], ["-", 0, 7, 12, 652, 3, 4, 0, 657, 12, 612]] | 5 | 82 | 2 |
a,b = -1e11,1e11
for _ in int(input()):
data = int(input())
a,b = max(a,c-b),min(b,c)
print(a)
| a,b = -1e11,1e11
for _ in range(int(input())):
c = int(input())
a,b = max(a,c-b),min(b,c)
print(a)
| [["+", 36, 36, 0, 656, 0, 7, 12, 652, 63, 22], ["+", 0, 656, 0, 7, 12, 652, 3, 4, 0, 24], ["+", 0, 656, 0, 7, 12, 652, 3, 4, 0, 25], ["-", 0, 7, 8, 196, 0, 1, 0, 662, 31, 22], ["+", 0, 7, 8, 196, 0, 1, 0, 662, 31, 22]] | 5 | 49 | 5 |
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <stdio.h>
#include <stdlib.h>
int main() {
int *A, n, i, j, cnt = 0, tmp;
scanf("%d", &n);
A = (int *)malloc(sizeof(int) * n);
for (i = 0; i < n; ++i)
scanf("%d", A + i);
for (i = 0; i < n; i++) {
for (j = 1; j < n; j++) {
if ... | #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <stdio.h>
#include <stdlib.h>
int main() {
int *A, n, i, j, cnt = 0, tmp;
scanf("%d", &n);
A = (int *)malloc(sizeof(int) * n);
for (i = 0; i < n; ++i)
scanf("%d", A + i);
for (i = 0; i < n; i++) {
for (j = 1; j < n; j++) {
if ... | [["-", 0, 2, 3, 4, 0, 41, 64, 103, 0, 44], ["+", 0, 2, 3, 4, 0, 41, 64, 103, 0, 125]] | 0 | 226 | 22 |
#include <stdio.h>
int main() {
int a[100] = {0};
int number;
int count;
int i, j;
int temp;
scanf("%d", &number);
for (i = 0; i < number; i++) {
scanf("%d", &a[i]);
}
count = 0;
for (i = 0; i < number; i++) {
for (j = number - 1 - i; j > 0; j--) {
if (a[j] < a[j - 1]) {
te... | #include <stdio.h>
int main() {
int a[100] = {0};
int number;
int count;
int i, j;
int temp;
scanf("%d", &number);
for (i = 0; i < number; i++) {
scanf("%d", &a[i]);
}
count = 0;
for (i = 0; i < number; i++) {
for (j = number - 1; j > i; j--) {
if (a[j] < a[j - 1]) {
temp =... | [["-", 8, 9, 0, 7, 10, 11, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 10, 11, 12, 16, 12, 22], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22]] | 0 | 212 | 4 |
#include <stdio.h>
int main() {
int n, i, j;
int tmp;
int A[1000];
int flag = 1;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
i = 0;
while (flag) {
flag = 0;
for (j = n - 1; j > 0; j--) {
if (A[j] < A[j - 1]) {
tmp = A[j];
A[j] = A[j - 1];
... | #include <stdio.h>
int main() {
int n, i, j;
int tmp;
int A[1000];
int flag = 1;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
i = 0;
while (flag) {
flag = 0;
for (j = n - 1; j > 0; j--) {
if (A[j] < A[j - 1]) {
tmp = A[j];
A[j] = A[j - 1];
... | [["-", 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]] | 0 | 209 | 4 |
#include <stdio.h>
int input[101] = {};
int n;
int main(void) {
scanf("%d", &n);
int i, j;
for (i = 0; i < n; i++) {
scanf("%d", &input[i]);
}
int flag = 1;
int count = 0, compare = 0;
for (i = 0; i < n; i++) {
for (j = 1; j < n - i; j++) {
compare++;
if (input[j - 1] < input[j]) {... | #include <stdio.h>
int input[101] = {};
int n;
int main(void) {
scanf("%d", &n);
int i, j;
for (i = 0; i < n; i++) {
scanf("%d", &input[i]);
}
int flag = 1;
int count = 0, compare = 0;
for (i = 0; i < n; i++) {
for (j = 1; j < n - i; j++) {
compare++;
if (input[j - 1] > input[j]) {... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 47]] | 0 | 220 | 2 |
#include <stdio.h>
#define MAX 100
void bubbleSort(int *A, int N) {
int j;
int temp;
int flag;
int num = 0;
flag = 1;
while (flag) {
flag = 0;
for (j = N - 1; j >= 1; j++) {
if (A[j] < A[j - 1]) {
temp = A[j];
A[j] = A[j - 1];
A[j - 1] = temp;
flag = 1;
... | #include <stdio.h>
#define MAX 100
void bubbleSort(int *A, int N) {
int j;
int temp;
int flag;
int num = 0;
flag = 1;
while (flag) {
flag = 0;
for (j = N - 1; j > 0; j--) {
if (A[j] < A[j - 1]) {
temp = A[j];
A[j] = A[j - 1];
A[j - 1] = temp;
flag = 1;
... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 20], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 47], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13], ["-", 0, 52, 8, 9, 0, 7, 26, 27, 17, 29], ["+", 0, 52, 8, 9, 0, 7, 26, 27, 17, 68]] | 0 | 241 | 6 |
#include <stdio.h>
void bubbleSort(int *A, int N);
int cnt = 0;
int main() {
int n, a[100], i;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
bubbleSort(a, n);
for (i = 0; i < n; i++) {
if (i == n - 1) {
printf("%d\n", a[i]);
} else {
printf("%d ", a[i]);
}... | #include <stdio.h>
void bubbleSort(int *A, int N);
int cnt = 0;
int main() {
int n, a[100], i;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
bubbleSort(a, n);
for (i = 0; i < n; i++) {
if (i == n - 1) {
printf("%d\n", a[i]);
} else {
printf("%d ", a[i]);
}... | [["-", 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 | 251 | 7 |
#include <stdio.h>
#define N 100
int bubbleSort(int *B, int n) {
int i, j, tmp, count = 0;
for (i = 0; i < n; i++) {
for (j = n - 1; j > i; j--) {
if (B[j] < B[j - 1]) {
tmp = B[j];
B[j] = B[j - 1];
B[j - 1] = tmp;
count++;
}
}
}
return count;
}
int main() ... | #include <stdio.h>
#define N 100
int bubbleSort(int *B, int n) {
int i, j, tmp, count = 0;
for (i = 0; i < n; i++) {
for (j = n - 1; j > i; j--) {
if (B[j] < B[j - 1]) {
tmp = B[j];
B[j] = B[j - 1];
B[j - 1] = tmp;
count++;
}
}
}
return count;
}
int main() ... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 12, 13]] | 0 | 229 | 2 |
#include <stdio.h>
int main() {
int A[100];
int n, m, i, j;
int 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]) {
m = A[j];
A[j] = A[j - 1];
A[j - 1] = m;
... | #include <stdio.h>
int main() {
int A[100];
int n, m, i, j;
int 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]) {
m = A[j];
A[j] = A[j - 1];
A[j - 1] = m;
... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 98], ["-", 0, 57, 15, 23, 0, 16, 12, 16, 31, 22], ["-", 0, 57, 15, 23, 0, 16, 12, 16, 17, 18], ["-", 0, 57, 15, 23, 0, 16, 12, 16, 12, 22]] | 0 | 207 | 4 |
#include <stdio.h>
int main() {
int i, j, n, count = 0, k = 0;
int A[100];
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 + 1; j--) {
if (A[j] < A[j - 1]) {
k = A[j];
A[j] = A[j - 1];
A[j - 1] =... | #include <stdio.h>
int main() {
int i, j, n, count = 0, k = 0;
int A[100];
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 + 1; j--) {
if (A[j] < A[j - 1]) {
k = A[j];
A[j] = A[j - 1];
A[j - 1] =... | [["-", 0, 1, 0, 2, 3, 4, 0, 69, 71, 13], ["+", 0, 2, 3, 4, 0, 69, 71, 16, 31, 22], ["+", 0, 2, 3, 4, 0, 69, 71, 16, 17, 33], ["+", 0, 2, 3, 4, 0, 69, 71, 16, 12, 13]] | 0 | 205 | 4 |
#include <stdio.h>
int main() {
int flag = 1, i, j, n, a[100], work, count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
while (flag) {
flag = 0;
for (j = n - 1; j >= 1; j--) {
if (a[j] < a[j - 1]) {
work = a[j];
a[j] = a[j - 1];
a[j - 1] = w... | #include <stdio.h>
int main() {
int flag = 1, i, j, n, a[100], work, count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
while (flag) {
flag = 0;
for (j = n - 1; j >= 1; j--) {
if (a[j] < a[j - 1]) {
work = a[j];
a[j] = a[j - 1];
a[j - 1] = w... | [["-", 8, 9, 0, 57, 15, 23, 0, 11, 17, 32], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 60]] | 0 | 229 | 2 |
#include <stdio.h>
#define N 100
void swap(int *x, int *y);
int main() {
int n, i, j, count = 0, a[N];
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 + 1; j--) {
if (a[j] < a[j - 1]) {
swap(a + j, a + (j - 1));
... | #include <stdio.h>
#define N 100
void swap(int *x, int *y);
int main() {
int n, i, j, count = 0, a[N];
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 + 1; j--) {
if (a[j] < a[j - 1]) {
swap(a + j, a + (j - 1));
... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 2, 3, 4, 0, 69, 71, 16, 17, 33], ["+", 0, 2, 3, 4, 0, 69, 71, 16, 12, 13]] | 0 | 234 | 4 |
#include <stdio.h>
#define ko 100
int main() {
int i, j, N, A[ko], flag = 1, im, cou = 0;
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
i = 0;
while (flag) {
flag = 0;
for (j = N - 1; j >= i + 1; j--) {
if (A[j] < A[j - 1]) {
im = A[j];
A[j] = A[j - 1];... | #include <stdio.h>
#define ko 100
int main() {
int i, j, N, A[ko], flag = 1, im, cou = 0;
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
i = 0;
while (flag) {
flag = 0;
for (j = N - 1; j >= i + 1; j--) {
if (A[j] < A[j - 1]) {
im = A[j];
A[j] = A[j - 1];... | [["+", 0, 52, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 0 | 213 | 3 |
#include <stdio.h>
#define N 100
int main() {
int n, flag, i, j, temp, A[N], count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
flag = 1;
while (flag) {
flag = 0;
for (j = 0; j <= n - 1; j++) {
if (A[j] < A[j - 1]) {
temp = A[j];
A[j] = A[j - 1];... | #include <stdio.h>
#define N 100
int main() {
int n, flag, i, j, temp, A[N], count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
flag = 1;
while (flag) {
flag = 0;
for (j = 1; j <= n - 1; j++) {
if (A[j] < A[j - 1]) {
temp = A[j];
A[j] = A[j - 1];... | [["-", 0, 52, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 52, 8, 9, 0, 7, 10, 11, 12, 13]] | 0 | 217 | 2 |
#include <stdio.h>
int bubblesort(int A[], int N) {
int i, j, v;
int count = 0;
for (i = 0; i < N - 1; i++) {
for (j = N - 1; j > i - 1; j--) {
if (*(A + j) < *(A + j - 1)) {
v = 0;
v = *(A + j);
*(A + j) = *(A + j - 1);
*(A + j - 1) = v;
count++;
}
}
... | #include <stdio.h>
int bubblesort(int A[], int N) {
int i, j, v;
int count = 0;
for (i = 0; i < N - 1; i++) {
for (j = N - 1; j > i; j--) {
if (*(A + j) < *(A + j - 1)) {
v = 0;
v = *(A + j);
*(A + j) = *(A + j - 1);
*(A + j - 1) = v;
count++;
}
}
}
... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 0 | 256 | 3 |
#include <stdio.h>
void swap(int *A1, int *A2) {
int tmp;
tmp = *A1;
*A1 = *A2;
*A2 = tmp;
}
int bubbleSort(int A[], int N) {
int i, j;
int sw = 0;
int 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]);
... | #include <stdio.h>
void swap(int *A1, int *A2) {
int tmp;
tmp = *A1;
*A1 = *A2;
*A2 = tmp;
}
int bubbleSort(int A[], int N) {
int i, j;
int sw = 0;
int 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]);
... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 20], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 0 | 269 | 3 |
#include <stdio.h>
void swap(int *A1, int *A2) {
int tmp;
tmp = *A1;
*A1 = *A2;
*A2 = tmp;
}
int bubbleSort(int A[], int N) {
int i, j, sw = 0;
int 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]);
fl... | #include <stdio.h>
void swap(int *A1, int *A2) {
int tmp;
tmp = *A1;
*A1 = *A2;
*A2 = tmp;
}
int bubbleSort(int A[], int N) {
int i, j, sw = 0;
int 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]);
... | [["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 0 | 267 | 2 |
#include <stdio.h>
int main() {
int n, i, j, k, temp, kou;
int A[101];
/*????´??????°?????\???*/
scanf("%d", &n);
/*??????????????\???*/
for (i = 0; i < n; i++) {
if (i == n - 1) {
scanf("%d", &A[n - 1]);
} else {
scanf("%d ", &A[i]);
}
}
/*?????????*/
for (i = 0; i < n - 1... | #include <stdio.h>
int main() {
int n, i, j, k, temp, kou = 0;
int A[101];
/*????´??????°?????\???*/
scanf("%d", &n);
/*??????????????\???*/
for (i = 0; i < n; i++) {
if (i == n - 1) {
scanf("%d", &A[n - 1]);
} else {
scanf("%d ", &A[i]);
}
}
/*?????????*/
for (i = 0; i < n... | [["+", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 17, 33], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 0 | 232 | 4 |
#include <stdio.h>
int main() {
int i, j, n, v, count = 0;
int a[100];
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]) {
v = a[j];
a[j] = a[j - 1];
a[j - 1] = v;
count... | #include <stdio.h>
int main() {
int i, j, n, v, count = 0;
int a[100];
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]) {
v = a[j];
a[j] = a[j - 1];
a[j - 1] = v;
count... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 47], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 8, 9, 0, 7, 8, 57, 64, 9, 0, 46], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 47], ["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46]] | 0 | 196 | 8 |
#include <stdio.h>
int main() {
int N, i, j, temp, count = 0;
int A[100];
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 + 1; j--) {
if (A[j] < A[j - 1]) {
temp = A[j];
A[j] = A[j - 1];
A[j - 1] = temp... | #include <stdio.h>
int main() {
int N, i, j, temp, count = 0;
int A[100];
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 + 1; j--) {
if (A[j] < A[j - 1]) {
temp = A[j];
A[j] = A[j - 1];
A[j - 1] = temp... | [["+", 0, 57, 64, 9, 0, 1, 0, 27, 28, 22], ["+", 0, 57, 64, 9, 0, 1, 0, 27, 17, 29], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35]] | 0 | 203 | 3 |
#include <stdio.h>
int main(void) {
int N, i, j, tmp;
int wa = 0;
int A[100];
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[j - 1];
A[j - 1] = tmp;... | #include <stdio.h>
int main(void) {
int N, i, j, tmp;
int wa = 0;
int A[100];
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[j - 1];
A[j - 1] = tmp... | [["+", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67]] | 0 | 210 | 1 |
#include <stdio.h>
int main() {
int n, i, flag, swap;
int a[100] = {0};
int count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
flag = 1;
while (flag) {
flag = 0;
for (i = n - 1; i > 0; i--) {
if (a[i] < a[i - 1]) {
a[i] = swap;
a[i] = a[i... | #include <stdio.h>
int main() {
int n, i, flag, swap;
int a[100] = {0};
int count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
flag = 1;
while (flag) {
flag = 0;
for (i = n - 1; i > 0; i--) {
if (a[i] < a[i - 1]) {
swap = a[i];
a[i] = a[i... | [["+", 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, 17, 32], ["-", 0, 57, 64, 9, 0, 1, 0, 11, 12, 22]] | 0 | 218 | 4 |
#include <stdio.h>
int main(void) {
int A[100], i, n, sw;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
sw = bubbleSort(A, n);
for (i = 0; i < n; i++) {
if (i)
printf(" ");
printf("%d", A[i]);
}
printf("\n");
printf("%d\n", sw);
return 0;
}
int bubbleSort(i... | #include <stdio.h>
int main(void) {
int A[100], i, n, sw;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
sw = bubbleSort(A, n);
for (i = 0; i < n; i++) {
if (i)
printf(" ");
printf("%d", A[i]);
}
printf("\n");
printf("%d\n", sw);
return 0;
}
int bubbleSort(i... | [["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46]] | 0 | 246 | 2 |
#include <stdio.h>
int bubbleSort(int A[], int N) {
int i, j, temp;
int sw = 0;
int flag = 1;
for (i = 0; flag == 1; i++) {
flag = 0;
for (j = N - 1; j > i + 1; j--) {
if (A[j - 1] > A[j]) {
temp = A[j - 1];
A[j - 1] = A[j];
A[j] = temp;
sw++;
flag = 1;
... | #include <stdio.h>
int bubbleSort(int A[], int N) {
int i, j, temp;
int sw = 0;
int flag = 1;
for (i = 0; flag == 1; i++) {
flag = 0;
for (j = N - 1; j >= i + 1; j--) {
if (A[j - 1] > A[j]) {
temp = A[j - 1];
A[j - 1] = A[j];
A[j] = temp;
sw++;
flag = 1;
... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 47], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 20]] | 0 | 241 | 2 |
#include <stdio.h>
int main() {
int n, i, j, flag, count, A;
int data[99];
count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", data[i]);
}
flag = 1;
while (flag) {
flag = 0;
for (j = n - 1; j > 0; j--) {
if (data[j] < data[j - 1]) {
A = data[j];
data[j]... | #include <stdio.h>
int main() {
int n, i, j, flag, count, A;
int data[99];
count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &data[i]);
}
flag = 1;
while (flag) {
flag = 0;
for (j = n - 1; j >= 1; j--) {
if (data[j] < data[j - 1]) {
A = data[j];
data[... | [["+", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 47], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 20], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13]] | 0 | 200 | 5 |
#include <stdio.h>
int main() {
int v, i, n, j, A[100];
int count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
for (j = 0; j < n; j++) {
for (i = n - 1; i > j; i--) {
if (A[i] < A[i - 1]) {
v = A[i];
A[i] = A[i - 1];
A[i - 1] = v;
count... | #include <stdio.h>
int main(void) {
int v, i, n, j, A[100];
int count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
for (j = 0; j < n; j++) {
for (i = n - 1; i > j; i--) {
if (A[i] < A[i - 1]) {
v = A[i];
A[i] = A[i - 1];
A[i - 1] = v;
c... | [["+", 0, 14, 49, 53, 54, 55, 0, 56, 39, 40], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 210 | 3 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.