A - Bachgold Problem CodeForces - 749A（水题）

Bachgold problem is very easy to formulate. Given a positive integer n represent it as a sum of maximum possible number of prime numbers. One can prove that such representation exists for any integer greater than 1.

Recall that integer k is called prime if it is greater than 1 and has exactly two positive integer divisors — 1 and k.

Input
The only line of the input contains a single integer n (2 ≤ n ≤ 100 000).

Output
The first line of the output contains a single integer k — maximum possible number of primes in representation.

The second line should contain k primes with their sum equal to n. You can print them in any order. If there are several optimal solution, print any of them.

Examples
Input
5
Output
2
2 3
Input
6
Output
3
2 2 2

题意：给一个数，分解成最多个数的素数

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

int main()
{
    int n;
    scanf("%d",&n);
    if(n%2==0)
    {
        int num = n/2;
        printf("%d\n",num);
        for(int i=0; i<num; i++)
            if(i==num-1)
            printf("2\n");
        else
            printf("2 ");
    }
    else
    {
        int num = n/2;
        printf("%d\n",num);
        for(int i=0; i<num; i++)
        {
            if(i==num-1)
                printf("3\n");
            else
                printf("2 ");
        }
    }
    return 0;
}