linkedin facebook linkedin facebook nod32

Delphida takrorlanuvchi (sikl) algoritmlarga doir misollar

Muallif: Mengliyev Shoydullo

Qo`shilgan sana: 2014-10-26

Delphida takrorlanuvchi (sikl) algoritmlarga doir misollar


3.1- masala. Y=X^2 ning [0,1] oraliqda 0,1 qadam bilan qiymatlar jadvalini aniqlang.

procedure TForm1.Button1Click(Sender: TObject);
var a,b:byte;
n,y,x:real;s1,s2:string;
begin
a:=strtoint(edit1.Text);
b:=strtoint(edit2.Text);
n:=strtofloat(edit3.Text); x:=a;
memo1.Clear;
repeat y:=sqr(x);
str(x:2,s1);str(y:5,s2);
memo1.lines.Add('x='+s1+' y='+s2);
x:=x+n;
until x>=b;
end; end.

3.2- masala. N natural son va X haqiqiy sonlar berilgan. Quyidagi yig’indini hisoblang.
sinx+sin 2x+...sinnx

Yechish. Izlanayotgan yig’indini S bilan belgilaymiz.

procedure TForm1.Button1Click(Sender: TObject);
var n,i:byte; x,s:real;
begin
n:=strtoint(edit1.text);
x:=strtofloat(edit2.text);
s:=0; x:=sin(x);
for i:=1 to n do
s:=s+exp(i*ln(x));
edit3.text:=floattostr(s);
end;

end.

3.3- masala. N! Aniqlansin. Bunda N natural son.

Yechish. N<34 bo’lganda natural sonlar faktorialini hisoblash mumkin.

procedure TForm1.Button1Click(Sender: TObject);
var n,i:integer; f:int64;
begin
n:=strtoint(edit1.Text);
f:=1;
for i:=1 to n do
f:=f*i;
edit2.Text:=inttostr(f);

end;

end.

3.4- masala. 1dan 20 gacha natural sonlar kvadratlari yig’indisini toping.
Yechish. Izlanayotgan yig’indini S bilan belgilaymiz.

procedure TForm1.Button1Click(Sender: TObject);
var n,i:integer; f:int64;
begin
n:=strtoint(edit1.Text);
f:=0;
for i:=1 to n do
f:=f+sqr(i);
edit2.Text:=inttostr(f);

end;

end.

3.5- masala. A sonining N darajasini takrorlash buyrug’i yordamida hisoblang.
Yechish. A sonning n – darajasiga teng kattalikni y bilan belgilaymiz.

procedure TForm1.Button1Click(Sender: TObject);
var n,i,a,f:integer;
begin
n:=strtoint(edit1.Text);
a:=strtoint(edit2.Text);
f:=1;
for i:=1 to n do f:=f*a;
edit3.Text:=inttostr(f);
end;

end.

3.6-masala. 1 dan 9 gacha bo’lgan sonlarni ko’paytirish jadvalini ekranga chiqaring.

Yechish. Bu masalani yechish uchun 3 marta sikl buyrug’idan foydalanamiz. Birinchi siklda birinchi ko’paytuvchi 1 dan 3 gacha, ikkinchisi esa, 1 dan 9 gacha o’zgaradi. Ikkinchisi siklda birinchi ko’paytuvchi 4 dan 6 gacha, ikkinchisi esa, 1 dan 9 gacha o’zgaradi. Uchinchi siklda birinchi ko’paytuvchi 7 dan 9 gacha, ikkinchisi esa, 1 dan 9 gacha o’zgaradi.

procedure TForm1.Button1Click(Sender: TObject);
var a,b,i,j,s:integer;s1,s2,s3:string;
begin
a:=strtoint(edit1.Text);
b:=strtoint(edit2.Text); memo1.Clear;
for i:=a to b do
for j:=1 to 10 do begin
s:=i*j;
str(s,s1);str(i,s2);str(j,s3);
memo1.Lines.Add(s2+'*'+s3+'='+s1);
end; end;
end.

3.7-masala. L nomerli Fibonachchi sonini ekranga chiqaring.

Yechish. 1,1,2,3,5,8,13,21,34,...sonlar Fibonachchi sonlar ketma-ketligini ifodalaydi. Bu sonlar ketma-ketligida uchinchi hadidan boshlab har bir son o’zidan oldingi ikkita sonning yig’indisiga teng.

procedure TForm1.Button1Click(Sender: TObject);
var n,v,w,r,i:integer;
begin
n:=strtoint(edit1.Text);
w:=0;v:=1;i:=1;
while i<n do begin
r:=v+w; w:=v; v:=r;
i:=i+1;end;
edit2.Text:=inttostr(v);
end;
end.

3.8-masala. N natural son va A haqiqiy son berilgan. Quyidagi ko’paytmani hisoblang:
A(A+1)(A+2) ... (A+N)
Yechish. Berilgan ko’paytmani k bilan belgilaymiz.

procedure TForm1.Button1Click(Sender: TObject);
var a,p:real;i,n:integer;
begin
n:=strtoint(edit1.Text);
a:=strtofloat(edit2.Text);
p:=1;
for i:=0 to n do
p:=p*(a+i);
edit3.Text:=floattostr(p);
end;

end.

3.9-masala. Natural sonni tub ko’paytuvchilarga ajrating.

procedure TForm1.Button1Click(Sender: TObject);
var n,i:integer; s:string;
begin
n:=strtoint(edit1.Text);
memo1.Clear;
for i:=1 to n do
if n mod i=0 then begin
str(i,s);
memo1.Lines.Add(s);
end;end;

end.

3.10-masala. 1 dan 10 gacha bo’lgan sonlardan sikl qadami 1 ga teng holda kvadrat chiqaring.

Yechish. Berilgan x sondan chiqarilgan kvadrat ildizning qiymatini y bilan belgilaymiz.y=x2

procedure TForm1.Button1Click(Sender: TObject);
var a,b,i:byte;
s:real; s1,s2:string;
begin
a:=strtoint(edit1.Text);
b:=strtoint(edit2.Text);
memo1.Clear;
for i:=a to b do begin
s:=sqr(i);
str(i,s2); str(s,s1);
memo1.Lines.Add('x='+s2+' ildiz='+s1);
end;
end;

end.

894 marta o`qildi.

Foydalanuvchi ismi: bektashev 102 gurux
Qo`shilgan sana: 2014-05-21

takrorlanib keluvchga asos bor ekan

Parol:
Eslab qolish.


Ro`yhatdan o`tish

testing

+998915878681

Siz o`z maxsulotingizni 3D reklama ko`rinishda bo`lishini xohlaysizmi? Unda xamkorlik qilamiz.

3D Reklama

testing

masalalar.zn.uz/

Turli xil mavzuda, internet mavzular, faqat masalalar.zn.uz saytda.


Рейтинг@Mail.ru
Рейтинг@Mail.ru

Besucherzahler
счетчик посещений