实验六

typedef struct {
char isbn[20]; // isbn号
char name[80]; // 书名
char author[80]; // 作者
double sales_price; // 售价
int sales_count; // 销售册数
} Book;

void output(Book x[], int n);
void sort(Book x[], int n);
double sales_amount(Book x[], int n);

int main() {
Book x[N] = {{"978-7-5327-6082-4", "门将之死", "罗纳德.伦", 42, 51},
{"978-7-308-17047-5", "自由与爱之地:入以色列记", "云也退", 49 , 30},
{"978-7-5404-9344-8", "伦敦人", "克莱格泰勒", 68, 27},
{"978-7-5447-5246-6", "软件体的生命周期", "特德姜", 35, 90},
{"978-7-5722-5475-8", "芯片简史", "汪波", 74.9, 49},
{"978-7-5133-5750-0", "主机战争", "布莱克.J.哈里斯", 128, 42},
{"978-7-2011-4617-1", "世界尽头的咖啡馆", "约翰·史崔勒基", 22.5, 44},
{"978-7-5133-5109-6", "你好外星人", "英国未来出版集团", 118, 42},
{"978-7-1155-0509-5", "无穷的开始:世界进步的本源", "戴维·多伊奇", 37.5, 55},
{"978-7-229-14156-1", "源泉", "安.兰德", 84, 59}};

printf("图书销量排名(按销售册数): \n");
sort(x, N);
output(x, N);

printf("\n图书销售总额: %.2f\n", sales_amount(x, N));
system("pause");
return 0;
}

void output(Book x[], int n)
{
int i;
printf("%-20s%-25s%-20s%-8s%s\n ","ISBN号","书名","作者","售价","销售册数");

for(i=0;i<n;i++)
{
printf("%-20s%-25s%-20s%-8.1f%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;
for(i=0;i<n;++i)
{
for(j=0;j<n;++j)
{
if(x[j].sales_count<x[j+1].sales_count)
{
Book temp=x[j];
x[j]=x[j+1];
x[j+1]=temp;
}
}
}
}

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;
}`

任务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");
}
}

任务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].vip1)
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 @ 2026-06-15 18:03  种野菜  阅读(0)  评论(0)    收藏  举报