active2489595970的博客

1374: Greatest Naruto ArmyTime Limit: 1 Sec  Memory Limit: 128 MBSubmit: 117  Solved: 37[Submit][Status][Web Board]Descriptionccc is a VERY VERY BIG fans of Naruto(漩涡鸣人). Naruto's persev

A - Minimum’s Revenge There is a graph of n vertices which are indexed from 1 to n. For any pair of different vertices, the weight of the edge between them is the least common multiple of th

One day, you, a clever boy, feel bored in your math class, and then fall asleep without your control. In your dream, you meet Mr. Frog, an elder man. He has a problem for you. He gives you two pos

转自：http://blog.csdn.net/pi9nc/article/details/9666627我们都知道 二分查找 适用于单调函数中逼近求解某点的值。 如果遇到凸性或凹形函数时，可以用三分查找求那个凸点或凹点。 下面的方法应该是三分查找的一个变形。如图所示，已知左右端点L、R，要求找到白点的位置。 思路：通过不断缩小 [L,R]

A - Second-price Auction ZOJ - 3202 Do you know second-price auction? It's very simple but famous. In a second-price auction, each potential buyer privately submits, perhaps in a sealed envelo

B - Light Bulb ZOJ - 3203 Compared to wildleopard's wealthiness, his brother mildleopard is rather poor. His house is narrow and he has only one light bulb in his house. Every night,

F - 80ers' Memory ZOJ - 3207 I guess most of us are so called 80ers, which means that we were born in the 1980's. This group of people shared a lot of common memories. For example, t

I - A Stack or A Queue?ZOJ - 3210 Do you know stack and queue? They're both important data structures. A stack is a "first in last out" (FILO) data structure and a queue is a "first

J - Dream City ZOJ - 3211 JAVAMAN is visiting Dream City and he sees a yard of gold coin trees. There are ntrees in the yard. Let's call them tree 1, tree 2 ...and tree n. At the first day, ea

K - Yet Another Story of Rock-paper-scissors ZOJ - 3610 Akihisa and Hideyoshi were lovers. They were sentenced to death by the FFF Inquisition. Ryou, the leader of the FFF Inquisition, promise

J - Modular Inverse  ZOJ - 3609 The modular modular multiplicative inverse of an integer a modulo m is an integer xsuch that a-1≡x (mod m). This is equivalent to ax≡1 (mod m).

Last September, Hangzhou raised the taxi fares.The original flag-down fare in Hangzhou was 10 yuan, plusing 2 yuan per kilometer after the first 3km and 3 yuan per kilometer after 10km. The waiting

1567: Good Joke!Time Limit: 1 Sec  Memory Limit: 128 MBSubmit: 42  Solved: 29[Submit][Status][Web Board]DescriptionVadim and Roman like discussing challenging problems with each other.

1568: Climbing StairsTime Limit: 1 Sec  Memory Limit: 128 MBSubmit: 50  Solved: 19[Submit][Status][Web Board]DescriptionThere is a ritual that some monks of Byteland perform every cent

1571: Subarray GCDTime Limit: 1 Sec  Memory Limit: 128 MBSubmit: 90  Solved: 48[Submit][Status][Web Board]DescriptionGiven an array A1,A2...AN, you have to print the size of the larges

1343: 素数对Time Limit: 1 Sec  Memory Limit: 128 MBSubmit: 666  Solved: 163[Submit][Status][Web Board]Description输入一个正整数n，求有几对素数x,y，满足n=x+y（(3,2)和(2,3)视为相同的素数对）。Input有多组数据，每行输入一个偶

1373: Crixalis's EquipmentTime Limit: 1 Sec  Memory Limit: 128 MBSubmit: 138  Solved: 43[Submit][Status][Web Board]DescriptionCrixalis - Sand King used to be a giant scorpion(蝎子) in the

Problem G: Decreasing StringTime Limit: 1 Sec  Memory Limit: 128 MBSubmit: 133  Solved: 51[Submit][Status][Web Board]DescriptionYou need to find a string which has exactly K positions in

1570: Palindromic NumbersTime Limit: 1 Sec  Memory Limit: 128 MBSubmit: 110  Solved: 7[Submit][Status][Web Board]DescriptionJohnny has figured out that there are some numbers

1776: Press the switchTime Limit: 1 Sec  Memory Limit: 128 MBSubmit: 328  Solved: 82[Submit][Status][Web Board]Description达达的家里有一串长度为n的灯泡，编号1,2,3,4.....n-1,n。每一个灯泡都有一个开关，达达每次选一个数a，把编号为a的

B - Unrequited Love ZOJ - 3601 There are n single boys and m single girls. Each of them may love none, one or several of other people unrequitedly and one-sidedly. For the coming q d