Algorithm
BOJ 11047 c++
알고리즘 BOJ 11047 동전 0 c++ 백준 11047 #include using namespace std; int n; int arr[12]; int k; int main() { ios::sync_with_stdio(0); cin.tie(0); cin >> n >> k; for (int i = 1; i > arr[i]; int count = 0; while (k > 0) { if (arr[n] > k) { n--; continue; } k -= arr[n]; count++; } cout
2020. 7. 16. 15:57
최근댓글