Pagini recente » Cod sursa (job #366317) | Cod sursa (job #810957) | Cod sursa (job #2022173) | Cod sursa (job #244329) | Cod sursa (job #2532453)
#include <bits/stdc++.h>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,k;
long long s[20];
void Read()
{
f>>n>>k;
f.close();
}
void back(long long l)
{
if(l == k)
{
for(int i = 1;i <= k;++i)
g<<s[i]<<" ";
g<<'\n';
}
else
{
for(int i = s[l] + 1;i <= n;++i)
{
s[l + 1] = i;
back(l + 1);
}
}
}
int main()
{
Read();
back(0);
g.close();
return 0;
}