Win a copy of Micro Frontends in Action this week in the Server-Side JavaScript and NodeJS forum!

# ankit tuteja

Greenhorn
since Nov 30, 2005
Cows and Likes
Cows
0
In last 30 days
0
Total given
0
Likes
0
0
Total given
0
Given in last 30 days
0
Scavenger Hunt
Ranch Hand Scavenger Hunt
Greenhorn Scavenger Hunt

## Recent posts by ankit tuteja

14 years ago
Hi,, as the compiteion is over..

but i am not able to get the language of question...can anybody please tell in easy language...the meaning of problem... what its asking and whats is all about... it will great for all of us to do that problem... i am encouraging others to solve that personally and take the problem as challange..
here it is..

** THE QUESTION IS POSTED HERE ONLY TO KNOW THE MEANING OF IT...

==========================================================

Problem Statement

We make cardboard boxes. We manufacture a variety of sizes and are concerned that storing them and transporting them will be a problem unless we can nest them into a reasonable number of nested stacks. The boxes are rectangular, but they are open at the top so their heights don't matter. If we call the smaller horizontal dimension of a box its width and the other dimension its length, a box can be nested in another box if its width is less than the other's width, and its length is less than the other's length. No diagonal nesting is allowed.
We have automated the manufacturing process so that random sized boxes are produced. We specify values a, p, and n and the machine produces n boxes with dimensions:
(a,a^2) (a^3,a^4) (a^5,a^6) ... (a^(2n-1),a^(2n))
where a^j denotes (a to the j power) mod p.
Create a class UnNestable that contains a method maxCount that is given the positive integral values a, p, and n and that returns the size of the largest unnestable collection of boxes, where a collection is unnestable if no two boxes from the collection can be nested.
The sequence of boxes can be generated by
int rv=1;
for(int i=0; i<n; i++){
rv = (rv*a)%p; int x=rv;
rv = (rv*a)%p; int y=rv;
//process this box, which has dimensions x and y
}
Definition

Class:
UnNestable
Method:
maxCount
Parameters:
int, int, int
Returns:
int
Method signature:
int maxCount(int a, int p, int n)
(be sure your method is public)

Notes
-
The sequence may cycle, resulting in many boxes of the same dimensions. Duplicate boxes do count in the size of an unnestable collection
Constraints
-
p is between 2 and 2,000,000,000, inclusive.
-
a is between 1 and p-1, inclusive.
-
No power of a is divisible by p.
-
a*p is less than or equal to 2,000,000,000
-
n is between 1 and 10,000 inclusive
Examples
0)

10
15
3
Returns: 3
The random generator produces 10, (10*10)%15=10, 10*10%15=10, ... so the The three boxes are (10,10), (10,10), and (10,10). The entire collection is unnestable.
1)

10
17
4
Returns: 2
The sequence is 10, 100%17=15, 150%17=14, 140%17=4, 40%17=6, ... so the 4 boxes are (10, 15), (4, 14), (6, 9) and (5, 16). The non-nesting pairs are (10, 15) with (5, 16), (4, 14) with (6, 9), and (6, 9) with (5, 16). No collection of 3 of these boxes is pairwise unnestable.
2)

3
1000
3
Returns: 1
The boxes are (3,9), (27,81), and (243,729). The first one is nestable in both the others, and the second one is nestable in the third one. So there is no way to choose 2 of them which are unnestable. Of course, any collection of size one has the property that no two boxes from the collection can be nested.
3)

3
104729
10000
Returns: 9
14 years ago
hi today i got email for job opening where there is written

here what does mq skill means

Thanks
14 years ago
also put the sun java certification logo on ur resume...

what a eye catching resume it becomes...
14 years ago
it do help a lot...

i cleared my scjp certification above 90%
it helped me to crack written test and interview...
and created a gr8 impression to employers...and if you score v. good % in international level certifications of sunh then you can also prove that you have capability to get excellent marks ... even if you academic is not much good like ...till graduation i scored 2nd division maximum .

But in MCA i scored acceptable... but good score in scjp do gives confidence and more important deep knowledge...
so goo for it

good luck
14 years ago
Hi Ishan... congrats for getting job..

Can you or other Ranchers please tell me
how much time does it takes to get EP of Singapore if one got job there ?

what should Ishan do... should he left the oppourtunity or take its...
but here self-esteem matters or it will be fine with singaporion chines..

How are the employere there ? do they take care of the employees ? or treat them badly ?
any honest reply will be greatfull to of us ?

Best regards,
Ankit
14 years ago

Can you people ( who lives in singapore) tell me what is the average salary in singapore dollars for
1 years Exp
2 years Exp
3 years Exp
N year Exp
Lets do the salary survey of Singpaore.. It will deliver nice information to all ranchers who wanted to know more about singapore