Hello. If there's someone who knows a better way of explaining the second paragraph of induction part of this problem's editorial then please do it. I'm having a hard time understanding it.
Problem 1604-C Di-Visible Confusion
Thanks in advance.
Hello. If there's someone who knows a better way of explaining the second paragraph of induction part of this problem's editorial then please do it. I'm having a hard time understanding it.
Problem 1604-C Di-Visible Confusion
Thanks in advance.
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 163 |
4 | TheScrasse | 159 |
5 | nor | 157 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | Petr | 146 |
8 | orz | 146 |
10 | BledDest | 145 |
Название |
---|
Auto comment: topic has been updated by Wasif_Shahzad (previous revision, new revision, compare).
They are basically checking if there exists a number in range [2,i+1] which doesn't divide a[i] and in case they all divide it then it must be divisible by there lcm which is going beyond the limit of a[i] i.e, 10^9. So it's not possible for a[i] to be divisible by all number in [2,i+1] if i>=22.
why only for $$$ i <= 23 $$$? I can understand that other numbers will be multiples of these numbers but what about prime numbers which are lets say on prime indices.
for example: say some number $$$ x $$$ is at $$$ i = 48 $$$
This case is confusing me only.
Edit: sorry if I couldn't convey my doubt clearly but it is related to prime numbers in the array
Ok let's take an example of array a = [1,5,3,7,2,16,31] , in this array 31 is a prime number and is also present at index 7(1-based indexing) , so we can simply delete 31 as it is not divisible by (i+1) i.e, 8.
If still not clear pls tell me briefly.