else k:=28;
end;
for j:=1 to k do begin inc(l);
if l=8 then l:=1; if j=13 then inc(a[l]); end; end; inc(h); until h=n;
for i:=1 to 6 do write(a[i],' '); write(a[7]); close(input); close(output); end. fhp.pas: var
flag:array[1..10000]of boolean; a,b:array[1..10]of longint; i,j,t,n,m:longint; begin
6
assign(input,'fhp.in'); assign(output,'fhp.out'); reset(input); rewrite(output); readln(n);
for i:=1 to n do read(a[i]); read(m); dec(m);
for i:=1 to n do b[i]:=1; flag[1]:=true; for i:=1 to m do begin for j:=1 to n do begin b[j]:=b[j]+a[j]; flag[b[j]]:=true; end; end;
for i:=1 to 10000 do if flag[i] then inc(t); write(t);
close(input); close(output); end. zcq.pas:
type aa=array[1..100]of longint;
7
var a,b:aa;
i,j,k,n,h,m,t:longint;
procedure pren(var a:aa;n:longint); var
i,j,oh:longint; begin
for i:=1 to n-1 do for j:=i+1 to n do if a[i]>a[j] then begin oh:=a[i]; a[i]:=a[j]; a[j]:=oh; end; end; begin
assign(input,'zcq.in'); assign(output,'zcq.out'); reset(input); rewrite(output); readln(n,m);
for i:=1 to n do read(a[i]);
8
for i:=1 to m do read(b[i]); pren(a,n); pren(b,m); {for i:=1 to n do write(a[i],' '); writeln;
for i:=1 to m do write(b[i],' ');} for i:=1 to m do begin j:=1; h:=0; repeat
if a[j]<=b[i] then begin inc(h); inc(t); a[j]:=maxlongint; end; inc(j);
until (h=2) or (j=n); end; write(t);
close(input); close(output); end. lbnc.pas: var
a:array[1..15,1..15]of longint;
9
i,j,n,m:longint; begin
assign(input,'lbnc.in'); assign(output,'lbnc.out'); reset(input); rewrite(output); read(n,m);
for i:=1 to n do a[i,1]:=i; a[2,2]:=2; for i:=3 to n do for j:=2 to i do
a[i,j]:=(a[i-1,j-1]*a[i,j-1]) div (a[i,j-1]-a[i-1,j-1]); write('1/',a[n,m]); close(output); close(input); end.
10