Notificació d'enviament de problemes

Algorísmia i Programació 2



Enviament


Informació

Per a fer l'enviament can posar l'email i contrassenya utilitzades al jutge. Cal fer un enviament diferent per a cada problema.


Llista de problemes
Problema Termini Comentari
1 Thu 20 Feb Implement Rectangle::rotate, flip and isPointInside (pag 44, Abstract Data Types)
2 Thu 20 Feb Summations (pag 64, Algorithm Analysis)
3 Thu 20 Feb For loops (pags 65-67, Algorithm Analysis)
4 Thu 27 Feb Os, Omegas and Thetas (pag 68, Algorithm Analysis)
5 Thu 27 Feb Primality (pag 69, Algorithm Analysis)
6 Thu 27 Feb The Cell Phone Dropping Problem (pag 71, Algorithm Analysis)
7 Thu 05 Mar A, B or C (pag 55, Divide&Conquer)
8 Thu 05 Mar Crazy sorting (pag 56, Divide&Conquer)
9 Thu 05 Mar The majority element (pag 57, Divide & Conquer). No es facil.
10 Thu 12 Mar Constructors (pag 36, Memory management)
11 Thu 12 Mar Constructors and destructors (pag 37, Memory management)
12 Thu 12 Mar List with pointers (pag 38, Memory management)
13 Thu 19 Mar Interleaved push/pop operations (pag 17, Containers: Stack)
14 Thu 19 Mar Middle element of a stack (pag 18, Containers: Stack)
15 Thu 19 Mar Reverse of a list (pag 30, Containers: Queue and List)
16 Sat 28 Mar Merge of two lists (pag 32, Containers: Queue and List)
17 Sat 28 Mar DFS (pag 51, Graphs: Connectivity)
18 Sat 28 Mar SCC (pag 53, Graphs: Connectivity)
19 Sat 28 Mar Pouring water (pag 55, Graphs: Connectivity) -> a challenge
20 Mon 06 Apr Insert/remove element (pag 16, Priority Queue)
21 Mon 06 Apr Guess a and b (pag 17, Priority Queue)
22 Mon 06 Apr The k-th element (pag 18, Priority Queue)
23 Mon 06 Apr Bubble-up/down (pag 19, Priority Queue)
24 Tue 21 Apr Dijkstra (pag 33, Graphs: Shortest Paths)
25 Tue 21 Apr Bellman-Ford (pag 34, Graphs: Shortest Paths)
26 Tue 21 Apr New Road (pag 35, Graphs: Shortest Paths)
27 Tue 21 Apr Nesting boxes (pag 36, Graphs: Shortest Paths)
28 Sun 26 Apr MST (pag 38: Graphs: MST and Max-flow)
29 Sun 26 Apr Flow network (pag 40: Graphs: MST and Max-flow)
30 Sun 26 Apr Contagious disease (pag 41: Graphs: MST and Max-flow)
31 Sun 26 Apr Blood transfusion (pag 42: Graphs: MST and Max-flow)
32 Sun 03 May Traversals: Full Binary Trees (pag 47, Trees)
33 Sun 03 May Traversals: Binary Trees (pag 48, Trees)
34 Sun 03 May Drawing Binary Trees (pag 49, Trees)
35 Sun 10 May BST (pag 47, Sets and Dictionaries)
36 Sun 10 May Merging BSTs (pag 48, Sets and Dictionaries)
37 Sun 10 May AVL (pag 50, Sets and Dictionaries)
38 Sun 17 May Hash function (pag 19, Hashing)
39 Sun 17 May Simple cryptographic hash (pag 35, Cryptography)
40 Sun 17 May Simple RSA (pag 36, Cryptography)
41 Sun 24 May Multiplication (Pag 46, Fast Fourier Transform)
42 Sun 24 May Polynomial evaluation (Pag 47, Fast Fourier Transform)

Problemes resolts (identifiqueu-vos amb DNI%373)
DNI%373 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
008
016
031
038
043
057
060
065
076
085
091
092
093
098
120
122
127
133
144
148
154
170
179
180
190
197
208
217
227
238
248
250
252
254
273
278
281
295
297
302
310
311
316
323
328
372