[uva] 10098 - Generating Fast

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=107&page=show_problem&problem=1039

可重复子集生成问题, 看不懂题意的沙茶各种wa

//
//  main.cpp
//  uva10098
//
//  Created by ello on 12/5/13.
//  Copyright (c) 2013 NextLife. All rights reserved.
//

#include <cstdio>
#include <string>
#include <algorithm>
#include <cstring>

using namespace std;
string sortline;
string re;
void solve(int cur) {
    if (cur == sortline.size()) {
        puts(re.c_str());
        return;
    }
    for (unsigned int i = 0; i < sortline.size(); ++i) if (!i || sortline[i] != sortline[i - 1]) {
        string sub = re.substr(0, cur);
        int cnt1 = (int)count(sub.begin(), sub.end(), sortline[i]);
        int cnt2 = (int)count(sortline.begin(), sortline.end(), sortline[i]);
        if (cnt1 < cnt2) {
            re[cur] = sortline[i];
            solve(cur + 1);
        }
    }
}

int main(int argc, const char * argv[])
{
    int n = 0;
    scanf("%d\n", &n);
    for (int i = 0; i < n; ++i) {
        char str[20] = {0};
        gets(str);
        re = sortline = str;
        sort(sortline.begin(), sortline.end());
        solve(0);
        puts("");
    }
    return 0;
}