Cworld2017的博客

The digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digit then that digit is the digital root. If the resulting value contains two

The vast power system is the most complicated man-made system and the greatest engineering innovation in the 20th century. The following diagram shows a typical 14 bus power system. In real world, the

Your task is to Calculate a + b. Input There are multiple test cases. Each test case contains only one line. Each line consists of a pair of integers a and b ( 1 a, b 16 ) , separated by a space. I

This is a super simple problem. The description is simple, the solution is simple. If you believe so, just read it on. Or if you don't, just pretend that you can't see this one. We say an element is

There are another kind of Fibonacci numbers: F(0) = 7, F(1) = 11, F(n) = F(n-1) + F(n-2) (n>=2). InputInput consists of a sequence of lines, each containing an integer n. (n < 1,000,000). Output

"OK, you are not too bad, em... But you can never pass the next test." feng5166 says. #include #include #include #include #include #include using namespace std; int g[999999]; int main() { int

甜甜从小就喜欢画图画，最近他买了一支智能画笔，由于刚刚接触，所以甜甜只会用它来画直线，于是他就在平面直角坐标系中画出如下的图形： 甜甜的好朋友蜜蜜发现上面的图还是有点规则的，于是他问甜甜：在你画的图中，我给你两个点，请你算一算连接两点的折线长度（即沿折线走的路线长度）吧。 Input第一个数是正整数N（≤100）。代表数据的组数。 每组数据由四个非负整数组成x1，y1，

给定一个日期，输出这个日期是该年的第几天。 Input输入数据有多组，每组占一行，数据格式为YYYY/MM/DD组成，具体参见sample input ,另外，可以向你确保所有的输入数据是合法的。Output对于每组输入数据，输出一行，表示该日期是该年的第几天。Sample Input 1985/1/20 2006/3/12 Sample Output 20 71 闰年时二月会少一天，

You are given a rectangular cake, represented as an r × c grid. Each cell either has an evil strawberry, or is empty. For example, a 3 × 4 cake may look as follows: The cakeminator is going to e

There are N little kids sitting in a circle, each of them are carrying some java beans in their hand. Their teacher want to select M kids who seated in M consecutive seats and collect java beans from