massiv[1..20]; Protsedura OBU(x:integer); start k uchun:=1 to N uchun j
uchun:=(x-1)*10+1 dan 10*x+1 gacha p[k,j]:=p[k,j]+a[k]*( 1-p[k,j])
i 1( ÿ ij)ÿ , bu yerda j = (10(S ÿ1) +1) … (10S +1).
Re ppapt + ij ko'rsatilmoqda
Machine Translated by Google
t:=t+1 ni takrorlang; i uchun:=1 dan N gacha boshlanadi S uchun:=1 dan
Chisl_z gacha boshlanadi Agar Z[i]=S-1 bo'lsa, RND:=random(1000)/1000;
Agar (t mod d[i]=0)va(O[i](O[i]=S*10) bo'lsa, L:=i; tt[L]:=Td; inc(SR[L]); chiziq (dumaloq(t/100),0,dumaloq(t/
100),600); doira (dumaloq (t/100), 600-60 * LO [L] * 1,6); oxiri; Agar tt[i]>0 bo'lsa,
tt[i]:=tt[i]-1 boshlang; OBU(S); oxiri; Agar (O[i]=S*10)va(tt[i]<1) bo'lsa, Z[i]:=S; oxiri;
oxiri; oxiri; i:=1 dan N gacha bo'lsa, Z[i]=Chisl_z bo'lsa, TR[i]:=TR[i]+t boshlanadi;
Z[i]:=-500; oxiri; doira(dumaloq(t/100),600-60*i -O[i],1); doira(dumaloq(t/
100),600-60*iZ[i]*10,1); oxiri; pp:=0; i:=1 uchun N do Agar Z[i]<>-500 bo'lsa, pp:=1;
qadar(KeyPressed)yoki(pp=0){(t>360000)}; {writeln(isp);} end; {yozma; i:=1 to N
uchun writeln(i,'-', TR[i]/Kisp:2:2, | ',SR[i]/Kisp:2:4,' || ');} readln; Grafikni yopish;
OXIRI.
.
'
Guruch. 1. 8 ta talaba t vaqt ichida 10 ta masalani yechadi
Machine Translated by Google
= /1 di
shaxsiy fikrlash tezligi i
Guruch. 1 koeffitsientli sinfda 8 ta o'quvchi bo'lgan vaziyatga mos keladi
Kisp = 200 ta sinovlar seriyasi , quyidagi natijalar olinadi ( 2.1-rasm).
Guruch. 2. 8 nafar talabaning o‘rtacha ish vaqti va hal qilingan vazifalar soni.
Do'stlaringiz bilan baham: |