Friday 28 November 2014

UVa 12279 - Emoogle Balance Solution (UVALive 4853, Regionals 2010 >> Asia - Dhaka)

///     Raihan Ruhin
///     CSE, Jahangirnagar University.
///     Dhaka-Bangladesh.
///     id: raihanruhin (topcoder / codeforces / codechef / hackerrank / uva / uvalive, spoj), 3235 (lightoj)
///     mail: raihanruhin@ (yahoo / gmail / facebook)
///     blog: ruhinraihan.blogspot.com

#include<bits/stdc++.h>
using namespace std;

#define SET(a) memset(a,-1,sizeof(a))
#define CLR(a) memset(a,0,sizeof(a))
#define PI acos(-1.0)

#define MOD 1000000007
#define MX 100010
#define nl <<"\n"


int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);
    int n, tc, kk=1, x;
    string s;
    while(cin>>n && n)
    {
        int cnt=0;
        for(int i=0;i<n;i++)
        {
            cin>>x;
            if(x) cnt++;
            else cnt--;
        }
        cout<<"Case "<<kk++<<": "<<cnt nl;
    }
return 0;
}

No comments:

Post a Comment