解题思路:
import java.math.BigInteger; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner input = new Scanner(System.in); String n = input.next(); int k = input.nextInt(); int[][] floyd = new int[10][10]; while (k-- > 0) { int x = input.nextInt(); int y = input.nextInt(); floyd[x][y] = 1; } for (int o = 0; o < 10; ++o) for (int j = 0; j < 10; ++j) for (int i = 0; i < 10; ++i) if (o != i && i != j && o != j) if (floyd[i][o] == 1 && floyd[o][j] == 1) floyd[i][j] = 1; BigInteger sum = new BigInteger("1"); for (int i = 0; i < n.length(); ++i) { int num = n.charAt(i) - '0'; int count = 1; for (int j = 0; j < 10; ++j) count += floyd[num][j]; sum = sum.multiply(BigInteger.valueOf(count)); } System.out.println(sum); } }
注意事项:
参考代码:
0.0分
1 人评分