영어 원문입니다. 원문의 수식·표를 글자로 옮겨 모양이 다를 수 있습니다. 정확한 내용은 원문 페이지에서 확인하세요. 원문 페이지 열기 (새 창)
Problem
163
547
+829
----
1539Figure 1: The three three-digit numbers are all primes and the digits 1, 2, …, 9 are each used exactly once in the three numbers
In the figure you see an ordinary addition of three three-digit numbers. What is special about the numbers is that they are all prime numbers. Furthermore, each of the nine digits 1, 2, …, 9 appears exactly once in the three numbers.
Write a program that determines how many such additions can be formed. The program should also determine the highest and lowest values of these sums.
Note that all additions containing the same three numbers are considered the same addition.
Input
This problem has no input.
Output
Print three integers: the number of additions, the lowest value of a sum, and the highest value of a sum.