Occult

Problem DescriptionToday CodeFamer is going to cut trees.There are N trees standing in a line. They are numbered from 1 to N. The tree numbered i has height hi. We say that two uncutted tr

Problem Descriptionzxa have an unrooted tree with n nodes, including (n−1) undirected edges, whose nodes are numbered from 1 to n. The degree of each node is defined as the number of the edg

Modulo QueryTime Limit: 2 Seconds      Memory Limit: 65536 KBOne day, Peter came across a function which looks like:F(1, X) = X mod A1.F(i, X) = F(i - 1, X) mod Ai, 2 ≤ i ≤ N.Where A is

Problem Description众所周知，度度熊喜欢的字符只有两个：B和D。今天，它发明了一种用B和D组成字符串的规则：S(1)=BS(2)=BBDS(3)=BBDBBDD…S(n)=S(n−1)+B+reverse(flip(S(n−1))其中，reverse(s)指将字符串翻转，比如reverse(BBD)=DBB，flip

Problem Description?? is practicing his program skill, and now he is given a string, he has to calculate the total number of its distinct substrings. But ?? thinks that is too easy, he wants to

DescriptionDemy has n jewels. Each of her jewels has some value vi and weight wi.Since her husband John got broke after recent financial crises, Demy has decided to sell some jewels. She has d

As meticulous Gerald sets the table and caring Alexander sends the postcards, Sergey makes snowmen. Each showman should consist of three snowballs: a big one, a medium one and a small one. Sergey's tw

There are N points in total. Every point moves in certain direction and certain speed. We want to know at what time that the largest distance between any two points would be minimum. And also, we requ

In the Game Civilization X, the world is made up of square-shaped "tiles", forming a rectangle on the world map. For a tile located at row X and column Y , we give it a coordinate, say (X, Y ). As y

Problem Descriptionztr loves lucky numbers. Everybody knows that positive integers are lucky if their decimal representation doesn't contain digits other than 4 and 7. For example, numbers 47, 744

Problem Description公元2222年，l国发生了一场战争。小Y负责领导工人运输物资。其中有m种物资的运输方案，每种运输方案形如li,ri。表示存在一种货物从li运到ri。这里有n个城市，第i个城市与第i+1个城市相连（这里1号城市和n号城市并不相连），并且从i号城市走到i+1号或者从i+1号走到i号需要耗费1点时间。由于高科技的存在，小Y想到了一

DescriptionYou are working for Macrohard company in data structures department. After failing your previous task about key insertion you were asked to write a new data structure that would be ab

Memory Limit: 32 MBSolve the equation:        p*e-x+ q*sin(x) + r*cos(x) + s*tan(x) + t*x2 + u = 0        where 0 x InputInput consists of multiple test cases and terminated by an EOF. Each

Problem DescriptionFor the k-th number, we all should be very familiar with it. Of course,to kiki it is also simple. Now Kiki meets a very similar problem, kiki wants to design a container, the co

Problem DescriptionMy birthday is coming up and traditionally I'm serving pie. Not just one pie, no, I have a number N of them, of various tastes and of various sizes. F of my friends are coming t

Problem DescriptionIn the battlefield , an effective way to defeat enemies is to break their communication system.The information department told you that there are n enemy soldiers and their ne

Problem DescriptionPog and Szh are playing games. There is a sequence with n numbers, Pog will choose a number A from the sequence. Szh will choose an another number named B from the rest in the

Problem DescriptionRompire is a robot kingdom and a lot of robots live there peacefully. But one day, the king of Rompire was captured by human beings. His thinking circuit was changed by human an

Problem DescriptionXiao Ming is a citizen who's good at playing,he has lot's of gold cones which have square undersides,let's call them pyramids.Anyone of them can be defined by the square's l

1018. Public Bike Management (30)时间限制400 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueThere is a public bike service in H

A religious sect has holy sites with shrines placed around a circle of radius 1000. The circle is split into N equal length arcs and the endpoints are numbered in order, 1 through N. The first figure