text
stringlengths 49
983k
|
|---|
#include<iostream>
using namespace std;
int a[105];
int main()
{
int n;
cin>>n;
for(int i=0;i<n;i++)
{
cin>>a[i];
}
int ans=0;
for(int i=0;i<n-1;i++)
{
int Min=i;
for(int j=i;j<n;j++)
if(a[j]<a[Min])
Min=j;
if(Min!=i)swap(a[i],a[Min]),ans++;
}
for(int i=0;i<n;i++)
{
if(i)cout<<' ';
cout<<a[i];
}
cout<<endl;
cout<<ans<<endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main()
{
int n;
cin>>n;
int A[n];
int count =0;
for(int i=0;i<n;i++)
cin>>A[i];
for(int i=0;i<n;i++)
{
int mini =i;
for(int j=i;j < n; j++)
{
if(A[j]<A[mini])
mini=j;
}
swap(A[i],A[mini]);
if(i!=mini)
count++;
}
for(int i=0;i<n;i++)
{
cout<<A[i];
if(i==n-1)
cout<<endl;
else
cout<<" ";
}
cout<<count<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
const int maxn=110;
int a[maxn];
int main()
{
int n,temp,num=0;
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>a[i];
}
for(int i=1;i<=n-1;i++)
{
int min=a[i];
int mark=i;
for(int j=i+1;j<=n;j++)
{
if(min>a[j])
{
mark=j;
min=a[j];
}
}
if(mark!=i)
{
swap(a[mark],a[i]);
num++;
}
}
cout<<a[1];
for(int i=2;i<=n;i++)
{
cout<<" "<<a[i];
}
cout<<endl;
cout<<num<<endl;
return 0;
}
|
#include<iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int swapCount = 0;
for (int i = 0; i < n; i++) {
int mini = i;
for (int j = i; j < n; j++){
if (a[j] < a[mini]) mini = j;
}
if (mini != i) {
int tmp = a[i];
a[i] = a[mini];
a[mini] = tmp;
swapCount++;
}
}
for (int i = 0; i < n - 1; i++) {
cout << a[i] << ' ';
}
cout << a[n - 1] << '\n' << swapCount << '\n';
}
|
#include<stdio.h>
int s(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;
}
int main()
{
int A[100],N,i,sw;
scanf("%d",&N);
for(i=0;i<N;i++) scanf("%d",&A[i]);
sw=s(A,N);
for(i=0;i<N;i++)
{
if(i>0) printf(" ");
printf("%d",A[i]);
}
printf("\n");
printf("%d\n",sw);
return 0;
}
|
#include<iostream>
using namespace std;
int a[105];
int selectionSort(int n,int a[])
{
int i,j,minj,sum=0;
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])
{
swap(a[i],a[minj]);
sum++;
}
}
return sum;
}
int main()
{
int n,i,ans=0;
cin>>n;
for(i=0;i<n;i++)
{
cin>>a[i];
}
ans=selectionSort(n,a);
for(i=0;i<n;i++)
{
if(i!=0)
cout<<" ";
cout<<a[i];
}
cout<<endl;
cout<<ans<<endl;
}
|
#include<iostream>
using namespace std;
int main(){
int n,a[100];
int exchanges=0;
cin>>n;
for(int i=0;i<n;i++){
cin>>a[i];
}
for(int i=0;i<n;i++){
int minIndex = i;
for(int j=i;j<n;j++){
if(a[j]<a[minIndex]){
minIndex=j;
}
}
if(minIndex!=i){
int tmp;
tmp=a[i];
a[i]=a[minIndex];
a[minIndex]=tmp;
exchanges++;
}
}
for(int i=0;i<n;i++){
if(i>0) cout<<" ";
cout<<a[i];
}
cout<<endl;
cout<<exchanges<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,minj,num=0;
cin>>n;
int a[n];
for(int i=0;i<n;i++)
cin>>a[i];
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){
int tmp=a[i];
a[i]=a[minj];
a[minj]=tmp;
num++;
}
}
for(int i=0;i<n;i++){
cout<<a[i];
if(i!=n-1)
cout<<" ";
}
cout<<endl;
cout<<num<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int main(){
int n,A,ans=0;
vector<int> a;
cin>>n;
for(int i=0;i<n;i++){
cin>>A;
a.push_back(A);
}
for(int i=0;i<n;i++){
int minj=i;
for(int j=i;j<n;j++) if(a[j]<a[minj]) minj=j;
if(a[i]!=a[minj]){
A=a[i];
a[i]=a[minj];
a[minj]=A;
ans++;
}
}
for(int i=0;i<n;i++){
if(i==n-1) cout<<a[i]<<endl<<ans<<endl;
else cout<<a[i]<<" ";
}
return 0;
}
|
#include<iostream>
int main(){
int n;
int a[100];
int i,j;
int mini;
int counter = 0;
std::cin >> n;
for(i=0;i<n;i++){
std::cin >> a[i];
}
for(i=0;i<n;i++){
mini = i;
for(j=i;j<n;j++){
if(a[j] < a[mini]){
mini = j;
}
}
std::swap(a[i],a[mini]);
if(i!=mini)counter++;
}
for(i=0;i<n;i++){
if(i>0){
std::cout << " ";
}
std::cout << a[i];
}
std::cout << "\n" << counter << "\n";
return (0);
}
|
#include <iostream>
#include <vector>
int main(){
int n;
std::cin>>n;
std::vector<unsigned int> vec(n);
for(auto &v:vec) std::cin>>v;
int cnt=0;
for(int i=0;i<n;++i){
int minj = i;
for(int j=i;j<n;++j)
if(vec[j]<vec[minj]) minj = j;
if(i!=minj){
cnt++;
std::swap(vec[i],vec[minj]);
}
}
std::cout<<vec[0];
for(int i=1;i<n;++i)
std::cout<<" "<<vec[i];
std::cout<<"\n"<<cnt<<std::endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main(){
int n,a[100],min,ans=0;
cin>>n;
for(int i=0;i<n;i++) cin>>a[i];
for(int i=0;i<n;i++){
min=i;
for(int j=i;j<n;j++){
if(a[j]<a[min]){
min=j;
}
}
if(i!=min)
ans++;
swap(a[i],a[min]);
}
for(int i=0;i<n-1;i++) cout<<a[i]<<" ";
cout<<a[n-1]<<endl;
cout<<ans<<endl;
}
|
#include <iostream>
using namespace std;
int main(){
int a[100], n, cnt = 0, minj, tmp;
cin >> n;
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < n; i++) {
minj = i;
for (int j = i; j < n; j++) {
if (a[j] < a[minj]) minj = j;
}
if (i != minj) {
tmp = a[i];
a[i] = a[minj];
a[minj] = tmp;
cnt++;
}
}
for (int i = 0; i < n; i++){
cout << a[i];
if (i != n - 1) cout << " ";
}
cout << endl << cnt << endl;
return 0;
}
|
#include<iostream>
int main()
{
const int MAX=100;
using namespace std;
int n,i,j,index,temp,A[MAX],count;
count=0;
cin>>n;
for(i=0;i<n;i++)
cin>>A[i];
for(i=0;i<n;i++)
{
index=i;
for(j=i;j<n;j++)
if(A[j]<A[index])
index=j;
temp=A[index];
A[index]=A[i];
A[i]=temp;
if(index!=i)
count++;
}
for(i=0;i<n;i++)
if(i<n-1)
cout<<A[i]<<' ';
else
cout<<A[i];
cout<<endl<<count<<endl;
return 0;
}
|
#include<iostream>
#include<cstdio>
using namespace std;
int main(){
int n,a[100],c=0;
cin>>n;
for(int i=0;i<n;i++)cin>>a[i];
for(int i=0;i<n-1;i++){
int mini=i;
for(int j=i;j<n;j++){
if(a[j]<a[mini])mini=j;
}
int tmp=a[i];
if(mini!=i)c++,a[i]=a[mini],a[mini]=tmp;
}
for(int i=0;i<n-1;i++)cout<<a[i]<<" ";
cout<<a[n-1]<<endl;
cout<<c<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,flag=0,min;
cin>>n;
int a[n];
for(int i=0;i<n;i++)cin>>a[i];
for(int i=0;i<n;i++){
min=i;
for(int j=i;j<n;j++){
if(a[j]<a[min])min=j;
if(j==n-1&&i!=min){
swap(a[i],a[min]);
flag++;
}
}
if(i==n-1)cout<<a[i]<<endl;
else cout<<a[i]<<" ";
}
cout<<flag<<endl;
return 0;
}
|
#include <cstdio>
#include <iostream>
#include <utility>
using namespace std;
int main(){
int n;
int a[100];
int count=0;
scanf(" %d", &n);
for(int i=0; i<n; ++i) scanf(" %d", &a[i]);
//selection sort
for(int i=0; i<n; ++i){
int minj=i;
for(int j=i; j<n; ++j){
if(a[j]<a[minj]) minj=j;
}
if(i!=minj){
swap(a[i], a[minj]);
count++;
}
}
for(int i=0; i<n; ++i){
if(i>0) printf(" ");
printf("%d", a[i]);
}
printf("\n%d\n", count);
}
|
#include <iostream>
using namespace std;
int trace(int A[],int n){
int sw=0;
int minj=0;
for(int i=0;i<n-1;i++){
minj=i;
for(int j=i;j<n;j++){
if(A[minj]>A[j]){
minj=j;
}
}
swap(A[i],A[minj]);
if(minj!=i) sw++;
}
return sw;
}
int main(){
int A[100],sw,N;
cin>>N;
for(int i=0;i<N;i++){
cin>>A[i];
}
sw = trace(A,N);
for(int i=0;i<N;i++){
if(i) cout<<" ";
cout<<A[i];
}
cout<<endl;
cout<<sw<<endl;
return 0;
}
|
#include<iostream>
#include<cmath>
using namespace std;
int a[100],n,t;
void xzsort(int n)
{
int i,j,minn,mini;
for(i=0;i<n-1;i++)
{
mini=i;
minn=a[i];
for(j=i+1;j<n;j++)
{
if(a[j]<minn)
{
minn=a[j];
mini=j;
}
}
if(i!=mini)
{
t++;
swap(a[i],a[mini]);
}
}
}
int main()
{
cin>>n;
for(int i=0;i<n;i++)
cin>>a[i];
xzsort(n);
for(int i=0;i<n-1;i++)
cout<<a[i]<<" ";
cout<<a[n-1]<<endl;
cout<<t<<endl;
return 0;
}
|
#include <stdio.h>
int main(){
int k=0,ba,min,n[105],i,j,a;
scanf("%d",&a);
for(i=0;i<a;i++)scanf("%d",&n[i]);
for(i=0;i<a;i++){
min=1000000;
for(j=i;j<a;j++){
if(min>n[j]){
min=n[j];
ba=j;
}
}
if(ba!=i){
n[ba]=n[i];
n[i]=min;
k++;
}
}
for(i=0;i<a-1;i++)printf("%d ",n[i]);
printf("%d\n",n[a-1]);
printf("%d\n",k);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
int a[105];
cin>>n;
for(int i=0;i<n;i++)cin>>a[i];
int res=0;
for(int i=0;i<n;i++){
int mini=i;
for(int j=i;j<n;j++)
if(a[j]<a[mini])mini=j;
if(i!=mini)res++;
swap(a[i],a[mini]);
}
for(int i=0;i<n-1;i++)cout<<a[i]<<' ';cout<<a[n-1]<<endl;
cout<<res<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,minj,counter=0;
cin>>n;
vector<int> vec(n);
for(int i=0;i<n;i++){
cin>>vec[i];
}
for(int i =0;i<n;i++){
minj =i;
for(int j=i;j<n;j++){
if(vec[j]<vec[minj]){
minj =j;
}
}
if(i != minj) counter++;
int temp = vec[i];
vec[i]=vec[minj];
vec[minj]=temp;
}
for(int i=0;i<n;i++){
cout<<vec[i];
if(i!=n-1) cout<<" ";
}
cout<<endl;
cout<<counter<<endl;
}
|
#include<iostream>
using namespace std;
int main(){
int n,minj,count=0;
int a[101]={};
cin>>n;
for(int i=0;i<n;i++)cin>>a[i];
for(int i=0;i<n;i++){
minj = i;
for(int j=i;j<n;j++)
if(a[j]<a[minj])
minj = j;
if(i!=minj){
swap(a[i],a[minj]);
count++;
}
}
for(int i=0;i<n-1;i++)
cout<<a[i]<<' ';
cout<<a[n-1]<<endl<<count<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int k,n,a[101],v,j,t=0;
cin>>n;
for (int i=0; i<n; i++)
cin>>a[i];
for (int i=0; i<n; i++){
k=i;
for (int j=i+1; j<n; j++)
if (a[j]<a[k])
k=j;
if (a[k]<a[i]){
t++;
v=a[k];
a[k]=a[i];
a[i]=v;
}
}
cout<<a[0];
for (int i=1; i<n; i++)
cout<<' '<<a[i];
cout<<endl;
cout<<t<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,a[100],ans;
cin>>n;
for(int i=0;i<n;i++) cin>>a[i]; //n?????\???
for(int i=0;i<n;i++){
int m=i;
for(int j=i+1;j<n;j++){
if(a[j]<a[m]) m=j;
}
if(m!=i) ans++;
swap(a[m],a[i]);
}
for(int i=0;i<n-1;i++) cout<<a[i]<<" ";
cout<<a[n-1]<<endl;
cout<<ans<<endl;
return 0;
}
|
#include<iostream>
using namespace std;
int main(){
int n,a[101],minj,tmp,cnt=0;
cin>>n;
for(int i=0;i<n;i++) cin>>a[i];
for(int i=0;i<n-1;i++){
minj=i;
for(int j=i;j<n;j++)if(a[j]<a[minj])minj=j;
tmp=a[i];
a[i]=a[minj];
a[minj]=tmp;
if(i!=minj)cnt++;
}
for(int i=0;i<n-1;i++)cout<<a[i]<<" ";
cout<<a[n-1]<<endl<<cnt<<endl;
return 0;
}
|
#include<iostream>
using namespace std;
const int MAXN=105;
int A[MAXN];
int main(){
int n;
cin>>n;
for(int i=0;i<n;i++)cin>>A[i];
int res=0;
for(int i=0;i<n;i++){
int minn=i;
for(int j=i+1;j<n;j++){
if(A[minn]>A[j]){
minn=j;
}
}
if(minn!=i){
swap(A[minn],A[i]);
res++;
}
}
for(int i=0;i<n;i++){
cout<<A[i];
if(i!=n-1)cout<<" ";
}
cout<<endl<<res<<endl;
return 0;
}
|
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int minj,cnt=0,N,A[100];
cin >> N ;
for(int i=0;i<N;i++)cin >> A[i];
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){
swap(A[minj],A[i]);cnt++;
}
}
for(int i=0;i<N;i++){cout << A[i] ; if(i!=N-1)cout << " ";}
cout << endl << cnt << endl;
}
|
#include<iostream>
#include<cstdio>
using namespace std;
int main(){
int a[10000],n,i,j,t,c=0,min; cin>>n;
for(i=0;i<n;i++)cin>>a[i];
for(i=0;i<n;i++){
min=i;
for(j=i;j<n;j++){
if(a[j]<a[min])min=j;
}
if(i!=min){
t=a[min];
a[min]=a[i];
a[i]=t;
c++;
}
}
for(i=0;i<n;i++){
if(i)cout<<" ";
cout<<a[i];
}
cout<<endl<<c<<endl;
return 0;
}
|
#include<iostream>
using namespace std;
int main()
{
int minj, n, a[100], tmp, count = 0;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n - 1; i++)
{
minj = i;
for (int j = i; j < n; j++)
if (a[j] < a[minj])
minj = j;
if (minj != i)
{
tmp = a[i];
a[i] = a[minj];
a[minj] = tmp;
count++;
}
}
for (int i = 0; i < n; i++)
{
if (i)
cout << " ";
cout << a[i];
}
cout << endl << count << endl;
return 0;
}
|
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int N,count=0;
//??\???
cin >> N;
int A[N];
for(int i=0;i<N;i++)
cin >> A[i];
//??卒???
for(int i=0;i<N;i++){
int mini = i,flag = 0;
for(int j=i;j<N;j++)
if(A[j]<A[mini]){
mini = j;
flag = 1;
}
if(flag){
swap(A[i],A[mini]);
count++;
}
}
//??????
for(int i=0;i<N;i++){
if(i>0) cout<< " ";
cout<< A[i];
}
cout<< endl << count << endl;
return 0;
}
|
#include<iostream>
using namespace std;
int n, a[109];
int main(){
cin >> n;
for(int i=0;i<n;i++)cin >> a[i];
int cnt=0;
for(int i=0;i<n;i++){
int mni=i;
for(int j=i;j<n;j++){
if(a[j]<a[mni]){
mni=j;
}
}
if(mni!=i){
cnt++;
swap(a[mni], a[i]);
}
}
for(int i=0;i<n;i++)cout << a[i] << (i<n-1?' ':'\n');
cout << cnt << endl;
}
|
#include<iostream>
#include<stdio.h>
using namespace std;
int main()
{
int N,b,min,tmp,cou;cou=0;
int num[101]={};
cin>>N;
for(int i=0;i<N;i++)
{cin>>b;num[i]=b;}
for(int i=0;i<N;i++)
{
min=i;
for(int j=i;j<N;j++)
{if(num[min]>num[j])min=j;
}
{tmp=num[i];num[i]=num[min];num[min]=tmp;
if(i!=min)cou++;}
}
for(int i=0;i<N;i++)
{if(i)cout<<" ";
cout<<num[i];
}
cout<<endl;cout<<cou<<endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main(){
int a,m[101],cou,min,minhako;
cin >>a;
for(int i;i<a;i++)cin>>m[i];
cou=0;
for(int i=0;i<a-1;i++){
min=101;
for(int j=i;j<a;j++){
if(m[j]<min){
min=m[j];
minhako=j;
}
}
swap(m[i],m[minhako]);
if(i!=minhako)cou++;
}
for(int i=0;i<a;i++){
cout<<m[i];
if(i<a-1)cout<<" ";
}
cout<<endl;
cout<< cou<<endl;
return 0;
}
|
#include <iostream>
#include <utility>
using namespace std;
int main(void) {
int n,a[100],cnt=0;
cin >> n;
for(int i = 0;i < n;i++) cin >> a[i];
for(int i = 0;i < n;i++) {
int minj = i;
for(int j = i;j < n;j++)
if(a[j]<a[minj])
minj = j;
swap(a[i],a[minj]);
if(i != minj)
cnt++;
}
for(int i = 0;i < n-1;i++) cout << a[i] << " ";
cout << a[n-1] << endl << cnt << endl;
}
|
#include <iostream>
using namespace std;
int main()
{
int n, j, count = 0;
cin >> n;
int *p = new int[n];
for (int i = 0; i < n; i++) cin >> p[i];
for (int i = 0; i < n - 1; i++) {
int min = i;
for (int j = i + 1; j < n; j++) {
if (p[j] < p[min]) min = j;
}
if (min != i) {
swap(p[i], p[min]);
count++;
}
}
for (j = 0; j < n - 1; j++)
cout << p[j] << " ";
cout << p[j] << "\n" << count << "\n";
delete[] p;
return 0;
}
|
#include<iostream>
using namespace std;
void selectsort(int A[100],int N){
int cnt=0;
for(int i=0;i<N-1;i++){
int minj=i;
for(int j=i;j<N;j++){
if(A[j]<A[minj])minj=j;}
if(A[i]>A[minj]){
swap(A[i],A[minj]);
cnt++;}
}
for(int k=0;k<N-1;k++)cout <<A[k]<<" ";
cout <<A[N-1]<<endl;
cout <<cnt<<endl;}
int main(){
int N,A[100];
cin>>N;
for(int i=0;i<N;i++)cin>>A[i];
selectsort(A,N);
}
|
#include<iostream>
int main(){
int n,minj,ret=0,b1,b2,list[101];
bool isrev=true;
std::cin>>n;
for(int i=0;i<n;i++){
std::cin>>list[i];
}
for(int i=0;i<n;i++){
minj=i;
for(int j=i;j<n;j++){
if(list[j]<list[minj])minj=j;
}
b1=list[i],b2=list[minj];
list[i]=b2,list[minj]=b1;
if(i!=minj)ret++;
}
for(int i=0;i<n;i++){
std::cout<<list[i];
if(i!=n-1)std::cout<<" ";
else std::cout<<"\n";
}
std::cout<<ret<<"\n";
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <cstring>
#define rep(i,o,u) for(int i = o;i <= u; i++)
using namespace std;
int a[101];
int main(){
int n;
cin >> n;
rep(i,1,n) cin >> a[i];
int ans = 0;
rep(i,1,n){
int mn = i;
rep(j,i+1,n){
if(a[mn] > a[j]){
mn = j;
}
}
swap(a[i],a[mn]);
if(i != mn){
ans++;
}
}
rep(i,1,n){ cout << a[i];if(i != n) cout << " ";}
cout << endl;
cout << ans << endl;
return 0;
}
|
#include<iostream>
#define N 100
using namespace std;
int main(){
int n,a[N],mini,cnt=0;
cin>>n;
for(int i=0;i<n;i++)cin>>a[i];
for(int i=0;i<n;i++){
mini=i;
for(int j=i;j<n;j++)
if(a[j]<a[mini])mini=j;
if(i!=mini){
cnt++;
int t=a[i];
a[i]=a[mini];
a[mini]=t;
}
}
for(int i=0;i<n;i++){
if(i)cout<<' ';
cout<<a[i];
}
cout<<endl<<cnt<<endl;
return 0;
}
|
#include <iostream>
using namespace std;
int N;
int A[110];
int main(){
cin >> N;
for(int i=0;i<N;i++){
cin >> A[i];
}
int count = 0;
for(int i=0;i<N;i++){
int minj = i;
for(int j=i;j<N;j++){
if(A[j] < A[minj]){
minj = j;
}
}
int tmp = A[i];
A[i] = A[minj];
A[minj] = tmp;
if(minj!=i) count++;
}
for(int i=0;i<N;i++){
if(i!=N-1) cout << A[i] <<" ";
else cout << A[i] << endl;
}
cout << count << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int x=0,n,a[100];
cin>>n;
for(int i = 0 ; i < n; i++){
cin>>a[i];
}
for(int i=0;i<n-1;i++){
int min=i;
for(int j=i;j<n;j++){
if(a[min]>a[j]) min=j;
}
if(min==i) 1;
else {
int tmp;
tmp=a[i];
a[i]=a[min];
a[min]=tmp;
x++;
}
}
for(int i=0; i<n;i++){
if(i!=0) cout<<" ";
cout<<a[i];
}
cout<<endl<<x<<endl;
return 0;
}
|
#include<stdio.h>
void swap(int *a, int *b){
int c;
c=*a;
*a=*b;
*b=c;
}
int main(void){
int N,i,a[101],j,k=0,min;
scanf("%d",&N);
for(i=0;i<N-1;i++){
scanf("%d ",&a[i]);
}
scanf("%d",&a[N-1]);
for(i=0;i<N;i++){
min=i;
for(j=i;j<N;j++){
if(a[j]<a[min]){
min=j;
}
}
if(i!=min){
swap(&a[i],&a[min]);
k++;
}
}
for(i=0;i<N-1;i++){
printf("%d ",a[i]);
}
printf("%d\n",a[N-1]);
printf("%d\n",k);
}
|
#include<iostream>
using namespace std;
int main()
{
int N, A[100], i, j, min, temp, num = 0;
cin >> N;
for (i = 0; i < N; i++)
cin >> A[i];
for (i = 0; i < N; i++)
{
min = i;
for (j = i; j < N; j++)
if (A[j] < A[min])
min = j;
if (min != i)
{
temp = A[i];
A[i] = A[min];
A[min] = temp;
num++;
}
}
for (i = 0; i < N - 1; i++)
cout << A[i] << ' ';
cout << A[N - 1] << endl;
cout << num << endl;
return 0;
}
|
#include<iostream>
using namespace std;
int main()
{
int n=0;cin>>n;
int a[100]={0};
for(int i=0;i<n;i++)
{
cin>>a[i];
}
int cnt=0;
for(int i=0;i<n;i++)
{
int minj=i,f=0;
for(int j=i;j<n;j++)
{
if(a[j]<a[minj])
{
minj=j;
f=1;
}
}
swap(a[i],a[minj]);
if(f==1)cnt++;
}
cout<<a[0];
for(int i=1;i<n;i++)
{
cout<<" "<<a[i];
}
cout<<endl<<cnt<<endl;
return 0;
}
|
#include <iostream>
using namespace std;
int isort(int A[],int N){
int minj,sw=0;
for(int i=0;i<N;i++){
minj=i;
for(int j=i;j<N;j++){
if(A[minj]>A[j]) minj=j;
}
swap(A[i],A[minj]);
if(i!=minj)sw++;
}
return sw;
}
int main(){
int A[100],N,sw;
cin>>N;
for(int i=0;i<N;i++) cin>>A[i];
sw=isort(A,N);
for(int i=0;i<N;i++){
if(i!=0) cout<<" ";
cout<<A[i];
}
cout<<endl;
cout<<sw<<endl;
return 0;
}
|
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
ll n, i, j, mini, z;
cin>>n;
vector < ll > a(n+1);
for(i=0; i<n; i++){
cin>>a[i];
}
z=0;
for(i=0; i<n; i++){
mini=i;
for(j=i; j<n; j++){
if(a[j]<a[mini]){
mini=j;
}
}
swap(a[i],a[mini]);
if(i!=mini) z++;
}
for(i=0; i<n-1; i++){
cout<<a[i]<<" ";
}
cout<<a[n-1]<<"\n";
cout<<z<<"\n";
return 0;
}
|
#include <iostream>
#include <vector>
using namespace std;
void swap(int *a,int *b){
int t = *a;
*a = *b;
*b = t;
}
int main() {
int n,ans=0,i,j,m;
cin>>n;
vector<int> a(n);
for (i=0;i<n;i++) cin>>a[i];
for (i=0;i<n-1;i++) {
m=i;
for (j=i;j<n;j++)if(a[j]<a[m])m=j;
if(i!=m){swap(a[i],a[m]);ans++;}
cout<<a[i]<<" ";
}
cout<<a[n-1]<<endl;
cout<<ans<<endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main(){
int n, a[100], c = 0;
cin >> n;
for (int i = 0; i < n; i++)cin >> a[i];
for (int i = 0; i < n; i++) {
int minj = i;
for (int j = i; j < n; j++) {
if (a[minj] > a[j]) {
minj = j;
}
}
if (a[minj] != a[i])c++;
int tmp = a[minj];
a[minj] = a[i];
a[i] = tmp;
}
for (int i = 0; i < n - 1; i++)cout << a[i] << " ";
cout << a[n - 1] << endl << c << endl;
return 0;
}
|
# include <iostream>
using namespace std;
int main(void)
{
int n,a[100],ans = 0;
scanf("%d",&n);
for(int i = 0;i < n;i++) scanf("%d",&a[i]);
for(int i = 0;i < n-1;i++)
{
int index = i;
for(int j = i+1;j < n;j++) if(a[j] < a[index]) index = j;
if(index != i)
{
ans++;
swap(a[i],a[index]);
}
}
for(int i = 0;i < n;i++) printf("%d%c",a[i],(i == n-1)?'\n':' ');
printf("%d\n",ans);
return 0;
}
|
#include<iostream>
using namespace std;
int main(){
int n;
while(cin>>n){
int a[n];
for(int i=0;i<n;i++){
cin>>a[i];
}
int ans=0;
for(int i=0;i<n-1;i++){
int min=i;
for(int j=i;j<n;j++){
if(a[j]<a[min])
min=j;
}
int temp=a[i];
a[i]=a[min];
a[min]=temp;
if(i!=min)
ans++;
}
cout<<a[0];
for(int i=1;i<n;i++)
cout<<' '<<a[i];
cout<<endl;
cout<<ans<<endl;
}
return 0;
}
|
#include<cstdio>
#include<algorithm>
#include<iostream>
using namespace std;
int main()
{
int N;
cin >> N;
int array[N];
for(int i = 0; i < N; i++) cin >> array[i];
// ソート
int cnt = 0;
for(int i = 0; i < N; i++)
{
int min = i;
for(int j = i; j < N; j++)
if(array[j] < array[min]) min = j;
swap(array[i], array[min]);
if(min != i) cnt++;
}
// 表示
for(int i = 0; i < N-1; i++) printf("%d ", array[i]);
printf("%d\n%d\n", array[N-1], cnt);
}
|
#include<cstdio>
#include<functional>
#include<algorithm>
using namespace std;
void func(int);
int main(void)
{
int n,i,j,a[100],minj,cnt;
scanf("%d",&n);
for(i=0;i<n;i++) scanf("%d",&a[i]);
cnt=0;
for(i=0;i<n;i++) {
minj=i;
for(j=i;j<n;j++) {
if(a[j]<a[minj]) minj=j;
}
if(i!=minj) {
swap(a[i],a[minj]);
cnt++;
}
}
printf("%d",a[0]);
for(i=1;i<n;i++) printf(" %d",a[i]);
printf("\n");
printf("%d\n",cnt);
return 0;
}
|
#include <stdio.h>
int main() {
int n, mini, tmp, swap;
scanf("%d", &n);
int arr[n];
for (int i=0; i<n;i++) {
scanf("%d", &arr[i]);
}
swap = 0;
for (int i=0; i<n; i++) {
mini = i;
for (int j = i; j<n;j++) {
if (arr[j] < arr[mini]) {
mini = j;
}
}
tmp = arr[i];
arr[i] = arr[mini];
arr[mini] = tmp;
swap += (mini != i);
}
printf("%d", arr[0]);
for (int i=1; i<n; i++) {
printf(" %d", arr[i]);
}
printf("\n%d\n", swap);
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int a[n];
for(int i=0;i<n;i++) cin >> a[i];
int minj;
int count=0;
for(int i=0;i<n;i++){
minj=i;
for(int j=i;j<n;j++)
if(a[j]<a[minj])
minj=j;
swap(a[i],a[minj]);
if(i!=minj)
count++;
}
for(int i=0;i<n;i++){
cout << a[i];
if(i!=n-1)
cout << " ";
else cout << endl;
}
cout << count << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main()
{
int n, i, j, k, m, c = 0, a[100] = {};
cin >> n;
for(i = 0; i < n; ++i)
cin >> 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 ){
k = a[i];
a[i] = a[m];
a[m] = k;
++c;
}
}
for(i = 0; i < n; ++i){
cout << a[i];
if( i != n - 1 )
cout << " ";
}
cout << "\n" << c << "\n";
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(void){
int n;
array<int,100>ar;
int i,j;
int cnt;
int x;
cin>>n;
for(i=0;i<n;i++) cin>>ar[i];
for(i=0;i<n-1;i++){
x=i;
for(j=i;j<n;j++){
if(ar[j]<ar[x]) x=j;
}
swap(ar[i],ar[x]);
if(i!=x) cnt++;
}
cout<<ar[0];
for(i=1;i<n;i++) cout<<" "<<ar[i];
cout<<endl;
cout<<cnt<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, a[109], dp[109];
int main() {
cin >> n;
for(int i = 0; i < n; i++) cin >> a[i];
int z = 0;
for(int i = 0; i < n; i++) {
int ptr = min_element(a + i, a + n) - a;
if(i != ptr) swap(a[i], a[ptr]), z++;
}
for(int i = 0; i < n; i++) {
if(i) cout << ' ';
cout << a[i];
}
cout << endl;
cout << z << endl;
return 0;
}
|
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int N,a[102];
cin>>N;
for(int i=0;i<N;i++)cin>>a[i];
int minj,i,j,cnt=0;
for(i=0;i<N;i++){
minj=i;
for(j=i;j<N;j++){
if(a[minj]>a[j])minj=j;
}
if(minj!=i)cnt++;
swap(a[minj],a[i]);
}
int first=1;
for(i=0;i<N;i++){
if(first)first=0;else cout<<" ";
cout<<a[i];
}
cout<<endl<<cnt<<endl;
}
|
#include<iostream>
#include<math.h>
#include<algorithm>
using namespace std;
int main(){
int A[110], N, minj, cnt=0;
cin>>N;
for(int i=0;i<N;i++) cin>>A[i];
for(int i=0;i<N;i++){
minj = i;
for(int j=i+1;j<N;j++){
if(A[j]<A[minj]) minj = j;
}
if(minj != i){
int v = A[i];
A[i] = A[minj];
A[minj] = v;
cnt += 1;
}
}
for(int i=0;i<N-1;i++) cout<<A[i]<<" ";
cout<<A[N-1]<<endl;
cout<<cnt<<endl;
return 0;
}
|
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int data[100],cnt=0,n,mini;
cin >> n;
for(int i=0;i<n;i++) cin >> data[i];
for(int i=0;i<n;i++){
mini = i;
for(int j=i;j<n;j++){
if(data[j]<data[mini]){
mini = j;
}
}
if(mini != i){
cnt++;
swap(data[i],data[mini]);
}
}
for(int i=0;i<n;i++){
cout << (i!=0?" ":"") << data[i];
}
cout << endl << cnt << endl;
}
|
#include <iostream>
#include <algorithm>
using namespace std;
int main(void)
{
int n;
int cnt = 0;
int a[128];
cin >> n;
for (int i = 0; i < n; i++){
cin >> a[i];
}
for (int i = 0; i < n - 1; i++){
int mini = i;
for (int j = i; j < n; j++){
if (a[mini] > a[j]) mini = j;
}
if (mini != i){
swap(a[mini], a[i]);
cnt++;
}
}
for (int i = 0; i < n; i++){
cout << a[i] << (i + 1 == n ? '\n' : ' ');
}
cout << cnt << endl;
return 0;
}
|
#include <iostream>
using namespace std;
#define SWAP(type,a,b){type t=a;a=b;b=t;}
int main() {
int N;
int count=0;
cin>>N;
int A[N];
for(int i=0;i<N;i++){
cin>>A[i];
}
for(int i=0;i<N;i++){
int mini=i;
for(int j=i;j<N;j++){
if(A[j]<A[mini]){
mini=j;
}
}
if(i!=mini){
SWAP(int,A[i],A[mini]);
count++;
}
}
cout<<A[0];
for(int i=1;i<N;i++){
cout<<" "<<A[i];
}
cout<<"\n"<<count<<endl;
return 0;
}
|
#include<iostream>
#include<cstdio>
using namespace std;
int main()
{
int n,a[100];
scanf("%d",&n);
for(int i=0;i<n;i++)scanf("%d",&a[i]);
int ans=0;
for(int i=0;i<n;i++){
int mini=i;
for(int j=i;j<n;j++){
if(a[j]<a[mini]){
mini=j;
}
}
if(a[i]!=a[mini]){
swap(a[i],a[mini]);
ans++;
}
}
for(int i=0;i<n;i++){
if(i==n-1)printf("%d\n",a[i]);
else printf("%d ",a[i]);
}
printf("%d\n",ans);
}
|
#include <iostream>
#include <vector>
using namespace std;
int main()
{
int n,a[100],cnt = 0;
cin >> n;
for(int i = 0; i < n; i++)
cin >> a[i];
for(int i = 0; i < n - 1; i++){
int min = a[i], ret = i;
for(int j = i + 1; j < n; j++){
if(min > a[j]){
min = a[j]; ret = j;
}
}
if(ret != i) {
int z = a[i]; a[i] = a[ret]; a[ret] = z;
cnt++;
}
}
for(int i = 0; i < n - 1 ; i++)
cout << a[i] <<" ";
cout << a[n-1] << endl;
cout << cnt << endl;
}
|
#include <stdio.h>
int main(void)
{
int cnt = 0;
int n;
scanf("%d", &n);
int x[n];
for(int i = 0; i < n; i++){
scanf("%d", &x[i]);
}
for(int i = 0; i < n; i++){
int minj = i;
for(int j = i; j < n; j++){
if(x[j] < x[minj]){
minj = j;
}
}
if(minj != i){
int temp = x[i];
x[i] = x[minj];
x[minj] = temp;
cnt++;
}
}
for(int i = 0; i < n - 1; i++){
printf("%d ", x[i]);
}
printf("%d\n%d\n", x[n - 1], cnt);
return 0;
}
|
#include <cstdio>
#include <vector>
using namespace std;
int main() {
int n,min, s=0;
vector<int> a;
scanf("%d",&n);
a.resize(n);
for(int i=0; i<n; ++i) {
scanf("%d",&a[i]);
}
for(int i=0; i<n; ++i) {
min=i;
for(int j=i+1; j<n; ++j) {
if(a[j]<a[min]) {
min=j;
}
}
if(min!=i) {
swap(a[i],a[min]);
++s;
}
}
for(int i=0; i<n-1; ++i) {
printf("%d ",a[i]);
}
printf("%d\n%d\n",a[n-1],s);
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int N;
cin>>N;
int A[N];
for (int i=0; i<N; i++) {
cin>>A[i];
}
int sw=0;
for (int i=0; i<N; i++) {
int minj=i;
for (int j=i; j<N; j++) {
if (A[j]<A[minj]) {
minj=j;
}
}
swap(A[i],A[minj]);
if (i!=minj) {
sw++;
}
}
for (int i=0; i<N; i++) {
cout<<(i==0?"":" ")<<A[i]<<flush;
}
cout<<endl;
cout<<sw<<endl;
return 0;
}
|
#include<iostream>
using namespace std;
int main(){
int N;
cin>>N;
int A[N],i,j,minj,c=0,k;
for(i=0;i<N;i++) cin>>A[i];
for(i=0;i<N;i++){
minj=i;
for(j=i;j<N;j++){
if(A[j]<A[minj]) minj=j;
}
k=A[i];
A[i]=A[minj];
A[minj]=k;
if(minj!=i) c++;
}
for(i=0;i<N;i++){
cout<<A[i];
if(i!=N-1) cout<<" ";
}
cout<<endl<<c<<endl;
}
|
#include<iostream>
using namespace std;
int main(){
int n;
cin>>n;
int *array = new int[n];
for(int i=0;i<n;i++){
cin>>array[i];
}
int count=0;
for(int i=0;i<n;i++){
int minj=i;
for(int j=i;j<n;j++){
if(array[j] < array[minj])
minj=j;
}
if(i!=minj){
swap(array[i],array[minj]);
count++;
}
}
cout<<array[0];
for(int i=1;i<n;i++)
cout<<" "<<array[i];
cout<<'\n'<<count<<endl;
delete []array;
return 0;
}
|
#include<cstdio>
#include<iostream>
using namespace std;
int selectsort(int n,int a[]){
int sw=0,minj;
for(int i=0;i<n;i++){
minj=i;
for(int j=i;j<n;j++){
if(a[minj]>a[j]){
minj=j;
}
}
swap(a[minj],a[i]);
if(i != minj) sw++;
}
return sw;
}
int main(){
int n,a[100];
cin>>n;
for(int i=0;i<n;i++) cin>>a[i];
int sw=selectsort(n,a);
for(int i=0;i<n;i++){
if(i) printf(" ");
printf("%d",a[i]);
}
printf("\n");
printf("%d\n",sw);
return 0;
}
|
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
int main() {
int N, ans = 0, tmp;
cin >> N;
vector<int> A(N);
for (int& i : A) cin >> i;
for (int i = 1; i < N; ++i) {
tmp = i - 1;
for (int j = i; j < N; ++j) {
if (A[tmp] > A[j]) tmp = j;
}
if (tmp != i - 1) ++ans;
swap(A[tmp], A[i - 1]);
}
for (int i = 1; i < N; ++i) cout << A[i - 1] << ' ';
cout << A[N - 1] << endl << ans << endl;
}
|
#include<iostream>
using namespace std;
int selectionSort(int *num,int n){
int minn,ans=0;
for(int i=0;i<n-1;i++){
minn=i;
for(int j=i;j<n;j++){
if(num[j]<num[minn]) minn=j;
}
swap(num[i],num[minn]);
if(i!=minn) ans++;
}
return ans;
}
int main(){
int num[110];
int n;
while(cin>>n){
for(int i=0;i<n;i++) cin>>num[i];
int ans=selectionSort(num,n);
for(int i=0;i<n;i++){
if(i) cout<<' ';
cout<<num[i];
}
cout<<endl<<ans<<endl;
}
}
|
#include <iostream>
using namespace std;
int main() {
int a[105];
int n;
cin>>n;
for(int i=0;i<n;i++){
cin>>a[i];
}
int count=0;
for(int i=0;i<n-1;i++){
int minj=i;
for(int j=i+1;j<n;j++){
if(a[minj]>a[j]){
minj=j;
}
}
if(minj!=i){
int temp = a[minj];
a[minj]=a[i];
a[i]=temp;
count++;
}
}
for(int i=0;i<n;i++){
if(i>0) cout<<" ";
cout<<a[i];
}
cout<<endl;
cout<<count<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> arr(N);
for (auto &a: arr) {
cin >> a;
}
int swaps = 0;
for (int i = 0; i < N-1; ++i) {
int minj = i;
for (int j = i+1; j < N; ++j) {
if (arr[j] < arr[minj]) {
minj = j;
}
}
if (i != minj) {
swap(arr[i], arr[minj]);
++swaps;
}
}
cout << arr[0];
for (int i = 1; i < N; ++i) {
cout << ' ' << arr[i];
}
cout << '\n';
cout << swaps << endl;
}
|
#include <iostream>
#include<algorithm>
using namespace std;
int main(){
int n,minj,N[100],swapnumber=0;
cin>>n;
for(int i=0;i<n;i++)cin>>N[i];
for(int i=0;i<n;i++){
minj=i;
for(int j=i;j<n;j++)if(N[j]<N[minj])minj=j;
if(N[i]>N[minj]){
swap(N[i],N[minj]);
swapnumber++;
}
}
for(int i=0;i<n;i++){
if(i!=n-1)cout<<N[i]<<" ";
else cout<<N[i]<<endl;
}
cout<<swapnumber<<endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
// your code goes here
int N;
cin >> N;
int A[N];
for(int i = 0; i < N; ++i){
cin >> A[i];
}
int cnt = 0;
for(int i = 0; i < N; ++i){
int minj = i;
for(int j = i; j < N; ++j){
if(A[j] < A[minj]) minj = j;
}
if(i != minj){
++cnt;
swap(A[i], A[minj]);
}
}
for(int i = 0; i < N - 1; i++) cout << A[i] << " ";
cout << A[N - 1] << endl;
cout << cnt << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main(void){
int n, a[100];
int swpCnt=0;
cin >> n;
for (int i=0; i<n; i++) cin >> a[i];
for (int i=0; i<n; i++){
int mnj=i, tmp;
for (int j=i; j<n; j++){
if (a[j]<a[mnj]) mnj = j;
}
if (mnj==i) continue;
swpCnt++;
tmp = a[i]; a[i] = a[mnj]; a[mnj] = tmp;
}
for (int i=0; i<n-1; i++) cout << a[i] << " ";
cout << a[n-1] << endl;
cout << swpCnt << endl;
return 0;
}
|
#include <stdio.h>
int main(void){
int n,a[100],i,j,minj,aa,sw=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;
}
}
aa=a[i];
a[i]=a[minj];
a[minj]=aa;
if(minj!=i) sw+=1;
}
for(i=0;i<n;i++){
printf("%d",a[i]);
if(i>=n-1)
printf("\n");
else
printf(" ");
}
printf("%d\n",sw);
return(0);
}
|
#include <ios>
#include <iostream>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
int n, i, m, c = 0, a[100] = {};
cin >> n;
for(i = 0; i < n; ++i)
cin >> a[i];
for(i = 0; i < n; ++i){
m = i;
for(int j = i; j < n; ++j){
if( a[j] < a[m] )
m = j;
}
if( m != i ){
swap( a[i], a[m] );
++c;
}
}
for(i = 0; i < n; ++i){
cout << a[i];
if( i != n - 1 )
cout << " ";
}
cout << "\n" << c << "\n";
return 0;
}
|
#include <stdio.h>
#include <algorithm>
using namespace std;
int n, c, a[100];
int main() {
scanf("%d", &n);
for(int i = 0; i < n; i++) scanf("%d", &a[i]);
for(int i = 0; i < n; i++) {
int k = i;
for(int j = i + 1; j < n; j++) {
if(a[k] > a[j]) k = j;
}
if(k != i) swap(a[k], a[i]), c++;
}
for(int i = 0; i < n; i++) {
if(i) printf(" ");
printf("%d", a[i]);
}
printf("\n");
printf("%d\n", c);
return 0;
}
|
#include <iostream>
using namespace std;
#define MAX 100
void print(int A[],int n){
for(int i=0;i<n;i++){
if(i>0)
cout<<" ";
cout<<A[i];
}
cout<<endl;
}
int main(){
int n,A[MAX],k=0,j,minj,temp;
cin>>n;
for(int i=0;i<n;i++)
cin>>A[i];
for(int i=0;i<n;i++){
minj=i;
for(j=i+1;j<n;j++){
if(A[j]<A[minj]){
minj=j;
}
}
temp=A[minj];
A[minj]=A[i];
A[i]=temp;
if(i!=minj)k++;
}
print(A,n);
cout<<k<<endl;
return 0;
}
|
#include<stdio.h>
int selectionSort(int A[],int N)
{
int i,j,t,sum=0,minj;
for(i=0;i<N-1;i++){
minj=i;
for(int 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) sum++;
}
return sum;
}
int main(){
int A[100],N,sum,i;
scanf("%d",&N);
for(i=0;i<N;i++) scanf("%d",&A[i]);
sum=selectionSort(A,N);
for(int i=0;i<N;i++){
if(i>0) printf(" ");
printf("%d",A[i]);
}
printf("\n");
printf("%d\n",sum);
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
// your code goes here
int n;
cin>>n;
int a[110];
for(int i=0;i<n;i++){
cin>>a[i];
}
int ans=0;
int k,mi;
for(int i=0;i<n-1;i++){
mi=a[i+1];
k=i+1;
for(int j=i+1;j<n;j++){
if(a[j]<mi){
k=j;
mi=a[j];
}
}
if(a[i]>mi){
ans++;
int l=a[i];
a[i]=a[k];
a[k]=l;
}
}
for(int i=0;i<n-1;i++)cout<<a[i]<<" ";
cout<<a[n-1]<<endl;
cout<<ans<<endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main(){
int N,A[102];
int i,j,mini,t,cnt=0;
cin >> N;
for (i=0;i<N;i++)cin >> A[i];
for (i=0;i<N;i++){
mini=i;
for (j=i;j<N;j++){
if (A[mini]>A[j])mini=j;
}
if (i!=mini){
t=A[i];
A[i]=A[mini];
A[mini]=t;
cnt++;
}
}
for (i=0;i<N-1;i++)
cout << A[i] << " ";
cout << A[i] << endl;
cout << cnt << endl;
return 0;
}
|
#include<iostream>
using namespace std;
int ssort(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;
}
int main(){
int i,A[100],N,sw;
cin>>N;
for(i=0;i<N;i++) cin>>A[i];
sw=ssort(A,N);
for(i=0;i<N;i++){
if(i>0) cout<<(" ");
cout<<A[i];
}
cout<<endl;
cout<<sw<<endl;
return 0;
}
|
#include<cstdio>
#include<cmath>
int main(void){
int i,j,n,c=0,m,b;
scanf("%d",&n);
int a[n];
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
for(i=0;i<n-1;i++){
m=i;
for(j=i+1;j<n;j++){
if(a[m]>a[j]){
m=j;
}
}
if(a[i]>a[m]){
c++;
b=a[i];
a[i]=a[m];
a[m]=b;
}
}
for(i=0;i<n-1;i++){
printf("%d ",a[i]);
}
printf("%d\n",a[n-1]);
printf("%d\n",c);
return 0;
}
|
#include<iostream>
using namespace std;
void selectionSort(int a[],int n){
int min,c=0;
for(int i=0;i<n;i++){
min=i;
for(int j=i;j<n;j++){
if(a[min]>a[j]) min=j;
}
swap(a[i],a[min]);
if(i!=min) c++;
}
for(int i=0;i<n;i++) cout<<a[i]<<((i==n-1)?'\n':' ');
cout<<c<<endl;
}
int main(){
int n,a[100];
cin>>n;
for(int i=0;i<n;i++) cin>>a[i];
selectionSort(a, n);
}
|
#include <iostream>
using namespace std;
int main(){
int n,a[100],result=0,i,j;
cin>>n;
for(i=0;i<n;i++) cin>>a[i];
for(i=0;i<n-1;i++){
int now,minnum=101;
for(j=i;j<n;j++) if(minnum>a[j]){
now=j;
minnum=a[j];
}
if(i!=now){
swap(a[i],a[now]);
result++;
}
}
for(i=0;i<n-1;i++) cout<<a[i]<<" ";
cout<<a[n-1]<<endl;
cout<<result<<endl;
return 0;
}
|
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int n,A[100],mini,count=0;
cin>>n;
for(int i=0;i<n;i++)cin>>A[i];
for(int i=0;i<n-1;i++){
mini=i;
for(int j=i+1;j<n;j++){
if(A[j]<A[mini])mini=j;
}
if(i!=mini){
count++;
swap(A[i],A[mini]);
}
}
for(int i=0;i<n;i++){
if(i)cout<<' ';
cout<<A[i];
}
cout<<endl<<count<<endl;
return 0;
}
|
#include <bits/stdc++.h>
#define N 101
using namespace std;
int main(){
int n;
cin>>n;
int A[N],cnt=0;
for(int i=0;i<n;i++)cin>>A[i];
for(int i=0;i<n-1;i++){
int idx = i;
for(int j=i;j<n;j++)
if(A[j]<A[idx])idx = j;
cnt+=i!=idx;
swap(A[i],A[idx]);
}
for(int i=0;i<n;i++){
if(i)cout<<" ";
cout<<A[i];
}
cout<<endl;
cout<<cnt<<endl;
return 0;
}
|
#include<iostream>
using namespace std;
int main() {
int l[110], n; cin >> n;
for (int i = 0; i < n; i++){
cin >> l[i];
}
int sum = 0;
for (int i = 0; i < n; i++){
int minj = i;
for (int j = i; j < n; j++) {
if (l[j] < l[minj])minj = j;
}
if (i != minj){
int tmp = l[i];
l[i] = l[minj];
l[minj] = tmp;
sum++;
}
}
for (int i = 0; i < n; i++){
cout << l[i];
if (i != n - 1)cout << ' ';
else cout << endl << sum << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) cin >> A[i];
int ret = 0;
for (int i = 0; i < N; i++) {
int minj = i;
for (int j = i+1; j < N; j++) {
if (A[j] < A[minj]) minj = j;
}
if (minj != i) {
swap(A[i], A[minj]);
ret++;
}
}
cout << A[0];
for (int i = 1; i < N; i++) cout << ' ' << A[i];
cout << endl;
cout << ret << endl;
}
|
#include<iostream>
using namespace std;
int main(){
int n,min;
int cnt = 0;
int a[100];
cin >> n;
for(int i=0;i<n;i++) cin >> a[i];
for(int i=0;i<n;i++){
min =i;
for(int j=i;j<n;j++){
if(a[j]<a[min]) min=j;
}
if(a[i]>a[min]){
swap(a[i],a[min]);
cnt++;
}
}
cout << a[0];
for(int i=1;i<n;i++) cout <<" "<< a[i];
cout << endl;
cout << cnt << endl;
}
|
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
int count = 0;
for(int i=0;i<n;i++){
cin >> a[i];
}
for(int i=0;i<n;i++){
int minj = i;
for(int j=i+1;j<n;j++){
if(a[j]<a[minj]){
minj = j;
}
}
if(a[i]>a[minj]){
swap(a[i],a[minj]);
count++;
}
}
for(int i=0;i<n;i++){
cout << a[i] ;
if(i<n-1) cout << " ";
}
cout << endl;
cout << count << endl;
return 0;
}
|
#include<iostream>
using namespace std;
int main() {
int n;
cin >> n;
int* a = new int[n];
for (int i = 0;i < n;i++) {
cin >> a[i];
}
int count = 0;
int minj;
for (int i = 0;i < n - 1;i++) {
minj = i;
for (int j = i + 1;j < n;j++) {
if (a[j] < a[minj])minj = j;
}
if (minj != i) {
count++;
swap(a[i], a[minj]);
}
}
for (int i = 0;i < n - 1;i++) {
cout << a[i] << " ";
}
cout << a[n - 1] << endl << count << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n,x) for(int i=n;i<x;i++)
int main() {
int n; cin>>n;
vector<int> a(n); rep(i,0,n) cin>>a[i];
int sw = 0;
rep(i,0,n){
int minj = i;
rep(j,i,n) if(a[j] < a[minj]) minj = j;
if(i != minj) {
swap(a[i], a[minj]);
sw++;
}
}
rep(i,0,n){
if(i) cout<<" ";
cout<<a[i];
}
cout<<endl;
cout<<sw<<endl;
return 0;
}
|
# include <stdio.h>
int main()
{
int a[100];
int n;
int num = 0;
scanf("%d",&n);
for(int i = 0; i < n; ++i) scanf("%d", &a[i]);
for (int i = 0; i < n; i++)
{
int tem = i;
for (int j = i + 1; j < n; j++)
{
if (a[tem] > a[j]) tem = j;
}
if (tem != i)
{
int v = a[tem];
a[tem] = a[i];
a[i] = v;
++num;
}
}
for(int i = 0; i < n - 1; ++i)
{
printf("%d ", a[i]);
}
printf("%d\n%d\n", a[n-1],num);
}
|
#include<iostream>
using namespace std;
int main() {
int n;
cin >> n;
int A[111];
for (int i = 0; i < n; i++) cin >> A[i];
int cnt = 0;
for (int i = 0; i < n; i++) {
int minj = i;
for (int j = i; j < n; j++) {
if (A[j] < A[minj]) {
minj = j;
}
}
if (i != minj) {
swap(A[i], A[minj]);
cnt++;
}
}
for (int i = 0; i < n; i++) cout << A[i] << " \n"[i == n - 1];
cout << cnt << endl;
return 0;
}
|
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int n, minj, count = 0;
cin >> n;
int A[n];
for(int i = 0; i < n; i++)
cin >> A[i];
for(int i = 0; i < n; i++){
minj = i;
for(int j = i; j < n; j++){
if(A[j] < A[minj])
minj = j;
}
swap(A[i], A[minj]);
if(i != minj)
count++;
}
for(int i = 0; i < n; i++){
if(i > 0)
cout << " ";
cout << A[i];
}
cout << endl << count << endl;
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.