Hello everybody)
help me with problem
we looking for quantity of integer solutions (x,y) equation ; |a|,|b| <=
# | User | Rating |
---|---|---|
1 | tourist | 3880 |
2 | jiangly | 3669 |
3 | ecnerwala | 3654 |
4 | Benq | 3627 |
5 | orzdevinwang | 3612 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | jqdai0815 | 3532 |
9 | Radewoosh | 3522 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | adamant | 156 |
4 | maroonrk | 153 |
5 | -is-this-fft- | 148 |
5 | SecondThread | 148 |
5 | atcoder_official | 148 |
8 | Petr | 147 |
9 | nor | 144 |
9 | TheScrasse | 144 |
Name |
---|
I found this:
a.y + b.x = x.y
b.x = y.(x-a)
y=(b.x) / (x-a);
x,y are integers so (a|b means b%a=0)
x-a| b.x
x-a| b.x — b.(x-a)
x-a| b.x — b.x + a.b
x-a| a.b
for every z (z|a.b) there is an integer pair (x,y) suitable to all conditions. So the answer is same with quantity of divisors of a.b