hii everyone, I attempted a very good question on Segment tree. Though I have checked my logic with the editorial, I am having errors in its implementation. If anybody could have a look and explain where my code is getting stuck. Problem is 914D. Link to the problem 914D - Bash and a Tough Math Puzzle My submission is Submission link 300235362 Thanks in advance.
→ Обратите внимание
→ Трансляции
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | jiangly | 3977 |
| 2 | tourist | 3815 |
| 3 | jqdai0815 | 3682 |
| 4 | ksun48 | 3614 |
| 5 | orzdevinwang | 3526 |
| 6 | ecnerwala | 3514 |
| 7 | Benq | 3483 |
| 8 | hos.lyric | 3381 |
| 9 | gamegame | 3374 |
| 10 | heuristica | 3358 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 169 |
| 2 | -is-this-fft- | 162 |
| 3 | Um_nik | 161 |
| 4 | atcoder_official | 159 |
| 5 | djm03178 | 157 |
| 5 | Dominater069 | 157 |
| 7 | adamant | 154 |
| 8 | luogu_official | 152 |
| 8 | awoo | 152 |
| 10 | TheScrasse | 148 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2025 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 10.01.2025 05:55:18 (l3).
Десктопная версия, переключиться на мобильную.
При поддержке
My submission
My logic was that x is almost gcd iff every number in the range is divisible by x except one
So I just found the 1st index not divisible by x and checked whether it's the only one
(Now that I'm writing this comment, I realised that probably the query made at the left of "idx" isn't needed, the variable "left" should be always -1)
Also here's a test case for which your code fails
5
1 1 10 3 7
1
1 1 2 3
Thanks