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 | 3856 |
2 | jiangly | 3747 |
3 | orzdevinwang | 3706 |
4 | jqdai0815 | 3682 |
5 | ksun48 | 3591 |
6 | gamegame | 3477 |
7 | Benq | 3468 |
8 | Radewoosh | 3462 |
9 | ecnerwala | 3451 |
10 | heuristica | 3431 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | -is-this-fft- | 162 |
3 | Dominater069 | 160 |
4 | Um_nik | 158 |
5 | atcoder_official | 157 |
6 | Qingyu | 155 |
7 | djm03178 | 151 |
7 | adamant | 151 |
9 | luogu_official | 150 |
10 | awoo | 147 |
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.