6] = { fun1, fun2, fun3, fun4, fun5, fun6};
////////////////////////////////////////////////////////////////////////////////
int gordanA (int n, int m)
{int i, j, k, ir;
double s, c;
for (j = 0; j
for (s = 0, i = 0; i <(n - j); i + +) if (fabs (A [i] [j])> fabs (s)) s = A [ir = i] [j];
if (s == 0) return -1; p> for (k = j + 1; k
c = A [ir] [k]/s;
for (I = 0; i
for (I = ir + 1; i
A [n - 1] [k] = c;
}
}
return 0;
}
///////////////////////////////////////////////////////////////////////////////
long double Stp (int a, int n)
{
long double c, bi;
int k;
c = 1;
k = n;
bi = a;
while (k> 0) {
if (k% 2 == 1) c * = bi;
bi * = bi;
k/= 2;
}
return c;
}
void CursorOff (void)
{asm {
mov ah, 1
mov ch, 0x20
int 0x10
}
}
Spisok ** GenSeY (int Mas_y, int & Counter)
{Counter = 0;
Spisok ** Y = new Spisok * [Mas_y];
for (int i = 0; i
int m = 0;
int * Pro = new int [Mas_y];
Spisok * beg = NULL, * end = NULL;
for (int j = 0; j
int k = Random (Mas_y);
int flag = 0;
for (Int j = 0; j
if (k ! = 0 && flag == 0) {
Pro [m] = K;
m + +;
if ((Beg == NULL) && (end == NULL)) {
end = new (Spisok);
if (End == NULL) {cout <<"Lack of memory"; exit (1);}
beg = end;
}
else {
end = end-> next = new (Spisok);
if (End == NULL) {cout <<"L ack of memory!"; Exit (1);}
}
end-> next = NULL;
end-> index = K;
Counter + +;
}
}
Y [i] = beg;
delete [] Pro;
}
return Y;
}
////////////////////////////////////////////////////////////////////////////////
Array * GenSeX (int Mas_y, int & Counter)
{Counter = 0;
Array * X = new Array [Mas_y * Mas_y];
if (X == NULL) {cout <<" n net u mena stolko pamaty! n"; exit (1);}
randomize ();
for (int i = 0; i
int m = 0;
int * Pro = new int [Mas_y];
for (int j = 0; j
int k = Random (Mas_y);
int flag = 0;
for (Int j = 0; j
if (k ! = 0 && flag == 0) {
X [Counter]. I = i;
X [Counter]. J = k;
Pro [m] = K;
m + +;
Counter + +;
}
}
delete [] Pro;
}
return X;
}
////////////////////////////////////...
