For1, к va n butun sonlari berilgan (n > 0). к sonini n marta chiqaruvchi programma tuzilsin

For1, к va n butun sonlari berilgan (n > 0). к sonini n marta chiqaruvchi programma tuzilsin.

Scanner in = new Scanner(System.in);

System.out.print("k = ");
int k = in.nextInt();
System.out.print("n = ");
int n = in.nextInt();
for (int i=1; i<=n; i+=1) {
System.out.println(k);
}

For2. a va b butun sonlari berilgan (a < b). a va b sonlari orasidagi barcha butun sonlarni (a va b ni ham) chiqaruvchi va chiqarilgan sonlar sonini chiqaruvchi programma tuzilsin. (a va b xam chiqarilsin).

Scanner in = new Scanner(System.in);

System.out.print("a = ");
int a = in.nextInt();
System.out.print("b = ");
int b = in.nextInt();
int s=0;
for (int i=a; i<=b; i++) {
System.out.println(i);
s++;
}
System.out.println("s = " + s);

For3. a va b butun sonlari berilgan (a < b). a va b sonlari orasidagi barcha butun sonlarni (a va b dan tashqari) kamayish tartibida chiqaruvchi va chiqarilgan sonlar sonini chiqaruvchi progma tuzilsin.

Scanner in = new Scanner(System.in);

System.out.print("a = ");
int a = in.nextInt();
System.out.print("b = ");
int b = in.nextInt();
int s=0;
for (int i=b-1; i>a; i--) {
System.out.println(i);
s++;
}
System.out.println("s = " + s);

For4. Bir kg konfetning narxi berilgan (haqiqiy son). 1, 2, ..., 10 kg konfetni narxini chiqaruvchi programma tuzilsin.

Scanner in = new Scanner(System.in);

System.out.print("a = ");
double a = in.nextDouble();
for (int i=1; i<=10; i++) {
System.out.println(i * a);
}

For5. Bir kg konfetning narxi berilgan (haqiqiy son). 0.1, 0.2, ..., 0.9, 1 kg konfetni narxini chiqaruvchi programma tuzilsin.

Scanner in = new Scanner(System.in);

System.out.print("a = ");
double a = in.nextDouble();
for (int i=1; i<=10; i++) {
System.out.println(i * a/10);
}

For6. Bir kg konfetning narxi berilgan (haqiqiy son). 1.2, 1.4, ..., 2 kg konfetni narxini chiqaruvchi programma tuzilsin.

Scanner in = new Scanner(System.in);

System.out.print("a = ");
double a = in.nextDouble();
for (int i=2; i<=10; i+=2) {
System.out.println(a + i * a/10);
}

For7. a va b butun sonlari berilgan (a < b). a dan b gacha bo'lgan barcha butun sonlar yig'indisini chiqaruvchi programma tuzilsin.

Scanner in = new Scanner(System.in);

System.out.print("a = ");
int a = in.nextInt();
System.out.print("b = ");
int b = in.nextInt();
int s=0;
for (int i=a+1; is+=i;
}
System.out.println("s = " + s);

For8. a va b butun sonlari berilgan (a < b). a dan b gacha bo'lgan barcha butun sonlar ko'paytmasini chiqaruvchi programma tuzilsin.

Scanner in = new Scanner(System.in);

System.out.print("a = ");
int a = in.nextInt();
System.out.print("b = ");
int b = in.nextInt();
int p=1;
for (int i=a+1; ip*=i;
}
System.out.println("p = " + p);

For9. a va b butun sonlari berilgan (a < b). a dan b gacha bo'lgan barcha butun sonlar kvadratlarining yig'indisini chiqaruvchi programma tuzilsin.

Scanner in = new Scanner(System.in);

System.out.print("a = ");
int a = in.nextInt();
System.out.print("b = ");
int b = in.nextInt();
int s=0;
for (int i=a+1; is+=i*i;
}
System.out.println("s = " + s);

FortO. n butun soni berilgan (n > 0). Quyidagi yig'indini hisoblovchi programma tuzilsin.

S = 1 + 1/ 2 + 1/ 3 + ... + 1/ n

Scanner in = new Scanner(System.in);

System.out.print("n = ");
int n = in.nextInt();
double s=0;
for (int i=1; i<=n; i++) {
double j = i;
s+=1/j;
}
System.out.println("s = " + s);

For11. n butun soni berilgan (n > 0). Quyidagi yig'indini hisoblovchi programma tuzilsin.

