You can use several words in query to find by all of them at the same time. In addition, if you are lucky search understands word forms and some synonyms. It supports search by title and author. Examples:

  • 305 — search for 305, most probably it will find blogs about the Round 305
  • andrew stankevich contests — search for words "andrew", "stankevich" and "contests" at the same time
  • user:mikemirzayanov title:testlib — search containing "testlib" in title by MikeMirzayanov
  • "vk cup" — use quotes to find phrase as is
  • title:educational — search in title

Results

1.
Tutorial for Codechef's TREEEDGE (LCA using binary lifting)
By Mooncrater, history, 7 years ago, In English
Tutorial for Codechef's TREEEDGE (LCA using binary lifting) Hello all, I was trying to learn about binary lifting, and came across [this codechef question](https://www.codechef.com/problems/TREEDGE). Gist of the question: You're given a weighted tree. You are given $q$ operations, which are of the format $u,v,x$, where $u,v$ are the nodes of the tree, for which we have to find the maximum weight path which joins them. $u,v$ are never each other's ancestors. An edge of weight $x$ can be used to connect the subtrees of $u$ and $v$. Gist of my solution **Case 1: Do not use $x$ :** If we do not connect $u$ and $v$'s subtrees, then we'll have to find their LCA, and the answer would be $dist(u,lca)+dist(v,lca)$. LCA can be found using binary lifting. The recurrence for binary lifting is: $$dp[node][parent] = dp[dp[node][parent-1]][parent-1]$$ And the distance recurrence is: $$distance[node][parent] = distance[node][parent-1]+distance[dp[node][parent-1]][parent-1]$$ These can be built in the same `for` loop as done by me i...
from the root - `mcd`: Saves the distance of the maximum distant node in the subtree for the i'th, )) ; memset(mcd,0,sizeof(mcd)) ; dp[1][0][0] = 0 ;//parent of node 1 is 0 dp[1][0][1, **Methods:** - `dfs1`: As named, does a $DFS$. AIM: To create `dp[i][0][0]`, `dp[i][0][1]`, `mcd, - `mcd`: Saves the distance of the maximum distant node in the subtree for the i'th node. Could be, ll dfs1(int node,int par) {// to create the depth and mcd arrays ll mcdV = 0 ; for(auto, typedef long long ll ; #define pii pair ll depth[MAXN], mcd[MAXN]; ll dp[MAXN][20][2

Full text and comments »

  • Vote: I like it
  • 0
  • Vote: I do not like it

2.
Code Gladiator Solution
By TSoC_Code_Gladiators, 3 years ago, In English
Code Gladiator Solution Access solutions of **_"Code Gladiators"_** Contest organized on _HackerRank_ and held by **TSoC** in IIITNR. WEEK-1 ------ #### [Rank Realization](https://www.hackerrank.com/contests/code-gladiatorspractice/challenges/rank-realization) <spoiler summary="Explanation"> - **Problem**: Determine the count of participants with ratings strictly higher than Divyansh's rating. - **Input**: - Divyansh's rating (r). - Number of participants (n). - Array arr containing ratings of other participants. - **Approach**: - Read r, n, and arr. - **Counting Higher Ratings**: &mdash; Initialize a counter variable counter to 0. &mdash; Iterate through each rating in arr. &mdash; If the rating is strictly higher than r, increment counter. - **Output**: - Print the value of counter, representing the number of participants with ratings strictly higher than Divyansh. </spoiler> <spoiler summary="Code"> Python ```python r = int(input()) n = int(in...
Statement**: Awatansh wants to win a McD gift voucher by solving a problem Divyansh got stuck on. The, - **Problem Statement**: Awatansh wants to win a McD gift voucher by solving a problem Divyansh got

Full text and comments »

  • Vote: I like it
  • -3
  • Vote: I do not like it