Cod sursa(job #1415039)
Utilizator | Data | 3 aprilie 2015 16:45:52 | |
---|---|---|---|
Problema | Generare de permutari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
using namespace std;
int n, k, i, sp, s[9];
ifstream f("permutari.in");
ofstream g("permutari.out");
int main()
{
f>>n;
k=1;
s[1]=0;
while (k>=1)
{
s[k]++;
if (s[k]>n)
{
k--;
}
else
{
sp=1;
for (i=1;i<k;i++)
if (s[i]==s[k])
sp=0;
if (sp)
if (k==n)
{
for (i=1;i<=n;i++)
g<<s[i]<<' ';
g<<'\n';
}
else
{
k++;
s[k]=0;
}
}
}
return 0;
}