Program massiv;
var <span> mass = array [1..15] of integer;</span><span>
i, max, n_max: integer;</span>
begin<span>
{заполнение массива}
</span><span> for i:= 1 to 15 do mass[i] = (random(32)-15) * 3;</span><span>
max := 0;
</span><span> n_max := 0;
</span><span> {нахождение максимума, вывод на экран}
</span><span> for i:= 1 to 15 do</span><span>
begin</span><span>
if mass[i] > max then</span><span>
begin</span><span>
max := mass[i];
</span><span> n_max := i;</span><span>
end;</span><span>
write(mass[i], ' ');</span><span>
end;</span><span>
writeln('Индекс максимального: ', n_max);
</span><span>end.</span>
Var a:array[1..4,1..6] of integer;
i,j,p,n:integer;
begin
p:=1;
n:=1;
for i:=1 to 4 do
for j:=1 to 6 do
read(a[i,j]);
for j:=1 to 6 do
p*=a[3,j];
writeln(p);
<span>end.</span>
Using System;
public class Test
{
public static void Main()
{
double a, b, x, p=1;
int k=0;
Console.Write("a = ");
a = double.Parse(Console.ReadLine());
Console.Write("b = ");
b = double.Parse(Console.ReadLine());
for (int i=1; i <= 8; i++) {
x = double.Parse(Console.ReadLine());
if ((x>=a)&&(x<=b)){
k++; p*=x;
}
}
Console.WriteLine("k = {0} p = {1}", k,p);
Console.ReadKey();
}
}
Пример:
a = 3
b = 8
7
9
2
0
6
4
3
5
k = 5 p = 2520
нц
для i от 1 до 2
S := 0
нц
для j oт 2 до 3
нц для k oт 1 до 2
S := S+i+j+k
кц
кц
кц
S = (2 + 2 + 1) + (2 + 2 + 2) + (2 + 3 + 1) + (2 + 3 + 2) = 5 + 6 + 6 + 7 = 24