結果
問題 | No.2358 xy+yz+zx=N |
ユーザー |
![]() |
提出日時 | 2024-08-11 19:27:40 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 66 ms / 2,000 ms |
コード長 | 2,594 bytes |
コンパイル時間 | 5,310 ms |
コンパイル使用メモリ | 322,748 KB |
実行使用メモリ | 5,856 KB |
最終ジャッジ日時 | 2024-08-11 19:27:47 |
合計ジャッジ時間 | 6,888 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 10 |
ソースコード
#include <atcoder/all>#include <bits/stdc++.h>using namespace std;using namespace atcoder;#ifdef DEBUG#include "debug/all.hpp"#else#define debug(...) 42#endifusing ll = long long;using ull = unsigned long long;using ld = long double;using P = pair<ll, ll>;using tp = tuple<ll, ll, ll>;template <class T>using vec = vector<T>;template <class T>using vvec = vector<vec<T>>;#define all(hoge) (hoge).begin(), (hoge).end()#define en '\n'#define rep(i, m, n) for(ll i = (ll)(m); i < (ll)(n); ++i)#define rep2(i, m, n) for(ll i = (ll)(n)-1; i >= (ll)(m); --i)#define REP(i, n) rep(i, 0, n)#define REP2(i, n) rep2(i, 0, n)constexpr long long INF = 1LL << 60;constexpr int INF_INT = 1 << 30;// constexpr long long MOD = (ll)1e9 + 7;constexpr long long MOD = 998244353LL;static const ld pi = 3.141592653589793L;template <class T>inline bool chmin(T &a, T b) {if(a > b) {a = b;return true;}return false;}template <class T>inline bool chmax(T &a, T b) {if(a < b) {a = b;return true;}return false;}struct Edge {int to, rev;ll cap;Edge(int _to, int _rev, ll _cap) : to(_to), rev(_rev), cap(_cap) {}};typedef vector<Edge> Edges;typedef vector<Edges> Graph;void add_edge(Graph &G, int from, int to, ll cap, bool revFlag, ll revCap) {G[from].push_back(Edge(to, (int)G[to].size(), cap));if(revFlag)G[to].push_back(Edge(from, (int)G[from].size() - 1, revCap));}void solve() {ll n;cin >> n;// x>=y>=zの前提でとくvvec<ll> ans;for(ll y = 1; y * y <= n; y++) {if(n % y == 0) {ll x = n / y;ll z = 0;vec<ll> d({z, y, x});do {ans.push_back(d);} while(next_permutation(all(d)));}for(ll z = 1; z <= y; z++) {ll a = n - y * z;ll b = y + z;if(a % b)continue;ll x = a / b;if(x < y)continue;vec<ll> d({z, y, x});do {ans.push_back(d);} while(next_permutation(all(d)));}}sort(all(ans));cout << ans.size() << en;for(auto i : ans) {for(auto j : i)cout << j << " ";cout << en;}}int main() {ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);// cout << fixed << setprecision(10);// ll t;// cin >> t;// REP(i, t - 1) {// solve();// }solve();return 0;}