結果
| 問題 | No.1593 Perfect Distance |
| コンテスト | |
| ユーザー |
keijak
|
| 提出日時 | 2021-07-09 21:24:20 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 4 ms / 2,000 ms |
| コード長 | 3,056 bytes |
| コンパイル時間 | 1,648 ms |
| コンパイル使用メモリ | 194,052 KB |
| 最終ジャッジ日時 | 2025-01-22 20:36:16 |
|
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 17 |
ソースコード
#include <bits/stdc++.h>
#define REP_(i, a_, b_, a, b, ...) \
for (int i = (a), END_##i = (b); i < END_##i; ++i)
#define REP(i, ...) REP_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define ALL(x) std::begin(x), std::end(x)
using i64 = long long;
template<typename T, typename U>
inline bool chmax(T &a, U b) {
return a < b and ((a = std::move(b)), true);
}
template<typename T, typename U>
inline bool chmin(T &a, U b) {
return a > b and ((a = std::move(b)), true);
}
template<typename T>
inline int ssize(const T &a) {
return (int) std::size(a);
}
template<typename T>
std::istream &operator>>(std::istream &is, std::vector<T> &a) {
for (auto &x : a) is >> x;
return is;
}
template<typename T, typename U>
std::ostream &operator<<(std::ostream &os, const std::pair<T, U> &a) {
return os << "(" << a.first << ", " << a.second << ")";
}
template<typename Container>
std::ostream &print_seq(const Container &a, std::string_view sep = " ",
std::string_view ends = "\n",
std::ostream &os = std::cout) {
auto b = std::begin(a), e = std::end(a);
for (auto it = std::begin(a); it != e; ++it) {
if (it != b) os << sep;
os << *it;
}
return os << ends;
}
template<typename T, typename = void>
struct is_iterable : std::false_type {};
template<typename T>
struct is_iterable<T, std::void_t<decltype(std::begin(std::declval<T>())),
decltype(std::end(std::declval<T>()))>>
: std::true_type {
};
template<typename T, typename = std::enable_if_t<
is_iterable<T>::value &&
!std::is_same<T, std::string_view>::value &&
!std::is_same<T, std::string>::value>>
std::ostream &operator<<(std::ostream &os, const T &a) {
return print_seq(a, ", ", "", (os << "{")) << "}";
}
void print() { std::cout << "\n"; }
template<class T>
void print(const T &x) {
std::cout << x << "\n";
}
template<typename Head, typename... Tail>
void print(const Head &head, Tail... tail) {
std::cout << head << " ";
print(tail...);
}
void read_from_cin() {}
template<typename T, typename... Ts>
void read_from_cin(T &value, Ts &...args) {
std::cin >> value;
read_from_cin(args...);
}
#define INPUT(type, ...) \
type __VA_ARGS__; \
read_from_cin(__VA_ARGS__)
#ifdef ENABLE_DEBUG
#include "debug_dump.hpp"
#else
#define DUMP(...)
#endif
using namespace std;
// Returns floor(sqrt(x)).
i64 floor_sqrt(i64 x) {
assert(x >= 0);
if (x <= 1) return x;
i64 r = std::floor(sqrtl((long double) x));
while (r * r < x) ++r;
while (r * r > x) --r;
return r;
}
auto solve() {
INPUT(i64, N);
i64 N2 = N * N;
i64 ans = 0;
for (i64 x = 1; x * x <= N2; x++) {
i64 x2 = x * x;
i64 y2 = N2 - x2;
i64 y = floor_sqrt(y2);
if (y > 0 and y * y == y2) {
DUMP(x, y, N, x2, y2, N2);
++ans;
}
}
return ans;
}
int main() {
ios_base::sync_with_stdio(false), cin.tie(nullptr);
cout << std::fixed << std::setprecision(15);
int t = 1;
REP(test_case, t) {
auto ans = solve();
print(ans);
}
}
keijak