亚洲欧美第一页_禁久久精品乱码_粉嫩av一区二区三区免费野_久草精品视频

蟲蟲首頁| 資源下載| 資源專輯| 精品軟件
登錄| 注冊

friend

  • slam進階學習

    slam進階學習,這個是第四課,老外做的,很完善的東西,對于同時定位與地圖創建的friend有很大的幫助

    標簽: slam 進階

    上傳時間: 2013-12-24

    上傳用戶:yepeng139

  • slam進階學習

    slam進階學習,老外做的,很完善的東西,對于同時定位與地圖創建的friend有很大的幫助(第一課)

    標簽: slam 進階

    上傳時間: 2014-11-21

    上傳用戶:ouyangtongze

  • slam進階學習

    slam進階學習,老外做的,很完善的東西,對于同時定位與地圖創建的friend有很大的幫助(第二課)

    標簽: slam 進階

    上傳時間: 2016-06-05

    上傳用戶:lunshaomo

  • 復數運算#include<iostream.h> class Complex { public: Complex( double r =0, double i =0 ) C

    復數運算#include<iostream.h> class Complex { public: Complex( double r =0, double i =0 ) Complex(int a) { Real = a Image = 0 } void print() const friend Complex operator+ ( const Complex & c1, const Complex & c2 ) friend Complex operator- ( const Complex & c1, const Complex & c2 ) friend Complex operator- ( const Complex & c ) private: double Real, Image }

    標簽: Complex double iostream include

    上傳時間: 2016-06-30

    上傳用戶:wang5829

  • Playfair Cipher 1.not even the large number of keys in a monoalphabetic cipher provides security 2

    Playfair Cipher 1.not even the large number of keys in a monoalphabetic cipher provides security 2.one approach to improving security was to encrypt multiple letters 3.the Playfair Cipher is an example 4.invented by Charles Wheatstone in 1854,but named after his friend Baron Playfair Playfair Key Matrix 1.a 5X5 matrix of letters based on a keyword 2.fill in letters of keyword (sans duplicates) 3.fill rest of matrix with other letters Encrypting and Decrypting -plaintext is encrypted two letters at a time 1. if a pair is a repeated letter, insert filler like X’ 2. if both letters fall in the same row, replace each with letter to right (wrapping back to start from end) 3. if both letters fall in the same column, replace each with the letter below it (again wrapping to top from bottom) 4. otherwise each letter is replaced by the letter in the same row and in the column of the other letter of the pair

    標簽: monoalphabetic Playfair provides security

    上傳時間: 2017-05-25

    上傳用戶:變形金剛

  • 道理特分解法

    #include "iostream" using namespace std; class Matrix { private: double** A; //矩陣A double *b; //向量b public: int size; Matrix(int ); ~Matrix(); friend double* Dooli(Matrix& ); void Input(); void Disp(); }; Matrix::Matrix(int x) { size=x; //為向量b分配空間并初始化為0 b=new double [x]; for(int j=0;j<x;j++) b[j]=0; //為向量A分配空間并初始化為0 A=new double* [x]; for(int i=0;i<x;i++) A[i]=new double [x]; for(int m=0;m<x;m++) for(int n=0;n<x;n++) A[m][n]=0; } Matrix::~Matrix() { cout<<"正在析構中~~~~"<<endl; delete b; for(int i=0;i<size;i++) delete A[i]; delete A; } void Matrix::Disp() { for(int i=0;i<size;i++) { for(int j=0;j<size;j++) cout<<A[i][j]<<" "; cout<<endl; } } void Matrix::Input() { cout<<"請輸入A:"<<endl; for(int i=0;i<size;i++) for(int j=0;j<size;j++){ cout<<"第"<<i+1<<"行"<<"第"<<j+1<<"列:"<<endl; cin>>A[i][j]; } cout<<"請輸入b:"<<endl; for(int j=0;j<size;j++){ cout<<"第"<<j+1<<"個:"<<endl; cin>>b[j]; } } double* Dooli(Matrix& A) { double *Xn=new double [A.size]; Matrix L(A.size),U(A.size); //分別求得U,L的第一行與第一列 for(int i=0;i<A.size;i++) U.A[0][i]=A.A[0][i]; for(int j=1;j<A.size;j++) L.A[j][0]=A.A[j][0]/U.A[0][0]; //分別求得U,L的第r行,第r列 double temp1=0,temp2=0; for(int r=1;r<A.size;r++){ //U for(int i=r;i<A.size;i++){ for(int k=0;k<r-1;k++) temp1=temp1+L.A[r][k]*U.A[k][i]; U.A[r][i]=A.A[r][i]-temp1; } //L for(int i=r+1;i<A.size;i++){ for(int k=0;k<r-1;k++) temp2=temp2+L.A[i][k]*U.A[k][r]; L.A[i][r]=(A.A[i][r]-temp2)/U.A[r][r]; } } cout<<"計算U得:"<<endl; U.Disp(); cout<<"計算L的:"<<endl; L.Disp(); double *Y=new double [A.size]; Y[0]=A.b[0]; for(int i=1;i<A.size;i++ ){ double temp3=0; for(int k=0;k<i-1;k++) temp3=temp3+L.A[i][k]*Y[k]; Y[i]=A.b[i]-temp3; } Xn[A.size-1]=Y[A.size-1]/U.A[A.size-1][A.size-1]; for(int i=A.size-1;i>=0;i--){ double temp4=0; for(int k=i+1;k<A.size;k++) temp4=temp4+U.A[i][k]*Xn[k]; Xn[i]=(Y[i]-temp4)/U.A[i][i]; } return Xn; } int main() { Matrix B(4); B.Input(); double *X; X=Dooli(B); cout<<"~~~~解得:"<<endl; for(int i=0;i<B.size;i++) cout<<"X["<<i<<"]:"<<X[i]<<" "; cout<<endl<<"呵呵呵呵呵"; return 0; } 

    標簽: 道理特分解法

    上傳時間: 2018-05-20

    上傳用戶:Aa123456789

  • Tcl_and_The_Tk_Toolkit

    This manuscript is a partial draft of a book to be published in early 1994 by AddisonWesley (ISBN 0-201-63337-X). Addison-Wesley has given me permission to make drafts of the book available to the Tcl community to help meet the need for introductory documentation on Tcl and Tk until the book becomes available. Please observe the restrictions set forth in the copyright notice above: you’re welcome to make a copy for yourself or a friend but any sort of large-scale reproduction or reproduction for profit requires advance permission from Addison-Wesley

    標簽: Toolkit

    上傳時間: 2020-07-05

    上傳用戶:

  • 一款實用的電磁爐源碼供給懂得單片機c語言的朋友參...

    說明:  一款實用的電磁爐源碼!供給懂得單片機c語言的朋友參考!(A useful source Cooker! Supply Singlechip know c language reference friend!)

    標簽: 單片機

    上傳時間: 2022-05-27

    上傳用戶:

主站蜘蛛池模板: 宝丰县| 大新县| 汾阳市| 额济纳旗| 梅州市| 浙江省| 潞城市| 定西市| 屯昌县| 津南区| 南通市| 云林县| 成武县| 登封市| 镇赉县| 玉龙| 腾冲县| 南安市| 福贡县| 大足县| 泽州县| 高雄市| 潼关县| 全州县| 绵竹市| 阜城县| 科技| 扎鲁特旗| 江都市| 阿城市| 辽阳市| 博客| 遂川县| 保康县| 合山市| 任丘市| 鹤山市| 电白县| 文化| 光山县| 潢川县|