combi.txt

来自「计算组合数公式C(ele,sel)=A(ele,sel)/sel! 不用递归实」· 文本 代码 · 共 1,221 行 · 第 1/2 页

TXT
1,221 行
字号
12
/** 
* 计算组合数公式C(ele,sel)=A(ele,sel)/sel!
* @fn combi
* @param INT elements, INT selections
* @return double 
* @version 1.0
* @author 廖月旺(liao.yuewang@zte.com.cn or liaoyuewang@163.com)
* @date 2006-6-14
*/
double combi(INT elements, INT selections )
{
	INT i;
	double answer;
	INT ele;
	double p = 1;

	answer = elements;
	ele = elements;

       /*计算排列数A(ele,sel)=ele*(ele-1)*...*(ele-sel+1) */
      /*计算selections 的阶乘*/   
	for(i = 1;i < selections; i ++)
	{
		answer = answer *(--ele);
		p*=i;
	}
	p *= selections;

      /*得到组合数*/
      answer/=p;
/*
	  printf("answer=%E\n",answer);
*/
      return answer;		
}

/** 
* 计算组合数公式C(ele,sel)=A(ele,sel)/sel!
* @fn combi
* @param INT elements, INT selections
* @return double 
* @version 1.0
* @author 廖月旺(liao.yuewang@zte.com.cn or liaoyuewang@163.com)
* @date 2006-6-14
*/
double combi(INT elements, INT selections )
{
	INT i;
	double answer;
	INT ele;
	double p = 1;

	answer = elements;
	ele = elements;

       /*计算排列数A(ele,sel)=ele*(ele-1)*...*(ele-sel+1) */
      /*计算selections 的阶乘*/   
	for(i = 1;i < selections; i ++)
	{
		answer = answer *(--ele);
		p*=i;
	}
	p *= selections;

      /*得到组合数*/
      answer/=p;
/*
	  printf("answer=%E\n",answer);
*/
      return answer;		
}

/** 
* 计算组合数公式C(ele,sel)=A(ele,sel)/sel!
* @fn combi
* @param INT elements, INT selections
* @return double 
* @version 1.0
* @author 廖月旺(liao.yuewang@zte.com.cn or liaoyuewang@163.com)
* @date 2006-6-14
*/
double combi(INT elements, INT selections )
{
	INT i;
	double answer;
	INT ele;
	double p = 1;

	answer = elements;
	ele = elements;

       /*计算排列数A(ele,sel)=ele*(ele-1)*...*(ele-sel+1) */
      /*计算selections 的阶乘*/   
	for(i = 1;i < selections; i ++)
	{
		answer = answer *(--ele);
		p*=i;
	}
	p *= selections;

      /*得到组合数*/
      answer/=p;
/*
	  printf("answer=%E\n",answer);
*/
      return answer;		
}

/** 
* 计算组合数公式C(ele,sel)=A(ele,sel)/sel!
* @fn combi
* @param INT elements, INT selections
* @return double 
* @version 1.0
* @author 廖月旺(liao.yuewang@zte.com.cn or liaoyuewang@163.com)
* @date 2006-6-14
*/
double combi(INT elements, INT selections )
{
	INT i;
	double answer;
	INT ele;
	double p = 1;

	answer = elements;
	ele = elements;

       /*计算排列数A(ele,sel)=ele*(ele-1)*...*(ele-sel+1) */
      /*计算selections 的阶乘*/   
	for(i = 1;i < selections; i ++)
	{
		answer = answer *(--ele);
		p*=i;
	}
	p *= selections;

      /*得到组合数*/
      answer/=p;
/*
	  printf("answer=%E\n",answer);
*/
      return answer;		
}

/** 
* 计算组合数公式C(ele,sel)=A(ele,sel)/sel!
* @fn combi
* @param INT elements, INT selections
* @return double 
* @version 1.0
* @author 廖月旺(liao.yuewang@zte.com.cn or liaoyuewang@163.com)
* @date 2006-6-14
*/
double combi(INT elements, INT selections )
{
	INT i;
	double answer;
	INT ele;
	double p = 1;

	answer = elements;
	ele = elements;

       /*计算排列数A(ele,sel)=ele*(ele-1)*...*(ele-sel+1) */
      /*计算selections 的阶乘*/   
	for(i = 1;i < selections; i ++)
	{
		answer = answer *(--ele);
		p*=i;
	}
	p *= selections;

      /*得到组合数*/
      answer/=p;
/*
	  printf("answer=%E\n",answer);
*/
      return answer;		
}

/** 
* 计算组合数公式C(ele,sel)=A(ele,sel)/sel!
* @fn combi
* @param INT elements, INT selections
* @return double 
* @version 1.0
* @author 廖月旺(liao.yuewang@zte.com.cn or liaoyuewang@163.com)
* @date 2006-6-14
*/
double combi(INT elements, INT selections )
{
	INT i;
	double answer;
	INT ele;
	double p = 1;

	answer = elements;
	ele = elements;

       /*计算排列数A(ele,sel)=ele*(ele-1)*...*(ele-sel+1) */
      /*计算selections 的阶乘*/   
	for(i = 1;i < selections; i ++)
	{
		answer = answer *(--ele);
		p*=i;
	}
	p *= selections;

      /*得到组合数*/
      answer/=p;
/*
	  printf("answer=%E\n",answer);
*/
      return answer;		
}

