ZZZ Server^™
ZZZ Base^™
ZZZ++^™

NoSQL database

The work on this documentation started on 07/26/2016 and the last change was 05/29/2018.

The copyrights of this documentation belong to ZZZ Ltd.
Copyright (C) 2016 - 2018 ZZZ Ltd. All rights reserved.

This guide is fully implemented with the ZZZ Server!

Here is an example program using a ZZZ Server cycle:

#[#;
--------------------------------------------------------------------------------

site: http://demo.zzz.bg
	
-------- © 2018 Z. Georgiev ----------------------------------------------------
																			   ]
#[.=; add size ;[
	#[ add the path. ;/sizes/{size}/;[
		#[ change ;#[+;1;#[ get ];0]]
	]]
]]
#[=.; add size ;{size}]

#[.=; stonesForCrown ;[
																			#[#;
	-------- The base is in the memory because its name starts with temp_ -----]
	#[ base ;temp_stones.zzz]
	#[ open the base for writing. ;[
		#[==;#[ JSON2ZZZ ;/input/;{ "stones":[[{stones}]] }]]

#[ move to the path. ;/input/stones/;[
			#[{ .? };[
				#[.=;_index_;#[ get ]]
				#[ subset ]
				#[ add size ;#[ get ]]
				#[ move to the path ;/input/stones/##[_index_]]
			];[
				#[ next? ]
			]]
		]]

#[ move to the path. ;/sizes/;[
			#[{ .? };[
				#[.=;_size_;#[ get ]]
				#[ subset ]
				#[ add the path ;/counts/##[fmtl;%03lld;#[ get ]]/##[fmtl;%03lld;##[_size_]]]
				#[ move to the path ;/sizes/##[_size_]]
			];[
				#[ next? ]
			]]
		]]
		
		#[.=;_result_;-1]
		#[ move to the path. ;/counts/;[
			#[ last. ;[
				#[{ .? };[
					#[>=n;#[ elements count ];2;[
						#[.=;_ok_]
						#[ subset. ;[
							#[ last. ;[
								#[=;_result_;##[fmtl;%lld;#[ get ]]]
							]]
						]]
					];[
						#[.=;_ok_;#[ previous? ]]
					]]
				];[
					##[_ok_]
				]]
			]]
		]]
		
		##[_result_]
	]]
]]
#[=.; stonesForCrown ;{stones}]

#[#;
-------- main -----------------------------------------------------------------]
#[out;
	♠ input: [[1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 6, 6, 4, 4, 6, 6, 4, 4, 6, 6, 5]] -> 
		#[ stonesForCrown ;[1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 6, 6, 4, 4, 6, 6, 4, 4, 6, 6, 5]]
		#[ new line ]
	♣ input: [[1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 6, 6, 5]] -> 
		#[ stonesForCrown ;[1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 6, 6, 5]]
		#[ new line ]
	♥ input: [[1, 1, 2, 2, 3, 3, 7]] -> 
		#[ stonesForCrown ;[1, 1, 2, 2, 3, 3, 7]]
		#[ new line ]
	♦ input: [[1, 2, 2, 7, 7, 7]] -> 
		#[ stonesForCrown ; [1, 2, 2, 7, 7, 7]]
]

#[#;
-------- Condition of the task: ------------------------------------------------

A jeweler is given an order to make a crown. He is given a set of n
precious stones of sizes s1, ..., sn. The size of each stone is
proportional to its value.

To make the crown perfect, he has decided to attach two rows of
stones of equal length to the front of the crown. All the stones in
a row must be of the same size, and the jeweler can't have any
leftovers, so he must use all available stones of that size.

In order to make the crown as valuable as possible, the jeweler would
like to use the maximum total number of stones. If there are multiple
choices for maximizing the number of stones, he should choose the one
that has the larger maximum size of stone.

You need to help the jeweler choose the stones for the two rows.
Return the largest stone size that would be attached to the most
valuable possible crown, or -1 if it is impossible to design the
crown with the given set of stones.

Example

For stones = [1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 6, 6, 5], the output
should be stonesForCrown(stones) = 2.

There are 4 possibilities for the sets of stones the jeweler
could use: (2, 2, 2, 1, 1, 1), (4, 4, 3, 3), (6, 6, 4, 4) and
(6, 6, 3, 3). Although (6, 6, 4, 4) would have the largest stones,
(2, 2, 2, 1, 1, 1) has the most stones, so the answer is 2.

For stones = [1, 1, 2, 2, 3, 3, 7], the output should be
stonesForCrown(stones) = 3.

There are 3 possible crowns that could be made from these stones:
(2, 2, 1, 1), (3, 3, 1, 1), and (3, 3, 2, 2). All of these
contain the same number of stones, and the largest size is 3, so
the answer is 3.

For stones = [1, 2, 2, 7, 7, 7], the output should be
stonesForCrown(stones) = -1.

It's not possible for the jeweler to make 2 rows of equal length
from these stones (remember: he must use all the stones of each
chosen size).

Input/Output

[execution time limit] 3 seconds (java)

[input] array.integer stones

An array of integers representing the sizes of each of the stones.

Guaranteed constraints:
1 ≤ stones.length ≤ 105,
1 ≤ stones[i] ≤ 103.

[output] integer

The largest stone size that would be attached to the most valuable
possible crown, or -1 if it is impossible to design a crown with
the given set of stones.
--------------------------------------------------------------------------------
																			   ]

Press the button [Run], to see the result of the program.

A program using commands for simplified access to the database via: simplify.txt

#[ remove the base ]
#[ open the base for writing ]	
	#[ add ;fruits]
	#[ subset ]
		#[ add ;apples]#[ add ;pears]#[ add ;plums]
		#[ superset ]
	#[ add ;vegetables]
	#[ subset ]
		#[ add ;carrots]#[ add ;cucumbers]#[ add ;cabbage]
		#[ superset ]
	#[ add ;cars]
	#[ subset ]
		#[ add ;German]
		#[ subset ]
			#[ add ;Audi]
			#[ add ;BMW]
			#[ add ;Mercedes Benz]
			#[ add ;Opel]
			#[ add ;VW]
			#[ superset ]
		#[ add ;French]
		#[ subset ]
			#[ add ;Citroen]
			#[ add ;Peugeot]
			#[ add ;Renault]
			#[ superset ]
		#[ add ;Italian]
		#[ subset ]
			#[ add ;Fiat]
			#[ superset ]
		#[ add ;American]
		#[ subset ]
			#[ add ;Ford]
			#[ superset ]
		#[ add ;Japanese]
		#[ subset ]
			#[ add ;Honda]
			#[ add ;Mazda]
			#[ add ;Mitsubishi]
			#[ add ;Nissan]
			#[ add ;Toyota]
			#[ superset ]
		#[ add ;South Korean]
		#[ subset ]
			#[ add ;Hyundai]
			#[ add ;Kia]
			#[ superset ]
		#[ add ;Spanish]
		#[ subset ]
			#[ add ;Seat]
			#[ superset ]
		#[ add ;Czech]
		#[ subset ]
			#[ add ;Skoda]
			#[ superset ]
		#[ superset ]

#[ close the base ]
#[ get the base as a simple text ]

A program using commands for simplified access to the database via: simplify.txt

ZZZ Server™

ZZZ Server™ ZZZ Base™ ZZZ++™ NoSQL database

The work on this documentation started on 07/26/2016 and the last change was 05/29/2018.

Contents

This guide is fully implemented with the ZZZ Server!

ZZZ Server^™

ZZZ Server^™
ZZZ Base^™
ZZZ++^™

NoSQL database