Description

This is the practice for function pointer, you are be required to finish a task execulator using function pointer.

Given the below struct

 typedef struct{
    void (*func)(void *);
    void *argument;
}Task;

typedef struct{
    int* arr;
    int lower;
    int upper;
}Data;

typedef struct{
    Task **tasks;
    int size;
}Task_List;

and you need to implement 5 functions to pass this practice.

func1 :  void job1(void* argument);  // reverse

func2 :  void job2(void* argument);  // minus

func3 :  void job3(void* argument);  // double

func4 :  void initTask(Task* task, void(*func)(void*),void* argument);

func5 : void executeTasks(Task_List *task_list);

For this problem, we will give you a global array and you need to modify the value in global array with different job using function pointer

main.c

#include <stdio.h> #include <stdlib.h> #include "function.h" int global_array[25]; Task_List *task_list; int main(){ int n,i,upper, lower, method; // initial global_array for(i=0; i<25; ++i){ global_array[i] = i+1; } scanf("%d", &n); task_list = (Task_List*)malloc(sizeof(Task_List)); task_list->tasks = (Task**)malloc(sizeof(Task*)*n); task_list->size = n; for(i=0; i<n; ++i){ scanf("%d%d%d",&method, &lower, &upper); Task *task = (Task*)malloc(sizeof(Task)); Data *data = (Data*)malloc(sizeof(Data)); data->arr = global_array; data->lower = lower; data->upper = upper; switch(method){ case 0: initTask(task, job1, data); break; case 1: initTask(task, job2, data); break; case 2: initTask(task, job3, data); break; default: break; } task_list->tasks[i] = task; } // execute job executeTasks(task_list); // print out result for(i=0; i<24; ++i){ printf("%d ", global_array[i]); }printf("%d\n",global_array[24]); for(i=0; i<n; ++i){ free(task_list->tasks[i]->argument); free(task_list->tasks[i]); }free(task_list); return 0; }

function.h

#include <stdio.h> #include <stdlib.h> typedef struct{ void (*func)(void *); void *argument; }Task; typedef struct{ int* arr; int lower; int upper; }Data; typedef struct{ Task **tasks; int size; }Task_List; void job1(void* argument); // reverse void job2(void* argument); // minus void job3(void* argument); // double void initTask(Task* task, void(*func)(void*),void* argument); void executeTasks(Task_List *task_list);

 

Input

T

Mi Li Ui

...

T:  the number of task (2 < T < 100)

Mi: the type of job (Mi = {0, 1, 2})

Li: the lower bound of the array (0 <= Li < 25)

Ui: the upper bound of the array (Li <= Ui < 25)

Output

Output the global array after finishing all tasks.

Sample Input  Download

Sample Output  Download

Partial Judge Code

12582.c

Partial Judge Header

12582.h

Tags

Discuss

Description

Given a link list structure named Node.

typedef struct _Node {

    int data;

    struct _Node *next;

} Node;

In this problem, you need to implement five operation for the linked list. 

func1: Node* createList(int *a, int size);

func2: void push_front(Node** head, int val);

func3: Node* copyList(Node* head);

func4: void deleteElementByIdx(Node** head, int idx);

func5: void SwapElementByIdx(Node** head, int idx1, int idx2);

#include <stdio.h> #include <stdlib.h> #include "function.h" void traversal(Node* head); int main(){ int T,M,inst,i; int val,idx1,idx2; scanf("%d%d", &T,&M); Node* head = NULL; int *array = (int*)malloc(sizeof(int)*M); for(i=0; i<M; ++i){ scanf("%d",&array[i]); } if(M > 0){ head = createList(array, M); traversal(head); } while(T--){ scanf("%d",&inst); if(inst == 0){ // insert scanf("%d",&val); push_front(&head, val); }else if(inst == 1){ // copy link list Node* otherHead = copyList(head); /* free original list*/ while(head != NULL){ Node* temp = head; head = head->next; free(temp); } head = otherHead; }else if(inst == 2){ // delete element scanf("%d",&val); deleteElementByIdx(&head, val); }else if(inst == 3){ // swap link element scanf("%d%d",&idx1, &idx2); SwapElementByIdx(&head,idx1,idx2); } traversal(head); } /* free linked list*/ while(head != NULL){ Node* temp = head; head = head->next; free(temp); } return 0; } void traversal(Node* head){ if(head == NULL) return; while(head != NULL){ printf("%d ", head->data); head = head->next; }printf("\n"); }

Note: We guarantee that function 1, 3~5 will not operate on an empty list.

Input

T M

S1 .. SM

t1_command

...

tT_command

T: the number of command ( 0 <= T < 200)

M: the number of initial linked size (0 <= M <= 2000)

Si: the value of the initial array (0 <= Si <= 1000)

ti_command: the command description

(0: push_front, 1: clone, 2: delete, 3: swap)

Hint: 

testcase1 : contain only createList operation

testcase2: contain only push_front operation

testcase3: contain createList , push_front, copyList operation

testcase4: contain createList , push_front , copyList operation, deleteElementByIdx

testcase5: contain all operation 

Output

Output the element in linked list whenever the operation be called. 

Sample Input  Download

Sample Output  Download

Partial Judge Code

12594.c

Partial Judge Header

12594.h

Tags

Discuss

Description

This is a partial judge problem.

Given two sorted linked lists which length are N and M respectively, you need to merge them into one sorted list and delete the duplicated numbers.

function.h

typedef struct _Node {
    int data;
    struct _Node *next;
} Node;

Node* Merge_lists(Node*, Node*);

You only need to implement the Merge_lists(Node*, Node*) function which take two sorted linked list as input.

 

Input

First line contains two integers which denote the number of the integers of two sorted lists. (1 <= N.M <= 10, 1 <= each integer <= 30)

Second line contains N integers which denote the first given sorted list.

Third line contains M integers which denote the second given sorted list.

Output

One merged sorted linked list result.

Sample Input  Download

Sample Output  Download

Partial Judge Code

13082.c

Partial Judge Header

13082.h

Tags

Discuss