|
|
|
|
|
#include<stdio.h>
|
|
|
|
|
|
#include<string.h>
|
|
|
|
|
|
#include<stdlib.h>
|
|
|
|
|
|
#include<time.h>
|
|
|
|
|
|
typedef struct exam_system//<2F><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
|
|
|
|
|
{
|
|
|
|
|
|
char problem[500];
|
|
|
|
|
|
char answer1[150];
|
|
|
|
|
|
char answer2[150];
|
|
|
|
|
|
char answer3[150];
|
|
|
|
|
|
char answer4[150];
|
|
|
|
|
|
char key;
|
|
|
|
|
|
struct exam_system *next;
|
|
|
|
|
|
}EXAM;
|
|
|
|
|
|
void Answer(int n,EXAM *fp); //<2F><><EFBFBD>⺯<EFBFBD><E2BAAF><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ѡ<EFBFBD><D1A1>һ<EFBFBD><D2BB>ģ<EFBFBD><C4A3>
|
|
|
|
|
|
void Output(EXAM *fp,int i); //<2F><><EFBFBD>⺯<EFBFBD><E2BAAF><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ε<EFBFBD><CEB5><EFBFBD><EFBFBD><EFBFBD>Ŀ
|
|
|
|
|
|
int Judge(EXAM *fp,char m); //<2F>о<EFBFBD><D0BE><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>жϻش<CFBB><D8B4><EFBFBD><EFBFBD><EFBFBD>ȷ<EFBFBD><C8B7><EFBFBD><EFBFBD><EFBFBD>Ƿ<EFBFBD><C7B7><EFBFBD>ͬ
|
|
|
|
|
|
void Input(EXAM *fp); //<2F><><EFBFBD>⺯<EFBFBD><E2BAAF><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ŀ
|
|
|
|
|
|
void Read(EXAM *fp); //<2F>ļ<EFBFBD><C4BC><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ļ<EFBFBD><C4BC><EFBFBD>ָ<EFBFBD><D6B8>ָ<EFBFBD><D6B8>
|
|
|
|
|
|
EXAM *create(EXAM *fp); //<2F><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
|
|
|
|
|
EXAM *InsertNode(EXAM *head,EXAM*s); //<2F><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
|
|
|
|
|
int main()
|
|
|
|
|
|
{
|
|
|
|
|
|
EXAM exam[20];
|
|
|
|
|
|
EXAM s;
|
|
|
|
|
|
EXAM *head;
|
|
|
|
|
|
int op,n;
|
|
|
|
|
|
printf("\t\t**********<2A><><EFBFBD><EFBFBD>ѡ<EFBFBD><D1A1><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><D7BC><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ϵͳ**********\n");
|
|
|
|
|
|
printf("\t\t* 1.<2E><>ʼ<EFBFBD><CABC><EFBFBD><EFBFBD> *\n");
|
|
|
|
|
|
printf("\t\t* 2.<2E><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> *\n");
|
|
|
|
|
|
printf("\t\t* 3.<2E>˳<EFBFBD> *\n");
|
|
|
|
|
|
printf("\t\t********************************************\n");
|
|
|
|
|
|
printf("\t\t<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ѡ<EFBFBD>");
|
|
|
|
|
|
scanf("%d",&op);
|
|
|
|
|
|
switch(op)
|
|
|
|
|
|
{
|
|
|
|
|
|
case 1:
|
|
|
|
|
|
printf("<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ҫ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>");
|
|
|
|
|
|
scanf("%d",&n);
|
|
|
|
|
|
Answer(n,&exam);
|
|
|
|
|
|
break;
|
|
|
|
|
|
case 2:
|
|
|
|
|
|
system("cls");
|
|
|
|
|
|
Input(&s);
|
|
|
|
|
|
head=createLinkedList(&exam);
|
|
|
|
|
|
head=InsertNode(head,&s);
|
|
|
|
|
|
break;
|
|
|
|
|
|
case 3:
|
|
|
|
|
|
exit(0);
|
|
|
|
|
|
break;
|
|
|
|
|
|
default:printf("ERROR!!PLEASE ENTER AGAIN!!");
|
|
|
|
|
|
}
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
}
|
|
|
|
|
|
void Answer(int n,EXAM *fp)
|
|
|
|
|
|
{
|
|
|
|
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
void Output(EXAM *fp,int i)
|
|
|
|
|
|
{
|
|
|
|
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
int Judge(EXAM *fp,char m)
|
|
|
|
|
|
{
|
|
|
|
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
void Input(EXAM *fp)
|
|
|
|
|
|
{
|
|
|
|
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
void ReadfromFile(EXAM *fp)
|
|
|
|
|
|
{
|
|
|
|
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
EXAM *createLinkedList(EXAM *fp)
|
|
|
|
|
|
{
|
|
|
|
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
EXAM *InsertNode(EXAM *head,EXAM*s)
|
|
|
|
|
|
{
|
|
|
|
|
|
|
|
|
|
|
|
}
|
