山科大c语言编程

1.数列反向 1 2 3编程3 2 1/* Reverses a series of numbers */#include <stdio.h>#define N 10int main(void){int a[N], i;printf("Enter %d numbers: ", N);for (i = 0; i < N; i++)scanf("%d", &a[i]);printf("In reverse order:");for (i = N - 1; i >= 0; i--)printf(" %d", a[i]);printf("\n");return 0;}1.检查数中重复出现的数字/* Checks numbers for repeated digits */ #include <stdbool.h> /* C99only */#include <stdio.h>int main(void){bool digit_seen[10] = {false};int digit;long n;printf("Enter a number: ");scanf("%ld", &n);while (n > 0) {digit = n % 10;if (digit_seen[digit])break;digit_seen[digit] = true;n /= 10;}if (n > 0)printf("Repeated digit\n");elseprintf("No repeated digit\n");return 0;}2.计算利息/* Prints a table of compound interest */ #include <stdio.h>#define NUM_RATES ((int) (sizeof(value) / sizeof(value[0]))) #define INITIAL_BALANCE 100.00int main(void){int i, low_rate, num_years, year;double value[5];printf("Enter interest rate: ");scanf("%d", &low_rate);printf("Enter number of years: ");scanf("%d", &num_years);printf("\nYears");for (i = 0; i < NUM_RATES; i++) {printf("%6d%%", low_rate + i);value[i] = INITIAL_BALANCE;}printf("\n");for (year = 1; year <= num_years; year++) {printf("%3d ", year);for (i = 0; i < NUM_RATES; i++) {value[i] += (low_rate + i) / 100.0 * value[i];printf("%7.2f", value[i]);}printf("\n");}return 0;}4.发牌/* Deals a random hand of cards */#include <stdbool.h> /* C99 only */#include <stdio.h>#include <stdlib.h>#include <time.h>#define NUM_SUITS 4#define NUM_RANKS 13int main(void){bool in_hand[NUM_SUITS][NUM_RANKS] = {false};int num_cards, rank, suit;const char rank_code[] = {'2','3','4','5','6','7','8', '9','t','j','q','k','a'}; const char suit_code[] = {'c','d','h','s'};srand((unsigned) time(NULL));printf("Enter number of cards in hand: ");scanf("%d", &num_cards);printf("Your hand:");while (num_cards > 0) {suit = rand() % NUM_SUITS; /* picks a random suit */rank = rand() % NUM_RANKS; /* picks a random rank */ if (!in_hand[suit][rank]) {in_hand[suit][rank] = true;num_cards--;printf(" %c%c", rank_code[rank], suit_code[suit]);}}printf("\n");return 0;}5冒泡排序void main() {int a[10],k,j,t;printf("输入10个整数：\n");for( k = 0; k < 10; k ++ )scanf("%d",&a[ k ]); //依次输入10个整数for( j = 0; j < 9; j ++ ) //进行9轮排序即n－1次{for( k = 0; k < 9-j; k ++) //每轮进行n－1－j 次比较if( a[ k ] > a[ k + 1 ] ){t=a[k]; a[k]=a[k+1]; a[k+1]=t;} //小的沉底，大的上浮}printf("排序结果:");for( k = 0; k < 10; k ++ ) //依次输出排序结果printf("%d\t",a[ k ]);printf("\n");}6.判定素数/* Tests whether a number is prime */#include <stdbool.h> /* C99 only */#include <stdio.h>bool is_prime(int n){int divisor;if (n <= 1)return false;for (divisor = 2; divisor * divisor <= n; divisor++)if (n % divisor == 0)return false;return true;}int main(void){int n;printf("Enter a number: ");scanf("%d", &n);if (is_prime(n))printf("Prime\n");elseprintf("Not prime\n");return 0;}7.汉诺塔问题void move(char getone, char putone) /*打印移动信息*/ { printf("%c--->%c\n",getone,putone); }void hanoi(int n,char one,char two,char three) /*递归函数*/ { if(n==1) move(one,three);else{ hanoi(n-1,one,three,two);move(one,three);hanoi(n-1,two,one,three); }}main(){ int m;printf("Input the number of disks:");scanf("%d",&m);printf("The steps to moving %3d disks:\n",m);hanoi(m,'A','B','C'); }8.猜数游戏自动产生一个1-100之间的随机数，提示用户尝试用尽可能少的次数猜出这个数/* Asks user to guess a hidden number */#include <stdio.h>#include <stdlib.h>#include <time.h>#define MAX_NUMBER 100/* prototypes */void initialize_number_generator(void);int new_secret_number(void);void read_guesses(int secret_number);int main(void){char command;int secret_number;printf("Guess the secret number between 1 and %d.\n\n",MAX_NUMBER);initialize_number_generator();do {secret_number = new_secret_number();printf("A new number has been chosen.\n");read_guesses(secret_number);printf("Play again? (Y/N) ");scanf(" %c", &command);printf("\n");} while (command == 'y' || command == 'Y');return 0;}9.找出数组中最大和最小元素/* Finds the largest and smallest elements in an array */ #include <stdio.h>#define N 10void max_min(int a[], int n, int *max, int *min);int main(void){int b[N], i, big, small;printf("Enter %d numbers: ", N);for (i = 0; i < N; i++)scanf("%d", &b[i]);max_min(b, N, &big, &small);printf("Largest: %d\n", big);printf("Smallest: %d\n", small);return 0;}void max_min(int a[], int n, int *max, int *min){int i;*max = *min = a[0];for (i = 1; i < n; i++) {if (a[i] > *max)*max = a[i];else if (a[i] < *min)*min = a[i];}}第八章的程序reverse.c实现了读入10个数，然后对其进行逆序输出第1题的升级版/* Reverses a series of numbers (pointer version) */#include <stdio.h>#define N 10int main(void){int a[N], *p;printf("Enter %d numbers: ", N);for (p = a; p < a + N; p++)scanf("%d", p);printf("In reverse order:");for (p = a + N - 1; p >= a; p--)printf(" %d", *p);printf("\n");return 0;}第16组例：对候选人得票的统计程序。