-
Notifications
You must be signed in to change notification settings - Fork 0
/
permutation-equation.py
44 lines (33 loc) · 963 Bytes
/
permutation-equation.py
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
#https://www.hackerrank.com/challenges/permutation-equation/problem?isFullScreen=true
#!/bin/python3
import math
import os
import random
import re
import sys
#
# Complete the 'permutationEquation' function below.
#
# The function is expected to return an INTEGER_ARRAY.
# The function accepts INTEGER_ARRAY p as parameter.
#
def permutationEquation(p):
# Write your code here
# Store the the element-index in key, value pair for O(1) lookup
m = dict()
res = []
for i, e in enumerate(p):
m[e] = i
for i in range(1, len(p) + 1):
x = m[i] + 1 # adding 1 since m[i] is zero based index
y = m[x] + 1
res.append(y)
return res
if __name__ == '__main__':
fptr = open(os.environ['OUTPUT_PATH'], 'w')
n = int(input().strip())
p = list(map(int, input().rstrip().split()))
result = permutationEquation(p)
fptr.write('\n'.join(map(str, result)))
fptr.write('\n')
fptr.close()