Minimum among the larger (Editorial)

The input number $n$ might initially be divisible by 7. However, we need to find a number greater than the input, which is divisible by 7. Therefore, we will first increase $n$ by 1. Then, in a loop, until $n$ is not divisible by 7, we will increase $n$ by 1.

Implementation of the algorithm

Read the input value $n$.

scanf("%d", &n);

Increase $n$ by 1.

n++;

While $n$ is not divisible by 7, increase $n$ by 1.

while (n % 7 != 0) n++;

Output the answer.

printf("%d\n", n);