I do not know, i really hope you dont fail!!!!!!!!!
Answer:
Explanation:
Let's do this in Python, first we need to convert the number into string in order to break it into a list of character, then we can replace the kth character with d. Finally we join all characters together, convert it to integer then output it
def setKthDigit(n, k, d):
n_string = str(n)
d_char = str(d)
n_char = [c for c in n_string]
n_char[k] = d_char
new_n_string = ''.join(n_char)
return int(new_n_string)
300 because it was good for it
DH is an algorithm to derive a shared secret over an unsafe channel.
Both parties exchange public keys, and can join them together with their private keys to create the secret. An eavesdropper can see both public keys, but since he doesn't posess the private keys, cannot derive the same secret.
The secret can be used to subsequently encrypt communications with a symmetric algorithm.
TLS uses this approach.
