codeforces 735D 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 n 1 + n 2 + … + n k = 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 n i ≥ 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
input
4
output
2
input
27
output
3
题意：给你一个数n，拆分好几部分，税收是每个部分除本身以外的最大因子，问最少税收多少.
思路：可以想到分解成质数 税收最小为1，这样的解最少。只要知道哥德巴赫猜想，这个问题就很容易解决。
哥德巴赫猜想：任何一个大于二的偶数都可以写成两个质数之和。
强哥德巴赫猜想： 每个不小于2的偶数都是两个奇质数之和。
弱哥德巴赫猜想：任何一个大于7的奇数都可以写成三个奇质数之和。
分析 ：1.n是素数，直接输出1。
2.n是偶数 ，输出2。3.n是奇数，这时判断n-2是不是素数。如果是，输出2。 4.其他情况 输出3。
下面展示一些 内联代码片。

#include<math.h>
#include<algorithm>
#include<stdio.h>
#include<iostream>
#include<set>
#include<map>
#include<string.h> 
#include <queue>
using namespace std;
#define ll long long 
#define INF 0x3f3f3f3f
const int maxn=1e6+100;
int prime(int n)
{
	if(n==2||n==3) return 1;
	for(int i=2;i*i<=n;i++)
	{
		if(n%i==0) return 0;
	}
	return 1;
}
int main()
{
	int n;
	scanf("%d",&n);
	if(prime(n)) printf("1\n");
	else if(n%2==0||prime(n-2)) printf("2\n");
	else printf("3\n");
	return 0;
}