...riteFactorii primi sunt i1 hile n1 do begin ii1 hile n mod i0 do begin ritei, nn div i end end readlnend.program as1uses crtvar n,p,iintegerbegin clrscr ritenreadlnn p1 for i2 to n do ppi riten,! este ,p readlnend.program as2uses crtvar n,s,iintegerbegin clrscr ritenreadlnn s0 for i1 to n do ssi riteSuma este ,s readlnend.program as3uses crtvar n,s,iintegerbegin clrscr ritenreadlnn s0 for i1 to n do ssii riteSuma este ,s readlnend.program as4uses crtvar n,s,p,i,jintegerbegin clrscr ritenreadlnn s0 for i1 to n do begin p1 for j2 to i do ppj ssp end riteSuma este ,s readlnend.program as5uses crtvar x,n,p,iintegerbegin clrscr ritexreadlnx ritenreadlnn p1 for i1 to n do ppx riteRezultatul este ,p readlnend.program as6uses crtvar a,b,auxintegerbegin clrscr riteareadlna ritebreadlnb auxa ab baux ritelna,a ritelnb,b readlnend.program as7uses crtvar a,b,c,max,minintegerbegin clrscr riteareadlna ritebreadlnb ritecreadlnc if ab then maxa else maxb if maxc then maxc if ab then mina else minb if minc then minc riteRezultatul expresiei este ,max-min readlnend.program as8uses crtvar a,b,c,dinteger x1,x2realbegin clrscr riteareadlna ritebreadlnb ritecreadlnc if a0 then riteEcuatia nu este de grad 2 else begin dbb-4ac if d0 then riteEcuatia are radacini complexe else begin x1-1b2asqrtd2a x2-1b2a-sqrtd2a ritelnx1,x131 ritelnx2,x231 end end readlnend.program as9uses crtvar a,b,rintegerbegin clrscr riteareadlna ritebreadlnb hile a mod b0 do begin ra mod b ab br end riteCmmdc este ,b readlnend.program as10uses crtvar n,a,b,cintegerbegin clrscr ritenreadlnn a0 b1 ritePrimele ,n, numere din sirul lui fibonacci sunt ritea, ,b, nn-2 hile n0 do begin cab ritec, nn-1 ab bc end readlnend.program t1uses crtvar aarrayi1..20s of integer n,min,max,iintegerbegin clrscr riteDimensiunea siruluireadlnn riteIntroduceti sirul for i1 to n do readaiis minai1s for i2 to n do if aiismin then minaiis maxai1s for i2 to n do if aiismax then maxaiis ritelnMinimul sirului este ,min ritelnMaximul sirului este ,max readlnreadlnend.program t2uses crtvar aarrayi1..20s of integer n,v,poz,iintegerbegin clrscr ritenreadlnn riteSirul... for i1 to n do readaiis riteValoarea cautatareadlnv poz0 for i1 to n do if aiisv then pozi if poz0 then riteValoarea nu este in sir else riteValoarea se gaseste pe pozitia ,poz readlnend.program t3uses crtvar aarrayi1..20s of integer n,i,auxintegerbegin clrscr ritenreadlnn riteSirul... for i1 to n do readaiis for i1 to n div 2 do begin auxaiis aiisain-i1s ain-i1saux end riteSirul inversat este for i1 to n do riteaiis, readln readlnend.program t4uses crtvar aarrayi1..20s of integer n,s,k,iintegerbegin clrscr ritenreadlnn riteSirul... for i1 to n do readaiis s0 k0 for i1 to n do if aiis mod 20 then begin ssaiis kk1 end ritelnMedia aritmetica a numerelor pare este ,sk42 s0 k0 for i1 to n do if aiis mod 20 then begin ssaiis kk1 end ritelnMedia aritmetica a numerelor impare este ,sk42 readlnreadlnend.program t5uses crtvar aarrayi1..20s of integer n,i,auxinteger ordonatbooleanbegin clrscr ritenreadlnn riteSirul... for i1 to n do readaiis ordonatfalse hile ordonatfalse do begin ordonattrue for i1 to n-1 do if aiisaii1s then begin auxaiis aiisaii1s aii1saux ordonatfalse end end riteSirul ordonat este for i1 to n do riteaiis, readlnend.program t6uses crtvar a,b,carrayi1..20s of integer n,m,i,j,kintegerbegin clrscr ritenreadlnn ritePrimul sir for i1 to n do readaiis ritemreadlnm riteAl doilea sir for j1 to m do readbijs i1 j1 k0 hile in and jm do begin kk1 if aiisbijs then begin ciksaiis ii1 end else begin ciksbijs jj1 end end if in then for ij to m do begin kk1 ciksbiis end else for ji to n do begin kk1 ciksaijs end riteSirul rezultat este for i1 to kImnS do riteciis, readlnreadlnend.program t7uses crtvar aarrayi1..20s of integer n,v,m,i,j,pozinteger gasitbooleanbegin clrscr riteDimensiunea sirului ordonat crescator...readlnn riteSirul... for i1 to n do readaiis riteValoarea cautata...readlnv i1 jn gasitfalse poz0 hile ij and gasitfalse do begin mij div 2 if aimsv then begin gasittrue pozm end else if aimsv then jm-1 else im1 end if gasitfalse then ritelnValoarea ,v, nu se gaseste in sir else ritelnSe gaseste pe pozitia ,poz readlnend.Icautare binara recursivSprogram t7uses crtvar aarrayi1..20s of integer n,i,vintegerfunction cautarei,jintegerintegervar mintegerbegin if ij then begin mij div 2 if aimsv then cautarem else if aimsv then cautarecautarei,m-1 ...
Download