Cod sursa(job #1318237)
| Utilizator | Data | 15 ianuarie 2015 19:30:52 | |
|---|---|---|---|
| Problema | Combinari | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
// Numerele de K cifre ( formate din cifrele
// pana la N ), in ordine crescatoare.
#include<iostream>
using namespace std;
int i,st[100],n,k,p;
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;
if(valid(p)) if(p==k) afisare(p);
else back(p+1);
}
}
int main()
{
cin>>n;cin>>k;
back(1);
return 0;
}
