C++
文章平均质量分 74
小张喝奶茶了吗
这个作者很懒,什么都没留下…
展开
-
Elephant(CodeForces - 617A)
ElephantAn elephant decided to visit his friend. It turned out that the elephant’s house is located at point 0 and his friend’s house is located at point x(x > 0) of the coordinate line. In one step the elephant can move 1, 2, 3, 4 or 5 positions forwa原创 2021-02-26 15:03:57 · 171 阅读 · 0 评论 -
Search for Pretty Integers (CodeForces - 870A)
Search for Pretty IntegersYou are given two lists of non-zero digits.Let’s call an integer pretty if its (base 10) representation has at least one digit from the first list and at least one digit from the second list. What is the smallest positive pretty原创 2021-01-22 16:17:50 · 107 阅读 · 0 评论 -
Team(CodeForces - 231A)
TeamOne day three best friends Petya, Vasya and Tonya decided to form a team and take part in programming contests. Participants are usually offered several problems during programming contests. Long before the start the friends decided that they will imp原创 2021-01-18 23:07:00 · 219 阅读 · 1 评论 -
Domino piling(CodeForces - 50A)
Domino pilingYou are given a rectangular board of M × N squares. Also you are given an unlimited number of standard domino pieces of 2 × 1 squares. You are allowed to rotate the pieces. You are asked to place as many dominoes as possible on the board so a原创 2021-01-18 22:53:28 · 195 阅读 · 1 评论 -
Supermarket(CodeForces - 919A)
SupermarketWe often go to supermarkets to buy some fruits or vegetables, and on the tag there prints the price for a kilo. But in some supermarkets, when asked how much the items are, the clerk will say that a yuan for b kilos (You don’t need to care abou原创 2021-01-16 23:52:01 · 178 阅读 · 0 评论 -
Replacing Elements (CodeForces - 1473A)
Replacing ElementsYou have an array a1,a2,…,an. All ai are positive integers.In one step you can choose three distinct indices i, j, and k (i≠j; i≠k; j≠k) and assign the sum of aj and ak to ai, i. e. make ai=aj+ak.Can you make all ai lower or equal to d原创 2021-01-16 23:16:21 · 593 阅读 · 0 评论