Pagini recente » Cod sursa (job #2406650) | Cod sursa (job #1585420) | Cod sursa (job #2888972) | Cod sursa (job #1571553) | Cod sursa (job #1002541)
#include <fstream>
using namespace std;
int a[18];
int main()
{
int n,k,i,nr,p,c,cc;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
fin >> n >> k;
fin.close();
for(i = 1;i<=k;i++) a[i] = i;
for(i = 1;i<=k;i++) fout << a[i]<<" ";
fout <<"\n";
p = n-k+1;
c = k;
cc =0;
while(a[1] != p)
{
while (a[c] < n-cc)
{
a[c]++;
for(i = 1;i<=k;i++) fout << a[i]<<" ";
fout <<"\n";
}
c--;
cc++;
// fout<<"\n";
//a[1] = p ;
}
fout.close();
return 0;
}