Time

15:56:32
22 May 2012
Login 
Password 
Remember me
loading...

Classification of tasks

  1. Test problem
  2. Comforting task
  3. Modeling
  4. Number theory
  5. Combinatorics
  6. Probability
  7. Game theory
  8. Graph theory
  9. Long arithmetic
  10. Dynamic programming
  11. Binary search
  12. Greedy algorithm
  13. Other
  14. Geometry
  15. Line program
  16. If... then...
  17. Algorithms on strings
  18. Simple mathematics
  19. Beginners
  20. Depth-first Search (DFS)
  21. Breadth-first Search (BFS)
  22. Topological Sort
  23. Articulation Point
  24. Bridges
  25. Dijkstra Algorithm
  26. Bellman-Ford Algorithm
  27. Floyd-Warshall Algorithm
  28. Transitive Closure
  29. Fundamental Set of Cycles
  30. Euler Cycle
  31. Hamiltonian Cycle
  32. Number of Paths
  33. Connected Components
  34. Strongly Connected Components
  35. Minimal Spanning Tree (MST)
  36. Second MST
  37. Number of MST
  38. Graph Planarity
  39. Maximum Flow
  40. Iteration and recursion
  41. Sequences
  42. GCD, LCM
  43. Euclid Extended Algorithm
  44. Game strategies
  45. Catalan Numbers
  46. Fibonacci Numbers
  47. Sort and sequence
  48. Calculation system
  49. Tricky problem
  50. Full Search
  51. Algorithm Knuth-Morris-Pratt
  52. Matrix
  53. Diophantine equations
  54. Three
  55. Recursion
  56. Two-dimensional arrays
  57. Problems on intervals
  58. Bitwise Operators
Internet portal organizational methods of remote programming competitions for gifted youth education in Ukraine
All material, announcement is published on the website, are the property of their authors and may used only with their consent.
Site created and maintained by Zhytomyr State University named after Ivan Franko