Pagini recente » Cod sursa (job #1953994) | Cod sursa (job #1777584) | Diferente pentru problema/tabara intre reviziile 1 si 8 | Cod sursa (job #2530796) | Cod sursa (job #1575568)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
int n,i,j,t=1,s[10];
int main()
{
f>>n;
for(i=2;i<=n;i++)t=t*i;
for(j=1;j<=n;j++)s[j-1]=j;
while(t>0)
{
for(i=0;i<n;i++)g<<s[i]<<" ";
g<<endl;
next_permutation(s,s+n);
t--;
}
f.close();g.close();
return 0;
}