Codeforces Round #324 (Div. 2) 584D. Dima and Lisa

                             

             解题报告： Codeforces Round #324 (Div. 2)

D. Dima and Lisa

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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. 1 ≤ k ≤ 3
2. pi is a prime
3. 

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.

Sample test(s)

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.

题意：给你一个数n，问你怎么拆分成k个数素，1 ≤ k ≤ 3，3 ≤ n < 109

 输出任意一个情况都可以。

分析：哥德巴赫猜想 +快速判断数素

#include 
     
     
      
      
#include 
      
      
       
       
#include 
       
       
        
        
using namespace std;
bool isPrime(int num)
{
    if (num == 2 || num == 3)
    {
        return true;
    }
    if (num % 6 != 1 && num % 6 != 5)
    {
        return false;
    }
    for (int i = 5; i*i <= num; i += 6)
    {
        if (num % i == 0 || num % (i+2) == 0)
        {
            return false;
        }
    }
    return true;
}

int main()
{
    int n,i;
    while(~scanf("%d",&n))
    {
        if(isPrime(n)) printf("1\n%d\n",n);
        else
        {
            if(n%2==0)
            {
                for(i=n/2;; i--)
                    if(isPrime(i)&&isPrime(n-i)) break;
                printf("2\n%d %d\n",i,n-i);
            }
            else
            {
                n-=3;
                for(i=n/2;; i--)
                    if(isPrime(i)&&isPrime(n-i)) break;
                printf("3\n3 %d %d\n",i,n-i);
            }
        }
    }
    return 0;
}