[BZOJ1041][HAOI2008]圆上的整点[数论]

\[ x^2+y^2=r^2 \\\\ y^2=\left( r+x \right) \left( r-x \right) \\\\ \text{let }d=\text{gcd}\left( r+x,r-x \right) \\\\ \text{let }r-x=d\times a^2,r+x=d\times b^2 \\\\ 2r=d\times \left( a^2+b^2 \right) \\\\ d|2r\,\,a^2\bot b^2 \\\\ \]
用到了一个结论，两个互质的数的乘积是完全平方数,那么这两个数都是完全平方数
枚举d再枚举a

inline void solve(uint x) {
  for(uint i = 1; 2 * i * i <= x; ++i) {
    uint j = sqrt(x - i * i);
    if (j * j == x - i * i && gcd(i, j) == 1) ++ans;
  }
}
  cin >> r;r <<= 1;
  for(uint i = 1; i * i <= r; ++i) {
    if (r % i) continue;
    solve(r / i);
    if (i * i != r) solve(i);
  }
  cout << ans * 4;

转载于:https://www.cnblogs.com/storz/p/10190955.html