import java.util.Arrays;
import java.util.TreeSet;
import java.util.Random;
class Example {
public static void main
(String[] args
) { int min = 1;
int max = 49;
int total = 6;
// TreeSet's are always sorted, but slightly slower than HashSets
// Another option is to use a hashset, convert to a list then sort
TreeSet<Integer> numbers = new TreeSet<Integer>();
for(int i = 0; i < total; ++i) {
int n;
do {
n = r.nextInt(max - min + 1) + min;
} while(!numbers.add(n));
/* Or if you like confusing code:
while(!numbers.add(r.nextInt(max - min + 1) + min));
*/
}
System.
out.
print("Your Lucky Numbers Are "); for(int number : numbers) {
System.
out.
print(number
+ " "); }
}
}
aW1wb3J0IGphdmEudXRpbC5BcnJheXM7CmltcG9ydCBqYXZhLnV0aWwuVHJlZVNldDsKaW1wb3J0IGphdmEudXRpbC5SYW5kb207CgpjbGFzcyBFeGFtcGxlIHsKICAgIHB1YmxpYyBzdGF0aWMgdm9pZCBtYWluKFN0cmluZ1tdIGFyZ3MpIHsKICAgICAgICBpbnQgbWluID0gMTsKICAgICAgICBpbnQgbWF4ID0gNDk7CiAgICAgICAgaW50IHRvdGFsID0gNjsKICAgIAogICAgICAgIC8vIFRyZWVTZXQncyBhcmUgYWx3YXlzIHNvcnRlZCwgYnV0IHNsaWdodGx5IHNsb3dlciB0aGFuIEhhc2hTZXRzCiAgICAgICAgLy8gQW5vdGhlciBvcHRpb24gaXMgdG8gdXNlIGEgaGFzaHNldCwgY29udmVydCB0byBhIGxpc3QgdGhlbiBzb3J0CiAgICAgICAgVHJlZVNldDxJbnRlZ2VyPiBudW1iZXJzID0gbmV3IFRyZWVTZXQ8SW50ZWdlcj4oKTsKICAgIAogICAgICAgIFJhbmRvbSByID0gbmV3IFJhbmRvbSgpOwogICAgICAgIGZvcihpbnQgaSA9IDA7IGkgPCB0b3RhbDsgKytpKSB7CiAgICAgICAgICAgIGludCBuOwogICAgICAgICAgICBkbyB7CiAgICAgICAgICAgICAgICBuID0gci5uZXh0SW50KG1heCAtIG1pbiArIDEpICsgbWluOwogICAgICAgICAgICB9IHdoaWxlKCFudW1iZXJzLmFkZChuKSk7CiAgICAgICAgICAgIAogICAgICAgICAgICAvKiBPciBpZiB5b3UgbGlrZSBjb25mdXNpbmcgY29kZToKICAgICAgICAgICAgd2hpbGUoIW51bWJlcnMuYWRkKHIubmV4dEludChtYXggLSBtaW4gKyAxKSArIG1pbikpOwogICAgICAgICAgICAqLwogICAgICAgICAgICAKICAgICAgICB9CiAgICAgICAgU3lzdGVtLm91dC5wcmludCgiWW91ciBMdWNreSBOdW1iZXJzIEFyZSAiKTsKICAgICAgICBmb3IoaW50IG51bWJlciA6IG51bWJlcnMpIHsKICAgICAgICAgICAgU3lzdGVtLm91dC5wcmludChudW1iZXIgKyAiICIpOwogICAgICAgIH0KICAgICAgICBTeXN0ZW0ub3V0LnByaW50bG4oKTsKICAgIH0KfQ==