BadBoyHolly的博客

#include "user.h"//homeWork//P168//6.1void num_100(void){ int i=100, j=2; for (i = 100; i > 2; i--) { while (i % j != 0 && i > j) { j++; printf("%d\n", i); break; } j = 2; }}//6.2//选择法就是依次选择出第一大，第二大void sort_.

void exchange_Num(int *a,int *b){ int* p=*a; *a = *b; *b = *p;}//2.4(2)int sum_Num(int a[],int n){ int i; int sum; sum = 0; for (i = 0; i < n; i++) { sum = sum + a[i]; } return sum;}//2.4(3)int num_Squence(int a, int b, int c){ i.

//P82 Homeworks//3.1double GDP_acceletare(int year){ double gdp = 0; // double year_rate = 0.07; gdp = pow(1 + year_rate, year); return gdp;}//3.2double rate_Cal(double money, int year){ double rate; double sum; switch (year) { case 1:ra.

#include <stdio.h>#include <string.h>#include <math.h>#include <stdlib.h>void dem_fun(void){ float a, b, c; scanf_s("%f,%f,%f", &a, &b, &c); if (a > b) { swap_num(&a, &b); } if (a > c) { s.

//Homework//P141//5.3void max_min_Number(void){ unsigned int m, n; int i; unsigned int min, max,mul; scanf_s("%d%d", &m, &n); mul = m * n; for ( i= m; i > 0; i--) { if (m % i == 0 && n % i == 0) break; } max = i; pr.