PRATA (Spoj) Problem

#1

what may be the end condition for max time
i.e. how to find the worst-case time taken

#2

@vivekpatel You just have to lower bound in the array.

#3

@vivekpatel Iā€™m unable to understand your doubt

#4

please see my code

#5

@vivekpatel Accha for this if you are using binary search it would take nlogn time

#6

@vivekpatel You are taking int as a data type take it long long as it may overflow

#7

what is the problem in my code is my logic correct

#8

even if I am taking not using long int then I am not getting correct answer

#9

@vivekpatel Use long long int

#10

I feel your logic is correct but your implementation might be wrong

#11

sir please check the code

#12

@vivekpatel since this is a really simple question I would recommend you to debug your errors yourself otherwise you will not learn.

#13

Sir I have really tried for long time

#14

Please give me hint other wise
I have to use long long int

#15

@vivekpatel let me go through your code again. And do update the variables with long long int

1 Like
#16

@vivekpatel the value of r which you are calculating is wrong.
R has to be lowestrank * ( prata*prata+1)/2

#17

Sir can you explain me That I was asking at first

#18

@vivekpatel Do check your code once again and do repeat silly mistakes like this.

1 Like
#19

even now I am not getting correct answer

#20

@vivekpatel Use long long int every place. Your answer might overflow. It is possible that you can get wrong answer because of that