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

蟲(chóng)蟲(chóng)首頁(yè)| 資源下載| 資源專輯| 精品軟件
登錄| 注冊(cè)

Wide-<b>inPUT</b>

  • 1.有三根桿子A,B,C。A桿上有若干碟子 2.每次移動(dòng)一塊碟子,小的只能疊在大的上面 3.把所有碟子從A桿全部移到C桿上 經(jīng)過(guò)研究發(fā)現(xiàn)

    1.有三根桿子A,B,C。A桿上有若干碟子 2.每次移動(dòng)一塊碟子,小的只能疊在大的上面 3.把所有碟子從A桿全部移到C桿上 經(jīng)過(guò)研究發(fā)現(xiàn),漢諾塔的破解很簡(jiǎn)單,就是按照移動(dòng)規(guī)則向一個(gè)方向移動(dòng)金片: 如3階漢諾塔的移動(dòng):A→C,A→B,C→B,A→C,B→A,B→C,A→C 此外,漢諾塔問(wèn)題也是程序設(shè)計(jì)中的經(jīng)典遞歸問(wèn)題

    標(biāo)簽: 移動(dòng) 發(fā)現(xiàn)

    上傳時(shí)間: 2016-07-25

    上傳用戶:gxrui1991

  • 1. 下列說(shuō)法正確的是 ( ) A. Java語(yǔ)言不區(qū)分大小寫 B. Java程序以類為基本單位 C. JVM為Java虛擬機(jī)JVM的英文縮寫 D. 運(yùn)行Java程序需要先安裝JDK

    1. 下列說(shuō)法正確的是 ( ) A. Java語(yǔ)言不區(qū)分大小寫 B. Java程序以類為基本單位 C. JVM為Java虛擬機(jī)JVM的英文縮寫 D. 運(yùn)行Java程序需要先安裝JDK 2. 下列說(shuō)法中錯(cuò)誤的是 ( ) A. Java語(yǔ)言是編譯執(zhí)行的 B. Java中使用了多進(jìn)程技術(shù) C. Java的單行注視以//開(kāi)頭 D. Java語(yǔ)言具有很高的安全性 3. 下面不屬于Java語(yǔ)言特點(diǎn)的一項(xiàng)是( ) A. 安全性 B. 分布式 C. 移植性 D. 編譯執(zhí)行 4. 下列語(yǔ)句中,正確的項(xiàng)是 ( ) A . int $e,a,b=10 B. char c,d=’a’ C. float e=0.0d D. double c=0.0f

    標(biāo)簽: Java A. B. C.

    上傳時(shí)間: 2017-01-04

    上傳用戶:netwolf

  • verilog code 16-bit carry look-ahead adder output [15:0] sum // 相加總和 output carryout // 進(jìn)位 input

    verilog code 16-bit carry look-ahead adder output [15:0] sum // 相加總和 output carryout // 進(jìn)位 input [15:0] A_in // 輸入A input [15:0] B_in // 輸入B input carryin // 第一級(jí)進(jìn)位 C0

    標(biāo)簽: output look-ahead carryout verilog

    上傳時(shí)間: 2014-12-06

    上傳用戶:ls530720646

  • 微電腦型數(shù)學(xué)演算式隔離傳送器

    特點(diǎn): 精確度0.1%滿刻度 可作各式數(shù)學(xué)演算式功能如:A+B/A-B/AxB/A/B/A&B(Hi or Lo)/|A|/ 16 BIT類比輸出功能 輸入與輸出絕緣耐壓2仟伏特/1分鐘(input/output/power) 寬范圍交直流兩用電源設(shè)計(jì) 尺寸小,穩(wěn)定性高

    標(biāo)簽: 微電腦 數(shù)學(xué)演算 隔離傳送器

    上傳時(shí)間: 2014-12-23

    上傳用戶:ydd3625

  • 數(shù)字運(yùn)算

    數(shù)字運(yùn)算,判斷一個(gè)數(shù)是否接近素?cái)?shù) A Niven number is a number such that the sum of its digits divides itself. For example, 111 is a Niven number because the sum of its digits is 3, which divides 111. We can also specify a number in another base b, and a number in base b is a Niven number if the sum of its digits divides its value. Given b (2 <= b <= 10) and a number in base b, determine whether it is a Niven number or not. Input Each line of input contains the base b, followed by a string of digits representing a positive integer in that base. There are no leading zeroes. The input is terminated by a line consisting of 0 alone. Output For each case, print "yes" on a line if the given number is a Niven number, and "no" otherwise. Sample Input 10 111 2 110 10 123 6 1000 8 2314 0 Sample Output yes yes no yes no

    標(biāo)簽: 數(shù)字 運(yùn)算

    上傳時(shí)間: 2015-05-21

    上傳用戶:daguda

  • The government of a small but important country has decided that the alphabet needs to be streamline

    The government of a small but important country has decided that the alphabet needs to be streamlined and reordered. Uppercase letters will be eliminated. They will issue a royal decree in the form of a String of B and A characters. The first character in the decree specifies whether a must come ( B )Before b in the new alphabet or ( A )After b . The second character determines the relative placement of b and c , etc. So, for example, "BAA" means that a must come Before b , b must come After c , and c must come After d . Any letters beyond these requirements are to be excluded, so if the decree specifies k comparisons then the new alphabet will contain the first k+1 lowercase letters of the current alphabet. Create a class Alphabet that contains the method choices that takes the decree as input and returns the number of possible new alphabets that conform to the decree. If more than 1,000,000,000 are possible, return -1. Definition

    標(biāo)簽: government streamline important alphabet

    上傳時(shí)間: 2015-06-09

    上傳用戶:weixiao99

  • /* * EULER S ALGORITHM 5.1 * * TO APPROXIMATE THE SOLUTION OF THE INITIAL VALUE PROBLEM: * Y = F

    /* * EULER S ALGORITHM 5.1 * * TO APPROXIMATE THE SOLUTION OF THE INITIAL VALUE PROBLEM: * Y = F(T,Y), A<=T<=B, Y(A) = ALPHA, * AT N+1 EQUALLY SPACED POINTS IN THE INTERVAL [A,B]. * * INPUT: ENDPOINTS A,B INITIAL CONDITION ALPHA INTEGER N. * * OUTPUT: APPROXIMATION W TO Y AT THE (N+1) VALUES OF T. */

    標(biāo)簽: APPROXIMATE ALGORITHM THE SOLUTION

    上傳時(shí)間: 2015-08-20

    上傳用戶:zhangliming420

  • 道理特分解法

    #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<<"正在析構(gòu)中~~~~"<<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<<"請(qǐng)輸入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<<"請(qǐng)輸入b:"<<endl; for(int j=0;j<size;j++){ cout<<"第"<<j+1<<"個(gè):"<<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<<"計(jì)算U得:"<<endl; U.Disp(); cout<<"計(jì)算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; } 

    標(biāo)簽: 道理特分解法

    上傳時(shí)間: 2018-05-20

    上傳用戶:Aa123456789

  • DN378 低靜態(tài)電流單片式降壓型穩(wěn)壓器

      Automobile electronic systems place high demands ontoday’s DC/DC converters. They must be able to preciselyregulate an output voltage in the face of wide temperatureand input voltage ranges—including load dump transientsin excess of 60V and cold crank voltage drops to 4V. Theconverter must also be able to minimize battery drain inalways-on systems by maintaining high effi ciency over abroad load current range. Similar demands are made bymany 48V nonisolated telecom applications, 40V FireWireperipherals and battery-powered applications with autoplug adaptors. The LT3437’s best in classperformancemeets all of these requirements in a small thermallyenhanced 3mm × 3mm DFN package.

    標(biāo)簽: 378 DN 低靜態(tài)電流 單片式

    上傳時(shí)間: 2013-10-15

    上傳用戶:stampede

  • 80C51特殊功能寄存器地址表

    /*--------- 8051內(nèi)核特殊功能寄存器 -------------*/ sfr ACC = 0xE0;             //累加器 sfr B = 0xF0;  //B 寄存器 sfr PSW    = 0xD0;           //程序狀態(tài)字寄存器 sbit CY    = PSW^7;       //進(jìn)位標(biāo)志位 sbit AC    = PSW^6;        //輔助進(jìn)位標(biāo)志位 sbit F0    = PSW^5;        //用戶標(biāo)志位0 sbit RS1   = PSW^4;        //工作寄存器組選擇控制位 sbit RS0   = PSW^3;        //工作寄存器組選擇控制位 sbit OV    = PSW^2;        //溢出標(biāo)志位 sbit F1    = PSW^1;        //用戶標(biāo)志位1 sbit P     = PSW^0;        //奇偶標(biāo)志位 sfr SP    = 0x81;            //堆棧指針寄存器 sfr DPL  = 0x82;            //數(shù)據(jù)指針0低字節(jié) sfr DPH  = 0x83;            //數(shù)據(jù)指針0高字節(jié) /*------------ 系統(tǒng)管理特殊功能寄存器 -------------*/ sfr PCON  = 0x87;           //電源控制寄存器 sfr AUXR = 0x8E;              //輔助寄存器 sfr AUXR1 = 0xA2;             //輔助寄存器1 sfr WAKE_CLKO = 0x8F;        //時(shí)鐘輸出和喚醒控制寄存器 sfr CLK_DIV  = 0x97;          //時(shí)鐘分頻控制寄存器 sfr BUS_SPEED = 0xA1;        //總線速度控制寄存器 /*----------- 中斷控制特殊功能寄存器 --------------*/ sfr IE     = 0xA8;           //中斷允許寄存器 sbit EA    = IE^7;  //總中斷允許位  sbit ELVD  = IE^6;           //低電壓檢測(cè)中斷控制位 8051

    標(biāo)簽: 80C51 特殊功能寄存器 地址

    上傳時(shí)間: 2013-10-30

    上傳用戶:yxgi5

主站蜘蛛池模板: 西乡县| 铅山县| 巨鹿县| 大邑县| 易门县| 镇原县| 瓦房店市| 荣昌县| 南投县| 于田县| 金山区| 福贡县| 平潭县| 商都县| 湖州市| 奉节县| 苏尼特右旗| 苏尼特右旗| 清原| 达州市| 赤城县| 行唐县| 张掖市| 南雄市| 外汇| 阿鲁科尔沁旗| 九台市| 宜城市| 大冶市| 宝应县| 无锡市| 吉林省| 自贡市| 隆林| 双辽市| 临澧县| 青阳县| 漳州市| 朝阳市| 肥城市| 武定县|