平平无奇

#include <bits/stdc++.h>
using namespace std;
int main()
{
    short n, cnt, a[1005];
    cin >> n;
    while (n)
    {
        a[++cnt] = n % 2;
        n /= 2;
    }
    for (int i = cnt; i >= 1; i--)
        cout << a[i];
    return 0;
}

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int n, a[100005], cnt = 0;
    cin >> n;
    while(n)
    {
        a[++cnt] = n % 2;
        n /= 2;
    }
    for (int i = cnt; i >= 1; i--)
        cout << a[i];
    return 0;
}

#include <bits/stdc++.h>
using namespace std;
int n,a[10005],x;
int main()
{
    cin>>n;
    while(n!=0)
    {
        a[x]=n%2;
        n/=2;
        x++;
    }
    for(int i=x-1;i>=0;i--) cout<<a[i];
    return 0;
}

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int x, a[105], i = 0, k, n;
    cin >> x;
    n = x;
    do
    {
        k = n % 2;
        a[i] = k;
        i++;
        n /= 2;
    } while(n > 0);
    for (int j = i - 1; j >= 0; j--)
    {
        cout << a[j];
    }
    return 0;
}

#include<iostream>
using namespace std;
int n,k,a[100005];
int main(){
    cin>>n;
    while(n!=0){
        a[++k]=n%2;//存储余数
        n/=2;
    }//短除法
    for(int i=k;i>=1;i--)//倒序输出
        cout<<a[i];
    return 0;
}//编者：Royal

#include <bits/stdc++.h>
using namespace std;
int n;
string t(int x){
	string rep;
	while (x>0){
		rep+=(x%2+'0');
		x/=2;
	}
	reverse(rep.begin(),rep.end());
	return rep;
}
int main(){
	cin>>n;
	cout<<t(n);
	return 0;
}