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 <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define Size 9
#define Queue_size 1024
#define Hash_size 1024
#define queue_next(i) (((i) + 1) % Queue_size)
struct hash_table {
long data;
struct hash_table *next;
};
struct hash_table *hash[Hash_size];
int swap_upper(int *, int *);
int s... | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define Size 9
#define Queue_size 102400
#define Hash_size 102400
#define queue_next(i) (((i) + 1) % Queue_size)
struct hash_table {
long data;
struct hash_table *next;
};
struct hash_table *hash[Hash_size];
int swap_upper(int *, int *);
i... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59]] | 0 | 1,322 | 4 |
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
using namespace std;
#define N 3
#define N2 9
struct Puzzle {
int f[N2];
int space;
string path;
bool operator<(const Puzzle &p) const {
for (int i = 0; i < N2; i++) {
if (f[i] == p.f[i])
continue;
r... | #include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
using namespace std;
#define N 3
#define N2 9
struct Puzzle {
int f[N2]; //??????????????????????????°???
int space; // 0?????\??£???????????????
string path; //???????????§?????????????????????
bool operator<(const Puz... | [["-", 0, 69, 341, 342, 0, 16, 31, 16, 17, 72], ["+", 0, 69, 341, 342, 0, 16, 31, 16, 17, 48]] | 1 | 521 | 2 |
#include <algorithm>
#include <cstring>
#include <iostream>
#include <queue>
#include <set>
using namespace std;
set<long long> s;
int map1[10][10];
int k[10];
int t;
queue<long long> x, y;
void input() {
int g = 0;
for (int i = 0; i < 3; ++i) {
for (int j = 0; j < 3; ++j) {
cin >> map1[i][j];
g = g... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <queue>
#include <set>
using namespace std;
set<long long> s;
int map1[10][10];
int k[10];
int t;
queue<long long> x, y;
void input() {
int g = 0;
for (int i = 0; i < 3; ++i) {
for (int j = 0; j < 3; ++j) {
cin >> map1[i][j];
g = g... | [["+", 64, 9, 0, 1, 0, 11, 31, 69, 28, 22], ["+", 0, 1, 0, 11, 31, 69, 341, 342, 0, 70], ["+", 0, 1, 0, 11, 31, 69, 341, 342, 0, 73], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 12, 13]] | 1 | 836 | 5 |
#include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#define N 3
#define N2 9
using namespace std;
struct Puzzle {
int f[N2];
int space;
string path;
bool operator<(const Puzzle &p) const {
for (int i = 0; i < N2; ++i) {
if (f[i] == p.f[i])
continue;
return f[i] < p.f... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#define N 3
#define N2 9
using namespace std;
struct Puzzle {
int f[N2];
int space;
string path;
bool operator<(const Puzzle &p) const {
for (int i = 0; i < N2; ++i) {
if (f[i] == p.f[i])
continue;
return f[i] < p.f... | [["-", 0, 57, 64, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 12, 13]] | 1 | 519 | 2 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <string>
using namespace std;
#define N 3
#define N2 9
const int dx[4]{-1, 0, 1, 0};
const int dy[4]{0, -1, 0, 1};
const char dir[4]{'u', 'l', 'd', 'r'};
struct Puzzle {
int f[N2], space;
string path;
bool oper... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <string>
using namespace std;
#define N 3
#define N2 9
const int dx[4]{-1, 0, 1, 0};
const int dy[4]{0, -1, 0, 1};
const char dir[4]{'u', 'l', 'd', 'r'};
struct Puzzle {
int f[N2], space;
string path;
bool oper... | [["-", 0, 57, 15, 339, 51, 16, 12, 16, 31, 22], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 31, 22]] | 1 | 518 | 2 |
#include <cassert>
#include <iostream>
using namespace std;
const long N = 8;
const long FREE = -1;
const long NOT_FREE = 1;
long row[N], col[N], dpos[2 * N - 1], dneg[2 * N - 1];
bool X[N][N];
void initialize() {
for (long i = 0; i < N; i++) {
row[i] = FREE;
col[i] = FREE;
}
for (long i = 0; i < 2 * N... | #include <cassert>
#include <iostream>
using namespace std;
const long N = 8;
const long FREE = -1;
const long NOT_FREE = 1;
long row[N], col[N], dpos[2 * N - 1], dneg[2 * N - 1];
bool X[N][N];
void initialize() {
for (long i = 0; i < N; i++) {
row[i] = FREE;
col[i] = FREE;
}
for (long i = 0; i < 2 * N... | [["-", 12, 23, 0, 41, 15, 23, 0, 42, 0, 32], ["+", 12, 23, 0, 41, 15, 23, 0, 16, 17, 60]] | 1 | 494 | 2 |
#include <iostream>
using namespace std;
const int MAXN = 10;
int map[MAXN][MAXN], jilu[100][MAXN][MAXN];
int lie[10], zuoxie[20], youxie[20];
int v[100], q[100];
int tot = 0;
void wwq() {
for (int i = 0; i < 8; i++) {
for (int j = 0; j < 8; j++)
jilu[tot][i][j] = map[i][j];
}
tot++;
}
void dfs(int i) {... | #include <iostream>
using namespace std;
const int MAXN = 10;
int map[MAXN][MAXN], jilu[100][MAXN][MAXN];
int lie[10], zuoxie[20], youxie[20];
int v[100], q[100];
int tot = 0;
void wwq() {
for (int i = 0; i < 8; i++) {
for (int j = 0; j < 8; j++)
jilu[tot][i][j] = map[i][j];
}
tot++;
}
void dfs(int i) {... | [["-", 0, 57, 64, 1, 0, 16, 12, 5, 0, 6], ["+", 0, 57, 64, 1, 0, 16, 12, 5, 0, 6]] | 1 | 457 | 2 |
#include <cstdlib>
#include <iostream>
#include <stdio.h>
#include <string.h>
namespace {
const int N = 8;
// the positions of k-queens are fixed.
// Once initialized, the values remain unchanged.
bool row[N] = {false};
bool col[N] = {false};
bool down[2 * N - 1] = {false};
bool up[2 * N - 1] = {false};
int pos[N];
... | #include <cstdlib>
#include <iostream>
#include <stdio.h>
#include <string.h>
namespace {
const int N = 8;
// the positions of k-queens are fixed.
// Once initialized, the values remain unchanged.
bool row[N] = {false};
bool col[N] = {false};
bool down[2 * N - 1] = {false};
bool up[2 * N - 1] = {false};
int pos[N];
... | [["+", 0, 57, 64, 37, 0, 41, 15, 16, 31, 22], ["+", 0, 57, 64, 37, 0, 41, 15, 16, 17, 18], ["+", 0, 57, 64, 37, 0, 41, 15, 16, 12, 13], ["+", 8, 9, 0, 57, 64, 37, 0, 41, 0, 101], ["+", 8, 9, 0, 57, 64, 37, 0, 41, 0, 102], ["+", 8, 9, 0, 57, 64, 37, 0, 41, 75, 146]] | 1 | 487 | 6 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int inf = 1000000000;
int dx[8] = {0, 1, 1, 1, 0, -1, -1, -1};
int dy[8] = {1, 1, 0, -1, -1, -1, 0, 1};
vector<vector<int>> ans;
vector<vector<int>> check(vector<vector<... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int inf = 1000000000;
int dx[8] = {0, 1, 1, 1, 0, -1, -1, -1};
int dy[8] = {1, 1, 0, -1, -1, -1, 0, 1};
vector<vector<int>> ans;
vector<vector<int>> check(vector<vector<... | [["-", 8, 9, 0, 57, 64, 1, 0, 16, 31, 22], ["+", 8, 9, 0, 57, 64, 1, 0, 16, 31, 22], ["-", 75, 76, 0, 57, 64, 1, 0, 16, 31, 22], ["+", 75, 76, 0, 57, 64, 1, 0, 16, 31, 22], ["-", 0, 57, 75, 76, 0, 1, 0, 16, 31, 22], ["+", 0, 57, 75, 76, 0, 1, 0, 16, 31, 22], ["-", 0, 7, 8, 9, 0, 1, 0, 16, 31, 22], ["+", 0, 7, 8, 9, 0, ... | 1 | 546 | 8 |
// ALDS1_13_A.cpp
// Heuristic Search - 8 Queens Problem
#include <cstdio>
#include <iostream>
#include <stack>
#include <vector>
using namespace std;
const int N = 8;
vector<int> row(N);
vector<int> col(N);
vector<int> md(2 * N - 1); // main diagonal
vector<int> ad(2 * N - 1); // anti-diagnoal
vector<int> res(N);
// v... | // ALDS1_13_A.cpp
// Heuristic Search - 8 Queens Problem
#include <cstdio>
#include <iostream>
#include <stack>
#include <vector>
using namespace std;
const int N = 8;
vector<int> row(N);
vector<int> col(N);
vector<int> md(2 * N - 1); // main diagonal
vector<int> ad(2 * N - 1); // anti-diagnoal
vector<int> res(N);
// v... | [["+", 0, 52, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 57, 64, 9, 0, 116, 0, 117], ["+", 0, 52, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 439 | 4 |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#pragma warning(disable : 4996)
using namespace std;
vector<int> dat;
vector<int> tmp;
int doubles, lengths;
bool compare_suffix(int i, int j) {
if (dat[i] == dat[j]) {
int ri = (i + doubles <= lengths ? dat[i + doubles] : -1);
... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#pragma warning(disable : 4996)
using namespace std;
vector<int> dat;
vector<int> tmp;
int doubles, lengths;
bool compare_suffix(int i, int j) {
if (dat[i] == dat[j]) {
int ri = (i + doubles <= lengths ? dat[i + doubles] : -1);
... | [["+", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 560 | 4 |
#include <algorithm>
#include <functional>
#include <iostream>
#include <string>
using namespace std;
#define MAX_N 1100000
int Rank[MAX_N], x[MAX_N];
int SA[MAX_N];
string S, T;
int V;
bool Compare(int p, int q) {
if (Rank[p] < Rank[q])
return true;
if (Rank[p] > Rank[q])
return false;
int D1 = -1, D2 = ... | #include <algorithm>
#include <functional>
#include <iostream>
#include <string>
using namespace std;
#define MAX_N 1100000
int Rank[MAX_N], x[MAX_N];
int SA[MAX_N];
string S, T;
int V;
bool Compare(int p, int q) {
if (Rank[p] < Rank[q])
return true;
if (Rank[p] > Rank[q])
return false;
int D1 = -1, D2 = ... | [["+", 0, 14, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 17, 107], ["+", 8, 9, 0, 1, 0, 11, 12, 103, 0, 104], ["+", 8, 9, 0, 1, 0, 11, 12, 103, 0, 125], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 563 | 6 |
#include <bits/stdc++.h>
using namespace std;
int Rank[1000005];
int Tmp[1000005];
int kc, len;
bool compare_sa(int i, int j) {
return Rank[i] == Rank[j] ? Rank[i] < Rank[j]
: (i + kc <= len ? Rank[i + kc] : -1) <
(j + kc <= len ? Rank[j + kc] : -1);
}
... | #include <bits/stdc++.h>
using namespace std;
int Rank[1000005];
int Tmp[1000005];
int kc, len;
bool compare_sa(int i, int j) {
return Rank[i] != Rank[j] ? Rank[i] < Rank[j]
: (i + kc <= len ? Rank[i + kc] : -1) <
(j + kc <= len ? Rank[j + kc] : -1);
}
... | [["-", 8, 9, 0, 37, 0, 41, 15, 16, 17, 60], ["+", 8, 9, 0, 37, 0, 41, 15, 16, 17, 79]] | 1 | 435 | 2 |
#include <algorithm>
#include <iostream>
#include <string.h>
using namespace std;
char str[1000001];
int k, len;
int sa[1000001], Rank[1000001], temp[1000001];
bool compare_sa(int i, int j) {
if (Rank[i] == Rank[j]) {
int t1 = -1, t2 = -1;
if (i + k <= len) {
t1 = Rank[i + k];
}
if (j + k <= ... | #include <algorithm>
#include <iostream>
#include <string.h>
using namespace std;
char str[1000001];
int k, len;
int sa[1000001], Rank[1000001], temp[1000001];
bool compare_sa(int i, int j) {
if (Rank[i] == Rank[j]) {
int t1 = -1, t2 = -1;
if (i + k <= len) {
t1 = Rank[i + k];
}
if (j + k <= ... | [["-", 3, 4, 0, 16, 12, 69, 341, 342, 0, 22], ["+", 3, 4, 0, 16, 12, 69, 341, 342, 0, 22]] | 1 | 451 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
// BEGIN CUT HERE
struct SuffixArray {
int n, k;
string S;
vector<int> sa, lcp;
SuffixArray() {}
SuffixArray(string S) : S(S) { init(); }
void init() {
n = S.length();
build_sa();
// build_lcp();
// build_rmq();
}
void b... | #include <bits/stdc++.h>
using namespace std;
#define int long long
// BEGIN CUT HERE
struct SuffixArray {
int n, k;
string S;
vector<int> sa, lcp;
SuffixArray() {}
SuffixArray(string S) : S(S) { init(); }
void init() {
n = S.length();
build_sa();
// build_lcp();
// build_rmq();
}
void b... | [["-", 8, 123, 0, 14, 8, 9, 0, 37, 0, 38], ["-", 8, 123, 0, 14, 8, 9, 0, 37, 0, 35], ["-", 0, 2, 3, 4, 0, 2, 63, 118, 28, 22], ["+", 0, 2, 3, 4, 0, 2, 63, 118, 28, 22], ["-", 0, 43, 49, 50, 51, 16, 31, 69, 28, 22], ["+", 0, 43, 49, 50, 51, 16, 31, 69, 28, 22]] | 1 | 2,144 | 6 |
#include <stdio.h>
#include <stdlib.h>
typedef struct weight_ {
int Num;
int Wei;
double OneNum;
int flg;
} wgt;
void disp(int n, wgt *X) {
int i;
for (i = 0; i < n; i++) {
if (i % n == 0)
printf("\n");
}
printf("\n");
}
void swap(wgt *X, wgt *Y) {
wgt wk;
wk = *X;
*X = *Y;
*Y = wk;... | #include <stdio.h>
#include <stdlib.h>
typedef struct weight_ {
int Num;
int Wei;
double OneNum;
int flg;
} wgt;
void disp(int n, wgt *X) {
int i;
for (i = 0; i < n; i++) {
if (i % n == 0)
printf("\n");
}
printf("\n");
}
void swap(wgt *X, wgt *Y) {
wgt wk;
wk = *X;
*X = *Y;
*Y = wk;... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 0 | 454 | 2 |
#include <bits/stdc++.h>
using namespace std;
using Int = long long;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
// INSERT ABOVE HERE
signed main() {
int n;
cin >> n;
... | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
// INSERT ABOVE HERE
signed main() {
int n;
cin >> n;
... | [["-", 8, 57, 15, 339, 51, 16, 12, 118, 119, 120], ["+", 8, 57, 15, 339, 51, 16, 12, 118, 119, 120], ["-", 64, 1, 0, 34, 31, 11, 12, 118, 119, 120], ["+", 64, 1, 0, 34, 31, 11, 12, 118, 119, 120]] | 1 | 197 | 4 |
var input = require('fs').readFileSync('/dev/stdin', 'utf8').trim().split('\n');
var n = parseInt(input.shift(), 10);
var nums = input.split(' ').map(Number);
for (var i = 0; i < nums.length; i += 1) {
var v = nums[i];
var j = i - 1;
while (j >= 0 && nums[j] > v) {
nums[j + 1] = nums[j];
j -= 1;
}
nu... | var input = require('fs').readFileSync('/dev/stdin', 'utf8').trim().split('\n');
var n = parseInt(input.shift(), 10);
var nums = input.shift().split(' ').map(Number);
for (var i = 0; i < nums.length; i += 1) {
var v = nums[i];
var j = i - 1;
while (j >= 0 && nums[j] > v) {
nums[j + 1] = nums[j];
j -= 1;
... | [["+", 500, 2, 63, 558, 500, 2, 63, 558, 559, 560], ["+", 500, 2, 63, 558, 500, 2, 3, 3, 0, 24], ["+", 500, 2, 63, 558, 500, 2, 3, 3, 0, 25], ["+", 51, 2, 63, 558, 500, 2, 63, 558, 0, 131]] | 2 | 151 | 4 |
<?php
fscanf(STDIN, '%d', $N);
$line = trim(fgets(STDIN));
$arr = explode(' ', $line);
echo implode(' ', $arr), PHP_EOL;
for($i=1;$i<$n;$i++){
$v=$arr[$i];
$j=$i-1;
while($j>=0 && $arr[$j]>$v){
// v($j);
$arr[$j+1]=$arr[$j];
$j--;
$arr[$j+1]=$v;
}
echo implode(' ', $arr), PHP_EOL;
}
| <?php
fscanf(STDIN, '%d', $n);
$line = trim(fgets(STDIN));
$arr = explode(' ', $line);
echo implode(' ', $arr), PHP_EOL;
for($i=1;$i<$n;$i++){
$v=$arr[$i];
$j=$i-1;
while($j>=0 && $arr[$j]>$v){
// v($j);
$arr[$j+1]=$arr[$j];
$j--;
$arr[$j+1]=$v;
}
echo implode(' ', $arr), PHP_EOL;
}
| [["-", 0, 613, 3, 3, 0, 28, 0, 606, 0, 141], ["+", 0, 613, 3, 3, 0, 28, 0, 606, 0, 141]] | 6 | 152 | 24 |
import java.util.*;
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();
}
for (int l = 0; l < total; l++) {
if... | import java.util.*;
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();
}
for (int l = 0; l < total; l++) {
if... | [["-", 0, 195, 8, 196, 0, 7, 8, 196, 0, 46], ["+", 0, 195, 8, 196, 0, 7, 8, 196, 0, 46]] | 3 | 299 | 2 |
import java.util.Scanner;
public class Main {
public static void main(String args[]) {
Scanner in = new Scanner(System.in);
int length = in.nextInt();
int array[] = new int[length];
for (int i = 0; i < length; i++) {
array[i] = in.nextInt();
}
print(array);
for (int i = 1; i < ... |
import java.util.Scanner;
public class Main {
public static void main(String args[]) {
Scanner in = new Scanner(System.in);
int length = in.nextInt();
int array[] = new int[length];
for (int i = 0; i < length; i++) {
array[i] = in.nextInt();
}
print(array);
for (int i = 1; i < ... | [["-", 0, 195, 8, 196, 0, 1, 0, 492, 141, 22], ["+", 0, 195, 8, 196, 0, 1, 0, 492, 141, 22]] | 3 | 243 | 2 |
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
// Get numbers
int n = input.nextInt();
int[] nums = new int[n];
// fill array
for (int i = 0; i < n; i++) {
nums[i] = input.nextInt();... | import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
// Get numbers
int n = input.nextInt();
int[] nums = new int[n];
// fill array
for (int i = 0; i < n; i++) {
nums[i] = input.nextInt();... | [["+", 0, 492, 3, 4, 0, 16, 31, 504, 516, 22], ["+", 0, 492, 3, 4, 0, 16, 31, 504, 0, 70], ["+", 0, 492, 3, 4, 0, 16, 31, 504, 0, 73]] | 3 | 263 | 3 |
import java.util.Arrays;
import java.util.Scanner;
import java.util.stream.Stream;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int count = Integer.parseInt(sc.nextLine());
int[] nums = Stream.of(sc.nextLine().split(" "))
.mapToI... | import java.util.Arrays;
import java.util.Scanner;
import java.util.stream.Stream;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int count = Integer.parseInt(sc.nextLine());
int[] nums = Stream.of(sc.nextLine().split(" "))
.mapToI... | [["-", 3, 4, 0, 492, 3, 4, 0, 5, 0, 491], ["+", 3, 4, 0, 492, 3, 4, 0, 5, 0, 491]] | 3 | 250 | 4 |
import java.util.*;
class Main {
public static void main(String[] args) {
Scanner stdIn = new Scanner(System.in);
int n = stdIn.nextInt();
int[] ary = new int[n];
for (int i = 0; i < n; i++) {
ary[i] = stdIn.nextInt();
}
for (int i = 1; i < ary.length; i++) {
int key = ary[i];
... | import java.util.*;
class Main {
public static void main(String[] args) {
Scanner stdIn = new Scanner(System.in);
int n = stdIn.nextInt();
int[] ary = new int[n];
for (int i = 0; i < n; i++) {
ary[i] = stdIn.nextInt();
}
output(ary);
for (int i = 1; i < ary.length; i++) {
int ... | [["+", 0, 195, 8, 196, 0, 1, 0, 492, 141, 22], ["+", 8, 196, 0, 1, 0, 492, 3, 4, 0, 24], ["+", 8, 196, 0, 1, 0, 492, 3, 4, 0, 22], ["+", 8, 196, 0, 1, 0, 492, 3, 4, 0, 25], ["+", 8, 498, 0, 195, 8, 196, 0, 1, 0, 35]] | 3 | 229 | 5 |
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
// input data
List<String> input = inputLines();
// get input
int length = Integer.valueOf(input.get(0));
String[] numbersString = i... | import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
// input data
List<String> input = inputLines();
// get input
int length = Integer.valueOf(input.get(0));
String[] numbersString = i... | [["+", 0, 195, 8, 196, 0, 1, 0, 492, 141, 22], ["+", 8, 196, 0, 1, 0, 492, 3, 4, 0, 24], ["+", 8, 196, 0, 1, 0, 492, 3, 4, 0, 22], ["+", 8, 196, 0, 1, 0, 492, 3, 4, 0, 25], ["+", 8, 498, 0, 195, 8, 196, 0, 1, 0, 35]] | 3 | 367 | 5 |
import java.util.Scanner;
public class Main {
public static void trace(int n, int[] A) {
for (int i = 0; i < n; i++) {
if (i > 0)
System.out.print(" ");
System.out.print(A[i]);
}
System.out.println("\n");
}
public static void main(String[] args) {
int n;
int[] A;
Scan... | import java.util.Scanner;
public class Main {
public static void trace(int n, int[] A) {
for (int i = 0; i < n; i++) {
if (i > 0)
System.out.print(" ");
System.out.print(A[i]);
}
System.out.print("\n");
}
public static void main(String[] args) {
int n;
int[] A;
Scanne... | [["-", 0, 195, 8, 196, 0, 1, 0, 492, 141, 22], ["+", 0, 195, 8, 196, 0, 1, 0, 492, 141, 22]] | 3 | 240 | 2 |
import java.io.BufferedReader;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args) throws Exception {
// TODO ?????????????????????????????????????????????
BufferedReader breader = getReader();
int n = getInt(breader);
int[] ary = getAry(breader);
for (i... | import java.io.BufferedReader;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args) throws Exception {
// TODO ?????????????????????????????????????????????
BufferedReader breader = getReader();
int n = getInt(breader);
int[] ary = getAry(breader);
putAry... | [["+", 0, 195, 8, 196, 0, 1, 0, 492, 141, 22], ["+", 8, 196, 0, 1, 0, 492, 3, 4, 0, 24], ["+", 8, 196, 0, 1, 0, 492, 3, 4, 0, 22], ["+", 8, 196, 0, 1, 0, 492, 3, 4, 0, 25], ["+", 8, 498, 0, 195, 8, 196, 0, 1, 0, 35]] | 3 | 349 | 5 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
// input elements
int n = Integer.parseInt(scan.nextLine());
String[] inputs = scan.nextLine().split(" ");
int[] cards = new int[n];
for (int i = 0; i < n; i++) {
... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
// input elements
int n = Integer.parseInt(scan.nextLine());
String[] inputs = scan.nextLine().split(" ");
int[] cards = new int[n];
for (int i = 0; i < n; i++) {
... | [["+", 0, 195, 8, 196, 0, 1, 0, 492, 141, 22], ["+", 8, 196, 0, 1, 0, 492, 3, 4, 0, 24], ["+", 8, 196, 0, 1, 0, 492, 3, 4, 0, 22], ["+", 8, 196, 0, 1, 0, 492, 3, 4, 0, 25], ["+", 8, 498, 0, 195, 8, 196, 0, 1, 0, 35]] | 3 | 250 | 5 |
import java.util.*;
public class Main {
public static void sort(int[] a, int i) {
int key = a[i];
int j = i - 1;
while (j >= 0 && a[j] > key) {
a[j + 1] = a[j];
j--;
}
a[j + 1] = key;
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = s... | import java.util.Scanner;
public class Main {
public static void sort(int[] a, int i) {
int key = a[i];
int j = i - 1;
while (j >= 0 && a[j] > key) {
a[j + 1] = a[j];
j--;
}
a[j + 1] = key;
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int... | [["-", 36, 36, 0, 493, 0, 454, 0, 525, 0, 48], ["+", 36, 36, 0, 493, 0, 454, 0, 522, 141, 22], ["-", 8, 196, 0, 7, 502, 503, 49, 200, 51, 499], ["+", 8, 196, 0, 7, 502, 503, 49, 200, 51, 499]] | 3 | 223 | 4 |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args)
throws NumberFormatException, IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int N = Integer.parseInt(br.read... | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args)
throws NumberFormatException, IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int N = Integer.parseInt(br.read... | [["-", 8, 196, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 196, 0, 7, 15, 16, 12, 16, 12, 499]] | 3 | 317 | 2 |
import java.io.BufferedReader;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args) throws Exception {
BufferedReader r = new BufferedReader(new InputStreamReader(System.in));
int N = readInt(r);
String[] numStrings = r.readLine().split(" ");
int[] A = new int[... | import java.io.BufferedReader;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args) throws Exception {
BufferedReader r = new BufferedReader(new InputStreamReader(System.in));
int N = readInt(r);
String[] numStrings = r.readLine().split(" ");
int[] A = new int[... | [["-", 0, 195, 8, 196, 0, 7, 15, 16, 17, 18], ["+", 0, 195, 8, 196, 0, 7, 15, 16, 17, 19], ["+", 8, 196, 0, 7, 15, 16, 12, 23, 0, 24], ["+", 8, 196, 0, 7, 15, 16, 12, 23, 0, 25]] | 3 | 335 | 4 |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(br.readLine());
int[] array = new... | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(br.readLine());
int[] array = ne... | [["-", 0, 7, 15, 16, 12, 16, 31, 509, 500, 22], ["-", 0, 7, 15, 16, 12, 16, 31, 509, 0, 131], ["-", 0, 7, 15, 16, 12, 16, 31, 509, 119, 22], ["-", 8, 196, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 196, 0, 7, 15, 16, 12, 16, 12, 499], ["+", 0, 195, 8, 196, 0, 7, 15, 16, 12, 22], ["-", 8, 196, 0, 503, 49, 200, 51, 504, 71,... | 3 | 310 | 8 |
import java.util.*;
class Main {
public static void main(String args[]) {
int n;
int i, j;
int v;
Scanner scan = new Scanner(System.in);
String str = new String();
n = scan.nextInt();
int A[] = new int[n];
for (i = 0; i < n; i++)
A[i] = scan.nextInt();
for (i = 0; i < n;... | import java.util.*;
class Main {
public static void main(String args[]) {
int n;
int i, j;
int v;
Scanner scan = new Scanner(System.in);
String str = new String();
n = scan.nextInt();
int A[] = new int[n];
for (i = 0; i < n; i++)
A[i] = scan.nextInt();
for (i = 0; i < n;... | [["-", 0, 11, 12, 492, 3, 4, 0, 5, 0, 491], ["+", 0, 11, 12, 492, 3, 4, 0, 5, 0, 491]] | 3 | 200 | 2 |
import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int length = sc.nextInt();
int[] array = new int[length];
for (int i = 0; i < length; i++) {
array[i] = sc.nextInt();
}
for (int i = 0; i < length; i++) {
for (in... | import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int length = sc.nextInt();
int[] array = new int[length];
for (int i = 0; i < length; i++) {
array[i] = sc.nextInt();
}
for (int i = 0; i < length; i++) {
for (in... | [["-", 0, 57, 64, 196, 0, 1, 0, 492, 141, 22], ["+", 0, 57, 64, 196, 0, 1, 0, 492, 141, 22]] | 3 | 231 | 2 |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args)
throws NumberFormatException, IOException {
// TODO ?????????????????????????????????????????????
BufferedReader br = new BufferedReader(new InputStre... | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args)
throws NumberFormatException, IOException {
// TODO ?????????????????????????????????????????????
BufferedReader br = new BufferedReader(new InputStre... | [["-", 8, 196, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 196, 0, 7, 15, 16, 12, 16, 12, 499]] | 3 | 330 | 2 |
import java.util.*;
class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = Integer.parseInt(sc.nextLine());
String[] line = sc.nextLine().split(" ");
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = Integer.parseInt(line[i]);
}
f... | import java.util.*;
class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = Integer.parseInt(sc.nextLine());
String[] line = sc.nextLine().split(" ");
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = Integer.parseInt(line[i]);
}
f... | [["-", 8, 196, 0, 7, 502, 503, 49, 200, 51, 499], ["+", 8, 196, 0, 7, 502, 503, 49, 200, 51, 499]] | 3 | 226 | 2 |
#include <stdio.h>
int main() {
int A[100], N, i, j, key;
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
for (i = 1; i < N; i++) {
key = A[i];
j = i - 1;
while (j >= 0 && A[j] > key) {
A[j + 1] = A[j];
j--;
A[j + 1] = key;
}
for (j = 0; j < N; j++) {... | #include <stdio.h>
int main() {
int A[100], N, i, j, key;
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
for (i = 0; i < N; i++) {
key = A[i];
j = i - 1;
while (j >= 0 && A[j] > key) {
A[j + 1] = A[j];
j--;
A[j + 1] = key;
}
for (j = 0; j < N; j++) {... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13]] | 0 | 179 | 2 |
#include <algorithm>
#include <functional>
#include <iostream>
#include <istream>
#include <map>
#include <ostream>
#include <queue>
#include <random>
#include <stack>
#include <tuple>
#include <utility>
using namespace std;
// puzzle ?????¶?????????key (ULL) ??§??¨?????????
// priority_que ?????£????????????stack<ke... | #include <algorithm>
#include <functional>
#include <iostream>
#include <istream>
#include <map>
#include <ostream>
#include <queue>
#include <random>
#include <stack>
#include <tuple>
#include <utility>
using namespace std;
// puzzle ?????¶?????????key (ULL) ??§??¨?????????
// priority_que ?????£????????????stack<ke... | [["+", 8, 9, 0, 43, 49, 53, 54, 55, 0, 24], ["+", 0, 43, 49, 53, 54, 55, 0, 56, 39, 78], ["+", 8, 9, 0, 43, 49, 53, 54, 55, 0, 25]] | 1 | 995 | 3 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define MAX_T 50
#define WIDTH 600
pair<int, vector<vector<int>>> E[MAX_T][WIDTH], D[WIDTH];
vector<vector<int>> X;
int hantei(vector<vector<int>> a) {
int sum = 0;
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
i... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define MAX_T 50
#define WIDTH 7125
pair<int, vector<vector<int>>> E[MAX_T][WIDTH], D[WIDTH];
vector<vector<int>> X;
int hantei(vector<vector<int>> a) {
int sum = 0;
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59]] | 1 | 626 | 2 |
#include <assert.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <climits>
#include <cmath>
#include <set>
#include <stack>
#include <string>
#define N 4
#define N2 16
using namespace std;
// const int N = 4;
// const int N2 = 16;
static const int dx[4] = {0, -1, 0, 1};
static const int dy[4... | #include <assert.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <climits>
#include <cmath>
#include <set>
#include <stack>
#include <string>
#define N 4
#define N2 16
using namespace std;
// const int N = 4;
// const int N2 = 16;
static const int dx[4] = {0, -1, 0, 1};
static const int dy[4... | [["+", 8, 9, 0, 57, 64, 9, 0, 37, 0, 38], ["+", 8, 9, 0, 57, 64, 9, 0, 37, 0, 35]] | 1 | 768 | 2 |
#include <assert.h>
#include <iostream>
#include <stdio.h>
#include <vector>
#include <algorithm>
#include <climits>
#include <cmath>
#include <set>
#include <stack>
#include <string>
#define N 4
#define N2 16
using namespace std;
// const int N = 4;
// const int N2 = 16;
static const int dx[4] = {0, -1, 0, 1};
st... | #include <assert.h>
#include <iostream>
#include <stdio.h>
#include <vector>
#include <algorithm>
#include <climits>
#include <cmath>
#include <set>
#include <stack>
#include <string>
#define N 4
#define N2 16
using namespace std;
// const int N = 4;
// const int N2 = 16;
static const int dx[4] = {0, -1, 0, 1};
st... | [["+", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67]] | 1 | 761 | 1 |
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
using namespace std;
#define N 4
#define N2 16
static const int dx[4] = {0, -1, 0, 1};
static const int dy[4] = {1, 0, -1, 0};
static const char dir[4] = {'r', 'u', 'l', 'd'};
int MDT[N2][N2];
struct Puzzle {
int f[N2], space, M... | #include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
using namespace std;
#define N 4
#define N2 16
static const int dx[4] = {0, -1, 0, 1};
static const int dy[4] = {1, 0, -1, 0};
static const char dir[4] = {'r', 'u', 'l', 'd'};
int MDT[N2][N2];
struct Puzzle {
int f[N2], space, M... | [["-", 8, 9, 0, 7, 8, 7, 15, 16, 31, 22], ["+", 8, 9, 0, 7, 8, 7, 15, 16, 31, 22]] | 1 | 725 | 2 |
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
using namespace std;
#define N 4
#define N2 16
#define LIMIT 100
static const int dx[4] = {0, -1, 0, 1};
static const int dy[4] = {1, 0, -1, 0};
static const char dir[4] = {'r', 'u', 'l', 'd'};
int MDT[N2][N2];
struct Puzzle {
... | #include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
using namespace std;
#define N 4
#define N2 16
#define LIMIT 100
static const int dx[4] = {0, -1, 0, 1};
static const int dy[4] = {1, 0, -1, 0};
static const char dir[4] = {'r', 'u', 'l', 'd'};
int MDT[N2][N2];
struct Puzzle {
... | [["+", 0, 57, 64, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 57, 64, 9, 0, 7, 8, 9, 0, 46]] | 1 | 727 | 2 |
import java.util.Scanner;
class Main {
public static void main(String[] ags) {
Scanner nyuryoku = new Scanner(System.in);
int N = nyuryoku.nextInt();
int[] A = new int[N];
for (int i = 0; i < N; i++) {
A[i] = nyuryoku.nextInt();
show(A, N);
insertionSort(A, N);
}
}
static v... | import java.util.Scanner;
class Main {
public static void main(String[] ags) {
Scanner nyuryoku = new Scanner(System.in);
int N = nyuryoku.nextInt();
int[] A = new int[N];
for (int i = 0; i < N; i++) {
A[i] = nyuryoku.nextInt();
}
show(A, N);
insertionSort(A, N);
}
static void i... | [["+", 0, 195, 8, 196, 0, 7, 8, 196, 0, 46], ["-", 0, 195, 8, 196, 0, 7, 8, 196, 0, 46]] | 3 | 250 | 2 |
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int size = Integer.parseInt(sc.nextLine());
int[] arr = new int[size];
String[] input = sc.nextLine().split(" ");
for (int i = 0; i < size; i++) {
arr[i] = Integer.parseI... | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int size = Integer.parseInt(sc.nextLine());
int[] arr = new int[size];
String[] input = sc.nextLine().split(" ");
for (int i = 0; i < size; i++) {
arr[i] = Integer.parseI... | [["+", 0, 195, 8, 196, 0, 1, 0, 492, 141, 22], ["+", 8, 196, 0, 1, 0, 492, 3, 4, 0, 24], ["+", 8, 196, 0, 1, 0, 492, 3, 4, 0, 22], ["+", 8, 196, 0, 1, 0, 492, 3, 4, 0, 25], ["+", 8, 498, 0, 195, 8, 196, 0, 1, 0, 35]] | 3 | 261 | 5 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
int array[] = new int[n];
for (int i = 0; i < n; i++) {
array[i] = scan.nextInt();
System.out.print(array[i]);
if (i == n - 1)
... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
int array[] = new int[n];
for (int i = 0; i < n; i++) {
array[i] = scan.nextInt();
System.out.print(array[i]);
if (i == n - 1)
... | [["-", 0, 195, 8, 196, 0, 7, 8, 196, 0, 46], ["+", 0, 195, 8, 196, 0, 7, 8, 196, 0, 46]] | 3 | 256 | 2 |
import java.util.Scanner;
public class Main { // InsertionSort
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] arr = new int[n];
for (int i = 0; i < n; i++) {
arr[i] = sc.nextInt();
if (i == n - 1) {
System.out.println(arr... | import java.util.Scanner;
public class Main { // InsertionSort
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] arr = new int[n];
for (int i = 0; i < n; i++) {
arr[i] = sc.nextInt();
if (i == n - 1) {
System.out.println(arr... | [["-", 8, 196, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 196, 0, 7, 15, 16, 12, 16, 12, 499]] | 3 | 253 | 2 |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class Main {
static int len;
static int[] arr;
/**
* @param args
* @throws IOException
*/
public static void main(String[] args) throws IOException {
BufferedRea... | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class Main {
static int len;
static int[] arr;
/**
* @param args
* @throws IOException
*/
public static void main(String[] args) throws IOException {
BufferedRea... | [["-", 8, 196, 0, 1, 0, 492, 3, 4, 0, 22], ["+", 8, 196, 0, 1, 0, 492, 3, 4, 0, 22]] | 3 | 380 | 2 |
#include <stdio.h>
#include <string.h>
int main() {
int n;
int a[101] = {0};
int i, j, v, k;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < n; i++) {
v = a[i];
j = i - 1;
while (j >= 0 && a[j] > v) {
a[j + 1] = a[j];
j--;
a[j + 1] = v... | #include <stdio.h>
#include <string.h>
int main() {
int n;
int a[101] = {0};
int i, j, v, k;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < n; i++) {
v = a[i];
j = i - 1;
while (j >= 0 && a[j] > v) {
a[j + 1] = a[j];
j--;
a[j + 1] = v... | [["+", 0, 7, 8, 9, 0, 52, 8, 9, 0, 46], ["-", 0, 57, 15, 23, 0, 16, 31, 16, 17, 33], ["-", 0, 57, 15, 23, 0, 16, 31, 16, 12, 13], ["+", 0, 57, 15, 23, 0, 16, 12, 16, 17, 33], ["+", 0, 57, 15, 23, 0, 16, 12, 16, 12, 13], ["-", 0, 7, 8, 9, 0, 52, 8, 9, 0, 46]] | 0 | 191 | 6 |
#include <stdio.h>
int a[100];
int j, n;
void output() {
int i;
printf("%d", a[0]);
for (i = 1; i < n; i++) {
printf(" %d", a[i]);
}
printf("\n");
}
int main() {
int i;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (i = 1; i < n; i++) {
int key = a[i];
j = i - ... | #include <stdio.h>
int a[100];
int j, n;
void output() {
int i;
printf("%d", a[0]);
for (i = 1; i < n; i++) {
printf(" %d", a[i]);
}
printf("\n");
}
int main() {
int i;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
output();
for (i = 1; i < n; i++) {
int key = a[i];
... | [["+", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 0 | 190 | 4 |
#include <stdio.h>
#include <stdlib.h>
int main() {
int N = 0;
int i, j;
int sorted = 0;
int data[110];
int temp;
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &data[i]);
}
while (sorted < N - 1) {
for (i = 0; i < N - 1; ++i) {
printf("%d ", data[i]);
}
printf("%d", ... | #include <stdio.h>
#include <stdlib.h>
int main() {
int N = 0;
int i, j;
int sorted = 0;
int data[110];
int temp;
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &data[i]);
}
while (sorted < N - 1) {
for (i = 0; i < N - 1; ++i) {
printf("%d ", data[i]);
}
printf("%d", ... | [["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 0 | 257 | 3 |
#include <stdio.h>
int main() {
int i, j, a, k;
int temp;
int r[100];
scanf("%d", &a);
for (i = 0; i < a; ++i) {
scanf("%d", &r[i]);
}
for (i = 1; i < a; ++i) {
j = i;
while ((r[j] < r[j - 1]) && (j >= 0)) {
temp = r[j];
r[j] = r[j - 1];
r[j - 1] = temp;
j--;
}
... | #include <stdio.h>
int main() {
int i, j, a, k;
int temp;
int r[100];
scanf("%d", &a);
for (i = 0; i < a; ++i) {
scanf("%d", &r[i]);
}
for (i = 0; i < a; i++) {
j = i;
while ((r[j] < r[j - 1]) && (j > 0)) {
temp = r[j];
r[j] = r[j - 1];
r[j - 1] = temp;
j--;
}
... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["-", 0, 14, 8, 9, 0, 7, 26, 27, 17, 29], ["+", 0, 14, 8, 9, 0, 7, 26, 27, 17, 29], ["-", 15, 23, 0, 16, 12, 23, 0, 16, 17, 20], ["+", 15, 23, 0, 16, 12, 23, 0, 16, 17, 47]] | 0 | 185 | 6 |
#include <stdio.h>
int main(void) {
int N, i, j, k, v;
scanf("%d", &N);
int A[N];
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
for (i = 1; i < N; i++) {
v = A[i];
j = i - 1;
while (j >= 0 && A[j] > v) {
A[j + 1] = A[j];
j--;
}
A[j + 1] = v;
for (k = 0; k < N ... | #include <stdio.h>
int main(void) {
int N, i, j, k, v;
scanf("%d", &N);
int A[N];
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
for (i = 0; i < N; i++) {
v = A[i];
j = i - 1;
while (j >= 0 && A[j] > v) {
A[j + 1] = A[j];
j--;
}
A[j + 1] = v;
for (k = 0; k < N ... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["-", 0, 1, 0, 2, 3, 4, 0, 69, 71, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 69, 71, 22]] | 0 | 178 | 4 |
#include <stdio.h>
void print(int a[], int N) {
for (int i = 0; i < N; i++) {
printf("%d", a[i]);
if (i != N - 1) {
printf(" ");
}
printf("\n");
}
}
int main() {
int a[100];
int key;
int N;
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%d", &a[i]);
}
print(a, N);
... | #include <stdio.h>
void print(int a[], int N) {
for (int i = 0; i < N; i++) {
printf("%d", a[i]);
if (i != N - 1) {
printf(" ");
}
}
printf("\n");
}
int main() {
int a[100];
int key;
int N;
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%d", &a[i]);
}
print(a, N);
... | [["+", 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, 52, 8, 9, 0, 46], ["+", 0, 7, 8, 9, 0, 52, 8, 9, 0, 46]] | 0 | 212 | 4 |
#include <stdio.h>
/* 配列の要素を順番に出力 */
void trace(int A[], int N) {
int i;
for (i = 0; i < N; i++) {
/* 隣接する要素の間に1つの空白を出力 */
if (i > 0)
printf(" ");
printf("%d", A[i]);
}
printf("¥n");
}
/* 挿入ソート(0オリジン配列) */
void insertionSort(int A[], int N) {
int i, j, v;
for (i = 1; i < N; i++) {
v ... | #include <stdio.h>
/* 配列の要素を順番に出力 */
void trace(int A[], int N) {
int i;
for (i = 0; i < N; i++) {
/* 隣接する要素の間に1つの空白を出力 */
if (i > 0)
printf(" ");
printf("%d", A[i]);
}
printf("\n");
}
/* 挿入ソート(0オリジン配列) */
void insertionSort(int A[], int N) {
int i, j, v;
for (i = 1; i < N; i++) {
v ... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 0 | 233 | 2 |
#include <stdio.h>
void print_a(int a[], int n) {
int i;
for (i = 0; i < n; i++) {
printf("%d", a[i]);
if (i < n - 1)
printf(" ");
}
printf("\n");
}
void insertion_sort(int a[], int n) {
int i, j;
int num;
for (i = 1; i < n; i++) {
print_a(a, n);
j = i;
num = a[i];
while ... | #include <stdio.h>
void print_a(int a[], int n) {
int i;
for (i = 0; i < n; i++) {
printf("%d", a[i]);
if (i < n - 1)
printf(" ");
}
printf("\n");
}
void insertion_sort(int a[], int n) {
int i, j;
int num;
for (i = 1; i < n; i++) {
print_a(a, n);
j = i;
num = a[i];
while ... | [["-", 15, 23, 0, 16, 12, 16, 31, 69, 28, 22], ["-", 15, 23, 0, 16, 12, 16, 31, 69, 0, 70], ["-", 15, 23, 0, 16, 12, 16, 31, 69, 71, 22], ["-", 15, 23, 0, 16, 12, 16, 31, 69, 0, 73], ["+", 0, 52, 15, 23, 0, 16, 12, 16, 31, 22]] | 0 | 237 | 5 |
#include <stdio.h>
int main(void) {
int N, A[1000], i, v, j;
scanf("%d", &N);
for (i = 0; i < N; i++)
scanf("%d", &A[i]);
for (i = 1; i < N - 1; i++) {
v = A[i];
j = i - 1;
while (j >= 0 && A[j] > v) {
A[j + 1] = A[j];
j--;
}
A[j + 1] = v;
for (j = 0; j < N - 1; j++)... | #include <stdio.h>
int main(void) {
int N, A[1000], i, v, j;
scanf("%d", &N);
for (i = 0; i < N; i++)
scanf("%d", &A[i]);
for (i = 0; i < N; i++) {
v = A[i];
j = i - 1;
while (j >= 0 && A[j] > v) {
A[j + 1] = A[j];
j--;
}
A[j + 1] = v;
for (j = 0; j < N - 1; j++)
... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 0 | 173 | 4 |
#include <stdio.h>
#define MAXLENGTH 1000 //配列の最大の長さ
main() {
int i, j, v, p;
int N; //配列の長さ
int A[MAXLENGTH]; //配列
scanf(" %d", &N);
for (i = 0; i < N; i++) {
scanf(" %d", &A[i]);
}
for (i = 1; i < N; i++) {
printf("%d\n", A[0]);
for (p = 1; p < N; p++) {
printf(" %d",... | #include <stdio.h>
#define MAXLENGTH 1000 //配列の最大の長さ
main() {
int i, j, v, p;
int N; //配列の長さ
int A[MAXLENGTH]; //配列
scanf(" %d", &N);
for (i = 0; i < N; i++) {
scanf(" %d", &A[i]);
}
for (i = 1; i < N; i++) {
printf("%d", A[0]);
for (p = 1; p < N; p++) {
printf(" %d", A... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44], ["+", 36, 36, 0, 30, 0, 9, 0, 1, 0, 35], ["+", 36, 36, 0, 30, 0, 9, 0, 37, 0, 38], ["+", 36, 36, 0, 30, 0, 9, 0, 37, 0, 13]] | 0 | 230 | 5 |
#include <stdio.h>
#include <stdlib.h>
int main() {
int i, n, v, j, k;
int *A;
scanf("%d", &n);
A = (int *)malloc(n * sizeof(int)); //配列を確保
for (i = 0; i < n; i++)
scanf("%d", A + i); //配列Aに値を入力
for (i = 1; i < n; i++) {
v = A[i]; //仮置き
j = i - 1;
while (j >= 0 && A[j] > v) { // iよりも前の要素... | #include <stdio.h>
#include <stdlib.h>
int main() {
int i, n, v, j, k;
int *A;
scanf("%d", &n);
A = (int *)malloc(n * sizeof(int)); //配列を確保
for (i = 0; i < n; i++)
scanf("%d", A + i); //配列Aに値を入力
for (i = 0; i < n; i++) {
v = A[i]; //仮置き
j = i - 1;
while (j >= 0 && A[j] > v) { // iよりも前の要素... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13]] | 0 | 193 | 2 |
#include <stdio.h>
#define N 1000
main() {
int i, j, l, v, t;
int A[N];
scanf("%d", &l);
for (i = 0; i < l; i++) {
scanf("%d", &A[i]);
}
for (i = 1; i < l; i++) {
for (t = 0; t < l; t++) {
printf("%d", A[t]);
if (i < l)
printf(" ");
else
printf("\n");
}
v = ... | #include <stdio.h>
#define N 1000
main() {
int i, j, l, v, t;
int A[N];
scanf("%d", &l);
for (i = 0; i < l; i++) {
scanf("%d", &A[i]);
}
for (i = 1; i <= l; i++) {
for (t = 0; t < l; t++) {
printf("%d", A[t]);
if (t != l - 1)
printf(" ");
else
printf("\n");
}
... | [["-", 0, 30, 0, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 30, 0, 9, 0, 7, 15, 16, 17, 19], ["-", 8, 9, 0, 57, 15, 23, 0, 16, 31, 22], ["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 31, 22], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 79], ["+", 0, 57, 15, 23, 0, 16, 12, 16, 17, 33], ["+", 0, 57, 15, 2... | 0 | 184 | 8 |
#include <stdio.h>
void insertionsort(int *A, int n) {
int i, j, k, v;
for (i = 1; i < n; i++) {
for (k = 0; k < n - 1; k++) {
printf("%d ", A[k]);
}
printf("%d\n", A[n - 1]);
v = A[i];
j = i - 1;
while (j >= 0 && A[j] > v) {
A[j + 1] = A[j];
j--;
A[j + 1] = v;
... |
#include <stdio.h>
void insertionsort(int *A, int n) {
int i, j, k, v;
for (i = 1; i < n; i++) {
for (k = 0; k < n - 1; k++) {
printf("%d ", A[k]);
}
printf("%d\n", A[n - 1]);
v = A[i];
j = i - 1;
while (j >= 0 && A[j] > v) {
A[j + 1] = A[j];
j--;
A[j + 1] = v;
... | [["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 0 | 240 | 2 |
// 37 38
#include <stdio.h>
void trace(int A[], int N) {
int i;
for (i = 0; i < N; i++) {
if (i > 0)
printf(" ");
printf("%d", A[i]);
}
printf("\n");
}
void insertionSort(int A[], int N) {
int v, i, j;
for (i = 1; i < N; i++) {
v = A[i];
j = i - 1;
while (j >= 0 && A[j] > v) {
... | // 37 38
#include <stdio.h>
void trace(int A[], int N) {
int i;
for (i = 0; i < N; i++) {
if (i > 0)
printf(" ");
printf("%d", A[i]);
}
printf("\n");
}
void insertionSort(int A[], int N) {
int v, i, j;
for (i = 1; i < N; i++) {
v = A[i];
j = i - 1;
while (j >= 0 && A[j] > v) {
... | [["-", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22]] | 0 | 241 | 4 |
#include <stdio.h>
main() {
int N;
int i, j, k, v;
int A[1000];
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
if (i == N - 1)
printf("%d", A[k]);
else
printf("%d ", A[i]);
}
printf("\n");
for (i = 1; i < N; i++) {
v = A[i];
j = i - 1;
while (j >= 0 &&... | #include <stdio.h>
main() {
int N;
int i, j, k, v;
int A[1000];
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
if (i == N - 1) {
printf("%d", A[i]);
} else
printf("%d ", A[i]);
}
printf("\n");
for (i = 1; i < N; i++) {
v = A[i];
j = i - 1;
while (j >= ... | [["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["-", 64, 1, 0, 2, 3, 4, 0, 69, 71, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 69, 71, 22], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 0 | 229 | 6 |
#include <stdio.h>
int main() {
int N, v, i, j;
int A[1000];
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
for (i = 1; i < N; i++) {
v = A[i];
j = i - 1;
while (j >= 0 && A[j] > v) {
A[j + 1] = A[j];
j--;
A[j + 1] = v;
}
for (j = 0; j < N; j++... | #include <stdio.h>
int main() {
int N, v, i, j;
int A[1000];
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
for (i = 0; i < N; i++) {
v = A[i];
j = i - 1;
while (j >= 0 && A[j] > v) {
A[j + 1] = A[j];
j--;
A[j + 1] = v;
}
for (j = 0; j < N; j++... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13]] | 0 | 180 | 2 |
#include <stdio.h>
int main(void) {
int n;
int c[100];
int v;
int i, j;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &c[i]);
}
for (i = 1; i < n; i++) {
for (j = 0; j < n; j++) {
printf("%d", c[j]);
if (j < n - 1) {
printf(" ");
}
}
printf("\n");
... | #include <stdio.h>
int main(void) {
int n;
int c[100];
int v;
int i, j;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &c[i]);
}
for (i = 1; i < n; i++) {
for (j = 0; j < n; j++) {
printf("%d", c[j]);
if (j < n - 1) {
printf(" ");
}
}
printf("\n");
... | [["-", 0, 52, 15, 23, 0, 16, 31, 16, 17, 47], ["+", 0, 52, 15, 23, 0, 16, 31, 16, 17, 20], ["+", 0, 1, 0, 11, 31, 69, 71, 16, 17, 72], ["+", 0, 1, 0, 11, 31, 69, 71, 16, 12, 13]] | 0 | 236 | 4 |
#include <stdio.h>
void print_array(int *array, int n) {
int i;
for (i = 0; i < n - 1; i++)
printf("%d ", array[i]);
printf("%d\n", array[n - 1]);
}
int main(void) {
int i, j, v, n, array[100];
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &array[i]);
for (i = 0; i < n - 1; i++) {
v... | #include <stdio.h>
void print_array(int *array, int n) {
int i;
for (i = 0; i < n - 1; i++)
printf("%d ", array[i]);
printf("%d\n", array[n - 1]);
}
int main(void) {
int i, j, v, n, array[100];
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &array[i]);
for (i = 0; i < n; i++) {
v = a... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 0 | 195 | 2 |
#include <stdio.h>
#include <stdlib.h>
#define MAX 1000
int main() {
int i;
int j;
int A[MAX];
int v;
int length;
scanf("%d", &length);
if (length > 100) {
printf("too large\n");
exit(1);
}
for (i = 0; i < length; i++) {
scanf("%d", &A[i]);
}
for (i = 1; i <= length - 1; i++) {
... | #include <stdio.h>
#include <stdlib.h>
#define MAX 1000
int main() {
int i;
int j;
int A[MAX];
int v;
int length;
scanf("%d", &length);
if (length > 100) {
printf("too large\n");
exit(1);
}
for (i = 0; i < length; i++) {
scanf("%d", &A[i]);
}
for (i = 1; i <= length - 1; i++) {
... | [["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 0 | 248 | 2 |
#include <stdio.h>
int main() {
int N, A[1000], i, j, key;
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
for (j = 1; j < N - 1; j++) {
if (j > 0) {
printf(" ");
}
printf("%d", A[j]);
}
printf("\n");
for (i = 1; i < N; i++) {
key = A[i];
j = i - 1;
... | #include <stdio.h>
int main() {
int N, A[1000], i, j, key;
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
for (j = 0; j < N; j++) {
if (j > 0) {
printf(" ");
}
printf("%d", A[j]);
}
printf("\n");
for (i = 1; i < N; i++) {
key = A[i];
j = i - 1;
w... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["-", 0, 7, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 7, 8, 9, 0, 7, 10, 11, 12, 13]] | 0 | 232 | 8 |
#include <stdio.h>
int main() {
int i, j, N, k, key, A[100];
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
for (i = 0; i < N; i++) {
key = A[i];
j = i - 1;
while (j >= 0 && A[j] > key) {
A[j + 1] = A[j];
j--;
A[j + 1] = key;
}
for (k = 0; k < N - 1;... | #include <stdio.h>
int main() {
int i, j, N, k, key, A[100];
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
for (i = 0; i < N; i++) {
key = A[i];
j = i - 1;
while (j >= 0 && A[j] > key) {
A[j + 1] = A[j];
j--;
A[j + 1] = key;
}
for (k = 0; k < N - 1;... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 174 | 2 |
#include <stdio.h>
#define N 1000
int main() {
int a, i, v, j, k;
int A[N];
scanf("%d", &a);
for (i = 0; i < a; i++) {
scanf("%d", &A[i]);
}
for (k = 0; k < a; k++)
printf("%d ", A[k]);
printf("%d\n", A[a]);
for (i = 1; i < a; i++) {
v = A[i];
j = i - 1;
while (j >= 0 && A[j] >... | #include <stdio.h>
#define N 1000
int main() {
int a, i, v, j, k;
int A[N];
scanf("%d", &a);
for (i = 0; i < a; i++) {
scanf("%d", &A[i]);
}
for (k = 0; k < a - 1; k++)
printf("%d ", A[k]);
printf("%d\n", A[a - 1]);
for (i = 1; i < a; i++) {
v = A[i];
j = i - 1;
while (j >= 0 &... | [["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["+", 0, 2, 3, 4, 0, 69, 71, 16, 17, 33], ["+", 0, 2, 3, 4, 0, 69, 71, 16, 12, 13]] | 0 | 216 | 6 |
// Insertion_Sort.c
#include <stdio.h>
#define N 1000
int main() {
int n, j, a[N], i, key = 0, k;
scanf("%d", &n); // nを入力
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (i = 1; i < n; i++) {
key = a[i];
j = i - 1;
while (j >= 0 && a[j] > key) {
a[j + 1] = a[j];
j--;
... | // Insertion_Sort.c
#include <stdio.h>
#define N 1000
int main() {
int n, j, a[N], i, key = 0, k;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < n; i++) {
key = a[i];
j = i - 1;
while (j >= 0 && a[j] > key) {
a[j + 1] = a[j];
j--;
a[j... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 30, 0, 14, 8, 9, 0, 37, 0, 38], ["+", 0, 30, 0, 14, 8, 9, 0, 37, 0, 13], ["+", 0, 30, 0, 14, 8, 9, 0, 37, 0, 35]] | 0 | 189 | 5 |
#include <stdio.h>
#include <stdlib.h>
int main() {
int N, i, j, key;
int *A;
scanf("%d", &N);
A = (int *)malloc(sizeof(int) * N);
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
for (j = 1; j < N; j++) {
key = A[j];
i = j - 1;
while (i >= 0 && A[i] > key) {
A[i + 1] = A[i];
... | #include <stdio.h>
#include <stdlib.h>
int main() {
int N, i, j, key;
int *A;
scanf("%d", &N);
A = (int *)malloc(sizeof(int) * N);
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
for (j = 0; j < N; j++) {
key = A[j];
i = j - 1;
while (i >= 0 && A[i] > key) {
A[i + 1] = A[i];
... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13]] | 0 | 196 | 2 |
#include <stdio.h>
#define N 100
int main() {
int i, j, key, n, A[N];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
for (i = 0; i < n; i++) {
key = A[i];
j = i - 1;
while (j >= 0 && key < A[j]) {
A[j + 1] = A[j];
j--;
A[j + 1] = key;
}
for (j = 0; j... | #include <stdio.h>
#define N 100
int main() {
int i, j, key, n, A[N];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
for (i = 0; i < n; i++) {
key = A[i];
j = i - 1;
while (j >= 0 && key < A[j]) {
A[j + 1] = A[j];
j--;
A[j + 1] = key;
}
for (j = 0; j... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["+", 15, 23, 0, 16, 12, 16, 12, 16, 17, 33], ["+", 15, 23, 0, 16, 12, 16, 12, 16, 12, 13]] | 0 | 203 | 4 |
#include <stdio.h>
int main() {
int i, j, k, work, N, A[1000];
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
for (i = 1; i <= N - 1; i++) {
for (k = 0; k < N; k++) {
printf("%d", A[k]);
if (k < N - 1)
printf(" ");
}
printf("\n");
work = A[i];
... | #include <stdio.h>
int main() {
int i, j, k, work, N, A[1000];
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
for (i = 1; i <= N; i++) {
for (k = 0; k < N; k++) {
printf("%d", A[k]);
if (k < N - 1)
printf(" ");
}
printf("\n");
work = A[i];
j =... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 0 | 183 | 4 |
#include <stdio.h>
int main() {
int i, j, k, work, N, A[1000];
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
for (i = 1; i <= N - 1; i++) {
for (k = 0; k < N; k++) {
printf("%d", A[k]);
if (k < N - 1)
printf(" ");
}
printf("\n");
work = A[i];
... | #include <stdio.h>
int main() {
int i, j, k, work, N, A[1005];
/* i,j,k are variables for loop count
work is variable for save number
N is variable for the length of series A
A is array for save each elements needs for this program
*/
scanf("%d", &N);
// input for the length of series A
for... | [["-", 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 | 183 | 4 |
#include <stdio.h>
static const int N = 1000;
void trace(int A[], int n) {
int i;
for (i = 0; i <= n; i++) {
if (i > 0)
printf(" ");
printf("%d", A[i]);
}
printf("\n");
}
void Sort(int A[], int n) {
int i, j, k;
for (i = 1; i < n; i++) {
k = A[i];
j = i - 1;
while (j >= 0 && A[j... | #include <stdio.h>
static const int N = 1000;
void trace(int A[], int n) {
int i;
for (i = 0; i < n; i++) {
if (i > 0)
printf(" ");
printf("%d", A[i]);
}
printf("\n");
}
void Sort(int A[], int n) {
int i, j, k;
for (i = 1; i < n; i++) {
k = A[i];
j = i - 1;
while (j >= 0 && A[j]... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18]] | 0 | 240 | 4 |
#include <stdio.h>
void change(int *, int);
void insertsort(int *, int);
int main() {
int N, i, j;
int A[100];
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
change(A, N);
insertsort(A, N);
return 0;
}
void change(int A[], int N) {
int i;
for (i = 0; i < N; i++) {
if (i > ... | #include <stdio.h>
void change(int *, int);
void insertsort(int *, int);
int main() {
int N, i, j;
int A[100];
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
change(A, N);
insertsort(A, N);
return 0;
}
void change(int A[], int N) {
int i;
for (i = 0; i < N; i++) {
if (i > ... | [["+", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 250 | 1 |
#include <stdio.h>
#include <stdlib.h>
int main() {
int A[1000];
int i, j, key, N;
scanf("%d", &N);
if (N <= 1 || N >= 100)
exit(1);
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
for (i = 0; i < N - 1; i++)
printf("%d ", A[i]);
printf("%d", A[i]);
printf("\n");
for (j = 1; j < ... | #include <stdio.h>
#include <stdlib.h>
int main() {
int A[1000];
int i, j, key, N;
scanf("%d", &N);
if (N < 1 || N > 100)
exit(1);
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
for (i = 0; i < N - 1; i++)
printf("%d ", A[i]);
printf("%d", A[i]);
printf("\n");
for (j = 1; j < N;... | [["-", 0, 57, 15, 23, 0, 16, 31, 16, 17, 19], ["+", 0, 57, 15, 23, 0, 16, 31, 16, 17, 18], ["-", 0, 57, 15, 23, 0, 16, 12, 16, 17, 20], ["+", 0, 57, 15, 23, 0, 16, 12, 16, 17, 47], ["-", 15, 23, 0, 16, 31, 23, 0, 16, 17, 47], ["+", 15, 23, 0, 16, 31, 23, 0, 16, 17, 20]] | 0 | 247 | 6 |
#include <stdio.h>
#define N 100
int main() {
int A[N], i, j, k, n, v;
/* input data */
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
/* output 1st data */
if (i != n - 1)
printf("%d ", A[i]);
else
printf("%d", A[i]);
}
printf("\n");
/* sort */
for (i = ... | #include <stdio.h>
#define N 100
int main() {
int A[N], i, j, k, n, v;
/* input data */
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
/* output 1st data */
if (i != n - 1)
printf("%d ", A[i]);
else
printf("%d", A[i]);
}
printf("\n");
/* sort */
for (i = ... | [["+", 75, 76, 0, 1, 0, 2, 3, 4, 0, 21], ["+", 0, 1, 0, 2, 3, 4, 0, 69, 28, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 69, 0, 70], ["+", 0, 1, 0, 2, 3, 4, 0, 69, 71, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 69, 0, 73]] | 0 | 231 | 5 |
#include <stdio.h>
int main() {
int N, A[100], i, v, j, k;
scanf("%d", &N);
for (i = 0; i < N; i++)
scanf("%d", &A[i]);
for (i = 0; i < N; i++) {
printf("%d", A[i]);
if (i == N - 1)
printf(" ");
}
printf("\n");
for (i = 1; i < N; i++) {
v = A[i];
j = i - 1;
while (j >= 0 ... | #include <stdio.h>
int main() {
int N, A[100], i, v, j, k;
scanf("%d", &N);
for (i = 0; i < N; i++)
scanf("%d", &A[i]);
for (i = 0; i < N; i++) {
printf("%d", A[i]);
if (i != N - 1)
printf(" ");
}
printf("\n");
for (i = 1; i < N; i++) {
v = A[i];
j = i - 1;
while (j >= 0 ... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 60], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 79]] | 0 | 228 | 4 |
#include <stdio.h>
int main() {
int i, j, k, l, v, N;
int A[100];
scanf("%d", &N);
for (i = 0; i < N; i++)
scanf("%d", &A[i]);
for (i = 0; i < N; i++) {
printf("%d", A[i]);
if (i != N - 1)
printf(" ");
}
printf("\n");
for (i = 0; i < N; i++) {
v = A[i];
j = i - 1;
w... | #include <stdio.h>
int main() {
int i, j, k, l, v, N;
int A[100];
scanf("%d", &N);
for (i = 0; i < N; i++)
scanf("%d", &A[i]);
for (i = 0; i < N; i++) {
printf("%d", A[i]);
if (i != N - 1)
printf(" ");
}
printf("\n");
for (i = 1; i < N; i++) {
v = A[i];
j = i - 1;
w... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["-", 0, 7, 8, 9, 0, 52, 8, 9, 0, 46], ["+", 0, 7, 8, 9, 0, 52, 8, 9, 0, 46]] | 0 | 231 | 26 |
#include <stdio.h>
int main() {
int A[100];
int N, i, j, v, m;
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
for (i = 0; i < N; i++) {
if (i > 0)
printf(" ");
printf("%d", A[i]);
}
printf("\n");
for (i = 1; i <= N - 1; i++) {
v = A[i];
j = i - 1;
whi... | #include <stdio.h>
int main() {
int A[100];
int N, i, j, v, m;
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
for (i = 0; i < N; i++) {
if (i > 0)
printf(" ");
printf("%d", A[i]);
}
printf("\n");
for (i = 1; i <= N - 1; i++) {
v = A[i];
j = i - 1;
whi... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18]] | 0 | 229 | 2 |
#include <stdio.h>
int main() {
int i, j, N;
int A[100];
int v;
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
for (j = 0; j < N; j++) {
printf("%d", A[j]);
if (j != N - 1)
printf(" ");
}
for (i = 1; i < N; i++) {
v = A[i];
j = i - 1;
while (j >= 0 && ... | #include <stdio.h>
int main() {
int i, j, N;
int A[100];
int v;
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
for (j = 0; j < N; j++) {
printf("%d", A[j]);
if (j != N - 1)
printf(" ");
}
printf("\n");
for (i = 1; i < N; i++) {
v = A[i];
j = i - 1;
wh... | [["+", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 62], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 0 | 223 | 7 |
#include <stdio.h>
int main(void) {
int A[100], i, j, k, N, key;
scanf("%d", &N);
for (i = 0; i < N; i++)
scanf("%d", &A[i]);
for (i = 0; i < N; i++) {
key = A[i];
j = i - 1;
while (j >= 0 && A[j] > key) {
A[j + 1] = A[j];
j--;
}
A[j + 1] = key;
for (k = 0; k < N; k+... | #include <stdio.h>
int main(void) {
int A[100], i, j, k, N, key;
scanf("%d", &N);
for (i = 0; i < N; i++)
scanf("%d", &A[i]);
for (i = 0; i < N; i++) {
key = A[i];
j = i - 1;
while (j >= 0 && A[j] > key) {
A[j + 1] = A[j];
j--;
}
A[j + 1] = key;
for (k = 0; k < N; k+... | [["-", 3, 4, 0, 41, 15, 23, 0, 11, 17, 32], ["+", 3, 4, 0, 41, 15, 23, 0, 16, 17, 60]] | 0 | 172 | 2 |
#include <stdio.h>
int main(void) {
int a[100], n, i, j, k, key;
/*printf("n???????????\????????????????????????\n");*/
scanf("%d", &n);
/*printf("%d??????????????\????????????????????????\n",n);*/
for (i = 0; i < n; i++)
scanf("%d", &a[i]);
for (k = 0; k < n; k++) {
key = a[k];
j = k - 1;
... | #include <stdio.h>
int main(void) {
int a[100], n, i, j, k, key;
/*printf("n???????????\????????????????????????\n");*/
scanf("%d", &n);
/*printf("%d??????????????\????????????????????????\n",n);*/
for (i = 0; i < n; i++)
scanf("%d", &a[i]);
for (k = 0; k < n; k++) {
key = a[k];
j = k - 1;
... | [["-", 0, 2, 3, 4, 0, 41, 15, 16, 31, 22], ["+", 0, 2, 3, 4, 0, 41, 15, 16, 31, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 37, 0, 38], ["+", 0, 30, 0, 14, 8, 9, 0, 37, 0, 13], ["+", 0, 30, 0, 14, 8, 9, 0, 37, 0, 35]] | 0 | 169 | 5 |
#include <stdio.h>
void insersion(int *a, int n);
int main() {
int n;
scanf("%d", &n);
int i, a[n];
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
insersion(a, n);
return 0;
}
void insersion(int *a, int n) {
int i, j, v, k;
for (i = 1; i <= n - 1; i++) {
v = a[i];
j = i - 1;
while ... | #include <stdio.h>
void insersion(int *a, int n);
int main() {
int n;
scanf("%d", &n);
int i, a[n];
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
insersion(a, n);
return 0;
}
void insersion(int *a, int n) {
int i, j, v, k;
for (i = 0; i <= n - 1; i++) {
v = a[i];
j = i - 1;
while ... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13]] | 0 | 217 | 2 |
#include <stdio.h>
int main() {
int n, i, j, key, t;
int a[99];
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &a[i]);
for (t = 0; t < n - 1; t++)
printf("%d ", a[t]);
printf("%d", a[n - 1]);
putchar('\n');
for (i = 1; i < n; i++) {
key = a[i];
for (j = i; j > 0; j--) {
if... | #include <stdio.h>
int main() {
int n, i, j, key, t;
int a[100];
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &a[i]);
for (t = 0; t < n - 1; t++)
printf("%d ", a[t]);
printf("%d", a[n - 1]);
putchar('\n');
for (i = 1; i < n; i++) {
key = a[i];
for (j = i; j > 0; j--) {
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 | 229 | 4 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
void printArray(int *a, int n);
void insertSort(int *a, int n);
int main(void) {
int i, n;
int a[100];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
insertSort(a, n);
printArray(a, n);
return 0;
}
void insertSort(int ... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
void printArray(int *a, int n);
void insertSort(int *a, int n);
int main(void) {
int i, n;
int a[100];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
printArray(a, n);
insertSort(a, n);
return 0;
}
void insertSort(int ... | [["-", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22]] | 0 | 267 | 4 |
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <stdio.h>
void insertionSort(int A[], int N);
int main() {
int A[100] = {0}, n, i;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
insertionSort(A, n);
return 0;
}
void insertionSort(int A[], int N) {
int i, j, v, k;
for ... | #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <stdio.h>
void insertionSort(int A[], int N);
int main() {
int A[100] = {0}, n, i;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
insertionSort(A, n);
return 0;
}
void insertionSort(int A[], int N) {
int i, j, v, k;
for ... | [["-", 0, 2, 3, 4, 0, 41, 64, 103, 0, 44], ["+", 0, 2, 3, 4, 0, 41, 64, 103, 0, 125]] | 0 | 253 | 4 |
#include <stdio.h>
int main() {
int N, a[100], i, j, k, temp;
scanf("%d", &N);
for (i = 0; i < N; i++)
scanf("%d", &a[i]);
for (i = 0; i < N - 1; i++)
printf("%d ", &a[i]);
printf("%d\n", &a[N]);
for (i = 1; i < N; i++) {
temp = a[i];
j = i - 1;
while (j >= 0 && a[j] > temp) {
... | #include <stdio.h>
int main() {
int N, a[100], i, j, k, temp;
scanf("%d", &N);
for (i = 0; i < N; i++)
scanf("%d", &a[i]);
for (i = 0; i < N - 1; i++)
printf("%d ", a[i]);
printf("%d\n", a[i]);
for (i = 1; i < N; i++) {
temp = a[i];
j = i - 1;
while (j >= 0 && a[j] > temp) {
a[... | [["-", 8, 1, 0, 2, 3, 4, 0, 66, 17, 67], ["-", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67], ["-", 0, 2, 3, 4, 0, 66, 28, 69, 71, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 69, 71, 22], ["-", 0, 1, 0, 2, 3, 4, 0, 69, 71, 22]] | 0 | 212 | 6 |
#include <stdio.h>
int main() {
int nums[101];
int sorted[101];
int n;
int i = 0;
int v;
int j;
int k;
scanf("%d\n", &n);
while (i < n) {
scanf("%d", &nums[i]);
i++;
}
for (i = 0; i < n; i++) {
v = nums[i];
j = i - 1;
while (j >= 0 && nums[j] > v) {
nums[j + 1] = nums[j... | #include <stdio.h>
int main() {
int nums[101];
int sorted[101];
int n;
int i = 0;
int v;
int j;
int k;
scanf("%d\n", &n);
while (i < n) {
scanf("%d", &nums[i]);
i++;
}
for (i = 0; i < n; i++) {
v = nums[i];
j = i - 1;
while (j >= 0 && nums[j] > v) {
nums[j + 1] = nums[j... | [["-", 0, 57, 15, 23, 0, 16, 12, 16, 17, 33], ["-", 0, 57, 15, 23, 0, 16, 12, 16, 12, 13]] | 0 | 191 | 2 |
#include <stdio.h>
int main(void) {
int N;
int A[100];
int i, j, k, v;
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
for (i = 0; i < N - 1; i++) {
printf("%d ", A[i]);
}
printf("%d\n", A[N - 1]);
for (i = 1; i < N; i++) {
v = A[i];
j = i - 1;
while (j >= 0 ... | #include <stdio.h>
int main(void) {
int N;
int A[100];
int i, j, k, v;
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
for (i = 0; i < N - 1; i++) {
printf("%d ", A[i]);
}
printf("%d\n", A[N - 1]);
for (i = 1; i < N; i++) {
v = A[i];
j = i - 1;
while (j >= 0 ... | [["-", 0, 1, 0, 2, 3, 4, 0, 69, 71, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 69, 71, 22]] | 0 | 223 | 2 |
#include <stdio.h>
int main() {
int i = 0, j, k, n, array[100];
scanf("%d", &n);
while (i < n)
scanf("%d", &array[i++]);
for (i = 0; i < n; i++) {
j = i;
k = array[j];
while (j > 0 && array[j] < array[j - 1]) {
array[j] = array[j - 1];
j--;
}
array[j] = k;
for (j = 0; ... | #include <stdio.h>
int main() {
int i = 0, j, k, n, array[100];
scanf("%d", &n);
while (i < n)
scanf("%d", &array[i++]);
for (i = 0; i < n; i++) {
j = i;
k = array[j];
while (j > 0 && k < array[j - 1]) {
array[j] = array[j - 1];
j--;
}
array[j] = k;
for (j = 0; printf(... | [["-", 15, 23, 0, 16, 12, 16, 31, 69, 28, 22], ["-", 15, 23, 0, 16, 12, 16, 31, 69, 0, 70], ["-", 15, 23, 0, 16, 12, 16, 31, 69, 71, 22], ["-", 15, 23, 0, 16, 12, 16, 31, 69, 0, 73], ["+", 0, 52, 15, 23, 0, 16, 12, 16, 31, 22]] | 0 | 166 | 5 |
#include <stdio.h>
void insertion_sort() {
int N;
int A[1005];
int i, j;
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
for (i = 0; i < N - 1; i++) {
int v = A[i];
for (j = i - 1; j >= 0 && v < A[j]; j--) {
A[j + 1] = A[j];
}
A[j + 1] = v;
for (j = 0; j... | #include <stdio.h>
void insertion_sort() {
int N;
int A[1005];
int i, j;
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
for (i = 0; i < N; i++) {
int v = A[i];
for (j = i - 1; j >= 0 && v < A[j]; j--) {
A[j + 1] = A[j];
}
A[j + 1] = v;
for (j = 0; j < N... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 0 | 193 | 2 |
#include <stdio.h>
int main() {
int i, j, k, v, n, a[100];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (i = 1; i < n; i++) {
for (k = 0; k < n; k++) {
printf("%d", a[k]);
if (k + 1 < n)
printf(" ");
}
printf("\n");
v = a[i];
j = i - 1;
... | #include <stdio.h>
int main() {
int i, j, k, v, n, a[100];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (i = 1; i < n; i++) {
for (k = 0; k < n; k++) {
printf("%d", a[k]);
if (k + 1 < n)
printf(" ");
}
printf("\n");
v = a[i];
j = i - 1;
... | [["-", 0, 52, 15, 23, 0, 16, 12, 16, 17, 18], ["+", 0, 52, 15, 23, 0, 16, 12, 16, 17, 47]] | 0 | 230 | 2 |
#include <stdio.h>
int main() {
int N = 0, i, key, A[N], j, z;
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
for (z = 0; z < N - 1; z++) {
printf("%d ", A[z]);
}
printf("%d\n", A[z]);
for (i = 1; i < N; i++) {
key = A[i];
j = i - 1;
while (j >= 0 && A[j] ... | #include <stdio.h>
int main() {
int N = 0, i, key, A[100], j, z;
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
for (z = 0; z < N - 1; z++) {
printf("%d ", A[z]);
}
printf("%d\n", A[z]);
for (i = 1; i < N; i++) {
key = A[i];
j = i - 1;
while (j >= 0 && A[j... | [["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 22], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13]] | 0 | 218 | 2 |
#include <stdio.h>
#include <stdlib.h>
int main() {
int i, j, k, length, key, *A;
scanf("%d", &length);
A = (int *)malloc(sizeof(int) * length);
for (j = 0; j < length; j++)
scanf("%d", &A[j]);
for (i = 1; i < length; i++) {
key = A[i];
j = i - 1;
while (j >= 0 && A[j] > key) {
A[j + 1] ... | #include <stdio.h>
#include <stdlib.h>
int main() {
int i, j, k, length, key, *A;
scanf("%d", &length);
A = (int *)malloc(sizeof(int) * length);
for (j = 0; j < length; j++)
scanf("%d", &A[j]);
for (i = 0; i < length; i++) {
key = A[i];
j = i - 1;
while (j >= 0 && A[j] > key) {
A[j + 1] ... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13]] | 0 | 200 | 2 |
#include <stdio.h>
static const int N = 1000;
void trace(int A[], int n) {
int i;
for (i = 1; i <= n; i++) {
if (i > 1)
printf(" ");
printf("%d", A[i]);
}
printf("\n");
}
int main() {
int n, i, j;
int A[N + 1];
// n = Length
scanf("%d", &n);
for (i = 1; i <= n; i++)
scanf("%d",... | #include <stdio.h>
static const int N = 1000;
void trace(int A[], int n) {
int i;
for (i = 1; i <= n; i++) {
if (i > 1)
printf(" ");
printf("%d", A[i]);
}
printf("\n");
}
int main() {
int n, i, j;
int A[N + 1];
scanf("%d", &n);
for (i = 1; i <= n; i++)
scanf("%d", &A[i]);
trac... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["-", 0, 52, 15, 23, 0, 16, 31, 16, 17, 20], ["+", 0, 52, 15, 23, 0, 16, 31, 16, 17, 47]] | 0 | 218 | 4 |
#include <stdio.h>
#define N 100
int main() {
int n, i, j;
int tmp, key;
int A[N];
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
for (i = 1; i < n; i++) {
for (j = 0; j < n; j++) {
printf("%d ", A[j]);
}
printf("%d", A[n]);
printf("\n");
key = A[i];
j = i ... | #include <stdio.h>
#define N 100
int main() {
int n, i, j;
int tmp, key;
int A[N];
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
for (i = 1; i <= n; i++) {
for (j = 0; j < n - 1; j++) {
printf("%d ", A[j]);
}
printf("%d", A[n - 1]);
printf("\n");
key = A[i];
... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["+", 0, 2, 3, 4, 0, 69, 71, 16, 17, 33], ["+", 0, 2, 3, 4, 0, 69, 71, 16, 12, 13]] | 0 | 181 | 6 |
#include <stdio.h>
void trace(int A[], int N) {
int i;
for (i = 0; i < N; i++) {
if (i > 0)
printf(" ");
printf("%d", A[i]);
}
printf("\n");
}
void insertionSort(int A[], int N) {
int i, j, v;
for (i = 1; i < N - 1; i++) {
v = A[i];
j = i - 1;
while (j >= 0 && A[j] > v) {
A... | #include <stdio.h>
void trace(int A[], int N) {
int i;
for (i = 0; i < N; i++) {
if (i > 0)
printf(" ");
printf("%d", A[i]);
}
printf("\n");
}
void insertionSort(int A[], int N) {
int i, j, v;
for (i = 1; i < N; i++) {
v = A[i];
j = i - 1;
while (j >= 0 && A[j] > v) {
A[j +... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 0 | 234 | 2 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.