結果
問題 | No.2086 A+B問題 |
ユーザー | kakao745 |
提出日時 | 2024-08-02 18:10:07 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 2,417 bytes |
コンパイル時間 | 10,924 ms |
コンパイル使用メモリ | 413,292 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-08-02 18:10:20 |
合計ジャッジ時間 | 11,648 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 KB |
testcase_01 | AC | 2 ms
6,944 KB |
testcase_02 | AC | 2 ms
6,940 KB |
testcase_03 | AC | 2 ms
6,944 KB |
testcase_04 | AC | 2 ms
6,944 KB |
testcase_05 | AC | 2 ms
6,940 KB |
testcase_06 | AC | 1 ms
6,944 KB |
testcase_07 | AC | 2 ms
6,940 KB |
testcase_08 | AC | 2 ms
6,940 KB |
testcase_09 | AC | 2 ms
6,944 KB |
testcase_10 | AC | 2 ms
6,940 KB |
testcase_11 | AC | 2 ms
6,940 KB |
testcase_12 | AC | 2 ms
6,944 KB |
testcase_13 | AC | 2 ms
6,944 KB |
testcase_14 | AC | 2 ms
6,940 KB |
testcase_15 | AC | 2 ms
6,940 KB |
testcase_16 | AC | 1 ms
6,944 KB |
testcase_17 | AC | 2 ms
6,944 KB |
testcase_18 | AC | 2 ms
6,944 KB |
testcase_19 | AC | 2 ms
6,944 KB |
testcase_20 | AC | 2 ms
6,940 KB |
コンパイルメッセージ
In file included from main.cpp:14: In member function 'void boost::multiprecision::backends::cpp_int_base<MinBits, MaxBits, boost::multiprecision::signed_magnitude, Checked, Allocator, false>::resize(std::size_t, std::size_t) [with long unsigned int MinBits = 0; long unsigned int MaxBits = 18446744073709551615; boost::multiprecision::cpp_int_check_type Checked = boost::multiprecision::unchecked; Allocator = std::allocator<long long unsigned int>]', inlined from 'constexpr void boost::multiprecision::backends::add_unsigned(CppInt1&, const CppInt2&, const boost::multiprecision::limb_type&) [with CppInt1 = cpp_int_backend<>; CppInt2 = cpp_int_backend<>]' at /boost_git/boost/multiprecision/cpp_int/add.hpp:50:20, inlined from 'constexpr typename std::enable_if<(! boost::multiprecision::backends::is_trivial_cpp_int<boost::multiprecision::backends::cpp_int_backend<MinBits, MaxBits, SignType, Checked, Allocator> >::value)>::type boost::multiprecision::backends::eval_add(cpp_int_backend<MinBits, MaxBits, SignType, Checked, Allocator>&, const boost::multiprecision::limb_type&) [with long unsigned int MinBits1 = 0; long unsigned int MaxBits1 = 0; boost::multiprecision::cpp_integer_type SignType1 = boost::multiprecision::signed_magnitude; boost::multiprecision::cpp_int_check_type Checked1 = boost::multiprecision::unchecked; Allocator1 = std::allocator<long long unsigned int>]' at /boost_git/boost/multiprecision/cpp_int/add.hpp:141:19, inlined from 'void boost::multiprecision::backends::cpp_int_backend<MinBits, MaxBits, SignType, Checked, Allocator>::do_assign_string(const char*, const std::integral_constant<bool, false>&) [with long unsigned int MinBits = 0; long unsigned int MaxBits = 0; boost::multiprecision::cpp_integer_type SignType = boost::multiprecision::signed_magnitude; boost::multiprecision::cpp_int_check_type Checked = boost::multiprecision::unchecked; Allocator = std::allocator<long long unsigned int>]' at /boost_git/boost/multiprecision/cpp_int.hpp:1903
ソースコード
#include<bits/stdc++.h> using namespace std; #define rep(i,n) for(long long i=0;i<(long long)n;i++) #define reps(i,n) for(long long i=1;i<=(long long)n;i++) #define loop(i,l,r) for(long long i=l;i<=(long long)r;i++) #define all(v) v.begin(), v.end() #define rall(v) v.rbegin(), v.rend() #define yn(x) cout << (x? "Yes":"No") << endl #define cou(x) cout << x << endl //#pragma GCC target ("avx,avx2")四則演算 #pragma GCC optimize("O3") //#pragma GCC optimize("unroll-loops")ループ //#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")浮動小数点 #include <boost/multiprecision/cpp_int.hpp> namespace mp = boost::multiprecision; using bint=mp::cpp_int; // #include <boost/multiprecision/cpp_dec_float.hpp> やばい少数派(重い) // #include <boost/math/constants/constants.hpp>円周率他 // #include <boost/dynamic_bitset.hpp> dynamicbitset const long long mod=998244353LL; const long long mods=1000000007LL; const long long yab=2500000000000000000LL; const int kaz=1000000000; const long long aho =-yab; const long double eps=1.0e-14L; const long double pi=acosl(-1.0L); using ll=long long; using st=string; using P=pair<ll,ll>; using tup=tuple<ll,ll,ll>; using vi=vector<ll>; using vc=vector<char>; using vb=vector<bool>; using vs=vector<string>; using vp=vector<P>; using sp=set<P>; using si=set<ll>; using vvi=vector<vector<ll>>; using vvc=vector<vc>; using vvb=vector<vb>; const int dx[4]={0,1,0,-1}; const int dy[4]={1,0,-1,0}; const vector<int> ex = {-1, -1, -1, 0, 0, 1, 1, 1}; const vector<int> ey = {-1, 0, 1, -1, 1, -1, 0, 1}; int mysearch(vi &a,ll x){ int l=-1; int r=a.size()-1; while(r-l>1){ int mid=(l+r)/2; if(x==a[mid])return mid; else if(x<a[mid])r=mid; else l=mid; } if(x==a[r])return r; return -1; } template<typename T1,typename T2> void co(bool x,T1 y,T2 z){ if(x)cout << y << endl; else cout << z << endl; } template<typename T> bool chmax(T &a, T b){ if(a<b){ a=b; return true; } return false; } template<typename T> bool chmin(T &a, T b){ if(a>b){ a=b; return true; } return false; } template<typename T> void print(vector<T> &a){ for(int i=0;i<a.size();i++){ cout << a[i]; if(i==(long long)a.size()-1)cout << endl; else cout << " "; } } ll mypow(ll x,ll y){ ll ret=1; while(y>0){ if(y&1)ret=ret*x%mod; x=x*x%mod; y>>=1; } return ret; } int main(){ bint a,b; cin >> a >> b; cout << a+b << endl; }