Pagini recente » Cod sursa (job #1360854) | Cod sursa (job #2581010) | Cod sursa (job #243187) | Cod sursa (job #2173672) | Cod sursa (job #166105)
Cod sursa(job #166105)
#include<fstream.h>
int s[9],k=1,n,cont,i;
int main()
{
ifstream f("permutari.in");
ofstream g("permutari.out");
f>>n;
s[k]=0;
while (k>0)
if(s[k]<n)
{ s[k]++; cont=1;
for(i=1;i<k;i++)
if(s[i]==s[k]) cont=0;
if(cont)
if(k==n)
{ for(i=1;i<=k;i++)
g<<s[i]<<" ";
g<<'\n';
}
else { k++; s[k]=0;}
}
else k--;
f.close();
g.close();
return 0;
}