#include<stdio.h>
#include<malloc.h>
typedef int good;

typedef struct biao
{
    good* p;
    int num;
}dlb;
void set(biao* apple)
{
    apple->num = 0;
    apple->p = (good*)malloc(40);

}
void destroy(biao*apple)
{
    free(apple->p);
    apple->p = NULL;
}
void work(biao* apple, int arr[4], int a)
{
    int i = 0;
    for (i = 0; i < 4; i++)
    {
        apple->p[i] = arr[i];
    }
    apple->num = a;
}
void back(biao* apple, int past, int new1,int arr[])
{
    good *q = apple->p+past;
    q= (good*)malloc(new1 * sizeof(int));
    int i = past;
    int j = 0;
    for (i; i < past + new1; i++)
    {
       apple->p[i] = arr[j];
        j++;
    }


}

int main()
{
    dlb s1;
    set(&s1);
    int arr[4] = { 1,2,3,4 };
    

    work(&s1, arr, 9);
    int arr1[4] = { 5,6,7,8 };
    back(&s1, 4, 4, arr1);
    int i = 0;
    for (i = 0; i < 9; i++)
    {
        printf("%d", s1.p[i]);
    }
    printf("%d", s1.num);
    destroy(&s1);

    return 0;
}