import java.util.Set;
import java.util.TreeSet;

public class Print {

	public static void main(String[] args) {

		String str = new String("abc");

		char[] ch = { 'a', 'b', 'c' };

		change(str, ch);

		System.out.println(str + "  ");

		System.out.println(ch + "  ");

		int i = 0, j = 0;

		int[] myArray = new int[100];

		Set<Integer> aa = new TreeSet<Integer>();

		while (true) {
			int t = (int) (1 + (Math.random() * (100)));
			if(aa.contains(t)){
				continue;
			}else{
				aa.add(t);
				myArray[aa.size()-1]=t;
			}
		

			if (aa.size() == 100) {
				break;
			}

		}

		for (Integer value : aa) {
			System.out.print(value + " ");
		}

		System.out.println(" ");
		
		
		for (Integer value : myArray) {
			System.out.print(value + " ");
		}


		
		System.out.println(" \naa.size  " + aa.size());

	}

	public static void change(String str, char[] ch) {
		str = "gbc";

		ch[0] = 'g';
	}

}