text stringlengths 49 983k |
|---|
#include<iostream>
using namespace std;
int InsertionSort(int* a, int n, int g)
{
int tmp, j, count = 0;
for (int i = g; i < n; i++)
{
tmp = a[i];
for (j = i - g; j >= 0 && a[j] > tmp; j -= g)
{
a[j + g] = a[j];
count++;
}
a[j + g] = tmp;
}
return count;
}
int ShellSort(int* a, int n)
{
int m, g[100],count = 0;
for (m = 1; m * m * m <= n; m++)
continue;
m--;
cout << m << endl;
for (int i = 0; i < m; i++)
{
g[i] = (m - i) * (m - i);
if (i)
cout << " ";
cout << g[i];
}
for (int i = 0; i < m; i++)
count += InsertionSort(a, n, g[i]);
return count;
}
int main()
{
int n, a[1000000], count;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
count = ShellSort(a, n);
cout << endl << count << endl;
for (int i = 0; i < n; i++)
cout << a[i] << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
const int MAX_NUM = 1000000+7;
int a[MAX_NUM];
int g[107];
int m;
int n;
int cnt;
void insertSort(int g){
int i;
for(i = g; i < n; i++){
int key = a[i];
int j;
for(j = i-g; j>=0 && a[j] > key;j-=g){
a[j+g] = a[j];
cnt++;
}
a[j+g] = key;
}
}
void shellSort(){
cnt = 0;
m = 0;
int k = 1;
while(true){
if(k > n) break;
g[m++] = k;
k= 3*k+1;
}
cout << m << endl;
int q;
for(q = m-1; q>=0 ;q--){
if(q!=m-1) cout << " ";
cout << g[q];
}
cout << endl;
int i;
for(i = m-1; i >=0 ; i--){
insertSort(g[i]);
}
}
int main(){
cin >> n;
int i;
for(i = 0; i < n; i++){
cin >> a[i];
}
shellSort();
cout << cnt<< endl;
for(i = 0; i < n; i++){
cout << a[i] << endl;
}
return 0;
}
|
#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]*2<=n;i++)G[i] = G[i-1]*2,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>
#include<vector>
using namespace std;
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 && v < A[j]) {
A[j+g] = A[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[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 <iostream>
#include <vector>
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) {
vector<int> g;
int t = n;
while(t > 0) {
g.push_back(t);
t = t / 2;
}
cout << g.size() << endl;
for(int i = 0;i < g.size()-1;i++) {
cout << g[i] << " ";
}
cout << g[g.size()-1] << endl;
for(auto e:g) {
insertionSort(a,n,e);
}
cout << cnt << endl;
for(int i = 0;i < n;i++) {
cout << a[i] << endl;
}
}
int main() {
int n,a[1000000];
cin >> n;
for(int i = 0;i < n;i++) cin >> a[i];
shellSort(a,n);
}
|
#include<iostream>
#include<cstdio>
using namespace std;
int A[1000000],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){
int G[100],m,temp=0,i=1;
m = 1;
G[0]=1;
while(1){
temp=3*G[i-1]+1;
if(temp>n)
break;
G[i]=temp;
i++;
m++;
}
printf("%d\n",m);
for(i=m-1;i>0;i--){
printf("%d ",G[i]);
}
printf("%d\n",G[0]);
for(i=m-1;i>=0;i--){
insertionsort(A,n,G[i]);
}
printf("%d\n",cnt);
for(i=0;i<n;i++){
printf("%d\n",A[i]);
}
}
int main(){
int n;
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d",&A[i]);
}
shellsort(A,n);
} |
#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], 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 n,m=0,g=0,cnt=0;
cin >> n;
int* A = new int[n];
for(int i=0;i<n;i++){
cin >> A[i];
}
while(true){
if(3*g+1 > n)break;
g = 3*g+1;
m++;
}
int g_max = g;
for(int i=0;i<m;i++){
cnt = insertionSort(A, n, g, cnt);
g = (g-1)/3;
}
cout << m << endl;
for(int i=0;i<m;i++){
cout << (i !=0 ? " ": "") << g_max;
g_max = (g_max-1)/3;
}
cout << endl;
cout << cnt << endl;
for(int i=0;i<n;i++){
cout << A[i] << endl;
}
delete[] A;
}
|
#include "bits/stdc++.h"
using namespace std;
void insertsort(vector<int> &A,int n, int g, int &cnt){
int j,k,v;
for(j=g;j<n;j++){
v=A.at(j);
k = j - g;
while(k>=0 && A.at(k) > v){
A.at(k+g) = A.at(k);
k -= g;
cnt++;
}
A.at(k+g) = v;
}
}
int main(){
int n,i,m,g,cnt;
m=0;
cnt = 0;
cin >> n;
vector<int> A(n);
for(i=0;i<n;i++) cin >> A.at(i);//read A
g=1;
while(g<=n){
m++;
g = 3*g+1;
}
cout << m << endl;
for(i=0;i<m;i++){
g /= 3;
if(i) cout << " ";
cout << g;
insertsort(A,n,g,cnt);
}
cout << endl << cnt << endl;
for(i=0;i<n;i++) cout << A.at(i) << endl;
}
|
#include<iostream>
using namespace std;
long long cnt = 0;
void insertion(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;
}
}
int make(int g[], int n)
{
g[0] = 1;
int i;
for (i = 1;; i++)
{
g[i] = 3 * g[i - 1] + 1;
if (g[i] > n)
{
return i;
}
}
}
int main()
{
int n, a[1000000];
cin >> n;
for (int i = 0; i < n; i++)cin >> a[i];
int m, g[35];
m = make(g, n);
for (int i = m - 1; i >= 0; i--)
{
insertion(a, n, g[i]);
}
cout << m << endl << g[m - 1];
for (int i = m - 2; i >= 0; i--)cout << " " << g[i];
cout << endl << cnt << endl;
for (int i = 0; i < n; i++)cout << a[i] << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main(){
int n;
int A[1000000];
cin >> n;
for(int i=0;i<n;i++) cin >> A[i];
int m=0;
int g=0;
int cnt=0;
vector<int> G;
while(3*g+1<=n) g=3*g+1;
for(;g>0;g/=3){
G.push_back(g);
m++;
}
for(int i=0;i<m;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 << m << endl;
cout << G[0];
for(int i=1;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>
#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 m=0;
int sum=0;
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;
}
}
cout << m+1 << endl;
for(int i=m;i>=0;i--){
for(int j=G[i];j<=N-1;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];
sum++;
A[k+G[i]]=v;
}
}
if(i>0){
cout << G[i] << " ";
}
else if(i==0){
cout << G[i] << endl << sum << endl;
}
}
for(int i=0;i<N;i++){
cout << A[i] << endl;
}
}
|
#include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>
using namespace std;
int cnt;
vector<int> G;
void insertionSort(int* T,int num,int g)
{
for(int i=g;i<num;i++)
{
int v = T[i];
int j = i - g;
while(j>=0&&T[j]>v)
{
T[j + g] = T[j];
j = j - g;
cnt++;
}
T[j + g] = v;
}
}
void shellSort(int* T,int num)
{
for(int h=1;;)
{
if (h > num) break;
G.push_back(h);
h = 3 * h + 1;
}
for(int i=G.size()-1;i>=0;i--)
{
insertionSort(T, num, G[i]);
}
}
int main()
{
int num;
cin >> num;
int* T = new int[num];
for(int i=0;i<num;i++)
{
cin >> T[i];
}
shellSort(T, num);
cout << G.size() << endl;
for(int i=G.size()-1;i>=0;i--)
{
cout << G[i] << (i == 0 ? '\n' : ' ');
}
cout << cnt << endl;
for(int i=0;i<num;i++)
{
cout << T[i] << endl;
}
delete[] T;
}
|
#include<iostream>
#include<algorithm>
#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++){
for(int j=i-g;j>=0&&A[j+g]<A[j];j-=g){
swap(A[j+g],A[j]);
cnt++;
}
}
}
void shellSort(int A[],int n){
for(int i=1;i<=n;i=i*3+1){
g.push_back(i);
}
for(int i=g.size()-1;i>=0;i--){
insertionSort(A,n,g[i]);
}
}
int main(void){
int n;
cin>>n;
int A[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 <vector>
using namespace std;
int main() {
int n;
cin>>n;
int A[n];
for (int i=0; i<n; i++) {
cin>>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<stdio.h>
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 && v < A[j]) {
A[j + g] = A[j];
j -= g;
cnt++;
}
A[j + g] = v;
}
return cnt;
}
void shellSort(int A[], int n) {
int im, m = 1, v = 1, G[100], sum = 0;
for ( im = 0; v <= n; im++ ) {
G[im] = v;
m *= 3;
v += m;
}
printf("%d\n", im);
for ( int i = im - 1; i >= 0; i-- ) {
if ( i != (im - 1) ) printf(" ");
printf("%d", G[i]);
sum += insertionSort(A, n, G[i]);
}
printf("\n%d\n", sum);
for ( int i = 0; i < n; i++ ) {
printf("%d\n", A[i]);
}
}
int main() {
int n, A[1000000];
scanf("%d", &n);
for ( int i = 0; i < n; i++ ) scanf("%d", &A[i]);
shellSort(A, n);
return 0;
}
|
#include<iostream>
#include<cstdio>
using namespace std;
int m = 0, cnt = 0, G[100];
void shellSort(int a[], int n) {
int i, j;
cnt = 0;
G[0] = 1;
while (1) {
G[m + 1] = 3 * G[m] + 1;
if (G[m + 1] >= n)break;
else m++;
}
m++;
for (i = m - 1; i >= 0; i--) {
int k, j, tmp;
for (k = G[i]; k < n; k++) {
tmp = a[k];
j = k - G[i];
while (j >= 0 && a[j] > tmp) {
a[j + G[i]] = a[j];
j -= G[i];
cnt++;
}
a[j + G[i]] = tmp;
}
}
}
int main() {
int i, j, n, a[1000000];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
shellSort(a, n);
printf("%d\n", m);
for (i = m - 1; i >= 0; i--) {
printf("%d", G[i]);
if (i != 0)printf(" ");
else printf("\n");
}
printf("%d\n", cnt);
for (i = 0; i < n; i++) {
printf("%d\n", a[i]);
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int N, A[1000000], cnt;
void Out(const vector<int> G) {
cout << G.size() << endl;
cout << G.back();
for (int i = G.size() - 2; i >= 0; i--) {
cout << ' ' << G[i];
}
cout << endl;
cout << cnt << endl;
for (int i = 0; i < N; i++)
cout << A[i] << endl;
}
void InsertionSort(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;
}
}
void ShellSort(const vector<int> G) {
cnt = 0;
for (int i = G.size() - 1; i >= 0; i--) {
InsertionSort(G[i]);
}
}
int main()
{
vector<int> G;
cin >> N;
int calc = 1;
while (calc <= N) {
G.push_back(calc);
calc = calc * 3 + 1;
}
for (int i = 0; i < N; i++)
cin >> A[i];
ShellSort(G);
Out(G);
return 0;
} |
#include<iostream>
#include<string>
using namespace std;
long d=0,z=0,b[1000000];
void ChentrucTiep(long long a[],long n,long h){
int x,k;
for(int i=h;i<n;i++){
x=a[i];
k=i-h;
while(k>=0&& a[k]>x)
{
a[k+h]=a[k];
k-=h;
d++;
}
a[k+h]=x;
}
}
void shellSort(long long a[],long n){
for(int i=1;i<=n;)
{
b[z]=i;
z+=1;
i=i*3+1;
}
for(int x=z-1;x>=0;x--)
ChentrucTiep(a,n,b[x]);
}
int main(){
long n;
long long a[1000000];
cin >>n;
for(int i=0;i<n;i++)
cin >>a[i];
shellSort(a,n);
cout << z << endl;
for(int i=z-1;i>=0;i--){
cout << b[i];
if(i)
cout<<" ";
}
cout <<endl << d << 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 cnt;
int l;
int A[1000000];
int n;
vector<int> G;
void insertionSort(int A[], int n, int g)
{
for(int i=0;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;
long long cnt;
vector<int> G;
int arr[1000010];
int m,n;
void sert(int g){
for(int i=g;i<n;i++){
int v = arr[i];
int j = i - g;
while(j>-1&&arr[j]>v){
arr[j+g] = arr[j];
j -= g;
cnt++;
}
arr[j+g] = v;
}
}
void shell(){
int h=1;
while(h<=n){
G.push_back(h);
h = 3*h + 1;
}
m = G.size();
for(int i=m-1;i>=0;i--) sert(G[i]);
}
int main(){
cin>>n;
cnt = 0;
for(int i=0;i<n;i++) scanf("%d",&arr[i]);
shell();
cout<<m<<endl;
for(int i=m-1;i>=0;i--) {
printf("%d",G[i]);
if(i) printf(" ");
}
printf("\n");
cout<<cnt<<endl;
for(int i=0;i<n;i++) printf("%d\n",arr[i]);
}
|
#include <iostream>
#include <cstdio>
#include <vector>
using namespace std;
int n; long long cnt;
int A[1000000]; vector<int> G;
void Insert(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) Insert(A, n, G[i]);
}
int main() {
cin >> n;
for(int i=0;i<n;++i) scanf("%d",&A[i]);
Shell(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 <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int cnt;
void print(vector<int> &a, int n)
{
rep(i, n)
cout << a[i] << endl;
}
void insert_sort(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 shell_sort(vector<int> &a, int n)
{
vector<int> g;
for (int h = 1; h <= n; h = 3*h + 1)
g.push_back(h);
cout << g.size() << endl;
for (int i = g.size()-1; i >= 0; i--) {
cout << g[i];
if (i) cout << " ";
}
cout << endl;
for (int i = g.size()-1; i >= 0; i--)
insert_sort(a, n, g[i]);
}
int main()
{
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
shell_sort(a, n);
cout << cnt << endl;
print(a, n);
}
|
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int num;
vector<int> line;
int cnt;
void shellsort(int d){
for(int i=0;i<d;++i){
for(int j=i;j<line.size();j+=d){
int place = j;
while(place - d >= 0 && line[place - d] > line[place]){
swap(line[place - d],line[place]);
++cnt;
place-=d;
}
}
}
}
int main(){
cin>>num;
line.resize(num);
for(int i=0;i<num;++i){
cin>>line[i];
}
vector<int> d;
d.push_back(1);
while(d.back() <= num){
d.push_back(d.back()*4+1);
}
d.pop_back();
cout<<d.size()<<endl;
for(int i=d.size()-1;i>=0;--i){
if(i!=d.size()-1){
cout<<" ";
}
cout<<d[i];
shellsort(d[i]);
}
cout<<endl;
cout<<cnt<<endl;
for(int i=0;i<line.size();++i){
cout<<line[i]<<endl;
}
return 0;
}
|
#include <iostream>
#include <cmath>
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 m=0;
for(int i=1;i*2-1<n;i*=2)
m++;
if(m==0) m=1;
cout<<m<<endl;
for(int i=0,j=pow(2,m);i<m-1;i++,j/=2){
insertionSort(A,n,j-1);
cout<<j-1<<" ";
}
insertionSort(A,n,1);
cout<<1<<endl;
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 i=0;i<n;i++)
cout<<A[i]<<endl;
}
|
// ALDS1_2_D
#include <iostream>
#include <vector>
using namespace std;
void insertionSort(vector<int> &A, int &cnt, int g){
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 -= g;
cnt++;
}
A[j+g] = v;
}
}
void shellSort(vector<int> &A){
int m, cnt = 0;
vector<int> G;
G.push_back(1);
while(G[G.size()-1] <= A.size())
G.push_back(3*G[G.size()-1]+1);
m = G.size();
for(int i=m-2;i>=0;i--)
insertionSort(A, cnt, G[i]);
cout<<m-1<<endl;
for(int i=m-2;i>=0;i--){
if(i != m-2)
cout<<" ";
cout<<G[i];
}
cout<<endl<<cnt<<endl;
}
int main(){
int n, num;
vector<int> A;
cin>>n;
for(int i=0;i<n;i++){
cin>>num;
A.push_back(num);
}
shellSort(A);
for(int i=0;i<n;i++)
cout<<A[i]<<endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll,ll>
#define FOR(I,A,B) for(ll I = ll(A); I < ll(B); ++I)
ll cnt;
void insertionSort(vector<ll> &A,ll n,ll g){
FOR(i,g,n){
ll v = A[i];
ll 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<ll> &A , ll n){
cnt = 0;
ll m = 0;
ll k = 1;
vector<ll> G;
while(k<=(ll)n){
G.push_back(k);
k = k*2;
}
reverse(G.begin(), G.end());
m = G.size();
cout << m << "\n" << G[0];
FOR(i,1,m)cout<<" "<<G[i];
cout<<'\n';
FOR(i,0,m){
insertionSort(A,n,G[i]);
}
cout << cnt << "\n";
}
int main () {
ll n;
cin >> n;
vector<ll> A(n);
FOR(i,0,n)cin >> A[i];
shellSort(A,n);
FOR(i,0,n){
cout << A[i] << "\n";
}
}
|
#include <bits/stdc++.h>
#define lp(n) for(int i = 0; i < n; i++)
#define LP(i, a, n) for(int i = a; i < n; i++)
#define lpp(i, n) for(int i = 0; i < n; i++)
using namespace std;
int cnt;
void is(int A[], int n, int g) {
LP(i, g, n) {
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 m = 10;
int d = 0;
int G[] = {29524, 9841, 3280, 1093, 364, 121, 40, 13, 4, 1};
int n;
cin >> n;
for(; G[d] > n; d++);
int A[1000000];
lp(n)
cin >> A[i];
lp(m-d) is(A, n, G[i+d]);
cout << m-d << endl;
lp(m-d) cout << G[i+d] << ((i == m-d-1)? "\n" : " ");
cout << cnt << endl;
lp(n) cout << A[i] << endl;
return 0;
}
|
#include<stdio.h>
#include<math.h>
#define N 1000000
int main(){
int inser[N];
int i,j,g,value;
int num,cnt;
int m;
int shell[N];
int k;
scanf("%d",&num);
for(i=0;i<num;i++) scanf("%d",&inser[i]);
//shellsort
cnt = 0;
j=0;
for(i=num/2;i>0;i=i/2){
shell[j] = i;
j++;
}
m=j+1;
for(k=0;k<=m-1;k++){
//insertionsort
for(i=shell[k];i<=num-1;i++){
value = inser[i];
j = i - shell[k];
while(j>=0 && inser[j] > value){
inser[j+shell[k]] = inser[j];
j = j - shell[k];
cnt++;
inser[j+shell[k]] = value;
}
}
}
printf("%d\n",m);
for(i=0;i<m;i++){
if(i) printf(" ");
printf("%d",shell[i]);
}
printf("\n");
printf("%d\n",cnt);
for(i=0;i<num;i++){
printf("%d\n",inser[i]);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, u) for (int i = 0; i < u; i++)
using ll = long long;
using ull = unsigned long long;
int main() {
int n;
int a[1000000] = {};
cin >> n;
rep(i, n) cin >> a[i];
int cnt = 0;
int m = 0;
int g[1000000] = {};
for (int i = 1; ; i = 3 * i + 1) {
g[m] = i;
if (g[m] > n) break;
m++;
}
reverse(g, g + m);
rep(i, m) {
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 << m << endl;
rep(i, m) {
cout << g[i];
if (i != m - 1) cout << ' ';
else cout << endl;
}
cout << cnt << endl;
rep(i, n) cout << a[i] << endl;
return 0;
}
|
#include<iostream>
using namespace std;
int cnt, m, g[13] = {1, 4, 13, 40, 121, 364, 1093, 3280, 9841, 29524, 88573, 265720, 797161};
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){
cnt = 0;
m = 0;
for(int i = 0; i < 13; i++){
if(g[i] <= n)
m++;
}
for(int i = m-1; i >= 0; i--)
insertionSort(a, n, g[i]);
}
void print(int a[], int n){
cout << m << endl << g[m-1];
for(int i = m-2; i >= 0; i--)
cout << ' ' << g[i];
cout << endl << cnt << endl;
for(int i = 0; i < n; i++)
cout << a[i] << endl;
}
int main(){
int n, a[1000000];
cin >> n;
for(int i = 0; i < n; i++)
cin >> a[i];
shellSort(a, n);
print(a, n);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
int A[1000000];
int cnt = 0;
int m;
int G[100];
void inssort(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 shesort() {
for(int i=m-1; i>=0; i--){
inssort(G[i]);
}
}
int main() {
scanf("%d", &n);
for(int i=0; i<n; i++) {
scanf("%d", &A[i]);
}
m = 0;
for(int h=1; h<=n; m++, h=3*h+1) {
G[m] = h;
}
shesort();
printf("%d\n", m);
for(int i=m-1; i>=0; i--){
printf("%d%c", G[i], i ? ' ' : '\n');
}
printf("%d\n", cnt);
for(int i=0; i<n; i++){
printf("%d\n", A[i]);
}
} |
#include <iostream>
#include <cstdio>
#include <vector>
using namespace std;
const int maxn = 1e6 + 5;
int a[maxn];
int g[maxn];
vector<int >G;
int cnt = 0;
int main(){
int n;
scanf("%d",&n);
for(int i = 1;i <= n; i++){
scanf("%d",&a[i]);
}
for(int i = 1;i <= n; i = i*3+1)G.push_back(i);
int sk = G.size();
printf("%d\n",sk);
for(int i = G.size()-1;i >= 0; i--){
printf("%d",G[i]);
if(i)printf(" ");
}
for(int k = G.size()-1;k >= 0; k--){
int g = G[k];
for(int i = g;i <= n; i++){
int v = a[i];
int j = i - g;
while(j >= 1 && a[j] > v){
a[j+g] = a[j];
j -= g;
cnt++;
}
a[j+g] = v;
}
}
printf("\n%d\n",cnt);
for(int i = 1;i <= n; i++)printf("%d\n",a[i]);
} |
#include<iostream>
#include<vector>
using namespace std;
int A[1000000];
int insertionSort(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;
}
void shellSort( int n) {
int cnt = 0;
vector<int> G;
for (int i = 1;;) {
if (i > n) break;
G.push_back(i);
i = i * 3 + 1;
}
for (int i = G.size() - 1; i >= 0;i--) {
cnt += insertionSort( n, G[i]);
}
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;
}
}
int main(void) {
int n;
cin >> n;
for (int i = 0; i < n; i++) cin >> A[i];
shellSort( n);
} |
//希尔排序
#include<iostream>
using namespace std;
#define N 1000005
long long cnt = 0;
int G[102];
int A[N];
void insertionSort(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)
{
int m = n ,i=0;
while(m/3!=0)
{
G[i] = m/3+1;
m = G[i];
i++;
}
G[i]=1;
m = i+1;
cout<<m<<endl;
for(i =0;i<m;i++)
{
insertionSort(A,n,G[i]);
if(i<m-1)
cout<<G[i]<<' ';
else
cout<<G[i]<<endl;
}
}
int main()
{
int n;
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>
int A[1000005], G[105], n, cnt, cur, an = 1;
void insertion_sort(int g) {
for (int i = g; i < n; ++i) {
int j = i - g, t = A[i];
for (; j >= 0 && A[j] > t; j -= g, ++cnt) {
A[j + g] = A[j];
}
A[j + g] = t;
}
}
void shell_sort() {
for (int i = cur; i > 0; --i)
insertion_sort(G[i]);
}
int main() {
scanf("%d", &n);
for (int i = 0; i < n; ++i)
scanf("%d", &A[i]);
while (an <= n) {
G[++cur] = an;
an = an * 3 + 1;
}
printf("%d\n", cur);
for (int i = cur; i > 0; --i)
printf("%d ", G[i]);
printf("\n");
shell_sort();
printf("%d\n", cnt);
for (int i = 0; i < n; ++i)
printf("%d\n", A[i]);
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<int> G;
int n,arr[1000010];
int cnt=0,m;
void inserionSort(int arr[],int n, int g)
{
int v;
for(int i=g;i<n;i++){
v=arr[i];
int j=i-g;
while(j>=0&&arr[j]>v){
arr[j+g]=arr[j];
j=j-g;
cnt++;
}
arr[j+g]=v;
}
}
void shellSort(int arr[],int n)
{
for(m=1;m<=n;){
G.push_back(m);
m=3*m+1;
}
for(int i=G.size()-1;i>=0;i--)
inserionSort(arr,n,G[i]);
}
int main()
{
cin>>n;
for(int i=0; i<n; i++)
cin>>arr[i];
shellSort(arr,n);
m=G.size();
cout<<m<<endl;
for(int i=m-1;i>=0;i--){
cout<<G[i]<<" ";
}
cout<<endl<<cnt<<endl;
for(int i=0;i<n;i++)
cout<<arr[i]<<endl;
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int cnt,m;
vector<int> G;
void insertionSort(vector<int>&vec,int g){
for(int i=g;i<vec.size();i++){
int v=vec[i];
int j=i-g;
while(j>=0&&vec[j]>v){
vec[j+g]=vec[j];
j=j-g;
cnt++;
}
vec[j+g]=v;
}
}
void shellSort(vector<int>&vec){
cnt=0;
G.push_back(1);
for(int i=1;3*G[i-1]+1<vec.size()&&G.size()<=100;i++)
G.push_back(3*G[i-1]+1);
m=G.size();
reverse(G.begin(),G.end());
for(int i=0;i<m;i++) insertionSort(vec,G[i]);
}
int main(){
int N;
cin>>N;
vector<int> vec(N);
for(int i=0;i<N;i++) cin>>vec[i];
cnt=0;
shellSort(vec);
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<<vec[i]<<endl;
return 0;
}
|
#include<iostream>
using namespace std;
int cnt;
void insertSort(int a[], int n, int g){
for(int i = g + 1; i <= n; ++i){
int j = i - g, k = a[i];
while(j > 0 && k < a[j]) { a[j + g] = a[j]; j -= g; ++cnt;}
if(j != i - g) a[j + g] = k;
}
}
void shellSort(int a[], int n){
cnt = 0;
int m = 0, x = 1, g[101];
do{ g[++m] = x; x = 3 * x + 1; }while(x < n);
cout << m << endl;
for(int i = m; i > 1 ; --i) { cout << g[i] << " "; insertSort(a, n, g[i]); }
cout << g[1] << endl; insertSort(a, n, g[1]);
}
int main(){
int n; cin >> n;
int a[n + 5];
for(int i = 1; i <= n; ++i) cin >> a[i];
shellSort(a, n);
cout << cnt << endl;
for(int i = 1; i <= n; ++i) cout << a[i] << endl;
return 0;
}
|
#include <iostream>
#include <cstdio>
long long cnt;
void insertionSort(int *a, int n, int g){
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 -= g;
cnt++;
}
a[j+g] = v;
}
}
void shellSort(int *a, int n){
int *g;
int i,j,m;
j=1;
m=0;
while(j<=n){
m++;
j = 3*j + 1;
}
std::printf("%d\n",m);
g = new int[m];
g[0]=1;
for(i=1; i<m; i++){
g[i] = 3*g[i-1] + 1;
}
for(i=m-1; i>0; i--){
std::printf("%d ", g[i]);
insertionSort(a, n, g[i]);
}
std::printf("%d\n", g[0]);
insertionSort(a, n, g[0]);
}
int main(){
int N, i;
int *a;
std::scanf("%d", &N);
a = new int[N];
for (i=0; i<N; i++) std::scanf("%d", &a[i]);
shellSort(a, N);
std::printf("%d\n", cnt);
for (i=0; i<N; i++) std::printf("%d\n", a[i]);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int cnt;
int a[1000005];
void is(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 g[1000005];
int m;
void ss(int n){
cnt=0;
m=1;
g[0]=1;
for(;g[m-1]*3+1<=n;m++)
g[m]=g[m-1]*3+1;
reverse(g,g+m);
for(int i=0;i<m;i++){
is(n,g[i]);
}
}
int main(){
int n;cin>>n;
for(int i=0;i<n;i++)
cin>>a[i];
ss(n);
cout<<m<<endl;
for(int i=0;i<m-1;i++){
cout<<g[i]<<' ';
}cout<<g[m-1]<<"\n";
cout<<cnt<<"\n";
for(int i=0;i<n;i++){
cout<<a[i]<<"\n";
}
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 cnt=0;
int g[101];
int gn[101];
int x=1;
gn[0]=x;
int l=1;
while(1){
x*=2;
if(n<x)break;
gn[l]=x;
l++;
}
int m=l;
for(int i=m-1,j=0;i>=0;i--,j++){
g[j]=gn[i];
}
for(int i=0;i<m;i++){
//insert
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 << m << endl;
for(int i=0;i<m;i++){
cout << g[i];
if(i+1!=m)cout << " ";
}
cout << endl;
cout << cnt<<endl;
for(int i=0;i<n;i++){
cout << a[i] << endl;
}
return 0;
} |
# include <iostream>
# include <deque>
using namespace std;
int n,*a;
deque<int> d;
int cnt = 0;
void shell_sort()
{
int y,h,k;
for(int i = 0;i < d.size();i++)
{
h = d[i];
for(int j = h;j < n;j++)
{
y = a[j];
for(k = j-h; k >= 0 && y <a[k]; k -= h)
{
cnt++;
a[k+h] = a[k];
}
a[k+h] = y;
}
}
}
int main(void)
{
d.push_back(1);
scanf("%d",&n);
a = new int [n];
for(int i = 2;i < n;i++)
{
if(d.size() == 100 || 3*d[0]+1 >= n) break;
d.push_front(3*d[0]+1);
}
for(int i = 0;i < n;i++) scanf("%d",&a[i]);
shell_sort();
printf("%d\n",d.size());
for(int i = 0;i < d.size();i++) printf("%d%c",d[i],i == d.size()-1?'\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 = 0;
void Print(vector<int>m){
for(int i = 0; i < m.size(); i++){
if(i)cout << ' ';
cout << m[i];
}
cout << endl;
}
void InsertSort(vector<int>&a, int step){
for(int i = step; i < a.size(); i++){
int k = a[i], j = i-step;
while(j >= 0 and a[j] > k){
a[j+step] = a[j];
j -= step;
cnt++;
}
a[j+step] = k;
}
}
int main(){
int n;
cin >> n;
vector<int>a(n);
for(int i = 0; i < n; i++){
cin >> a[i];
}
vector<int>m;
int x = n;
if(x == 1){
m.push_back(1);
}else{
while(x > 1){
m.push_back(x / 2);
x /= 2;
}
}
for(auto step: m){
InsertSort(a, step);
}
cout << m.size() << endl;
Print(m);
cout << cnt << endl;
for(auto i: a){
cout << i << endl;
}
}
|
#include<stdio.h>
int a[1000100],g[100000]={1},cnt=0,m=0;
void shell(int A[],int g,int n){
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){
while(3*g[m]+1<n){
m++;
g[m]=3*g[m-1]+1;
}
for(int i=m;i>=0;i--){
shell(A,g[i],n);
}
}
int main(){
int i,n,j,k;
scanf("%d",&n);
for(i=0;i<n;i++) scanf("%d",&a[i]);
shellSort(a,n);
printf("%d\n",m+1);
for(i=m;i>=0;i--){
printf("%d",g[i]);
if(i!=0) printf(" ");
else printf("\n");
}
printf("%d\n",cnt);
for(i=0;i<n;i++) printf("%d\n",a[i]);
}
|
#include<iostream>
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-=g;
cnt++;
}
A[j+g]=v;
}
}
void shellSort(int *A, int n) {
int m;
static const int G[] = {1, 4, 13, 40, 121, 364, 1093, 3280, 9841, 29524, 88573, 265720, 797161, 2391484};
for(m=1; G[m]<n; m++);
for(int i=m-1; i>=0; i--) {
insertionSort(A, n, G[i]);
}
cout<<m<<'\n'<<G[m-1];
for(int i=m-2; i>=0; i--) cout<<' '<<G[i];
cout<<'\n';
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n, A[1000000];
cin>>n;
for(int i=0; i<n; i++) cin>>A[i];
shellSort(A, n);
cout<<cnt<<'\n';
for(int i=0; i<n; i++) cout<<A[i]<<'\n';
return 0;
}
|
#include <cstdio>
using namespace std;
const int MAXN=1e6+7;
int n,cnt=0;
int a[MAXN],g[105],h[105];
void is (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 main () {
scanf ("%d",&n);
for (int i=0;i<n;i++) {
scanf ("%d",&a[i]);
}
int m=1;
h[1]=1;
while (h[m]<n) h[++m]=3*h[m-1]+1;
if (h[m]>n) m--;
for (int i=1;i<=m;i++) {
g[i]=h[m+1-i];
}
for (int i=1;i<=m;i++) {
is (g[i]);
}
printf ("%d\n%d",m,g[1]);
for (int i=2;i<=m;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 <algorithm>
using namespace std;
int n, a[1111111], c, g[20];
int main() {
scanf("%d", &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;
}
int ret = 0;
for(int i = c - 1; i >= 0; i--) {
for(int 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];
ret++;
}
a[w + g[i]] = v;
}
}
printf("%d\n", c);
for(int i = c - 1; i >= 0; i--) printf(i ? "%d " : "%d\n", g[i]);
printf("%d\n", ret);
for(int i = 0; i < n; i++) printf("%d\n", a[i]);
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int g[1000001];
int a[1000001];
int n,cnt,m,t=1;
bool f;
void insertsort(int n,int s){
int v,j;
for (int i=s; i<n; i++){
v=a[i];
j=i-s;
while (j>=0 && a[j]>v){
a[j+s]=a[j];
cnt++;
j-=s;
}
a[j+s]=v;
}
}
int main(){
cin>>n;
cnt=0; m=0; f=true;
for (int i=0; i<n; i++){
cin>>a[i];
if (f){
if (t<=n)
g[m++]=t;
else f=false;
t=3*t+1;
}
}
cout<<m<<endl;
cout<<g[m-1];
for (int i=m-2; i>=0; i--)
cout<<' '<<g[i];
cout<<endl;
for (int i=m-1; i>=0; i--)
insertsort(n,g[i]);
cout<<cnt<<endl;
for (int i=0; i<n; i++){
cout<<a[i]<<endl;
}
return 0;
}
|
#include<iostream>
#include<vector>
using namespace std;
int m;
int g[1000000];
int cnt=0;
std::vector<int> G;
void insertionSort(int array[], int n, int g){
int tmp,j;
for(int i=g;i<n;i++){
tmp = array[i];
j= i-g;
while(j>=0 && array[j]>tmp){
array[j+g] = array[j];
j=j-g;
cnt++;
}
array[j+g]=tmp;
}
}
void shellSort(int array[],int n){
cnt = 0;
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(array,n,G[i]);
}
}
int main(){
int n;
int array[1000001];
cin >> n;
for(int i=0;i<n;i++){
cin >>array[i];
}
shellSort(array,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 << array[i]<<endl;
}
return 0;
} |
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
int main()
{
long n = 0, g = 0, v = 0, cnt = 0, m = 0;
cin >> n;
vector <long> a(n);
for (long i = 0; i < n; i++)
cin >> a[i];
cnt = 0;
if (n < 3)
m = 1;
else
m = (int)(log(n) / log(3));
vector <long> G(m);
for (long k = 0; k < m; k++) {
G[k] = ((long)pow(3, m - k) - 1) / 2;
g = G[k];
for (long i = g; i < n; i++) {
long j = 0;
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;
}
}
cout << m << endl;
for (long i = 0; i < m - 1; i++)
cout << G[i] << " ";
cout << G[m - 1] << endl;
cout << cnt << endl;
for (long i = 0; i < n; i++)
cout << a[i] << endl;
return 0;
} |
#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 <iostream>
#include <vector>
using namespace std;
int n, cnt = 0;
vector<int> vec;
void insertionSort(int g){
int v, j;
for(int i = g;i < n; ++i){
v = vec[i];
j = i - g;
while(j >= 0 && vec[j] > v){
vec[j+g] = vec[j];
j = j - g;
cnt++;
}
vec[j+g] = v;
}
}
void shellSort(){
int m = 0, s = 1;
while((n/s) > 0){
s *= 2;
m++;
}
int G[20];
for(int k=0, t = 1; k<m; ++k){
G[k] = n/t;
t *= 2;
}
for(int i=0; i<m; ++i){
insertionSort(G[i]);
}
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 << vec[i] << endl;
}
}
int main(){
int num;
cin >> n;
for(int i=0; i<n; ++i){
cin >> num;
vec.push_back(num);
}
shellSort();
return 0;
}
|
#include <cstdio>
#include <vector>
using namespace std;
int n,cnt;
void insertion(int a[],int g){
for(int i=g;i<n;i++){
int v=a[i];
int j=i-g;
for(;j>=0&&a[j]>v;){
a[j+g]=a[j];
j-=g;
cnt++;
}
a[j+g]=v;
}
}
void shell(int a[]){
cnt=0;
int m=0,tem=1;
vector<int> g;
while(1){
g.push_back(tem);
m++;
tem=tem*3+1;
if(tem>=n) break;
}
printf("%d\n",m);
for(int i=m-1;i>=0;i--){
insertion(a,g[i]);
if(i!=m-1) printf(" ");
printf("%d",g[i]);
}
printf("\n%d\n",cnt);
}
int main(){
scanf("%d",&n);
int a[n];
for(int i=0;i<n;i++) scanf("%d",&a[i]);
shell(a);
for(int i=0;i<n;i++) printf("%d\n",a[i]);
printf("\n");
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int cnt = 0;
void display(int m, vector<int> g, int *a, int n){
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]);
}
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){
int t = 1;
vector<int> g;
while(t <= n) {
g.push_back(t);
t = 3*t + 1;
}
for(int i = g.size() - 1; i >= 0; i--)
insertionSort(a, n, g[i]);
display(g.size(), g, a, n);
}
int main(){
int n;
scanf("%d", &n);
int a[1000010];
for(int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
shellSort(a, n);
}
|
#include<iostream>
using namespace std;
int a[1000000];
long long int cnt = 0;
void insertionSort(int b[], int n, int g) {
for (int i = 0; i < n; i++) {
int k = b[i];
int m = i;
for (int j = i-g; j >= 0; j=j-g) {
if (b[j] <= k) break; //=号要搞上
m = j;
b[j + g] = b[j];
cnt++;
}
b[m] = k;
}
}
void shellSort(int b[], int n) {
int G[100000];
int all = 0;
for (int i = 1; i <= n; i = i * 3 + 1) { //n可以取等
G[all++] = i;
}
cout << all << endl;
for (int i = all - 1; i >= 0; i--) {
cout << G[i];
if(i!=0)cout<< " ";
insertionSort(b, n, G[i]);
}
cout << endl;
cout << cnt << endl;
}
int main(void) {
int n;
cin >> 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;
}
}
|
/*
* ALDS1_2_D.cpp
*
* Created on: Apr 25, 2018
* Author: 13743
*/
#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 = j - g;
cnt++;
}
a[j+g] = v;
}
}
int main() {
int n;
cin >> n;
int a[1000000];
for(int i=0; i<n; i++) {
cin >> a[i];
}
int g[100];
int m=0;
int gg = 1;
while(m < 100 && gg <= n) {
g[m] = gg;
m++;
gg = 3*gg + 1;
}
for(int i=0; i<m; i++) {
insertionSort(a, n, g[m-1-i]);
}
cout << m << endl;
cout << g[m-1];
for(int i=1; i<m; i++) {
cout << " " << g[m-1-i];
}
cout << endl;
cout << cnt << endl;
for(int i=0; i<n; i++) {
cout << a[i] << endl;
}
}
|
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
using namespace std;
long long cnt;
int l;
int A[100000000];
int n;
vector <int> G;
void insertion(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--)
{
insertion(A,n,G[i]);
}
}
int main ()
{
cin>>n;
for (int i=0;i<n;i++) scanf("%d",&A[i]);
cnt=0;
shell(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<stdio.h>
int insertionSort(int A[], int n, int g)
{
int i,j,v,k,c;
c=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=j-g;
c++;
}
A[j+g]=v;
}
return c;
}
void shellSort(int A[], int n)
{
int c,t,k;
c=0;
int i,j;
int G[100];
G[0]=1;
for(j=0; G[j]<=n; j++)
{
G[j+1]=3*G[j]+1;
}
for(i=j-1; i>=0; i--)
{
c = c+insertionSort(A, n, G[i]);
}
printf("%d\n",j);
for(t=j-1; t>=0; t--)
{
printf("%d",G[t]);
if(t > 0)
{
printf(" ");
}
}
printf("\n");
printf("%d\n",c);
for(k=0; k<n; k++)
{
printf("%d",A[k]);
if(k<n-1)
{
printf("\n");
}
}
}
int main(void)
{
int n,i;
scanf("%d",&n);
int A[n];
for(i=0; i<n; i++)
{
scanf("%d",&A[i]);
}
shellSort(A,n);
return 0;
}
|
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int cnt=0;
vector<int> G;
void insertsort(int A[],int n,int g){
for(int i = g; i<n;i++){
int 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 ;
}
void shellsort(int A[],int n){
//generate the G array
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]);
return ;
}
int main (){
int n ,A[1000010];
scanf("%d",&n);
for(int i=0;i<n;i++) scanf("%d",&A[i]);
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%d\n",cnt);
for(int i =0;i<n;i++) printf("%d\n", A[i]);
return 0;
}
|
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<iostream>
#include<stack>
#include<vector>
#include<queue>
#define MAX 1200000
using namespace std;
int G[MAX],m,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;
m=0;
for(int i=1;i<=n;i=3*i+1){
G[m]=i;
m++;
}
reverse(G,G+m);
for(int i=0;i<m;i++){
insertionSort(A,n,G[i]);
}
}
int main(){
int n;
int A[MAX];
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++){
if(i) cout<<" ";
cout<<G[i];
}
cout<<endl;
cout<<cnt<<endl;
for(int i=0;i<n;i++){
cout<<A[i]<<endl;
}
}
|
#include <iostream>
#include <vector>
#include <cstdio>
using namespace std;
int data[1000010],n;
long long ans;
vector <int> G;
int main()
{
cin >> n;
for(int i = 1; i <= n; ++i)
scanf("%d",&data[i]);
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)
{
for(int j = G[i]+1; j <= n; ++j)
{
int v = data[j];
int k = j-G[i];
while((k > 0) && (data[k] > v))
{
data[k+G[i]] = data[k];
k -= G[i];
++ans;
}
data[k+G[i]] = v;
}
}
cout << G.size() << endl << G[G.size()-1];
for(int i = G.size()-2; i >= 0; --i)
printf(" %d",G[i]);
cout << endl << ans << endl;
for(int i = 1; i <= n; ++i)
printf("%d\n",data[i]);
return 0;
}
|
#include<iostream>
#include<vector>
using namespace std;
int A[1000000];
int n, cnt;
vector<int> G;
void is(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 ss(){
for(int h=1;h<=n;h=3*h+1) G.push_back(h);
for(int i=G.size()-1;i>=0;--i) is(G[i]);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin>>n;
for(int i=0;i<n;++i) cin>>A[i];
ss();
cout<<G.size()<<endl;
for(int i=G.size()-1;i>=0;--i) cout<<G[i]<<(i?" ":"");
cout<<endl;
cout<<cnt<<endl;
for(int i=0;i<n;++i) cout<<A[i]<<endl;
} |
#include<iostream>
#include<stdio.h>
#include<math.h>
#include<string.h>
#include<cmath>
#include<vector>
#include<cstdio>
#include<algorithm>
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 = 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 <cmath>
using namespace std;
int main()
{
long n = 0, g = 0, v = 0, cnt = 0, m = 0;
cin >> n;
vector <long> a(n);
for (long i = 0; i < n; i++)
cin >> a[i];
cnt = 0;
if (n < 3)
m = 1;
else
m = (int)log2(n);
vector <long> G(m);
for (long k = 0; k < m; k++) {
G[k] = ((long)pow(2, m - k) - 1);
g = G[k];
for (long i = g; i < n; i++) {
long j = 0;
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;
}
}
cout << m << endl;
for (long i = 0; i < m - 1; i++)
cout << G[i] << " ";
cout << G[m - 1] << endl;
cout << cnt << endl;
for (long 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 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<cstdio>
#include<algorithm>
#include<cmath>
#include<vector>
using namespace std;
long long cnt;
int l;
int A[1000000];
int n;
vector<int> G;
void xxx(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 xx(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--)
{
xxx(A,n,G[i]);
}
}
int main()
{
cin>>n;
for(int i=0;i<n;i++)
scanf("%d",&A[i]);
cnt=0;
xx(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 <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]){
//printf("*%d*", 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;
long long cnt;
int A[1000000];
vector<int> G;
void is(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 ss(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--)
is(n,G[i]);
}
int main()
{
int n;
cin>>n;
for(int i=0;i<n;i++)
cin>>A[i];
cnt = 0;
ss(n);
cout<<G.size()<<endl;
for(int i=G.size()-1;i>=0;i--)
if(i==0) cout<<G[i]<<endl;
else cout<<G[i]<<' ';
cout<<cnt<<endl;
for(int i=0;i<n;i++)
cout<<A[i]<<endl;
return 0;
}
|
#include <iostream>
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 -= g;
cnt++;
}
a[j+g] = v;
}
return cnt;
}
void shellSort(int a[], int N){
int cnt = 0;
int G[100];
int m = 0;
int num = N;
if (num < 3){
G[0] = 1;
m++;
}
else{
while ( num > 1 ){
num = num/3+1;
G[m] = num;
m++;
}
}
cout << m << endl;
for ( int i = 0; i < m; i++){
cout << G[i] << " ";
cnt += insertionSort(a, N, G[i]);
}
cout << endl;
cout << cnt << endl;
for ( int i = 0; i < N; i++) cout << a[i] << endl;
}
int main(){
int N;
int a[1000000];
cin >> N;
for ( int i = 0; i < N; i++) cin >> a[i];
shellSort(a, N);
return 0;
}
|
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std ;
using vi = vector<int> ;
int cnt = 0 ;
void insertionsort(vi &a,int g){
for(int i=g;i<a.size();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(vi &g,vi &a){
for(int i=0;i<g.size();i++) insertionsort(a,g.at(i)) ;
}
int main(){
int n ; cin >> n ;
vi a(n) ;
for(int i=0;i<n;i++) cin >> a.at(i) ;
vi g ;
int i = 1 ;
while(i<=n){
g.push_back(i) ;
i = i*3+1 ;
}
reverse(g.begin(),g.end()) ;
cout << g.size() << endl ;
for(int i=0;i<g.size();i++){
cout << g.at(i) ;
if(i==g.size()-1) cout << endl ;
else cout << " " ;
}
shellsort(g,a) ;
cout << cnt << endl ;
for(int i=0;i<n;i++){
cout << a.at(i) << endl ;
}
}
|
#include<iostream>
#include<vector>
using namespace std;
long long cnt;
int l;
int A[1000000];
vector<int> G;
int n;
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<<cnt<<endl;
for(int i=0 ; i<n ; i++) cout<<A[i]<<endl;
return 0;
}
|
#include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
int a[100][100], b[100];
int main() {
int n, m; cin >> n >> m;
rep(i, n)rep(j, m)cin >> a[i][j];
rep(i, m)cin >> b[i];
rep(i, n) {
int sum = 0;
rep(j, m)sum += a[i][j] * b[j];
cout << sum << endl;
}
} |
#include <iostream>
using namespace std;
int main(){
int n,m,i,j;
int a[100][100];
int b[100];
int c[100];
cin >> n >> m;
for( i=0; i<n; i++ )
for( j=0; j<m; j++ ) cin >> a[i][j];
for( i=0; i<m; i++ ) cin >> b[i];
for( i=0; i<n; i++ ){
c[i] = 0;
for( j=0; j<m; j++ ){
c[i] += a[i][j]*b[j];
}
}
for( i=0; i<n; i++ ) cout << c[i] << endl;
return 0;
} |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;++i)
using namespace std;
typedef long long ll;
int main(){
int n,m;cin >> n >> m;
int a[n][m],b[m];
rep(i,n){rep(j,m)cin >> a[i][j];}
rep(i,m)cin >> b[i];
for(int i=0;i<n;++i){
int ans = 0;
for(int j=0;j<m;++j)ans += a[i][j]*b[j];
cout << ans << endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main(){
int n,m,a[100][100],b[100],c[100];
cin>>n>>m;
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
cin>>a[i][j];
}
}
for(int j=0;j<m;j++) cin>>b[j];
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
c[i]+=a[i][j]*b[j];
}
}
for(int i=0;i<n;i++) cout<<c[i]<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m,x=0;
cin>>n>>m;
int a[n][m];
for(int i=0; i<n; i++)
{
for(int i2=0; i2<m; i2++)
{
cin>>a[i][i2];
}
}
int b[m];
for(int i=0; i<m;i++)
{
cin>>b[i];
}
for(int i=0;i<n;i++)
{
for(int i2=0;i2<m;i2++)
{
x+=a[i][i2]*b[i2];
}
cout<<x<<endl;
x=0;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main(){
int n, m, i, j;
int sum = 0;
cin >> n >> m;
int a[n][m];
int b[m];
for(i=0; i<n; i++){
for(j=0; j<m; j++){
cin >> a[i][j];
}
}
for(j=0; j<m; j++){
cin >> b[j];
}
for(i=0; i<n; i++){
for(j=0; j<m; j++){
sum = sum + a[i][j] * b[j];
}
cout << sum << endl;
sum = 0;
}
} |
#include <iostream>
using namespace std;
int main(){
int n,m,i,j;
cin >> n >>m;
int a[n][m],b[m];
for (i=0;i<n;i++) {
for (j=0;j<m;j++) {
cin >> a[i][j];
}
}
for (j=0;j<m;j++) {
cin >> b[j];
}
int c[n];
for (i=0;i<n;i++) {
c[i]=0;
for (j=0;j<m;j++) {
c[i]+=a[i][j]*b[j];
}
cout << c[i] << endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main(void){
int a[100][100], b[100], ans[100]={0}, n, m;
cin >>n >>m;
for(int i=0; i<n; i++){
for(int j=0; j<m; j++){
cin >>a[i][j];
}
}
for(int i=0; i<m; i++){
cin >>b[i];
}
for(int i=0; i<n; i++){
for(int j=0; j<m; j++){
ans[i]+=a[i][j]*b[j];
}
cout <<ans[i] <<endl;
}
return 0;
} |
#include <iostream>
using namespace std;
int main(){
int n,m;
cin >> n >> m;
int a[100][100];
int b[100];
int c[100];
int i,j;
for(i = 0; i < n;i++){
for(j = 0;j < m;j++){
cin >> a[i][j];
}
}
for(i = 0;i < m;i++){
cin >> b[i];
}
for(i = 0;i < n;i++){
for(j = 0; j < m;j++){
c[i] += a[i][j]*b[j];
}
cout << c[i] << endl;
}
} |
#include<stdio.h>
int main(){
int n,m,i,j;
static int a[100][100]={0},b[110]={0},c[110]={0};
scanf("%d %d",&n,&m);
for(i=1;i<=n;i++){
for(j=1;j<=m;j++){
scanf("%d",&a[i][j]);
}
}
for(i=1;i<=m;i++){
scanf("%d",&b[i]);
}
for(i=1;i<=n;i++){
for(j=1;j<=m;j++){
c[i]+=a[i][j]*b[j];
}
}
for(i=1;i<=n;i++){
printf("%d\n",c[i]);
}
return 0;
} |
#include <iostream>
using namespace std;
int main(){
int n,m;
cin >> n >> m ;
int a[100][100],b[100];
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
cin >> a[i][j] ;
}
}
for(int i=0;i<m;i++){
cin >> b[i] ;
}
for(int i=0;i<n;i++){
int c=0;
for(int j=0;j<m;j++){
c+=a[i][j]*b[j];
}
cout << c << endl ;
}
return 0;
} |
#include <iostream>
using namespace std;
int main(void) {
int n, m, b[100], c[100][100], i, j;
long int ans;
cin >> n >> m;
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++) {
cin >> c[i][j];
}
}
for (i = 0; i < m; i++) {
cin >> b[i];
}
for (i = 0; i < n; i++) {
for (j = 0, ans = 0; j < m; j++) {
ans += c[i][j] * b[j];
}
cout << ans << endl;
}
return 0;
} |
#include <iostream>
#define M 100
using namespace std;
int main()
{
int m, n, i, j,sum;
int A[M][M];
int B[M];
cin >> m >> n;
for (i = 0; i < m; i++)
{
for (j=0;j<n;j++)
{
cin >> A[i][j];
}
}
for (i = 0; i < n; i++)
{
cin >> B[i];
}
for (i=0;i<m;i++)
{
sum=0;
for (j=0;j<n;j++)
{
sum += A[i][j] * B[j];
}
cout << sum << endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
int A[n][m];
int b[m];
for(int i=0;i<n;i++) {
for(int j=0;j<m;j++) {
cin >> A[i][j];
}
}
for(int i=0;i<m;i++) {
cin >> b[i];
}
for(int i=0;i<n;i++) {
int tmp = 0;
for(int j=0;j<m;j++) {
tmp += A[i][j] * b[j];
}
cout << tmp << endl;
}
return 0;
} |
#include<iostream>
using namespace std;
int main(){
int n,m;
int a[100][100],b[100],c[100];
cin >> n >> m;
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
cin>>a[i][j];
}
}
for(int i=0;i<m;i++){
cin>>b[i];
}
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
c[i]+=a[i][j]*b[j];
}
cout<<c[i]<<endl;
}
return 0;
} |
#include<iostream>
using namespace std;
int main() {
int a[101][101], b[101], c, i, j, n, m;
cin >> n >> m;
for (i = 1; i <= n; i++) {
for (j = 1; j <= m; j++) {
cin >> a[i][j];
}
}
for (i = 1; i <= m; i++) {
cin >> b[i];
}
for (i = 1; i <= n; i++) {
c = 0;
for (j = 1; j <= m; j++) {
c += a[i][j] * b[j];
}
cout << c << endl;
}
return 0;
} |
#include<iostream>
using namespace std;
int main()
{
int a[101][101],b[101];
int c;
int n,m;
cin>>n>>m;
for( int i=0; i<n; i++ ) {
for( int j=0; j<m; j++ ) {
cin>>a[i][j];
}
}
for( int i=0; i<m; i++ ) {
cin>>b[i];
}
for( int i=0; i<n; i++ ) {
c=0;
for( int j=0; j<m; j++ ) {
c+=(a[i][j]*b[j]);
}
cout<<c<<endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
int main()
{
int n, m;
cin >> n >> m;
vector<vector<int>> A(n,vector<int>(m));
vector<int> b(m);
rep(i, n)rep(j, m) cin >> A[i][j];
rep(i, m) cin >> b[i];
vector<int> ans(n);
int c;
rep(i, n)
{
c = 0;
rep(j, m)
{
c += A[i][j] * b[j];
}
cout << c << endl;
}
}
|
#include <iostream>
using namespace std;
int main(){
int A[101][101],b[101],n,m,c;
cin >> n >> m;
for(int i=0;i<n; i++){
for(int j=0;j<m;j++){
cin >> A[i][j];
}
}
for(int j=0;j<m;j++){
cin >> b[j];
}
for(int i=0;i<n; i++){
c=0;
for(int j=0;j<m;j++){
c += A[i][j]*b[j];
}
cout << c << "\n";
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int mat[105][105];
int v[105];
int main(){
int n,m;cin>>n>>m;
for(int i=0;i<n;i++)for(int j=0;j<m;j++)cin>>mat[i][j];
for(int i=0;i<m;i++)cin>>v[i];
for(int i=0;i<n;i++){
int res=0;
for(int j=0;j<m;j++)res+=mat[i][j]*v[j];
cout<<res<<endl;
}
return 0;
}
|
#include<iostream>
using namespace std;
int main(){
int n, m;
cin >> n >> m;
int a[100][100], b[100];
for(int k = 0; k < n*m; k++){
int i = k / m;
int j = k - m*i;
cin >> a[i][j];
}
for(int j = 0; j < m; j++){
cin >> b[j];
}
for(int i = 0; i < n; i++){
int c = 0;
for(int j = 0; j < m; j++) c += a[i][j] * b[j];
cout << c << endl;
}
return 0;
} |
#include<stdio.h>
int main()
{
int m,n,x;
int p[100][100];
int pp[100],wa;
scanf("%d",&n);scanf("%d",&m);
for(int i=0;i<n;i++){
for(int j=0;j<m;j++)
{
scanf("%d",&x);
p[i][j]=x;
}
}
for(int i=0;i<m;i++){
scanf("%d",&x);
pp[i]=x;
}
wa=0;
for(int i=0;i<n;i++){
for(int k=0;k<m;k++)
{
wa+=p[i][k]*pp[k];
}
printf("%d\n",wa);
wa=0;
}
return 0;
} |
#include<iostream>
using namespace std;
int main(){
int n,m,b[1000],a[1000][1000],SUM[1000];
for(int i=1;i<1000;i++){
SUM[i]=0;
}
cin>>n>>m;
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
cin>>a[i][j];
}
}
for(int i=1;i<=m;i++){
cin>>b[i];
}
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
SUM[i] += a[i][j]*b[j];
}
cout<<SUM[i]<<endl;
}
return 0;
} |
#include<iostream>
using namespace std;
int main(){
int n,m;
cin >>n>>m;
int a[100][100];
for(int i=0;i<n;i++)
for(int j=0;j<m;j++) cin>>a[i][j];
int b[100];
for(int i=0;i<m;i++) cin>>b[i];
int c[100] ={};
for(int i=0;i<n;i++)
for(int j=0;j<m;j++) c[i] +=a[i][j] * b[j];
for(int i=0;i<n;i++) cout<<c[i]<<endl;
return 0;
}
|
#include<iostream>
using namespace std;
int main(){
int n,m;
int a[100][100];
int b[100];
int c[100]={0};
cin>>n>>m;
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
cin>>a[i][j];
}
}
for(int i=0;i<m;i++){
cin>>b[i];
}
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
c[i]+=a[i][j]*b[j];
}
cout<<c[i]<<endl;
}
} |
#include<bits/stdc++.h>
#define _ ios_base::sync_with_stdio(0);cin.tie(0);
#define REP(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
array<int,10000> A;
array<int, 100> b;
int main(){ _;
int n,m;cin>>n>>m;
REP(i,n*m)
cin>>A[i];
REP(i,m)
cin>>b[i];
REP(i,n){
int sum=0;
REP(j,m)
sum+=A[i*m+j]*b[j];
cout<<sum<<endl;
}
} |
#include <bits/stdc++.h>
#define REP(i,n) for(int i=0;i<n;i++)
using namespace std;
int main(){
int n,m;
cin>>n>>m;
valarray<int> b(0,m);
vector<valarray<int> > A(n,b);
REP(i,n) REP(j,m) cin>>A.at(i)[j];
REP(i,m) cin>>b[i];
REP(i,n){
valarray<int> c(m);
c = A.at(i)*b;
cout<<c.sum()<<endl;}
return 0;
} |
#include <stdio.h>
#include <math.h>
int a[100][100],b[100],c[100];
int main(){
int n,m;
scanf("%d %d",&n,&m);
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
scanf("%d",&a[i][j]);
}
}
for(int i=0;i<m;i++){
scanf("%d",&b[i]);
}
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
c[i]+=a[i][j]*b[j];
}
printf("%d\n",c[i]);
}
return 0;
} |
#include<iostream>
using namespace std;
signed main(){
int n,m,c=0;
cin>>n>>m;
int a[110][110],b[100];
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
cin>>a[i][j];
}
}
for(int i=0;i<m;i++){
cin>>b[i];
}
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
c+=a[i][j]*b[j];
}
cout<<c<<'\n';
c=0;
}
return(0);
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.