
POJ
gtuif
大多数人永远都不会了解真实的你,但是他们会看到你所做的一切。。。
展开
-
C - 抽屉
Every year there is the same problem at Halloween: Each neighbour is only willing to give a certain total number of sweets on that day, no matter how many children call on him, so it may happen that a原创 2017-07-31 17:35:30 · 236 阅读 · 0 评论 -
HPUACM第二十周周练 I
年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了,于是便向酋长去求亲。酋长要他用10000个金币作为聘礼才答应把女儿嫁给他。探险家拿不出这么多金币,便请求酋长降低要求。酋长说:"嗯,如果你能够替我弄到大祭司的皮袄,我可以只要8000金币。如果你能够弄来他的水晶球,那么只要5000金币就行了。"探险家就跑到大祭司那里,向他要求皮袄或水晶球,大祭司要他用金币来换,或者替他弄来其他的东西,原创 2018-01-19 12:02:39 · 256 阅读 · 0 评论 -
POJ 3461 Oulipo
OulipoTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 44717 Accepted: 17890DescriptionThe French author Georges Perec (1936–1982) once wrote a book, La原创 2018-01-14 14:04:07 · 145 阅读 · 0 评论 -
POJ 2752 Seek the Name, Seek the Fame
Seek the Name, Seek the FameTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 21535 Accepted: 11252DescriptionThe little cat is so famous, that many couples原创 2018-01-14 14:00:39 · 202 阅读 · 0 评论 -
G - A Simple Problem with Integers POJ - 3468
You have N integers, A1,A2, ... , AN. You need to deal with two kinds of operations. One type of operation is to add some given number to each number in a given interval. The other is to ask for the原创 2017-09-07 22:48:58 · 258 阅读 · 0 评论 -
E - Matrix Power Series
E - Matrix Power SeriesTime Limit:3000MS Memory Limit:131072KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 3233DescriptionGiven a n × n matrix A and a posit原创 2017-08-23 08:54:47 · 294 阅读 · 0 评论 -
J - Truck History
Advanced Cargo Movement, Ltd. uses trucks of different types. Some trucks are used for vegetable delivery, other for furniture, or for bricks. The company has its own code describing each type of a原创 2017-08-04 00:12:58 · 201 阅读 · 0 评论 -
G - Agri-Net
Farmer John has been elected mayor of his town! One of his campaign promises was to bring internet connectivity to all farms in the area. He needs your help, of course.Farmer John ordered a high s原创 2017-08-03 23:50:21 · 227 阅读 · 0 评论 -
E - Highways
The island nation of Flatopia is perfectly flat. Unfortunately, Flatopia has a very poor system of public highways. The Flatopian government is aware of this problem and has already constructed a numb原创 2017-08-03 23:41:07 · 299 阅读 · 0 评论 -
C - Networking
You are assigned to design network connections between certain points in a wide area. You are given a set of points in the area, and a set of possible routes for the cables that may connect pairs of p原创 2017-08-03 23:28:05 · 322 阅读 · 0 评论 -
B - Highways
The island nation of Flatopia is perfectly flat. Unfortunately, Flatopia has no public highways. So the traffic is difficult in Flatopia. The Flatopian government is aware of this problem. They're pla原创 2017-08-03 23:21:55 · 282 阅读 · 0 评论 -
C - Smith Numbers POJ - 1142
While skimming his phone directory in 1982, Albert Wilansky, a mathematician of Lehigh University,noticed that the telephone number of his brother-in-law H. Smith had the following peculiar property:原创 2017-07-26 19:58:00 · 321 阅读 · 0 评论 -
D - Longest Ordered Subsequence POJ - 2533
A numeric sequence of ai is ordered if a1 a2 aN. Let the subsequence of the given numeric sequence ( a1, a2, ..., aN) be any sequence ( ai1, ai2, ..., aiK), where 1 i1 i2 iK N. For example, sequen原创 2017-07-26 19:40:36 · 248 阅读 · 0 评论 -
B - Period
For each prefix of a given string S with N characters (each character has an ASCII code between 97 and 126, inclusive), we want to know whether the prefix is a periodic string. That is, for each i (2原创 2017-08-16 10:58:09 · 232 阅读 · 0 评论 -
A - Power Strings
Given two strings a and b we define a*b to be their concatenation. For example, if a = "abc" and b = "def" then a*b = "abcdef". If we think of concatenation as multiplication, exponentiation by a non-原创 2017-08-16 10:52:18 · 286 阅读 · 0 评论 -
POJ 1061青蛙的约会 (扩展欧几里得求最小整数解)
两只青蛙在网上相识了,它们聊得很开心,于是觉得很有必要见一面。它们很高兴地发现它们住在同一条纬度线上,于是它们约定各自朝西跳,直到碰面为止。可是它们出发之前忘记了一件很重要的事情,既没有问清楚对方的特征,也没有约定见面的具体位置。不过青蛙们都是很乐观的,它们觉得只要一直朝着某个方向跳下去,总能碰到对方的。但是除非这两只青蛙在同一时间跳到同一点上,不然是永远都不可能碰面的。为了帮助这两只乐观的青蛙,...原创 2018-07-24 17:55:35 · 332 阅读 · 0 评论