Problem O
Problem Description
Give you a number on base ten,you should output it on base two.(0 < n < 1000)
Input
For each case there is 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
Problem Description
Give you a number on base ten,you should output it on base two.(0 < n < 1000)
Input
For each case there is 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
题意:十进制转二进制
思路:这也算DP?!涨姿势
感想:这类中问、文题还挺多的
AC代码:
#include <iostream>
#include<stdio.h>
#include<algorithm>
#include<string.h>
using namespace std;
int main()
{
long long int a,T,n,m,i,j,temp,k,b;
int arr[100005];
while(cin>>a)
{
i=0;
while(a!=0)
{
arr[i]=a%2;
a/=2;
i++;
}
for(i--;i>=0;i--)
cout<<arr[i];
cout<<endl;
}
return 0;
}