Run Code
|
API
|
Code Wall
|
Users
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
U2
#include <iostream> #include <type_traits> int main() { std::cout << std::is_same<char, signed char>{} << std::endl; std::cout << std::is_same<char, unsigned char>{} << std::endl; std::cout << std::is_same<signed char, unsigned char>{} << std::endl; std::cout << std::endl; signed char sc = -5; std::cout << ((0b10000000 & sc) ? 1 : 0) << std::endl; std::cout << ((0b01000000 & sc) ? 1 : 0) << std::endl; std::cout << ((0b00100000 & sc) ? 1 : 0) << std::endl; std::cout << ((0b00010000 & sc) ? 1 : 0) << std::endl; std::cout << ((0b00001000 & sc) ? 1 : 0) << std::endl; std::cout << ((0b00000100 & sc) ? 1 : 0) << std::endl; std::cout << ((0b00000010 & sc) ? 1 : 0) << std::endl; std::cout << ((0b00000001 & sc) ? 1 : 0) << std::endl; std::cout << std::endl; std::cout << (-128 + 0b1111011) << std::endl; }
run
|
edit
|
history
|
help
0
Please
log in
to post a comment.
Ordered Graphs
using directives: qualified lookup rules are different from unqualified lookup rules
Arduino Bluetooth Periodiek Systeem
Reverse polish notation
Non type template argument
uniq ptr
DESim Example with Hash Table Starter Code
7
Maze problem solution
Uno v2
Please log in to post a comment.