Taxes CodeForces - 735D
题目描述
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
Input
4
Output
2
Input
27
Output
3
题目大意
一个数的价值定义为其除自己以外的所有因数之和,可将一个数分解成几个数的和,则这个数的价值就是几个数的价值的和,求一个数的最小价值
解题思路
哥德巴赫猜想
强哥德巴赫猜想:任一大于2的偶数都可写成两个素数之和
弱哥德巴赫猜想:任一大于7的奇数都可写成三个质数之和
由此所有大于2的偶数的最小价值就是2,而大于7的奇数的最小价值当其本身为质数时为1,若其本身不为质数,但其-2为质数,则为2,否则为3
AC代码
#include<iostream>
#include<cstdio>
using namespace std;
typedef long long LL;
LL prime[6] = {2, 3, 5, 233, 331};
LL qmul(LL x, LL y, LL mod) {
return (x * y - (long long)(x / (long double)mod * y + 1e-3) *mod + mod) % mod;
}
LL qpow(LL a, LL n, LL mod) {
LL ret = 1;
while(n) {
if(n & 1) ret = qmul(ret, a, mod);
a = qmul(a, a, mod);
n >>= 1;
}
return ret;
}
bool check(LL p) {
if(p < 2) return 0;
if(p != 2 && p % 2 == 0) return 0;
LL s = p - 1;
while(! (s & 1)) s >>= 1;
for(int i = 0; i < 5; ++i) {
if(p == prime[i]) return 1;
LL t = s, m = qpow(prime[i], s, p);
while(t != p - 1 && m != 1 && m != p - 1) {
m = qmul(m, m, p);
t <<= 1;
}
if(m != p - 1 && !(t & 1)) return 0;
}
return 1;
}
int main()
{
int n;
scanf("%d",&n);
if(n==2||n==3) printf("1\n");
if(n==4) printf("2\n");
if(n==5) printf("1\n");
if(n==6) printf("2\n");
if(n==7) printf("1\n");
if(n>=8)
{
if(n%2==0) printf("2\n");
else
{
if(check(n)) printf("1\n");
else if(check(n-2))printf("2\n");
else printf("3\n");
}
}
}