免费视频淫片aa毛片_日韩高清在线亚洲专区vr_日韩大片免费观看视频播放_亚洲欧美国产精品完整版

打開APP
userphoto
未登錄

開通VIP，暢享免費電子書等14項超值服

開通VIP

首頁

好書

留言交流

下載APP

聯(lián)系客服
C語言程序設(shè)計現(xiàn)代方法第二版，第八章課后編程習題全部答案

  • 2018-07-18 

自己練習時手寫，難免會有些疏忽遺漏等各種各樣問題，錯誤之處還請指出

但這些代碼確實已通過編譯，實現(xiàn)了書上的輸出結(jié)果，還希望能給需要之人作為個小參考

8_1

  1. #include <stdio.h>
  2. #include <stdbool.h>
  4. int main (void)
  5. {
  6. bool digit_seen[10] = {false}, digit_wr[10] = {false}, flag = false;
  7. int digit;
  8. long n;
  10. printf ('Enter a number: ');
  11. scanf ('%ld', &n);
  13. while (n > 0) {
  14. digit = n % 10;
  15. if (digit_seen[digit] == true) {
  16. flag = true;
  17. digit_wr[digit] = true;
  18. }
  19. digit_seen[digit] = true;
  20. n /= 10;
  21. }
  23. if (flag) {
  24. printf ('Repeated digits(s): ');
  25. for (int i = 0; i < 10; i ) {
  26. if (digit_wr[i]) printf ('%d ', i);
  27. }
  28. }
  29. else
  30. printf ('No repeated digit\n');
  32. return 0;
  33. }

8_2

  1. #define _CRT_SECURE_NO_WARNINGS
  3. #include <stdio.h>
  4. #include <stdlib.h>
  6. int main (void)
  7. {
  8. 	int digit_wr[10] = {0};
  9. 	int digit;
  10. 	int n;
  12. 	printf ('Enter a number：');
  13. 	scanf ('%d', &n);
  15. 	while (n > 0) {
  16. 		digit = n % 10;
  17. 		digit_wr[digit]  ;
  18. 		n /= 10;
  19. 	}
  21. 	printf ('Digit:\t\t');
  22. 	for (int i = 0; i < 10; i  ) {
  23. 		printf ('%3d', i);
  24. 	}
  26. 	printf ('\nOccurrences:\t');
  27. 	for (int i = 0; i < 10; i  ) {
  28. 		printf ('%3d', digit_wr[i]);
  29. 	}
  31. 	printf('\n');
  32. 	system('pause');
  33. 	return 0;
  34. }

8_3

  1. #include <stdio.h>
  2. #include <stdbool.h>
  4. /* * * * * * * * * * * * * * * * * * * * * * * *
  5. * 連續(xù)輸入一百以內(nèi)數(shù)，當輸入的數(shù)小于或等于0 *
  6. * 時程序終止。 *
  7. * * * * * * * * * * * * * * * * * * * * * * * */
  9. int main(void)
  10. {
  11. bool flag;
  12. int digit;
  13. int n;
  15. while (1) {
  16. //每次執(zhí)行前將標志數(shù)組和標志變量初始化
  17. bool digit_seen[10] = {false};
  18. flag = false;
  20. printf ('Enter a number: ');
  21. scanf ('%d', &n);
  23. //如果輸入是0跳出循環(huán)，結(jié)束
  24. if (n <= 0) break;
  25. while (n > 0) {
  26. digit = n % 10;
  27. if (digit_seen[digit] == true) flag = true;
  28. digit_seen[digit] = true;
  29. n = n / 10;
  30. }
  31. if (flag) {
  32. printf('Repeated digit\n');
  33. }
  34. else {
  35. printf('No repeated digit\n');
  36. }
  37. }
  39. return 0;
  40. }

8_4

  1. #define _CRT_SECURE_NO_WARNINGS
  3. #include <stdio.h>
  4. #include <stdlib.h>
  6. #define SIZE  (int)(sizeof (a) / sizeof (a[0]))
  7. #define N 10
  9. int main (void)
  10. {
  11. 	int a[N], i;
  13. 	printf ('Enter %d numbers: ', N);
  14. 	for (i=0; i < SIZE; i  )
  15. 		scanf ('%d', &a[i]);
  17. 	printf ('In reverse order: ');
  18. 	for (i = SIZE - 1; i >= 0; i--)
  19. 		printf (' %d', a[i]);
  20. 	printf ('\n');
  22. 	printf('\n');
  23. 	system('pause');
  24. 	return 0;
  25. }

