★关于素数筛选法编写一函数unsigned int *findPrime(unsigned int n),按照Eract
来源:学生作业帮 编辑:搜狗做题网作业帮 分类:综合作业 时间:2024/06/13 11:43:50
★关于素数筛选法
编写一函数unsigned int *findPrime(unsigned int n),按照Eractosthenes筛法找出1-n之间的素数.然后在编写一函数void printPrime(unsigned int *p,int n)打印这些素数.(提示:在findPrime函数分配堆内存表示筛法中用到的数组,并返回该数组首地址),主函数可为:
void main()
{
unsigned int *sieve;
unsigned int n;
printf("enter a number:");
scanf("%u",&n);
sieve = findPrime(n);
printPrime(sieve,n);
free(sieve);
}
编写一函数unsigned int *findPrime(unsigned int n),按照Eractosthenes筛法找出1-n之间的素数.然后在编写一函数void printPrime(unsigned int *p,int n)打印这些素数.(提示:在findPrime函数分配堆内存表示筛法中用到的数组,并返回该数组首地址),主函数可为:
void main()
{
unsigned int *sieve;
unsigned int n;
printf("enter a number:");
scanf("%u",&n);
sieve = findPrime(n);
printPrime(sieve,n);
free(sieve);
}
楼上好像不是Eractosthenes筛法吧
#include
#include
#include
unsigned int *findPrime(unsigned int n)
{
int i,j,k;
unsigned int *a=(unsigned int*)malloc(n*sizeof(unsigned int));
for(i=2;i
#include
#include
#include
unsigned int *findPrime(unsigned int n)
{
int i,j,k;
unsigned int *a=(unsigned int*)malloc(n*sizeof(unsigned int));
for(i=2;i
编写具有如下原型的函数:int f(unsigned long x,int n,int& Lxn);
unsigned int gcd(unsigned int a,unsigned int b){
希望给出注释~unsigned short GetHashValue(unsigned int *grid){unsig
int 9和unsigned int 65535 转变成char,unsigned int,float,long int
#define P_SystemClock (volatile unsigned int *)0x7013
#include sbit a=P1^0; sbit b=P3^2; unsigned int n; void main
#include main() {unsigned int a=65535; printf("a=%d\n",a); }
main( ) {unsigned int a=3,b=10; printf("%d/n",a1); }
函数的参数问题struct EngineerStruct //声明存储工程师信息的结构体 { unsigned int
C语言size_t和unsigned int 有什么区别
语句 #define P_IOA_Data (volatile unsigned int *)0x7000
编写函数 void mymod( double x,int *m ,int *n ){ }