Merge pull request #1 from DNLdmitrylavrischev/feuters/lab1

feuters/lab1

Author: DNLdmitrylavrischev

pom.xml

@@ -72,6 +72,7 @@
         <module>students/23K0505</module>
         <module>students/23K0359</module>
         <module>students/23K0688</module>
+        <module>students/23K0355</module>
         <module>students/23K0215</module>
         <module>students/23K1167</module>
         <module>students/23K1226</module>

students/23K0355/23K0355-p01/pom.xml

@@ -0,0 +1,13 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://maven.apache.org/POM/4.0.0"
+         xsi:schemaLocation="http://maven.apache.org/POM/4.0.0 http://maven.apache.org/xsd/maven-4.0.0.xsd">
+    <modelVersion>4.0.0</modelVersion>
+    <parent>
+        <artifactId>23K0355</artifactId>
+        <groupId>ru.mirea.practice</groupId>
+        <version>2024.1</version>
+        <relativePath>../pom.xml</relativePath>
+    </parent>
+    <artifactId>23K0355-p01</artifactId>
+    <description>Практика№1 Лаврищев Д.Н.</description>
+</project>

students/23K0355/23K0355-p01/src/main/java/ru/mirea/practice/s0000001/task1/Main.java

@@ -0,0 +1,31 @@
+package ru.mirea.practice.s0000001.task1;
+
+import java.util.Scanner;
+
+public abstract class Main {
+    public static void main(String[] args) {
+        try (Scanner input = new Scanner(System.in)) {
+            System.out.print("Введите количестлво элементов: ");
+            int count = input.nextInt();
+
+            int[] arr = new int[count];
+
+            System.out.println("Введите элементы:");
+            for (int j = 0; j < count; j++) {
+                arr[j] = input.nextInt();
+            }
+
+            int total = 0;
+            double average;
+
+            for (int value : arr) {
+                total += value;
+            }
+
+            average = (double) total / arr.length;
+
+            System.out.println("Сумма: " + total);
+            System.out.println("Среднее: " + average);
+        }
+    }
+}

students/23K0355/23K0355-p01/src/main/java/ru/mirea/practice/s0000001/task2/Mainn.java

@@ -0,0 +1,47 @@
+package ru.mirea.practice.s0000001.task2;
+
+import java.util.Scanner;
+
+public final class Mainn {
+
+    private Mainn() {}
+
+    public static void main(String[] args) {
+
+        try (Scanner scanner = new Scanner(System.in)) {
+            System.out.print("Введите разгмер массива: ");
+            int size = scanner.nextInt();
+
+            int[] numbers = new int[size];
+
+            System.out.println("Введите элементы массива:");
+            for (int i = 0; i < size; i++) {
+                numbers[i] = scanner.nextInt();
+            }
+
+            int sum = 0;
+            int i = 0;
+            do {
+                sum += numbers[i];
+                i++;
+            } while (i < size);
+
+            int max = numbers[0];
+            int min = numbers[0];
+            i = 1;
+            while (i < size) {
+                if (numbers[i] > max) {
+                    max = numbers[i];
+                }
+                if (numbers[i] < min) {
+                    min = numbers[i];
+                }
+                i++;
+            }
+
+            System.out.println("Сумма элементов массива: " + sum);
+            System.out.println("Максимальный элемент массива: " + max);
+            System.out.println("Минимальный элемент массива: " + min);
+        }
+    }
+}

students/23K0355/23K0355-p01/src/main/java/ru/mirea/practice/s0000001/task3/Main.java

@@ -0,0 +1,16 @@
+package ru.mirea.practice.s0000001.task3;
+
+public final class Main {
+
+    private Main() {}
+
+    public static void main(String[] args) {
+        int n = 10;
+
+        System.out.println("Первые " + n + " чисело гармонического ряда:");
+        for (int i = 1; i <= n; i++) {
+            double harmonicNumber = 1.0 / i;
+            System.out.printf("H%d = %.4f%n", i, harmonicNumber);
+        }
+    }
+}

students/23K0355/23K0355-p01/src/main/java/ru/mirea/practice/s0000001/task4/Main.java

