HI :)
here is my submission : 22598258
It dosen't use Goldbach's Conjecture .
Do you think this solution is true ? or testcases were weak?
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
HI :)
here is my submission : 22598258
It dosen't use Goldbach's Conjecture .
Do you think this solution is true ? or testcases were weak?
Name |
---|
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?