Cod sursa(job #1345653)
| Utilizator | Data | 17 februarie 2015 19:40:41 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
// Afiseaz Submultimile multimii N
#include<iostream>
using namespace std;
int i,st[100],n;
void afisare(int p){
for(i=1;i<=p;++i)
cout<<st[i]<<" ";
cout<<endl;
}
bool valid(int p){
int ok=1;
for(i=1;i<p;++i)
if(st[i]==st[p])
ok=0;
return ok;
}
void back(int p){
int pval;
for( pval=st[p-1]+1; pval<=n; ++pval ){
st[p]=pval;
afisare(p);
back(p+1);
}
}
int main()
{
cin>>n;
back(1);
return 0;
}
