var n, k, s: integer; a: array of integer; function IsPrime(n: integer): boolean; var i: integer; begin if n <= 1 then Exit(False) else if n <= 3 then Exit(True) else if (n mod 2 = 0) or (n mod 3 = 0) then Exit(False); i := 5; while (i * i) <= n do begin if (n mod i = 0) or (n mod (i + 2) = 0) then Exit(False); i := i + 6; end; Exit(True); end; begin s := 0; write('n = '); readln(n); SetLength(a, n); for k := 0 to (n - 1) do begin write('a[', k, '] = '); readln(a[k]); if IsPrime(k) then s := s + a[k]; end; writeln('ответ: ', s); end.
function check_is(a, b, c: integer): boolean; begin if a >= b + c then check_is := false else if b >= a + c then check_is := false else if c >= a + b then check_is := false else check_is := true; end; procedure check_how(a, b, c: integer);begin if ((a = b) and (b = c) and (a = c)) then writeln('равносторонний') else if ((a = b) or (b = c) or (a = c)) then writeln('равнобедренный') else writeln('разносторонний'); end;
begin writeln('Введите стороны треугольника'); read(a, b, c); if check_is(a, b, c) then check_how(a, b, c) else writeln('Нет такого треугольника!'); end.
===== PascalABC.NET =====
begin
var n := ReadInteger;
ReadSeqInteger(n)
.Where(p -> p.InRange(10,99))
.DefaultIfEmpty
.Average
.Println
end.