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