Мои записи
[CPP] Решение СЛАУ методом Краммера
|=------------------=[ Magic Technologic Inc.]=------------------=| |=-----=[ Volume 0x0c, Algoritms 0x11, Phile #0x0a of 0x0f ]=----=| |=---------------------------------------------------------------=| |=--------------=[ Решение СЛАУ методом Краммера ]=--------------=| |=---------------------------------------------------------------=| |=---------------=[ Copyright (c) Flame Of Soul ]=---------------=| |=--------------=[ [E-mail]: _allbasse@yandex.ru ]=--------------=| |=---------------------------------------------------------------=| |=----------------------------=[ CPP ]=--------------------------=| |=---------------------------------------------------------------=|
#include <iostream.h> #include <stdio.h> #include <math.h> double DET (unsigned int columns); bool PROVCOL(unsigned int num, char colNum); unsigned int Column1(unsigned int num, char colNum); unsigned int Column0(unsigned int num, char colNum); double **Matrix; int n; main() { int i, j; double mainDET; cout<<"Vvedite kolichestvo uravneniy "<<endl; cin>>n; while (n > 10 || n < 1) { cout<<"Vu ne mogete vvesti bol'she 10 ili men'she 1 uravneniya, vvedite esche raz "; cin>>n; } Matrix = (double**) new double[n]; for (i=0; i<= n-1; i++) {Matrix[i] = new double[n+1];} for (i = 0; i <= n-1; i++) for (j = 0; j <= n; j++) { cout<<"Vvedite element matricu s koordinatami ("<<i<<","<<j<<") "; cin>>Matrix[i][j]; } cout<<"Vasha matrica:\n"; for (i = 0; i <= n-1; i++) {for (j = 0; j <= n; j++) cout<<Matrix[i][j]<<"\t"; cout<<endl; } mainDET = DET(pow(2,n)); if (mainDET == 0) { cout<<"Net resheniy!\n"; } else { printf ("Korni sistemu:\n"); for (i=0; i <= n-1; i++) printf ("%.3f ", -pow(-1,n+i)*DET(pow(2,i))/mainDET); printf ("\n"); } cout<<"Detrmenant sistemu raven: "<<mainDET<<endl; for (i = 0; i <= (n-1); i++) delete Matrix[i]; delete Matrix; cout<<"Vuchisleniya zakonchenu. Spasibo chto vubrali nas!\n"; return 0; } double DET (unsigned int columns) {double det = 0; int i, numCols = 0, lastFalse, cntr = 0; for (i=0; i<=n; i++) { if (PROVCOL(columns, i)) numCols++; else lastFalse = i; } if ((n - numCols) == 0) det = Matrix[n-1][lastFalse]; else for (i = 0; i <= n; i++) if (!PROVCOL(columns, i)) { columns = Column1(columns, i); det += pow(-1,(cntr))*Matrix[numCols-1][i]*DET(columns); columns = Column0(columns, i); cntr++; } return det; } bool PROVCOL(unsigned int num, char colNum){ _asm { xor eax, eax; xor ebx, ebx; mov bl, colNum; bt num, ebx; jnc none; inc eax; none:}} unsigned int Column1(unsigned int num, char colNum){ _asm { xor eax, eax; mov al, colNum; bts num, eax;} return num;} unsigned int Column0(unsigned int num, char colNum){ _asm { xor eax, eax; mov al, colNum; btr num, eax;} return num;} |=-----------------------------=[ CPP ]=---------------------------=| |=-----------------------------------------------------------------=|
Категория: Численные методы | Добавил: flame (29.05.2009)
Просмотров: 1920 | Комментарии: 12
| Рейтинг: 0.0 /0 |
- Оценить -
Отлично
Хорошо
Неплохо
Плохо
Ужасно
Всего комментариев: 12 1 2 »
Порядок вывода комментариев:
По умолчанию
Сначала новые
Сначала старые
12
PieRaluhsaila
(30.11.2012 00:57)
0
692107 http://clomidtopreview.net/#181414 clomid online canada drugs http://clomidtopreview.net/#240019 - clomidtopreview.net clomid online order ovulation induction
11
GogKagKeypece
(29.11.2012 19:51)
0
223752 http://mycashadvance.pro/#470298 payday loan in austin tx
10
GogKagKeypece
(29.11.2012 03:41)
0
803518 http://tenpaydayloans.co.uk/#307794 no bank account payday advance
9
saufaraacudge
(27.11.2012 10:17)
0
http://sildenafilok.net/#34577 buy sildenafil http://sildenafilok.net/#471718 - sildenafil online sniff viagra buy
8
SemaHienceGen
(23.11.2012 07:00)
0
513611 http://paydayloansall.net/#723779 payday loan seattle
7
rentrilior
(25.01.2012 18:54)
0
http://www.thumbshots.net/search.aspx?q=site%3aloveepicentre.com help studying for pharmacy tech http://sundrugstore.net/products/prilosec.htm keeping products with sudephedrine behind the pharmacy counters http://www.frootful.net/search/?searchfield=site:loveepicentre.com http://suche.gmx.net/search/web/?su=site%3Aloveepicentre.com
6
grellize
(17.01.2012 01:47)
0
west bend pharmacy http://sundrugstore.net/products/avapro.htm save mart pharmacy porterville
5
tychianvacith
(02.01.2012 21:27)
0
[url=][/url] [url=][/url] [url=][/url] [url=][/url]
4
shooserib
(10.12.2011 07:49)
0
usa pharmacy http://exclusiverx.com/products/roxithromycin.htm bellview pharmacy
3
shooserib
(09.12.2011 18:02)
0
zehrs pharmacy http://exclusiverx.com/products/plendil.htm link pharmacy
1-10 11-12
Добавлять комментарии могут только зарегистрированные пользователи.
[
Регистрация |
Вход ]
Статистика
Онлайн всего: 1
Гостей: 1
Пользователей: 0