I saw this submission of problem 678A - Johny Likes Numbers and tried to hack it with case n=1000000000 and k=1.
It passes within the problem's time limit 0.5s, but I thought it should be a TLE (I tested on ideone and it runs about 0.91s). I can't think of any reason but CF judge is really fast. Any other ideas?