Thread: Nearest divisible number of n by k

I am new to programming so I have a problem, I have a task that says enter n and k without using any loops find the number that is closest to and divisible by k , number can only be bigger then n.
Only thing that I can think of is

Code:

if (n%k==0){
    found_number=n;
}else {
    while(1){
    n++;
    if (n%k==0){
        found_number=n;
        break;
        }
    }
}

If 'n' is not evenly divisible by 'k', there will be a remainder. Perhaps this remainder will be useful in determining the result.