HDU 2356 <抽屉原理>
来源:互联网 发布:虚拟机网络连接 编辑:程序博客网 时间:2024/06/06 06:06
Find a multiple
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 7429 Accepted: 3239 Special Judge
Description
The input contains N natural (i.e. positive integer) numbers ( N <= 10000 ). Each of that numbers is not greater than 15000. This numbers are not necessarily different (so it may happen that two or more of them will be equal). Your task is to choose a few of given numbers ( 1 <= few <= N ) so that the sum of chosen numbers is multiple for N (i.e. N * k = (sum of chosen numbers) for some natural number k).
Input
The first line of the input contains the single number N. Each of next N lines contains one number from the given set.
Output
In case your program decides that the target set of numbers can not be found it should print to the output the single number 0. Otherwise it should print the number of the chosen numbers in the first line followed by the chosen numbers themselves (on a separate line each) in arbitrary order.
If there are more than one set of numbers with required properties you should print to the output only one (preferably your favorite) of them.
Sample Input
5
1
2
3
4
1
Sample Output
2
2
3
推荐一个本校大神的博客,里面很详细链接在此
#include <stdio.h>#include <cstring>#define M 10010int main(){ int n, vis[M], sum[M], a[M], start, end; bool ok = false; while(scanf("%d", &n) != EOF) { memset(vis, 0, sizeof(vis)); sum[0] = 0; for(int i=1; i<=n; i++) { scanf("%d", &a[i]); sum[i] = sum[i-1] + a[i]; if(ok) { continue; } if(sum[i] % n == 0) { start = 0; end = i; ok = true; } if(vis[sum[i] % n]) { start = vis[sum[i]%n]; end = i; ok = true; } else { vis[sum[i]%n] = i; } } printf("%d\n", end-start); for(int i=start+1; i<=end; i++) { printf("%d\n", a[i]); } } return 0;}
- HDU 2356 <抽屉原理>
- hdu 5776 sum (抽屉原理)
- POJ 2356 抽屉原理
- POJ 2356 抽屉原理
- hdu 1808 Halloween treats 抽屉原理
- hdu 1205 吃糖果(抽屉原理)
- hdu 1808 Halloween treats 抽屉原理
- hdu 1808 Halloween treats 抽屉原理
- HDU 1205 吃糖果 (抽屉原理)
- hdu 3303(线段树+抽屉原理)
- 【HDU】1205 - 吃糖果(抽屉原理)
- HDU 5776 sum(抽屉原理)
- [HDU]1205 吃糖果 [抽屉原理]
- hdu 1205 吃糖果 抽屉原理
- HDU 1808 Halloween treats【抽屉原理】
- HDU 1808 Halloween treats(抽屉原理)
- 【hdu 1205】 吃糖果 (抽屉原理)
- poj 2356 简单抽屉原理
- SHA-1退休:数千万用户通向加密网站之路被阻
- 任务调度之Timer、TimerTask
- XML注入场景
- 简单的了解深度学习的运行机制
- Python新手学习基础之条件语句——if/else语句
- HDU 2356 <抽屉原理>
- hibernate实现增删改查的各种方法
- leetcode No58. Length of Last Word
- 2016 Multi-University Training Contest 3 1001 Sqrt Bo (模拟)
- c# 给字符串的第n个字符赋值
- hdu 3863 No Gambling (水博弈规律)
- Gluster集群搭建-安装Gluster环境
- 2016首次CCCC总结
- git clean