摘要： #include void findByPoint(int *, int, int *, int *);void find(int *a, int n, int max, int min);int main(void){ int max1=0, min1=0, a[]={5,3,7,9,2,0,4,1,6,8}; findByPoint(a,10,&max1,&min1); printf("Êý×éa×î´óºÍ×îÐ¡Ô 阅读全文

摘要： /*输出m～n之间的所有水仙花数*/#include int is(int number) //调用函数{ int a, b, c; a = number/100; b = number/10%10; c = number%10;//判断是否为水仙花数 if(number == a*a*a+b*b*b+c*c*c) return 1; return 0;}int main (){ int m, n, t, i; scanf("%d%d", &m, &n); if(m > n){ t = m; m = n; n = t; } for(i=m; iint 阅读全文

摘要： //九九乘法表#includeint main(void){ int i,j; int a[10][10]; //定义数组 for(i=1;i#define MAX_N 100 int main(void) { int n; int i; float Mark[MAX_N]; ... 阅读全文