Help in knowing how the code works

[krishna kumar.s]

The below code produces the unique numbers if numbers 2 to 100 are powered by 2 to 100 i.e 2 pow 2 2 pow 3..... 100 pow 100 . But i am not understanding how the code eliminates duplicates .

import java.math.BigInteger;import java.util.HashSet;import java.util.Set;
public class Problem29 {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		long timeInMillis = System.currentTimeMillis();

		Set<BigInteger> generated = new HashSet<BigInteger>();	
		for (int a = 2; a <= 100; a++) 
		{			
			for (int b = 2; b <= 100; b++)		
			generated.add(BigInteger.valueOf(a).pow(b));		
                }		
		System.out.println(generated.size());	
		
	long timeInMillis1 = System.currentTimeMillis();
		
	System.out.println(timeInMillis1-timeInMillis);
	}
	
}

[Anayonkar Shivalkar]

krishna kumar.s wrote:But i am not understanding how the code eliminates duplicates .

Hint: What data structure are you using to store your data(i.e. x pow x)?

[krishna kumar.s]

I got it the Hash set only takes unique values

[Winston Gutkowski]

krishna kumar.s wrote:I got it the Hash set only takes unique values

ANY java.util.Set (←click) only stores unique values. You can give it any value you like.

Winston

[krishna kumar.s]

Hi
Anayonkar Shivalkar and Winston Gutkowski thanks a lot for your input .