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么。。。。。。晕；

感悟：晕

代码：

#include

#include

#include

#define maxn 1005

using namespace std;

char s1[maxn],s2[maxn];

int dp[maxn][maxn];//记录当前状态的最长子序列长度

int main()

{

    //freopen("in.txt","r",stdin);

    while(~scanf("%s",&s1))

    {

        scanf("%s",&s2);

        for(int i=1;i<=strlen(s1);i++)

        {

            for(int j=1;j<=strlen(s2);j++)

            {

                if(s1[i-1]==s2[j-1])

                    dp[i][j]=dp[i-1][j-1]+1;

                else if(dp[i][j-1]>dp[i-1][j])

                    dp[i][j]=dp[i][j-1];

                else

                    dp[i][j]=dp[i-1][j];

            }

        }

        printf("%d\n",dp[strlen(s1)][strlen(s2)]);

    }

}