@@ -0,0 +1,609 @@
+package AllDemoes;%0A%0Aimport java.util.Iterator;%0Aimport java.util.Scanner;%0Aimport java.util.Set;%0Aimport java.util.TreeSet;%0A%0A/**%0A * Created by Yogurt on 16/7/6.%0A */%0Apublic class %E6%98%8E%E6%98%8E%E7%9A%84%E9%9A%8F%E6%9C%BA%E6%95%B0 %7B%0A    public static void main(String%5B%5D args)%7B%0A        Scanner sc=new Scanner(System.in);%0A        while (sc.hasNextInt())%7B%0A            int n=sc.nextInt();%0A            Set%3CInteger%3E set=new TreeSet%3C%3E();%0A            for(int i=0;i%3Cn;i++)%0A                set.add(sc.nextInt());%0A            Iterator iterator=set.iterator();%0A            while(iterator.hasNext())%0A                System.out.println(iterator.next());%0A        %7D%0A    %7D%0A%7D%0A

solve mingming's rand number problem