Does anyone knows how to solve this problem ? http://cepc08.ii.uni.wroc.pl/cards.pdf
I've been trying to solve this problem, got some ideas but none of those ideas has really worked. Can anyone give me a hint ?
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
Does anyone knows how to solve this problem ? http://cepc08.ii.uni.wroc.pl/cards.pdf
I've been trying to solve this problem, got some ideas but none of those ideas has really worked. Can anyone give me a hint ?
Name |
---|
YES is when exist such k, l, n, m ≥ 0 so
c = k × a + l × b
d = m × a + n × b.
NO otherwise.
What's the proof ? I could see this approach, but I wasn't sure if this is right.
counter-example:
c=3 d=7 a=2 b=3
c=0a+1b
d=2a+1b
Yep, one more condition: a × b must divide c × d
UPD This seems to be legit, but in paper I found another: (c = q × a or d = q × a) and (c = w × b or d = w × b).
Can you prove it ?
That paper in russian. Sorry, I'm in lack of time to translate it.