Submission #9592877
Source Code Expand
N = int(input()) def dec_to_n(N, n): if N == 0: return "0" digits = [] base = 1 while N != 0: if N % (base * n) == 0: digits.append('0') else: digits.append('1') N -= base base *= n return "".join(digits[::-1]) print(dec_to_n(N, -2))
Submission Info
Submission Time | |
---|---|
Task | C - Base -2 Number |
User | takayg |
Language | PyPy3 (2.4.0) |
Score | 300 |
Code Size | 339 Byte |
Status | AC |
Exec Time | 167 ms |
Memory | 38256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01, sample_02, sample_03 |
All | 0_small0, 0_small1, 0_small2, 0_small3, 0_small4, 1_large0, 1_large1, 1_large2, 1_large3, 1_large4, 1_large5, 1_large6, 1_large7, 2_max0, 2_max1, sample_01, sample_02, sample_03 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_small0 | AC | 165 ms | 38256 KB |
0_small1 | AC | 163 ms | 38256 KB |
0_small2 | AC | 162 ms | 38256 KB |
0_small3 | AC | 163 ms | 38256 KB |
0_small4 | AC | 162 ms | 38256 KB |
1_large0 | AC | 162 ms | 38256 KB |
1_large1 | AC | 163 ms | 38256 KB |
1_large2 | AC | 165 ms | 38256 KB |
1_large3 | AC | 162 ms | 38256 KB |
1_large4 | AC | 164 ms | 38256 KB |
1_large5 | AC | 167 ms | 38256 KB |
1_large6 | AC | 164 ms | 38256 KB |
1_large7 | AC | 163 ms | 38256 KB |
2_max0 | AC | 162 ms | 38256 KB |
2_max1 | AC | 163 ms | 38256 KB |
sample_01 | AC | 165 ms | 38256 KB |
sample_02 | AC | 165 ms | 38256 KB |
sample_03 | AC | 165 ms | 38256 KB |