-
Notifications
You must be signed in to change notification settings - Fork 23
/
Copy pathM0006.c
executable file
·60 lines (49 loc) · 1.62 KB
/
M0006.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
/*
Problem Statement: https://www.hackerrank.com/challenges/dynamic-array-in-c/problem
*/
#include <stdio.h>
#include <stdlib.h>
int* total_number_of_books;
int** total_number_of_pages;
int main()
{
int total_number_of_shelves;
scanf("%d", &total_number_of_shelves);
int total_number_of_queries;
scanf("%d", &total_number_of_queries);
// Allocate memory
total_number_of_books = (int*)malloc(total_number_of_shelves * sizeof(int));
total_number_of_pages = (int**)malloc(total_number_of_shelves * sizeof(int*));
while (total_number_of_queries--) {
int type_of_query;
scanf("%d", &type_of_query);
if (type_of_query == 1) {
int x, y;
scanf("%d %d", &x, &y);
// Update values
total_number_of_books[x]++;
total_number_of_pages[x] = realloc(total_number_of_pages[x], total_number_of_books[x] * sizeof(int));
total_number_of_pages[x][total_number_of_books[x] - 1] = y;
} else if (type_of_query == 2) {
int x, y;
scanf("%d %d", &x, &y);
printf("%d\n", *(*(total_number_of_pages + x) + y));
} else {
int x;
scanf("%d", &x);
printf("%d\n", *(total_number_of_books + x));
}
}
if (total_number_of_books) {
free(total_number_of_books);
}
for (int i = 0; i < total_number_of_shelves; i++) {
if (*(total_number_of_pages + i)) {
free(*(total_number_of_pages + i));
}
}
if (total_number_of_pages) {
free(total_number_of_pages);
}
return 0;
}