Cod sursa(job #1377324)
| Utilizator | Data | 5 martie 2015 21:11:23 | |
|---|---|---|---|
| Problema | Combinari | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.79 kb |
#include <iostream>
using namespace std;
int a[20],b[20],nr=0;
void combinari(int k,int len,int max)
{
if(k-1==max){
for(int i=1;i<=max;i++)cout<<a[i];
cout<<endl;nr++;
}
else{
for(int i=1;i<=len;i++) if(!b[i] && a[k-1]<i){
a[k]=i;
b[i]=1;
combinari(k+1,len,max);
b[i]=0;
}
}
}
int main(){
int n,k;
cin>>n;
cin>>k;
combinari(1,n,k);
//cout<<nr;
return 0;
}
