POJ1247:Magnificent Meatballs
来源:互联网 发布:银行it招聘 编辑:程序博客网 时间:2024/05/21 10:14
Description
Sam and Ella run a catering service. They like to put on a show when serving meatballs to guests seated at round tables. They march out of the kitchen with pots of meatballs and start serving adjacent guests. Ella goes counterclockwise and Sam goes clockwise, until they both plop down their last meatball, at the same time, again at adjacent guests. This impressive routine can only be accomplished if they can divide the table into two sections, each having the same number of meatballs. You are to write a program to assist them.
At these catering events, each table seats 2 <= N <= 30 guests. Each guest orders at least one and at most nine meatballs. Each place at the table is numbered from 1 to N, with the host at position 1 and the host's spouse at position N. Sam always serves the host first then proceeds to serve guests in increasing order. Ella serves the spouse first, then serves guests in decreasing order. The figures illustrate the first two example input cases.
At these catering events, each table seats 2 <= N <= 30 guests. Each guest orders at least one and at most nine meatballs. Each place at the table is numbered from 1 to N, with the host at position 1 and the host's spouse at position N. Sam always serves the host first then proceeds to serve guests in increasing order. Ella serves the spouse first, then serves guests in decreasing order. The figures illustrate the first two example input cases.
Input
Input consists of one or more test cases. Each test case contains the number of guests N followed by meatballs ordered by each guest, from guest 1 to guest N. The end of the input is a line with a single zero.
Output
For each table, output a single line with the ending positions for Sam and Ella, or the sentence indicating an equal partitioning isn't possible. Use the exact formatting shown below.
Sample Input
5 9 4 2 8 35 3 9 4 2 86 1 2 1 2 1 26 1 2 1 2 1 10
Sample Output
Sam stops at position 2 and Ella stops at position 3.No equal partitioning.No equal partitioning.Sam stops at position 3 and Ella stops at position 4
题意就是两个人,一个从位置1出发顺时针走,一个从n出发逆时针走,如何才能将圆平分为总和相等的两部分,若能,输出两人最后的位置
#include <stdio.h>#include <string.h>#include <algorithm>using namespace std;int main(){ int n,a[50],i,j,sum,t; while(~scanf("%d",&n),n) { sum = 0; for(i = 1;i<=n;i++) { scanf("%d",&a[i]); sum+=a[i]; } t = 0; for(i = 1;i<=n;i++) { t+=a[i]; if(2*t==sum) break; } if(i<=n) printf("Sam stops at position %d and Ella stops at position %d.\n",i,i+1); else printf("No equal partitioning.\n"); } return 0;}
0 0
- poj1247(Magnificent Meatballs)
- POJ1247:Magnificent Meatballs
- 【模拟】poj1247 Magnificent Meatballs
- Magnificent Meatballs
- zoj 1402 Magnificent Meatballs
- POJ 1247 Magnificent Meatballs
- zoj 1402 Magnificent Meatballs
- zoj1402-------------Magnificent Meatballs
- ZOJ 1402 Magnificent Meatballs
- 1247 Magnificent Meatballs
- ZOJ 1402 Magnificent Meatballs
- zoj 1402 Magnificent Meatballs
- poj 1247 Magnificent Meatballs
- POJ 1247 Magnificent Meatballs
- zoj 1402 Magnificent Meatballs
- Magnificent Meatballs - 1247
- POJ 1247 Magnificent Meatballs 笔记
- zoj 1402 Magnificent Meatballs(水~)
- Windows Mobile 搭建OpenGL ES开发环境
- win8.1 华硕S300CA 触摸板 卡
- classpath变量的认识
- Solr 学习总结之配置文件内容
- 自动分组界面系统
- POJ1247:Magnificent Meatballs
- Oracle创建命名空间和新用户
- 如何发表高水平论文
- 建立index和search
- Windows下搭建MinGW+GTK开发环境
- POJ1250:Tanning Salon
- 笔记30- 数据库更新和程序版本更新问题
- 习惯的养成
- 寻找最近点对(POJ 3714)