update

OneCodeMonkey · OneCodeMonkey · commit fb09c9152c0b · 2024-01-07T15:56:57.000+08:00
diff --git a/codeForces/Codeforces_0102B_Sum_of_Digits.java b/codeForces/Codeforces_0102B_Sum_of_Digits.java
@@ -0,0 +1,27 @@
+// AC: 404 ms 
+// Memory: 0 KB
+// .
+// T:O(logn), S:O(1)
+// 
+import java.util.Scanner;
+
+public class Codeforces_0102B_Sum_of_Digits {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        String n = sc.next();
+        int sumDigit = 0, ret = n.length() > 1 ? 1 : 0;
+        for (char c : n.toCharArray()) {
+            sumDigit += c - '0';
+        }
+        while (sumDigit >= 10) {
+            int copy = sumDigit, tempSum = 0;
+            while (copy > 0) {
+                tempSum += copy % 10;
+                copy /= 10;
+            }
+            sumDigit = tempSum;
+            ret++;
+        }
+        System.out.println(ret);
+    }
+}
diff --git a/codeForces/Codeforces_0448A_Rewards.java b/codeForces/Codeforces_0448A_Rewards.java
@@ -0,0 +1,17 @@
+// AC: 218 ms 
+// Memory: 0 KB
+// .
+// T:O(1), S:O(1)
+// 
+import java.util.Scanner;
+
+public class Codeforces_0448A_Rewards {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        int a1 = sc.nextInt(), a2 = sc.nextInt(), a3 = sc.nextInt(), b1 = sc.nextInt(), b2 = sc.nextInt(),
+                b3 = sc.nextInt(), x = sc.nextInt();
+        int sum1 = a1 + a2 + a3, sum2 = b1 + b2 + b3,
+                needed = (sum1 % 5 == 0 ? sum1 / 5 : (sum1 / 5 + 1)) + (sum2 % 10 == 0 ? sum2 / 10 : (sum2 / 10 + 1));
+        System.out.println(needed <= x ? "YES" : "NO");
+    }
+}
diff --git a/codeForces/Codeforces_0598A_Tricky_Sum.java b/codeForces/Codeforces_0598A_Tricky_Sum.java
@@ -0,0 +1,33 @@
+// AC: 280 ms 
+// Memory: 0 KB
+// Math.
+// T:O(sum(log ni)), S:O(1)
+// 
+import java.util.Scanner;
+
+public class Codeforces_0598A_Tricky_Sum {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        int t = sc.nextInt(), maxScore = 0;
+        for (int i = 0; i < t; i++) {
+            int n = sc.nextInt();
+            long sum = (long) n * (n + 1) / 2, ret = 0;
+            int largestPower = findLargestPowerBelow(n);
+            ret = sum - 2 * (2L * largestPower - 1);
+
+            System.out.println(ret);
+        }
+    }
+
+    private static int findLargestPowerBelow(int num) {
+        int cur = 1, base = 2;
+        for (int exp = 0; exp < 31; exp++) {
+            if (num >= cur && num < cur * base) {
+                return cur;
+            }
+            cur *= base;
+        }
+
+        return -1;
+    }
+}
diff --git a/codeForces/Codeforces_1041A_Heist.java b/codeForces/Codeforces_1041A_Heist.java
@@ -0,0 +1,19 @@
+// AC: 233 ms 
+// Memory: 0 KB
+// .
+// T:O(n), S:O(1)
+// 
+import java.util.Scanner;
+
+public class Codeforces_1041A_Heist {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        int n = sc.nextInt(), minVal = Integer.MAX_VALUE, maxVal = 0;
+        for (int i = 0; i < n; i++) {
+            int a = sc.nextInt();
+            minVal = Math.min(minVal, a);
+            maxVal = Math.max(maxVal, a);
+        }
+        System.out.println(maxVal - minVal + 1 - n);
+    }
+}
diff --git a/codeForces/Codeforces_1180A_Alex_and_a_Rhombus.java b/codeForces/Codeforces_1180A_Alex_and_a_Rhombus.java
@@ -0,0 +1,14 @@
+// AC: 217 ms 
+// Memory: 0 KB
+// Math: 等差数列.
+// T:O(1), S:O(1)
+// 
+import java.util.Scanner;
+
+public class Codeforces_1180A_Alex_and_a_Rhombus {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        int n = sc.nextInt();
+        System.out.println(1 + 4 * n * (n - 1) / 2);
+    }
+}
diff --git a/leetcode_solved/leetcode_2971_Find_Polygon_With_the_Largest_Perimeter.java b/leetcode_solved/leetcode_2971_Find_Polygon_With_the_Largest_Perimeter.java
@@ -0,0 +1,23 @@
+// AC: Runtime 38 ms Beats 5.92% of users with Java
+// Memory 56.12 MB Beats 82.70% of users with Java
+// Sort.
+// T:O(nlogn), S:O(logn)
+// 
+class Solution {
+    public long largestPerimeter(int[] nums) {
+        Arrays.sort(nums);
+        int len = nums.length;
+        long curSum = 0;
+        for (int num : nums) {
+            curSum += num;
+        }
+        for (int i = len - 1; i >= 2; i--) {
+            if (nums[i] < curSum - nums[i]) {
+                return curSum;
+            }
+            curSum -= nums[i];
+        }
+
+        return -1;
+    }
+}
diff --git a/leetcode_solved/leetcode_2980_Check_if_Bitwise_OR_Has_Trailing_Zeros.java b/leetcode_solved/leetcode_2980_Check_if_Bitwise_OR_Has_Trailing_Zeros.java
@@ -0,0 +1,17 @@
+// AC: Runtime 2 ms Beats 33.33% of users with Java
+// Memory 43.77 MB Beats 33.33% of users with Java
+// Find the two or more even numbers.
+// T:O(n), S:O(1)
+// 
+class Solution {
+    public boolean hasTrailingZeros(int[] nums) {
+        int countEven = 0;
+        for (int num : nums) {
+            if (num % 2 == 0) {
+                countEven++;
+            }
+        }
+
+        return countEven >= 2;
+    }
+}
