수다닷컴

#include stdio.h
#include stdlib.h
#include conio.h
/*
메뉴
1.a식 추가
2.b식 추가
3.출력
4.덧셈
5.초기화
6.종료
*/
typedef struct _node{
int coef;
int expo;
struct _node *next;
}node;
node *a_start = NULL;
node *b_start = NULL;
node *c_start = NULL;
void a_add(){
node *newnode, *cur;
newnode = (node*)malloc(sizeof(node));
printf(\t** A식 추가 **\n);
printf(\t1. 계수 : );
scanf(%d,&newnode-coef);
printf(\t2. 지수 : );
scanf(%d,&newnode-expo);
newnode-next = NULL;
if(a_start == NULL){
a_start = newnode;
return;
}
if(a_start-expo newnode-expo){
newnode-next = a_start;
a_start = newnode;
return;
}
else if(a_start-expo == newnode-expo){
a_start-coef+=newnode-coef;
return;
}
cur = a_start;
while(cur-next != NULL){
if(cur-next-expo newnode-expo){
newnode-next = cur-next;
cur-next = newnode;
return;
}
else if(cur-next-expo == newnode-expo){
cur-next-coef+=newnode-coef;
return;
}
cur=cur-next;
}
if(cur-expo == newnode-expo)
cur-coef+=newnode-coef;
else
cur-next = newnode;
}
void b_add(){
node *newnode, *cur;
newnode = (node*)malloc(sizeof(node));
printf(\t** B식 추가 **\n);
printf(\t1. 계수 : );
scanf(%d,&newnode-coef);
printf(\t2. 지수 : );
scanf(%d,&newnode-expo);
newnode-next = NULL;
if(b_start == NULL){
b_start = newnode;
return;
}
if(b_start-expo newnode-expo){
newnode-next = b_start;
b_start = newnode;
return;
}
else if(b_start-expo == newnode-expo){
b_start-coef+=newnode-coef;
return;
}
cur = b_start;
while(cur-next != NULL){
if(cur-next-expo newnode-expo){
newnode-next = cur-next;
cur-next = newnode;
return;
}
else if(cur-next-expo == newnode-expo){
cur-next-coef+=newnode-coef;
return;
}
cur=cur-next;
}
if(cur-expo == newnode-expo)
cur-coef+=newnode-coef;
else
cur-next = newnode;
}
void add(node *cur1){
node *newnode,*cur;
newnode = (node*)malloc(sizeof(node));
newnode-coef = cur1-coef;
newnode-expo = cur1-expo;
newnode-next = NULL;
if(c_start == NULL){
c_start = newnode;
return;
}
if(c_start-expo newnode-expo){
newnode-next = c_start;
c_start = newnode;
return;
}
else if(c_start-expo == newnode-expo){
c_start-coef+=newnode-coef;
return;
}
cur = c_start;
while(cur-next != NULL){
if(cur-next-expo newnode-expo){
newnode-next = cur-next;
cur-next = newnode;
return;
}
else if(cur-next-expo == newnode-expo){
cur-next-coef+=newnode-coef;
return;
}
cur=cur-next;
}
if(cur-expo == newnode-expo)
cur-coef+=newnode-coef;
else
cur-next = newnode;
}
void sub(node *cur1){
node *newnode,*cur;
newnode = (node*)malloc(sizeof(node));
newnode-coef = cur1-coef;
newnode-expo = cur1-expo;
newnode-next = NULL;
if(c_start == NULL){
c_start = newnode;
return;
}
if(c_start-expo newnode-expo){
newnode-next = c_start;
c_start = newnode;
return;
}
else if(c_start-expo == newnode-expo){
c_start-coef-=newnode-coef;
return;
}
cur = c_start;
while(cur-next != NULL){
if(cur-next-expo newnode-expo){
newnode-next = cur-next;
cur-next = newnode;
return;
}
else if(cur-next-expo == newnode-expo){
cur-next-coef-=newnode-coef;
return;
}
cur=cur-next;
}
if(cur-expo == newnode-expo)
cur-coef-=newnode-coef;
else
cur-next = newnode;
}

