Pagini recente » Cod sursa (job #3250582) | Cod sursa (job #1906414) | Cod sursa (job #2518129) | Cod sursa (job #2085957) | Cod sursa (job #3244924)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
int n, s[10], nr = 0;
bool valid(int k)
{
for(int i = 1; i < k; i++)
if(s[i] == s[k]) return 0;
return 1;
}
void afis(int k)
{
nr++;
for(int i = 1; i <= k; i++)
g << s[i] << ' ';
g << '\n';
}
void bkt()
{
int k = 1;
s[k] = 0;
bool gasit;
while(k > 0)
{
gasit = 0;
while(s[k] < n && gasit == 0)
{
s[k]++;
gasit = valid(k);
}
if(gasit == 1)
if(k == n)
afis(k);
else s[++k] = 0;
else k--;
}
}
int main()
{
f >> n;
bkt();
///cout << "Numarul solutiilor: " << nr;
f.close();
g.close();
return 0;
}