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;
struct card {
int card;
int number;
string mark;
};
bool check_stability(vector<card> &b, vector<card> &s) {
for (int i = 0; i < b.size(); i++) {
if (b[i].card != s[i].card)
return false;
}
return true;
}
int find_m... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
struct card {
int card;
int number;
string mark;
};
bool check_stability(vector<card> &b, vector<card> &s) {
for (int i = 0; i < b.size(); i++) {
if (b[i].card != s[i].card)
return false;
}
return true;
}
int find_m... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 699 | 2 |
#include <iostream>
using namespace std;
struct Card {
char suit;
int value;
};
void bubbleSort(Card c[], int n) {
for (int i = 0; i < n; i++) {
for (int j = n - 1; j > i; j--) {
if (c[j].value < c[j - 1].value) {
swap(c[j], c[j - 1]);
}
}
}
}
void selectionSort(Card c[], int n) {... | #include <iostream>
using namespace std;
struct Card {
char suit;
int value;
};
void bubbleSort(Card c[], int n) {
for (int i = 0; i < n; i++) {
for (int j = n - 1; j > i; j--) {
if (c[j].value < c[j - 1].value) {
swap(c[j], c[j - 1]);
}
}
}
}
void selectionSort(Card c[], int n) {... | [["-", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22]] | 1 | 497 | 4 |
#include <iostream>
#include <vector>
using namespace std;
struct card {
int number;
char mark;
};
void BubbleSort(vector<card> &A) {
bool flag = true;
while (flag) {
flag = false;
for (int j = A.size() - 1; j >= 1; j--) {
if (A[j].number < A[j - 1].number) {
swap(A[j], A[j - 1]);
... | #include <iostream>
#include <vector>
using namespace std;
struct card {
int number;
char mark;
};
void BubbleSort(vector<card> &A) {
bool flag = true;
while (flag) {
flag = false;
for (int j = A.size() - 1; j >= 1; j--) {
if (A[j].number < A[j - 1].number) {
swap(A[j], A[j - 1]);
... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 493 | 2 |
#include <iostream>
#include <vector>
using namespace std;
struct Trump {
char mark;
int num;
};
vector<struct Trump> BubbleSort(vector<struct Trump> A, int n) {
int flag = 1;
while (flag == 1) {
flag = 0;
for (int i = n - 1; i > 0; i--) {
if (A[i].num < A[i - 1].num) {
struct Trump ch... | #include <iostream>
#include <vector>
using namespace std;
struct Trump {
char mark;
int num;
};
vector<struct Trump> BubbleSort(vector<struct Trump> A, int n) {
int flag = 1;
while (flag == 1) {
flag = 0;
for (int i = n - 1; i > 0; i--) {
if (A[i].num < A[i - 1].num) {
struct Trump ch... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 529 | 2 |
#include <cstdio>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
void bubblesort(std::vector<std::pair<char, int>> &array) {
std::pair<char, int> tmp;
for (int i = 0; i < array.size(); i++) {
for (int j = array.size() - 1; j > i; j--) {
if (array[j].second < array[j - 1].seco... | #include <cstdio>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
void bubblesort(std::vector<std::pair<char, int>> &array) {
std::pair<char, int> tmp;
for (int i = 0; i < array.size(); i++) {
for (int j = array.size() - 1; j > i; j--) {
if (array[j].second < array[j - 1].seco... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 637 | 2 |
#include <iostream>
using namespace std;
struct card {
char suit, value;
};
bool stable_or(struct card c1[], struct card c2[], int n) {
for (int i = 0; i < n; i++) {
if (c1[i].suit != c2[i].suit) {
return false;
}
}
return true;
}
void bubble_sort(int n, card c[]) {
int i, j;
for (i = 0; i... | #include <iostream>
using namespace std;
struct card {
char suit, value;
};
bool stable_or(struct card c1[], struct card c2[], int n) {
for (int i = 0; i < n; i++) {
if (c1[i].suit != c2[i].suit) {
return false;
}
}
return true;
}
void bubble_sort(int n, card c[]) {
int i, j;
for (i = 0; i... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 501 | 2 |
#include <iostream>
#include <stdio.h>
using namespace std;
struct Card {
char suit, value;
};
/*?????\?????????(0??????????????????)*/
void selection(struct Card A[], int N) {
for (int i = 0; i < N; i++) {
int mini = i;
for (int j = i; j < N; j++) {
if (A[j].value < A[mini].value)
mini = j;
... | #include <iostream>
#include <stdio.h>
using namespace std;
struct Card {
char suit, value;
};
/*?????\?????????(0??????????????????)*/
void selection(struct Card A[], int N) {
for (int i = 0; i < N; i++) {
int mini = i;
for (int j = i; j < N; j++) {
if (A[j].value < A[mini].value)
mini = j;
... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 479 | 2 |
#include <iostream>
using namespace std;
class Card {
public:
char m;
int n;
};
int main(void) {
int n, min, f = 0;
Card b[36], s[36];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> b[i].m >> b[i].n;
s[i] = b[i];
}
for (int i = 0; i < n - 1; i++) {
for (int j = n - 1; j > i; j--) {
if ... | #include <iostream>
using namespace std;
class Card {
public:
char m;
int n;
};
int main(void) {
int n, min, f = 0;
Card b[36], s[36];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> b[i].m >> b[i].n;
s[i] = b[i];
}
for (int i = 0; i < n - 1; i++) {
for (int j = n - 1; j > i; j--) {
if ... | [["-", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 402 | 2 |
#include <iostream>
#include <vector>
struct Card {
char c, v;
Card() : c(0), v(0) {}
Card(const Card &card) : c(card.c), v(card.v) {}
Card &operator=(const Card &card) {
c = card.c;
v = card.v;
return (*this);
}
bool operator==(const Card &card) { return c == card.c && v == card.v; }
bool op... | #include <iostream>
#include <vector>
struct Card {
char c, v;
Card() : c(0), v(0) {}
Card(const Card &card) : c(card.c), v(card.v) {}
Card &operator=(const Card &card) {
c = card.c;
v = card.v;
return (*this);
}
bool operator==(const Card &card) { return c == card.c && v == card.v; }
bool op... | [["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 33], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13]] | 1 | 558 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
#define maxn 105
struct in {
char ch;
int val;
};
in a[maxn];
in b[maxn];
int n;
bool compareStable() {
for (int i = 0; i < n; i++) {
if (a[i].ch != b[i].ch)
return false;
}
return true;
}
void bubbleSort() {
bool flag = 1;
for (int i... | #include <algorithm>
#include <iostream>
using namespace std;
#define maxn 105
struct in {
char ch;
int val;
};
in a[maxn];
in b[maxn];
int n;
bool compareStable() {
for (int i = 0; i < n; i++) {
if (a[i].ch != b[i].ch)
return false;
}
return true;
}
void bubbleSort() {
bool flag = 1;
for (int i... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 501 | 2 |
#include <iostream>
using namespace std;
// Data structrue for card
struct card {
char c;
int value;
};
// Print cards
void print(struct card C[], int n) {
for (int i = 0; i < n; i++) {
if (i > 0)
cout << " ";
cout << C[i].c << C[i].value;
}
cout << endl;
}
// Sort by bubble sort
void bubble... | #include <iostream>
using namespace std;
// Data structrue for card
struct card {
char c;
int value;
};
// Print cards
void print(struct card C[], int n) {
for (int i = 0; i < n; i++) {
if (i > 0)
cout << " ";
cout << C[i].c << C[i].value;
}
cout << endl;
}
// Sort by bubble sort
void bubble... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 509 | 2 |
#include <iostream>
using namespace std;
typedef struct Card {
char suit;
int value;
} Card;
void bubblesort(Card c[], int n) {
int flag = 1;
while (flag) {
flag = 0;
for (int i = n - 1; i >= 1; --i) {
if (c[i].value < c[i - 1].value) {
Card temp = c[i];
c[i] = c[i - 1];
c[... | #include <iostream>
using namespace std;
typedef struct Card {
char suit;
int value;
} Card;
void bubblesort(Card c[], int n) {
int flag = 1;
while (flag) {
flag = 0;
for (int i = n - 1; i >= 1; --i) {
if (c[i].value < c[i - 1].value) {
Card temp = c[i];
c[i] = c[i - 1];
c[... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 514 | 2 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
class P {
public:
int n;
string s;
int index;
bool operator<(P x) { return n <... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
class P {
public:
int n;
string s;
int index;
bool operator<(P x) { return n <... | [["-", 31, 16, 12, 23, 0, 41, 75, 5, 0, 6], ["+", 31, 16, 12, 23, 0, 41, 75, 5, 0, 6]] | 1 | 461 | 2 |
#include <iostream>
using namespace std;
struct Card {
char suit, value;
};
void bubble(struct Card A[], int N) {
int i, j;
for (i = 0; i < N; i++) {
for (j = N - 1; j > i; j--) {
if (A[j].value < A[j - 1].value) {
swap(A[j].value, A[j - 1].value);
}
}
}
}
void select(struct Card ... | #include <iostream>
using namespace std;
struct Card {
char suit, value;
};
void bubble(struct Card A[], int N) {
int i, j;
for (i = 0; i < N; i++) {
for (j = N - 1; j > i; j--) {
if (A[j].value < A[j - 1].value) {
swap(A[j], A[j - 1]);
}
}
}
}
void select(struct Card A[], int N) ... | [["-", 0, 1, 0, 2, 3, 4, 0, 118, 17, 131], ["-", 0, 1, 0, 2, 3, 4, 0, 118, 119, 120]] | 1 | 462 | 4 |
#include <iostream>
using namespace std;
struct Card {
char suit, value;
};
void BubbleSort(struct Card C[], int N) {
int i, j;
for (i = 0; i < N; i++) {
for (j = N - 1; j >= i; j--) {
if (C[j].value < C[j - 1].value)
swap(C[j], C[j - 1]);
}
}
}
void SelectionSort(struct Card A[], int N... | #include <iostream>
using namespace std;
struct Card {
char suit, value;
};
void BubbleSort(struct Card C[], int N) {
int i, j;
for (i = 0; i < N; i++) {
for (j = N - 1; j >= i; j--) {
if (C[j].value < C[j - 1].value)
swap(C[j], C[j - 1]);
}
}
}
void SelectionSort(struct Card A[], int N... | [["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22]] | 1 | 429 | 8 |
#include <iostream>
using namespace std;
struct foo {
int num;
char c;
};
int main() {
int n;
foo a[100], b[100];
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i].c >> a[i].num, b[i] = a[i];
for (int i = 0; i < n - 1; i++) {
for (int j = n - 1; i < j; j--) {
foo tmp = a[j];
if (a[j... | #include <iostream>
using namespace std;
struct foo {
int num;
char c;
};
int main() {
int n;
foo a[100], b[100];
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i].c >> a[i].num, b[i] = a[i];
for (int i = 0; i < n - 1; i++) {
for (int j = n - 1; i < j; j--) {
foo tmp = a[j];
if (a[j... | [["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 33], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13]] | 1 | 429 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
int cntSort;
void printArray(char B[], int A[], int N) {
for (int i = 0; i < N - 1; i++)
cout << B[i] << A[i] << " ";
cout << B[N - 1] << A[N - 1] << endl;
}
void insertionSort(int A[], char B[], int N) {
for (int i = 1; i < N; i++) {
int v... | #include <algorithm>
#include <iostream>
using namespace std;
int cntSort;
void printArray(char B[], int A[], int N) {
for (int i = 0; i < N - 1; i++)
cout << B[i] << A[i] << " ";
cout << B[N - 1] << A[N - 1] << endl;
}
void insertionSort(int A[], char B[], int N) {
for (int i = 1; i < N; i++) {
int v... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 648 | 2 |
#include <iostream>
using namespace std;
struct Card {
char value, suit;
};
void show(struct Card cards[], int n) {
for (int k = 0; k < n; ++k) {
if (k == n - 1) {
cout << cards[k].suit << cards[k].value;
} else {
cout << cards[k].suit << cards[k].value << " ";
}
}
cout << endl;
}
voi... | #include <iostream>
using namespace std;
struct Card {
char value, suit;
};
void show(struct Card cards[], int n) {
for (int k = 0; k < n; ++k) {
if (k == n - 1) {
cout << cards[k].suit << cards[k].value;
} else {
cout << cards[k].suit << cards[k].value << " ";
}
}
cout << endl;
}
voi... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 527 | 2 |
#include <iostream>
using namespace std;
class Card {
public:
int num;
char ch;
};
inline void bubbleSort(Card a[], int n) {
bool flag = 1;
for (int i = 0; flag; i++) {
flag = 0;
for (int j = n - 1; j >= i + 1; j--) {
if (a[j].num < a[j - 1].num) {
swap(a[j], a[j - 1]);
flag = 1;
... | #include <iostream>
using namespace std;
class Card {
public:
int num;
char ch;
};
inline void bubbleSort(Card a[], int n) {
bool flag = 1;
for (int i = 0; flag; i++) {
flag = 0;
for (int j = n - 1; j >= i + 1; j--) {
if (a[j].num < a[j - 1].num) {
swap(a[j], a[j - 1]);
flag = 1;
... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 485 | 2 |
#include <algorithm>
#include <iostream>
#include <limits>
#include <string>
#include <vector>
#define INT_MAX 2147483647
#define INT_MIN -2147483647
using namespace std;
void bubble_sort(vector<pair<char, int>> &data) {
for (int i = 1; i < data.size(); ++i) {
for (int j = data.size() - 1; j >= i; --j) {
... | #include <algorithm>
#include <iostream>
#include <limits>
#include <string>
#include <vector>
#define INT_MAX 2147483647
#define INT_MIN -2147483647
using namespace std;
void bubble_sort(vector<pair<char, int>> &data) {
for (int i = 1; i < data.size(); ++i) {
for (int j = data.size() - 1; j >= i; --j) {
... | [["-", 31, 16, 12, 23, 0, 41, 75, 5, 0, 6], ["+", 31, 16, 12, 23, 0, 41, 75, 5, 0, 6]] | 1 | 485 | 2 |
#include <algorithm>
#include <cctype>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int arr[36 + 5];
string str[36 + 5];
int a... | #include <algorithm>
#include <cctype>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int arr[36 + 5];
string str[36 + 5];
int a... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 548 | 2 |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
struct card {
char c;
int num;
};
template <typename T>
void bsort(typename vector<T>::iterator itr_first,
typename vector<T>::iterator itr_last) {
for (int i = 0; i < itr_last - itr_first; ++i) {
for (auto itr = itr_las... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
struct card {
char c;
int num;
};
template <typename T>
void bsort(typename vector<T>::iterator itr_first,
typename vector<T>::iterator itr_last) {
for (int i = 0; i < itr_last - itr_first; ++i) {
for (auto itr = itr_las... | [["-", 0, 16, 12, 23, 0, 41, 75, 5, 0, 6], ["+", 0, 16, 12, 23, 0, 41, 75, 5, 0, 6]] | 1 | 574 | 2 |
#include <iostream>
using namespace std;
struct Card {
char suit, value;
};
void selectionSort(struct Card A[], int N) {
int i, j, mini;
for (i = 0; i < N; i++) {
mini = i;
for (j = i; j < N; j++) {
if (A[j].value < A[mini].value)
mini = j;
}
Card t = A[i];
A[i] = A[mini];
... | #include <iostream>
using namespace std;
struct Card {
char suit, value;
};
void selectionSort(struct Card A[], int N) {
int i, j, mini;
for (i = 0; i < N; i++) {
mini = i;
for (j = i; j < N; j++) {
if (A[j].value < A[mini].value)
mini = j;
}
Card t = A[i];
A[i] = A[mini];
... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 470 | 2 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
string b[36], s[36];
void show() {
for (int i = 0; i < N; i++) {
cout << b[i] << (i == N - 1 ? '\n' : ' ');
}
cout << "Stable" << endl;
for (int i = 0; i < N; i++) {
cout << s[i] << (i == N - 1 ? '\n' : ' ');
}
for (int ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
string b[36], s[36];
void show() {
for (int i = 0; i < N; i++) {
cout << b[i] << (i == N - 1 ? '\n' : ' ');
}
cout << "Stable" << endl;
for (int i = 0; i < N; i++) {
cout << s[i] << (i == N - 1 ? '\n' : ' ');
}
for (int ... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 375 | 2 |
#include <algorithm>
#include <iostream>
#include <stdio.h>
using namespace std;
struct Card {
char suit, value;
};
void BubbleSort(struct Card C[], int n) {
Card tmp;
for (int i = 0; i < n; i++) {
for (int j = n - 1; j >= i; j--) {
if (C[j].value > C[j - 1].value) {
tmp = C[j];
C[j] = ... | #include <algorithm>
#include <iostream>
#include <stdio.h>
using namespace std;
struct Card {
char suit, value;
};
void BubbleSort(struct Card C[], int n) {
Card tmp;
for (int i = 0; i < n; i++) {
for (int j = n - 1; j >= i; j--) {
if (C[j].value < C[j - 1].value) {
tmp = C[j];
C[j] = ... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18]] | 1 | 495 | 2 |
#include <iostream>
#include <vector>
using namespace std;
struct Card {
char suit, value;
};
void Output(vector<Card> A) {
for (int i = 0; i < A.size(); i++) {
if (i > 0)
cout << " ";
cout << A[i].suit << A[i].value;
}
cout << endl;
}
bool IsStable(vector<Card> C1, vector<Card> C2, int N) {... | #include <iostream>
#include <vector>
using namespace std;
struct Card {
char suit, value;
};
void Output(vector<Card> A) {
for (int i = 0; i < A.size(); i++) {
if (i > 0)
cout << " ";
cout << A[i].suit << A[i].value;
}
cout << endl;
}
bool IsStable(vector<Card> C1, vector<Card> C2, int N) {... | [["-", 31, 16, 12, 23, 0, 41, 75, 5, 0, 6], ["+", 31, 16, 12, 23, 0, 41, 75, 5, 0, 6]] | 1 | 410 | 2 |
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define GET_ARRAY_SIZE(a) (sizeof(a) / sizeof(a[0]))
using namespace std;
struct Card {
char sui... |
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define GET_ARRAY_SIZE(a) (sizeof(a) / sizeof(a[0]))
using namespace std;
struct Card {
char sui... | [["+", 0, 57, 64, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 12, 146], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35]] | 1 | 527 | 4 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int n;
cin >> n;
string A[n];
for (int i = 0; i < n; i++)
cin >> A[i];
string C[n];
for (int i = 0; i < n; i++)
C[i] = A[i];
int ans = 0;
for (int i = 0; i < n; i++) {
for (int j = n - 1; j > i; j--) {
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int n;
cin >> n;
string A[n];
for (int i = 0; i < n; i++)
cin >> A[i];
string C[n];
for (int i = 0; i < n; i++)
C[i] = A[i];
int ans = 0;
for (int i = 0; i < n; i++) {
for (int j = n - 1; j > i; j--) {
... | [["-", 31, 16, 12, 23, 0, 41, 75, 5, 0, 6], ["+", 31, 16, 12, 23, 0, 41, 75, 5, 0, 6]] | 1 | 582 | 4 |
#include <stdio.h>
struct trump {
char moji;
int num;
};
void bubble(struct trump *, int);
void insertion(struct trump *, int);
int judge(struct trump *, struct trump *, int);
void bubble(struct trump k1[], int n) {
int i, j;
struct trump tmp;
for (i = 0; i < n; i++) {
for (j = n - 1; j >= i; j--) {
... | #include <stdio.h>
struct trump {
char moji;
int num;
};
void bubble(struct trump *, int);
void insertion(struct trump *, int);
int judge(struct trump *, struct trump *, int);
void bubble(struct trump k1[], int n) {
int i, j;
struct trump tmp;
for (i = 0; i < n; i++) {
for (j = n - 1; j > i; j--) {
... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 20], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 47], ["-", 0, 2, 3, 4, 0, 118, 28, 69, 28, 22], ["+", 0, 2, 3, 4, 0, 118, 28, 69, 28, 22]] | 1 | 588 | 4 |
#include <stdio.h>
#define N 100
struct pair {
int n;
char m;
};
int main() {
int n, i;
struct pair card[N];
char space;
scanf("%d\n", &n);
for (i = 0; i < n; i++) {
scanf("%c%d%c", &card[i].m, &card[i].n, &space);
}
struct pair bubble[N], sel[N];
///////////////bubble//////////////////
for... | #include <stdio.h>
#define N 100
struct pair {
int n;
char m;
};
int main() {
int n, i;
struct pair card[N];
char space;
scanf("%d\n", &n);
for (i = 0; i < n; i++) {
scanf("%c%d%c", &card[i].m, &card[i].n, &space);
}
struct pair bubble[N], sel[N];
///////////////bubble//////////////////
for... | [["-", 0, 57, 15, 339, 51, 16, 31, 118, 119, 120], ["+", 0, 57, 15, 339, 51, 16, 31, 118, 119, 120], ["-", 0, 57, 15, 339, 51, 16, 12, 118, 119, 120], ["+", 0, 57, 15, 339, 51, 16, 12, 118, 119, 120]] | 1 | 520 | 4 |
#include <iostream>
using namespace std;
static const int MAX = 100;
struct Card {
char suit, value;
};
void bubbleSort(struct Card A[], int N) {
bool flag = true;
for (int i = 0; flag; i++) {
flag = false;
for (int j = N - 1; j >= i + 1; j--) {
if (A[j].value < A[j - 1].value) {
Card tm... | #include <iostream>
using namespace std;
static const int MAX = 100;
struct Card {
char suit, value;
};
void bubbleSort(struct Card A[], int N) {
bool flag = true;
for (int i = 0; flag; i++) {
flag = false;
for (int j = N - 1; j >= i + 1; j--) {
if (A[j].value < A[j - 1].value) {
Card tm... | [["-", 0, 7, 10, 43, 49, 50, 51, 16, 31, 13], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 31, 22]] | 1 | 508 | 2 |
#include <iostream>
using namespace std;
struct Card {
char suit, value;
};
void printCard(Card *a, int n) {
for (int i = 0; i < n; i++) {
if (i > 0) {
cout << " ";
}
cout << a[i].suit << a[i].value;
}
cout << endl;
}
bool checkStable(Card *ref, Card *test, int n) {
for (int i = 0; i < n... | #include <iostream>
using namespace std;
struct Card {
char suit, value;
};
void printCard(Card *a, int n) {
for (int i = 0; i < n; i++) {
if (i > 0) {
cout << " ";
}
cout << a[i].suit << a[i].value;
}
cout << endl;
}
bool checkStable(Card *ref, Card *test, int n) {
for (int i = 0; i < n... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 489 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
struct puke {
char Suit;
int Value;
};
void selectionSort(puke a[], int N) {
for (int i = 0; i < N; i++) {
int s = i;
for (int j = i; j < N; j++) {
if (a[j].Value < a[s].Value) {
s = j;
}
}
swap(a[i].Value, a[s].Valu... | #include <algorithm>
#include <iostream>
using namespace std;
struct puke {
char Suit;
int Value;
};
void selectionSort(puke a[], int N) {
for (int i = 0; i < N; i++) {
int s = i;
for (int j = i; j < N; j++) {
if (a[j].Value < a[s].Value) {
s = j;
}
}
swap(a[i].Value, a[s].Valu... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 79]] | 1 | 551 | 2 |
#include <iostream>
using namespace std;
struct Card {
char suit, value;
};
void bubble(Card A[], int N) {
for (int i = 0; i < N; i++) {
for (int j = N - 1; j >= i + 1; j--) {
if (A[j].value < A[j - 1].value) {
swap(A[j], A[j - 1]);
}
}
}
}
void selection(Card A[], int N) {
for (i... | #include <iostream>
using namespace std;
struct Card {
char suit, value;
};
void bubble(Card A[], int N) {
for (int i = 0; i < N; i++) {
for (int j = N - 1; j >= i + 1; j--) {
if (A[j].value < A[j - 1].value) {
swap(A[j], A[j - 1]);
}
}
}
}
void selection(Card A[], int N) {
for (i... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 435 | 2 |
// 1_2_C ??????????????????3.5
#include <algorithm>
#include <iostream>
#include <stdio.h>
#include <vector>
struct card {
char type;
int num;
};
// spap??¢??°
void swap(card *a, card *b) {
card temp = *a;
*a = *b;
*b = temp;
return;
}
//???????????????????????¢??°
int printCardArray(card data[], int num... | // 1_2_C ??????????????????3.5
#include <algorithm>
#include <iostream>
#include <stdio.h>
#include <vector>
struct card {
char type;
int num;
};
// spap??¢??°
void swap(card *a, card *b) {
card temp = *a;
*a = *b;
*b = temp;
return;
}
//???????????????????????¢??°
int printCardArray(card data[], int num... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 592 | 2 |
#include <iostream>
using namespace std;
struct Card {
char suit;
char value;
};
void trace(Card C[], int N) {
for (int i = 0; i < N; i++) {
if (i > 0)
cout << " ";
cout << C[i].suit << C[i].value;
}
cout << endl;
}
int selectionSort(Card C[], int N) {
int minj;
Card tmp;
int count = 0... | #include <iostream>
using namespace std;
struct Card {
char suit;
char value;
};
void trace(Card C[], int N) {
for (int i = 0; i < N; i++) {
if (i > 0)
cout << " ";
cout << C[i].suit << C[i].value;
}
cout << endl;
}
int selectionSort(Card C[], int N) {
int minj;
Card tmp;
int count = 0... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 506 | 2 |
/**
* ??????????????????
?????????????????????????????´?????????????????????????????§?????????????????????(S,
H, C, D)??¨???????????°???(1, 2, ..., 9)???????§??????????????¨? 36
????????????????????¨????????????????????°??????????????? 8
???"H8"??????????????? 1 ???"D1"??¨??¨????????????
?????????????????????????????... | /**
* ??????????????????
?????????????????????????????´?????????????????????????????§?????????????????????(S,
H, C, D)??¨???????????°???(1, 2, ..., 9)???????§??????????????¨? 36
????????????????????¨????????????????????°??????????????? 8
???"H8"??????????????? 1 ???"D1"??¨??¨????????????
?????????????????????????????... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 530 | 2 |
#include <bits/stdc++.h>
using namespace std;
char C[36][3];
char Cb[36][3];
char Cs[36][3];
int Ib[36];
int Is[36];
int N;
bool is_stable(char c[][3], int ind[]) {
char num = '1';
for (int i = 1; i < N; i++) {
if (c[i][1] == num) {
if (ind[i - 1] > ind[i]) {
return false;
}
}
num ... | #include <bits/stdc++.h>
using namespace std;
char C[36][3];
char Cb[36][3];
char Cs[36][3];
int Ib[36];
int Is[36];
int N;
bool is_stable(char c[][3], int ind[]) {
char num = '1';
for (int i = 1; i < N; i++) {
if (c[i][1] == num) {
if (ind[i - 1] > ind[i]) {
return false;
}
}
num ... | [["-", 0, 2, 3, 4, 0, 41, 75, 5, 0, 6], ["+", 0, 2, 3, 4, 0, 41, 75, 5, 0, 6]] | 1 | 574 | 4 |
#include <bits/stdc++.h>
struct CARD {
char mark;
char num;
int index;
};
void selectionSort(CARD *A, int N) {
int minj;
for (int i = 0; i < N - 1; i++) {
minj = i;
for (int j = i; j < N; j++) {
if (A[j].num < A[minj].num)
minj = j;
}
if (minj != i) {
CARD tmp = A[i];
... | #include <bits/stdc++.h>
struct CARD {
char mark;
char num;
int index;
};
void selectionSort(CARD *A, int N) {
int minj;
for (int i = 0; i < N - 1; i++) {
minj = i;
for (int j = i; j < N; j++) {
if (A[j].num < A[minj].num)
minj = j;
}
if (minj != i) {
CARD tmp = A[i];
... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 604 | 2 |
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define rep(i, from, to) for (int i = from; i < to; ++i)
#define REP(i, from, to) for (int i = from; i <= to; ++i)
using namespace std;
template <typename T>
ostream &operator<<(ostream &out, const vector<vector<T>> &v) {
for (size_t i = 0; ... | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define rep(i, from, to) for (int i = from; i < to; ++i)
#define REP(i, from, to) for (int i = from; i <= to; ++i)
using namespace std;
template <typename T>
ostream &operator<<(ostream &out, const vector<vector<T>> &v) {
for (size_t i = 0; ... | [["-", 0, 16, 31, 16, 12, 118, 28, 69, 28, 22], ["+", 0, 16, 31, 16, 12, 118, 28, 69, 28, 22], ["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 1,013 | 4 |
#include <iostream>
using namespace std;
struct Card {
char suit, value;
};
void print(Card card[], int size) {
for (int i = 0; i < size; i++) {
if (i)
cout << ' ';
cout << card[i].suit << card[i].value;
}
cout << endl;
}
void selection(Card cards[], int size) {
int minj;
for (int i = 0; i ... | #include <iostream>
using namespace std;
struct Card {
char suit, value;
};
void print(Card card[], int size) {
for (int i = 0; i < size; i++) {
if (i)
cout << ' ';
cout << card[i].suit << card[i].value;
}
cout << endl;
}
void selection(Card cards[], int size) {
int minj;
for (int i = 0; i ... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 494 | 2 |
#include <iostream>
using namespace std;
struct card {
char suit, value;
};
void bubble(struct card a[], int n) {
for (int i = 0; i < n; i++) {
for (int j = n - 1; j >= i; j--) {
if (a[j].value < a[j - 1].value)
swap(a[j], a[j - 1]);
}
}
}
void selection(struct card a[], int n) {
for (i... | #include <iostream>
using namespace std;
struct card {
char suit, value;
};
void bubble(struct card a[], int n) {
for (int i = 0; i < n; i++) {
for (int j = n - 1; j >= i; j--) {
if (a[j].value < a[j - 1].value)
swap(a[j], a[j - 1]);
}
}
}
void selection(struct card a[], int n) {
for (i... | [["-", 51, 16, 12, 118, 28, 69, 341, 342, 0, 22], ["+", 51, 16, 12, 118, 28, 69, 341, 342, 0, 22], ["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 45], ["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46]] | 1 | 453 | 4 |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
void BubbleSort(int, int);
void SelectionSort(int, int);
struct Card {
char pic, val;
};
void swap(Card *a, Card *b) {
Card tmp = *a;
*a = *b;
*b = tmp;
}
void printResult(Card *Seq, int n) {
for (int i = 0; i < n; i++) {
if... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
void BubbleSort(int, int);
void SelectionSort(int, int);
struct Card {
char pic, val;
};
void swap(Card *a, Card *b) {
Card tmp = *a;
*a = *b;
*b = tmp;
}
void printResult(Card *Seq, int n) {
for (int i = 0; i < n; i++) {
if... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 528 | 2 |
///
// File: alds1_2_c.cpp
// Author: ymiyamoto
//
// Created on Wed Oct 4 01:32:07 2017
//
#include <cstdint>
#include <iostream>
#include <vector>
using namespace std;
static vector<pair<uint32_t, char>> array1;
static vector<pair<uint32_t, char>> array2;
static void bubble_sort() {
for (uint32_t i = 0; i < ar... | ///
// File: alds1_2_c.cpp
// Author: ymiyamoto
//
// Created on Wed Oct 4 01:32:07 2017
//
#include <cstdint>
#include <iostream>
#include <vector>
using namespace std;
static vector<pair<uint32_t, char>> array1;
static vector<pair<uint32_t, char>> array2;
static void bubble_sort() {
for (uint32_t i = 0; i < ar... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 461 | 2 |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
vector<string> a, b;
string tmp;
int n, i;
cin >> n;
for (i = 0; i < n; i++) {
cin >> tmp;
a.push_back(tmp);
}
b.assign(a.begin(), a.end());
for (i = 0; i < n - 1; i++)
for (int j = n - 2; j != i - 1;... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
vector<string> a, b;
string tmp;
int n, i;
cin >> n;
for (i = 0; i < n; i++) {
cin >> tmp;
a.push_back(tmp);
}
b.assign(a.begin(), a.end());
for (i = 0; i < n - 1; i++)
for (int j = n - 2; j != i - 1;... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 350 | 2 |
#include <bits/stdc++.h>
using namespace std;
class card {
public:
int N;
vector<int> value;
vector<char> cha;
vector<string> init_array;
vector<string> array;
vector<string> Barray;
vector<string> Sarray;
void set(void) {
cin >> N;
value.resize(N);
cha.resize(N);
init_array.resize(N);... | #include <bits/stdc++.h>
using namespace std;
class card {
public:
int N;
vector<int> value;
vector<char> cha;
vector<string> init_array;
vector<string> array;
vector<string> Barray;
vector<string> Sarray;
void set(void) {
cin >> N;
value.resize(N);
cha.resize(N);
init_array.resize(N);... | [["-", 8, 1, 0, 41, 15, 16, 12, 23, 0, 25], ["+", 0, 7, 8, 1, 0, 16, 12, 23, 0, 25]] | 1 | 596 | 4 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
typedef long long int ll;
using namespace std;
struct card {
char suit;
int value;
};
void bubble(struct card a[], int n) {
for (int... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
typedef long long int ll;
using namespace std;
struct card {
char suit, value;
};
void bubble(struct card a[], int n) {
for (int i = 0... | [["-", 0, 30, 0, 122, 8, 123, 0, 124, 0, 35], ["-", 0, 30, 0, 122, 8, 123, 0, 124, 39, 40], ["+", 0, 30, 0, 122, 8, 123, 0, 124, 0, 21]] | 1 | 512 | 3 |
#include <iostream>
using namespace std;
int bub(char c[][2], int n) {
for (int i = 0; i < n; i++) {
for (int j = n - 1; j > i; j--) {
if (c[j][1] < c[j - 1][1]) {
swap(c[j], c[j - 1]);
}
}
}
return 0;
}
int sel(char k[][2], int n) {
for (int i = 0; i < n; i++) {
int minj = i;
... | #include <iostream>
using namespace std;
int bub(char c[][2], int n) {
for (int i = 0; i < n; i++) {
for (int j = n - 1; j > i; j--) {
if (c[j][1] < c[j - 1][1]) {
swap(c[j], c[j - 1]);
}
}
}
return 0;
}
int sel(char k[][2], int n) {
for (int i = 0; i < n; i++) {
int minj = i;
... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 555 | 2 |
#include <cstring>
#include <iostream>
#include <string>
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
void bubble(int si[], char sc[], int N) {
for (int i = 0; i < N; i++) {
for (int j = N - 1; j > i; j--) {
if (si[j] < si[j - 1]) {
swap(si[j], si[j - 1]);
swap... | #include <cstring>
#include <iostream>
#include <string>
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
void bubble(int si[], char sc[], int N) {
for (int i = 0; i < N; i++) {
for (int j = N - 1; j > i; j--) {
if (si[j] < si[j - 1]) {
swap(si[j], si[j - 1]);
swap... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 443 | 2 |
#include <iostream>
using namespace std;
struct Card {
char suit;
int value;
};
void bubble(struct Card c[], int n) {
for (int i = 0; i < n; i++) {
for (int j = n - 1; j > i; j--) {
if (c[j].value < c[j - 1].value) {
Card t = c[j];
c[j] = c[j - 1];
c[j - 1] = t;
}
}
... | #include <iostream>
using namespace std;
struct Card {
char suit;
int value;
};
void bubble(struct Card c[], int n) {
for (int i = 0; i < n; i++) {
for (int j = n - 1; j > i; j--) {
if (c[j].value < c[j - 1].value) {
Card t = c[j];
c[j] = c[j - 1];
c[j - 1] = t;
}
}
... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["-", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 483 | 4 |
#include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef pair<char, int> P;
void myprint(vector<P> &a) {
for (auto it = a.begin(); it != a.end(); ++it) {
if (it != a.begin()) {
cout << " ";
}
cout << it->first << it->second;
}
cou... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef pair<char, int> P;
void myprint(vector<P> &a) {
for (auto it = a.begin(); it != a.end(); ++it) {
if (it != a.begin()) {
cout << " ";
}
cout << it->first << it->second;
}
cou... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 660 | 2 |
#include <iostream>
using namespace std;
struct Card {
char suit, value;
};
void bubbleSort(struct Card C[], int n) {
for (int i = 0; i < n; i++) {
for (int j = n - 1; j > i; j--) {
if (C[j].value < C[j - 1].value) {
swap(C[j], C[j - 1]);
}
}
}
}
void selectionSort(Card C[], int n) ... | #include <iostream>
using namespace std;
struct Card {
char suit, value;
};
void bubbleSort(struct Card C[], int n) {
for (int i = 0; i < n; i++) {
for (int j = n - 1; j > i; j--) {
if (C[j].value < C[j - 1].value) {
swap(C[j], C[j - 1]);
}
}
}
}
void selectionSort(Card C[], int n) ... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 459 | 2 |
#include <iostream>
using namespace std;
class Cards {
public:
char m;
int n;
};
int main(void) {
int n, min, f = 0;
Cards b[36], s[36];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> b[i].m >> b[i].n;
s[i] = b[i];
}
for (int i = 0; i < n - 1; i++) {
for (int j = n - 1; j > i; j--) {
... | #include <iostream>
using namespace std;
class Cards {
public:
char m;
int n;
};
int main(void) {
int n, min, f = 0;
Cards b[36], s[36];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> b[i].m >> b[i].n;
s[i] = b[i];
}
for (int i = 0; i < n - 1; i++) {
for (int j = n - 1; j > i; j--) {
... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 391 | 2 |
#include "bits/stdc++.h"
using namespace std;
struct Card {
char suit;
int value;
};
void Print(vector<Card> &A) {
for (int i = 0; i < A.size(); ++i) {
if (i)
cout << " ";
cout << A[i].suit << A[i].value;
}
cout << endl;
}
void SelectionSort(vector<Card> &A) {
for (int i = 0; i < A.size(); ... | #include "bits/stdc++.h"
using namespace std;
struct Card {
char suit;
int value;
};
void Print(vector<Card> &A) {
for (int i = 0; i < A.size(); ++i) {
if (i)
cout << " ";
cout << A[i].suit << A[i].value;
}
cout << endl;
}
void SelectionSort(vector<Card> &A) {
for (int i = 0; i < A.size(); ... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 428 | 2 |
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
void BubbleSort(vector<string> &A) {
for (int i = 0; i <= A.size() - 1; i++) {
for (int j = A.size() - 1; j >= i + 1; j--) {
if (A[j][1] < A[j - 1][1]) {
string a = A[j];
A[j]... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
void BubbleSort(vector<string> &A) {
for (int i = 0; i <= A.size() - 1; i++) {
for (int j = A.size() - 1; j >= i + 1; j--) {
if (A[j][1] < A[j - 1][1]) {
string a = A[j];
A[j]... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 407 | 2 |
#include <iostream>
using namespace std;
void bubbleSort(int A[], char C[], int N) {
int flag, j, i = 0;
flag = 1;
while (flag) {
flag = 0;
for (j = N - 1; j >= i + 1; j--) {
if (A[j] < A[j - 1]) {
swap(A[j], A[j - 1]);
swap(C[j], C[j - 1]);
flag = 1;
}
}
i++;
... | #include <iostream>
using namespace std;
void bubbleSort(int A[], char C[], int N) {
int flag, j, i = 0;
flag = 1;
while (flag) {
flag = 0;
for (j = N - 1; j >= i + 1; j--) {
if (A[j] < A[j - 1]) {
swap(A[j], A[j - 1]);
swap(C[j], C[j - 1]);
flag = 1;
}
}
i++;
... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 515 | 2 |
#include <iostream>
using namespace std;
struct Card {
char mark, value;
};
void bubbleSort(struct Card C[], int n) {
int i, j;
Card v;
for (i = 0; i < n; i++) {
for (j = n - 1; j >= i + 1; j++) {
if (C[j].value < C[j - 1].value) {
v = C[j];
C[j] = C[j - 1];
C[j - 1] =... | #include <iostream>
using namespace std;
struct Card {
char mark;
int value;
};
void bubbleSort(struct Card C[], int n) {
int i, j;
Card v;
for (i = 0; i < n; i++) {
for (j = n - 1; j >= i + 1; j--) {
if (C[j].value < C[j - 1].value) {
v = C[j];
C[j] = C[j - 1];
C[j ... | [["-", 0, 30, 0, 122, 8, 123, 0, 124, 0, 21], ["+", 0, 30, 0, 122, 8, 123, 0, 124, 0, 35], ["+", 0, 30, 0, 122, 8, 123, 0, 124, 39, 40], ["-", 0, 7, 8, 9, 0, 7, 26, 27, 17, 29], ["+", 0, 7, 8, 9, 0, 7, 26, 27, 17, 68], ["-", 0, 1, 0, 16, 12, 118, 28, 69, 28, 22], ["+", 0, 1, 0, 16, 12, 118, 28, 69, 28, 22], ["-", 0, 1,... | 1 | 505 | 9 |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef vector<string> card_list;
bool comp(string a, string b) {
int x = static_cast<int>(a[1]) - 48;
int y = static_cast<int>(b[1]) - 48;
return x < y;
}
int bubbleSort(card_list &A) {
int N = A.size();
int... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef vector<string> card_list;
bool comp(string a, string b) {
int x = static_cast<int>(a[1]) - 48;
int y = static_cast<int>(b[1]) - 48;
return x < y;
}
int bubbleSort(card_list &A) {
int N = A.size();
int... | [["-", 51, 2, 3, 4, 0, 2, 63, 118, 119, 120], ["+", 51, 2, 3, 4, 0, 2, 63, 118, 119, 120]] | 1 | 458 | 2 |
#include <iostream>
#include <string.h>
using namespace std;
int main() {
int n = 0, minj = 0, flag = 1, k = 0;
char a[36][3], b[36][3], temp[3];
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
strcpy(b[i], a[i]);
while (flag) {
flag = 0;
for (int j = n - ... | #include <iostream>
#include <string.h>
using namespace std;
int main() {
int n = 0, minj = 0, flag = 1, k = 0;
char a[36][3], b[36][3], temp[3];
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
strcpy(b[i], a[i]);
while (flag) {
flag = 0;
for (int j = n - ... | [["-", 64, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 64, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 649 | 8 |
#include <iostream>
using namespace std;
struct Card {
char suit;
char value;
};
void trace(struct Card A[], int N) {
for (int i = 0; i < N; i++) {
if (i > 0)
cout << " ";
cout << A[i].suit << A[i].value;
}
cout << endl;
}
int bubbleSort(struct Card A[], int N) {
int flag = 1;
int count =... | #include <iostream>
using namespace std;
struct Card {
char suit;
char value;
};
void trace(struct Card A[], int N) {
for (int i = 0; i < N; i++) {
if (i > 0)
cout << " ";
cout << A[i].suit << A[i].value;
}
cout << endl;
}
int bubbleSort(struct Card A[], int N) {
int flag = 1;
int count =... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 522 | 2 |
#include <cstdio>
#include <iostream>
#include <utility>
using namespace std;
struct Card {
char suit, value;
};
//???????????????????????¢??° write ?????????
void write(struct Card A[], int N) {
for (int i = 0; i < N; i++) {
if (i > 0) {
printf(" ");
}
cout << A[i].suit << A[i].value;
}... | #include <cstdio>
#include <iostream>
#include <utility>
using namespace std;
struct Card {
char suit, value;
};
//???????????????????????¢??° write ?????????
void write(struct Card A[], int N) {
for (int i = 0; i < N; i++) {
if (i > 0) {
printf(" ");
}
cout << A[i].suit << A[i].value;
}... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 451 | 4 |
#include <algorithm>
#include <deque>
#include <iostream>
#include <vector>
using namespace std;
struct Card {
char suit;
int value;
};
void trace(const vector<Card> &a) {
for (int i = 0; i < a.size(); i++) {
cout << a[i].suit << a[i].value << ((i != a.size() - 1) ? " " : "");
}
cout << endl;
}
bool is... | #include <algorithm>
#include <deque>
#include <iostream>
#include <vector>
using namespace std;
struct Card {
char suit;
int value;
};
void trace(const vector<Card> &a) {
for (int i = 0; i < a.size(); i++) {
cout << a[i].suit << a[i].value << ((i != a.size() - 1) ? " " : "");
}
cout << endl;
}
bool is... | [["-", 15, 339, 51, 16, 12, 16, 12, 118, 119, 120], ["+", 15, 339, 51, 16, 12, 16, 12, 118, 119, 120]] | 1 | 488 | 2 |
#include <cstdlib>
#include <iostream>
#include <string>
using namespace std;
const int N_MAX = 36;
typedef struct Card {
char suit;
int value;
} Card;
void printArray(Card *A, int len) {
for (int i = 0; i < len; i++) {
cout << A[i].suit << A[i].value;
if (i != len - 1)
cout << " ";
}
cout <... | #include <cstdlib>
#include <iostream>
#include <string>
using namespace std;
const int N_MAX = 36;
typedef struct Card {
char suit;
int value;
} Card;
void printArray(Card *A, int len) {
for (int i = 0; i < len; i++) {
cout << A[i].suit << A[i].value;
if (i != len - 1)
cout << " ";
}
cout <... | [["-", 0, 43, 49, 50, 51, 41, 75, 5, 0, 6], ["+", 0, 43, 49, 50, 51, 41, 75, 5, 0, 6]] | 1 | 539 | 2 |
#include <cstdio>
int main() {
int n, i, j, minj;
char c[36][3], d[36][3], tmp;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%s", c[i]);
for (j = 0; j < 3; j++)
d[i][j] = c[i][j];
}
for (i = 0; i < n; i++) {
for (j = n - 1; j > i; j--) {
if (c[j][1] < c[j - 1][1]) {
tmp ... | #include <cstdio>
int main() {
int n, i, j, minj;
char c[36][3], d[36][3], tmp;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%s", c[i]);
for (j = 0; j < 3; j++)
d[i][j] = c[i][j];
}
for (i = 0; i < n; i++) {
for (j = n - 1; j > i; j--) {
if (c[j][1] < c[j - 1][1]) {
tmp ... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 521 | 2 |
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
void stringSwap(string *a, int i, int j);
void BubbleSort(string *C, int N);
void SelectionSort(string *C, int N);
bool check(string *C1, string *C2, int N) {
for (int i = 0; i < N; i++) {
if (C1[i] != C2[i])
return false;
}
... | #include <cstdio>
#include <iostream>
#include <string>
using namespace std;
void stringSwap(string *a, int i, int j);
void BubbleSort(string *C, int N);
void SelectionSort(string *C, int N);
bool check(string *C1, string *C2, int N) {
for (int i = 0; i < N; i++) {
if (C1[i] != C2[i])
return false;
}
... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 488 | 2 |
#include <iostream>
#include <vector>
using namespace std;
void swap(int &a, int &b) {
int dum = a;
a = b;
b = dum;
return;
}
void swap(char &a, char &b) {
char dum = a;
a = b;
b = dum;
return;
}
int main() {
int n, minj;
cin >> n;
vector<int> a(n), b(n);
vector<char> s(n), t(n);
for (int i... | #include <iostream>
#include <vector>
using namespace std;
void swap(int &a, int &b) {
int dum = a;
a = b;
b = dum;
return;
}
void swap(char &a, char &b) {
char dum = a;
a = b;
b = dum;
return;
}
int main() {
int n, minj;
cin >> n;
vector<int> a(n), b(n);
vector<char> s(n), t(n);
for (int i... | [["-", 31, 16, 12, 23, 0, 41, 75, 5, 0, 6], ["+", 31, 16, 12, 23, 0, 41, 75, 5, 0, 6]] | 1 | 481 | 2 |
#include <iostream>
#include <string>
using namespace std;
struct Card {
char suit;
int value;
};
void printAry(Card src[], Card dst[], int N) {
if (src == NULL && dst == NULL) {
std::cout << "Stable" << std::endl;
return;
}
if (src == NULL || dst == NULL) {
std::cout << "Not stable" << std::en... | #include <iostream>
#include <string>
using namespace std;
struct Card {
char suit;
int value;
};
void printAry(Card src[], Card dst[], int N) {
if (src == NULL && dst == NULL) {
std::cout << "Stable" << std::endl;
return;
}
if (src == NULL || dst == NULL) {
std::cout << "Not stable" << std::en... | [["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 8, 9, 0, 1, 0, 16, 12, 343, 345, 348], ["+", 8, 9, 0, 1, 0, 16, 12, 343, 0, 349], ["+", 8, 9, 0, 1, 0, 16, 12, 343, 141, 22]] | 1 | 675 | 4 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
#define VI vector<int>
#define INF 1145141919
typed... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
#define VI vector<int>
#define INF 1145141919
typed... | [["-", 31, 16, 12, 23, 0, 41, 75, 5, 0, 6], ["+", 31, 16, 12, 23, 0, 41, 75, 5, 0, 6]] | 1 | 596 | 4 |
#include <iostream>
#include <vector>
using namespace std;
void show_vec(vector<string> &vec) {
int N = vec.size();
for (int i = 0; i < N; ++i) {
cout << vec[i];
if (i < N - 1) {
cout << " ";
}
}
cout << endl;
}
int main() {
string temp;
int N;
cin >> N;
vector<string> data1(N), dat... | #include <iostream>
#include <vector>
using namespace std;
void show_vec(vector<string> &vec) {
int N = vec.size();
for (int i = 0; i < N; ++i) {
cout << vec[i];
if (i < N - 1) {
cout << " ";
}
}
cout << endl;
}
int main() {
string temp;
int N;
cin >> N;
vector<string> data1(N), dat... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 395 | 2 |
#include <iostream>
using namespace std;
struct Card {
char suit, value;
};
void bubble(struct Card A[], int N) {
for (int i = 0; i < N; i++)
for (int j = N - 1; j >= i; j--)
if (A[j].value < A[j - 1].value)
swap(A[j], A[j - 1]);
}
void selection(struct Card A[], int N) {
for (int i = 0; i < ... | #include <iostream>
using namespace std;
struct Card {
char suit, value;
};
void bubble(struct Card A[], int N) {
for (int i = 0; i < N; i++)
for (int j = N - 1; j >= i; j--)
if (A[j].value < A[j - 1].value)
swap(A[j], A[j - 1]);
}
void selection(struct Card A[], int N) {
for (int i = 0; i < ... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 454 | 2 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int i, j, N;
ios::sync_with_stdio(false);
cin.tie(0);
cin >> N;
vector<string> data1(N), data2(N);
for (i = 0; i < N; i++) {
cin >> data1[i];
data2[i] = data1[i];
}
//バブルソート
for (i = 0; i < N; i++) {
for (j = N - 1... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int i, j, N;
ios::sync_with_stdio(false);
cin.tie(0);
cin >> N;
vector<string> data1(N), data2(N);
for (i = 0; i < N; i++) {
cin >> data1[i];
data2[i] = data1[i];
}
//バブルソート
for (i = 0; i < N; i++) {
for (j = N - 1... | [["-", 31, 16, 12, 23, 0, 41, 75, 5, 0, 6], ["+", 31, 16, 12, 23, 0, 41, 75, 5, 0, 6]] | 1 | 328 | 2 |
#include <iostream>
using namespace std;
typedef struct {
char suit;
int value;
} poker;
void bubbleSort(poker arr[], int n) {
bool flag = 1;
for (int i = 0; flag; i++) {
flag = 0;
for (int j = n - 1; j >= i + 1; j--) {
if (arr[j].value < arr[j - 1].value) {
swap(arr[j], arr[j - 1]);
... | #include <iostream>
using namespace std;
typedef struct {
char suit;
int value;
} poker;
void bubbleSort(poker arr[], int n) {
bool flag = 1;
for (int i = 0; flag; i++) {
flag = 0;
for (int j = n - 1; j >= i + 1; j--) {
if (arr[j].value < arr[j - 1].value) {
swap(arr[j], arr[j - 1]);
... | [["-", 8, 57, 64, 9, 0, 1, 0, 11, 12, 22], ["+", 8, 57, 64, 9, 0, 1, 0, 11, 12, 22]] | 1 | 597 | 2 |
#include <iostream>
struct Card {
char suit, num;
};
using namespace std;
void bubblesort(Card c[], int n);
void selectionsort(Card c[], int n);
void print(Card c[], int n);
bool isStable(Card c1[], Card c2[], int n);
int main(int argc, char const *argv[]) {
Card c1[36], c2[36];
int n;
cin >> n;
for (int i... | #include <iostream>
struct Card {
char suit, num;
};
using namespace std;
void bubblesort(Card c[], int n);
void selectionsort(Card c[], int n);
void print(Card c[], int n);
bool isStable(Card c1[], Card c2[], int n);
int main(int argc, char const *argv[]) {
Card c1[36], c2[36];
int n;
cin >> n;
for (int i... | [["-", 0, 1, 0, 11, 12, 41, 15, 16, 17, 18], ["+", 0, 1, 0, 11, 12, 41, 15, 16, 17, 19]] | 1 | 529 | 2 |
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
int j, i;
string a[100];
string b[100];
string min;
int minj;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
b[i] = a[i];
reverse(a[i].begin(), a[i].end());
}
for (i = 0; i < n; i++... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
int j, i;
string a[100];
string b[100];
string min;
int minj;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
b[i] = a[i];
reverse(a[i].begin(), a[i].end());
}
for (i = 0; i < n; i++... | [["+", 15, 339, 51, 16, 31, 69, 341, 342, 0, 70], ["+", 15, 339, 51, 16, 31, 69, 341, 342, 0, 13], ["+", 15, 339, 51, 16, 31, 69, 341, 342, 0, 73], ["+", 51, 16, 12, 69, 28, 69, 341, 342, 0, 73], ["+", 15, 339, 51, 16, 12, 69, 341, 342, 0, 70], ["+", 15, 339, 51, 16, 12, 69, 341, 342, 0, 13]] | 1 | 523 | 6 |
#include <iostream>
using namespace std;
typedef struct _Card {
char suit;
int value;
} Card;
void BubbleSort(Card A[], int N) {
for (int i = 0; i < N; i++) {
for (int j = N - 1; j >= i + 1; j--) {
if (A[j].value < A[j - 1].value) {
Card t = A[j];
A[j] = A[j - 1];
A[j - 1] = t... | #include <iostream>
using namespace std;
typedef struct _Card {
char suit;
int value;
} Card;
void BubbleSort(Card A[], int N) {
for (int i = 0; i < N; i++) {
for (int j = N - 1; j >= i + 1; j--) {
if (A[j].value < A[j - 1].value) {
Card t = A[j];
A[j] = A[j - 1];
A[j - 1] = t... | [["-", 0, 1, 0, 11, 31, 69, 341, 342, 0, 22], ["+", 0, 1, 0, 11, 31, 69, 341, 342, 0, 22], ["-", 0, 1, 0, 11, 12, 69, 341, 342, 0, 22], ["+", 0, 1, 0, 11, 12, 69, 341, 342, 0, 22], ["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46]] | 1 | 489 | 8 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s[n], t[n];
for (int i = 0; i < n; i++)
cin >> s[i], t[i] = s[i];
// buble sort
for (int i = 0; i < n; i++) {
for (int j = n - 1; j > 0; j--) {
if (t[j][1] < t[j - 1][1])
swap(t[j], t[j - 1]);
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s[n], t[n];
for (int i = 0; i < n; i++)
cin >> s[i], t[i] = s[i];
// buble sort
for (int i = 0; i < n; i++) {
for (int j = n - 1; j > 0; j--) {
if (t[j][1] < t[j - 1][1])
swap(t[j], t[j - 1]);
}
... | [["+", 15, 339, 51, 16, 31, 69, 341, 342, 0, 70], ["+", 15, 339, 51, 16, 31, 69, 341, 342, 0, 13], ["+", 15, 339, 51, 16, 31, 69, 341, 342, 0, 73], ["+", 51, 16, 12, 69, 28, 69, 341, 342, 0, 73], ["+", 15, 339, 51, 16, 12, 69, 341, 342, 0, 70], ["+", 15, 339, 51, 16, 12, 69, 341, 342, 0, 13]] | 1 | 324 | 6 |
#include <iostream>
using namespace std;
struct Card {
char c;
int v;
};
Card A[36];
void bubbleSort(Card A[], int n) {
for (int i = 0; i < n; ++i) {
for (int j = n - 1; j > i; --j) {
if (A[j - 1].v > A[j].v) {
Card t = A[j - 1];
A[j - 1] = A[j];
A[j] = t;
}
}
}
}... | #include <iostream>
using namespace std;
struct Card {
char c;
int v;
};
Card A[36];
void bubbleSort(Card A[], int n) {
for (int i = 0; i < n; ++i) {
for (int j = n - 1; j > i; --j) {
if (A[j - 1].v > A[j].v) {
Card t = A[j - 1];
A[j - 1] = A[j];
A[j] = t;
}
}
}
}... | [["+", 8, 9, 0, 57, 64, 9, 0, 37, 0, 38], ["+", 8, 9, 0, 57, 64, 9, 0, 37, 0, 35], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["+", 0, 30, 0, 14, 8, 9, 0, 37, 0, 38]] | 1 | 493 | 4 |
#include <iostream>
using namespace std;
void selection_sort(char seq[100][2], int length) {
char temp;
int mini;
for (int i = 0; i < length - 1; i++) {
mini = i;
for (int j = i + 1; j < length; j++) {
if (seq[j][1] < seq[mini][1]) {
mini = j;
}
}
if (mini != i) {
for (... | #include <iostream>
using namespace std;
void selection_sort(char seq[100][2], int length) {
char temp;
int mini;
for (int i = 0; i < length - 1; i++) {
mini = i;
for (int j = i + 1; j < length; j++) {
if (seq[j][1] < seq[mini][1]) {
mini = j;
}
}
if (mini != i) {
for (... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 147], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 146]] | 1 | 549 | 2 |
#include <iostream>
void print_list(std::string *a, int n) {
for (int i = 0; i < n - 1; i++) {
std::cout << a[i] << " ";
}
std::cout << a[n - 1] << std::endl;
}
void bubbleSort(std::string *a, int n) {
bool sorted = false;
while (!sorted) {
sorted = true;
for (int i = n - 1; i > 0; i--) {
... | #include <iostream>
void print_list(std::string *a, int n) {
for (int i = 0; i < n - 1; i++) {
std::cout << a[i] << " ";
}
std::cout << a[n - 1] << std::endl;
}
void bubbleSort(std::string *a, int n) {
bool sorted = false;
while (!sorted) {
sorted = true;
for (int i = n - 1; i > 0; i--) {
... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 509 | 2 |
#include <climits>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <string>
using namespace std;
struct card {
char suite;
int num;
};
void BubbleSort(struct card *C, int N) {
for (int i = 0; i < N; i++) {
for (int j = N - 1; j > i;... | #include <climits>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <string>
using namespace std;
struct card {
char suite;
int num;
};
void BubbleSort(struct card *C, int N) {
for (int i = 0; i < N; i++) {
for (int j = N - 1; j > i;... | [["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 1 | 603 | 1 |
#include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int n;
void input(vector<char> &, vector<int> &);
void babble(vector<char>, vector<int>, vector<char>, vector<int>);
void selection(vector<char>, vector<int>, vector<... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int n;
void input(vector<char> &, vector<int> &);
void babble(vector<char>, vector<int>, vector<char>, vector<int>);
void selection(vector<char>, vector<int>, vector<... | [["+", 0, 57, 64, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35]] | 1 | 846 | 4 |
/*
* ITP1_6_B.cpp
*
* Created on: Apr 20, 2018
* Author: 13743
*/
#include <cmath>
#include <iostream>
using namespace std;
struct card {
char suit;
int value;
};
void swap(card *a, int i, int j) {
card tmp = a[i];
a[i] = a[j];
a[j] = tmp;
}
void printCard(card *a, int n) {
cout << a[0].suit... | /*
* ITP1_6_B.cpp
*
* Created on: Apr 20, 2018
* Author: 13743
*/
#include <cmath>
#include <iostream>
using namespace std;
struct card {
char suit;
int value;
};
void swap(card *a, int i, int j) {
card tmp = a[i];
a[i] = a[j];
a[j] = tmp;
}
void printCard(card *a, int n) {
cout << a[0].suit... | [["-", 0, 7, 8, 9, 0, 7, 26, 27, 17, 29], ["+", 0, 7, 8, 9, 0, 7, 26, 27, 17, 68], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46], ["-", 0, 7, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 423 | 6 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define FI first
#define SE second
#define VE vector<int>
#define PB push_back
#define PA pair<int, int>
#define MA make_pair
#define LL long long
#define FOR(i, a, b) for (int... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define FI first
#define SE second
#define VE vector<int>
#define PB push_back
#define PA pair<int, int>
#define MA make_pair
#define LL long long
#define FOR(i, a, b) for (int... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 461 | 2 |
#include <iostream>
struct Card {
int num;
char suit;
};
void bubbleSort(Card *a, int n) {
int tmp;
for (int i = n - 1; i > 0; i--) {
for (int j = n - 1; j > n - i - 1; j--) {
if (a[j].num < a[j - 1].num) {
std::swap(a[j], a[j - 1]);
}
}
}
for (int c = 0; c < n; c++) {
i... | #include <iostream>
struct Card {
int num;
char suit;
};
void bubbleSort(Card *a, int n) {
int tmp;
for (int i = n - 1; i > 0; i--) {
for (int j = n - 1; j > n - i - 1; j--) {
if (a[j].num < a[j - 1].num) {
std::swap(a[j], a[j - 1]);
}
}
}
for (int c = 0; c < n; c++) {
i... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 560 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
struct Card {
char suit, value;
};
void bubbleSort(Card c[], int n) {
bool flag = true;
for (int i = 0; flag; i++) {
flag = false;
for (int j = n - 1; j > i; j--) {
if (c[j].value < c[j - 1].value) {
swap(c[j], c[j - 1]);
... | #include <algorithm>
#include <iostream>
using namespace std;
struct Card {
char suit, value;
};
void bubbleSort(Card c[], int n) {
bool flag = true;
for (int i = 0; flag; i++) {
flag = false;
for (int j = n - 1; j > i; j--) {
if (c[j].value < c[j - 1].value) {
swap(c[j], c[j - 1]);
... | [["-", 0, 9, 0, 1, 0, 16, 12, 5, 0, 6], ["+", 0, 9, 0, 1, 0, 16, 12, 5, 0, 6]] | 1 | 487 | 2 |
#include <iostream>
using namespace std;
struct Card {
char suit, value;
};
void bubble(struct Card A[], int N) {
for (int i = 0; i < N; i++) {
for (int j = N - 1; j >= i + 1; j--) {
if (A[j].value < A[j - 1].value) {
Card t = A[j];
A[j] = A[j - 1];
A[j - 1] = t;
}
}
... | #include <iostream>
using namespace std;
struct Card {
char suit, value;
};
void bubble(struct Card A[], int N) {
for (int i = 0; i < N; i++) {
for (int j = N - 1; j >= i + 1; j--) {
if (A[j].value < A[j - 1].value) {
Card t = A[j];
A[j] = A[j - 1];
A[j - 1] = t;
}
}
... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 498 | 2 |
#include <iostream>
using namespace std;
struct Card {
char suit;
char value;
};
void bubble(struct Card A[], int N) {
for (int i = 0; i < N; i++) {
for (int j = N - 1; j > i; j--) {
if (A[j].value < A[j - 1].value) {
Card temp = A[j];
A[j] = A[j - 1];
A[j - 1] = temp;
}
... | #include <iostream>
using namespace std;
struct Card {
char suit;
char value;
};
void bubble(struct Card A[], int N) {
for (int i = 0; i < N; i++) {
for (int j = N - 1; j > i; j--) {
if (A[j].value < A[j - 1].value) {
Card temp = A[j];
A[j] = A[j - 1];
A[j - 1] = temp;
}
... | [["-", 0, 1, 0, 16, 31, 16, 12, 118, 119, 120], ["+", 0, 1, 0, 16, 31, 16, 12, 118, 119, 120], ["-", 8, 9, 0, 1, 0, 16, 12, 118, 119, 120], ["+", 8, 9, 0, 1, 0, 16, 12, 118, 119, 120]] | 1 | 537 | 8 |
#include <bits/stdc++.h>
using namespace std;
typedef struct Card {
char suit;
int value;
} CARD;
void print(CARD C[], int N) {
for (int i = 0; i < N; i++) {
if (i)
cout << " ";
cout << C[i].suit << C[i].value;
}
cout << endl;
}
void isStable(CARD A[], CARD B[], int N) {
for (int i = 0; i ... | #include <bits/stdc++.h>
using namespace std;
typedef struct Card {
char suit;
int value;
} CARD;
void print(CARD C[], int N) {
for (int i = 0; i < N; i++) {
if (i)
cout << " ";
cout << C[i].suit << C[i].value;
}
cout << endl;
}
void isStable(CARD A[], CARD B[], int N) {
for (int i = 0; i <... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 450 | 2 |
#include <algorithm>
#include <iostream>
#include <math.h>
using namespace std;
int n, A[36], B[36];
char a[36], b[36];
string isStable() {
for (int i = 0; i < n; i++) {
if (A[i] == B[i] && a[i] == b[i])
continue;
return "Not Stable";
}
return "Stable";
}
int main() {
cin >> n;
for (int i = 0... | #include <algorithm>
#include <iostream>
#include <math.h>
using namespace std;
int n, A[36], B[36];
char a[36], b[36];
string isStable() {
for (int i = 0; i < n; i++) {
if (A[i] == B[i] && a[i] == b[i])
continue;
return "Not stable";
}
return "Stable";
}
int main() {
cin >> n;
for (int i = 0... | [["-", 0, 7, 8, 9, 0, 37, 0, 5, 0, 6], ["+", 0, 7, 8, 9, 0, 37, 0, 5, 0, 6]] | 1 | 408 | 2 |
n = int(input())
a = list(map(int, input().split()))
count = 0
for i in range(n):
mini = a.index(min(a[i:]))
if mini != i:
a[i], a[mini] = a[mini], a[i]
count += 1
print(' '.join(map(str, a)))
print(count)
| n = int(input())
a = list(map(int, input().split()))
count = 0
for i in range(n):
mini = i + a[i:].index(min(a[i:]))
if mini != i:
a[i], a[mini] = a[mini], a[i]
count += 1
print(' '.join(map(str, a)))
print(count)
| [["+", 8, 196, 0, 1, 0, 662, 12, 657, 31, 22], ["+", 8, 196, 0, 1, 0, 662, 12, 657, 17, 72], ["+", 12, 657, 12, 652, 63, 319, 500, 206, 0, 70], ["+", 12, 652, 63, 319, 500, 206, 206, 663, 0, 22], ["+", 12, 652, 63, 319, 500, 206, 206, 663, 0, 102], ["+", 12, 657, 12, 652, 63, 319, 500, 206, 0, 73]] | 5 | 98 | 6 |
def selectionsort(l,n):
c=0
for i in range(n):
minj=i
for j in range(i,n):
if int(l[i])<int(l[minj]):
minj=j
l[i],l[minj]=l[minj],l[i]
if i!=minj:
c+=1
print(" ".join(l))
print(c)
n=int(input())
l=list(input().split())
selectionsort(l,... | def selectionsort(l,n):
c=0
for i in range(n):
minj=i
for j in range(i,n):
if int(l[j])<int(l[minj]):
minj=j
l[i],l[minj]=l[minj],l[i]
if i!=minj:
c+=1
print(" ".join(l))
print(c)
n=int(input())
l=list(input().split())
selectionsort(l,... | [["-", 15, 666, 0, 652, 3, 4, 0, 206, 206, 22], ["+", 15, 666, 0, 652, 3, 4, 0, 206, 206, 22]] | 5 | 120 | 2 |
def main():
n = int(input())
a = list(map(int, input().split()))
ans = 0
for i in range(n):
tmp = i
for j in range(i, n):
if a[j] < a[tmp]:
tmp = j
a[i], a[tmp] = a[tmp], a[i]
ans += 1
print(*a)
print(ans)
if __name__ == '__main__':... | def main():
n = int(input())
a = list(map(int, input().split()))
ans = 0
for i in range(n):
tmp = i
for j in range(i, n):
if a[j] < a[tmp]:
tmp = j
if i != tmp:
a[i], a[tmp] = a[tmp], a[i]
ans += 1
print(*a)
print(ans)... | [["+", 8, 196, 0, 7, 8, 196, 0, 57, 0, 121], ["+", 0, 7, 8, 196, 0, 57, 15, 666, 0, 22], ["+", 0, 7, 8, 196, 0, 57, 15, 666, 667, 79], ["+", 8, 196, 0, 7, 8, 196, 0, 57, 0, 102]] | 5 | 109 | 5 |
N = int(input())
num_list = list(map(int, input().split()))
c = 0
flag =0
for i in range(0,N,1):
minj =i
for j in range(i,N,1):
if num_list[j] < num_list[minj]:
minj = j
flag = 1
c += flag
num_list[i], num_list[minj] = num_list[minj], num_list[i]
print(" ".join(map(str,nu... | N = int(input())
num_list = list(map(int, input().split()))
c = 0
for i in range(0,N,1):
flag =0
minj =i
for j in range(i,N,1):
if num_list[j] < num_list[minj]:
minj = j
flag = 1
c += flag
num_list[i], num_list[minj] = num_list[minj], num_list[i]
print(" ".join(map(s... | [["-", 36, 36, 0, 656, 0, 1, 0, 662, 31, 22], ["-", 36, 36, 0, 656, 0, 1, 0, 662, 0, 32], ["-", 36, 36, 0, 656, 0, 1, 0, 662, 12, 612], ["+", 0, 7, 8, 196, 0, 1, 0, 662, 31, 22], ["+", 0, 7, 8, 196, 0, 1, 0, 662, 0, 32], ["+", 0, 7, 8, 196, 0, 1, 0, 662, 12, 612]] | 5 | 117 | 6 |
import sys
lines = sys.stdin.readlines()
N = lines[0]
A = lines[1].strip().split(" ")
count = 0
for i in range(len(A)):
minj = i
for j in range(i, len(A)):
if A[j] < A[minj]:
minj = j
if i != minj:
a = A[i]
b = A[minj]
A[i] = b
A[minj] = a
count... | import sys
lines = sys.stdin.readlines()
N = lines[0]
A = lines[1].strip().split(" ")
count = 0
for i in range(len(A)):
minj = i
for j in range(i, len(A)):
if int(A[j]) < int(A[minj]):
minj = j
if i != minj:
a = A[i]
b = A[minj]
A[i] = b
A[minj] = a
... | [["+", 8, 196, 0, 57, 15, 666, 0, 652, 63, 22], ["+", 0, 57, 15, 666, 0, 652, 3, 4, 0, 24], ["+", 0, 57, 15, 666, 0, 652, 3, 4, 0, 25]] | 5 | 125 | 6 |
def selectionSort(A, N):
count = 0
for i in range(0,N):
minj = i
for j in range(i,N):
if A[j] < A[minj]:
minj = j
if minj != i:
tmp = A[i]
A[i] = A[minj]
A[minj] = tmp
count += 1
return A, co... | def selectionSort(A, N):
count = 0
for i in range(0,N):
minj = i
for j in range(i,N):
if A[j] < A[minj]:
minj = j
if minj != i:
tmp = A[i]
A[i] = A[minj]
A[minj] = tmp
count += 1
return A, co... | [["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 22], ["+", 8, 196, 0, 1, 0, 652, 3, 4, 0, 22]] | 5 | 153 | 2 |
def show_list(a):
for x in a:
print(x, end=' ')
print()
def selection_sort(a,n):
count=0
for i in range(n):
minj = i
for j in range(i,n):
if a[j]<a[minj]:
minj = j
if minj==i:
tmp = a[i]
a[i]=a[minj]
a[min... | def show_list(a):
for x in a:
print(x, end=' ')
print()
def selection_sort(a,n):
count=0
for i in range(n):
minj = i
for j in range(i,n):
if a[j]<a[minj]:
minj = j
if minj!=i:
tmp = a[i]
a[i]=a[minj]
a[min... | [["-", 0, 7, 8, 196, 0, 57, 15, 666, 667, 60], ["+", 0, 7, 8, 196, 0, 57, 15, 666, 667, 79]] | 5 | 153 | 2 |
# -*- coding: utf-8 -*-
def selection_sort(A, N):
change = 0
for i in range(N):
minj = i
for j in range(i, N, 1):
if A[j] < A[minj]:
minj = j
temp = A[minj]
A[minj] = A[i]
A[i] = temp
change += 1
return (A, change)
if __name__ =... | # -*- coding: utf-8 -*-
def selection_sort(A, N):
change = 0
for i in range(N):
minj = i
for j in range(i, N, 1):
if A[j] < A[minj]:
minj = j
if minj != i:
temp = A[minj]
A[minj] = A[i]
A[i] = temp
change += 1
... | [["+", 8, 196, 0, 7, 8, 196, 0, 57, 0, 121], ["+", 0, 7, 8, 196, 0, 57, 15, 666, 0, 22], ["+", 0, 7, 8, 196, 0, 57, 15, 666, 667, 79], ["+", 8, 196, 0, 7, 8, 196, 0, 57, 0, 102]] | 5 | 141 | 5 |
n = int(input())
A = input().split(' ')
count = 0
for i in range(0, n):
minj = i
for j in range(i, n):
if int(A[j]) < int(A[minj]):
minj = j
(A[i], A[minj]) = (A[minj], A[i])
count += 1
print(" ".join(A))
print(count) | n = int(input())
A = input().split(' ')
count = 0
for i in range(0, n):
minj = i
for j in range(i, n):
if int(A[j]) < int(A[minj]):
minj = j
if i != minj:
(A[i], A[minj]) = (A[minj], A[i])
count += 1
print(" ".join(A))
print(count) | [["+", 0, 656, 0, 7, 8, 196, 0, 57, 0, 121], ["+", 0, 7, 8, 196, 0, 57, 15, 666, 0, 22], ["+", 0, 7, 8, 196, 0, 57, 15, 666, 667, 79], ["+", 0, 656, 0, 7, 8, 196, 0, 57, 0, 102]] | 5 | 107 | 5 |
n = int(input())
li = list(map(int, input().split()))
cnt = 0
for i in range(n):
minj = i
for j in range(i, n):
if li[j] < li[minj]:
minj = j
if li[i] != li[minj]:
li[i], li[minj] = li[minj], li[i]
cnt += 1
print(li)
print(cnt) | n = int(input())
li = list(map(int, input().split()))
cnt = 0
for i in range(n):
minj = i
for j in range(i, n):
if li[j] < li[minj]:
minj = j
if li[i] != li[minj]:
li[i], li[minj] = li[minj], li[i]
cnt += 1
print(*li)
print(cnt) | [["+", 0, 1, 0, 652, 3, 4, 0, 661, 0, 48]] | 5 | 104 | 1 |
n = int(input())
A = list(map(int,input().split()))
c = 0
for i in range(n):
minj = i
for j in range(i,n):
if A[j] < A[minj]:
minj = j
t = A[i]
A[i] = A[minj]
A[minj] = t
c += 1
print(" ".join(map(str,A)))
print(c) | n = int(input())
A = list(map(int,input().split()))
c = 0
for i in range(n):
minj = i
for j in range(i,n):
if A[j] < A[minj]:
minj = j
if minj != i:
t = A[i]
A[i] = A[minj]
A[minj] = t
c += 1
print(" ".join(map(str,A)))
print(c) | [["+", 0, 656, 0, 7, 8, 196, 0, 57, 0, 121], ["+", 0, 7, 8, 196, 0, 57, 15, 666, 0, 22], ["+", 0, 7, 8, 196, 0, 57, 15, 666, 667, 79], ["+", 0, 656, 0, 7, 8, 196, 0, 57, 0, 102]] | 5 | 107 | 5 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.