All language subtitles for 13. Divisible 3 Numbers Example - Question

af Afrikaans
sq Albanian
am Amharic
ar Arabic
hy Armenian
az Azerbaijani
eu Basque
be Belarusian
bn Bengali
bs Bosnian
bg Bulgarian
ca Catalan
ceb Cebuano
ny Chichewa
zh-CN Chinese (Simplified)
zh-TW Chinese (Traditional)
co Corsican
hr Croatian
cs Czech
da Danish
nl Dutch
en English
eo Esperanto
et Estonian
tl Filipino
fi Finnish
fr French
fy Frisian
gl Galician
ka Georgian
de German
el Greek
gu Gujarati
ht Haitian Creole
ha Hausa
haw Hawaiian
iw Hebrew
hi Hindi
hmn Hmong
hu Hungarian Download
is Icelandic
ig Igbo
id Indonesian
ga Irish
it Italian
ja Japanese
jw Javanese
kn Kannada
kk Kazakh
km Khmer
ko Korean
ku Kurdish (Kurmanji)
ky Kyrgyz
lo Lao
la Latin
lv Latvian
lt Lithuanian
lb Luxembourgish
mk Macedonian
mg Malagasy
ms Malay
ml Malayalam
mt Maltese
mi Maori
mr Marathi
mn Mongolian
my Myanmar (Burmese)
ne Nepali
no Norwegian
ps Pashto
fa Persian
pl Polish
pt Portuguese
pa Punjabi
ro Romanian
ru Russian
sm Samoan
gd Scots Gaelic
sr Serbian
st Sesotho
sn Shona
sd Sindhi
si Sinhala
sk Slovak
sl Slovenian
so Somali
es Spanish
su Sundanese
sw Swahili
sv Swedish
tg Tajik
ta Tamil
te Telugu
th Thai
tr Turkish
uk Ukrainian
ur Urdu
uz Uzbek
vi Vietnamese
cy Welsh
xh Xhosa
yi Yiddish
yo Yoruba
zu Zulu
or Odia (Oriya)
rw Kinyarwanda
tk Turkmen
tt Tatar
ug Uyghur
Would you like to inspect the original subtitles? These are the user uploaded subtitles that are being translated: 1 00:00:00,660 --> 00:00:01,140 Whoo! 2 00:00:01,620 --> 00:00:04,600 So let's continue practicing, guys. 3 00:00:05,010 --> 00:00:10,980 So in this exercise, what you have to do is to write a program that receives three integers. 4 00:00:11,160 --> 00:00:12,570 OK, that's the first step. 5 00:00:13,020 --> 00:00:17,270 And the program should print the following message divisible. 6 00:00:17,670 --> 00:00:26,460 If in each pair between these three numbers, there is at least one number in each pair, there is at 7 00:00:26,460 --> 00:00:32,370 least one number that can be divided by the other without a remainder. 8 00:00:33,180 --> 00:00:40,140 So once again, three integers and we can take pairs at any time from these three values. 9 00:00:40,410 --> 00:00:47,100 And we need to make sure that at any time there is at least one found that we can take one value and 10 00:00:47,100 --> 00:00:52,620 divided by the other in each pair and it will be divisible without a remainder. 11 00:00:52,650 --> 00:00:56,220 So, for example, let's take a look at a couple of examples. 12 00:00:57,090 --> 00:01:04,650 If we have the following three numbers, five, 10 and 20, then we know that we can print divisible 13 00:01:05,640 --> 00:01:10,740 message to the screen, because in this case, we know that if we take these pair five and 10, then 14 00:01:10,740 --> 00:01:14,640 10 is divided, can be divided by five without a remainder. 15 00:01:15,030 --> 00:01:19,230 And also, if we do it for 20 and ten and also for a 20 and five. 16 00:01:19,230 --> 00:01:19,490 Right. 17 00:01:19,500 --> 00:01:22,680 Twenty divided by five is four without a remainder. 18 00:01:23,430 --> 00:01:26,280 And also with they can look at another example. 19 00:01:26,290 --> 00:01:30,630 Another divisible example is three thirty six and seventy two. 20 00:01:30,660 --> 00:01:36,240 OK, they do not have to be like a ranged from the smallest to the largest. 21 00:01:36,240 --> 00:01:36,630 Right. 22 00:01:36,690 --> 00:01:38,320 It doesn't have anything to do with that. 23 00:01:38,640 --> 00:01:43,590 So basically we could simply use a seventy two, three and then thirty six. 24 00:01:43,980 --> 00:01:51,900 But still in this case if we take pairs, ok, we have one peer to peer and three pairs and, and at 25 00:01:51,900 --> 00:01:59,130 each pair we will have at least we will have basically just one number that can be divided by the other 26 00:01:59,130 --> 00:02:00,600 without a remainder. 27 00:02:01,410 --> 00:02:08,130 But if we will take a look at the following three numbers, for example, two, four seven or five, 28 00:02:08,130 --> 00:02:08,940 seven nine. 29 00:02:09,240 --> 00:02:16,620 Then in both of these cases, we can say that four maybe divided by two without a remainder. 30 00:02:16,620 --> 00:02:17,370 And that's OK. 31 00:02:17,610 --> 00:02:22,620 But seven cannot be divided by two or by four without a remainder. 32 00:02:22,830 --> 00:02:28,910 And it means that not all of the pairs in these three numbers are divisible. 33 00:02:29,010 --> 00:02:36,510 And that's why we should print a non divisible message to the screen and also five seven nine, which 34 00:02:36,510 --> 00:02:44,840 is obviously we cannot find even one pair, even one pair in these three numbers that can be divided. 35 00:02:44,880 --> 00:02:48,240 OK, that you take one number and you can divide it by the other. 36 00:02:48,250 --> 00:02:53,880 So that's basically what you have to do, is simply write a program, get three numbers from the user. 37 00:02:54,120 --> 00:03:01,470 And based on these pairs, OK, probably you will need to use want to use conditions based on these 38 00:03:01,470 --> 00:03:02,040 pairs. 39 00:03:02,040 --> 00:03:06,800 You will need to print corresponding message whether it's divisible. 40 00:03:06,900 --> 00:03:13,170 OK, that's just some terminology that we've created right now or if it's not divisible. 41 00:03:13,620 --> 00:03:14,880 So take your time. 42 00:03:14,880 --> 00:03:15,630 Think about it. 43 00:03:16,080 --> 00:03:22,490 And yeah, I think this is it for this video and I will see you in the solutions. 4366

Can't find what you're looking for?
Get subtitles in any language from opensubtitles.com, and translate them here.