Cod sursa(job #1396961)
| Utilizator | Data | 23 martie 2015 10:20:11 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <bits/stdc++.h>
using namespace std;
int N;
bool visited[100];
int num[100];
void perm(int ind)
{
if(ind==N){
for(int k=0;k<N;k++)
cout<<num[k]<<" ";
cout<<"\n";
return ;
}
for(int k=0;k<N;++k)
if(!visited[k]){
visited[k]=1;
num[ind]=k+1;
perm(ind+1);
visited[k]=0;
}
}
int main()
{
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
cin>>N;
for(int k=0;k<N;k++)
num[k]=k+1;
perm (0);
return 0;
}
