Question

C语言 求解？

两道题 大神在哪里？？做得好我可以加分





Answer 1

题目1代码：

#include <stdio.h>
void main()
{
    int i,j, n;
    printf("请输入行数:");
    scanf("%d", &n);
    for(i=0;i<n;i++)
    {
        for(j=0;j<n-i-1;j++)
            printf(" ");
        if (i==0)
            printf("*");
        else
        {
            printf("*");
            for(j=0;j<2*i-1;j++)
                printf(" ");
            printf("*");
        }
        for(j=0;j<n-i-1;j++)
            printf(" ");
        for(j=0;j<n-i-2;j++)
            printf(" ");
        if (i==0)
            printf("*");
        else
        {
            if (i!=n-1)
                printf("*");
            for(j=0;j<2*i-1;j++)
                printf(" ");
            printf("*");
        }
        printf("\n");
    }
}

题目1输出结果：

题目2代码：

#include <stdio.h>
int removerepeat(int n, int a[])
{
    int i, j, k;
    for (i = 0; i < n; i++)
    {
        for(j=0;j < i;j++)
        {
            if (a[i] == a[j])
            {
                for (k=i+1;k<n;k++)
                    a[k-1]=a[k];
                n--;
                i--;
                break;
            }
        }
    }
    return n;
}
int removemax(int n, int a[])
{
    int i, max;
    max = 0;
    for(i=1;i<n;i++)
    {
        if(a[i] > a[max])
            max=i;
    }
    for(i = max+1;i<n;i++)
        a[i-1]=a[i];
    return n-1;
}
int findmedium(int n, int a[])
{
    int i,j,count;
    for (i = 0; i < n;i++)
    {
        count = 0;
        for (j = 0; j < n;j++)
        {
            if (i!=j)
            {
                if (a[i] > a[j])
                    count++;
            }
        }
        if (count==n/2)
            break;
    }
    return i;
}
void main()
{
    int i, n, a[20];
    scanf("%d", &n);
    for(i = 0; i < n; i++)
        scanf("%d", &a[i]);
    n = removerepeat(n, a);
    printf("After remove the repeat number:");
    for(i=0;i<n;i++)
        printf(" %d", a[i]);
    printf("\n");
    if (n%2==0)
    {
        n= removemax(n, a);
        printf("After remove the maximum:");
        for(i=0;i<n;i++)
            printf(" %d", a[i]);
        printf("\n");
    }
    i = findmedium(n,a);
    printf("The median: a[%d]=%d", i, a[i]);
}

题目2输出结果：

Answer 2