[ADD] BOJ 4796 캠핑

- 그리디 알고리즘

Author: tdm1223

acmicpc.net/README.md

@@ -706,6 +706,7 @@
 |  27  |       [방탈출](https://www.acmicpc.net/problem/15729)        | [cpp](source/15729.cpp) |  28  | [세탁소 사장 동혁](https://www.acmicpc.net/problem/2720) | [cpp](source/2720.cpp)  |
 |  29  | [욱제는 도박쟁이야!!](https://www.acmicpc.net/problem/14655) | [cpp](source/14655.cpp) |  30  |  [Project Teams](https://www.acmicpc.net/problem/20044)  | [cpp](source/20044.cpp) |
 |  31  |      [수강변경](https://www.acmicpc.net/problem/23305)       | [cpp](source/23305.cpp) |  32  |   [온라인 판매](https://www.acmicpc.net/problem/1246)    | [cpp](source/1246.cpp)  |
+|  33  |         [캠핑](https://www.acmicpc.net/problem/4796)         | [cpp](source/4796.cpp)  |      |                                                          |                         |
 
 </details>
 

acmicpc.net/source/4796.cpp

@@ -0,0 +1,29 @@
+// 4796. 캠핑
+// 2022.03.12
+// 그리디 알고리즘
+#include<iostream>
+
+using namespace std;
+
+int main()
+{
+    int l, p, v;
+    int cnt = 0;
+    while (1)
+    {
+        cnt++;
+        cin >> l >> p >> v;
+        if (l == 0 and p == 0 and v == 0)
+        {
+            break;
+        }
+
+        int ans = 0;
+        ans += (v / p) * l;
+
+        // 잔여로 쉴수 있을때는 무조건 최대로 쉰다.
+        ans += v % p > l ? l : v % p;
+        cout << "Case " << cnt << ": " << ans << endl;
+    }
+    return 0;
+}