摘要：
描述 Koch Snowflake is one of the most famous factal. It is built by starting with an equilateral triangle, removing the inner third of each side, build 阅读全文
摘要：
老潘,袁少,小艾都是江理的大个子,他们想按身高排队,现在给你他们的身高,请你算出队伍中站在第二的有多高。 老潘,袁少,小艾都是江理的大个子,他们想按身高排队,现在给你他们的身高,请你算出队伍中站在第二的有多高。 输入三个整数，分别表示三个人的身高。（单位：纳米） 输入三个整数，分别表示三个人的身高。 阅读全文
摘要：
豆豆非常调皮，总喜欢把一样的东西摆在一起，然后用神奇的猫爪功把他们揉成一团。 比如一堆A，就会被揉成个数+A. 这就是豆豆的字符串压缩算法了。 比如给豆豆一个字符串：ABBCCCDDDDEEEEEEEEEEEccc，就会被他用猫爪功压缩成1A2B3C4D11E3c 豆豆非常调皮，总喜欢把一样的东西摆 阅读全文
摘要：
Yaroslav has an array that consists of n integers. In one second Yaroslav can swap two neighboring array elements. Now Yaroslav is wondering if he can 阅读全文
摘要：
Shaass has decided to hunt some birds. There are n horizontal electricity wires aligned parallel to each other. Wires are numbered 1 to nfrom top to b 阅读全文
摘要：
In the city of Ultima Thule job applicants are often offered an IQ test. The test is as follows: the person gets a piece of squared paper with a 4 × 4 阅读全文
摘要：
1 #include <iostream> 2 #include <algorithm> 3 #include <cstring> 4 #include <cstdio> 5 #include <vector> 6 #include <cstdlib> 7 #include <iomanip> 8 阅读全文
摘要：
A few years ago, Hitagi encountered a giant crab, who stole the whole of her body weight. Ever since, she tried to avoid contact with others, for fear 阅读全文
摘要：
Very soon there will be a parade of victory over alien invaders in Berland. Unfortunately, all soldiers died in the war and now the army consists of e 阅读全文
摘要：
Bear Limak wants to become the largest of bears, or at least to become larger than his brother Bob. Right now, Limak and Bob weigh a and b respectivel 阅读全文
摘要：
Emuskald needs a fence around his farm, but he is too lazy to build it himself. So he purchased a fence-building robot. He wants the fence to be a reg 阅读全文
摘要：
Two players play a simple game. Each player is provided with a box with balls. First player's box contains exactly n1 balls and second player's box co 阅读全文
摘要：
Ted has a pineapple. This pineapple is able to bark like a bulldog! At time t (in seconds) it barks for the first time. Then every s seconds after it, 阅读全文
摘要：
Walking through the streets of Marshmallow City, Slastyona have spotted some merchants selling a kind of useless toy which is very popular nowadays – 阅读全文
摘要：
小K手中有n张牌，每张牌上有一个一位数的数，这个字数不是0就是5。小K从这些牌在抽出任意张（不能抽0张），排成一行这样就组成了一个数。使得这个数尽可能大，而且可以被90整除。 注意： 1.这个数没有前导0， 2.小K不需要使用所有的牌。 小K手中有n张牌，每张牌上有一个一位数的数，这个字数不是0就是 阅读全文
摘要：
给出2个大整数A,B，计算A+B的结果。 给出2个大整数A,B，计算A+B的结果。 给出2个大整数A,B，计算A+B的结果。 Input 第1行：大数A 第2行：大数B (A,B的长度 <= 10000 需注意：A B有可能为负数） Output 输出A + B Input示例 6893214758 阅读全文