2310 added.

liuyubobobo · liuyubobobo · commit 491a3d3d9c9b · 2022-06-21T11:26:33.000-07:00
diff --git a/2001-2500/2309-Greatest-English-Letter-in-Upper-and-Lower-Case/cpp-2309/main.cpp b/2001-2500/2309-Greatest-English-Letter-in-Upper-and-Lower-Case/cpp-2309/main.cpp
@@ -1,6 +1,6 @@
 /// Source : https://leetcode.com/problems/greatest-english-letter-in-upper-and-lower-case/
 /// Author : liuyubobobo
-/// Time   : 2022-06-21
+/// Time   : 2022-06-18
 
 #include <iostream>
 #include <vector>
diff --git a/2001-2500/2310-Sum-of-Numbers-With-Units-Digit-K/cpp-2310/CMakeLists.txt b/2001-2500/2310-Sum-of-Numbers-With-Units-Digit-K/cpp-2310/CMakeLists.txt
@@ -0,0 +1,6 @@
+cmake_minimum_required(VERSION 3.22)
+project(B)
+
+set(CMAKE_CXX_STANDARD 14)
+
+add_executable(B main.cpp)
diff --git a/2001-2500/2310-Sum-of-Numbers-With-Units-Digit-K/cpp-2310/main.cpp b/2001-2500/2310-Sum-of-Numbers-With-Units-Digit-K/cpp-2310/main.cpp
@@ -0,0 +1,42 @@
+/// Source : https://leetcode.com/problems/sum-of-numbers-with-units-digit-k/
+/// Author : liuyubobobo
+/// Time   : 2022-06-18
+
+#include <iostream>
+
+using namespace std;
+
+
+/// Ad-Hoc
+/// Time Complexity: O(1)
+/// Space Complexity: O(1)
+class Solution {
+public:
+    int minimumNumbers(int num, int k) {
+
+        if(num == 0) return 0;
+
+        int cnt = 1;
+        for(cnt = 1; cnt <= 10; cnt ++)
+            if((cnt * k) % 10 == num % 10)
+                break;
+
+        if(cnt == 11 ||cnt * k > num) return -1;
+        return cnt;
+    }
+};
+
+
+int main() {
+
+    cout << Solution().minimumNumbers(58, 9) << '\n';
+    // 2
+
+    cout << Solution().minimumNumbers(37, 2) << '\n';
+    // -1
+
+    cout << Solution().minimumNumbers(0, 7) << '\n';
+    // 0
+
+    return 0;
+}
diff --git a/readme.md b/readme.md
@@ -2155,6 +2155,7 @@ email: [liuyubobobo@gmail.com](mailto:liuyubobobo@gmail.com)
 | | | | | | |
 | 2308 | Database Problem: [Link](https://github.com/liuyubobobo/Play-Leetcode-Database/) | - | - | - | - |
 | 2309 | [Greatest English Letter in Upper and Lower Case](https://leetcode.com/problems/greatest-english-letter-in-upper-and-lower-case/) | [无] | [C++](2001-2500/2309-Greatest-English-Letter-in-Upper-and-Lower-Case/cpp-2309/) | | |
+| 2310 | [Sum of Numbers With Units Digit K](https://leetcode.com/problems/sum-of-numbers-with-units-digit-k/) | [无] | [C++](2001-2500/2310-Sum-of-Numbers-With-Units-Digit-K/cpp-2310/) | | |
 | | | | | | |
 | 2312 | [Selling Pieces of Wood](https://leetcode.com/problems/selling-pieces-of-wood/) | [无] | [C++](2001-2500/2312-Selling-Pieces-of-Wood/cpp-2312/) | | |
 | | | | | | |
