问吧 - 确实让创新更美好！

作业7.2

0

该帖来自用户反馈:)

更新时间：12/06/2018

厉鹏鹏的个人简介

0

万维网作业

更新时间：12/02/2018

为什么在平台上下载的课程资源打不开？

0

该帖来自用户反馈:)

更新时间：11/30/2018

要怎么样才能使用你们这个平台啊，平台提供了一些什么资源呢

0

该帖来自用户反馈:)

更新时间：11/30/2018

trusite平台与moodle平台有何区别？谢谢！

0

该帖来自用户反馈:)

更新时间：11/28/2018

怎么注销

0

该帖来自用户反馈:)

更新时间：11/27/2018

9.6

0

#include <stdio.h>

#define N 13

struct person

{

int number;

int nextp;

}link[N+1];

int main()

{

int i,count,h;

for(i=1;i<=N;i++)

{

if(i==N)

link[i].nextp=1;

else

link[i].nextp=i+1;

link[i].number=i;

}

printf("\n");

count=0;

h=N;

printf("sequence that persons leave the circle:\n");

while(count<N-1)

{

i=0;

while(i!=3)

{

h=link[h].nextp;

if(link[h].number)

i++;

}

printf("%4d",link[h].number);

link[h].number=0;

count++;

}

printf("\nThe last one is");

for(i=1;i<=N;i++)

if(link[i].number)

printf("%3d",link[i].number);

printf("\n");

return 0;

}

更新时间：11/26/2018

9.5

0

#include<stdio.h>

#define N 5

struct student

{char num[6];

char name[8];

float score[3];

float avr;

}stu[N];

int main()

{

int i,j,maxi;

float sum,max,average;

for(i=0;i<N;i++)

{
scanf("%s",stu[i].num);
scanf("%s",stu[i].name);

for(j=0;j<3;j++)

{scanf("%f",&stu[i].score[j]);}

}

average=0;

max=0;

maxi=0;

for(i=0;i<N;i++)

{

sum=0;

for(j=0;j<3;j++)

sum+=stu[i].score[j];

stu[i].avr=sum/3.0;

average+=stu[i].avr;

if(sum>max)

{

max=sum;

maxi=i;

}

}

average/=N;

printf("average=%5.2f\n",average);

printf("The highest score is: student %s,%s\n",stu[maxi].num,stu[maxi].name);

printf("his scores are: %.2f, %.2f, %.2f, average: %.2f.",stu[maxi].score[0],stu[maxi].score[1],stu[maxi].score[2],stu[maxi].avr);
return 0;

}

更新时间：11/26/2018

9.3 9.4

0

#include<stdio.h>
#define n 5
struct person{ int num; char name[30]; float score[3];};
int print(struct person stu[])
{ int i;printf ("No. name score1 score2 score3\n");
for(i=0;i<n;i++)
{ printf("%5d%10s%9.0f%9.0f%9.0f\n",stu[i].num,stu[i].name,stu[i].score[0],stu[i].score[1],stu[i].score[2]); }}int main(){ int print(struct person stu[]); struct person stud[n]; int i; for(i=0;i<n;i++) { scanf("%d %s %f %f %f",&stud[i].num,stud[i].name,&stud[i].score[0],&stud[i].score[1],&stud[i].score[2]); } print(stud); return 0;}

更新时间：11/26/2018

9.3

0

#include <stdio.h>

#include <malloc.h>

#define LEN sizeof(struct student)

struct student

{ char num[6];

char name[8];

char sex[2];

int age;

struct student *next;

} stu[10];

int main()

