#include <iostream>
int main() { char a; unsigned int count = 0; do { std::cin>>a; if (a == '[' || a == '(' || a == '{') count ++; } while (a != '.'); std::cout<<count;}
type Cl = class
a:integer;
constructor Create(b:integer);
procedure P;
end;
constructor Cl.Create(b:integer);
begin
a := b;
end;
procedure Cl.P;
begin
if (a div 100 > 0) and (a > 0) then
begin
a := a - 1;
writeln('new a = ', a);
end;
end;
var
Obj:Cl;
a :integer;
begin
write('a = ');
readln(a);
Obj := Cl.Create(a);
Obj.P;
Readln;
Obj.Destroy;
end.
Var a:array [1..1000] of integer;
k,i,n:integer;
begin
write ('kol-vo elementov v massive=');
readln (n);
write ('k=');readln (k);
writeln ('vvedite massiv');
for i:=1 to n do
readln (a[i]);
write ('massiv: ');
for i:=1 to n do
write (a[i],' ');
if (k<=n) and (k>0) then
for i:=k+1 to n do
a[i-1]:=a[i];
writeln;
write ('massiv posle ydalenija: ');
for i:=1 to n-1 do
write (a[i],' ');
end.
Вычисляем по формулам:
N = 2^b
I = k*b
Где N - мощность алфавита, b - инф. вес символов, k - количество символов
Отсюда,
128 = 2^b
b = 6
12 кб = 98304 бит
98304 = k * 6
k = 16384