Решение задачи Array 103

#include <stdio.h>
int main(void)
{
    int a[10];
    int n;
    printf("N: ");
    scanf("%i",&n);
 
    int i;
    for (i=0; i<n; ++i){
        printf("a[%i] : ",i+1);
        scanf("%i",&a[i]);
    }
 
    int amin=0,amax=0;
    for (i=0; i<n; ++i){
        if (a[amin]>a[i]) {
            amin=i;
        }
        if  (a[amax]<a[i]){
            amax=i;
        }
    }
    if (amax>amin) amax++;
 
    n++;
    for (i=n-1; i>=amin; --i) a[i]=a[i-1];
    a[amin]=0;
 
    n++;
    for (i=n-1; i>amax+1; --i) a[i]=a[i-1];
    a[amax+1]=0;
 
    for (i=0; i<n; ++i) printf("  %i: %i\n",i+1,a[i]);
 
    return 0;
}

import random

N = random.randrange(2,21)
a = [random.randrange(1,50) for i in range(N)]
##N = 6
##a = [30, 21, 17, 1, 6, 39]
##N = 15
##a = [42, 17, 43, 3, 35, 32, 5, 31, 37, 9, 17, 41, 18, 42, 10]

print("N = ", N)
print("Array:\n",a)

max_val = max(a)
max_idx = a.index(max_val)

min_val = min(a)
min_idx = a.index(min_val)

print("Max:",max_val,"; Index:",max_idx)
print("Min:",min_val,"; Index:",min_idx)

if min_idx < max_idx :    
    print("Modified Array 1:\n",a[:min_idx] + [0] + a[min_idx:max_idx+1] + [0] + a[max_idx+1:])
else :
    print("Modified Array 1:\n",a[:max_idx+1] + [0] + a[max_idx+1:min_idx] + [0] + a[min_idx:])
    
if min_idx < max_idx :    
    K = min_idx
    a.append(-999)
    for i in range(N,K,-1) :
        a[i] = a[i-1]
    a[K] = 0
    
    K = max_idx
    a.append(-999)
    for i in range(N+1,K+2,-1) :
        a[i] = a[i-1]
    a[K+2] = 0
else :
    K = max_idx
    a.append(-999)
    for i in range(N,K,-1) :
        a[i] = a[i-1]
    a[K+1] = 0
    
    K = min_idx
    a.append(-999)
    for i in range(N+1,K+1,-1) :
        a[i] = a[i-1]
    a[K+1] = 0

print("Modified Array 2:\n",a)
print("Length:\n",len(a))
									

program Array103;
var
  a : array[1..10] of Integer;
  N,i,Amax,Amin:Integer;
 
begin
  Write('N: ');
  Readln(N);
 
  Writeln('A: ');
  for i:=1 to N do
   begin
    write(i,' :');
    readln(a[i]);
   end;
 
  Amin:=1;
  for i:=1 to N do if a[Amin]>a[i] then Amin:=i;
 
  N:=N+1;
  for i:=N downto Amin do a[i]:=a[i-1];
  a[Amin]:=0;
 
  Amax:=1;
  for i:=1 to N do if a[Amax]<a[i] then Amax:=i;
 
  N:=N+1;
  for i:=N downto Amax+1 do a[i]:=a[i-1];
 
  a[Amax+1]:=0;
 
  Writeln(N);
  for i:=1 to N do writeln(i,' :',a[i]);
end.