{ struct student *p,*pt,*head;

int i,length,iage,flag=1;

int find=0; //找到待删除元素 find=1,否则find=0

while (flag==1)

{

scanf("%d",&length);

if (length<10)

flag=0;

}

//建立链表

for (i=0;i<length;i++)

{p=(struct student *) malloc(LEN);

if (i==0)

head=pt=p;

else

pt->next=p;

pt=p;

scanf("%s",p->num);

scanf("%s",p->name);

scanf("%s",p->sex);

scanf("%d",&p->age);

}

p->next=NULL;

p=head;

printf("\nNO. name sex age\n"); //显示

while(p!=NULL)

{printf("%4s%8s%6s%6d\n",p->num,p->name,p->sex,p->age);

p=p->next;

}

scanf("%d",&iage);

pt=head;

p=pt;

if (pt->age==iage) //如果链头是待删元素

{p=pt->next;

head=pt=p;

find=1;

}

else

pt=pt->next;

while (pt!=NULL)

{if (pt->age==iage)

{p->next=pt->next;

find=1;

}

else // 中间结点不是待删元素

p=pt;

pt=pt->next;

}

if (!find)

printf(" not found %d.",iage);

p=head;

printf("NO. name sex age\n"); //显示结果

while (p!=NULL)

{printf("%4s%8s",p->num,p->name);

printf("%6s%6d\n",p->sex,p->age);

p=p->next;

}

return 0;

}

更新时间：11/23/2018

9.22

0

#include <stdio.h>

#include <malloc.h>

#define LEN sizeof(struct student)

struct student

{ char num[6];

char name[8];

char sex[2];

int age;

struct student *next;

} stu[10];

int main()

{ struct student *p,*pt,*head;

int i,length,iage,flag=1;

int find=0; //找到待删除元素 find=1,否则find=0

while (flag==1)

{

scanf("%d",&length);

if (length<10)

flag=0;

}

//建立链表

for (i=0;i<length;i++)

{p=(struct student *) malloc(LEN);

if (i==0)

head=pt=p;

else

pt->next=p;

pt=p;

scanf("%s",p->num);

scanf("%s",p->name);

scanf("%s",p->sex);

scanf("%d",&p->age);

}

p->next=NULL;

p=head;

printf("\nNO. name sex age\n"); //显示

while(p!=NULL)

{printf("%4s%8s%6s%6d\n",p->num,p->name,p->sex,p->age);

p=p->next;

}

scanf("%d",&iage);

pt=head;

p=pt;

if (pt->age==iage) //如果链头是待删元素

{p=pt->next;

head=pt=p;

find=1;

}

else

pt=pt->next;

while (pt!=NULL)

{if (pt->age==iage)

{p->next=pt->next;

find=1;

}

else // 中间结点不是待删元素

p=pt;

pt=pt->next;

}

if (!find)

printf(" not found %d.",iage);

p=head;

printf("NO. name sex age\n"); //显示结果

while (p!=NULL)

{printf("%4s%8s",p->num,p->name);

printf("%6s%6d\n",p->sex,p->age);

p=p->next;

}

return 0;

}

更新时间：11/23/2018

9.2

0

#include <stdio.h>

#include <malloc.h>

#define LEN sizeof(struct student)

struct student

{ char num[6];

char name[8];

char sex[2];

int age;

struct student *next;

} stu[10];

int main()

{ struct student *p,*pt,*head;

int i,length,iage,flag=1;

int find=0; //找到待删除元素 find=1,否则find=0

while (flag==1)

{

scanf("%d",&length);

if (length<10)

flag=0;

}

//建立链表

for (i=0;i<length;i++)

{p=(struct student *) malloc(LEN);

if (i==0)

head=pt=p;

else

pt->next=p;

pt=p;

scanf("%s",p->num);

scanf("%s",p->name);

scanf("%s",p->sex);

scanf("%d",&p->age);

}

p->next=NULL;

p=head;

printf("\nNO. name sex age\n"); //显示

while(p!=NULL)

{printf("%4s%8s%6s%6d\n",p->num,p->name,p->sex,p->age);

p=p->next;

}

scanf("%d",&iage);

pt=head;

p=pt;

if (pt->age==iage) //如果链头是待删元素

{p=pt->next;

head=pt=p;

find=1;

}

else

pt=pt->next;

while (pt!=NULL)

{if (pt->age==iage)

{p->next=pt->next;

find=1;

}

else // 中间结点不是待删元素

p=pt;

pt=pt->next;

}

if (!find)

printf(" not found %d.",iage);

p=head;

printf("NO. name sex age\n"); //显示结果

while (p!=NULL)

{printf("%4s%8s",p->num,p->name);

printf("%6s%6d\n",p->sex,p->age);

p=p->next;

}

return 0;

}

