#include #include #include #include #include #include #include #include #include #include using namespace std; int main( void ) try { string in; cin >> in; const long int cVal { strtol( in.c_str(), nullptr, 10 ) }; if ( 1 >= cVal || LONG_MIN == cVal || LONG_MAX == cVal ) { cerr << "Wrong value." << endl; return 0; } for ( long int currentVal { 1 }; currentVal <= cVal; ++currentVal ) { array< char, 32 > buffer; buffer.fill( 0 ); sprintf( buffer.data(), "%d", currentVal ); string currentStr( buffer.data() ); bitset< 8 * sizeof( currentVal ) > bs( currentVal ); vector< bitset< 4 > > binDigits; for ( const char c : currentStr ) { string str; str += c; const long int cDigit { strtol( str.c_str(), nullptr, 10 ) }; binDigits.emplace_back( cDigit ); } string binOut( bs.to_string() ); while ( '0' == binOut.at( 0 ) ) { for ( size_t i { 0 }; i < binOut.size(); ++i ) { if ( '0' == binOut.at( i ) ) { binOut.erase( i, 1 ); break; } } } string bcdOut; for ( auto dig : binDigits ) { bcdOut += dig.to_string(); } unsigned int binNum { 0 }; unsigned int bcdNum { 0 }; for ( auto c : binOut ) { if ( '1' == c ) { ++binNum; } } reverse( bcdOut.begin(), bcdOut.end() ); for ( size_t i { 0 }; i < binOut.size(); ++i ) { if ( '1' == bcdOut.at( i ) ) { ++bcdNum; } } if ( binNum == bcdNum ) { string temp; for ( auto dig : binDigits ) { temp += dig.to_string() + " "; } cout << "dec: " << setw( 3 ) << currentVal; cout << " BCD: " << setw( 15 ) << temp; cout << "bin: " << setw( 8 ) << binOut << endl; } } return 0; } catch ( const exception& cEx ) { cerr << cEx.what(); return 1; } catch ( ... ) { cerr << "FATAL ERROR !!!"; return 1; }

challenge-bcd-binary-summit