Pagini recente » Cod sursa (job #3278331) | Cod sursa (job #1834835) | Cod sursa (job #1269867) | Cod sursa (job #11131) | Cod sursa (job #2150952)
#include <iostream>
#include<fstream>
using namespace std;
ifstream in("date.in");
ofstream out("date.out");
int n,st[100],k;
bool valid(int k)
{
for(int i=1;i<k;i++)
if(st[i]==st[k]) return 0;
return 1;
}
void afis()
{
for(int i=1;i<=n;i++)
cout<<st[i]<<" ";
cout<<endl;
}
int backt(int k)
{
if(k==n+1) afis();
else for(st[k]=1;st[k]<=n;st[k]++)
if(valid(k)) backt(k+1);
}
int main()
{
cin>>n;
backt(1);
return 0;
}
/*
#include <iostream>
#include<fstream>
using namespace std;
ifstream in("date.in");
ofstream out("date.out");
int n,k,q,p;
int prima(int k);
int doua(int k);
int prima(int k)
{
if(k==0) return 0;
else
return doua(k);
}
int doua(int k)
{
if(k==1) return k;
else return prima(k);
}
int main()
{
k=0;
cout<<doua(k);
return 0;
}
*/