8_5

  1. #include <stdio.h>
  3. #define NUM_RATES ((int)(sizeof (value) / sizeof (value[0])))
  4. #define INITIAL_BALANCE 100.00
  6. int main (void)
  7. {
  8. int i, low_rate, num_years, year, month;
  9. double value[5];
  11. printf ('Enter interst rate: ');
  12. scanf ('%d', &low_rate);
  13. printf ('Enter number of years: ');
  14. scanf ('%d', &num_years);
  16. printf ('\nYears');
  17. for (i = 0; i < NUM_RATES; i ) {
  18. printf ('%6d%%', low_rate i);
  19. value[i] = INITIAL_BALANCE;
  20. }
  21. printf ('\n');
  23. for (year = 1; year <= num_years; year ) {
  24. printf ('%3d ');
  25. for (i = 0; i < NUM_RATES; i ) {
  26. for (month = 1; month <= 12; month ) {
  27. value[i] = ((double)(low_rate i) / 12) / 100.0 * value[i];
  28. }
  29. printf ('%7.2f', value[i]);
  30. }
  31. printf ('\n');
  32. }
  34. return 0;
  35. }

8_6

  1. #include <stdio.h>
  2. #include <ctype.h>
  4. int main (void)
  5. {
  6. 	char mess[100];
  7. 	int i = 0, j;
  9. 	printf ('Enter message: ');
  10. 	while (((mess[i]) = getchar () ) != '\n') {
  11. 		i  ;
  12. 	}
  14. 	printf ('In B1FF-speak: ');
  15. 	for (j = 0; j < i; j  ) {
  16. 		if ((mess[j] <= 122) && (mess[j] >= 97)){
  17. 			mess[j] = toupper (mess[j]);
  18. 		}
  20. 		switch (mess[j]) {
  21. 			case 'A': printf ('4'); break;
  22. 			case 'B': printf ('8'); break;
  23. 			case 'E': printf ('3'); break;
  24. 			case 'I': printf ('1'); break;
  25. 			case 'O': printf ('0'); break;
  26. 			case 'S': printf ('5'); break;
  27. 			default : printf ('%c', mess[j]); break;
  28. 		}
  29. 	}
  30. 	printf ('!!!!!!!!!!');
  32. 	return 0;
  34. }

8_7

  1. #include <stdio.h>
  3. #define N 5
  5. int main(void)
  6. {
  7. int a[N][N] = {0};
  8. int i, j;
  10. for (i = 0; i < N; i ) {
  11. printf('Enter row %d: ', i 1);
  12. for (j = 0; j < N; j ) {
  13. scanf('%d', &a[i][j]);
  14. }
  15. }
  17. int sum;
  19. printf('Row totals: ');
  20. for (i = 0; i < N; i ) {
  21. for (j = 0; j < N; j ) {
  22. sum = a[i][j];
  23. }
  24. printf('%d ', sum);
  25. sum = 0;
  26. }
  28. printf('\nColumn totals: ');
  29. for (j = 0; j < N; j ) {
  30. for (i = 0; i < N; i ) {
  31. sum = a[i][j];
  32. }
  33. printf('%d ', sum);
  34. sum = 0;
  35. }
  37. return 0;
  38. }

8_8

  1. #include <stdio.h>
  3. #define N 5
  5. int main(void)
  6. {
  7. 	int a[N][N];
  8. 	int i, j;
  10. 	for (i = 0; i < N; i  ) {
  11. 		printf('輸入學生%d的五門成績：', i   1);
  12. 		for (j = 0; j < N; j  ) {
  13. 			scanf('%d', &a[i][j]);
  14. 		}
  15. 	}
  16. 	printf('\n');
  18. 	int sum = 0;
  19. 	float average = 0.0f;
  21. 	for (i = 0; i < N; i  ) {
  22. 		for (j = 0; j < N; j  ) {
  23. 			sum  = a[i][j];
  24. 		}
  25. 		average = (float) sum / N;
  26. 		printf('學生%d的總成績和平均分分別為%d和%.2f\n', i, sum, average);
  27. 		sum = 0;
  28. 	}
  29. 	printf('\n');
  31. 	int max, mix;
  32. 	sum = 0;
  33. 	average = 0.0f;
  35. 	for (j = 0; j < N; j  ) {
  36. 		max = a[0][j];
  37. 		mix = a[0][j];
  38. 		for (i = 0; i < N; i  ) {
  39. 			if (max < a[i][j]) max = a[i][j];
  40. 			if (mix > a[i][j]) mix = a[i][j];
  41. 			sum  = a[i][j];
  42. 		}
  43. 		average = (float) sum / N;
  44. 		printf('學科%d的平均分是%.2f，最高分是%d，最低分是%d\n', j, average, max, mix);
  45. 		sum = 0;
  46. 	}
  49. 	return 0;
  50. }

