Pagini recente » Cod sursa (job #1542457) | Cod sursa (job #2038997) | Cod sursa (job #1627433) | Cod sursa (job #2418344) | Cod sursa (job #850144)
Cod sursa(job #850144)
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <cassert>
using namespace std;
#define PRO "permutari"
void OpenFiles(int EVAL)
{
if(EVAL)
{
char input[100] = PRO, output[100] = PRO;
freopen(strcat(input, ".in"),"r",stdin);
freopen(strcat(output,".out"),"w",stdout);
} else
{
freopen("test.in","r",stdin);
freopen("test.out","w",stdout);
}
}
#define MAX 50001
#define INF 0xffffff
int n,x[10];
bool viz[10];
void next_permutation(int k)
{
for(int i=x[k]+1;i<=n;i++)
if(viz[i]==0)
{
viz[x[k]]=0;
x[k]=i;
viz[i]=1;
return;
}
viz[x[k]]=0;
next_permutation(k-1);
for(int i=1;i<=n;i++)
if(viz[i]==0)
{
x[k]=i;
viz[i]=1;
return;
}
}
int main(int argv,char *args[])
{
OpenFiles(argv==0);
// start
scanf("%d",&n);
for(int i=1;i<=n;i++)x[i]=i,viz[i]=1;
do{
for(int i=1;i<=n;i++)printf("%d ",x[i]);
printf("\n");
next_permutation(n);
}while(x[0]==0);
return 0;
}