Pagini recente » Cod sursa (job #2456824) | Cod sursa (job #1480357) | Cod sursa (job #1706137) | Cod sursa (job #2578700) | Cod sursa (job #1628915)
#include <fstream>
using namespace std;
ifstream in ("combinari.in");
ofstream out ("combinari.out");
int x[20], N, K;
void afis()
{ for (int i = 1; i < N; i ++)
out << x[i] << " ";
out << "\n";
}
int main()
{
int i;
in >> N >> K;
i = 1;
while(i > 0)
{ x[i] ++;
if(x[i] > N - K + i) i --;
else {if(i == K) afis();
else {i ++; x[i] = x[i - 1];}}
}
return 0;
}