package cn.wzt;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Random;
import java.util.Set;
import java.util.regex.Matcher;
import java.util.regex.Pattern;
public class Zy {
public static void main(String[] args) {
Set<String> set = new HashSet<String>();
int i1=0;
while (true){
Random r = new Random();
StringBuffer sb = new StringBuffer("1");
String[] str = new String[]{"","+","-"};
for (int i = 2; i <= 9; i++) {
sb.append(str[r.nextInt(str.length)]);
sb.append(i);
}
var p = Pattern.compile("[+-]*[0-9]+");
var m = p.matcher(sb);
int sum=0;
while (m.find()){
int num=Integer.parseInt(m.group());
sum+=num;
}
if(sum==100&&!set.contains(sb.toString())){
System.out.printf("%d、 %s=100%n", ++i1,sb);
set.add(sb.toString());
}
if (set.size()==11){
break;
}
}
// for (String s : set) {
// System.out.printf("%s = 100%n", s);
// }
}
}
09-22
206