FilesExpand file tree

 main

/

Sum_Of_Two_Values.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

43 lines (29 loc) · 1.01 KB

 main

/

Sum_Of_Two_Values.py

Copy path

Top

File metadata and controls

• Code
• Blame

43 lines (29 loc) · 1.01 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

####################################################################################

# Please consider trying a few more times before referring to this code.

# Code might be incorrect - TLE / Wrong Answer (especially filenames with _1 , _2)

# Pedagogical > Pythonic

####################################################################################

I = lambda : map(int, input().split())

n, x = I()

c = [(i + 1, j) for i, j in enumerate(I())]

c = sorted(c, key = lambda x: x[1])

found = False

# for idx, i in enumerate(c):

# if i >= x: continue

# if x - i in c:

# if idx == c.index(x - i): continue

# print(idx + 1, c.index(x - i) + 1)

# found = True

# break

i, j = 0, n - 1

while True:

if i >= j: break

if c[i][1] + c[j][1] == x:

print(f"{c[i][0]} {c[j][0]}")

found = True

break

elif c[i][1] + c[j][1] < x:

i += 1

else: j -= 1

if not found: print("IMPOSSIBLE")

# I once again ask you to try a few more times before referring here