Pagini recente » Cod sursa (job #2790555) | Cod sursa (job #2081805) | Cod sursa (job #1734850) | Cod sursa (job #863278) | Cod sursa (job #1105411)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
int n,S[9];
void back(int k)
{
int i,j,t;
if(k==n)
{
for(i=1;i<=n;i++)
g<<S[i]<<" ";
g<<endl;
}
else {
for(i=1;i<=n;i++){
t=1;
for(j=1;j<=k;j++)
if(S[j]==i) {t=0;break;}
if (t)
{
S[k+1]=i;
back(k+1);
}
}
}
}
int main()
{ f>>n;
back(0);
return 0;
}