вариант Задание на картинке

Var a1,a2,a3,a4,a5,a6,a7,a8,k:integer;
begin
k:=0;
read (a1,a2,a3,a4,a5,a6,a7,a8);
if (a1>0) and (a2>0) and (a3>0) and (a4>0) and (a5>0) and (a6>0) and (a7>0) and (a8>0) then
begin
if (a1 mod 3 = 0) and (a1 mod 10 = 4) then k:=k+1;
if (a2 mod 3 = 0) and (a2 mod 10 = 4) then k:=k+1;
if (a3 mod 3 = 0) and (a3 mod 10 = 4) then k:=k+1;
if (a4 mod 3 = 0) and (a4 mod 10 = 4) then k:=k+1;
if (a5 mod 3 = 0) and (a5 mod 10 = 4) then k:=k+1;
if (a6 mod 3 = 0) and (a6 mod 10 = 4) then k:=k+1;
if (a7 mod 3 = 0) and (a7 mod 10 = 4) then k:=k+1;
if (a8 mod 3 = 0) and (a8 mod 10 = 4) then k:=k+1;
writeln (k);
end else
writeln ('Неверный ввод');
end.

#include <iostream>

using namespace std;

int main()

{

int sum = 0;

int composition = 1;

bool plusSeq = 1;

int n = 0;

cout << "Size array - ";

cin >> n;

int* a = new int[n];

for (int i = 0; i < n; i++)

{

 a[i] = -10 + rand() % 21;

 sum += a[i];

 composition *= a[i];

 cout << a[i] << "  ";

}

 

for (int i = 0; i < n; i++)

{

 if (a[i] < 0)

  a[i] *= a[i];

}

for (int i = 1; i < n; i++)

{

 if (a[i] < a[i - 1])

 {

  plusSeq = 0;

  break;

 }

}

if (plusSeq)

 cout << "\nSum = " << sum;

else

 cout << "\nComposition = " << composition;

delete[]a;

return 0;

}

Объяснение: