QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #290632 | #2007. 格雷码 | MoRanSky | 100 ✓ | 0ms | 3912kb | C++23 | 483b | 2023-12-25 06:12:10 | 2023-12-25 06:12:12 |
Judging History
answer
#include <cstdio>
#include <iostream>
using namespace std;
typedef unsigned long long LL;
const int N = 65;
int n, ans[N];
LL k;
int main(){
// freopen("code.in", "r", stdin);
// freopen("code.out", "w", stdout);
scanf("%d%llu", &n, &k);
int t = 0;
for (int i = 0; i < n; i++) {
int l = n - i - 1;
if(k >> l & 1) ans[i] = 1 ^ t;
else ans[i] = 0 ^ t;
if(ans[i] == 1) t ^= 1;
}
for (int i = 0; i < n; i++) printf("%d", ans[i]);
puts("");
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 5
Accepted
time: 0ms
memory: 3776kb
input:
2 2
output:
11
result:
ok "11"
Test #2:
score: 5
Accepted
time: 0ms
memory: 3788kb
input:
3 3
output:
010
result:
ok "010"
Test #3:
score: 5
Accepted
time: 0ms
memory: 3848kb
input:
4 10
output:
1111
result:
ok "1111"
Test #4:
score: 5
Accepted
time: 0ms
memory: 3848kb
input:
5 14
output:
01001
result:
ok "01001"
Test #5:
score: 5
Accepted
time: 0ms
memory: 3812kb
input:
6 33
output:
110001
result:
ok "110001"
Test #6:
score: 5
Accepted
time: 0ms
memory: 3792kb
input:
6 60
output:
100010
result:
ok "100010"
Test #7:
score: 5
Accepted
time: 0ms
memory: 3788kb
input:
9 500
output:
100001110
result:
ok "100001110"
Test #8:
score: 5
Accepted
time: 0ms
memory: 3736kb
input:
10 1000
output:
1000011100
result:
ok "1000011100"
Test #9:
score: 5
Accepted
time: 0ms
memory: 3844kb
input:
10 1023
output:
1000000000
result:
ok "1000000000"
Test #10:
score: 5
Accepted
time: 0ms
memory: 3852kb
input:
10 0
output:
0000000000
result:
ok "0000000000"
Test #11:
score: 5
Accepted
time: 0ms
memory: 3792kb
input:
32 123456
output:
00000000000000010001001101100000
result:
ok "00000000000000010001001101100000"
Test #12:
score: 5
Accepted
time: 0ms
memory: 3732kb
input:
63 2019000
output:
000000000000000000000000000000000000000000100011010100111100100
result:
ok "000000000000000000000000000000000000000000100011010100111100100"
Test #13:
score: 5
Accepted
time: 0ms
memory: 3844kb
input:
32 54321
output:
00000000000000001011111000101001
result:
ok "00000000000000001011111000101001"
Test #14:
score: 5
Accepted
time: 0ms
memory: 3856kb
input:
60 910200
output:
000000000000000000000000000000000000000010110001001011000100
result:
ok "000000000000000000000000000000000000000010110001001011000100"
Test #15:
score: 5
Accepted
time: 0ms
memory: 3908kb
input:
63 123321
output:
000000000000000000000000000000000000000000000010001000101100101
result:
ok "000000000000000000000000000000000000000000000010001000101100101"
Test #16:
score: 5
Accepted
time: 0ms
memory: 3912kb
input:
63 5000000
output:
000000000000000000000000000000000000000011010100110111011100000
result:
ok "000000000000000000000000000000000000000011010100110111011100000"
Test #17:
score: 5
Accepted
time: 0ms
memory: 3768kb
input:
63 998244353353442899
output:
000101100110111010001010000101011111000111111100001010101111010
result:
ok "000101100110111010001010000101011111000111111100001010101111010"
Test #18:
score: 5
Accepted
time: 0ms
memory: 3844kb
input:
63 9223372036854775807
output:
100000000000000000000000000000000000000000000000000000000000000
result:
ok "100000000000000000000000000000000000000000000000000000000000000"
Test #19:
score: 5
Accepted
time: 0ms
memory: 3780kb
input:
44 4444444444444
output:
01100000111110101011010011000110010010010010
result:
ok "01100000111110101011010011000110010010010010"
Test #20:
score: 5
Accepted
time: 0ms
memory: 3848kb
input:
64 18446744073709551615
output:
1000000000000000000000000000000000000000000000000000000000000000
result:
ok "1000000000000000000000000000000000000000000000000000000000000000"
Extra Test:
score: 0
Extra Test Passed