Istagan butun sonni 17 ga qoldiqsiz bo’linishi yoki bo’linmasligini aniqlovchi dastur tuzing.
Uses crt; Var a: integer; Begin ClrScr; Write(‘a sonnni kiriting=’); readln(a); If trunc(a/17)*17=a then writeln(‘bo`linadi.’) else writeln(‘bo`linmaydi.’); Readln; End.
Kvadratlari berilgan natural N sondan katta bo’lmagan natural sonlarni chiqaruvchi dastur tuzing.
1-usul
Uses crt; Var I,N: integer; Begin ClrScr; Write(‘N ning qiymatini kiriting=’); readln(N); I:=1;
While I*I<=N do Begin writeln(I); I:=I+1; end; Readln; End.
2-usul
uses crt; var n,_n:real; begin textcolor(14); textbackground(1); clrscr; write(‘N sonini kiritng:’); readln(n); _n:=1; while n>sqr(_n) do begin _n:=_n+1; writeln(_n-1); end; readln; end.
Berilgan N natural sonning raqamlari yig’indisini topish dasturini tuzing.
1-usul
var n,raqam,len,i,c,natija: integer; _n,_raqam:string; begin write(‘Natural sonni kiriting:‘);readln(n);
str(n,_n); len:=length(_n); natija:=0; for:=1 to len do begin _raqam:=copy(n,i,1); val(_raqam,raqam,c); natija:=natija+raqam; end; writeln(n,’ sonining raqamlari yig’indisi=’,natija); readln; end.
2-usul
uses crt; var a,len,s,b,n:real; begin clrscr; readln(a); n:=0; while exp(n*ln(10))<a do n:=n+1; repeat
len:=exp((n-1)*ln(10)); b:=trunc(a/len); s:=s+b; a:=a-b*len; n:=n-1; until a<9; write(‘Raqamlari yig`indisi: ‘,s+a:1:0); readln; end.
A(N) butun qiymatli massiv elementlari ichida eng ko’p takrorlanadigan elementlar sonini va o’sha elementni chop etuvchi dastur tuzing.
uses crt; const n1=100; var a:array[1..n1] of integer; max,maxn,sum:integer; I,j,n: integer; begin
writeln(‘Massiv elementlari sonini kiriting: ‘); readln(n); write(‘massiv elementlarini kiriting: ‘);
for i:=1 to n do begin write(‘a(‘,i,’)=’); readln(a[i]); end; max:=1; maxn:=1; for i:=1 to n-1 do begin sum:=0; for j:=i+1 to n do begin if a[i]=a[j] then inc(sum); end; if sum>max then
begin max:=sum; maxn:=i; end; end; writeln; writeln(‘a(‘,maxn,’)=’,a[maxn],’ elementi eng ko`p takrorlanadi’); writeln(max+1,’ marta ‘); readln; end.
Berilgan kesmalardan uchburchakni hosil qilish mumkinligini tekshirish dasturini tuzing.
uses crt; label 1; var a,b,c:real; begin write(‘1-kesma uzunligini kiriting: ‘); readln(a);
write(‘2-kesma uzunligini kiriting: ‘); readln(b);write(‘3-kesma uzunligini kiriting: ‘); readln(c);
if (a+b>c) and (a+c>b) and (b+c>a) then begin writeln(‘Berilgan kesmalardan uchburchak hosil qilish mumkin’); goto 1; end else writeln(‘Berilgan kesmalardan uchburchak hosil qilib bo`lmaydi’);
1: readln; end.