1. var a: array[1..10] of integer; i, kol: Integer; Begin for i := 1 to 10 do read(a[i]); kol := 0; for i := 1 to 10 do if a[i] mod 2=0 then begin kol := kol + 1; write(a[i],' '); end; writeln; writeln(kol); End. 2. var a: array[1..10] of integer; i, kol: Integer; Begin for i := 1 to 10 do read(a[i]); kol := 0; for i := 1 to 10 do if a[i] > 9 then begin kol := kol + 1; write(a[i],' '); end; writeln; writeln(kol); End. 3. var a: array[1..10] of integer; i: Integer; Begin for i := 1 to 10 do read(a[i]); for i := 1 to 10 do if a[i] mod 2=0 then write(a[i],' '); for i := 1 to 10 do if a[i] mod 2=1 then write(a[i],' '); End. 4. var a: array[1..10] of integer; i, r: Integer; Begin for i := 1 to 10 do read(a[i]); i := 1; while i < 10 do if a[i+1] < a[i] then begin r := a[i+1]; a[i+1] := a[i]; a[i] := r; i := 1; end else i := i + 1; for i := 1 to 10 do if a[i] mod 2=0 then write(a[i],' '); for i := 1 to 10 do if a[i] mod 2=1 then write(a[i],' '); End. 5. var a: array[1..10] of integer; i, kol: Integer; Begin for i := 1 to 10 do read(a[i]); for i := 1 to 10 do if a[i] mod 10 = 5 then kol := kol + 1; writeln(kol); End.
{ Если что, часть программы не нужна для построения цепочки. Она просто иллюстрирует, что полученный результат верен. }
var sq : array[0..999] of array[0..9] of boolean; co : array[0..999] of integer; ar : array[1..10003] of 0..9; i,j: integer; x: integer; t : boolean; begin for i := 0 to 999 do begin for j := 0 to 9 do sq[i][j] := false; co[i] := 0; end; for i := 1 to 3 do ar[i] := 0; i := 3; t := true; {write('000');} while t do begin i := i + 1; x := ar[i-3]*100 + ar[i-2]*10 + ar[i-1]; if co[x] >= 10 then t := false else begin j := 1; while sq[x][j] do j := (j + 1) mod 10; ar[i] := j; sq[x][j] := true; co[x] := co[x] + 1; {write(j)} end; end; {writeln;} writeln('Length: ',i - 1);
{просто чтобы убедиться} for i := 0 to 999 do for j := 0 to 9 do sq[i][j] := false;
t := true; j := 0; i := 1; while (i <= 10000) and t do begin x := ar[i] * 100 + ar[i+1] * 10 + ar[i+2]; if sq[x][ar[i+3]] then t := false else begin sq[x][ar[i+3]] := true; j := j + 1; end; i := i + 1 end; if t and (j = 10000) then write('Confirmed') end.
0,0(0 оценок)
Полный доступ
Позволит учиться лучше и быстрее. Неограниченный доступ к базе и ответам от экспертов и ai-bota
Оформи подписку