Cod sursa(job #2393028)
Utilizator | Traian Omin bitoneko | Data | 30 martie 2019 18:39:04 |
---|---|---|---|
Problema | Ordine | Scor | 10 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.58 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream cin("ordine.in");
ofstream cout("ordine.out");
int main()
{
string s;
cin >> s;
sort(s.begin(),s.end());
while (1)
{
bool doagain=0;
for(int i=1; i<s.size(); i++)
{
if(s[i]==s[i-1])
{
doagain=1;
break;
}
}
if(!doagain)
break;
next_permutation(s.begin(),s.end());
}
cout << s;
return 0;
}
/**
aaabbbbghc
abababcbgh
abababcbgh
*/