#2217
Map
Domnul Map vă pune la dispoziție un șir a[1]
, a[2]
, …, a[n]
de numere naturale. Pentru fiecare a[i]
(i=1..n
) trebuie să spuneți de câte ori apare acest element în secvența a[1]
, a[2]
, …, a[i]
.
Problema | Map | Operații I/O |
map.in /map.out
|
---|---|---|---|
Limita timp | 0.2 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
Id soluție | #50778584 | Utilizator | |
Fișier | map.c | Dimensiune | 4.87 KB |
Data încărcării | 02 Mai 2024, 22:59 | Scor / rezultat | Eroare de compilare |
map.c:13:2: error: unknown type name 'linked_list' linked_list **buckets; /* Array de liste simplu-inlantuite. */ ^ map.c: In function 'ht_create': map.c:92:37: error: 'linked_list' undeclared (first use in this function) ht->buckets = malloc(hmax * sizeof(linked_list *)); ^ map.c:92:37: note: each undeclared identifier is reported only once for each function it appears in map.c:92:50: error: expected expression before ')' token ht->buckets = malloc(hmax * sizeof(linked_list *)); ^ map.c:94:3: warning: implicit declaration of function 'll_create' [-Wimplicit-function-declaration] ht->buckets[i] = ll_create(sizeof(info), ht->key_val_free_function); ^ map.c:94:18: warning: assignment makes pointer from integer without a cast [enabled by default] ht->buckets[i] = ll_create(sizeof(info), ht->key_val_free_function); ^ map.c: In function 'ht_has_key': map.c:101:2: error: unknown type name 'll_node' ll_node *current = ht->buckets[index]->head; ^ map.c:101:39: error: request for member 'head' in something not a structure or union ll_node *current = ht->buckets[index]->head; ^ map.c:104:43: error: request for member 'data' in something not a structure or union if(ht->compare_function(((info*)(current->data))->key, key) == 0) ^ map.c:106:20: error: request for member 'next' in something not a structure or union current = current->next; ^ map.c: In function 'ht_get': map.c:116:2: error: unknown type name 'll_node' ll_node *current = ht->buckets[index]->head; ^ map.c:116:39: error: request for member 'head' in something not a structure or union ll_node *current = ht->buckets[index]->head; ^ map.c:119:30: error: request for member 'data' in something not a structure or union info *data = (info*)current->data; ^ map.c:122:20: error: request for member 'next' in something not a structure or union current = current->next; ^ map.c: In function 'ht_put': map.c:142:2: warning: implicit declaration of function 'll_create_and_insert' [-Wimplicit-function-declaration] ll_create_and_insert(ht->buckets[index], ^ map.c:143:20: error: request for member 'size' in something not a structure or union ht->buckets[index]->size, new_info); ^ map.c: In function 'ht_remove_entry': map.c:152:2: error: unknown type name 'll_node' ll_node *current = ht->buckets[index]->head; ^ map.c:152:39: error: request for member 'head' in something not a structure or union ll_node *current = ht->buckets[index]->head; ^ map.c:156:30: error: request for member 'data' in something not a structure or union info *data = (info*)current->data; ^ map.c:159:4: error: unknown type name 'll_node' ll_node *eliminated = ll_remove_nth(ht->buckets[index], i); ^ map.c:159:4: warning: implicit declaration of function 'll_remove_nth' [-Wimplicit-function-declaration] map.c:159:26: warning: initialization makes pointer from integer without a cast [enabled by default] ll_node *eliminated = ll_remove_nth(ht->buckets[index], i); ^ map.c:160:40: error: request for member 'data' in something not a structure or union ht->key_val_free_function(eliminated->data); ^ map.c:164:20: error: request for member 'next' in something not a structure or union current = current->next; ^ map.c: In function 'ht_free': map.c:174:3: warning: implicit declaration of function 'll_free' [-Wimplicit-function-declaration] ll_free(&(*ht)->buckets[i]); ^ map.c: In function 'main': map.c:190:10: warning: ignoring return value of 'scanf', declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &n); ^ map.c:193:14: warning: ignoring return value of 'scanf', declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &x); ^
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema Map face parte din prima categorie. Soluția propusă de tine va fi evaluată astfel:
Suma punctajelor acordate pe testele utilizate pentru verificare este 100. Astfel, soluția ta poate obține cel mult 100 de puncte, caz în care se poate considera corectă.