质数

##Dima and Lisa
Dima loves representing an odd number as the sum of multiple primes, and Lisa loves it when there are at most three primes. Help them to represent the given number as the sum of at most than three primes.

More formally, you are given an odd numer n. Find a set of numbers pi (1 ≤ i ≤ k), such that

1 ≤ k ≤ 3
pi is a prime

The numbers pi do not necessarily have to be distinct. It is guaranteed that at least one possible solution exists.

Input
The single line contains an odd number n (3 ≤ n < 109).

Output
In the first line print k (1 ≤ k ≤ 3), showing how many numbers are in the representation you found.

In the second line print numbers pi in any order. If there are multiple possible solutions, you can print any of them.

Example
Input
27
Output
3
5 11 11
Note
A prime is an integer strictly larger than one that is divisible only by one and by itself.

题意：给你一个数，将他拆成几个质数的和，质数个数最多三个。
首先分析，当为一个时，说明该数的本身就是质数。当有两个的时候，只有奇数和偶数这种情况。2是唯一的既是偶数又是质数的数。故 奇数和2只需判断 n-2是不是质数就好。当有三个数时，有 奇数、奇数和奇数，奇数、偶数和偶数 两种情况，第二种只需要验证 n-4是不是质数就好。第一种情况，我们可以先找出接近 n 的质数maxx，然后再重复以上的猜想来寻找 n-maxx.

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
using namespace std;

int judge(int n)
{
    if(n==2 || n==3)
        return 1;
    int k=sqrt(n);
    for(int i=2; i<=k; i++)
    {
        if(n%i==0)
            return 0;
    }
    return 1;

}

int main()
{
    int n,m,k,i;
    while(~scanf("%d",&n))
    {
        if(judge(n))
            printf("1\n%d\n",n);
        else if(judge(n-2))
            printf("2\n2 %d\n",n-2);
        else if(judge(n-4))
            printf("3\n2 2 %d\n",n-4);

        else
        {
            for(i=n-3; i>=n-300&&i>=1; i--)
            {
                if(judge(i))
                {
                    k=i;
                    break;
                }
            }
            m=n-i;
            if(judge(m))
                printf("2\n%d %d\n",m,k);
            else
            {
                for(i=2; i<=m; i++)
                {
                    if(judge(i)&&judge(m-i))
                    {
                        printf("3\n%d %d %d\n",i,m-i,k);
                        break;
                    }
                }
            }
            return 0;
        }

    }
}