Today while I was solving a problem based on dfs, I found something unusual and I am still in doubt, how did that happen!
Problem Link : http://codeforces.com/problemset/problem/463/D
My AC Solution : http://codeforces.com/contest/463/submission/13773175
Problem Faced : In my solution, I have used an array a to take input but in the second test case provided by judge, n = 66 and k = 4 , so my program is going to access some memory location at a which is certainly out of bound! That's why I wonder, how my solution got AC?
Positive suggestions are welcome :)