1. 程式人生 > >【CodeForces735D】【哥德巴赫猜想】Taxes 題解

【CodeForces735D】【哥德巴赫猜想】Taxes 題解

Taxes

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.

Example
Input
4
Output
2
Input
27
Output
3

哥德巴赫
偷稅,就是把一個數字分解成質數,最少分幾個。(當然中央的決定權也是很重要的)(劃去)
拆成素數的話,答案就是1
素數當然是墜吼的

判斷:
1.判斷是否為偶數,偶數中如果是2輸出1,否則輸出2。不為偶數則繼續
2.判斷這個數字n是不是質數,是質數輸出1,否則繼續
3.判斷n-2是不是質數,是質數輸出2,否則輸出3

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <string>
#include <iomanip>
#include <ctime>
#include <climits>
#include <cctype>
#include <algorithm>
#define clr(x) memset(x,0,sizeof(x))
#define LL long long
#ifdef WIN32
#define AUTO "%I64d"
#else
#define AUTO "%lld"
#endif

using namespace std;

LL n;

bool check(int x){
    for(int i = 2; i*i <= x; i++)
        if(x%i == 0)return false;
    return true;
}

int main()
{
    scanf(AUTO,&n);
    if(n>2&&n%2==0)
        printf("2\n");
    else if(n==2)
        printf("1\n");
    else{
        if(check(n))cout<<"1"<<endl;
        else if(check(n-2))cout<<"2"<<endl;
        else cout<<"3"<<endl;
    }
}