poj1032 Parliament
2011-11-21 09:19
302 查看
Parliament
Description
New convocation of The Fool Land's Parliament consists of N delegates. According to the present regulation delegates should be divided into disjoint groups of different sizes and every day each group has to send one delegate to the conciliatory committee. The composition of the conciliatory committee should be different each day. The Parliament works only while this can be accomplished.
You are to write a program that will determine how many delegates should contain each group in order for Parliament to work as long as possible.
Input
The input file contains a single integer N (5<=N<=1000 ).
Output
Write to the output file the sizes of groups that allow the Parliament to work for the maximal possible time. These sizes should be printed on a single line in ascending order and should be separated by spaces.
Sample Input
Sample Output
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 13632 | Accepted: 5722 |
New convocation of The Fool Land's Parliament consists of N delegates. According to the present regulation delegates should be divided into disjoint groups of different sizes and every day each group has to send one delegate to the conciliatory committee. The composition of the conciliatory committee should be different each day. The Parliament works only while this can be accomplished.
You are to write a program that will determine how many delegates should contain each group in order for Parliament to work as long as possible.
Input
The input file contains a single integer N (5<=N<=1000 ).
Output
Write to the output file the sizes of groups that allow the Parliament to work for the maximal possible time. These sizes should be printed on a single line in ascending order and should be separated by spaces.
Sample Input
7
Sample Output
3 4
#include <iostream> using namespace std; int main() { int n,i=4,m=5,j; scanf("%d",&n); while (m<n) m+=i++; j=m-n; m=2; if (j==1) { m=3; j=i-1; i++; } while (m<i-1) { if (m!=j) printf("%d ",m); m++; } printf("%d\n",i-1); return 0; }
相关文章推荐
- POJ 1032 Parliament
- poj 1032 Parliament 把自然数N分解成若干个互不相同的正整数,使乘积最大;
- poj 1032 Parliament (整数拆分)
- POJ 1032 Parliament (水题)
- poj_1032_Parliament(规律)
- poj 1032 Parliament 【思维题】
- poj 1032 Parliament
- poj 1032 Parliament
- poj 1032 Parliament 编程的小技巧
- POJ1032 Parliament【水题】
- POJ 1032 Parliament
- poj 1032 Parliament(正整数拆分不同数使乘积最大)
- POJ 1032 Parliament
- POJ - 1032 Parliament( 把正整数n表示成若干个不同的正整数的和,求积的最大值)
- POJ1032 Parliament
- POJ 1032--Parliament
- ♥POJ 1032-Parliament【数学】
- (Relax 水题1.2)POJ 1032 Parliament(将n分解成若干个互不相等的整数的和,并且是这些整数的乘积最大)
- POJ1032 Parliament
- POJ 1032 Parliament