Fixed format

Author: javadev

src/main/java/g3601_3700/s3671_sum_of_beautiful_subsequences/Solution.java

@@ -53,7 +53,6 @@ public int totalBeauty(int[] nums) {
                 }
             }
         }
-
         // Inclusion–exclusion to get exact gcd counts
         long[] exact = new long[maxV + 1];
         for (int g = maxV; g >= 1; g--) {
@@ -66,7 +65,6 @@ public int totalBeauty(int[] nums) {
             }
             exact[g] = s;
         }
-
         long ans = 0;
         for (int g = 1; g <= maxV; g++) {
             if (exact[g] != 0) {
@@ -81,7 +79,6 @@ public int totalBeauty(int[] nums) {
 
     private static final class Fenwick {
         private final long[] tree;
-
         Fenwick(int size) {
             this.tree = new long[size];
         }