Pagini recente » Cod sursa (job #606650) | Cod sursa (job #2686448) | Cod sursa (job #2757551) | Cod sursa (job #882676) | Cod sursa (job #3030514)
#include <bits/stdc++.h>
using ll=long long;
#define S second
#define F first
#define endl '\n'
#define spid ios_base::sync_with_stdio(false);cin.tie(NULL);
const int mod=1e9+7;
const double pi=3.14159265359;
const int maxn=200001;
using namespace std;
int n;
void gen(int chk[8],vector<int> A){
if(A.size()==n){
for(int i=0;i<n;i++)cout<<A[i]<<" ";
cout<<endl;
return;
}
for(int i=0;i<n;i++){
if(chk[i]==0){
chk[i]=1;
A.push_back(i+1);
gen(chk,A);
chk[i]=0;
A.pop_back();
}
}
}
int main(){
ifstream cin("permutari.in");
ofstream cout("permutari.out");
cin>>n;
int chk[8];
for(int i=0;i<n;i++)chk[i]=0;
vector<int> A;
gen(chk,A);
}