結果
| 問題 | No.2125 Inverse Sum |
| ユーザー |
 tokusakurai
|
| 提出日時 | 2022-11-18 21:44:52 |
| 言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
| 結果 |
CE
(最新)
AC
(最初)
|
| 実行時間 | - |
| コード長 | 6,290 bytes |
| コンパイル時間 | 2,009 ms |
| コンパイル使用メモリ | 201,752 KB |
| 最終ジャッジ日時 | 2024-11-15 02:45:08 |
| 合計ジャッジ時間 | 2,873 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge2 |
（要ログイン）
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。（リジャッジ後のコンパイルエラーは公開されます）
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
コンパイルメッセージ
main.cpp: In instantiation of 'void printn(const std::vector<_Tp>&, T) [with T = std::pair<long long int, long long int>]':
main.cpp:251:11: required from here
main.cpp:51:46: error: no match for 'operator+' (operand types are 'const __gnu_cxx::__alloc_traits<std::allocator<std::pair<long long int, long long int> >, std::pair<long long int, long long int> >::value_type' {aka 'const std::pair<long long int, long long int>'} and 'std::pair<long long int, long long int>')
51 | for (int i = 0; i < n; i++) cout << v[i] + x << '\n';
| ~~~~~^~~
In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/stl_algobase.h:67,
from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/specfun.h:45,
from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/cmath:1935,
from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/x86_64-pc-linux-gnu/bits/stdc++.h:41,
from main.cpp:1:
/home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/stl_iterator.h:630:5: note: candidate: 'template<class _Iterator> constexpr std::reverse_iterator<_Iterator> std::operator+(typename reverse_iterator<_Iterator>::difference_type, const reverse_iterator<_Iterator>&)'
630 | operator+(typename reverse_iterator<_Iterator>::difference_type __n,
| ^~~~~~~~
/home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/stl_iterator.h:630:5: note: template argument deduction/substitution failed:
main.cpp:51:46: note: 'std::pair<long long int, long long int>' is not derived from 'const std::reverse_iterator<_Iterator>'
51 | for (int i = 0; i < n; i++) cout << v[i] + x << '\n';
| ~~~~~^~~
/home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/stl_iterator.h:1804:5: note: candidate: 'template<class _Iterator> constexpr std::m
ソースコード
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define per(i, n) for (int i = (n)-1; i >= 0; i--)
#define rep2(i, l, r) for (int i = (l); i < (r); i++)
#define per2(i, l, r) for (int i = (r)-1; i >= (l); i--)
#define each(e, v) for (auto &e : v)
#define MM << " " <<
#define pb push_back
#define eb emplace_back
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
template <typename T>
using minheap = priority_queue<T, vector<T>, greater<T>>;
template <typename T>
using maxheap = priority_queue<T>;
template <typename T>
bool chmax(T &x, const T &y) {
return (x < y) ? (x = y, true) : false;
}
template <typename T>
bool chmin(T &x, const T &y) {
return (x > y) ? (x = y, true) : false;
}
template <typename T>
int flg(T x, int i) {
return (x >> i) & 1;
}
template <typename T>
void print(const vector<T> &v, T x = 0) {
int n = v.size();
for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' ');
if (v.empty()) cout << '\n';
}
template <typename T>
void printn(const vector<T> &v, T x = 0) {
int n = v.size();
for (int i = 0; i < n; i++) cout << v[i] + x << '\n';
}
template <typename T>
int lb(const vector<T> &v, T x) {
return lower_bound(begin(v), end(v), x) - begin(v);
}
template <typename T>
int ub(const vector<T> &v, T x) {
return upper_bound(begin(v), end(v), x) - begin(v);
}
template <typename T>
void rearrange(vector<T> &v) {
sort(begin(v), end(v));
v.erase(unique(begin(v), end(v)), end(v));
}
template <typename T>
vector<int> id_sort(const vector<T> &v, bool greater = false) {
int n = v.size();
vector<int> ret(n);
iota(begin(ret), end(ret), 0);
sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; });
return ret;
}
template <typename S, typename T>
pair<S, T> operator+(const pair<S, T> &p, const pair<S, T> &q) {
return make_pair(p.first + q.first, p.second + q.second);
}
template <typename S, typename T>
pair<S, T> operator-(const pair<S, T> &p, const pair<S, T> &q) {
return make_pair(p.first - q.first, p.second - q.second);
}
template <typename S, typename T>
istream &operator>>(istream &is, pair<S, T> &p) {
S a;
T b;
is >> a >> b;
p = make_pair(a, b);
return is;
}
template <typename S, typename T>
ostream &operator<<(ostream &os, const pair<S, T> &p) {
return os << p.first << ' ' << p.second;
}
struct io_setup {
io_setup() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout << fixed << setprecision(15);
}
} io_setup;
const int inf = (1 << 30) - 1;
const ll INF = (1LL << 60) - 1;
// const int MOD = 1000000007;
const int MOD = 998244353;
template <typename T>
vector<T> divisors(const T &n) {
vector<T> ret;
for (T i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n) ret.push_back(n / i);
}
}
sort(begin(ret), end(ret));
return ret;
}
template <typename T>
vector<pair<T, int>> prime_factor(T n) {
vector<pair<T, int>> ret;
for (T i = 2; i * i <= n; i++) {
int cnt = 0;
while (n % i == 0) cnt++, n /= i;
if (cnt > 0) ret.emplace_back(i, cnt);
}
if (n > 1) ret.emplace_back(n, 1);
return ret;
}
template <typename T>
bool is_prime(const T &n) {
if (n == 1) return false;
for (T i = 2; i * i <= n; i++) {
if (n % i == 0) return false;
}
return true;
}
// 1,2,...,n のうち k と互いに素である自然数の個数
template <typename T>
T coprime(T n, T k) {
vector<pair<T, int>> ps = prime_factor(k);
int m = ps.size();
T ret = 0;
for (int i = 0; i < (1 << m); i++) {
T prd = 1;
for (int j = 0; j < m; j++) {
if ((i >> j) & 1) prd *= ps[j].first;
}
ret += (__builtin_parity(i) ? -1 : 1) * (n / prd);
}
return ret;
}
vector<bool> Eratosthenes(const int &n) {
vector<bool> ret(n + 1, true);
if (n >= 0) ret[0] = false;
if (n >= 1) ret[1] = false;
for (int i = 2; i * i <= n; i++) {
if (!ret[i]) continue;
for (int j = i + i; j <= n; j += i) ret[j] = false;
}
return ret;
}
vector<int> Eratosthenes2(const int &n) {
vector<int> ret(n + 1);
iota(begin(ret), end(ret), 0);
if (n >= 0) ret[0] = -1;
if (n >= 1) ret[1] = -1;
for (int i = 2; i * i <= n; i++) {
if (ret[i] < i) continue;
for (int j = i + i; j <= n; j += i) ret[j] = min(ret[j], i);
}
return ret;
}
template <typename T>
T kth_root_integer(T a, int k) {
if (k == 1) return a;
auto check = [&](T x) {
T mul = 1;
for (int j = 0; j < k; j++) {
if (__builtin_mul_overflow(mul, x, &mul)) return false;
}
return mul <= a;
};
int n = 4 * sizeof(T);
T ret = 0;
for (int i = n - 1; i >= 0; i--) {
if (check(ret | (T(1) << i))) ret |= T(1) << i;
}
return ret;
}
int main() {
ll P, Q;
cin >> P >> Q;
ll G = gcd(P, Q);
P /= G, Q /= G;
auto ds = divisors(Q);
vector<pll> ans;
// each(e, ds) {
// ll R = Q / e;
// ll X = P * P - 4 * R;
// if (X < 0) continue;
// ll Y = kth_root_integer(X, 2);
// if (Y * Y != X) continue;
// if (P - Y <= 0) continue;
// if ((P + Y) % 2 == 0) continue;
// ll A = (P - Y) / 2, B = (P + Y) / 2;
// if (gcd(A, B) != 1) continue;
// ans.eb(A * e, B * e);
// if (A != B) ans.eb(B * e, A * e);
// }
// each(e, ds) {
// ll A = e, B = Q / A;
// if ((A + B) % P != 0) continue;
// ll g = (A + B) / P;
// ans.eb(A * g, B * g);
// ans.eb(B * g, A * g);
// }
each(A, ds) each(B, ds) {
if (gcd(A, B) != 1) continue;
if ((A + B) % P != 0) continue;
ll X = ((A + B) / P) * Q;
if (X % (A * B) != 0) continue;
ll g = X / (A * B);
ans.eb(A * g, B * g);
}
rearrange(ans);
cout << sz(ans) << '\n';
printn(ans, pll(0, 0));
}