Cod sursa(job #2302241)
Utilizator | Data | 13 decembrie 2018 23:03:05 | |
---|---|---|---|
Problema | Generare de permutari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
int k, s[100], n;
bool ok(int x, int k)
{
for(int i=1; i<k; i++) if(x == s[i]) return 0;
return 1;
}
void afis()
{
for(int i=1; i<=n; i++) g << s[i] << ' ';
g << '\n';
}
void Back(int k)
{
for(int i=1; i<=n; i++){
if(ok(i, k)){
s[k] = i;
if(k == n) afis();
else Back(k+1);
}
}
}
int main()
{
f >> n;
Back(1);
return 0;
}