k=0
while(n＞＝1){
for(j=1;j＜n;j++){
k=k+1;
}
n=n-1;
}
return k;
求加法執(zhí)行次數(shù)
慕函數(shù)8132203
2018-03-15 09:44:20
