Pagini recente » Cod sursa (job #1026070) | Cod sursa (job #2172749) | Cod sursa (job #3225709) | Cod sursa (job #977275) | Cod sursa (job #1956026)
#include <fstream>
using namespace std;
short cifre[9];
short numar[9],n,contor=0;
ifstream f("permutari.in");
ofstream g("permutari.out");
void permutari()
{
if(contor==n)
{
for(short i=1;i<=n;i++)
g<<numar[i]<<" ";
g<<"\n";
}
for(short i=1;i<=n;i++)
{
while(cifre[i]==1&&i<=n)i++;
if(i<=n)
{
contor++;
numar[contor]=i;
cifre[i]=1;
permutari();
contor--;
cifre[i]=0;
}
}
}
int main()
{
for(int i=1;i<=8;i++)
cifre[i]=0;
f>>n;
permutari();
f.close();
g.close();
}