|
0
Please do take a look :) |
|
+1
Can anyone help with this statement related to Div.2 problem C ? Why does t have to be less than or equal to y here ? "It can be proved that one "very large" value of t is t = y — that is, if the inequalities are not satisfied for t = y, then they cannot be satisfied for any value of t." |
|
0
It will be awesome if you guys can share the resources and the questions practiced there for those people who won't be able to attend the workshop :) |
|
+9
Why haven't we got the editorials till now ?? They should have been uploaded by now :) |
|
0
Thanks :) |
|
0
So, here are 2 versions of my code: Version 1: I submit this code and I get WA in test case 23 indicating that I am printing the values for another matrix, meaning incorrect values.(although I think that I am printing the correct ones only). CODE : http://ideone.com/P4NLsm Version 2: I now submit this code and I get the same WA in test case 23. But the only change which I did here was that I printed my result vector in ascending order. Here, magically, a 6 is appearing in my output(in place of the largest integer in the output), which wasn't there earlier, i.e., before sorting. Please help !! CODE : http://ideone.com/CZHyJw |
|
+11
can the editorials be uploaded soon ? |
|
0
How do you prove that N = PI / (gcd(A, B, C)) ? |
|
+10
Suppose that I consider n = 5. Now if I am counting the number of odd divisors of (2 * 5 !), then I am getting the odd divisors as (1, 3, 5, 15), which is 4. But in the question, we can see that the answer for n = 5 is 2, i.e., when we are considering the sum of 3 consecutive positive integers(39 + 40 + 41) and the sum of 5 consecutive positive integers(22 + 23 + 24 + 25 + 26). So still stuck.. |
|
0
Can you please explain this one a bit more ? I had got this expression, but unable to proceed any further.. |
|
+1
How do you prove that n is a cathetus of any right triangle ? |
|
0
Thanks a lot :) |
|
0
Auto comment: topic has been updated by rahulpadhy (previous revision, new revision, compare). |
|
0
So can't this question be done using 2 pointers ? |
|
0
Here's an easy, basic procedure which involves checking the gender of the bug using 2 integers, 1 & 2.. Hope, u find it useful :) |
|
0
Answer should be 4 because we need to find the maximum possible sum obtained from the elements in the specified indices(2 + 2 = 4)... But my main concern is as to why I am getting RE for this question... |