and 8th is 9, 7 is 15
Nope, I am pretty sure about it.
also for 6th i am getting 595
Why didn’t you give the answer 11 and 12. You could have randomly written any answer as there is no negative marking.
these are my answers. plz share ur answers
1.60
2.14
3.30
4.104
5.199
6.593
7.15
8.10
9.144
10.21
11.86
12.109
I’m in class 11…
7th is 15
8th is 10
9th is 145
I’ll tell you the explanations when I get the questions.
btw when will the results come?
Questions 1-8 are definitely correct and also ques 10 and Q9 is wrong, not sure about the rest.
- 84
- 62
- 51
- 104
- 199
- 593
- 15
- 10
- 148
- 21
- 105
- 145
Can someone give the test cases of the last question.
If anyone wrote it down.
i have the explanation take the minimum H value person and make him the seeker for that many round then each H value goes down by minimum H and thus ans is {min H}+{max H after substracting min H from it}
the above will just give u the max H value in the list
The explanation is simple.
Consider the sum (S) of the number of times a person wants to be a hider.
Notice that in each round, this sum decreases by N-1
So the final answer is [S/(N-1)] + 1 where [] is greatest integer function
1 Like
I am pretty sure that the max value of H[n] will give u the answer
Getting 595 for question 6.plz explain logic of last question
No it won’t give the max. For example, take n = 3 and h[1] = 1, h[2] = 1
and h[3] = 1 .
The answer in this case is not 1 but the answer is two. You calculate that yourself.
In amritsar i was the only one. Plus the test centre was so damn difficult to get to
1 Like
Let’s put all the people in accommodation B. Note the sum of distances. This definitely can’t be the shortest.
You need to push min: 2, max: 5 people from B to A.
Find B[i]-A[i] for each i (with sign) and arrange in descending order.
The top 5 are the ones you will push from B to A to get the shortest distance.