--- --- --- ----UART0: 115200,8,n,1------------------------------- Embest S3CEV40 >Embest Info&Tech Co., Ltd. Embest Info&Tech Co., Ltd. Embest S3CEV40 >
標(biāo)簽： Embest 115200 UART 3CEV
上傳時(shí)間： 2013-11-30
上傳用戶(hù)：wqxstar
Embest S3C44B0X Evaluation Board RTC Test Example RTC Check(Y/N)? y Set Default Time at 2004-12-31 FRI 23:59:59 Set Alarm Time at 2005-01-01 00:00:01 ... RTC Alarm Interrupt O.K. ... Current Time is 2005-01-01 SAT 00:00:01 RTC Working now. To set date(Y/N)? y Current date is (2005,01,01, SAT). input new date (yy-mm-dd w): 5-2-23 3 Current date is: 2005-02-23 WED RTC Working now. To set time(Y/N)? y Current time is (00:00:21). To set time(hh:mm:ss): 19:32:5 Current Time is 2005-02-23 WED 19:32:
標(biāo)簽： Evaluation RTC S3C44B0X Default
上傳時(shí)間： 2014-01-03
上傳用戶(hù)：baiom
假定已經(jīng)有許多應(yīng)用采用了程序1 - 1 5中所定義的C u r r e n c y類(lèi)，現(xiàn)在我們想要對(duì)C u r r e n c y類(lèi) 的描述進(jìn)行修改，使其應(yīng)用頻率最高的兩個(gè)函數(shù)A d d和I n c r e m e n t可以運(yùn)行得更快，從而提高應(yīng) 用程序的執(zhí)行速度。由于用戶(hù)僅能通過(guò)p u b l i c部分所提供的接口與C u r r e n c y類(lèi)進(jìn)行交互，
上傳時(shí)間： 2015-10-11
上傳用戶(hù)：BIBI
在sco unix 下顯示前n天或后n天日期的處理程序。 printf("功能： 時(shí)間戳與時(shí)間格式字符串的轉(zhuǎn)換程序\n") printf(" -i 輸入的參數(shù)為時(shí)間戳\n") printf(" -s 輸入的參數(shù)為格式化時(shí)間\n") printf(" -t 輸入的時(shí)間取當(dāng)前系統(tǒng)時(shí)間\n") printf(" -x 輸入的時(shí)間增加或減少的天數(shù)\n") printf(" -o 輸出的時(shí)間為時(shí)間戳格式\n") printf(" -O 輸出的時(shí)間為格式化時(shí)間\n") printf(" -h 幫助文件-查看[format]如何定義，例 ％s -h\n",procname) printf("范例：1 取當(dāng)前日期的前2天的時(shí)間顯示 ％s -t -x -2\n",procname) printf(" 2 取20030101的前5天的時(shí)間顯示 ％s -s 20030101000000 -x -5\n",procname) printf(" 3 取20031231的后5天的時(shí)間顯示 ％s -s 20031231000000 -x 5 -O \"％％D ％％T\"\n",procname) printf(" 4 取時(shí)間戳為1089619417的時(shí)間顯示 ％s -i 1089619417 \n",procname) printf(" 5 取時(shí)間戳為1089619417的后4天的時(shí)間顯示 ％s -i 1089619417 -x 4 \n",procname)
標(biāo)簽： printf unix sco 處理程序
上傳時(shí)間： 2015-10-17
上傳用戶(hù)：TRIFCT
HDOJ ACM input:The input consists of T test cases. The number of test cases ) (T is given in the first line of the input. Each test case begins with a line containing an integer N , 1<=N<=200 , that represents the number of tables to move. Each of the following N lines contains two positive integers s and t, representing that a table is to move from room number s to room number t (each room number appears at most once in the N lines). From the N+3-rd line, the remaining test cases are listed in the same manner as above.
標(biāo)簽： input cases test The
上傳時(shí)間： 2015-10-18
上傳用戶(hù)：三人用菜
acm HDOJ 1051WoodenSticks Description: There is a pile of n wooden sticks. The length and weight of each stick are known in advance. The sticks are to be processed by a woodworking machine in one by one fashion. It needs some time, called setup time, for the machine to prepare processing a stick. The setup times are associated with cleaning operations and changing tools and shapes in the machine. The setup times of the woodworking machine are given as follows: (a) The setup time for the first wooden stick is 1 minute. (b) Right after processing a stick of length l and weight w , the machine will need no setup time for a stick of length l and weight w if l<=l and w<=w . Otherwise, it will need 1 minute for setup.
標(biāo)簽： WoodenSticks Description length wooden
上傳時(shí)間： 2014-03-08
上傳用戶(hù)：netwolf
USB是PC體系中的一套全新的工業(yè)標(biāo)準(zhǔn)，它支持單個(gè)主機(jī)與多個(gè)外接設(shè)備同時(shí)進(jìn)行數(shù)據(jù)交換。 首先會(huì)介紹USB的結(jié)構(gòu)和特點(diǎn)，包括總線特徵、協(xié)議定義、傳輸方式和電源管理等等。這部分內(nèi)容會(huì)使USB開(kāi)發(fā)者和用戶(hù)對(duì)USB有一整體的認(rèn)識(shí)。
標(biāo)簽： USB
上傳時(shí)間： 2015-10-18
上傳用戶(hù)：lixinxiang
黑白點(diǎn)的匹配貪心算法 設(shè)平面上分布著n個(gè)白點(diǎn)和n個(gè)黑點(diǎn)，每個(gè)點(diǎn)用一對(duì)坐標(biāo)（x, y）表示。一個(gè)黑點(diǎn)b=（xb,yb）支配一個(gè)白點(diǎn)w=(xw, yw)當(dāng)且僅當(dāng)xb>=xw和yb>=yw。若黑點(diǎn)b支配白點(diǎn)w，則黑點(diǎn)b和白點(diǎn)w可匹配（可形成一個(gè)匹配對(duì)）。在一個(gè)黑點(diǎn)最多只能與一個(gè)白點(diǎn)匹配，一個(gè)白點(diǎn)最多只能與一個(gè)黑點(diǎn)匹配的前提下，求n個(gè)白點(diǎn)和n個(gè)黑點(diǎn)的最大匹配對(duì)數(shù)。
上傳時(shí)間： 2015-10-25
上傳用戶(hù)：zhliu007
Input The first line of the input contains a single integer T (1 <= T <= 20), the number of test cases. Then T cases follow. The first line of each case contains N, and the second line contains N integers giving the time for each people to cross the river. Each case is preceded by a blank line. There won t be more than 1000 people and nobody takes more than 100 seconds to cross. Output For each test case, print a line containing the total number of seconds required for all the N people to cross the river. Sample Input 1 4 1 2 5 10 Sample Output 17
標(biāo)簽： the contains integer number
上傳時(shí)間： 2015-10-27
上傳用戶(hù)：plsee
第一步：采用PID控制，在控制器啟動(dòng)過(guò)程中，首先采用灰色估計(jì)器對(duì)不確定部分的模型參數(shù)建立GM(0,N) 模型進(jìn)行估計(jì)，其中 控制算法為 第二步：按估計(jì)參數(shù)加上補(bǔ)償控制，估計(jì)器停止工作，灰色控制算法為
上傳時(shí)間： 2015-11-02
上傳用戶(hù)：天涯
蟲(chóng)蟲(chóng)下載站版權(quán)所有 京ICP備2021023401號(hào)-1
