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>
/*?????????????´???????????????????????????¢??°*/
void trace(int A[], int N) { //????????¨????´???°
int i;
for (i = 0; i < N; i++) {
if (i < 0)
printf(" "); //????????\??????????´????????????????????¨???????
printf("%d", A[i]);
}
printf("\n");
}
/*?????\?????????*/
void inserti... | #include <stdio.h>
/*?????????????´???????????????????????????¢??°*/
void trace(int A[], int N) { //????????¨????´???°
int i;
for (i = 0; i < N; i++) {
if (i > 0)
printf(" "); //????????\??????????´????????????????????¨???????
printf("%d", A[i]);
}
printf("\n");
}
/*?????\?????????*/
void inserti... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 47], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18]] | 0 | 236 | 4 |
#include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int n;
vector<int> a(n);
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++) {
int v = a[i];
int j = i - 1;
while (j >= 0 && a[j... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int n;
vector<int> a(100);
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++) {
int v = a[i];
int j = i - 1;
while (j >= 0 && a... | [["-", 0, 43, 49, 53, 54, 55, 0, 56, 39, 78], ["+", 8, 9, 0, 43, 49, 50, 51, 4, 0, 13]] | 1 | 169 | 2 |
#include <iostream>
using namespace std;
int main() {
int n, a[101];
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
for (int j = i; j > 0; --j) {
if (a[i - 1] > a[i]) {
int b = a[i];
a[i] = a[i - 1];
a[i - 1] = b;
}
}
f... | #include <iostream>
using namespace std;
int main() {
int n, a[101];
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
for (int j = i; j > 0; --j) {
if (a[j - 1] > a[j]) {
int b = a[j];
a[j] = a[j - 1];
a[j - 1] = b;
}
}
f... | [["-", 51, 16, 31, 69, 341, 342, 0, 16, 31, 22], ["+", 51, 16, 31, 69, 341, 342, 0, 16, 31, 22], ["-", 15, 339, 51, 16, 12, 69, 341, 342, 0, 22], ["+", 15, 339, 51, 16, 12, 69, 341, 342, 0, 22], ["-", 0, 43, 49, 50, 51, 69, 341, 342, 0, 22], ["+", 0, 43, 49, 50, 51, 69, 341, 342, 0, 22], ["-", 0, 1, 0, 11, 31, 69, 341,... | 1 | 162 | 12 |
#include <iostream>
#include <vector>
using namespace std;
void insortionSort(vector<int> A) {
for (int i = 0; i < A.size(); i++) {
int v = A[i];
int j = i - 1;
while (j >= 0 && A[j] > v) {
A[j + 1] = A[j];
j--;
}
A[j + 1] = v;
for (int i = 0; i < A.size(); i++) {
cout << ... |
#include <iostream>
#include <vector>
using namespace std;
void insortionSort(vector<int> A) {
for (int i = 0; i < A.size(); i++) {
int v = A[i];
int j = i - 1;
while (j >= 0 && A[j] > v) {
A[j + 1] = A[j];
j--;
}
A[j + 1] = v;
for (int i = 0; i < A.size(); i++) {
cout << ... | [["+", 8, 9, 0, 1, 0, 16, 12, 69, 28, 22], ["+", 0, 1, 0, 16, 12, 69, 341, 342, 0, 70], ["+", 0, 1, 0, 16, 12, 69, 341, 342, 0, 73], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 189 | 5 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n, 0);
for (auto &&x : v) {
cin >> x;
}
for (int i = 1; i < n; ++i) {
int x = v[i];
int j = i - 1;
while (j >= 0 and v[j] > x) {
v[j + 1] = v[j];
--j;
}
v[j + 1] = x;
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n, 0);
for (auto &&x : v) {
cin >> x;
}
for (int i = 0; i < n; ++i) {
int x = v[i];
int j = i - 1;
while (j >= 0 and v[j] > x) {
v[j + 1] = v[j];
--j;
}
v[j + 1] = x;
... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 158 | 2 |
#include <iostream>
#include <string>
using namespace std;
int main() {
int q, i, j, k, key;
int array[100];
cin >> q;
for (i = 0; i < q; i++)
cin >> array[i];
for (i = 1; i < q; i++) {
for (int j = 0; j < q; j++) {
cout << array[j];
if (j == q - 1)
cout << endl;
else
... | #include <iostream>
#include <string>
using namespace std;
int main() {
int q, i, j, k, key;
int array[100];
cin >> q;
for (i = 0; i < q; i++)
cin >> array[i];
for (i = 1; i < q; i++) {
for (int j = 0; j < q; j++) {
cout << array[j];
if (j == q - 1)
cout << endl;
else
... | [["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 7, 8, 9, 0, 7, 8, 9, 0, 46]] | 1 | 206 | 2 |
#include <iostream>
using namespace std;
int n, v, j, A[100];
void trace() {
for (int i = 0; i < n; i++) {
if (i)
cout << " ";
cout << A[i];
}
cout << endl;
}
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> A[i];
trace();
for (int i = 0; i < n; i++) {
v = A[i];
j = i... | #include <iostream>
using namespace std;
int n, v, j, A[100];
void trace() {
for (int i = 0; i < n; i++) {
if (i)
cout << " ";
cout << A[i];
}
cout << endl;
}
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> A[i];
trace();
for (int i = 0; i < n; i++) {
v = A[i];
j = i... | [["+", 8, 9, 0, 7, 8, 9, 0, 57, 0, 121], ["+", 0, 7, 8, 9, 0, 57, 15, 339, 0, 24], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 0, 7, 8, 9, 0, 57, 15, 339, 0, 25]] | 1 | 175 | 6 |
#include <iostream>
using namespace std;
static const int MAX = 100;
void trace(int A[], int N) {
for (int i = 0; i < N; i++) {
cout << A[i];
if (i < N - 1)
cout << " ";
}
cout << "" << endl;
}
void insertionSort(int A[], int N) {
int v, j;
for (int i = 0; i < N; i++) {
v = A[i];
j = ... | #include <iostream>
using namespace std;
static const int MAX = 100;
void trace(int A[], int N) {
for (int i = 0; i < N; i++) {
cout << A[i];
if (i < N - 1)
cout << " ";
}
cout << endl;
}
void insertionSort(int A[], int N) {
int v, j;
for (int i = 1; i < N; i++) {
v = A[i];
j = i - 1... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 62], ["-", 0, 14, 8, 9, 0, 1, 0, 16, 17, 151], ["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["-", 0, 52, 8, 9, 0, 1, 0, 27, 28, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 27, 28, 22]] | 1 | 219 | 7 |
#include <iostream>
#include <vector>
void printVector(std::vector<int> &vec) {
int size = vec.size();
for (int i = 0; i < size; ++i) {
std::cout << (i ? "" : " ") << vec[i];
}
std::cout << std::endl;
}
int main() {
int nums;
std::cin >> nums;
std::vector<int> v(nums);
for (int i = 0; i < nums; ++... | #include <iostream>
#include <vector>
void printVector(std::vector<int> &vec) {
int size = vec.size();
for (int i = 0; i < size; ++i) {
std::cout << (i ? " " : "") << vec[i];
}
std::cout << std::endl;
}
int main() {
int nums;
std::cin >> nums;
std::vector<int> v(nums);
for (int i = 0; i < nums; ++... | [["+", 31, 16, 12, 23, 0, 41, 64, 5, 0, 6], ["-", 31, 16, 12, 23, 0, 41, 75, 5, 0, 6]] | 1 | 209 | 2 |
#include <stdio.h>
int main() {
int A[1000], N = 0;
scanf("%d", N);
for (int i = 0; i < N; i++) {
scanf("%d", A[i]);
}
for (int i = 0; i < N; i++) {
int v;
v = A[i];
int j = i - 1;
while (j >= 0 && A[j] > v) {
A[j + 1] = A[j];
j--;
A[j + 1] = v;
}
for (int i = 0;... | #include <stdio.h>
int main() {
int A[1000], N = 0;
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
for (int i = 0; i < N; i++) {
int v;
v = A[i];
int j = i - 1;
while (j >= 0 && A[j] > v) {
A[j + 1] = A[j];
j--;
A[j + 1] = v;
}
for (int i = ... | [["+", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67]] | 1 | 172 | 2 |
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
void dump(int *a, int N) {
cout << a[0];
for (int i = 0; i < N; i++) {
cout << " " << a[i];
}
cout << endl;
}
int sort(int *a, int N) {
dump(a, N);
for (int i = 1; i < N; i++) {
int k = a[i];
int j;
for (j = i - ... | #include <cstdio>
#include <iostream>
#include <string>
using namespace std;
void dump(int *a, int N) {
cout << a[0];
for (int i = 1; i < N; i++) {
cout << " " << a[i];
}
cout << endl;
}
int sort(int *a, int N) {
dump(a, N);
for (int i = 1; i < N; i++) {
int k = a[i];
int j;
for (j = i - ... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 222 | 2 |
#include <iostream>
#include <vector>
using namespace std;
void i_sort(vector<int> a, int n) {
int i, j;
for (i = 0; i < n; ++i) {
for (j = 0; j < i; ++j) {
if (a[j] > a[i]) {
a[j] ^= a[i];
a[i] ^= a[j];
a[j] ^= a[i];
}
for (int k = 0; k < n - 1; ++k) {
cout <<... | #include <iostream>
#include <vector>
using namespace std;
void i_sort(vector<int> a, int n) {
int i, j;
for (i = 0; i < n; ++i) {
for (j = 0; j < i; ++j) {
if (a[j] > a[i]) {
a[j] ^= a[i];
a[i] ^= a[j];
a[j] ^= a[i];
}
}
for (int k = 0; k < n - 1; ++k) {
cout ... | [["+", 0, 7, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 7, 8, 9, 0, 7, 8, 9, 0, 46]] | 1 | 196 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int i, j, k, N;
int a[100];
cin >> N;
for (i = 0; i < N; ++i) {
std::cin >> a[i];
}
for (i = 0; i < N; ++i)
cout << (i == 0 ? "" : " ") << a[i];
cout << endl;
for (i = 1; i < N; ++i) {
k = a[i];
j = i - 1;
wh... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int i, j, k, N;
int a[100];
cin >> N;
for (i = 0; i < N; ++i) {
std::cin >> a[i];
}
for (i = 0; i < N; ++i)
cout << (i == 0 ? "" : " ") << a[i];
cout << endl;
for (i = 1; i < N; ++i) {
k = a[i];
j = i - 1;
wh... | [["-", 0, 7, 8, 9, 0, 7, 10, 11, 31, 22], ["+", 0, 7, 8, 9, 0, 7, 10, 11, 31, 22], ["-", 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], ["-", 31, 16, 12, 23, 0, 41, 15, 16, 31, 22], ["+", 31, 16, 12, 23, 0, 41... | 1 | 198 | 10 |
#include <iostream>
int main() {
int N;
std::cin >> N;
int A[N];
for (int i = 0; i < N; i++) {
std::cin >> A[i];
}
for (int i = 1; i < N; i++) {
int v = A[i];
int j = i - 1;
while (j >= 0 && A[j] > v) {
A[j + 1] = A[j];
j--;
}
A[j + 1] = v;
std::cout << A[0];
for... | #include <iostream>
int main() {
int N;
std::cin >> N;
int A[N];
for (int i = 0; i < N; i++) {
std::cin >> A[i];
}
for (int i = 0; i < N; i++) {
int v = A[i];
int j = i - 1;
while (j >= 0 && A[j] > v) {
A[j + 1] = A[j];
j--;
}
A[j + 1] = v;
std::cout << A[0];
for... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 164 | 2 |
#include <stdio.h>
static const int N = 1000;
void print(int a[], int n) {
int k;
for (k = 0; k < n; k++) {
if (k > 0)
printf(" ");
printf("%d", a[k]);
}
printf("\n");
}
int main(void) {
int n, i, j, key;
int a[N + 1];
scanf("%d", &n);
// input
for (i = 0; i < n; i++) {
scanf("%d"... | #include <stdio.h>
static const int N = 1000;
void print(int a[], int n) {
int k;
for (k = 0; k < n; k++) {
if (k > 0)
printf(" ");
printf("%d", a[k]);
}
printf("\n");
}
int main(void) {
int n, i, j, key;
int a[N + 1];
scanf("%d", &n);
// input
for (i = 0; i < n; i++) {
scanf("%d"... | [["+", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67]] | 1 | 219 | 1 |
#include <cstdio>
#include <iostream>
#include <string>
void print_array(int A[], int N) {
for (int i = 0; i < N; i++) {
if (i > 0)
printf(" ");
printf("%d", A[i]);
}
printf("\n");
}
void insertionSort(int A[], int N) {
for (int i = 0; i < N; i++) {
int v = A[i];
int j = i - 1;
w... | #include <cstdio>
#include <iostream>
#include <string>
void print_array(int A[], int N) {
for (int i = 0; i < N; i++) {
if (i > 0)
printf(" ");
printf("%d", A[i]);
}
printf("\n");
}
void insertionSort(int A[], int N) {
for (int i = 1; i < N; i++) {
int v = A[i];
int j = i - 1;
w... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 226 | 2 |
#include <algorithm>
#include <stdio.h>
using namespace std;
int n, 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++) {
for (int j = i - 1; j >= 0; j--) {
if (a[j] < a[j + 1])
break;
swap(a[j], a[j + 1]);
}
for (in... | #include <algorithm>
#include <stdio.h>
using namespace std;
int n, 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++) {
for (int j = i - 1; j >= 0; j--) {
if (a[j] < a[j + 1])
break;
swap(a[j], a[j + 1]);
}
for (in... | [["-", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67]] | 1 | 174 | 1 |
#include <algorithm>
#include <iostream>
using namespace std;
void show(int arr[], int n) {
for (int i = 0; i < n - 1; i++)
cout << arr[i] << " ";
cout << arr[n - 1] << endl;
}
int main() {
int arr[100];
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> arr[i];
show(arr, n);
int j, v;
fo... | #include <algorithm>
#include <iostream>
using namespace std;
void show(int arr[], int n) {
for (int i = 0; i < n - 1; i++)
cout << arr[i] << " ";
cout << arr[n - 1] << endl;
}
int main() {
int arr[100];
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> arr[i];
show(arr, n);
int j, v;
fo... | [["-", 0, 52, 15, 339, 51, 16, 12, 16, 17, 18], ["+", 0, 52, 15, 339, 51, 16, 12, 16, 17, 47]] | 1 | 189 | 2 |
#include <iostream>
using namespace std;
void displayA(int A[], int N) {
for (int i = 0; i < N - 1; i++)
cout << A[i] << " ";
cout << A[N] << endl;
}
void insertionSort(int A[], int N) {
for (int i = 1; i < N; i++) {
displayA(A, N);
int v = A[i];
int j = i - 1;
while (0 <= j && v < A[j]) {
... | #include <iostream>
using namespace std;
void displayA(int A[], int N) {
for (int i = 0; i < N - 1; i++)
cout << A[i] << " ";
cout << A[N - 1] << endl;
}
void insertionSort(int A[], int N) {
for (int i = 1; i < N; i++) {
displayA(A, N);
int v = A[i];
int j = i - 1;
while (0 <= j && v < A[j])... | [["+", 31, 16, 12, 69, 341, 342, 0, 16, 17, 33], ["+", 31, 16, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 204 | 2 |
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int A[1001];
int num;
for (int i = 0; i < 1001; i++) {
A[i] = 0;
}
cin >> num;
for (int i = 0; i < num; i++) {
scanf("%d", &A[i]);
}
void insertionSort(int *A, int N);
insertionSort(A, num);
return 0;
}
void insert... | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int A[1001];
int num;
for (int i = 0; i < 1001; i++) {
A[i] = 0;
}
cin >> num;
for (int i = 0; i < num; i++) {
scanf("%d", &A[i]);
}
void insertionSort(int *A, int N);
insertionSort(A, num);
return 0;
}
void insert... | [["-", 0, 52, 15, 339, 51, 16, 31, 16, 17, 47], ["+", 0, 52, 15, 339, 51, 16, 31, 16, 17, 20], ["+", 0, 11, 31, 69, 341, 342, 0, 16, 17, 72], ["+", 0, 11, 31, 69, 341, 342, 0, 16, 12, 13]] | 1 | 267 | 14 |
#include <iostream>
using namespace std;
int main() {
int N, j, v;
cin >> N;
int s[N];
for (size_t i = 0; i < N; i++) {
cin >> s[i];
}
for (size_t i = 0; i < N; i++) {
v = s[i];
j = i - 1;
while (j >= 0 && s[j] > v) {
s[j + 1] = s[j];
j -= 1;
}
s[j + 1] = v;
for (s... | #include <iostream>
using namespace std;
int main() {
int N, j, v;
cin >> N;
int s[N];
for (size_t i = 0; i < N; i++) {
cin >> s[i];
}
for (size_t i = 0; i < N; i++) {
v = s[i];
j = i - 1;
while (j >= 0 && s[j] > v) {
s[j + 1] = s[j];
j -= 1;
}
s[j + 1] = v;
for (s... | [["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46], ["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46]] | 1 | 167 | 2 |
#include <stdio.h>
int content(int *a, int n) {
for (int j = 0; j < n - 1; j++) {
printf("%d ", a[j]);
}
printf("%d\n", a[n - 1]);
return 0;
}
int main(void) {
int n;
scanf("%d", &n);
int a[n];
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
content(a, n);
for (int i = 1; i < n; i++)... | #include <stdio.h>
int content(int *a, int n) {
for (int j = 0; j < n - 1; j++) {
printf("%d ", a[j]);
}
printf("%d\n", a[n - 1]);
return 0;
}
int main(void) {
int n;
scanf("%d", &n);
int a[n];
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
content(a, n);
for (int i = 1; i < n; i++)... | [["+", 0, 7, 8, 9, 0, 52, 8, 9, 0, 46], ["-", 0, 7, 8, 9, 0, 52, 8, 9, 0, 46]] | 1 | 204 | 2 |
#include <iostream>
using namespace std;
const int MAX = 100;
void insertionSort(int A[], int N);
void showArray(int A[], int N);
int main() {
int A[MAX], n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> A[i];
showArray(A, n);
insertionSort(A, n);
return 0;
}
void insertionSort(int A[], int N) {
... | #include <iostream>
using namespace std;
const int MAX = 100;
void insertionSort(int A[], int N);
void showArray(int A[], int N);
int main() {
int A[MAX], n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> A[i];
showArray(A, n);
insertionSort(A, n);
return 0;
}
void insertionSort(int A[], int N) {
... | [["-", 8, 9, 0, 52, 15, 339, 51, 16, 17, 106], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 98]] | 1 | 234 | 2 |
#include <iostream>
using namespace std;
int N;
int A[110];
int main() {
cin >> N;
for (auto i = 0; i < N; i++) {
cin >> A[i];
}
for (auto i = 1; i < N; i++) {
int v = A[i];
int j = i - 1;
while (j >= 0 && A[j] > v) {
A[j + 1] = A[j];
j--;
}
A[j + 1] = v;
for (auto i = ... | #include <iostream>
using namespace std;
int N;
int A[110];
int main() {
cin >> N;
for (auto i = 0; i < N; i++) {
cin >> A[i];
}
for (auto i = 0; i < N; i++) {
int v = A[i];
int j = i - 1;
while (j >= 0 && A[j] > v) {
A[j + 1] = A[j];
j--;
}
A[j + 1] = v;
for (auto i = ... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 164 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <list>
#include <string>
using namespace std;
int main() {
int n, i, j, v, c;
cin >> n;
int a[n];
for (i = 0; i < n; i++) {
cin >> a[i];
}
for (i = 0; i < n; i++) {
if (i !=... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <list>
#include <string>
using namespace std;
int main() {
int n, i, j, v, c;
cin >> n;
int a[n];
for (i = 0; i < n; i++) {
cin >> a[i];
}
for (i = 0; i < n; i++) {
if (i !=... | [["-", 0, 16, 31, 16, 12, 69, 341, 342, 0, 22], ["+", 0, 16, 31, 16, 12, 69, 341, 342, 0, 22]] | 1 | 227 | 2 |
#include <iostream>
using namespace std;
void trace(int arr[], int N) {
for (int i = 0; i < N; i++) {
if (i > 0)
cout << ' ' << flush;
cout << arr[i] << flush;
}
cout << endl;
}
int main() {
int N;
cin >> N;
int *arr = new int[N];
int comp;
int j;
for (int i = 0; i < N; i++) {
cin ... | #include <iostream>
using namespace std;
void trace(int arr[], int N) {
for (int i = 0; i < N; i++) {
if (i > 0)
cout << ' ' << flush;
cout << arr[i] << flush;
}
cout << endl;
}
int main() {
int N;
cin >> N;
int *arr = new int[N];
int comp;
int j;
for (int i = 0; i < N; i++) {
cin ... | [["-", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 0, 14, 8, 9, 0, 1, 0, 363, 0, 364], ["+", 0, 14, 8, 9, 0, 1, 0, 363, 0, 70], ["+", 0, 14, 8, 9, 0, 1, 0, 363, 0, 73], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25]] | 1 | 203 | 8 |
#include <iostream>
#include <list>
typedef std::list<int> TList;
TList Input() {
TList List;
int Count;
std::cin >> Count;
for (int i = 0; i < Count; ++i) {
int t;
std::cin >> t;
List.push_back(t);
}
return List;
}
void Output(const TList &List) {
TList::const_iterator It = List.begin();
s... | #include <iostream>
#include <list>
typedef std::list<int> TList;
TList Input() {
TList List;
int Count;
std::cin >> Count;
for (int i = 0; i < Count; ++i) {
int t;
std::cin >> t;
List.push_back(t);
}
return List;
}
void Output(const TList &List) {
TList::const_iterator It = List.begin();
s... | [["-", 0, 14, 8, 9, 0, 1, 0, 27, 17, 29], ["-", 0, 14, 8, 9, 0, 1, 0, 27, 28, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 232 | 3 |
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int *a = new int[n];
for (int x = 0; x < n; x++)
cin >> a[x];
for (int i = 1; i < n; i++) {
int v = a[i];
int j = i - 1;
while (j >= 0 && a[j] > v) {
a[j + 1] = a[j];
a[j] = v;
j--;
}
for (int y... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int *a = new int[n];
for (int x = 0; x < n; x++)
cin >> a[x];
for (int i = 0; i < n; i++) {
int v = a[i];
int j = i - 1;
while (j >= 0 && a[j] > v) {
a[j + 1] = a[j];
a[j] = v;
j--;
}
for (int y... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 169 | 2 |
#include <iostream>
using namespace std;
int main() {
int a[100], n, v, j;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n - 1; i++)
cout << a[i] << ' ';
cout << a[n - 1] << endl;
for (int i = 0; i < n; i++) {
v = a[i];
j = i - 1;
while (j >= 0 && a[j] > v) {
... | #include <iostream>
using namespace std;
int main() {
int a[100], n, v, j;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n - 1; i++)
cout << a[i] << ' ';
cout << a[n - 1] << endl;
for (int i = 1; i < n; i++) {
v = a[i];
j = i - 1;
while (j >= 0 && a[j] > v) {
... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 196 | 2 |
#include <iostream>
#include <vector>
using namespace std;
void print(vector<int> v) {
for (vector<int>::iterator itr = v.begin(); itr != v.end(); itr++) {
if (itr != v.begin()) {
cout << ' ';
}
cout << *itr;
}
cout << endl;
}
int main(int argc, char *argv[]) {
int N;
cin >> N;
vector<i... | #include <iostream>
#include <vector>
using namespace std;
void print(vector<int> v) {
for (vector<int>::iterator itr = v.begin(); itr != v.end(); itr++) {
if (itr != v.begin()) {
cout << ' ';
}
cout << *itr;
}
cout << endl;
}
int main(int argc, char *argv[]) {
int N;
cin >> N;
vector<i... | [["+", 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 | 212 | 5 |
#include <bits/stdc++.h>
using namespace std;
void trace(int A[], int N) {
for (int i = 0; i < N; i++) {
if (i > 0)
cout << " ";
cout << A[i];
}
cout << endl;
}
void insertionSort(int A[], int N) {
int v, i, j;
for (i = 1; i <= N - 1; i++) {
v = A[i];
j = i - 1;
while (j >= 0 && A[j]... | #include <bits/stdc++.h>
using namespace std;
void trace(int A[], int N) {
for (int i = 0; i < N; i++) {
if (i > 0)
cout << " ";
cout << A[i];
}
cout << endl;
}
void insertionSort(int A[], int N) {
int v, i, j;
for (i = 1; i <= N - 1; i++) {
v = A[i];
j = i - 1;
while (j >= 0 && A[j]... | [["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46], ["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46]] | 1 | 211 | 2 |
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
// implement insertion sort
// output every result along each step
int count;
cin >> count;
int *list = new int[count];
for (int i = 0; i < count; i++) {
cin >> list[i];
}
for (int k = 0; k < count; k++) {
cout << lis... | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
// implement insertion sort
// output every result along each step
int count;
cin >> count;
int *list = new int[count];
for (int i = 0; i < count; i++) {
cin >> list[i];
}
for (int k = 0; k < count; k++) {
cout << lis... | [["+", 0, 14, 8, 9, 0, 1, 0, 16, 31, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 223 | 4 |
#include <stdio.h>
void inserctionSort(int A[], int N);
void print(int A[], int N);
int main() {
int N, i, j;
int A[1000];
scanf("%d", &N);
for (i = 0; i < N; i++)
scanf("%d", &A[i]);
print(A, N);
inserctionSort(A, N);
return 0;
}
void inserctionSort(int A[], int N) {
int i, j;
int v;
... | #include <stdio.h>
void inserctionSort(int A[], int N);
void print(int A[], int N);
int main() {
int N, i, j;
int A[1000];
scanf("%d", &N);
for (i = 0; i < N; i++)
scanf("%d", &A[i]);
print(A, N);
inserctionSort(A, N);
return 0;
}
void inserctionSort(int A[], int N) {
int i, j;
int v;
... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 258 | 2 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
template <class T> void print_vec(const vector<T> &v) {
for (auto t = begin(v); t != end(v);) {
cout << *t;
if (++t != end(v)) {
cout << " ";
}
}
cout << endl;
}
vector<int> insertionSort(const vector<int> &a, co... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
template <class T> void print_vec(const vector<T> &v) {
for (auto t = begin(v); t != end(v);) {
cout << *t;
if (++t != end(v)) {
cout << " ";
}
}
cout << endl;
}
vector<int> insertionSort(const vector<int> &a, co... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 259 | 2 |
#include <iostream>
namespace myspace {
class vector {
public:
void push_back(int);
int size();
int &operator[](int);
vector();
~vector();
private:
int s;
int *box;
};
vector::vector() {
box = NULL;
s = 0;
}
vector::~vector() {
if (box)
delete[] box;
}
int &vector::operator[](int i) { retu... | #include <iostream>
namespace myspace {
class vector {
public:
void push_back(int);
int size();
int &operator[](int);
vector();
~vector();
private:
int s;
int *box;
};
vector::vector() {
box = NULL;
s = 0;
}
vector::~vector() {
if (box)
delete[] box;
}
int &vector::operator[](int i) { retu... | [["+", 49, 53, 54, 55, 0, 56, 49, 352, 0, 67]] | 1 | 374 | 2 |
#include <stdio.h>
// include<algorithm>
// 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");
}
void insertionSort(int a[], int n) {
int j, i, v;
for (int i = 1; i < n; i++) {
v = a[i];
for (... | #include <stdio.h>
// include<algorithm>
// 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");
}
void insertionSort(int a[], int n) {
int j, i, v;
for (int i = 1; i < n; i++) {
v = a[i];
for (... | [["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46], ["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46]] | 1 | 237 | 2 |
#include <iostream>
using namespace std;
int main() {
int i, j, v, n, A[101];
cin >> n;
for (i = 0; i < n; i++) {
cin >> A[i];
}
for (i = 0; i < n; i++) {
cout << A[i];
if (i != n - 1)
cout << " ";
}
cout << endl;
for (i = 1; i <= n - 1; i++) {
v = A[i];
j = i - 1;
while... | #include <iostream>
using namespace std;
int main() {
int i, j, v, n, A[101];
cin >> n;
for (i = 0; i < n; i++) {
cin >> A[i];
}
for (i = 0; i < n; i++) {
cout << A[i];
if (i != n - 1)
cout << " ";
}
cout << endl;
for (i = 1; i <= n - 1; i++) {
v = A[i];
j = i - 1;
while... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 79], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 79], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 31, 22]] | 1 | 205 | 4 |
#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 > 1)
cout << " ";
cout << A[i];
}
cout << endl;
}
void InsertionSort(int A[], int n) {
for (int i = 1; i < n; i++) {
int targetA = A[i];
int j = i - 1;
wh... | #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 InsertionSort(int A[], int n) {
for (int i = 1; i < n; i++) {
int targetA = A[i];
int j = i - 1;
wh... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 211 | 2 |
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int num[n];
for (int i = 0; i < n; i++) {
cin >> num[i];
}
for (int i = 0; i < n; i++) {
for (int s = 0; s < i - 1; s++) {
if (num[i] < num[s]) {
swap(num[i], num[s]);
}
}
for (int t = 0; t < n - 1; t... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int num[n];
for (int i = 0; i < n; i++) {
cin >> num[i];
}
for (int i = 0; i < n; i++) {
for (int s = 0; s < i; s++) {
if (num[i] < num[s]) {
swap(num[i], num[s]);
}
}
for (int t = 0; t < n - 1; t++) ... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 152 | 2 |
#include <stdio.h>
void swap(int *a, int *b) {
int c;
c = *a;
*a = *b;
*b = c;
}
int main(void) {
int i, j, l, N;
int a[100];
scanf("%d", &N);
for (i = 0; i < N - 1; i++) {
scanf("%d ", &a[i]);
}
scanf("%d", &a[N - 1]);
for (l = 0; l < N; l++) {
for (j = 0; j < N - 1; j++) {
printf("... | #include <stdio.h>
void swap(int *a, int *b) {
int c;
c = *a;
*a = *b;
*b = c;
}
int main(void) {
int i, j, l, N;
int a[100];
scanf("%d", &N);
for (i = 0; i < N - 1; i++) {
scanf("%d ", &a[i]);
}
scanf("%d", &a[N - 1]);
for (l = 0; l < N; l++) {
for (j = 0; j < N - 1; j++) {
printf("... | [["+", 0, 7, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 62], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35]] | 1 | 217 | 7 |
#include <cstdio>
void trace(int A[], int N) {
for (int i = 0; i < N; ++i) {
if (i > 0)
printf(" ");
printf("%d", A[i]);
}
printf("/n");
}
void insertionSort(int A[], int N) {
for (int i = 1; i < N; ++i) {
int v = A[i];
int j = i - 1;
while (j >= 0 && A[j] > v) {
A[j + 1] = A[j... | #include <cstdio>
void trace(int A[], int N) {
for (int i = 0; i < N; ++i) {
if (i > 0)
printf(" ");
printf("%d", A[i]);
}
printf("\n");
}
void insertionSort(int A[], int N) {
for (int i = 1; i < N; ++i) {
int v = A[i];
int j = i - 1;
while (j >= 0 && A[j] > v) {
A[j + 1] = A[j... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 1 | 222 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a[100], n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 1; i < n; i++) {
int v = a[i];
int j = i - 1;
while (j >= 0 && a[j] > v) {
swap(a[j + 1], a[j]);
j--;
}
for (int k = 0; ... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a[100], n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++) {
int v = a[i];
int j = i - 1;
while (j >= 0 && a[j] > v) {
swap(a[j + 1], a[j]);
j--;
}
for (int k = 0; ... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 156 | 2 |
#include <stdio.h>
void trace(int A[], int N) {
int i;
for (i = 0; i < N; i++) {
if (i > 0)
printf(" ");
printf("%d", A[i]);
}
}
void insertionSort(int A[], int N) {
int j, i, v;
for (i = 1; i < N; i++) {
v = A[i];
j = i - 1;
while (j >= 0 && A[j] > v) {
A[j + 1] = A[j];
... | #include <stdio.h>
void trace(int A[], int N) {
int i;
for (i = 0; i < N; i++) {
if (i > 0)
printf(" ");
printf("%d", A[i]);
}
printf("\n");
}
void insertionSort(int A[], int N) {
int j, i, v;
for (i = 1; i < N; i++) {
v = A[i];
j = i - 1;
while (j >= 0 && A[j] > v) {
A[j + ... | [["+", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 62], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 224 | 7 |
#include <stdio.h>
#define N 100
void trace(int A[], int n) {
int i;
for (i = 0; i < n; i++) {
printf("%d", A[i]);
if (i + 1 < n)
printf(" ");
}
printf("\n");
}
void insertionSort(int A[], int n) {
int i, j, v;
for (i = 0; i < n; i++) {
v = A[i];
j = i - 1;
while (j >= 0 && A[j... | #include <stdio.h>
#define N 100
void trace(int A[], int n) {
int i;
for (i = 0; i < n; i++) {
printf("%d", A[i]);
if (i + 1 < n)
printf(" ");
}
printf("\n");
}
void insertionSort(int A[], int n) {
int i, j, v;
for (i = 1; i < n; i++) {
v = A[i];
j = i - 1;
while (j >= 0 && A[j... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13]] | 1 | 233 | 2 |
#include <iostream>
using namespace std;
int main() {
int n;
int i = 0, j = 0, v;
cin >> n;
int a[n];
for (i = 0; i < n; i++)
cin >> a[i];
for (i = 0; i < n - 1; i++)
cout << a[i] << " ";
cout << a[i + 1] << endl;
//?????????
for (i = 1; i < n; i++) {
v = a[i];
j = i - 1;
while (... | #include <iostream>
using namespace std;
int main() {
int n;
int i = 0, j = 0, v;
cin >> n;
int a[n];
for (i = 0; i < n; i++)
cin >> a[i];
for (i = 0; i < n - 1; i++)
cout << a[i] << " ";
cout << a[n - 1] << endl;
//?????????
for (i = 1; i < n; i++) {
v = a[i];
j = i - 1;
while (... | [["-", 31, 16, 12, 69, 341, 342, 0, 16, 31, 22], ["-", 31, 16, 12, 69, 341, 342, 0, 16, 17, 72], ["+", 31, 16, 12, 69, 341, 342, 0, 16, 31, 22], ["+", 31, 16, 12, 69, 341, 342, 0, 16, 17, 33]] | 1 | 201 | 8 |
#include <iostream>
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;
}
void insertionSort(int A[], int N) {
int j, i, v;
for (int i = 1; i < N; i++) {
v = A[i];
j = i - 1;
while (j >= 0 && A[j... | #include <iostream>
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;
}
void insertionSort(int A[], int N) {
int j, i, v;
for (int i = 1; i < N; i++) {
v = A[i];
j = i - 1;
while (j >= 0 && A[j... | [["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 22], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13]] | 1 | 215 | 2 |
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
void print(const vector<int> &data) {
if (data.empty())
return;
for (int i = 0; i < data.size(); ++i) {
cout << data[i];
if (i != data.size() - 1)
cout << " ";
e... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
void print(const vector<int> &data) {
if (data.empty())
return;
for (int i = 0; i < data.size(); ++i) {
cout << data[i];
if (i != data.size() - 1)
cout << " ";
e... | [["+", 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 | 233 | 5 |
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
long long cnt;
struct SSS {
string str;
int val;
SSS(string s = "", int v = 0) : str(s), val(v){};
};
void print(vector<SSS> &data) {
for (int i = 0; i... | #include <iostream>
#include <map>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
long long cnt;
struct SSS {
string str;
int val;
SSS(string s = "", int v = 0) : str(s), val(v){};
};
void print(vector<SSS> &data) {
for (int i = 0; i... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 317 | 2 |
#include <iostream>
using namespace std;
int main() {
int n, j, key;
cin >> n;
int *a = new int[n];
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 1; i < n; i++) {
key = a[i];
j = i - 1;
while ((j >= 0) && (a[j] > key)) {
a[j + 1] = a[j];
j--;
a[j + 1] = key;
}
... | #include <iostream>
using namespace std;
int main() {
int n, j, key;
cin >> n;
int *a = new int[n];
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++) {
key = a[i];
j = i - 1;
while ((j >= 0) && (a[j] > key)) {
a[j + 1] = a[j];
j--;
a[j + 1] = key;
}
... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 167 | 2 |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define rep(i, n) FOR(i, 0, n)
#define DEBUG(x) cout << #x << ": " << x << endl
#define vint vector<int>
#define vdouble ve... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define rep(i, n) FOR(i, 0, n)
#define DEBUG(x) cout << #x << ": " << x << endl
#define vint vector<int>
#define vdouble ve... | [["-", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["+", 0, 30, 0, 14, 8, 9, 0, 37, 0, 38], ["+", 0, 30, 0, 14, 8, 9, 0, 37, 0, 13]] | 1 | 270 | 5 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int size;
int A[100];
cin >> size;
for (int i = 0; i < size; ++i) {
cin >> A[i];
}
int key;
for (int i = 0; i < size; ++i) {
int j = i - 1;
while (j >= 0 && A[j] > A[j + 1]) {
key = A[j + 1];
A[j + 1] = A[j]... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int size;
int A[100];
cin >> size;
for (int i = 0; i < size; ++i) {
cin >> A[i];
}
int key;
for (int i = 0; i < size; ++i) {
int j = i - 1;
while (j >= 0 && A[j] > A[j + 1]) {
key = A[j + 1];
A[j + 1] = A[j]... | [["+", 0, 52, 8, 9, 0, 1, 0, 27, 17, 68], ["+", 0, 52, 8, 9, 0, 1, 0, 27, 28, 22], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 1 | 165 | 3 |
#include <algorithm>
#include <iostream>
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;
}
/*?????\????????????0?????????????????????*/
void insertionSort(i... | #include <algorithm>
#include <iostream>
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;
}
/*?????\????????????0?????????????????????*/
void insertionSort(int... | [["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46], ["-", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 228 | 2 |
#include <stdio.h>
void trace(int A[], int N) {
int i;
for (i = 0; i < N; i++) {
if (i > 0)
printf(" ");
printf("%d", A[i]);
}
printf("\n");
}
void insertionSort(int A[], int N) {
int i, j, v;
for (i = 1; i < N; i++) {
j = i - 1;
v = A[i];
while (j >= 0 && A[j] > v) {
A[j +... | #include <stdio.h>
void trace(int A[], int N) {
int i;
for (i = 0; i < N; i++) {
if (i > 0)
printf(" ");
printf("%d", A[i]);
}
printf("\n");
}
void insertionSort(int A[], int N) {
int i, j, v;
for (i = 1; i < N; i++) {
j = i - 1;
v = A[i];
while (j >= 0 && A[j] > v) {
A[j +... | [["-", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22]] | 1 | 234 | 4 |
#ifdef LOCAL_BUILD
#include "pch.h"
#define DLOG(msg) cout << "#" << __LINE__ << ":" << msg << endl;
#else
#include <bits/stdc++.h>
#define DLOG(msg)
#endif
using namespace std;
template <typename T> void print(T &seq) {
for (auto it = seq.begin(); it != seq.end(); ++it) {
cout << *it;
if (distance(it, seq.e... | #ifdef LOCAL_BUILD
#include "pch.h"
#define DLOG(msg) cout << "#" << __LINE__ << ":" << msg << endl;
#else
#include <bits/stdc++.h>
#define DLOG(msg)
#endif
using namespace std;
template <typename T> void print(T &seq) {
for (auto it = seq.begin(); it != seq.end(); ++it) {
cout << *it;
if (distance(it, seq.e... | [["+", 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 | 222 | 5 |
//
// main.cpp
// AutoAnswerSheets
//
// Created by Niko@LOS on 2017/03/07.
//
//
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
// insert code here...
int n;
cin >> n;
vector<int> vec(n);
for (int i = 0; i < n; i++)
cin >> vec[i];
for (int j = 0; j < ve... | //
// main.cpp
// AutoAnswerSheets
//
// Created by Niko@LOS on 2017/03/07.
//
//
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
// insert code here...
int n;
cin >> n;
vector<int> vec(n);
for (int i = 0; i < n; i++)
cin >> vec[i];
for (int j = 0; j < ve... | [["+", 8, 1, 0, 16, 31, 16, 12, 69, 28, 22], ["+", 0, 16, 31, 16, 12, 69, 341, 342, 0, 70], ["+", 0, 16, 31, 16, 12, 69, 341, 342, 0, 73]] | 1 | 222 | 6 |
#include <algorithm>
#include <cstdio>
#define MAX_N 100
using namespace std;
int num[MAX_N];
void printNum(int n) {
int i;
printf("%d", num[0]);
for (i = 1; i < n; i++) {
printf(" %d", num[i]);
}
printf("\n");
}
int main() {
int i, j, k, n;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf(... | #include <algorithm>
#include <cstdio>
#define MAX_N 100
using namespace std;
int num[MAX_N];
void printNum(int n) {
int i;
printf("%d", num[0]);
for (i = 1; i < n; i++) {
printf(" %d", num[i]);
}
printf("\n");
}
int main() {
int i, j, k, n;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf(... | [["+", 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 | 206 | 5 |
#include "bits/stdc++.h"
using namespace std;
int A[100];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &A[i]);
printf("%d", A[0]);
for (int i = 1; i < n; i++)
printf(" %d", A[i]);
for (int i = 1; i < n; i++) {
int j = i - 1;
int v = A[i];
while (j >= 0 && ... | #include "bits/stdc++.h"
using namespace std;
int A[100];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &A[i]);
printf("%d", A[0]);
for (int i = 1; i < n; i++)
printf(" %d", A[i]);
printf("\n");
for (int i = 1; i < n; i++) {
int j = i - 1;
int v = A[i];
w... | [["+", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 62], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 213 | 7 |
#include <cstdio>
#include <iostream>
using namespace std;
void swap(int *a, int *b) {
int tmp = *a;
*a = *b;
*b = tmp;
}
void InsertionSort(int n, int a[]) {
for (int j = 0; j < n; j++) {
if (j != n - 1)
cout << a[j] << " ";
cout << a[j];
}
cout << endl;
for (int i = 1; i < n; i++) {
... | #include <cstdio>
#include <iostream>
using namespace std;
void swap(int *a, int *b) {
int tmp = *a;
*a = *b;
*b = tmp;
}
void InsertionSort(int n, int a[]) {
for (int j = 0; j < n; j++) {
if (j != n - 1)
cout << a[j] << " ";
else
cout << a[j];
}
cout << endl;
for (int i = 1; i < n; ... | [["+", 0, 7, 8, 9, 0, 57, 75, 76, 0, 95]] | 1 | 263 | 1 |
#include <iostream>
#include <vector>
void trace(int a[], int n) {
for (int i = 0; i < n - 1; i++)
std::cout << a[i] << " ";
std::cout << a[n] << std::endl;
}
int main() {
int n;
std::cin >> n;
int a[100]; // n is larger than 0 and smaller than 101
for (int i = 0; i < n; i++) {
std::cin >> a[i]... | #include <iostream>
#include <vector>
void trace(int a[], int n) {
for (int i = 0; i < n - 1; i++)
std::cout << a[i] << " ";
std::cout << a[n - 1] << std::endl;
}
int main() {
int n;
std::cin >> n;
int a[100]; // n is larger than 0 and smaller than 101
for (int i = 0; i < n; i++) {
std::cin >> ... | [["+", 31, 16, 12, 69, 341, 342, 0, 16, 17, 33], ["+", 31, 16, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 208 | 2 |
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int a[105];
for (int i = 0; i < N; i++)
cin >> a[i];
int first = 1;
for (int j = 0; j < N; j++) {
if (first)
first = 0;
else
cout << " ";
cout << a[j];
}
for (int i = 1; i < N; i++) {
int f = 1;
i... | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int a[105];
for (int i = 0; i < N; i++)
cin >> a[i];
int first = 1;
for (int j = 0; j < N; j++) {
if (first)
first = 0;
else
cout << " ";
cout << a[j];
}
cout << endl;
for (int i = 1; i < N; i++) {
i... | [["+", 0, 14, 8, 9, 0, 1, 0, 16, 31, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 211 | 4 |
#include <iostream>
using namespace std;
int main() {
int n, a[101], key, j;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++) {
cout << a[i];
if (i < n - 1)
cout << " ";
}
cout << endl;
for (int i = 1; i < n; i++) {
key = a[i];
j = i - 1;
while ... | #include <iostream>
using namespace std;
int main() {
int n, a[101], key, j;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++) {
cout << a[i];
if (i < n - 1)
cout << " ";
}
cout << endl;
for (int i = 1; i < n; i++) {
key = a[i];
j = i - 1;
while ... | [["-", 0, 1, 0, 16, 12, 69, 341, 342, 0, 22], ["+", 0, 1, 0, 16, 12, 69, 341, 342, 0, 22]] | 1 | 202 | 2 |
#include <cstdio>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int A[n];
for (int i = 0; i < n; i++) {
scanf("%d", A[i]);
}
for (int foc = 0; foc < n; foc++) {
int key = A[foc];
int j = foc - 1;
while (j >= 0 && A[j] > key) {
A[j + 1] = A[j];
j--;
}
A[j + 1]... | #include <cstdio>
using namespace std;
int main() {
int n;
scanf("%d", &n);
// printf("%d",n);
int A[n];
for (int i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
for (int foc = 0; foc < n; foc++) {
int key = A[foc];
int j = foc - 1;
while (j >= 0 && A[j] > key) {
A[j + 1] = A[j];
j... | [["+", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67]] | 1 | 179 | 1 |
#include <iostream>
using namespace std;
int main() {
int n;
int key;
cin >> n;
int a[100000];
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++) {
key = a[i];
int j = i - 1;
while (j >= 0 && a[j] > key) {
a[j + 1] = a[j];
j--;
}
a[j + 1] = key;
cou... | #include <iostream>
using namespace std;
int main() {
int n;
int key;
cin >> n;
int a[100000];
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++) {
key = a[i];
int j = i - 1;
while (j >= 0 && a[j] > key) {
a[j + 1] = a[j];
j--;
}
a[j + 1] = key;
cou... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 159 | 2 |
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define rep(i, from, to) for (int i = from; i < to; ++i)
#define REP(i, from, to) for (int i = from; i <= to; ++i)
using namespace std;
typedef pair<int, int> P;
typedef pair<P, P> area;
typedef struct answer answer;
template <typename T>
ostr... | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define rep(i, from, to) for (int i = from; i < to; ++i)
#define REP(i, from, to) for (int i = from; i <= to; ++i)
using namespace std;
typedef pair<int, int> P;
typedef pair<P, P> area;
typedef struct answer answer;
template <typename T>
ostr... | [["+", 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 | 397 | 5 |
#include <iostream>
#define rep(i, first, to) for (ll i = first; i < to; ++i)
#define REP(i, first, to) for (ll i = first; i <= to; ++i)
using namespace std;
typedef long long ll;
int n;
int a[101];
void show(int *p) {
rep(i, 0, n - 1) { cout << p[i] << " "; }
cout << p[n - 1] << endl;
}
void solve() {
cin >>... | #include <iostream>
#define rep(i, first, to) for (ll i = first; i < to; ++i)
#define REP(i, first, to) for (ll i = first; i <= to; ++i)
using namespace std;
typedef long long ll;
int n;
int a[101];
void show(int *p) {
rep(i, 0, n - 1) { cout << p[i] << " "; }
cout << p[n - 1] << endl;
}
void solve() {
cin >>... | [["-", 0, 14, 8, 9, 0, 1, 0, 16, 31, 22], ["-", 0, 14, 8, 9, 0, 1, 0, 16, 17, 151], ["-", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 207 | 4 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctype.h>
#include <functional>
#include <iostream>
#include <numeric>
#include <sstream>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int count;
cin >> count;
int *s = new int[coun... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctype.h>
#include <functional>
#include <iostream>
#include <numeric>
#include <sstream>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int count;
cin >> count;
int *s = new int[coun... | [["+", 0, 14, 8, 9, 0, 1, 0, 16, 31, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 216 | 4 |
#include <algorithm>
#include <iostream>
using namespace std;
static const int MAX = 200000;
int main() {
int A[MAX], n;
int j, v;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> A[i];
}
for (int i = 1; i < n; i++) {
v = A[i];
j = i - 1;
while (j >= 0 && A[j] > v) {
A[j + 1] = A[j]... | #include <algorithm>
#include <iostream>
using namespace std;
static const int MAX = 200000;
int main() {
int A[MAX], n;
int j, v;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> A[i];
}
for (int i = 0; i < n; i++) {
v = A[i];
j = i - 1;
while (j >= 0 && A[j] > v) {
A[j + 1] = A[j]... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 169 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
void insert(int a[], int n) {
for (int i = 1; i <= n; i++) {
if (i > 1)
cout << " ";
cout << a[i];
}
cout << endl;
}
int main() {
i... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
void insert(int a[], int n) {
for (int i = 1; i <= n; i++) {
if (i > 1)
cout << " ";
cout << a[i];
}
cout << endl;
}
int main() {
i... | [["+", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 45], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 13], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 46], ["-", 0, 52, 15, 339, 51, 16, 31, 16, 17, 20], ["+", 0, 52, 15, 339, 51, 16, 31, 16, 17, 47]] | 1 | 199 | 6 |
#include <algorithm>
#include <iostream>
using namespace std;
static const int MAX = 1000;
class Insertion_Sort {
public:
int i, v, j, element;
void Sort(int A[], int N) {
for (int i = 1; i < N; i++) {
v = A[i];
j = 0;
while (j >= 0 && A[j] > v) {
A[j + 1] = A[j];
j--;
... | #include <algorithm>
#include <iostream>
using namespace std;
static const int MAX = 1000;
class Insertion_Sort {
public:
int i, v, j, element;
void Sort(int A[], int N) {
for (int i = 1; i < N; i++) {
v = A[i];
j = i - 1;
while (j >= 0 && A[j] > v) {
A[j + 1] = A[j];
j--;
... | [["-", 0, 7, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 31, 22], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 17, 33], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 12, 13]] | 1 | 246 | 4 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define forn(i, n) for (int i = 0; i < n; i++)
void print(vector<int> v) {
int n = v.size();
forn(i, n) { cout << v[i] << (i != n - 1 ? ' ' : '\n'); }
}
void insertionsort(vector<int> v, in... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define forn(i, n) for (int i = 0; i < n; i++)
void print(vector<int> v) {
int n = v.size();
forn(i, n) { cout << v[i] << (i != n - 1 ? ' ' : '\n'); }
}
void insertionsort(vector<int> v, in... | [["-", 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, 52, 15, 339, 0, 24], ["-", 0, 52, 15, 339, 51, 16, 31, 23, 0, 25]] | 1 | 227 | 4 |
#include <cstdio>
#include <iostream>
using namespace std;
#define MAXBOXNUM 1000
void out(int box[], int num);
int main() {
int num;
int box[MAXBOXNUM];
int i, j;
int tmp;
cin >> num;
for (i = 0; i < num; i++) {
cin >> box[i];
}
out(box, num);
for (i = 1; i < num; i++) {
tmp = box[i];
... | #include <cstdio>
#include <iostream>
using namespace std;
#define MAXBOXNUM 1000
void out(int box[], int num);
int main() {
int num;
int box[MAXBOXNUM];
int i, j;
int tmp;
cin >> num;
for (i = 0; i < num; i++) {
cin >> box[i];
}
out(box, num);
for (i = 1; i < num; i++) {
tmp = box[i];
... | [["-", 15, 339, 51, 16, 31, 23, 0, 16, 17, 20], ["+", 15, 339, 51, 16, 31, 23, 0, 16, 17, 47], ["-", 51, 16, 12, 23, 0, 16, 12, 69, 28, 22], ["-", 12, 23, 0, 16, 12, 69, 341, 342, 0, 70], ["-", 12, 23, 0, 16, 12, 69, 341, 342, 0, 73]] | 1 | 217 | 5 |
#include <iostream>
using namespace std;
void insertionSort(int *, int);
void trace(int *, int);
void insertionSort(int a[], int n) {
for (int i = 1; i < n; i++) {
int temp = a[i];
int j = i - 1;
while (j >= 0 && a[j] > temp) {
a[j + 1] = a[j];
j--;
}
a[j + 1] = temp;
trace(a, n... | #include <iostream>
using namespace std;
void insertionSort(int *, int);
void trace(int *, int);
void insertionSort(int a[], int n) {
for (int i = 1; i < n; i++) {
int temp = a[i];
int j = i - 1;
while (j >= 0 && a[j] > temp) {
a[j + 1] = a[j];
j--;
}
a[j + 1] = temp;
trace(a, n... | [["-", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22]] | 1 | 223 | 4 |
#include <iostream>
#include <vector>
class InsertionSort {
private:
std::vector<int> dataSet;
public:
InsertionSort(std::vector<int> dataSet);
void showArray();
void dataSort();
};
InsertionSort::InsertionSort(std::vector<int> dataSet) {
this->dataSet = dataSet;
}
void InsertionSort::showArray() {
for ... | #include <iostream>
#include <vector>
class InsertionSort {
private:
std::vector<int> dataSet;
public:
InsertionSort(std::vector<int> dataSet);
void showArray();
void dataSort();
};
InsertionSort::InsertionSort(std::vector<int> dataSet) {
this->dataSet = dataSet;
}
void InsertionSort::showArray() {
for ... | [["+", 8, 9, 0, 1, 0, 2, 63, 118, 119, 120], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 1, 0, 2, 63, 118, 28, 22], ["+", 8, 9, 0, 1, 0, 2, 63, 118, 17, 131]] | 1 | 284 | 6 |
#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 = 0;
cin >> N;
vector<int> A(N, 0);
for (int i = 0; i < N; i++) {
cin >> A[i];
if (i > 0) {
... | #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 = 0;
cin >> N;
vector<int> A(N, 0);
for (int i = 0; i < N; i++) {
cin >> A[i];
if (i > 0) {
... | [["+", 0, 11, 31, 69, 341, 342, 0, 16, 17, 72], ["+", 0, 11, 31, 69, 341, 342, 0, 16, 12, 13]] | 1 | 211 | 2 |
#include <stdio.h>
void trace(int A[], int N) {
int i;
for (i = 0; i < N; i++) {
if (i > 0) {
printf(" ");
}
printf("%d", A[i]);
}
printf("\n");
}
void insertionSort(int A[], int N) {
int i, j, v;
for (i = 1; i < N; ++i) {
v = A[i];
j = i - 1;
while (j >= 0 && A[j] > v) {
... | #include <stdio.h>
void trace(int A[], int N) {
int i;
for (i = 0; i < N; i++) {
if (i > 0) {
printf(" ");
}
printf("%d", A[i]);
}
printf("\n");
}
void insertionSort(int A[], int N) {
int i, j, v;
for (i = 1; i < N; ++i) {
v = A[i];
j = i - 1;
while (j >= 0 && A[j] > v) {
... | [["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46], ["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46]] | 1 | 244 | 2 |
#include <cstdio>
using namespace std;
const int kMax = 100 + 5;
int n;
int num[kMax];
void print_num() {
for (int i = 0; i < n; ++i) {
if (i)
printf(" ");
printf("%d", num[i]);
}
printf("\n");
}
void solve() {
for (int i = 1; i < n; ++i) {
int j = i - 1;
int key = num[i];
while (... | #include <cstdio>
using namespace std;
const int kMax = 100 + 5;
int n;
int num[kMax];
void print_num() {
for (int i = 0; i < n; ++i) {
if (i)
printf(" ");
printf("%d", num[i]);
}
printf("\n");
}
void solve() {
print_num();
for (int i = 1; i < n; ++i) {
int j = i - 1;
int key = num[... | [["+", 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, 25], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 202 | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; ++i)
cin >> arr[i];
// algorithm
for (int i = 1; i < n; ++i) {
int key = arr[i];
int j = i - 1;
while (j >= 0 && arr[j] > key) {
arr[j + 1] = arr[j];
j--;
arr[j ... | #include <bits/stdc++.h>
using namespace std;
int main() {
// FILE *inp = freopen("in.txt", "r", stdin);
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; ++i)
cin >> arr[i];
// algorithm
for (int i = 0; i < n; ++i) {
int key = arr[i];
int j = i - 1;
while (j >= 0 && arr[j] > key) {
... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 158 | 2 |
#include <iostream>
#include <stdio.h>
#define MAX 101
int A[MAX];
int n;
void print() {
for (int i = 0; i < n; i++) {
if (i)
std::cout << " ";
std::cout << A[i];
}
std::cout << std::endl;
}
void insertionSort(int A[], int n) {
for (int i = 1; i < n; i++) {
int v = A[i];
int j = i - 1;
... | #include <iostream>
#include <stdio.h>
#define MAX 101
int A[MAX];
int n;
void print() {
for (int i = 0; i < n; i++) {
if (i)
std::cout << " ";
std::cout << A[i];
}
std::cout << std::endl;
}
void insertionSort(int A[], int n) {
for (int i = 1; i < n; i++) {
int v = A[i];
int j = i - 1;
... | [["+", 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, 25], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 205 | 4 |
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include ... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include ... | [["-", 10, 43, 49, 53, 54, 55, 0, 56, 39, 78], ["-", 54, 55, 0, 56, 49, 185, 54, 55, 0, 24], ["-", 54, 55, 0, 56, 49, 185, 54, 55, 0, 25]] | 1 | 257 | 3 |
#include <bits/stdc++.h>
#define pout(n) printf("%d\n", n)
#define rep(i, a, n) for (int i = a; i < n; i++)
#define per(i, n, a) for (int i = n - 1; i >= a; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
const int d4x[4] = {1, 0, -1, 0};
const int d4y[4] = {0, 1, 0, -1};
const int... | #include <bits/stdc++.h>
#define pout(n) printf("%d\n", n)
#define rep(i, a, n) for (int i = a; i < n; i++)
#define per(i, n, a) for (int i = n - 1; i >= a; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
const int d4x[4] = {1, 0, -1, 0};
const int d4y[4] = {0, 1, 0, -1};
const int... | [["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 279 | 4 |
#include <stdio.h>
void print_array(int a[], int n) {
int i = 0;
for (i = 0; i < n - 1; i++)
printf("%d ", a[i]);
printf("a[i]\n");
}
// inserion sort
void insertion_sort(int a[], int n) {
for (int i = 1; i < n; i++) {
int key = a[i];
/* insert A[i] into the sorted sequence A[0,...,j-1] */
int j... | #include <stdio.h>
void print_array(int a[], int n) {
int i = 0;
for (i = 0; i < n - 1; i++)
printf("%d ", a[i]);
printf("%d\n", a[i]);
}
// inserion sort
void insertion_sort(int a[], int n) {
for (int i = 1; i < n; i++) {
int key = a[i];
/* insert A[i] into the sorted sequence A[0,...,j-1] */
i... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["+", 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, 22], ["+", 0, 2, 3, 4, 0, 69, 341, 342, 0, 73]] | 1 | 222 | 7 |
#include <iostream>
#include <string>
using namespace std;
void show_me(int *a, size_t size) {
for (size_t i = 0; i < size; ++i) {
cout << (i == 0 ? "" : " ") << a[i];
}
cout << endl;
}
void insertion_sort(int *a, size_t size) {
int v;
for (int i = 1; i < size; ++i) {
v = a[i];
int j = i - 1;
... | #include <iostream>
#include <string>
using namespace std;
void show_me(int *a, size_t size) {
for (size_t i = 0; i < size; ++i) {
cout << (i == 0 ? "" : " ") << a[i];
}
cout << endl;
}
void insertion_sort(int *a, size_t size) {
int v;
for (int i = 1; i < size; ++i) {
v = a[i];
int j = i - 1;
... | [["-", 0, 7, 8, 9, 0, 1, 0, 16, 31, 22], ["-", 0, 7, 8, 9, 0, 1, 0, 16, 17, 151], ["-", 0, 7, 8, 9, 0, 1, 0, 16, 12, 22], ["-", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35]] | 1 | 214 | 4 |
#include <iostream>
#include <stdio.h>
using namespace std;
void insertionsort(int *num, int n) {
for (int i = 1; i < n; i++) {
int v = num[i];
int j = i - 1;
while (j >= 0 && num[j] > v) {
num[j + 1] = num[j];
j--;
}
num[j + 1] = v;
for (int m = 0; m < n; m++) {
printf("%d... | #include <iostream>
#include <stdio.h>
using namespace std;
void insertionsort(int *num, int n) {
for (int i = 0; i < n; i++) {
int v = num[i];
int j = i - 1;
while (j >= 0 && num[j] > v) {
num[j + 1] = num[j];
j--;
}
num[j + 1] = v;
for (int m = 0; m < n; m++) {
printf("%d... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 191 | 2 |
#include <stdio.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define repi(i, n) for (int i = 1; i < n; ++i)
int main(void) {
int n, i, j;
scanf("%d", &n);
int a[n];
rep(i, n) scanf("%d", &a[i]);
repi(i, n) {
rep(j, n) {
if (j)
printf(" %d", a[j]);
printf("%d", a[j]);
}
pri... | #include <stdio.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define repi(i, n) for (int i = 1; i < n; ++i)
int main(void) {
int n, i, j;
scanf("%d", &n);
int a[n];
rep(i, n) scanf("%d", &a[i]);
repi(i, n) {
rep(j, n) {
if (j)
printf(" %d", a[j]);
else
printf("%d", a[j]);
... | [["+", 0, 14, 8, 9, 0, 57, 75, 76, 0, 95]] | 1 | 218 | 2 |
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <sstream>
using namespace std;
void print(int *a, int n) {
for (int s = 0;;) {
cout << a[s];
s++;
if (s >= n)
break;
cout << 'a';
}
}
void InsertionSort(int *a, int n) {
for (int i = 1; i <... | #include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <sstream>
using namespace std;
void print(int *a, int n) {
for (int s = 0;;) {
cout << a[s];
s++;
if (s >= n)
break;
cout << ' ';
}
}
void InsertionSort(int *a, int n) {
for (int i = 1; i <... | [["-", 8, 9, 0, 1, 0, 16, 12, 103, 0, 125], ["+", 8, 9, 0, 1, 0, 16, 12, 103, 0, 125]] | 1 | 220 | 2 |
#include <iostream>
int main(int argc, char const *argv[]) {
using namespace std;
int n;
cin >> n;
int *a = new int[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n - 1; i++) {
cout << a[i] << ' ';
}
cout << a[n] << endl;
for (int i = 1; i < n; i++) {
int key = a[i... | #include <iostream>
int main(int argc, char const *argv[]) {
using namespace std;
int n;
cin >> n;
int *a = new int[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n - 1; i++) {
cout << a[i] << ' ';
}
cout << a[n - 1] << endl;
for (int i = 1; i < n; i++) {
int key =... | [["+", 31, 16, 12, 69, 341, 342, 0, 16, 17, 33], ["+", 31, 16, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 213 | 4 |
#include <iostream>
#include <stdio.h>
using namespace std;
void trace(int A[], int N) {
int len = N - 1;
for (int i = 0; i < len; ++i)
printf("%d ", A[i]);
printf("%d\n", A[len]);
}
void insertionSort(int A[], int N) {
for (int i = 0; i < N; ++i) {
int v = A[i];
int j = i - 1;
while (j >= 0 &... | #include <iostream>
#include <stdio.h>
using namespace std;
void trace(int A[], int N) {
int len = N - 1;
for (int i = 0; i < len; ++i)
printf("%d ", A[i]);
printf("%d\n", A[len]);
}
void insertionSort(int A[], int N) {
for (int i = 1; i < N; ++i) {
int v = A[i];
int j = i - 1;
while (j >= 0 &... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 215 | 2 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, a;
vector<int> v(1, 0);
cin >> n;
while (n--) {
cin >> a;
v.push_back(a);
}
for (int j = 1; j < n + 1; j++) {
int key = v[j];
int i = j - 1;
while (i > 0 && key < v[i]) {
v[i + 1] = v[i];
i--;
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, a;
vector<int> v(1, 0);
cin >> n;
while (n--) {
cin >> a;
v.push_back(a);
}
for (int j = 1; j < v.size(); j++) {
int key = v[j];
int i = j - 1;
while (i > 0 && key < v[i]) {
v[i + 1] = v[i];
i--;
... | [["-", 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, 7, 15, 16, 12, 2, 63, 118, 28, 22], ["+", 0, 7, 15, 16, 12, 2, 63, 118, 17, 131], ["+", 0, 7, 15, 16, 12, 2, 63, 118, 119, 120], ["+", 0, 7, 15, 16, 12, 2, 3, 4, 0, 24], ["+", 0, 7,... | 1 | 168 | 8 |
#include <stdio.h>
void trace(int A[], int N) {
for (int i = 0; i < N; i++) {
if (i > 0) {
printf(" ");
}
printf("%d", &A[i]);
}
printf("\r\n");
}
void insertSort(int A[], int N) {
int v, j;
for (int i = 0; i < N; i++) {
v = A[i];
j = i - 1;
while (j >= 0 && A[j] > v) {
... | #include <stdio.h>
void trace(int A[], int N) {
for (int i = 0; i < N; i++) {
if (i > 0) {
printf(" ");
}
printf("%d", A[i]);
}
printf("\r\n");
}
void insertSort(int A[], int N) {
int v, j;
for (int i = 1; i < N; i++) {
v = A[i];
j = i - 1;
while (j >= 0 && A[j] > v) {
A... | [["-", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67], ["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 230 | 3 |
#include <iostream>
void insertionsort(int A[], int n) {
int v, j;
for (int i = 1; i < n; i++) {
v = A[i];
j = i - 1;
while (j >= 0 && A[j] > v) {
A[j + 1] = A[j];
j--;
}
A[j + 1] = v;
for (int k = 0; k < n; k++) {
std::cout << A[k];
if (k < n - 1) {
std::cout... | #include <iostream>
void insertionsort(int A[], int n) {
int v, j;
for (int i = 0; i < n; i++) {
v = A[i];
j = i - 1;
while (j >= 0 && A[j] > v) {
A[j + 1] = A[j];
j--;
}
A[j + 1] = v;
for (int k = 0; k < n; k++) {
std::cout << A[k];
if (k < n - 1) {
std::cout... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 205 | 2 |
/*
* ITP1_6_B.cpp
*
* Created on: Apr 20, 2018
* Author: 13743
*/
#include <iostream>
using namespace std;
void printSeq(int *s, int n) {
cout << s[0];
for (int i = 1; i < n; i++) {
cout << " " << s[i];
}
}
int main() {
int N;
int seq[100];
cin >> N;
for (int i = 0; i < N; i++) {
ci... | /*
* ITP1_6_B.cpp
*
* Created on: Apr 20, 2018
* Author: 13743
*/
#include <iostream>
using namespace std;
void printSeq(int *s, int n) {
cout << s[0];
for (int i = 1; i < n; i++) {
cout << " " << s[i];
}
cout << endl;
}
int main() {
int N;
int seq[100];
cin >> N;
for (int i = 0; i < ... | [["+", 0, 14, 8, 9, 0, 1, 0, 16, 31, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 179 | 4 |
#include <iostream>
int main() {
int N, v, j;
std::cin >> N;
int A[N];
for (int i = 0; i < N; i++) {
std::cin >> A[i];
}
for (int i = 0; i < N; i++) {
if (i == N - 1) {
std::cout << A[i];
} else {
std::cout << A[i] << " ";
}
}
std::cout << "\n";
for (int i = 1; i < ... | #include <iostream>
int main() {
int N, v, j;
std::cin >> N;
int A[N];
for (int i = 0; i < N; i++) {
std::cin >> A[i];
}
for (int i = 0; i < N; i++) {
if (i == N - 1) {
std::cout << A[i];
} else {
std::cout << A[i] << " ";
}
}
std::cout << "\n";
for (int i = 1; i < ... | [["-", 0, 1, 0, 16, 12, 69, 341, 342, 0, 22], ["+", 0, 1, 0, 16, 12, 69, 341, 342, 0, 22]] | 1 | 241 | 2 |
#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 InsertSort(int a[], int N) {
int buff, key, j;
for (key = 1; key < N; key++) {
buff = a[key];
j = key - 1;
wh... | #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 InsertSort(int a[], int N) {
int buff, key, j;
for (key = 1; key < N; key++) {
buff = a[key];
j = key - 1;
wh... | [["-", 15, 339, 51, 91, 28, 23, 0, 16, 17, 33], ["+", 15, 339, 51, 91, 28, 23, 0, 16, 17, 72], ["-", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22]] | 1 | 238 | 6 |
#include <algorithm>
#include <iostream>
#include <sstream>
#include <string>
using namespace std;
static const int MAX = 100;
void insertionSort(int T[], int n) {
for (int i = 1; i < n - 1; i++) {
int v = T[i];
int j = i - 1;
while ((j >= 0) && (T[j] > v)) {
T[j + 1] = T[j];
j--;
}
... | #include <algorithm>
#include <iostream>
#include <sstream>
#include <string>
using namespace std;
static const int MAX = 100;
void insertionSort(int T[], int n) {
for (int i = 1; i < n; i++) {
int v = T[i];
int j = i - 1;
while ((j >= 0) && (T[j] > v)) {
T[j + 1] = T[j];
j--;
}
T[j ... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 277 | 2 |
#include <iostream>
using namespace std;
int main() {
int N, A[110];
cin >> N;
for (int i = 0; i < N; i++)
cin >> A[i];
for (int i = 1; i < N; i++) {
int j = i - 1, v = A[i];
while (j >= 0 && A[j] > v) {
A[j + 1] = A[j];
j--;
}
A[j + 1] = v;
for (int k = 0; k < N - 1; k++)
... | #include <iostream>
using namespace std;
int main() {
int N, A[110];
cin >> N;
for (int i = 0; i < N; i++)
cin >> A[i];
for (int i = 0; i < N; i++) {
int j = i - 1, v = A[i];
while (j >= 0 && A[j] > v) {
A[j + 1] = A[j];
j--;
}
A[j + 1] = v;
for (int k = 0; k < N - 1; k++)
... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 155 | 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];
}
for (int i = 1; i < N; i++) {
int key = A[i];
int j = i - 1;
while (A[j] > key & j >= 0) {
A[j + 1] = A[j];
j--;
}
A[j + 1] = key;
for (int k ... | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int A[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
int key = A[i];
int j = i - 1;
while (A[j] > key & j >= 0) {
A[j + 1] = A[j];
j--;
}
A[j + 1] = key;
for (int k ... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 158 | 2 |
#include <iostream>
using namespace std;
int main() {
int n, j, v = 0;
cin >> n;
int num[n];
for (int i = 0; i < n; i++) {
cin >> num[i];
if (i != 0)
cout << " ";
cout << num[i];
}
cout << endl;
for (int i = 1; i < sizeof(num) / sizeof(int) - 1; i++) {
v = num[i];
j = i - 1;
... | #include <iostream>
using namespace std;
int main() {
int n, j, v = 0;
cin >> n;
int num[n];
for (int i = 0; i < n; i++) {
cin >> num[i];
if (i != 0)
cout << " ";
cout << num[i];
}
cout << endl;
for (int i = 1; i < sizeof(num) / sizeof(int); i++) {
v = num[i];
j = i - 1;
whi... | [["-", 12, 16, 12, 105, 51, 74, 51, 91, 17, 33], ["-", 12, 16, 12, 105, 51, 74, 51, 91, 28, 13], ["-", 0, 1, 0, 16, 12, 69, 341, 342, 0, 22], ["+", 0, 1, 0, 16, 12, 69, 341, 342, 0, 22]] | 1 | 204 | 6 |
#include <algorithm>
#include <iomanip>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define SZ(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define printA(arr) ... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define SZ(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define printA(arr) ... | [["+", 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], ["-", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35]] | 1 | 172 | 6 |
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define outl(x) cout << (x) << '\n'
using namespace std;
using pii = pair<int, int>;
void print(int a[], int n) {
rep(i, n) { printf("%d%c", a[i], i + 1 < n ? ' ' : '\n'); }... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define outl(x) cout << (x) << '\n'
using namespace std;
using pii = pair<int, int>;
void print(int a[], int n) {
rep(i, n) { printf("%d%c", a[i], i + 1 < n ? ' ' : '\n'); }... | [["-", 0, 52, 15, 339, 51, 16, 31, 16, 17, 47], ["+", 0, 52, 15, 339, 51, 16, 31, 16, 17, 20]] | 1 | 211 | 2 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 1; i < n; i++) {
for (int j = i - 1; j >= 0; j--) {
if (a[j] > a[j + 1])
swap(a[j], ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++) {
for (int j = i - 1; j >= 0; j--) {
if (a[j] > a[j + 1])
swap(a[j], ... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 165 | 2 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.