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 |
|---|---|---|---|---|---|
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
/**
* Created by hwzheng on 2017/3/27.
*/
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader Reader =
new BufferedReader(new InputStreamReader(System.in));
int N ... | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
/**
* Created by hwzheng on 2017/3/27.
*/
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader Reader =
new BufferedReader(new InputStreamReader(System.in));
int N ... | [["+", 0, 7, 8, 196, 0, 7, 8, 196, 0, 46], ["-", 0, 7, 8, 196, 0, 57, 64, 196, 0, 46]] | 3 | 343 | 2 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int num = sc.nextInt();
int[] array = new int[num];
for (int i = 0; i < num; i++) {
array[i] = sc.nextInt();
}
int temp = 0, count = 0, minj = 0;
for (int i = ... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int num = sc.nextInt();
int[] array = new int[num];
for (int i = 0; i < num; i++) {
array[i] = sc.nextInt();
}
int temp = 0, count = 0, minj = 0;
for (int i = ... | [["-", 0, 57, 15, 15, 0, 16, 31, 504, 71, 22], ["+", 0, 57, 15, 15, 0, 16, 31, 504, 71, 22], ["-", 8, 196, 0, 57, 15, 15, 0, 16, 17, 60], ["+", 8, 196, 0, 57, 15, 15, 0, 16, 17, 79], ["-", 8, 196, 0, 7, 502, 503, 49, 200, 51, 499], ["+", 8, 196, 0, 7, 502, 503, 49, 200, 51, 499], ["-", 0, 195, 8, 196, 0, 1, 0, 492, 141... | 3 | 243 | 8 |
#! /usr/bin/ruby -w
# encoding: utf-8
#
# ??????????????????
#
def puts_array(a)
sep = ''
a.each do |e|
print sep + e.to_s
sep = ' '
end
puts
end
def bubble_sort(a, n)
count = 0
0.upto(n - 1) do |i|
(n - 1).downto(i + 1) do |j|
e1 = a[j]
e2 = a[j - 1]
if e1 < e2
a[j] ... | #! /usr/bin/ruby -w
# encoding: utf-8
#
# ??????????????????
#
def puts_array(a)
sep = ''
a.each do |e|
print sep + e.to_s
sep = ' '
end
puts
end
def bubble_sort(a, n)
count = 0
0.upto(n - 1) do |i|
(n - 1).downto(i + 1) do |j|
e1 = a[j]
e2 = a[j - 1]
if e1 < e2
a[j] ... | [["+", 0, 493, 0, 121, 64, 749, 0, 652, 735, 22], ["+", 0, 121, 64, 749, 0, 652, 3, 4, 0, 24], ["+", 0, 121, 64, 749, 0, 652, 3, 4, 0, 22], ["+", 0, 121, 64, 749, 0, 652, 3, 4, 0, 25]] | 4 | 146 | 4 |
class Array
def swap!(a, b)
self[a], self[b] = self[b], self[a]
self
end
end
def bubble_sort(array)
isSorted = false
count = 0
index = 0
until isSorted do
swaped = false
(array.length - 1).downto(index) do |comp_index|
break if comp_index.zero?
if array[comp_index] < array[comp_... | class Array
def swap!(a, b)
self[a], self[b] = self[b], self[a]
self
end
end
def bubble_sort(array)
isSorted = false
count = 0
index = 0
until isSorted do
swaped = false
(array.length - 1).downto(index) do |comp_index|
break if comp_index.zero?
if array[comp_index] < array[comp_... | [["-", 0, 121, 64, 749, 0, 652, 3, 4, 0, 22], ["+", 0, 121, 64, 749, 0, 652, 3, 4, 0, 22], ["-", 0, 652, 3, 4, 0, 739, 0, 738, 31, 22], ["+", 0, 652, 3, 4, 0, 739, 0, 738, 31, 22]] | 4 | 153 | 4 |
n = gets.to_i
a = gets.chomp.split.map(&:to_i)
count = 0
1.upto(n-1) do |i|
(n-1).downto(i) do |j|
if a[j-1] > a[j]
a[j-1], a[j] = a[j], a[j-1]
count += 1
end
end
end
puts a, count | n = gets.to_i
a = gets.chomp.split.map(&:to_i)
count = 0
1.upto(n-1) do |i|
(n-1).downto(i) do |j|
if a[j-1] > a[j]
a[j-1], a[j] = a[j], a[j-1]
count += 1
end
end
end
puts a.join(' '), count | [["+", 0, 493, 0, 652, 3, 4, 0, 652, 17, 131], ["+", 0, 493, 0, 652, 3, 4, 0, 652, 735, 22], ["+", 0, 652, 3, 4, 0, 652, 3, 4, 0, 24], ["+", 3, 4, 0, 652, 3, 4, 0, 557, 0, 62], ["+", 3, 4, 0, 652, 3, 4, 0, 557, 0, 6], ["+", 0, 652, 3, 4, 0, 652, 3, 4, 0, 25]] | 4 | 92 | 7 |
len = gets.to_i
nums = gets.split.map(&:to_i)
cnt = 0
0.upto(len-1) do |i|
(len-1).downto(i+1) do |j|
if nums[j] < nums[j-1]
nums[j], nums[j-1] = nums[j-1], nums[j]
cnt += 1
end
end
end
puts cnt | len = gets.to_i
nums = gets.split.map(&:to_i)
cnt = 0
0.upto(len-1) do |i|
(len-1).downto(i+1) do |j|
if nums[j] < nums[j-1]
nums[j], nums[j-1] = nums[j-1], nums[j]
cnt += 1
end
end
end
puts nums * ' '
puts cnt | [["+", 0, 493, 0, 652, 3, 4, 0, 738, 31, 22], ["+", 0, 493, 0, 652, 3, 4, 0, 738, 17, 48], ["+", 0, 652, 3, 4, 0, 738, 12, 557, 0, 62], ["+", 0, 652, 3, 4, 0, 738, 12, 557, 0, 6], ["+", 36, 36, 36, 36, 0, 493, 0, 652, 735, 22]] | 4 | 90 | 6 |
n = int(input())
s = list(map(int, input().strip().split(' ')))
e = int()
e = 0
flag = True
while flag:
flag = False
for i in range(n - 1, 0, -1):
if s[i] < s[i - 1]:
s[i - 1], s[i] = s[i], s[i - 1]
e = e + 1
flag = True
for i in range(0 , len... | n = int(input())
s = list(map(int, input().strip().split(' ')))
e = int()
e = 0
flag = True
while flag:
flag = False
for i in range(n - 1, 0, -1):
if s[i] < s[i - 1]:
s[i - 1], s[i] = s[i], s[i - 1]
e = e + 1
flag = True
for i in range(0 , len... | [["-", 0, 7, 8, 196, 0, 57, 15, 666, 0, 612], ["+", 0, 57, 15, 666, 0, 657, 31, 652, 63, 22], ["+", 15, 666, 0, 657, 31, 652, 3, 4, 0, 24], ["+", 15, 666, 0, 657, 31, 652, 3, 4, 0, 22], ["+", 15, 666, 0, 657, 31, 652, 3, 4, 0, 25], ["+", 8, 196, 0, 57, 15, 666, 0, 657, 17, 33], ["+", 8, 196, 0, 57, 15, 666, 0, 657, 12,... | 5 | 152 | 7 |
n = int(input())
a = map(int,input().split())
flag = True
c = 0
while flag:
flag = False
for j in range(n-1,1,-1):
if(a[j] < a[j-1]):
a[j],a[j-1] = a[j-1],a[j]
flag = 1
c += 1
print(*a)
print(c)
| n = int(input())
a = list(map(int,input().split()))
flag = True
c = 0
while flag:
flag = False
for j in range(n-1,0,-1):
if(a[j] < a[j-1]):
a[j],a[j-1] = a[j-1],a[j]
flag = True
c += 1
print(*a)
print(c)
| [["+", 0, 656, 0, 1, 0, 662, 12, 652, 63, 22], ["+", 0, 1, 0, 662, 12, 652, 3, 4, 0, 24], ["+", 0, 1, 0, 662, 12, 652, 3, 4, 0, 25], ["-", 8, 196, 0, 7, 12, 652, 3, 4, 0, 612], ["+", 8, 196, 0, 7, 12, 652, 3, 4, 0, 612], ["-", 0, 57, 64, 196, 0, 1, 0, 662, 12, 612], ["+", 0, 57, 64, 196, 0, 1, 0, 662, 12, 146]] | 5 | 102 | 7 |
N=int(input())
A=list(map(int,input().split()))
count=0
i=N-1
while i>=0:
j=0
while j<=i:
if A[N-1-j]<A[N-2-j]:
(A[N-1-j],A[N-2-j])=(A[N-2-j],A[N-1-j])
count+=1
j+=1
i-=1
print(' '.join(map(str,A)))
print(count) | N=int(input())
A=list(map(int,input().split()))
count=0
i=N-1
while i>0:
j=0
while j<i:
if A[N-1-j]<A[N-2-j]:
(A[N-1-j],A[N-2-j])=(A[N-2-j],A[N-1-j])
count+=1
#print(' '.join(map(str,A)))
j+=1
i-=1
print(' '.join(map(str,A)))
print(count) | [["-", 36, 36, 0, 656, 0, 52, 15, 666, 667, 20], ["+", 36, 36, 0, 656, 0, 52, 15, 666, 667, 47], ["-", 0, 52, 8, 196, 0, 52, 15, 666, 667, 19], ["+", 0, 52, 8, 196, 0, 52, 15, 666, 667, 18]] | 5 | 133 | 4 |
N = int(input())
num_list = list(map(int, input().split()))
c = 0
flag = 1
while flag==1:
flag =0
for j in range(N-1,0,-1):
if num_list[j] < num_list[j-1]:
a = num_list[j]
num_list[j] = numlist[j-1]
num_list[j-1] = a
c += 1
flag =1
print(" ".... | N = int(input())
num_list = list(map(int, input().split()))
c = 0
flag = 1
while flag==1:
flag =0
for j in range(N-1,0,-1):
if num_list[j] < num_list[j-1]:
a = num_list[j]
num_list[j] = num_list[j-1]
num_list[j-1] = a
c += 1
flag =1
print(" "... | [["-", 64, 196, 0, 1, 0, 662, 12, 206, 51, 22], ["+", 64, 196, 0, 1, 0, 662, 12, 206, 51, 22]] | 5 | 118 | 2 |
def input_data():
num = input()
array = []
array = num.strip().split(" ")
array = list(map(int, array))
return array
def main():
n = input()
count = 0
array = input_data()
flag = True
i = 0
while flag:
flag = False
for j in reversed(range(i + 1, int(n))):
... | def input_data():
num = input()
array = []
array = num.strip().split(" ")
array = list(map(int, array))
return array
def main():
n = input()
count = 0
array = input_data()
flag = True
i = 0
while flag:
flag = False
for j in reversed(range(i + 1, int(n))):
... | [["-", 0, 57, 64, 196, 0, 1, 0, 652, 63, 22], ["-", 64, 196, 0, 1, 0, 652, 3, 4, 0, 24], ["-", 64, 196, 0, 1, 0, 652, 3, 4, 0, 22], ["-", 64, 196, 0, 1, 0, 652, 3, 4, 0, 25]] | 5 | 179 | 4 |
import sys
lines = sys.stdin.readlines()
N = lines[0]
A = lines[1].strip().split(" ")
flag = 1
c = 0
i = 0
while flag == 1:
flag = 0
for j in reversed(list(range(i+1,len(A)))):
if A[j] < A[j-1]:
a = A[j]
b = A[j-1]
A[j] = b
A[j-1] = a
flag ... | import sys
lines = sys.stdin.readlines()
N = lines[0]
A = lines[1].strip().split(" ")
flag = 1
c = 0
i = 0
while flag == 1:
flag = 0
for j in reversed(list(range(i+1,len(A)))):
if int(A[j]) < int(A[j-1]):
a = A[j]
b = A[j-1]
A[j] = b
A[j-1] = 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 | 137 | 6 |
N = int(input())
A = input().split(" ")
count = 0
flag = 1
i = 0
while flag == 1:
flag = 0
for j in reversed(list(range(i+1, N))):
if A[j] < A[j-1]:
temp = A[j]
A[j] = A[j-1]
A[j-1] = temp
count += 1
flag = 1
i += 1
print(" ".join(A))... | N = int(input())
A = input().split(" ")
count = 0
flag = 1
i = 0
while flag == 1:
flag = 0
for j in reversed(list(range(i+1, N))):
if int(A[j]) < int(A[j-1]):
temp = A[j]
A[j] = A[j-1]
A[j-1] = temp
count += 1
flag = 1
i += 1
print(" ... | [["+", 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 | 117 | 6 |
N = int(input())
A = list(map(int, input().split()))
def bubble_sort(A, N):
cnt = 0
flag = True
while(flag):
flag = False
for i in range(N-1, 1, -1):
if(A[i-1] > A[i]):
tmp = A[i-1]
A[i-1] = A[i]
A[i] = tmp
cnt += ... | N = int(input())
A = list(map(int, input().split()))
def bubble_sort(A, N):
cnt = 0
flag = True
while(flag):
flag = False
for i in range(N-1, 0, -1):
if(A[i-1] > A[i]):
tmp = A[i-1]
A[i-1] = A[i]
A[i] = tmp
cnt += ... | [["-", 8, 196, 0, 7, 12, 652, 3, 4, 0, 612], ["+", 8, 196, 0, 7, 12, 652, 3, 4, 0, 612], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 25], ["-", 36, 36, 0, 656, 0, 1, 0, 652, 63, 22], ["-", 0, 656, 0, 1, 0, 652, 3, 4, 0, 24], ["-", 0, 1, 0, 652, 3, 4, 0, 661, 0, 48], ["-", 0, 1, 0, 652, 3, 4, 0, 661, 0, 22]] | 5 | 142 | 7 |
n = int(input())
data = [int(i) for i in input().split(' ')]
def bubble_sort(raw_list):
n_list = len(raw_list)
n_swap = 0
sorted_i = 0
flag = True
while flag:
flag = False
for j in reversed(range(sorted_i, n_list)):
if raw_list[j] < raw_list[j-1]:
raw_lis... | n = int(input())
data = [int(i) for i in input().split(' ')]
def bubble_sort(raw_list):
n_list = len(raw_list)
n_swap = 0
sorted_i = 1
flag = True
while flag:
flag = False
for j in reversed(range(sorted_i, n_list)):
if raw_list[j] < raw_list[j-1]:
raw_lis... | [["-", 0, 14, 8, 196, 0, 1, 0, 662, 12, 612], ["+", 0, 14, 8, 196, 0, 1, 0, 662, 12, 612]] | 5 | 142 | 2 |
def trace(a,n) :
li=[]
for i in range(n):
li.append(str(a[i]))
print((" ".join(li)))
def bubblesort(a,n):
flag=1
ct=0
while flag:
flag=0
if n==0:
break
else :
for i in range(n-1,0,-1):
if a[i]<a[i-1]:
... | def trace(a,n) :
li=[]
for i in range(n):
li.append(str(a[i]))
print((" ".join(li)))
def bubblesort(a,n):
flag=1
ct=0
while flag:
flag=0
if n==0:
break
else :
for i in range(n-1,0,-1):
if a[i]<a[i-1]:
... | [["-", 12, 652, 3, 4, 0, 652, 3, 4, 0, 22], ["+", 12, 652, 3, 4, 0, 652, 3, 4, 0, 22]] | 5 | 177 | 2 |
N = int(input())
A = list(map(int, input().split()))
i = 0
flag = 1
while flag:
flag = 0
for j in range(N-1, i, -1):
if A[j] < A[j-1]:
A_j = A[j]
A[j] = A[j-1]
A[j-1] = A_j
flag = 1
i += 1
print(" ".join(map(str, A)))
print(i) | N = int(input())
A = list(map(int, input().split()))
i = 0
flag = 1
while flag:
flag = 0
for j in range(N-1, 0, -1):
if A[j] < A[j-1]:
A_j = A[j]
A[j] = A[j-1]
A[j-1] = A_j
flag = 1
i += 1
print(" ".join(map(str, A)))
print(i) | [["-", 8, 196, 0, 7, 12, 652, 3, 4, 0, 22], ["+", 8, 196, 0, 7, 12, 652, 3, 4, 0, 612]] | 5 | 116 | 2 |
#coding: UTF-8
a = int(input())
N = list(map(int, input().split()))
c = 0
for i in range(a - 1):
for j in range(a-1, i,-1):
if N[j] < N[j - 1]:
tmp = N[j]
N[j] = N[j - 1]
N[j - 1] = tmp
for i in range(a - 1):
print(N[i],end=' ')
print(N[a-1]);
print(c); | #coding: UTF-8
a = int(input())
N = list(map(int, input().split()))
c = 0
for i in range(a - 1):
for j in range(a-1, i,-1):
if N[j] < N[j - 1]:
c+=1
tmp = N[j]
N[j] = N[j - 1]
N[j - 1] = tmp
for i in range(a - 1):
print(N[i],end=' ')
print(N[a-1]);
pri... | [["+", 0, 57, 64, 196, 0, 1, 0, 677, 31, 22], ["+", 0, 57, 64, 196, 0, 1, 0, 677, 17, 107], ["+", 0, 57, 64, 196, 0, 1, 0, 677, 12, 612]] | 5 | 130 | 3 |
def show_list(a):
for x in a:
print(x, end=' ')
print()
def bubble_sort(a,n):
flag = True
count = 0
while flag:
flag = False
for j in reversed(range(1,n)):
if a[j] < a[j-1]:
tmp = a[j]
a[j] = a[j-1]
a[j-1] = tmp
... | def show_list(a):
for x in a:
print(x, end=' ')
print()
def bubble_sort(a,n):
flag = True
count = 0
while flag:
flag = False
for j in reversed(range(1,n)):
if a[j] < a[j-1]:
tmp = a[j]
a[j] = a[j-1]
a[j-1] = tmp
... | [["-", 0, 14, 8, 196, 0, 1, 0, 652, 63, 22], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 24], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 22], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 25]] | 5 | 159 | 4 |
# -*- coding: utf-8 -*-
def bubble_sort(a, N):
change = 0
for i in range(N - 1):
for j in range(N - 1, i, -1):
if a[j - 1] < a[j]:
temp = a[j - 1]
a[j - 1] = a[j]
a[j] = temp
change += 1
return (a, change)
if __name__ == ... | # -*- coding: utf-8 -*-
def bubble_sort(a, N):
change = 0
for i in range(N - 1):
for j in range(N - 1, i, -1):
if a[j - 1] > a[j]:
temp = a[j - 1]
a[j - 1] = a[j]
a[j] = temp
change += 1
return (a, change)
if __name__ ==... | [["-", 0, 7, 8, 196, 0, 57, 15, 666, 667, 18], ["+", 0, 7, 8, 196, 0, 57, 15, 666, 667, 47], ["-", 3, 4, 0, 652, 63, 319, 500, 557, 0, 6], ["+", 3, 4, 0, 652, 63, 319, 500, 557, 0, 6]] | 5 | 147 | 4 |
N = int(input())
A = list(map(int, input().split()))
def bubblesort(A, N):
flag = True
i = 0
cnt = 0
while flag:
flag = False
for j in range(N-1, i, -1):
if A[j] < A[j-1]:
A[j], A[j-1] = A[j-1], A[j]
flag = True
cnt += 1
... | N = int(input())
A = list(map(int, input().split()))
def bubblesort(A, N):
flag = True
i = 0
cnt = 0
while flag:
flag = False
for j in range(N-1, i, -1):
if A[j] < A[j-1]:
A[j], A[j-1] = A[j-1], A[j]
flag = True
cnt += 1
... | [["-", 0, 656, 0, 14, 8, 196, 0, 37, 0, 38], ["-", 0, 656, 0, 14, 8, 196, 0, 37, 0, 22], ["+", 8, 196, 0, 1, 0, 652, 3, 4, 0, 22], ["+", 8, 196, 0, 1, 0, 652, 3, 4, 0, 25], ["-", 0, 652, 3, 4, 0, 652, 3, 4, 0, 25]] | 5 | 124 | 5 |
def bubbleSort(A, N):
swap_count = 0
flag = True
while flag:
flag = False
for j in range(N-1, 0, -1):
if A[j] < A[j-1]:
A[j], A[j-1] = A[j-1], A[j]
flag = True
swap_count += 1
print(A)
return swap_count
n = int(... | def bubbleSort(A, N):
swap_count = 0
flag = True
while flag:
flag = False
for j in range(N-1, 0, -1):
if A[j] < A[j-1]:
A[j], A[j-1] = A[j-1], A[j]
flag = True
swap_count += 1
return swap_count
n = int(input())
A = list(map(int... | [["-", 0, 57, 64, 196, 0, 1, 0, 652, 63, 22], ["-", 64, 196, 0, 1, 0, 652, 3, 4, 0, 24], ["-", 64, 196, 0, 1, 0, 652, 3, 4, 0, 22], ["-", 64, 196, 0, 1, 0, 652, 3, 4, 0, 25]] | 5 | 125 | 4 |
cnt = 0
n = int(input())
lst = list(map(int, input().split()))
for i in range(n):
for j in range(n-1,i,-1):
if lst[j] < lst[j-1]:
lst[j-1:j+1] = lst[j], lst[j-1]
cnt += 1
print(lst)
print(cnt) | cnt = 0
n = int(input())
lst = list(map(int, input().split()))
for i in range(n):
for j in range(n-1,i,-1):
if lst[j] < lst[j-1]:
lst[j-1:j+1] = lst[j], lst[j-1]
cnt += 1
print(*lst)
print(cnt) | [["+", 0, 1, 0, 652, 3, 4, 0, 661, 0, 48]] | 5 | 97 | 1 |
n = int(input())
list = [int(i) for i in input().split()]
def bubble(list):
flag = 1
count = 0
while flag == 1:
flag = 0
for i in range(len(list)-1):
if list[len(list)-1-i] < list[len(list)-1-i-1]:
x = list[len(list)-i-1]
list[len(list)-1-i] = li... | n = int(input())
list = [int(i) for i in input().split()]
def bubble(list):
flag = 1
count = 0
while flag == 1:
flag = 0
for i in range(len(list)-1):
if list[len(list)-1-i] < list[len(list)-1-i-1]:
x = list[len(list)-i-1]
list[len(list)-1-i] = li... | [["-", 0, 57, 64, 196, 0, 1, 0, 652, 63, 22], ["-", 64, 196, 0, 1, 0, 652, 3, 4, 0, 24], ["-", 64, 196, 0, 1, 0, 652, 3, 4, 0, 22], ["-", 64, 196, 0, 1, 0, 652, 3, 4, 0, 25]] | 5 | 227 | 4 |
N = int(input())
A = (int(n) for n in input().split())
flag = 1
num_c = 0
while(flag):
flag = 0
for j in range(1, N):
if A[j] < A[j-1]:
v = A[j]
A[j] = A[j-1]
A[j-1] = v
num_c += 1
flag = 1
print((" ").join((str(a) for a in A)))
print(num_c) | N = int(input())
A = [int(n) for n in input().split()]
flag = 1
num_c = 0
while(flag):
flag = 0
for j in range(1, N):
if A[j] < A[j-1]:
v = A[j]
A[j] = A[j-1]
A[j-1] = v
num_c += 1
flag = 1
print((" ").join((str(a) for a in A)))
print(num_c... | [["-", 0, 656, 0, 1, 0, 662, 12, 668, 0, 24], ["+", 0, 656, 0, 1, 0, 662, 12, 658, 0, 70], ["-", 12, 668, 0, 659, 12, 652, 3, 4, 0, 25], ["+", 0, 656, 0, 1, 0, 662, 12, 658, 0, 73]] | 5 | 120 | 4 |
#
# coding: utf-8
def bubbleSort(arr, n):
flag = True
swap_num = 0
while flag:
flag = False
for j in range(n-1, 0, -1):
if arr[j] < arr[j-1]:
arr[j], arr[j-1] = arr[j-1], arr[j]
swap_num += 1
flag = True
pass
retur... | #
# coding: utf-8
def bubbleSort(arr, n):
flag = True
swap_num = 0
while flag:
flag = False
for j in range(n-1, 0, -1):
if arr[j] < arr[j-1]:
arr[j], arr[j-1] = arr[j-1], arr[j]
swap_num += 1
flag = True
pass
retur... | [["-", 0, 652, 3, 4, 0, 652, 3, 4, 0, 22], ["+", 0, 652, 3, 4, 0, 652, 3, 4, 0, 22]] | 5 | 135 | 2 |
n = int(input())
s = input().split(" ")
nums = list(map(int,s))
flag = 1
koukan = 0
while flag:
flag = 0
for i in range(n-1, 0, -1):
if nums[i] < nums[i-1]:
w = nums[i]
nums[i] = nums[i-1]
nums[i-1] = w
koukan += 1
flag = 1
for i in range(n):
... | n = int(input())
s = input().split(" ")
nums = list(map(int,s))
flag = 1
koukan = 0
while flag:
flag = 0
for i in range(n-1, 0, -1):
if nums[i] < nums[i-1]:
w = nums[i]
nums[i] = nums[i-1]
nums[i-1] = w
koukan += 1
flag = 1
for i in range(n):
... | [["+", 0, 652, 3, 4, 0, 653, 51, 557, 0, 6]] | 5 | 142 | 1 |
n = int(input())
a = [int(x) for x in input().split()]
c = 0
for i in range(n):
for j in range(i + 1, n):
if a[j - 1] > a[j]:
tmp = a[j - 1]
a[j - 1] = a[j]
a[j] = tmp
c += 1
print(" ".join([str(x) for x in a]))
print(c) | n = int(input())
a = [int(x) for x in input().split()]
c = 0
for i in range(n):
for j in range(1, n):
if a[j - 1] > a[j]:
tmp = a[j - 1]
a[j - 1] = a[j]
a[j] = tmp
c += 1
print(" ".join([str(x) for x in a]))
print(c) | [["-", 0, 7, 12, 652, 3, 4, 0, 657, 31, 22], ["-", 0, 7, 12, 652, 3, 4, 0, 657, 17, 72]] | 5 | 114 | 2 |
import sys
def swap(a, i, j):
tmp = a[j]
a[j] = a[i]
a[i] = tmp
return a
def list_to_string(a):
s = ""
for n in a:
s += str(n) + " "
return s.strip()
num = int(sys.stdin.readline().strip())
array = [int(x) for x in sys.stdin.readline().strip().split(" ")]
flag = True
swap_num = ... | import sys
def swap(a, i, j):
tmp = a[j]
a[j] = a[i]
a[i] = tmp
return a
def list_to_string(a):
s = ""
for n in a:
s += str(n) + " "
return s.strip()
num = int(sys.stdin.readline().strip())
array = [int(x) for x in sys.stdin.readline().strip().split(" ")]
flag = True
swap_num = ... | [["-", 64, 196, 0, 1, 0, 652, 3, 4, 0, 22], ["+", 64, 196, 0, 1, 0, 652, 3, 4, 0, 22]] | 5 | 185 | 2 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
??????????????????
??????????????????????????????????????¨?????????????????????Bubble??????
?°´??¢???????????£???????????????????????????????´????????????????????????????
??????????????????????¬???????????????¢?????´???????????§??°????????????????????????????????????
1... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
??????????????????
??????????????????????????????????????¨?????????????????????Bubble??????
?°´??¢???????????£???????????????????????????????´????????????????????????????
??????????????????????¬???????????????¢?????´???????????§??°????????????????????????????????????
1... | [["+", 0, 52, 8, 196, 0, 1, 0, 662, 31, 22], ["+", 0, 52, 8, 196, 0, 1, 0, 662, 0, 32], ["+", 0, 52, 8, 196, 0, 1, 0, 662, 12, 147], ["-", 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, 147]] | 5 | 166 | 6 |
n=int(input())
nums=list(map(int,input().split()))
k=0
for i in range(len(nums)-1):
for j in range(len(nums)-1,i,-1):
print(i,j)
if nums[j]<nums[j-1]:
nums[j],nums[j-1]=nums[j-1],nums[j]
k+=1
print(*nums)
print(k) | n=int(input())
nums=list(map(int,input().split()))
k=0
for i in range(len(nums)-1):
for j in range(len(nums)-1,i,-1):
if nums[j]<nums[j-1]:
nums[j],nums[j-1]=nums[j-1],nums[j]
k+=1
print(*nums)
print(k) | [["-", 0, 7, 8, 196, 0, 1, 0, 652, 63, 22], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 24], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 22], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 21], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 25]] | 5 | 113 | 6 |
n=int(input())
z=list(map(int,input().split()))
flag=1
a=0
cnt=0
while flag:
flag=0
for i in reversed(range(a,n)):
if i ==0:
break
if z[i]<z[i-1]:
tmp=z[i]
z[i]=z[i-1]
z[i-1]=tmp
flag=1
cnt+=1
print(z)
a+=1
prin... | n=int(input())
z=list(map(int,input().split()))
flag=1
a=0
cnt=0
while flag:
flag=0
for i in reversed(range(a,n)):
if i ==0:
break
if z[i]<z[i-1]:
tmp=z[i]
z[i]=z[i-1]
z[i-1]=tmp
flag=1
cnt+=1
a+=1
print(' '.jo... | [["-", 0, 7, 8, 196, 0, 1, 0, 652, 63, 22], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 24], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 22], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 25]] | 5 | 133 | 4 |
N = int(input())
A = list(map(int, input().split()))
if __name__ == '__main__':
cnt = 0
for i in range(N):
for j in range(N-1, i, -1):
if j > 0 and A[j-1] > A[j]:
A[j-1], A[j] = A[j], A[j-1]
cnt += 1
print(" ".join(map(str, A)))
pritn(cnt)
| N = int(input())
A = list(map(int, input().split()))
if __name__ == '__main__':
cnt = 0
for i in range(N):
for j in range(N-1, i, -1):
if j > 0 and A[j-1] > A[j]:
A[j-1], A[j] = A[j], A[j-1]
cnt += 1
print(" ".join(map(str, A)))
print(cnt)
| [["-", 0, 57, 64, 196, 0, 1, 0, 652, 63, 22], ["+", 0, 57, 64, 196, 0, 1, 0, 652, 63, 22]] | 5 | 121 | 2 |
N = int(input())
A = list(map(int, input().split()))
if __name__ == '__main__':
flag = True
cnt = 0
while flag:
flag = False
for i in range(N-1, 1, -1):
if A[i] < A[i-1]:
A[i], A[i-1] = A[i-1], A[i]
cnt += 1
flag = True
print("... | N = int(input())
A = list(map(int, input().split()))
if __name__ == '__main__':
flag = True
cnt = 0
while flag:
flag = False
for i in range(N-1, 0, -1):
if A[i] < A[i-1]:
A[i], A[i-1] = A[i-1], A[i]
cnt += 1
flag = True
print("... | [["-", 8, 196, 0, 7, 12, 652, 3, 4, 0, 612], ["+", 8, 196, 0, 7, 12, 652, 3, 4, 0, 612]] | 5 | 121 | 2 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int size = 0, time = 0, minij, b = 0;
size = sc.nextInt();
int[] a = new int[size];
for (int i = 0; i < size; i++) {
a[i] = sc.nextInt();
}
for (int v = 0; v <... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int size = 0, time = 0, minij, b = 0;
size = sc.nextInt();
int[] a = new int[size];
for (int i = 0; i < size; i++) {
a[i] = sc.nextInt();
}
for (int v = 0; v <... | [["-", 8, 196, 0, 57, 15, 15, 0, 16, 17, 60], ["+", 8, 196, 0, 57, 15, 15, 0, 16, 17, 79], ["-", 0, 7, 8, 196, 0, 57, 64, 93, 0, 94], ["-", 0, 7, 8, 196, 0, 57, 64, 93, 0, 35], ["+", 0, 7, 8, 196, 0, 57, 64, 196, 0, 45], ["+", 0, 7, 8, 196, 0, 57, 64, 196, 0, 46]] | 3 | 252 | 6 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int i, j;
int count = 0;
int min;
int minnum;
int n = sc.nextInt();
int A[] = new int[n];
for (i = 0; i < n; i++) {
A[i] = sc.nextInt();
}
for (i =... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int i, j;
int count = 0;
int min;
int minnum;
int n = sc.nextInt();
int A[] = new int[n];
for (i = 0; i < n; i++) {
A[i] = sc.nextInt();
}
for (i =... | [["-", 8, 196, 0, 1, 0, 11, 12, 91, 17, 33], ["-", 8, 196, 0, 1, 0, 11, 12, 91, 439, 499], ["+", 8, 196, 0, 1, 0, 11, 12, 504, 516, 22], ["+", 8, 196, 0, 1, 0, 11, 12, 504, 0, 70], ["+", 8, 196, 0, 1, 0, 11, 12, 504, 71, 22], ["+", 8, 196, 0, 1, 0, 11, 12, 504, 0, 73]] | 3 | 273 | 6 |
import java.awt.datatransfer.FlavorEvent;
import java.util.Scanner;
import javax.sound.midi.SysexMessage;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
String str = sc.nextLine();
String str2[] = str.split(" ");
int ints[] ... | import java.awt.datatransfer.FlavorEvent;
import java.util.Scanner;
import javax.sound.midi.SysexMessage;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
String str = sc.nextLine();
String str2[] = str.split(" ");
int ints[] ... | [["-", 8, 196, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 196, 0, 7, 15, 16, 12, 16, 12, 499]] | 3 | 290 | 4 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int[] A;
A = new int[N];
int i;
for (i = 0; i < N; i++) {
A[i] = sc.nextInt();
}
int count = 0;
for (int j = 0; j < A.length - ... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int[] A;
A = new int[N];
int i;
for (i = 0; i < N; i++) {
A[i] = sc.nextInt();
}
int count = 0;
for (int j = 0; j < A.length - ... | [["+", 0, 7, 8, 196, 0, 7, 8, 196, 0, 46], ["-", 0, 7, 8, 196, 0, 7, 8, 196, 0, 46]] | 3 | 270 | 2 |
import java.util.Scanner;
public class Main {
static Scanner sc = new Scanner(System.in);
public static void main(String[] args) {
int n = sc.nextInt();
int[] A = inpNum(n);
selectionSort(A);
sc.close();
}
private static void selectionSort(int[] A) {
int cnt = 0;
for (int i = 0; i <... | import java.util.Scanner;
public class Main {
static Scanner sc = new Scanner(System.in);
public static void main(String[] args) {
int n = sc.nextInt();
int[] A = inpNum(n);
selectionSort(A);
sc.close();
}
private static void selectionSort(int[] A) {
int cnt = 0;
for (int i = 0; i <... | [["+", 0, 7, 8, 196, 0, 7, 8, 196, 0, 46], ["-", 0, 7, 8, 196, 0, 57, 64, 196, 0, 46]] | 3 | 305 | 2 |
import java.io.*;
import java.util.List;
import java.util.StringTokenizer;
public class Main {
int[] arr;
int size;
int swaps;
public static void main(String[] args) {
Main g = new Main();
g.readArray();
g.selectionSort();
g.printArray();
System.out.println("\n" + g.swaps);
}
... | import java.io.*;
import java.util.List;
import java.util.StringTokenizer;
public class Main {
int[] arr;
int size;
int swaps;
public static void main(String[] args) {
Main g = new Main();
g.readArray();
g.selectionSort();
g.printArray();
System.out.println("\n" + g.swaps);
}
... | [["-", 8, 196, 0, 57, 15, 15, 0, 16, 17, 79], ["+", 8, 196, 0, 57, 15, 15, 0, 16, 17, 18]] | 3 | 544 | 2 |
import java.io.*;
import java.lang.*;
import java.util.*;
public class Main {
static final int INF = 1000000000;
public static void main(String[] args) throws Exception {
Scanner input = new Scanner(System.in);
int n = input.nextInt();
int[] a = new int[n];
for (int i = 0; i < n; ++i)
a[i] =... | import java.io.*;
import java.lang.*;
import java.util.*;
public class Main {
static final int INF = 1000000000;
public static void main(String[] args) throws Exception {
Scanner input = new Scanner(System.in);
int n = input.nextInt();
int[] a = new int[n];
for (int i = 0; i < n; ++i)
a[i] =... | [["-", 64, 196, 0, 1, 0, 11, 12, 504, 516, 22], ["-", 64, 196, 0, 1, 0, 11, 12, 504, 0, 70], ["-", 64, 196, 0, 1, 0, 11, 12, 504, 71, 22], ["-", 64, 196, 0, 1, 0, 11, 12, 504, 0, 73], ["+", 0, 57, 64, 196, 0, 1, 0, 11, 12, 22]] | 3 | 261 | 5 |
#include <stdio.h>
int sort(int a[], int n) {
int i, j, minj, temp;
int cnt = 0;
for (i = 0; i < n - 1; i++) {
minj = i;
for (j = n - 1; j > i; j--) {
if (a[j] < a[minj]) {
minj = j;
}
}
if (minj != i) {
cnt++;
temp = a[i];
a[i] = a[minj];
a[minj] = te... | #include <stdio.h>
int sort(int a[], int n) {
int i, j, minj, temp;
int cnt = 0;
for (i = 0; i < n - 1; i++) {
minj = i;
for (j = i + 1; j < n; j++) {
if (a[j] < a[minj]) {
minj = j;
}
}
if (minj != i) {
cnt++;
temp = a[i];
a[i] = a[minj];
a[minj] = te... | [["-", 8, 9, 0, 7, 10, 11, 12, 16, 31, 22], ["-", 8, 9, 0, 7, 10, 11, 12, 16, 17, 33], ["+", 8, 9, 0, 7, 10, 11, 12, 16, 31, 22], ["+", 8, 9, 0, 7, 10, 11, 12, 16, 17, 72], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 47], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, ... | 0 | 249 | 10 |
#include <stdio.h>
int main() {
int n, minj, box, cnt = 0;
scanf("%d", &n);
int A[n];
for (int x = 0; x < n; x++) {
scanf("%d", &A[x]);
}
for (int i = 0; i < n; i++) {
minj = i;
for (int j = i; j < n; j++) {
if (A[j] < A[minj]) {
minj = j;
}
}
if (minj != 0) {
... | #include <stdio.h>
int main() {
int n, minj, box, cnt = 0;
scanf("%d", &n);
int A[n];
for (int x = 0; x < n; x++) {
scanf("%d", &A[x]);
}
for (int i = 0; i < n; i++) {
minj = i;
for (int j = i; j < n; j++) {
if (A[j] < A[minj]) {
minj = j;
}
}
if (minj != i) {
... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 12, 22]] | 0 | 221 | 2 |
#include <stdio.h>
int minsearch(int a[], int number, int size) {
int minnum = size - 1;
for (int i = number; i < size; i++) {
if (a[minnum] > a[i]) {
minnum = i;
}
}
return minnum;
}
int main() {
int a, i;
int min, temp;
int r[100];
int num = 0;
scanf("%d", &a);
for (i = 0; i < a; ... | #include <stdio.h>
int minsearch(int a[], int number, int size) {
int minnum = number;
for (int i = number; i < size; i++) {
if (a[minnum] > a[i]) {
minnum = i;
}
}
return minnum;
}
int main() {
int a, i;
int min, temp;
int r[100];
int num = 0;
scanf("%d", &a);
for (i = 0; i < a; i+... | [["-", 8, 9, 0, 43, 49, 50, 51, 16, 31, 22], ["-", 8, 9, 0, 43, 49, 50, 51, 16, 17, 33], ["-", 8, 9, 0, 43, 49, 50, 51, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 22], ["-", 0, 11, 12, 2, 3, 4, 0, 16, 17, 72], ["-", 0, 11, 12, 2, 3, 4, 0, 16, 12, 13]] | 0 | 247 | 6 |
#include <stdio.h>
//選択ソート
int selectionSort(int A[], int N) {
int i, j, t, sw = 0, minj; // tはswapのための変数
for (i = 0; i < N - 1; i++) {
minj = i;
for (j = i; j < N; j++) {
if (A[j] < A[minj])
minj = j; //ここで最小値を探している
}
t = A[i];
A[i] = A[minj];
A[minj] = t; // swap処理,A[i]は未ソート部... | #include <stdio.h>
//選択ソート
int selectionSort(int A[], int N) {
int i, j, t, sw = 0, minj; // tはswapのための変数
for (i = 0; i < N - 1; i++) {
minj = i;
for (j = i; j < N; j++) {
if (A[j] < A[minj])
minj = j; //ここで最小値を探している
}
t = A[i];
A[i] = A[minj];
A[minj] = t; // swap処理,A[i]は未ソート部... | [["+", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67]] | 0 | 245 | 1 |
// Selection Sort
#include <stdio.h>
#include <stdlib.h>
main() {
int n;
int *a; //配列用ポインタ
int minj;
int c; //交換回数
int i, j, tmp;
scanf("%d", &n);
a = (int *)malloc(sizeof(int) * n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
c = 0;
for (i = 0; i < n; i++) {
minj = i;
for... | // Selection Sort
#include <stdio.h>
#include <stdlib.h>
main() {
int n;
int *a; //配列用ポインタ
int minj;
int c; //交換回数
int i, j, tmp;
scanf("%d", &n);
a = (int *)malloc(sizeof(int) * n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
c = 0;
for (i = 0; i < n; i++) {
minj = i;
for... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 31, 22], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 31, 22], ["-", 0, 7, 8, 9, 0, 7, 26, 27, 28, 22], ["+", 0, 7, 8, 9, 0, 7, 26, 27, 28, 22]] | 0 | 240 | 4 |
#include <stdio.h>
#define N 100
int main(void) {
int tmp, n, i, mini, j, A[N], cnt = 0;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
for (i = 0; i < n; i++) {
mini = i;
for (j = i; j < n; j++) {
if (A[j] < A[mini])
mini = j;
}
if (mini != i) {
tmp ... | #include <stdio.h>
#define N 100
int main(void) {
int tmp, n, i, mini, j, A[N], cnt = 0;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
for (i = 0; i < n; i++) {
mini = i;
for (j = i; j < n; j++) {
if (A[j] < A[mini])
mini = j;
}
if (mini != i) {
tmp ... | [["-", 0, 1, 0, 2, 3, 4, 0, 16, 17, 33], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 0 | 221 | 2 |
#include <stdio.h>
int main(void) {
int num, i, j, a[100], count = 0, min, n, x = 0;
scanf("%d", &num);
for (i = 0; i < num; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < num; i++) {
min = a[i];
for (j = num - 1; j > i - 1; j--) {
if (min > a[j]) {
min = a[j];
x = j;
}
... | #include <stdio.h>
int main(void) {
int num, i, j, a[100], count = 0, min, n, x = 0;
scanf("%d", &num);
for (i = 0; i < num; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < num; i++) {
min = a[i];
for (j = num - 1; j > i - 1; j--) {
if (min >= a[j]) {
min = a[j];
x = j;
}
... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 20]] | 0 | 244 | 2 |
#include <stdio.h>
#define N 100
int main() {
int n, i, j, A[N];
int mini, swap, count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
for (i = 0; i < n - 1; i++) {
mini = i;
for (j = i + 1; j < n; j++)
if (A[mini] > A[j])
mini = j;
if (mini != i) {
... | #include <stdio.h>
#define N 100
int main() {
int n, i, j, A[N];
int mini, swap, count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
for (i = 0; i < n - 1; i++) {
mini = i;
for (j = i + 1; j < n; j++)
if (A[mini] > A[j])
mini = j;
if (mini != i) {
... | [["-", 8, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 8, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 206 | 2 |
#include <stdio.h>
#define N 100
int main() {
int i, j, m, count = 0, minj, tmp;
int A[N];
scanf("%d", &m);
for (i = 0; i < m; i++) {
scanf("%d", &A[i]);
}
for (i = 0; i <= m - 1; i++) {
minj = i;
for (j = i; j <= m - 1; j++) {
if (A[j] < A[minj]) {
minj = j;
}
}
i... | #include <stdio.h>
#define N 100
int main() {
int i, j, m, count = 0, minj, tmp;
int A[N];
scanf("%d", &m);
for (i = 0; i < m; i++) {
scanf("%d", &A[i]);
}
for (i = 0; i <= m - 1; i++) {
minj = i;
for (j = i; j <= m - 1; j++) {
if (A[j] < A[minj]) {
minj = j;
}
}
i... | [["-", 0, 7, 8, 9, 0, 57, 64, 93, 0, 94], ["+", 0, 7, 8, 9, 0, 57, 64, 116, 0, 117]] | 0 | 218 | 2 |
#include <stdio.h>
int main() {
int i, a[100], j, n, minj, sw, count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < n; i++) {
minj = i;
for (j = i; j < n; j++) {
if (a[j] < a[minj]) {
minj = j;
}
}
sw = a[i];
a[i] = a[... | #include <stdio.h>
int main() {
int i, a[100], j, n, minj, sw, count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < n; i++) {
minj = i;
for (j = i; j < n; j++) {
if (a[j] < a[minj]) {
minj = j;
}
}
sw = a[i];
a[i] = a[... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 214 | 2 |
#include <stdio.h>
#define X 100
int main() {
int N, i, A[X], flag = 1, j, temp, count = 0, minj;
scanf("%d", &N);
if (N >= 1 && N <= 100) {
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
i = 0;
for (i = 0; i < N; i++) {
minj = i;
for (j = i; j <= N; j++) {
if (A[j] < ... |
#include <stdio.h>
#define X 100
int main() {
int N, i, A[X], flag = 1, j, temp, count = 0, minj;
scanf("%d", &N);
if (N >= 1 && N <= 100) {
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
i = 0;
for (i = 0; i < N; i++) {
minj = i;
for (j = i; j < N; j++) {
if (A[j] < ... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18]] | 0 | 239 | 2 |
#include <stdio.h>
int main() {
int i, j, n, tmp, min, cnt = 0;
int arr[100];
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &arr[i]);
for (i = 0; i < n; i++) {
min = i;
for (j = 0; j < n; j++)
if (arr[min] > arr[j])
min = j; //最小値の添字を検索
if (i != min) {
tmp = ar... | #include <stdio.h>
int main() {
int i, j, n, tmp, min, cnt = 0;
int arr[100];
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &arr[i]);
for (i = 0; i < n; i++) {
min = i;
for (j = i; j < n; j++)
if (arr[min] > arr[j])
min = j; //最小値の添字を検索
if (i != min) {
tmp = ... | [["-", 0, 7, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 7, 8, 9, 0, 7, 10, 11, 12, 22]] | 0 | 202 | 2 |
#include <stdio.h>
#include <stdlib.h>
int main() {
int N, i, j, minj, box, count = 1;
int *A;
scanf("%d", &N);
A = malloc(sizeof(int) * N);
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
for (i = 0; i < N; i++) {
minj = i;
for (j = i; j < N; j++)
if (A[j] < A[minj])
minj = ... | #include <stdio.h>
#include <stdlib.h>
int main() {
int N, i, j, minj, box, count = 0;
int *A;
scanf("%d", &N);
A = malloc(sizeof(int) * N);
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
for (i = 0; i < N; i++) {
minj = i;
for (j = i; j < N; j++)
if (A[j] < A[minj])
minj = ... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 0 | 224 | 2 |
#include <stdio.h>
int main() {
int i, j, min, max, n, a[100], esc, count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &a[i]);
if (n == 1)
printf("%d\n0\n", a[0]);
else {
for (i = 0; i < n - 1; i++) {
min = i;
for (j = i + 1; j < n; j++) {
if (a[j] < a[min]) {
... | #include <stdio.h>
int main() {
int i, j, min, max, n, a[100], esc, count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &a[i]);
if (n == 1)
printf("%d\n0\n", a[0]);
else {
for (i = 0; i < n - 1; i++) {
min = i;
for (j = i + 1; j < n; j++) {
if (a[j] < a[min]) {
... | [["-", 0, 7, 8, 9, 0, 57, 64, 93, 0, 94], ["+", 0, 7, 8, 9, 0, 57, 64, 116, 0, 117]] | 0 | 239 | 2 |
#include <stdio.h>
int main() {
int N, num[100];
int i, j, res, min, count = 0;
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &num[i]);
}
for (i = 0; i <= N - 1; i++) {
min = i;
for (j = i; j <= N - 1; j++) {
if (num[j] < num[min]) {
min = j;
}
}
if (num... | #include <stdio.h>
int main() {
int N, num[100];
int i, j, res, min, count = 0;
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &num[i]);
}
for (i = 0; i <= N - 1; i++) {
min = i;
for (j = i; j <= N - 1; j++) {
if (num[j] < num[min]) {
min = j;
}
}
if (num... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 0 | 227 | 2 |
#include <stdio.h>
void selectionSort(int, int[]);
int main() {
int n;
int data[100];
int minj;
int i;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &data[i]);
}
selectionSort(n, data);
return 0;
}
void selectionSort(int num, int data[]) {
int i, j, minj, change, count = 0;
... |
#include <stdio.h>
void selectionSort(int, int[]);
int main() {
int n;
int data[100];
int minj;
int i;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &data[i]);
}
selectionSort(n, data);
return 0;
}
void selectionSort(int num, int data[]) {
int i, j, minj, change, count = 0;
... | [["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46]] | 0 | 267 | 2 |
#include <stdio.h>
int main() {
int i;
int j;
int n;
int a[100];
int count = 0;
int minj;
int tmp;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < n - 1; i++) {
minj = i;
for (j = i; j < n; j++) {
if (a[j] < a[minj])
minj = j;
}
... | #include <stdio.h>
int main() {
int i;
int j;
int n;
int a[100];
int count = 0;
int minj;
int tmp;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < n - 1; i++) {
minj = i;
for (j = i; j < n; j++) {
if (a[j] < a[minj])
minj = j;
}
... | [["-", 0, 1, 0, 2, 3, 4, 0, 16, 17, 33], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 0 | 223 | 2 |
#include <stdio.h>
void selectionSort(int A[], int n) {
int i, temp, count = 0, j;
int minj;
for (i = 0; i <= n - 1; i++) {
minj = i;
for (j = i; j <= n - 1; j--) {
if (A[j] < A[minj]) {
minj = j;
}
}
temp = A[i];
A[i] = A[minj];
A[minj] = temp;
if (i != minj)
... | #include <stdio.h>
void selectionSort(int A[], int n) {
int i, temp, count = 0, j;
int minj;
for (i = 0; i <= n - 1; i++) {
minj = i;
for (j = i; j <= n - 1; j++) {
if (A[j] < A[minj]) {
minj = j;
}
}
temp = A[i];
A[i] = A[minj];
A[minj] = temp;
if (i != minj)
... | [["-", 0, 7, 8, 9, 0, 7, 26, 27, 17, 68], ["+", 0, 7, 8, 9, 0, 7, 26, 27, 17, 29]] | 0 | 256 | 2 |
#include <stdio.h>
#define N 100
int selectionSort(int[], int);
int main() {
int n, a[N], i, cnt = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
cnt = selectionSort(a, n);
printf("%d", a[0]);
for (i = 1; i < n; i++) {
printf(" %d", a[i]);
}
printf("\n");
printf("%d... | #include <stdio.h>
#define N 100
int selectionSort(int[], int);
int main() {
int n, a[N], i, cnt = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
cnt = selectionSort(a, n);
printf("%d", a[0]);
for (i = 1; i < n; i++) {
printf(" %d", a[i]);
}
printf("\n");
printf("%d... | [["+", 0, 7, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 7, 8, 9, 0, 7, 8, 9, 0, 46]] | 0 | 257 | 2 |
/*昇順の選択ソート*/
#include <stdio.h>
#include <stdlib.h>
int main() {
int flag = 1;
int flag_count = 0;
int key;
int judge = 0;
int n;
int i, j = 0;
int *array;
int min;
scanf("%d", &n);
array = (int *)malloc(n * sizeof(int));
for (i = 0; i < n; i++) {
scanf("%d", array + i);
}
while (1) {
... | /*昇順の選択ソート*/
#include <stdio.h>
#include <stdlib.h>
int main() {
int flag = 1;
int flag_count = 0;
int key;
int judge = 0;
int n;
int i, j = 0;
int *array;
int min;
scanf("%d", &n);
array = (int *)malloc(n * sizeof(int));
for (i = 0; i < n; i++) {
scanf("%d", array + i);
}
while (1) {
... | [["-", 0, 57, 15, 23, 0, 16, 12, 16, 12, 13], ["+", 0, 57, 15, 23, 0, 16, 12, 16, 12, 13]] | 0 | 248 | 2 |
#include <stdio.h>
#include <stdlib.h>
int sort(int *x, int n);
void ShowData(int *x, int n);
int main() {
int *p;
int i;
int n;
int count;
scanf("%d", &n);
p = (int *)malloc(n * sizeof(int)); //メモリ領域の確保
for (i = 0; i < n; i++)
scanf("%d", &p[i]);
count = sort(p, n);
ShowData(p, n);
print... | #include <stdio.h>
#include <stdlib.h>
int sort(int *x, int n);
void ShowData(int *x, int n);
int main() {
int *p;
int i;
int n;
int count;
scanf("%d", &n);
p = (int *)malloc(n * sizeof(int)); //メモリ領域の確保
for (i = 0; i < n; i++)
scanf("%d", &p[i]);
count = sort(p, n);
ShowData(p, n);
print... | [["+", 0, 57, 15, 23, 0, 16, 12, 69, 28, 22], ["+", 0, 57, 15, 23, 0, 16, 12, 69, 0, 70], ["+", 0, 57, 15, 23, 0, 16, 12, 69, 0, 73]] | 0 | 325 | 3 |
#include <stdio.h>
int main() {
int i = 0, j = 0, n = 0, count = 0, temp;
int minj;
scanf("%d", &n);
int A[n];
for (i = 0; i < n; i++) {
scanf("%d", A[i]);
}
for (i = 0; i < n; i++) {
minj = i;
for (j = i; j < n; j++) {
if (A[j] < A[minj]) {
minj = j;
}
}
if (i != ... | #include <stdio.h>
int main() {
int i = 0, j = 0, n = 0, count = 0, temp;
int minj;
scanf("%d", &n);
int A[n];
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
for (i = 0; i < n; i++) {
minj = i;
for (j = i; j < n; j++) {
if (A[j] < A[minj]) {
minj = j;
}
}
if (i !=... | [["+", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67]] | 0 | 211 | 1 |
#include <stdio.h>
int selectionsort(int[100], int N);
int main() {
int A[100], N, i, x;
scanf("%d", &N);
for (i = 0; i < N; i++)
scanf("%d", &A[i]);
x = selectionsort(A, N);
for (i = 0; i < N - 1; i++)
printf("%d ", A[i]);
printf("%d\n", A[N - 1]);
printf("%d\n", x);
return 0;
}
int selectio... | #include <stdio.h>
int selectionsort(int A[100], int N);
int main() {
int A[100], N, i, x;
scanf("%d", &N);
for (i = 0; i < N; i++)
scanf("%d", &A[i]);
x = selectionsort(A, N);
for (i = 0; i < N - 1; i++)
printf("%d ", A[i]);
printf("%d\n", A[N - 1]);
printf("%d\n", x);
return 0;
}
int select... | [["+", 49, 53, 54, 55, 0, 56, 49, 80, 49, 22], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 0 | 257 | 3 |
#include <stdio.h>
#define Num 100
int main() {
int i, j, n;
int count = 0;
int mj, stock;
int a[Num];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < n; i++) {
mj = 1;
for (j = i; j < n; j++) {
if (a[j] < a[mj])
mj = j;
}
if (i != ... | #include <stdio.h>
#define Num 100
int main() {
int i, j, n;
int count = 0;
int mj, stock;
int a[Num];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < n; i++) {
mj = i;
for (j = i; j < n; j++) {
if (a[j] < a[mj])
mj = j;
}
if (i != ... | [["-", 0, 7, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 12, 22]] | 0 | 223 | 2 |
#include <stdio.h>
void selectionSort(int *, int);
int main() {
int i, N, A[100];
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
selectionSort(A, N);
return 0;
}
void selectionSort(int *A, int N) {
int i, j, minj, x, count = 0;
for (i = 0; i < N; i++) {
minj = i;
for (... | #include <stdio.h>
void selectionSort(int *, int);
int main() {
int i, N, A[100];
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
selectionSort(A, N);
return 0;
}
void selectionSort(int *A, int N) {
int i, j, minj, x, count = 0;
for (i = 0; i < N; i++) {
minj = i;
for (... | [["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 7, 8, 9, 0, 7, 8, 9, 0, 46]] | 0 | 240 | 2 |
#include <stdio.h>
#include <stdlib.h>
int SelSort(int *, int);
void ShowData(int *, int);
int main() {
int i, n, N;
int *P;
scanf("%d", &n);
P = (int *)malloc(n * sizeof(int));
for (i = 0; i < n; i++) {
scanf("%d", &P[i]);
}
N = SelSort(P, n);
ShowData(P, n);
printf("%d\n", N);
return 0;
}
... | #include <stdio.h>
#include <stdlib.h>
int SelSort(int *, int);
void ShowData(int *, int);
int main() {
int i, n, N;
int *P;
scanf("%d", &n);
P = (int *)malloc(n * sizeof(int));
for (i = 0; i < n; i++) {
scanf("%d", &P[i]);
}
N = SelSort(P, n);
ShowData(P, n);
printf("%d\n", N);
return 0;
}
... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 321 | 2 |
#include <stdio.h>
int main() {
int A[101], n, i, j, t, sw = 0, mini;
scanf("%d", &n);
for (i = 1; i <= n; i++)
scanf("%d", &A[i]);
for (i = 2; i <= n; i++) {
mini = i;
for (j = i; j <= n; j++) {
if (A[j] < A[mini])
mini = j;
}
t = A[i];
A[i] = A[mini];
A[mini] = t;
... | #include <stdio.h>
int main() {
int A[101], n, i, j, t, sw = 0, mini;
scanf("%d", &n);
for (i = 1; i <= n; i++)
scanf("%d", &A[i]);
for (i = 1; i <= n; i++) {
mini = i;
for (j = i; j <= n; j++) {
if (A[j] < A[mini])
mini = j;
}
t = A[i];
A[i] = A[mini];
A[mini] = t;
... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13]] | 0 | 207 | 2 |
#include <stdio.h>
#define N 101
int main() {
int i, j, n, key, count = 0, array[N], mini;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &array[i]);
}
for (i = 0; i < n; i++) {
mini = i;
for (j = i; j < n; j++) {
if (array[j] < array[mini]) {
mini = j;
}
}
... | #include <stdio.h>
#define N 101
int main() {
int i, j, n, key = 0, count = 0, array[N], mini;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &array[i]);
}
for (i = 0; i < n; i++) {
mini = i;
for (j = i; j < n; j++) {
if (array[j] < array[mini]) {
mini = j;
}
... | [["+", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 60], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 79]] | 0 | 224 | 4 |
#include <stdio.h>
#define A 100
int main() {
int b, c, d = 0, e, f;
int a[A];
int s;
scanf("%d", &e);
for (b = 1; b <= e; b++) {
scanf("%d", &a[b]);
}
for (b = 1; b <= e; b++) {
s = b;
for (c = b; c <= e; c++)
if (a[s] > a[c])
s = c;
if (a[s] < a[b]) {
f = a[b];... | #include <stdio.h>
#define A 100
int main() {
int b, c, d = 0, e, f;
int a[A];
int s;
scanf("%d", &e);
for (b = 1; b <= e; b++) {
scanf("%d", &a[b]);
}
for (b = 1; b <= e; b++) {
s = b;
for (c = b; c <= e; c++)
if (a[s] > a[c])
s = c;
if (a[s] < a[b]) {
f = a[b];... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 220 | 2 |
#include <stdio.h>
#define N 100
int main() {
int i, j, lengh, key, A[N], mini, count = 0, k;
scanf("%d", &lengh);
for (i = 1; i <= lengh; i++) {
scanf("%d", &A[i]);
}
for (i = 1; i <= lengh; i++) {
mini = i;
for (j = i; j <= lengh; j++) {
if (A[j] < A[mini]) {
mini = j;
}
... | #include <stdio.h>
#define N 100
int main() {
int i, j, lengh, key, A[N], mini, count = 0, k;
scanf("%d", &lengh);
for (i = 1; i <= lengh; i++) {
scanf("%d", &A[i]);
}
for (i = 1; i <= lengh; i++) {
mini = i;
for (j = i; j <= lengh; j++) {
if (A[j] < A[mini]) {
mini = j;
}
... | [["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46], ["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46]] | 0 | 218 | 2 |
#include <stdio.h>
main() {
int i, j, a[100], s, mini, p, count = 0;
scanf("%d", &s);
for (i = 0; i < s; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < s - 2; i++) {
mini = i;
for (j = i + 1; j < s; j++) {
if (a[j] < a[mini])
mini = j;
}
p = a[i];
a[i] = a[mini];
a[mini... | #include <stdio.h>
main() {
int i, j, a[100], s, mini, p, count = 0;
scanf("%d", &s);
for (i = 0; i < s; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < s; i++) {
mini = i;
for (j = i; j < s; j++) {
if (a[j] < a[mini])
mini = j;
}
p = a[i];
a[i] = a[mini];
a[mini] = p;
... | [["-", 0, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 0, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["-", 8, 9, 0, 7, 10, 11, 12, 16, 17, 72], ["-", 8, 9, 0, 7, 10, 11, 12, 16, 12, 13]] | 0 | 209 | 4 |
#include <stdio.h>
#define N 100
int main() {
int i, j, minj, count = 0, n, kk;
int A[N];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
for (i = 0; i < n; i++) {
minj = i;
for (j = i; j < n; j++) {
if (A[j] < A[minj]) {
minj = j;
}
}
kk = A[i];
... | #include <stdio.h>
#define N 100
int main() {
int i, j, minj, count = 0, n, kk;
int A[N];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
for (i = 0; i < n; i++) {
minj = i;
for (j = i; j < n; j++) {
if (A[j] < A[minj]) {
minj = j;
}
}
kk = A[i];
... | [["-", 0, 57, 64, 1, 0, 11, 12, 16, 12, 13], ["+", 0, 57, 64, 1, 0, 11, 12, 16, 12, 13]] | 0 | 219 | 2 |
#include <stdio.h>
int rep = 0;
void selectionSort(int *A, int N) {
int i, j, minj, temp;
for (i = 0; i < N - 1; i++) {
minj = i;
for (j = i; j < N; j++) {
if (A[j] < A[minj]) {
minj = j;
}
}
if (A[i] != A[minj])
rep++;
temp = A[i];
A[i] = A[minj];
A[minj] =... | #include <stdio.h>
int rep = 0;
void selectionSort(int *A, int N) {
int i, j, minj, temp;
for (i = 0; i < N - 1; i++) {
minj = i;
for (j = i; j < N; j++) {
if (A[j] < A[minj]) {
minj = j;
}
}
if (A[i] != A[minj])
rep++;
temp = A[i];
A[i] = A[minj];
A[minj] =... | [["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 62], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["+", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24]] | 0 | 245 | 7 |
#include <stdio.h>
int main(void) {
int i, j, k = 0, t;
int N, A[100], minj;
scanf("%d", &N);
for (i = 0; i < N; i++)
scanf("%d", &A[i]);
for (i = 0; i < N - 1; i++) {
minj = i;
for (j = i; j < N; j++) {
if (A[j] < A[minj]) {
minj = j;
}
t = A[i];
A[i] = A[minj]... | #include <stdio.h>
int main(void) {
int i, j, k = 0, t;
int N, A[100], minj;
scanf("%d", &N);
for (i = 0; i < N; i++)
scanf("%d", &A[i]);
for (i = 0; i < N - 1; i++) {
minj = i;
for (j = i; j < N; j++) {
if (A[j] < A[minj])
minj = j;
}
t = A[i];
A[i] = A[minj];
A[... | [["-", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["-", 0, 7, 8, 9, 0, 7, 8, 9, 0, 46]] | 0 | 213 | 2 |
#include <stdio.h>
int selectionSort(int A[], int N) {
int i, j, minj, s, count;
count = 0;
for (i = 0; i < N - 1; i++) {
minj = i;
for (j = 0; j < N; j++) {
if (A[j] < A[minj]) {
minj = j;
}
}
s = A[i];
A[i] = A[minj];
A[minj] = s;
if (i != minj) {
count... | #include <stdio.h>
int selectionSort(int A[], int N) {
int i, j, minj, s, count;
count = 0;
for (i = 0; i < N - 1; i++) {
minj = i;
for (j = i; j < N; j++) {
if (A[j] < A[minj]) {
minj = j;
}
}
s = A[i];
A[i] = A[minj];
A[minj] = s;
if (i != minj) {
count... | [["-", 0, 7, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 7, 8, 9, 0, 7, 10, 11, 12, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22]] | 0 | 262 | 4 |
#include <stdio.h>
int main(void) {
int i, j, t, n, x = 0, minj;
int a[100];
scanf("%d", &n);
for (i = 0; i < n - 1; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < n; i++) {
minj = i;
for (j = i; j < n; j++) {
if (a[j] < a[minj]) {
minj = j;
}
t = a[i];
a[i] = a[... | #include <stdio.h>
int main(void) {
int i, j, t, n, x = 0, minj;
int a[100];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < n - 1; i++) {
minj = i;
for (j = i; j < n; j++) {
if (a[j] < a[minj])
minj = j;
}
t = a[i];
a[i] = a[minj];
... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["-", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["-", 0, 7, 8, 9, 0, 7, 8, 9, 0, 46]] | 0 | 215 | 6 |
#include <stdio.h>
int trump[101] = {};
int n;
int main(void) {
scanf("%d", &n);
int i, j;
for (i = 0; i < n; i++) {
scanf("%d", &trump[i]);
}
int count = 0;
int minj;
for (i = 0; i < n; i++) {
minj = i;
for (j = i; j < n; j++) {
if (trump[j] < trump[minj]) {
minj = j;
}
... | #include <stdio.h>
int trump[101] = {};
int n;
int main(void) {
scanf("%d", &n);
int i, j;
for (i = 0; i < n; i++) {
scanf("%d", &trump[i]);
}
int count = 0;
int minj, c;
for (i = 0; i < n; i++) {
minj = i;
for (j = i; j < n; j++) {
if (trump[j] < trump[minj]) {
minj = j;
... | [["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 8, 9, 0, 57, 64, 9, 0, 43, 39, 40], ["-", 64, 9, 0, 43, 49, 50, 51, 69, 71, 22], ["+", 64, 9, 0, 1, 0, 11, 12, 69, 71, 22], ["-", 64, 9, 0, 1, 0, 11, 31, 69, 71, 22], ["+", 64, 9, 0, 1, 0, 11, 31, 69, 71, 22]] | 0 | 216 | 7 |
#include <stdio.h>
#define N 100
int main(void) {
int i, n, j, t, k, minj, A[N], fmin;
int count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
for (i = 0; i < n; i++) {
minj = i;
fmin = minj;
for (j = i; j < n; j++) {
if (A[j] < A[minj])
minj = j;
}
... | #include <stdio.h>
#define N 100
int main(void) {
int i, n, j, t, k, minj, A[N], fmin;
int count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
for (i = 0; i < n; i++) {
minj = i;
fmin = minj;
for (j = i; j < n; j++) {
if (A[j] < A[minj])
minj = j;
}
... | [["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46]] | 0 | 215 | 2 |
#include <stdio.h>
int main(void) {
int flag = 1, i, j, minj, n, swap, changes = 0, a[100];
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &a[i]);
for (i = 0; i < n; i++) {
minj = i;
for (j = i; j < n; j++) {
if (a[j] < a[minj])
minj = j;
}
if (a[j] != a[minj]) {
sw... | #include <stdio.h>
int main(void) {
int flag = 1, i, j, minj, n, swap, changes = 0, a[100];
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &a[i]);
for (i = 0; i < n; i++) {
minj = i;
for (j = i; j < n; j++) {
if (a[j] < a[minj])
minj = j;
}
if (a[i] != a[minj]) {
sw... | [["-", 0, 57, 15, 23, 0, 16, 31, 69, 71, 22], ["+", 0, 57, 15, 23, 0, 16, 31, 69, 71, 22]] | 0 | 215 | 2 |
#include <stdio.h>
#include <stdlib.h>
void swap(int *a, int *b) {
int temp;
temp = *a;
*a = *b;
*b = temp;
}
int selection_sort(int a[], int n) {
int i, j;
int minj;
int sw = 0;
for (i = 0; i < n; i++) {
minj = i;
for (j = i; j < n; j++) {
if (a[minj] > a[j]) {
minj = j;
... | #include <stdio.h>
#include <stdlib.h>
void swap(int *a, int *b) {
int temp;
temp = *a;
*a = *b;
*b = temp;
}
int selection_sort(int a[], int n) {
int i, j;
int minj;
int sw = 0;
for (i = 0; i < n; i++) {
minj = i;
for (j = i; j < n; j++) {
if (a[minj] > a[j]) {
minj = j;
... | [["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 62], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["+", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24]] | 0 | 267 | 7 |
#include <stdio.h>
int main() {
int i, j, n, a[100], minj, cmp, cnt = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < n; i++) {
minj = i;
for (j = i; j < n; j++) {
if (a[i] < a[minj]) {
minj = j;
}
if (i != minj) {
cmp = a[i];
... | #include <stdio.h>
int main() {
int i, j, n, a[100], minj, cmp, cnt = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < n; i++) {
minj = i;
for (j = i; j < n; j++) {
if (a[j] < a[minj]) {
minj = j;
}
}
if (i != minj) {
cmp = a[i]... | [["-", 0, 57, 15, 23, 0, 16, 31, 69, 71, 22], ["+", 0, 57, 15, 23, 0, 16, 31, 69, 71, 22], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46], ["-", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46], ["+", 0, 2, 3, 4, 0, 69, 71, 16, 17, 33], ["+", 0, 2, 3, 4, 0, 69, 71, 16, 12, 13]] | 0 | 206 | 6 |
#include <stdio.h>
int main() {
int A[100], N, a, count = 0, i, j, minj;
scanf("%d", &N);
for (j = 0; j < N; j++) {
scanf("%d", &A[j]);
}
for (i = 0; i < N - 2; i++) {
minj = i;
for (j = i; j < N; j++) {
if (A[j] < A[minj]) {
minj = j;
}
}
a = A[i];
A[i] = A[minj... | #include <stdio.h>
int main() {
int A[100], N, a, count = 0, i, j, minj;
scanf("%d", &N);
for (j = 0; j < N; j++) {
scanf("%d", &A[j]);
}
for (i = 0; i < N - 1; i++) {
minj = i;
for (j = i; j <= N - 1; j++) {
if (A[j] < A[minj]) {
minj = j;
}
}
a = A[i];
A[i] = A... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33]] | 0 | 212 | 6 |
#include <stdio.h>
static const int N = 1000;
int main() {
int i, j, A[N], length, swap, count = 0, mini;
scanf("%d", &length);
for (i = 0; i < length; i++) {
scanf("%d", &A[i]);
}
for (i = 0; i < length - 2; i++) {
mini = i;
for (j = i; j <= length - 1; j++) {
if (A[j] < A[mini]) {
... | #include <stdio.h>
static const int N = 1000;
int main() {
int i, j, A[N], length, swap, count = 0, mini;
scanf("%d", &length);
for (i = 0; i < length; i++) {
scanf("%d", &A[i]);
}
for (i = 0; i <= length - 2; i++) {
mini = i;
for (j = i; j <= length - 1; j++) {
if (A[j] < A[mini]) {
... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 0 | 230 | 2 |
#include <stdio.h>
int main(void) {
int n, i, j, temp, count = 0, min = 9999999, flag = -1;
scanf("%d", &n);
int r[n];
for (i = 0; i < n; i++) {
scanf("%d", &r[i]);
}
for (i = 0; i < n; i++) {
for (j = i + 1; j < n; j++) {
if (r[j] < min) {
min = r[j];
flag = j;
}
... | #include <stdio.h>
int main(void) {
int n, i, j, temp, count = 0, min = 9999999, flag = -1;
scanf("%d", &n);
int r[n];
for (i = 0; i < n; i++) {
scanf("%d", &r[i]);
}
for (i = 0; i < n; i++) {
for (j = i + 1; j < n; j++) {
if (r[j] < min) {
min = r[j];
flag = j;
}
... | [["+", 0, 7, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 7, 8, 9, 0, 7, 8, 9, 0, 46]] | 0 | 240 | 2 |
#include <stdio.h>
int ss(int A[], int N) {
int i, j, t, sw = 0, miji;
for (i = 0; i < N - 1; i++) {
miji = i;
for (j = i; j < N; j++) {
if (A[j] < A[miji]) {
miji = j;
}
}
t = A[i];
A[i] = A[miji];
A[miji] = t;
if (i != miji)
sw++;
}
return sw;
}
int main()... | #include <stdio.h>
int ss(int A[], int N) {
int i, j, t, sw = 0, miji;
for (i = 0; i < N - 1; i++) {
miji = i;
for (j = i; j < N; j++) {
if (A[j] < A[miji])
miji = j;
}
t = A[i];
A[i] = A[miji];
A[miji] = t;
if (i != miji)
sw++;
}
return sw;
}
int main() {
int N... | [["-", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["-", 0, 7, 8, 9, 0, 7, 8, 9, 0, 46], ["+", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67]] | 0 | 246 | 3 |
#include <stdio.h>
int selectionSort(int A[], int N) {
int i, minj, j, x, cnt = 0;
for (i = 0; i < N - 1; i++) {
minj = i;
for (j = i; j < N - 1; j++) {
if (A[j] < A[minj]) {
minj = j;
}
}
x = A[i];
A[i] = A[minj];
A[minj] = x;
if (i != minj)
cnt++;
}
retu... | #include <stdio.h>
int selectionSort(int A[], int N) {
int i, minj, j, x, cnt = 0;
for (i = 0; i < N - 1; i++) {
minj = i;
for (j = i; j < N; j++) {
if (A[j] < A[minj]) {
minj = j;
}
}
x = A[i];
A[i] = A[minj];
A[minj] = x;
if (i != minj)
cnt++;
}
return c... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 0 | 247 | 2 |
#include <stdio.h>
int selectionSort(int A[], int N) {
int i, j, t, sw = 0, minj;
for (i = 0; i < N - 1; i++) {
minj = i;
for (j = i; j < N; j++) {
if (A[j] < A[minj]) {
minj = j;
}
}
t = A[i];
A[i] = A[minj];
A[minj] = t;
if (i != minj)
sw++;
return sw;
... | #include <stdio.h>
int selectionSort(int A[], int N) {
int i, j, t, sw = 0, minj;
for (i = 0; i < N - 1; i++) {
minj = i;
for (j = i; j < N; j++) {
if (A[j] < A[minj]) {
minj = j;
}
}
t = A[i];
A[i] = A[minj];
A[minj] = t;
if (i != minj)
sw++;
}
return sw;
... | [["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46]] | 0 | 241 | 2 |
#include <stdio.h>
int main() {
int n, i, j, minj, swap;
int a[100] = {0};
int count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < n; i++) {
minj = i;
for (j = i; j < n; j++) {
if (a[j] < a[minj]) {
minj = j;
}
}
if (i != ... | #include <stdio.h>
int main() {
int n, i, j, minj, swap;
int a[100] = {0};
int count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < n; i++) {
minj = i;
for (j = i; j < n; j++) {
if (a[j] < a[minj]) {
minj = j;
}
}
if (i != ... | [["-", 64, 9, 0, 1, 0, 11, 12, 69, 28, 22], ["-", 64, 9, 0, 1, 0, 11, 12, 69, 0, 70], ["-", 64, 9, 0, 1, 0, 11, 12, 69, 71, 22], ["-", 64, 9, 0, 1, 0, 11, 12, 69, 0, 73], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 12, 22]] | 0 | 228 | 5 |
#include <stdio.h>
int selectsort(int a[], int N) {
int i, j, s, z, minj;
s = 0;
z = 0;
for (i = 0; i < N - 1; i++) {
minj = i;
for (j = i; j < N - 1; j++) {
if (a[j] < a[minj]) {
minj = j;
}
}
z = a[i];
a[i] = a[minj];
a[minj] = z;
if (i != minj) {
s++;
... | #include <stdio.h>
int selectsort(int a[], int N) {
int i, j, s, z, minj;
s = 0;
z = 0;
for (i = 0; i < N - 1; i++) {
minj = i;
for (j = i; j < N; j++) {
if (a[j] < a[minj]) {
minj = j;
}
}
z = a[i];
a[i] = a[minj];
a[minj] = z;
if (i != minj) {
s++;
}
... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 0 | 256 | 2 |
#include <stdio.h>
int main(void) {
int A[100], n, i, sw;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
sw = selectionSort(A, n);
for (i = 0; i < n; i++) {
if (i > 0)
printf(" ");
printf("%d", A[i]);
}
printf("?\n");
printf("%d?\n", sw);
return 0;
}
int selection... | #include <stdio.h>
int main(void) {
int A[100], n, i, sw;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
sw = selectionSort(A, n);
for (i = 0; i < n; i++) {
if (i > 0)
printf(" ");
printf("%d", A[i]);
}
printf("\n");
printf("%d\n", sw);
return 0;
}
int selectionSo... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 241 | 3 |
#include <stdio.h>
int selectionSort(int a[], int N) {
int i, j, temp, minj;
int sw = 0;
for (i = 0; i < N; i++) {
minj = i;
for (j = 1; j < N; j++) {
if (a[j] < a[minj])
minj = j;
}
temp = a[i];
a[i] = a[minj];
a[minj] = temp;
if (i != minj)
sw++;
}
return sw... | #include <stdio.h>
int selectionSort(int a[], int N) {
int i, j, temp, minj;
int sw = 0;
for (i = 0; i < N - 1; i++) {
minj = i;
for (j = i; j < N; j++) {
if (a[j] < a[minj])
minj = j;
}
temp = a[i];
a[i] = a[minj];
a[minj] = temp;
if (i != minj)
sw++;
}
retur... | [["+", 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, 22]] | 0 | 232 | 4 |
#include <stdio.h>
int main() {
int t, c = 0, i, j, m, n, a[100];
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &a[i]);
for (i = 0; i < n; i++) {
m = i;
for (j = i++; j < n; j++) {
if (a[j] < a[m])
m = j;
}
if (m != i) {
t = a[i];
a[i] = a[m];
a[m] = t... | #include <stdio.h>
int main() {
int t, c = 0, i, j, m, n, a[100];
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &a[i]);
for (i = 0; i < n; i++) {
m = i;
for (j = i; j < n; j++) {
if (a[j] < a[m])
m = j;
}
if (m != i) {
t = a[i];
a[i] = a[m];
a[m] = t;
... | [["-", 8, 9, 0, 7, 10, 11, 12, 27, 17, 29], ["-", 8, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 8, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 197 | 3 |
#include <stdio.h>
/*void trace(int A[], int N){
int i ;
printf("%d", A[0]);
for(i=1; i<N;i++){
printf(" %d", A[i]);
}
printf("\n");
}*/
void trace(int A[], int N) {
int i;
for (i = 0; i < N - 1; i++)
printf("%d ", A[i]);
printf("%d\n", A[N - 1]);
}
void intsertionSort(int A[... | #include <stdio.h>
/*void trace(int A[], int N){
int i ;
printf("%d", A[0]);
for(i=1; i<N;i++){
printf(" %d", A[i]);
}
printf("\n");
}*/
void trace(int A[], int N) {
int i;
for (i = 0; i < N - 1; i++)
printf("%d ", A[i]);
printf("%d\n", A[N - 1]);
}
void intsertionSort(int A[... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13]] | 0 | 262 | 2 |
///
#include <math.h>
#include <stdio.h>
///
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
///
typedef long long ll;
///
#define INF 1145141919
///
void swap(int *a, int *b) {
int t = *b;
*b = *a;
*a = t;
}
int selectionSort(int *A, int N) {
int cnt = 1;
REP(i, N - 1) {... | ///
#include <math.h>
#include <stdio.h>
///
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
///
typedef long long ll;
///
#define INF 1145141919
///
void swap(int *a, int *b) {
int t = *b;
*b = *a;
*a = t;
}
int selectionSort(int *A, int N) {
int cnt = 0;
REP(i, N) {
... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 17, 33], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 0 | 274 | 6 |
#include <stdio.h>
#include <stdlib.h>
int main() {
int A[100];
int N;
int i, j, mini, z;
int count = 0;
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
for (i = 0; i < N; i++) {
mini = i;
for (j = i; j < N; j++) {
if (A[j] < A[mini]) {
mini = j;
}
... | #include <stdio.h>
#include <stdlib.h>
int main() {
int A[100];
int N;
int i, j, mini, z;
int count = 0;
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
for (i = 0; i < N; i++) {
mini = i;
for (j = i; j < N; j++) {
if (A[j] < A[mini]) {
mini = j;
}
... | [["+", 0, 7, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 8, 9, 0, 57, 15, 23, 0, 16, 31, 22], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 31, 22], ["-", 8, 9, 0, 57, 15, 23, 0, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 12, 22], ["-", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 0 | 216 | 6 |
#include <iostream>
using namespace std;
int selection(int A[], int n) {
int c = 0, minx;
for (int i = 0; i < n; i++) {
minx = i;
for (int j = i; j < n; j++) {
if (A[j] < A[minx]) {
minx = j;
}
swap(A[i], A[minx]);
if (i != minx)
c++;
}
}
return c;
}
int main(... | #include <iostream>
using namespace std;
int selection(int A[], int n) {
int c = 0, minx;
for (int i = 0; i < n - 1; i++) {
minx = i;
for (int j = i; j < n; j++) {
if (A[j] < A[minx]) {
minx = j;
}
}
swap(A[i], A[minx]);
if (i != minx)
c++;
}
return c;
}
int main() ... | [["+", 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, 57, 64, 9, 0, 46], ["-", 0, 7, 8, 9, 0, 7, 8, 9, 0, 46]] | 1 | 200 | 4 |
#include <iostream>
#include <vector>
using namespace std;
void printVector(const vector<int> &A) {
for (int i = 0; i < A.size(); i++) {
cout << A[i];
if (i + 1 < A.size())
cout << ' ';
}
cout << endl;
}
int main() {
int n, count = 0;
auto swap = [](int &a, int &b) {
int tmp = a;
a =... | #include <iostream>
#include <vector>
using namespace std;
void printVector(const vector<int> &A) {
for (int i = 0; i < A.size(); i++) {
cout << A[i];
if (i + 1 < A.size())
cout << ' ';
}
cout << endl;
}
int main() {
int n, count = 0;
auto swap = [](int &a, int &b) {
int tmp = a;
a = ... | [["-", 8, 9, 0, 43, 49, 50, 51, 69, 28, 22], ["-", 0, 43, 49, 50, 51, 69, 341, 342, 0, 70], ["-", 0, 43, 49, 50, 51, 69, 341, 342, 0, 73]] | 1 | 247 | 3 |
#include <iostream>
using namespace std;
int bubbleSort(int *A, int N) {
bool flag = 1;
int count = 0;
while (flag) {
flag = 0;
for (int j = N - 1; j > 0; j--) {
if (A[j] < A[j - 1]) {
swap(A[j], A[j - 1]);
count++;
flag = 1;
}
}
}
return count;
}
int selec... | #include <iostream>
using namespace std;
int bubbleSort(int *A, int N) {
bool flag = 1;
int count = 0;
while (flag) {
flag = 0;
for (int j = N - 1; j > 0; j--) {
if (A[j] < A[j - 1]) {
swap(A[j], A[j - 1]);
count++;
flag = 1;
}
}
}
return count;
}
int selec... | [["+", 0, 7, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 294 | 2 |
#include <cstdio>
using namespace std;
int main() {
int n;
int a[100];
int v;
int min_index;
int c = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
for (int i = 0; i < n; i++) {
min_index = i;
for (int j = i; j < n; j++) {
if (a[j] < a[min_index])
min_in... | #include <cstdio>
using namespace std;
int main() {
int n;
int a[100];
int v;
int min_index;
int c = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
for (int i = 0; i < n; i++) {
min_index = i;
for (int j = i; j < n; j++) {
if (a[j] < a[min_index])
min_in... | [["-", 8, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 8, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 209 | 2 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.