第一章

1. 求兩個(gè)整數(shù)之和(p7)

#include<stdio.h>
int main()
{int a = 0;int b = 0;int sum = 0;scanf("%d %d", &a, &b);sum = a + b;printf("sum=%d", sum);return 0;
}

第二章

2. 求三個(gè)數(shù)中的較大值（用函數(shù)）(p14、p107)

寫法一：

//求三個(gè)數(shù)中的較大值（用函數(shù)）
#include<stdio.h>
int Max(int a, int b, int c)
{int max = 0;max = a > b ? a : b;max = max > c ? max : c;return max;
}
int main()
{int a = 0;int b = 0;int c = 0;int max = 0;scanf("%d %d %d", &a, &b, &c);max = Max(a, b, c);printf("max=%d", max);return 0;
}

寫法二：

#include<stdio.j>
int main()
{int a = 0;int b = 0;int c = 0;int max = 0;scanf("%d %d %d", &a, &b, &c);if(a > b){max = a;	}else{max = b;}if(c > max){max = c;}printf("max=%d", max);return 0;
}

3.求1×2×3…×n(求n的階乘，用for循環(huán)與while循環(huán))(P17)

1.循環(huán)求n的階乘

#include<stdio.h>
int main()
{int i = 1;int n = 0;int sum = 1;scanf("%d", &n);for (i = 1; i <= n; i++){sum = sum * i;}/*while (n){sum = sum * i;i++;n--;}*/printf("%d\n", sum);return 0;
}

2.遞歸求n的階乘(n< 10)

n! = (n-1)! * n

#include<stdio.h>
int func(int n)
{if( n == 0){return 1;}else{return n * func(n - 1);}
}
int main()
{int n = 0;scanf("%d", &n);int ret = func(n);printf("%d\n", ret);return 0;
}

4.有M個(gè)學(xué)生，輸出成績在80分以上的學(xué)生的學(xué)號和成績,并統(tǒng)計(jì)人數(shù)（p18）

#include<stdio.h>
#define M  4
int main()
{int arr[M][2] = { 0 };int i = 0;int number = 0;int score = 0;int count = 0;for (i = 0; i < M; i++){scanf("%d %d", &arr[i][0], &arr[i][1]);}for (i = 0; i < M; i++){if (arr[i][1] > 80){printf("學(xué)號：%d 分?jǐn)?shù)：%d\n", arr[i][0], arr[i][1]);count++;}}printf("80分以上的共%d人\n", count);return 0;
}

5.判斷200-2500的每一年是否是閏年，并將結(jié)果輸出。非閏年如何求呢？(p18)

#include<stdio.h>
int main()
{int i = 0;for (i = 2000; i <= 2500; i++){if ((i % 4 == 0 && i % 100 != 0) || (i % 400 == 0)){printf("%d年是閏年\n", i);}else{printf("%d年不是閏年\n", i);}}return 0;
}

如何求非閏年？

#include<stdio.h>
int main()
{int i = 0;for (i = 2000; i <= 2500; i++){//方法一：對閏年的要求逐個(gè)取反//if(i % 4 !=0 || i % 100 ==0 && i % 400 != 0)//方法二：直接對閏年整個(gè)取反     ！(閏年要求)if (!((i % 4 == 0 && i % 100 != 0) || (i % 400 == 0))){printf("%d年不是閏年\n", i);}}return 0;
}

6.求1-1/2+1/3-1/4…+1/99-1/100（有坑！p19）

#include<stdio.h>
int main()
{int i = 0;//特別注意  一定要有變量是浮點(diǎn)型！！float flag = 1;float sum = 0;for (i = 1; i <= 100; i++){sum += flag / i;flag = -flag;}printf("%f\n", sum);return 0;
}

6.1變形：1-1/22+1/333-1/4444…+1/nnnnn…（n不大于9）

#include<stdio.h>
int main()
{int i = 0;//特別注意  一定要有變量是浮點(diǎn)型！！float flag = 1;float sum = 0;int n = 0;scanf("%d", &n);for (i = 1; i <= n; i++){int m = i;//記錄當(dāng)前數(shù)是幾for (int j = 1; j < i; j++){m = i + m * 10;//算分母}sum += flag / m;flag = -flag;}printf("%f\n", sum);return 0;
}

7.判斷素?cái)?shù)(p20)

1.用2-(i-1)去試除

#include<stdio.h>
#include<math.h>
int main()
{int i = 0;int j = 0;int sum = 0;for (i = 100; i < 1000; i++){for (j = 2; j < i; j++){if (i % j == 0){break;}}if (j == i){printf("%d ", i);sum++;}}printf("\n%d\n", sum);return 0;
}

