this paper is about software of Time-limit
標(biāo)簽： Time-limit software paper about
上傳時(shí)間： 2013-12-05
上傳用戶：wyc199288
詞典 Time Limit:3000MS Memory Limit:65536K Total Submit:2349 Accepted:603 Description 你旅游到了一個(gè)國外的城市。那里的人們說的外國語言你不能理解。不過幸運(yùn)的是，你有一本詞典可以幫助你。 Input 首先輸入一個(gè)詞典，詞典中包含不超過100000個(gè)詞條，每個(gè)詞條占據(jù)一行。每一個(gè)詞條包括一個(gè)英文單詞和一個(gè)外語單詞，兩個(gè)單詞之間用一個(gè)空格隔開。而且在詞典中不會(huì)有某個(gè)外語單詞出現(xiàn)超過兩次。詞典之后是一個(gè)空行，然后給出一個(gè)由外語單詞組成的文檔，文檔不超過100000行，而且每行只包括一個(gè)外語單詞。輸入中出現(xiàn)單詞只包括小寫字母，而且長度不會(huì)超過10。 Output 在輸出中，你需要把輸入文檔翻譯成英文，每行輸出一個(gè)英文單詞。如果某個(gè)外語單詞不在詞典中，就把這個(gè)單詞翻譯成“eh”。 Sample Input dog ogday cat atcay pig igpay froot ootfray loops oopslay atcay ittenkay oopslay Sample Output cat eh loops Hint 輸入比較大，推薦使用C語言的I / O函數(shù)。
標(biāo)簽： Limit Description Accepted 65536K
上傳時(shí)間： 2016-02-22
上傳用戶：fandeshun
Problem D:合唱隊(duì)形 Time Limit:1000MS Memory Limit:65536K Total Submit:1237 Accepted:437 Language: not limited Description N位同學(xué)站成一排，音樂老師要請其中的(N-K)位同學(xué)出列，使得剩下的K位同學(xué)排成合唱隊(duì)形。 合唱隊(duì)形是指這樣的一種隊(duì)形：設(shè)K位同學(xué)從左到右依次編號為1，2…，K，他們的身高分別為T1，T2，…，TK， 則他們的身高滿足T1 < T2 < ...< Ti > Ti+1 > … >TK(1<=i<=K)。 你的任務(wù)是，已知所有N位同學(xué)的身高，計(jì)算最少需要幾位同學(xué)出列，可以使得剩下的同學(xué)排成合唱隊(duì)形。 Input 輸入包含若干個(gè)測試用例。 對于每個(gè)測試用例，輸入第一行是一個(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 對于每個(gè)測試案例，輸出包括一行，這一行只包含一個(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
上傳用戶：aappkkee
Problem F:汽車加油 Time Limit:1000MS Memory Limit:65536K Total Submit:1400 Accepted:404 Language: not limited Description 一輛汽車加滿油后可行駛n公里。旅途中有若干個(gè)加油站。設(shè)計(jì)一個(gè)有效算法，指出應(yīng)在哪些加油站停靠加油，使沿途加油次數(shù)最少。 編程任務(wù)： 對于給定的n和k(k <= 10000)個(gè)加油站位置，編程計(jì)算最少加油次數(shù)。 Input 第一行有2 個(gè)正整數(shù)n和k，表示汽車加滿油后可行駛n公里，且旅途中有k個(gè)加油站。接下來的1 行中，有k+1 個(gè)整數(shù)，表示第k個(gè)加油站與第 k-1 個(gè)加油站之間的距離。第0 個(gè)加油站表示出發(fā)地，汽車已加滿油。第k+1 個(gè)加油站表示目的地。 Output 輸出最少加油次數(shù)。如果無法到達(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
上傳用戶：youth25
For solving the following problem: "There is No Free Lunch" Time Limit: 1 Second Memory Limit: 32768 KB One day, CYJJ found an interesting piece of commercial from newspaper: the Cyber-restaurant was offering a kind of "Lunch Special" which was said that one could "buy one get two for free". That is, if you buy one of the dishes on their menu, denoted by di with price pi , you may get the two neighboring dishes di-1 and di+1 for free! If you pick up d1, then you may get d2 and the last one dn for free, and if you choose the last one dn, you may get dn-1 and d1 for free. However, after investigation CYJJ realized that there was no free lunch at all. The price pi of the i-th dish was actually calculated by adding up twice the cost ci of the dish and half of the costs of the two "free" dishes. Now given all the prices on the menu, you are asked to help CYJJ find the cost of each of the dishes.
標(biāo)簽： Limit following solving problem
上傳時(shí)間： 2014-01-12
上傳用戶：362279997
Problem A:放蘋果 Time Limit:1000MS Memory Limit:65536K Total Submit:1094 Accepted:441 Language: not limited Description 把M個(gè)同樣的蘋果放在N個(gè)同樣的盤子里，允許有的盤子空著不放，問共有多少種不同的分法？（用K表示）5，1，1和1，5，1 是同一種分法。 Input 第一行是測試數(shù)據(jù)的數(shù)目t（0 <= t <= 20）。以下每行均包含二個(gè)整數(shù)M和N，以空格分開。1<=M，N<=10。 Output 對輸入的每組數(shù)據(jù)M和N，用一行輸出相應(yīng)的K。 Sample Input 1 7 3 Sample Output 8
標(biāo)簽： Limit Accepted Language Problem
上傳時(shí)間： 2016-11-30
上傳用戶：leixinzhuo
Tic Tac Toe程序。可以供一到兩個(gè)玩家使用。程序中使用了visual basic 計(jì)時(shí)器，所以每一個(gè)步驟都有時(shí)間限制。此外，計(jì)算機(jī)可是一個(gè)有簡單智能的對手，他不但不會(huì)隨便出手，反而還要竭力贏了你才罷休。 Tic Tac Toe program. One or two players. It uses the visual basic timer, so each move has time limit. Simple artificial intelligence: computer does not play randomly, but "tries" to win and stop you from winning.
標(biāo)簽： visual basic Tic Tac
上傳時(shí)間： 2015-04-11
上傳用戶：sxdtlqqjl
These codes require an ASCII input file called input.dat of the following form: Lower Limit on x Upper Limit on x Final Time Pressure for x<0 when t=0 Density for x<0 when t=0 Speed for x<0 when t=0 Pressure for x>0 when t=0 Density for x>0 when t=0 Speed for x>0 when t=0 These codes produce 8 ASCII output files: density.out. Density vs. x entropy.out. Entropy vs. x mach.out. Mach number vs. x massflux.out. Mass flux vs. x pressure.out. Pressure vs. x sound.out. Speed-of-sound vs. x velocity.out. Velocity vs. x waves.out. A description of the solution in terms of the three waves defined in the book (+,-,0).
標(biāo)簽： input following require called
上傳時(shí)間： 2017-09-21
上傳用戶：希醬大魔王
從時(shí)域分析比較了ofdm和stbc與ofdm結(jié)合的性能差別-from time-domain analysis and comparison of OFDM stbc OFDM combined wi
上傳時(shí)間： 2013-06-05
上傳用戶：caozhizhi
高的工作電壓高達(dá)100V N雙N溝道MOSFET同步驅(qū)動(dòng) The D810DCDC is a synchronous step-down switching regulator controller that can directly step-down voltages from up to 100V, making it ideal for telecom and automotive applications. The D810DCDC uses a constant on-time valley current control architecture to deliver very low duty cycles with accurate cycle-by-cycle current limit, without requiring a sense resistor. A precise internal reference provides 0.5% DC accuracy. A high bandwidth (25MHz) error amplifi er provides very fast line and load transient response. Large 1Ω gate drivers allow the D810DCDC to drive multiple MOSFETs for higher current applications. The operating frequency is selected by an external resistor and is compensated for variations in VIN and can also be synchronized to an external clock for switching-noise sensitive applications. Integrated bias control generates gate drive power from the input supply during start-up and when an output shortcircuit occurs, with the addition of a small external SOT23 MOSFET. When in regulation, power is derived from the output for higher effi ciency.
上傳時(shí)間： 2013-10-24
上傳用戶：wd450412225
蟲蟲下載站版權(quán)所有 京ICP備2021023401號-1