S = n2 +(n+1)2+(n+2)2 + ... (2*n)2

Scanner in = new Scanner(System.in);

System.out.print("n = ");
int n = in.nextInt();
int s=0;
for (int i=0; i<=n; i++) {
s+=2*(n+i) ;
}
System.out.println("s = " + s);

For12. n butun soni berilgan (n > 0). Quyidagi ko'paytmani hisoblovchi programma tuzilsin.

S = 1.1 * 1.2 * 1.3 *... (n ta ko'payuvchi)

Scanner in = new Scanner(System.in);

System.out.print("n = ");
int n = in.nextInt();
double p=1;
for (int i=1; i<=n; i++) {
p*=1+i/10D;
}
System.out.println("p = " + p);

For13. n butun soni berilgan (n > 0). Quyidagi yig'indini hisoblovchi programma tuzilsin.

S = 1.1-1.2 + 13-...
(n ta qo'shiluvchi, ishoralar almashib keladi. Shart operatoridan foydalanmang)

Scanner in = new Scanner(System.in);

System.out.print("n = ");
int n = in.nextInt();
double s=0;
for (int i=1; i<=n; i++) {
if (Math.floorMod(i,2)==0) s-=1+i/10D; else s+=1+i/10D;
System.out.println(1+i/10D);
}
System.out.println("s = " + s);

For14. n butun soni berilgan (n > 0). Shu sonning kvadratini quyidagi formula asosida hisoblovchi

programma tuzilsin.
n2= 1 + 3 + 5 + ... + (2*n -1)
har bir qo'shiluvchidan keyin natijani ekranga chiqarib boring. Natijda ekranda 1 dan n gacha bo'lgan sonlar kvadrati chiqariladi.

Scanner in = new Scanner(System.in);

System.out.print("n = ");
int n = in.nextInt();
int n2=0;
for (int i=1; i<=2*n; i+=2) {
n2+=i;
System.out.println(n2);
}

Fort 15. n butun soni va a haqiqiy soni berilgan (n > 0). a ning n - darajasini aniqlovchi programma tuzilsin. an=a*a*a...a;

Scanner in = new Scanner(System.in);

System.out.print("n = ");
int n = in.nextInt();
System.out.print("a = ");
double a = in.nextDouble();
int an=1;
for (int i=1; i<=n; i++) {
an*=a;
}
System.out.println(an);

For16. n butun soni va a haqiqiy soni berilgan (n > 0). Bir sikldan foydalanib a ning 1 dan n gacha bo'lgan barcha darajalarini chiqaruvchi programma tuzilsin.

Scanner in = new Scanner(System.in);

System.out.print("n = ");
int n = in.nextInt();
System.out.print("a = ");
double a = in.nextDouble();
int an=1;
for (int i=1; i<=n; i++) {
an*=a;
System.out.println(an);
}

For17. n butun soni va a haqiqiy soni berilgan (n > 0). Bir sikldan foydalanib quyidagi a ning 1 dan n gacha bo'lgan barcha darajalarini chiqaruvchi va yig'indini hisoblovchi programma tuzilsin.

1 + a + a2 + a3 + ... an

Scanner in = new Scanner(System.in);

System.out.print("n = ");
int n = in.nextInt();
System.out.print("a = ");
double a = in.nextDouble();
double an=1;
double s=0;
for (int i=0; i<=n; i++) {
an=Math.pow(a,i);
s+=an;
System.out.println(an);
}
System.out.println(s);

For18. n butun soni va a haqiqiy soni berilgan (n > 0). Bir sikldan foydalanib quyidagi a ning 1 dan n gacha bo'lgan barcha darajalarini chiqaruvchi va yig'indini hisoblovchi programma tuzilsin.

1 - a + a2 - a3 + ... (-1)n an Shart operatoridan foydalanilmasin.

Scanner in = new Scanner(System.in);

System.out.print("n = ");
int n = in.nextInt();
System.out.print("a = ");
double a = in.nextDouble();
double an=1;
double s=0;
for (int i=0; i<=n; i++) {
an=Math.pow((-1),i)*Math.pow(a,i);
s+=an;
System.out.println(an);
}
System.out.println(s);

For19. n butun soni berilgan (n > 0). Birdan n gacha bo'lgan sonlar ko'paytmasini chiqaruvchi programma tuzilsin. n! = 1 * 2 *... n

Birdan n gacha bo'lgan sonlar ko'paytmasi n faktorial deyiladi.

Scanner in = new Scanner(System.in);

System.out.print("n = ");
int n = in.nextInt();
int p=1;
for (int i=1; i<=n; i++) {
p*=i;
}
System.out.println("p = " + p);

For20. n butun soni berilgan (n > 0). Bir sikldan foydalangan holda quyidagi yig'indini hisoblovchi programma tuzilsin.

1! + 2! + 3! + ... +n!

Scanner in = new Scanner(System.in);

System.out.print("n = ");
int n = in.nextInt();
int p=1;
int s=0;
for (int i=1; i<=n; i++) {
p*=i;
s+=p;
}
System.out.println("s = " + s);

For21. n butun soni berilgan (n > 0). Bir sikldan foydalangan holda quyidagi yig'indini hisoblovchi programma tuzilsin. (Olingan natija taxminan e = exp(1) ga yaqinlashadi)

1 + 1/(1!) + 1/(2!) + 1/(3!) + ... +1/(n!)

Scanner in = new Scanner(System.in);

System.out.print("n = ");
int n = in.nextInt();
double p=1;
double s=1;
for (int i=1; i<=n; i++) {
p*=i;
s+=1/p;
}
System.out.println("s = " + s);

For22. n butun soni va x haqiqiy soni berilgan (n > 0). Quyidagi yig'indini hisoblovchi programma tuzilsin. (Olingan natija taxminan ex ga yaqinlashadi)

1 + x + x2 / (2!) + x3 / (3!) + ... +xn /(n!)

Scanner in = new Scanner(System.in);

System.out.print("n = ");
int n = in.nextInt();
System.out.print("x = ");
double x = in.nextDouble();
double p=1;
double s=1;
for (int i=1; i<=n; i++) {
p*=i;
s+=Math.pow(x,i)/p;
}
System.out.println("s = " + s);

For23. n butun soni va x haqiqiy soni berilgan (n > 0). Quyidagi yig'indini hisoblovchi programma tuzilsin. (Olingan natija taxminan sin(x) ga yaqinlashadi) x - x3 / (3!) + x5 / (5!) -... +(-1)n x2n+1 /((2*n+1)!)

Scanner in = new Scanner(System.in);

System.out.print("n = ");
int n = in.nextInt();
System.out.print("x = ");
double x = in.nextDouble();
double p=1;
double s=1;
for (int i=1; i<=2*n+1; i++) {
p*=i;
if (Math.floorMod(i,2)==1) s+=Math.pow((-1),Math.floorMod(i/2,2))*Math.pow(x,i)/p;
}
System.out.println("s = " + s);

For24. n butun soni va x haqiqiy soni berilgan (n > 0). Quyidagi yig'indini hisoblovchi programma tuzilsin. (Olingan natija taxminan cos(x) ga yaqinlashadi)

1. 
   - x2 / (2!) + x4 / (4!) -... +(-1)n x2" /((2*n)!)
   

Scanner in = new Scanner(System.in);

System.out.print("n = ");
int n = in.nextInt();
System.out.print("x = ");
double x = in.nextDouble();
double p=1;
double s=1;
for (int i=2; i<=2*n; i++) {
p*=i;
if (Math.floorMod(i,2)==0) s+=Math.pow((-1),Math.floorMod(i/2,2))*Math.pow(x,i)/p;
}
System.out.println("s = " + s);

For25. n butun soni va x haqiqiy soni berilgan (n > 0. |x| < 1). Quyidagi yig'indini hisoblovchi programma tuzilsin.

x- x2 / 2 + x3 / 3 -... +(-1)n"1 xn/n

Scanner in = new Scanner(System.in);

System.out.print("n = ");
int n = in.nextInt();
System.out.print("x = ");
double x = in.nextDouble();
if (Math.abs(x)<1) {
double s = 1;
for (int i = 1; i <= 2 * n; i++) {
s += Math.pow((-1), i + 1) * Math.pow(x, i) / i;
}
System.out.println("s = " + s);
}

For26. n butun soni va x haqiqiy soni berilgan (n > 0. |x| < 1). Quyidagi yig'indini hisoblovchi programma tuzilsin.

x - x3 / 3 + x5 / 5 -... +(-1)n x2n+1 / (2n + 1)

Scanner in = new Scanner(System.in);

System.out.print("n = ");
int n = in.nextInt();
System.out.print("x = ");
double x = in.nextDouble();
if (Math.abs(x)<1) {
double s = 1;
for (int i = 1; i <= 2 * n + 1; i += 2) {
s += Math.pow((-1), Math.floorMod(i / 2, 2)) * Math.pow(x, i) / i;
System.out.println(Math.pow((-1), Math.floorMod(i / 2, 2)));
}
System.out.println("s = " + s);
}

For27. n butun soni va x haqiqiy soni berilgan (n > 0, |x| < 1). Quyidagi yig'indini hisoblovchi programma tuzilsin.

x + 1 * x3 / (2 * 3) + 1 *3*x5 / (2*4*5) + ... +
+ 1*3* ...*(2*n-1 )*x2n+1 /(2*4*..*(2*n)*(2*n+1))

Scanner in = new Scanner(System.in);

System.out.print("n = ");
int n = in.nextInt();
System.out.print("x = ");
double x = in.nextDouble();
if (Math.abs(x)<1) {
double s = x, a=1, b=1;
for (int i = 1; i <= n; i += 1) {
a*=2*i-1;
b*=(2*i)*(2*i+1);
s+=a*Math.pow(x,2*i+1)/b;
}
System.out.println("s = " + s);
}

For28. n butun soni va x haqiqiy soni berilgan (n > 0. |x| < 1). Quyidagi yig'indini hisoblovchi programma tuzilsin.

1+ x / 2 -1 * x2 / (2 * 4) + 1 *3*x3 / (2*4*6) -... +
+ (-1)n'1 *1*3* ...*(2*n-3)*xn /(2*4*..*(2*n))

Scanner in = new Scanner(System.in);

System.out.print("n = ");
int n = in.nextInt();
System.out.print("x = ");
double x = in.nextDouble();
if (Math.abs(x)<1) {
double s = 1, a=1, b=1;
for (int i = 1; i <= n; i += 1) {
a*=2*n-3;
b=2*n;
s+=Math.pow((-1),i)*a*Math.pow(x,i)/b;
}
System.out.println("s = " + s);
}

For29. n butun soni va sonlar o'qida 2 ta A. В nuqta berilgan. (A. В haqiqiy son). [A. B] kesmani teng n ta kesmaga bo'ling. [A. B] kesmada ajratilgan barcha nuqtalarni chiqaring.

Scanner in = new Scanner(System.in);

System.out.print("n = ");
int n = in.nextInt();
System.out.print("A = ");
double a = in.nextDouble();
System.out.print("B = ");
double b = in.nextDouble();
for (int i=0; i<=n; i++) {
System.out.println((b-a)/n*i+a);
}

For30. n butun soni va sonlar o'qida 2 ta A. В nuqta berilgan. (A. В haqiqiy son). [A. B] kesmani teng n ta kesmaga bo'ling. [A. B] kesmada ajratilgan barcha nuqtalar uchun F(X) = 1 - sin(X) funksiya qiymatini hisoblang.

Scanner in = new Scanner(System.in);

System.out.print("n = ");
int n = in.nextInt();
System.out.print("A = ");
double a = in.nextDouble();
System.out.print("B = ");
double b = in.nextDouble();
for (int i=0; i<=n; i++) {
System.out.println(1-Math.sin((b-a)/n*i+a));
}

For31. n butun soni berilgan (n > 0). Quyidagi ketma - ketlikning dastlabki n ta hadini chiqaruvchi programma tuzilsin.

A0 = 2; AK = 2 + 1/AK1; K=1,2, ...

Scanner in = new Scanner(System.in);

System.out.print("n = ");
int n = in.nextInt();
if (n>0) {
double s = 2;
for (int i = 1; i <= n; i++) {
s = 2 + 1 / s;
System.out.println(s);
}
}

For32. n butun soni berilgan (n > 0). Quyidagi ketma - ketlikning dastlabki n ta hadini chiqaruvchi programma tuzilsin.

A0 = 1; ak = (Ak1 + 1) / K; K = 1,2,...

Scanner in = new Scanner(System.in);

System.out.print("n = ");
int n = in.nextInt();
if (n>0) {
double s = 1;
for (int i = 1; i <= n; i++) {
s = (s + 1) / i;
System.out.println(s);
}
}

For33. n butun soni berilgan (n > 1). Fibonachchi ketma - ketlikning dastlabki n ta hadini chiqaruvchi programma tuzilsin.

F, = 1: F2 = 1: FK = Fk_2 + FK1: К = 3, 4. ..

Scanner in = new Scanner(System.in);

System.out.print("n = ");
int n = in.nextInt();
if (n>1) {
double s = 2;
int f[] = new int[n + 1];
f[1] = 1;
f[2] = 1;
System.out.print(f[1] + ", " + f[2] + ", ");
for (int i = 3; i <= n; i++) {
if (i == n) {
f[i] = f[i - 1] + f[i - 2];
System.out.println(f[i]);
} else {
f[i] = f[i - 1] + f[i - 2];
System.out.print(f[i] + ", ");
}
}
}

For34 n butun soni berilgan (n > 1). Quyidagi ketma - ketlikning dastlabki n ta hadini chiqaruvchi programma tuzilsin.

Scanner in = new Scanner(System.in);

System.out.print("n = ");
int n = in.nextInt();
if (n>1) {
double s = 2;
double a[] = new double[n + 1];
a[1] = 1;
a[2] = 2;
System.out.print(a[1] + ", " + a[2] + ", ");
for (int i = 3; i <= n; i++) {
double j = i;
if (i == n) {
a[i] = (a[i - 1] + 2 * a[i - 2]) / j;
System.out.println(a[i]);
} else {
a[i] = (a[i - 1] + 2 * a[i - 2]) / j;
System.out.print(a[i] + ", ");
}
}
}

A1 = 1; A2 = 2; AK = (Ak_2 + 2*AK1) / 3; К = 3, 4, ...

For35. n butun soni berilgan (n > 2). Quyidagi ketma - ketlikning dastlabki n ta hadini chiqaruvchi programma tuzilsin.
A, = 1: A, = 2; A3 = 3; AK = AK_, + AK_2 - 2>AK.3: К = 4, 5,...
Ichma - ich ochilgan sikllar

Scanner in = new Scanner(System.in);

System.out.print("n = ");
int n = in.nextInt();
if (n>2) {
double a[] = new double[n + 1];
a[1] = 1;
a[2] = 2;
a[3] = 3;
System.out.print(a[1] + ", " + a[2] + ", " + a[3] + ", ");
for (int i = 4; i <= n; i++) {
if (i == n) {
a[i] = a[i - 3] + a[i - 2] - 2 * a[i - 1];
System.out.print(a[i]);
}
a[i]=a[i-3]+a[i-2]-2*a[i-1];
System.out.print(a[i] + ", ");
}
}

For36. N va К butun sonlari berilgan. Quyidagi yig'indini chiqaruvchi programma tuzilsin.

!K + 2K+ +NK

Scanner in = new Scanner(System.in);

System.out.print("n = ");
int n = in.nextInt();
System.out.print("k = ");
int k = in.nextInt();
int p=1, s=0;
for (int i = 1; i <= k; i++) {
p*=i;
}
for (int i = 2; i <= n; i++) {
s+=i*k;
}
System.out.println(p+s);

For37. N butun soni berilgan. Quyidagi yig'indini chiqaruvchi programma tuzilsin.

11. 
    + 22 + ... + Nn
    

Scanner in = new Scanner(System.in);

System.out.print("n = ");
int n = in.nextInt();
int s=0;
for (int i = 1; i <= n; i++) {
s+=i*10+i;
}
System.out.println(s);

For38. N butun soni berilgan. Quyidagi yig'indini chiqaruvchi programma tuzilsin.

1n + 2n-1 + ... + N1

Scanner in = new Scanner(System.in);

System.out.print("n = ");
int n = in.nextInt();
int s=0, k=n;
for (int i = 1; i <= k; i++) {
s+=i*n;
n-=1;
}
System.out.println(s);

For39. A va В butun soni berilgan (A < B). A va В sonlari orasidagi barcha butun sonlarni chiqaruvchi programma tuzilsin. Bunda har bir son o'zining qiymaticha chiqarilsin. Ya'ni 3 soni 3 marta chiqariladi.

Scanner in = new Scanner(System.in);

System.out.print("A = ");
int a = in.nextInt();
System.out.print("B = ");
int b = in.nextInt();
if (afor (int i = a; i <= b; i++) {
for (int j=1; j<=i; j++) {
System.out.println(i);
}
}
}

For40. A va В butun soni berilgan (A < B). A va В sonlari orasidagi barcha butun sonlarni chiqaruvchi programma tuzilsin. Bunda A soni 1 marta. (A + 1) soni 2 marta chiqariladi va xakazo.

Scanner in = new Scanner(System.in);

System.out.print("A = ");
int a = in.nextInt();
System.out.print("B = ");
int b = in.nextInt();
if (afor (int i = a; i <= b; i++) {
for (int j=1; j<=i-a+1; j++) {
System.out.println(i);
}
}
}