Original subtitles

Whoo!

So let's continue practicing, guys.

So in this exercise, what you have to do is to write a program that receives three integers.

OK, that's the first step.

And the program should print the following message divisible.

If in each pair between these three numbers, there is at least one number in each pair, there is at

least one number that can be divided by the other without a remainder.

So once again, three integers and we can take pairs at any time from these three values.

And we need to make sure that at any time there is at least one found that we can take one value and

divided by the other in each pair and it will be divisible without a remainder.

So, for example, let's take a look at a couple of examples.

If we have the following three numbers, five, 10 and 20, then we know that we can print divisible

message to the screen, because in this case, we know that if we take these pair five and 10, then

10 is divided, can be divided by five without a remainder.

And also, if we do it for 20 and ten and also for a 20 and five.

Right.

Twenty divided by five is four without a remainder.

And also with they can look at another example.

Another divisible example is three thirty six and seventy two.

OK, they do not have to be like a ranged from the smallest to the largest.

Right.

It doesn't have anything to do with that.

So basically we could simply use a seventy two, three and then thirty six.

But still in this case if we take pairs, ok, we have one peer to peer and three pairs and, and at

each pair we will have at least we will have basically just one number that can be divided by the other

without a remainder.

But if we will take a look at the following three numbers, for example, two, four seven or five,

seven nine.

Then in both of these cases, we can say that four maybe divided by two without a remainder.

And that's OK.

But seven cannot be divided by two or by four without a remainder.

And it means that not all of the pairs in these three numbers are divisible.

And that's why we should print a non divisible message to the screen and also five seven nine, which

is obviously we cannot find even one pair, even one pair in these three numbers that can be divided.

OK, that you take one number and you can divide it by the other.

So that's basically what you have to do, is simply write a program, get three numbers from the user.

And based on these pairs, OK, probably you will need to use want to use conditions based on these

pairs.

You will need to print corresponding message whether it's divisible.

OK, that's just some terminology that we've created right now or if it's not divisible.

So take your time.

Think about it.

And yeah, I think this is it for this video and I will see you in the solutions.