UVA 12545 - Bits Equalizer

Problem PDF

Solution:

#include
#include
#include
#include
#include
#include
#include
#include
#include
#include 
#include 
#include
#define ll long long
#define sc scanf
#define pf printf
#define Pi 2*acos(0.0)
using namespace std;
int main()
{
    int n,no=0;
    char s[10000],t[10000],temp;
    sc("%d",&n);
    while(n--)
    {
        sc("%s%s",s,t);
        int l1=strlen(s);
        int l2=strlen(t);
        if(l1>l2||l1ot)
        {
           pf("Case %d: -1\n",++no);
        }
        else
        {
          pf("Case %d: %d\n",++no,zs+os-min(zs,os)+ws);
        }
    }
    return 0;
}
https://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/12545/12545.cpp