hello world

DescriptionEkka and his friend Dokka decided to buy a cake. They both love cakes and that's why they want to share the cake after buying it. As the name suggested that Ekka is very fond of odd num

DescriptionAgent J is preparing to steal an antique diamond piece from a museum. As it is fully guarded and they are guarding it using high technologies, it's not easy to steal the piece. There ar

DescriptionA parallelogram is a quadrilateral with two pairs of parallel sides. See the picture below:Fig: a parallelogramNow you are given the co ordinates of A, B and C, you have to find t

DescriptionSometimes some mathematical results are hard to believe. One of the common problems is the birthday paradox. Suppose you are in a party where there are 23 people including you. What is

DescriptionFind the number of k-divisible numbers on the segment [a, b]. In other words you need to find the number of such integer values x thata ≤ x ≤ b and x is divisible by k.Input

DescriptionSee the picture below.You are given AB, AC and BC. DE is parallel to BC. You are also given the area ratio between ADE and BDEC. You have to find the value ofAD.InputInp

DescriptionYou are given two integers: n and k, your task is to find the most significant three digits, and least significant three digits of nk.InputInput starts with an integer T (≤

时间限制：1000 ms  |  内存限制：65535 KB描述  有N个人,N个活动， 每个人只会对2个或者3个活动感兴趣， 每个活动也只有两个人或者三个人对它兴趣，每个人参加一个 感兴趣的活动需要一天 ，且当天该活动被参加时，其他的人不能参加 如果每个人都参加完自己有兴趣的活动，应当怎样安排使得所用总天数时间最短2输入一个数T 表示T 组数据

DescriptionThere are n distinct points in the plane, given by their integer coordinates. Find the number of parallelograms whose vertices lie on these points. In other words, find the number of 4-

DescriptionA group of N Internet Service Provider companies (ISPs) use a private communication channel that has a maximum capacity of C traffic units per second. Each company transfers T traffic u

Description985有n个数，已知每次操作可以将其中不相同的两个数一个加一、一个减一，操作次数不限。问他最多可以得到多少个相同的数。Input第一行输入一个整数t，代表有t组测试数据。每组数据占两行，第一行输入一个n代表元素个数，下面一行输入n个整数a[]。注：1 Output输出一个整数代表最多可以得到多少个相同的数。

Problem DescriptionJam has a math problem. He just learned factorization.He is trying to factorize ax2+bx+c into the form of pqx2+(qk+mp)x+km=(px+k)(qx+m).He could only solve the problem in

DescriptionWhen Teddy was a child , he was always thinking about some simple math problems ,such as “What it’s 1 cup of water plus 1 pile of dough ..” , “100 yuan buy 100 pig” .etc.. One day