Cod sursa(job #1316588)
Utilizator | Data | 13 ianuarie 2015 22:12:47 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream cin("combinari.in");
ofstream cout("combinari.out");
short n,k;
short Tab[20];
void back(int a)
{
if (a>k)
{
for (int i=1;i<=k;++i) cout<<Tab[i]<<" ";
cout<<"\n";
return;
}
for (int i=Tab[a-1]+1;i<=n;++i)
{
Tab[a]=i;
back(a+1);
}
}
int main(void)
{
cin>>n>>k;
back(1);
return 0;
}