[ADD] BOJ 14625 냉동식품

- 구현

Author: tdm1223

acmicpc.net/README.md

@@ -272,7 +272,7 @@
 | 203  |   [알고리즘 수업 - 알고리즘의 수행 시간 4](https://www.acmicpc.net/problem/24265)    | [cpp](source/24265.cpp) | 204  |                   [콘서트](https://www.acmicpc.net/problem/16466)                    | [cpp](source/16466.cpp) |
 | 205  |                     [저항](https://www.acmicpc.net/problem/1076)                     | [cpp](source/1076.cpp)  | 206  |                [공사장 표지판](https://www.acmicpc.net/problem/23055)                | [cpp](source/23055.cpp) |
 | 207  |                  [Ресторан](https://www.acmicpc.net/problem/23738)                   | [cpp](source/23738.cpp) | 208  |                  [자동완성](https://www.acmicpc.net/problem/24883)                   | [cpp](source/24883.cpp) |
-| 209  |                  [팰린드롬](https://www.acmicpc.net/problem/10174)                   | [cpp](source/10174.cpp) |      |                                                                                      |                         |
+| 209  |                  [팰린드롬](https://www.acmicpc.net/problem/10174)                   | [cpp](source/10174.cpp) | 210  |                  [냉동식품](https://www.acmicpc.net/problem/14625)                   | [cpp](source/14625.cpp) |
 
 </details>
 

acmicpc.net/source/14625.cpp

@@ -0,0 +1,37 @@
+// 14625. 냉동식품
+// 2022.06.03
+// 구현
+#include<iostream>
+
+using namespace std;
+
+int main()
+{
+    int h1, m1, h2, m2, n;
+    cin >> h1 >> m1 >> h2 >> m2 >> n;
+
+    int start = h1 * 60 + m1;
+    int end = h2 * 60 + m2;
+    int cur = start;
+    int ans = 0;
+    while (1)
+    {
+        int h = cur / 60;
+        int m = cur % 60;
+
+        if (h / 10 == n || h % 10 == n || m / 10 == n || m % 10 == n)
+        {
+            ans++;
+        }
+
+        if (cur == end)
+        {
+            break;
+        }
+
+        cur++;
+    }
+
+    cout << ans << endl;
+    return 0;
+}