HI :)
here is my submission : 22598258
It dosen't use Goldbach's Conjecture .
Do you think this solution is true ? or testcases were weak?
→ Обратите внимание
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3993 |
| 2 | jiangly | 3743 |
| 3 | orzdevinwang | 3707 |
| 4 | Radewoosh | 3627 |
| 5 | jqdai0815 | 3620 |
| 6 | Benq | 3564 |
| 7 | Kevin114514 | 3443 |
| 8 | ksun48 | 3434 |
| 9 | Rewinding | 3397 |
| 10 | Um_nik | 3396 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 156 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 24.11.2024 12:24:48 (i2).
Десктопная версия, переключиться на мобильную.
При поддержке
Why 200? Why 1900? As long as these numbers are randomly selected your solution is wrong.
I think this solution is wrong too ...
and i use 200 & 1900 to dont get TLE .
but also this one :22599100 (200 and 40000)didn't get TLE too ...
Well, you've answered your own question!
actually i want a testcase that make my solution wrong ...
but i can not find that
You are assumimg that any even number n < 109 can be decomposed as n = p + q with p, q primes and p < 1900. Similar for odd number n = p + q + t with p, q < 200.
I've tried some random n and the maximum minimum p I could get is 1171, for n = 343553258.
acctualy test 65 has n=1847133842 which 1800<p<1900 and that was maximum p among the tests.
Then I guess the two-prime part is correct. OEIS has only 335070838 with p=1427.
So do you have any idea about 3 prime part?