摘要:
Artificial Intelligence?Physics teachers in high school often think that problems given as text are more demanding than pure computations. After all, the pupils have to read and understand the problem first!So they don't state a problem like ``U=10V, I=5A, P=?" but rather like ``You have an
阅读全文
posted @ 2012-11-09 23:42
aries__liu
阅读(389)
推荐(0)
编辑
摘要:
一个比较偷懒的方法是执行一下命令:cd /etc/vimsudo vi vimrc然后把里面的注释去掉就可以了,但是里面的配置不太全。原文链接 http://www.oschina.net/code/snippet_103341_9644linux 平台: 1 " ----------------- Author: Ruchee 2 " ----------------- Email: my@ruchee.com 3 " ----------------- WebSite: http://www.ruchee.com 4 " --------------
阅读全文
posted @ 2012-11-09 08:23
aries__liu
阅读(1913)
推荐(0)
编辑
摘要:
Where's Waldorf?Given ambyngrid of letters, (), and a list of words, find the location in the grid at which the word can be found. A word matches a straight, uninterrupted line of letters in the grid. A word can match the letters in the grid regardless of case (i.e. upper and lower case letters
阅读全文
posted @ 2012-11-09 07:57
aries__liu
阅读(365)
推荐(0)
编辑
摘要:
Cube paintingWe have a machine for painting cubes. It is supplied with three different colors: blue, red and green. Each face of the cube gets one of these colors. The cube's faces are numbered as in Figure 1.Figure 1.Since a cube has 6 faces, our machine can paint a face-numbered cube indiffere
阅读全文
posted @ 2012-11-08 22:07
aries__liu
阅读(825)
推荐(0)
编辑
摘要:
Problem A.Ant on a ChessboardBackgroundOne day, an ant called Alice came to an M*M chessboard. She wanted to go around all the grids. So she began to walk along the chessboard according to this way: (you can assume that her speed is one grid per second)At the first second, Alice was standing at (1,1
阅读全文
posted @ 2012-11-08 21:13
aries__liu
阅读(320)
推荐(0)
编辑
摘要:
Power of CryptographyBackgroundCurrent work in cryptography involves (among other things) large prime numbers and computing powers of numbers modulo functions of these primes. Work in this area has resulted in the practical use of results from number theory and other branches of mathematics once con
阅读全文
posted @ 2012-11-08 00:07
aries__liu
阅读(193)
推荐(0)
编辑
摘要:
Secret ResearchAt a certain laboratory results of secret research are thoroughly encrypted. A result of a single experiment is stored as an information of its completion: `positive result',`negative result',`experiment failed' or`experiment not completed'The encrypted result constitu
阅读全文
posted @ 2012-11-07 23:32
aries__liu
阅读(243)
推荐(0)
编辑
摘要:
The Cat in the HatBackground(An homage to Theodore Seuss Geisel)The Cat in the Hat is a nasty creature,But the striped hat he is wearing has a rather nifty feature.With one flick of his wrist he pops his top off.Do you know what's inside that Cat's hat?A bunch of small cats, each with its ow
阅读全文
posted @ 2012-11-07 21:46
aries__liu
阅读(1054)
推荐(0)
编辑
摘要:
How Many Points of Intersection?We have two rows. There areadots on the top row andbdots on the bottom row. We draw line segments connecting every dot on the top row with every dot on the bottom row. The dots are arranged in such a way that the number of internal intersections among the line segment
阅读全文
posted @ 2012-11-07 00:12
aries__liu
阅读(360)
推荐(0)
编辑
摘要:
Searching for NessyThe Loch Ness Monsteris a mysterious and unidentified animal said to inhabit Loch Ness,a large deep freshwater loch near the city of Inverness in northern Scotland. Nessie is usually categorized as a type of lake monster.http://en.wikipedia.org/wiki/Loch_Ness_MonsterIn July 2003,
阅读全文
posted @ 2012-11-06 23:57
aries__liu
阅读(187)
推荐(0)
编辑
摘要:
The SnailA snail is at the bottom of a 6-foot well and wants to climb to the top. The snail can climb 3 feet while the sun is up, but slides down 1 foot at night while sleeping. The snail has a fatigue factor of 10%, which means that on each successive day the snail climbs 10%3 = 0.3 feet less than
阅读全文
posted @ 2012-11-06 23:54
aries__liu
阅读(255)
推荐(0)
编辑
摘要:
从今年暑假7月15日开始学ACM到现在已经快4个月了,水平还是那么的水。。。照这样下去,明年的这个时候该是什么样子,,唉。。从开始到现在走了不少弯路,明显把太多时间花在了做水题上,也没有做多少总结,根本没有去认真学一下正经的算法,其实算法才是最重要的,把算法学好需要很长的时间积累,不是短期内就可以搞定的。以后少做水题,多学算法,针对学习的算法多练习,平均每天做3题比较合适,还有,多总结,经常用的算法多写几遍,熟练,代码要精简。好好加油吧,再坚持一阵子,虽然不知道以后会变成怎样。看书要有针对性地看。做ACM,关键是态度,人家做IOI的,不也是高中生吗,人家照样比大学生强。至于队友,LLH明年大四
阅读全文
posted @ 2012-11-06 14:27
aries__liu
阅读(144)
推荐(0)
编辑
摘要:
看完人家的博客,发现任重道远。。。一位高手对我的建议:一般要做到50行以内的程序不用调试、100行以内的二分钟内调试成功.acm主要是考算法的,主要时间是花在思考算法上,不是花在写程序与debug上。下面给个计划你练练:第一阶段:练经典常用算法,下面的每个算法给我打上十到二十遍,同时自己精简代码,因为太常用,所以要练到写时不用想,10-15分钟内打完,甚至关掉显示器都可以把程序打出来.1.最短路(Floyd、Dijstra,BellmanFord)2.最小生成树(先写个prim,kruscal要用并查集,不好写)3.大数(高精度)加减乘除4.二分查找. (代码可在五行以内)5.叉乘、判线段相交
阅读全文
posted @ 2012-11-06 12:43
aries__liu
阅读(5149)
推荐(5)
编辑
摘要:
Problem J(2/3/4)-D Sqr/Rects/Cubes/Boxes?Input:standard inputOutput:standard outputTime Limit:2 secondsYou can see a (4x4) grid below. Can you tell me how many squares and rectangles are hidden there? You can assume that squares are not rectangles. Perhaps one can count it by hand but can you count
阅读全文
posted @ 2012-11-05 19:37
aries__liu
阅读(325)
推荐(0)
编辑
摘要:
The 3n+ 1 problemBackgroundProblems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this problem you will be analyzing a property of an algorithm whose classification is not known for all possible inputs.The ProblemConsider t
阅读全文
posted @ 2012-11-05 10:48
aries__liu
阅读(449)
推荐(0)
编辑
摘要:
Problem E: Jolly JumpersA sequence ofn > 0integers is called ajolly jumperif the absolute values of the difference between successive elements take on all the values 1 throughn-1. For instance,1 4 2 3 is a jolly jumper, because the absolutes differences are 3, 2, and 1 respectively. The definitio
阅读全文
posted @ 2012-11-05 10:42
aries__liu
阅读(342)
推荐(0)
编辑
摘要:
每天找出一段时间总结一下自己今天学习过的知识,写博客是一个比较好的方法,坚持下去吧。每天都要有一点进步 !
阅读全文
posted @ 2012-11-05 08:06
aries__liu
阅读(72)
推荐(0)
编辑