All submissions for this problem are available.
Junkyard challenges a participant’s skill to ingeniously utilize the provided junk and transform it into a mechanically feasible and innovative contraption. The element of time constraint tests the fortitude and creativity in the participant. In addition to this, there are some area constraints too, which will test you. Area of N units means total area is (N+5)*(N-1). There is a limit L which is maximum area available to a participant. You will be given L. You have to tell the maximum number of units of Area possible.
Note: N can take integral values only.
There is a single positive integer T on the first line of input. It stands for the number of cases to follow. Each case consists of single line having the value of L.
Output consists of T lines, each line has an integer representing the maximum units of Area possible for given L. Output -1 if total area comes out to be 0 for possible units.
Input: 5 15 16 26 30 150 Output: 2 3 3 4 10
|Time Limit:||1 sec|
|Source Limit:||50000 Bytes|
|Languages:||C, CPP14, JAVA, GO|
Fetching successful submissions