题意:就是把一个数字分解成质数,最少分几个。比如样例,4分为2+2,27分为17+3+7,当然质数本身就不用分了,直接输出1就行了。
强哥德巴赫猜想 每个不小于 6 的偶数都是两个奇素数之和。
弱哥德巴赫猜想 每个不小于 9 的奇数都是三个奇素数之和
思路:那么如果是偶数,等于两个奇素数之和
如果是奇数,等于2+素数 或者 三个素数
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.
The first line of the input contains a single integer n (2 ≤ n ≤ 2·109) — the total year income of mr. Funt.
Print one integer — minimum possible number of burles that mr. Funt has to pay as a tax.
4
2
27
3
Co
#include<bits/stdc++.h>
using namespace std;
bool prime(int num)
{
int i,j;
if(num==2) return true;
int n=sqrt(num);
for(i=2;i<=n;i++) {
if(num%i==0) return false;
}
return true;
}
int main()
{
int n,i,j,ans;
cin>>n;
if(n==2) ans=1;
else if(n%2==0) ans=2;
else {
if(prime(n)) ans=1;
else {
if(prime(n-2)) ans=2;
else ans=3;
}
}
cout<<ans<<endl;
return 0;
}