Pagini recente » Cod sursa (job #251374) | Cod sursa (job #1572335) | Cod sursa (job #2043044) | Cod sursa (job #661873) | Cod sursa (job #2199933)
#include <fstream>
using namespace std;
int t[10],i,j,m,n;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
void pm(int k)
{
int i,j;
if (k==n)
{
for (i=1;i<=k;i++)
fout<<t[i]<<" ";
fout<<"\n";
return;
}
for(i=1;i<=n;i++)
{
int a=1;
for (j=1;j<=k;j++)
if (t[j]==i) {a=0; break;}
if (a) {t[k+1]=i; pm(k+1);}
}
}
int main()
{
fin>>n;
pm(0);
return 0;
}