From f40933fd6b5a317eea5d4dc83beffe424a22fa18 Mon Sep 17 00:00:00 2001
From: Ali Ghaedrahmat <alighaedrahmat005@gmail.com>
Date: Sun, 9 Mar 2025 20:12:30 +0330
Subject: [PATCH] First Commit of this project

---
 AP1403 - WarmUp/pom.xml                       |  15 ++--
 AP1403 - WarmUp/src/main/java/Exercises.class | Bin 0 -> 1176 bytes
 AP1403 - WarmUp/src/main/java/Exercises.java  |  64 +++++++++++++++---
 3 files changed, 67 insertions(+), 12 deletions(-)
 create mode 100644 AP1403 - WarmUp/src/main/java/Exercises.class

diff --git a/AP1403 - WarmUp/pom.xml b/AP1403 - WarmUp/pom.xml
index 20d027a..6699250 100644
--- a/AP1403 - WarmUp/pom.xml	
+++ b/AP1403 - WarmUp/pom.xml	
@@ -15,24 +15,31 @@
     </properties>
 
     <dependencies>
+    
         <dependency>
             <groupId>org.junit.jupiter</groupId>
-            <artifactId>junit-jupiter</artifactId>
-            <version>5.11.4</version>
+            <artifactId>junit-jupiter-api</artifactId>
+            <version>5.9.2</version>
             <scope>test</scope>
         </dependency>
+        <dependency>
+            <groupId>org.junit.jupiter</groupId>
+            <artifactId>junit-jupiter-engine</artifactId>
+            <version>5.9.2</version>
+        </dependency>
     </dependencies>
 
     <build>
         <pluginManagement>
             <plugins>
+            
                 <plugin>
                     <groupId>org.apache.maven.plugins</groupId>
                     <artifactId>maven-surefire-plugin</artifactId>
-                    <version>3.5.2</version>
+                    <version>2.22.2</version>
                 </plugin>
             </plugins>
         </pluginManagement>
     </build>
 
-</project>
\ No newline at end of file
+</project>
diff --git a/AP1403 - WarmUp/src/main/java/Exercises.class b/AP1403 - WarmUp/src/main/java/Exercises.class
new file mode 100644
index 0000000000000000000000000000000000000000..fde2003a0eac00c862166b02c18440c8ad2dcbdb
GIT binary patch
literal 1176
zcmZuvO>Y}j6g|)Lo}Xv@k%Zclrncj_rNoYt7*!>f2ozzfEh$YvatQ<%p|LZBDY0D~
z2bFz(LN-(&P*`}=N<gI)frP|@4g3CuF8ULqP;+J+A|Z8b-8pl=-nr-9zn}m12Y?!0
zwGe`#A!ASo3yj}!zH-XjPG_t9Uh|II>I;P5@H$@qihxllt}9mgPe=_<9*r17jYdr)
zAz)s;=k{9Oj=N(a4#PJSF}#E`Y`x`n+@8~SZ}mL(-*(x$uu^2Di4<&&$r#RJ>VF*S
zU+?tYHv4yX$s~0%VCQwq@Ate;zuxb;PJ7ux8X1jj4AaO7oOwZxfV%5f2*^UMxb9cv
zV>s^*tb@RIhoM?`lbptGdL4Idx7~Dmx16TWQhPf*uT3NiH;Nw%#Or;h^~I`l_aq_l
znb+)goL0+Q>1?|9MtL{*YC9eq+l9u6cpxiTd!4Q2;=0BH*}fnoVAZ?3y_S2;^N&xQ
zO1kKehCDS51(%?}!4Rgs!0#;If^RkV7~*FFftP9hu#W{U;uTsy^>auT0<$@5|2rt-
zK@z%}&wDw3C3E>N&HeknH*Y!B!SI=Uz|>ICY#N$avuT9CD3XXFLq5~Q7cqfZMx&6C
zV;FMcC^)--;>oE8JT=OM>p64(Tj(Urhi28PD669B;fdx$Tjdy<%G=7Rn6|3gW<}ZB
zaw>W-eCh}9BVy|T!hZ27t0gi3?=(y<7IGNF3|H<vx9I}Tap*jG&7y!gQdy+Ej1nqX
z2-wD<tmhb$Qf8u6Nv7P@6TZK~2vlmM(|;ivS~ad@(+5~HmSjp2yp@vKA5qGt<>vQD
zq~td+>G=VP`Rt{X9H0AO0DA;y2&4bOJt+pmKlcpUNAo|O&afCrQ=_(5k-#-f;yQ2i
z9h9+x*YPgBYgnbfPP9SmD?N$GKQJ|-;uu<FElVFk@eh+jmQGbSC=5{j9r2CFTyOPe
zDRYSN(Hxlrl#C^nQUvxdNG_!0rIfmSh;w_244=_;h?#)%6Mv^hYcNNdfe*O?9}#U}
z91Tq2HYNXrgm2?De2QiI-bOPZIt@9btV&~EBQAW#z%e4?2xpHtxZt(;z03asB8$}?

literal 0
HcmV?d00001

diff --git a/AP1403 - WarmUp/src/main/java/Exercises.java b/AP1403 - WarmUp/src/main/java/Exercises.java
index 923d44a..4c5a24d 100644
--- a/AP1403 - WarmUp/src/main/java/Exercises.java	
+++ b/AP1403 - WarmUp/src/main/java/Exercises.java	
@@ -4,8 +4,17 @@ public class Exercises {
         complete this function to check if the input number is prime or not
      */
     public boolean isPrime(long n) {
-        // todo
-        return false;
+        if (n <= 1) {
+            return false;
+        }
+
+        for (long i = 2; i * i <= n; i++) {
+            if (n % i == 0) {
+                return false;
+            }
+        }
+
+        return true;
     }
 
     /*
@@ -15,8 +24,25 @@ public boolean isPrime(long n) {
         if the input is not a fibonacci number with description above, return -1
      */
     public long fibonacciIndex(long n) {
-        // todo
-        return -1;
+        if (n < 0) {
+            return -1;
+        }
+
+        long a = 0, b = 1;
+        long index = 1;
+
+        if (n == 0) {
+            return 0;
+        }
+
+        while (b < n) {
+            long temp = a + b;
+            a = b;
+            b = temp;
+            index++;
+        }
+
+        return (b == n) ? index : -1;
     }
 
     /*
@@ -37,12 +63,34 @@ public long fibonacciIndex(long n) {
 
         the output has to be a two-dimensional array of characters, so don't just print the triangle!
      */
+    
     public char[][] generateTriangle(int n) {
-        // todo
-        return null;
+        
+        char[][] triangle = new char[n][];
+        
+        
+        for (int i = 0; i < n; i++) {
+            triangle[i] = new char[i + 1]; 
+            
+            for (int j = 0; j <= i; j++) {
+
+                if ((j == 0) || (j == i) || (i == n - 1)) {
+                    triangle[i][j] = '*';
+                } 
+                else {
+                    triangle[i][j] = ' ';
+                }
+            }
+        }
+
+        if (n == 0) {
+            triangle = new char[0][];
+        }
+        
+        return triangle;
     }
 
+
     public static void main(String[] args) {
-        // you can test your code here, but then it should be checked with test cases
     }
-}
+}
\ No newline at end of file