Cod sursa(job #1703263)
Utilizator | Data | 16 mai 2016 17:54:44 | |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int n,a[19],k;
void back(int m)
{
int i;
if(m==k+1)
{
for(int j=1;j<=k;j++)cout<<a[j]<<" ";
cout<<'\n';
}
else
{
for(i=a[m-1]+1;i<=n-k+m;i++)
{
a[m]=i;
back(m+1);
}
}
}
int main()
{
in>>n>>k;
back(1);
return 0;
}