昨天真香了，今天继续补 codeforces/problem/735/D （数学+哥德巴赫猜想）

http://codeforces.com/problemset/problem/735/D

D. Taxes
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
Mr. Funt now lives in a country with a very specific tax laws. The total income of mr. Funt during this year is equal to n (n ≥ 2) burles and the amount of tax he has to pay is calculated as the maximum divisor of n (not equal to n, of course). For example, if n = 6 then Funt has to pay 3 burles, while for n = 25 he needs to pay 5 and if n = 2 he pays only 1 burle.

As mr. Funt is a very opportunistic person he wants to cheat a bit. In particular, he wants to split the initial n in several parts n1 + n2 + … + nk = n (here k is arbitrary, even k = 1 is allowed) and pay the taxes for each part separately. He can’t make some part equal to 1 because it will reveal him. So, the condition ni ≥ 2 should hold for all i from 1 to k.

Ostap Bender wonders, how many money Funt has to pay (i.e. minimal) if he chooses and optimal way to split n in parts.

Input
The first line of the input contains a single integer n (2 ≤ n ≤ 2·109) — the total year income of mr. Funt.

Output
Print one integer — minimum possible number of burles that mr. Funt has to pay as a tax.

Examples
inputCopy
4
outputCopy
2
inputCopy
27
outputCopy
3

题意

给你数N，任意拆成几份，不拆也行，不能拆成1.所有数的最大因子相加求最小。因子不能是本身。

思路

因为要最小，所以拆成质数肯定是最小，值为1。如果本身是质数，就输出1，如果是偶数，拆出一个质数，另一个也可以是质数，所以答案是2.如果是奇数，可以拆成一个质数，剩一个偶数。答案是3.网上搜了一把，发现原来是哥德巴赫猜想。

注意
如果是3这个奇数，他是由1,2来拆，但是2也是质数。