![]() |
Presentation |
Pedro Ribeiro - DCC/FCUP |
Name | Problem | Week | Type |
---|---|---|---|
AntonioCunha | UVA 108 | 4 | Ac. Sums + Kadane |
DiogoBarbosa | CodeForces 713 B | 2 | Binary Search (interactive) |
Diogo Cordeiro | CodeForces 508 D | 8 | Euler Path |
Fabio Silva | UVA 12144 | 9 | Shortest Path (adaption) |
GabrielSaraiva | UVA 11572 | 1 | Map (ad-hoc) |
HugoSales | CodeForces 160 D | 9 | MST + DFS |
JoaoNeves | UVA 1203 | 1 | Priority Queue (adaptation) |
JoaoVarelas | SPOJ MATSUM | 4 | 2D Fenwick Trees |
JoaoCorreia | UVA 10245 | 10 | Closest Pair of Points (D&C) |
JoaoDias | SPOJ PPATH | 8 | BFS + Primes |
JoaoSantiago | UVA 166 | 5 | Coin Change (adaptation) |
JoaoRibeiro | UVA 10078 | 10 | Polygon Convexity |
JoaoBento | CodeForces 818 F | 2 | Ternary Search |
NunoTaveira | SPOJ Mixtures | 5 | Dynamic Programming (MCM Ad.) |
PauloSousa | UVA 959 | 6 | DP in DAG |
PedroMota | UVA 11283 | 7 | Trie + DFS |
PedroCosta | SPOJ RACETIME | 3 | SqrtDecomposition |
PedroFerreirinha | SPOJ LITE | 3 | Segment Trees & Lazy Propagation |
PedroFernandes | CodeForces 346 B | 7 | KMP Adap. (or Aho-Corasik) |
TiagoMelo | SPOJ ASSIGN | 6 | Dynamic Programmin (Bitsmaks) |
This choice of problem assignment for the 20 students guarantees 2 problems for each week (each student has previously submitted with success his own problem).
Furthermore, it also highlights the 3 main online judges we used (9 problems from UVA, 5 from CodeForces, 6 from SPOJ).
Pedro Ribeiro - DCC/FCUP | Last update: