Yup, that's right

That's inspiring. Congrats! I'm curious about how you deal with personal life (stuff like friends, job, etc) and cp?

I think this can be a much simpler implementation from Array Description problem following the same idea you presented

Can you explain your idea pls?

Very simple approach, a multiset didnt come to my mind in the moment, I did weird stuff with a map, thanks a lot, ill give it a try

How did you solve C?

GreedyForces (?) It was a nice round, thanks!

shashankag I learned to do bfs on matrix with this practical tutorial, I think this could be very useful as you learn the basis and then you implement the code the way in which you feel most comfortable

I've solved B using bfs, there's a pattern in the distance when you go over k=0,1,2...n*m-1 the minimum distance Rahul can achieve starts at the beginning and then it propagates to it's neighbors increasing by one

Thanks!! lli was defined as double, but the precision was the true issue :( thanks, it'll be an unforgettable lesson :c

Nope, a and b is the log10(x*(10^p)) (log of the whole number represented in the problem) and with log properties, you rewrite it as log10(x)+(p*log10(10))

Does anyone knows why my submission for A is getting WA? As far as I know, it's mathematically correct but I can't figure out a test case that breaks it, thanks a lot. (The idea behind the solution is to represent both numbers as x+(10^p) and then take it log10 to reduce its size and compute the number) (also note that lli is defined as double)

Problems were great anyway, thanks

When will be available the tutorial? Thanks a lot :)