小型的Lex編譯器，能從input.txt識(shí)別簡(jiǎn)單的C++語(yǔ)句，并將分析結(jié)果存于output.txt中
上傳時(shí)間： 2014-01-12
上傳用戶(hù)：qq21508895
Problem D:合唱隊(duì)形 Time Limit:1000MS Memory Limit:65536K Total Submit:1237 Accepted:437 Language: not limited Description N位同學(xué)站成一排，音樂(lè)老師要請(qǐng)其中的(N-K)位同學(xué)出列，使得剩下的K位同學(xué)排成合唱隊(duì)形。 合唱隊(duì)形是指這樣的一種隊(duì)形：設(shè)K位同學(xué)從左到右依次編號(hào)為1，2…，K，他們的身高分別為T(mén)1，T2，…，TK， 則他們的身高滿(mǎn)足T1 < T2 < ...< Ti > Ti+1 > … >TK(1<=i<=K)。 你的任務(wù)是，已知所有N位同學(xué)的身高，計(jì)算最少需要幾位同學(xué)出列，可以使得剩下的同學(xué)排成合唱隊(duì)形。 Input 輸入包含若干個(gè)測(cè)試用例。 對(duì)于每個(gè)測(cè)試用例，輸入第一行是一個(gè)整數(shù)N(2<=N<=100)，表示同學(xué)的總數(shù)。第二行有N個(gè)整數(shù)，用空格分隔，第i個(gè)整數(shù)Ti(130<=Ti<=230)是第i位同學(xué)的身高(厘米)。當(dāng)輸入同學(xué)總數(shù)N為0時(shí)表示輸入結(jié)束。 Output 對(duì)于每個(gè)測(cè)試案例，輸出包括一行，這一行只包含一個(gè)整數(shù)，就是最少需要幾位同學(xué)出列。 Sample Input 8 186 186 150 200 160 130 197 220 3 150 130 140 0 Sample Output 4 1
標(biāo)簽： Limit Accepted Language Problem
上傳時(shí)間： 2014-01-13
上傳用戶(hù)：aappkkee
對(duì)于符號(hào)三角形問(wèn)題，符號(hào)三角形的第一行有n個(gè)符號(hào)。符號(hào)可以為“＋”或“－”，以下每一行的符號(hào)由上行得到，2個(gè)同號(hào)下面都是“+”，2個(gè)異號(hào)下面都是“－”。如下圖所示（第一行有4個(gè)符號(hào)的符號(hào)三角中的其中的一個(gè)）： 符號(hào)三角形問(wèn)題要求對(duì)于給定的n，計(jì)算有多少個(gè)不同的符號(hào)三角形，使其所含的“＋”和“－”的個(gè)數(shù)相同。 Input 輸入包含若干個(gè)測(cè)試用例。 對(duì)于每個(gè)測(cè)試用例，輸入的一行是一個(gè)整數(shù)n(2<=n<=20)，表示符號(hào)三角形第一行符號(hào)的個(gè)數(shù)。當(dāng)輸入n為0時(shí)表示輸入結(jié)束。 Output 對(duì)于每個(gè)測(cè)試案例，輸出包括一行，這一行只包含一個(gè)整數(shù)，就是該測(cè)試案例總共有多少不同的符號(hào)三角形，使其所含的“＋”和“－”的個(gè)數(shù)相同。 Sample Input 2 3 0 Sample Output 0 4
上傳時(shí)間： 2014-01-02
上傳用戶(hù)：陽(yáng)光少年2016
Problem F:汽車(chē)加油 Time Limit:1000MS Memory Limit:65536K Total Submit:1400 Accepted:404 Language: not limited Description 一輛汽車(chē)加滿(mǎn)油后可行駛n公里。旅途中有若干個(gè)加油站。設(shè)計(jì)一個(gè)有效算法，指出應(yīng)在哪些加油站?？考佑?，使沿途加油次數(shù)最少。 編程任務(wù)： 對(duì)于給定的n和k(k <= 10000)個(gè)加油站位置，編程計(jì)算最少加油次數(shù)。 Input 第一行有2 個(gè)正整數(shù)n和k，表示汽車(chē)加滿(mǎn)油后可行駛n公里，且旅途中有k個(gè)加油站。接下來(lái)的1 行中，有k+1 個(gè)整數(shù)，表示第k個(gè)加油站與第 k-1 個(gè)加油站之間的距離。第0 個(gè)加油站表示出發(fā)地，汽車(chē)已加滿(mǎn)油。第k+1 個(gè)加油站表示目的地。 Output 輸出最少加油次數(shù)。如果無(wú)法到達(dá)目的地，則輸出”No Solution”。 Sample Input 7 7 1 2 3 4 5 1 6 6 Sample Output 4
標(biāo)簽： Limit Accepted Language Problem
上傳時(shí)間： 2016-04-12
上傳用戶(hù)：youth25
DirectFB is a thin library that provides hardware graphics acceleration, input device handling and abstraction, integrated windowing system with support for translucent windows and multiple display layers on top of the Linux Framebuffer Device.
標(biāo)簽： acceleration DirectFB hardware graphics
上傳時(shí)間： 2014-06-30
上傳用戶(hù)：wangchong
1) Write a function reverse(A) which takes a matrix A of arbitrary dimensions as input and returns a matrix B consisting of the columns of A in reverse order. Thus for example, if A = 1 2 3 then B = 3 2 1 4 5 6 6 5 4 7 8 9 9 8 7 Write a main program to call reverse(A) for the matrix A = magic(5). Print to the screen both A and reverse(A). 2) Write a program which accepts an input k from the keyboard, and which prints out the smallest fibonacci number that is at least as large as k. The program should also print out its position in the fibonacci sequence. Here is a sample of input and output: Enter k>0: 100 144 is the smallest fibonacci number greater than or equal to 100. It is the 12th fibonacci number.
標(biāo)簽： dimensions arbitrary function reverse
上傳時(shí)間： 2016-04-16
上傳用戶(hù)：waitingfy
北京大學(xué)ACM比賽題目 Write a program to read four lines of upper case (i.e., all CAPITAL LETTERS) text input (no more than 72 characters per line) from the input file and print a vertical histogram that shows how many times each letter (but not blanks, digits, or punctuation) appears in the all-upper-case input. Format your output exactly as shown.
標(biāo)簽： CAPITAL LETTERS program Write
上傳時(shí)間： 2014-01-17
上傳用戶(hù)：410805624
PlotSphereIntensity(azimuth, elevation) PlotSphereIntensity(azimuth, elevation, intensity) h = PlotSphereIntensity(...) Plots the intensity (as color) of a number of points on a unit sphere. Input: azimuth (phi), in degrees elevation (theta), in degrees intensity (optional, if not provided, a green sphere is produced) All inputs must be vectors or matrices of the same size. Data does not have to be evenly spaced. When there aren t enough points to draw a smooth sphere, additional points (with color) are interpolated. Output: h - a handle to the patch object The axes are also plotted: positive x axis is red positive y axis is green positive z axis is blue
標(biāo)簽： PlotSphereIntensity elevation azimuth intensity
上傳時(shí)間： 2014-01-15
上傳用戶(hù)：ruan2570406
The neuro-fuzzy software for identification and data analysis has been implemented in the MATLAB language ver. 4.2. The software trains a fuzzy architecture, inspired to Takagi-Sugeno approach, on the basis of a training set of N (single) output-(multi) input samples. The returned model has the form 1) if input1 is A11 and input 2 is A12 then output =f1(input1,input2) 2) if input1 is A21 and input 2 is A22 then output =f2(input1,input2) 看不懂，據(jù)高手說(shuō)，非常有用。
標(biāo)簽： identification neuro-fuzzy implemented analysis
上傳時(shí)間： 2014-01-12
上傳用戶(hù)：zgu489
vhdl編寫(xiě)，8b—10b 編解碼器設(shè)計(jì) Encoder: 8b/10b Encoder (file: 8b10b_enc.vhd) Synchronous clocked inputs (latched on each clock rising edge) 8-bit parallel unencoded data input KI input selects data or control encoding Asynchronous active high reset initializes all logic Encoded data output 10-bit parallel encoded output valid 1 clock later Decoder: 8b/10b Decoder (file: 8b10b_dec.vhd) Synchronous clocked inputs (latched on each clock rising edge) 10-bit parallel encoded data input Asynchronous active high reset initializes all logic Decoded data, disparity and KO outputs 8-bit parallel unencoded output valid 1 clock later
上傳時(shí)間： 2016-05-05
上傳用戶(hù)：gundamwzc
蟲(chóng)蟲(chóng)下載站版權(quán)所有 京ICP備2021023401號(hào)-1
