forked from chandraprakash-dev/HackerRank
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathQueryingTheDocument.c
151 lines (130 loc) · 3.96 KB
/
QueryingTheDocument.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
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include<assert.h>
#define MAX_CHARACTERS 1005
#define MAX_PARAGRAPHS 5
char* kth_word_in_mth_sentence_of_nth_paragraph(char**** document, int k, int m, int n) {
return document[n - 1][m - 1][k - 1];
}
char** kth_sentence_in_mth_paragraph(char**** document, int k, int m) {
return document[m - 1][k - 1];
}
char*** kth_paragraph(char**** document, int k) {
return document[k - 1];
}
char**** get_document(char* text) {
// doc points to an array of paragraphs
char ****doc = malloc(MAX_PARAGRAPHS * sizeof(char ***));
// for each paragraph, assign an array of 1 sentence, we can reallocate later
for(int i = 0; i < MAX_PARAGRAPHS; i ++) {
doc[i] = malloc(1 * sizeof(char **));
}
// for each sentence assign an array of 1 word
for(int i = 0; i < MAX_PARAGRAPHS; i ++) {
for(int j = 0; j < 1; j ++) {
doc[i][j] = malloc(1 * sizeof(char*));
}
}
// for each word assign an array of 1 character
for(int i = 0; i < MAX_PARAGRAPHS; i ++) {
for(int j = 0; j < 1; j ++) {
for(int k = 0; k < 1; k ++) {
doc[i][j][k] = malloc(1 * sizeof(char));
}
}
}
for(int n = 0, i = 0, j = 0, k = 0, l = 0; n < strlen(text); n ++) {
if(text[n] != ' ' && text[n] != '\n' && text[n] != '.') {
doc[i][j][k][l] = text[n];
l++;
doc[i][j][k] = realloc(doc[i][j][k], (l + 1) * sizeof(char));
} else if(text[n] == ' ') {
doc[i][j][k][l] = '\0';
l = 0;
k++;
doc[i][j] = realloc(doc[i][j], (k + 1) * sizeof(char*));
doc[i][j][k] = malloc(sizeof(char));
continue;
} else if(text[n] == '.') {
doc[i][j][k][l] = '\0';
k = l = 0;
j++;
doc[i] = realloc(doc[i], (j+1) * sizeof(char**));
doc[i][j] = malloc(sizeof(char*));
doc[i][j][k] = malloc(sizeof(char));
continue;
} else if(text[n] == '\n') {
j = k = l = 0;
i++;
continue;
}
}
return doc;
}
char* get_input_text() {
int paragraph_count;
scanf("%d", ¶graph_count);
char p[MAX_PARAGRAPHS][MAX_CHARACTERS], doc[MAX_CHARACTERS];
memset(doc, 0, sizeof(doc));
getchar();
for (int i = 0; i < paragraph_count; i++) {
scanf("%[^\n]%*c", p[i]);
strcat(doc, p[i]);
if (i != paragraph_count - 1)
strcat(doc, "\n");
}
char* returnDoc = (char*)malloc((strlen (doc)+1) * (sizeof(char)));
strcpy(returnDoc, doc);
return returnDoc;
}
void print_word(char* word) {
printf("%s", word);
}
void print_sentence(char** sentence) {
int word_count;
scanf("%d", &word_count);
for(int i = 0; i < word_count; i++){
printf("%s", sentence[i]);
if( i != word_count - 1)
printf(" ");
}
}
void print_paragraph(char*** paragraph) {
int sentence_count;
scanf("%d", &sentence_count);
for (int i = 0; i < sentence_count; i++) {
print_sentence(*(paragraph + i));
printf(".");
}
}
int main()
{
char* text = get_input_text();
char**** document = get_document(text);
int q;
scanf("%d", &q);
while (q--) {
int type;
scanf("%d", &type);
if (type == 3){
int k, m, n;
scanf("%d %d %d", &k, &m, &n);
char* word = kth_word_in_mth_sentence_of_nth_paragraph(document, k, m, n);
print_word(word);
}
else if (type == 2){
int k, m;
scanf("%d %d", &k, &m);
char** sentence = kth_sentence_in_mth_paragraph(document, k, m);
print_sentence(sentence);
}
else{
int k;
scanf("%d", &k);
char*** paragraph = kth_paragraph(document, k);
print_paragraph(paragraph);
}
printf("\n");
}
}