POJ-3195

最新推荐文章于 2018-01-23 16:12:06 发布

x_liushi_game

最新推荐文章于 2018-01-23 16:12:06 发布

阅读量421

点赞数

分类专栏： ACM之旅文章标签： include

本文链接：https://blog.csdn.net/x_liushi_game/article/details/7436553

版权

ACM之旅专栏收录该内容

69 篇文章 0 订阅

订阅专栏

#include <stdio.h>

int main()
{
    int toys[1000], top = -1;
    int size, sum = 0;
    
    while (scanf("%d", &size) != EOF) {
          if (size < 0)
             toys[++top] = size;
          else {
               sum = 0;
               while (toys[top] > 0 && sum < size) {
                     sum += toys[top--];
               }
               if (sum >= size || toys[top] + size != 0) {
                  top = -1;
                  printf(":-( Try again.\n");
                  while ((sum = getchar()) != '\n' && sum != EOF)
                        ;
               }
               else  if (top == 0) {
                        if ((sum = getchar()) == '\n' || sum == EOF) {
                           top--;
                           printf(":-) Matrioshka!\n");
                        }
                        else {
                             top = -1;     
                             printf(":-( Try again.\n");
                             while ((sum = getchar()) != '\n' && sum != EOF)
                                   ;
                        } 
               }
               else 
                    toys[top] = -toys[top];
          }
          if (top != -1 &&((sum = getchar()) == '\n' || sum == EOF)) {
             top = -1;     
             printf(":-( Try again.\n");
          }
    }
    return 0; 
}