-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSequenceEquation.py
48 lines (36 loc) · 919 Bytes
/
SequenceEquation.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
45
46
47
48
#!/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
n = len(p)
result = []
for i in range(1, n+1, 1):
x = -1
for j in range(n):
if p[j] == i:
x = j + 1
break
for j in range(n):
if p[j] == x:
x = j + 1
break
result.append(x)
return result
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()