Merge pull request #692 from Phonggg1410/Features/lab1-32

Hoang Xuan Phong/ lab 1-32

Author: Pastor

pom.xml

@@ -81,6 +81,7 @@
         <module>students/23K0186</module>
         <module>students/23K0755</module>
         <module>students/23K1292</module>
+        <module>students/23L0908</module>
     </modules>
     <dependencies>
         <dependency>

students/23L0908/23L0908-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>23L0908</artifactId>
+        <groupId>ru.mirea.practice</groupId>
+        <version>2024.1</version>
+        <relativePath>../pom.xml</relativePath>
+    </parent>
+    <artifactId>23L0908-p01</artifactId>
+    <description>Массивы</description>
+</project>

students/23L0908/23L0908-p01/src/main/java/ru/mirea/practice/s23l0908/Task3.java

@@ -0,0 +1,27 @@
+package ru.mirea.practice.s23l0908;
+
+import java.util.Scanner;
+
+public final class Task3 {
+    private Task3() {
+    }
+
+    public static void main(String[] args) {
+        try (Scanner scanner = new Scanner(System.in)) {
+            System.out.print("Enter n: ");
+            int n = scanner.nextInt();
+            int[] arr = new int[n];
+            int sum = 0;
+            for (int i = 0; i < n; i++) {
+                System.out.print("arr[" + (i + 1) + "] = ");
+                arr[i] = scanner.nextInt();
+            }
+            for (int i = 0; i < n; i++) {
+                sum += arr[i];
+            }
+            double average = (double) sum / n;
+            System.out.println("Sum: " + sum);
+            System.out.println("Average: " + average);
+        }
+    }
+}

students/23L0908/23L0908-p01/src/main/java/ru/mirea/practice/s23l0908/Task4.java

@@ -0,0 +1,43 @@
+package ru.mirea.practice.s23l0908;
+
+import java.util.Scanner;
+
+public final class Task4 {
+
+    private Task4() {
+    }
+
+    public static void main(String[] args) {
+        try (Scanner scanner = new Scanner(System.in)) {
+            System.out.print("Enter n: ");
+            int n = scanner.nextInt();
+            int[] arr = new int[n];
+            int i = 0;
+            int sum = 0;
+            do {
+                System.out.print("arr[" + i + "] = ");
+                arr[i] = scanner.nextInt();
+                sum += arr[i];
+                i++;
+            } while (i < n);
+
+            i = 0;
+            int min = arr[0];
+            int max = arr[0];
+            while (i < n) {
+                if (arr[i] < min) {
+                    min = arr[i];
+                }
+                if (arr[i] > max) {
+                    max = arr[i];
+                }
+                i++;
+            }
+
+            System.out.println("Sum = " + sum);
+            System.out.println("Min = " + min);
+            System.out.println("Max = " + max);
+        }
+    }
+}
+

students/23L0908/23L0908-p01/src/main/java/ru/mirea/practice/s23l0908/Task5.java

@@ -0,0 +1,19 @@
+package ru.mirea.practice.s23l0908;
+
+public final class Task5 {
+
+    private Task5() {
+    }
+
+    public static void main(String[] args) {
+        if (args.length > 0) {
+            System.out.println("Doi so dong lenh duoc truyen vao:");
+            for (int i = 0; i < args.length; i++) {
+                System.out.println("Doi so " + i + " = " + args[i]);
+            }
+        } else {
+            System.out.println("Doi so khong duoc truyen");
+        }
+    }
+}
+

students/23L0908/23L0908-p01/src/main/java/ru/mirea/practice/s23l0908/Task6.java

@@ -0,0 +1,20 @@
+package ru.mirea.practice.s23l0908;
+
+public final class Task6 {
+
+    private Task6() {
+        // Private constructor to prevent instantiation
+    }
+
+    public static void main(String[] args) {
+        int n = 10;
+        double sum = 0.0;
+        System.out.println("10 number:");
+        for (int i = 1; i <= n; i++) {
+            sum += 1.0 / i;
+            System.out.printf("H%d = %.4f%n", i, sum);
+        }
+        System.out.println("Result: " + sum);
+    }
+}
+

students/23L0908/23L0908-p01/src/main/java/ru/mirea/practice/s23l0908/Task7.java

@@ -0,0 +1,33 @@
+package ru.mirea.practice.s23l0908;
+
+import java.util.Scanner;
+
+public final class Task7 {
+
+    private Task7() {
+        // Private constructor to prevent instantiation
+    }
+
+    public static void main(String[] args) {
+        try (Scanner scanner = new Scanner(System.in)) {
+            System.out.println("Enter n: ");
+            int n = scanner.nextInt();
+            long result = giaithua(n);
+            System.out.print("Result: " + result);
+        }
+    }
+
+    public static long giaithua(int n) {
+        if (n < 0) {
+            System.out.println("Cannot calculate factorial for negative numbers!");
+            return -1;
+        } else {
+            long fact = 1;
+            for (int i = 1; i <= n; i++) {
+                fact *= i;
+            }
+            return fact;
+        }
+    }
+}
+

students/23L0908/23L0908-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>23L0908</artifactId>
+        <groupId>ru.mirea.practice</groupId>
+        <version>2024.1</version>
+        <relativePath>../pom.xml</relativePath>
+    </parent>
+    <artifactId>23L0908-p02</artifactId>
+    <description>Массивы</description>
+</project>

students/23L0908/23L0908-p02/src/main/java/ru/mirea/practice/s23l0908/Ball.java

@@ -0,0 +1,42 @@
+package ru.mirea.practice.s23l0908;
+
+public class Ball {
+    private float x;
+    private float y;
+    private float xspeed;
+    private float yspeed;
+
+    @SuppressWarnings("unused")
+    public Ball() {
+        this.x = 0.0f;
+        this.y = 0.0f;
+        this.xspeed = 1.0f;
+        this.yspeed = 1.0f;
+    }
+
+    public Ball(float x, float y, float xspeed, float yspeed) {
+        this.x = x;
+        this.y = y;
+        this.xspeed = xspeed;
+        this.yspeed = yspeed;
+    }
+
+    public void move() {
+        x += xspeed;
+        y += yspeed;
+    }
+
+    public void reverse() {
+        xspeed = -xspeed;
+        yspeed = -yspeed;
+    }
+
+    public String toString() {
+        return "Ball {"
+            + "x= " + x
+            + ", y= " + y
+            + ",xSpeed=" + xspeed
+            + ",ySpeed=" + yspeed
+            + "}";
+    }
+}

students/23L0908/23L0908-p02/src/main/java/ru/mirea/practice/s23l0908/Testball.java

@@ -0,0 +1,19 @@
+package ru.mirea.practice.s23l0908;
+
+public final class Testball {
+
+    private Testball() {
+
+    }
+
+    public static void main(String[] args) {
+        Ball ball = new Ball(0, 0, 4, 6);
+        System.out.println("Begin: " + ball);
+        ball.move();
+        System.out.println("After move: " + ball);
+        ball.reverse();
+        ball.move();
+        System.out.println("After reverse move: " + ball);
+    }
+}
+