UVA 146 - ID Codes UVA • Sep 1, 2020 Problem PDFSolution:#include #include #include #include using namespace std; int main() { char s[100]; while(gets(s)) { if(s[0]=='#') break; int l=strlen(s); if(next_permutation(s,s+l)) puts(s); else printf("No Successor\n"); } return 0; } https://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/146/146.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