Дано програму: var a: array [1.8] of Integer, Mk: Integer, begin {... } M= a[1]); For k = 2 to s do If M< a[k] Then M = a[k], [...] Скільки разів буде виконаний оператор M = a[k] для масиву (3, 8, 7, 9,4 10, 2, 12)?
Var f: file of integer; i, n, x, t, k, max: integer; s: integer;
begin randomize; write('n='); readln(n);
assign(f, 'numbers.dat'); rewrite(f);
max := -1; for i := 1 to n do begin x := random(4800) + 20; write(f, x); write(x, ' '); if x > max then max := x; end; writeln;
seek(f, 0); k := 0; while not eof(f) do begin read(f, x); t := x; s := 0; while t > 0 do begin s := s + sqr(t mod 10); t := t div 10; end; if x mod s = 0 then k := k + 1; if x > max - 50 then write(x, ' '); end; writeln;
// PascalABC.Net
var vowel: set of char = ['а', 'у', 'о', 'ы', 'и', 'э', 'я', 'ю', 'ё', 'е'];
s, substr: string;
begin
s := 'кот в сапогах';
var words := s.Split(' ');
for var i := 0 to words.length - 1 do
begin
for var j := 1 to words[i].Length do
if words[i][j] in vowel then
begin
substr := Copy(words[i], 1, j-1);
Delete(words[i], 1, j-1);
words[i] += substr;
break;
end;
words[i] += 'циус';
end;
writeln(words.JoinIntoString(' '));
end.
f: file of integer;
i, n, x, t, k, max: integer;
s: integer;
begin
randomize;
write('n=');
readln(n);
assign(f, 'numbers.dat');
rewrite(f);
max := -1;
for i := 1 to n do
begin
x := random(4800) + 20;
write(f, x);
write(x, ' ');
if x > max then max := x;
end;
writeln;
seek(f, 0);
k := 0;
while not eof(f) do
begin
read(f, x);
t := x;
s := 0;
while t > 0 do
begin
s := s + sqr(t mod 10);
t := t div 10;
end;
if x mod s = 0 then k := k + 1;
if x > max - 50 then write(x, ' ');
end;
writeln;
writeln(k);
end.