UVA Problem 12279 ( Emoogle Balance) Solution

Problem Solving, UVa

 

 

#include <bits/stdc++.h>

using namespace std;

int main()

{

    int tc,cases=1,n,a[1001],give,given,egl;

    while(cin>>n)

    {

        give=0,given=0;

        if (n==0) break;

        for(int i=0;i<n;i++)

        cin>>a[i];

        for(int i=0;i<n;i++)

        if(a[i]==0)  give++;

        else given++;

        egl=given-give;

        cout<<"Case "<<cases++<<":"<<" "<<egl<<endl;

    }

return 0;

}

 

0 Comments

You may find interest following article

Complete Guide: Create Laravel Project in Docker Without Local Dependencies

, , , | 0 Comments

Create Laravel Project Through Docker — No Need to Install PHP, MySQL, or Apache on Your Local Machine In this tutorial, I’ll show you how to create and run a full Laravel project using Docker containers. That means you won’t have to install PHP, MySQL, or Apache locally on your computer. By the end of this guide, you’ll have a fully functional Laravel development...