QOJ.ac

QOJ

Time Limit: 2 s Memory Limit: 256 MB Total points: 100

#22575. L’ordinateur bovin idiot

Statistics

Peu expérimentées en numérique, les vaches voulaient une machine binaire (base2, un cowmpouter), mais ont construit une base-2 ! Elles sont ravies car elle n’a pas de bit de signe.

Les poids de droite à gauche sont1,-2,4,-8,16,-32, etc. Compter depuis1 donne1,110,111,100,101,11010,11011,11000,11001, etc. Les négatifs utilisent aussi1 et0 sans signe. Descendre depuis-1 donne11,10,1101,1100,1111, etc.

Convertissez les entiers décimaux ordinaires en base-2.

Entrée

Un entier dans-2,000,000,000..2,000,000,000.

Sortie

L’entier en base-2 sans zéro initial. Écrivez0 exactement0.

Exemples

Entrée 1

-13

Sortie 1

110111

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:

  1. This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
  2. Do not submit duplicated issues.
  3. 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.