peace on you all. I have this problem now i don't know how he reached to the final from i'm not good at math in some things so i couldn't understand the proof. this is the problem. Know about the expected value i will write down some notes i concluded from my previous blog.

1- the problem want's the expected minimum value in a k-element subset of [1, 2, ..., n].

2- i see that i have 3 element at each subset and my array [1, 2, ..., n] has n element in it does it mean i have 1/3 chances to get minimum element at array of size n so n * (1/k). Now that what i could reach to compare it to the final from of the prof of this problem But the final form is equal to (N+1)/(K+1) of this function F(N, K).

any explanation but with some easy prof. cause i didn't understand by math(words).

thanks for your time.

Hello every body good day to you . I'm trying to solve this problem and this Is my approach solution for this E. Shortest Path problem
can any one help me to solve it. I Want the idea not the code. thank in advance :).

UPD: I have successfully manged to solve this problem but with the half of its prof i can't mange to make my code faster my final time is 2556 ms :)

Hello every body Good day to you :) Does any one Know Why Ahmed Aly Site Doesn't Work thanks All .

UPD the Site is Working Now thank you all :)

Hello Every body I'm trying solve this problem ADASEA — Ada and Island I tried to understand what it want but I can't.

their is some meanings that i can't understand :

-- considering equal probability for all coordinates

-- so she has asked you to tell her the expected size of island .

All I want is to know what each word mean and if some one could explain the last two test Cases . I Would be Grateful .

The Last thing I Want to do is to thank Errichto for his Video Algorithms Lecture #1 — Sums and Expected Value.