8_9

  1. #include <stdio.h>
  2. #include <time.h>
  3. #include <stdlib.h>
  4. #include <stdbool.h>
  6. #define N 10
  7. #define WAY 4
  9. int main(void)
  10. {
  11. bool a[N][N] = {false};
  12. char b[N][N];
  13. int i, j;
  15. //初始化表
  16. for (i = 0; i < N; i ) {
  17. for (j = 0; j < N; j ) {
  18. b[i][j] = '.';
  19. }
  20. }
  22. srand((unsigned) time(NULL));
  23. int ways;
  24. i = 0; j = 0;
  25. b[0][0] = 'A';
  26. a[0][0] = true;
  28. for (int m = 0; m < 25; ) {
  29. //余0表上， 1表下， 2表左， 3表右
  30. ways = rand() % WAY;
  32. if (ways == 0) {
  33. //如果往上走出表格了，continue重新循環(huán)試試別的方向
  34. if (i - 1 < 0) {
  35. continue;
  36. }
  37. //如果往上走有字母了， 進行判斷
  38. else if (a[i - 1][j] == true){
  39. //如果四面都是字母，退出
  40. if ((a[i 1][j] == true && a[i][j - 1] == true && a[i][j 1] == true)
  41. // 考慮左邊和左下角情況
  42. || j - 1 < 0 && a[i 1][j] == true && a[i][j 1] == true
  43. || j - 1 < 0 && i 1 > 9 && a[i][j 1] == true
  44. // 右邊和右下角
  45. || j 1 > 9 && a[i 1][j] == true && a[i][j - 1] == true
  46. || j - 1 < 0 && i 1 > 9 && a[i][j 1] == true
  47. //下邊
  48. || i 1 > 9 && a[i][j 1] == true && a[i][j - 1] == true) break;
  49. //如果都不是，重新選方向
  50. continue;
  51. } else {
  52. a[i - 1][j] = true;
  53. b[i - 1][j] = 'B' m;
  54. m ;
  55. i--;
  56. continue;
  57. }
  58. }
  60. if (ways == 1) {
  61. if (i 1 > 9) {
  62. continue;
  63. } else if (a[i 1][j] == true){
  64. if (a[i - 1][j] == true && a[i][j - 1] == true && a[i][j 1] == true
  65. //右邊和右上角
  66. || j 1 > 9 && a[i][j - 1] == true && a[i - 1][j] == true
  67. || j 1 > 9 && i - 1 < 0 && a[i][j - 1] == true
  68. //左邊
  69. || j - 1 < 0 && a[i - 1][j] == true && a[i][j 1] == true
  70. //上邊
  71. || i - 1 < 0 && a[i][j 1] == true && a[i][j - 1] == true) break;
  72. continue;
  73. } else {
  74. a[i 1][j] = true;
  75. b[i 1][j] = 'B' m;
  76. m ;
  77. i ;
  78. continue;
  79. }
  80. }
  82. if (ways == 2) {
  83. if (j - 1 < 0) {
  84. continue;
  85. } else if (a[i][j - 1] == true){
  86. if (a[i 1][j] == true && a[i - 1][j] == true && a[i][j 1] == true
  87. // 考慮下邊和右下角情況
  88. || i 1 > 9 && a[i - 1][j] == true && a[i][j 1] == true
  89. || j 1 > 9 && i 1 > 9 && a[i - 1][j] == true
  90. // 上邊和右上角
  91. || i - 1 < 0 && a[i 1][j] == true && a[i][j 1] == true
  92. || j 1 > 9 && i - 1 < 0 && a[i][j 1] == true
  93. // 右邊
  94. || j 1 > 9 && a[i - 1][j] == true && a[i 1][j] == true) break;
  95. continue;
  96. } else {
  97. a[i][j - 1] = true;
  98. b[i][j - 1] = 'B' m;
  99. m ;
  100. j--;
  101. continue;
  102. }
  103. }
  105. if (ways == 3) {
  106. if (j 1 > 9) {
  107. continue;
  108. } else if (a[i][j 1] == true){
  109. if (a[i 1][j] == true && a[i][j - 1] == true && a[i - 1][j] == true
  110. //左邊和左下角
  111. || j - 1 < 0 && a[i - 1][j] == true && a[i 1][j] == true
  112. || j - 1 < 0 && i 1 > 9 && a[i - 1][j] == true
  113. //下邊
  114. || i 1 > 9 && a[i - 1][j] == true && a[i][j - 1] == true
  115. //上邊
  116. || i - 1 < 0 && a[i][j - 1] == true && a[i 1][j] == true) break;
  117. continue;
  118. } else {
  119. a[i][j 1] = true;
  120. b[i][j 1] = 'B' m;
  121. m ;
  122. j ;
  123. continue;
  124. }
  125. }
  126. }
  128. for (i = 0; i < N; i ) {
  129. for (j = 0; j < N; j ) {
  130. printf('%c ', b[i][j]);
  131. }
  132. printf('\n');
  133. }
  136. return 0;
  137. }

