![](https://img-blog.csdnimg.cn/20201014180756930.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
joj acm_dfs
文章平均质量分 85
kongming_acm
kongming_acm
展开
-
1066: Fire Net II
1066: Fire Net IIStatusIn/OutTIME LimitMEMORY LimitSubmit TimesSolved UsersJUDGE TYPEstdin/stdout3s8192K504197Standard1st JOJ Cup Online VContest Warmup Proble原创 2010-03-12 20:31:00 · 383 阅读 · 0 评论 -
1241: Graph Connectivity
1241: Graph ConnectivityResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s8192K551201StandardConsider a graph G formed from a large number of nodes connected by edges. G is said to be connected if a path can be found in 0 or more steps between any pair o原创 2010-07-10 20:06:00 · 453 阅读 · 0 评论 -
2107: Red and Black
2107: Red and BlackResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s8192K336184StandardThere is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile. From a tile, he can move to one o原创 2010-07-10 20:11:00 · 513 阅读 · 0 评论 -
2200: Fracions
2200: FracionsResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s8192K292107StandardA fracion a/b(a This problem is used for contest: 29原创 2010-07-10 20:12:00 · 356 阅读 · 0 评论 -
2283: Prime Sums
2283: Prime SumsResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s8192K396115StandardThere is a set S = {x1, x2, ..., xN} and a integer K, can you tell me how many sums of K integers in S which the sums are all primes?InputThere are several case in t原创 2010-07-10 20:13:00 · 419 阅读 · 0 评论 -
2324: Go Dutch
2324: Go DutchResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE10s8192K30388StandardThere are N person and N job to do. The i-th person do j-th job will cost different certain money. Choose a scheme that every person only do one different job, and total c原创 2010-07-10 20:14:00 · 589 阅读 · 0 评论 -
2403: Simple Problem Again
2403: Simple Problem AgainResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s8192K530106StandardEveryone knows WeiXiaobao has seven wives. He is happy, but also has a lot of trouble. He has a 7*7 plots of land,and he want to built seven houses for his wif原创 2010-07-10 20:17:00 · 352 阅读 · 0 评论 -
2412: Divide the finger
2412: Divide the fingerResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE1s8192K373117StandardWe can divide one figure into some smaller ones.For example,123456789 can be divided into 123,456,789,or 1,234567,89,which is similar to putting some boards betwe原创 2010-07-10 20:19:00 · 411 阅读 · 0 评论 -
2510: Product
2510: ProductResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE1s16384K504157StandardThere are multiple test cases, the first line of each test case is a integer n. (2原创 2010-07-10 20:20:00 · 318 阅读 · 0 评论 -
2603: 2012世界末日
2603: 2012世界末日ResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE10s65536K20273Standard 种种迹象表明,公元2012年为世界末日,而科学家们进一步预测,人类将被一种神秘的时空机器送到另一个宇宙,所以不要害怕,我们只是搬了个新家而已~ 每一次改变都是一种进步,这个新的世界并不像我们的地球,不再有南方北方(不倒翁已为此头疼很久),不再有贫富贵贱,人们也不会再因为自己的长像头疼,因为同性别的人都变成了一个模样。当然原创 2010-07-10 20:21:00 · 729 阅读 · 0 评论 -
1401: Don't Get Rooked
<br />1401: Don't Get RookedResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s8192K242128Standard<br />In chess, the rook is a piece that can move any number of squares vertically or horizontally. In this problem we will consider small chess boards (at m原创 2010-07-17 23:41:00 · 483 阅读 · 0 评论 -
1310: Addition Chains
<br />1310: Addition ChainsResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s8192K20590Standard<br />An addition chain for n is an integer sequence with the following four properties: <br /> a0 = 1 am = na0<a1<a2<...<am-1<amFor each k ( ) there exist two原创 2010-07-18 23:15:00 · 492 阅读 · 0 评论 -
1003: Channel Allocation 着色问题 4色定理
<br />1003: Channel AllocationResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s8192K3211561Standard<br />When a radio station is broadcasting over a very large area, repeaters are used to retransmit the signal so that every receiver has a strong signal.原创 2010-08-08 22:15:00 · 817 阅读 · 0 评论 -
1534: Sticks
1534: Sticks -------------------------------------------------------------------------------- Result TIME Limit MEMORY Limit Run Times AC Times JUDGE 3s 8192K 1032 159 Standard George took sticks of the same length and cut them randomly until all parts bec原创 2010-08-11 18:55:00 · 435 阅读 · 0 评论 -
1185: Knight Moves
1185: Knight MovesResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE1s8192K590278StandardA friend of you is doing research on the Traveling Knight Problem (TKP) where you are to find the shortest closed tour of knight moves that visits each square of a giv原创 2010-07-10 20:03:00 · 362 阅读 · 0 评论 -
1018: Anagrams by Stack
1018: Anagrams by StackResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE5s8192K1026466StandardHow can anagrams result from sequences of stack operations? There are two sequences of stack operators which can convert TROT to TORT: [i i i i o o o oi o i原创 2010-07-10 20:03:00 · 346 阅读 · 0 评论 -
1197: Sum It Up
1197: Sum It UpResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s8192K624242StandardGiven a specified total t and a list of n integers, find all distinct sums using numbers from the list that add up to t. For example, if t = 4, n = 6, and the list is [4,原创 2010-07-10 20:05:00 · 359 阅读 · 0 评论 -
1349: Oil Deposits
1349: Oil DepositsResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s8192K516253StandardThe GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of land at a time, a原创 2010-07-10 20:06:00 · 305 阅读 · 0 评论 -
1387: CD
1387: CDResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s8192K1973367StandardYou have a long drive by car ahead. You have a tape recorder, but unfortunately your best music is on CDs. You need to have it on tapes so the problem to solve is: you have a t原创 2010-07-10 20:07:00 · 476 阅读 · 0 评论 -
1466: The Hamming Distance Problem
1466: The Hamming Distance ProblemResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s8192K349178StandardThe Hamming distance between two strings of bits (binary integers) is the number of corresponding bit positions that differ. This can be found by using原创 2010-07-10 20:09:00 · 442 阅读 · 0 评论 -
2056: Jojer's Story IV
2056: Jojer's Story IVResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s16384K611121StandardAs you know, Mr. Jojer is very good at mathematics. Even when he got to Las Vegas, after several days he found he could win exactly 100 dollars each day with 21 p原创 2010-07-10 20:10:00 · 350 阅读 · 0 评论 -
2360: Trading Transaction
2360: Trading TransactionResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE5s16384K82167StandardIn Chinese currency system, the bills come in 100, 50, 20, 10, 5, 2 and 1 denominations. When you buy something, the money you give to the salesman is a combin原创 2010-07-10 20:15:00 · 555 阅读 · 0 评论 -
2390: Tired Horse
2390: Tired HorseResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s8192K16889StandardOn a chess board sizes of m*n(1The input consists of several test cases.The size of the chess board m,n(row,column),and the start position v,h(ve原创 2010-07-10 20:16:00 · 330 阅读 · 0 评论 -
1195: Prime Ring Problem
1195: Prime Ring ProblemResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE10s8192K1725447StandardA ring is composed of n circles as shown in diagram. Put natural numbers into each circle separately, and the sum of numbers in two adjacent circles should be原创 2010-07-10 20:04:00 · 320 阅读 · 0 评论 -
2021: String Normalization
2021: String NormalizationResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE10s8192K415141StandardConsider a simplified charset C={'0', '1', '*'}, where '*' stands for either '0' or '1'. A string is semi-formed if it contains '*'s, otherwise it is normal-f原创 2010-07-10 20:09:00 · 390 阅读 · 0 评论 -
2410: The knight problem
2410: The knight problemResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s8192K23093StandardCan you play international chess?This problem has something about that,as you see ,on a normal 8*8 chessboard,there may be some barrier on some of the grids.If we原创 2010-07-10 20:17:00 · 314 阅读 · 0 评论 -
2534: The Hero Rescued The Princess
2534: The Hero Rescued The PrincessResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s65536K21061Standard美丽的公主被关在古老的施了咒语的城堡中,你作为当今世上最勇敢的英雄,决定救出这位美丽的公主。如果你成功了,最后公主就会嫁给你。当然故事有点俗套,至少如果你把她救出了,我会免费送你一个气球。但是有很多的英雄去救,如果别人在你之前把公主救了,那么公主可就不属于你了。所以你一定要加快行动,现在就向目标进发原创 2010-07-10 20:20:00 · 337 阅读 · 0 评论 -
2677: Problem C
4th Jilin Province Collegiate Programming Contest - Mar 22, 2010 Problem C: The Natural Series The natural series, from 1 to n and rewinding, has a special character. If you add two values whose distance is 2, the sum can be divided by the middle value exa原创 2010-07-10 20:23:00 · 451 阅读 · 0 评论 -
1182: Lotto
1182: LottoResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE1s8192K729340StandardIn a Lotto I have ever played, one has to select 6 numbers from the set {1,2,...,49}. A popular strategy to play Lotto - although it doesn't increase your chance of winning -原创 2010-07-10 20:00:00 · 366 阅读 · 0 评论 -
1017: Fire Net
1017: Fire NetResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s8192K998514StandardSuppose that we have a square city with straight streets. A map of a city is a square board with n rows and n columns, each representing a street or a piece of wall. A blo原创 2010-07-10 20:02:00 · 328 阅读 · 0 评论 -
joj 2623: BeautifulSky 将空间n个点分成两部分,求sigma(dis[ai,aj])的最大值
The sky is beautiful, there are many stars in it. Xiaoming is curious, he came out with a strange idea. He want to divide the stars into two原创 2011-10-19 11:45:44 · 807 阅读 · 0 评论