ConsecutiveFloors

Problem Statement
	
A newly opened hotel has one or more buildings. Each building has one or more floors. Different buildings may have a different number of floors.

All the buildings are currently empty. Before any guests move in, the hotel was approached by president Smith. President Smith is planning to rent several consecutive floors of a single hotel building as his office.

The president's interns have already researched some possibilities. You are given the results of their research in int[]s x and y. The meaning of these results is as follows: for each valid i, if the president wants to rent exactly x[i] consecutive floors in any single building, there are exactly y[i] distinct ways to do so.

You do not know how the hotel looks like. All you have are the interns' notes. Return "Consistent" if there exists a hotel consistent with the research notes. Otherwise, return "Inconsistent".

 
Definition
	
Class:	ConsecutiveFloors
Method:	isConsistent
Parameters:	int[], int[]
Returns:	String
Method signature:	String isConsistent(int[] x, int[] y)
(be sure your method is public)
    
 
Constraints
-	x and y will contain between 2 and 50 elements, inclusive.
-	x and y will contain the same number of elements.
-	Each element of x and y will be between 1 and 10^9, inclusive.
-	For each valid i, x[i] will be strictly less than x[i+1].
-	For each valid i, y[i] will be strictly greater than y[i+1].
 
Examples
0)	
	
{1, 2}
{3, 1}
Returns: "Consistent"
The research is consistent with a hotel that has two buildings: a building with one floor and a building with two floors. We can easily verify that there are indeed three distinct ways to rent a single floor, and only one way to rent two consecutive floors.
1)	
	
{1, 3}
{2, 1}
Returns: "Inconsistent"
According to the research, there are two ways to rent a single floor and there is one way to rent three consecutive floors. This is inconsistent: if there is a way to rent three consecutive floors, there are clearly at least three different ways to rent a single floor.
2)	
	
{1, 2, 3}
{6, 3, 1}
Returns: "Consistent"
This can happen if the hotel has three buildings with 1, 2, and 3 floors, respectively.
3)	
	
{1, 2, 3}
{6, 4, 1}
Returns: "Inconsistent"
4)	
	
{1, 2, 3}
{30, 20, 10}
Returns: "Consistent"
This can happen if the hotel has 10 buildings, each with 3 floors.
5)	
	
{477381380, 518025930, 570087601, 737384427}
{933387341, 532515987, 318113054, 112496297}
Returns: "Consistent"
6)	
	
{308943472, 309514623, 420739506, 433180054, 824938090}
{825002165, 692190478, 565185585, 520367469, 109640379}
Returns: "Inconsistent"
7)	
	
{120488476, 120910581, 191235701, 273389056, 325781420, 732516446}
{984130593, 891325429, 628742451, 440622881, 368262567, 198194666}
Returns: "Inconsistent"