{"trustable":true,"prependHtml":"\u003cstyle type\u003d\"text/css\"\u003e\n div.illustration {\n float: right;\n padding-left: 20px;\n }\n div.illustration .illustration {\n width: 100%;\n border-radius: 4px;\n }\n pre {\n display: block;\n margin: 0 0 10px;\n font-size: 13px;\n line-height: 1.42857143;\n color: #333;\n word-break: break-all;\n word-wrap: break-word;\n }\n\u003c/style\u003e\n\u003cscript\u003e\n window.katexOptions \u003d {\n delimiters: [\n {left: \u0027\\\\[\u0027, right: \u0027\\\\]\u0027, display: true}\n ]\n };\n\u003c/script\u003e\n","sections":[{"title":"","value":{"format":"HTML","content":"\n \u003cdiv style\u003d\"width:40.00%\" class\u003d\"illustration\"\u003e\n \u003cimg src\u003d\"CDN_BASE_URL/2158363f4463d471a60bbb44b8103797?v\u003d1715068150\" alt\u003d\"/problems/stickysituation/file/statement/en/img-0001.jpg\" class\u003d\"illustration\"\u003e\n\n \n \u003c/div\u003e\n\n \u003cp\u003eWhile on summer camp, you are playing a game of\n hide-and-seek in the forest. You need to designate a “safe\n zone”, where, if the players manage to sneak there without\n being detected, they beat the seeker. It is therefore of utmost\n importance that this zone is well-chosen.\u003c/p\u003e\n\n \u003cp\u003eYou point towards a tree as a suggestion, but your fellow\n hide-and-seekers are not satisfied. After all, the tree has\n branches stretching far and wide, and it will be difficult to\n determine whether a player has reached the safe zone. They want\n a very specific demarcation for the safe zone. So, you tell\n them to go and find some sticks, of which you will use three to\n mark a non-degenerate triangle (i.e.\u0026nbsp;with strictly\n positive area) next to the tree which will count as the safe\n zone. After a while they return with a variety of sticks, but\n you are unsure whether you can actually form a triangle with\n the available sticks.\u003c/p\u003e\n\n \u003cp\u003eCan you write a program that determines whether you can make\n a triangle with exactly three of the collected sticks?\u003c/p\u003e\n\n \u003ch2\u003eInput\u003c/h2\u003e\n\n \u003cp\u003eThe first line contains a single integer \u003cspan class\u003d\"tex2jax_process\"\u003e$N$\u003c/span\u003e, with \u003cspan class\u003d\"tex2jax_process\"\u003e$3 \\leq N \\leq 20\\, 000$\u003c/span\u003e, the number\n of sticks collected. Then follows one line with \u003cspan class\u003d\"tex2jax_process\"\u003e$N$\u003c/span\u003e positive integers, each less than\n \u003cspan class\u003d\"tex2jax_process\"\u003e$2^{60}$\u003c/span\u003e, the lengths of\n the sticks which your fellow campers have collected.\u003c/p\u003e\n\n \u003ch2\u003eOutput\u003c/h2\u003e\n\n \u003cp\u003eOutput a single line containing a single word: \u003ctt class\u003d\"ttfamily\"\u003epossible\u003c/tt\u003e if you can make a non-degenerate\n triangle with three sticks of the provided lengths, and\n \u003ctt class\u003d\"ttfamily\"\u003eimpossible\u003c/tt\u003e if you can not.\u003c/p\u003e\n\n \u003ch2\u003eSample 1\u003c/h2\u003e\u003cbody\u003e\u003ctable class\u003d\"vjudge_sample\"\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e3\n1 1 1\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003epossible\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n\u003c/body\u003e\n\n \u003ch2\u003eSample 2\u003c/h2\u003e\u003cbody\u003e\u003ctable class\u003d\"vjudge_sample\"\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e5\n3 1 10 5 15\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eimpossible\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n\u003c/body\u003e\n "}}]}