数据结构与算法（C语言） 第8章 习题答案.docx

习题答案1.编程题(1)1 int prime(int v)2 int i;3 for (i = 2; i <= v-1; i+) 4 if(v%i != 0)5 continue;6 )7 else8 return 0; /如果不是质数，返回09 )10 )11 return 1;/如果为质数，返回112 )(2)计算最大公约数1 int gys(int x, int y)2 return y ? gys(y, x%y):x;3 计算最小公倍数4 int gbs (int x, int y) 5 return x/gys (x, y) *y; /gys ()函数见(1)小题6 (3)1 /计算一个数的幕次方2 static int power(int v, int n)/计算v的n次方的值/获得二进制数的最低位的数字0或1/去除二进制数的最低位/计算得出十进制数3 int i = 0, count = 1;4 for (i = 0; i < n; i + + ) 5 count = v*count;6 )7 return count;8 )9 /二进制数转换为八进制数10 void TwoToEight () 11 long long n,a;12 int sum =0, i = 0, m;13 int c, j = 0;1415 int aN;1617 printf ("输入一个二进制数：n);18 scant(H%lldn, &n);19 a = n;20 while (n != 0)21 m = n % 10;22 n /= 10;23 sum += m*power(2f i);24 +i;25 )26while (sum > 0)c = (sum % 8);a j = c;sum = sum / 8; j+；)for (j ; j >= 0; j ) /将数组倒序输出printf("d“， ai);)printf(”n”);)/二进制数转换为十六进制数void TwoToSixteen () long long n,a;int sum =0, i = 0z m;/arr数组保存十六进制的所有个位数字char arr = n0123456789ABCDEFn;char hex 16;int i = 0,j = 0,a = 0;printf ("输入一个二进制数：n);scanf(n%lldnA &n);a = n;while (n != 0)m = n % 10;/获得二进制数的最低位的数字。或1n /= 10;/去除二进制数的最低位sum += m*power (2, i) ;/计算得出二进制数+i； )while(sum) hexi+ = arrsum % 16; sum = sum / 16;)for (j=i-l;j>=0; -j ) /将数组倒序输出printf(”c”， hexj);)printf(Hnn);27282930313233343536373839404142434445464748495051525354555657585960616263646566