@@ -0,0 +1,29 @@
+package ru.mirea.practice.s0000001.task4;
+
+import java.util.Scanner;
+
+public final class Main {
+
+    private Main() {}
+
+    public static long calculateFactorial(int number) {
+        long factorial = 1;
+        for (int i = 1; i <= number; i++) {
+            factorial *= i;
+        }
+        return factorial;
+    }
+
+    public static void main(String[] args) {
+
+        try (Scanner scanner = new Scanner(System.in)) {
+
+            System.out.print("Введите число длоя вычисления его факториала: ");
+            int number = scanner.nextInt();
+
+            long result = calculateFactorial(number);
+
+            System.out.println("Факториал числа " + number + " равен " + result);
+        }
+    }
+}

students/23K0355/23K0355-p02/pom.xml

@@ -0,0 +1,13 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://maven.apache.org/POM/4.0.0"
+         xsi:schemaLocation="http://maven.apache.org/POM/4.0.0 http://maven.apache.org/xsd/maven-4.0.0.xsd">
+    <modelVersion>4.0.0</modelVersion>
+    <parent>
+        <artifactId>23K0355</artifactId>
+        <groupId>ru.mirea.practice</groupId>
+        <version>2024.1</version>
+        <relativePath>../pom.xml</relativePath>
+    </parent>
+    <artifactId>23K0355-p02</artifactId>
+    <description>Практика№2 Лаврищев Д.Н.</description>
+</project>

students/23K0355/23K0355-p02/src/main/java/ru/mirea/practice/s0000001/task1/task1/task1/Circle.java

@@ -0,0 +1,24 @@
+package ru.mirea.practice.s0000001.task1.task1.task1;
+
+public class Circle {
+    private Point center;
+    private double radius;
+
+    public Circle(Point center, double radius) {
+        this.center = center;
+        this.radius = radius;
+    }
+
+    public Point getCenter() {
+        return center;
+    }
+
+    public double getRadius() {
+        return radius;
+    }
+
+    @Override
+    public String toString() {
+        return "Круг(центр: " + center + ", радиус: " + radius + ")";
+    }
+}

students/23K0355/23K0355-p02/src/main/java/ru/mirea/practice/s0000001/task1/task1/task1/Point.java

@@ -0,0 +1,24 @@
+package ru.mirea.practice.s0000001.task1.task1.task1;
+
+public class Point {
+    private double x;
+    private double y;
+
+    public Point(double x, double y) {
+        this.x = x;
+        this.y = y;
+    }
+
+    public double getX() {
+        return x;
+    }
+
+    public double getY() {
+        return y;
+    }
+
+    @Override
+    public String toString() {
+        return "Точка(" + x + ", " + y + ")";
+    }
+}

students/23K0355/23K0355-p02/src/main/java/ru/mirea/practice/s0000001/task1/task1/task1/Tester.java

@@ -0,0 +1,52 @@
+package ru.mirea.practice.s0000001.task1.task1.task1;
+
+import java.util.Scanner;
+
+public class Tester {
+    private Circle[] circles;
+    private int count;
+
+    public Tester(int size) {
+        circles = new Circle[size];
+        count = 0;
+    }
+
+    public void addCircle(Circle circle) {
+        if (count < circles.length) {
+            circles[count] = circle;
+            count++;
+        } else {
+            System.out.println("Массив заполнен. Не удается добавить больше кружочков.");
+        }
+    }
+
+    public void printCircles() {
+        for (int i = 0; i < count; i++) {
+            System.out.println(circles[i]);
+        }
+    }
+
+    public int getCount() {
+        return count;
+    }
+
+    public static void main(String[] args) {
+        try (Scanner scanner = new Scanner(System.in)) {
+            Tester tester = new Tester(3);
+
+            for (int i = 0; i < 3; i++) {
+                System.out.println("Введите координату x для центра окружности " + (i + 1) + ": ");
+                double x = scanner.nextDouble();
+                System.out.println("Введите координату y для центра окружности " + (i + 1) + ": ");
+                double y = scanner.nextDouble();
+                System.out.println("Введите радиус окружности " + (i + 1) + ": ");
+                double radius = scanner.nextDouble();
+
+                tester.addCircle(new Circle(new Point(x, y), radius));
+            }
+
+            tester.printCircles();
+            System.out.println("Общее количество кругов: " + tester.getCount());
+        }
+    }
+}