Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <cstring>
- #include <algorithm>
- using namespace std;
- int n,P[128];
- char X[11],s[11],v[]="aeiou";
- void back(int k)
- {
- for(int i=0;i<n;++i)
- if(!P[(int)s[i]])
- {
- X[k]=s[i];
- P[(int)s[i]]=1;
- if(strchr(v,X[0]))
- {
- if(k==n-1)
- {
- if(strchr(v,X[n-1]))
- cout<<X<<'\n';
- }
- else
- back(k+1);
- }
- P[(int)s[i]]=0;
- }
- }
- int main()
- {
- cin>>s;
- n=strlen(s);
- sort(s,s+n);
- back(0);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement