Cod sursa(job #2246565)
Utilizator | Data | 27 septembrie 2018 10:50:41 | |
---|---|---|---|
Problema | Nunta | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.54 kb |
#include <cstdio>
using namespace std;
int f[15],v[15];
void bkt(int i,int n)
{
if(i>n)
{
for(int j=1; j<=n; j++)
printf("%d ",v[j]);
printf("\n");
}
else
for(v[i]=1; v[i]<=n; v[i]++)
if(!f[v[i]])
{
f[v[i]]=1;
bkt(i+1,n);
f[v[i]]=0;
}
}
int main()
{
int n;
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%d",&n);
bkt(1,n);
return 0;
}