Pagini recente » Cod sursa (job #1818106) | Cod sursa (job #96683) | Istoria paginii runda/ichb_11-12/clasament | Istoria paginii runda/tot_2/clasament | Cod sursa (job #2099508)
#include <fstream>
using namespace std;
ifstream fin ("submultimi.in");
ofstream fout ("submultimi.out");
int Back(int k);
bool Verifpoz(int k);
void ReadSolution(int k);
const int MaxN{50000};
int n, a[MaxN];
int main()
{
fin >> n;
Back(1);
fin.close();
fout.close();
return 0;
}
int Back(int k)
{
int i;
for (int i = a[k - 1] + 1; i <= n; ++i)
{
a[k] = i;
if (Verifpoz(k))
{
ReadSolution(k);
Back(k + 1);
}
}
}
bool Verifpoz(int k)
{
for (int i = 1;i < k; ++i)
if (a[i] == a[k])
return false;
return true;
}
void ReadSolution(int k)
{
for (int i = 1; i <= k; ++i)
fout << a[i] << ' ';
fout << '\n';
}