1/*
2 1. 求得两个整型数中较大的那一个
3 */
4 #include<stdio.h>
5
6 int compare(int a,int b)
7 {
8 return (a>b ? a : b);
9 }
10
11 int main(void)
12 {
13 int num1,num2;
14 printf("请输入两个整数(用空格隔开):\n");
15 scanf("%d %d",&num1,&num2);
16 printf("较大的数为%d\n",compare(num1,num2));
17 return 0;
18 }
1 /*
2 2. 返回给定正整数的倒序数。如给定的是1234,返回4321
3 */
4
5 #include<stdio.h>
6
7 int Reverse_order(int n);
8
9 int main(void)
10 {
11 int num;
12 printf("请输入一个正整数:\n");
13 scanf("%d",&num);
14 printf("该数的倒序数为%d\n", Reverse_order(num));
15 return 0;
16 }
17
18 int Reverse_order(int n)
19 {
20 int order=0;
21 while(n!=0)
22 {
23 order=order*10 + n%10;
24 n/=10;
25 }
26 return order;
27 }
1 /*
2 3. 用递归求得一个整型数的阶乘
3 */
4 #include<stdio.h>
5
6 int Factorial(int n);
7
8 int main(void)
9 {
10 int num;
11 printf("请输入一个整数:\n");
12 scanf("%d",&num);
13 printf("该数的阶乘为%d\n",Factorial(num));
14 return 0;
15 }
16
17 int Factorial(int n)
18 {
19 if(n<0)
20 {
21 return -1;
22 }
23 if(n==0)
24 {
25 return 1;
26 }
27 return n*Factorial(n-1);
28 }
1 /*
2 4. 判断一个整数是否在某两个整数之间
3 */
4
5 #include<stdio.h>
6
7 int compare(int n1,int n2);
8
9 int main(void)
10 {
11 int num1,num2,num3;
12 printf("请输入三个整数(空格隔开):\n");
13 scanf("%d %d %d",&num1,&num2,&num3);
14 if(compare(num2,num3))
15 {
16 if((!compare(num1,num2)) && compare(num1,num3))
17 {
18 printf("%d在%d和%d之间\n",num1,num2,num3);
19 }
20 else
21 {
22 printf("%d不在%d和%d之间\n",num1,num2,num3);
23 }
24 }
25 if(!compare(num2,num3))
26 {
27 if(compare(num1,num2) && !compare(num1,num3))
28 {
29 printf("%d在%d和%d之间\n",num1,num2,num3);
30 }
31 else
32 {
33 printf("%d不在%d和%d之间\n",num1,num2,num3);
34 }
35 }
36 return 0;
37 }
38
39 int compare(int n1,int n2)
40 {
41 if(n1<n2)
42 {
43 return 1;
44 }
45 else
46 return 0;
47 }
1,1 顶端
1,1 顶端