Uses crt;var i,n,s:integer;beginn:=0;writeln('vvedite chislo');readln(s);for i := 1 to s don:=n+i;writeln(n);readln;end.
DВот решение данной задачи на языке Pascal:
var
s:string;
k,n,i:longint;
begin
read(s);
k:=0;
n:=0;
for i:=1 to length(s) do
begin
if ord(s[i])=65 then k:=k+1;
if ord(s[i])=32 then
begin
if k=3 then n:=n+1;
k:=0;
end;
end;
writeln(n);
end.
<span><span>def dijkstra(graph, node):</span><span> """</span> Simulate the dijkstra algorithm in a graph<span> """</span><span> distance_to = {}</span><span> distance_to[node] = 0</span><span> distance_path = {}</span><span> while (distance_to):</span><span> # in case we have a disjoint graph</span><span> op_node = min_distance(distance_to)</span><span> distance_path[op_node] = distance_to[op_node]</span><span> del distance_to[op_node]</span><span> for x, x_len in graph[op_node].items():</span><span> if x not in distance_path:</span><span> if x not in distance_to:</span><span> distance_to[x] = distance_path[op_node] + x_len</span><span> elif distance_to[x] > distance_path[op_node] + x_len:</span><span> distance_to[x] = distance_path[op_node] + x_len</span><span> return distance_path</span></span>