UVA12279 LA4853 Emoogle Balance【水题】

We have a very famous and popular fellow in our problemsetters’ panel. He is so famous that his name is immaterial. Some of his admirers have recently given him the nickname ’Emoogle’. Let’s stick to that name in our discussion for now. Being such a kind, friendly and generous person as he is, Emoogle is often known to give treats to the other problemsetters. Some times, there is a strange rumor in the air that his treats are mostly due to the fact that, if he is not sparing enough for those treats, ’problems’ are likely to be created. But let’s not pay heed to such nonsense!
Now, there is another word in the air that this remarkable man is going to get married soon. To observe this special occasion with proper respect, his fellow troublemakers have decided to compile a book named ’99 reasons why Emoogle should give us a treat’. Every single reason mentioned in this book is denoted by a number. For example, Emoogle should give us a treat because

If he does not, problems will be created. ?
His giveaway problem has been solved by less than 10 teams in the recent programming contest.
He is going to join a world famous goggles manufacturing company soon.
He has found a ticket of a soccer world cup game while digging his backyard garden in the morning.
He has just got a new Facebook fan club.
Having forgotten about a date with his wife-to-be which collided with a Topcoder SRM (Single Round Match), he participated in the SRM. (May God bless his soul!)
A programming contest (may be this one?) is being arranged celebrating his marriage.
He is getting engaged soon.
…
Solely because he is the great and kind and sweet Emoogle.

If you have any more ideas about why he should throw a party, we would love to know. Drop us a line at emoogle.party gmail.com.
    At this point, Dear brother Emoogle might want to remind us about the number of times he has already thrown a party. Hence we introduce the term Emoogle Balance. This is defined as:
Emoogle Balance = number of times Emoogle is supposed to give a treat according to the book - number of times he has actually given the treat.
    In this problem, we want you to find Emoogle Balance. We also wish that Emoogle Balance always keeps a healthy negative value and may dear brother Emoogle have a very happy married life forever.
Input
There are around 75 test cases in the input file. Each test case describes a series of events. A test case starts with an integer N (1 ≤ N ≤ 1000) denoting the number of events in this test case. This integer is followed by a line with N integers, each describing an event. These integers have values between 0 and 99 (inclusive). A value between 1 and 99 means a reason for Emoogle’s giving a treat has occurred while a 0 means he has given a treat.
    The end of input will be denoted by a case with N = 0. This case should not be processed.
Output
For each test case, print a line in the format, ‘Case X: Y ’, where X is the case number and Y is the Emoogle Balance for this case.
Sample Input
5
3 4 0 0 1
4
2 0 0 0
7
1 2 3 4 5 0 0
0
Sample Output
Case 1: 1
Case 2: -2
Case 3: 3

Regionals 2010 >> Asia - Dhaka

问题链接：UVA12279 LA4853 Emoogle Balance
问题简述：（略）
问题分析：
给定n个数，统计零和非零数的个数，输出其差值。
简单题不解释。
程序说明：（略）
参考链接：（略）
题记：（略）

AC的C++语言程序如下：

/* UVA12279 LA4853 Emoogle Balance */#include <bits/stdc++.h>using namespace std;int main()
{int n, a, caseno = 0;while(~scanf("%d", &n) && n) {int ans = 0;for(int i = 0; i < n; i++) {scanf("%d", &a);if(a) ans++; else ans--;}printf("Case %d: %d\n", ++caseno, ans);}return 0;
}

UVA12279 LA4853 Emoogle Balance【水题】相关推荐

水题/poj 1852 Ants
1 /* 2 PROBLEM:poj1852 3 AUTHER:Nicole 4 MEMO:水题 5 */ 6 #include<cstdio> 7 using namespace std ...
HDU2673-shǎ崽（水题）
如果不能够直接秒杀的题,就不算水题.又应证了那句话,有时候,如果在水题上卡住,那么此题对于你来说,也就不算是水题了额~~ 刚睡醒,迷迷糊糊. 题目的意思很简单,求一个最大的,再求一个最小的.几乎是什么 ...
图论刷水题记录（二）（最短路-----SPFA算法）
继第一篇的后续,又来刷水题了,写的是SPFA算法,这个算法的复杂度比较玄学,感觉能不用就不用了,但是他的好处就是可以判断负圈. 3月26日: 1.POJ 1847 Tram 题意:在一个交通网络上有N ...
图论刷水题记录（一）（最短路-----dijkstra算法）
最近实在不知道干些什么,感觉自己除了水题什么都不会做,算了去刷一刷图论的水题吧本来想合起来一起发,想了想太长的话以后看起来也不方便,题目所以今天晚上就先发了dij部分,由上到下由易变难. 1.POJ ...
hdu 2041:超级楼梯（水题，递归）
超级楼梯Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submissio ...
HDU2568 前进【水题】
前进 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submiss ...
CF Round #426 (Div. 2) The Useless Toy 思维水题
题目链接: http://codeforces.com/contest/834/problem/A 题目描述: 输入起始状态和结束状态和数列长度, 判断旋转方向是顺时针逆时针还是不合理解题思路: 长 ...
NUC1312 Sum【水题+数学题】
Sum 时间限制: 1000ms 内存限制: 65536KB 通过次数: 1总提交次数: 1 问题描述认为自然数是从1-N.将每个数和+或-联系起来,然后计算这个表达式的值我们得到一个和S.这个问题 ...
Codeforces 864 A Fair Game 水题
题目链接: http://codeforces.com/problemset/problem/864/A 题目描述: 看不是是不是一串数中只有两种数且这两种数字的数量是相同的解题思路: 水题, 水过 ...

UVA12279 LA4853 Emoogle Balance【水题】

UVA12279 LA4853 Emoogle Balance【水题】相关推荐

最新文章

热门文章