UVA 11734 - Big Number of Teams will Solve This Shipu Ahamed - 01 Sep 2020 Problem PDFSolution:#include #include #include int main() { int n,i,g,f,j,k; char te[30],ju[30],t[30]; scanf("%d",&n); getchar(); for(i=1;i<=n;i++) { gets(te); gets(ju); if(strcmp(te,ju)==0) printf("Case %d: Yes\n",i); else { g=strlen(te); f=strlen(ju); if(g==f) printf("Case %d: Wrong Answer\n",i); else { for(j=0,k=0;jhttps://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/11734/11734.cpp