北工大 c语言程序设计,北工大c语言题库完整.docx

{专业

{

专业.专注

{专业

{

专业.专注

#i nclude "stdio.h"

int main()

{

int ri,repeat;

int i,n;

double s;

double fact(i nt n);

scan f("%d",&repeat);

for(ri=1;ri<=repeat;ri++){

scan f("%d",&n);

s=0;

for(i=1;i<=n ;i++)

s=s+1/fact(i);

prin tf("%0.4f\n",s);

}

return 0;

}

double fact(i nt n)

#i nclude "stdio.h"

int main()

{

int ri,repeat;

int i,n,j;

float s,t;

sca nf("%d",&repeat);

for(ri=1;ri<=repeat;ri++){ sca nf("%d",&n); s=0;

for(i=1;i<=n; i++){ t=1; for(j=1;j<=i;j++) t=t*j; s=s+1.0/t;

}

prin tf("%0.4f\n",s);

}

}

.

.专业.专注

专业

专业.专注

int i;

double result;

result=1;

for(i=1;i<=n ;i++)

result=result*i;

return result;

}

统计一个整数中数字的个数

#i nclude "stdio.h"

int main()

{

int ri,repeat;

int count;

long in;

int coun tdigit(l ong nu mber, i nt digit);

scan f("%d",&repeat);

for(ri=1;ri<=repeat;ri++){

scan f("%ld", &in);

coun t=co un tdigit(i n, 2);

prin tf("co un t=%d\n",co un t);

}

} int countdigit(long number, int digit)

{

int i,count=0,t;

if(nu mber<0)

nu mber=-nu mber;

for(i=1; ;i++){

t=nu mber%10; if(t==digit)co un t++;

nu mber =nu mber/10;

if(nu mber==0)

break;

}

retur n count;

#i nclude "stdio.h"#i nclude "math.h"

#i nclude "stdio.h"

#i nclude "math.h"

int main()

{

int ri,repeat;

int count, digit, i, j, k, m, n, sum

统计素数并求和

#i nclude "stdio.h"

#in elude "math.h"

int main()

{

int ri,repeat;

int coun t, i, m, n, sum;

int prime(i nt m);

scan f("%d",&repeat);

for(ri=1;ri<=repeat;ri++){

scan f("%d%d", &m, &n);

sum=0;co un t=0;

for(i=m;i<=n; i++){

if(prime(i)==1){

coun t++;

sum=sum+i;

}

}

prin tf("co un t=%d, sum=%d\n", count, sum);

}

}

int prime(i nt m)

.

.专业.专注

.

.专业.专注

专业

专业.专注

int i;

if(m==1)return 0; if(m>1){

for(i=2;i<=m/2;i++){if(m%i==O){return 0;

}

}

if(i>m/2) return 1;

}

}

求完数

#i nclude "stdio.h"

int main()

{

int ri,repeat;

int i, m, n;

long factorsum(i nt nu mber);

scan f("%d",&repeat);

for(ri=1;ri<=repeat;ri++){

scanf("%d%d", &m, &n);

for(i=m;i<=n; i++){

if(i==factorsum(i))

prin tf("%d ", i);

}

prin tf("\n");

}

}

longfactorsum(i nt nu mber)

{

int i,sum=0;

if(nu mber==1) retur