-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathThe XOR Problem
49 lines (36 loc) · 840 Bytes
/
The XOR Problem
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
#!/bin/python3
import math
import os
import random
import re
import sys
#
# Complete the 'maxXorValue' function below.
#
# The function is expected to return a STRING.
# The function accepts following parameters:
# 1. STRING x
# 2. INTEGER k
#
def maxXorValue(x, k):
result = ["0"] * len(x)
for i, val in enumerate(x):
if k == 0:
break
if val == "0":
result[i] = "1"
k -= 1
result = "".join(result)
return result
# print(maxXorValue("10010", 5)) # 01101
#
# print(maxXorValue("01010", 1)) # 10000
if __name__ == '__main__':
fptr = open(os.environ['OUTPUT_PATH'], 'w')
t = int(input().strip())
for t_itr in range(t):
s = input()
k = int(input().strip())
y = maxXorValue(s, k)
fptr.write(y + '\n')
fptr.close()