Type: Default 1000ms 128MiB

质数的和与积

You cannot submit for this problem because the contest is ended. You can click "Open in Problem Set" to view this problem in normal mode.

题目描述

两个质数的和是S,它们的积最大是多少?

输入

一个不大于10000的正整数S,为两个质数的和。

输出

一个整数,为两个质数的最大乘积。数据保证有解。

样例

50

589

来源

一本通在线评测

基础赛

Not Attended
Status
Done
Rule
ACM/ICPC
Problem
13
Start at
2023-12-4 12:30
End at
2023-12-25 8:30
Duration
500 hour(s)
Host
Partic.
46