ACM (UVa) : 146


Use STL documentation: <algorithm>
next_permutation ()

Let, character array A [51];
Length = Input length of A

if ( next_permutation (A, A + Length) = 1 ) then
output: A // next permutation automatically assigned in A

otherwise
output: No Successor


#include <stdio.h>
#include <algorithm>

using namespace std;

int main () 
{
	char A [100], Len;

	while (scanf ("%s", A )) {

		if ( A [0] == '#' )
			break;

		Len = strlen (A);

		if (next_permutation (A, A + Len) )
			printf("%s\n", A);
		else
			printf("No Successor\n");
	}

	return 0;
}

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s