SlideShare uma empresa Scribd logo
1 de 7
Разбор задач:

А

program z1;

var N,i:integer;

a,M,P:longint;

begin

readln(N);

M:=0; P:=0;

for i:=1 to N do

begin

read(a);

if i mod 2=1 then M:=M+a*(i+1) else P:=P+a*(i+1);

end;

if M>P then write ('Lost') else if M<P then write('Won') else write('?')

end.
В

program z2;

const K=1000;

var N,M,X,i:integer;

Z:byte;

Y,Post,Prod:longint;

a:array[1..K] of longint;

begin

Post:=0; Prod:=0;

Readln(N,M);

for i:=1 to N do a[i]:=0;

for i:=1 to M do

begin

 readln(X,Y,Z);

    if Z=0 then begin a[X]:=a[X]+Y; Post:=Post+Y; end

    else begin

        if a[x]>Y then begin a[X]:=a[X]-Y; Prod:=Prod+Y; end

        else begin Prod:=Prod+a[X];a[X]:=0; end;

       end;

end;

Writeln(Post,' ',Prod);

for i:=1 to N do Write(a[i],' ')

end.
С

program z3;

var n,m,i,j,ves,T,k,l,o,p:longint;

a:array[1..100]of longint;

begin

Readln(N,M);

for i:=1 to N do read(a[i]);

ves:=a[1]+a[2]+a[3];

T:=0;

if ves <M then T:=ves else

begin

     i:=2;

     while (i<=n) and (T=0) do

     begin

      j:=i+1;

      while (j<=n) and (T=0) do

         begin

         o:=j+1;

         while (o<=n)and(T=0) do begin if ves<M then T:=ves; o:=o+1 end;

        j:=j+1;

      end;

     i:=i+1

end;

end;



for k:=1 to n do

for j:=k+1 to n do

    for o:=j+1 to n do

     begin
ves:=a[k]+a[j]+a[o];

   if (ves>T) and (ves<=M) then T:=ves;

end;

 Write(T)

end.
D

program zD;

var A:array[1..3,1..100] of integer;

{A[1,i]- w - komu kot zanes igruhku

A[2,i] - m - minuty

A[3,i] - sekundy}

t,tm,th,i,N,km, kh:integer;

{tm, th - vremya reytinga devothek}

{km, kh - kol-vo igrushek

t - obshee vremya s konca}

begin

km:=0; kh:=0;

Readln(N);

for i:=1 to N do {zapolnyaem massiv i shitaem kol-vo igrushek u kagdoj devothki}

begin

readln(A[1,i], A[2,i], A[3,i]);

if A[1,i]=1 then km:=km+1 else kh:=kh+1;

end;

tm:=0; th:=0; t:=48*60;

for i:=n downto 1 do {shitaem reyting c konca v sekundah}

begin

 if km>kh then tm:=tm+t-A[2,i]*60-A[3,i]

        else if kh>km then th:=th+t-A[2,i]*60-A[3,i];

 if A[1,i]=1 then km:=km-1 else kh:=kh-1;

t:=A[2,i]*60+A[3,i]

end;

writeln(tm div 60,' ',tm mod 60);

write(th div 60,' ',th mod 60);

end.
E

program z5;

var n,k,m,i,S:longint;

a:array[1..1000000] of longint;

function m1():longint;

var

begin

end;



function m2():integer;

var

begin

end;



begin

Readln(N,K);

for i:=1 to N do

Read(a[i]);

m:=a[1];

for i:=2 to n do if a[i]>m then m:=a[i];

m:=m div 2;

S:=0;

for i:=1 to n do

 if a[i]>m then S:=S+a[i]-m;

l:=true;

while l do




if S>k then
begin

if S<k+7 then begin write(m); l:=false end else

 m:=m1;

end



else

begin

 if S>k-7 then begin write (m); l:=false; end else m:=m2;

end;




m:=m-1;

S:=0;

for i:=1 to n do

 if a[i]>m then S:=S+a[i]-m;




while S<K do

begin

s:=0;

m:=m-1;

for i:=1 to n do

 if a[i]>m then S:=S+a[i]-m;



end;



write (m);



end.

Mais conteúdo relacionado

Semelhante a разбор задач

Program pengurutan data
Program pengurutan dataProgram pengurutan data
Program pengurutan datalinda_rosalina
 
This problem illustrates one of the possible pitfalls of blindly appl.pdf
This problem illustrates one of the possible pitfalls of blindly appl.pdfThis problem illustrates one of the possible pitfalls of blindly appl.pdf
This problem illustrates one of the possible pitfalls of blindly appl.pdfarihantmum
 
Rabin Karp Algorithm
Rabin Karp AlgorithmRabin Karp Algorithm
Rabin Karp AlgorithmKiran K
 
P805 bourgeois
P805 bourgeoisP805 bourgeois
P805 bourgeoiskklub
 
Matlab assignment
Matlab assignmentMatlab assignment
Matlab assignmentRutvik
 
MATLAB DEKUT 2019.doc
MATLAB DEKUT 2019.docMATLAB DEKUT 2019.doc
MATLAB DEKUT 2019.docLucasMogaka
 
