수다닷컴

질문 제목 : 질문 내용 : #include stdio.h
#include stdlib.h
#define stack_len 37
#define list_len 100
#define true 1;
#define false 0;
typedef int data;
typedef struct _arraystack
{
data stackarr[stack_len];
int topindex;
} arraystack;
typedef arraystack stack;
void stackinit(stack *pstack)
{
pstack-topindex=-1;
}
int sisempty(stack *pstack)
{
if(pstack-topindex==-1){
return true;
}
else
return false;
}
void spush(stack *pstack, data data)
{
pstack-topindex+=1;
pstack-stackarr[pstack-topindex]=data;
}
data spop(stack *pstack)
{
int ridx;
if(sisempty(pstack))
{
printf(stack memory error!);
exit(-1);
}
ridx=pstack-topindex;
pstack-topindex-=1;
return pstack-stackarr[ridx];
}
typedef int ldata;
typedef struct _node
{
ldata data;
struct _node *next;
}node;
typedef struct _arraylist
{
ldata arr[list_len];
int numofdata;
int curposition;
int score;
}arraylist;
typedef arraylist list;
//void listinit(list *plist)
//{
//plist-head=(node*)malloc(sizeof(node));
//plist-head-next=null;
//plist-comp=null;
//plist-numofdata=0;
//}
void linsert(list *plist, ldata data)
{
if(plist-numofdatalist_len) //용량초과
{puts(저장이 불가능);
return;
}
plist-arr[plist-numofdata]=data;
(plist-numofdata)++;
}
int lfirst(list *plist, ldata *pdata)
{
if(plist-numofdata==0)
return false;
(plist-curposition)=0;
*pdata=plist-arr[0];
return true;
}
int lnext(list *plist, ldata *pdata)
{
if(plist-curposition=(plist-numofdata)-1)
return false;
(plist-curposition)++;
*pdata=plist-arr[plist-curposition];
return true;
}
int main()
{
file *fp;
int i, j, k;
int temp1=0;
int temp2=0;
int temp3=0;
int stack1[3][45];
int stack2[37][37];
list list;
int data;
fp=fopen(member.txt, r);
for(i=0;i3;i++){
for(j=0;j45;j++)
{
fscanf(fp, %d,&stack1[i][j]); //stack1으로 txt파일을 행렬도 바꿈
}
}

//1단계
for(i=0;i37;i++){
for(j=0;j37;j++){
stack2[i][j]=0;
}
}
//for(i=0;i34;i++){
for(k=0;k45;k++){
temp1=stack1[1][k];
temp2=stack1[2][k];
temp3=stack1[3][k];
stack2[temp1][temp2]=temp3;
//여기서 행렬안에 변수라서그런지 안들어가네요 ㅠㅠ-8599640 이런 값만 나오구요 ㅠㅠ
행렬저렇게 대입하고 싶은데, 어떻게 하면좋을까요

}
printf(%d\n, temp3);
}//2단계 인접행렬 만들기
return 0;
}

신청하기