#include<stdio.h>
#include<stdlib.h>
#include<string.h>
struct newstudent{ //й(int), ̸(char(8)), г( int), ó(char(char(12)), ȸ(int)
int number;//й
char name[8];
int grade;
char phonenumber[12];
int rest;//
};
// Ի struct
typedef struct oldstudent{ //й(int), ̸(char(8)), г( int), ó(char(char(12)), ȸ(int), нñ(char(3)) л
int number[20];
char name[8];
int grade;
char phonenumber[12];
int rest;
char resttime[3];
struct oldstudent *rink;
struct oldstudent *link;
}old;
old *first;
old *tail;
void initial_list(void){ //ʱⰪ NULL
first =NULL;
tail =NULL;
}
void Del(void)//
{
}
old *makenode(){
old *data;
data =new old;
if( ! || data)
return NULL;
data->link=NULL;
data->rink =NULL;
data->number=0;//
data->name=0;//
data->phonenumber=0;//
data->grade= 0;
data->rest=0;
}// ʱȭ
struct newstudent news[100];
void Find(int x) //Ʈ ãƼ
{
int i;
FILE *in;
in=fopen("student1.dat","w+");
for(i=0; i<100; i++)
{
if(news[i].number==x){
news[i].number=NULL;
news[i].grade=NULL;
*news[i].name=NULL;
*news[i].phonenumber=NULL;
news[i].rest=NULL;
fprintf(in,"%d \t %s \t %d \t %s \t %d \n",news[i].number,news[i].name,news[i].grade,news[i].phonenumber,news[i].rest);
fclose(in);
system("cls");
}
}
};
void Finding(char k[8]){
int i;
FILE *in;
in=fopen("student1.dat","w+");
for(i=0; i<100; i++)
{
if(news[i].name==k){
news[i].number=NULL;
news[i].grade=NULL;
*news[i].name=NULL;
*news[i].phonenumber=NULL;
news[i].rest=NULL;
fprintf(in,"%d \t %s \t %d \t %s \t %d \n",news[i].number,news[i].name,news[i].grade,news[i].phonenumber,news[i].rest);
fclose(in);
system("cls");
}
}
};
int main(void)
{
int stack=0,i,code,x=1;
char choice,name[8];
FILE *in;
in=fopen("student1.dat","a");
system("cls");
while(1)
{
printf("Ի (1)\n");
printf("л (2)\n");
printf("л (3)\n");
printf(" (4)\n");
printf("л ü ȸ(5)\n");
printf("л(й) ȸ(6)\n");
printf("л(̸) ȸ(7)\n");
printf("ý (q)\n");
printf("ϰ ԷϰŶ : ");
scanf("%c",&choice);
system("cls");
switch(choice)
{
case '1' : //й(int), ̸(char(8)), г( int), ó(char(char(12)), ȸ(int)
printf("\n");
printf("й Էϼ : ");
scanf("%d",&news[stack].number);
printf("\n");
printf(" Էϼ : ");
scanf("%s",&news[stack].name);
printf("\n");
printf("г Է ϼ : ");
scanf("%d",&news[stack].grade);
printf("\n");
printf("ó Էϼ : ");
scanf("%s",&news[stack].phonenumber);
printf("\n");
printf(" ȸ Էϼ(ѹ ϼ 0̶ ԷϽø ˴ϴ.) :");
scanf("%d",&news[stack].rest);
printf("\n");
fprintf(in,"%d \t %s \t %d \t %s \t %d \n",news[stack].number,news[stack].name,news[stack].grade,news[stack].phonenumber,news[stack].rest);
fclose(in);
stack=stack+1;
system("cls");
continue;
case '2' :
case '3' :
case '4' : // (4) : л л Ʈ Ȯ ,
printf("ϰ л й Է ϼ : ");
scanf("%d",&code);
Find(code);
getchar();
case'5' :
printf("лƮ \n");
for(i=0; i<stack; i++)
printf("%d \t %s \t %d \t %s \t %d \n",news[i].number,news[i].name,news[i].grade,news[i].phonenumber,news[i].rest);
printf("л Ʈ \n");
printf("Ϸ Ǿϴ. \n Ͻ÷ Enter ּ \n");
getchar();
system("cls");
continue;
case'6' :
printf(" Է ּ : ");
scanf("%s",name[8]);
Finding(name);
getchar();
case'7' :
printf("л Է ּ : ");
case'q' :
break;// : break; ȸ
}
}
return 0;
}
ȳϼ ó ϴ.. ڵǷ մϴ. ѹ ͺֽð ּ. ḮƮ ߿ḮƮ κ ظ ؼ, ڼϰ ֽø ϰٽϴ.
ߺŹ帳ϴ. ^^~! |