青蛙跳级方案数递归求解 void main() { int n; steps = 0; cout<>n; count_steps(n); cout<<"the total number:"<<steps<<endl; int a=jump(n); cout<<"the total number:"<<a<<endl; }