H. 正整数N转换成二进制数

    Type: Default 1000ms 256MiB

正整数N转换成二进制数

You cannot submit for this problem because the contest is ended. You can click "Open in Problem Set" to view this problem in normal mode.

正整数N转换成二进制数

问题描述

输入一个不大于32767的整数 ( n ),将其转换为对应的二进制数。

输入描述

一行,一个整数 ( n )(( 0 \leq n \leq 32767 ))。

输出描述

一行,( n ) 对应的二进制表示(无需前导零)。

输入样例1

100

输出样例1

1100100

输入样例2

0

输出样例2

0

输入样例3

32767

输出样例3

1111111111111111

初中组冲刺

Not Attended
Status
Done
Rule
ACM/ICPC
Problem
8
Start at
2025-5-22 16:15
End at
2025-5-24 8:15
Duration
40 hour(s)
Host
Partic.
37