Assalomu alaykum, yordam.uz saytimizga xush kelibsiz.
Bu saytda o`zingizni qiziqtirgan savollarga javob olishingiz va o`z sohangiz bo`yicha savollarga javob berishingiz mumkin. Bizning Oilamizga a'zo bo`lganingiz uchun chuqur Minnatdorchilik bildiramiz !!!

ACM ICPC turniri

+1 ovoz
260 marta ko‘rilgan
so‘radi 16 fevral, 18 FAXRIDDIN TOJIBOYEV (306 bal)
ACM ICPC da qatnashiib yuqori o'rin olish uchun nima qilishni maslahat bera olasizlar?
Qaysi kitoblardan tayyorlanish kerak? Kimlar shu musobaqaga tayyorlay oladi, kimlar bilan bog'lansa bo'ladi?
Rahmat

1 ta javob

0 ovoz
javob berdi 19 fevral, 18 Saidolim (3,566 bal)
tanlangan 19 fevral, 18 FAXRIDDIN TOJIBOYEV
 
Eng yaxshi javob

ACM ICPC turniriga tayyorlanish uchun ko`p masala yechish kerak. ACM ga mos sitelar ko`p. 

O`rganishingiz kerak bo`lgan mavzular:

Stacks - to`plamlar
Queues - navbatlar
Priority queue - navbat ustivorligi
Hashmap 
Linked List - Bog`langan ro`yxat
Trees - Daraxtlar
Heaps - Uyumlar
Advanced Trees - Yetakchi daraxtlar
Tries - harakatlar
Segment trees - Segment daraxtlar
Fenwick tree or Binary indexed trees - Frenvik daraxti yoki Binar daraxt
RMQ - Range minimum query
SQRT Decomposition 
Disjoint Data Structure
C++ STL 

Algoritmlar:

Number Theory - Sonlar nazariyasi

Prime Numbers - Tub sonlar
GCD and LCM Euclid’s Algorithm - EKUK, EKUB
Modular Exponentiation - Modulli dajaraga oshirish
Long arithmetic (Multi, Add) - Uzun sonlar arifmetikasi
Efficient Prime Factorization - Samalari Tub sonlarga ajratish
Combinatorics(Probability-Combinations-Permutations-Matrix..) - Kombinatorika

Computational geometry - Hisoblash geometriyasi

Primitive Operations - sodda amallar
Intuition - sezgi
Polygon Inside, Outside - Ko`pburchakning ichida/tashqarisiga yotishi
Implementing CCW 
Immutable Point ADT  
Convex Hull
Closest pair problem
Line intersection - Chiziqlar kesishmasi 

Sorting - Tartiblash (saralash)

QuickSort - Tez saralash
Counting Sort - Sanoqli saralash
Merge Sort - Aralash saralash

Searching - Izlash

Binary Search - Binar izlash
Ternary Search - Ternar izlash

Graph Theory - Graflash nazariyasi

Depth First Search (DFS)
Breadth First Search (BFS)
Dijkstra’s Shortest Path
Minimum Spanning Tree
Ford Bellman
Floyd Warshall
LCA (Lowest Common Ancestor)
Max Flow / Min Cut

Dynamic programming

Knapsack
Matrix chain multiplication
Coin Change
Kadane
Longest increasing Subsequence (with RMQ)

Strings - Satrlar ustida amallar

Z algorithm
Suffix Trees/Arrays
Knuth-Morris-Pratt Algorithm (KMP)
Rabin-Karp Algorithm
Hash

Bit Manipulation

Game theory

Nim game
Grundy numbers
Sprague-Grundy theorem

Optional Advanced Algorithms

AVL Trees
Graph Coloring
Mo's Algorithm
Palindromic Tree
Heavy Light Decomposition
Dynamic Programming by Profile
Rod Cutting
Topological Sorting
DP with Bitmask - Dynamic Programming
Diobhantine Equation - Math
Flood Fill - Graph

To`liq darslar ro`yxatini https://github.com/NAU-ACM/ACM-ICPC-Preparation dan olsa bo`ladi

Tavsiya etilgan kitoblar:

  1. Programming Challenges (book)
  2. Introduction to Algorithms (book) MIT
  3. Algorithms Unlocked (2013 book)
  4. Competitive Programming, 3rd Edition: Steven Halim: Amazon.com: Books
izoh qoldirdi 19 fevral, 18 FAXRIDDIN TOJIBOYEV (306 bal)
Rahmat katta)))

Assalomu alaykum, yordam.uz saytimizga xush kelibsiz.

Bu saytda o`zingizni qiziqtirgan savollarga javob olishingiz va o`z sohangiz bo`yicha savollarga javob berishingiz mumkin.

Bizning Oilamizga a'zo bo`lganingiz uchun chuqur Minnatdorchilik bildiramiz !!!

Telegram kanal YordamUzRss

...