-
5/19/2018 Links for competitive programming
1/3
OPCENITO:
1. HSIN: http://www.hsin.hr/ 2. HONI: http://www.hsin.hr/honi 3.
USACO: http://www.usaco.org/ 4. TopCoder: http://www.topcoder.com/
5. TopCoder Forum: http://apps.topcoder.com/forums/ 6. TopCoder
Algorithm Tutorials:
http://www.topcoder.com/tc?d1=tutorials&d2=alg_index&module=Static
7. SPOJ: http://www.spoj.com/
8. CodeChef: http://www.codechef.com/ 9. CodeForces:
http://codeforces.com/ 10. Senior Computer Team:
https://activities.tjhsst.edu/sct/lectures.php 11. Rosalind:
http://rosalind.info/problems/list-view/?location=algorithmic-heights
12. LightOJ: http://lightoj.com/login_main.php 13. Kategorizirani
problemi: http://www.ahmed-aly.com/Categories.jsp 14. Awesome
Awesomeness: https://github.com/bayandin/awesome-awesomeness 15.
Quora: http://www.quora.com/ 16. MIT OpenCourseWare:
http://ocw.mit.edu/index.htm 17. Interactive Python:
http://interactivepython.org/runestone/static/pythonds/index.html
18. USACO Training: http://cerberus.delosent.com:791/usacogate
STRUKTURE PODATAKA:
QUEUE: 1.
http://community.topcoder.com/tc?module=Static&d1=tutorials&d2=dataStructures
2. http://en.wikipedia.org/wiki/Queue_%28abstract_data_type%29 3.
http://community.topcoder.com/tc?module=Static&d1=tutorials&d2=graphsDataStrucs2#queue
4. vidi CLRS, Skiena-u i Kusalica
STACK: 1.
http://community.topcoder.com/tc?module=Static&d1=tutorials&d2=dataSt
ructures 2.
http://en.wikipedia.org/wiki/Stack_%28abstract_data_type%29 3.
http://community.topcoder.com/tc?module=Static&d1=tutorials&d2=graphsDataStrucs2#stack
4. vidi CLRS, Skiena-u i Kusalica
HEAP: 1. http://en.wikipedia.org/wiki/Heap_%28data_structure%29
2. vidi CLRS i Skiena-u
SEGMENT TREE(aka. TOURNAMENT): 1.
http://community.topcoder.com/tc?module=Static&d1=tutorials&d2=lowestCommonAncestor#Segment_Trees
2. http://en.wikipedia.org/wiki/Segment_tree 3.
http://se7so.blogspot.com/2012/12/segment-trees-and-lazy-propagation.html
4. vidi Kusalica
BINARY INDEXED TREE(aka. FENWICK): 1.
http://community.topcoder.com/tc?module=Static&d1=tutorials&d2=binaryIndexedTrees
2.
http://kartikkukreja.wordpress.com/2013/12/02/range-updates-with-bit-fenwick-tree/
-
5/19/2018 Links for competitive programming
2/3
3.
http://programmingcontests.quora.com/Tutorial-Range-Updates-in-Fenwick-Tree
4.
http://cs.stackexchange.com/questions/10538/bit-what-is-the-intuition-behind-a-binary-indexed-tree-and-how-was-it-thought-a
5. vidi Kusalica
GRAFOVI:
OPCENITO: 1. http://wiki.xfer.hr/grafovi/ 2.
http://community.topcoder.com/tc?module=Static&d1=tutorials&d2=graphs
DataStrucs1 3. Matrica susjedstva:
http://wiki.xfer.hr/matrica_susjedstva/ 4. Matrica susjedstva:
http://en.wikipedia.org/wiki/Adjacency_matrix 5. Lista susjedstva:
http://en.wikipedia.org/wiki/Adjacency_list 6. vidi CLRS, Skiena-u
i Kusalica
BFS:1.
http://community.topcoder.com/tc?module=Static&d1=tutorials&d2=graphs
DataStrucs2#breadth 2.
http://en.wikipedia.org/wiki/Breadth-first_search 3.
http://www3.cs.stonybrook.edu/~skiena/combinatorica/animations/search.html
4. vidi CLRS, Skiena-u i Kusalica
DFS:1.
http://community.topcoder.com/tc?module=Static&d1=tutorials&d2=graphs
DataStrucs2#depth 2.
http://en.wikipedia.org/wiki/Depth-first_search 3.
http://www3.cs.stonybrook.edu/~skiena/combinatorica/animations/search.html
4. vidi Kusalica
Dijkstra: 1.
http://community.topcoder.com/tc?module=Static&d1=tutorials&d2=graphsDataStrucs3#dijkstra
2. http://en.wikipedia.org/wiki/Dijkstra%27s_algorithm 3.
https://www.cs.usfca.edu/~galles/visualization/Dijkstra.html 4.
vidi CLRS, Skiena-u i Kusalica
MATEMATIKA:
GCD i LCM: 1.
http://en.wikipedia.org/wiki/Greatest_common_divisor 2.
http://en.wikipedia.org/wiki/Least_common_multiple 3. vidi CLRS,
Skiena-u i Kusalica
DINAMICKO PROGRAMIRANJE:
1.
http://community.topcoder.com/tc?module=Static&d1=tutorials&d2=dynProg
2. http://people.cs.clemson.edu/~bcdean/dp_practice/ 4.
http://en.wikipedia.org/wiki/Dynamic_programming 5. vidi CLRS,
Skeina-u i Kusalica
OSTALO:
BINARY SEARCH: 1.
http://community.topcoder.com/tc?module=Static&d1=tutorials&d2=binarySearch
-
5/19/2018 Links for competitive programming
3/3
2. http://en.wikipedia.org/wiki/Binary_search_algorithm
BIT MANIPULATION: 1.
http://community.topcoder.com/tc?module=Static&d1=tutorials&d2=bitManipulation
2.
http://zobayer.blogspot.com/2009/12/bitwise-operations-in-cc-part-1.html
RECURSION:1.
http://community.topcoder.com/tc?module=Static&d1=tutorials&d2=recurs
ionPt1
2. http://en.wikipedia.org/wiki/Recursion 3. vidi CLRS, Skiena-u
i Kusalica
