Pagini recente » Cod sursa (job #202141) | Cod sursa (job #1777960) | Arhiva de probleme | Istoria paginii runda/feofjeofnqefe | Cod sursa (job #1877690)
#include <bits/stdc++.h>
using namespace std;
long long k,n,s[100];
bool ok;
ofstream out("permutari.out");
void back(long k){
if (k==n){
for (int i=1;i<=n;i++)
out<<s[i]<<" ";
out<<'\n';
}
else {
for (int i=1;i<=n;i++){
ok=true;
for (int j=1;j<=k;j++)
if (s[j]==i){
ok=false;
break;
}
if (ok==true){
s[k+1]=i;
back(k+1);
}
}
}
}
int main(){
ifstream cin("permutari.in");
cin>>n;
back(0);
return 0;
}