1. uses crt; var n:string; begin read(n); writeln(strtoint(n[1])*strtoint(n[2])*strtoint(n[3])); end. 2. uses crt; var n,i:integer; res:double; begin read(n); for i:=1 to n do res:=res+cos(1/i); writeln(res:5:3); end. 3. uses crt; var n,i:integer; mult:real; a:array[1..100] of real; begin mult:=1; writeln('Input N and elements of array.'); read(n); for i:=1 to n do begin read(a[i]); if i mod 2=0 then mult:=mult*a[i]; end; writeln(mult); end. 4. uses crt; var n,i,sum:integer; a:array[1..100] of integer; begin writeln('Input N and elements of array.'); read(n); for i:=1 to n do read(a[i]); i:=1; while (a[i]<>0) and (i<=n) do begin if a[i] mod 2=0 then sum:=sum+a[i]; i:=i+1; end; writeln(sum); end.
Крутить это все в уме - чистое наказание. Проще было написать программу.
// PascalABC.NET 3.2, сборка 1417 от 28.03.2017 // Внимание! Если программа не работает, обновите версию!
type Pinnacle=record St:Stack<integer>; No:integer; constructor (n:integer); begin St:=new Stack<integer>; No:=n end; end;
var MoveNo:integer;
procedure MoveDisk(s1,s2:Pinnacle); begin if s1.St.Count>0 then begin MoveNo+=1; s2.St.Push(s1.St.Pop); Writeln(MoveNo:3,': №',s2.St.Peek,' ',s1.No,' -> ',s2.No) end end;
procedure MovePinnacle(n:integer; s1,s2,s3:Pinnacle); begin if n=0 then exit; MovePinnacle(n-1,s1,s3,s2); MoveDisk(s1,s2); MovePinnacle(n-1,s3,s2,s1); end;
begin var n:=5; var p1:=new Pinnacle(1); var p2:=new Pinnacle(2); var p3:=new Pinnacle(3); Range(n,1,-1).ForEach(i->p2.St.Push(i)); MoveNo:=0; MovePinnacle(n,p2,p3,p1); end.
uses crt;
var n:string;
begin
read(n);
writeln(strtoint(n[1])*strtoint(n[2])*strtoint(n[3]));
end.
2.
uses crt;
var n,i:integer;
res:double;
begin
read(n);
for i:=1 to n do
res:=res+cos(1/i);
writeln(res:5:3);
end.
3.
uses crt;
var n,i:integer;
mult:real;
a:array[1..100] of real;
begin
mult:=1;
writeln('Input N and elements of array.');
read(n);
for i:=1 to n do
begin
read(a[i]);
if i mod 2=0 then
mult:=mult*a[i];
end;
writeln(mult);
end.
4.
uses crt;
var n,i,sum:integer;
a:array[1..100] of integer;
begin
writeln('Input N and elements of array.');
read(n);
for i:=1 to n do
read(a[i]);
i:=1;
while (a[i]<>0) and (i<=n) do
begin
if a[i] mod 2=0 then
sum:=sum+a[i];
i:=i+1;
end;
writeln(sum);
end.