from itertools import*
s=map(int,input().split())
d=x=0
for a,b,c in combinations(s,3):
a,b,c=sorted([a,b,c]);d=max(d,a+b==c)
if a+b>c:x="TRIANGLE";break
else:x=["IMPOSSIBLE","SEGMENT"][d]
print(x)
Yeah I found Python interesting to work in because of 1) indents 2) to split over lines you need to be in the middle of a pair of brackets or use `\` or something
meh, I was thinking about leaving the first number in the first array on the stack, because it won't affect the result (since it's positive), but it amounts to the same number of characters, because finding min takes two more then:
Let's take a grid of 16x16 printable ASCII characters (code points 0x20 to 0x7E). There are 30-choose-15 paths from the top left to the bottom right corner, making only orthogonal moves, like the following example:
##..............
.#..............
.######.........
......##........
.......##.......
I just thought the challenge was interesting because, unlike normal quines, the information you have to output easily has less entropy than the code used to write it
Since you just need to know space/non-space
jqt looks like REPL to me, and I can't see a save button anyway... does J have an associated file extension?
For the J programming language, I'd guess .j, but I've also seen .ijs and .ijt. Is it one of these, or even something else?
