In google farewell round B I was solving 2nd problem and stuck at the part where I need to find min k for which : (k*d)%n = x where d<=n-1 and n<=1e9. Can any one tell how to find it in optimal way. Thank in advance!