1
2
3
4
5
6
7
8
9
program maxfact (input,output);
    var N , i, j : integer;
function fact (m : integer) : integer;
begin
   if (m=0) or (m=1) then fact:=1
     else fact:=fact(m-1)*m;
end;
   
begin
 ...

1
2
3
4
5
6
7
8
9
program maxfact (input,output);
    var N , i, j : integer;
function fact (m : integer) : integer;
begin
   if (m=0) or (m=1) then fact:=1
     else fact:=fact(m-1)*m;
end;
   
begin
 ...

1
2
3
4
5
6
7
8
9
program maxfact (input,output);
    var i , sm : integer;
        a : array [1..3] of integer;
function fact (n : integer) : integer;
begin
   if (n=0) or (n=1) then fact:=1
     else fact:=fact(n-1)*n;
end;
   
 ...

1
2
3
4
5
6
7
8
9
program maxfact (input,output);
    var i , sm : integer;
        a : array [1..3] of integer;
function fact (n : integer) : integer;
begin
   if (n=0) or (n=1) then fact:=1
     else fact:=fact(n-1)*n;
end;
   
 ...

1
2
3
4
5
6
7
8
9
program maxfact (input,output);
    var i , sm : integer;
        a : array [1..3] of integer;
function fact (n : integer) : integer;
begin
   if (n=0) or (n=1) then fact:=1
     else fact:=fact(n-1)*n;
end;
   
 ...

1
2
3
4
5
6
7
8
9
program maxfact (input,output);
    var i , sm : integer;
        a : array [1..3] of integer;
function fact (n : integer) : integer;
     var 
begin
   if (n=0) or (n=1) then fact:=1
     else fact:=fact(n-1)*n;
end;
 ...

1
2
3
4
5
6
7
8
9
program smthree (input,output);
    var i , sm : integer;
        a : array [1..3] of integer;
begin
    for i:=1 to 3 do read(a[i]);
    sm:=a[1];
    for i:=2 to 3 do
      begin
        if a[i]<sm then sm:=a[i]
 ...

1
2
3
4
5
6
7
8
9
program smthree (input,output);
    var i , sm : integer;
        a : array [1..3] of integer;
begin
    for i:=1 to 3 do read(a[i]);
    sm:=a[1];
    for i:=2 to 3 do
      begin
        if a[i]<sm then sm:=a[i]
 ...

1
2
3
4
5
6
7
8
9
program smthree (input,output);
    var i , sm : integer;
        a : array [1..3] of integer;
begin
    for i:=1 to 3 do read(a[i]);
    sm:=a[1];
    for i:=2 to 3 do
      begin
        if a[i]<sm then sm:=a[i]
 ...

1
2
3
4
5
6
7
8
9
program modeq (input,output);
    var M, N, Q ,i ,j, k: integer;
begin
    readln(M, N, Q);
    i:= M mod 42;
    j:= N mod 42;
    k:= Q mod 42;
    if (i=j) and (j=k) then writeln(i)
      else writeln('no');

1
2
3
4
5
6
7
8
9
program modeq (input,output);
    var M, N, Q ,i ,j, k: integer;
begin
    readln(M, N, Q);
    i:= M mod 42;
    j:= N mod 42;
    k:= Q mod 42;
    if (i=j) and (j=k) then writeln(i)
      else writeln('no');

1
2
3
4
5
6
7
8
9
program modeq (input,output);
    var M, N, Q ,i ,j, k: integer;
begin
    readln(M, N, Q);
    i:= M mod 42;
    j:= N mod 42;
    k:= Q mod 42;
    if (i=j) and (j=k) then writeln(i)
      else writeln('no');

1
2
3
4
5
6
7
8
9
program modeq (input,output);
    var M, N, Q ,i ,j, k: integer;
begin
    readln(M, N, Q);
    i:= M mod 42;
    j:= N mod 42;
    k:= Q mod 42;
    if (i=j) and (j=k) then writeln(i)
      else writeln('no');

1
2
3
4
5
6
7
8
9
program eqfst (input,output);
    var a, b , x: real;
