PASCAL - Zadaci, resenja, problemi, izazovi...

program zadatak_1;
var
  i : integer;

function Kub(Sender : integer) : integer;
var
  Temp : integer; //Ovde cuvamo kub cifre
begin
  repeat
    Temp := Sender mod 10; //uzmamo cifru
    Sender := Sender div 10; //i tu cifru izbacijemo iz broja;
    Result := Result + (Temp * Temp * Temp); // dadajemo rezultatu kub izdvojene cifre
  until Sender = 0; //izlazimo ako smo sve cifre procesirali
end;

begin
  for i := 1 to 9999 do // predpostavljam pod pojmom sve manje brojeve mislise sve manje 
    if Kub(i) = i then writeln(i); //pozitivne brojeve
end;

program writing;

{$mode objfpc}

uses
  SysUtils;

type
  TOneData = record
    Have : boolean;
    Count : integer;
  end;

var
  Glyph : array[65..122] of TOneData;
  Sequence : array[1..3000000] of integer;
  Glyph_Len : integer;
  Sequence_Len : longint; i : integer;

procedure LoadData(FileName : string);
var
  fText : TextFile;
  i : integer;
  TempChar : Char;
begin
  AssignFile(fText, FileName);
  Reset(fText);
  Readln(fText, Glyph_Len, Sequence_Len);
  for i := 1 to Glyph_Len do
    begin
      Read(fText, TempChar);
      Glyph[Ord(TempChar)].Have := true;
      Inc(Glyph[Ord(TempChar)].Count)
    end;
    Readln(fText, TempChar); // Uklanjamo #13
  for i := 1 to Sequence_Len do
    begin
      Read(fText, TempChar);
      Sequence[i] := Ord(TempChar);
    end;
  CloseFile(fText);
end;

procedure Add(Sender : integer);
begin
  if Glyph[Sender].Have then
    Inc(Glyph[Sender].Count);
end;

function DoWriting : integer;
var
  Last, First : integer;
  i, j : integer;
  check : boolean;
begin
  Last := 1;
  First := 0;
  Result := 0;
  for i := 1 to Sequence_Len - Glyph_Len + 1 do
    begin
      if First > i then
        begin
          Add(Sequence[i]);
          continue;
        end;
        Check := true;
      for j := Last to i + Glyph_Len - 1 do
        begin
          if not Glyph[Sequence[j]].Have then
            begin
              Last := j + 1;
              First := Last;
              Check := false;
              Break;
            end;
          if Glyph[Sequence[j]].Count = 0 then
            begin
              Last := j;
              Check := false;
              Break;
            end;
          Dec(Glyph[Sequence[j]].Count);
        end;
      if Check then
        begin
          Inc(Result);
          Last := i + Glyph_Len;
        end;
      Add(Sequence[i]);
    end;
end;

procedure SaveData(Filename : string);
var
  fText : TextFile;
begin
  AssignFile(fText, FileName);
  Rewrite(fText);
  Writeln(fText, DoWriting);
  CloseFile(fText);
end;

begin
  LoadData('writing.in');
  SaveData('writing.out');
end.

program zad41;
{$mode objfpc}
var
  Num : longint;
  i : integer;
  count : integer;
begin
  Readln(Num);
  repeat
    if (Num mod 10) = 2 then Inc(count);
    Num := Num div 10;
  until Num = 0;
  writeln(Count);
end.

type
  TNiz = array[1..1000] of integer;

procedure Bubble_Sort(Count : integer; var niz : TNiz);
var
  i, j : integer;
begin
  for i := Count - 1 downto 1 do
    for j := 1 to i do
      if niz[j] > niz[j + 1] then
        begin
          Temp := Niz[j];
          Niz[j] := Niz[j + 1];
          Niz[j + 1] := Temp; 
        end;
end;