Thanks to all…
I am fed up of solving this question, Approx to 20 submissions but WA… 
1 Like
Lol! The same haalat in XORSUB
Too tough questions this time! o.O
1 Like
mail them to admin…
1 Like
Yahh in XORSUB too, able to score only 30 points…
Yes really tough competition, i though i will do well but i am able to solve only CAPPLE for 100 points…
Still need a lot of practice… !!
1 Like
And please keep those, and add those to editorial later 
2 Likes
each sanskar is allocated to single follower .
what should be correct answer for this test case:
1 2
0
yes or no ?
answer is accepted for no, but if you see the last statement in problem, “output “yes” if it is possible to divide his sanskars equally amongst his followers” so 0 is allotted to 1st follower and then 2nd follower has nothing, sum is still zero, so shouldn’t that be a yes.
It should be yes… At least that’s what I assumed, and I got AC 
answer is yes only , may be weak test cases .
^ I think I said that too early… 
Points went down to 20 from 100… :’(
1 Like
since N and K have very low value the problem is solvable
Answer should be NO Just corrected
No, you can’t do that
1 Like
Admins please stop adding trivial test cases. We are testing peoples algorithmic skills here. You just added test cases to differentiate no sanskar from sanskars with zero intensity. One could start a philosophical arguement on whether these two are indeed equal, but are we really achieving anything by adding those test cases? Does it really differentiate good programmers from bad ones?
2 Likes
Agreed
0 ≤ intensity of sanskar ≤ 10^5
this constraint clearly state sanskar can have intensity 0 with a valid count.
you know it’s against the rules.
Abe bol mat, firse update kar denge wo
1 Like
Karne de…ab mene modify kar liya hai…solution…;)…
1 Like
Hehe…
1 Like
points went down to 20