C + + recursive, shift bitset__c++

Source: Internet
Author: User
Tags time limit
 
		

Time limit:1000/1000 MS (java/others) Memory limit:32768/32768 K (java/others)
Total submission (s): 23901 accepted Submission (s): 17756


Problem Description give you in the base ten,you should output it on base two. (0 < n < 1000)
Input for each case there are a postive number n on base ten, end of file.
Output for each case output a number on base two.
Sample Input
1 2 3 

Sample Output
1 10 11 

The topic is simple, the code is as follows:
#include <iostream>
using namespace std;

void Sol (int n) {
	if (n) sol (n>>1), cout << n%2;//use n>>1 equals N/2, n<<1 equals n*2 
	else return;

int main () {
	int n;
	while (CIN >> N) {
		sol (n);
		cout<< Endl;
	}
	return 0;
 

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.