HDU : The Next Permutation


// @BEGIN_OF_SOURCE_CODE

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <stack>
#include <queue>
#include <vector>
#include <map>
#include <sstream>
#include <set>
#include <math.h>
#define pi acos(-1.0)
#define N 1000000
using namespace std;


int main ()
{
    int testCase;
    scanf ("%d", &testCase);

    while ( testCase-- ) {
        int dataset;
        scanf ("%d", &dataset);

        char input [80 + 20];
        scanf ("%s", input);

        char copy [80 + 20];
        strcpy (copy, input);

        int length = strlen (input);

        sort (copy, copy + length);
        reverse (copy, copy + length);

        if ( strcmp (copy, input) == 0 )
            printf ("%d BIGGEST\n", dataset);
        else {
            next_permutation (input, input + length);
            printf ("%d %s\n", dataset, input);
        }
    }

    return 0;
}

// @END_OF_SOURCE_CODE
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