8_10

  1. #include <stdio.h>
  2. #include <math.h>
  4. int main(void)
  5. {
  6. 	const int lea[8] = {480, 583, 679, 767, 840, 945, 1140, 1305};
  7. 	const int arr[8] = {616, 712, 811, 900, 968, 1075, 1280, 1438};
  9. 	int hours, minutes;
  10. 	int time;
  12. 	printf ('Enter a 24-hour time:');
  13. 	scanf ('%d:%d', &hours, &minutes);
  14. 	//將時間換算成分鐘
  15. 	time = hours * 60   minutes;
  17. 	int mix = 1440, m;
  19. 	//找到距離最近的時間，并記錄其下標
  20. 	for (int i = 0; i < 8; i  ) {
  21. 		if (fabs(lea[i] - time) < mix) {
  22. 			mix = fabs(lea[i] - time);
  23. 			m = i;
  24. 		}
  25. 	}
  27. 	int hour, minute;
  28. 	//判斷是上午還是下午并輸出
  29. 	if (lea[m] / 60 > 12) {
  30. 		if (arr[m] / 60 > 12) {
  31. 			printf('CLosest departure time is %d:%.2d p.m.', lea[m] / 60 - 12, lea[m] % 60);
  32. 			printf(', arriving at %d:%.2d p.m.', arr[m] / 60 -12, arr[m] % 60);
  33. 		}
  34. 	} else {
  35. 		if (arr[m] / 60 > 12) {
  36. 			printf('CLosest departure time is %d:%.2d a.m.', lea[m] / 60, lea[m] % 60);
  37. 			printf(', arriving at %d:%.2d p.m.', arr[m] / 60 -12, arr[m] % 60);
  38. 		} else {
  39. 			printf('CLosest departure time is %d:%.2d a.m.', lea[m] / 60, lea[m] % 60);
  40. 			printf(', arriving at %d:%.2d p.m.', arr[m] / 60, arr[m] % 60);
  41. 		}
  42. 	}
  44. 	return 0;
  45. }

8_11

  1. #include <stdio.h>
  3. int main (void)
  4. {
  5. int ch, i = 0;
  6. char c[15];
  8. printf ('Enter phone number: ');
  10. //輸入字符直到為回車為止
  11. while ((ch = getchar ()) != '\n') {
  12. //輸入的如果是字母，換成數(shù)字
  13. if (ch <= 'Z' && ch >= 'A') {
  14. switch (ch) {
  15. case 65: case 66: case 67:
  16. c[i] = '2';
  17. break;
  18. case 68: case 69: case 70:
  19. c[i] = '3';
  20. break;
  21. case 71: case 72: case 73:
  22. c[i] = '4';
  23. break;
  24. case 74: case 75: case 76:
  25. c[i] = '5';
  26. break;
  27. case 77: case 78: case 79:
  28. c[i] = '6';
  29. break;
  30. case 81: case 82: case 83: case 80:
  31. c[i] = '7';
  32. break;
  33. case 84: case 85: case 86: case 87:
  34. c[i] = '8';
  35. break;
  36. case 88: case 89: case 90:
  37. c[i] = '9';
  38. break;
  39. }
  40. i ;
  41. continue;
  42. }
  44. c[i] = ch;
  45. i ;
  46. }
  48. printf('In numeric form : ');
  49. for (int j = 0; j < i; j ) {
  50. printf('%c', c[j]);
  51. }
  53. return 0;
  54. }

