Pagini recente » Cod sursa (job #1291067) | Cod sursa (job #1372752) | Atasamentele paginii Clasament idunno | Cod sursa (job #943833) | Cod sursa (job #2354825)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int use[100001],m,n;
void afis ()
{
for(int i=1; i<=n; i++) if(use[i]) fout<<i<<" ";
fout<<'\n';
}
void bk(int k)
{
for(int i=k+1; i<=n; i++)
{
if(use[i]==0)
{
use[i]++;
k++;
if(k==m) afis();
else bk(k);
k--;
use[i]--;
}
}
}
int main()
{
fin>>n>>m;
bk(0);
return 0;
}