生日悖论

#include <stdio.h>
#include <stdlib.h>
int main()
{
 int i,j,k,success;
 int nTrials = 100000, nSucc = 0,l;
 int * p;
 /* Read in the number k */
 printf ("Enter k:");
 scanf ("%d", &k);
 printf ("\nYou entered k = %d \n", k);
 if ( k < 2)
 {
 	printf (" select a k >= 2 please. \n");
 	return 1;
 }
 /* Allocate memory for our purposes */
 p = (int *) malloc(k * sizeof(int));
 //nTrials = number of times to repeat the experiment.
 for (j = 0; j < nTrials; ++j)
 {
	 success = 0;
	 // Each experiment will generate k random variables 
 	// and check if the difference between
 	// any two of the generated variables is exactly 42.
 	// The loop below folds both in.
 	for (i = 0; i < k; ++i){
	 // Generate the random numbers between 1 and 1000
 	p[i] = 1+ (int) ( 1000.0 * (double) rand() / (double) RAND_MAX );
 	// Check if a difference of 42 has been achieved already
	 for (l = 0; l < i; ++l)
	if (p[l] - p[i] == 42 || p[i] - p[l] == 42 )
	{
		 success = 1; // Success: we found a diff of 42
 	 	 break;
	}
 }
 if (success == 1)
 { 
 	// We track the number of successes so far.
 	nSucc ++;
 }
}
 // Probability is simply estimated by number of success/ number of trials. 
printf ("Est. probability is %f \n", (double) nSucc/ (double) nTrials);
 // Do not forget to cleanup the memory.
 free(p);
 return 1;
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值