/*
#include <stdio.h>
#include <stdlib.h>
int main()
{
printf("Hello world!\n");
return 0;
}
*/
/*
#include <stdio.h>
#include <stdlib.h>
void MergeTwoArea(int arr[], int left,int mid, int right)
{
int fIdx = left;
int rIdx = mid + 1;
int i;
int * sortArr = (int*)malloc(sizeof(int)*(right+1));
int sIdx = left;
while(fIdx <= mid && rIdx <= right)
{
if(arr[fIdx]<=arr[rIdx])
{
sortArr[sIdx] = arr[fIdx++];
}
else
{
sortArr[sIdx]=arr[rIdx++];
}
sIdx++;
}
if(fIdx > mid)
{
for(i = rIdx; i <=right; i++,sIdx++)
{
sortArr[sIdx] = arr[i];
}
}
else
{
for(i = fIdx; i <= mid; i++,sIdx++)
{
sortArr[sIdx] = arr[i];
}
}
for(i = left; i <= right; i++)
{
arr[i] = sortArr[i];
}
free(sortArr);
}
void MergeSort(int arr[], int left, int right)
{
int mid;
if(left < right)
{
mid = (left+right)/2;
MergeSort(arr,left,mid);
MergeSort(arr,mid+1,right);
MergeTwoArea(arr,left,mid,right);
}
}
int main()
{
int i, arr[8] = {8,2,3,7,1,5,4,6};
MergeSort(arr,0,sizeof(arr)/sizeof(int)-1);
for(i = 0; i < 8; i++)
{
printf("%d ",arr[i]);
}
printf("\n");
return 0; //?
*/
#include <stdio.h>
struct node
{
int num;
struct node* link;
};
int main()
{
struct node a, b;
a.num = 0;
a.link = &b;
b.num = 1;
printf("%d\n",a.num);
printf("%d\n",a.link->num);
return 0;
}