void d_add(){
node *cur1,*cur2;
cur1 = a_start;
while(cur1-next != NULL){
sub(cur1);
cur1=cur1-next;
}
sub(cur1);
cur2 = b_start;
while(cur2-next != NULL){
sub(cur2);
cur2=cur2-next;
}
sub(cur2);
}
void c_add(){
node *cur1,*cur2;
cur1 = a_start;
while(cur1-next != NULL){
add(cur1);
cur1=cur1-next;
}
add(cur1);
cur2 = b_start;
while(cur2-next != NULL){
add(cur2);
cur2=cur2-next;
}
add(cur2);
}
void print(){
node *cur;
if(a_start==NULL){
printf(A식이 생성되지 않았습니다.\n);
}
else{
cur = a_start;
printf(A식 :\n\t);
while(cur-next != NULL){
if(cur-expo != 0)
printf(%dx의 %d승 - ,cur-coef,cur-expo);Bexpo);
else
printf(%d - ,cur-coef);
cur=cur-next;
}
if(cur-expo != 0)
printf(%dx의 %d승\n,cur-coef,cur-expo);
else
printf(%d\n,cur-coef);
}
if(b_start==NULL){
printf(B식이 생성되지 않았습니다.\n);
}
else{
cur = b_start;
printf(B식 :\n\t);
while(cur-next != NULL){
if(cur-expo != 0)
printf(%dx의 %d승 - ,cur-coef,cur-expo);
else
printf(%d - ,cur-coef);
cur=cur-next;
}
if(cur-expo != 0)
printf(%dx의 %d승\n,cur-coef,cur-expo);
else
printf(%d\n,cur-coef);
}
if(c_start==NULL){
printf(C식이 생성되지 않았습니다.\n);
}
else{
cur = c_start;
printf(C식 :\n\t);
while(cur-next != NULL){
if(cur-expo != 0)
printf(%dx의 %d승 - ,cur-coef,cur-expo);
else
printf(%d - ,cur-coef);
cur=cur-next;
}
if(cur-expo != 0)
printf(%dx의 %d승\n,cur-coef,cur-expo);
else
printf(%d\n,cur-coef);
}
}
void clear(){
node *cur,*del;
cur = a_start;
if(a_start == NULL)
printf(A식은 생성되지 않았습니다.\n);
else{
while(cur - next != NULL){
del = cur;
cur = cur-next;
free(del);
}
free(cur);
a_start = NULL;
}
cur = b_start;
if(b_start == NULL)
printf(B식은 생성되지 않았습니다.\n);
else{
while(cur - next != NULL){
del = cur;
cur = cur-next;
free(del);
}
free(cur);
b_start = NULL;
}
cur = c_start;
if(c_start == NULL)
printf(C식은 생성되지 않았습니다.\n);
else{
while(cur - next != NULL){
del = cur;
cur = cur-next;
free(del);
}
free(cur);
c_start = NULL;
}
printf(삭제를 완료하였습니다.\n);
}
void main(){
int select;
while(1){
system(cls);
puts(\n\n);
puts(\t\t 메 뉴 );
puts(\t\t 1. A식 추가);
puts(\t\t 2. B식 추가);
puts(\t\t 3. 출 력);
puts(\t\t 4. 덧 셈);
puts(\t\t 5. 뺄 셈);
puts(\t\t 6. 초 기 화);
puts(\t\t 7. 종 료);
printf(\n\t선택을 하십시오 : );
scanf(%d,&select);
system(cls);
switch(select){
case 1:
a_add();
break;
case 2:
b_add();
break;
case 3:
print();
getch();
break;
case 4:
c_add();
break;
case 5:
d_add();
break;
case 6:
clear();
getch();
break;
case 7:
printf(프로그램을 종료시키겠습니다.\n);
getch();
exit(1);
}
}
}

신청하기