8_12

  1. #include <stdio.h>
  2. //頭文件ctpye中包含toupper（）函數(shù)
  3. #include <ctype.h>
  5. int main(void)
  6. {
  7. 	//建立整數(shù)型數(shù)組模擬每個字母所代表的面值
  8. 	const int a[26] = {1, 3, 3, 2, 1, 4, 2, 4, 1, 8, 5, 1, 3, 1, 1, 3, 10, 1, 1, 1, 1, 4, 4, 8, 4, 10};
  9. 	int sum = 0;
  10. 	char ch;
  12. 	printf('Enter a word: ');
  14. 	while ((ch = getchar()) != '\n') {
  15. 		if (toupper(ch) < 'A' || toupper(ch) > 'Z') {
  16. 			printf('Illegal input\n');
  17. 			break;
  18. 		} else {
  19. 			sum  = a[toupper(ch) - 'A'];
  20. 		}	
  21. 	}
  23. 	printf('Scrabble value: %d', sum);
  26. 	return 0;
  27. }

8_13

  1. #include <stdio.h>
  3. int main(void)
  4. {
  5. char a[20];
  6. char ch1, ch2;
  8. printf ('Enter a first and last name: ');
  9. scanf ('%c', &ch1);
  11. //循環(huán)輸入直到空格為止
  12. while ((getchar()) != ' ')
  13. ;
  15. int i = 0;
  16. while ((ch2 = getchar()) != '\n') {
  17. a[i] = ch2;
  18. i ;
  19. }
  21. printf('You enered the name: ');
  22. for (int j = 0; j < i; j ) {
  23. printf('%c', a[j]);
  24. }
  25. printf(', %c.', ch1);
  27. return 0;
  28. }

8_14

  1. #include <stdio.h>
  3. int main(void)
  4. {
  5. 	char sen[100];
  6. 	int i;
  8. 	printf('Enter a sentence: ');
  9. 	for (i = 0; i < 100; i  ) {                                     //建立字符數(shù)字sen并輸入句子
  10. 		sen[i] = getchar();
  11. 		if (sen[i] == '!' || sen[i] == '.' || sen[i] == '?') break; //遇到句末符號break跳出循環(huán)（i  并沒有執(zhí)行），此時i指向末尾的符號
  12. 	}
  14. 	int pri = i;								//記錄下句子的長度，以后用于輸出	
  15. 	char sen1[100];								//建立一個數(shù)組用于存改變順序后的句子 （一個一個單詞地復制）
  16. 	int j = 0;
  17. 	int over, start;						    //start為每次開始復制時的數(shù)組下標，over為復制結(jié)束時的
  18. 	for (i = i - 1; i >= 0; i--, j  ) {         //從i-1的位置往前找空格，i-1表示先不處理句末符號
  19. 		over = i;								//下次一個單詞的復制就從i（i此時已經(jīng)i-1）處結(jié)束
  20. 		while (sen[i] != ' ' && i > 0) i--;		//遇到空格或者i<=0時，停止尋找
  21. 		start = i   1;							//開始一個單詞的復制，下標應(yīng)該在空格后一個
  22. 		if (i == 0) start--;					//這個if只針對已經(jīng)復制到原句的第一個單詞的情況，start需要從零開始故減1
  23. 		for (; start <= over; start  , j  ) {
  24. 			sen1[j] = sen[start];				//復制單詞
  25. 		}
  26. 		sen1[j] = ' ';                          //每個單詞后加個空格
  27. 	}
  29. 	sen1[j - 1] = sen[pri];						//之后就是sen1數(shù)組的輸出了！
  30. 	printf('Reversal of sentence: ');
  31. 	for (int m = 0; m < pri   1; m  ) {
  32. 		printf('%c', sen1[m]);
  33. 	}
  35. 	return 0;
  36. }

8_15

  1. #include <stdio.h>
  3. int main(void)
  4. {
  5. //sen為原句子
  6. char sen[80], sen1[80];
  7. int n;
  9. //初始化數(shù)組
  10. int i;
  11. printf('Enter message to be encrypted: ');
  12. for (i = 0; ; i ) {
  13. sen[i] = getchar();
  14. if (sen[i] == '\n') break;
  15. }
  17. printf('Enter shift amout (1~25): ');
  18. scanf('%d', &n);
  20. printf('Encrypted message: ');
  21. for (int j = 0; j < i 1; j ) {
  22. if (sen[j] <= 'z' && sen[j] >= 'a') {
  23. printf('%c', ((sen[j] - 'a') n) % 26 'a');
  24. } else if (sen[j] <= 'Z' && sen[j] >= 'A') {
  25. printf('%c', ((sen[j] - 'A') n) % 26 'A');
  26. } else {
  27. printf('%c', sen[j]);
  28. }
  29. }
  31. return 0;
  32. }

