C Primer Plus （第6版）第九章 编程练习答案

1.

#include <stdio.h>
double min (double a,double b);
int main(void)
{
    double a,b;

    printf("plesase enter two numbers.\n");
    scanf("%lf%lf",&a,&b);
    printf(" Smaller values :%lf",min(a,b));

    return 0;
}
double min (double a,double b)
{
    return  (a<b)?a:b;
}

2.

#include <stdio.h>
void chline (char ch,int i,int j);
int main(void)
{
    int a,b;
    char ch;

    printf("plesase enter a character.\n");
    ch=getchar();
    printf("row and column.\n");
    scanf("%d%d",&a,&b);
    chline(ch,a,b);

    return 0;
}
void chline (char ch,int i,int j)
{
    int a,b;
    for (a=0;a<j;a++)
    {
        for (b=0;b<i;b++)
            putchar(ch);
        printf("\n");
    }
}

3.

同上

4.

#include <stdio.h>
double harmonic_mean (double a,double b);
int main(void)
{
    double a,b;

    printf("plesase enter two numbers.\n");
    scanf("%lf%lf",&a,&b);
    printf(" harmonic mean :%lf",harmonic_mean(a,b));

    return 0;
}
double harmonic_mean (double a,double b)
{
    return 2/(1/a+1/b);
}

5.

#include <stdio.h>
void large_of (double * a,double * b);
int main(void)
{
    double a,b;

    printf("plesase enter two numbers.\n");
    scanf("%lf%lf",&a,&b);
    large_of(&a,&b);
    printf(" %lf %lf",a,b);

    return 0;
}
void  large_of (double * a,double * b)
{
    *a=(*a>*b)?*a:*b;
    *b=*a;

6.

#include <stdio.h>
void order (double * a,double * b,double * c);
int main(void)
{
    double a,b,c;

    printf("plesase enter three numbers.\n");
    scanf("%lf%lf%lf",&a,&b,&c);
    order (&a,&b,&c);
    printf(" %lf %lf %lf",a,b,c);

    return 0;
}
void order (double * a,double * b,double * c)
{
    double n;
    
    if(*a>*b)
    {
        n=*a;
        *a=*b;
        *b=n;
    }
    if(*a>*c)
    {
        n=*a;
        *a=*c;
        *c=n;
    }
    if(*b>*c)
    {
        n=*b;
        *b=*c;
        *c=n;
    }
}

7.

#include <stdio.h>
void letter (char ch);
int main(void)
{
    char ch;

    printf("plesase enter .\n");
    while ((ch=getchar())!=EOF)
        letter(ch);
    
    return 0;
}
void letter (char ch)
{
    if (ch>='a'&&ch<='z')
        printf("%c is a letter and the position is %d \n",ch,ch-96);
    else if (ch>='A'&&ch<='Z')
        printf("%c is a letter and the position is %d \n",ch,ch-64);
    else
        printf("-1\n");
}

8.

#include <stdio.h>
double power (double n,int p);
int main(void)
{
    double n,n1;
    int p;
    scanf("%lf %d",&n,&p);
    printf("%lf \n", power(n,p));

    return 0;

}
double power (double n,int p)
{
    double pow=1;
    int i=1;

    while (n!=0)
    {
        if (p == 0)
            return 1;
        else if (p > 0)
        {
            for (i = 1; i <= p; i++)
                pow *= n;
            return pow;
        }
        else
        {
            for (i = 1; i <= -p; i++)
                pow *= 1 / n;
            return pow;
        }
    }
    if(p==0)
        printf("not define");
    else
        return 0;
}

9.

#include <stdio.h>
double power (double n,int p);
int main(void)
{
    double n,n1;
    int p;

    scanf("%lf %d",&n,&p);
    printf("%lf \n", power(n,p));

    return 0;

}
double power (double n,int p)
{
    double pow=1;

    while (n!=0)
    {
        if (p == 0)
            return 1;
        if (p > 0)
        {
            return n*power(n,p-1);
        }
        if (p < 0)
        {
            return 1/(n*power(n,-p-1));
        }
    }
    if  (p==0)
        printf("not define\n");
    else
        return 0;
}

10.

#include <stdio.h>
void n_base_n (unsigned long n,int p);
int main(void)
{
    unsigned long number;
    int p;

    scanf("%lu %d",&number,&p);
    n_base_n(number,p);

    return 0;
}
void n_base_n (unsigned long n,int p)
{
    int r;

    if (p>=2&&p<=10)
    {
        r = n % p;
        if (n >= p)
            n_base_n(n / p, p);
        printf("%d", r);
    }
    else
        printf("Make sure the value of  p is between 2 and 9");
}

11.

#include <stdio.h>
int Fibonacci (int n);
int main(void)
{
    int p;

    scanf("%d",&p);
    printf("%d\n",Fibonacci(p));

    return 0;
}
int Fibonacci (int n)
{
    int a, b, c, i;
    a=b=1;

    if (n == 1)
        return 1;
    if (n == 2)
        return 1;
    for(i=3;i<=n;i++)
    {
        c=a+b;
        a=b;
        b=c;
    }
    return c;
}