#include <iostream>
#include <cmath>
#include <algorithm>
#pragma GCC optimize("Ofast")
#define ll long long
#define ld long double
using namespace std;
signed main() {
const ll n = 3, m = 4;
ll cnt = 0, sum = 0;
ll a[n][m];
for(ll i = 0; i < n; i++)
for(ll j = 0; j < m;j++){
cin >> a[i][j];
if(a[i][j] > 0)
cnt++;
if(i == j)
sum += a[i][j];
}
cout << "Amount of positive elements is: " << cnt << "\n";
cout << "Sum of elements on the main diagonal is: " << sum;
}
1)
var
i, n, a: integer;
begin
readln(n);
for i:= 1 to n do
begin
writeln('Введите число a: ');
readln(a);
if a mod 10 = 4) and (a > 10) and (a < 100) then
writeln(a);
writeln('Введите кол-во чисел n: ');
writeln('В данный момент n = ', n);
readln(n);
if n = 0 then break;
end;
end.
2)
var
i, n, a, z, min: integer;
begin
readln(n);
z:= 0;
for i:= 1 to n do
begin
writeln('Введите число a: ');
readln(a);
z:= z + 1;
if (i <> 0) and (z = 1) then
min:= a;
if (a < min) then min:= a;
writeln('Введите кол-во чисел n: ');
writeln('В данный момент n = ', n);
readln(n);
if n = 0 then break;
end;
writeln(min)
end.
