Pagini recente » Monitorul de evaluare | Istoria paginii runda/pregatire_oji_11-12_2/clasament | Istoria paginii runda/lsp_xi/clasament | Cod sursa (job #1210318) | Cod sursa (job #2012949)
#include<stdio.h>
#define MAXN 9
void bkt(int poz);
FILE*fin,*fout;
bool picked[MAXN];
int v[MAXN];
int N;
int main()
{
fin=fopen("permutari.in","r");
fout=fopen("permutari.out","w");
fscanf(fin,"%d",&N);
bkt(1);
fclose(fin);
fclose(fout);
return 0;
}
void bkt(int poz)
{
if(poz==N+1)
{
for(int i=1;i<=N;i++)
{
fprintf(fout,"%d ",v[i]);
}
fprintf(fout, "\n");
}
else
{
for(int i=1;i<=N;i++)
{
if(!picked[i])
{
picked[i]=1;
v[poz]=i;
bkt(poz+1);
picked[i]=0;
}
}
}
}