/** 
* 计算组合数公式C(ele,sel)=A(ele,sel)/sel!
* @fn combi
* @param INT elements, INT selections
* @return double 
* @version 1.0
* @author 廖月旺(liao.yuewang@zte.com.cn or liaoyuewang@163.com)
* @date 2006-6-14
*/
double combi(INT elements, INT selections )
{
	INT i;
	double answer;
	INT ele;
	double p = 1;

	answer = elements;
	ele = elements;

       /*计算排列数A(ele,sel)=ele*(ele-1)*...*(ele-sel+1) */
      /*计算selections 的阶乘*/   
	for(i = 1;i < selections; i ++)
	{
		answer = answer *(--ele);
		p*=i;
	}
	p *= selections;

      /*得到组合数*/
      answer/=p;
/*
	  printf("answer=%E\n",answer);
*/
      return answer;		
}

/** 
* 计算组合数公式C(ele,sel)=A(ele,sel)/sel!
* @fn combi
* @param INT elements, INT selections
* @return double 
* @version 1.0
* @author 廖月旺(liao.yuewang@zte.com.cn or liaoyuewang@163.com)
* @date 2006-6-14
*/
double combi(INT elements, INT selections )
{
	INT i;
	double answer;
	INT ele;
	double p = 1;

	answer = elements;
	ele = elements;

       /*计算排列数A(ele,sel)=ele*(ele-1)*...*(ele-sel+1) */
      /*计算selections 的阶乘*/   
	for(i = 1;i < selections; i ++)
	{
		answer = answer *(--ele);
		p*=i;
	}
	p *= selections;

      /*得到组合数*/
      answer/=p;
/*
	  printf("answer=%E\n",answer);
*/
      return answer;		
}

/** 
* 计算组合数公式C(ele,sel)=A(ele,sel)/sel!
* @fn combi
* @param INT elements, INT selections
* @return double 
* @version 1.0
* @author 廖月旺(liao.yuewang@zte.com.cn or liaoyuewang@163.com)
* @date 2006-6-14
*/
double combi(INT elements, INT selections )
{
	INT i;
	double answer;
	INT ele;
	double p = 1;

	answer = elements;
	ele = elements;

       /*计算排列数A(ele,sel)=ele*(ele-1)*...*(ele-sel+1) */
      /*计算selections 的阶乘*/   
	for(i = 1;i < selections; i ++)
	{
		answer = answer *(--ele);
		p*=i;
	}
	p *= selections;

      /*得到组合数*/
      answer/=p;
/*
	  printf("answer=%E\n",answer);
*/
      return answer;		
}

/** 
* 计算组合数公式C(ele,sel)=A(ele,sel)/sel!
* @fn combi
* @param INT elements, INT selections
* @return double 
* @version 1.0
* @author 廖月旺(liao.yuewang@zte.com.cn or liaoyuewang@163.com)
* @date 2006-6-14
*/
double combi(INT elements, INT selections )
{
	INT i;
	double answer;
	INT ele;
	double p = 1;

	answer = elements;
	ele = elements;

       /*计算排列数A(ele,sel)=ele*(ele-1)*...*(ele-sel+1) */
      /*计算selections 的阶乘*/   
	for(i = 1;i < selections; i ++)
	{
		answer = answer *(--ele);
		p*=i;
	}
	p *= selections;

      /*得到组合数*/
      answer/=p;
/*
	  printf("answer=%E\n",answer);
*/
      return answer;		
}

/** 
* 计算组合数公式C(ele,sel)=A(ele,sel)/sel!
* @fn combi
* @param INT elements, INT selections
* @return double 
* @version 1.0
* @author 廖月旺(liao.yuewang@zte.com.cn or liaoyuewang@163.com)
* @date 2006-6-14
*/
double combi(INT elements, INT selections )
{
	INT i;
	double answer;
	INT ele;
	double p = 1;

	answer = elements;
	ele = elements;

       /*计算排列数A(ele,sel)=ele*(ele-1)*...*(ele-sel+1) */
      /*计算selections 的阶乘*/   
	for(i = 1;i < selections; i ++)
	{
		answer = answer *(--ele);
		p*=i;
	}
	p *= selections;

      /*得到组合数*/
      answer/=p;
/*
	  printf("answer=%E\n",answer);
*/
      return answer;		
}

/** 
* 计算组合数公式C(ele,sel)=A(ele,sel)/sel!
* @fn combi
* @param INT elements, INT selections
* @return double 
* @version 1.0
* @author 廖月旺(liao.yuewang@zte.com.cn or liaoyuewang@163.com)
* @date 2006-6-14
*/
double combi(INT elements, INT selections )
{
	INT i;
	double answer;
	INT ele;
	double p = 1;

	answer = elements;
	ele = elements;

       /*计算排列数A(ele,sel)=ele*(ele-1)*...*(ele-sel+1) */
      /*计算selections 的阶乘*/   
	for(i = 1;i < selections; i ++)
	{
		answer = answer *(--ele);
		p*=i;
	}
	p *= selections;

      /*得到组合数*/
      answer/=p;
/*
	  printf("answer=%E\n",answer);
*/
      return answer;		
}

