結果
問題 | No.1243 約数加算 |
ユーザー |
![]() |
提出日時 | 2020-10-02 23:19:39 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 3 ms / 2,000 ms |
コード長 | 3,619 bytes |
コンパイル時間 | 2,071 ms |
コンパイル使用メモリ | 196,564 KB |
最終ジャッジ日時 | 2025-01-15 01:20:15 |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 9 |
ソースコード
#include <bits/stdc++.h>// #include <atcoder/all>// using namespace atcoder;using namespace std;#define rep2(i, m, n) for (int i = (m); i < (n); ++i)#define rep(i, n) rep2(i, 0, n)#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)#define drep(i, n) drep2(i, n, 0)#define all(x) (x).begin(), (x).end()#define rall(x) (x).rbegin(), (x).rend()#ifdef LOCALvoid debug_out() { cerr << endl; }template <class Head, class... Tail> void debug_out(Head H, Tail... T) { cerr << ' ' << H; debug_out(T...); }#define debug(...) cerr << 'L' << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)#define dump(x) cerr << 'L' << __LINE__ << " " << #x << " = " << (x) << endl#else#define debug(...) (void(0))#define dump(x) (void(0))#endiftemplate<class T> using V = vector<T>;template<class T> using P = pair<T, T>;using ll = long long;using ld = long double;using Vi = V<int>; using VVi = V<Vi>;using Vl = V<ll>; using VVl = V<Vl>;using Vd = V<ld>; using VVd = V<Vd>;using Vb = V<bool>; using VVb = V<Vb>;using Pi = P<int>;using Pl = P<ll>;using Pd = P<ld>;template<class T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;template<class T> vector<T> make_vec(size_t n, T a) { return vector<T>(n, a); }template<class... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec(ts...))>(n, make_vec(ts...)); }template<class T> inline int sz(const T &x) { return x.size(); }template<class T> inline bool chmin(T &a, const T b) { if (a > b) { a = b; return true; } return false; }template<class T> inline bool chmax(T &a, const T b) { if (a < b) { a = b; return true; } return false; }template<class T1, class T2> istream &operator>>(istream &is, pair<T1, T2> &p) { is >> p.first >> p.second; return is; }template<class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p) { os << '(' << p.first << ", " << p.second << ')'; return os; }template<class T> istream &operator>>(istream &is, vector<T> &v) { for (auto &e : v) is >> e; return is; }template<class T> ostream &operator<<(ostream &os, const vector<T> &v) { for (auto &e : v) os << e << ' '; return os; }template<class T> inline void deduplicate(vector<T> &a) { sort(all(a)); a.erase(unique(all(a)), a.end()); }template<class T> inline int count_between(const vector<T> &a, T l, T r) { return lower_bound(all(a), r) - lower_bound(all(a), l); } // [l, r)inline ll cDiv(const ll x, const ll y) { return (x+y-1) / y; } // ceil(x/y)inline int fLog2(const ll x) { assert(x > 0); return 63-__builtin_clzll(x); } // floor(log2(x))inline int cLog2(const ll x) { assert(x > 0); return (x == 1) ? 0 : 64-__builtin_clzll(x-1); } // ceil(log2(x))inline int popcount(const ll x) { return __builtin_popcountll(x); }inline void fail() { cout << -1 << '\n'; exit(0); }struct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;// const int INF = 1<<30;// const ll INFll = 1ll<<60;// const ld EPS = 1e-10;// const ld PI = acos(-1.0);// const int MOD = int(1e9)+7;// const int MOD = 998244353;const int M = 60;int main() {int t; cin >> t;rep(_, t) {ll a, b; cin >> a >> b;Vl ans;while (a < b) {int k = -1;rep(i, M) {if (a>>i&1) {k = i;break;}}int l = -1;rep(i, k+1) {if (a + (1ll<<i) > b) {l = i-1;break;}l = i;}ll x = 1ll<<l;ans.push_back(x);a += x;}cout << sz(ans) << '\n';cout << ans << '\n';}}