C++ дан текст. заменить все предлоги на ! (кол-во ! должно соответствовать кол-ву букв в предлоге)​

375 киболайт = 375 * 1024 * 8 = 3072000 бит

3072000 : 128000 = 24 с

ответ. понадобится 24 с.

program xxx;

    var i, n : integer;

              a, s : real;

                    b : array [1..20] of real;

begin

  writeln('введите число а=');

  readln(a);

  writeln('введите размерность массива n=');

  readln(n);

  write('введите элементы массива b: ');

  for i: =1 to n do

        readln(b[i]);

  writeln('исходный массив b: ');

  for i: =1 to n do

        writeln(b[i]);

  s: =0;

  for i: =1 to n do

      if b[i] > a then s: =s+b[i];

  writeln('сумма элементов =', s);

  readln

end.

а)

var

    p,d,h: real;

begin

    readln(h);

    p: =1200*9.8*h;

    writeln(p);

end.

б)

var

    m,h,r: real;

begin

    readln(h);

    readln(r);

    m: =1200*3.14*h*r*r;

    writeln(m);

end;

в) необходимы дополнительные условия количество сосудов

если принять количество сосудов за k тогда

var

    i,k: integer;

    m,h,r,s: real;

begin

    readln(k);

    s: =0;

    for i: =1 to k do

    begin

            readln(h);

            readln(r);

            m: =1200*3.14*h*r*r;

            s: =s+m;

    end;

    writeln(s);

end.

type oras = (chisinau, orhei, balti, tigina, tiraspol); zi = (l, ma, mi, j, v, s, d); consum = array [oras, zi] of real; var c : consum; r : oras; z : zi; i,k : integer; sum,min_r,max_r,min_z,max_z: real; n_max_r,n_min_r,n_max_z,n_min_z: integer; begin r: =chisinau; randomize; for i: =1 to 5 do begin z: =l; for k: =1 to 7 do begin c[r,z]: =random*100; z: =succ(z); end; r: =succ(r); end; r: =chisinau; for i: =1 to 5 do begin z: =l; case ord(r) of 0: writeln('chisinau'); 1: writeln('orhei'); 2: writeln('balti'); 3: writeln('tigina'); 4: writeln('tiraspol'); end; for k: =1 to 7 do begin write(c[r,z]: 6: 2); z: =succ(z); end; r: =succ(r); writeln; end; writeln('vsego za nedelu'); r: =chisinau; min_r: =99999; max_r: =0; n_min_r: =-1; n_max_r: =-1; for i: =1 to 5 do begin z: =l; case ord(r) of 0: write('chisinau sum='); 1: write('orhei sum='); 2: write('balti sum='); 3: write('tigina sum='); 4: write('tiraspol sum='); end; sum: =0; for k: =1 to 7 do begin sum: =sum+c[r,z]; z: =succ(z); end; if sum> max_r then begin max_r: =sum; n_max_r: =ord(r); end; if sum< min_r then begin min_r: =sum; n_min_r: =ord(r); end;

r: =succ(r);

writeln(sum: 8: 2); end; writeln('po dnyam nedeli'); z: =l; min_z: =99999; max_z: =0; n_min_z: =-1; n_max_z: =-1;

for k: =1 to 7 do begin r: =chisinau; case ord(z) of 0: write('l sum='); 1: write('ma sum='); 2: write('mi sum='); 3: write('j sum='); 4: write('v sum='); 5: write('s sum='); 6: write('d sum='); end; sum: =0; for i: =1 to 5 do begin sum: =sum+c[r,z]; r: =succ(r); end; if sum> max_z then begin max_z: =sum; n_max_z: =ord(z); end; if sum< min_z then begin min_z: =sum; n_min_z: =ord(z); end; z: =succ(z); writeln(sum: 8: 2); end; writeln('gorod c maximalnim potrebleniem'); r: =chisinau; for i: =1 to 5 do begin if ord(r)=n_max_r then case ord(r) of 0: writeln('chisinau'); 1: writeln('orhei'); 2: writeln('balti'); 3: writeln('tigina'); 4: writeln('tiraspol'); end; r: =succ(r); end; writeln('gorod c minimalnim potrebleniem'); r: =chisinau; for i: =1 to 5 do begin if ord(r)=n_min_r then case ord(r) of 0: writeln('chisinau'); 1: writeln('orhei'); 2: writeln('balti'); 3: writeln('tigina'); 4: writeln('tiraspol'); end; r: =succ(r); end;

writeln('den c maximalnim potrebleniem'); z: =l; for k: =1 to 7 do begin if ord(z)=n_max_z then case ord(z) of 0: writeln('l'); 1: writeln('ma'); 2: writeln('mi'); 3: writeln('j'); 4: writeln('v'); 5: writeln('s'); 6: writeln('d'); end; z: =succ(z); end; writeln('den c minimalnim potrebleniem'); z: =l; for k: =1 to 7 do begin if ord(z)=n_min_z then case ord(z) of 0: writeln('l'); 1: writeln('ma'); 2: writeln('mi'); 3: writeln('j'); 4: writeln('v'); 5: writeln('s'); 6: writeln('d'); end; z: =succ(z); end;

readln;

end.