Pagini recente » Cod sursa (job #3173652) | Cod sursa (job #1609804) | Cod sursa (job #205112) | Cod sursa (job #2212214) | Cod sursa (job #1187961)
#include <cstdio>
using namespace std;
bool uz[20];
int sol[20],n;
void back(int p);
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d",&n);
back(1);
return 0;
}
void back(int p){
if(p==n+1){
for(int i=1;i<=n;i++)
printf("%d ",sol[i]);
printf("\n");
}
else{
for(int i=1;i<=n;i++)
if(uz[i]==0){
sol[p]=i;
uz[i]=1;
back(p+1);
uz[i]=0;
}
}
}