# [SOLVED 100%] To Divide or Not To Divide CodeChef Solution - July long 2022

## Problem

Alice likes all the numbers which are divisible by $A$. Bob does not like the numbers which are divisible by $B$ and likes all the remaining numbers. Determine the smallest number greater than or equal to $N$ which is liked by both Alice and Bob. Output $-1$ if no such number exists.

### Input Format :- To divide or not to divide solution

• The first line contains a single integer $T$ — the number of test cases. Then the test cases follow.
• The first and only line of each test case contains three space-separated integers $A$$B$ and $N$ — the parameters mentioned in the problem statment.

### Output Format :-  To Divide or Not To Divide

For each test case, output the smallest number $\ge$ $N$ which is divisible by $A$ and is not divisible by $B$. Output $-1$ if no such number exists.

### Constraints :- To divide or not to divide codechef

• $1 \leq T \leq 1000$
• $1 \leq A, B, N \leq 10^9$

### Sample 1:

Input
Output
3
5 2 11
4 3 24
7 7 100

15
28
-1


### Explanation:

Test case $1$: $15$ is the smallest number $\ge$ $11$ which is divisible by $5$ and is not divisible by $2$.

Test case $2$: $28$ is the smallest number $\ge$ $24$ which is divisible by $4$ and is not divisible by $3$.

Test case $3$: There does not exist any number which is divisible by $A = 7$ and is not divisible by $B = 7$.

### [SOLVED 100%] To Divide or Not To Divide CodeChef Solution - July long 2022

#include <iostream>
using namespace std;

int main() {
int t;
cin>>t;
while(t--){
int a, b, n;
cin>>a>>b>>n;
if(a%b==0){
cout<<"-1"<<endl;
continue;
}
int x = n;
if(x%a != 0){
x = n+a-(x%a);
}
while(!(x%a==0 && x%b!=0)){
x = x+a;
}
cout<<x<<endl;

}
return 0;
}

To Divide or Not To Divide CodeChef Solution
To Divide or Not To Divide CodeChef Solution
To Divide or Not To Divide CodeChef Solution

1. 1. javascript:alert1