### YouKn0wWho's blog

By YouKn0wWho, 4 weeks ago, ,

A. Perfect Points

Author: YouKn0wWho

Tutorial
Solution

B. String is not that Easy

Author: YouKn0wWho

Tutorial
Solution

C. XOR Partition

Author: YouKn0wWho

Tutorial
Solution

D. Permutations and Divisors

Author: YouKn0wWho

Tutorial
Solution

E. Playing On A Directed Graph

Author: YouKn0wWho

Tutorial
Solution

F. Ant-Man And The Polygon

Author: YouKn0wWho

Tutorial
Solution

G. Enormous Product

Author: YouKn0wWho

Tutorial
Solution

H. Subset AND

Author: YouKn0wWho

Tutorial
Solution

I. Distinct Permutations

Author: foyaz05

Tutorial
Solution

J. The Selection

Author: YouKn0wWho

Tutorial
Solution

K. Mr Makor And His Friends

Author: ovis96

Tutorial
Solution

L. Expected Oddness

Author: mk_shahriar

Tutorial
Solution

• +36

 » 4 weeks ago, # |   0 When and how to submit for practice on toph? Is there a special procedure or we can do it after contest?
•  » » 4 weeks ago, # ^ | ← Rev. 2 →   +3 $-$ Is there a special procedure?$-$ NoProblems are open now. GL & HF!
•  » » » 4 weeks ago, # ^ |   0 Okay thanks. Is it configurable ( and hence only admins/ problem setters can allow submissions after contest )?I ask, because I am unable to submit for another contest that I gave previously. I am new to toph.
•  » » » » 4 weeks ago, # ^ |   0 Yes, it is configurable.
 » 4 weeks ago, # | ← Rev. 2 →   0 In problem E's editorial for the Bellman-Ford solution, I don't think it is correct to say that we find shortest distance from 1 as it may happen that there doesn't exist a path from 1 to some vertex. It is more like we initialize the distance of all vertices (instead of just only the source to 0) and then run an algorithm similar to Bellman-Ford.UPD: Here's my code: https://ideone.com/Z5ylfX
•  » » 4 weeks ago, # ^ |   0 Uh! My bad! Sorry. The editorial is updated. Thanks!
•  » » » 4 weeks ago, # ^ |   +5 Its kinda still wrong, as you take the shortest path from the vertex to itself in case there's no other incoming edge into it. I think its more like $P_i$ = the shortest path to the vertex i from any vertex (including itself). In this case, the final value of any vertex comes out to be <= 0.Anyways, I find it a little strange that even after solving a problem I'm not allowed to click the view editorial button on the problem page on TOPH as it says my achievements won't be considered in case I unlock it.
 » 5 days ago, # | ← Rev. 2 →   0 In problem A , 2nd line .... y % (c+1) = c : c>=1 3rd line .... y % c = c-1 : c>=2How can u say such ? What is the logic behind it ? For example let y=11, c=5. So, 11 % 6 = 5, that doesn't mean that 11%5 =4 .