PTA期末补分作业

2021-2022(下）-NO.1

第一题

#include<stdio.h>
int main(){
    int a[10]={1,2,3,4,5,6,7,8,9,10};
     int s2, s=0,s1=0;
    for(int i=0;i<10;i++){
    	
        if(i%2==1){
                
            a[i]=(i+1)+2;
            s+=a[i];        
        }else if (i%2==0){
               
            a[i]=(i+1)*2;
            s1+=a[i];
        }
      
    }
      s2=s+s1;
        printf("%d",s2);
}

第二题

#include <stdio.h>

int main()

{

    int i,sum=0;

    int max,min,num[10];

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

        scanf("%d",&num[i]);
        
        sum = sum + num[i];

    }

    max=min=num[0];

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

        if(max<num[i])

            max=num[i];

        else if(min>num[i])

            min=num[i];

    }

    sum = sum - min - max;
    
    printf("%d",sum);
 
    return 0;

} 

2021-2022（下）收官之战

第一题

void WriteArticle(FILE *f)
{
    char ch;
    while((ch=getchar())!=EOF)
        fputc(ch,f);
}

第二题

void ReadArticle(FILE *f)
{
	char ch;
	while ((ch=fgetc(f))!=EOF)
		printf("%c",ch);
}

第三题

int fun(struct stu *p, int n,char *sname)
{
    int i;
    for (i - 0; i < n; i++)
    {
        if (strcmp(p[i].name, sname) == 0)
            return p[i].score;
    }
    return -1;
}

第四题

int fun(char *s)
{
	int i,count = 0;
	for(i=0;s[i]!='\0';i++)
	{
		if(s[i]!=' '&&(s[i+1]==' '||s[i+1]=='\0'))
			count++;
	}
	return count;
}

NO.4字符串

函数题

int max_len( char *s[], int n )
{
    int count0=0,count1=0;
    char *p;
    for(int i=0;i<n;i++)
    {
        p=s[i];
        while(*p!=NULL)
        {
            count1++; 
            p++;
        }
        if(count1>count0)
        {
            count0=count1;
        }
        count1=0;
    }
    return count0;
}

编程题

#include<stdio.h>
int main()
{ 
    char s[22],s1[12],s2[12];
    int i,j,n,n1;
    gets(s);
    for(n=0;s[n];n++);
        n1=n/2;
    for(i=0;i<n1;i++)
        s1[i]=s[i];
    s1[i]='\0';
    for(j=0;s2[j++]=s[i++];);
        puts(s2);
return 0;
}

NO.5结构

函数题

void calc(struct student *p,int n)
{
    for(int i=0; i<n; i++)
    {
        p[i].sum = p[i].score[0] + p[i].score[1] + p[i].score[2];
    }
}

void sort(struct student *p,int n)
{
    struct student a;

    for(int i=0; i<n; i++)
    {
        for(int j = i; j<n; j++)
        {
            if(p[i].sum < p[j].sum)
            {
                a = p[i];
                p[i] = p[j];
                p[j] = a;
            }
        }
    }
}