text stringlengths 49 983k |
|---|
#include<iostream>
#include<cstdio>
using namespace std;
int inSort(int A[],int n,int g){
int i,j,v;
int cnt=0;
for(i=g;i<n;i++){
v=A[i];
j=i-g;
while(j>=0 && A[j]>v){
A[j+g]=A[j];
j-=g;
++cnt;
}
A[j+g]=v;
}
return cnt;
}
void shSort(int A[],int n){
int i,j,k,l,G[20];
int m=0; for(i=1;i<=n;i=i*3+1) G[m++]=i;
int c=0; for(i=m-1;0<=i;i--) c+=inSort(A,n,G[i]);
printf("%d\n%d",m,G[m-1]);
for(i=m-2;0<=i;i--) printf(" %d",G[i]);
printf("\n%d\n",c);
for(i=0;i<n;i++) printf("%d\n",A[i]);
}
int main(){
int i,n,A[1000000];
cin>>n;
for(i=0;i<n;i++) cin>>A[i];
shSort(A,n);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
void insertion_sort(vector<int> &A, int g, int &cnt) {
for (int i = g; i < A.size(); ++i) {
int v = A[i];
int j = i - g;
while (j >= 0 && A[j] > v) {
A[j+g] = A[j];
j -= g;
cnt++;
}
A[j+g] = v;
}
}
void shell_sort(vector<int> &A, const vector<int> &G, int &cnt) {
for (auto g: G) {
insertion_sort(A, g, cnt);
}
}
int main() {
int n;
cin >> n;
vector<int> A(n);
for (auto &Ai: A) {
cin >> Ai;
}
vector<int> G;
G.reserve(20);
int x = 1;
do {
G.push_back(x);
x *= 2.25;
} while (x <= n);
reverse(G.begin(), G.end());
int cnt = 0;
shell_sort(A, G, cnt);
int m = G.size();
cout << m << '\n';
cout << G[0];
for (int i = 1; i < m; ++i) {
cout << ' ' << G[i];
}
cout << '\n' << cnt << '\n';
for (auto Ai: A) {
cout << Ai << '\n';
}
}
|
#include<iostream>
#include<stdio.h>
int cnt=0;
void inSort(int A[],int n,int g){
int i,j,v;
for(i=g;i<n;i++){
v=A[i];
j=i-g;
while(j>=0 && A[j]>v){
A[j+g]=A[j];
j-=g;
++cnt;
}
A[j+g]=v;
}
}
void shSort(int A[],int n){
int i,j,k,l,G[20];
int m=0; for(i=1;i<=n;i=i*3+1) G[m++]=i;
for(i=m-1;0<=i;i--) inSort(A,n,G[i]);
printf("%d\n%d",m,G[m-1]);
for(i=m-2;0<=i;i--) printf(" %d",G[i]);
printf("\n%d\n",cnt);
for(i=0;i<n;i++) printf("%d\n",A[i]);
}
int main(){
int i,n,A[1000000];
std::cin>>n;
for(i=0;i<n;i++) std::cin>>A[i];
shSort(A,n);
return 0;
} |
#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];
}
vector<int> G;
for (int h=1; ; ) {
if (h>n) {
break;
}
G.push_back(h);
h=3*h+1;
}
long long cnt=0;
for (int i=G.size()-1; i>=0; i--) {
for (int j=G[i]; j<n; j++) {
int v=A[j];
int k=j-G[i];
while (k>=0 && A[k]>v) {
A[k+G[i]]=A[k];
k-=G[i];
cnt++;
}
A[k+G[i]]=v;
}
}
printf("%d\n", G.size());
for (int i=G.size()-1; i>=0; i--) {
printf("%d", G[i]);
if (i) {
printf(" ");
}
}
printf("\n");
printf("%lld\n", cnt);
for (int i=0; i<n; i++) {
printf("%d\n",A[i]);
}
return 0;
} |
#include<iostream>
#include<algorithm>
using namespace std;
int cnt, m;
int G[100]={1};
void insertionSort(int *A, int n, int g){
for(int i=g;i<n;i++){
int v=A[i];
int j=i-g;
while(j>=0&&A[j]>v){
A[j+g]=A[j];
j-=g;
cnt++;
}
A[j+g]=v;
}
}
void shellSort(int *A, int n){
cnt=0;
for(int i=1;i<100;i++){
G[i]=3*G[i-1]+1;
if(G[i]>n){
m=i;
break;
}
}
for(int i=0;i<m;i++){
insertionSort(A, n, G[m-i-1]);
}
}
int main(){
int n, a[1000000];
cin>>n;
for(int i=0;i<n;i++) cin>>a[i];
shellSort(a, n);
cout<<m<<endl;
for(int i=0;i<m;i++){
cout<<(i?" ":"");
cout<<G[m-i-1];
}
cout<<endl;
cout<<cnt<<endl;
for(int i=0;i<n;i++) cout<<a[i]<<endl;
return 0;
}
|
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
int cnt;
void insertionSort(vector<int> &a,int g){
for(int i=g;i<a.size();i++){
int v = a[i];
int j = i - g;
while(j>=0 && a[j]>v){
a[j+g] = a[j];
j = j - g;
cnt++;
a[j+g] = v;
}
}
}
void shellSort(vector<int> &a){
vector<int>g;
cnt = 0;
for(int h=1;h<=a.size();h=3*h+1)g.push_back(h);
reverse(g.begin(),g.end());
int m = g.size();
printf("%d\n",m);
for(int i=0;i<g.size();i++)printf(i<g.size()-1?"%d ":"%d\n",g[i]);
for(int i=0;i<m;i++)insertionSort(a,g[i]);
}
int main(){
vector<int> a;
int n,x;
scanf("%d",&n);
for(int i=0;i<n;i++)scanf("%d",&x),a.push_back(x);
shellSort(a);
printf("%d\n",cnt);
for(int i=0;i<n;i++)printf("%d\n",a[i]);
} |
#include<iostream>
using namespace std;
int insertionsort(int* a,int n,int g,int cnt){
for(int i = g; i < n; i++){
int v = a[i];
int j = i - g;
while(j >= 0 && a[j] > v){
a[j+g] = a[j];
j -= g;
cnt++;
}
a[j+g] = v;
}
return cnt;
}
int main(){
int cnt = 0;
int n;
cin >> n;
int a[n];
for(int i = 0; i < n; i++){
cin >> a[i];
}
int x = n;
int g[n];
int m = 0;
for(int i = 0; x > 1; i++){
x = x - 1;
g[i] = x;
m++;
x = x/3;
}
g[m] = 1;
m++;
for(int i = 0; i < m; i++){
cnt = insertionsort(a,n,g[i],cnt);
}
cout << m << "\n";
for(int i = 0; i < m; i++){
if(i > 0){
cout << " ";
}
cout << g[i];
}
cout << "\n";
cout << cnt << "\n";
for(int i = 0; i < n; i++){
cout << a[i] << "\n";
}
return 0;
}
|
#include<iostream>
#include<vector>
#include<stdio.h>
using namespace std;
int A[1000000];
int l,n;
long long cnt;
vector<int> G;
void insertionsort(int A[],int n,int g){
for(int i=g;i<n;i++){
int v=A[i];
int j=i-g;
while(j>=0&&A[j]>v){
A[j+g]=A[j];
j-=g;
cnt++;
}
A[j+g]=v;
}
}
void shellsort(int A[],int n){
for(int h=1;;){
if(h>n) break;
G.push_back(h);
h=h*3+1;
}
for(int i=G.size()-1;i>=0;i--){
insertionsort(A,n,G[i]);
}
}
int main(){
cin>>n;
for(int i=0;i<n;i++) scanf("%d",&A[i]);
cnt=0;
shellsort(A,n);
cout<<G.size()<<endl;
for(int i=G.size()-1;i>=0;i--){
printf("%d",G[i]);
if(i)printf(" ");
}
printf("\n");
printf("%d\n",cnt);
for(int i=0;i<n;i++) printf("%d\n",A[i]);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int insertionsort(int a[],int n,int g){
int cnt=0;
for(int i=g;i<n;i++){
int v=a[i];
int j=i-g;
while(j>=0 && a[j]>v){
a[j+g]=a[j];
j=j-g;
cnt++;
}
a[j+g]=v;
}
return cnt;
}
int shell(int a[],int n){
int cnt=0;
int m;
int g[100000];
g[0]=1;
m=0;
while(g[m]<n){
g[m+1]=(g[m]*3)+1;
m++;
}
if(m==0) m++;
cout<<m<<endl;
for(int i=m-1;i>=0;i--){
if(i==0) cout<<g[i]<<endl;
else cout<<g[i]<<" ";
}
for(int i=m-1;i>=0;i--){
cnt+=insertionsort(a,n,g[i]);
}
return cnt;
}
int main(){
int n,p;
cin>>n;
int a[1000000];
for(int i=0;i<n;i++){
cin>>a[i];
}
p=shell(a,n);
cout<<p<<endl;
for(int i=0;i<n;i++){
cout<<a[i]<<endl;
}
return 0;
}
|
#include<iostream>
#include<math.h>
#include<algorithm>
#include<vector>
using namespace std;
long long cnt;
int l;
int A[10000000];
int n;
vector<int>G;
void insertionSort(int A[],int n,int g){
for(int i=g;i<n;i++){
int v=A[i];
int j=i-g;
while(j>=0&&A[j]>v){
A[j+g]=A[j];
j-=g;
cnt++;
}
A[j+g]=v;
}
}
void shellSort(int A[],int n){
for(int h=1;;){
if(h>n)break;
G.push_back(h);
h=3*h+1;
}
for(int i=G.size()-1;i>=0;i--){
insertionSort(A,n,G[i]);
}
}
int main(){
cin >> n;
for(int i=0;i<n;i++)cin >> A[i];
cnt=0;
shellSort(A,n);
cout << G.size() << endl;
for(int i=G.size()-1;i>=0;i--){
cout << G[i];
if(i)cout << " ";
}
cout << endl;
cout << cnt << endl;
for(int i=0;i<n;i++)cout << A[i] << endl;
return 0;
} |
#include <iostream>
#include <cstdio>
#include <vector>
using namespace std;
int A[1000000];
int n;
long long cnt;
int m;
vector<int> G;
void isort(int g)
{
for (int i = g; i < n; i++) {
int v = A[i];
int j = i - g;
while (j >= 0 && A[j] > v) {
A[j + g] = A[j];
j -= g;
cnt++;
}
A[j + g] = v;
}
}
void ssort()
{
cnt = 0;
for (int i = 1; i <= n; i = i * 3 + 1) {
G.push_back(i);
}
for (int i = G.size() - 1; i >= 0; i--) {
isort(G[i]);
}
}
int main()
{
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", A + i);
}
ssort();
cout << G.size() << endl;
for (int i = G.size() - 1; i>= 0; i--) {
cout << G[i];
if (i != 0) cout << " ";
else cout << endl;
}
cout << cnt << endl;
for (int i = 0; i < n; i++) {
printf("%d\n", A[i]);
}
return 0;
}
|
#include<iostream>
#include<cstdio>
using namespace std;
int inSort(int A[],int n,int g){
int i,j,v;
int cnt=0;
for(i=g;i<n;i++){
v=A[i];
j=i-g;
while(j>=0 && A[j]>v){
A[j+g]=A[j];
j-=g;
++cnt;
}
A[j+g]=v;
}
return cnt;
}
void shSort(int A[],int n){
int i,j,k,l,G[20];
int m=0; for(i=1;i<=n;i=i*3+1) G[m++]=i;
int c=0; for(i=m-1;0<=i;i--) c+=inSort(A,n,G[i]);
cout<<m<<endl;
cout<<G[m-1]; for(i=m-2;0<=i;i--) cout<<' '<<G[i]; cout<<endl;
cout<<c<<endl;
for(i=0;i<n;i++) printf("%d\n",A[i]);
}
int main(){
int i,n,A[1000000];
cin>>n;
for(i=0;i<n;i++) cin>>A[i];
shSort(A,n);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,x,to) for(int i=x;i<to;i++)
long long cnt;
int v,j;
vector<int> G;
void insert(long int a[],int n, int g){
rep(i,g,n){
v = a[i];
j = i-g;
while(j>=0&&a[j]>v){
a[j+g] = a[j];
j = j-g;
cnt++;
}
a[j+g] = v;
}
}
void shellsort(long int a[],int n){
for(int h=1;;){
if(h>n) break;
G.push_back(h);
h = 3*h+1;
}
for(int i=G.size()-1;i>=0;i--) insert(a,n,G[i]);
}
int main() {
int n; cin >> n;
cnt=0;
long int a[1000000];
rep(i,0,n) cin >> a[i];
shellsort(a,n);
cout << G.size() << endl;
for(int i=G.size()-1;i>=0;i--){
if(i==G.size()-1) cout << G[i];
else cout << " " << G[i];
}
cout <<endl<<cnt<<endl;
rep(i,0,n) cout << a[i] <<endl;
return 0;
}
|
#include<stdio.h>
#include<stdlib.h>
int cnt=0;
int n;
void insertionSort(int *A,int g){
int i,j;
int v;
for(i=g;i<n;i++){
v = A[i];
j = i - g;
while(j >= 0 && A[j] > v){
A[j+g] = A[j];
j -= g;
cnt++;
}
A[j+g] = v;
}
}
int main(){
int i;
int m=0;
int *A;
int *G;
int nn=1;
scanf("%d",&n);
while(nn<=n){
m++;
nn*=2;
}
A = (int *)calloc(n,sizeof(int));
G = (int *)calloc(m,sizeof(int));
G[m-1]=1;
for(i=m-2;i>=0;i--){
G[i]=2*G[i+1];
}
for(i=0;i<n;i++){
scanf("%d",&A[i]);
}
for(i=0;i<m;i++){
insertionSort(A,G[i]);
}
printf("%d\n",m);
for(i=0;i<m-1;i++){
printf("%d ",G[i]);
}
printf("%d\n%d\n",G[m-1],cnt);
for(i=0;i<n;i++){
printf("%d\n",A[i]);
}
} |
#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 cnt = 0, m = 0, h = 0;
while(h <= n) {
h = 3 * h + 1;
m++;
}
m--;
vector<int> g(m);
g[0] = 1;
for (int i = 1; i < m; i++) {
g[i] = 3 * g[i-1] + 1;
}
reverse(g.begin(), g.end());
for (int k = 0; k < m; k++) {
for (int i = g[k]; i < n; i++) {
int v = a[i];
int j = i - g[k];
while (j >= 0 && a[j] > v) {
a[j+g[k]] = a[j];
j = j - g[k];
cnt++;
}
a[j+g[k]] = v;
}
}
cout << m << endl;
for (int i = 0; i < m; i++) {
if (i < m - 1) cout << g[i] << " ";
else cout << g[i] << endl;
}
cout << cnt << endl;
for (int i = 0; i < n; i++) {
cout << a[i] << endl;
}
}
|
#include <bits/stdc++.h>
#define N 1000010
using namespace std;
int cnt=0;
void insertionSort(int *A,int n,int g){
for(int i=g;i<n;i++){
int v = A[i];
int j = i - g;
while(j>=0 && A[j]>v){
A[j+g] = A[j];
j = j - g;
cnt++;
}
A[j+g] = v;
}
}
void shellSort(int *A,int n){
cnt = 0 ;
int m = 1;//
int G[25] = {1};
for(int i=1;G[i-1]*3<=n;i++)G[i] = G[i-1]*3,m++;
for(int i=0;i<m;i++) insertionSort(A,n,G[m-1-i]);
cout<<m<<endl;
for(int i=0;i<m;i++){
if(i)printf(" ");
printf("%d",G[m-1-i]);
}
cout<<endl;
}
int main(){
int n,A[N];
cin>>n;
for(int i=0;i<n;i++)scanf("%d",&A[i]);
shellSort(A,n);
cout<<cnt<<endl;
for(int i=0;i<n;i++) printf("%d\n",A[i]);
return 0;
} |
#include<iostream>
using namespace std;
int main(){
int n,cnt=0,m=0;
cin>>n;
int a[n];
int g[100]={1};
for (int i=0;i<n;i++){
cin>>a[i];
}
while(g[m]<n){
g[m+1]+=3*g[m];
m++;
}
if(n==1){
m=1;
}
for(int i=m-1;i>=0;i--){
for(int k=g[i];k<n;k++){
int v=a[k];
int j=k-g[i];
while(j>=0&&a[j]>v){
a[j+g[i]]=a[j];
j=j-g[i];
cnt++;
}
a[j+g[i]]=v;
}
}
cout<<m<<endl;
for(int i=m-1;i>0;i--){
cout<<g[i]<<" ";
}
cout<<g[0]<<endl;
cout<<cnt<<endl;
for(int i=0;i<n;i++){
cout<<a[i]<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> A;
vector<int> G;
int cnt;
void insertionSort(int n, int g)
{
int v, j;
for(int i = g; i <= n-1; i++)
{
v = A[i];
for(j = i-g; j >= 0 && A[j] > v; A[j+g] = A[j], j -= g, cnt++);
A[j+g] = v;
}
}
void shellSort(int n)
{
for(int i = 1; i <= n; G.push_back(i), i=3*i+1);
for(int i = G.size()-1; i >= 0; insertionSort(n, G[i]), i--);
}
int main()
{
int n, x;
scanf("%d", &n);
for(int i = 0; i < n; i++)
{
scanf("%d", &x);
A.push_back(x);
}
cnt = 0;
shellSort(n);
printf("%d\n", G.size());
for(int i = G.size()-1; i >= 0; i--)
printf("%d%c", G[i], i == 0 ? '\n' : ' ');
printf("%d\n", cnt);
for(int i = 0; i < n; i++)
printf("%d\n", A[i]);
return 0;
}
|
#include <iostream>
using namespace std;
int main(void){
int cnt=0,m=0,n,a[1000000],g[100]={0};
cin>>n;
for(int i=0;i<n;i++)
cin>>a[i];
g[0]=1;
while(g[m]<n){
g[m+1]=3*g[m]+1;
m++;
}
if(n==1)
m=1;
for(int i=m-1;i>=0;i--){
for(int k=g[i];k<n;k++){
int v=a[k];
int j=k-g[i];
while(j>=0&&a[j]>v){
a[j+g[i]]=a[j];
j=j-g[i];
cnt++;
}
a[j+g[i]]=v;
}
}
cout<<m<<endl;
for(int i=m-1;i>0;i--)
cout<<g[i]<<" ";
cout<<g[0]<<endl;
cout<<cnt<<endl;
for(int i=0;i<n;i++)
cout<<a[i]<<endl;
return 0;
} |
#include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
ll cnt;
int l;
int a[1000000];
int n;
vector<int> G;
void insertionsort(int a[],int n,int g){
for(int i=g;i<n;i++){
int v=a[i];
int j=i-g;
while(j>=0 && a[j]>v){
a[j+g]=a[j];
j-=g;
cnt++;
}
a[j+g]=v;
}
}
void shellsort(int a[],int n){
for(int h=1;;){
if(h>n) break;
G.push_back(h);
h=3*h+1;
}
for(int i=G.size()-1;i>=0;i--){
insertionsort(a,n,G[i]);
}
}
int main() {
cin>>n;
for(int i=0;i<n;i++) scanf("%d",&a[i]);
cnt=0;
shellsort(a,n);
cout<<G.size()<<endl;
for(int i=G.size()-1;i>=0;i--){
printf("%d",G[i]);
if(i)printf(" ");
}
printf("\n");
printf("%d\n",cnt);
for(int i=0;i<n;i++) printf("%d\n",a[i]);
return 0;
}
|
#include <iostream>
#include <vector>
#include <cstdio>
using namespace std;
int a[1000000];
int cnt = 0;
void insertionsort(int A[],int n ,int g)
{
for (int i = g; i < n; ++i)
{
int v = A[i];
int j = i-g;
while(j>=0 && A[j]>v)
{
A[j+g] = A[j];
j = j-g;
cnt++;
}
A[j+g] = v;
}
}
int main(int argc, char const *argv[])
{
int n;
scanf("%d", &n);
for (int i = 0; i < n; ++i)
{
scanf("%d",&a[i]);
}
vector<int> G;
int h = 1;
for (int i = 0; i < n; ++i)
{
if(h>n) break;
G.push_back(h);
h = 3*h+1;
}
int m = G.size();
for (int i = m-1; i >= 0; --i)
{
insertionsort(a, n, G[i]);
}
printf("%d\n", m);
for (int i = m-1; i > 0; --i)
{
printf("%d ", G[i]);
}
printf("%d\n", G[0]);
printf("%d\n", cnt);
for (int i = 0; i < n; ++i)
{
printf("%d\n", a[i]);
}
return 0;
} |
#include <cstdio>
#include <vector>
using namespace std;
int cnt,m;
vector<int> G;
void insertionSort(vector<int>& a, int n, int g) {
for(int i=g; i<n; ++i) {
int j,v=a[i];
for(j=i-g; j>=0 && a[j]>v;j-=g) {
swap(a[j+g],a[j]);
++cnt;
}
a[j+g]=v;
}
}
void shellSort(vector<int>& a,int n) {
cnt = 0;
m=0;
int d=n;
G.resize(n);
while(1) {
d=2*d/3;
if(d<2) {
G[m]=d;
++m;
break;
}
G[m]=d;
++m;
}
for(int i=0; i<m; ++i) {
insertionSort(a, n, G[i]);
}
}
int main() {
int n;
vector<int> a;
scanf("%d",&n);
a.resize(n);
for(int i=0; i<n; ++i) {
scanf("%d",&a[i]);
}
shellSort(a,n);
printf("%d\n",m);
for(int i=0; i<m-1; ++i) {
printf("%d ",G[i]);
}
printf("%d\n%d\n",G[m-1],cnt);
for(int i=0;i<n;++i) {
printf("%d\n",a[i]);
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
const int MAXN=1000010;
int cnt=0,G[100];
void Insertion_Sort(int s,int t,int n,int* A)
{
for(int i=s+t;i<n;i+=t)
{
int key=A[i],j=i-t;
while(j>=0&&A[j]>key)
{
A[j+t]=A[j];
j-=t;
cnt++;
}
if(A[j+t]!=key)
{
A[j+t]=key;
//cnt++;
}
}
}
int main()
{
for(int i=0;(G[i]=G[i-1]*3+1)<=MAXN;i++);
static int n,A[MAXN];
scanf("%d",&n);
for(int i=0;i<n;i++)
scanf("%d",&A[i]);
int t;
for(t=0;G[t]<=n;t++);
printf("%d\n",t);
for(int i=t-1;i>=0;i--)
printf("%d%c",G[i],i==0?'\n':' ');
for(int i=t-1;i>=0;i--)
for(int j=0;j<G[i];j++)
Insertion_Sort(j,G[i],n,A);
printf("%d\n",cnt);
for(int i=0;i<n;i++)
printf("%d\n",A[i]);
return 0;
} |
#include<iostream>
#include<math.h>
#include<algorithm>
using namespace std;
int n, A[1000010], cnt = 0;
void insertionSort(int A[],int n, int g){
for(int i=g;i<n;i++){
int v = A[i];
int j = i - g;
while(j >= 0 && A[j] > v){
A[j+g] = A[j];
j -= g;
cnt++;
}
A[j+g] = v;
}
}
int main(){
cin>>n;
for(int i=0;i<n;i++)cin>>A[i];
int m, G[1000000], i;
G[0]=1;
i = 0;
if(n==1) m = 1;
else{
while(G[i]<n){
G[i+1] = 3 * G[i] + 1;
i++;
}
m = i;
}
cout<<m<<endl;
for(int i=m-1;i>=0;i--){
insertionSort(A, n, G[i]);
cout<<G[i];
if(i) cout<<" ";
}
cout<<endl;
cout<<cnt<<endl;
for(int i=0;i<n;i++) cout<<A[i]<<endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main(){
int n,v,j,m,cnt,g;
int a[1000000];
cin >> n;
for(int i=0; i<n; i++) cin >> a[i];
cnt = 0;
m = 1;
g = 1;
for(g=1; g<= n/9; g=g*3+1){
m += 1;
};
cout << m << endl;
while(g>=1){
cout << g << " ";
for(int i=g; i<n; i++){
v = a[i];
j = i-g;
while(j>=0 && a[j] > v){
a[j+g] = a[j];
j = j-g;
cnt++;
};
a[j+g] = v;
};
g /= 3;
};
cout << endl << cnt << endl;
for(int i=0; i<n; i++){
cout << a[i] << endl;
};
return 0;
}
|
#include <cstdio>
#include <vector>
#include <utility>
#include <algorithm>
#include <cmath>
using namespace std;
static inline void p(int x) { printf("%d\n", x); }
int main()
{
int n, cnt = 0;
scanf("%d", &n);
vector<int> A(n), G;
for (int &x: A)
scanf("%d", &x);
for (int i = 1, x = 1; x <= n; x = (pow(3, ++i) - 1) / 2)
G.push_back(x);
reverse(G.begin(), G.end());
for (int g: G)
for (auto b = A.begin(), i = b + g, e = A.end(); i != e; i++) {
int v = *i;
auto j = i - g;
for(; j >= b && *j > v; j -= g)
*(j + g) = *j, cnt++;
*(j + g) = v;
}
p(G.size());
for (int &x: G)
printf("%s%d", (&x == &G[0] ? "" : " "), x);
puts("");
p(cnt);
for (int x: A)
p(x);
}
|
#include <iostream>
using namespace std;
int main() {
int n, m;
cin >> n;
int A[n];
for(int i = 0; i < n; i++){
cin >> A[i];
}
int G[n];
int i = 1;
int j = 0;
while(i <= n){
G[j] = i;
i = 3*i+1;
j++;
}
m = j;
cout << m << endl;
for(int i = m-1; i > 0; i--){
cout << G[i] << " ";
}
cout << G[0] << endl;
int cnt = 0;
for(int k = m-1; k >= 0; k--){
for(int i = G[k]; i < n; i++){
int v = A[i];
int j = i - G[k];
while(j >= 0 && A[j] > v){
A[j+G[k]] = A[j];
j = j-G[k];
cnt++;
}
A[j + G[k]] = v;
}
}
cout << cnt << endl;
for(int i = 0; i < n; i++){
cout << A[i] << endl;
}
return 0;
}
|
#include<iostream>
#include<vector>
using namespace std;
int cnt;
int l,n;
int A[1000000];
vector<int> G;
void insertionSort(int A[],int n,int g){
for(int i=g;i<n;i++){
int v=A[i];
int j=i-g;
while(j>=0 && A[j]>v){
A[j+g]=A[j];
j-=g;
cnt++;
}
A[j+g]=v;
}
}
void shellSort(int A[],int n){
for(int h=1; ; ){
if(h>n)break;
G.push_back(h);
h=h*3+1;
}
for(int i=G.size()-1;i>=0;i--){
insertionSort(A,n,G[i]);
}
}
int main(){
cin>>n;
for(int i=0;i<n;i++) cin>>A[i];
cnt=0;
shellSort(A,n);
cout<<endl;
cout << G.size() <<endl;
for(int i=G.size()-1;i>=0;i--){
cout<<G[i];
if(i) cout<<" ";
}
cout<<endl;
cout<<cnt<<endl;
for(int i=0;i<n;i++) cout<<A[i]<<endl;
return 0;
}
|
#include<iostream>
#include<cstdio>
#include<vector>
using namespace std;
long long cnt;
int n, l, A[1000000];
vector<int> G;
void insertionSort(int A[], int n, int g) {
for (int i = g; i < n; i++) {
int v = A[i];
int j = i - g;
while (j >= 0 && A[j] > v) {
A[j + g] = A[j];
j -= g;
cnt++;
}
A[j + g] = v;
}
}
void shellSort(int A[], int n) {
for (int h = 1;;) {
if (h > n) break;
G.push_back(h);
h = 3 * h + 1;
}
for (int i = G.size() - 1; i >= 0; i--) {
insertionSort(A, n, G[i]);
}
}
int main() {
cin >> n;
for (int i = 0; i < n; i++) scanf("%d", &A[i]);
cnt = 0;
shellSort(A, n);
cout << G.size() << endl;
for (int i = G.size() - 1; i >= 0; i--) {
cout << G[i];
if (i) cout << " ";
}
cout << endl;
cout << cnt << endl;
for (int i = 0; i < n; i++) cout << A[i] << endl;
}
|
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
int64_t cnt = 0;
vector<int> G;
void insertionsort(vector<int> &A,int n,int g){
for(int i = g; i < n; i++){
int v = A.at(i);
int j = i - g;
while(j >= 0 && A.at(j) > v){
A.at(j+g) = A.at(j);
j -= g;
cnt++;
}
A.at(j+g) = v;
}
}
void shellsort(vector<int> &A,int n){
int m = G.size();
rep(i,m) insertionsort(A,n,G.at(m-1-i));
}
int main(){
int N;
cin >> N;
vector<int> A(N);
rep(i,N) cin >> A.at(i);
int h = 1;
while(h <= N){
G.push_back(h);
h = (3 * h) + 1;
}
int m = G.size();
cout << m << endl;
shellsort(A,N);
for(int i = m - 1; i >= 0; i--){
cout << G.at(i);
if(i) cout << " ";
}
cout << "\n" << cnt << endl;
rep(i,N) cout << A.at(i) << endl;
}
|
#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
#include <cmath>
using namespace std;
typedef vector<int> vi;
template<typename T>
static inline void p(T x) { cout << x << endl; }
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n, cnt = 0;
cin >> n;
vi A(n), G;
for (int &x: A)
cin >> x;
for (int i = 1, x = 1; x <= n; x = (pow(3, ++i) - 1) / 2)
G.push_back(x);
reverse(G.begin(), G.end());
for (int g: G)
for (int i = g; i < n; i++) {
int v = A[i], j = i - g;
for(; j >= 0 && A[j] > v; j -= g)
A[j+g] = A[j], cnt++;
A[j+g] = v;
}
p(G.size());
for (int &x: G)
cout << (&x == &G[0] ? "" : " ") << x;
p("");
p(cnt);
for (int x: A)
p(x);
}
|
#include <iostream>
#include <cmath>
using namespace std;
int insertionSort(int A[], int n, int g)
{
int cnt = 0;
for (int i = g; i < n; i++) {
int v = A[i];
int j = i - g;
while (j >= 0 && A[j] > v) {
A[j + g] = A[j];
j = j - g;
cnt++;
}
A[j + g] = v;
}
return cnt;
}
int main() {
int A[1000000];
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> A[i];
int cnt = 0;
int m = 0;
int nn = n;
int G[100];
while (nn > 0){
m++;
nn = nn/2;
}
for (int i = 0; i < m; i++)
{
G[i] = pow(2.0, m - i - 1);
cnt += insertionSort(A, n, G[i]);
}
cout << m << endl;
for (int i = 0; i < m; i++)
cout << G[i] << " ";
cout << endl;
cout << cnt << endl;
for (int i = 0; i < n; i++)
cout << A[i] << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int n,cnt;
vector<int>A;
void insertionSort(int g){
for(int i=g;i<n;i++){
int v=A[i];
int j=i-g;
while(j>=0&&A[j]>v){
A[j+g]=A[j];
j-=g;
cnt++;
}
A[j+g]=v;
}
}
void shellSort(){
int r=1;
vector<int>G;
while(r<=n){
G.push_back(r);
r*=2;
}
int m=G.size();
reverse(G.begin(),G.end());
cout<<m<<endl;
for(int i=0;i<m;i++)cout<<G[i]<<" \n"[i==m-1];
for(int i=0;i<m;i++)insertionSort(G[i]);
cout<<cnt<<endl;
}
int main(){
cin>>n;
A.resize(n);
for(int i=0;i<n;i++)cin>>A[i];
shellSort();
for(int i=0;i<n;i++)cout<<A[i]<<endl;
return 0;
}
|
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>
using namespace std;
long long cnt;
int l;
int A[1000000];
int n;
vector<int> G;
void insertsort(int A[],int n,int g){
for(int i=g;i<n;i++){
int v=A[i];
int j=i-g;
while(j>=0&&A[j]>v){
A[j+g]=A[j];
j-=g;
cnt++;
}
A[j+g]=v;
}
}
void shell(int A[],int n){
for(int h=1; ; ){
if(h>n){
break;
}
G.push_back(h);
h=3*h+1;
}
for(int i=G.size()-1;i>=0;i--){
insertsort(A,n,G[i]);
}
}
int main(){
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d",&A[i]);
}
cnt=0;
shell(A,n);
printf("%d\n",G.size());
for(int i=G.size()-1;i>=0;i--){
printf("%d",G[i]);
if(i){
printf(" ");
}
}
printf("\n%d\n",cnt);
for(int i=0;i<n;i++){
printf("%d\n",A[i]);
}
return 0;
}
|
#include <iostream>
#include <stdio.h>
#include <vector>
#include <utility>
#include <algorithm>
#include <cmath>
using namespace std;
typedef vector<int> vi;
template<typename T>
static inline void p(T x) { cout << x << endl; }
int main()
{
int n, cnt = 0;
cin >> n;
vi A(n), G;
for (int &x: A)
cin >> x;
for (int i = 1, x = 1; x <= n; x = (pow(3, ++i) - 1) / 2)
G.push_back(x);
reverse(G.begin(), G.end());
for (int g: G)
for (int i = g; i < n; i++) {
int v = A[i], j = i - g;
for(; j >= 0 && A[j] > v; j -= g)
A[j+g] = A[j], cnt++;
A[j+g] = v;
}
p(G.size());
for (int &x: G)
cout << (&x == &G[0] ? "" : " ") << x;
p("");
p(cnt);
for (int x: A)
printf("%d\n", x);
}
|
#include<bits/stdc++.h>
using namespace std;
vector<int>G;
long long cnt;
int a[1000005];
void InsertionSort(int a[],int n,int g){
for(int i=g;i<n;i++){
int v=a[i];
int j=i-g;
while(j>=0&&a[j]>v){
a[j+g]=a[j];
j=j-g;
cnt++;
}
a[j+g]=v;
}
}
void ShellSort(int a[],int n){
int cnt=0;
int m=2;
for(int h=1;;){
if(h>n)break;
G.push_back(h);
h=3*h+1;
}
for(int i=G.size()-1;i>=0;i--){
InsertionSort(a,n,G[i]);
}
}
int main(){
int n;
cin>>n;
cnt=0;
for(int i=0;i<n;i++)cin>>a[i];
ShellSort(a,n);
cout<<G.size()<<endl;
for(int i=G.size()-1;i>=0;i--){
cout<<G[i];
if(i)cout<<" ";
}
cout<<endl;
cout<<cnt<<endl;
for(int i=0;i<n;i++){
cout<<a[i]<<endl;
}
}
|
#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 m = 0;
int d = 1;
while (d <= n){
d = d * 3 + 1;
m++;
}
vector<int> g(m);
g[m - 1] = 1;
for (int i = m - 2; i >= 0; i--){
g[i] = g[i + 1] * 3 + 1;
}
cout << m << endl;
int cnt = 0;
for (int i = 0; i < m; i++){
cout << g[i];
if (i < m - 1){
cout << ' ';
}
for (int j = g[i]; j < n; j++){
int v = A[j];
int k = j - g[i];
while (k >= 0 && A[k] > v){
A[k + g[i]] = A[k];
k = k - g[i];
cnt++;
}
A[k + g[i]] = v;
}
}
cout << endl;
cout << cnt << endl;
for (int i = 0; i < n; i++){
cout << A[i] << endl;
}
}
|
#include <stdio.h>
void insertionSort(int *a, int n, int g, int *cnt);
int main(int argc, char const *argv[])
{
int n,i,a[1000001],cnt=0, m, g[101];
scanf("%d", &n);
for(i=0;i<n;i++)
scanf("%d", a+i);
g[0] = 1;
for(i=1;i<100; i++) {
g[i] = 3*g[i-1] +1;
if(n< g[i]) {
m = i;
break;
}
}
printf("%d\n", m);
for(i=m-1;i>0;i--)
printf("%d ", g[i]);
printf("%d\n", g[i]);
for(i=m-1;i>=0;i--)
insertionSort(a,n,g[i], &cnt);
printf("%d\n", cnt);
for(i=0;i<n;i++)
printf("%d\n", a[i]);
return 0;
}
void insertionSort(int *a, int n, int g, int *cnt)
{
int i,v,j;
for(i=g;i<n;i++) {
v = a[i];
j = i - g;
while(j>=0 && a[j] > v) {
a[j+g] = a[j];
j = j-g;
(*cnt)++;
}
a[j+g] = v;
}
} |
#include <cstdio>
using namespace std;
const int N = 1000000;
const int M = 100;
int cnt = 0;
void insertionsort(int a[], int n, int g) {
for (int i = g; i < n; i++) {
int v = a[i];
int j = i - g;
while (j >= 0 && a[j] > v) {
a[j + g] = a[j];
j -= g;
cnt++;
}
a[j + g] = v;
}
}
int main() {
int n, a[N];
scanf("%d", &n);
for (int i = 0; i < n; i++) scanf("%d", &a[i]);
int m, g[M];
g[0] = 1;
for (int i = 1; ; i++) {
g[i] = 3 * g[i - 1] + 1;
if (g[i] >= n || i >= 100) {
m = i;
break;
}
}
for (int i = m - 1; i >= 0; i--) {
insertionsort(a, n, g[i]);
}
printf("%d\n", m);
for (int i = m - 1; i >= 0; i--) printf("%d ", g[i]);
printf("\n%d\n", cnt);
for (int i = 0; i < n; i++) printf("%d\n", a[i]);
return 0;
} |
#include <iostream>
#include <vector>
using namespace std;
long long cnt=0;
vector<int> G;
void InsertionSort(int A[], int n, int g){
for(int i = g; i < n; i++){
int v = A[i];
int j = i - g;
while(j >= 0 && A[j] > v){
A[j+g] = A[j];
j -= g;
cnt++;
}
A[j+g] = v;
}
}
void ShellSort(int A[], int n){
for(int h = 1; h <= n; h=3*h+1){
G.push_back(h);
}
for(int i = G.size()-1; i >= 0; i--){
InsertionSort(A, n, G[i]);
}
}
int main(){
int n, A[1000000];
cin >> n;
for(int i = 0; i < n; i++){
cin >> A[i];
}
ShellSort(A, n);
cout << G.size() << endl;
for(int i = G.size()-1; i >= 0; i--){
cout << G[i];
if(i){ cout << " "; }
}
cout << endl << cnt << endl;
for(int i = 0; i < n; i++){
cout << A[i] << endl;
}
return 0;
}
|
#include <cstdio>
#include <vector>
#include <utility>
#include <algorithm>
#include <cmath>
using namespace std;
static inline void p(int x) { printf("%d\n", x); }
int main()
{
int n, cnt = 0;
scanf("%d", &n);
vector<int> A(n), G;
for (int &x: A)
scanf("%d", &x);
for (int i = 1, x = 1; x <= n; x = (pow(4, ++i) - 1) / 2)
G.push_back(x);
reverse(G.begin(), G.end());
for (int g: G)
for (auto i = A.begin() + g; i != A.end(); i++) {
int v = *i;
auto j = i - g;
for(; j >= A.begin() && *j > v; j -= g)
*(j + g) = *j, cnt++;
*(j + g) = v;
}
p(G.size());
for (int &x: G)
printf("%s%d", (&x == &G[0] ? "" : " "), x);
puts("");
p(cnt);
for (int x: A)
p(x);
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,cnt=0;
cin>> n;
vector<int> a(n);
vector<int> G(0);
int r=1;
while(r<=n){
G.push_back(r);
r*=2;
}
reverse(G.begin(),G.end());
int m=G.size();
for(int i=0;i<n;i++){
cin >> a[i];
}
for(int i=0;i<m;i++){
int g=G[i];
for(int j=g;j<n;j++){
int v=a[j];
int k=j-g;
while(k>=0&&a[k]>v){
a[k+g]=a[k];
k-=g;
cnt++;
}
a[k+g]=v;
}
}
cout<<m<<endl;
for(int i=0;i<m;i++){
cout<<G[i];
if(i!=m-1)cout<<' ';
}
cout << endl<< cnt<<endl;
for(int i=0;i<n;i++){
cout<<a[i]<<endl;
}
return 0;
}
|
#include <vector>
#include <iostream>
#include <cstdio>
using namespace std;
vector<int> G;
long long cnt = 0;
void insertionSort(int A[], int n, int g)
{
int i, j, v;
for (i = g; i < n; i++)
{
v = A[i];
j = i - g;
while (j >= 0 && A[j] > v)
{
A[j+g] = A[j];
j -= g;
cnt++;
}
A[j+g] = v;
}
}
void shellSort(int A[], int n)
{
for (int g = 1; g <= n; g = g*3+1)
G.push_back(g);
for (int i = G.size() - 1; i >= 0; i--)
insertionSort(A, n, G[i]);
}
int main()
{
int n;
scanf("%d", &n);
int A[n];
for (int i = 0; i < n; i++)
scanf("%d", &A[i]);
shellSort(A, n);
printf("%d\n", G.size());
for (int i = G.size() - 1; i >= 0; i--)
{
printf("%d", G[i]);
if (i > 0)
printf(" ");
}
printf("\n");
printf("%d\n", cnt);
for (int i = 0; i < n; i++)
printf("%d\n", A[i]);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int cnt;
void insertionSort(int *A,int n,int g){
for(int i=g;i<n;i++){
int v=A[i];
int j=i-g;
while(j>=0&&A[j]>v){
A[j+g]=A[j];
j=j-g;
cnt++;
}
A[j+g]=v;
}
}
void shellSort(int A[],int n){
cnt=0;
int r=1;
vector<int> G;
while(r<=n){
G.push_back(r);
r=2*r+1;
}
int m=G.size();
reverse(G.begin(),G.end());
cout<<m<<endl;
for(int i=0;i<m;i++) cout<<G[i]<<" \n"[i==m-1];
for(int i=0;i<m;i++) insertionSort(A,n,G[i]);
cout<<cnt<<endl;
}
signed main(){
int n;
cin>>n;
int A[n];
for(int i=0;i<n;i++) cin>>A[i];
shellSort(A,n);
for(int k=0;k<n;k++) cout<<A[k]<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int A[1000000];
vector<int> G;
long long cnt;
void insertionSort(int n,int g)
{
for(int i=g;i<n;i++)
{
int v=A[i];
int j = i-g;
while(j>=0 && A[j]>v)
{
A[j+g] = A[j];
j -= g;
cnt++;
}
A[j+g] = v;
}
}
void ShellSort(int n)
{
int h=1;
while(h<=n)
{
G.push_back(h);
h = 3*h + 1;
}
for(int i=G.size()-1;i>=0;i--)
{
insertionSort(n,G[i]);
}
}
int main()
{
int n;
cin >> n;
for(int i=0;i<n;i++) cin >> A[i];
cnt = 0;
ShellSort(n);
printf("%d\n",G.size());
for(int i=G.size()-1;i>=0;i--)
{
printf("%d",G[i]);
if(i) printf(" ");
}
printf("\n");
printf("%d\n",cnt);
for(int i=0;i<n;i++)
{
printf("%d\n",A[i]);
}
}
|
#include <bits/stdc++.h>
using namespace std;
void insertionSort(vector<int>& A, int N, int G, int& cnt) {
for (int i = G; i < N; i++) {
int v = A[i];
int j = i - G;
while (j >= 0 && A[j] > v) {
A[j+G] = A[j];
j -= G;
cnt++;
}
A[j+G] = v;
}
}
void shellSort(vector<int>& A, int N) {
int cnt = 0;
vector<int> G;
int h = 1;
while (h <= N) {
G.push_back(h);
h = h * 3 + 1;
}
cout << G.size() << endl;
for (int i = G.size() - 1; i >= 0; i--) {
insertionSort(A, N, G[i], cnt);
cout << G[i];
if (i) cout << ' ';
}
cout << endl << cnt << endl;
}
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
shellSort(A, N);
for (int i = 0; i < N; i++) {
cout << A[i] << endl;
}
}
|
#include <iostream>
#include <string>
#include <cmath>
#include<iomanip>
#include<algorithm>
#include<list>
using namespace std;
int A[1000001];
int cnt;
int G[101];
void insertionSort(int n, int g){
for (int i = g; i < n; i++){
int v = A[i];
int j = i - g;
while (j >=0 && A[j] > v){
A[j + g] = A[j];
j = j - g;
cnt++;
}
A[j + g] = v;
}
}
int main()
{
int n;
cin >> n;
for (int i = 0; i < n; i++){
cin >> A[i];
}
cnt = 0;
G[0] = 1;
int m = 0;
while(true){
G[m + 1] = G[m] * 3 + 1;
m++;
if (G[m] > n){
break;
}
}
for (int i = m - 1; i >= 0; i--){
insertionSort(n, G[i]);
}
cout << m << endl;
for (int i = m - 1; i > 0; i--){
cout << G[i] << " ";
}
cout << G[0] << endl;
cout << cnt << endl;
for (int i = 0; i < n; i++){
cout << A[i] << endl;
}
return 0;
} |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
long long cnt;
int l;
int A[10000000];
int n;
vector<int> G;
void insert(int A[],int n,int g){
int i,j,v;
for(i=g;i<n;i++){
v=A[i];
j=i-g;
while(j>=0 && A[j]>v){
A[j+g]=A[j];
j=j-g;
cnt++;
}
A[j+g]=v;
}
}
void shellsort(int A[],int n){
int i,j;
for(i=1;;){
if(i>n)break;
G.push_back(i);
i=3*i+1;
}
for(j=G.size()-1;j>=0;j--){
insert(A,n,G[j]);
}
}
int main(){
int i,j;
cin >> n;
for(i=0;i<n;i++){
cin >> A[i];
}
cnt=0;
shellsort(A,n);
cout<<G.size()<<endl;
for(i=G.size()-1;i>=0;i--){
cout << G[i];
if(i){
cout << " ";
}
}
cout << endl;
cout << cnt<<endl;
for(i=0;i<n;i++){
cout << A[i]<< endl;
}
} |
#include <iostream>
#include<vector>
using namespace std;
long long cnt;
int A[1000000];
int n;
vector<int> G;
void insertionSort(int A[],int n,int g){
for(int i=g;i<n;i++){
int v=A[i];
int j=i-g;
while(j>=0 && A[j]>v){
A[j+g]=A[j];
j-=g;
cnt++;
}
A[j+g]=v;
}
}
void shell(int A[],int n){
for(int i=1;i<=n;i=3*i+1){
G.push_back(i);
}
for(int i=G.size()-1;i>=0;i--){
insertionSort(A,n,G[i]);
}
}
int main(){
int n;
cin>>n;
for(int i=0;i<n;i++)
cin>>A[i];
cnt=0;
shell(A,n);
cout<<G.size()<<endl;
for(int i=G.size()-1;i>=0;i--){
cout<<G[i];
if(i)cout<<" ";
}
cout<<endl;
cout<<cnt<<endl;
for(int i=0;i<n;i++){
cout<<A[i]<<endl;
}
return 0;
}
|
#include <iostream>
#include <cmath>
int sortInsertionG(int *a,size_t n,int g){
/*gはインターバル*/
int i,j,temp,cnt=0;
for (i=g;i<n;i++){
temp=a[i];
j=i-g;
while (j>=0&&a[j]>temp){
a[j+g]=a[j];
j-=g;
cnt++;
}
a[j+g]=temp;
}
return cnt;
}
int main(){
int i,cnt=0,n;
std::cin>>n;
int m=std::log(2*n+1.0)/std::log(3.0);
int a[n],g[m];
for (i=0;i<n;i++)std::cin>>a[i];
std::cout << m << '\n';
for (i = 0; i < m; i++)g[i]=(std::pow(3,m-i)-1)/2;
for (i=0;i<m;i++){
if (i)std::cout<<' ';
std::cout<<g[i];
}
std::cout << '\n';
for (i = 0; i < m; i++) {
cnt+=sortInsertionG(a,n,g[i]);
}
std::cout << cnt << '\n';
for (i = 0; i < n; i++)std::cout << a[i] << '\n';
}
|
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
int cnt;
vector<int> G;
void insertionSort(vector<int> &A, int n, int g)
{
for (int i = g; i < n; i++)
{
int v = A[i];
int j = i - g;
while (j >= 0 && A[j] > v)
{
A[j + g] = A[j];
j -= g;
cnt++;
}
A[j + g] = v;
}
}
void shellsort(vector<int> &A, int n)
{
for (int h = 1; h <= n; h = 3 * h + 1)
{
G.push_back(h);
}
for (int i = G.size() - 1; i >= 0; --i)
{
insertionSort(A, n, G[i]);
}
}
int main()
{
int n;
scanf("%d", &n);
vector<int> v(n);
for (int i = 0; i < n; i++)
{
scanf("%d", &v[i]);
}
shellsort(v, n);
printf("%d\n", G.size());
for (int i = G.size() - 1; i >= 0; --i)
printf("%d ", G[i]);
printf("%d\n", cnt);
for (int i = 0; i < n; ++i)
printf("%d\n", v[i]);
return 0;
} |
#include<iostream>
#include<cstdio>
#include<math.h>
using namespace std;
class Sort {
public:
int n, cnt = 0;
int A[1000000];
void Insertion(int g) {
for (int i = g; i < n; i++) {
int v = A[i];
int j = i - g;
while (j >= 0 && A[j] > v) {
A[j + g] = A[j];
j = j - g;
cnt++;
}
A[j + g] = v;
}
}
};
int main() {
Sort S;
int a = 1, b = 0, m = 0;
cin >> S.n;
for (int i = 0; i < S.n; i++) cin >> S.A[i];
while (a <= S.n) {a = a * 3 + 1; m++;}
int G[m];
for (int i = m - 1; i >= 0; i--) {G[i] = 3 * b + 1; b = G[i];}
for (int i = 0; i < m; i++) S.Insertion(G[i]);
cout << m << endl;
for (int a = 0; a < m; a++) {
if (a > 0) cout << " ";
cout << G[a];
}
cout << endl << S.cnt << endl;
for (int b = 0; b < S.n; b++) cout << S.A[b] << endl;
return 0;
}
|
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<vector>
using namespace std;
long long cnt;
int l,A[1000000],n;
vector<int>G;
void InsertionSort(int A[],int n,int g){
for(int i=g;i<n;i++){
int v=A[i];
int j=i-g;
while(j>=0&&A[j]>v){
A[j+g]=A[j];
j-=g;
cnt++;
}
A[j+g]=v;
}
}
void ShellSort(int A[],int n){
for(int h=1; ; ){
if(h>n)break;
G.push_back(h);
h=3*h+1;
}
for(int i=G.size()-1;i>=0;i--){
InsertionSort(A,n,G[i]);
}
}
int main(){
cin>>n;
for(int i=0;i<n;i++)scanf("%d",&A[i]);
cnt=0;
ShellSort(A,n);
cout<<G.size()<<endl;
for(int i=G.size()-1;i>=0;i--){
printf("%d",G[i]);
if(i)printf(" ");
}
printf("\n");
printf("%d\n",cnt);
for(int i=0;i<n;i++)printf("%d\n",A[i]);
return 0;
}
|
#include <iostream>
using namespace std;
long long cnt=0;
void insertionSort(int a[],int n,int g){
for(int i=g;i<n;i++){
int v=a[i], j=i-g;
while(j>=0 && a[j]>v){
a[j+g]=a[j];
j-=g;
cnt++;
}
a[j+g]=v;
}
}
int genG(int g[],int maxv,int GM){
g[0]=1;
int i=1;
while(true){
if(g[i-1]>maxv || !(i<GM)){
return i-1;
}
g[i]=g[i-1]*3+1;
i++;
}
}
void shellSort(int a[],int n){
cnt=0;
const int GM=100;
int g[GM];
const int m=genG(g,n,GM);
cout<<m<<endl;
for(int i=m-1;i>=0;i--){
cout<<g[i]<<' '<<flush;
insertionSort(a,n,g[i]);
}
cout<<endl;
}
int main(){
int n;
cin>>n;
int *a=new int[n];
if(a==NULL)return 1;
for(int i=0;i<n;i++){
cin>>a[i];
}
shellSort(a,n);
cout<<cnt<<endl;
for(int i=0;i<n;i++){
cout<<a[i]<<endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int cnt;
void insertionSort(int *A,int n,int g){
for(int i=g;i<n;i++){
int v=A[i];
int j=i-g;
while(j>=0&&A[j]>v){
A[j+g]=A[j];
j-=g;
cnt++;
}
A[j+g]=v;
}
}
void shellSort(int *A,int n){
cnt=0;
int r=1;
vector<int> G;
//set up the step size
while(r<=n){
G.push_back(r);
r*=2;
}
int m=G.size();
reverse(G.begin(),G.end());//step size from big to small
cout<<m<<endl;
for(int i=0;i<m;i++) cout<<G[i]<<" \n"[i==m-1];
for(int i=0;i<m;i++) insertionSort(A,n,G[i]);
cout<<cnt<<endl;
}
signed main(){
int n;
cin>>n;
int A[n];
for(int i=0;i<n;i++) cin>>A[i];
shellSort(A,n);
for(int k=0;k<n;k++) cout<<A[k]<<endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
#include <cmath>
using namespace std;
typedef vector<int> vi;
template<typename T>
static inline void p(T x) { cout << x << endl; }
int main()
{
cin.sync_with_stdio(false);
int n, cnt = 0;
cin >> n;
vi A(n), G;
for (int &x: A)
cin >> x;
for (int i = 1, x = 1; x <= n; x = (pow(3, ++i) - 1) / 2)
G.push_back(x);
reverse(G.begin(), G.end());
for (int g: G)
for (int i = g; i < n; i++) {
int v = A[i], j = i - g;
for(; j >= 0 && A[j] > v; j -= g)
A[j+g] = A[j], cnt++;
A[j+g] = v;
}
p(G.size());
for (int &x: G)
cout << (&x == &G[0] ? "" : " ") << x;
p("");
p(cnt);
for (int x: A)
p(x);
}
|
#include <bits/stdc++.h>
using namespace std;
int n,sw=0;
vector<int> g;
int A[1000010];
void makeg(void){
int i=0;
for(int h=1;;){
if(h>n){
break;
}
g.push_back(h);
h=3*h+1;
}
}
void insertsort(int g){
for(int i=g;i<n;i++){
int v=A[i];
int j=i-g;
while(j>=0&&A[j]>v){
A[j+g]=A[j];
j-=g;
sw++;
}
A[j+g]=v;
}
}
void shell(){
for(int i=g.size()-1;i>=0;i--){
insertsort(g[i]);
}
}
int main(){
cin>>n;
for(int i=0;i<n;i++){
cin >> A[i];
}
makeg();
shell();
cout <<g.size()<<endl;
for(int i=g.size()-1;i>=0;i--){
if(i!=g.size()-1){cout << " ";}
cout << g[i];
}
cout << endl<<sw<<endl;
for(int i=0;i<n;i++){
cout << A[i]<<endl;
}
}
|
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
void insert_sort(vector<int> & v,int n, int g, int &cnt){
int value,j;
for(int i = g;i<n;i++){
value = v[i];
j = i-g;
while(j>=0 && v[j]>value){
v[j+g] = v[j];
j = j-g;
cnt++;
}
v[j+g] = value;
}
}
int main(){
int cnt = 0;
int N, temp, m;
cin>>N;
vector<int> rt;
while(cin>>temp){
rt.push_back(temp);
}
m = N <= 4 ? 1 : log((N-1))/log(4) + 1;
cout<<m<<endl;
for(int i = m-1;i>=0;i--){
temp = pow(4,i);
insert_sort(rt,N,temp,cnt);
cout<<temp;
if(i!=0)
cout<<" ";
}
cout<<endl;
cout<<cnt<<endl;
for(int i : rt){
cout<<i<<endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
int a[1000000];
int n,cnt;
vector<int> G;
void insertionsort(int *a,int g){
for(int i = g; i < n; i++){
int v = a[i];
int j = i-g;
while(j >= 0 && a[j] > v){
a[j+g] = a[j];
j -= g;
cnt++;
}
a[j+g] = v;
}
}
void shellsort(int *a){
for(int h = 1; ; ){
if(h > n) break;
G.push_back(h);
h = 3*h + 1;
}
for(int i = G.size()-1; i >= 0; i--){
insertionsort(a,G[i]);
}
}
signed main(){
cin >> n;
for(int i = 0; i < n; i++) cin >> a[i];
shellsort(a);
cout << G.size() << endl;
for(int i = G.size()-1; i >= 0; i--){
cout << G[i];
if(i) cout << " ";
}
cout << endl << cnt << endl;
for(int i = 0; i < n; i++){
cout << a[i] << endl;
}
return 0;
}
|
#include<iostream>
using namespace std;
int x[10000000];
int G[20];
int v;
int w;
int cnt=0;
int m;
int n;
void sort1(int x[],int n,int g){
for(int i=g;i<n;i++){
v=x[i];
w=i-g;
while(w>=0 && x[w]>v){
x[w+g]=x[w];
w=w-g;
cnt++;
}
x[w+g]=v;
}
}
void sort2(int x[],int n){
cnt=0;
for(int h=0;h<20;h++){
if(G[h]>n){
m=h;
break;
}
}
cout<<m<<endl;
for(int h=m-1;h>=0;h--){
cout<<G[h];
if(h){
cout<<' ';
}
sort1(x,n,G[h]);
}
cout<<endl;
}
int main(){
G[0]=1;
for(int i=1;i<20;i++){
G[i]=G[i-1]*3+1;
}
cin>>n;
for(int i=0;i<n;i++){
cin>>x[i];
}
sort2(x,n);
cout<<cnt<<endl;
for(int i=0;i<n;i++){
cout<<x[i]<<endl;
}
return 0;
} |
#include "iostream"
using namespace std;
void sonyu( int num, int g, int* cnt, int a[1000000] ) {
for (int i = 1; i < num; i++) {
int v = a[i];
int j = i - g;
while (j >= 0 && a[j] > v) {
a[j + g] = a[j];
j-=g;
*cnt+=1;
}
a[j + g] = v;
}
}
int main() {
int a[1000000];
int cnum;
int num;
int cnt = 0;
cin >> num;
for (int i = 0; i < num; i++) {
cin >> a[i];
}
int kaisu = 1;
int v[100];
v[0] = 1;
for (int i = 1; ; i++) {
v[i] = v[i-1] * 3 + 1;
if (v[i] > num) break;
kaisu++;
}
cout << kaisu << endl;
for (int i = kaisu - 1; i >= 0; i--) {
sonyu(num, v[i], &cnt, a);
cout << v[i];
if (i != 0) cout << " ";
}
cout << endl;
cout << cnt << endl;
for (int j = 0; j < num; j++) {
cout << a[j] << endl;
}
int p = 0;
return 0;
} |
#include <iostream>
#include <vector>
using namespace std;
void solve(){
int n; cin >> n;
vector<int> a(n), g;
for(int i = 0; i < n; i++){
cin >> a[i];
}
g.push_back(1);
while(g[g.size() - 1] < n){
g.push_back(g[g.size() - 1] * 3 + 1);
}
if(g.size() > 1) g.pop_back();
int m = g.size();
long long cnt = 0;
for(int i = m - 1; i >= 0; i--){
int x = g[i];
for(int i = x; i < n; i++){
int y = a[i];
int j;
for(j = i - x; j >= 0 && a[j] > y; j -= x){
a[j + x] = a[j];
cnt++;
}
a[j + x] = y;
}
}
cout << m << endl;
for(int i = m - 1; i >= 1; i--) cout << g[i] << " "; cout << g[0] << endl;
cout << cnt << endl;
for(int i = 0; i < n; i++) cout << a[i] << endl;
return;
}
int main(){
solve();
return 0;
}
|
//By Vlgd
#include<bits/stdc++.h>
using namespace std;
int A[1000000],n,cnt=0;
int G[100];
void shell(int n){
int ij=0;
for (int h=1;h<=n;h=3*h+1) G[ij++]=h;
printf("%d\n",ij--);
for (int i=ij;i>=0;i--){
printf("%d",G[i]);
if (i==0) printf("\n");
else printf(" ");
}
for (int D=G[ij];D>=1;D=G[ij--]){
for (int i=D;i<n;i++){
int v=A[i],j=i-D;
while(j>=0&&A[j]>v){
A[j+D]=A[j];
j-=D;
cnt++;
}
A[j+D]=v;
}
}
printf("%d\n",cnt);
for (int i=0;i<n;i++) printf("%d\n",A[i]);
}
int main(){
scanf("%d",&n);
for (int i=0;i<n;i++) scanf("%d",&A[i]);
shell(n);
}
|
#include<iostream>
#include<cstdio>
using namespace std;
int x[10000000];
int G[20];
int v;
int w;
int cnt=0;
int m;
int n;
void sort1(int x[],int n,int g){
for(int i=g;i<n;i++){
v=x[i];
w=i-g;
while(w>=0 && x[w]>v){
x[w+g]=x[w];
w=w-g;
cnt++;
}
x[w+g]=v;
}
}
void sort2(int x[],int n){
cnt=0;
for(int h=0;h<20;h++){
if(G[h]>n){
m=h;
break;
}
}
cout<<m<<endl;
for(int h=m-1;h>=0;h--){
cout<<G[h];
if(h){
cout<<' ';
}
sort1(x,n,G[h]);
}
cout<<endl;
}
int main(){
G[0]=1;
for(int i=1;i<20;i++){
G[i]=G[i-1]*3+1;
}
cin>>n;
for(int i=0;i<n;i++){
scanf("%d",&x[i]);
}
sort2(x,n);
cout<<cnt<<endl;
for(int i=0;i<n;i++){
printf("%d\n",x[i]);
}
return 0;
} |
#include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
int cnt, m;
int G[100]={1};
void insertionSort(int *A, int n, int g){
for(int i=g;i<n;i++){
int v=A[i];
int j=i-g;
while(j>=0&&A[j]>v){
A[j+g]=A[j];
j-=g;
cnt++;
}
A[j+g]=v;
}
}
void shellSort(int *A, int n){
cnt=0;
for(int i=1;i<100;i++){
G[i]=3*G[i-1]+1;
if(G[i]>n){
m=i;
break;
}
}
for(int i=0;i<m;i++){
insertionSort(A, n, G[m-i-1]);
}
}
int main(){
int n, a[1000000];
scanf("%d", &n);
for(int i=0;i<n;i++) scanf("%d", &a[i]);
shellSort(a, n);
printf("%d\n", m);
for(int i=0;i<m;i++){
printf("%s", (i?" ":""));
printf("%d", G[m-i-1]);
}
printf("\n");
printf("%d\n", cnt);
for(int i=0;i<n;i++) printf("%d\n", a[i]);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int cnt;
void insertionSort(int *A,int n,int g){
for(int i=g;i<n;i++){
int v=A[i];
int j=i-g;
while(j>=0&&A[j]>v){
A[j+g]=A[j];
j-=g;
cnt++;
}
A[j+g]=v;
}
}
void shellSort(int *A,int n){
cnt=0;
int r=1;
vector<int> G;
while(r<=n){
G.push_back(r);
r*=2;
}
int m=G.size();
reverse(G.begin(),G.end());
cout<<m<<endl;
for(int i=0;i<m;i++) cout<<G[i]<<" \n"[i==m-1];
for(int i=0;i<m;i++) insertionSort(A,n,G[i]);
cout<<cnt<<endl;
}
signed main(){
int n;
cin>>n;
int A[n];
for(int i=0;i<n;i++) cin>>A[i];
shellSort(A,n);
for(int k=0;k<n;k++) cout<<A[k]<<endl;
return 0;
} |
#include<iostream>
using namespace std;
int main(){
int n,a[1000000],cnt=0,m=0,g[1000000];
cin>>n;
for(int i=0;i<n;i++)cin>>a[i];
for(int i=1;i<=n;i=3*i+1)g[m]=i,m++;
for(int i=m-1;i>=0;i--){
for(int j=g[i];j<n;j++){
int v=a[j],k=j-g[i];
while(k>=0&&a[k]>v){
a[k+g[i]]=a[k];
k=k-g[i];
cnt++;
}
a[k+g[i]]=v;
}
}
cout<<m<<endl;
for(int i=m-1;i>=0;i--){
cout<<g[i];
i==0?cout<<endl:cout<<" ";
}
cout<<cnt<<endl;
for(int i=0;i<n;i++)cout<<a[i]<<endl;
return 0;
} |
#include <iostream>
#include <cstdio>
using namespace std;
int S[1000000], cnt = 0;
int sor(int n, int g){
do{
g = (g - 1) / 3;
for(int i = g;i < n;i++){
int j = i - g, v = S[i];
while(j >= 0 && v < S[j]){
S[j + g] = S[j];
j -= g, cnt++;
}
S[j + g] = v;
}
}while(g != 1);
return 0;
}
int main(){
int g = 1, n, num = 0;
scanf("%d", &n);
for(int i= 0;i < n;i++)scanf("%d", &S[i]);
while(g <= n)g = g * 3 + 1, num++;
printf("%d\n", num);
for(int i= g;i != 1;){
if(i != g)printf(" ");
i = (i - 1) / 3;
printf("%d", i);
}
puts("");sor(n, g);
printf("%d\n", cnt);
for(int i= 0;i < n;i++)printf("%d\n", S[i]);
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int cnt = 0;
int shell(int A[],int n,int g){
int v,j;
for(int i = g;i<n;i++){
v = A[i];
j = i-g;
while(j>= 0 && A[j] >v ){
A[j+g] = A[j];
j = j-g;
cnt++;
A[j+g] = v;
}
}
return 0;
}
int main(){
int n,m = 0;
cin>>n;
int A[n];
int g[13] = {1,4,13,40,121,364,1093,3280,9841,29524,88573,265720,797161};
for(int i = 12;i>=0;i--){
if(n/g[i] >=1){
m = i;
break;
}
}
for(int i = 0;i<n;i++){
cin>>A[i];
}
for(int i = 0;i<=m;i++){
shell(A,n,g[m-i]);
}
cout<<m+1<<endl;
for(int i = m;i>0;i--){
cout<<g[i]<<" ";
}
cout<<g[0]<<endl;
cout<<cnt<<endl;
for(int i = 0;i<n;i++){
cout<<A[i]<<endl;
}
return 0;
}
|
#include<stdio.h>
int cnt;
void InsertionSort(int* a, int n, int g){
int i,j,key;
for(i=1;i<n;i++){
key=a[i];
j=i-g;
while(j>=0 && a[j]>key){
a[j+g]=a[j];
j-=g;
cnt++;
}
a[j+g]=key;
}
}
void ShellSort(int* a, int n){
int i; int m=1;
int G[100];
G[1]=n;
while(1){
++m;
G[m]=G[m-1]/3;
//printf("G[%d]=%d\n",m,G[m]);
if(G[m]<=1){
//printf("ERROR: G[%d]=%d\n",m,G[m]);
G[m]=1;
break;
}
}
printf("%d\n",m);
for(i=1;i<=m;i++){
if(i>1)printf(" ");
printf("%d",G[i]);
}printf("\n");
cnt=0;
for(i=1;i<=m;i++){
if(G[i]<=n)InsertionSort(a,n,G[i]);
}
printf("%d\n",cnt);
}
int main(){
int i,n; scanf("%d",&n);
int array[1000000];
for(i=0;i<n;i++)scanf("%d",&array[i]);
ShellSort(array, n);
for(i=0;i<n;i++){
printf("%d\n",array[i]);
}
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
long long cnt;
int l;
int A[1000000];
int n;
vector<int> G;
void insertionSort(int A[],int n,int g){
for (int i = g; i < n; ++i) {
int v=A[i];
int j=i-g;
while(j>=0&&A[j]>v){
A[j+g]=A[j];
j-=g;
cnt++;
}
A[j+g]=v;
}
}
void shellSort(int A[],int n){
for (int h=1; ; ) {
if(h>n)break;
G.push_back(h);
h=3*h+1;
}
for (int i = G.size()-1; i >= 0; i--) {
insertionSort(A,n,G[i]);
}
}
int main() {
cin>>n;
for (int i = 0; i < n; ++i) {scanf("%d",&A[i]);}
cnt=0;
shellSort(A,n);
cout<<G.size()<<endl;
for (int i = G.size()-1; i >=0; i--) {
printf("%d",G[i]);
if(i)printf(" ");
}
printf("\n");
printf("%d\n",cnt);
for (int i = 0; i < n; ++i) {printf("%d\n",A[i]);}
return 0;
} |
#include <iostream>
#include <vector>
#define MAX_N 1000000
using namespace std;
int cnt;
void print(int A[], int n) {
for (int i = 0; i < n; i ++) {
cout << A[i] << endl;
}
}
void insertion_sort(int A[], int n, int g) {
for (int i = g; i < n; i ++) {
int v = A[i];
int j = i - g;
while (j >= 0 && v < A[j]) {
A[j + g] = A[j];
j -= g;
cnt ++;
}
A[j + g] = v;
}
}
void shell_sort(int A[], int n) {
cnt = 0;
vector<int> G;
int h = 1;
while (h <= n) {
G.push_back(h);
h = 3 * h + 1;
}
cout << G.size() << endl;
for (int i = G.size() - 1; i >= 0; i -- ) {
cout << G[i] << " ";
insertion_sort(A, n, G[i]);
}
cout << endl;
cout << cnt << endl;
}
int main() {
int n, A[MAX_N];
cin >> n;
for (int i = 0; i < n; i ++) cin >> A[i];
shell_sort(A, n);
print(A, n);
return 0;
}
|
#include <iostream>
#include <vector>
using namespace std;
void insertionSort(vector<int> &a, int g, int &c) {
for(int i=g;i<a.size();i++){
int v=a[i],j=i-g;
while(j>=0&&a[j]>v){
a[j+g]=a[j];
j=j-g;
c++;
}
a[j+g]=v;
}
}
void shellSort(vector<int> &a, vector<int> &g, int &c) {
int h=1;
for(;h*3+1<a.size();)h=h*3+1;
for(;h>0;h=(h-1)/3){
g.push_back(h);
insertionSort(a,h,c);
}
}
int main() {
int i,m,n,c=0;
cin>>n;
vector<int> a(n),g;
for(i=0;i<n;i++) cin>>a[i];
shellSort(a,g,c);
m=g.size();
cout<<m<<endl;
for(i=0;i<m-1;i++) cout<<g[i]<<" ";
cout<<g[m-1]<<endl;
cout<<c<<endl;
for(i=0;i<n;i++) cout<<a[i]<<endl;
return 0;
}
|
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<vector>
using namespace std;
long long cnt;
int l;
int B[1000000];
int m;
vector<int> G;
void insertionSort(int B[], int m, int g)
{
int i=0;
for(i=g ; i<m ; i++)
{
int v =B[i];
int j= i-g;
while(j>=0 && B[j]>v)
{
B[j+g]=B[j];
j-=g;
cnt++;
}
B[j+g]=v;
}
}
void shellSort(int B[], int m)
{
int i=0;
int h=0;
for (h=1; ; )
{
if(h>m)break;
G.push_back(h);
h=3*h+1;
}
for(i=G.size()-1;i>=0;i--)
{
insertionSort(B,m,G[i]);
}
}
int main()
{
int i=0;
cin>> m;
for(i=0;i<m; i++)
{
scanf("%d",&B[i]);
}
cnt = 0;
shellSort(B,m);
cout << G.size() << endl;
for(i = G.size()-1;i>=0;i--)
{
printf("%d",G[i]);
if(i)printf(" ");
}
printf("\n");
printf("%d\n",cnt);
for(i=0;i<m; i++)
{
printf("%d\n",B[i]);
}
return 0;
}
|
#include<iostream>
using namespace std;
int inSort(int A[],int n,int g){
int i,j,v;
int cnt=0;
for(i=g;i<n;i++){
v=A[i];
j=i-g;
while(j>=0 && A[j]>v){
A[j+g]=A[j];
j-=g;
++cnt;
}
A[j+g]=v;
}
return cnt;
}
void shSort(int A[],int n){
int i,j,k,l,G[20];
int m=0; for(i=1;i<=n;i=i*3+1) G[m++]=i;
int c=0; for(i=m-1;0<=i;i--) c+=inSort(A,n,G[i]);
cout<<m<<endl;
cout<<G[m-1]; for(i=m-2;0<=i;i--) cout<<' '<<G[i]; cout<<endl;
cout<<c<<endl;
for(i=0;i<n;i++) cout<<A[i]<<endl;
}
int main(){
int i,n,A[1000000];
cin>>n;
for(i=0;i<n;i++) cin>>A[i];
shSort(A,n);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
#define pb emplace_back
typedef long long ll;
typedef pair<int,int> pint;
int a[1000001];
vector<int> v;
int cnt;
void insertsort(int n,int g){
FOR(i,g,n){
int ai=a[i];
int j=i-g;
while(j>=0&&a[j]>ai){
a[j+g]=a[j];
j=j-g;
++cnt;
}
a[j+g]=ai;
}
}
int main(){
int n;
cin>>n;
rep(i,n) cin>>a[i];
int p=1;
while(p<=n){
v.pb(p);
p*=2;
}
cnt=0;
reverse(v.begin(),v.end());
for(auto it:v) insertsort(n,it);
cout<<v.size()<<endl;
rep(i,v.size()) cout<<v[i]<<(i==v.size()?"":" ");
cout<<endl;
cout<<cnt<<endl;
rep(i,n) cout<<a[i]<<endl;
return 0;
}
|
#include <iostream>
using namespace std;
int cnt=0;
void insertionSort(int a[],int n,int g){
for(int i=g;i<=n-1;i++){
int v=a[i];
int j=i-g;
while(j>=0&&a[j]>v){
a[j+g]=a[j];
j=j-g;
cnt++;
}
a[j+g]=v;
}
}
void reverse(int a[],int n){
for(int i=0;i<n/2;i++){
int t=a[i];
a[i]=a[n-i-1];
a[n-i-1]=t;
}
}
int main(){
int n;
cin >> n;
int a[n];
for(int i=0;i<n;i++)
cin >> a[i];
int g[1000];
g[0]=1;
int i=0;
while(g[i]<=n){
g[i+1]=3*g[i]+1;
i++;
}
int m=i;
reverse(g,m);
for(int i=0;i<m;i++)
insertionSort(a,n,g[i]);
cout << m << '\n';
for(int i=0;i<m;i++){
if(i) cout << " " << g[i];
else cout << g[i];
}
cout << '\n';
cout << cnt <<'\n';
for(int i=0;i<n;i++)
cout << a[i] << '\n';
} |
#include<bits/stdc++.h>
using namespace std;
int counts=0;
void print(int a[],int n){
for(int i=0;i<n;i++){
cout<<a[i]<<endl;
}
}
void insertionSort(int a[],int n,int g){ //小さい順に並べる
int i,j;
for(i=g;i<n;i++){
int v=a[i];
j=i-g;
while(j>=0&&a[j]>v){
a[j+g]=a[j];
j-=g;
counts++;
}
a[j+g]=v;
}
}
void shellSort(int a[],int n){
int m=0,G[101],i;
G[0]=0;
while(1){
if(G[m]*3+1>n)break;
G[m+1]=G[m]*3+1;
m++;
}
cout<<m<<endl;
for(i=m;i>0;i--){
if(i<m)cout<<" "<<G[i];
else cout<<G[i];
insertionSort(a,n,G[i]);
}
cout<<endl<<counts<<endl;
print(a,n);
}
int main(){
int i,j,v,n,a[1000001];
cin>>n;
for(i=0;i<n;i++){
cin>>a[i];
}
shellSort(a,n);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int n, a[1100000], c, g[20],r,i,j;
int main()
{
cin >> n;
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
g[0] = 1;
c = 0;
while (true)
{
g[c + 1] = g[c] * 3 + 1;
if (g[++c] >= n)
break;
}
r = 0;
for (i = c - 1; i >= 0; i--)
{
for (j = g[i]; j < n; j++)
{
int v = a[j], w = j - g[i];
while (w >= 0 && a[w] > v)
{
a[w + g[i]] = a[w];
w -= g[i];
r++;
}
a[w + g[i]] = v;
}
}
cout << c << endl;
for (int i = c - 1; i >= 0; i--)
printf(i ? "%d " : "%d\n", g[i]);
cout << r << endl;
for (int i = 0; i < n; i++)
printf("%d\n", a[i]);
}
|
#include<iostream>
using namespace std;
int cnt;
void insertionSort(int A[], int n, int g){
int j, v;
for ( int i = g; i < n; i++ ){
v = A[i];
j = i - g;
while ( j >= 0 && A[j] > v ){
A[j+g] = A[j];
j = j - g;
cnt++;
}
A[j+g] = v;
}
}
void shellSort(int A[], int n){
cnt = 0;
int m = 0, G[100], j=0;
G[0] = 1;
while (1){
m++;
G[m] = 3*G[m-1]+1;
if ( G[m] > n ) break;
}
for ( int i = m-1; i >= 0; i-- ) insertionSort(A, n, G[i]);
cout << m << '\n';
for ( int i = m-1; i >= 0; i-- ){
cout << G[i];
if ( i > 0 ) cout << " ";
}
cout << endl;
}
int main(){
int n, A[1000000];
cin >> n;
for ( int i = 0; i < n; i++ ) cin >> A[i];
shellSort(A, n);
cout << cnt << endl;
for ( int i = 0; i < n; i++ ) cout << A[i] << endl;
return 0;
}
|
#include <cstdio>
#include <vector>
#include <utility>
#include <algorithm>
#include <cmath>
using namespace std;
typedef vector<int> vi;
static inline void p(int x) { printf("%d\n", x); }
int main()
{
int n, cnt = 0;
scanf("%d", &n);
vi A(n), G;
for (int &x: A)
scanf("%d", &x);
for (int i = 1, x = 1; x <= n; x = (pow(3, ++i) - 1) / 2)
G.push_back(x);
reverse(G.begin(), G.end());
for (int g: G)
for (int i = g; i < n; i++) {
int v = A[i], j = i - g;
for(; j >= 0 && A[j] > v; j -= g)
A[j+g] = A[j], cnt++;
A[j+g] = v;
}
p(G.size());
for (int &x: G)
printf("%s%d", (&x == &G[0] ? "" : " "), x);
puts("");
p(cnt);
for (int x: A)
p(x);
}
|
#include<iostream>
using namespace std;
int n, A[1001000];
int G[110];
int insertionSort(int g) {
int cnt = 0;
for(int i=g;i<n;i++){
int v = A[i];
int j = i-g;
while(j>=0&&A[j]>v){
A[j+g]=A[j];
j -= g;
cnt++;
}
A[j+g]=v;
}
return cnt;
}
void shellSort(){
int cnt = 0;
int g=1;
int m=0;
while(g<=n){
G[m++]=g;
g=g*3+1;
}
for(int i=m-1;i>=0;i--){
cnt += insertionSort(G[i]);
}
cout<<m<<endl;
for(int i=m-1;i>=0;i--){
cout << G[i] << ((i == 0) ? "\n" : " ");
}
cout<<cnt<<endl;
for(int i=0;i<n;i++){
cout<<A[i]<<endl;
}
}
int main(){
cin>>n;
for(int i=0;i<n;i++){
cin>>A[i];
}
shellSort();
}
|
#include<bits/stdc++.h>
using namespace std;
int cnt,m,G[11]={1,4,13,40,121,364,1093,3280,9841,29524,88573};
void insertSort(int *a,int n,int g){
int v,j;
for(int i=g;i<n;i++){
v = a[i];
j = i - g;
while(j>=0&&a[j]>v){
a[j+g] = a[j];
j = j - g;
cnt++;
}
a[j+g] = v;
}
}
void shellSort(int *a,int n){
cnt = 0;
m = 11;
for(int i=0;i<11;i++)
if(G[i]>n){
m = i;
break;
}
for(int i=m-1;i>=0;i--){
insertSort(a,n,G[i]);
}
}
int main(){
int n;
cin>>n;
int a[n];
for(int i=0;i<n;i++){
cin>>a[i];
}
shellSort(a,n);
cout<<m<<endl;
for(int i=m-1;i>=0;i--){
if(i==0)
cout<<G[i]<<endl;
else
cout<<G[i]<<" ";
}
cout<<cnt<<endl;
//insertSort(a,n,1);
for(int i=0;i<n;i++){
cout<<a[i]<<endl;
}
return 0;
}
|
#include<iostream>
using namespace std;
int cnt,m,g[100];
void insertionsort(int a[],int n,int g){
for(int i=g;i<n;++i){
int v=a[i],j=i-g;
while(j>=0&&a[j]>v){
a[j+g]=a[j];
j=j-g;
++cnt;
}
a[j+g]=v;
}
}
void shellsort(int a[],int n){
int h=1;
g[0]=1;
while(4*h<n){
g[++m]=4*h+1;
h=4*h+1;
}
for(int i=m;i>=0;--i) insertionsort(a,n,g[i]);
}
int main(){
int a[1000000],n;
cin>>n;
for(int i=0;i<n;++i) cin>>a[i];
shellsort(a,n);
cout<<m+1<<endl;
for(int i=m;i>=0;--i){
cout<<g[i];
if(i) cout<<" ";
}
cout<<endl<<cnt<<endl;
for(int i=0;i<n;++i) cout<<a[i]<<endl;
return 0;
}
|
#include <iostream>
#include <cmath>
using namespace std;
int insertionSort(int A[], int n, int g)
{
int cnt = 0;
for (int i = g; i < n; i++) {
int v = A[i];
int j = i - g;
while (j >= 0 && A[j] > v) {
A[j + g] = A[j];
j = j - g;
cnt++;
}
A[j + g] = v;
}
return cnt;
}
int main() {
int A[1000000];
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> A[i];
int cnt = 0;
int m = 0;
int nn = n;
int G[100];
while (nn > 0){
m++;
nn = nn/2;
}
for (int i = 0; i < m; i++)
{
G[i] = pow(2, m - i - 1);
cnt += insertionSort(A, n, G[i]);
}
cout << m << endl;
for (int i = 0; i < m; i++)
cout << G[i] << " ";
cout << endl;
cout << cnt << endl;
for (int i = 0; i < n; i++)
cout << A[i] << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int cnt = 0;
void insertionSort(int A[], int n, int g) {
for (int i = g; i < n; ++i) {
int v = A[i];
int j = i - g;
while (j >= 0 && A[j] > v) {
A[j + g] = A[j];
j -= g;
++cnt;
}
A[j + g] = v;
}
}
int main() {
int n, A[1000000];
cin >> n;
for (int i = 0; i < n; ++i) cin >> A[i];
int m = 1, G[20];
G[0] = n / 2;
for (int i = 0; G[i] > 1; ++i) {
G[i + 1] = G[i] / 2;
++m;
}
for (int i = 0; i < m; ++i) insertionSort(A, n, G[i]);
cout << m << endl;
for (int i = 0; i < m; ++i) {
if (i) cout << ' ';
cout << G[i];
}
cout << endl << cnt << endl;
for (int i = 0; i < n; ++i) cout << A[i] << endl;
return 0;
}
|
#include<iostream>
#include<cstdio>
int inSort(int A[],int n,int g){
int i,j,v;
int cnt=0;
for(i=g;i<n;i++){
v=A[i];
j=i-g;
while(j>=0 && A[j]>v){
A[j+g]=A[j];
j-=g;
++cnt;
}
A[j+g]=v;
}
return cnt;
}
void shSort(int A[],int n){
int i,j,k,l,G[20];
int m=0; for(i=1;i<=n;i=i*3+1) G[m++]=i;
int c=0; for(i=m-1;0<=i;i--) c+=inSort(A,n,G[i]);
printf("%d\n%d",m,G[m-1]);
for(i=m-2;0<=i;i--) printf(" %d",G[i]);
printf("\n%d\n",c);
for(i=0;i<n;i++) printf("%d\n",A[i]);
}
int main(){
int i,n,A[1000000];
std::cin>>n;
for(i=0;i<n;i++) std::cin>>A[i];
shSort(A,n);
return 0;
} |
#include<cstdio>
int cnt;
void insertionSort(int *a, int n, int g) {
int i, v, j;
for (int i = g; i < n; i++) {
v = a[i];
j = i - g;
while (j >= 0 && a[j] > v) {
a[j + g] = a[j];
j = j - g;
cnt++;
}
a[j + g] = v;
}
}
int a[1000000];
int main() {
cnt = 0;
int g = 1, i, n, m = 0;
scanf("%d", &n);
for (i = 0; i < n; i++)scanf("%d", &a[i]);
while (g <= n)g = 3 * g + 1;
while (true) {
g = (g - 1) / 3;
if (g == 0)break;
m++;
insertionSort(a, n, g);
}
g = 1;
while (g <= n)g = 3 * g + 1;
g = (g - 1) / 3;
printf("%d\n%d", m, g);
while (true) {
g = (g - 1) / 3;
if (g == 0)break;
printf(" %d", g);
}
printf("\n%d\n", cnt);
for (i = 0; i < n; i++)printf("%d\n", a[i]);
return 0;
}
|
#include <cstdio>
#include <vector>
#include <utility>
#include <algorithm>
#include <cmath>
using namespace std;
static inline void p(int x) { printf("%d\n", x); }
int main()
{
int n, cnt = 0;
scanf("%d", &n);
vector<int> A(n), G;
for (int &x: A)
scanf("%d", &x);
for (int i = 1, x = 1; x <= n; x = (pow(3, ++i) - 1) / 2)
G.push_back(x);
reverse(G.begin(), G.end());
for (int g: G)
for (auto i = A.begin() + g; i != A.end(); i++) {
int v = *i;
auto j = i - g;
for(; j >= A.begin() && *j > v; j -= g)
*(j + g) = *j, cnt++;
*(j + g) = v;
}
p(G.size());
for (int &x: G)
printf("%s%d", (&x == &G[0] ? "" : " "), x);
puts("");
p(cnt);
for (int x: A)
p(x);
}
|
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
using namespace std;
int main(void)
{
long long cnt = 0;
int interval = 1, n, i = 0;
int num[1000000] = {0};
int G[13] = {0};
cin >> n;
while(interval <= n){
G[i] = interval;
interval = interval * 3 + 1;
i++;
}
int Gstart = i;
for(i = 0;i < n;i++){
cin >> num[i];
}
for(int k = Gstart - 1;k >= 0;k--){
for(int i = G[k];i < n;i++){
int v = num[i];
int j = i - G[k];
while(j >= 0 && num[j] > v){
num[j + G[k]] = num[j];
j -= G[k];
cnt++;
}
num[j + G[k]] = v;
}
}
cout << Gstart << endl;
for(i = Gstart - 1;i >= 0;i--){
cout << G[i] << ' ';
}
cout << endl << cnt << endl;
for(i = 0;i < n;i++){
cout << num[i] << endl;
}
return 0;
}
|
#include <iostream>
#include <vector>
using namespace std;
long long cnt;
vector<int> G;
void insertionSort(int A[], int n, int g) {
for (int i = g; i < n; ++i) {
int v = A[i];
int j = i - g;
while (j >= 0 && A[j] > v) {
A[j + g] = A[j];
j = j - g;
cnt++;
}
A[j + g] = v;
}
}
void shellSort(int A[], int n) {
for (int i = 1;;) {
if (i > n) break;
G.push_back(i);
i = 3 * i + 1;
}
for (int i = G.size() - 1; i >= 0; --i)
insertionSort(A, n, G[i]);
}
int main() {
int n; cin >> n;
int A[1000000];
for (int i = 0; i < n; ++i) cin >> A[i];
cnt = 0;
shellSort(A, n);
cout << G.size() << endl;
for (int i = G.size() - 1; i >= 0; --i) {
cout << G[i];
if (i) cout << " ";
}
cout << endl << cnt << endl;
for (int i = 0; i < n; ++i) cout << A[i] << endl;
return 0;
}
|
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<vector>
using namespace std;
long long c;
int l;
int A[1000000];
int n;
vector<int> G;
void ins(int A[],int n,int g){
for(int i=g;i<n;i++){
int v=A[i];
int j=i-g;
while(j>=0 && A[j] >v){
A[j+g]=A[j];
j -= g;
c++;
}
A[j+g]= v;
}
}
void she(int A[],int n){
for(int h=1; ; ){
if(h>n) break;
G.push_back(h);
h= 3*h+1;
}
for(int i=G.size()-1;i>=0;i--){
ins (A,n,G[i]);
}
}
int main(){
cin >> n;
for(int i=0;i<n;i++) scanf("%d",&A[i]);
c=0;
she(A,n);
cout << G.size() << endl;
for(int i= G.size()-1;i>=0;i--){
printf("%d",G[i]);
if(i) printf(" ");
}
printf("\n");
printf("%d\n",c);
for(int i=0;i<n;i++) printf("%d\n",A[i]);
return 0;
}
|
#include <stdio.h>
#include <math.h>
int n;
int a[1000000];
int cnt;
void insertionSort(int g) {
for (int i = g; i < n; i ++) {
int v = a[i];
int j = i - g;
while (j >= 0 && a[j] > v) {
a[j + g] = a[j];
j -= g;
cnt ++;
}
a[j + g] = v;
}
}
void shellSort() {
int g[100000];
g[0] = 1;
int m = 0;
while (g[m] <= n) {
g[m + 1] = 3 * g[m] + 1;
m ++;
}
printf("%d\n", m);
for (int i = m - 1; i >= 0; i --) {
if (i < m - 1) printf(" ");
printf("%d", g[i]);
}
puts("");
for (int i = m - 1; i >= 0; i --) {
insertionSort(g[i]);
}
printf("%d\n", cnt);
for (int i = 0; i < n; i ++) {
printf("%d\n", a[i]);
}
}
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i ++) {
scanf("%d", &a[i]);
}
shellSort();
return 0;
} |
#include <iostream>
#include <cstdio>
#include <vector>
using namespace std;
int main() {
int n;
cin>>n;
int A[n];
for (int i=0; i<n; i++) {
scanf("%d",&A[i]);
}
int cnt=0;
vector<int> G;
for (int h=1; ; ) {
if (h>n) {
break;
}
G.push_back(h);
h=3*h+1;
}
for (int i=G.size()-1; i>=0; i--) {
for (int j=G[i]; j<n; j++) {
int v=A[j];
int k=j-G[i];
while (k>=0 && A[k]>v) {
A[k+G[i]]=A[k];
k-=G[i];
cnt++;
}
A[k+G[i]]=v;
}
}
cout<<G.size()<<endl;
for (int i=G.size()-1; i>=0; i--) {
cout<<G[i]<<(i==0?"":" ")<<flush;
}
cout<<endl;
cout<<cnt<<endl;
for (int i=0; i<n; i++) {
cout<<A[i]<<endl;
}
return 0;
}
|
#include<iostream>
#include<vector>
int main(){
using namespace std;
vector<size_t> G{2391484, 797161, 265720, 88573, 29524, 9841, 3280, 1093, 364, 121, 40, 13, 4, 1};
// input
size_t n;
cin >> n;
vector<unsigned long> A(n);
for(auto& i : A)cin >> i;
if(n == 1)return 0 & puts("1\n1\n0\n1");
// process
unsigned long cnt{0};
cout << lower_bound(G.rbegin(), G.rend(), n) - G.rbegin() << endl;
for(const auto& g : G)if(g < n){
cout << g << " \n"[g == 1];
for(size_t i = g; i < n; ++i)for(size_t j = i; j >= g && A[j - g] > A[j]; j -= g, ++cnt)swap(A[j], A[j - g]);
}
cout << cnt << endl;
for(const auto& a : A)cout << a << endl;
}
|
#include "bits/stdc++.h"
using namespace std;
typedef pair<int, int> P;
#define int long long
#define ll long long
#define mod 1000000007
#define INF (1LL<<60)
int cnt = 0;
void insertionsort(int a[], int n, int g){
for (int i = g; i < n; i++){
int v = a[i];
int j = i - g;
while (j >= 0 && a[j] > v){
a[j + g] = a[j];
j -= g;
cnt++;
}
a[j + g] = v;
}
}
signed main(){
int n;
int a[1000000];
int g[100];
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
g[0] = 1;
int m;
for (m = 0; g[m] <= n; m++){
g[m + 1] = g[m] * 3 + 1;
}
for (int i = m-1; i >= 0; i--)
insertionsort(a, n, g[i]);
cout << m << endl;
for (int i = m-1; i >= 0; i--)
cout << g[i] << " ";
cout << endl;
cout << cnt << endl;
for (int i = 0; i < n; i++)
cout << a[i] << endl;
return 0;
}
|
#include <stdio.h>
int insert(int *,int,int);
void shell(int *,int);
int main(){
int i,a[1000000],n;
scanf("%d",&n);
for(i=0;i<n;i++)scanf("%d",&a[i]);
shell(a,n);
return 0;
}
int insert(int *a,int n,int g){
int i,j,v,cnt=0;
for(i=0;i<n;i++){
v=a[i];
j=i-g;
while(j>=0 && a[j]>v){
a[j+g]=a[j];
j=j-g;
cnt++;
}
a[j+g]=v;
}
return cnt;
}
void shell(int *a,int n){
int m,g[100],i,j,array,cnt=0;
g[0]=1;
for(m=1;m<100;m++){
if(g[m-1]*3+1>=n)break;
g[m]=g[m-1]*3+1;
}
printf("%d\n",m);
for(i=m-1;i>=0;i--){
printf("%d ",g[i]);
if(i!=0)printf(" ");
}
printf("\n");
for(i=m-1;i>=0;i--)cnt+=insert(a,n,g[i]);
printf("%d\n",cnt);
for(i=0;i<n;i++)printf("%d\n",a[i]);
}
|
#include<iostream>
#include<vector>
using namespace std;
long long cnt;
int i,A[1000000],n;
vector<int> G;
void insertionSort(int A[],int n,int g){
for(int i=g;i<n;i++){
int v = A[i];
int j = i - g;
while(j >= 0 && A[j] > v){
A[j+g] = A[j];
j -= g;
cnt++;
}
A[j+g] = v;
}
}
void shellSort(int A[],int n){
for(int h=1;h <= n;h = 3*h+1)
G.push_back(h);
for(int i=G.size() -1;i>=0;i--)
insertionSort(A,n,G[i]);
}
int main(){
cin >> n;
for(int i=0;i<n;i++)
cin >> A[i];
cnt = 0;
shellSort(A,n);
cout <<G.size() << endl;
for(int i= G.size() -1;i>0;i--)
cout << G[i] << ' ';
cout << G[0] << endl;
cout << cnt << endl;
for(int i=0;i<n;i++)
cout << A[i] << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int cnt;
void insertionSort(int *A,int n,int g){
for(int i=g;i<n;i++){
int v=A[i];
int j=i-g;
while(j>=0&&A[j]>v){
A[j+g]=A[j];
j-=g;
cnt++;
}
A[j+g]=v;
}
}
void shellSort(int *A,int n){
cnt=0;
int r=1;
vector<int> G;
while(r<=n){
G.push_back(r);
r*=2;
}
int m=G.size();
reverse(G.begin(),G.end());
cout<<m<<endl;
for(int i=0;i<m;i++) cout<<G[i]<<" \n"[i==m-1];
for(int i=0;i<m;i++) insertionSort(A,n,G[i]);
cout<<cnt<<endl;
}
int main()
{
int n;
cin>>n;
int A[n];
for(int i=0;i<n;i++) cin>>A[i];
shellSort(A,n);
for(int k=0;k<n;k++) cout<<A[k]<<endl;
return 0;
}
|
#include <iostream>
#include <vector>
using namespace std;
int cnt;
void generalizedInsertionSort(int A[], int n, int g) {
for (int i = g; i < n; i++) {
int key = A[i];
int j = i - g;
while (j >= 0 && A[j] > key) {
A[j+g] = A[j];
j -= g;
cnt++;
}
A[j+g] = key;
}
}
void shellSort(int A[], int n) {
vector<int> G;
int g = (n / 2 == 0) ? 1 : n / 2;
while (g > 0) {
G.push_back(g);
g /= 2;
}
for (int g : G) {
generalizedInsertionSort(A, n, g);
}
cout << G.size() << endl;
for (int g : G) cout << g << " ";
cout << endl;
}
int main() {
int n;
cin >> n;
int A[n];
for (int i = 0; i < n; i++) cin >> A[i];
shellSort(A, n);
cout << cnt << endl;
for (int i = 0; i < n; i++) cout << A[i] << endl;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.