結果
問題 | No.1243 約数加算 |
ユーザー | suta28407928 |
提出日時 | 2020-10-02 22:29:55 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
MLE
|
実行時間 | - |
コード長 | 2,872 bytes |
コンパイル時間 | 921 ms |
コンパイル使用メモリ | 107,104 KB |
実行使用メモリ | 814,156 KB |
最終ジャッジ日時 | 2024-07-17 22:02:41 |
合計ジャッジ時間 | 2,763 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | MLE * 1 |
コンパイルメッセージ
main.cpp: In function 'int main()': main.cpp:94:27: warning: 'bit' may be used uninitialized [-Wmaybe-uninitialized] 94 | while(a + (1LL<<bit) <= b){ | ~~~~^~~~~~ main.cpp:87:17: note: 'bit' was declared here 87 | int bit; | ^~~
ソースコード
#include <iostream>#include <string>#include <cstdlib>#include <cmath>#include <vector>#include <unordered_map>#include <map>#include <set>#include <algorithm>#include <queue>#include <stack>#include <functional>#include <bitset>#include <assert.h>#include <unordered_map>#include <fstream>#include <ctime>#include <complex>using namespace std;typedef long long ll;typedef vector<ll> vl;typedef vector<vl> vvl;typedef vector<char> vc;typedef vector<string> vs;typedef vector<bool> vb;typedef vector<double> vd;typedef pair<ll,ll> P;typedef pair<int,int> pii;typedef vector<P> vpl;typedef tuple<ll,ll,ll> tapu;#define rep(i,n) for(int i=0; i<(n); i++)#define REP(i,a,b) for(int i=(a); i<(b); i++)#define all(x) (x).begin(), (x).end()#define rall(x) (x).rbegin(), (x).rend()const int inf = 1<<30;const ll linf = 1LL<<62;const int MAX = 510000;ll dy[8] = {1,-1,0,0,1,-1,1,-1};ll dx[8] = {0,0,1,-1,1,-1,-1,1};const double pi = acos(-1);const double eps = 1e-7;template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){if(a>b){a = b; return true;}else return false;}template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){if(a<b){a = b; return true;}else return false;}template<typename T> inline void print(T &a){rep(i,a.size()) cout << a[i] << " ";cout << "\n";}template<typename T1,typename T2> inline void print2(T1 a, T2 b){cout << a << " " << b << "\n";}template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){cout << a << " " << b << " " << c << "\n";}ll pcount(ll x) {return __builtin_popcountll(x);}const int mod = 1e9 + 7;//const int mod = 998244353;int main(){int t; cin >> t;vl ans, as;while(t--){ll a,b; cin >> a >> b;bool f = true;if(a*2 <= b){f = false;}for(int i=0; i<62; i++){if(pcount(a) == 1 + f) break;if(a>>i & 1){ans.push_back(1LL<<i);a += 1LL<<i;}}while(a*2 < b){ans.push_back(a);a <<= 1;}if(f){int bit;rep(i,60){if(a>>i & 1){bit = i;break;}}while(a + (1LL<<bit) <= b){ans.push_back(1LL<<bit);a += 1LL<<bit;}}ll c = b - a;rep(i,60){if(c>>i & 1){as.push_back(1LL<<i);}}reverse(all(as));ans.insert(ans.end(), as.begin(), as.end());cout << ans.size() << "\n";rep(i,ans.size()){cout << ans[i];if(i+1 == ans.size()) cout << "\n";else cout << " ";}ans.clear(); as.clear();}}