青蛙跳级方案数递归求解 void main() { int n; steps = 0; coutn; count_steps(n); cout