Pagini recente » Cod sursa (job #3235759) | Cod sursa (job #225450) | Cod sursa (job #2153861) | Cod sursa (job #2520683) | Cod sursa (job #1541688)
#include <fstream>
using namespace std;
ifstream f ("back1.in");
ofstream g ("back1.out");
int v[10] , n;
int verif ( int k )
{
for ( int i = 1 ; i < k ; ++i)
if ( v[k] == v[i])
return 0;
return 1;
}
void afis()
{
for ( int i = 1 ; i <= n ; ++i)
g << v[i] << ' ';
g << '\n';
}
void vback()
{
int k = 1;
v[k] = 0;
do
{
while (v[k] < n)
{
v[k]++;
if ( verif(k))
if(k == n)
afis();
else
{
k++;
v[k] = 0;
}
}
k--;
}while(k > 0);
}
int main ()
{
f >> n;
for ( int i =1 ; i <= n ; ++i )
f >> v[i];
vback();
g.close();
return 0;
}