自由尋覓快樂別人從沒法感受

0%

题目:判断101~200中的素数数量。

主要代码:

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
# include <stdio.h>
# include <math.h>
int judge(int a);
int main (void)
{
int a,b,c=0;
for (a=101;a<=200;a++)
{
b = judge(a);
//printf("%d\n",b);
if (b == 1)
{
c += 1;
}
}
printf("101-200 have prime number:%d\n",c);
return 0;
}

int judge (int a)
{
int b,c,i;
b = sqrt(a);
for (i=2;i<=b;i++)
{
if (a%i==0)
{
break;
}
}
if (i>b)
{
c = 1;
}
else
{
c = 0;
}
return c;
}
阅读全文 »

题目:将一个长整型数的每一位数位上的偶数依次取出来,构成一个新的数,其高低位顺序不变。

例子:12345构成新的数后为24

主要代码:

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
# include <stdio.h>
int main (void)
{
long int a,i=0,s[65];
printf("input a number:");
scanf("%ld",&a);
while (a!=0)
{
if ( (a%10)%2 == 0 )
{
s[i] = a%10;
i++;
}
a = a/10;
}
printf("output:");
for ( i=i-1 ; i >= 0; i-- )
{
printf("%ld",s[i]);
}
printf("\n");
return 0;
}
阅读全文 »

题目:输入一个正整数,并将其颠倒过来。

例子:123颠倒后为321

主要代码:

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
# include <stdio.h>
# include <stdlib.h>
int main (void)
{
int a,y,s=0;
printf("输入一个整数:");
scanf("%d",&a);
if (a<0)
{
printf("error!\n");
exit(0);
}
while (a != 0)
{
y = a%10;
s = s*10 + y;
a = a/10;
}
printf("颠倒之后:%d\n",s);
return 0;
}
阅读全文 »

题目:编写一个函数计算具有NROWS和NCOOLS列的二维数组中指定列的平均值以及数组各行的和的最小值。

NROWS和NCOOLS为常量名。

主要代码:

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
# inlcude <stdio.h>
int main (void)
{
int a[5][5],x,y;
printf("input a 5*5 matrix:\n");
for (x=0;x<5;x++)
{
printf("input line%d:",x+1);
for (y=0;y<5;y++)
{
//printf("input column%d:",y+1);
scanf("%d",&a[x][y]);
}
}
printf("inputs:\n");
for (x=0;x<5;x++)
{
for (y=0;y<5;y++)
{
printf("%4d",a[x][y]);
}
printf("\n");
}

float avg,sum=0;
int i,min=0,t=0;

//avg column:

printf("which column do you want to avg(1-5):");
scanf("%d",&i);
if (i<1 || i>5)
{
printf("error!\n");
}
else
{
//avg = favg(i,a[5][5]);
for (x=0;x<5;x++)
{
sum = sum + a[x][i-1];
}
avg = sum/5;
printf("avg=%2f\n",avg);
}

//min line:

for (y=0;y<5;y++)
{
min = min + a[0][y];
}
for (x=1;x<5;x++)
{
for (y=0;y<5;y++)
{
t = t + a[x][y];
}
if (t<min)
{
min = t;
}
}
printf("min line:%d\n",min);
return 0;
}
阅读全文 »

题目:查找,替换数字并输出下标。

输入5个整数,并存储在数组中,找出最大数与最小数所在的下标位置,并把两者对调,然后输出调整后的5个数。

主要代码:

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
# include <stdio.h>
int main (void)
{
int a[5],max,min,i,x,y,t;

//input:
printf("input 5 numbers:");
for (i=0;i<5;i++)
{
scanf("%d",&a[i]);
}
printf("start:");
for (i=0;i<5;i++)
{
printf("%4d",a[i]);
}
printf("\n");

//judge:
max = a[0];
min = a[0];
x = y = 1;
for (i=1;i<5;i++)
{
if (a[i]>max)
{
max = a[i];
x = i+1;
}
if (a[i]<min)
{
min = a[i];
y = i+1;
}
}

//exchange:
t = a[x-1];
a[x-1] = a[y-1];
a[y-1] = t;

//output:
printf("max is the %d number,max=%d\n",x,max);
printf("min is the %d number,min=%d\n",y,min);
printf("after exchange:");
for (i=0;i<5;i++)
{
printf("%4d",a[i]);
}
printf("\n");
return 0;
}
阅读全文 »