POJ 1247 水过

#include
int main()
{
int n,a[31]={0};
while(scanf("%d",&n) && n){
int sum = 0;
for(int i = 0;i < n;i ++){
scanf("%d",&a[i]);
sum += a[i];
}
for(int i = 0,t = 0;2 * t <= sum;i ++){     //原来用的sum/2，忘了考虑小数的问题，后改为乘法
t += a[i];
if(2 * t == sum){
printf("Sam stops at position %d and Ella stops at position %d.\n",i+1,i+2);
break;
}
if(2 * t > sum)printf("No equal partitioning.\n");    //这里总感觉有点别扭= =
}
}
return 0;
}