:
, . .
:
For t:=1 to n-1 do
begin
max:=a[t]; k:=t;
for i:=t+1 to n do
if a[i]>max then begin max:=a[i]; k:=i;
end;
x:=a[t];
a[t]:=a[k];
a[k]:=x;
end;
:
, . , .
( ):
:
For i:=1 to n-1 do
For j:=1 to n-i do if a[j]>a[j+1] then begin
x:=a[j];
a[j]:=a[j+1];
a[j+1]:=x
end;
: i- , , i-1 , , . .
A[1] ≤A[2] ≤ ≤A[i-1] ( ). i- , , , . A[i] . .
:
:
For i:=2 to n do
begin
x:=a[i]; j:=i-1;
While (j>0) and (x<a[j]) do
begin a[j+1]:=a[j]; j:=j-1; end;
a[j+1]:=x;
end;
1. (acmp.ru)
| INPUT.TXT | OUTPUT.TXT | |
| 3 9 -20 14 | -20 9 14 | |
| 10 12 7 92 5 18 4 32 48 11 74 | 4 5 7 11 12 18 32 48 74 92 |
, . , -100 100 . N . , , . . . .
: INPUT.TXT N - (N ≤ 106). , 100 .
|
|
|
: OUTPUT.TXT , .
2. (acmp.ru)
, , .
| INPUT.TXT | OUTPUT.TXT | |
| 4 10 20 30 7 30 00 13 59 59 13 30 30 | 7 30 0 10 20 30 13 30 30 13 59 59 |
INPUT.TXT N (1<=N<=100), N N . 3 - ( 0 23), ( 0 59) ( 0 59).
OUTPUT.TXT , .
3.
. , - ( < 1000). , .
| INPUT.TXT | OUTPUT.TXT | |
| 20 29 15 |
: INPUT.TXT (1<=<=20). . , . .
: OUTPUT.TXT .
4.
, , . : , . , . , , . , . 4, , .
INPUT.TXT N (1<=N<=100). N , . 1 31. .
| input.txt | output.txt | |
| 5 4 16 19 31 2 | 19 31 4 16 2 YES | |
| 8 29 4 7 12 15 17 24 1 | 29 7 15 17 1 4 12 24 NO |
OUTPUT.TXT , , , , . YES, NO . , . , .
5.
, . , , . , . . , , , . , , . , . , , ( , , , , , ...). , , ( ) , .
|
|
|
, - . , , , , , . , ( ).
| input.txt | output.txt | |
| 3 2 t 3 p 4 g | 4 g 3 p 2 t | |
| 5 2340000 g 4576 p 2 t 32 t 2000000 g | 2 t 2000000 g 2340000 g 32 t 4576 p |
, , . , , , , ?
: input.txt N (1<=N<=1000) . N ( ) , , . 1 106 . . : g (), p (), t (). , 1 = 16380 , 1 = 106 .
: output.txt N , . . , . , , .
