#include<stdio.h>

#include<math.h>

void fun_1()//绘制余弦直线

{

    double y;

    int m, x;

    for (y = ; y >= -; y -= 0.1)

    {

        m = acos(y)*;

        for (x = ; x < m; x++)printf(" ");

        printf("*");

        for (; x <  - m; x++)printf(" ");

        printf("*\n");

    }

    int x_1, y_1;

    x_1 = ;

    for (y_1 = ; y_1 <= ; y_1++)

        for(x_1=;x_1<=y_1;x_1++){

       if(x_1==y_1) {

            printf("*\n");

        }

       else {

           printf(" ");

       }

    }

}

void fun_2() {

    int i, max, min, sum=, num[] = {,,,};

    max = min = num[];

    printf("max%d\n", max);    printf("min%d\n", min);

    printf("score:\n");

    for (i = ; i < ; i++)

    printf("%d\n", num[i]);

    for (i = ; i < ; i++)

    {

        sum += num[i];

        if (max < num[i])

        {

            max = num[i];

        }

        if (min > num[i])min = num[i];

    }

    sum = sum - max - min;

    printf("avg%dmin%dmax%d", sum / ,min,max);

}

void fun_3() {

    int i;

    long j;//N的数值

    j = ;

    for (i = ; i > ; i--)

    {

        if (j%i == )

        {

            printf("factor:%d", i);

            break;

        }

    }

}

void fun_4() {

    int x, y,last=;

    x = ;

    for (y = ; y > ; y--)

    {

        last = last*x%;

    }

    printf("%d",last);

}

void fun_5()

{

    int a, count = ;

    for (a = ; a <= ; a = a + )

    {

        count++;

        if (!(a % ))count++;

    }

    printf("%d",count);

}

void fun_6()

{

    int a, b, c, count=;

    for (a = ; a <= ; a++)

        for (b = ; b <= ; b++)

            for (c = ; c <=  && a != b; c++)

                if (c != a&&c != b)count++;

    printf("%d",count);

}

void fun_7()

{

    int n = ,i,j;

    for (i = ; i < n; i++) {

        for (j = ; j < -i; j++)printf(" ");

        for (j = ; j < i + ; j++)printf("%6d", fun_7_f(i, j));

        printf("\n");

    }

}

int fun_7_f(int x,int y)//fun_7子函数进行递归

{

    int z;

    if (y ==  || y ==x + )return ;

    z = (x - , y - ) + (x - , y); return z;

}

void fun_8()

{

    int data[];

    int i = ;

    int x=;

    printf("%d\n", x);

    for (i = ;i<; i++)

    {

        data[i] = x % ;

        x = x / ;// printf("%d\n", x);

        //printf("%d\n", data[i]);

    }

    for (i = ; i > ; i--)

    {

        if (data[i] == )

            for (; i >= ; i--)printf("%d", data[i]);

    }

}

struct data {

    int year;

    int mouth;

    int day;

};

void fun_2_1()

{

    struct data trem;

    trem.year = ;

    trem.mouth = ;

    trem.day = ;

    int day_tab[][]={ {,,,,,,,,,,,},{ ,,,,,,,,,,, }    };

    int i, yearf, mouthf, dayf; yearf = mouthf = dayf = ;

    for (i = trem.year; i > ; i--)

    {

        if (i %  ==  && i %  != )

            dayf =dayf+;

        else dayf = dayf + ; printf("year+%d\n", dayf);

    }

    for (i = ; i <trem.mouth-; i++)

    {

        if (trem.year %  ==  && trem.year%  != )

            dayf = dayf + day_tab[][i];

        else dayf = dayf + day_tab[][i]; printf("mouthday+%d\n", dayf);

    }

    dayf = dayf + trem.day;

    printf("mouthday+%d\n", dayf);

    int f;

    f = dayf % ;

    printf("%d", f);

    switch (f)

    {

    case :;

    case :;

    case :printf("flash"); break;

    default:printf("sleep");

    }

}

void fun_2_2() {

    int i, j, k, l;

    for (i = ; i < ; i++) {

        for (j = ; j < ; j++)

        {

            if (i != j)

            {

                k = i *  + i *  + j *  + j;

                for (l = ; l*l < k; l++);

                if (l*l == k)printf("OK\t%d", k);

            }

        }

    }

}

int main()

{

    //fun_1();//绘制余弦直线

    //fun_2();//歌星大奖赛

    //fun_3();//求最大约数

    //fun_4();//高次方数的尾数

    //fun_5();//阶层尾数0个数

    //fun_6();//三个小朋友分五本书

    //fun_7();//杨辉三角

    //fun_8();//二进制转换

    //fun_2_1();//三天打鱼两天晒网

    //fun_2_2();//根据描述追踪车牌号

    fun_2_3();

    return ;

}