Codeforces Problem 2034A QCF brute force , chinese remainder theorem , mathnumber theory*800

// we have to cal and find the value of m it is said that the value of m is the smallest number of
// a,b after that we got the value of m , there are two conditions mostly the m has to greater than
// a and b aleast one value
// then the m divide by a and b the remainder should be same of both the a&b
// and if this is we have solved the riddle and unlocked the treasure lock !!

Видео Codeforces Problem 2034A QCF brute force , chinese remainder theorem , mathnumber theory*800 канала Supreme Pranav