⭐ 欢迎来到虫虫下载站！ | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站
📤 上传资源

📄 combi.txt

📁 计算组合数公式C(ele,sel)=A(ele,sel)/sel! 不用递归实现
💻 TXT
📖 第 1 页 / 共 2 页
字号:
🔍
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

⌨️ 快捷键说明

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