Возрастание:
const n=10;
var a:array [1..n] of integer;
i,j,v:integer;
begin
write(' Исходный массив: ');
for i:=1 to n do
begin
a[i]:=random(90)+10;
write(a[i],' ')
end;
writeln;
for i:=1 to n do
for j:=1 to n-i do
if a[j]>a[j+1] then
begin
v:=a[j];
a[j]:=a[j+1];
a[j+1]:=v
end;
write('Отсортированный массив: ');
for i:=1 to n do write(a[i],' ');
end.
Убывание:
const n=10;
var a:array [1..n] of integer;
i,j,v:integer;
begin
write(' Исходный массив: ');
for i:=1 to n do
begin
a[i]:=random(90)+10;
write(a[i],' ')
end;
writeln;
for i:=1 to n do
for j:=1 to n-i do
if a[j]<a[j+1] then
begin
v:=a[j];
a[j]:=a[j+1];
a[j+1]:=v
end;
write('Отсортированный массив: ');
for i:=1 to n do write(a[i],' ');
end.
public class Task3 {
public static void main(String[] args) {
int x;
for (int i = 200; i <= 299; i++) {
x = i;
x -= 3;
x = reverseInt(x);
if (i / 2 == x) {
System.out.println("i = " + i);
return;
}
}
}
public static int reverseInt(int input) {
long reversedNum = 0;
long input_long = input;
while (input_long != 0) {
reversedNum = reversedNum * 10 + input_long % 10;
input_long = input_long / 10;
}
if (reversedNum > Integer.MAX_VALUE || reversedNum < Integer.MIN_VALUE) {
throw new IllegalArgumentException();
}
return (int) reversedNum;
}
}
begin
write('A: ');
readln(a);
write('B: ');
readln(b);
for x:=a to b do
begin
if (x>=10) and (x<=99) then
if x mod 6 = 2 then
write(x,' ');
end;
end.
2) var a,b,x,s :integer;
begin
write('A: ');
readln(a);
write('B: ');
readln(b);
for x:=a to b do
if (x=21) or (x=42) or (x=63) or (x=84) then s:=s+x;
write(s);
end.