C++ 小青蛙爬井问题：优化爬行速度

#include using namespace std;

int main() { int m, n, h; cin >> m >> n >> h; int day = 0; int height = 0;

while (height < h) {
    day++;
    height += m;
    if (height >= h) {
        break;
    }
    height -= n;
}

cout << day << endl;

return 0;

}