ubuntu下批量重命名文件某个文件夹下有100个文件，文件名分别是0000001.tif, 0000002.tif……0000100.tif。要把这些文件都改成length001.tif, length002.tif……length100.tif, 该怎么弄呢？首先，在当前目录下打开终端，或者打开终端ｃｄ当前目录输入命令：rename -n 's/0000/length/' *.tif参数－ｎ的意思是显示运行后会有哪些变化，并不实际执行；'s/0000/length/'表示把0000换成length，*.tif表示只更换这种类型的文件运行了以后回显示一个列表，哪些文件会被更改，确认没有问题以后，去掉参数－ｎ重新运行一遍就可以了rename 's/0000/length/' *.tif转载自http://hi.baidu.com/guoshicheng_fd/item/1b33104acf0dc2a9df2a9fe5火碳黑2012-10-09 09:30发表评论 ...继续阅读 (34)

Memory ControlProblem DescriptionMemory units are numbered from 1 up to N.A sequence of memory units is called a memory block.The memory control system we consider now has four kinds of operations:1. Reset Reset all memory units free.2. New x Allocate a memory block consisted of x continuous free memory units with the least start number3. Free x Release the memory block which includes unit x4. Get x Return the start number of the xth memory block(Note that we count the memory blocks allocated from left to right)Where 1<=x<=N.You are request to find out the output for M operations.Inp ...继续阅读 (25)

敌兵布阵Problem DescriptionC国的死对头A国这段时间正在进行军事演习，所以C国间谍头子Derek和他手下Tidy又开始忙乎了。A国在海岸线沿直线布置了N个工兵营地, Derek和Tidy的任务就是要监视这些工兵营地的活动情况。由于采取了某种先进的监测手段，所以每个工兵营地的人数C国都掌握的一清二楚,每个工兵营 地的人数都有可能发生变动，可能增加或减少若干人手,但这些都逃不过C国的监视。中 央情报局要研究敌人究竟演习什么战术,所以Tidy要随时向Derek汇报某一段连续的工兵营地一共有多少人,例如Derek问:“Tidy,马上汇报第 3个营地到第10个营地共有多少人!”Tidy就要马上开始计算这一段的总人数并汇报。但敌兵营地的人数经常变动，而Derek每次询问的段都不一样，所 以Tidy不得不每次都一个一个营地的去数，很快就精疲力尽了，Derek对Tidy的计算速度越来越不满:"你个死肥仔，算得这么慢，我炒你鱿鱼!” Tidy想：“你自己来算算看，这可真是一项累人的工作!我恨不得你炒我鱿鱼呢!”无奈之下，Tidy只好打电话向计算机专家Windbreaker求 救,Windbreaker说：“死肥仔，叫你平时做多点acm题和看多点算法书，现在尝到苦果了吧!”Tidy说："我知错了。。。 ...继续阅读 (28)

CubeProblem DescriptionGiven an N*N*N cube A, whose elements are either 0 or 1. A[i, j, k] means the number in the i-th row , j-th column and k-th layer. Initially we have A[i, j, k] = 0 (1 <= i, j, k <= N).We define two operations, 1: “Not” operation that we change the A[i, j, k]=!A[i, j, k]. that means we change A[i, j, k] from 0->1,or 1->0. (x1<=i<=x2,y1<=j<=y2,z1<=k<=z2).0: “Query” operation we want to get the value of A[i, j, k].InputMulti-cases.First line contains N and M, M lines follow indicating the operation below.Each operation contains an X, the type of oper ...继续阅读 (25)

