水题篇
文章平均质量分 65
凡尘古月
这个作者很懒,什么都没留下…
展开
-
ZOJ Problem Set - 1067||Color Me Less
Color Me LessTime Limit: 2 Seconds Memory Limit: 65536 KBProblemA color reduction is a mapping from a set of discrete colors to a smaller one. The solution to this problem requires th原创 2015-04-22 14:32:12 · 462 阅读 · 0 评论 -
ZOJ Problem Set - 3880||Demacia of the Ancients
Demacia of the AncientsTime Limit: 2 Seconds Memory Limit: 65536 KBThere is a popular multiplayer online battle arena game called Demacia of the Ancients. There are lots of professional t原创 2015-04-26 21:25:36 · 362 阅读 · 0 评论 -
ZOJ Problem Set - 3869||Ace of Aces
Ace of AcesTime Limit: 2 Seconds Memory Limit: 65536 KBThere is a mysterious organization called Time-Space Administrative Bureau (TSAB) in the deep universe that we humans have not disco原创 2015-04-26 21:29:57 · 660 阅读 · 0 评论 -
ZOJ Problem Set - 3876||May Day Holiday
May Day HolidayTime Limit: 2 Seconds Memory Limit: 65536 KBAs a university advocating self-learning and work-rest balance, Marjar University has so many days of rest, including holidays a原创 2015-04-26 22:37:55 · 548 阅读 · 0 评论 -
ZOJ Problem Set - 3872||Beauty of Array
Beauty of ArrayTime Limit: 2 Seconds Memory Limit: 65536 KBEdward has an array A with N integers. He defines the beauty of an array as the summation of all distinct integers in the array.原创 2015-04-28 16:14:32 · 533 阅读 · 0 评论 -
ZOJ Problem Set - 1151||Word Reversal
Word ReversalTime Limit: 2 Seconds Memory Limit: 65536 KBFor each list of words, output a line with each word reversed without changing the order of the words.This problem contains mu原创 2015-05-02 21:41:23 · 491 阅读 · 0 评论 -
ZOJ Problem Set - 1414||Number Steps
Number StepsTime Limit: 2 Seconds Memory Limit: 65536 KBStarting from point (0,0) on a plane, we have written all non-negative integers 0, 1, 2,... as shown in the figure. For example, 1,原创 2015-06-30 20:27:13 · 330 阅读 · 0 评论 -
ZOJ Problem Set - 2022||Factorial
FactorialTime Limit: 2 Seconds Memory Limit: 65536 KBThe most important part of a GSM network is so called Base Transceiver Station (BTS). These transceivers form the areas called cells (原创 2015-06-30 21:54:42 · 439 阅读 · 0 评论 -
ZOJ Problem Set - 2482||IP Address
IP AddressTime Limit: 2 Seconds Memory Limit: 65536 KBSuppose you are reading byte streams from any device, representing IP addresses. Your task is to convert a 32 characters long sequenc原创 2015-06-30 20:31:37 · 429 阅读 · 0 评论 -
ZOJ Problem Set - 1712||Skew Binary
Skew BinaryTime Limit: 2 Seconds Memory Limit: 65536 KBWhen a number is expressed in decimal, the kth digit represents a multiple of 10 k. (Digits are numbered from right to left, where t原创 2015-06-30 22:26:18 · 416 阅读 · 0 评论 -
ZOJ Problem Set - 2186 Keep on Truckin'
Keep on Truckin'Time Limit: 2 Seconds Memory Limit: 65536 KBBoudreaux and Thibodeaux are on the road again . . ."Boudreaux, we have to get this shipment of mudbugs to Baton Rouge by ton原创 2015-07-01 20:54:55 · 560 阅读 · 0 评论 -
ZOJ Problem Set - 1195 Blowing Fuses
Blowing FusesTime Limit: 2 Seconds Memory Limit: 65536 KBMaybe you are familiar with the following situation. You have plugged in a lot of electrical devices, such as toasters, refrigerat原创 2015-07-04 14:06:10 · 681 阅读 · 0 评论 -
ZOJ Problem Set - 2932 The Seven Percent Solution
The Seven Percent SolutionTime Limit: 2 Seconds Memory Limit: 65536 KBUniform Resource Identifiers (or URIs) are strings like http://icpc.baylor.edu/icpc/, mailto:foo@bar.org, ftp://127原创 2015-07-04 13:51:05 · 636 阅读 · 0 评论 -
ZOJ Problem Set - 2850 Beautiful Meadow
用一个二维数组存储,0代表割草,1代表有草,要求两个割草的地方不能是相邻,不能每块都有草。首先在输入时判断是否有块地方是0,即为割草。则flag = 1, 接下来通过相邻两块相加是否 == 0 来判断两块地是否都为割草。需要注意边界情况,初始化为1#include int main(){ int n, m, i, j, map[15][15], flag; while(sc原创 2015-07-05 12:37:00 · 408 阅读 · 0 评论 -
ZOJ Problem Set - 1402 Magnificent Meatballs
水题。一开始想复杂了。其实就是当相等时输出各自的位置,否则输出。。。。#include #include int main(){ int pos[31], i, n, sum, flag, temp; while(scanf("%d", &n) != EOF && n) { sum = 0; flag = 1; temp = 0; for(i = 1; i <=原创 2015-07-05 14:21:20 · 344 阅读 · 0 评论 -
ZOJ Problem Set - 1241 Geometry Made Simple
Geometry Made SimpleTime Limit: 2 Seconds Memory Limit: 65536 KB Mathematics can be so easy when you have a computer. Consider the following example. You probably know that in a right-a原创 2016-02-01 18:27:32 · 497 阅读 · 0 评论 -
ZOJ Problem Set - 3878||Convert QWERTY to Dvorak
Convert QWERTY to DvorakTime Limit: 2 Seconds Memory Limit: 65536 KBEdward, a poor copy typist, is a user of the Dvorak Layout. But now he has only a QWERTY Keyboard with a broken Caps Lo原创 2015-04-26 22:27:01 · 686 阅读 · 0 评论 -
ZOJ Problem Set - 3875||Lunch Time
Lunch TimeTime Limit: 2 Seconds Memory Limit: 65536 KBThe 999th Zhejiang Provincial Collegiate Programming Contest will be held in Marjar University. The canteen of Marjar University is m原创 2015-04-26 21:39:35 · 477 阅读 · 0 评论 -
ZOJ Problem Set - 1037||Gridland
GridlandTime Limit: 2 Seconds Memory Limit: 65536 KBBackgroundFor years, computer scientists have been trying to find efficient solutions to different computing problems. For some of原创 2015-04-22 12:50:27 · 479 阅读 · 0 评论 -
ZOJ Problem Set - 1049||I Think I Need a Houseboat
I Think I Need a HouseboatTime Limit: 2 Seconds Memory Limit: 65536 KBFred Mapper is considering purchasing some land in Louisiana to build his house on. In the process of investigating原创 2015-04-22 13:49:00 · 402 阅读 · 0 评论 -
ZOJ Problem Set - 1057||Undercut
UndercutTime Limit: 2 Seconds Memory Limit: 65536 KBUndercut is a card game where two players each have five cards numbered one through five. At each round, each player selects a card, th原创 2015-04-22 14:09:55 · 363 阅读 · 0 评论 -
ZOJ Problem Set - 1078||Palindrom Numbers
Palindrom NumbersTime Limit: 2 Seconds Memory Limit: 65536 KBStatement of the ProblemWe say that a number is a palindrom if it is the sane when read from left to right or from right to原创 2015-04-22 14:59:41 · 394 阅读 · 0 评论 -
ZOJ Problem Set - 1001||A + B Problem
A + B ProblemTime Limit: 2 Seconds Memory Limit: 65536 KBCalculate a + bInputThe input will consist of a series of pairs of integers a and b,separated by a space, one pair of inte原创 2015-04-22 12:31:23 · 603 阅读 · 0 评论 -
ZOJ Problem Set - 1045||HangOver
HangOverTime Limit: 2 Seconds Memory Limit: 65536 KBHow far can you make a stack of cards overhang a table? If you have one card, you can create a maximum overhang of half a card length.原创 2015-04-22 13:04:00 · 425 阅读 · 0 评论 -
ZOJ Problem Set - 1048||Financial Management
Financial ManagementTime Limit: 2 Seconds Memory Limit: 65536 KBLarry graduated this year and finally has a job. He's making a lot of money, but somehow never seems to have enough. Larr原创 2015-04-22 13:08:13 · 422 阅读 · 0 评论 -
ZOJ Problem Set - 1115||Digital Roots
Digital RootsTime Limit: 2 Seconds Memory Limit: 65536 KBBackgroundThe digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a si原创 2015-04-22 16:02:13 · 420 阅读 · 0 评论 -
ZOJ Problem Set - 3600||Taxi Fare
Taxi FareTime Limit: 2 Seconds Memory Limit: 65536 KBLast September, Hangzhou raised the taxi fares.The original flag-down fare in Hangzhou was 10 yuan, plusing 2 yuan per kilometer aft原创 2015-04-22 19:09:18 · 414 阅读 · 0 评论 -
ZOJ Problem Set - 3603||Draw Something Cheat
Draw Something CheatTime Limit: 2 Seconds Memory Limit: 65536 KBHave you played Draw Something? It's currently one of the hottest social drawing games on Apple iOS and Android Devices! In原创 2015-04-23 19:23:01 · 558 阅读 · 0 评论 -
ZOJ Problem Set - 3326||An Awful Problem
An Awful ProblemTime Limit: 1 Second Memory Limit: 32768 KBIn order to encourage Hiqivenfin to study math, his mother gave him a sweet candy when the day of the month was a prime number.原创 2015-04-21 16:50:18 · 360 阅读 · 0 评论 -
ZOJ Problem Set - 3499||Median
MedianTime Limit: 2 Seconds Memory Limit: 65536 KBA median is described as the numeric value separating the higher half of a list, from the lower half. The median of a finite list of numb原创 2015-04-21 18:42:43 · 405 阅读 · 0 评论 -
ZOJ Problem Set - 3487||Ordinal Numbers
Ordinal NumbersTime Limit: 2 Seconds Memory Limit: 65536 KBOrdinal numbers refer to a position in a series. Common ordinals include zeroth, first, second, third, fourth and so on. Ordinal原创 2015-04-21 18:48:39 · 413 阅读 · 0 评论 -
ZOJ Problem Set - 3498||Javabeans
JavabeansTime Limit: 2 Seconds Memory Limit: 65536 KBJavabeans are delicious. Javaman likes to eat javabeans very much.Javaman has n boxes of javabeans. There are exactly i javabeans in原创 2015-04-21 19:54:44 · 494 阅读 · 0 评论 -
ZOJ Problem Set - 3492||Kagome Kagome
Kagome KagomeTime Limit: 2 Seconds Memory Limit: 65536 KBKagome kagome, kago no naka no tori waItsu itsu deyaru? Yoake no ban niTsuru to kame to subetta.Ushiro no shoumen daare?Tr原创 2015-04-21 19:26:09 · 542 阅读 · 0 评论 -
ZOJ Problem Set - 1295 Reverse Text
Reverse TextTime Limit: 2 Seconds Memory Limit: 65536 KB In most languages, text is written from left to right. However, there are other languages where text is read and written from ri原创 2016-02-01 18:29:49 · 448 阅读 · 0 评论