lostbattle's blog

Codechef cookoff division 1 que : "GukiZ and Candies"
By lostbattle, history, 6 years ago, In English

problem link here :- https://www.codechef.com/COOK97A/problems/GUZAC

for test case :- n=3 k=1 x=2 p1=999999999 the resultant answer is 3000000000(1000000000 + 1000000001+999999999) (as per all accepted codes), but should it not be 2999999997 (999999998+1000000000+999999999) as clearly given pi<=1000000000. I tried hard to understand but couldnt ! can anyone explain me this question ?

  • Vote: I like it
  • 0
  • Vote: I do not like it

»
6 years ago, # |
  Vote: I like it 0 Vote: I do not like it

I believe that pi <= 1000000000 is only for i = 1,2,...k.
But I should agree that it is misleading(

→ Reply
»
6 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Pi <=10^9 is an input constraint only, it doesn't mean all students shouldn't be given more than 10^9 candies

→ Reply