Scribd
Upload
5 views4 pages

HW Massives

The document contains multiple Java classes that implement various functionalities related to arrays, including finding specific indices, calculating sums, averages, and identifying patterns in the array elements. Each class uses a Scanner to read input values and processes the array according to the defined logic. The classes demonstrate different algorithms for manipulating and analyzing integer arrays.

Uploaded by

s75900455
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
5 views4 pages

HW Massives

The document contains multiple Java classes that implement various functionalities related to arrays, including finding specific indices, calculating sums, averages, and identifying patterns in the array elements. Each class uses a Scanner to read input values and processes the array according to the defined logic. The classes demonstrate different algorithms for manipulating and analyzing integer arrays.

Uploaded by

s75900455
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

class array19{

public static void main(String[] args) {


Scanner intScanner=new Scanner(System.in);
int n=intScanner.nextInt();
int indeks = 0;
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i]= intScanner.nextInt();
}
for (int i = 1; i < n; i++) {
if (a[0]<a[i] && a[i]<a[i-1]){
indeks=i;
}
}
System.out.println(indeks);
}}

class array20{
public static void main(String[] args) {
Scanner intScanner=new Scanner(System.in);
int n = intScanner.nextInt();
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = intScanner.nextInt();
}
int K = intScanner.nextInt();
int L = intScanner.nextInt();
int sum = 0;
for (int i = K; i <= L; i++) {
sum += a[i];
}
System.out.println(sum);
}}
class array21{
public static void main(String[] args) {
Scanner intScanner=new Scanner(System.in);
int n = intScanner.nextInt();
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = intScanner.nextInt();
}
int K = intScanner.nextInt();
int L = intScanner.nextInt();
int sum = 0;
for (int i = K; i <= L; i++) {
sum += a[i];
}
System.out.println((double) sum/(L-K+1));
}}
class array22{
public static void main(String[] args) {
Scanner intScanner = new Scanner(System.in);
int n = intScanner.nextInt();
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = intScanner.nextInt();
}
int K = intScanner.nextInt();
int L = intScanner.nextInt();
int sum = 0;
for (int i = 0; i < a.length; i++) {
if (i < K || i > L) {
sum += a[i];

}
System.out.println(sum);
}
}}
class array23{
public static void main(String[] args) {
Scanner intScanner = new Scanner(System.in);
int n = intScanner.nextInt();
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = intScanner.nextInt();
}
int K = intScanner.nextInt();
int L = intScanner.nextInt();
int sum = 0,count=0;
for (int i = 0; i < a.length; i++) {
if (i < K || i > L) {
sum += a[i];
count++;
}
System.out.println((double) sum/count);
}
}}
class array24{
public static void main(String[] args) {
Scanner intScanner=new Scanner(System.in);
int n = intScanner.nextInt();
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = intScanner.nextInt();
}
int b=a[1]-a[0];
int i=2;
while (i<n && a[i]-a[i-1]==b){
i++;
}
if (i==n){
System.out.println(b);
}else {
System.out.println("0");
}
}}
class array25{
public static void main(String[] args) {
Scanner intScanner=new Scanner(System.in);
int n = intScanner.nextInt();
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = intScanner.nextInt();
}
int b=a[1]/a[0];
int i=2;
while (i<n && a[1]/a[0]==b && a[i]%a[i-1]==0){
i++;
}
if (i==n){
System.out.println(b);
}else {
System.out.println("0");
}
}}
class array26{
public static void main(String[] args) {
Scanner intScanner=new Scanner(System.in);
int n = intScanner.nextInt();
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = intScanner.nextInt();
}
int i = 1;
while (i < n && (a[i - 1] % 2 != a[i] % 2)) {
i++;
}
if (i == n) {
System.out.println("Ketma-ketlik to'g'ri"); }
else {
System.out.println(i); }
}}
class array27{
public static void main(String[] args) {
Scanner intScanner=new Scanner(System.in);
int n = intScanner.nextInt();
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = intScanner.nextInt();
}
int i = 1;
while (i < n && (a[i - 1] * a[i] < 0)) {
i++;
}
if (i == n) {
System.out.println("Ketma-ketlik to'g'ri"); }
else {
System.out.println(i);
}
}}
class array28{
public static void main(String[] args) {
Scanner intScanner=new Scanner(System.in);
int n = intScanner.nextInt();
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = intScanner.nextInt();
}
int min = a[0];
for (int i = 2; i < n; i += 2) {
if (a[i] < min) {
min = a[i];
}
}
System.out.println(min);
}}
class array29{
public static void main(String[] args) {
Scanner intScanner=new Scanner(System.in);
int n = intScanner.nextInt();
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = intScanner.nextInt();
}
int max = a[1];
for (int i = 3; i < n; i += 2) {
if (a[i] > max) {
max = a[i];
}
}
System.out.println(max);
}}
class array30{
public static void main(String[] args) {
Scanner intScanner=new Scanner(System.in);
int n = intScanner.nextInt();
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = intScanner.nextInt();
}
int count = 0;
for (int i = 0; i < n - 1; i++) {
if (a[i] > a[i + 1]) {
System.out.println("Indeks: " + i);
count++;
}
}
System.out.println( count);
}}

You might also like