Kumpulan contoh-program-pascal-121209073936-phpapp01
Kumpulan contoh-program-pascal-121209073936-phpapp01Kumpulan contoh-program-pascal-121209073936-phpapp01
Kumpulan contoh-program-pascal-121209073936-phpapp01Defina Iskandar
 
Lowest common ancestor
Lowest common ancestorLowest common ancestor
Lowest common ancestorShakil Ahmed
 
Graph for Coulomb damped oscillation
Graph for Coulomb damped oscillationGraph for Coulomb damped oscillation
Graph for Coulomb damped oscillationphanhung20
 
Csci101 lect06 advanced_looping
Csci101 lect06 advanced_loopingCsci101 lect06 advanced_looping
Csci101 lect06 advanced_loopingElsayed Hemayed
 
Algorithm Design and Complexity - Course 11
Algorithm Design and Complexity - Course 11Algorithm Design and Complexity - Course 11
Algorithm Design and Complexity - Course 11Traian Rebedea
 
01 - DAA - PPT.pptx
01 - DAA - PPT.pptx01 - DAA - PPT.pptx
01 - DAA - PPT.pptxKokilaK25
 
Job sequencing with deadlines(with example)
Job sequencing with deadlines(with example)Job sequencing with deadlines(with example)
Job sequencing with deadlines(with example)Vrinda Sheela
 

Semelhante a разбор задач (16)

Algoritma
AlgoritmaAlgoritma
Algoritma
 
Program pengurutan data
Program pengurutan dataProgram pengurutan data
Program pengurutan data
 
This problem illustrates one of the possible pitfalls of blindly appl.pdf
This problem illustrates one of the possible pitfalls of blindly appl.pdfThis problem illustrates one of the possible pitfalls of blindly appl.pdf
This problem illustrates one of the possible pitfalls of blindly appl.pdf
 
Rabin Karp Algorithm
Rabin Karp AlgorithmRabin Karp Algorithm
Rabin Karp Algorithm
 
P805 bourgeois
P805 bourgeoisP805 bourgeois
P805 bourgeois
 
Matlab assignment
Matlab assignmentMatlab assignment
Matlab assignment
 
MATLAB DEKUT 2019.doc
MATLAB DEKUT 2019.docMATLAB DEKUT 2019.doc
MATLAB DEKUT 2019.doc
 
Sequences
SequencesSequences
Sequences
 
Kumpulan contoh-program-pascal-121209073936-phpapp01
Kumpulan contoh-program-pascal-121209073936-phpapp01Kumpulan contoh-program-pascal-121209073936-phpapp01
Kumpulan contoh-program-pascal-121209073936-phpapp01
 
Lowest common ancestor
Lowest common ancestorLowest common ancestor
Lowest common ancestor
 
Graph for Coulomb damped oscillation
Graph for Coulomb damped oscillationGraph for Coulomb damped oscillation
Graph for Coulomb damped oscillation
 
Csci101 lect06 advanced_looping
Csci101 lect06 advanced_loopingCsci101 lect06 advanced_looping
Csci101 lect06 advanced_looping
 
Algorithm Design and Complexity - Course 11
Algorithm Design and Complexity - Course 11Algorithm Design and Complexity - Course 11
Algorithm Design and Complexity - Course 11
 
01 - DAA - PPT.pptx
01 - DAA - PPT.pptx01 - DAA - PPT.pptx
01 - DAA - PPT.pptx
 
5. Summing Series.pptx
5. Summing Series.pptx5. Summing Series.pptx
5. Summing Series.pptx
 
Job sequencing with deadlines(with example)
Job sequencing with deadlines(with example)Job sequencing with deadlines(with example)
Job sequencing with deadlines(with example)
 

Mais de liz_f

минимум олимпиадника
минимум олимпиадникаминимум олимпиадника
минимум олимпиадникаliz_f
 
Obrazovat standart informatika
Obrazovat standart informatikaObrazovat standart informatika
Obrazovat standart informatikaliz_f
 
Koncept informatika
Koncept informatikaKoncept informatika
Koncept informatikaliz_f
 
Imp informatika 2012 2013
Imp informatika 2012 2013Imp informatika 2012 2013
Imp informatika 2012 2013liz_f
 
Informatika rus
Informatika rusInformatika rus
Informatika rusliz_f
 
тест циклические алгоритмы 1 вариант
тест циклические алгоритмы 1 варианттест циклические алгоритмы 1 вариант
тест циклические алгоритмы 1 вариантliz_f
 
архитектуро и устройства пк
архитектуро и устройства пкархитектуро и устройства пк
архитектуро и устройства пкliz_f
 
32531 testy
32531 testy32531 testy
32531 testyliz_f
 
условия
условияусловия
условияliz_f
 
базы данных
базы данныхбазы данных
базы данныхliz_f
 
кодекс об образовании
кодекс об образованиикодекс об образовании
кодекс об образованииliz_f
 
''спусковой крючок'' анимации
''спусковой крючок'' анимации''спусковой крючок'' анимации
''спусковой крючок'' анимацииliz_f
 

