Pagini recente » Istoria paginii utilizator/serbanmaria15 | Istoria paginii utilizator/bicvasi | Istoria paginii utilizator/farte_vlad | Profil CatalinEu | Cod sursa (job #1184080)
/*
Keep It Simple!
*/
#include<fstream>
#include<fstream>
using namespace std;
int v[20], N, M;
ifstream f("combinari.in");
ofstream g("combinari.out");
void PrintFile(int k)
{
for (int j = 1; j <= k; j++)
g << v[j] << " ";
g << "\n";
}
bool valid(int k)
{
for (int i = 1; i < k;i++)
if (v[i] == v[k])
return 0;
return 1;
}
void Back(int k)
{
for (int i = v[k-1] + 1; i <= N; i++)
{
v[k] = i;
if (k == M)
PrintFile(k);
else if (k < M)
Back(k + 1);
}
}
int main()
{
f >> N >> M;
Back(1);
f.close();
g.close();
return 0;
}