求一个120行左右的C语言程序
\u6c42\u4e00\u4e2a300\u884c\u5de6\u53f3\u7684\u7b80\u5355\u7684c\u8bed\u8a00\u7a0b\u5e8f#include
#include
#include
#define LEN sizeof(struct record) /*\u5bf9\u7ed3\u6784\u4f53\u957f\u5ea6\u8fdb\u884c\u5b8f\u5b9a\u4e49*/
void menu();/*\u58f0\u660e\u83dc\u5355\u51fd\u6570*/
struct record*insert(struct record *head);/*\u58f0\u660e\u6dfb\u52a0\u51fd\u6570 */
struct record*delet(struct record *head); /*\u58f0\u660e\u5220\u9664\u51fd\u6570 */
struct record*alter(struct record *head); /*\u58f0\u660e\u4fee\u6539\u51fd\u6570 */
void search(struct record *head); /*\u58f0\u660e\u67e5\u627e\u51fd\u6570*/
void show(struct record *head); /*\u58f0\u660e\u663e\u793a\u51fd\u6570*/
struct record *head; /*\u5b9a\u4e49\u5168\u5c40\u7ed3\u6784\u4f53\u6307\u9488\u53d8\u91cf*/
int n=0; /*\u5b9a\u4e49\u5168\u5c40\u53d8\u91cf*/
struct record /*\u58f0\u660e\u7ed3\u6784\u4f53*/
{
char number[10];
char name[20];
char phone[20];
char adress[40];
char postcode[10];
char e_mail[30];
struct record *next;
};
/******************************************************************************
* *
* \u4e3b\u51fd\u6570 *
* *
*******************************************************************************/
main()
{
head=NULL;
menu();
rewind(stdin);
}
/******************************************************************************
* *
* \u83dc\u5355\u51fd\u6570 *
* *
*******************************************************************************/
void menu()
{
int choice;
printf("\n\t\t******************** \u4e3b\u83dc\u5355 ********************");
printf("\n\t\t*********** 1-\u6dfb\u52a0\u7eaa\u5f55 2-\u67e5\u8be2\u7eaa\u5f55 ************");
printf("\n\t\t*********** 3-\u5220\u9664\u7eaa\u5f55 4-\u4fee\u6539\u8bb0\u5f55 ************");
printf("\n\t\t*********** 5-\u663e\u793a\u7eaa\u5f55 6-\u9000\u51fa\u7cfb\u7edf ************");
printf("\n\t\t************************************************");
printf("\n\t\t\u8bf7\u9009\u62e9\uff1a");
scanf("%d",&choice); rewind(stdin);
printf("\n");
switch (choice)
{
case 1:
head=insert(head);
rewind(stdin);
menu();
break;
case 2:
search(head);rewind(stdin);
menu();
break;
case 3:
head=delet(head);
rewind(stdin);
menu();
break;
case 4:
head=alter(head);
rewind(stdin);
menu();
break;
case 5:
show(head);
rewind(stdin);
menu();
break;
default:
printf("\n\t\t\u8c22\u8c22\u4f7f\u7528!!");
break;
}
}
/******************************************************************************
* *
* \u6dfb\u52a0\u51fd\u6570 *
* *
*******************************************************************************/
struct record *insert(struct record *head)
{
struct record *pp,*p1,*p2;
pp=(struct record *)malloc(LEN);
printf("\n\t\t**************** \u8bf7\u8f93\u5165\u7528\u6237\u4fe1\u606f ****************\n");
printf("\n\t\t\u8f93\u5165\u5e8f\u53f7:");
scanf("%s",pp->number); rewind(stdin);
printf("\n\t\t\u8f93\u5165\u59d3\u540d:");
scanf("%s",pp->name);rewind(stdin);
printf("\n\t\t\u8f93\u5165\u7535\u8bdd\u53f7\u7801:");
scanf("%s",pp->phone); rewind(stdin);
printf("\n\t\t\u8f93\u5165\u5730\u5740:");
scanf("%s",pp->adress); rewind(stdin);
printf("\n\t\t\u8f93\u5165\u90ae\u7f16:");
scanf("%s",pp->postcode); rewind(stdin);
printf("\n\t\t\u8f93\u5165e-mail:");
scanf("%s",pp->e_mail); rewind(stdin);
if(head==NULL)/*\u5728\u8868\u5934\u63d2\u51651*/
{
head=pp;
pp->next=NULL;
}
else
{
p1=head;
while((strcmp(pp->number,p1->number)>0)&&(p1->next!=NULL))
{
p2=p1;
p1=p1->next;
}
if(strcmp(pp->number,p1->number)<=0)
{
if(head==p1)
head=pp; /*\u5728\u8868\u5934\u63d2\u51652*/
else
p2->next=pp;/*\u5728\u8868\u4e2d\u63d2\u5165*/
pp->next=p1;
}
else /*\u5728\u8868\u5c3e\u63d2\u5165*/
{
p1->next=pp;
pp->next=NULL;
}
}
printf("\t\u6dfb\u52a0\u6210\u529f!\u8bf7\u7ee7\u7eed\u9009\u62e9\u529f\u80fd\u952e!\n\n");
n=n+1;
return(head);
}
/******************************************************************************
* *
* \u5220\u9664\u51fd\u6570 *
* *
*******************************************************************************/
struct record*delet(struct record * head)
{
struct record *p1,*p2;
char number[10];
printf("\t\u8bf7\u8f93\u5165\u8981\u5220\u9664\u7528\u6237\u7684\u5e8f\u53f7number:");
scanf("%s",&number);rewind(stdin);
if(head==NULL)
{
printf("\n\t\u901a\u8baf\u5f55\u65e0\u7528\u6237\u4fe1\u606f\u8bb0\u5f55!!\n");
return(head);
}
p1=head;
while(strcmp(number,p1->number)!=0&&p1->next!=NULL)
{
p2=p1;
p1=p1->next;
}
if(strcmp(number,p1->number)==0)
{
if(p1==head)
{
head=p1->next;
printf("\t\u5220\u9664\u6210\u529f!\u8bf7\u7ee7\u7eed\u9009\u62e9\u529f\u80fd\u952e!\n\n");
}
else
{
p2=p1->next;
printf("\t\u5df2\u5220 \u9664\u7684\u7528\u6237\u7684\u5e8f\u53f7\u4e3a:%s\n",number);
printf("\t\u5220\u9664\u6210\u529f!\u8bf7\u7ee7\u7eed\u9009\u62e9\u529f\u80fd\u952e!\n\n");
}
n=n-1;
}
else printf("\t\u901a\u8baf\u5f55\u65e0\u8be5\u7528\u6237\u7684\u4fe1\u606f\u8bb0\u5f55!\n ");
return(head);
}
/******************************************************************************
* *
* \u67e5\u8be2\u51fd\u6570 *
* *
*******************************************************************************/
void search(struct record *head)
{
int a;
char f_name[20],f_number[10];
struct record *p1,*p2;
if(head==NULL)
{
printf("\t\u901a\u8baf\u5f55\u65e0\u7528\u6237\u4fe1\u606f\u8bb0\u5f55\n");
return;
}
else
{
printf("\t\u8bf7\u4f60\u9009\u62e9\u4f60\u67e5\u627e\u7684\u65b9\u5f0f:\n\n\t\t1:\u5e8f\u53f7\n\t\t2:\u59d3\u540d\n");
printf("\t\t\u8bf7\u9009\u62e9:");
scanf("%d",&a);rewind(stdin);
switch(a)
{case 1:
printf("\n\t\u8bf7\u8f93\u5165\u8981\u67e5\u627e\u7528\u6237\u7684\u5e8f\u53f7number:");
scanf("%s",&f_number);rewind(stdin);
p1=head;
while(strcmp(p1->number,f_number)!=0)
{
if(p1->next==NULL)
{
printf("\n\t\u901a\u8baf\u5f55\u65e0\u6b64\u7528\u6237\u4fe1\u606f\u8bb0\u5f55\n");
return;
}
else
{
p2=p1->next;
p1=p2;
}
}
printf("\n\t\u8981\u67e5\u627e\u7528\u6237\u7684\u57fa\u672c\u4fe1\u606f\u4e3a:\n");
printf("\t\t\u5e8f\u53f7: %s\n\t\t\u59d3\u540d:%s\n\t\t\u7535\u8bdd\u53f7\u7801:%s",p1->number,p1->name,p1->phone);
printf("\n\t\t\u5730\u5740:%s\n\t\t\u90ae\u7f16:%s\n\t\te_mail:%s\n",p1->adress,p1->postcode,p1->e_mail);
break;
case 2:
printf("\n\t\u8bf7\u8f93\u5165\u8981\u67e5\u627e\u7528\u6237\u7684\u59d3\u540dname:");
scanf("%s",f_name);rewind(stdin);
p1=head;
while(strcmp(p1->name,f_name)!=0)
{
if(p1->next==NULL)
{
printf("\n\t\u901a\u8baf\u5f55\u65e0\u6b64\u7528\u6237\u4fe1\u606f\u8bb0\u5f55\n");
return;
}
else
{
p2=p1->next;
p1=p2;
}
}
printf("\n\t\u8981\u67e5\u627e\u7528\u6237\u7684\u57fa\u672c\u4fe1\u606f\u4e3a:\n");
printf("\t\t\u5e8f\u53f7: %s\n\t\t\u59d3\u540d:%s\n\t\t\u7535\u8bdd\u53f7\u7801:%s",p1->number,p1->name,p1->phone);
printf("\n\t\t\u5730\u5740:%s\n\t\t\u90ae\u7f16:%s\n\t\te_mail:%s",p1->adress,p1->postcode,p1->e_mail);
break;
}
}
}
/******************************************************************************
* *
* \u663e\u793a\u51fd\u6570 *
* *
*******************************************************************************/
void show(struct record *head)
{
int i;
struct record *p1,*p2;
p1=head;
if(head==NULL)
{
printf("\t\u901a\u8baf\u5f55\u65e0\u7528\u6237\u4fe1\u606f\u8bb0\u5f55\n");
return;
}
else
{
for(i=1;i<=n;i++)
{
printf("\n\t\u7b2c%d\u4e2a\u7528\u6237\u7684\u57fa\u672c\u4fe1\u606f\u4e3a:",i);
printf("\n\t\t\u5e8f\u53f7: %s \u59d3\u540d:%s \u7535\u8bdd\u53f7\u7801:%s \n\t\t\u5730\u5740:%s \u90ae\u7f16:%s e_mail:%s\n"
,p1->number,p1->name,p1->phone,p1->adress,p1->postcode,p1->e_mail);
p2=p1->next;
p1=p2;
}
}
}
/******************************************************************************
* *
* \u4fee\u6539\u51fd\u6570 *
* *
*******************************************************************************/
struct record*alter(struct record*head)
{
struct record *p1,*p2;
int choice1;
char alter_number[10],alter_name[20],alter_phone[20],alter_adress[40],alter_postcode[10],alter_e_mail[30],choice2;
p1=head;
if(head==NULL)
{
printf("\u901a\u8baf\u5f55\u65e0\u7528\u6237\u4fe1\u606f\u8bb0\u5f55\n");
return(head);
}
printf("\t\u8bf7\u8f93\u5165\u8981\u4fee\u6539\u7684\u7528\u6237\u7684\u5e8f\u53f7number:");
scanf("%s",alter_number);
rewind(stdin);
while(strcmp(p1->number,alter_number)!=0)
{
if(p1->next==NULL)
{
printf("\n\t\u901a\u8baf\u5f55\u65e0\u6b64\u7528\u6237\u4fe1\u606f\u8bb0\u5f55\n");
return(head);
}
else
{
p2=p1;
p1=p1->next;
}
}
if(strcmp(p1->number,alter_number)!=0)
{
printf("\u901a\u8baf\u5f55\u65e0\u7528\u6237\u4fe1\u606f\u8bb0\u5f55\n");
return(head);
}
else
{
printf("\t\u8981\u4fee\u6539\u7684\u7528\u6237\u7684\u57fa\u672c\u4fe1\u606f\u4e3a:\n\t");
printf("\t\u5e8f\u53f7: %s \u59d3\u540d:%s \u7535\u8bdd\u53f7\u7801:%s \u5730\u5740:%s \u90ae\u7f16:%s e_mail:%s\n"
,p1->number,p1->name,p1->phone,p1->adress,p1->postcode,p1->e_mail);
}
while(1)
{
printf("\t\u4f60\u662f\u5426\u8981\u4fee\u6539\u7684\u7528\u6237\u7684\u57fa\u672c\u4fe1\u606f?(y&n)");
scanf("%c",&choice2);
rewind(stdin);
if(choice2=='y')
{
printf("\t\u8bf7\u9009\u62e9\u4f60\u8981\u4fee\u6539\u7684\u9879\u76ee:\n\t");
printf("1:\u59d3\u540d 2:\u7535\u8bdd\u53f7\u7801 3:\u5730\u5740 4:\u90ae\u7f16 5:e_mail\n");
printf("\t\u4f60\u9009\u62e9\u7684\u5e8f\u53f7\u4e3a: ");
scanf("%d",&choice1);
rewind(stdin);
switch(choice1)
{case 1:printf("\t\u8bf7\u8f93\u5165\u66f4\u6539\u540e\u7684\u59d3\u540d");
scanf("%s",alter_name);rewind(stdin);
strcpy(p1->name,alter_name);
continue;
case 2:printf("\t\u8bf7\u8f93\u5165\u66f4\u6539\u540e\u7684\u7535\u8bdd\u53f7\u7801");
scanf("%s",alter_phone);rewind(stdin);
strcpy(p1->phone,alter_phone);
continue;
case 3:printf("\t\u8bf7\u8f93\u5165\u66f4\u6539\u540e\u7684\u5730\u5740");
scanf("%s",alter_adress);rewind(stdin);
strcpy(p1->adress,alter_adress);
continue;
case 4:printf("\t\u8bf7\u8f93\u5165\u66f4\u6539\u540e\u7684\u90ae\u7f16");
scanf("%s",&alter_postcode);rewind(stdin);strcpy(p1->postcode,alter_postcode);
continue;
case 5:printf("\t\u8bf7\u8f93\u5165\u66f4\u6539\u540e\u7684e_mail");
scanf("%s",alter_e_mail);rewind(stdin);
strcpy(p1->e_mail,alter_e_mail);
continue;
}
printf("\n\t\u4fee\u6539\u540e\u7528\u6237\u7684\u57fa\u672c\u4fe1\u606f\u4e3a:\n\t");
printf("\t\u5e8f\u53f7: %s \u59d3\u540d:%s \u7535\u8bdd\u53f7\u7801:%s \u5730\u5740:%s \u90ae\u7f16:%s e_mail\n"
,p1->number,p1->name,p1->phone,p1->adress,p1->postcode,p1->e_mail);
}
else
{
printf("\n\t\u4fee\u6539\u6210\u529f!!\n");
break;
}
}
return(head);
}
#include /*\u5934\u51fd\u6570*/
int main(void) /*\u4e3b\u51fd\u6570*/
{
char c; /*\u6307\u5b9ac\u6210\u4e3a\u5b57\u7b26\u53d8\u91cf*/
printf("\u8bf7\u8f93\u51650\u52309\u7684\u4efb\u610f\u4e00\u4e2a\u6570\u5b57\n"); /*\u8f93\u51fa\u8bf7\u8f93\u51650\u52309\u7684\u4efb\u610f\u4e00\u4e2a\u6570\u5b57*/
c=getchar(); /*\u8f93\u5165\u4e00\u4e2a\u5b57\u7b26*/
while(c>=48&&c<=57) /*c\u7684\u53d6\u503c\u8303\u56f4*/
{
getchar();
switch(c) /*\u6839\u636ec\u7684\u503c\u8f6c\u6362*/
{
case '0': printf("\u4f60\u559c\u6b22\u594b\u6597\u5417?\n"); /*\u5047\u5982c=0,\u8f93\u51fa\u4f60\u559c\u6b22\u594b\u6597\u5417?*/
break; /*\u4e2d\u65ad\u8df3\u51fa\uff0c\u6267\u884cc=getchar()*/
case '1': printf("\u4f60\u559c\u6b22\u5f53\u6a21\u7279\u5417?\n"); /*\u5047\u5982c=1,\u8f93\u51fa\u4f60\u559c\u6b22\u5f53\u6a21\u7279\u5417?*/
break; /*\u4e2d\u65ad\u8df3\u51fa\uff0c\u6267\u884cc=getchar()*/
case '2': printf("\u4f60\u559c\u6b22\u548c\u8c10\u5417?\n"); /*\u5047\u5982c=2,\u8f93\u51fa\u4f60\u559c\u6b22\u548c\u8c10\u5417?*/
break; /*\u4e2d\u65ad\u8df3\u51fa\uff0c\u6267\u884cc=getchar()*/
case '3': printf("\u4f60\u559c\u6b22\u9053\u5bb6\u5417?\n"); /*\u5047\u5982c=3,\u8f93\u51fa\u4f60\u559c\u6b22\u9053\u5bb6\u5417?*/
break; /*\u4e2d\u65ad\u8df3\u51fa\uff0c\u6267\u884cc=getchar()*/
case '4': printf("\u4f60\u662f\u5e7f\u4e1c\u4eba\u5417?\n"); /*\u5047\u5982c=4,\u8f93\u51fa\u4f60\u662f\u5e7f\u4e1c\u4eba\u5417?*/
break; /*\u4e2d\u65ad\u8df3\u51fa\uff0c\u6267\u884cc=getchar()*/
case '5': printf("\u4f60\u559c\u6b22\u6b66\u672f\u5417?\n"); /*\u5047\u5982c=5,\u8f93\u51fa\u4f60\u559c\u6b22\u6b66\u672f\u5417?*/
break; /*\u4e2d\u65ad\u8df3\u51fa\uff0c\u6267\u884cc=getchar()*/
case '6': printf("\u795d\u4f60\u4e00\u5e06\u98ce\u987a!\n"); /*\u5047\u5982c=6,\u8f93\u51fa\u795d\u4f60\u4e00\u5e06\u98ce\u987a!*/
break; /*\u4e2d\u65ad\u8df3\u51fa\uff0c\u6267\u884cc=getchar()*/
case '7': printf("\u89c2\u5bdf\u7b49\u5f85\u597d\u673a\u4f1a!\n"); /*\u5047\u5982c=7,\u8f93\u51fa\u89c2\u5bdf\u7b49\u5f85\u597d\u673a\u4f1a!*/
break; /*\u4e2d\u65ad\u8df3\u51fa\uff0c\u6267\u884cc=getchar()*/
case '8': printf("\u4f60\u559c\u6b22\u4ea4\u9645\u5417?\n"); /*\u5047\u5982c=8,\u8f93\u51fa\u4f60\u559c\u6b22\u4ea4\u9645\u5417?*/
break; /*\u4e2d\u65ad\u8df3\u51fa\uff0c\u6267\u884cc=getchar()*/
case '9': printf("\u8ffd\u6c42\u5b8c\u7f8e\u5427!\n"); /*\u5047\u5982c=9,\u8f93\u51fa\u8ffd\u6c42\u5b8c\u7f8e\u5427!*/
break; /*\u4e2d\u65ad\u8df3\u51fa\uff0c\u6267\u884cc=getchar()*/
}
c=getchar(); /*\u518d\u8f93\u5165\u4e00\u4e2a\u5b57\u7b26*/
}
return 0; /*\u8fd4\u56de\u503c*/
}
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<time.h>
#define ROW 6 /*学生数*/
#define COL 4 /*成绩数*/
int main()
{
/*定义所需变量*/
int no,i,j,k,grade[ROW][COL];
float a[ROW]={0}; /*每个学生平均成绩*/
char d[ROW][10],name[ROW][10]={"Tom","John","Peter","Ken","Lily","Roy"},
subject[COL][10]={"English","Math","C++","PE"},style;
/*声明所需函数*/
float ave_stu(int Grade[],int n);
void make(char name[][10],int grade[][COL],char subject[][10],float a[],int n);
int search(char subject[][10]);
float ave_class(int grade[][COL],int no);
int find(int grade[][COL],char name[][10],char d[][10]);
void sort(float a[],int n,char style);
srand(time(0)); /*随机给学生赋予成绩值*/
for(i=0;i<ROW;i++)
for(j=0;j<COL;j++)
grade[i][j]=rand()%100+1;
for(i=0;i<ROW;i++)
a[i]=ave_stu(grade[i],COL); /*求每个学生平均成绩并赋给a[n]*/
make(name,grade,subject,a,ROW); /*制表*/
no=search(subject); /*寻找某课程平均成绩*/
printf("此学科的平均成绩为: %8.2f\n",ave_class(grade,no));
k=find(grade,name,d); /*找出两门以上成绩不及格的人*/
printf("\n共有%d人两门以上不及格，分别是：",k);
for(i=0;i<k;i++)
printf("%6s",d[i]);
printf ("\n");
printf("输入排序方式 a为升序排，b为降序排 :\n"); /*学生平均
成绩排序*/
scanf("%c",&style);
sort(a,ROW,style);
for(i=0;i<ROW;i++)
printf("%12.2f",a[i]);
printf("\n");
return 0;
}
/*求每个学生平均成绩*/
float ave_stu(int Grade[],int n)
{
int i;
float total=0;
for(i=0;i<n;i++)
total+=Grade[i];
return(total/n);
}
/*制表*/
void make(char name[][10],int grade[][COL],char subject[][10],float a[],int n)
{
int i,j,k;
printf("姓名/课程");
for(k=0;k<COL;k++) /*输出课程*/
printf("%9s",subject[k]);
printf(" Average\n");
for(i=0;i<ROW;i++)
{
printf("%5s",name[i]); /*输出姓名*/
for(j=0;j<COL;j++) /*输出各科成绩*/
printf("%10d",grade[i][j]);
printf("%12.2f\n",a[i]);
}
} /*输出平均成绩*/
/*寻找切入点*/
int search(char subject[][10])
{
char b[10]; int i;
printf("输入要查询的课程： ");
gets(b);
for(i=0;i<COL;i++)
if(strcmp(b,subject[i])==0)break;
return(i);
}
/*计算所求科目的平均成绩*/
float ave_class(int grade[][COL],int no)
{
int i;
float sum=0;
for(i=0;i<ROW;i++)
sum+=grade[i][no];
sum/=ROW;
return(sum);
}
/*找出两门以上成绩不及格的人*/
int find(int grade[][COL],char name[][10],char d[][10])
{
int i,j,m=0,k=0;
for(i=0;i<ROW;i++)
{
for(j=0;j<COL;j++)
if(grade[i][j]<60)
m+=1; /*记录不及格科目数*/
if(m>=2)
{
strcpy(d[k],name[i]);
k+=1;
}
m=0;
} /*m值初始化*/
return(k);
}
/*学生平均成绩排序*/
void sort(float a[],int n,char style)
{
int i,j;float t;
if(style=='a')
for(i=1;i<n;i++) /*插入升序排序*/
{
t=a[i];j=i-1;
while(j>=0&&t<a[j])
{
a[j+1]=a[j];
j--;
}
a[j+1]=t;
}
if(style=='b')
for(i=1;i<n;i++) /*插入降序排序*/
{
t=a[i];j=i-1;
while(j>=0&&t>a[j])
{
a[j+1]=a[j];
j--;
}
a[j+1]=t;
}
}
随便一个就行？
另外,站长团上有产品团购,便宜有保证
绛旓細for(j=0;j<COL;j++)grade[i][j]=rand()%100+1;for(i=0;i<ROW;i++)a[i]=ave_stu(grade[i],COL);/*姹傛瘡涓鐢熷钩鍧囨垚缁╁苟璧嬬粰a[n]*/ make(name,grade,subject,a,ROW);/*鍒惰〃*/ no=search(subject);/*瀵绘壘鏌愯绋嬪钩鍧囨垚缁*/ printf("姝ゅ绉戠殑骞冲潎鎴愮哗涓: %8.2f\n",ave_cl...
绛旓細//q鍚庣Щ鍒版柊缁撶偣锛屽噯澶囪繛鎺ヤ笅涓涓鏂扮殑缁撶偣scanf("%d", &x);}return head;
绛旓細SetWindowPos( hwnd_self, NULL, xpos, ypos, 0, 0, SWP_NOSIZE|SWP_NOZORDER|SWP_NOACTIVATE );}120琛锛屼笉鐭ラ亾澶熶笉澶熴傚鏋滀綘鍔犱笂涓浜涙敞閲婏紝鍙互杈惧埌150琛屻備互涓婁唬鐮侊紝鍙槸鏄剧ず涓琛 鈥滆繖鏄涓涓Windows绐椾綋鈥 鐨勯粦鑹插簳鑹茬殑绐椾綋锛岀獥浣撶殑鏍囬鏄淗ELLO_WIN鈥濄
绛旓細setlinestyle(0,0,1);setcolor(BLUE);line(480-l/2,120-w/2,480+l/2,120-w/2);line(480-l/2,120+h-w/2,480+l/2,120+h-w/2);line(480-l/2,120-w/2,480-l/2,120+h-w/2);line(480+l/2,120-w/2,480+l/2,120+h-w/2);setcolor(WHITE);setlinestyle(0,0,1);lin...
绛旓細case 1:sum=0;break;case 2:sum=31;break;case 3:sum=59;break;case 4:sum=90;break;case 5:sum=120;break;case 6:sum=151;break;case 7:sum=181;break;case 8:sum=212;break;case 9:sum=243;break;case 10:sum=273;break;case 11:sum=304;break;case 12:sum=334;break;default:...
绛旓細printf("杈撳叆绗竴琛屾暟鎹甛n");scanf("%d,%d,%d,%d,%d,%d,%d,%d,%d,%d",&a[0],&a[1],&a[2],&a[3],&a[4],&a[5],&a[6],&a[7],&a[8],&a[9]);printf("杈撳叆绗簩琛屾暟鎹甛n");scanf("%d,%d,%d,%d,%d,%d,%d,%d,%d,%d",&b[0],&b[1],&b[2],&b[3],&b[...
绛旓細C銆1 D銆12 绛旀锛欳 锛19锛夈佺16琛屾敼涓衡滐紱鈥濆悗锛绋嬪簭杩愯鏃讹紝杈撳叆A*0#锛岃緭鍑 锛19锛 銆 鏀逛簡涔嬪悗锛岄亣涓"*"涓嶈烦鍑哄惊鐜紝浣嗘棤瑙嗘帀锛岀浉褰撲簬A0 A銆0 B銆120 C銆10 D銆12 绛旀锛欱 锛20锛夈佺16琛屾敼涓衡渆lse break;鈥濆垹闄ょ15琛屽悗锛岀▼搴忚繍琛屾椂锛岃緭鍏1b0#锛岃緭...
绛旓細score1=score2=2; /*鏈夋鍚庢敼鍙樺垎鏁*/ DoScore();/*杈撳嚭寮濮嬪垎鏁*/}void playtoplay()/*浜轰汉瀵规垬*/{ int x,y,t=1,i,j,cc=0; while(1)/*鎹㈡鎵嬭蛋妫*/ { x=120,y=80;/*姣忔妫嬪瓙涓寮濮嬪嚭鏉ョ殑鍧愭爣,x涓鸿鍧愭爣,y涓哄垪鍧愭爣*/ while(1) /*鍏蜂綋涓涓妫嬫墜璧版鐨勮繃绋*/ { PrintScore(1);/*杈...
绛旓細1.绋嬪簭鍒嗘瀽锛氫互3鏈5鏃ヤ负渚嬶紝搴旇鍏堟妸鍓嶄袱涓湀鐨勫姞璧锋潵锛岀劧鍚庡啀鍔犱笂5澶╁嵆鏈勾鐨勭鍑犲ぉ锛岀壒娈婃儏鍐碉紝闂板勾涓旇緭鍏ユ湀浠藉ぇ浜3鏃堕渶鑰冭檻澶氬姞涓澶┿2.绋嬪簭婧愪唬鐮侊細/ include <stdio.h> void main(){ int day,month,year,sum,leap;printf("\nplease input year,month,day\n");scanf("%d,%d,%d",...
绛旓細include <iostream.h> include <iomanip.h> include <string.h> include <fstream.h> const int Maxr=100; //璇昏呬笂闄 const int Maxb=100; //鍥句功涓婇檺 const int Maxbor=5; //姣忎釜璇昏呮渶澶氬熷5鏈 class Reader //璇昏呯被 { int tag; //鍒犻櫎鏍囪 1锛氬凡鍒狅紝0锛氭湭鍒 int no;...
