m.cpp

此代码实现的功能主要是做素性判断的MillerRobin测试

#include "stdio.h"
#include "MB.h"
#include "math.h"
#define M 2000

void main()
{
	int prim[M];
	int a[M];
	prim[0]=2;
	prim[1]=3;
	int n=0,m=2;
	FILE *fp,*fpw;
	fp=fopen("put.txt","r");
	fpw=fopen("prim.txt","w");
	while(!feof(fp))
	{
		fscanf(fp,"%d",&a[n]);
		n++;
	}
	printf("OK! n is %d\n",n);
	int i=5;
	for(i=5;i<=10000;i++)
	{
		if(RepeatMB(i,(int)log((double)i))==true)		//log()函数同sqrt相同,要进行类型转换
		{
			prim[m++]=i;
			i=i+1;
		}

	}
	for(i=0;i<m;i++)
		fprintf(fpw,"%d\n",prim[i]);
	printf("the true number is %d ,but we get %d\n",n,m);
	fclose(fpw);
	fclose(fp);
}