begin
    readln(a, b);
    if (a=0) then
      begin
        if (b=0) then writeln('trivial')
          else writeln('impossible')
      end;
 ...

1
2
3
4
5
6
7
8
9
program eqfst (input,output);
    var a, b , x: real;
begin
    readln(a, b);
    if (a=0) then
      begin
        if (b=0) then writeln('trivial')
          else writeln('impossible')
      end;
 ...

1
2
3
4
5
6
7
8
9
program eqfst (input,output);
    var a, b , x: real;
begin
    readln(a, b);
    if (a=0) then
      begin
        if (b=0) then writeln('trivial')
          else writeln('impossible')
      end;
 ...

1
2
3
4
5
6
7
8
9
program eqfst (input,output);
    var a, b , x: real;
begin
    readln(a, b);
    if (a=0) then
      begin
        if (b=0) then writeln('trivial')
          else writeln('impossible')
      end;
 ...

1
2
3
4
5
6
7
8
9
unit binomial_generator;
 
interface
uses
  Windows, Messages, SysUtils, Variants, Classes, Graphics, Controls, Forms,
 
  Dialogs, StdCtrls, ExtCtrls;
 
 
 ...

1
2
3
4
5
6
7
8
9
program eqfst (input,output);
    var a, b , x: real;
begin
    readln(a, b);
    if (a=0) then
      begin
        if (b=0) then writeln('trivial')
          else writeln('impossible')
      end;
 ...

1
2
3
4
5
6
7
8
9
program eqfst (input,output);
    var a, b , x: real;
begin
    readln(a, b);
    if (a=0) then
      begin
        if (b=0) then writeln('trivial')
          else writeln('impossible')
      end;
 ...

1
2
3
4
5
6
7
8
9
program end24 (input,output);
    var N, pow, j : integer;
begin
    readln(N);
    pow:= N*N;
    j:= pow mod 100;
    if j=24 then writeln('yes')
      else writeln('no');
end.

1
2
3
4
5
6
7
8
9
program end24 (input,output);
    var N, pow, j : integer;
begin
    readln(N);
    pow:= N*N;
    j:= pow mod 100;
    if j=24 then writeln('yes')
      else writeln('no');
end.

1
2
3
4
5
6
7
8
9
program even (input,output);
    var N, M ,sum, j : integer;
begin
    readln(M, N);
    sum:=M+N;
    j:= sum mod 100;
    if j=42 then writeln('yes')
      else writeln('no');
end.

1
2
3
4
5
6
7
8
9
program even (input,output);
    var N, M ,sum, j : integer;
begin
    readln(M, N);
    sum:=M+N;
    j:= sum mod 100;
    if j=42 then writeln('yes')
      else writeln('no');
end.

1
2
3
4
5
6
7
8
9
program even (input,output);
    var N, M ,sum, j : integer;
begin
    readln(M, N);
    sum:=M+N;
    j:= sum mod 100;
    if j=42 then writeln('yes')
      else writeln('no');
end.

1
2
3
4
5
6
7
8
program even (input,output);
    var N, i, j: integer;
begin
    readln(N);
    i:= N div 100;
    j:= N mod 100;
    writeln(i, ' ', j);
end.

1
2
3
4
5
6
7
8
program even (input,output);
    var N, i, j: integer;
begin
    readln(N);
    i:= N div 100;
    j:= N mod 100;
    writeln(i, ' ', j);
end.

1
2
3
4
5
6
7
8
program even (input,output);
    var N, i, j: integer;
begin
    readln(N);
    i:= N div 10;
    j:= N mod 10;
    writeln(i, ' ', j);
end.

1
2
3
4
5
6
7
8
9
program even (input,output);
    var N, M, i: integer;
begin
   readln(M, N);
   i:=0;
   if (not odd(M)) then i:=i+1;
   if (not odd(N)) then i:=i+1;
   writeln(i);
end.

1
2
3
4
5
6
7
8
9
program even (input,output);
    var N, M, i: integer;
begin
   readln(M, N);
   i:=0;
   if (not odd(M)) then i:=i+1;
   if (not odd(N)) then i:=i+1;
   writeln(i);
end.