Pagini recente » Cod sursa (job #2720131) | Cod sursa (job #1562537) | Cod sursa (job #117358) | Cod sursa (job #1835785) | Cod sursa (job #1797672)
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
long s[21]={0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20};
long n,k;
void inapoi(long l)
{
int i;
if(l==k)
{
for(i=1;i<=k;i++)
fout<<s[i]<<" ";
fout<<"\n";
}
else
{
for(i=s[l]+1;i<=n;i++)
{
s[l+1]=i;
inapoi(l+1);
}
}
}
int main()
{
fin>>n>>k;
inapoi(0);
fin.close();
fout.close();
return 0;
}