Program esep; var i,j,k,n,sum:integer; input,output:text; a:array[1..100] of integer; flag:boolean; begin flag:=false; Assign(Input,'d.in'); reset(input); readln(input,n); assign(output, 'd.out'); rewrite(output); writeln('Input elements'); readln (n); for i:=1 to n do read(a[i]); for i:=1 to n do for j:=1 to n do for k:=1 to n do if (i<>j) and (j<>k) and (i<>k) then if a[i]+a[j]+a[k]=0 then begin writeln (output,'Yes'); flag:=true; halt; end; if flag=false then writeln(output,'No'); close(input); close(output); end.
{вот правильное решение я там забыл то чтобы подсчитывать число букв a} var s: string; i, id, len, max, count,q: byte; begin q:=0; readln(s); len := length(s); max := 0; id := 0; count := 0; for i:=1 to len do if s[i] <> ' ' then count := count + 1 else begin if count > max then begin max := count; id := i - count; end; count := 0 end; if count > max then begin max := count; id := i - count; end; for i:=id to id+max do if s[i] = 'a' then begin q:=q+1; s[i] := 'b'; writeln(s,' ' , q); end; end.
i: integer;
begin
for i:=10 to 99 do
if (i mod 17 = 0) and ((i mod 10 = 7) or (i mod 10 = 9)) then
writeln(i);
end.