000			01289nam a22003137a 4500
003			IIITD
005			20240708152537.0
008			230624b xxu||||| |||| 00| 0 eng d
020			_a9788193754306
040			_aIIITD
082			_a005.1 _bNAR-M
100			_aNarang, Prateek
245			_aMastering competitive programming _cby Prateek Narang .. [et al.]
260			_aNew Delhi : _bCoding Blocks, _c©2018
300			_a340 p. ; _c28 cm.
505			_t1 Generic Programming & STL _t2 Mathematics _t3 Number Theory _t4 Binary Search (Divide & Conquer) _t5 Greedy Algorithms _t6 Recursion & Backtracking Segment Tree (Divide & Conquer) _t7 Binary Indexed Tree/Fenwick Tree _t8 Binary Indexed Tree/Fenwick Tree _t9 Dynamic Programming _t10 MO's Algorithm _t11 Graph Algorithms _t12 Game Theory _t13 Geometric Algorithms _t14 Fast Fourier Transform _t15 Heavy Light Decomposition (HLD)
650			_aDynamic programming
650			_aComputer programming
650			_aNumber theory
700			_aAggarwal, Deepak
700			_aRanjan, Rajkishor
700			_aVishal, Panwar
700			_aAgrawal, Aditya
700			_aLadia, Mayank
700			_aGupta, Saransh
700			_aRawat, Shubham
710			_aAgrawal, Harkdik
942			_2ddc _cBK _02
999			_c171383 _d171383