PAT 5 凑算式(dfs)
2018-03-18 13:26
232 查看
凑算式
这个算式中A~I代表1~9的数字,不同的字母代表不同的数字。
比如:
6+8/3+952/714 就是一种解法,
5+3/1+972/486 是另一种解法。
这个算式一共有多少种解法?
注意:你提交应该是个整数,不要填写任何多余的内容或说明性文字。
A-I代表1-9的数字,不是0-9
答案:public class Main{
private static int[] a;
private static int sum = 0;
private static int[] visited;
public static void dfs(int step) {
a = new int[10];
visited = new int[10];
if (step == 10) {
if (a[1] + a[2] / a[3] + (a[4] * 100 + a[5] * 10 + a[6])
/ (a[7] * 100 + a[8] * 10 + a[9]) == 10) {
sum++;
}
return;
}
for (int i = 1; i <=9; i++) {
if (visited[i] == 0) {
a[step] = i;
visited[i] = 1;
dfs(step + 1);
visited[i] = 0;
}
}
return;
}
public static void main(String[] args) {
dfs(1);
System.out.println(sum);
}
有错
Exception in thread "main" java.lang.ArithmeticException: / by zero
相关文章推荐
- PAT1-马虎算式(暴力+dfs)
- PAT 1068. Find More Coins (30) DFS,01背包
- PAT甲级1003---迷宫问题(DFS或Dijkstra)
- PAT - 甲级 - 1034. Head of a Gang (30)(DFS求连通块)
- pat 甲1114. Family Property (dfs)
- PAT (Advanced Level)1018. Public Bike Management (30) 迪杰斯特拉算法 DFS 递归(难)
- 蓝桥杯 神奇算式 dfs
- PAT (Advanced Level) 1053. Path of Equal Weight (30) 求树根到叶子和为所给数值的路径,DFS后排序
- PAT--1103. Integer Factorization (dfs)
- PAT-A 1034. Head of a Gang (dfs)
- PAT甲题题解-1115. Counting Nodes in a BST (30)-(构建二分搜索树+dfs)
- PAT 1018. Public Bike Management (dijkstra + dfs + 剪枝)
- PAT甲级1018【Public Bike Management】 dfs
- PAT 1103. Integer Factorization (30)(dfs)
- 【PAT】 Deepest Root (DFS)
- PAT甲题题解-1106. Lowest Price in Supply Chain (25)-(dfs计算树的最小层数)
- PAT1030 Travel Plan (30)---DFS
- PAT 7 三羊献瑞(dfs)
- PAT 1091. Acute Stroke (30) 3重方向并查集(其实非递归DFS也可以,,)
- 1079. Total Sales of Supply Chain (25)-PAT甲级真题(dfs,bfs,树的遍历)