Mais de liz_f (12)

минимум олимпиадника
минимум олимпиадникаминимум олимпиадника
минимум олимпиадника
 
Obrazovat standart informatika
Obrazovat standart informatikaObrazovat standart informatika
Obrazovat standart informatika
 
Koncept informatika
Koncept informatikaKoncept informatika
Koncept informatika
 
Imp informatika 2012 2013
Imp informatika 2012 2013Imp informatika 2012 2013
Imp informatika 2012 2013
 
Informatika rus
Informatika rusInformatika rus
Informatika rus
 
тест циклические алгоритмы 1 вариант
тест циклические алгоритмы 1 варианттест циклические алгоритмы 1 вариант
тест циклические алгоритмы 1 вариант
 
архитектуро и устройства пк
архитектуро и устройства пкархитектуро и устройства пк
архитектуро и устройства пк
 
32531 testy
32531 testy32531 testy
32531 testy
 
условия
условияусловия
условия
 
базы данных
базы данныхбазы данных
базы данных
 
кодекс об образовании
кодекс об образованиикодекс об образовании
кодекс об образовании
 
''спусковой крючок'' анимации
''спусковой крючок'' анимации''спусковой крючок'' анимации
''спусковой крючок'' анимации
 

разбор задач

  • 1. Разбор задач: А program z1; var N,i:integer; a,M,P:longint; begin readln(N); M:=0; P:=0; for i:=1 to N do begin read(a); if i mod 2=1 then M:=M+a*(i+1) else P:=P+a*(i+1); end; if M>P then write ('Lost') else if M<P then write('Won') else write('?') end.
  • 2. В program z2; const K=1000; var N,M,X,i:integer; Z:byte; Y,Post,Prod:longint; a:array[1..K] of longint; begin Post:=0; Prod:=0; Readln(N,M); for i:=1 to N do a[i]:=0; for i:=1 to M do begin readln(X,Y,Z); if Z=0 then begin a[X]:=a[X]+Y; Post:=Post+Y; end else begin if a[x]>Y then begin a[X]:=a[X]-Y; Prod:=Prod+Y; end else begin Prod:=Prod+a[X];a[X]:=0; end; end; end; Writeln(Post,' ',Prod); for i:=1 to N do Write(a[i],' ') end.
  • 3. С program z3; var n,m,i,j,ves,T,k,l,o,p:longint; a:array[1..100]of longint; begin Readln(N,M); for i:=1 to N do read(a[i]); ves:=a[1]+a[2]+a[3]; T:=0; if ves <M then T:=ves else begin i:=2; while (i<=n) and (T=0) do begin j:=i+1; while (j<=n) and (T=0) do begin o:=j+1; while (o<=n)and(T=0) do begin if ves<M then T:=ves; o:=o+1 end; j:=j+1; end; i:=i+1 end; end; for k:=1 to n do for j:=k+1 to n do for o:=j+1 to n do begin
  • 4. ves:=a[k]+a[j]+a[o]; if (ves>T) and (ves<=M) then T:=ves; end; Write(T) end.
  • 5. D program zD; var A:array[1..3,1..100] of integer; {A[1,i]- w - komu kot zanes igruhku A[2,i] - m - minuty A[3,i] - sekundy} t,tm,th,i,N,km, kh:integer; {tm, th - vremya reytinga devothek} {km, kh - kol-vo igrushek t - obshee vremya s konca} begin km:=0; kh:=0; Readln(N); for i:=1 to N do {zapolnyaem massiv i shitaem kol-vo igrushek u kagdoj devothki} begin readln(A[1,i], A[2,i], A[3,i]); if A[1,i]=1 then km:=km+1 else kh:=kh+1; end; tm:=0; th:=0; t:=48*60; for i:=n downto 1 do {shitaem reyting c konca v sekundah} begin if km>kh then tm:=tm+t-A[2,i]*60-A[3,i] else if kh>km then th:=th+t-A[2,i]*60-A[3,i]; if A[1,i]=1 then km:=km-1 else kh:=kh-1; t:=A[2,i]*60+A[3,i] end; writeln(tm div 60,' ',tm mod 60); write(th div 60,' ',th mod 60); end.
  • 6. E program z5; var n,k,m,i,S:longint; a:array[1..1000000] of longint; function m1():longint; var begin end; function m2():integer; var begin end; begin Readln(N,K); for i:=1 to N do Read(a[i]); m:=a[1]; for i:=2 to n do if a[i]>m then m:=a[i]; m:=m div 2; S:=0; for i:=1 to n do if a[i]>m then S:=S+a[i]-m; l:=true; while l do if S>k then
  • 7. begin if S<k+7 then begin write(m); l:=false end else m:=m1; end else begin if S>k-7 then begin write (m); l:=false; end else m:=m2; end; m:=m-1; S:=0; for i:=1 to n do if a[i]>m then S:=S+a[i]-m; while S<K do begin s:=0; m:=m-1; for i:=1 to n do if a[i]>m then S:=S+a[i]-m; end; write (m); end.