Форум Всеукраїнської інтернет-олімпіади NetOI

var
   F1, F2, Z, N1, N2, T : int64;

begin
     read(Z,T);
     N1:=trunc((2*Z-T)/(2*T));
     N2:=N1+1;
     F1:=round(Z*N1-(N1*(N1+1)/2-1)*T);
     F2:=round(Z*N2-(N2*(N2+1)/2-1)*T);
     if F2>F1 then writeln(N2,' ',F2)
              else writeln(N1,' ',F1);
end.

type
    arr2 = array[1..100,1..100] of integer;
const
    d1 : array[1..8] of integer=(2,1,-1,-2,-2,-1,1,2);
    d2 : array[1..8] of integer=(-1,-2,-2,-1,1,2,2,1);

var
   m, n, s1, nn, i, x0, y0, s, t : integer;
   s2 : int64;
   d : arr2;
   count : array[1..10000] of integer;

procedure poshuk(x0,y0 : integer; var d : arr2);
var ax, ay : array[1..10000] of integer;
    i, j, k, l : integer;

function xod(p, q : integer) : boolean;
begin
     if (p>0) and (p<=n) then
     if (q>0) and (q<=m) then
     if d[p,q]=-1 then begin xod:=true; exit; end;
     xod:=false;
end;

begin
     for i:=1 to n do
     for j:=1 to m do d[i,j]:=-1;
     ax[1]:=x0; ay[1]:=y0; d[x0,y0]:=0; k:=0; l:=1;
     repeat
           inc(k);
           for i:=1 to 8 do
           if xod(ax[k]+d1[i],ay[k]+d2[i]) then begin
              inc(l); ax[l]:=ax[k]+d1[i]; ay[l]:=ay[k]+d2[i];
              d[ax[l],ay[l]]:=d[ax[k],ay[k]]+1;
           end;
     until (k=l);
end;

begin
     read(n,m);
     read(s,t);
     poshuk(s,t,d);
     read(nn);
     s1:=0; s2:=0;
     for i:=1 to nn do
     begin
          read(x0,y0);
          if d[x0,y0]=-1 then inc(s1)
          else s2:=s2+d[x0,y0];
     end;
     if s1>0 then writeln(s1)
             else writeln(s2);
end.

program device;
var a:array[1..100000000] of int64;
    i,n:int64;
begin
 read(n);
 i:=6;
 a[1]:=0;
 a[2]:=0;
 a[3]:=1;
 a[4]:=0;
 a[5]:=1;
 while i<=n do
 begin
  if i mod 2 =0 then a[i]:=2*a[i div 2]
  else a[i]:= a[i div 2]+a[(i div 2) +1];

  inc(i);
 end;
 writeln(a[n]);
end.

var
   N : int64;
   a, b : array[1..1000] of int64;
   t : integer;

function F(N : int64) : int64;
var k, p1, p2 : int64;
    i : integer;
begin
     k:=N div 2;
     if N<3 then begin F:=0; exit end
            else if N=3 then begin F:=1; exit; end;
     for i:=1 to t do
     if a[i]=N then begin F:=b[i]; exit; end;
     if odd(N) then begin
        p1:=F(N-k); inc(t); a[t]:=N-k; b[t]:=p1;
        p2:=F(k); inc(t); a[t]:=k; b[t]:=p2;
        F:=p1+p2;
     end
     else begin
        p2:=F(k); inc(t); a[t]:=k; b[t]:=p2;
        F:=2*p2;
     end;
end;

begin
     t:=0;
     read(N);
     writeln(F(N));
end.

var
   N1, N2 : longint;

function F(N : longint) : int64;
var st1, st2, st3, st : string;
    i, k, x, code : integer;
    S : int64;
    p, p1 : longint;
begin
     str(N,St); St3:=St[length(St)];
     St2:=copy(St,1,length(St)-1); val(St2,p,code);
     S:=0;
     for x:=1 to 9 do
     begin
          str(x,St1);
          if St1<=St3 then S:=S+(p+1)*x
                      else S:=S+p*x;
     end;

     for i:=2 to length(St)-1 do
     begin
          St2:=copy(St,1,i-1); val(St2,p,code);
          k:=length(St)-i;
          St3:=copy(St,i+1,k); val(St3,p1,code);
          k:=round(exp(ln(10)*k));
          for x:=1 to 9 do
          begin
               str(x,St1);
               if St1>St[i] then S:=S+p*k*x
               else if St1=St[i] then S:=S+(p*k+p1+1)*x
               else S:=S+(p+1)*k*x;
          end;
     end;

     St3:=St[1];
     St2:=copy(St,2,length(St)-1); val(St2,p,code);
     k:=length(St)-1; k:=round(exp(ln(10)*k));
     for x:=1 to 9 do
     begin
          str(x,St1);
          if St1=St3 then S:=S+(p+1)*x
          else if St1<St3 then S:=S+k*x;
     end;

     F:=S;
end;

begin
     read(N1,N2);
     writeln(F(N2)-F(N1-1));
end.

type
   list = array[1..20000] of longint;
var
   A, B, D : list;
   C, S : int64;
   N, M, j, i : integer;

procedure Qsort(var a: list; Lo,Hi: integer);

procedure sort(l,r: integer);
var
  i,j: integer;
  x,y: longint;
begin
  i:=l; j:=r; x:=a[(l+r) DIV 2];
  repeat
    while a[i]<x do i:=i+1;
    while x<a[j] do j:=j-1;
    if i<=j then
    begin
      y:=a[i]; a[i]:=a[j]; a[j]:=y;
      i:=i+1; j:=j-1;
    end;
  until i>j;
  if l<j then sort(l,j);
  if i<r then sort(i,r);
end;

begin 
  sort(Lo,Hi);
end;

begin
     read(N); for i:=1 to N do read(A[i]);
     read(M); for i:=1 to M do read(B[i]);

     for i:=1 to N do C:=C+A[i];

     for i:=1 to N do D[i]:=A[i];
     for i:=N+1 to N+M do D[i]:=B[i-N];
     QSort(D,1,M+N);

     S:=1;
     for i:=1 to M+N do
         if S>=D[i] then S:=S+D[i]
                    else break;

     writeln(C-S);
end.