更新时间：11/23/2018

9.11

0

#include <stdio.h>

#include <malloc.h>

#define LEN sizeof(struct student)

struct student

{ char num[6];

char name[8];

char sex[2];

int age;

struct student *next;

} stu[10];

int main()

{ struct student *p,*pt,*head;

int i,length,iage,flag=1;

int find=0; //找到待删除元素 find=1,否则find=0

while (flag==1)

{

scanf("%d",&length);

if (length<10)

flag=0;

}

//建立链表

for (i=0;i<length;i++)

{p=(struct student *) malloc(LEN);

if (i==0)

head=pt=p;

else

pt->next=p;

pt=p;

scanf("%s",p->num);

scanf("%s",p->name);

scanf("%s",p->sex);

scanf("%d",&p->age);

}

p->next=NULL;

p=head;

printf("\nNO. name sex age\n"); //显示

while(p!=NULL)

{printf("%4s%8s%6s%6d\n",p->num,p->name,p->sex,p->age);

p=p->next;

}

scanf("%d",&iage);

pt=head;

p=pt;

if (pt->age==iage) //如果链头是待删元素

{p=pt->next;

head=pt=p;

find=1;

}

else

pt=pt->next;

while (pt!=NULL)

{if (pt->age==iage)

{p->next=pt->next;

find=1;

}

else // 中间结点不是待删元素

p=pt;

pt=pt->next;

}

if (!find)

printf(" not found %d.",iage);

p=head;

printf("NO. name sex age\n"); //显示结果

while (p!=NULL)

{printf("%4s%8s",p->num,p->name);

printf("%6s%6d\n",p->sex,p->age);

p=p->next;

}

return 0;

}

更新时间：11/23/2018

9.1

0

#include<stdio.h>

struct Date

{

int year;

int month;

int day;

};

int main()

{

struct Date p;

scanf("%d,%d,%d",&p.year,&p.month,&p.day);

int a[12]={31,28,31,30,31,30,31,31,30,31,30,31};

int sum,i;

sum=p.day;

for(i=0;i<p.month-1;i++)

sum+=a[i];

if(((p.year%4==0&&p.year%100!=0)||p.year%400==0)&&p.month>2)

printf("%d/%d is the %dth day in %d.",p.day,p.month,sum+1,p.year);

else

printf("%d/%d is the %dth day in %d.",p.day,p.month,sum,p.year);

}

更新时间：11/23/2018

求解

0

该帖来自用户反馈:)

更新时间：11/22/2018

nizuibang

0

#include<stdio.h>
int main()
{int prime(int);
int n;

scanf("%d",&n);
if(prime(n))
printf("1");
else
printf("0");
return 0;
}

int prime(int n)
{int flag=1,i;
for(i=2;i<n/2&&flag==1;i++)
if(n%i==0)
flag=0;
return(flag);
}

更新时间：11/17/2018

jiayou

0

#include<stdio.h>
#include<string.h>
char fanxu(b)
char b[100];
{
    int i,j,t;
    char c[100];strcpy(c,b);
    t=strlen(b);
    for(i=0,j=t-1;j>-1;i++,j--)
    b[i]=c[j];

}
main()
{
    char a[100],i;
    gets(a);
    fanxu(a);
    puts(a);
}

更新时间：11/17/2018

xie xie

0

该帖来自用户反馈:)

更新时间：11/15/2018

qiu jie

0

该帖来自用户反馈:)

更新时间：11/15/2018

答案系统

0

该帖来自用户反馈:)

更新时间：11/05/2018

推荐贴吧

网站建议吧

技术动态吧

教程共享吧