POJ 1032 Parliament
来源:互联网 发布:大众软件2016 7月 编辑:程序博客网 时间:2024/05/17 04:01
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
7
Sample Output
3 4
思路:就是说拆分一个整数,使得拆开的数的乘积最大。
考虑一个数,只要能拆成两个大于1的数,则乘积一定大于等于原来的数。所以我们希望将它全部拆成2(或者n个2和1个3),但因为数字不能重复,所以对任意一个数,我们希望将它拆成以2开头的连续数列,最后剩余的数从大到小补到前面。
代码:
#include <cstdio>#include <iostream>#include <cstring>#include <vector>#include <map>#include <string>#include <cstring>#include <cmath>#include <algorithm>#include <cstdlib>using namespace std;int main(void){ #ifdef LOCAL freopen("in.txt","rb",stdin); //freopen("out.txt","wb",stdout); #endif // LOCAL int n,s[1000]; scanf("%d",&n); int l; for(l=2;n>=l;l++) { n-=l; s[l]=l; } l--; for(int i=2;i<=l;i++) s[i]+=n/(l-2+1); n=n%(l-2+1); for(int i=l;i>=l-n+1;i--) s[i]+=1; for(int i=2;i<=l;i++) { cout << s[i]; if(i!=l) cout << ' '; } return 0;}
- Parliament--POJ--1032
- POJ 1032 Parliament
- poj 1032 Parliament
- POJ 1032 Parliament (水题)
- POJ 1032 Parliament
- POJ 1032 Parliament 笔记
- POJ 1032 Parliament
- POJ 1032 Parliament
- POJ 1032--Parliament
- poj 1032 Parliament 整数拆分
- POJ 1032 Parliament
- ♥POJ 1032-Parliament【数学】
- poj 1032 Parliament 编程的小技巧
- POJ 1032 / Northeastern Europe 1998 Parliament (贪心)
- POJ 1032 Parliament 简单数论整数拆分
- poj 1032 Parliament (整数拆分)
- 1032 Parliament
- 1032 Parliament
- Python 高级特性之生成器表达式
- 航电ACM step1.2.3 Box of bricks
- Android资料之-EditText中的inputType
- Android内存优化之static使用篇
- 用VLFeat库进行k-means聚类(C++ 实现)
- POJ 1032 Parliament
- 常用正则表达式大全
- 关于应用程序加壳后,IAT钩子失效问题的破解
- [转] PHP中读取文件的几个方法
- Hive学习4_Hive on Spark: Getting Started_Common Issues
- MySql—解压缩版本的安装与配制
- NGUI 导入,场景准备
- android 新特性material design 之recyclerview 详解
- USB枚举过程分析