UVA 11713 - Abstract Names UVA • Sep 1, 2020 Problem PDFSolution:#include #include #include #include #include #include #include #include #include #include #include #include using namespace std; #define ll long long #define sc scanf #define pf printf #define Pi 2*acos(0.0) int main() { int t; char a[50],b[50],c[50],d[50]; sc("%d",&t); while(t--) { sc("%s",a); sc("%s",b); int l1=strlen(a); int l2=strlen(b); if(l1!=l2) { pf("No\n"); continue; } int j=0; int k=0; for(int i=0;ihttps://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/11713/11713.cpp Tags UVA Competitive Programming Shipu Ahamed Recommended for you UVA UVA 913 - Joana and the Odd Numbers 4 years ago • 1 min read UVA UVA 871 - Counting Cells in a Blob 4 years ago • 3 min read UVA UVA 866 - Intersecting Line Segments 4 years ago • 3 min read