어리석은 소 컴퓨터 - Problem

#22575. 어리석은 소 컴퓨터

Statistics

디지털 기술에 익숙하지 않은 소들은 이진법 (기수2, cowmpouter) 계산기를 만들려다 기수-2로 만들었습니다! 부호 비트가 없어 기뻤습니다.

오른쪽부터 자리값은1,-2,4,-8,16,-32 등입니다.1부터 세면1,110,111,100,101,11010,11011,11000,11001 등입니다. 음수도 부호 없이1과0입니다.-1부터 내리면11,10,1101,1100,1111 등입니다.

보통 십진 정수를-2진법으로 변환하세요.

입력

-2,000,000,000..2,000,000,000의 정수 하나.

출력

선행0 없는-2진법 표현.0은 정확히0입니다.

예제

입력 1

-13

출력 1

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