#include<stdio.h>
#include<math.h>
int main()
{int i = 0;int j = 0;int sum = 0;for (i = 100; i <1000; i++){int flag = 1;//每次假設(shè)i是素?cái)?shù)for (j = 2; j < i; j++){if (i % j == 0){flag = 0;//i不是素?cái)?shù)break;}}if (flag == 1){printf("%d ", i);sum++;}}printf("\n%d\n", sum);return 0;
}

2.用2-根號i去試除

#include<math.h>
int main()
{int i = 0;int j = 0;int sum = 0;for (i = 100; i < 1000; i++)			//優(yōu)化3：for (i = 101; i < 1000; i += 2){										//因?yàn)榕紨?shù)一定不是素?cái)?shù)for (j = 2; j <= sqrt(i); j++){if (i % j == 0){break;}}if (j > sqrt(i)){printf("%d ", i);sum++;}}printf("\n%d\n", sum);return 0;
}

8.輸入10個(gè)數(shù)，從中找最大(p35)

#include<stdio.h>
int main()
{int arr[10] = { 0 };int i = 0;for (i = 0; i < 10; i++){scanf("%d", &arr[i]);}int max = arr[0];//只需從1下標(biāo)開始for (i = 1; i < 10; i++) {if (arr[i] > max){max = arr[i];}}printf("max=%d", max);return 0;
}

9.有三個(gè)數(shù)a,b,c,按大小順序輸出(使用函數(shù)p35)

#include<stdio.h>void swap(int* n, int* m)
{int tmp = *n;*n = *m;*m = tmp;
}int main()
{int a = 0;int b = 0;int c = 0;scanf("%d %d %d", &a, &b, &c);if (a < b)swap(&a, &b);if (a < c)swap(&a, &c);if (b < c)swap(&b, &c);//a最大，c最小printf("%d %d %d\n", a, b, c);return 0;
}

10.判斷一個(gè)數(shù)能否被3和5整除(p35)

#include<stdio.h>
int main()
{int a = 0;scanf("%d", &a);if (0 == a % 3 && 0 == a % 5){printf("%d能被3和5整除\n", a);}elseprintf("%d不能被3和5整除\n", a);return 0;
}

11.求兩個(gè)數(shù)m和n的最大公約數(shù)，以及最小公倍數(shù)(p35、p137)

最小公倍數(shù)=兩數(shù)的積÷最大公約數(shù)

1.暴力求解法

#include <stdio.h>
int main()
{int n = 0;int m = 0;int total = 0;scanf("%d %d", &n, &m);total = n * m;//兩數(shù)之積int min = n < m ? n : m;while (1) {if (n % min == 0 && m % min == 0){break;}min--;}//此時(shí)min為最大公約數(shù)//最小公倍數(shù)就等于：兩個(gè)數(shù)的乘積/最大公約數(shù)printf("%d\n", min);printf("%d\n", total / min);
}

2.輾轉(zhuǎn)相除法

#include <stdio.h>
int main()
{int n = 0;int m = 0;int total = 0;scanf("%d %d", &n, &m);total = n * m;//兩數(shù)之積while (n % m){int tmp = n % m;n = m;m = tmp;}//此時(shí)m為最大公約數(shù)//最小公倍數(shù)就等于：兩個(gè)數(shù)的乘積/最大公約數(shù)printf("%d\n", m);printf("%d\n", total / m);

3.遞歸

1. 更相減損法
   以較大的數(shù)減較小的數(shù)，接著把所得的差與較小的數(shù)比較，并以大數(shù)減小數(shù)。繼續(xù)這個(gè)操作，直到它們兩個(gè)數(shù)相等為止。則相等的兩個(gè)數(shù)就是所求的最大公約數(shù)。

#include<stdio.h>
int Fun(int n, int m)
{if (n > m){return Fun(m, n - m);}else if (n < m){return Fun(n, m - n);}//兩數(shù)相等elsereturn n;
}int main()
{int n = 0;int m = 0;int total = 0;scanf("%d %d", &n, &m);total = n * m;//兩數(shù)之積int ret = Fun(n, m);printf("%d\n", ret);printf("%d\n", total /ret);return 0;
}

2. 輾轉(zhuǎn)相除法
   此遞歸和輾轉(zhuǎn)相除法相似

#include<stdio.h>
int Fun(int n, int m)
{								//	while (n % m)if (m == 0)					//{return n;				//	int tmp = n % m;else						//  n = m;return Fun(m, n % m);	//	m = tmp;//}	//printf("%d\n", m);			
}
int main()
{int n = 0;int m = 0;int total = 0;scanf("%d %d", &n, &m);total = n * m;//兩數(shù)之積int ret = Fun(n, m);printf("%d\n", ret);printf("%d\n", total / ret);return 0;
}

12.求方程ax^2+bx+c=0的根(p35)

#include<stdio.h>
#include<math.h>
int main()
{double a, b, c;double flag = 0;double x1, x2;scanf("%lf %lf %lf", &a, &b, &c);flag = b * b - 4 * a * c;if (flag > 0){x1 = (-b + sqrt(flag)) / (2 * a);x2 = (-b - sqrt(flag)) / (2 * a);printf("方程有兩個(gè)不相等的實(shí)根：x1=%f,x2=%f\n", x1, x2);}else if (flag < 0){printf("方程無解\n");}else{x1 = x2 = -b / (2 * a);printf("方程有兩個(gè)不相等的實(shí)根：x1=x2=%f\n", x1);}return 0;
}

第三章

13.溫度轉(zhuǎn)換（p37）

#include<stdio.h>
int main()
{float temperature = 0;float Ht = 0;scanf("%f", &temperature);Ht = ( 5.0 / 9) * (temperature - 32);printf("%f\n", Ht);return 0;
}

14.大小寫字母轉(zhuǎn)換(p54)

#include<stdio.h>
int main()
{char ch1 = '0';char ch2 = '0';scanf("%c", &ch1);//大寫轉(zhuǎn)小寫if (ch1 >= 97){ch2 = ch1 - 32;}//小寫轉(zhuǎn)大寫else{ch2 = ch1 + 32;}printf("%c\n", ch2);return 0;
}

15.給出三角形邊長，求三角形的面積（p58）

#include<stdio.h>
#include<math.h>
int main()
{double a = 0;double b = 0;double c = 0;double area = 0;double s = 0;scanf("%lf %lf %lf", & a, & b, & c);s = (a + b + c) / 2;//能構(gòu)成三角形 (任意兩邊之和大于第三邊)if (a + b > c || a + c > b || c + b > a){area = sqrt(s * (s - a) * (s - b) * (s - c));printf("area= %lf\n", area);}else{printf("不是三角形！\n");}return 0;
}

16.譯碼p82、p135

int main()
{char ch = 0;while ((ch = getchar()) != '\n'){//如果是字母if (ch >= 'a' && ch <= 'z' || ch >= 'A' && ch <= 'Z'){//是最后四個(gè)字母，就減22if (ch >= 'w' && ch <= 'z' || ch >= 'W' && ch <= 'Z'){ch = ch - 22;}//加4else{ch = ch + 4;}printf("%c", ch);}//是數(shù)字elseprintf("%c", ch);}return 0;
}

17.計(jì)算面積p82

#include<stdio.h>
int main()
{double r, heigh, circle, area, superarea, v1, v2;double pi = 3.14;scanf("%lf %lf", &r, &heigh);printf("圓的周長：%lf\n", 2 * pi * r);printf("圓的面積：%lf\n", pi * r * r);printf("圓球的表面積：%lf\n", 4 * pi * r * r);printf("圓球的體積：%lf\n", 3.0 / 4 * pi * r * r * r);printf("圓柱的體積：%lf\n", pi * r * r * heigh);return 0;
}

第四章

18.輸入一個(gè)小于1000的正數(shù)，要求輸出它的平方根（如平方根不是整數(shù)，則輸出其整數(shù)部分）

#include<stdio.h>
#include<math.h>
int main()
{int num = 0;int sq = 0;do{printf("請輸入一個(gè)小于1000的正整數(shù)：");scanf("%d", &num);} while (num >1000 || num < 0);sq = sqrt(num);printf("%開平方根的結(jié)果是：%d\n", sq);return 0;
}

19.有一個(gè)函數(shù)，輸入x，輸出y相應(yīng)的值（p108）

注意：乘號

#include<stdio.h>
int main()
{int x = 0;int y = 0;scanf("%d", &x);if (x < 1){y = x;printf("x=%d y=x=%d\n",x, y);}if (x >= 1 && x < 10){y = 2 * x - 1;printf("x=%d y=2x-1=%d\n", x, y);}if (x >= 10){y = 3 * x - 11;printf("x=%d y=3x-11=%d\n", x, y);}return 0;
}

20.給出100制成績，要求輸出等級(P168)

90分以上為 ：A ，80-89為：B，70-79為：C，60-69為：D，60分以下為：E

#include<stdio.h>
int main()
{int score = 0;scanf("%d", &score);switch (score / 10){case 9: printf("A\n");break;case 8:printf("B\n");break;case 7:printf("C\n");break;case 6:printf("D\n");break;default:printf("E\n");break;}return 0;
}

21.給一個(gè)不多于5位的正整數(shù)！！！！！（P109）

①求出它是幾位數(shù)；
②分別輸出每一位數(shù)字；
③按逆序輸出各位數(shù)字，例如原數(shù)為321，應(yīng)輸出123

#include<stdio.h>//輸出每一位
void fun(int n)
{if (n > 9){fun(n / 10);}printf("%d ", n % 10);
}int main()
{int num = 0;int count = 1;  //輸入的至少是一位數(shù)吧printf("輸入一個(gè)不多于5位的正整數(shù)：");scanf("%d", &num);//輸出位數(shù)int tmp = num;while (tmp / 10){count++;tmp = tmp / 10;}printf("共有%d位數(shù)\n", count);//輸出每一位,遞歸printf("每一位數(shù)如下：");fun(num);printf("\n");//逆序輸出printf("逆序輸出：");tmp = num;while (tmp){printf("%d ", tmp % 10);//輸出個(gè)位tmp = tmp / 10; //去除個(gè)位}return 0;
}

22.輸入4個(gè)整數(shù)，要求按從小到大的順序輸出p109

與第9題相似

23.輸出乘法口訣表

左上

int main()
{for (int i = 9; i > 0; i--){for (int j = 1; j <= i; j++){printf("%d*%d=%2d ", j, i, j * i);}printf("\n");}return 0;
}

左下

int main()
{for (int i = 1; i <= 9; i++){for (int j = 1; j <= i; j++){printf("%d*%d=%2d ", j, i, j * i);}printf("\n");}
}

右上

int main()
{for (int i = 9; i>0; i-- ){for (int k = 0; k < 9-i; k++){printf("\t");}for (int j = 1; j <= i; j++){printf("%2d*%2d=%2d", j, i, i * j);}printf("\n");}return 0;
}

右下

int main()
{for (int i = 1; i <= 9; i++){for (int k = 0; k < 9 - i; k++){printf("\t");}for (int j = 1; j <= i; j++){printf("%2d*%2d=%2d",i, j, i*j);}printf("\n");}return 0;
}

第五章

24.求1-100的和

#include<stdio.h>
int main()
{int sum = 0;int i = 1;/*for (i = 1; i <= 100; i++){sum += i;}*/while (i <= 100){sum += i;i++;}printf("%d\n", sum);return 0;
}

25.學(xué)校1000名學(xué)生捐款，總數(shù)到達(dá)10萬元結(jié)束，統(tǒng)計(jì)捐款人數(shù)及平均捐款數(shù)目(P122)

#include<stdio.h>
#define M 100000
int main()
{double money = 0;double sum = 0;double ave = 0;int i = 0;for (i = 1; i <= 1000; i++){scanf("%lf", &money);sum += money;if (sum >= M){break;}}ave = sum / i;  //注意此處是iprintf("人數(shù)：%d,平均每人捐：%lf\n", i, ave);return 0;
}

26.輸出100-200不能被3整除的數(shù)

#include<stdio.h>
int main()
{int i = 0;//int count = 0;for (i = 100; i <= 200; i++){if (i % 3 == 0){continue;}else{printf("%d ", i);//count++;}//5個(gè)數(shù)一行/*if (count % 5 == 0){printf("\n");}*/}return 0;
}

27.輸出下列矩陣

1 2  3   4  5
2 4  6   8 10
3 6  9  12 15
4 8 12  16 20

#include<stdio.h>
int main()
{int i = 0;int j = 0;for (i = 1; i <= 4; i++)  //幾行{for (j = 1; j <= 5; j++) //幾列{printf("%2d ", i * j);}printf("\n");}return 0;
}

28.用公式 π/4≈1-1/3+1/5-1/7+…求π的近似值，直達(dá)發(fā)現(xiàn)某一項(xiàng)的絕對值小于10^-6為止。

#include<stdio.h>
#include<math.h>
int main()
{double pi = 0;double den = 1;double term = 1.0;int flag = 1;while (fabs(term) >= 1e-6){pi = pi + term;  //累加den =  den + 2;	//分母flag = -flag;term = flag / den; //某一項(xiàng)}pi = 4 * pi;printf("pi=%lf\n", pi);return 0;
}

29.求斐波那契數(shù)列得前40 個(gè)數(shù)（p129）

方法1：循環(huán)

#include<stdio.h>
int main()
{int f1 = 1;int f2 = 1;printf("%12d%12d", f1, f2);//int i = 3;int i = 0;int f3 = 0;for (i = 1; i <= 38; i++){f3 = f1 + f2;printf("%12d", f3);f1 = f2;f2 = f3;}/*while (i <= 40){f3 = f1 + f2;printf("%12d", f3);f1 = f2;f2 = f3;i++;}*/return 0;
}

數(shù)組

int main()
{int arr[40] = { 1,1 };int i = 0; for (i = 2; i < 40; i++){arr[i] = arr[i - 1] + arr[i - 2];}for (i = 0; i < 40; i++){printf("%12d", arr[i]);//為了避免0的時(shí)候換行if ((i+1) % 5 == 0){printf("\n");}}return 0;
}

方法2：遞歸

int fib(int n)
{if (n == 1 || n == 2){return 1;}else{return fib(n - 1) + fib(n - 2);}
}#include<stdio.h>
int main()
{int f1 = 1;int f2 = 1;printf("%12d%12d", f1, f2);int i = 0;for (i = 3; i <= 40; i++){int ret = fib(i);printf("%12d", ret);}return 0;
}

方法3：一次求兩個(gè)數(shù)

一次求兩個(gè)數(shù)

#include<stdio.h>int main()
{int f1 = 1;int f2 = 1;int i = 0;for (i = 1; i <= 20; i++){printf("%12d%12d", f1, f2);f1 = f1 + f2;f2 = f2 + f1;}return 0;
}

30.統(tǒng)計(jì)輸入的一行中字母、空格、數(shù)字和其它字符的個(gè)數(shù)（p129）

#include<stdio.h>
int main()
{char ch = 0;int character = 0;int number = 0;int spacing = 0;int other = 0;while ((ch = getchar()) != '\n'){if (ch >= 'a' && ch <= 'z' || ch >= 'A' && ch <= 'Z'){character++;}else if (ch >= '0' && ch <= '9'){number++;}else if (ch == ' ')  //也可寫成ch == 32(空格的ascll碼為32){spacing++;}elseother++;}printf("character = %d, number = %d, spacing = %d, other = %d\n", character, number, spacing, other);return 0;
}

31求a+aa+aaa+aaaa+aaaaa…nn…nn的值，n表示a的位數(shù)，a是一個(gè)數(shù)字，二者都由鍵盤輸入（p129）

int main()
{int a = 0;int n = 0;scanf("%d %d", &a, &n);int count = 0;int sum = 0;int tmp = a;while (count < n){printf("%d ", a);sum += a;a = a * 10 + tmp;  //2*10+2   22*10+2   222*10+2count++;}printf("\nsum = %d\n", sum);return 0;
}

32. 1!+2!+3!+4!+5!..+n!（p129）

方法1：雙層for

 int main()
{int n = 0;scanf("%d", &n);int sum = 0;for (int i = 1; i <= n; i++){int ret = 1;for (int j = 1; j <= i; j++){//求一個(gè)數(shù)的階乘ret = ret * j;}//把每個(gè)數(shù)的階乘相加sum += ret;}printf("%d\n", sum);return 0;
}

方法2：單層循環(huán)

#include<stdio.h>
int main()
{int n = 0;scanf("%d", &n);int sum = 0;int ret = 1;for (int i = 1; i <= n; i++){ret = ret * i;sum += ret;}//int a = 1;//while (n)//{//	ret = ret * a;   //n! = (n-1)! * n//	a++;//	sum += ret;//	n--;//}printf("%d\n", sum);return 0;
}

33.求1000以內(nèi)的水仙花數(shù)，例：153 = 1³ + 5³ + 3³（p129）

#include<stdio.h>int main()
{int i = 0;int a, b, c ,sum;for (i = 100; i < 1000; i++){a = i / 100;b = i / 10 % 10;c = i % 10;sum = a * a * a + b * b * b + c * c * c;if (sum == i){printf("%d ", i);}}return 0;
}

34.求1000以內(nèi)的完美數(shù)（一個(gè)數(shù)恰好等于其真因子之和）例：6 = 1+2+3

#include<stdio.h>
int main()
{int i = 0;for (i = 1; i <= 1000; i++){int sum = 0;int j = 0;for (j = 1; j < i; j++){if (i % j == 0){sum += j;}}if (sum == i){printf("%d is factors are ", i);for (j = 1; j < i; j++){if (i % j == 0){printf("%d ", j);}}printf("\n");}}return 0;
}

35.求一個(gè)分?jǐn)?shù)序列的前20項(xiàng)和(p138)

2/1+3/2+5/3+8/5+13/8…

#include<stdio.h>
int main()
{float a = 2;float b = 1;float sum = 0;float tmp = 0;int i = 0;for (i = 1; i <= 20; i++){sum += a / b;tmp = a + b;b = a;a = tmp;}printf("%f\n", sum);
}

36.自由落體(p138)

#include<stdio.h>
int main()
{float sum = 100;float h = sum / 2;for (int i = 2; i <= 10; i++){sum += h * 2;//第n次落地經(jīng)過的m數(shù)h = h / 2;  //接下來反彈多高}printf("10次落地共經(jīng)歷%fm\n", sum);printf("10次反彈%fm\n", h);return 0;
}

37.猴子吃桃

#include<stdio.h>
int main()
{int x1 = 0;int x2 = 1;int day = 9;while (day){x1 = (x2 + 1) * 2;  //第一天的桃子是第二天桃子加一后的兩倍  例：100  吃51  ，剩49x2 = x1;day--;}printf("共有：%d個(gè)\n", x1);return 0;
}

38.智能打印菱形

#include<stdio.h>
int main()
{int n = 0;//輸入打印幾行scanf("%d", &n);int i = 0;//打印上半部分for (i = 0; i < n; i++){//打印空格int j = 0;for (j = 0; j < n -1- i; j++){printf(" ");}//打印**for (j = 0; j < 2 * i + 1; j++){printf("*");}printf("\n");}//打印下半部分for (i = 0; i < n - 1; i++){//打印空格int j = 0;for (j = 0; j <= i; j++){printf(" ");}//打印*for (j = 0; j < 2 * (n - 1 - i) - 1; j++){printf("*");}printf("\n");}return 0;
}

第六章

39.冒泡排序(p144)

普通冒泡排序

int main()
{int arr[10] = { 1,4,8,3,5,0,2,7,9,10 };int i = 0;//一共比較多少趟for (i = 0; i < 10; i++){int j = 0;//每趟比較幾次for (j = 0; j < 10 - 1 - i; j++){//從小到大排列if (arr[j] > arr[j + 1]){int tmp = arr[j];arr[j] = arr[j + 1];arr[j + 1] = tmp;}}}for (i = 0; i < 10; i++){printf("%d ", arr[i]);}return 0;
}

雙向冒泡排序

//雙向冒泡排序
void d_bubble_sort(int arr[], int num)
{int left = 0;int right = num - 1;//優(yōu)化，如果數(shù)組已經(jīng)有序，就跳出循環(huán)int flag = 0;while (left < right){flag = 1;//從左向右找最大for (int i = left; i < right; i++){//前>后，交換if (arr[i] > arr[i + 1]){flag = 0;int tmp = arr[i];arr[i] = arr[i + 1];arr[i + 1] = tmp;}}//優(yōu)化，如果遍歷了一遍數(shù)組，沒有發(fā)生交換，那就說明數(shù)組已經(jīng)有序了if (flag == 1){break;}right--;  //最大值已放在右側(cè)//從右向左找最小for (int j = right; j > left; j--){//前>后，交換if (arr[j] < arr[j - 1]){int tmp = arr[j];arr[j] = arr[j - 1];arr[j - 1] = tmp;}}left++;//最小值放在左側(cè)}
}
int main()
{int arr[10] = { 5,3,7,9,1,2,4,8,6,10 };int arr2[10] = { 1,2,3,4,5,6,7,8,9,0 };d_bubble_sort(arr2,10);int i = 0;for (i = 0; i < 10; i++){printf("%d ", arr2[i]);}return 0;
}

40.選擇排序

int main()
{int arr[10] = { 1,4,8,3,5,0,2,7,9,10 };int i = 0;for (i = 0; i < 10; i++){int j = 0;int min = i;//將i后的數(shù)進(jìn)行比較for (j = i + 1; j < 10; j++){if (arr[min] > arr[j]){min = j; //找對最小數(shù)的下標(biāo)}}//將數(shù)中的最小值與第一個(gè)數(shù)交換int tmp = arr[i];arr[i] = arr[min];arr[min] = tmp;}for (i = 0; i < 10; i++){printf("%d ", arr[i]);}
}

41.將二維數(shù)組行和列的元素互換(p149)

int main()
{int arr1[2][3] = { 1,2,3,4,5,6 };int arr2[3][2] = { 0 };int i = 0;int j = 0;for (i = 0; i < 2; i++){for (j = 0; j < 3; j++){printf("%d ", arr1[i][j]);arr2[j][i] = arr1[i][j];}printf("\n");}for (i = 0; i < 3; i++){for (j = 0; j < 2; j++){printf("%d ", arr2[i][j]);}printf("\n");}return 0;
}

42.輸出一個(gè)矩陣中的最大值，以及它的下標(biāo)（p150）

int main()
{int arr[3][4] = { 1,2,3,4,9,8,7,6,-1,-5,-8,-4 };int i = 0;int j = 0;int row = 0;int col = 0;int max = arr[0][0];for (i = 0; i < 3; i++){for (j = 0; j < 4; j++){if (max < arr[i][j]){max = arr[i][j];row = i;col = j;}}}printf("max=%d 下標(biāo)位:%d，%d\n", max, row, col);return 0;
}

43.統(tǒng)計(jì)單詞的個(gè)數(shù)（p163）

int main()
{char str[100] = { 0 };gets(str);int num = 0;int word = 0;int i = 0;for (i = 0; str[i] != '\0'; i++){char c = str[i];if (c == ' ')  //是空格，則說明當(dāng)前位置，單詞還沒開始，或者剛結(jié)束{word = 0;}else if (word == 0)   //當(dāng)前位置不是空格是字符，并且沒有操作過，則是一個(gè)單詞的開始{word = 1;num += word;}//如果該位置不是空格，并且前面不是空格，則說明它屬于一個(gè)單詞，不需要計(jì)算}printf("%d\n", num);return 0;
}

44.三個(gè)字符串，找出最大者(p164)

#include<stdio.h>
#include<string.h>
int main()
{char arr[3][20];char str[20];int i = 0;for (i = 0; i < 3; i++){gets(arr[i]);}if (strcmp(arr[0], arr[1]) > 0){strcpy(str, arr[0]);}else{strcpy(str, arr[1]);}if (strcmp(arr[2], str) > 0){strcpy(str, arr[2]);}printf("%s\n", str);return 0;
}

45.篩選法求素?cái)?shù)（p165）

#include<stdio.h>
//篩選法求1-100的素?cái)?shù)
int main()
{int arr[101] = { 0,0 };//1不是素?cái)?shù)，可以直接設(shè)置為0int i = 0;for (i = 2; i <= 100; i++){arr[i] = i;}//用2 - 99的數(shù)去除for (i = 2; i < 100; i++){int j = 0;//被除數(shù)是3-100for (j = i + 1; j <= 100; j++){if (arr[j] % i == 0){arr[j] = 0;}}}int count = 0;for (i = 0; i < 101; i++){if (arr[i] != 0){printf("%d\t", arr[i]);count++;}if (count == 10){printf("\n");count = 0;}}return 0;
}

46.求矩陣對角線之和（p165）

正對角線

int main()
{int arr[3][3] = { 1,2,3,4,5,6,7,8,9 };int sum = 0;for (int i = 0; i < 3; i++){for (int j = 0; j < 3; j++){//橫、縱坐標(biāo)相等則是正對角線if (i == j){sum += arr[i][j];}}}printf("%d\n", sum);return 0;
}

反對角線

int main()
{int arr[3][3] = { 1,2,3,4,5,6,7,8,9 };int sum = 0;for (int i = 0; i < 3; i++){for (int j = 0; j < 3; j++){//橫、縱坐標(biāo)的和等于：行數(shù)/列數(shù)減一if (i+j == 3-1){sum += arr[i][j];}}}printf("%d\n", sum);return 0;
}

47.向一個(gè)有序數(shù)組中插入一個(gè)數(shù)，按順序輸出（p165）

#include<stdio.h>
int main()
{int arr[11] = { 1,2,3,4,5,6,7,8,9,10 };int insert = 0;scanf("%d", &insert);int  i = 0;//從后往前遍歷for (i = 9; i >= 0; i--){//arr[i] > insert，arr[i]往后移if (arr[i] > insert){arr[i + 1] = arr[i];}else{arr[i + 1] = insert;//插入后，停止遍歷break;}}//如果insert是最小的，那么i就減到了-1if (i < 0){arr[0] = insert;}for (i = 0; i <= 10; i++){printf("%d ", arr[i]);}return 0;
}

48.逆序數(shù)組（p165）

int main()
{int arr[] = { 1,2,3,4,5,6,7,8,9,10};int left = 0;int right = sizeof(arr) / sizeof(arr[0]) - 1;while (left < right){int tmp = arr[left];arr[left] = arr[right];arr[right] = tmp;left++;right--;}for (int i = 0; i < 10; i++){printf("%d ", arr[i]);}return 0;
}

49.楊輝三角（p165）

方法一數(shù)組循環(huán)

int main()
{int arr[10][10] = { 0 };int i = 0;int j = 0;for (i = 0; i < 10; i++){for (j = 0; j <= i; j++){if (j == 0 || i == j){arr[i][j] = 1;}else{arr[i][j] = arr[i - 1][j] + arr[i - 1][j - 1];}}}for (i = 0; i < 10; i++){//打印空格for (j = 0; j < 10 - i; j++)printf("  ");for (j = 0; j <= i; j++){printf("%4d", arr[i][j]);}printf("\n");}return 0;
}

方法二遞歸

int func(int m, int n)
{if (m == n || n == 0){return 1;}elsereturn func(m - 1, n) + func(m - 1, n - 1);
}
int main()
{int line = 0;scanf("%d", &line);int i = 0;int j = 0;for (i = 0; i < line; i++){for (j = 0; j < line - i; j++){printf("  ");}for (j = 0; j <=i; j++){printf("%4d", func(i, j));}printf("\n");}return 0;
}

50.找出一個(gè)二維數(shù)組中的鞍點(diǎn)（p165）

鞍點(diǎn)：即該位置上的元素在該行上最大，在該列上最小。
一個(gè)數(shù)組也可能沒有鞍點(diǎn)

int main()
{int arr[3][3] = { {13,8,7}, {11,12,5}, {14,6,3} };int i = 0;int j = 0;int flag = 1; //假設(shè)該數(shù)組有鞍點(diǎn)for (i = 0; i < 3; i++){//先假設(shè)每行第一個(gè)數(shù)最大int max_min = arr[i][0];int col = 0;//記下該數(shù)是哪一列for (j = 0; j < 3; j++){//如果max_min不是該行最大的，就換if (arr[i][j] > max_min){max_min = arr[i][j];col = j; }}//再遍歷每一行的col列，比較是否是該列最小int k = 0;for (k = 0; k < 3; k++){if (arr[k][col] < max_min){flag = 0;break; //有比該數(shù)小的數(shù)，則該數(shù)不是鞍點(diǎn)}}if (flag == 1){printf("該數(shù)組的鞍點(diǎn)是：arr[%d][%d]=%d\n", i, col, max_min);break;}}if (flag == 0){printf("該數(shù)組沒有鞍點(diǎn)\n");}return 0;
}

51.折半查找（p165）

int main()
{int arr[15] = { 1,2,3,4,5,6,7,8,9,10,11,12,13,14,15 };int input = 0;scanf("%d", &input);int left = 0;int right = sizeof(arr) / sizeof(arr[0]) - 1;int flag = 1;while (left <= right){int mid = (left + right) / 2;if (input == arr[mid]){printf("找到了，下標(biāo)是：%d\n", mid);flag = 0;break;}else if (input < arr[mid]){right = mid - 1;}else{left = mid + 1;}}//if (left > right)if (flag){printf("找不到\n");}return 0;
}

52.統(tǒng)計(jì)輸入的三行中，大小寫字母、數(shù)字、空格的數(shù)量

int main()
{char arr[3][80];int upc = 0;int lowc = 0;int dig = 0;int spa = 0;int other = 0;int i = 0;for (i = 0; i < 3; i++){printf("輸入第%d行:", i+1);gets(arr[i]);int j = 0;for (j = 0; j < 80 && arr[i][j] != '\0'; j++){if (arr[i][j] >= 'A' && arr[i][j] <= 'Z'){upc++;}else if (arr[i][j] >= 'a' && arr[i][j] <= 'z'){lowc++;}else if (arr[i][j] >= '0' && arr[i][j] <= '9'){dig++;}else if (arr[i][j] == ' '){spa++;}else{other++;}}}printf("大寫：%d,小寫：%d,數(shù)字：%d,空格：%d, 其它：%d\n", upc, lowc, dig, spa, other);return 0;
}

53.模擬實(shí)現(xiàn)strcat

1. 數(shù)組

int main()
{char str1[20] = { "hello-" };char str2[20] = { "world" };int i = 0;int j = 0;while (str1[i] != '\0'){i++;}while (str2[j] != '\0'){str1[i] = str2[j];i++;j++;}str2[j] = '\0';printf("%s\n", str1);return 0;
}

2. 指針

char* my_strcat(char* dest, char* src)
{//char* ret = dest;while (*dest != '\0'){dest++;}//第一種寫法while (*src != '\0'){*dest = *src;dest++;src++;}*dest = '\0';//第二種寫法/*while (*dest++ = *src++){;}*/return ret;
}int main()
{char str1[20] = "hello-";char* str2 = "world";char* ret = my_strcat(str1, str2);printf("%s\n", ret);return 0;
}

54.模擬實(shí)現(xiàn)strcmp

1. 數(shù)組

int main()
{char str1[20] = { 0 };char str2[20] = { 0 };gets(str1);gets(str2);int i = 0;int j = 0;int ret = 0;while(str1[i] == str2[i] && str1[i] != '\0'){i++;}if (str1[i] == str2[i] && str1[i] == '\0'){ret = 0;}else{ret = str1[i] - str2[i];}printf("%d\n", ret);return 0;
}

2. 指針

int my_strcmp(char* str1, char* str2)
{while (*str1 == *str2 ){if (*str1 == '\0'){return 0;}str1++;str2++;}return *str1 - *str2;
}int main()
{char str1[20] = { 0 };char str2[20] = { 0 };gets(str1);gets(str2);int ret = my_strcmp(str1, str2);printf("%d\n", ret);return 0;
}

55.模擬實(shí)現(xiàn)strcpy

1.數(shù)組

#include<stdio.h>
#include<string.h>
int main()
{char str1[20] = { 0 };char str2[20] = { 0 };gets(str2);int len = strlen(str2);for (int i = 0; i <= len; i++){str1[i] = str2[i];}printf("%s\n", str1);return 0;
}

2. 指針

void my_strcpy(char* dest, char* src)
{while (*dest = *src){dest++;src++;}
}int main()
{char str1[20] = { 0 };char str2[20] = { 0 };gets(str2);my_strcpy(str1, str2);printf("%s\n", str1);return 0;
}

第七章

56.函數(shù)嵌套求4個(gè)數(shù)的最大值（p180）

#include<stdio.h>
int Max2(int x, int y)
{return x > y ? x : y;
}int Max_1(int a, int b, int c, int d)
{int m = 0;m = Max2(a, b);m = Max2(m, c);m = Max2(m, d);return m;
}
int main()
{int a, b, c, d, max;scanf("%d %d %d %d", &a, &b, &c, &d);max = Max_1(a,b,c,d);printf("%d\n",max);return 0;
}

57.漢諾塔問題（p188）

#include<stdio.h>void move(char x, char y)
{printf("%c--->%c\n", x, y);
}
void hanoi(int n, char A, char B, char C)
{//A盤只剩一個(gè)，直接移動(dòng)到C盤if (n == 1){move(A, C);}else{//n-1個(gè)，從A盤借助C移到B盤hanoi(n - 1, A, C, B);//第n個(gè)從A盤移動(dòng)到C盤move(A, C);//n-1個(gè)，從B盤借助A移到C盤hanoi(n - 1, B, A, C);}
}
int main()
{int n = 0;scanf("%d", &n);hanoi(n, 'A', 'B', 'C');return 0;
}

58.寫一個(gè)函數(shù)，調(diào)用該函數(shù)可求出最大、最小、平均值（p198）

//全局變量
int Max = 0;
int Min = 0;float average(int arr[], int n)
{int i = 0;float sum = 0;Max = Min = arr[0];for (i = 0; i < n; i++){if (arr[i] > Max){Max = arr[i];}else if (arr[i] < Min){Min = arr[i];}sum += arr[i];}return sum / n;
}int main()
{int arr[10] = { 0 };int i = 0;for (i = 0; i < 10; i++){scanf("%d", &arr[i]);}float ave = average(arr, 10);printf("max=%d min=%d ave=%f\n", Max, Min, ave);return 0;
}

59. 有一個(gè)字符串，輸入一個(gè)字符，刪除該字符串中的該字符（p213）

1.使用數(shù)組

void Delete(char c[], char ch)
{int i = 0;int j = 0;for (i = 0; c[i] != '\0'; i++){if (c[i] != ch){c[j] = c[i]; // 自己放自己里面j++;}}c[j] = '\0';
}
int main()
{char arr[] = "I am student";char ch = 0;printf("%s\n", arr);scanf("%c", &ch);Delete(arr, ch);printf("%s\n", arr);
}

2.使用指針

void Delete(char* c, char ch)
{char* point = c;while (*point != '\0'){if (*point != ch){//當(dāng)前字符不是要?jiǎng)h除的字符，就放進(jìn)c中*c = *point;//放完后c++c++; }//1.放進(jìn)c中后，point也++//2.是要?jiǎng)h除的字符，直接跳過point++;}*c = '\0';//最后*c的位置放上\0
}
int main()
{char arr[] = "I am student";char ch = 0;printf("%s\n", arr);scanf("%c", &ch);Delete(arr, ch);printf("%s\n", arr);
}

60，反轉(zhuǎn)字符串（p216課后習(xí)題）

#include<stdio.h>
#include<string.h>
void reverse(char c[], int left, int right)
{while (left <= right){char tmp = c[left];c[left] = c[right];c[right] = tmp;left++;right--;}
}
void Print(char arr[])
{int i = 0;for (i = 0; arr[i] != '\0'; i++){printf("%c", arr[i]);}printf("\n");
}
int main()
{char arr[] = "abcdef";int start = 0;int end = strlen(arr)-1;Print(arr);reverse(arr, start, end);Print(arr);return 0;
}

61. 寫一個(gè)函數(shù)，輸入一個(gè)4位數(shù)字，要求輸出這4個(gè)數(shù)字字符，兩個(gè)數(shù)字之間空一個(gè)空格（p216）

#include<stdio.h>
#include<string.h>
void func(char str[])
{//0123  4//3689  \0//01234567 8//3 6 8 9 \0 int i = 0;//第一個(gè)數(shù)字不動(dòng)//別忘記\0for (i = strlen(str); i > 0; i--){str[2 * i] = str[i];str[2 * i - 1] = ' ';}printf("%s", str);
}int main()
{char str[10];scanf("%s", &str);func(str);return 0;
}

62.寫一個(gè)函數(shù)，輸入一行字符，將字符串中最長的單詞輸出（p216）

int judge_alpha(char ch)
{if (ch >= 'a' && ch <= 'z' || ch >= 'A' && ch <= 'Z'){return 1;}else{return 0;}
}
int TheLongestString(char string[], int len)
{int i = 0;int length = 0;int end_len = 0;int flag = 1;//假設(shè)該位置是一個(gè)單詞的開始int start_point = 0;int place = 0;for (i = 0; i <= len; i++){//是字母，計(jì)數(shù)if (judge_alpha(string[i])){//是一個(gè)單詞的開始，記錄開始位置if (flag){start_point = i;flag = 0;}//記錄完位置，記錄長度//不是一個(gè)單詞的開始，那就說明屬于這個(gè)單詞，計(jì)算該單詞的長度length++;}//不是字符:單詞結(jié)束else{flag = 1;if (length > end_len){end_len = length;length = 0; //置為0，繼續(xù)記錄下一個(gè)單詞的長度}}}return start_point;
}int main()
{char str[20] = { 0 };gets(str);int len = strlen(str);int ret = TheLongestString(str, len);int i = 0;//此處也可以定義全局變量接最長字符串的長度，就不需要調(diào)用judeg_alpha函數(shù)了for (i = ret; judge_alpha(str[i]); i++){printf("%c", str[i]);}return 0;
}

63. 輸入10個(gè)學(xué)生5門課程的成績，分別用函數(shù)實(shí)現(xiàn)以下功能(p216)

1. 計(jì)算每個(gè)學(xué)生的平均分
2. 計(jì)算每門課程的平均分
3. 找出所有50個(gè)分?jǐn)?shù)中最高的分?jǐn)?shù)所對應(yīng)的學(xué)生和課程
4. 計(jì)算每個(gè)學(xué)生平均分的方差

#include<stdio.h>
#define M 2
#define N 5
//計(jì)算每個(gè)人的平均分
void student_ave(float arr[M][N], float ave[N])
{int i = 0;for (i = 0; i < M; i++){float sum = 0;int j = 0;for (j = 0; j < N; j++){sum += arr[i][j];}ave[i] = sum / N;printf("Num %d: average score = %.2f\n", i+1, ave[i]);}printf("\n");
}//計(jì)算每門課程平均分
void lesson_ave(float arr[M][N])
{int i = 0;int j = 0;for (i = 0; i < N; i++){float sum = 0;for (j = 0; j < M; j++){sum += arr[j][i];}printf("lesson%d average:%.2f\n", i + 1, sum / M);}printf("\n");
}
//找出所有課程中最大的分?jǐn)?shù)及其學(xué)生、課程名
void findmax(float arr[M][N])
{float max = arr[0][0];int i = 0;int j = 0;int student = 0;int course = 0;for (i = 0; i < M; i++){for (j = 0; j < N; j++){if (arr[i][j] > max){max = arr[i][j];student = i;  //記錄名字course = j;	//記錄課程}}}printf("max = %.2f student = %d course = %d\n", max, student+1, course+1);
}
//求平均分的方差
void s_s(float ave[N])
{float sum_s = 0.0;float sum = 0.0;for (int i = 0; i < N; i++){sum_s += ave[i] * ave[i];sum += ave[i];}printf("方差是：%.2f\n", (sum_s / N) - ((sum / N) * (sum / N)));
}int main()
{float arr[M][N] = { 0 };float ave_score[N] = { 0 };int i = 0;for (i = 0; i < M; i++){int j = 0;for (j = 0; j < N; j++){scanf("%f", &arr[i][j]);}}//計(jì)算每個(gè)學(xué)生平均分student_ave(arr, ave_score);lesson_ave(arr);findmax(arr);s_s(ave_score);return 0;
}

64.進(jìn)制轉(zhuǎn)換，函數(shù)實(shí)現(xiàn)(p216)

1. 十六進(jìn)制轉(zhuǎn)十進(jìn)制

int convert(char* p)
{int sum = 0;while (*p != '\0'){if (*p >= 'A' && *p <= 'f'){sum = sum * 16 +  *p - 'A' + 10;}else if (*p >= 'a' && *p <= 'f'){sum = sum * 16 + *p - 'a' + 10;}else if(*p >= '0' && *p <="9"){sum = sum * 16 + (*p - '0') * 16;}p++;}return sum;
}int main()
{char str[10] = {0};gets(str);int sum = convert(str);printf("%d\n", sum);return 0;
}

2. 十進(jìn)制轉(zhuǎn)八進(jìn)制

void convert(int n)
{if (n){convert(n / 8);printf("%d", n % 8);}
}int main()
{int num = 0;scanf("%d", &num);convert(num);return 0;
}

3. 十進(jìn)制轉(zhuǎn)二進(jìn)制

int convert(int n)
{int sum = 0;int ret = 0;if (n){ret = convert(n / 2) * 10 ;sum = ret + (n % 2);}return sum;
}int main()
{int num = 0;scanf("%d", &num);int ret = convert(num);printf("%d\n", ret);return 0;
}

65.用遞歸法將一個(gè)整數(shù)n轉(zhuǎn)換為字符串(p216)

void convert(int n)
{if (n / 10 != 0){convert(n / 10);}putchar(n % 10 + '0');
}int main()
{int n = 0;scanf("%d", &n);if (n < 0){putchar('-');n = -n;}convert(n);return 0;
}

66.給出年月日，計(jì)算該日是該年的第幾天(p216)

int sum_day(int year, int month, int day)
{int arr[13] = { 0,31,28,31,30,31,30,31,31,30,31,30,31 };int sum = day;for (int i = 1; i < month; i++){sum += arr[i];}if (year % 4 == 0 && year % 100 != 0 || year % 400 == 0){sum++;}return sum;
}int main()
{int year, month, day;scanf("%d %d %d", &year, &month, &day);int ret = sum_day(year, month, day);printf("%d\n", ret);return 0;
}

第八章(均使用指針)

67.按由大到小順序輸出兩數(shù)，指針實(shí)現(xiàn)（p227）

void swap(int* a, int* b)
{int tmp = *a;*a = *b;*b = tmp;
}
int main()
{int a = 0;int b = 0;scanf("%d %d", &a, &b);if (a < b){swap(&a, &b);}printf("max = %d, min = %d\n", a, b);return 0;
}

68.使用指針將n個(gè)整數(shù)按相反順序存放（p242）

void reverse(int* arr, int num)
{int n = num / 2;int* left = arr;int* right = arr + num - 1;for (int i = 0; i < n; i++){int tmp = 0;tmp = *left;*left = *right;*right = tmp;left++;right--;}
}int  main()
{int arr[10] = { 1,2,3,4,5,6,7,8,9,10 };reverse(arr, 10);int i = 0;for (i = 0; i < 10; i++){printf("%d ", arr[i]);}return 0;
}

69. 輸入三個(gè)字符串，由小到大輸出（p291）

#include<string.h>
void swap(char* s1, char* s2)
{char str[20] = { 0 };strcpy(str, s1);strcpy(s1, s2);strcpy(s2, str);
}int main()
{char str1[20] = { 0 };char str2[20] = { 0 };char str3[20] = { 0 };gets(str1);gets(str2);gets(str3);if (strcmp(str1, str2) > 0)swap(str1, str2);if (strcmp(str1, str3) > 0)swap(str1, str3);if (strcmp(str2, str3) > 0)swap(str2, str3);printf("%s %s %s\n", str1, str2, str3);return 0;
}

70.輸入10個(gè)數(shù)，將最小數(shù)與第一個(gè)交換，最大數(shù)與最后一個(gè)交換（p291）

void exchange(int* arr, int num)
{int* max = arr;int* min = arr;int i = 0;for (i = 0; i < num; i++){if (*(arr + i) >= *max){max = arr + i;}if (*(arr + i) <= *min){min = arr + i;}}//若最大值就是首元素，為了避免最小值與首元素交換后找不到最大值if (max == arr){max = min;}int tmp = *arr;*arr = *min;*min = tmp;tmp = *(arr + num - 1);*(arr + num - 1) = *max;*max = tmp;
}int main()
{int arr[10] = { 0 };int i = 0;for (i = 0; i < 10; i++){scanf("%d", &arr[i]);}exchange(arr, 10);for (i = 0; i < 10; i++){printf("%d ", arr[i]);}return 0;
}

71.n個(gè)整數(shù)，使前面各數(shù)向后移動(dòng)m個(gè)位置，最后m個(gè)數(shù)變成最前面m個(gè)數(shù)（p291）

其實(shí)就是左旋

void rotate(int* parr, int m, int n)
{for (int j = 0; j < m; j++){int tmp = *(parr + n - 1);//旋轉(zhuǎn)一次for (int i = n - 1; i > 0; i--){*(parr + i) = *(parr + i - 1);}//最后一個(gè)數(shù)放在前面*parr = tmp;}
}int main()
{int arr[10] = { 0 };int i = 0;int m = 3;for (i = 0; i < 10; i++){scanf("%d", &arr[i]);}rotate(arr, m, 10);for (i = 0; i < 10; i++){printf("%d ", arr[i]);}return 0;
}

72.n個(gè)人圍一圈報(bào)數(shù)（p291）

int main()
{int arr[100] = { 0 };//定義一個(gè)數(shù)組，存放每個(gè)人喊得數(shù)字int count = 0;//幾個(gè)人scanf("%d", &count);int digit = 1;//要喊得數(shù)字int remain = count;	//剩余人數(shù)while (remain > 1) //還未找出贏家{for (int i = 1; i <= count; i++){if (*(arr+i) == 3){continue;//當(dāng)前位置是3，跳過}*(arr + i) = digit;if (digit == 3)//喊完3就要喊1了，又因?yàn)橄旅孢€有個(gè)++，所以賦值為0{digit = 0;remain--;//剩余人數(shù)-1}digit++;}}for (int j = 1; j <= count; j++){if (*(arr + j) != 3){printf("%d\n", j);break;}}return 0;
}

73.寫一個(gè)函數(shù)，求字符串的長度（p291）

int my_strlen(char* str)
{int count = 0;while (*str != '\0'){count++;str++;}return count;
}int main()
{char* str = "abcdef";printf("%d\n", my_strlen(str));return 0;
}

74.從該字符串的第m的字符開始，全部復(fù)制到另一個(gè)字符串中（p291）

void my_m_strcpy(char* str1, char* str2, int m)
{int count = 0;while (count < m - 1){count++;str1++;}while (*str1 != '\0'){*str2 = *str1;str2++;str1++;}*str2 = '\0';
}int main()
{char str1[20] = "hello world";char str2[20] = { 0 };int m = 0;scanf("%d", &m);my_m_strcpy(str1, str2, m);printf("%s\n", str2);return 0;
}

75.輸入一行字符串，統(tǒng)計(jì)大小寫字母、數(shù)字、空格和其它字符的個(gè)數(shù)（p291）

int main()
{int upc = 0;int lowc = 0;int digit = 0;int space = 0;int other = 0;char str[50] = { 0 };gets(str);char* p = str;while (*p != '\0'){if (*p >= 'A' && *p <= 'Z'){upc++;}else if (*p >= 'a' && *p <= 'z'){lowc++;}else if(*p >= '0' && *p <= '9'){digit++;}else if (*p == ' '){space++;}else{other++;}p++;}printf("%d %d %d %d %d\n", upc, lowc, digit, space, other);return 0;
}

76.寫一個(gè)函數(shù)，轉(zhuǎn)置矩陣（p291）

void move1(int* parr)
{int i = 0;for (i = 0; i < 3; i++){int j = 0;for (j = i; j < 3; j++){int tmp = 0;tmp = *(parr + 3 * i + j);*(parr + 3 * i + j) = *(parr + 3 * j + i);*(parr + 3 * j + i) = tmp;}}
}void move2(int (*parr)[3])
{int i = 0;for (i = 0; i < 3; i++){int j = 0;//此處應(yīng)該是j=i，否則就會交換兩次，變回原型了for (j = i; j < 3; j++){int tmp = 0;tmp = *(*(parr + i) + j);*(*(parr + i) + j) = *(*(parr + j) + i);*(*(parr + j) + i) = tmp;}}
}int main()
{int arr[3][3] = { 1,2,3,1,2,3,1,2,3};move1(&arr[0][0]);  //普通指針，注意傳的是第一個(gè)元素的地址//int(*p)[3] = arr; //數(shù)組指針//move2(p);int i = 0;for (i = 0; i < 3; i++){int j = 0; for (j = 0; j < 3; j++){printf("%d ", arr[i][j]);}printf("\n");}return 0;
}

77. 5×5數(shù)組，將最大值放在中間位置，4個(gè)最小值放在四個(gè)角上（p291）

void operation(int(*p)[5], int row, int col)
{//一、找最大值//為了不記錄最大值的下標(biāo)，此處使用指針更加方便int* mid =&p[row / 2][col/2];int* max = &p[0][0];//1.找最大值for (int i = 0;  i < 5; i++){for (int j = 0; j < 5; j++){if (*max < p[i][j]){max = &p[i][j];}}}//2.找到最大值，交換int tmp = *mid;*mid = *max;*max = tmp;//二、找四個(gè)最小值//1.記錄由四個(gè)角的位置int* corner[4] = { &p[0][0], &p[0][col - 1],&p[row-1][0], &p[row-1][col-1] };//2.遍歷數(shù)組，尋找最小值for (int k = 0; k < 4; k++)//需要尋找四次{int* min = mid; //每次都要將最小值初始化為數(shù)組的最大值for (int n = 0; n < row; n++){for (int m = 0; m < col; m++){//3.判斷該位置是否是角落位置int t = 0;for (t = 0; t < k; t++){//找第0個(gè)最小數(shù)的時(shí)候，k=0,意味著沒有角落被交換if (&p[n][m] == corner[t]){break;}}if (t != k)  //說明是break出來的，該位置已經(jīng)被交換過了，不需要交換了{continue;//}if (*min > p[n][m]){min = &p[n][m];}}}int tmp = *corner[k];*corner[k] = *min;*min =tmp;}
}
int main()
{int arr[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},};operation(arr,5,5);int i = 0; for (i = 0; i < 5; i++){int j = 0;for (j = 0; j < 5; j++){printf("%d ", arr[i][j]);}printf("\n");}return 0;
}

78.10個(gè)字符串，對他們進(jìn)行排序（p291）

void sort(char* *p, int count)
{int i = 0;for (i = 0; i < count-1; i++){int j = 0;for (j = 0; j < count - 1 - i; j++){//由大到小排序if (strcmp(*(p + j), *(p + j + 1)) < 0){char* tmp = *(p + j);*(p + j) = *(p + j + 1);*(p + j + 1) = tmp;}}}
}
int main()
{int i = 0;char str[10][20] = { 0 };char* arr[10] = { 0 };for (i = 0; i < 10; i++){//指針數(shù)組要想初始化，必須先有一個(gè)數(shù)組scanf("%s", str[i]);arr[i] = str[i];}sort(arr, 10);for (i = 0; i < 10; i++){printf("%s\n", arr[i]);}return 0;
}

79.逆序10個(gè)數(shù)（p291）

void reverse(int* arr, int count)
{int* left = arr;int* right = arr + count - 1;while (left < right){int tmp = *left;*left = *right;*right = tmp;left++;right--;}
}int main()
{int arr[10] = { 0 };int i = 0;for (i = 0; i < 10; i++){scanf("%d", &arr[i]);}reverse(arr, 10);for (i = 0; i < 10; i++){printf("%d ", arr[i]);}return 0;
}

80.寫三個(gè)函數(shù)，實(shí)現(xiàn)以下功能（數(shù)組實(shí)現(xiàn)）

4個(gè)學(xué)生，5門課程

1. 求一門課程的平均分
2. 找出有兩門以上課程不及格的學(xué)生，打印出信息
3. 找出平均成績在90分或全部課程在85分以上的學(xué)生，記為優(yōu)秀

void average(int arr[4][5], int row, int col, int course)
{int i = 0;int j = 0;int sum = 0;for (i = 0; i < row; i++){sum += arr[i][course - 1];}printf("課程序號:%d, average = %d\n", course, sum / row);
}void find_student(int arr[4][5], int row, int col)
{int i = 0;int j = 0;for (i = 0; i < row; i++){int count = 0;for (j = 0; j < col; j++){if (arr[i][j] < 60){count++;}}if (count > 2){printf("第%d名學(xué)生有兩門以上不及格\n", i+1);}}printf("\n");}void find_ave_85(int arr[4][5], int row, int col)
{int i = 0;int j = 0;for (i = 0; i < row; i++){int sum = 0;int average = 0;int count = 0;for (j = 0; j < col; j++){sum += arr[i][j];if (arr[i][j] > 85){count++;}}average = sum / col;//平均分大于90或所有全在85以上if (average > 90 || count == col){printf("第%d名學(xué)生優(yōu)秀\n", i + 1);}}printf("\n");
}int main()
{int arr[4][5] = { 0 };int i = 0;int j = 0;for (i = 0; i < 4; i++){for (j = 0; j < 5; j++){scanf("%d", &arr[i][j]);}}//計(jì)算某一門課程平均分average(arr, 4, 5, 1);//找2門以上不及格學(xué)生find_student(arr, 4, 5);//找優(yōu)秀學(xué)生find_ave_85(arr, 4, 5);return 0;
}

81輸入一個(gè)字符串，統(tǒng)計(jì)其中連續(xù)數(shù)字的個(gè)數(shù)，并將數(shù)字放在一個(gè)數(shù)組中

int main()
{char str[100] = { 0 };char a[10][100] = { 0 };gets(str);char* ptr = str;int row = 0;int col = 0;while (*ptr != '\0'){//當(dāng)前字符是數(shù)字，開始讀取數(shù)字字符串if (*ptr >= '0' && *ptr <= '9')   {while (*ptr >= '0' && *ptr <= '9' && *ptr != '\0'){//連續(xù)存儲一個(gè)數(shù)字字符串a[row][col] = *ptr;col++;ptr++;}a[row][col] = '\0';//來到這里，說明非數(shù)字字符或者\(yùn)0//1.非數(shù)字字符，開始存儲下一個(gè)數(shù)字字符串row++;col = 0;//2.若是\0,跳出循環(huán)，停止訪問，以防止越界if (*ptr == '\0'){break;}}//不是字符串，指針后移else{ptr++;}}printf("%d個(gè)數(shù)字\n", row);for (int i = 0; i < row; i++){printf("%s\n", a[i]);}return 0;
}

82.輸入月份，輸出對應(yīng)的英文單詞，使用指針數(shù)組處理

int main()
{char* arr[13] = { NULL,"January","February","March","April","May","June","July","August","Septembet","October","November","December" };int month = 0;scanf("%d", &month);if (month >= 1 && month <= 12){printf("%s\n", arr[month]);}else{printf("illegal input\n");}return 0;
}