IntervalsDescriptionYou are givenNweighted open intervals. Theith interval covers (ai,bi) and weighswi. Your task is to pick some of the intervals to maximize the total weights under the limit that no point in the real axis is covered more thanktimes.InputThe first line of input is the number of test case.The first line of each test case contains two integers,NandK(1 ≤K≤N≤ 200).The nextNline each contain three integersai,bi,wi(1 ≤aiCode highlighting produced by Actipro CodeHighlighter (freeware)http://www.CodeHighlighter.com/#include#include#include#definemaxn 1010#defi ...继续阅读 (25)

March of the PenguinsDescriptionSomewhere near the south pole, a number of penguins are standing on a number of ice floes. Being social animals, the penguins would like to get together, all on the same floe. The penguins do not want to get wet, so they have use their limited jump distance to get together by jumping from piece to piece. However, temperatures have been high lately, and the floes are showing cracks, and they get damaged further by the force needed to jump to another floe. Fortunately the penguins are real experts on cracking ice floes, and know exactly how many times a penguin ca ...继续阅读 (37)

ParatroopersDescriptionIt is year 2500 A.D. and there is a terrible war between the forces of the Earth and the Mars. Recently, the commanders of the Earth are informed by their spies that the invaders of Mars want to land some paratroopers in them×ngrid yard of one their main weapon factories in order to destroy it. In addition, the spies informed them the row and column of the places in the yard in which each paratrooper will land. Since the paratroopers are very strong and well-organized, even one of them, if survived, can complete the mission and destroy the whole factory. As a result ...继续阅读 (27)

Destroying The GraphDescriptionAlice and Bob play the following game. First, Alice draws some directed graph with N vertices and M arcs. After that Bob tries to destroy it. In a move he may take any vertex of the graph and remove either all arcs incoming into this vertex, or all arcs outgoing from this vertex.Alice assigns two costs to each vertex: Wi+and Wi-. If Bob removes all arcs incoming into the i-th vertex he pays Wi+dollars to Alice, and if he removes outgoing arcs he pays Wi-dollars.Find out what minimal sum Bob needs to remove all arcs from the graph.InputInput file describes the gra ...继续阅读 (25)

Ikki's Story I - Road ReconstructionDescriptionIkki is the king of a small country – Phoenix, Phoenix is so small that there is only one city that is responsible for the production of daily goods, and uses the road network to transport the goods to the capital. Ikki finds that the biggest problem in the country is that transportation speed is too slow.Since Ikki was an ACM/ICPC contestant before, he realized that this, indeed, is a maximum flow problem. He coded a maximum flow program and found the answer. Not satisfied with the current status of the transportation speed, he wants to inc ...继续阅读 (53)

摘要: Marriage Match IV Problem Description Do not sincere non-interference。Like that show, now starvae also take part in a show, but it take place between city A and B. Starvae is in city A and girl...阅读全文火碳黑2011-04-23 21:19发表评论 ...继续阅读 (34)

Steady Cow AssignmentTime Limit:1000MSMemory Limit:65536KTotal Submissions:3062Accepted:1060DescriptionFarmer John's N (1 <= N <= 1000) cows each reside in one of B (1 <= B <= 20) barns which, of course, have limited capacity. Some cows really like their current barn, and some are not so happy.FJ would like to rearrange the cows such that the cows are as equally happy as possible, even if that means all the cows hate their assigned barn.Each cow gives FJ the order in which she prefers the barns. A cow's happiness with a particular assignment is her ranking of her barn. Your job is to find an a ...继续阅读 (27)

摘要: Panic Room Description You are the lead programmer for the Securitron 9042, the latest and greatest in home security software from Jellern Inc. (Motto: We secure your stuff so YOU can't even get ...阅读全文火碳黑2011-04-22 21:59发表评论 ...继续阅读 (40)

Secret Milking MachineDescriptionFarmer John is constructing a new milking machine and wishes to keep it secret as long as possible. He has hidden in it deep within his farm and needs to be able to get to the machine without being detected. He must make a total of T (1 <= T <= 200) trips to the machine during its construction. He has a secret tunnel that he uses only for the return trips.The farm comprises N (2 <= N <= 200) landmarks (numbered 1..N) connected by P (1 <= P <= 40,000) bidirectional trails (numbered 1..P) and with a positive length that does not exceed 1,000,000. Multiple trails ...继续阅读 (23)

摘要: Ombrophobic Bovines Description FJ's cows really hate getting wet so much that the mere thought of getting caught in the rain makes them shake in their hooves. They have decided to put a rain sir...阅读全文火碳黑2011-04-21 15:26发表评论 ...继续阅读 (22)

Optimal MilkingDescriptionFJ has moved his K (1 <= K <= 30) milking machines out into the cow pastures among the C (1 <= C <= 200) cows. A set of paths of various lengths runs among the cows and the milking machines. The milking machine locations are named by ID numbers 1..K; the cow locations are named by ID numbers K+1..K+C.Each milking point can "process" at most M (1 <= M <= 15) cows each day.Write a program to find an assignment for each cow to some milking machine so that the distance the furthest-walking cow travels is minimized (and, of course, the milking machines are not overutilized ...继续阅读 (28)

Cable TV NetworkDescriptionThe interconnection of the relays in a cable TV network is bi-directional. The network is connected if there is at least one interconnection path between each pair of relays present in the network. Otherwise the network is disconnected. An empty network or a network with a single relay is considered connected. The safety factor f of a network with n relays is:1. n, if the net remains connected regardless the number of relays removed from the net.2. The minimal number of relays that disconnect the network when removed.For example, consider the nets from figure 1, wher ...继续阅读 (26)

摘要: Friendship Description In modern society, each person has his own friends. Since all the people are very busy, they communicate with each other only by phone. You can assume that people A can kee...阅读全文火碳黑2011-04-14 21:47发表评论 ...继续阅读 (29)

PIGSDescriptionMirko works on a pig farm that consists of M locked pig-houses and Mirko can't unlock any pighouse because he doesn't have the keys. Customers come to the farm one after another. Each of them has keys to some pig-houses and wants to buy a certain number of pigs.All data concerning customers planning to visit the farm on that particular day are available to Mirko early in the morning so that he can make a sales-plan in order to maximize the number of pigs sold.More precisely, the procedure is as following: the customer arives, opens all pig-houses to which he has the key, Mirko s ...继续阅读 (20)

Kaka's Matrix TravelsDescriptionOn anN×Nchessboard with a non-negative number in each grid, Kaka starts his matrix travels withSUM= 0. For each travel, Kaka moves one rook from the left-upper grid to the right-bottom one, taking care that the rook moves only to the right or down. Kaka adds the number toSUMin each grid the rook visited, and replaces it with zero. It is not difficult to know the maximumSUMKaka can obtain for his first travel. Now Kaka is wondering what is the maximumSUMhe can obtain after hisKth travel. Note theSUMis accumulative during theKtravels.InputThe first line conta ...继续阅读 (20)

King's QuestDescriptionOnce upon a time there lived a king and he had N sons. And there were N beautiful girls in the kingdom and the king knew about each of his sons which of those girls he did like. The sons of the king were young and light-headed, so it was possible for one son to like several girls.So the king asked his wizard to find for each of his sons the girl he liked, so that he could marry her. And the king's wizard did it -- for each son the girl that he could marry was chosen, so that he liked this girl and, of course, each beautiful girl had to marry only one of the king's sons.H ...继续阅读 (27)