东北师范大学2022年真题

22-01

#include <stdio.h>
#include <stdlib.h>

int main()
{
    int i;
    double sum=0,h=10;
    for(i=1;i<=5;i++)
    {
        sum += h;
        h *= 2.0/3;
        sum += h;
    }
    printf("%.2lf %.2lf\n",sum,h);
    return 0;
}

22-02

#include <stdio.h>
#include <stdlib.h>

int main()
{
	int a[10][10],i,j;
	for(i=0;i<10;i++)
	{
		a[i][0]=1;
		a[i][i]=1;
	 } 
	 for(i=2;i<10;i++)
	{
		for(j=1;j<i;j++)
		{
			a[i][j]=a[i-1][j-1] + a[i-1][j];
		}
	 } 
	 for(i=0;i<10;i++)
	{
		for(j=0;j<=i;j++)
		{
			printf("%6d",a[i][j]);
		}
		printf("\n");
	 } 
	 return (0);
 } 

22-03

#include <stdio.h>
#include <stdlib.h>
#include <math.h>
int main()
{
	FILE *fp; 
	if((fp = fopen("D:\\result.txt","w"))==NULL)
	{
		printf("can't open file!\n");
		exit(0);
	}
	int i,j,flag,n=0;
	for(i=10;i<=500;i++)
	{
		flag = 1;
		for(j=2;j<=sqrt(i);j++)
		{
			if(i%j == 0)
			{
				flag = 0;
				break;
			}
		}
		if(flag)
		{
			n++;
			if(n%10)
				fprintf(fp,"%d ",i);
			else
				fprintf(fp,"%d\n",i);	
		}	
	}
	fclose(fp);
	return 0;
	
}

22-04-01

#include <stdio.h>
#include <stdlib.h>
#include <math.h>

int main()
{
	srand((unsigned int)time(NULL));
	int i,a[20];
	for(i=0;i<20;i++)
	{
		a[i] = rand()%51+50;
		printf("%d ",a[i]);
	}
	return 0;
}

22-04-02

#include <stdio.h>
#include <stdlib.h> 
//#include <math.h>
int main()
{
	srand((unsigned int)time(NULL));
	int i,k=0,a[20],n[20],x,sum=0;
	scanf("%d",&x);
	for(i=0;i<20;i++)
	{
		a[i] = rand()%51+50;
		if(x==a[i])
			sum++;
		else
		{
			n[k++]=a[i];
		}
	}
	if(sum)
	{
		for(i=0;i<sum;i++)	
		{
			n[k++]=x;
		}
		for(i=0;i<20;i++)
		{
			a[i]=n[i];
			printf("%d ",a[i]);
		}
	}
	else
	{
		printf("Not found!");
	}
	return 0;
}

22-05

#include <stdio.h>
#include <stdlib.h>

struct student
{
	int no; //学号 
	char name[20];
	float score;
	struct student *next;
};
//默认链表带头结点 
struct student *delete(struct student *head,int num) 
{
	struct student *p,*q;
	p=head;
	q=head->next;
	while((q->next!= NULL)
	{
		if(q->no == mun)
		{
			p->next = q->next;
			q=q->next	
		}
		else
		{
			p=q;
			q = q->next;
		}
	}
	return head;
}
int main()
{
	
	return 0;
}