/** 
* 计算组合数公式C(ele,sel)=A(ele,sel)/sel!
* @fn combi
* @param INT elements, INT selections
* @return double 
* @version 1.0
* @author 廖月旺(liao.yuewang@zte.com.cn or liaoyuewang@163.com)
* @date 2006-6-14
*/
double combi(INT elements, INT selections )
{
	INT i;
	double answer;
	INT ele;
	double p = 1;

	answer = elements;
	ele = elements;

       /*计算排列数A(ele,sel)=ele*(ele-1)*...*(ele-sel+1) */
      /*计算selections 的阶乘*/   
	for(i = 1;i < selections; i ++)
	{
		answer = answer *(--ele);
		p*=i;
	}
	p *= selections;

      /*得到组合数*/
      answer/=p;
/*
	  printf("answer=%E\n",answer);
*/
      return answer;		
}

/** 
* 计算组合数公式C(ele,sel)=A(ele,sel)/sel!
* @fn combi
* @param INT elements, INT selections
* @return double 
* @version 1.0
* @author 廖月旺(liao.yuewang@zte.com.cn or liaoyuewang@163.com)
* @date 2006-6-14
*/
double combi(INT elements, INT selections )
{
	INT i;
	double answer;
	INT ele;
	double p = 1;

	answer = elements;
	ele = elements;

       /*计算排列数A(ele,sel)=ele*(ele-1)*...*(ele-sel+1) */
      /*计算selections 的阶乘*/   
	for(i = 1;i < selections; i ++)
	{
		answer = answer *(--ele);
		p*=i;
	}
	p *= selections;

      /*得到组合数*/
      answer/=p;
/*
	  printf("answer=%E\n",answer);
*/
      return answer;		
}

/** 
* 计算组合数公式C(ele,sel)=A(ele,sel)/sel!
* @fn combi
* @param INT elements, INT selections
* @return double 
* @version 1.0
* @author 廖月旺(liao.yuewang@zte.com.cn or liaoyuewang@163.com)
* @date 2006-6-14
*/
double combi(INT elements, INT selections )
{
	INT i;
	double answer;
	INT ele;
	double p = 1;

	answer = elements;
	ele = elements;

       /*计算排列数A(ele,sel)=ele*(ele-1)*...*(ele-sel+1) */
      /*计算selections 的阶乘*/   
	for(i = 1;i < selections; i ++)
	{
		answer = answer *(--ele);
		p*=i;
	}
	p *= selections;

      /*得到组合数*/
      answer/=p;
/*
	  printf("answer=%E\n",answer);
*/
      return answer;		
}

/** 
* 计算组合数公式C(ele,sel)=A(ele,sel)/sel!
* @fn combi
* @param INT elements, INT selections
* @return double 
* @version 1.0
* @author 廖月旺(liao.yuewang@zte.com.cn or liaoyuewang@163.com)
* @date 2006-6-14
*/
double combi(INT elements, INT selections )
{
	INT i;
	double answer;
	INT ele;
	double p = 1;

	answer = elements;
	ele = elements;

       /*计算排列数A(ele,sel)=ele*(ele-1)*...*(ele-sel+1) */
      /*计算selections 的阶乘*/   
	for(i = 1;i < selections; i ++)
	{
		answer = answer *(--ele);
		p*=i;
	}
	p *= selections;

      /*得到组合数*/
      answer/=p;
/*
	  printf("answer=%E\n",answer);
*/
      return answer;		
}

/** 
* 计算组合数公式C(ele,sel)=A(ele,sel)/sel!
* @fn combi
* @param INT elements, INT selections
* @return double 
* @version 1.0
* @author 廖月旺(liao.yuewang@zte.com.cn or liaoyuewang@163.com)
* @date 2006-6-14
*/
double combi(INT elements, INT selections )
{
	INT i;
	double answer;
	INT ele;
	double p = 1;

	answer = elements;
	ele = elements;

       /*计算排列数A(ele,sel)=ele*(ele-1)*...*(ele-sel+1) */
      /*计算selections 的阶乘*/   
	for(i = 1;i < selections; i ++)
	{
		answer = answer *(--ele);
		p*=i;
	}
	p *= selections;

      /*得到组合数*/
      answer/=p;
/*
	  printf("answer=%E\n",answer);
*/
      return answer;		
}
12

combi.txt - 源码说明

本页面展示了「计算组合数公式C(ele,sel)=A(ele,sel)/sel! 不用递归实现」中的 combi.txt 源码文件，采用 文本 编程语言编写，共 1,221 行代码。您可以在线阅读完整代码内容，也可以返回资源详情页下载完整源码包进行本地学习和开发。

虫虫开发者社区收录了大量与组合数相关的技术资源，包括源代码、技术文档、电路图等，是电子工程师和嵌入式开发者的专业学习平台。

⌨️ 快捷键说明

复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?