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 <algorithm>
#include <iostream>
#include <vector>
using namespace std;
void counting_sort(vector<int> &A) {
int max_a = *max_element(A.begin(), A.end());
vector<int> C(max_a + 1, 0);
for (const auto &a : A)
C[a]++;
for (int i = 1; i < C.size(); i++)
C[i] += C[i - 1];
vector<int> B(A.size());... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
void counting_sort(vector<int> &A) {
int max_a = *max_element(A.begin(), A.end());
vector<int> C(max_a + 1, 0);
for (const auto &a : A)
C[a]++;
for (int i = 1; i < C.size(); i++)
C[i] += C[i - 1];
vector<int> B(A.size());... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 47], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 20], ["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 45], ["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46]] | 1 | 264 | 4 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
using namespace std;
const int INF = 0x3f3f3f3f;
int A[2000005], B[2000005], C[10005];
int main() {
int n, temp = 0;
cin >> n;
for (int i = 1; i <= n; i++)
scanf("%d", A + i);
for (int i = 0; ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
using namespace std;
const int INF = 0x3f3f3f3f;
int A[2000005], B[2000005], C[10005];
int main() {
int n, temp = 0;
cin >> n;
for (int i = 1; i <= n; i++)
scanf("%d", A + i);
for (int i = 1; ... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 225 | 6 |
#include <iostream>
using namespace std;
int a[2000000];
int main() {
int n, c[10001] = {};
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
c[a[i]]++;
}
int j = 0;
for (int i = 0; i < 10001; i++) {
for (int k = 0; k < c[i]; k++)
a[(j++) + k] = i;
}
for (int i = 0; i < n; i++)
... | #include <iostream>
using namespace std;
int a[2000000];
int main() {
int n, c[10001] = {};
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
c[a[i]]++;
}
int j = 0;
for (int i = 0; i < 10001; i++) {
for (int k = 0; k < c[i]; k++)
a[j++] = i;
}
for (int i = 0; i < n; i++)
cout... | [["-", 31, 69, 341, 342, 0, 16, 31, 23, 0, 24], ["-", 31, 69, 341, 342, 0, 16, 31, 23, 0, 25], ["-", 0, 11, 31, 69, 341, 342, 0, 16, 17, 72], ["-", 0, 11, 31, 69, 341, 342, 0, 16, 12, 22]] | 1 | 157 | 4 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
void counting_sort(vector<int> &A, int n) {
int k = *max_element(A.begin(), A.end());
vector<int> B(n);
vector<int> C(k);
for (int i = 0; i < k; i++)
C[i] = 0;
for (int j = 0; j < n; j++)
C[A[j]]++;
for (int i = 1; i... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
void counting_sort(vector<int> &A, int n) {
int k = *max_element(A.begin(), A.end());
vector<int> B(n + 1);
vector<int> C(k + 1);
for (int i = 0; i < k; i++)
C[i] = 0;
for (int j = 0; j < n; j++)
C[A[j]]++;
for (int ... | [["+", 0, 43, 49, 50, 51, 4, 0, 16, 17, 72], ["+", 0, 43, 49, 50, 51, 4, 0, 16, 12, 13]] | 1 | 280 | 4 |
#include <algorithm> // next_permutation
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <list>
#include <numeric> //accumulate
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
//#include <unordered_map> //???????????\??¢??°
#include <fstream> /... | #include <algorithm> // next_permutation
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <list>
#include <numeric> //accumulate
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
//#include <unordered_map> //???????????\??¢??°
#include <fstream> /... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 398 | 2 |
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <stack>
#include <vector>
#define NMAX 2000000
#define VMAX 10000
using namespace std;
int main() {
unsigned short *A, *B;
int n;
int C[VMAX + 1];
scanf("%d", &n);
for (int i = 0; i <= VMA... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <stack>
#include <vector>
#define NMAX 2000000
#define VMAX 10000
using namespace std;
int main() {
unsigned short *A, *B;
int n;
int C[VMAX + 1];
scanf("%d", &n);
for (int i = 0; i <= VMA... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 273 | 6 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
int a[2000010], b[2000010], c[2000010], n;
int countingS(int a[], int b[], int k) {
for (int i = 0; i <= k; i++) ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
int a[2000010], b[2000010], c[2000010], n;
int countingS(int a[], int b[], int k) {
for (int i = 0; i <= k; i++) ... | [["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13]] | 1 | 258 | 2 |
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <stdlib.h>
#define MAX 2000001
#define VMAX 10000
int main() {
unsigned short *A, *B;
int C[VMAX + 1];
int n, i, j;
scanf("%d", &n);
A = (unsigned short *)malloc(sizeof(short) * n + 1);
B = (unsigned short *)malloc(sizeof(short) * n + 1);
for... | #define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <stdlib.h>
#define MAX 2000001
#define VMAX 10000
int main() {
unsigned short *A, *B;
int C[VMAX + 1];
int n, i, j;
scanf("%d", &n);
A = (unsigned short *)malloc(sizeof(short) * n + 1);
B = (unsigned short *)malloc(sizeof(short) * n + 1);
for... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18]] | 1 | 270 | 2 |
#include <iostream>
using namespace std;
#define maxN 2000001
#define maxData 10001
int boxA[maxN], boxB[maxN], boxC[maxData];
int main(void) {
/* *** initialize *** */
int dataN = 0;
boxA[maxN] = {0};
boxB[maxN] = {0};
boxC[maxData] = {0};
/* *** input Data *** */
cin >> dataN;
// cout << "dataN = ... | #include <iostream>
using namespace std;
#define maxN 2000001
#define maxData 10000
int boxA[maxN], boxB[maxN], boxC[maxData];
int main(void) {
/* *** initialize *** */
int dataN = 0;
boxA[maxN] = {0};
boxB[maxN] = {0};
boxC[maxData] = {0};
/* *** input Data *** */
cin >> dataN;
// cout << "dataN = ... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22]] | 1 | 234 | 4 |
#include <iostream>
using namespace std;
int A[200000];
int B[200000];
int C[10001];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> A[i];
C[A[i]]++;
}
for (int i = 1; i < n; i++) {
C[i] += C[i - 1];
}
for (int j = n - 1; j >= 0; j--) {
B[--C[A[j]]] = A[j];
}
... | #include <iostream>
using namespace std;
int A[2000000];
int B[2000000];
int C[10001];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> A[i];
C[A[i]]++;
}
for (int i = 1; i <= 10000; i++) {
C[i] += C[i - 1];
}
for (int j = n - 1; j >= 0; j--) {
B[--C[A[j]]] = A[j];
... | [["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 178 | 8 |
// 計数ソート
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <stack>
#include <vector>
using namespace std;
#define MAX_N 2000000
// const int INFTY = 2147483647;
void CountingSort(int base[], int sort[], int n, int max);
int main(void) {
int... | // 計数ソート
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <stack>
#include <vector>
using namespace std;
#define MAX_N 2000000
// const int INFTY = 2147483647;
void CountingSort(int base[], int sort[], int n, int max);
int main(void) {
int... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 365 | 6 |
#include <iostream>
using namespace std;
int A[2000005], B[2000005], C[10005];
void CountingSort(int n) {
int k = 10000;
for (int i = 0; i <= k; i++)
C[i] = 0;
for (int j = 0; j < n; j++)
C[A[j]]++;
for (int i = 1; i <= k; i++)
C[i] += C[i - 1];
for (int j = n - 1; j >= 0; j--) {
B[C[A[j]... | #include <iostream>
using namespace std;
int A[2000005], B[2000005], C[10005];
void CountingSort(int n) {
int k = 10000;
for (int i = 0; i <= k; i++)
C[i] = 0;
for (int j = 0; j < n; j++)
C[A[j]]++;
for (int i = 1; i <= k; i++)
C[i] += C[i - 1];
for (int j = n - 1; j >= 0; j--) {
B[C[A[j]... | [["+", 0, 11, 31, 69, 341, 342, 0, 16, 17, 33], ["+", 0, 11, 31, 69, 341, 342, 0, 16, 12, 13]] | 1 | 224 | 2 |
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <cmath>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
using namespace std;
typedef long ... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <cmath>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
using namespace std;
typedef long ... | [["-", 0, 1, 0, 27, 28, 69, 28, 2, 63, 22], ["+", 0, 1, 0, 27, 28, 69, 28, 2, 63, 22]] | 1 | 276 | 2 |
#include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int A[2000010], B[2000010];
int C[100010];
int main() {
int n;
cin >> n;
for (int i = 0; i < 100000; i++)
C[i] = 0;
for (int i = 0; i < n; i++) {
cin >> A[i + 1];
C[A[i]]++;
}
for (int i = 1; i < 100000; i++)
C[... | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int A[2000010], B[2000010];
int C[100010];
int main() {
int n;
cin >> n;
for (int i = 0; i < 100000; i++)
C[i] = 0;
for (int i = 0; i < n; i++) {
cin >> A[i + 1];
C[A[i + 1]]++;
}
for (int i = 1; i < 100000; i++)
... | [["+", 341, 342, 0, 69, 341, 342, 0, 16, 17, 72], ["+", 341, 342, 0, 69, 341, 342, 0, 16, 12, 13]] | 1 | 200 | 2 |
#include <stdio.h>
int main() {
int n;
scanf("%d", &n);
int A[n + 1], B[n + 1], C[10000 + 1];
for (int i = 0; i < 10000 + 1; i++) {
C[i] = 0;
}
for (int i = 0; i < n; i++) {
scanf("%d", &A[i + 1]);
C[A[i + 1]]++;
}
for (int i = 0; i < 10000 + 1; i++)
C[i + 1] = C[i + 1] + C[i];
fo... | #include <stdio.h>
int main() {
int n;
scanf("%d", &n);
int A[n + 1], B[n + 1], C[10000 + 1];
for (int i = 0; i < 10000 + 1; i++) {
C[i] = 0;
}
for (int i = 0; i < n; i++) {
scanf("%d", &A[i + 1]);
C[A[i + 1]]++;
}
for (int i = 0; i < 10000 + 1; i++)
C[i + 1] = C[i + 1] + C[i];
fo... | [["+", 341, 342, 0, 69, 341, 342, 0, 16, 17, 72], ["+", 341, 342, 0, 69, 341, 342, 0, 16, 12, 13]] | 1 | 241 | 2 |
#include <iostream>
using namespace std;
int n;
int *A;
int *C, *B;
void bucketSort(int *A) {
for (int i = 0; i < n; ++i) {
C[A[i]]++;
}
for (int j = 1; j < 10000; ++j) {
C[j] = C[j] + C[j - 1];
}
for (int k = 0; k < n; k++) {
B[C[A[k]] - 1] = A[k];
C[A[k]]--;
}
}
int main() {
cin >> n... | #include <iostream>
using namespace std;
int n;
int *A;
int *C, *B;
void bucketSort(int *A) {
for (int i = 0; i < n; ++i) {
C[A[i]]++;
}
for (int j = 1; j < 10000; ++j) {
C[j] = C[j] + C[j - 1];
}
for (int k = 0; k < n; k++) {
B[C[A[k]] - 1] = A[k];
C[A[k]]--;
}
}
int main() {
cin >> n... | [["-", 8, 9, 0, 57, 15, 339, 51, 91, 17, 111]] | 1 | 233 | 1 |
//============================================================================
// Name : CountingSort.cpp
// Author : Ken
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
#i... | //============================================================================
// Name : CountingSort.cpp
// Author : Ken
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
#i... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 11, 31, 2, 3, 4, 0, 16, 17, 33], ["+", 0, 11, 31, 2, 3, 4, 0, 16, 12, 13]] | 1 | 340 | 6 |
#include <iostream>
using namespace std;
int main(void) {
ios_base::sync_with_stdio(false);
int A[10001] = {};
int n, num;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> num;
A[num] += 1;
}
for (int i = 0; i < n; i++) {
if (0 < A[i]) {
cout << i;
A[i] -= 1;
break;
}
}
... | #include <iostream>
using namespace std;
int main(void) {
ios_base::sync_with_stdio(false);
int A[10001] = {};
int n, num;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> num;
A[num] += 1;
}
for (int i = 0; i < n; i++) {
if (0 < A[i]) {
cout << i;
A[i] -= 1;
break;
}
}
... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 157 | 2 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int i, j, buf;
int k = 10;
int n;
vector<int> A, B, C;
cin >> n;
for (i = 0; i < n; i++) {
// cin >> A[i]; //?buf使わなくていいの？ ->使わなきゃダメだったエラー[vector
// subscript out of range]
cin >> buf;
A.push_back(buf);
}
for (i ... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int i, j, buf;
int k = 2000000;
int n;
vector<int> A, B, C;
cin >> n;
for (i = 0; i < n; i++) {
// cin >> A[i]; //?buf使わなくていいの？ ->使わなきゃダメだったエラー[vector
// subscript out of range]
cin >> buf;
A.push_back(buf);
}
fo... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 254 | 2 |
#include <stdio.h>
#include <stdlib.h>
int pertition(int *, int, int);
int partition(int *A, int p, int r) {
int x = A[r];
int i = p - 1;
int j, tmp;
for (j = p; j < r; j++) {
if (A[j] <= x) {
i = i + 1;
tmp = A[j];
A[i] = A[j];
A[j] = tmp;
}
}
tmp = A[i + 1];
A[i + 1] =... | #include <stdio.h>
#include <stdlib.h>
int pertition(int *, int, int);
int partition(int *A, int p, int r) {
int x = A[r];
int i = p - 1;
int j, tmp;
for (j = p; j < r; 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] =... | [["-", 64, 9, 0, 1, 0, 11, 12, 69, 71, 22], ["+", 64, 9, 0, 1, 0, 11, 12, 69, 71, 22]] | 0 | 301 | 2 |
#include <stdio.h>
#define MAX 100000
int partition(int *a, int p, int r) {
int x;
int i, j;
int tmp;
x = a[r];
i = p - 1;
for (j = p; j < r; j++) {
if (a[j] <= x) {
i++;
tmp = a[j];
a[j] = a[i];
a[i] = tmp;
}
}
tmp = a[i + 1];
a[i + 1] = a[r];
a[r] = tmp;
return i... | #include <stdio.h>
#define MAX 100000
int partition(int *a, int p, int r) {
int x;
int i, j;
int tmp;
x = a[r];
i = p - 1;
for (j = p; j < r; j++) {
if (a[j] <= x) {
i++;
tmp = a[j];
a[j] = a[i];
a[i] = tmp;
}
}
tmp = a[i + 1];
a[i + 1] = a[r];
a[r] = tmp;
return i... | [["-", 0, 1, 0, 2, 3, 4, 0, 69, 71, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 69, 71, 22]] | 0 | 287 | 2 |
#include <stdio.h>
#define MAX 100000
int array[MAX];
int partition(int, int);
int main() {
int n, i, ans;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &array[i]);
}
ans = partition(0, n - 1);
for (i = 0; i < ans; i++) {
printf("%d ", array[i]);
}
printf("[%d] ", array[ans]);
... | #include <stdio.h>
#define MAX 100000
int array[MAX];
int partition(int, int);
int main() {
int n, i, ans;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &array[i]);
}
ans = partition(0, n - 1);
for (i = 0; i < ans; i++) {
printf("%d ", array[i]);
}
printf("[%d] ", array[ans]);
... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 22]] | 0 | 288 | 2 |
#include <stdio.h>
int partition(int A[], int p, int r);
int A[100000];
int main() {
int n, i, j, x, ex;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
ex = partition(A, 0, n - 1);
for (i = 0; i < ex; i++) {
printf("%d ", A[i]);
}
printf("[%d] ", A[ex]);
for (i = ex; i < n - ... | #include <stdio.h>
int partition(int A[], int p, int r);
int A[100000];
int main() {
int n, i, j, x, ex;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
ex = partition(A, 0, n - 1);
for (i = 0; i < ex; i++) {
printf("%d ", A[i]);
}
printf("[%d] ", A[ex]);
for (i = ex + 1; i < ... | [["+", 8, 9, 0, 7, 10, 11, 12, 16, 17, 72], ["+", 8, 9, 0, 7, 10, 11, 12, 16, 12, 13]] | 0 | 308 | 2 |
#include <stdio.h>
#include <stdlib.h>
void swap(int *, int *);
int main() {
int n;
scanf("%d", &n);
int *A;
A = (int *)malloc(sizeof(int) * n);
int i;
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
int j;
for (i = 0, j = 0; i < n - 1; i++)
if (A[i] < A[n - 1]) {
swap(&A[i], &A[j]);
j++... | #include <stdio.h>
#include <stdlib.h>
void swap(int *, int *);
int main() {
int n;
scanf("%d", &n);
int *A;
A = (int *)malloc(sizeof(int) * n);
int i;
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
int j;
for (i = 0, j = 0; i < n - 1; i++)
if (A[i] <= A[n - 1]) {
swap(&A[i], &A[j]);
j+... | [["-", 0, 7, 8, 57, 15, 23, 0, 16, 17, 18], ["+", 0, 7, 8, 57, 15, 23, 0, 16, 17, 19]] | 0 | 272 | 2 |
#include <stdio.h>
#include <stdlib.h>
int main() {
int i, j, n, tmp, x, *A;
scanf("%d", &n);
A = malloc(sizeof(int) * (n + 1));
for (i = 1; i < n + 1; i++)
scanf("%d", &A[i]);
i = 0;
for (j = 1; j < n; j++)
if (A[j] <= A[n]) {
i++;
tmp = A[i];
A[i] = A[j];
A[j] = tmp;
... | #include <stdio.h>
#include <stdlib.h>
int main() {
int i, j, n, tmp, x, *A;
scanf("%d", &n);
A = malloc(sizeof(int) * (n + 1));
for (i = 1; i < n + 1; i++)
scanf("%d", &A[i]);
i = 0;
for (j = 1; j < n; j++)
if (A[j] <= A[n]) {
i++;
tmp = A[i];
A[i] = A[j];
A[j] = tmp;
... | [["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 72], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 0 | 251 | 2 |
#include <stdio.h>
#include <stdlib.h>
int partition(int A[], int p, int r) {
int x = A[r];
int i = p - 1;
int j, tmp;
for (j = p; j < r - 1; 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 +... | #include <stdio.h>
#include <stdlib.h>
int partition(int A[], int p, int r) {
int x = A[r];
int i = p - 1;
int j, tmp;
for (j = p; j <= r - 1; 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 ... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 0 | 287 | 2 |
#include <stdio.h>
#include <stdlib.h>
#define N 100000
int partition(int *, int, int);
int i, j, A[N];
int main() {
int 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("[");
printf("... | #include <stdio.h>
#include <stdlib.h>
#define N 100000
int partition(int *, int, int);
int i, j, A[N];
int main() {
int 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("[");
printf("... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 0 | 291 | 2 |
#include <stdio.h>
#define MAX 100000
int main() {
int i = 0, j = 0, k, n, tmp, arr[MAX];
scanf("%d", &n);
int m = n - 1;
for (i = 0; i < n; i++)
scanf("%d", &arr[i]);
i = 0;
while (1) {
if (j == m)
break;
if (arr[j] < arr[m]) {
tmp = arr[i];
arr[i] = arr[j];
arr... | #include <stdio.h>
#define MAX 100000
int main() {
int i = 0, j = 0, k, n, tmp, arr[MAX];
scanf("%d", &n);
int m = n - 1;
for (i = 0; i < n; i++)
scanf("%d", &arr[i]);
i = 0;
while (1) {
if (j == m)
break;
if (arr[j] <= arr[m]) {
tmp = arr[i];
arr[i] = arr[j];
ar... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 19], ["-", 0, 57, 15, 23, 0, 16, 12, 16, 31, 22], ["-", 0, 57, 15, 23, 0, 16, 12, 16, 17, 85], ["-", 0, 57, 15, 23, 0, 16, 12, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 12, 22]] | 0 | 246 | 6 |
/**
* Partision
*
*/
#include <stdio.h>
#define MAX 100000
/* prototype */
int partition(int *, int, int);
int main() {
int i, n, pivot;
/* input the number of A[] */
scanf("%d", &n);
int A[n];
/* input datas */
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
pivot = partition(A, 0, n - 1)... | /**
* Partision
*
*/
#include <stdio.h>
#define MAX 100000
/* prototype */
int partition(int *, int, int);
int main() {
int i, n, pivot;
/* input the number of A[] */
scanf("%d", &n);
int A[n];
/* input datas */
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
pivot = 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 | 334 | 2 |
#include <ctype.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
//============================================================================
#define pred(x) ((x)-1)
#define succ(x) ((x) + 1)
//============================================================================
//-------------... | #include <ctype.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
//============================================================================
#define pred(x) ((x)-1)
#define succ(x) ((x) + 1)
//============================================================================
//-------------... | [["-", 0, 14, 8, 9, 0, 7, 8, 52, 0, 89], ["+", 0, 14, 8, 9, 0, 7, 8, 57, 0, 121]] | 0 | 339 | 2 |
#include <stdio.h>
#define MAX 100000
int A[MAX] = {0};
void showM(int A[], int n) {
int i;
for (i = 0; i < n; ++i) {
if (i != n - 1) {
printf("%d ", A[i]);
} else {
printf("%d\n", A[i]);
}
}
// printf("\n");
}
int partition(int A[], int p, int r) {
int x, tmp, i, j;
x = A[r - 1]... | #include <stdio.h>
#define MAX 100000
int A[MAX] = {0};
void showM(int A[], int n) {
int i;
for (i = 0; i < n; ++i) {
if (i != n - 1) {
printf("%d ", A[i]);
} else {
printf("%d\n", A[i]);
}
}
// printf("\n");
}
int partition(int A[], int p, int r) {
int x, tmp, i, j;
x = A[r - 1]... | [["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["-", 8, 9, 0, 1, 0, 11, 12, 16, 17, 33], ["-", 8, 9, 0, 1, 0, 11, 12, 16, 12, 13]] | 0 | 408 | 4 |
#include <stdio.h>
#define MAX 100000
int partition(int *, int, int);
int main() {
int n, i, q;
int A[MAX];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
q = partition(A, 0, n - 1);
for (i = 0; i < q; i++) {
printf("%d", A[i]);
printf(" ");
}
printf("[%d] ", A[q])... | #include <stdio.h>
#define MAX 100000
int partition(int *, int, int);
int main() {
int n, i, q;
int A[MAX];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
q = partition(A, 0, n - 1);
for (i = 0; i < q; i++) {
printf("%d", A[i]);
printf(" ");
}
printf("[%d] ", A[q])... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 0 | 314 | 2 |
#include <stdio.h>
#define Max 100000
#define AMax 100000
int A[Max], n;
int partition(int q, int r) {
int x, i, j, kari;
x = A[r];
for (j = 1; j < r; j++) {
if (A[j] <= x) {
kari = A[q];
A[q] = A[j];
A[j] = kari;
q++;
}
}
kari = A[q];
A[q] = A[r];
A[r] = kari;
return q... | #include <stdio.h>
#define Max 100000
#define AMax 100000
int A[Max], n;
int partition(int q, int r) {
int x, i, j, kari;
x = A[r];
for (j = 0; j < r; j++) {
if (A[j] <= x) {
kari = A[q];
A[q] = A[j];
A[j] = kari;
q++;
}
}
kari = A[q];
A[q] = A[r];
A[r] = kari;
return q... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13]] | 0 | 264 | 2 |
#include <stdio.h>
#define N 10000
int main() {
int A[N], i, j = 0, n, tmp;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
for (i = 1; i < n - 1; i++) {
if (A[n - 1] >= A[i]) {
tmp = A[i];
A[i] = A[j];
A[j] = tmp;
j++;
}
}
tmp = A[n - 1];
A[n -... | #include <stdio.h>
#define N 1000000
int main() {
int A[N], i, j = 0, n, tmp;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
for (i = 0; i < n - 1; i++) {
if (A[n - 1] >= A[i]) {
tmp = A[i];
A[i] = A[j];
A[j] = tmp;
j++;
}
}
tmp = A[n - 1];
A[n... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13]] | 0 | 255 | 4 |
#include <stdio.h>
int A[100000];
int n;
int par(int p, int r) {
int x, i, j, t;
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;
return i + 1;
}
int main() {
int i, ... | #include <stdio.h>
int A[100000];
int n;
int par(int p, int r) {
int x, i, j, t;
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;
return i + 1;
}
int main() {
int i, ... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 60], ["-", 8, 9, 0, 57, 15, 23, 0, 16, 12, 13]] | 0 | 266 | 2 |
#include <stdio.h>
#include <stdlib.h>
int partition(int *, int, int);
int main() {
int a, i, n;
int *A;
scanf("%d", &n);
A = (int *)malloc(sizeof(int) * n + 1);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
a = partition(&A[0], 0, n - 1);
for (i = 0; i < n - 1; i++) {
if (a == i)
print... | #include <stdio.h>
#include <stdlib.h>
int partition(int *, int, int);
int main() {
int a, i, n;
int *A;
scanf("%d", &n);
A = (int *)malloc(sizeof(int) * n + 1);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
a = partition(&A[0], 0, n - 1);
for (i = 0; i < n - 1; i++) {
if (a == i)
print... | [["+", 0, 7, 8, 9, 0, 57, 75, 76, 0, 95]] | 0 | 289 | 1 |
#include <stdio.h>
#include <stdlib.h>
int partititon(int[], int, int);
int main() {
int i, j;
int *A;
int b;
int p, r;
int n;
scanf("%d", &n);
A = malloc(sizeof(int) * n + 1);
for (i = 0; i < n; i++) {
scanf("%d", &A[i + 1]);
}
p = 1;
r = n;
b = partition(A, p, r);
for (i = 0; i < n;... | #include <stdio.h>
#include <stdlib.h>
int partititon(int[], int, int);
int main() {
int i, j;
int *A;
int b;
int p, r;
int n;
scanf("%d", &n);
A = malloc(sizeof(int) * n + 1);
for (i = 0; i < n; i++) {
scanf("%d", &A[i + 1]);
}
p = 1;
r = n;
b = partition(A, p, r);
for (i = 0; i < n;... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 7, 8, 9, 0, 57, 15, 23, 0, 24], ["+", 15, 23, 0, 16, 31, 23, 0, 16, 17, 72], ["+", 15, 23, 0, 16, 31, 23, 0, 16, 12, 13], ["+", 0, 57, 15, 23, 0, 16, 31, 23, 0, 25]] | 0 | 325 | 6 |
#include <stdio.h>
#define I 100000
int partition(int, int);
int n, A[I];
int main() {
int k, q, i;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
q = partition(0, n - 1);
for (k = 0; k < q; k++) {
printf("%d ", A[k]);
}
printf("[%d]", A[q]);
for (k = q + 1; k < n - 1; k++... | #include <stdio.h>
#define I 100000
int partition(int, int);
int n, A[I];
int main() {
int k, q, i;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
q = partition(0, n - 1);
for (k = 0; k < q; k++) {
printf("%d ", A[k]);
}
printf("[%d] ", A[q]);
for (k = q + 1; k < n - 1; k+... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 297 | 2 |
#include <stdio.h>
#define MAX 10000
void swap(int *, int *);
void Partirion(int, int, int *);
int n, test;
void Printf(int i, int *A) {
int j;
for (j = 0; j < n; j++) {
if (j != 0)
printf(" ");
if (j == i)
printf("[%d]", A[j]);
else
printf("%d", A[j]);
}
printf("\n");
}
void ... | #include <stdio.h>
#define MAX 100000
void swap(int *, int *);
void Partirion(int, int, int *);
int n, test;
void Printf(int i, int *A) {
int j;
for (j = 0; j < n; j++) {
if (j != 0)
printf(" ");
if (j == i)
printf("[%d]", A[j]);
else
printf("%d", A[j]);
}
printf("\n");
}
void... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 19]] | 0 | 299 | 4 |
#include <stdio.h>
int main() {
int cnt = 0, n, i, q, A[100000], j;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
q = A[n - 1];
for (i = 0; i < n; i++) {
if (A[i] <= A[q]) {
j = A[i];
A[i] = A[cnt];
A[cnt] = j;
cnt++;
}
}
for (i = 0; i < n; i++) {
if ... | #include <stdio.h>
int main() {
int cnt = 0, n, i, q, A[100000], j;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
q = A[n - 1];
for (i = 0; i < n; i++) {
if (A[i] <= q) {
j = A[i];
A[i] = A[cnt];
A[cnt] = j;
cnt++;
}
}
for (i = 0; i < n; i++) {
if (cn... | [["-", 0, 57, 15, 23, 0, 16, 12, 69, 28, 22], ["-", 0, 57, 15, 23, 0, 16, 12, 69, 0, 70], ["-", 0, 57, 15, 23, 0, 16, 12, 69, 0, 73]] | 0 | 201 | 3 |
#include <stdio.h>
#include <stdlib.h>
int partition(int *, int, int);
void swap(int *, int, int);
void printArray(int *, int, int);
int main(void) {
int i; // counter
int n; // length of array
int par; // partition number
int *arr;
scanf("%d", &n);
arr = (int *)malloc(sizeof(int) * n);
for (i = 0; i ... | #include <stdio.h>
#include <stdlib.h>
int partition(int *, int, int);
void swap(int *, int, int);
void printArray(int *, int, int);
int main(void) {
int i; // counter
int n; // length of array
int par; // partition number
int *arr;
scanf("%d", &n);
arr = (int *)malloc(sizeof(int) * n);
for (i = 0; i ... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 19]] | 0 | 356 | 2 |
#include <stdio.h>
#define N 1000000
int A[N];
int main() {
int i, n, p = 0, a, b;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
a = A[n - 1];
b = partition(A, p, n - 1);
for (i = 0; i < n; i++) {
if (i == n - 1) {
printf("%d\n", A[i]);
} else if (A[i] == a) {
... | #include <stdio.h>
#define N 1000000
int A[N];
int main() {
int i, n, p = 0, a, b;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
a = A[n - 1];
b = partition(A, p, n - 1);
for (i = 0; i < n; i++) {
if (i == n - 1) {
printf("%d\n", A[i]);
} else if (i == b) {
pr... | [["-", 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], ["-", 75, 76, 0, 57, 15, 23, 0, 16, 12, 22], ["+", 75, 76, 0, 57, 15, 23, 0, 16, 12, 22]] | 0 | 293 | 5 |
#include <stdio.h>
#define max 100000
int partition(int A[], int p, int r) {
int x, i, j, m;
x = A[r];
i = p - 1;
for (j = p; j < r; j++) {
if (A[j] <= x) {
i++;
m = A[i];
A[i] = A[j];
A[j] = m;
}
}
m = A[i + 1];
A[i + 1] = A[r];
A[r] = m;
return i + 1;
}
int main()... | #include <stdio.h>
#define max 100000
int partition(int A[], int p, int r) {
int x, i, j, m;
x = A[r];
i = p - 1;
for (j = p; j < r; j++) {
if (A[j] <= x) {
i++;
m = A[i];
A[i] = A[j];
A[j] = m;
}
}
m = A[i + 1];
A[i + 1] = A[r];
A[r] = m;
return i + 1;
}
int main()... | [["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 0 | 271 | 2 |
#include <stdio.h>
int Partition(int, int);
int n, A[100000], i;
int main(void) {
int element;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
element = Partition(0, n - 1);
for (i = 0; i < n; i++) {
if (i != element)
printf("%d", A[i]);
else
printf("[%d]", A[i]);
if (... | #include <stdio.h>
int Partition(int, int);
int n, A[100000], i;
int main(void) {
int element;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
element = Partition(0, n - 1);
for (i = 0; i < n; i++) {
if (i != element)
printf("%d", A[i]);
else
printf("[%d]", A[i]);
if (... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 19]] | 0 | 247 | 2 |
#include <stdio.h>
#define N 100000
int partition(int A[], int p, int r) {
int x, i, j, ch1, ch2;
x = A[r];
i = p - 1;
for (j = p; j < r; j++) {
if (A[j] <= x) {
i = i + 1;
ch1 = A[i];
A[i] = A[j];
A[j] = ch1;
}
}
ch2 = A[i + 1];
A[i + 1] = A[r];
A[r] = ch2;
return i +... | #include <stdio.h>
#define N 100000
int partition(int A[], int p, int r) {
int x, i, j, ch1, ch2;
x = A[r];
i = p - 1;
for (j = p; j < r; j++) {
if (A[j] <= x) {
i = i + 1;
ch1 = A[i];
A[i] = A[j];
A[j] = ch1;
}
}
ch2 = A[i + 1];
A[i + 1] = A[r];
A[r] = ch2;
return i +... | [["-", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 79], ["+", 0, 57, 15, 23, 0, 16, 12, 16, 31, 22], ["+", 0, 57, 15, 23, 0, 16, 12, 16, 17, 33], ["+", 0, 57, 15, 23, 0, 16, 12, 16, 12, 13]] | 0 | 287 | 6 |
#include <stdio.h>
int main() {
int n, A[100000], i, j, pivot, small, big, swap;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
i = -1;
for (j = 0; j < n; j++) {
if (A[j] <= A[n - 1]) {
i++;
swap = A[j];
A[j] = A[i];
A[i] = swap;
}
}
swap = A[i + 1];
... | #include <stdio.h>
int main() {
int n, A[100000], i, j, pivot, small, big, swap;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
i = -1;
for (j = 0; j < n - 1; j++) {
if (A[j] <= A[n - 1]) {
i++;
swap = A[j];
A[j] = A[i];
A[i] = swap;
}
}
swap = A[i + 1]... | [["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 17, 72], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 12, 13]] | 0 | 236 | 4 |
#include <stdio.h>
#define MAX 100000
int A[MAX];
int partition(int p, int r) {
int max = A[r];
int i = p - 1;
int j, tmp;
for (j = p; j < r; j++) {
if (A[j] <= max) {
i++;
tmp = A[i];
A[i] = A[j];
A[j] = tmp;
}
}
tmp = A[i + 1];
A[i + 1] = A[r];
A[r] = tmp;
retu... | #include <stdio.h>
#define MAX 100000
int A[MAX];
int partition(int p, int r) {
int max = A[r];
int i = p - 1;
int j, k, tmp;
for (j = p; j < r; j++) {
if (A[j] <= max) {
i++;
tmp = A[i];
A[i] = A[j];
A[j] = tmp;
}
}
tmp = A[i + 1];
A[i + 1] = A[r];
A[r] = tmp;
... | [["+", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["-", 0, 11, 12, 2, 3, 4, 0, 69, 28, 22], ["-", 0, 11, 12, 2, 3, 4, 0, 69, 0, 70], ["-", 0, 11, 12, 2, 3, 4, 0, 69, 0, 73]] | 0 | 268 | 5 |
#include <stdio.h>
int Partition(int *A, int p, int r);
main() {
int n, i, p, A[100000];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
p = Partition(A, 0, n - 1);
for (i = 0; i < n; i++) {
if (p == i)
printf("[%d]", A[i]);
else
printf("%d", A[i]);
if (i !=... | #include <stdio.h>
int Partition(int *A, int p, int r);
main() {
int n, i, p, A[100000];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
p = Partition(A, 0, n - 1);
for (i = 0; i < n; i++) {
if (p == i)
printf("[%d]", A[i]);
else
printf("%d", A[i]);
if (i !=... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 0 | 281 | 2 |
#include <stdio.h>
#define N 100001
int A[N];
int Partition(int A[], int p, int r) {
int x, i, j, temp;
x = A[r];
i = p - 1;
for (j = p; j < r; j++) {
if (A[j] <= x) {
i++;
temp = A[i];
A[i] = A[j];
A[j] = temp;
}
}
temp = A[i + 1];
A[i + 1] = A[r];
A[r] = temp;
retur... | #include <stdio.h>
#define N 100001
int A[N];
int Partition(int A[], int p, int r) {
int x, i, j, temp;
x = A[r];
i = p - 1;
for (j = p; j < r; j++) {
if (A[j] <= x) {
i++;
temp = A[i];
A[i] = A[j];
A[j] = temp;
}
}
temp = A[i + 1];
A[i + 1] = A[r];
A[r] = temp;
retur... | [["-", 0, 11, 12, 2, 3, 4, 0, 69, 28, 22], ["-", 0, 11, 12, 2, 3, 4, 0, 69, 0, 70], ["-", 0, 11, 12, 2, 3, 4, 0, 69, 0, 73]] | 0 | 271 | 3 |
#include <stdio.h>
#define N 100000
int A[N], n;
int Partition(int *A, int p, int r) {
int x, i, j, exc;
x = A[r];
i = p - 1;
for (j = 1; j < r; j++) {
if (A[j] <= x) {
i = i + 1;
exc = A[i];
A[i] = A[j];
A[j] = exc;
}
}
exc = A[i + 1];
A[i + 1] = A[r];
A[r] = exc;
re... | #include <stdio.h>
#define N 100000
int A[N], n;
int Partition(int *A, int p, int r) {
int x, i, j, exc;
x = A[r];
i = p - 1;
for (j = 0; j < r; j++) {
if (A[j] <= x) {
i = i + 1;
exc = A[i];
A[i] = A[j];
A[j] = exc;
}
}
exc = A[i + 1];
A[i + 1] = A[r];
A[r] = exc;
re... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13]] | 0 | 282 | 2 |
#include <stdio.h>
#define N 100001
int Partition(int, int);
int A[N], n;
int main(void) {
int i, k;
scanf("%d", &n);
for (i = 1; i <= n; i++)
scanf("%d", &A[i]);
k = Partition(i, n);
for (i = 1; i <= n; i++) {
if (k == i) {
printf("[%d] ", A[i]);
continue;
}
printf("%d", A[i])... | #include <stdio.h>
#define N 100001
int Partition(int, int);
int A[N], n;
int main(void) {
int i, k;
scanf("%d", &n);
for (i = 1; i <= n; i++)
scanf("%d", &A[i]);
i = 1;
k = Partition(i, n);
for (i = 1; i <= n; i++) {
if (k == i) {
printf("[%d] ", A[i]);
continue;
}
printf("%... | [["+", 0, 14, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 0 | 269 | 4 |
#include <stdio.h>
#define N 100000
int patition(int[], int, int);
int A[N];
int main() {
int i, p = 0, q = 0, r;
scanf("%d", &r);
for (i = 0; i < r; i++) {
scanf("%d", &A[i]);
}
q = partition(A, p, r);
return 0;
}
int partition(int A[], int p, int r) {
int i, j, x = 0, s = 0;
x = A[r - 1]... | #include <stdio.h>
#define N 100000
int patition(int[], int, int);
int A[N];
int main() {
int i, p = 0, q = 0, r;
scanf("%d", &r);
for (i = 0; i < r; i++) {
scanf("%d", &A[i]);
}
q = partition(A, p, r);
return 0;
}
int partition(int A[], int p, int r) {
int i, j, x = 0, s = 0;
x = A[r - 1]... | [["-", 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], ["-", 0, 57, 15, 23, 0, 16, 12, 69, 28, 22], ["-", 0, 57, 15, 23, 0, 16, 12, 69, 0, 70], ["-", 0, 57, 15, 23, 0, 16, 12, 69, 0, 73]] | 0 | 319 | 6 |
#include <stdio.h>
#define N 100000
int A[N];
int Partition(int p, int r) {
int x, change;
int i, j;
x = A[r];
i = p - 1;
for (j = p; j < r; j++) {
if (A[j] <= x) {
j++;
change = A[i];
A[i] = A[j];
A[j] = change;
}
}
change = A[i + 1];
A[i + 1] = A[r];
A[r] = change;... | #include <stdio.h>
#define N 100000
int A[N];
int Partition(int p, int r) {
int x, change;
int i, j;
x = A[r];
i = p - 1;
for (j = p; j < r; j++) {
if (A[j] <= x) {
i++;
change = A[i];
A[i] = A[j];
A[j] = change;
}
}
change = A[i + 1];
A[i + 1] = A[r];
A[r] = change;... | [["-", 0, 57, 64, 9, 0, 1, 0, 27, 28, 22], ["+", 0, 57, 64, 9, 0, 1, 0, 27, 28, 22]] | 0 | 267 | 2 |
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
int partition(vector<int> &vec, int left, int right);
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
int pivot = partition(a, 0, n - 1);
cout << a[0];
for (int i = 1; i < n; ++i... | #include <iostream>
#include <utility>
#include <vector>
using namespace std;
int partition(vector<int> &vec, int left, int right);
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
int pivot = partition(a, 0, n - 1);
cout << a[0];
for (int i = 1; i < n; ++i... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19]] | 1 | 245 | 2 |
#include <iostream>
using namespace std;
int partition(int A[], int n, int p, int r) {
int i = p;
int x = A[r];
for (int j = p; j < r; j++) {
if (A[j] <= x) {
int t = A[j];
A[j] = A[i];
A[i] = t;
++i;
}
}
A[r] = A[i + 1];
A[i] = x;
return i;
}
int main() {
int n;
cin... | #include <iostream>
using namespace std;
int partition(int A[], int n, int p, int r) {
int i = p;
int x = A[r];
for (int j = p; j < r; j++) {
if (A[j] <= x) {
int t = A[j];
A[j] = A[i];
A[i] = t;
++i;
}
}
A[r] = A[i];
A[i] = x;
return i;
}
int main() {
int n;
cin >> ... | [["-", 0, 11, 12, 69, 341, 342, 0, 16, 17, 72], ["-", 0, 11, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 241 | 2 |
#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
//#include "libs.h"
#include <random>
#include <unordered_map>
#include <unordered_set>
//#include <opencv2/core.hpp>
//#include <opencv2/highgui.hpp>
//#include <opencv2/imgproc.hpp>
using namespace std;
//呪文
#define DUMPOUT cerr
#define dump(...) ... | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
//#include "libs.h"
#include <random>
#include <unordered_map>
#include <unordered_set>
//#include <opencv2/core.hpp>
//#include <opencv2/highgui.hpp>
//#include <opencv2/imgproc.hpp>
using namespace std;
//呪文
#define DUMPOUT cerr
#define dump(...) ... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19]] | 1 | 1,512 | 2 |
#include <algorithm>
#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++;
swap(A[i], A[j]);
}
}
swap(A[i + 1], A[r]);
return i + 1;
}
int main() {
int n, A[500000];
cin >... | #include <algorithm>
#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; j++) {
if (A[j] <= x) {
i++;
swap(A[i], A[j]);
}
}
swap(A[i + 1], A[r]);
return i + 1;
}
int main() {
int n, A[500000];
cin >> n;... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 227 | 2 |
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <string>
#include <typeinfo>
#define MAX 100000
using namespace std;
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[... | #include <cstdlib>
#include <cstring>
#include <iostream>
#include <string>
#include <typeinfo>
#define MAX 100000
using namespace std;
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];
... | [["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 251 | 2 |
#include <iostream>
using namespace std;
#define len 100001
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() {
int n, A[len];
cin >> n;
f... | #include <iostream>
using namespace std;
#define len 100001
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() {
int n, A[len];
cin >> n;
f... | [["-", 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 | 228 | 6 |
#include <stdio.h>
#include <stdlib.h>
class Array {
protected:
int *array, length;
public:
Array() : array(nullptr), length(0) {}
void Setlength() { scanf("%d", &length); }
void SetArray() {
array = (int *)malloc((length + 1) * sizeof(int));
for (int i = 1; i <= length; ++i)
scanf("%d", &arra... | #include <stdio.h>
#include <stdlib.h>
class Array {
protected:
int *array, length;
public:
Array() : array(nullptr), length(0) {}
void Setlength() { scanf("%d", &length); }
void SetArray() {
array = (int *)malloc((length + 1) * sizeof(int));
for (int i = 1; i <= length; ++i)
scanf("%d", &arra... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22]] | 1 | 412 | 2 |
#include <iostream>
using namespace std;
const int SIZE = 100000;
int Partition(int *A, int p, int r) {
int x = A[r - 1];
int i = p;
for (int j = p; j < r - 1; j++) {
if (A[j] <= x) {
int tmp = A[j];
A[j] = A[i];
A[i] = tmp;
i++;
}
}
int tmp = A[i];
A[i] = A[r - 1];
A[r ... | #include <iostream>
using namespace std;
const int SIZE = 100000;
int Partition(int *A, int p, int r) {
int x = A[r - 1];
int i = p;
for (int j = p; j < r - 1; j++) {
if (A[j] <= x) {
int tmp = A[j];
A[j] = A[i];
A[i] = tmp;
i++;
}
}
int tmp = A[i];
A[i] = A[r - 1];
A[r ... | [["+", 0, 14, 8, 9, 0, 1, 0, 27, 28, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 27, 17, 29], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 270 | 17 |
#include <iostream>
using namespace std;
#define N 100000
#define SWP(T, X, Y) \
{ \
T _; \
_ = (X); ... | #include <iostream>
using namespace std;
#define N 100000
#define SWP(T, X, Y) \
{ \
T _; \
_ = (X); ... | [["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46]] | 1 | 245 | 2 |
#include <iostream>
using namespace std;
#define MAX 100000
int partition(int A[], int p, int r) {
int x = A[r];
int i = p - 1;
int tmp;
for (int j = p; j < r - 1; 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... | #include <iostream>
using namespace std;
#define MAX 100000
int partition(int A[], int p, int r) {
int x = A[r];
int i = p - 1;
int tmp;
for (int j = p; 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] = ... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 253 | 2 |
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <queue>
#include <stack>
#include <string>
#include <vector>
//#include<cmath>
using namespace std;
typedef long long llong;
const int MAX = 100010;
int A[MAX];
int main(void) {
int n, x, k;
c... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <queue>
#include <stack>
#include <string>
#include <vector>
//#include<cmath>
using namespace std;
typedef long long llong;
const int MAX = 100010;
int A[MAX];
int main(void) {
int n, x, k;
c... | [["-", 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 | 203 | 5 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ctype.h>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ctype.h>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#includ... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19]] | 1 | 299 | 2 |
#include <iostream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#define N_MAX 100000
using namespace std;
//常に心してかかれ
//簡単なことを簡単にできるように練習する
//びっくりするくらいつまらないことで詰まってることも多い
int n;
int partition(int A[], int p, int r) { // rは配列の最後を指す添え字
int x = A[r];
int i = p;
int tmp;
for (int j = p; j < r; j++) {
... | #include <iostream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#define N_MAX 100000
using namespace std;
//常に心してかかれ
//簡単なことを簡単にできるように練習する
//びっくりするくらいつまらないことで詰まってることも多い
int n;
int partition(int A[], int p, int r) { // rは配列の最後を指す添え字
int x = A[r];
int i = p;
int tmp;
for (int j = p; j < r; j++) {
... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 324 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, a[100000];
cin >> n;
int i;
for (i = 0; i < n; i++) {
cin >> a[i];
}
int r = a[i - 1]; //???????°????
int j = -1, k = -1;
for (int l = 0; l < i; l++) {
if (a[l] < r) {
swap(a[j + 1], a[l]);
j++;
... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, a[100000];
cin >> n;
int i;
for (i = 0; i < n; i++) {
cin >> a[i];
}
int r = a[i - 1]; //???????°????
int j = -1, k = -1;
for (int l = 0; l < i - 1; l++) {
if (a[l] <= r) {
swap(a[j + 1], a[l]);
j+... | [["+", 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 | 213 | 4 |
#include <iostream>
using namespace std;
int n;
int A[100000];
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> A[i];
int x = A[n - 1];
int j = A[0] < x ? 1 : 0;
for (int i = 1; i < n - 1; i++) {
if (A[i] < x) {
int aj = A[j];
A[j] = A[i];
A[i] = aj;
j++;
}
}
A... | #include <iostream>
using namespace std;
int n;
int A[100000];
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> A[i];
int x = A[n - 1];
int j = A[0] < x ? 1 : 0;
for (int i = 1; i < n - 1; i++) {
if (A[i] <= x) {
int aj = A[j];
A[j] = A[i];
A[i] = aj;
j++;
}
}
... | [["-", 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>
using namespace std;
int x[1000000], n;
int func(int t, int r) {
int p, a, b, j;
p = x[r];
j = t - 1;
for (int i = t; i < r; i++) {
if (x[i] <= p) {
j = j + 1;
a = x[i];
b = x[j];
x[i] = b;
x[j] = a;
}
a = x[j + 1];
b = x[r];
x[j + 1] = b;
... | #include <iostream>
using namespace std;
int x[1000000], n;
int func(int t, int r) {
int p, a, b, j;
p = x[r];
j = t - 1;
for (int i = t; i < r; i++) {
if (x[i] <= p) {
j = j + 1;
a = x[i];
b = x[j];
x[i] = b;
x[j] = a;
}
}
a = x[j + 1];
b = x[r];
x[j + 1] = b;
... | [["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 7, 8, 9, 0, 57, 15, 339, 51, 22], ["+", 0, 7, 8, 9, 0, 57, 15, 339, 51, 22]] | 1 | 262 | 4 |
#include <algorithm>
#include <iostream>
using namespace std;
int n, a[111111];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
int x = a[n - 1], z = -1;
for (int i = 0; i < n; i++) {
if (a[i] <= x) {
swap(a[++z], a[i]);
}
}
swap(a[++z], a[n - 1]);
for (int ... | #include <algorithm>
#include <iostream>
using namespace std;
int n, a[111111];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
int x = a[n - 1], z = -1;
for (int i = 0; i < n - 1; i++) {
if (a[i] <= x) {
swap(a[++z], a[i]);
}
}
swap(a[++z], a[n - 1]);
for (... | [["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 183 | 2 |
#include <cstdio>
#include <iostream>
using namespace std;
int Partition(int elem[], int start, int end) {
int i;
int mid;
int target;
target = elem[end];
mid = start - 1;
for (i = start; i < end - 1; i++) {
if (elem[i] <= target) {
++mid;
swap(elem[mid], elem[target]);
}
}
++mid... | #include <cstdio>
#include <iostream>
using namespace std;
int Partition(int elem[], int start, int end) {
int i;
int mid;
int target;
target = elem[end - 1];
mid = start - 1;
for (i = start; i < end - 1; i++) {
if (elem[i] <= target) {
++mid;
swap(elem[mid], elem[i]);
}
}
++mid;... | [["+", 0, 11, 12, 69, 341, 342, 0, 16, 17, 33], ["+", 0, 11, 12, 69, 341, 342, 0, 16, 12, 13], ["-", 0, 2, 3, 4, 0, 69, 341, 342, 0, 22], ["+", 0, 2, 3, 4, 0, 69, 341, 342, 0, 22], ["+", 3, 4, 0, 69, 341, 342, 0, 16, 17, 33], ["+", 3, 4, 0, 69, 341, 342, 0, 16, 12, 13]] | 1 | 257 | 6 |
#include <iostream>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
using namespace std;
int partition(int a[], int s, int g) {
int x = a[g];
int gto = s - 1;
for (int j = s; j <= g; j++) {
if (a[j] < x) {
gto++;
int alt = a[j];
a[j] = a[gto];
a[gto] ... | #include <iostream>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
using namespace std;
int partition(int a[], int s, int g) {
int x = a[g];
int gto = s - 1;
for (int j = s; j < g; j++) {
if (a[j] <= x) {
gto++;
int alt = a[j];
a[j] = a[gto];
a[gto] ... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19]] | 1 | 246 | 4 |
// config = { input: 'tmp', newline: '\r\n' }; // win
config = {
input : '/dev/stdin',
newline : '\n'
}; // linux
line =
require('fs').readFileSync(config.input, 'ascii').split(config.newline, 2);
A = line[1].split(' ').map(Number);
q = partition(A, 0, A.length);
A[q] = '[' + A[q] + ']';
console.log(A.join('... | // config = { input: 'tmp', newline: '\r\n' }; // win
config = {
input : '/dev/stdin',
newline : '\n'
}; // linux
line =
require('fs').readFileSync(config.input, 'ascii').split(config.newline, 2);
A = line[1].split(' ').map(Number);
q = partition(A, 0, A.length);
A[q] = '[' + A[q] + ']';
console.log(A.join('... | [["-", 0, 7, 10, 1, 0, 11, 12, 16, 17, 72], ["-", 0, 7, 10, 1, 0, 11, 12, 16, 12, 555]] | 2 | 232 | 2 |
(function main() {
const lines =
require('fs').readFileSync('/dev/stdin', 'utf8').trim().split('\n');
const n = Number(lines.shift());
const arr = lines.shift().split(' ').map(Number);
let base_idx = partition(arr, 0, n - 1);
arr[base_idx] = `[${arr[base_idx]}]`;
console.log(arr.join(` `));
})();
fun... | (function main() {
const lines =
require('fs').readFileSync('/dev/stdin', 'utf8').trim().split('\n');
const n = Number(lines.shift());
const arr = lines.shift().split(' ').map(Number);
let base_idx = partition(arr, 0, n - 1);
arr[base_idx] = `[${arr[base_idx]}]`;
console.log(arr.join(` `));
})();
fun... | [["-", 8, 556, 0, 57, 15, 23, 0, 16, 17, 18], ["+", 8, 556, 0, 57, 15, 23, 0, 16, 17, 19]] | 2 | 232 | 2 |
import java.util.Scanner;
public class Main {
private static Scanner s = new Scanner(System.in);
static int[] a = new int[100001];
public static void main(String[] args) {
int n = s.nextInt();
StringBuilder sb = new StringBuilder();
for (int i = 0; i < n; i++) {
a[i] = s.nextInt();
}
i... | import java.util.Scanner;
public class Main {
private static Scanner s = new Scanner(System.in);
static int[] a = new int[100001];
public static void main(String[] args) {
int n = s.nextInt();
StringBuilder sb = new StringBuilder();
for (int i = 0; i < n; i++) {
a[i] = s.nextInt();
}
i... | [["-", 8, 196, 0, 7, 8, 196, 0, 57, 0, 95], ["-", 0, 7, 8, 196, 0, 57, 75, 196, 0, 45], ["+", 0, 195, 8, 196, 0, 7, 8, 196, 0, 46], ["-", 0, 7, 8, 196, 0, 57, 75, 196, 0, 46], ["-", 0, 195, 8, 196, 0, 7, 8, 196, 0, 46]] | 3 | 317 | 5 |
import java.util.ArrayList;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
int total;
Scanner inp = new Scanner(System.in);
total = inp.nextInt();
int a[] = new int[total];
for (int k = 0; k < total; k++) {
a[k] = inp.nextInt();
}
int part... | import java.util.ArrayList;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
int total;
Scanner inp = new Scanner(System.in);
total = inp.nextInt();
int a[] = new int[total];
for (int k = 0; k < total; k++) {
a[k] = inp.nextInt();
}
int part... | [["-", 8, 196, 0, 57, 15, 15, 0, 16, 17, 18], ["+", 8, 196, 0, 57, 15, 15, 0, 16, 17, 19]] | 3 | 325 | 2 |
import java.util.NoSuchElementException;
import java.util.Scanner;
import java.util.StringJoiner;
import java.util.stream.Stream;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
try {
int n = Integer.parseInt(sc.nextLine());
int[] a = Stream.of(sc... | import java.util.NoSuchElementException;
import java.util.Scanner;
import java.util.StringJoiner;
import java.util.stream.Stream;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
try {
int n = Integer.parseInt(sc.nextLine());
int[] a = Stream.of(sc... | [["+", 8, 196, 0, 57, 64, 196, 0, 116, 0, 117], ["+", 8, 196, 0, 57, 64, 196, 0, 116, 0, 35]] | 3 | 322 | 2 |
import java.util.Scanner;
public class Main {
long count = 0;
public static void main(String[] args) { new Main().run(); }
private void run() {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
int[] A = new int[n];
for (int i = 0; i < n; i++) {
A[i] = scanner.nextInt(... |
import java.util.Scanner;
public class Main {
long count = 0;
public static void main(String[] args) { new Main().run(); }
private void run() {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
int[] A = new int[n];
for (int i = 0; i < n; i++) {
A[i] = scanner.nextInt(... | [["-", 8, 196, 0, 57, 15, 15, 0, 16, 17, 18], ["+", 8, 196, 0, 57, 15, 15, 0, 16, 17, 19]] | 3 | 314 | 2 |
import java.util.Scanner;
public class Main {
private static int partition(int[] array, int p, int r) {
int pivot = array[r];
int i = p - 1;
int j = p;
while (j < r) {
if (array[j] < pivot) {
i++;
swap(array, i, j);
}
j++;
}
swap(array, i + 1, r);
retu... | import java.util.Scanner;
public class Main {
private static int partition(int[] array, int p, int r) {
int pivot = array[r];
int i = p - 1;
int j = p;
while (j < r) {
if (array[j] <= pivot) {
i++;
swap(array, i, j);
}
j++;
}
swap(array, i + 1, r);
ret... | [["-", 8, 196, 0, 57, 15, 15, 0, 16, 17, 18], ["+", 8, 196, 0, 57, 15, 15, 0, 16, 17, 19]] | 3 | 332 | 2 |
import java.util.*;
public class Main {
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] nums = new int[n];
for (int i = 0; i < n; i++) {
nums[i] = sc.nextInt();
}
int index = partition(nums, 0, nums.length - 1);
for (int i = ... | import java.util.*;
public class Main {
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] nums = new int[n];
for (int i = 0; i < n; i++) {
nums[i] = sc.nextInt();
}
int index = partition(nums, 0, nums.length - 1);
for (int i = ... | [["-", 8, 196, 0, 57, 15, 15, 0, 16, 17, 18], ["+", 8, 196, 0, 57, 15, 15, 0, 16, 17, 19]] | 3 | 308 | 2 |
import java.io.InputStreamReader;
import java.util.Scanner;
public class Main {
public static int partition(int[] a, int p, int r) {
int tmp = 0;
int x = a[r];
int i = p - 1;
for (int j = 0; j < r; j++) {
if (a[j] <= x) {
i = i + 1;
tmp = a[i];
a[i] = a[j];
a[... | import java.io.InputStreamReader;
import java.util.Scanner;
public class Main {
public static int partition(int[] a, int p, int r) {
int tmp = 0;
int x = a[r];
int i = p - 1;
for (int j = 0; j < r; j++) {
if (a[j] <= x) {
i = i + 1;
tmp = a[i];
a[i] = a[j];
a[... | [["-", 49, 200, 51, 492, 3, 4, 0, 504, 516, 22], ["-", 49, 200, 51, 492, 3, 4, 0, 504, 0, 70], ["-", 49, 200, 51, 492, 3, 4, 0, 504, 0, 73]] | 3 | 355 | 3 |
import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = sc.nextInt();
}
int p = partition(a, 0, a.length - 1);
printArray(a, p);
}
priv... | import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = sc.nextInt();
}
int p = partition(a, 0, a.length - 1);
printArray(a, p);
}
priv... | [["-", 8, 498, 0, 195, 8, 196, 0, 37, 0, 22], ["+", 8, 498, 0, 195, 8, 196, 0, 37, 0, 22], ["-", 0, 57, 15, 15, 0, 16, 31, 504, 516, 22], ["-", 0, 57, 15, 15, 0, 16, 31, 504, 0, 70], ["-", 0, 57, 15, 15, 0, 16, 31, 504, 0, 73]] | 3 | 350 | 5 |
import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
final int n = scan.nextInt();
int[] sequence = new int[n];
for (int i = 0; i < n; i++) {
sequence[i] = scan.nextInt();
}
scan.close();
Partition(sequence, 0, n - ... | import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
final int n = scan.nextInt();
int[] sequence = new int[n];
for (int i = 0; i < n; i++) {
sequence[i] = scan.nextInt();
}
scan.close();
Partition(sequence, 0, n - ... | [["-", 8, 196, 0, 1, 0, 492, 3, 4, 0, 22], ["+", 0, 1, 0, 492, 3, 4, 0, 16, 31, 22], ["+", 0, 1, 0, 492, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 492, 3, 4, 0, 16, 12, 499], ["-", 0, 57, 15, 15, 0, 16, 31, 504, 516, 22], ["-", 0, 57, 15, 15, 0, 16, 31, 504, 0, 70], ["-", 0, 57, 15, 15, 0, 16, 31, 504, 0, 73]] | 3 | 322 | 7 |
import java.io.IOException;
import java.io.InputStream;
import java.util.NoSuchElementException;
public class Main {
public static void main(String[] args) {
FS fs = new FS();
int n = fs.nextInt();
int a[] = new int[n];
for (int i = 0; i < n; i++) {
a[i] = fs.nextInt();
}
int p = partit... | import java.io.IOException;
import java.io.InputStream;
import java.util.NoSuchElementException;
public class Main {
public static void main(String[] args) {
FS fs = new FS();
int n = fs.nextInt();
int a[] = new int[n];
for (int i = 0; i < n; i++) {
a[i] = fs.nextInt();
}
int p = partit... | [["-", 8, 196, 0, 57, 15, 15, 0, 16, 17, 18], ["+", 8, 196, 0, 57, 15, 15, 0, 16, 17, 19]] | 3 | 730 | 2 |
#include <stdio.h>
#define MAX 100000
int main() {
int n, i, z, A[MAX];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
z = partition(A, n, 0, n - 1);
for (i = 0; i < n; i++) {
if (i)
printf(" ");
if (i == z)
printf("[");
printf("%d ", A[i]);
if (i == z)... | #include <stdio.h>
#define MAX 100000
int main() {
int n, i, z, A[MAX];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
z = partition(A, n, 0, n - 1);
for (i = 0; i < n; i++) {
if (i)
printf(" ");
if (i == z)
printf("[");
printf("%d", A[i]);
if (i == z)
... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 279 | 2 |
#include <stdio.h>
int main() {
int number;
int array[10000];
scanf("%d", &number);
int i;
for (i = 1; i <= number; i++) {
scanf("%d", &array[i]);
}
int kazu;
kazu = partition(array, 1, number);
for (i = 1; i <= number; i++) {
if (i == number) {
printf("%d\n", array[i]);
}
... | #include <stdio.h>
int main() {
int number;
int array[1000000];
scanf("%d", &number);
int i;
for (i = 1; i <= number; i++) {
scanf("%d", &array[i]);
}
int kazu;
kazu = partition(array, 1, number);
for (i = 1; i <= number; i++) {
if (i == number) {
printf("%d\n", array[i]);
}
... | [["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 0 | 281 | 4 |
#include <stdio.h>
int partition(int *A, int p, int r) {
int x, n;
int i, j;
x = A[r];
i = p - 1;
for (j = p; j < r; j++) {
if (A[j] <= x) {
i = i + 1;
n = A[i];
A[i] = A[j];
A[j] = n;
}
}
n = A[i + 1];
A[i + 1] = A[r];
A[r] = n;
return i + 1;
}
int main() {
int n, ... | #include <stdio.h>
int partition(int *A, int p, int r) {
int x, n;
int i, j;
x = A[r];
i = p - 1;
for (j = p; j < r; j++) {
if (A[j] <= x) {
i = i + 1;
n = A[i];
A[i] = A[j];
A[j] = n;
}
}
n = A[i + 1];
A[i + 1] = A[r];
A[r] = n;
return i + 1;
}
int main() {
int n, ... | [["+", 0, 14, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 17, 32], ["-", 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], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 12, 22]] | 0 | 279 | 7 |
#include <stdio.h>
#define MAX 100000
int A[MAX], n;
int partition(int p, int r) {
int i, j, s, t;
s = A[r];
i = p - 1;
for (j = p; j < r; j++) {
if (A[j] <= s) {
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;
}
int... | #include <stdio.h>
#define MAX 100000
int A[MAX], n;
int partition(int p, int r) {
int i, j, s, t;
s = A[r];
i = p - 1;
for (j = p; j < r; j++) {
if (A[j] <= s) {
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;
}
int... | [["-", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 266 | 4 |
#include <stdio.h>
#include <stdlib.h>
int partition(int *, int, int);
int main() {
int *A;
int n, i, r;
// input
scanf("%d", &n);
A = malloc(sizeof(short) * n + 1);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
// main
r = partition(A, 0, n - 1);
// output
for (i = 0; i < n - 1; i++) {
... | #include <stdio.h>
#include <stdlib.h>
int partition(int *, int, int);
int main() {
int *A;
int n, i, r;
// input
scanf("%d", &n);
A = malloc(sizeof(int) * n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
// main
r = partition(A, 0, n - 1);
// output
for (i = 0; i < n - 1; i++) {
if... | [["-", 31, 16, 31, 105, 39, 77, 39, 86, 0, 133], ["+", 3, 4, 0, 16, 31, 105, 39, 77, 39, 40], ["-", 0, 11, 12, 2, 3, 4, 0, 16, 17, 72], ["-", 0, 11, 12, 2, 3, 4, 0, 16, 12, 13]] | 0 | 315 | 4 |
#include <stdio.h>
#define MAX 100000
int main() {
int n;
int A[MAX];
int i, j;
int point;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
point = partitionSort(A, 0, n);
for (i = 0; i < point; i++) {
printf("%d ", A[i]);
}
printf("[%d] ", A[i]);
for (i = point + 1; i ... | #include <stdio.h>
#define MAX 100000
int main() {
int n;
int A[MAX];
int i, j;
int point;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
point = partitionSort(A, 0, n);
for (i = 0; i < point; i++) {
printf("%d ", A[i]);
}
printf("[%d] ", A[i]);
for (i = point + 1; 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, 37, 0, 16, 17, 72], ["+", 0, 14, 8, 9, 0, 37, 0, 16, 12, 13]] | 0 | 292 | 4 |
#include <stdio.h>
#include <stdlib.h>
int partition(int *, int);
void swap(int, int, int *);
int main() {
int n, i, temp;
int *list;
scanf("%d", &n);
list = (int *)malloc(n * sizeof(int));
for (i = 0; i < n; i++)
scanf("%d", list + i);
temp = partition(list, n);
for (i = 0; i < n; i++) {
if (i ==... | #include <stdio.h>
#include <stdlib.h>
int partition(int *, int);
void swap(int, int, int *);
int main() {
int n, i, temp;
int *list;
scanf("%d", &n);
list = (int *)malloc(n * sizeof(int));
for (i = 0; i < n; i++)
scanf("%d", list + i);
temp = partition(list, n);
for (i = 0; i < n; i++) {
if (i ==... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 20]] | 0 | 323 | 2 |
#include <stdio.h>
#define VMAX 100000
int Partition(int[VMAX], int, int);
void Swap(int *, int *);
int main() {
int n;
int A[VMAX];
int i;
int q;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", A[i]);
}
q = Partition(A, 0, n - 1);
for (i = 0; i < n; i++) {
if (i) {
printf(" ");
... | #include <stdio.h>
#define VMAX 100000
int Partition(int[VMAX], int, int);
void Swap(int *, int *);
int main() {
int n;
int A[VMAX];
int i;
int q;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
q = Partition(A, 0, n - 1);
for (i = 0; i < n; i++) {
if (i) {
printf(" ");... | [["+", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67]] | 0 | 318 | 1 |
#include <stdio.h>
#include <stdlib.h>
int main() {
int A[100000];
int p = 0, r, x, i, j, n;
scanf("%d", &r);
for (i = 0; i < r - 1; i++) {
scanf("%d", &A[i]);
}
x = A[r - 1];
i = p - 1;
for (j = p; j < r - 2; j++) {
if (A[j] <= x) {
i++;
n = A[i];
A[i] = A[j];
A[j] = ... | #include <stdio.h>
#include <stdlib.h>
int main() {
int A[100000];
int p = 0, r, x, i, j, n;
scanf("%d", &r);
for (i = 0; i < r; i++) {
scanf("%d", &A[i]);
}
x = A[r - 1];
i = p - 1;
for (j = p; j < r - 1; j++) {
if (A[j] <= x) {
i++;
n = A[i];
A[i] = A[j];
A[j] = n;
... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 0 | 242 | 4 |
#include <stdio.h>
#define MAX 100000
int x, te, A[MAX];
int par(int A[], int p, int r) {
int i, j;
x = A[r];
i = p - 1;
for (j = p; j < r; j++) {
if (A[j] <= x) {
i = i + 1;
te = A[i];
A[i] = A[j];
A[j] = te;
}
}
te = A[i + 1];
A[i + 1] = A[r];
A[r] = te;
return i + ... | #include <stdio.h>
#define MAX 100000
int x, te, A[MAX];
int par(int A[], int p, int r) {
int i, j;
x = A[r];
i = p - 1;
for (j = p; j < r; j++) {
if (A[j] <= x) {
i = i + 1;
te = A[i];
A[i] = A[j];
A[j] = te;
}
}
te = A[i + 1];
A[i + 1] = A[r];
A[r] = te;
return i + ... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 0 | 289 | 3 |
#include <stdio.h>
#define MAX 100000
int partition(int X[], int n, int p, int r) {
int y, z;
int i, tmp;
y = X[r];
z = p - 1;
for (i = p; i < r; i++) {
if (X[z] <= y) {
z++;
tmp = X[z];
X[z] = X[i];
X[i] = tmp;
}
}
tmp = X[z + 1];
X[z + 1] = X[r];
X[r] = tmp;
retu... | #include <stdio.h>
#define MAX 100000
int partition(int X[], int n, int p, int r) {
int y, z;
int i, tmp;
y = X[r];
z = p - 1;
for (i = p; i < r; i++) {
if (X[i] <= y) {
z++;
tmp = X[z];
X[z] = X[i];
X[i] = tmp;
}
}
tmp = X[z + 1];
X[z + 1] = X[r];
X[r] = tmp;
retu... | [["-", 0, 57, 15, 23, 0, 16, 31, 69, 71, 22], ["+", 0, 57, 15, 23, 0, 16, 31, 69, 71, 22]] | 0 | 279 | 2 |
#include <stdio.h>
#define N 100001
int main() {
int x, n, A[N], i, j, y, z;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%d", &A[i]);
}
x = A[n];
i = 0;
for (j = 1; j <= n - 1; j++) {
if (A[j] <= x) {
i = i + 1;
y = A[j];
A[j] = A[i];
A[i] = y;
}
}
z =... | #include <stdio.h>
#define N 100001
int main() {
int x, n, A[N], i, j, y, z;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%d", &A[i]);
}
x = A[n];
i = 0;
for (j = 1; j <= n - 1; j++) {
if (A[j] <= x) {
i = i + 1;
y = A[j];
A[j] = A[i];
A[i] = y;
}
}
z =... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 72], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 0 | 241 | 2 |
#include <stdio.h>
int A[100001];
int partition(int p, int r) {
int x, i, j, tmp;
x = A[r];
i = p - 1;
for (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];
A[r] = tmp;
return i + 1;
}
int ... | #include <stdio.h>
int A[100001];
int partition(int p, int r) {
int x, i, j, tmp;
x = A[r];
i = p - 1;
for (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];
A[r] = tmp;
return i + 1;
}
int ... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["-", 0, 1, 0, 2, 3, 4, 0, 69, 71, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 69, 71, 22]] | 0 | 256 | 4 |
#include <stdio.h>
#include <stdlib.h>
int Partition(int *, int, int);
void Print(int *, int, int);
int main() {
int i, q, N;
int *A;
scanf("%d", &N);
A = (int *)malloc(N * sizeof(int));
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
q = Partition(A, 0, N);
Print(A, N, q);
return 0;
}
int Par... | #include <stdio.h>
#include <stdlib.h>
int Partition(int *, int, int);
void Print(int *, int, int);
int main() {
int i, q, N;
int *A;
scanf("%d", &N);
A = (int *)malloc(N * sizeof(int));
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
q = Partition(A, 0, N);
Print(A, N, q);
return 0;
}
int Par... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 343 | 2 |
#include <stdio.h>
int main() {
int i, j, a, b, r, p, q, x, n, A[100000];
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
r = n - 1;
p = 0;
x = A[r];
i = p - 1;
for (j = p; j <= r - 1; j++) {
if (A[j] <= x) {
i = i + 1;
a = A[i];
A[i] = A[j];
A[j] = a;
... | #include <stdio.h>
int main() {
int i, j, a, b, r, p, q, x, n, A[100000];
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
r = n - 1;
p = 0;
x = A[r];
i = p - 1;
for (j = p; j <= r - 1; j++) {
if (A[j] <= x) {
i = i + 1;
a = A[i];
A[i] = A[j];
A[j] = a;
... | [["+", 0, 2, 3, 4, 0, 69, 71, 16, 17, 33], ["+", 0, 2, 3, 4, 0, 69, 71, 16, 12, 13]] | 0 | 275 | 2 |
#include <stdio.h>
int main() {
int x, i, A[100000], p, n, r, key, j;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
r = n - 1;
p = 0;
x = A[r];
i = p - 1;
for (j = p; j < r - 1; j++) {
if (A[j] <= x) {
i++;
key = A[i];
A[i] = A[j];
A[j] = key;
... | #include <stdio.h>
int main() {
int x, i, A[100000], p, n, r, key, j;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
r = n - 1;
p = 0;
x = A[r];
i = p - 1;
for (j = p; j <= r - 1; j++) {
if (A[j] <= x) {
i++;
key = A[i];
A[i] = A[j];
A[j] = key;
... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 0 | 259 | 2 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.