Run Code
|
API
|
Code Wall
|
Users
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Dec to Bin
#include <bits/stdc++.h> using namespace std; int main() { int n = 4; vector <int> v; while(n!=0) { int r = n % 2; v.push_back(r); n = n / 2; } reverse(v.begin(),v.end()); for(int i=0;i<v.size();i++) cout<<v.at(i); }
run
|
edit
|
history
|
help
0
Please
log in
to post a comment.
Binary tree balanced or not
printAllPathsInMatrix
Kadane's Algorithm
single_digit
getline vs cin
Diferenciacion e integracion beta 0.1
Generating π from 1,000 random numbers
Bin Tree playground
fundamental type sizes
Heap DS and Heapsort
Please log in to post a comment.