Bachgold Problem
2017-02-23 21:03
477 查看
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.
Example
Input
Output
Input
Output
题目大意:给一个正整数N,判断它最多是多少个素数的和?并输出这些素数。
思路:因为要个数最多,最简单的想法就是,只用2和3。偶数就拆成(n/2)个2,奇数就拆成((n-3)/2)个2和1个3。
code:
#include<iostream>
#include<stdio.h>
using namespace std;
int main()
{
int n;
scanf("%d",&n);
if(n % 2 == 0)
{
n /= 2;
printf("%d\n",n);
for(int i=1; i<n; i++)
printf("%d ",2);
printf("%d\n",2);
}
else
{
n -= 3;
n /= 2;
printf("%d\n",n+1);
for(int i=1;i<=n;i++)
printf("%d ",2);
printf("%d\n",3);
}
return 0;
}
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.
Example
Input
5
Output
2 2 3
Input
6
Output
3 2 2 2
题目大意:给一个正整数N,判断它最多是多少个素数的和?并输出这些素数。
思路:因为要个数最多,最简单的想法就是,只用2和3。偶数就拆成(n/2)个2,奇数就拆成((n-3)/2)个2和1个3。
code:
#include<iostream>
#include<stdio.h>
using namespace std;
int main()
{
int n;
scanf("%d",&n);
if(n % 2 == 0)
{
n /= 2;
printf("%d\n",n);
for(int i=1; i<n; i++)
printf("%d ",2);
printf("%d\n",2);
}
else
{
n -= 3;
n /= 2;
printf("%d\n",n+1);
for(int i=1;i<=n;i++)
printf("%d ",2);
printf("%d\n",3);
}
return 0;
}
相关文章推荐
- Codeforces Round #388 (Div. 2)A Bachgold Problem
- Codeforces 749A-Bachgold Problem
- 749 A. Bachgold Problem
- 【codeforces 749A】Bachgold Problem
- 【codeforces 749A】Bachgold Problem
- Bachgold Problem CodeForces - 749A
- cf 749 A. Bachgold Problem
- 【codeforces 749A】Bachgold Problem
- Codeforces Round #388(Div. 2)A. Bachgold Problem【水题】
- A. Bachgold Problem
- A - Bachgold Problem vj
- 【codeforces 749A】Bachgold Problem
- POJ - 3622/USACO - Dec07 Gold Gourmet Grazers 挑剔的美食家 重庆一中高2018级竞赛班第五次测试 2016.7.26 Problem 4
- POJ - 3265/USACO - Jan07 Gold Problem Solving 动态规划(DP) | 对USACO官方题解0ms程序的解释
- 17A Noldbach problem
- SPOJ Problem 346:Bytelandian gold coins
- USACO 2016 US Open Contest, Gold Problem 3. 248
- Codeforces 17A Noldbach problem(数学)
- CodeForces-17A-Noldbach problem
- USACO 2017 January Contest, Gold Problem 1. Balanced Photo