在本题中，给定一个非负十进制整数（以 10 为基数），你的任务是输出它的二进制表示（以 2 为基数）。
输入仅包含一行，为一个整数 $n$ ($0 \leqslant n \leqslant 10^{5 \cdot 10^5}$)，不含前导零。
在输出的第一行，打印 $n$ 的二进制表示，不含前导零。
样例
输入格式 1
10
输出格式 1
1010
QOJ.ac
QOJ
実行時間制限： 5 s
メモリ制限： 256 MB
満点： 100
#95. 基数
統計
この問題は以下のコンテストで使用されています：
AI Translation —
This statement was translated using AI and may contain inaccuracies. Please refer to the original statement if in doubt.
Discussions
About Discussions
The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.
This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.
Open Discussions 0
No discussions in this category.
Issues
About Issues
If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.
Guidelines:
- This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
- Do not submit duplicated issues.
- Issues must be filed in English or Chinese only.
Active Issues 0
No issues in this category.
Closed/Resolved Issues 0
No issues in this category.