結果
問題 | No.1243 約数加算 |
ユーザー |
![]() |
提出日時 | 2020-10-03 00:12:09 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 5 ms / 2,000 ms |
コード長 | 3,158 bytes |
コンパイル時間 | 2,623 ms |
コンパイル使用メモリ | 197,540 KB |
最終ジャッジ日時 | 2025-01-15 01:30:15 |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 9 |
ソースコード
#include <bits/stdc++.h>using namespace std;typedef long long ll;#define rep(i,N) for(int i=0;i<int(N);++i)#define rep1(i,N) for(int i=1;i<int(N);++i)#define all(a) (a).begin(),(a).end()#define bit(k) (1LL<<(k))#define SUM(v) accumulate(all(v), 0LL)typedef pair<int, int> i_i;typedef pair<ll, ll> l_l;template <class T> using vec = vector<T>;template <class T> using vvec = vector<vec<T>>;struct fast_ios{ fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; }fast_ios_;template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }#define TOSTRING(x) string(#x)template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (T &x : vec) is >> x; return is; }template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) { os << "["; for(auto _: v) os << _ << ", "; os << "]"; return os; };template <typename T> ostream &operator<<(ostream &os, set<T> &st) { os << "("; for(auto _: st) { os << _ << ", "; } os << ")";return os;}template <typename T, typename U> ostream &operator<<(ostream &os, const pair< T, U >& p){os << "{" <<p.first << ", " << p.second << "}";return os; }template <typename T, typename U> ostream &operator<<(ostream &os, const map<T, U> &mp){ os << "["; for(auto _: mp){ os << _ << ", "; } os << "]" <<endl; return os; }#define DUMPOUT cerrvoid dump_func(){ DUMPOUT << endl; }template <class Head, class... Tail> void dump_func(Head &&head, Tail &&... tail) { DUMPOUT << head; if (sizeof...(Tail) > 0) { DUMPOUT << ", "; }dump_func(std::move(tail)...); }#ifdef DEBUG#define dbg(...) dump_func(__VA_ARGS__)#define dump(...) DUMPOUT << string(#__VA_ARGS__) << ": "; dump_func(__VA_ARGS__)#else#define dbg(...)#define dump(...)#endifconst int INF = (ll)1e9;const ll INFLL = (ll)1e18+1;const ll MOD = 1000000007;// const ll MOD = 998244353;const long double PI = acos(-1.0);/*const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};const string dir = "DRUL";*/void solve(){ll A, B;cin >> A >> B;if(B - A <= 120){cout << B - A << endl;rep(i,B-A){cout << 1 << " ";}cout << endl;return;}int top = 0;for(int i = 60; i >= 0; i--){if((A & bit(i)) == 0 && ((B & bit(i)) > 0)){top = i;break;}}dump(A, B, top);vector<ll> ans;while((A&bit(top)) == 0){rep(i,top+1){if(A&bit(i)){A += bit(i);ans.emplace_back(bit(i));break;}}}for(int i = top - 1; i >= 0; i--){ll a = A & bit(i);ll b = B & bit(i);if(a == 0 && b > 0){A += bit(i);ans.emplace_back(bit(i));}}dump(A, B);cout << ans.size() << endl;for(auto a: ans){cout << a << " ";}cout << endl;}int main(){int t;cin >> t;while(t--)solve();}