UVA 11192 - Group Reverse UVA • Sep 1, 2020 Problem PDFSolution:#include #include int main() { char a[100]; int i,j,n,p,s,l; while(scanf("%d",&p)==1) { if(p==0) break; scanf(" "); gets(a); l=strlen(a); n=l/p; s=0;j=0; while(j=j;i--) printf("%c",a[i]); j=j+n; } printf("\n"); } return 0; } https://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/11192/11192.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