Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- ifstream in("suma35.in");
- ofstream out("suma35.out");
- long long n,k, st[101],v[101],ap[101],x;
- int valid(int k){
- if(k==1&&v[st[k]]==0) return 0;
- return 1;
- }
- int sol(int k){
- if(k==n) return 1;
- return 0;
- }
- void tipar (int k){
- for(int i=1;i<=k;i++)
- cout<<v[st[i]];
- cout<<'\n';
- }
- void backt(int k){
- for(int i=1;i<=n;i++){
- st[k]=i;
- if(ap[st[k]]==0&&valid(k)){
- ap[st[k]]=1;
- if(k==n) tipar(k);
- else backt(k+1);
- ap[st[k]]=0;
- }
- }
- }
- int main()
- {
- cin>>x;
- while(x>0){
- v[++n]=x%10;
- x=x/10;
- }
- sort(v+1,v+n+1);
- backt(1);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement