More actions
imported>Unknown No edit summary |
(Repair batch-0004 pages from live compare) |
||
| Line 17: | Line 17: | ||
vector<int> nodes; | vector<int> nodes; | ||
nodes.resize(tryNumber + 1); | nodes.resize(tryNumber + 1); | ||
nodes | nodes[tryNumber] = 1; | ||
while (accumulate(nodes.begin(), nodes.end(), 0) <= buildingHeight) | while (accumulate(nodes.begin(), nodes.end(), 0) <= buildingHeight) | ||
| Line 23: | Line 23: | ||
++countNumber; | ++countNumber; | ||
for (register int i = 1; i < (int)nodes.size(); ++i) | for (register int i = 1; i < (int)nodes.size(); ++i) | ||
nodes | nodes[i - 1] += nodes[i]; | ||
} | } | ||
Latest revision as of 00:37, 27 March 2026
== 금고/조현태 == === 느낀점 및 설명 === 나갔다 와서 저녁먹기전에.. 풀려고 잡았는데.. 배가 고파서 본능의 힘으로 풀었음 ㅡㅡV (본능의 위대함~!!) 그런데 왜 하필 떨어지는게 금고인거지?? (맞으면 아프지 않을까??) 배고파도 음악넣어주는 센스!! <embed src="http://zerowiki.dnip.net/~undinekr/lunia_ost1.mp3"> === 소스 === #include <iostream> #include <vector> #include <numeric> using namespace std; int GetMaxTryNumber(int buildingHeight, int tryNumber) { int countNumber = 0; vector<int> nodes; nodes.resize(tryNumber + 1); nodes[tryNumber] = 1; while (accumulate(nodes.begin(), nodes.end(), 0) <= buildingHeight) { ++countNumber; for (register int i = 1; i < (int)nodes.size(); ++i) nodes[i - 1] += nodes[i]; } return countNumber; } void main() { int testNumber; cin >> testNumber; for (register int i = 0; i < testNumber; ++i) { int buildingHeight; int tryNumber; cin >> buildingHeight; cin >> tryNumber; cout << GetMaxTryNumber(buildingHeight, tryNumber) << endl; } }