二項式係數遞迴演算法

來源:互聯網
上載者:User
/* 二項式係數遞迴演算法** 問題描述**     二項式係數,即為排列組合中的排列*/#include <stdio.h>#include <stdlib.h>int binomial(int n, int m);int main(){int n,m,result;while(1){printf("Enter two number n and m(n>0 && m>=0):\n");printf("n=");scanf("%d",&n);printf("m=");scanf("%d",&m);if(n<=0 || m<0)printf("Please see the tip above,enter the right numbers!");elsebreak;}result=binomial(n,m);printf("the result is: %d ",result);printf("\n");system("pause");return 0;}int binomial(int n, int m){if(1==m )return n;else if(n==m)return 1;elsereturn binomial(n-1,m)+binomial(n-1,m-1);}

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.