kobe824

导航

实验6

任务4

void output(Book x[], int n){
	int i;
	
	printf("%-22s%-32s%-22s%s\t%s\n", "ISBN号", "书名", "作者", "售价", "销量");
	for(i=0;i<n;i++)
		 printf("%-22s%-32s%-22s%.6f\t%d\n",x[i].isbn,x[i].name,x[i].author,x[i].sales_price,x[i].sales_count);
}


void sort(Book x[], int n){
	int i,j;
	Book t;

	for(i=0;i<n-1;i++){
		for(j=0;j<n-1-i;j++){
			if(x[j].sales_count<x[j+1].sales_count){
				t=x[j];
				x[j]=x[j+1];
				x[j+1]=t;
			}
		}
	}
}


double sales_amount(Book x[], int n)
{	int i;
    double sum = 0.0;
    for(i = 0; i < n; i++)
    {
        sum += x[i].sales_price * x[i].sales_count;
    }
    return sum;
}

{0BB68776-64B7-429B-B76E-842E9E5BD9DF}

任务5

void input(Date *pd) {
    scanf("%d-%d-%d",&pd->year,&pd->month,&pd->day);
}

int day_of_year(Date d) {
    int days[12] = {31,28,31,30,31,30,31,31,30,31,30,31};
    int sum = 0,i=0;
    for(i = 0; i <d.month-1; i++)
    {
        sum += days[i];
    }
    sum += d.day;
    if ((d.year %4 == 0&&d.year %100!= 0)||(d.year % 400 == 0))
    {
        if (d.month > 2)
        sum += 1;
	}
    return sum;
}



int compare_dates(Date d1, Date d2) {
    if(d1.year != d2.year)
    {	if(d1.year < d2.year) 
			return -1;
        else 
			return 1;
    }
    if(d1.month != d2.month)
    {	if(d1.month < d2.month) 
			return -1;
        else 
			return 1;
    }
    if(d1.day != d2.day)
    {	if(d1.day < d2.day) 
			return -1;
        else 
			return 1;
    }
    return 0; 

}

{C7F8C9E7-A275-45B8-BEE8-7E505A56F0C4}

任务6

void output(Account x[], int n) {
    int i,j; 
	
	for(i=0;i<n;i++){
    printf("%-10s ", x[i].username);
    
    for(j = 0; j <strlen(x[i].password); j++)
        printf("*");
     printf("\t");

       
    if(x[i].type == admin)
        printf("admin\n");
    else if(x[i].type == student)
        printf("student\n");
    else
        printf("teacher\n");
	}
}

{31F43341-7159-4DB4-97C7-1F8121AAE243}

任务7

void set_vip_contact(Contact x[], int n, char name[]) {
    int i;
	for(i=0;i<n;i++)
	{
		if(strcmp(x[i].name,name)==0)
		{
			x[i].vip=1;
			break;
		}
	}
}
   

void display(Contact x[], int n) {
    Contact a[N];
	Contact t;
	int i,j=0;
	int k,m,vip_cnt=0;
	for(i=0;i<n;i++)
	{
		if(x[i].vip==1)
			a[j++]=x[i];
			vip_cnt+=1;
	}
	for(i=0;i<n;i++)
	{
		if(x[i].vip==0)
			a[j++]=x[i];
	}
	for(k=vip_cnt;k<n-1;k++)
		for(m=0;m<n-1-k;m++){
			if(strcmp(a[m].name,a[m+1].name)>0)
			{
				t=a[m];
				a[m]=a[m+1];
				a[m+1]=t;
			}
		}
	output(a,n);
}

{40EA9BD9-7CC7-4293-A966-B492504269B4}

posted on 2026-06-10 15:04  kobebrant24  阅读(2)  评论(0)    收藏  举报