8_16

  1. #include <ctype.h>
  2. #include <stdio.h>
  3. #include <stdbool.h>
  5. int main(void)
  6. {
  7.  	//定義一個整數(shù)數(shù)組用來記錄每個字母出現(xiàn)的次數(shù)。第一輸入單詞，
  8. 	//對應(yīng)數(shù)組元素加一，第二次輸入減一，若最后每個元素都為零則 為變?yōu)樵~
  9.  	int num[26] = {0};
  10.  	char word[20];
  12.  	int i;
  14.  	printf('Enter first word: ');
  15.  	for (i = 0; i < 20; i  ) {
  16.  		word[i]  = getchar();
  17.  		if (!isalpha(word[i]) && word[i] != '\n') {
  18.  			printf('Illegal input!');
  19. 			return 0;
  20. 		}
  21.  		if (word[i] == '\n') break;
  22.  		word[i] = tolower(word[i]);
  23.  		num[word[i] - 'a']  ;
  24. 	}
  26.  	printf('Enter second word: ');
  27.  	for (i = 0; i < 20; i  ) {
  28.  		word[i]  = getchar();
  29.  		if (!isalpha(word[i]) && word[i] != '\n') {
  30.  			printf('Illegal input!');
  31. 			return 0;
  32. 		}
  33.  		if (word[i] == '\n') break;
  34.  		word[i] = tolower(word[i]);
  35.  		num[word[i] - 'a']--;
  36. 	}
  38. 	bool flag = false;
  39. 	for (i = 0; i < 26; i  ) {
  40. 		if (num[i]) flag = true;
  41. 	}
  43.  	if (flag) printf('The words are not anagrams.');
  44.  	else printf('The words are anagrams.');
  46.  	return 0;
  47. }

8_17

  1. #include <stdio.h>
  3. int main(void)
  4. {
  5. printf('This is program creates a magic square of a specified size.\n');
  6. printf('The size must be an odd number between 1 and 99.\n');
  7. printf('Enter size of magic square: ');
  9. int size;
  10. scanf('%d', &size);
  12. int square[size][size];
  13. for (int i = 0; i < size; i ) {
  14. for (int j = 0; j < size; j ) {
  15. square[i][j] = 0;
  16. }
  17. }
  18. int i = 0, j = size / 2, num = 1;
  20. for (; ; ) {
  21. if (square[i][j] == 0) {
  22. square[i][j] = num;
  23. i = i size - 1; j ;
  24. i = i % size;
  25. j = j % size;
  26. } else {
  27. i ; i ; j = j size - 1;
  28. i = i % size;
  29. j = j % size;
  30. square[i][j] = num;
  31. i = i size - 1; j ;
  32. i = i % size;
  33. j = j % size;
  34. }
  35. num ;
  37. if (num > size * size) break;
  38. }
  40. for (i = 0; i < size; i ) {
  41. for (j = 0; j < size; j ) {
  42. printf('%3d', square[i][j]);
  43. }
  44. printf('\n');
  45. }
  47. return 0;
  48. }
文章最后發(fā)布于: 2018-07-18 
本站僅提供存儲服務(wù)，所有內(nèi)容均由用戶發(fā)布，如發(fā)現(xiàn)有害或侵權(quán)內(nèi)容，請點擊舉報。
打開APP，閱讀全文并永久保存 查看更多類似文章
猜你喜歡
類似文章
C語言練習題精選
c語言答案
經(jīng)典C語言編程100例/編程開發(fā)
經(jīng)典c程序
C語言課程訓練系統(tǒng)題-重慶郵電大學
有限狀態(tài)機詳解（轉(zhuǎn)載）
更多類似文章 >>
生活服務(wù)
分享 收藏 導長圖 關(guān)注 下載文章
綁定賬號成功
后續(xù)可登錄賬號暢享VIP特權(quán)！
如果VIP功能使用有故障，
可點擊這里聯(lián)系客服！

聯(lián)系客服