Pagini recente » Cod sursa (job #488355) | Cod sursa (job #1377490) | Cod sursa (job #1975912) | Cod sursa (job #3190741) | Cod sursa (job #273692)
Cod sursa(job #273692)
#include<fstream.h>
ifstream in("permutari.in");
ofstream out("permutari.out");
int k,v[101],i,n;
void init()
{
v[k]=0;
}
int succ()
{
if(v[k]<n)
{
v[k]++;
return 1;
}
return 0;
}
int cond()
{
for(i=1;i<k;i++)
if(v[i]==v[k])
return 0;
return 1;
}
int sol()
{
if(k==n)
return 1;
return 0;
}
int main(void)
{
in>>n;//Permutari
k=1;
init();
while(k>0)
{
while(succ())
if(cond())
if(sol())
{
for(i=1;i<=n;i++)
out<<v[i]<<" ";
out<<"\n";
}
else
{
k++;
init();
}
k--;
}
in.close();
out.close();
return 0;
}