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 pt(int *, int, int);
int main() {
int a[100000], i, x, j;
scanf("%d", &x);
for (i = 0; i < x; i++)
scanf("%d", &a[i]);
j = pt(a, 1, x - 1);
for (i = 0; i < x; i++) {
if (i == x - 1)
printf("%d\n", a[i]);
else {
if (i == j)
printf("[%d] ", a[i]);
e... | #include <stdio.h>
int pt(int *, int, int);
int main() {
int a[100000], i, x, j;
scanf("%d", &x);
for (i = 0; i < x; i++)
scanf("%d", &a[i]);
j = pt(a, 0, x - 1);
for (i = 0; i < x; i++) {
if (i == x - 1)
printf("%d\n", a[i]);
else {
if (i == j)
printf("[%d] ", a[i]);
e... | [["-", 0, 1, 0, 11, 12, 2, 3, 4, 0, 13], ["+", 0, 1, 0, 11, 12, 2, 3, 4, 0, 13]] | 0 | 275 | 2 |
#include <stdio.h>
#define MAX 100000
int partition(int, int);
int A[MAX], n;
int main() {
int i, q;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
q = partition(0, n - 1);
for (i = 0; i < n; i++) {
if (i == q)
printf("[");
if (i < n - 1 && i != q)
printf("%d ", A[... | #include <stdio.h>
#define MAX 100000
int partition(int, int);
int A[MAX], n;
int main() {
int i, q;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
q = partition(0, n - 1);
for (i = 0; i < n; i++) {
if (i == q)
printf("[");
if (i < n - 1 && i != q)
printf("%d ", A[... | [["+", 0, 7, 8, 9, 0, 57, 75, 76, 0, 95], ["+", 0, 57, 15, 23, 0, 16, 12, 16, 17, 33], ["+", 0, 57, 15, 23, 0, 16, 12, 16, 12, 13]] | 0 | 304 | 3 |
#include <stdio.h>
#define N 100000
int partition(int *, int, int);
int main() {
int n, i, a[N], p;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
p = partition(a, 0, n - 1);
for (i = 0; i < n - 1; i++) {
if (i == p) {
printf("[%d] ", a[i]);
} else {
printf("%d "... | #include <stdio.h>
#define N 100000
int partition(int *, int, int);
int main() {
int n, i, a[N], p;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
p = partition(a, 0, n - 1);
for (i = 0; i < n - 1; i++) {
if (i == p) {
printf("[%d] ", a[i]);
} else {
printf("%d "... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 19]] | 0 | 276 | 2 |
#include <stdio.h>
int main() {
int a, b[100000], c = 0, d, i;
scanf("%d", &a);
for (i = 0; i < a; i++)
scanf("%d", &b[i]);
for (i = 0; i < a - 1; i++) {
if (b[a - 1] > b[i]) {
d = b[i];
b[i] = b[c];
b[c] = d;
c++;
}
}
d = b[a - 1];
b[a - 1] = b[c];
b[c] = d;
for (... | #include <stdio.h>
int main() {
int a, b[100000], c = 0, d, i;
scanf("%d", &a);
for (i = 0; i < a; i++)
scanf("%d", &b[i]);
for (i = 0; i < a - 1; i++) {
if (b[a - 1] >= b[i]) {
d = b[i];
b[i] = b[c];
b[c] = d;
c++;
}
}
d = b[a - 1];
b[a - 1] = b[c];
b[c] = d;
for ... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 20]] | 0 | 217 | 2 |
#include <stdio.h>
#define max 10000
int partition(int part[], int start, int end) {
int x, i, j, temp;
x = part[end];
i = start - 1;
for (j = start; j <= end - 1; j++) {
if (part[j] <= x) {
i += 1;
//交換
temp = part[i];
part[i] = part[j];
part[j] = temp;
}
}
//交換
t... | #include <stdio.h>
#define max 100000
int partition(int part[], int start, int end) {
int x, i, j, temp;
x = part[end];
i = start - 1;
for (j = start; j <= end - 1; j++) {
if (part[j] <= x) {
i += 1;
//交換
temp = part[i];
part[i] = part[j];
part[j] = temp;
}
}
//交換
... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 275 | 4 |
#include <stdio.h>
#define N 100000
int partition(int *, int, int);
int main(void) {
int i, n, a, S[N];
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &S[i]);
a = partition(S, 0, n);
for (i = 0; i < n; i++) {
if (i == a)
printf("[%d]", S[i]);
else
printf("%d", S[i]);
if ... | #include <stdio.h>
#define N 100000
int partition(int *, int, int);
int main(void) {
int i, n, a, S[N];
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &S[i]);
a = partition(S, 0, n - 1);
for (i = 0; i < n; i++) {
if (i == a)
printf("[%d]", S[i]);
else
printf("%d", S[i]);
... | [["+", 0, 11, 12, 2, 3, 4, 0, 16, 17, 33], ["+", 0, 11, 12, 2, 3, 4, 0, 16, 12, 13]] | 0 | 279 | 2 |
#include <stdio.h>
int A[1000000];
int main() {
int i, n, key, temp, big = 0, sml = 0;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
key = A[n - 1];
for (i = 0; i < n; i++) {
if (i == 0 && key >= A[i]) {
sml++;
big++;
} else if (key >= A[i]) {
temp = A[i];
... | #include <stdio.h>
int A[1000000];
int main() {
int i, n, key, temp, big = 0, sml = 0;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
key = A[n - 1];
for (i = 0; i < n - 1; i++) {
if (i == 0 && key >= A[i]) {
sml++;
big++;
} else if (key >= A[i]) {
temp = A[i];... | [["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 0 | 249 | 2 |
#include <stdio.h>
#define N 100000
int partition(int *, int, int);
int main() {
int i, j, n;
int A[N];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
j = partition(A, 0, n - 1);
for (i = 0; i < n; i++) {
if (i)
printf(" ");
if (i == j) {
printf("[");
... | #include <stdio.h>
#define N 100000
int partition(int *, int, int);
int main() {
int i, j, n;
int A[N];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
j = partition(A, 0, n - 1);
for (i = 0; i < n; i++) {
if (i)
printf(" ");
if (i == j)
printf("[");
pri... | [["-", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["-", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 0 | 286 | 2 |
#include <stdio.h>
#include <stdlib.h>
int partition(int *A, int p, int r) {
int i, j = p - 1, tmp;
for (i = p; i < r; i++) {
if (A[i] < A[r]) {
j++;
tmp = A[j];
A[j] = A[i];
A[i] = tmp;
}
}
tmp = A[j + 1];
A[j + 1] = A[r];
A[r] = tmp;
return j + 1;
}
int main() {
int... | #include <stdio.h>
#include <stdlib.h>
int partition(int *A, int p, int r) {
int i, j = p - 1, tmp;
for (i = p; i < r; i++) {
if (A[i] <= A[r]) {
j++;
tmp = A[j];
A[j] = A[i];
A[i] = tmp;
}
}
tmp = A[j + 1];
A[j + 1] = A[r];
A[r] = tmp;
return j + 1;
}
int main() {
in... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 19]] | 0 | 277 | 2 |
#include <stdio.h>
#include <stdlib.h>
#define MAX 100000
int A[MAX + 1], n;
int partition(int p, int r) {
int x, i, j, temp = 0;
x = A[r];
i = p - 1;
for (j = p; j < r; j++) {
if (A[j] <= x) {
i = i + 1;
temp = A[i];
A[i] = A[j];
A[j] = temp;
}
}
temp = A[i + 1];
A[i + 1] ... | #include <stdio.h>
#include <stdlib.h>
#define MAX 100000
int A[MAX + 1], n;
int partition(int p, int r) {
int x, i, j, temp = 0;
x = A[r];
i = p - 1;
for (j = p; j < r; j++) {
if (A[j] <= x) {
i = i + 1;
temp = A[i];
A[i] = A[j];
A[j] = temp;
}
}
temp = A[i + 1];
A[i + 1] ... | [["-", 3, 4, 0, 66, 28, 69, 71, 16, 17, 72], ["-", 3, 4, 0, 66, 28, 69, 71, 16, 12, 13]] | 0 | 279 | 2 |
#include <stdio.h>
#define N 100000
int A[N];
int main() {
int i, j, n, y;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
y = partition(0, n - 1);
for (i = 0; i < n; i++) {
if (i != 0) {
printf(" ");
}
if (i == y) {
printf("[");
}
printf("%d", A[i... | #include <stdio.h>
#define N 100000
int A[N];
int main() {
int i, j, n, y;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
y = partition(0, n - 1);
for (i = 0; i < n; i++) {
if (i != 0) {
printf(" ");
}
if (i == y) {
printf("[");
}
printf("%d", A[i... | [["-", 0, 14, 8, 9, 0, 37, 0, 16, 31, 22], ["+", 0, 14, 8, 9, 0, 37, 0, 16, 31, 22]] | 0 | 280 | 2 |
#include <stdio.h>
void swap(int *a, int *b) {
int tmp = *a;
*a = *b;
*b = tmp;
}
int partition(int *A, int p, int q) {
int x = *(A + q);
int i = p - 1, j;
for (j = p; j < q; j++) {
if (*(A + j) <= x) {
i++;
swap(A + i, &A + j);
}
}
swap(A + i + 1, A + q);
return i + 1;
}
int ma... | #include <stdio.h>
void swap(int *a, int *b) {
int tmp = *a;
*a = *b;
*b = tmp;
}
int partition(int *A, int p, int q) {
int x = *(A + q);
int i = p - 1, j;
for (j = p; j < q; j++) {
if (*(A + j) <= x) {
i++;
swap(A + i, A + j);
}
}
swap(A + i + 1, A + q);
return i + 1;
}
int mai... | [["-", 0, 2, 3, 4, 0, 16, 31, 66, 17, 67]] | 0 | 269 | 1 |
#include <stdio.h>
#define MAX 100000
int A[MAX];
int partition(int, int);
int main() {
int i, n, q;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
q = partition(0, n - 1);
for (i = 0; i < n; i++) {
if (i)
printf(" ");
if (i == q)
printf("[ ");
printf("%d", A[i... | #include <stdio.h>
#define MAX 100000
int A[MAX];
int partition(int, int);
int main() {
int i, n, q;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
q = partition(0, n - 1);
for (i = 0; i < n; i++) {
if (i)
printf(" ");
if (i == q)
printf("[");
printf("%d", A[i]... | [["-", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 268 | 2 |
#include <stdio.h>
#define M 100000
int A[M], n;
int partition(int, int);
int main() {
int i, q;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
q = partition(0, n);
for (i = 0; i < n; i++) {
if (i > 0)
printf(" ");
if (i == q)
printf("[");
printf("%d", A[i]);... | #include <stdio.h>
#define M 100000
int A[M], n;
int partition(int, int);
int main() {
int i, q;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
q = partition(0, n - 1);
for (i = 0; i < n; i++) {
if (i > 0)
printf(" ");
if (i == q)
printf("[");
printf("%d", A[... | [["+", 0, 11, 12, 2, 3, 4, 0, 16, 17, 33], ["+", 0, 11, 12, 2, 3, 4, 0, 16, 12, 13], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 0 | 276 | 4 |
#include <stdio.h>
int A[100000];
int main() {
int i, j, n, m;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", A[i]);
}
m = partition(0, n - 1);
for (i = 0; i < n; i++) {
if (i != 0) {
printf(" ");
}
if (i == m) {
printf("[");
}
printf("%d", A[i]);
if (i =... | #include <stdio.h>
int A[100000];
int main() {
int i, j, n, m;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
m = partition(0, n - 1);
for (i = 0; i < n; i++) {
if (i != 0) {
printf(" ");
}
if (i == m) {
printf("[");
}
printf("%d", A[i]);
if (i ... | [["+", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18]] | 0 | 276 | 3 |
#include <stdio.h>
int partition(int A[], int p, int r) {
int x = A[r];
int i = p - 1;
for (int j = p; j < r; j++) {
if (A[j] < x) {
i++;
int tmp = A[j];
A[j] = A[i];
A[i] = tmp;
}
}
int tmp = A[i + 1];
A[i + 1] = A[r];
A[r] = tmp;
return i + 1;
}
int main() {
in... | #include <stdio.h>
int partition(int A[], int p, int r) {
int x = A[r];
int i = p - 1;
for (int j = p; j < r; j++) {
if (A[j] <= x) {
i++;
int tmp = A[j];
A[j] = A[i];
A[i] = tmp;
}
}
int tmp = A[i + 1];
A[i + 1] = A[r];
A[r] = tmp;
return i + 1;
}
int main() {
i... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 19]] | 0 | 271 | 2 |
#include <stdio.h>
#include <stdlib.h>
int Partition(int *A, int f, int l) {
int i, j, x;
i = f - 1;
for (j = f; j < l; j++) {
if (A[j] < A[l]) {
i = i + 1;
x = A[j];
A[j] = A[i];
A[i] = x;
}
}
x = A[i + 1];
A[i + 1] = A[l];
A[l] = x;
return i + 1;
}
int main() {
int i... | #include <stdio.h>
#include <stdlib.h>
int Partition(int *A, int f, int l) {
int i, j, x;
i = f - 1;
for (j = f; j < l; j++) {
if (A[j] <= A[l]) {
i = i + 1;
x = A[j];
A[j] = A[i];
A[i] = x;
}
}
x = A[i + 1];
A[i + 1] = A[l];
A[l] = x;
return i + 1;
}
int main() {
int ... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 19]] | 0 | 273 | 2 |
#include <stdio.h>
#define N 100000
int A[N], n;
int partition(int p, int r) {
int x, i, j, t;
x = A[r];
i = p - 1;
for (j = p; j < r; j++) {
if (A[j] <= x) {
i++;
t = A[i];
A[i] = A[j];
A[j] = t;
}
}
t = A[i + 1];
A[i + 1] = A[r];
A[r] = t;
return i + 1;
}
main() {... | #include <stdio.h>
#define N 100000
int A[N], n;
int partition(int p, int r) {
int x, i, j, t;
x = A[r];
i = p - 1;
for (j = p; j < r; j++) {
if (A[j] <= x) {
i++;
t = A[i];
A[i] = A[j];
A[j] = t;
}
}
t = A[i + 1];
A[i + 1] = A[r];
A[r] = t;
return i + 1;
}
main() {... | [["+", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67]] | 0 | 271 | 1 |
#include <stdio.h>
int main() {
int r, x, n, i = 0, j, reserve;
int A[100000];
scanf("%d", &n);
for (j = 0; j < n; j++)
scanf("%d", &A[j]);
r = n - 1;
for (j = 0; j < r - 1; j++) {
if (A[j] <= A[r]) {
reserve = A[j];
A[j] = A[i];
A[i] = reserve;
i++;
}
}
reserve ... | #include <stdio.h>
int main() {
int r, x, n, i = 0, j, reserve;
int A[100000];
scanf("%d", &n);
for (j = 0; j < n; j++)
scanf("%d", &A[j]);
r = n - 1;
for (j = 0; j < r; j++) {
if (A[j] <= A[r]) {
reserve = A[j];
A[j] = A[i];
A[i] = reserve;
i++;
}
}
reserve = A[... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 0 | 228 | 2 |
#include <stdio.h>
int main() {
int n, i, j, k, A[100000];
int x, p = 0, r, temp;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
r = n - 1;
x = A[r];
i = p - 1;
for (j = p; j <= r - 1; j++) {
if (A[j] <= x) {
i = i + 1;
temp = A[i];
A[i] = A[j];
A[j]... | #include <stdio.h>
int main() {
int n, i, j, k, A[100000];
int x, p = 0, r, temp;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
r = n - 1;
x = A[r];
i = p - 1;
for (j = p; j <= r - 1; j++) {
if (A[j] <= x) {
i = i + 1;
temp = A[i];
A[i] = A[j];
A[j]... | [["-", 0, 57, 15, 23, 0, 16, 31, 69, 28, 22], ["-", 0, 57, 15, 23, 0, 16, 31, 69, 0, 70], ["-", 0, 57, 15, 23, 0, 16, 31, 69, 0, 73], ["-", 8, 9, 0, 57, 15, 23, 0, 16, 12, 22], ["+", 0, 57, 15, 23, 0, 16, 12, 16, 31, 22], ["+", 0, 57, 15, 23, 0, 16, 12, 16, 17, 72], ["+", 0, 57, 15, 23, 0, 16, 12, 16, 12, 13]] | 0 | 243 | 7 |
#include <stdio.h>
#define MAX 1000000
int partition(int *, int, int);
int main() {
int n, i, j, A[MAX];
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
j = partition(A, 0, n - 1);
for (i = 0; i < j; i++) {
printf("%d", A[i]);
if (i != n)
printf(" ");
}
printf("[%d]... | #include <stdio.h>
#define MAX 1000000
int partition(int *, int, int);
int main() {
int n, i, j, A[MAX];
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
j = partition(A, 0, n - 1);
for (i = 0; i < j; i++) {
printf("%d", A[i]);
if (i != n)
printf(" ");
}
printf("[%d]... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 312 | 2 |
#include <stdio.h>
#include <stdlib.h>
#define N 100000
int A[N];
int Partition(int A[], int p, int r);
int main() {
int i, j, n, x;
scanf("%d", &n);
/*
A = malloc(sizeof(int)*n+1);
B = malloc(sizeof(int)*n+1);
*/
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
x = Partition(A, 0, n - 1);
... | #include <stdio.h>
#include <stdlib.h>
#define N 100000
int A[N];
int Partition(int A[], int p, int r);
int main() {
int i, j, n, x;
scanf("%d", &n);
/*
A = malloc(sizeof(int)*n+1);
B = malloc(sizeof(int)*n+1);
*/
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
x = Partition(A, 0, n - 1);
... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 317 | 2 |
#include <stdio.h>
int A[100000];
int partition(int A[], int p, int r) {
int x, i, j, exs;
x = A[r];
i = p - 1;
for (j = p; j < r; j++) {
if (A[j] <= x) {
i++;
exs = A[j];
A[j] = A[i];
A[i] = exs;
}
}
exs = A[i + 1];
A[i + 1] = A[r];
A[r] = exs;
return i + 1;
}
in... | #include <stdio.h>
int A[100000];
int partition(int A[], int p, int r) {
int x, i, j, exs;
x = A[r];
i = p - 1;
for (j = p; j < r; j++) {
if (A[j] <= x) {
i++;
exs = A[j];
A[j] = A[i];
A[i] = exs;
}
}
exs = A[i + 1];
A[i + 1] = A[r];
A[r] = exs;
return i + 1;
}
in... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 266 | 2 |
#include <algorithm>
#include <stdio.h>
int Partition(int A[], int p, int r) {
int x = A[r];
int j = p;
for (int i = p; i < r; ++i) {
if (A[i] < x) {
std::swap(A[j], A[i]);
++j;
}
}
std::swap(A[j], A[r]);
return j;
}
int main() {
int n, A[100000];
scanf("%d", &n);
for (int i = 0;... | #include <algorithm>
#include <stdio.h>
int Partition(int A[], int p, int r) {
int x = A[r];
int j = p;
for (int i = p; i < r; ++i) {
if (A[i] <= x) {
std::swap(A[j], A[i]);
++j;
}
}
std::swap(A[j], A[r]);
return j;
}
int main() {
int n, A[100000];
scanf("%d", &n);
for (int i = 0... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19]] | 1 | 239 | 2 |
#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, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19]] | 1 | 690 | 2 |
#include <iostream>
#include <stdio.h>
using namespace std;
#define MAX 100000
int A[MAX], n;
int partition(int p, int r) {
int x = A[r];
int i = p - 1;
for (int j = p; j < r; j++) {
if (A[j] <= x) {
i++;
swap(A[j], A[i]);
}
}
swap(A[i + 1], A[r]);
return i + 1;
}
int main() {
int ... | #include <iostream>
#include <stdio.h>
using namespace std;
#define MAX 100000
int A[MAX], n;
int partition(int p, int r) {
int x = A[r];
int i = p - 1;
for (int j = p; j < r; j++) {
if (A[j] <= x) {
i++;
swap(A[j], A[i]);
}
}
swap(A[i + 1], A[r]);
return i + 1;
}
int main() {
int ... | [["+", 49, 50, 51, 2, 3, 4, 0, 16, 17, 33], ["+", 49, 50, 51, 2, 3, 4, 0, 16, 12, 13]] | 1 | 239 | 2 |
#include <iostream>
using namespace std;
// Exchange
void exchange(int A[], int i, int j) {
int tmp = A[i];
A[i] = A[j];
A[j] = tmp;
}
// Partition
int partition(int A[], int l, int r) {
int threshold = A[r - 1];
int i = l - 1;
for (int j = l; j < r; j++) {
if (A[j] <= threshold) {
i++;
/... | #include <iostream>
using namespace std;
// Exchange
void exchange(int A[], int i, int j) {
int tmp = A[i];
A[i] = A[j];
A[j] = tmp;
}
// Partition
int partition(int A[], int l, int r) {
int threshold = A[r - 1];
int i = l - 1;
for (int j = l; j < r - 1; j++) {
if (A[j] <= threshold) {
i++;
... | [["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 33], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13]] | 1 | 271 | 6 |
#include <iostream>
using namespace std;
const int MAX = 100000;
int A[MAX];
int partition(int p, int r) {
int x = A[r];
int i = -1, k = 0;
for (int k = 0; k < r; k++) {
if (x > A[k]) {
i++;
int t = A[k];
A[k] = A[i];
A[i] = t;
}
}
int t = A[i + 1];
A[i + 1] = x;
A[r] = t;
... | #include <iostream>
using namespace std;
const int MAX = 100000;
int A[MAX];
int partition(int p, int r) {
int x = A[r];
int i = -1, k = 0;
for (int k = 0; k < r; k++) {
if (x >= A[k]) {
i++;
int t = A[k];
A[k] = A[i];
A[i] = t;
}
}
int t = A[i + 1];
A[i + 1] = x;
A[r] = t;... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20]] | 1 | 239 | 2 |
#include <algorithm>
#include <iostream>
#include <vector>
int partition(std::vector<int> A, int p, int r) {
int x = A[r];
int i = p - 1;
for (int j = p; j <= r - 1; ++j) {
if (A[j] <= x) {
++i;
std::swap(A[i], A[j]);
}
}
std::swap(A[i + 1], A[r]);
return i + 1;
}
int main(void) {
std:... | #include <algorithm>
#include <iostream>
#include <vector>
int partition(std::vector<int> &A, int p, int r) {
int x = A[r];
int i = p - 1;
for (int j = p; j <= r - 1; ++j) {
if (A[j] <= x) {
++i;
std::swap(A[i], A[j]);
}
}
std::swap(A[i + 1], A[r]);
return i + 1;
}
int main(void) {
std... | [["+", 49, 53, 54, 55, 0, 56, 49, 352, 0, 67]] | 1 | 264 | 1 |
#include <algorithm> //cope
#include <iostream>
using namespace std;
int partition(int A[], int p, int r) {
int x = A[r];
int i = p - 1;
for (int j = p; j < r - 1; j++) {
if (A[j] <= x) {
i = i + 1;
swap(A[i], A[j]);
}
}
swap(A[i + 1], A[r]);
return i + 1;
}
int main() {
int n;
c... | #include <algorithm> //cope
#include <iostream>
using namespace std;
int partition(int A[], int p, int r) {
int x = A[r];
int i = p - 1;
for (int j = p; j <= r - 1; j++) {
if (A[j] <= x) {
i = i + 1;
swap(A[i], A[j]);
}
}
swap(A[i + 1], A[r]);
return i + 1;
}
int main() {
int n;
... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 239 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <utility>
using namespace std;
#define MAX 1000005
int A[MAX];
int partition(int p, int r) {
int x = A[r];
int i = p - 1;
for (int j = p; j < r; j++) {
if (A[j] <= x) {
i++;
swap(A[i], A[j]);... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <utility>
using namespace std;
#define MAX 1000005
int A[MAX];
int partition(int p, int r) {
int x = A[r];
int i = p - 1;
for (int j = p; j < r; j++) {
if (A[j] <= x) {
i++;
swap(A[i], A[j]);... | [["-", 0, 57, 15, 339, 51, 16, 31, 69, 28, 22], ["-", 15, 339, 51, 16, 31, 69, 341, 342, 0, 70], ["-", 15, 339, 51, 16, 31, 69, 341, 342, 0, 73], ["-", 0, 57, 15, 339, 51, 16, 12, 69, 28, 22], ["-", 15, 339, 51, 16, 12, 69, 341, 342, 0, 70], ["-", 15, 339, 51, 16, 12, 69, 341, 342, 0, 73]] | 1 | 240 | 6 |
#include <iostream>
#include <vector>
using namespace std;
int partition(vector<int> &A, int p, int r) {
int i = p - 1;
for (int j = p; j < r; j++) {
if (A[j] >= A[r])
continue;
swap(A[++i], A[j]);
}
swap(A[++i], A[r]);
return i;
}
int main() {
int n;
cin >> n;
vector<int> A(n);
for (a... | #include <iostream>
#include <vector>
using namespace std;
int partition(vector<int> &A, int p, int r) {
int i = p - 1;
for (int j = p; j < r; j++) {
if (A[j] > A[r])
continue;
swap(A[++i], A[j]);
}
swap(A[++i], A[r]);
return i;
}
int main() {
int n;
cin >> n;
vector<int> A(n);
for (au... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47]] | 1 | 228 | 2 |
#include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
//#define int long long
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define all(c) begin(c), end(c)
const int INF =
sizeof(int) == sizeof(... | #include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
//#define int long long
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define all(c) begin(c), end(c)
const int INF =
sizeof(int) == sizeof(... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19]] | 1 | 389 | 42 |
#include <stdio.h>
#define MAX 100000
int A[MAX], n;
int partition(int p, int r) {
int x, i, j, t;
x = A[r];
i = p - 1;
for (j = p; j < r; j++) {
if (A[j] <= x) {
i++;
t = A[i];
A[i] = A[j];
A[j] = t;
}
}
t = A[i + 1];
A[i + 1] = A[j];
A[j] = t;
return i + 1;
}
int m... | #include <stdio.h>
#define MAX 100000
int A[MAX], n;
int partition(int p, int r) {
int x, i, j, t;
x = A[r];
i = p - 1;
for (j = p; j < r; j++) {
if (A[j] <= x) {
i++;
t = A[i];
A[i] = A[j];
A[j] = t;
}
}
t = A[i + 1];
A[i + 1] = A[j];
A[j] = t;
return i + 1;
}
int m... | [["+", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67]] | 1 | 263 | 1 |
#include <cstdio>
#include <iostream>
#include <vector>
void swap(int *a, int *b) {
int tmp = *a;
*a = *b;
*b = tmp;
}
int do_partition(std::vector<int> &data, int begin_index, int end_index) {
int pivot = data[end_index - 1];
int left_last_index = begin_index;
for (int i = begin_index; i < end_index - 1;... | #include <cstdio>
#include <iostream>
#include <vector>
void swap(int *a, int *b) {
int tmp = *a;
*a = *b;
*b = tmp;
}
int do_partition(std::vector<int> &data, int begin_index, int end_index) {
int pivot = data[end_index - 1];
int left_last_index = begin_index;
for (int i = begin_index; i < end_index - 1;... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19]] | 1 | 306 | 2 |
#include <cstdio>
#include <iostream>
using namespace std;
const int N = 100005;
int partition(int arr[], int p,
int r) //[p, r)????????????,????????????pivot??????
{
int pivot = arr[r - 1];
int i = p;
for (int j = p; j < r - 1; ++j) {
if (arr[j] < pivot) {
swap(arr[i++], arr[j]);
}
... | #include <cstdio>
#include <iostream>
using namespace std;
const int N = 100005;
int partition(int arr[], int p,
int r) //[p, r)????????????,????????????pivot??????
{
int pivot = arr[r - 1];
int i = p;
for (int j = p; j < r - 1; ++j) {
if (arr[j] <= pivot) {
swap(arr[i++], arr[j]);
}
... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19]] | 1 | 262 | 2 |
#include <iostream>
#include <vector>
int partition(std::vector<int> *A, int p, int r) {
int x = (*A)[r];
int i = p - 1;
for (int j = p; j < r - 1; ++j) {
if ((*A)[j] <= x) {
i = i + 1;
std::swap((*A)[i], (*A)[j]);
}
}
std::swap((*A)[i + 1], (*A)[r]);
return i + 1;
}
int main() {
int... | #include <iostream>
#include <vector>
int partition(std::vector<int> *A, int p, int r) {
int x = (*A)[r];
int i = p - 1;
for (int j = p; j < r; ++j) {
if ((*A)[j] <= x) {
i = i + 1;
std::swap((*A)[i], (*A)[j]);
}
}
std::swap((*A)[i + 1], (*A)[r]);
return i + 1;
}
int main() {
int n;
... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 269 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
int n, a[100000];
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
int tmp = a[n - 1], i = -1;
for (int j = 0; j < n; j++) {
if (a[j] < tmp) {
i++;
swap(a[i], a[j]);
}
}
swap(a[i + 1], a[n - 1]);
for (int ... | #include <algorithm>
#include <iostream>
using namespace std;
int n, a[100000];
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
int tmp = a[n - 1], i = -1;
for (int j = 0; j < n - 1; j++) {
if (a[j] <= tmp) {
i++;
swap(a[i], a[j]);
}
}
swap(a[i + 1], a[n - 1]);
for ... | [["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19]] | 1 | 182 | 4 |
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int inf = 10000000;
int n;
vector<int> a;
int partition(int p, int r) {
int x = a[r - 1];
int i = p - 1;
for (int j = p; j < r; j++) {
if (a[j] <= x) {
// i = i + 1;
swap(a[++i], a[j]);
}
}
// swap(... | #include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int inf = 10000000;
int n;
vector<int> a;
int partition(int p, int r) {
int x = a[r - 1];
int i = p - 1;
for (int j = p; j < r; j++) {
if (a[j] <= x) {
// i = i + 1;
swap(a[++i], a[j]);
}
}
// swap(... | [["-", 0, 57, 15, 339, 51, 16, 31, 69, 28, 22], ["-", 15, 339, 51, 16, 31, 69, 341, 342, 0, 70], ["-", 15, 339, 51, 16, 31, 69, 341, 342, 0, 73], ["-", 0, 57, 15, 339, 51, 16, 12, 69, 28, 22], ["-", 15, 339, 51, 16, 12, 69, 341, 342, 0, 70], ["-", 15, 339, 51, 16, 12, 69, 341, 342, 0, 73]] | 1 | 221 | 6 |
#include <iostream>
using namespace std;
#define max 100000
int A[max], n;
int partition(int p, int r) {
int j, t, x, i;
i = p - 1;
x = A[r];
for (j = p; j < r; j++) {
if (A[j] <= x) {
i++;
t = A[i];
A[i] = A[j];
A[j] = t;
}
}
t = A[i + 1];
A[i + 1] = A[r];
A[r] = t;
... | #include <iostream>
using namespace std;
#define max 100000
int A[max], n;
int partition(int p, int r) {
int j, t, x, i;
i = p - 1;
x = A[r];
for (j = p; j < r; j++) {
if (A[j] <= x) {
i++;
t = A[i];
A[i] = A[j];
A[j] = t;
}
}
t = A[i + 1];
A[i + 1] = A[r];
A[r] = t;
... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 249 | 2 |
#include <iostream>
using namespace std;
int n, a[100000];
int partition(int a[], int p, int r) {
int x = a[r];
int i = p - 1;
for (int j = p; j < r; j++) {
if (a[j] < x) {
i++;
swap(a[i], a[j]);
}
}
swap(a[i + 1], a[r]);
return i + 1;
}
int main() {
cin >> n;
for (int i = 0; i < ... | #include <iostream>
using namespace std;
int n, a[100000];
int partition(int a[], int p, int r) {
int x = a[r];
int i = p - 1;
for (int j = p; j < r; j++) {
if (a[j] <= x) {
i++;
swap(a[i], a[j]);
}
}
swap(a[i + 1], a[r]);
return i + 1;
}
int main() {
cin >> n;
for (int i = 0; i <... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19]] | 1 | 215 | 2 |
#include <cstdio>
#define N_MAX 100000
int partition(int A[], int start, int end) {
int tmp, j = 0, x = A[end];
for (int i = start; i < end; i++) {
if (A[i] < x) {
tmp = A[j];
A[j] = A[i];
A[i] = tmp;
j++;
}
}
tmp = A[end];
A[end] = A[j];
A[j] = tmp;
return j;
}
int mai... | #include <cstdio>
#define N_MAX 100000
int partition(int A[], int start, int end) {
int tmp, j = 0, x = A[end];
for (int i = start; i < end; i++) {
if (A[i] <= x) {
tmp = A[j];
A[j] = A[i];
A[i] = tmp;
j++;
}
}
tmp = A[end];
A[end] = A[j];
A[j] = tmp;
return j;
}
int ma... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19]] | 1 | 255 | 2 |
#include <algorithm>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <queue>
#include <sstream>
#include <stack>
#include <stdio.h>
#define MAX 100000
using namespace std;
typedef long long ll;
int store[100000 + 2], u;
void partition(int n) {
int x, i, j, mid;
x = store[n - 1];
... | #include <algorithm>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <queue>
#include <sstream>
#include <stack>
#include <stdio.h>
#define MAX 100000
using namespace std;
typedef long long ll;
int store[100000 + 2], u;
void partition(int n) {
int x, i, j, mid;
x = store[n - 1];
... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19]] | 1 | 278 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define is_uruu leapyear
#define ll long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define ROF(i, a, b) for (int i = (a); i > (b); --i)
#define REP(i, a) for (int i = 0; i < (a); ++i)
int partition(int A[], int p, int r) {
int x = A[r];
int i = p;
FO... | #include <bits/stdc++.h>
using namespace std;
#define is_uruu leapyear
#define ll long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define ROF(i, a, b) for (int i = (a); i > (b); --i)
#define REP(i, a) for (int i = 0; i < (a); ++i)
int partition(int A[], int p, int r) {
int x = A[r];
int i = p;
FO... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19]] | 1 | 244 | 2 |
#include <cmath>
#include <iostream>
#include <stdio.h>
using namespace std;
#define MAX 500000;
#define SENTINEL 2000000000;
// int count=0;
void merge(int A[], int left, int mid, int right) {
int n1 = mid - left;
int n2 = right - mid;
int L[500000 / 2 + 2], R[500000 / 2 + 2];
for (int i = 0; i < n1; i++)
... | #include <cmath>
#include <iostream>
#include <stdio.h>
using namespace std;
#define MAX 500000;
#define SENTINEL 2000000000;
// int count=0;
void merge(int A[], int left, int mid, int right) {
int n1 = mid - left;
int n2 = right - mid;
int L[500000 / 2 + 2], R[500000 / 2 + 2];
for (int i = 0; i < n1; i++)
... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 495 | 2 |
#include <stdio.h>
int partition(int *A, int p, int r) {
int x = A[r];
int i = p - 1;
int tmp;
for (int j = 0; j < r; j++) {
if (A[j] <= x) {
i++;
tmp = A[i];
A[i] = A[j];
A[j] = tmp;
}
}
tmp = A[i + 1];
A[i + 1] = A[r];
A[r] = tmp;
return i + 1;
}
int main() {
int ... | #include <stdio.h>
int partition(int *A, int p, int r) {
int x = A[r];
int i = p - 1;
int tmp;
for (int j = 0; j < r; j++) {
if (A[j] <= x) {
i++;
tmp = A[i];
A[i] = A[j];
A[j] = tmp;
}
}
tmp = A[i + 1];
A[i + 1] = A[r];
A[r] = tmp;
return i + 1;
}
int main() {
int ... | [["-", 0, 57, 15, 339, 51, 16, 31, 69, 28, 22], ["-", 15, 339, 51, 16, 31, 69, 341, 342, 0, 70], ["-", 15, 339, 51, 16, 31, 69, 341, 342, 0, 73]] | 1 | 275 | 3 |
#include <iostream>
using namespace std;
int partition(int *A, int p, int r) {
int x = A[r];
int i = p - 1;
int tmp;
for (int j = 0; j < r; j++) {
if (A[j] <= x) {
i++;
tmp = A[i];
A[i] = A[j];
A[j] = tmp;
}
}
tmp = A[i + 1];
A[i + 1] = A[r];
A[r] = tmp;
return i + 1;
... | #include <iostream>
using namespace std;
int partition(int *A, int p, int r) {
int x = A[r];
int i = p - 1;
int tmp;
for (int j = 0; j < r; j++) {
if (A[j] <= x) {
i++;
tmp = A[i];
A[i] = A[j];
A[j] = tmp;
}
}
tmp = A[i + 1];
A[i + 1] = A[r];
A[r] = tmp;
return i + 1;... | [["-", 64, 1, 0, 16, 31, 16, 12, 103, 0, 125], ["+", 64, 1, 0, 16, 31, 16, 12, 103, 0, 125]] | 1 | 272 | 2 |
#include <iostream>
using namespace std;
int partition(int A[], int p, int r) {
int x, i, tmp;
x = A[r - 1];
i = p - 1;
for (int j = p; j <= r - 1; j++) {
if (A[j] < x) {
i = i + 1;
tmp = A[i];
A[i] = A[j];
A[j] = tmp;
}
}
tmp = A[i + 1];
A[i + 1] = A[r - 1];
A[r - 1] = ... | #include <iostream>
using namespace std;
int partition(int A[], int p, int r) {
int x, i, tmp;
x = A[r - 1];
i = p - 1;
for (int j = p; j <= r - 2; j++) {
if (A[j] <= x) {
i = i + 1;
tmp = A[i];
A[i] = A[j];
A[j] = tmp;
}
}
tmp = A[i + 1];
A[i + 1] = A[r - 1];
A[r - 1] =... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19]] | 1 | 270 | 4 |
#include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int A[100010];
int n;
int partition(int left, int right) {
int i = left - 1;
for (int j = left; j < right; j++) {
if (A[j] < A[right]) {
swap(A[i + 1], A[j]);
i++;
}
}
swap(A[right], A[i + 1]);
return i + 1;
... | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int A[100010];
int n;
int partition(int left, int right) {
int i = left - 1;
for (int j = left; j < right; j++) {
if (A[j] <= A[right]) {
swap(A[i + 1], A[j]);
i++;
}
}
swap(A[right], A[i + 1]);
return i + 1;... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19]] | 1 | 218 | 2 |
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <u... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <u... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19]] | 1 | 264 | 2 |
#include <stdio.h>
using namespace std;
int partition(int *A, int p, int r) {
int x = A[r];
int i = p - 1;
for (int j = p; j < r; j++) {
if (A[j] <= x) {
i++;
int tmp = A[i];
A[i] = A[j];
A[j] = tmp;
}
}
int tmp = A[i + 1];
A[i + 1] = A[r];
A[r] = tmp;
return i + 1;
}
... | #include <stdio.h>
using namespace std;
int partition(int *A, int p, int r) {
int x = A[r];
int i = p - 1;
for (int j = p; j < r; j++) {
if (A[j] <= x) {
i++;
int tmp = A[i];
A[i] = A[j];
A[j] = tmp;
}
}
int tmp = A[i + 1];
A[i + 1] = A[r];
A[r] = tmp;
return i + 1;
}
... | [["+", 49, 50, 51, 2, 3, 4, 0, 16, 17, 33], ["+", 49, 50, 51, 2, 3, 4, 0, 16, 12, 13]] | 1 | 257 | 2 |
#include <iostream>
#include <vector>
void Swap(int &a, int &b) {
int tmp = std::move(a);
a = std::move(b);
b = std::move(tmp);
}
// when 0th Recurtion, params -> Partition( v, 0, v.size() );
int Partition(std::vector<int> &v, int p, int r) {
--r;
int x = v[r];
int i = p - 1;
for (int j = p; j < r; ++j)... | #include <iostream>
#include <vector>
void Swap(int &a, int &b) {
int tmp = std::move(a);
a = std::move(b);
b = std::move(tmp);
}
// when 0th Recurtion, params -> Partition( v, 0, v.size() );
int Partition(std::vector<int> &v, int p, int r) {
--r;
int x = v[r];
int i = p - 1;
for (int j = p; j < r; ++j)... | [["-", 49, 50, 51, 2, 3, 4, 0, 16, 17, 33], ["-", 49, 50, 51, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 41, 15, 23, 0, 16, 12, 16, 17, 33], ["+", 0, 41, 15, 23, 0, 16, 12, 16, 12, 13]] | 1 | 313 | 4 |
#include <iostream>
#define MAX 100000
using namespace std;
int Partition(int A[], int p, int r);
int main() {
int n, i, j, q;
int A[MAX];
cin >> n;
for (i = 0; i < n; i++) {
cin >> A[i];
}
q = Partition(A, 0, n - 1);
for (i = 0; A[i] < A[q]; i++) {
cout << A[i] << ' ';
}
cout << '[' << A... | #include <iostream>
#define MAX 100000
using namespace std;
int Partition(int A[], int p, int r);
int main() {
int n, i, j, q;
int A[MAX];
cin >> n;
for (i = 0; i < n; i++) {
cin >> A[i];
}
// q = Partition(A,A[0],A[n-1]);
q = Partition(A, 0, n - 1);
for (i = 0; i < q; i++) {
cout << A[i] <<... | [["-", 8, 9, 0, 7, 15, 16, 31, 69, 28, 22], ["-", 0, 7, 15, 16, 31, 69, 341, 342, 0, 70], ["-", 0, 7, 15, 16, 31, 69, 341, 342, 0, 73], ["-", 8, 9, 0, 7, 15, 16, 12, 69, 28, 22], ["-", 0, 7, 15, 16, 12, 69, 341, 342, 0, 70], ["-", 0, 7, 15, 16, 12, 69, 341, 342, 0, 73]] | 1 | 298 | 6 |
/*
「pivotを中間に、大きいものと小さいものを交換していく」
という感じではなく、
「pivotより小さいものを探して、前の方に詰めていく（添え字iのとこ）」
という感じである。
*/
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int i, j;
int n;
int buf;
int p, q, r, pivot;
vector<int> A;
cin >> n;
for (i = 0; i < n; i++) {
cin >> buf;... | /*
「pivotを中間に、大きいものと小さいものを交換していく」
という感じではなく、
「pivotより小さいものを探して、前の方に詰めていく（添え字iのとこ）」
という感じである。
*/
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int i, j;
int n;
int buf;
int p, q, r, pivot;
vector<int> A;
cin >> n;
for (i = 0; i < n; i++) {
cin >> buf;... | [["-", 8, 9, 0, 1, 0, 11, 12, 16, 12, 22], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 12, 13], ["-", 0, 57, 15, 339, 51, 16, 31, 69, 28, 22], ["-", 15, 339, 51, 16, 31, 69, 341, 342, 0, 70], ["-", 15, 339, 51, 16, 31, 69, 341, 342, 0, 73], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22]] | 1 | 231 | 7 |
#include <iostream>
using namespace std;
int array[100001];
void Partition(const int begin, const int end) {
int mid = array[end];
int i = begin;
for (int j = begin; j < end; j++) {
if (array[j] <= mid) {
int buf = array[i];
array[i] = array[j];
array[j] = buf;
i++;
}
}
{
... | #include <iostream>
using namespace std;
int array[100001];
void Partition(const int begin, const int end) {
int mid = array[end];
int i = begin;
for (int j = begin; j < end; j++) {
if (array[j] <= mid) {
int buf = array[i];
array[i] = array[j];
array[j] = buf;
i++;
}
}
{
... | [["-", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["-", 0, 57, 64, 1, 0, 16, 12, 5, 0, 6], ["+", 0, 57, 64, 1, 0, 16, 12, 5, 0, 6]] | 1 | 240 | 4 |
gets
gets.split.map(&:to_i).sort*" " | gets
puts gets.split.map(&:to_i).sort*" " | [["+", 36, 36, 36, 36, 0, 493, 0, 652, 735, 22]] | 4 | 16 | 1 |
def counting_sort(a, k)
n = a.length
b = Array.new(n)
c = Array.new(k+1,0)
n.times do |i|
c[a[i]]+=1
end
1.upto(k) do |i|
c[i]+=c[i-1]
end
(n-1).downto(1) do |i|
b[c[a[i]]]=a[i]
c[a[i]]-=1
end
return b.compact
end
n = STDIN.gets
a = STDIN.gets.split(' ').map{ |i| i.to_i }
print ... |
def counting_sort(a, k)
n = a.length
b = Array.new(n)
c = Array.new(k+1,0)
n.times do |i|
c[a[i]]+=1
end
1.upto(k) do |i|
c[i]+=c[i-1]
end
(n-1).downto(0) do |i|
b[c[a[i]]]=a[i]
c[a[i]]-=1
end
return b.compact
end
n = STDIN.gets
a = STDIN.gets.split(' ').map{ |i| i.to_i }
print... | [["-", 0, 735, 8, 736, 0, 652, 3, 4, 0, 612], ["+", 0, 735, 8, 736, 0, 652, 3, 4, 0, 612]] | 4 | 163 | 2 |
def sort(array)
a = array
b = []
c = []
k = a.max
##all elements of array c equal to 0
for i in 0..k
c[i] = 0
end
##insert +1 to c[element of array a]
a.each do |el|
c[el] = c[el] + 1
end
#array c now contains the number of elements of array a
##add the number of previous element starting from c[1]
... | def sort(array)
a = array
b = []
c = []
k = a.max
##all elements of array c equal to 0
for i in 0..k
c[i] = 0
end
##insert +1 to c[element of array a]
a.each do |el|
c[el] = c[el] + 1
end
#array c now contains the number of elements of array a
##add the number of previous element starting from c[1]
... | [["-", 0, 493, 0, 735, 8, 736, 0, 38, 0, 38], ["+", 0, 493, 0, 735, 8, 736, 0, 652, 735, 22], ["-", 36, 36, 36, 36, 0, 493, 0, 652, 735, 22]] | 4 | 171 | 3 |
def counting_sort(MAX):
C = [0 for _ in range(MAX+1)]
for i in range(N):
C[A[i]] += 1
for i in range(1, MAX+1):
C[i] = C[i] + C[i-1]
for i in range(N-1, -1, -1):
C[A[i]] -= 1
B[C[A[i]]] = A[i]
N = int(input())
A = list(map(int, input().split()))
MAX = 0
for n in A:
... | def counting_sort(MAX):
C = [0 for _ in range(MAX+1)]
for i in range(N):
C[A[i]] += 1
for i in range(1, MAX+1):
C[i] = C[i] + C[i-1]
for i in range(N-1, -1, -1):
C[A[i]] -= 1
B[C[A[i]]] = A[i]
N = int(input())
A = list(map(int, input().split()))
MAX = 0
for n in A:
... | [["+", 3, 4, 0, 652, 3, 4, 0, 652, 63, 22], ["+", 0, 652, 3, 4, 0, 652, 3, 4, 0, 24], ["+", 0, 652, 3, 4, 0, 652, 3, 4, 0, 22], ["+", 0, 652, 3, 4, 0, 652, 3, 4, 0, 21], ["+", 0, 652, 3, 4, 0, 652, 3, 4, 0, 25]] | 5 | 173 | 20 |
def counting_sort(A, k):
B = [0] * len(A)
C = [0] * k
for a in A:
C[a] += 1
for i in range(1, k):
C[i] += C[i - 1]
for a in reversed(A):
B[C[a] - 1] = a
C[a] -= 1
return B
def main():
n = int(input())
A = [int(x) for x in input().split()]
print(*... | def counting_sort(A, k):
B = [0] * len(A)
C = [0] * k
for a in A:
C[a] += 1
for i in range(1, k):
C[i] += C[i - 1]
for a in reversed(A):
B[C[a] - 1] = a
C[a] -= 1
return B
def main():
n = int(input())
A = [int(x) for x in input().split()]
print(*... | [["-", 0, 652, 3, 4, 0, 652, 3, 4, 0, 612], ["+", 0, 652, 3, 4, 0, 652, 3, 4, 0, 612]] | 5 | 128 | 2 |
def InputData():
sequence_len = int(input())
sequence = [None] + [int(a) for a in input().split(" ")]
return sequence_len, sequence
def countingSort(sequence, k, sequence_len):
B = [None]*(sequence_len+1)
C = [0]*k
for j in range(1, sequence_len+1):
C[sequence[j]] += 1
... | def InputData():
sequence_len = int(input())
sequence = [None] + [int(a) for a in input().split(" ")]
return sequence_len, sequence
def countingSort(sequence, k, sequence_len):
B = [None]*(sequence_len+1)
C = [0]*k
for j in range(1, sequence_len+1):
C[sequence[j]] += 1
... | [["-", 0, 1, 0, 652, 3, 4, 0, 206, 51, 22], ["+", 0, 1, 0, 652, 3, 4, 0, 206, 51, 22]] | 5 | 220 | 2 |
def counting_sort(lst,ans,max):
cnt_lst = [0] * (max+1)
for i in range(1,len(lst)):
cnt_lst[lst[i]] += 1
for j in range(1,max+1):
cnt_lst[j] = cnt_lst[j] + cnt_lst[j-1]
for k in range(len(lst)-1,0,-1):
ans[cnt_lst[lst[k]]] = lst[k]
cnt_lst[lst[k]] -= 1
return ans
n ... | def counting_sort(lst,ans,max):
cnt_lst = [0] * (max+1)
for i in range(0,len(lst)):
cnt_lst[lst[i]] += 1
for j in range(1,max+1):
cnt_lst[j] = cnt_lst[j] + cnt_lst[j-1]
for k in range(len(lst)-1,-1,-1):
ans[cnt_lst[lst[k]]-1] = lst[k]
cnt_lst[lst[k]] -= 1
return ans
... | [["-", 8, 196, 0, 7, 12, 652, 3, 4, 0, 612], ["+", 8, 196, 0, 7, 12, 652, 3, 4, 0, 612], ["+", 0, 7, 12, 652, 3, 4, 0, 664, 17, 33], ["+", 0, 7, 12, 652, 3, 4, 0, 664, 28, 612], ["+", 0, 1, 0, 662, 31, 206, 206, 657, 17, 33], ["+", 0, 1, 0, 662, 31, 206, 206, 657, 12, 612]] | 5 | 179 | 7 |
def countingsort(a,k):
c=[0]*(k+1)
n=len(a)
for i in a:
c[i]+=1
for i in range(1,k+1):
c[i]=c[i]+c[i-1]
b=[0]*n
for i in range(n-1,-1,-1):
b[c[a[i]]-1]=a[i]
c[a[i]]-=1
return b
o=int(input())
a=list(map(int,input().split()))
q=max(a)
ret=countingsort(a,q)
for ... | def countingsort(a,k):
c=[0]*(k+1)
n=len(a)
for i in a:
c[i]+=1
for i in range(1,k+1):
c[i]=c[i]+c[i-1]
b=[0]*n
for i in range(n-1,-1,-1):
b[c[a[i]]-1]=a[i]
c[a[i]]-=1
return b
o=int(input())
a=list(map(int,input().split()))
q=max(a)
ret=countingsort(a,q)
for ... | [["-", 0, 656, 0, 7, 12, 652, 3, 4, 0, 22], ["+", 0, 656, 0, 7, 12, 652, 3, 4, 0, 22], ["-", 8, 196, 0, 57, 15, 666, 0, 657, 31, 22], ["+", 8, 196, 0, 57, 15, 666, 0, 657, 31, 22]] | 5 | 191 | 4 |
#計数ソート
n = int(input())
a = list(map(int, input().split()))
def countSort(a):
N = max(a)
c = [0]*(N+2)
b = [0]*len(a)
for i in a:
c[i] += 1
for i in range(1,len(c)):
c[i] += c[i-1]
for i in a:
b[c[i]-1] = i
c[i] -= 1
print(b)
countSort(*a)
| #計数ソート
n = int(input())
a = list(map(int, input().split()))
def countSort(a):
N = max(a)
c = [0]*(N+2)
b = [0]*len(a)
for i in a:
c[i] += 1
for i in range(1,len(c)):
c[i] += c[i-1]
for i in a:
b[c[i]-1] = i
c[i] -= 1
print(*b)
countSort(a)
| [["+", 0, 1, 0, 652, 3, 4, 0, 661, 0, 48], ["-", 0, 1, 0, 652, 3, 4, 0, 661, 0, 48]] | 5 | 125 | 2 |
def countingsort(a, b, k):
c = [0 for i in range(k + 1)]
for i in range(len(a)):
c[a[i]] += 1
for i in range(1, len(c)):
c[i] += c[i - 1]
for i in range(len(a) - 1, -1, -1):
b[c[a[i]] - 1] = a[i]
c[a[i]] -= 1
n = int(input())
a = list(map(int, input().split()))
b = [0] *... | def countingsort(a, b, k):
c = [0 for i in range(k + 1)]
for i in range(len(a)):
c[a[i]] += 1
for i in range(1, len(c)):
c[i] += c[i - 1]
for i in range(len(a) - 1, -1, -1):
b[c[a[i]] - 1] = a[i]
c[a[i]] -= 1
n = int(input())
a = list(map(int, input().split()))
b = [0] *... | [["-", 0, 1, 0, 662, 12, 657, 12, 23, 0, 24], ["-", 0, 662, 12, 657, 12, 23, 0, 657, 17, 72], ["-", 0, 662, 12, 657, 12, 23, 0, 657, 12, 612], ["-", 0, 1, 0, 662, 12, 657, 12, 23, 0, 25]] | 5 | 165 | 4 |
def counting_sort(target_list):
counter = [0 for i in range(10000)]
for n in target_list:
counter[n] += 1
for i in range(1,10000):
counter[i] = counter[i] + counter[i-1]
result = [0 for i in range(len(target_list))]
for n in target_list[::-1]:
result[counter[n] - 1] = n
... | #http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_6_A&lang=jp
#?¨???°?????????
def counting_sort(target_list):
counter = [0 for i in range(10000)]
for n in target_list:
counter[n] += 1
for i in range(1,10000):
counter[i] = counter[i] + counter[i-1]
result = [0 for i in ... | [["-", 0, 652, 3, 4, 0, 658, 8, 652, 63, 22], ["+", 0, 652, 3, 4, 0, 658, 8, 652, 63, 22]] | 5 | 159 | 2 |
def CountingSort(A, k):
C = [0] * k
B = C[:]
for a in A:
C[a] += 1
for i in range(1, len(C)):
C[i] += C[i - 1]
for i in range(len(A) - 1, -1, -1):
B[C[A[i]]] = A[i]
C[A[i]] -= 1
return B
if __name__ == '__main__':
N = int(input())
A = [int(i) for i in ... | def CountingSort(A, k):
C = [0] * k
B = C[:]
for a in A:
C[a] += 1
for i in range(1, len(C)):
C[i] += C[i - 1]
for i in range(len(A) - 1, -1, -1):
B[C[A[i]]] = A[i]
C[A[i]] -= 1
return B
if __name__ == '__main__':
N = int(input())
A = [int(i) for i in i... | [["-", 12, 652, 3, 4, 0, 652, 3, 4, 0, 531], ["+", 12, 652, 3, 4, 0, 652, 3, 4, 0, 531]] | 5 | 179 | 2 |
def counting_sort(array, maxval):
m = maxval + 1
count = [0] * (m)
for a in array:
count[a] += 1
i = 0
for a in range(m):
for c in range(count[a]):
array[i] = a
i += 1
return array
if __name__ == '__main__':
N = int(input())
l = list(map(int, inp... | def counting_sort(array, maxval):
m = maxval + 1000
count = [0] * (m)
for a in array:
count[a] += 1
i = 0
for a in range(m):
for c in range(count[a]):
array[i] = a
i += 1
return array
if __name__ == '__main__':
N = int(input())
l = list(map(int, ... | [["-", 8, 196, 0, 1, 0, 662, 12, 657, 12, 612], ["+", 8, 196, 0, 1, 0, 662, 12, 657, 12, 612]] | 5 | 141 | 2 |
# -*- coding:utf-8 -*-
def countingSort(A, B, k, n):
C = [0] * (k+1)
for i in range(1, n + 1):
C[A[i]] += 1
for j in range(1, k + 1):
C[j] = C[j] + C[j - 1]
print(C)
for j in range(n, 0, -1):
B[C[A[j]]] = A[j]
C[A[j]] -= 1
if __name__ == "__main__":
n = int... | # -*- coding:utf-8 -*-
def countingSort(A, B, k, n):
C = [0] * (k+1)
for i in range(1, n + 1):
C[A[i]] += 1
for j in range(1, k + 1):
C[j] = C[j] + C[j - 1]
for j in range(n, 0, -1):
B[C[A[j]]] = A[j]
C[A[j]] -= 1
if __name__ == "__main__":
n = int(input())
... | [["-", 0, 14, 8, 196, 0, 1, 0, 652, 63, 22], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 24], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 22], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 25]] | 5 | 208 | 4 |
n = int(input())
a = list(map(int, input().split()))
def countingsort(a, k):
c = [0 for i in range(k)]
b = [0 for i in range(n)]
for j in range(n):
c[a[j]] += 1
for i in range(k):
c[i+1] += c[i]
for j in reversed(range(n)):
b[c[a[j]]] = a[j]
c[a[j]] -= 1
... | n = int(input())
a = list(map(int, input().split()))
def countingsort(a, k):
c = [0 for i in range(k+1)]
b = [0 for i in range(n)]
for j in range(n):
c[a[j]] += 1
for i in range(k):
c[i+1] += c[i]
for j in reversed(range(n)):
b[c[a[j]]-1] = a[j]
c[a[j]] -= 1
... | [["+", 0, 659, 12, 652, 3, 4, 0, 657, 17, 72], ["+", 0, 659, 12, 652, 3, 4, 0, 657, 12, 612], ["+", 0, 1, 0, 662, 31, 206, 206, 657, 17, 33], ["+", 0, 1, 0, 662, 31, 206, 206, 657, 12, 612], ["-", 0, 1, 0, 662, 12, 652, 3, 4, 0, 612], ["+", 0, 1, 0, 662, 12, 652, 3, 4, 0, 612]] | 5 | 143 | 6 |
def counting_sort(A, k):
n = len(A)
B = [0 for i in range(n)]
C = [0 for i in range(k+1)]
for j in range(n):
C[A[j]] += 1
for i in range(1, k):
C[i] = C[i] + C[i-1]
for j in range(n-1, -1, -1):
B[C[A[j]]-1] = A[j]
C[A[j]] -= 1
return B
n = int(input())
A ... | def counting_sort(A, k):
n = len(A)
B = [0 for i in range(n)]
C = [0 for i in range(k+1)]
for j in range(n):
C[A[j]] += 1
for i in range(1, k):
C[i] = C[i] + C[i-1]
for j in range(n-1, -1, -1):
B[C[A[j]]-1] = A[j]
C[A[j]] -= 1
return B
n = int(input())
A ... | [["-", 0, 1, 0, 662, 12, 652, 3, 4, 0, 612], ["+", 0, 1, 0, 662, 12, 652, 3, 4, 0, 612]] | 5 | 179 | 2 |
n = int(input())
s = list(map(int, input().split()))
k = len(set(s))
c = [0 for i in range(k+1)]
def counting_sort(a, k):
global c
b = [0 for i in range(len(a)+1)]
for i in range(n):
c[a[i]] += 1
for i in range(1,k+1):
c[i] = c[i] + c[i - 1]
for i in reversed(range(n)):
b[c... | n = int(input())
s = list(map(int, input().split()))
k = max(s)
c = [0 for i in range(k+1)]
def counting_sort(a, k):
global c
b = [0 for i in range(len(a)+1)]
for i in range(n):
c[a[i]] += 1
for i in range(1,k+1):
c[i] = c[i] + c[i - 1]
for i in reversed(range(n)):
b[c[a[i]... | [["-", 0, 656, 0, 1, 0, 662, 12, 652, 63, 22], ["-", 0, 1, 0, 662, 12, 652, 3, 4, 0, 24], ["-", 0, 662, 12, 652, 3, 4, 0, 652, 63, 22], ["+", 0, 656, 0, 1, 0, 662, 12, 652, 63, 22], ["-", 12, 652, 3, 4, 0, 652, 3, 4, 0, 25]] | 5 | 177 | 5 |
def counting_sort(A, B, k):
len_A = len(A)
C = [0 for _ in range(k + 1)]
for j in range(len_A):
C[A[j]] += 1
for i in range(1, k + 1):
C[i] = C[i] + C[i - 1]
for j in range(len_A - 1, -1, -1):
B[C[A[j]] - 1] = A[j]
C[A[j]] -= 1
n = int(input())
input_list = list... | def counting_sort(A, B, k):
len_A = len(A)
C = [0 for _ in range(k + 1)]
for j in range(len_A):
C[A[j]] += 1
for i in range(1, k + 1):
C[i] = C[i] + C[i - 1]
for j in range(len_A - 1, -1, -1):
B[C[A[j]] - 1] = A[j]
C[A[j]] -= 1
n = int(input())
input_list = list... | [["+", 0, 1, 0, 652, 3, 4, 0, 661, 0, 48]] | 5 | 174 | 1 |
def CountingSort(n, input_line, max_num):
max_num += 1
count_list = [0 for i in range(max_num)]
output_line = [0 for i in range(n)]
for i in range(n):
count_list[input_line[i]] += 1
for i in range(1,max_num):
count_list[i] = count_list[i] + count_list[i-1]
print(count_list)
f... | def CountingSort(n, input_line, max_num):
max_num += 1
count_list = [0 for i in range(max_num)]
output_line = [0 for i in range(n)]
for i in range(n):
count_list[input_line[i]] += 1
for i in range(1,max_num):
count_list[i] = count_list[i] + count_list[i-1]
for i in range(n-1,-1, ... | [["-", 0, 14, 8, 196, 0, 1, 0, 652, 63, 22], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 24], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 22], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 25]] | 5 | 184 | 4 |
n = int(input())
A = list(map(int, input().split()))
def countingSort(A, B, k):
C = [0] * k
for j in range(1, n):
C[A[j]]+=1
for i in range(1, k):
C[i] = C[i] + C[i - 1]
for j in range(1, n)[::-1]:
B[C[A[j]]] = A[j]
C[A[j]]-=1
return B
print(' '.join(map(s... | n = int(input())
A = list(map(int, input().split()))
def countingSort(A, B, k):
C = [0] * k
for j in range(0, n):
C[A[j]]+=1
for i in range(1, k):
C[i] = C[i] + C[i - 1]
for j in range(0, n)[::-1]:
B[C[A[j]] - 1] = A[j]
C[A[j]]-=1
return B
print(' '.join(m... | [["-", 8, 196, 0, 7, 12, 652, 3, 4, 0, 612], ["+", 8, 196, 0, 7, 12, 652, 3, 4, 0, 612], ["-", 0, 7, 12, 206, 51, 652, 3, 4, 0, 612], ["+", 0, 7, 12, 206, 51, 652, 3, 4, 0, 612], ["+", 0, 1, 0, 662, 31, 206, 206, 657, 17, 33], ["+", 0, 1, 0, 662, 31, 206, 206, 657, 12, 612]] | 5 | 156 | 6 |
#!/usr/bin/env python
from sys import stdin
from collections import Counter
def counting_sort(a, b, k):
c = Counter()
for j in a:
c[j] += 1
for i in range(1, k+1):
c[i] += c[i-1]
for j in a[::-1]:
b[c[j]] = j
c[j] -= 1
n = int(stdin.readline())
data = [int(s) for s i... | #!/usr/bin/env python
from sys import stdin
from collections import Counter
def counting_sort(a, b, k):
c = Counter()
for j in a:
c[j] += 1
for i in range(1, k+1):
c[i] += c[i-1]
for j in a[::-1]:
b[c[j]] = j
c[j] -= 1
n = int(stdin.readline())
data = [int(s) for s i... | [["-", 0, 656, 0, 1, 0, 652, 3, 4, 0, 22], ["+", 0, 656, 0, 1, 0, 652, 3, 4, 0, 612]] | 5 | 142 | 2 |
#include <stdbool.h>
#include <stdio.h>
#define MAX 100000
#define SEN 10000000
typedef struct {
char gara;
int value;
} Huda;
void merge(Huda[], int, int, int);
void mergeSort(Huda[], int, int);
int partition(Huda[], int, int);
void swap(Huda *, Huda *);
void quickSort(Huda[], int, int, int);
void printArray(Hu... | #include <stdbool.h>
#include <stdio.h>
#define MAX 100000
#define SEN 10000000
typedef struct {
char gara;
int value;
} Huda;
void merge(Huda[], int, int, int);
void mergeSort(Huda[], int, int);
int partition(Huda[], int, int);
void swap(Huda *, Huda *);
void quickSort(Huda[], int, int, int);
void printArray(Hu... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 844 | 2 |
#include <stdio.h>
#define Max 100000
#define INF 2000000000
struct Card {
char suit;
int value;
};
struct Card L[Max / 2 + 2];
struct Card R[Max / 2 + 2];
void merge(struct Card A[], int n, int l, int m, int r) {
int i, j, k;
int n1 = m - l;
int n2 = r - m;
for (i = 0; i < n1; i++)
L[i] = A[l + i];... | #include <stdio.h>
#define Max 100000
#define INF 2000000000
struct Card {
char suit;
int value;
};
struct Card L[Max / 2 + 2];
struct Card R[Max / 2 + 2];
void merge(struct Card A[], int n, int l, int m, int r) {
int i, j, k;
int n1 = m - l;
int n2 = r - m;
for (i = 0; i < n1; i++)
L[i] = A[l + i];... | [["-", 64, 9, 0, 1, 0, 11, 31, 69, 71, 22], ["+", 64, 9, 0, 1, 0, 11, 31, 69, 71, 22]] | 0 | 728 | 2 |
#include <stdio.h>
#include <stdlib.h>
#define MAX 100000
#define FR 2000000000
int N;
typedef struct {
char sign;
int number;
} QUICK;
QUICK L[MAX / 2 + 2];
QUICK R[MAX / 2 + 2];
QUICK *A;
QUICK *B;
int partition(QUICK *, int, int, int);
void merge(QUICK *, int, int, int, int);
void mergeSort(QUICK *, int, in... | #include <stdio.h>
#include <stdlib.h>
#define MAX 100000
#define FR 2000000000
int N;
typedef struct {
char sign;
int number;
} QUICK;
QUICK L[MAX / 2 + 2];
QUICK R[MAX / 2 + 2];
QUICK *A;
QUICK *B;
int partition(QUICK *, int, int, int);
void merge(QUICK *, int, int, int, int);
void mergeSort(QUICK *, int, in... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["-", 15, 23, 0, 16, 12, 118, 28, 69, 71, 22], ["+", 15, 23, 0, 16, 12, 118, 28, 69, 71, 22], ["-", 0, 57, 64, 9, 0, 1, 0, 11, 17, 32], ["-", 64, 9, 0, 1, 0, 11, 12, 16, 31, 22], ["-", 64, 9, 0, 1, 0, 11, 12, 16, 17, 72], ["-", 64, 9, ... | 0 | 844 | 9 |
#include <stdio.h>
#define MAX 100000
#define SENTINEL 2000000000
typedef struct card {
char suit;
int num;
} Card;
Card L[MAX / 2 + 2], R[MAX / 2 + 2];
void merge(Card A[], int left, int mid, int right) {
int i, j, k;
int n1 = mid - left;
int n2 = right - mid;
for (i = 0; i < n1; i++)
L[i] = A[left +... | #include <stdio.h>
#define MAX 100000
#define SENTINEL 2000000000
typedef struct card {
char suit;
int num;
} Card;
Card L[MAX / 2 + 2], R[MAX / 2 + 2];
void merge(Card A[], int left, int mid, int right) {
int i, j, k;
int n1 = mid - left;
int n2 = right - mid;
for (i = 0; i < n1; i++)
L[i] = A[left +... | [["-", 0, 14, 8, 9, 0, 1, 0, 11, 12, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 17, 33], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["-", 0, 14, 8, 9, 0, 7, 26, 27, 17, 29], ["+", 0, 14, 8, 9, 0, 7, 26, 27, 17, 29]] | 0 | 691 | 6 |
/* Quick Sort */
#include <stdio.h>
#define MAX 100000
#define SENTINEL 2000000000;
struct Card {
char suit;
int value;
};
struct Card L[MAX / 2 + 2], R[MAX / 2 + 2];
void merge(struct Card A[], int n, int left, int mid, int right) {
int i, j, k;
int n1 = mid - left;
int n2 = right - mid;
for (i = 0; i <... | /* Quick Sort */
#include <stdio.h>
#define MAX 100000
#define SENTINEL 2000000000;
struct Card {
char suit;
int value;
};
struct Card L[MAX / 2 + 2], R[MAX / 2 + 2];
void merge(struct Card A[], int n, int left, int mid, int right) {
int i, j, k;
int n1 = mid - left;
int n2 = right - mid;
for (i = 0; i <... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18]] | 0 | 736 | 2 |
#include <limits.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int numbers[100005];
char cards[100005];
int numbersM[100005];
char cardsM[100005];
void merge(int *array, char *cards, int p, int q, int r) {
int n1 = q - p + 1;
int n2 = r - q;
int left[n1 + 1];
int right[n2 + 1];
char leftcard[n... | #include <limits.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int numbers[100005];
char cards[100005];
int numbersM[100005];
char cardsM[100005];
void merge(int *array, char *cards, int p, int q, int r) {
int n1 = q - p + 1;
int n2 = r - q;
int left[n1 + 1];
int right[n2 + 1];
char leftcard[n... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 869 | 2 |
/* C Quick Sort */
#include <stdio.h>
int n; /* 1<=n<=100000 */
int Partition(int A[], char M[], int p, int r);
void QuickSort(int A[], char M[], int p, int r);
void MergeSort(int A[], char M[], int l, int r);
void Merge(int A[], char M[], int l, int m, int r);
int main() {
int i;
int q;
int stable_judge = 0;
... | /* C Quick Sort */
#include <stdio.h>
int n; /* 1<=n<=100000 */
int Partition(int A[], char M[], int p, int r);
void QuickSort(int A[], char M[], int p, int r);
void MergeSort(int A[], char M[], int l, int r);
void Merge(int A[], char M[], int l, int m, int r);
int main() {
int i;
int q;
int stable_judge = 0;
... | [["-", 0, 1, 0, 2, 3, 4, 0, 16, 17, 33], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 0 | 935 | 2 |
#include <memory.h>
#include <stdio.h>
#define N 100001
typedef struct {
int A;
char B;
} card;
card array[N], arrayMarge[N];
int Partition(card *, int, int);
void Quicksort(card *, int, int);
void Merge(card *, int, int, int);
void MergeSort(card *, int, int);
int n;
int main() {
int i;
scanf("%d\n", &n... | #include <memory.h>
#include <stdio.h>
#define N 100001
typedef struct {
int A;
char B;
} card;
card array[N], arrayMarge[N];
int Partition(card *, int, int);
void Quicksort(card *, int, int);
void Merge(card *, int, int, int);
void MergeSort(card *, int, int);
int n;
int main() {
int i;
scanf("%d\n", &n... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 702 | 2 |
#include <stdio.h>
typedef struct _card {
int number;
char suit;
} CARD;
CARD A[100000], I[100000];
void exchange(CARD *a, CARD *b);
int Partition(CARD A[], int p, int r);
void Quicksort(CARD A[], int p, int r);
int main(void) {
int n;
char str[20];
int stable = 1;
int i, j, c, d;
scanf("%d", &n);
... | #include <stdio.h>
typedef struct _card {
int number;
char suit;
} CARD;
CARD A[100000], I[100000];
void exchange(CARD *a, CARD *b);
int Partition(CARD A[], int p, int r);
void Quicksort(CARD A[], int p, int r);
int main(void) {
int n;
char str[20];
int stable = 1;
int i, j, c, d;
scanf("%d", &n);
... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 19]] | 0 | 579 | 2 |
#include <stdio.h>
#define N 100000
int A[N];
char C[N];
char C1[N];
int A1[N];
int Partition(int p, int r) {
int x, i, j;
int tmp, tmpc;
x = A[r];
i = p - 1;
for (j = p; j < r; j++) {
if (A[j] <= x) {
i = i + 1;
tmp = A[j];
tmpc = C[j];
A[j] = A[i];
C[j] = C[i];
A[... | #include <stdio.h>
#define N 100000
int A[N];
char C[N];
char C1[N];
int A1[N];
int Partition(int p, int r) {
int x, i, j;
int tmp, tmpc;
x = A[r];
i = p - 1;
for (j = p; j < r; j++) {
if (A[j] <= x) {
i = i + 1;
tmp = A[j];
tmpc = C[j];
A[j] = A[i];
C[j] = C[i];
A[... | [["-", 8, 9, 0, 1, 0, 11, 31, 69, 28, 22], ["+", 8, 9, 0, 1, 0, 11, 31, 69, 28, 22], ["-", 64, 9, 0, 1, 0, 11, 12, 69, 28, 22], ["+", 64, 9, 0, 1, 0, 11, 12, 69, 28, 22], ["-", 0, 9, 0, 1, 0, 11, 12, 69, 28, 22], ["+", 0, 9, 0, 1, 0, 11, 12, 69, 28, 22]] | 0 | 803 | 6 |
package main
import (
"bufio"
"fmt"
"os"
"strconv"
"strings"
)
func partition(xs []int, p int, r int) int {
x := xs[r]
as := xs[:len(xs)-1]
i := p - 1 // 前パーティションの最後の要素のポインタ
j := p
for j < len(as) {
target := as[j]
if target < x {
i++
as[j] = as[i]
as[i] = target
}
j++
}
xs[r] = xs[i+1]
... | package main
import (
"bufio"
"fmt"
"os"
"strconv"
"strings"
)
func partition(xs []int, p int, r int) int {
x := xs[r]
as := xs[:len(xs)-1]
i := p - 1 // 前パーティションの最後の要素のポインタ
j := p
for j < len(as) {
target := as[j]
if target <= x {
i++
as[j] = as[i]
as[i] = target
}
j++
}
xs[r] = xs[i+1]
... | [["-", 0, 7, 8, 196, 0, 57, 15, 16, 17, 18], ["+", 0, 7, 8, 196, 0, 57, 15, 16, 17, 19]] | 7 | 382 | 2 |
import java.util.Scanner;
public class Main {
public static int partition(String[][] arr, int p, int r) {
int x = toInt(arr, r);
int i = p - 1;
for (int j = p; j < r; j++) {
if (toInt(arr, j) <= x) {
change(arr, ++i, j);
}
}
change(arr, ++i, r);
return i;
}
public stat... | import java.util.Scanner;
public class Main {
public static int partition(String[][] arr, int p, int r) {
int x = toInt(arr, r);
int i = p - 1;
for (int j = p; j < r; j++) {
if (toInt(arr, j) <= x) {
change(arr, ++i, j);
}
}
change(arr, ++i, r);
return i;
}
public stat... | [["-", 8, 196, 0, 7, 502, 503, 49, 200, 51, 22], ["+", 8, 196, 0, 7, 502, 503, 49, 200, 51, 22]] | 3 | 795 | 2 |
import java.io.*;
import java.util.*;
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[] a = new String[n];
Map<String, StringBuilder> map = new HashMap<S... | import java.io.*;
import java.util.*;
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[] a = new String[n];
Map<String, StringBuilder> map = new HashMap<S... | [["+", 8, 196, 0, 7, 15, 16, 12, 16, 17, 72], ["+", 8, 196, 0, 7, 15, 16, 12, 16, 12, 22]] | 3 | 604 | 2 |
import java.io.*;
import java.util.*;
public class Main {
public static int max = 0;
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(br.readLine());
String[][] str = new String[n][2];
Arra... | import java.io.*;
import java.util.*;
public class Main {
public static int max = 0;
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(br.readLine());
String[][] str = new String[n][2];
Arra... | [["-", 51, 492, 3, 4, 0, 16, 12, 504, 71, 22], ["+", 51, 492, 3, 4, 0, 16, 12, 504, 71, 22]] | 3 | 729 | 2 |
import java.util.Arrays;
import java.util.Scanner;
public class Main {
static Scanner sc = new Scanner(System.in);
static int n, x;
static Card[] A, B;
public static void main(String[] args) {
read();
quickSort(A, 0, n - 1);
mergeSort(B, 0, n);
boolean stable = same(A, B);
String strStab... | import java.util.Arrays;
import java.util.Scanner;
public class Main {
static Scanner sc = new Scanner(System.in);
static int n, x;
static Card[] A, B;
public static void main(String[] args) {
read();
quickSort(A, 0, n - 1);
mergeSort(B, 0, n);
boolean stable = same(A, B);
String strStab... | [["-", 0, 503, 49, 200, 51, 510, 64, 5, 0, 491], ["+", 0, 503, 49, 200, 51, 510, 64, 5, 0, 491]] | 3 | 826 | 2 |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.HashMap;
public class Main {
public static final String EOF = System.lineSeparator();
public static long l = 0, l2 = 0;
public static void main(St... | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.HashMap;
public class Main {
public static final String EOF = System.lineSeparator();
public static long l = 0, l2 = 0;
public static void main(St... | [["-", 0, 492, 3, 4, 0, 510, 75, 5, 0, 491], ["+", 0, 492, 3, 4, 0, 510, 75, 5, 0, 491]] | 3 | 691 | 2 |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
// ALDS1_6_C
public class Main {
Card SENTINEL = new Card("F", 1234567890);
int sum = 0;
void merge(Card[] A, int left, int mid, int right) {
int n1 = mid - left + 1;
int n2 = right - mid;
Card[] L = new Card... | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
// ALDS1_6_C
public class Main {
Card SENTINEL = new Card("F", 1234567890);
int sum = 0;
void merge(Card[] A, int left, int mid, int right) {
int n1 = mid - left + 1;
int n2 = right - mid;
Card[] L = new Card... | [["+", 8, 196, 0, 57, 15, 15, 0, 91, 17, 111]] | 3 | 846 | 1 |
#include <stdio.h>
#define MAX 100001
#define INI 2000000000
struct Card {
char gara;
int value;
};
int merge(struct Card card1[], int n, int left, int right, int mid) {
int i, n1, n2, j, k;
struct Card L[MAX / 2 + 2], R[MAX / 2 + 2];
n1 = (mid - left);
n2 = (right - mid);
for (i = 0; i < n1; i++) {
... | #include <stdio.h>
#define MAX 100001
#define INI 2000000000
struct Card {
char gara;
int value;
};
int merge(struct Card card1[], int n, int left, int right, int mid) {
int i, n1, n2, j, k;
struct Card L[MAX / 2 + 2], R[MAX / 2 + 2];
n1 = (mid - left);
n2 = (right - mid);
for (i = 0; i < n1; i++) {
... | [["+", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67]] | 0 | 744 | 2 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define N 100001
#define INFTY 1000000000
typedef struct {
char card;
int num;
} Record;
int partition(Record *, int, int);
void quicksort(Record *, int, int);
void merge(Record *, int, int, int);
void mergeSort(Record *, int, int);
int Stable(Record *, ... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define N 100001
#define INFTY 1000000000
typedef struct {
char card;
int num;
} Record;
int partition(Record *, int, int);
void quicksort(Record *, int, int);
void merge(Record *, int, int, int);
void mergeSort(Record *, int, int);
int Stable(Record *, ... | [["-", 8, 9, 0, 1, 0, 11, 31, 118, 119, 120], ["+", 8, 9, 0, 1, 0, 11, 31, 118, 119, 120], ["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18]] | 0 | 855 | 6 |
#include <stdio.h>
#define INFINITY 1000000001
#define N 100000
typedef struct {
int number;
char mark;
} Card;
void merge(Card *, int, int, int);
void mergeSort(Card *, int, int);
int partition(Card *, int, int);
void quickSort(Card *, int, int);
int main() {
Card out1[N], out2[N];
int n, v, f = 1;
int i;... | #include <stdio.h>
#define INFINITY 1000000001
#define N 100000
typedef struct {
int number;
char mark;
} Card;
void merge(Card *, int, int, int);
void mergeSort(Card *, int, int);
int partition(Card *, int, int);
void quickSort(Card *, int, int);
int main() {
Card out1[N], out2[N];
int n, v, f = 1;
int i;... | [["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 0 | 747 | 1 |
#include <stdio.h>
#include <stdlib.h>
typedef struct {
int a;
int num;
char type;
} CARD;
void Qsort(CARD *, int, int);
int partition(CARD *, int, int);
int main() {
int n, i, sta = 0;
CARD *A;
scanf("%d", &n);
A = (CARD *)malloc(sizeof(CARD) * n);
for (i = 0; i < n; i++) {
scanf(" %c", &A[i].... | #include <stdio.h>
#include <stdlib.h>
typedef struct {
int a;
int num;
char type;
} CARD;
void Qsort(CARD *, int, int);
int partition(CARD *, int, int);
int main() {
int n, i, sta = 0;
CARD *A;
scanf("%d", &n);
A = (CARD *)malloc(sizeof(CARD) * n);
for (i = 0; i < n; i++) {
scanf(" %c", &A[i].... | [["-", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 64, 1, 0, 2, 3, 4, 0, 5, 0, 44], ["+", 0, 14, 8, 9, 0, 57, 75, 76, 0, 95], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 448 | 6 |
#include <stdio.h>
#include <stdlib.h>
typedef struct {
int num;
int mmm;
char mark;
} Card;
int n, x;
int pertition(Card *A, int p, int r) {
int i, j;
Card tmp;
x = A[r].num;
i = p - 1;
for (j = p; j < r; j++) {
if (A[j].num <= x) {
i++;
tmp = A[i];
A[i] = A[j];
A[j] = tm... | #include <stdio.h>
#include <stdlib.h>
typedef struct {
int num;
int mmm;
char mark;
} Card;
int n, x;
int pertition(Card *A, int p, int r) {
int i, j;
Card tmp;
x = A[r].num;
i = p - 1;
for (j = p; j < r; j++) {
if (A[j].num <= x) {
i++;
tmp = A[i];
A[i] = A[j];
A[j] = tm... | [["-", 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]] | 0 | 451 | 7 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int count = 0;
char N[100000];
#define SENTINEL 1000000001
int Partition(int *A, char *C, int f, int l) {
int i, j, x;
char c;
i = f - 1;
for (j = f; j < l; j++) {
if (A[j] <= A[l]) {
i = i + 1;
x = A[j];
A[j] = A[i];
A[i] = ... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
int count = 0;
char N[100000];
#define SENTINEL 1000000001
int Partition(int *A, char *C, int f, int l) {
int i, j, x;
char c;
i = f - 1;
for (j = f; j < l; j++) {
if (A[j] <= A[l]) {
i = i + 1;
x = A[j];
A[j] = A[i];
A[i] = ... | [["-", 15, 23, 0, 16, 31, 2, 3, 4, 0, 22], ["+", 15, 23, 0, 16, 31, 2, 3, 4, 0, 22]] | 0 | 901 | 2 |
#include <stdio.h>
#define MAX 100000
#define SENTINEL 2000000000
struct Card {
char suit;
int value;
};
struct Card L[MAX / 2 + 2], R[MAX / 2 + 2];
void merge(struct Card A[], int n, int left, int mid, int right) {
int i, j, k;
int n1 = mid - left;
int n2 = right - mid;
for (i = 0; i < n1; i++)
L[i]... | #include <stdio.h>
#define MAX 100000
#define SENTINEL 2000000000
struct Card {
char suit;
int value;
};
struct Card L[MAX / 2 + 2], R[MAX / 2 + 2];
void merge(struct Card A[], int n, int left, int mid, int right) {
int i, j, k;
int n1 = mid - left;
int n2 = right - mid;
for (i = 0; i < n1; i++)
L[i]... | [["-", 8, 1, 0, 11, 12, 69, 71, 16, 12, 13], ["+", 8, 1, 0, 11, 12, 69, 71, 16, 12, 22]] | 0 | 725 | 2 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.