Pagini recente » Cod sursa (job #98873) | Cod sursa (job #100106) | Cod sursa (job #1770920) | Cod sursa (job #2182213) | Cod sursa (job #1657869)
#include <fstream>
#define VAL 25
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int N, K, i;
int v[VAL], j;
int main()
{
fin >> N >> K;
for (i=1; i<=K; i++)
{
v[i]=i;
fout << v[i] << " ";
}
fout << '\n';
j=K;
v[K+1]=N;
while (v[1]<=N-K+1)
{
if (v[j]<v[j+1] && v[K]<=N)
{
v[j]++;
for (i=1; i<=K; i++)
fout << v[i] << " ";
fout << '\n';
}
else
{
j--;
v[j]++;
for (i=j+1; i<=K; i++)
v[i]=v[i-1]+1;
if (v[K]<=N)
{
j=K;
for (i=1; i<=K; i++)
fout << v[i] << " ";
fout << '\n';
}
}
}
fin.close();
fout.close();
return 0;
}