poj1247对半分

#include<iostream>
using namespace std;
typedef struct method
{
	int S,E;
};
int main()
{
	int guest[30],num,sum,half,count=0;
	method meth[100];
	cin>>num;
	while(num)
	{
		half=sum=0;
		for(int i=0;i<num;i++)
		{
			cin>>guest[i];
			sum+=guest[i];
		}
		for(int j=0;j<num-1;j++)
		{
			half+=guest[j];
			if((double)half==(double)sum/2.0) 
			{
				meth[count].S=j+1;meth[count++].E=j+2;
				break;
			}
			else if(half>sum/2){meth[count].E=meth[count++].S=0;break;}
		}
		cin>>num;
	}
	for(int i=0;i<count;i++)
	{
		if(meth[i].E)cout<<"Sam stops at position "<<meth[i].S<<" and Ella stops at position "<<meth[i].E<<"."<<endl;
		else cout<<"No equal partitioning."<<endl;
	}
	system("pause");
	return 0;
}