UVa 12279 - Emoogle Balance( simple linear scan)

Link:https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=244&page=show_problem&problem=3431
Sol:

#include <cstdio>
	using namespace std;
	int main() {
	int n, count = 0;
	while (scanf("%d", &n), n) {
	count++;
	int sum = 0, t;
	for (int i = 0; i < n; i++) {
	scanf("%d", &t);
	if (t > 0)
	sum++;
	else
	sum--;
	}
	printf("Case %d: %d\n", count, sum);
	}
	return 0;
	}