用C++編程解決：設壹個***有n級的階梯,某人可走1級，也可走2級，也可走3級，要走上n級***有幾種走法？

lz ?妳好

具體代碼如下:

(有註釋)

using?namespace?std;

int?main()

{

int?one,two,three,n,count=0;

//分別表示:走1、2、3級的步數?總階數?種數

cout<<"輸入階梯數n:";

cin>>n;

//遍歷所有的可能性

for(one?=?0;?one?<=?n;?one++)

{

for(two?=?0;?two?<=?n/2;?two++)

{

for(three=0;?three?<=?n/3;?three++)

{

int?sum?=?one*1?+?two*2?+?three*3;

//滿足條件的?輸出

if(sum?==?n)

{

cout<<"("<<one<<","<<two<<","<<three<<")"<<endl;

count++;

}

}

}

}

cout<<"***有"<<count<<"種"<<endl;

return?0;

}

運行結果:

希望能幫助妳哈