Cod sursa(job #1338703)
Utilizator | Data | 10 februarie 2015 11:46:48 | |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include <iostream>
using namespace std;
int n,k;
void back(int v[18],int l)
{
int i;
if(l==0)
for(v[l]=1;v[l]<=n;v[l]++)
{
back(v,l+1);
}
else
if(l!=k)
for(v[l]=v[l-1]+1;v[l]<=n;v[l]++)
{
back(v,l+1);
}
else
{
for(i=0;i<k;i++)
{
cout<<v[i]<<" ";
}
cout<<"\n";
}
}
int main()
{
int v[19]={0};
cin>>n>>k;
int l=0;
back(v,l);
return 0;
}