看这个算式:
☆☆☆ + ☆☆☆ = ☆☆☆
如果每个五角星代表 1 ~ 9 的不同的数字。
这个算式有多少种可能的正确填写方法?
173 + 286 = 459
295 + 173 = 468
173 + 295 = 468
183 + 492 = 675
以上都是正确的填写法!
注意:
111 + 222 = 333 是错误的填写法!
因为每个数字必须是不同的!
也就是说:1~9中的所有数字,每个必须出现且仅出现一次!
注意:
不包括数字“0”!
import java.util.ArrayList;
import java.util.List;
import java.util.Vector;
public class writeEquation {
private static List<Vector<Character>> filteredNonRedundantResult;
public static boolean isfilter(Vector<Character>result){
int a=(result.elementAt(0)-'0')*100+(result.elementAt(1)-'0')*10+(result.elementAt(2)-'0');
int b=(result.elementAt(3)-'0')*100+(result.elementAt(4)-'0')*10+(result.elementAt(5)-'0');
int c=(result.elementAt(6)-'0')*100+(result.elementAt(7)-'0')*10+(result.elementAt(8)-'0');
if(a+b==c)
return true;
else
return false;
}
public static void permutation(Vector<Character>source,Vector<Character>result){
if(source.size()==0&&isfilter(result)){
boolean exit=false;
for(int i=0;i<filteredNonRedundantResult.size();i++){
int ra=(result.elementAt(0)-'0')*100+(result.elementAt(1)-'0')*10
+(result.elementAt(2)-'0');
int rb=(result.elementAt(3)-'0')*100+(result.elementAt(4)-'0')*10
+(result.elementAt(5)-'0');
int fa=(filteredNonRedundantResult.get(i).elementAt(0)-'0')*100+
(filteredNonRedundantResult.get(i).elementAt(1)-'0')*10+
(filteredNonRedundantResult.get(i).elementAt(2)-'0');
int fb=(filteredNonRedundantResult.get(i).elementAt(3)-'0')*100+
(filteredNonRedundantResult.get(i).elementAt(4)-'0')*10+
(filteredNonRedundantResult.get(i).elementAt(5)-'0');
if(ra==fb&&rb==fa){
exit=true;
break;
}
}
if(exit==false){
filteredNonRedundantResult.add(new Vector<Character>(result));
}
return;
}for(int i=0;i<source.size();i++){
Vector<Character> tsource=new Vector<Character>(source);
Vector<Character> tresult=new Vector<Character>(result);
tresult.add(tsource.elementAt(i));
tsource.remove(i);
new writeEquation().permutation(tsource, tresult);
}
}
public static void print(Vector<Character>source){
System.out.printf("%c%c%c + %c%c%c=%c%c%c",source.elementAt(0),
source.elementAt(1),source.elementAt(2),source.elementAt(3),source.elementAt(4),source.elementAt(5),
source.elementAt(6),source.elementAt(7),source.elementAt(8));
}
public static void main(String[] args) {
// TODO Auto-generated method stub
Vector<Character> source=new Vector<Character>();
Vector<Character> result=new Vector<Character>();
for(int i=1;i<=9;i++){
source.add((char) (i+'0'));
}
writeEquation.filteredNonRedundantResult=new ArrayList<Vector<Character>>();
writeEquation.permutation(source, result);
for(int i=0;i< writeEquation.filteredNonRedundantResult.size();i++){
writeEquation.print( writeEquation.filteredNonRedundantResult.get(i));
System.out.println();
}
}
}