Pagini recente » Cod sursa (job #995835) | Cod sursa (job #369029) | Cod sursa (job #1387703) | Cod sursa (job #2303117) | Cod sursa (job #2197939)
#include <iostream>
#include <fstream>
#define N 20
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n,K;
int x[N];
void Back(int k)
{int i;
if(k==K+1)
{for(i=1;i<=K;i++)
fout<<x[i]<<" ";
fout<<endl;
}
else
for(i=x[k-1]+1;i<=n-K+k;i++)
{x[k]=i;
Back(k+1);
}
}
int main()
{fin>>n>>K;
Back(1);
fin.close();
fout.close();
return 0;
}