Pagini recente » Cod sursa (job #798969) | Cod sursa (job #2074033) | Cod sursa (job #1618798) | Cod sursa (job #1307178) | Cod sursa (job #2128519)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
int k,v[20],n;
void init(){v[k]=0;}
int cond()
{
int i,c=1;
for(i=1;i<k;i++)
if(v[i]==v[k])c=0;
return c;
}
int sol()
{
return (n==k);
}
void afisare()
{
for(int i=1;i<=n;i++)
g<<v[i];
g<<'\n';
}
void bt()
{
k=1;
init();
while(k>0)
{
while(v[k]<n)
{
v[k]++;
if(cond())
{ if(sol()){afisare();}
else{k++;init();}}
}
k--;
}
}
int main()
{
f>>n;
bt();
return 0;
}