Simplified code function is added

pradeepkumar24rk · pradeepkumar24rk · commit f1e082634723 · 2024-07-02T17:17:57.000+05:30
diff --git a/NumberBasedProblems/TailorZero.java b/NumberBasedProblems/TailorZero.java
@@ -1,19 +1,36 @@
 package NumberBasedProblems;
 
 public class TailorZero {
+
+    static int findTrailingZeros(int n)
+    {
+        if (n < 0) // Negative Number Edge Case
+            return -1;
+ 
+        // Initialize result
+        int count = 0;
+ 
+        // Keep dividing n by powers
+        // of 5 and update count
+        for (int i = 5; n / i >= 1; i *= 5)
+            count += n / i;
+ 
+        return count;
+    }
+    
     public static void main(String[] args) {
         long n=201,sum=1,count=0;
         for(long i=2;i<=n;i++)
             sum*=i;
-        System.out.println(sum);
+        System.out.println("Factorial = "+sum);
         while(sum!=0){
             long rem=sum%10;
             if(rem!=0)
                 break;
             count++;
             sum/=10;
         }
-        System.out.println(count);
+        System.out.println("trailing zero count = "+count);
     }
 }
  
