program l;
uses crt;
var
a,b,z:real;
d,r:char;
g:boolean;
begin
clrscr;
highvideo;
writeln('                          CALCULATOR                     ');
write('                            by -=[SuRiV]=-                     ');
delay(2000);
clrscr;
g:=false;
repeat
normvideo;
writeln;
write('‚ўҐ¤ЁвҐ ЇҐаў®Ґ зЁб«® ');
readln( a );
write('‚ўҐ¤ЁвҐ ўв®а®Ґ зЁб«® ');
readln( b );
write('‚ўҐ¤ЁвҐ §­ Є ¤Ґ©бвўЁп ');
readln(d);
case d of
'+': z:=a+b;
'-': z:=a-b;
'*': z:=a*b;
'/': z:=a/b;
else
g:=true;
write('Ќ ¤® Ўл«® ўўҐбвЁ §­ Є ¤Ґ©бвўЁп!');
delay(2000);
halt;
end;
writeln('ЋвўҐв:',a:5 :1,d,b:5 :1,' = ',z:5 :2);
write('…йс а §®Є(Y/N)');
readln®;
if r='n' then
begin
write('Љ «мЄг«пв®а § ўҐаи Ґв бў®о а Ў®вг...');
g:=true;
end;
until g;
readln;
end.

program l;
uses crt;
var
a,b,z:real;
d,r:char;
g:boolean;
begin
clrscr;
highvideo;
writeln('                          CALCULATOR                     ');
write('                            by -=[SuRiV]=-                     ');
delay(2000);
clrscr;
g:=false;
repeat
normvideo;
writeln;
write('‚ўҐ¤ЁвҐ ЇҐаў®Ґ зЁб«® ');
readln(a);
write('‚ўҐ¤ЁвҐ ўв®а®Ґ зЁб«® ');
readln(b);
if b=0 then halt;
write('‚ўҐ¤ЁвҐ §­ Є ¤Ґ©бвўЁп ');
readln(d);
case d of
'+': z:=a+b;
'-': z:=a-b;
'*': z:=a*b;
'/': z:=a/b;
else
g:=true;
write('Ќ ¤® Ўл«® ўўҐбвЁ §­ Є ¤Ґ©бвўЁп!');
delay(2000);
halt;
end;
writeln('ЋвўҐв:',a:5 :1,d,b:5 :1,' = ',z:5 :2);
write('…йс а §®Є(Y/N)');
readln®;
if r='n' then
begin
write('Љ «мЄг«пв®а § ўҐаи Ґв бў®о а Ў®вг...');
g:=true;
end;
until g;
readln;
end.

program l;
uses crt;
begin
sound(120);
delay(60);
nosound;
readln;
end.

program l;
uses crt;
begin
sound(120);
delay(9999);
nosound;
readln;
end.

program l;
uses crt;
begin
  sound(1200);
  delay(10000);
  nosound;
  readln;
end.

program l;
uses crt;
begin
sound(1200);
delay(5000);
nosound;
readln;
end.

for i := 1 to n do
  for j := 1 to m do
    if a[i, j] = x then
      begin
        Writeln('Found.');
        goto Done;
      end;
Writeln('Not found.');
Done:

i:=0;j:=0;
repeat
  Inc(i);
   repeat
      Inc(j);
   until (a[i,j]=x) or (j:=m);
until (a[i,j]=x) or (i:=n);
if a[i,j]=x then writeln('Found') else writeln('Not found');

for i := 1 to n do
  for j := 1 to m do
    if a[i, j] = x then
      begin
        Writeln('Found.');
        goto Done;
      end;
Writeln('Not found.');
Done:

OK:=false;
i:=0;
repeat
inc(i);
j:=0;
    repeat
    inc(j);
    OK:=(a[i,j]=x);
    until OK or (j=m);
until OK or (i=n);

if OK then writeln('found.') else writeln('Not found.');