масив чисел

From

Vladimir Vassilevsky (2:5020/175.2)

To

Igor Kasyanchuk

Date

2002-12-28T22:35:20Z

Area

RU.ALGORITHMS

From: "Vladimir Vassilevsky" <vlv@fullnet.net>

Hi Igor,

Fri Dec 27 2002 16:23, Igor Kasyanchuk wrote to All:
 
 IK> Как в масив  А(10) можно закинуть 10 разных чисел от 0 до 9 чтобы
 IK> числа в масиве на ПОВТОРЯЛИСЬ  .
 
/*
(c)VLV
*/

#include <stdio.h>

unsigned int Factorial(unsigned int n)
{
unsigned int i,f = 1;

for(i = 2; i <= n; i++) f *= i;

return f;
}

//-----------------------------------------------
// Generate combination i from n! combinations
// 
//
void GetCombination(unsigned int *c, unsigned int n, unsigned int i)
{
unsigned int j,k,l,m;

for(k = 0; k < n; k++) c[k] = n;

m = 0;
j = Factorial(n);


for(k = n; k >= 1; k--)
 {
 j /= k;
 l = i/j;
 i -= l*j;
 l++;
 do {
    do { 
       if(++m == n) m = 0; 
       } while(c[m] != n);    
    } while(--l);
 c[m] = k-1; 
 }
}

#define N 10

void main(void)
{
unsigned int i,j,Nfact;
unsigned int c[N];

Nfact = Factorial(N);

for(i=0;i<Nfact;i++)
 {
 GetCombination(c, N, i);
 printf("\n");
 for(j=0;j<N;j++) printf(" %u",c[j]); 
 }
printf("\n");
}

 

"Не лыком единым шит человек"

--- ifmail v.2.15dev5
 * Origin: FidoNet Online - http://www.fido-online.com (2:5020/175.2)