MCPcopy Create free account

hub / github.com/Abhishek-Saini/educational / functions

Functions2,330 in github.com/Abhishek-Saini/educational

↓ 2 callersFunctionscd
cses/sorting_and_searching/Sliding_Median.cpp:17
↓ 2 callersFunctionscd
cses/sorting_and_searching/Array_Division.cpp:17
↓ 2 callersFunctionscd
cses/sorting_and_searching/Collecting_Numbers.cpp:17
↓ 2 callersFunctionscd
cses/sorting_and_searching/Playlist.cpp:17
↓ 2 callersFunctionscd
cses/sorting_and_searching/Josephus_Problem_II.cpp:17
↓ 2 callersFunctionscd
cses/sorting_and_searching/Nearest_Smaller_Values.cpp:17
↓ 2 callersFunctionscd
cses/sorting_and_searching/Towers.cpp:17
↓ 2 callersFunctionscd
cses/sorting_and_searching/Distinct_Numbers.cpp:17
↓ 2 callersFunctionscd
cses/advanced/Task_Assignment.cpp:17
↓ 2 callersFunctionscd
cses/advanced/Hamming_Distance.cpp:17
↓ 2 callersFunctionscd
cses/advanced/Signal_Processing.cpp:17
↓ 2 callersFunctionscd
cses/dp/Counting_Towers.cpp:17
↓ 2 callersFunctionscd
cses/dp/Rectangle_Cutting.cpp:17
↓ 2 callersFunctionscd
cses/dp/Money_Sums.cpp:17
↓ 2 callersFunctionscd
cses/dp/Increasing_Subsequence.cpp:17
↓ 2 callersFunctionscd
cses/dp/Counting_Tilings.cpp:17
↓ 2 callersFunctionscd
cses/mathematics/Distributing_Apples.cpp:17
↓ 2 callersFunctionscd
cses/mathematics/Counting_Necklaces.cpp:17
↓ 2 callersFunctionscd
cses/mathematics/Grundy_s_Game.cpp:17
↓ 2 callersFunctionscd
cses/graph/Planets_Cycles.cpp:17
↓ 2 callersFunctionscd
cses/graph/Monsters.cpp:17
↓ 2 callersFunctionscd
cses/graph/Knight_s_Tour.cpp:17
↓ 2 callersFunctionscd
cses/graph/Labyrinth.cpp:17
↓ 2 callersFunctionscd
cses/graph/Counting_Rooms.cpp:17
↓ 2 callersFunctionscd
cses/tree/Subordinates.cpp:17
↓ 2 callersFunctionscd
atcoder_educational_dp_problems/B_Frog_2.cpp:17
↓ 2 callersFunctionscd
codeforces/round_907/C_Smilo_and_Monsters.cpp:16
↓ 2 callersFunctionscd
codeforces/round_907/F_A_Growing_Tree.cpp:16
↓ 2 callersFunctionscd
codeforces/round_907/A_Sorting_with_Twos.cpp:16
↓ 2 callersFunctionscd
codeforces/round_edu_162/A_Moving_Chips.cpp:16
↓ 2 callersFunctionscd
codeforces/round_edu_162/D_Slimes.cpp:16
↓ 2 callersFunctionscd
codeforces/round_922/E_ace_5_and_Task_Order.cpp:16
↓ 2 callersFunctionscd
codeforces/round_922/D_Blocking_Elements.cpp:16
↓ 2 callersFunctionscd
codeforces/round_922/B_Minimize_Inversions.cpp:16
↓ 2 callersFunctionscd
codeforces/round_edu_159/C_Insert_and_Equalize.cpp:16
↓ 2 callersFunctionscd
codeforces/round_edu_159/A_Binary_Imbalance.cpp:16
↓ 2 callersFunctionscd
codeforces/round_912/C_Theofanis_Nightmare.cpp:16
↓ 2 callersFunctionscd
codeforces/round_912/D_1_Maximum_And_Queries_easy_version.cpp:16
↓ 2 callersFunctionscd
codeforces/round_912/B_StORage_room.cpp:16
↓ 2 callersMethodupdate
cses/range_queries/Pizzeria_Queries.cpp:101
↓ 2 callersMethodupdate
atcoder_educational_dp_problems/W_Intervals.cpp:140
↓ 2 callersMethodupdate
codeforces/round_edu_165/E_Unique_Array.cpp:130
↓ 2 callersMethodupdate
codeforces/round_922/D_Blocking_Elements.cpp:126
↓ 1 callersMethodC
cses/mathematics/Distributing_Apples.cpp:175
↓ 1 callersMethodC
cses/mathematics/Christmas_Party.cpp:175
↓ 1 callersFunctionChangeFen
cses/string/Substring_Distribution.cpp:143
↓ 1 callersMethodGetMaxFlow
cses/advanced/Task_Assignment.cpp:108
↓ 1 callersMethodGetMaxFlow
cses/advanced/Distinct_Routes_II.cpp:108
↓ 1 callersMethodGetMaxFlow
cses/advanced/Parcel_Delivery.cpp:109
↓ 1 callersFunctionHLD
A[] is flat array which is used by seg tree while building Heavy Light Decomposition Cost can be some value associated with the node/path till now, no
cses/tree/Path_Queries_II.cpp:168
↓ 1 callersFunctionHLD
A[] is flat array which is used by seg tree while building Heavy Light Decomposition Cost can be some value associated with the node/path till now, no
codeforces/round_edu_159/F_Trees_and_XOR_Queries_Again.cpp:246
↓ 1 callersFunctionKMP
KMP Algorithm
cses/string/String_Matching.cpp:42
↓ 1 callersFunctionReadFen
cses/range_queries/Range_Update_Queries.cpp:43
↓ 1 callersFunctionZ
Z - Algorithm ZAlgorithm
cses/string/Finding_Borders.cpp:41
↓ 1 callersFunctionZ
Z - Algorithm
cses/string/Finding_Periods.cpp:41
↓ 1 callersMethodaddBiEdge
cses/graph/Police_Chase.cpp:67
↓ 1 callersMethodaddEdge
cses/advanced/Reachability_Queries.cpp:47
↓ 1 callersMethodaddEdge
cses/graph/Distinct_Routes.cpp:64
↓ 1 callersMethodaddEdge
cses/graph/Download_Speed.cpp:60
↓ 1 callersMethodaddEdge
cses/graph/Coin_Collector.cpp:47
↓ 1 callersMethodaddEdge
cses/graph/Flight_Routes_Check.cpp:47
↓ 1 callersMethodaddEdge
cses/graph/Planets_and_Kingdoms.cpp:47
↓ 1 callersMethodaddString
cses/string/Word_Combinations.cpp:173
↓ 1 callersMethodaddString
codeforces/round_edu_159/E_Collapsing_Strings.cpp:52
↓ 1 callersMethodapplyToNode
codeforces/round_edu_165/E_Unique_Array.cpp:63
↓ 1 callersMethodapplyToNode
codeforces/round_922/D_Blocking_Elements.cpp:64
↓ 1 callersFunctionbitSet
atcoder_educational_dp_problems/O_Matching.cpp:171
↓ 1 callersMethodbuild
cses/range_queries/Dynamic_Range_Minimum_Queries.cpp:101
↓ 1 callersMethodbuild
cses/range_queries/Increasing_Array_Queries.cpp:112
↓ 1 callersMethodbuild
A[] input array should be ready before calling this
cses/range_queries/Prefix_Sum_Queries.cpp:140
↓ 1 callersMethodbuild
cses/range_queries/List_Removals.cpp:104
↓ 1 callersMethodbuild
A[] input array should be ready before calling this
cses/range_queries/Polynomial_Queries.cpp:139
↓ 1 callersMethodbuild
A[] input array should be ready before calling this
cses/range_queries/Range_Updates_and_Sums.cpp:139
↓ 1 callersMethodbuild
A[] input array should be ready before calling this
cses/range_queries/Subarray_Sum_Queries.cpp:140
↓ 1 callersMethodbuild
cses/range_queries/Hotel_Queries.cpp:101
↓ 1 callersMethodbuild
cses/tree/Path_Queries_II.cpp:96
↓ 1 callersMethodbuild
intial call with root, parent sth like (1,-1) to build
cses/tree/Finding_a_Centroid.cpp:51
↓ 1 callersMethodbuild
intial call with root, parent sth like (1,-1) to build
cses/tree/Fixed_Length_Paths_I.cpp:68
↓ 1 callersMethodbuild
cses/tree/Subtree_Queries.cpp:102
↓ 1 callersMethodbuild
cses/tree/dfs_numbering.cpp:102
↓ 1 callersMethodbuild
atcoder_educational_dp_problems/Q_Flowers.cpp:104
↓ 1 callersMethodbuild
int findFirstOneTree(int st, int end, int ind, int l, int r) { if(st == end and l == r) return l; int mid; mid = st + (end - st) / 2; if(r <= mid) ret
codeforces/round_edu_165/E_Unique_Array.cpp:127
↓ 1 callersMethodbuild
int findFirstOneTree(int st, int end, int ind, int l, int r) { if(st == end and l == r) return l; int mid; StoreType p1; mid = st + (end - st) / 2; if
codeforces/round_edu_159/F_Trees_and_XOR_Queries_Again.cpp:167
↓ 1 callersMethodbuildNode
codeforces/round_edu_165/E_Unique_Array.cpp:60
↓ 1 callersMethodbuildNode
codeforces/round_922/D_Blocking_Elements.cpp:61
↓ 1 callersFunctionbuildSparse
cses/tree/Path_Queries_II.cpp:130
↓ 1 callersFunctionbuildSparse
codeforces/round_edu_159/F_Trees_and_XOR_Queries_Again.cpp:208
↓ 1 callersFunctionbuildSuffixArray
cses/string/Repeating_Substring.cpp:48
↓ 1 callersFunctionbuildSuffixArray
cses/string/Substring_Order_I.cpp:48
↓ 1 callersFunctionbuildSuffixArray
cses/string/Substring_Distribution.cpp:48
↓ 1 callersFunctionbuildSuffixArray
cses/string/Distinct_Substrings.cpp:48
↓ 1 callersFunctionbuild_x
cses/range_queries/Forest_Queries_II.cpp:54
↓ 1 callersFunctionbuild_y
cses/range_queries/Forest_Queries_II.cpp:40
↓ 1 callersMethodcanMade
codeforces/round_edu_159/F_Trees_and_XOR_Queries_Again.cpp:96
↓ 1 callersFunctioncompute
cses/advanced/Houses_and_Schools.cpp:45
↓ 1 callersFunctioncompute
cses/advanced/Subarray_Squares.cpp:46
↓ 1 callersMethodcutAndPaste
cses/advanced/Cut_and_Paste.cpp:156
↓ 1 callersFunctiondot
cses/advanced/Monster_Game_II.cpp:42
↓ 1 callersMethodfindAns
cses/string/Word_Combinations.cpp:187
↓ 1 callersMethodfindAns
codeforces/round_edu_159/E_Collapsing_Strings.cpp:68
← previousnext →301–400 of 2,330, ranked by callers