Meosea-优快云博客

原创第一道BFS

Given a positive integer n, write a program to find out a nonzero multiple m of n whose decimal representation contains only the digits 0 and 1. You may assume that n is not greater than 200 and there

2017-11-18 20:11:23 180

原创 580 DFS

题目Kefa decided to celebrate his first big salary by going to the restaurant.He lives by an unusual park. The park is a rooted tree consisting of n vertices with the root at vertex 1. Vertex 1 also cont

2017-11-16 14:10:21 286

原创能猜结论这件事也很重要

就好像高中时候的压轴题= = 猜出来能过就好啦嘛… 这道题的题意是这样的： = =他说输出任意一个就可以诶 Vladik and Chloe decided to determine who of them is better at math. Vladik claimed that for any positive integer n he can re

2017-11-06 10:56:55 232

原创 #382 div.2

Tennis Championship Famous Brazil city Rio de Janeiro holds a tennis tournament and Ostap Bender doesn’t want to miss this event. There will be n players participating, and the tournament will follow

2017-11-06 10:18:44 230

原创 798A 还是很水...分析情况要分析完整哦

ike has a string s consisting of only lowercase English letters. He wants to change exactly one character from the string so that the resulting one is a palindrome.A palindrome is a string that reads t

2017-11-03 11:20:43 253

原创 766B 很水但是有点点启示

Mahmoud has n line segments, the i-th of them has length ai. Ehab challenged him to use exactly 3 line segments to form a non-degenerate triangle. Mahmoud doesn't accept challenges unless he is sure he

2017-11-03 11:11:53 596

原创有一种策略...

啊不知道是什么策略啊= = 不知道怎么讲啊用了好多次就是求最小值的时候越接近越越对？嗯呢类似基本不等式的感觉诶…….方差月小越好类似这种A few years ago Sajjad left his school and register to another one due to security reasons. Now he wishes to find Amir, one of

2017-11-02 16:57:40 317

原创 133A 读注意的嘤嘤

emmmmmm昨天读一个超级超级水的题都用坑的啊好蠢好蠢好蠢 “H” prints “Hello, World!”, “Q” prints the source code of the program itself, “9” prints the lyrics of “99 Bottles of Beer” song, “+” increments the value st

2017-11-02 09:08:23 318

原创 UVA-136 Set

丑数本来明白思路就应该做出来的题结果wa了好多次啊嘤嘤嘤求第1500个元素是什么那么也就是我们生成一下第1500个元素就行了但是WA 了嘤嘤嘤！！！！！！！！：：：：： WA 的代码：：：： ugly.insert(1);//！！！！！！！这个的位置#include <iostream> #include <cstdio> #include <set> using namespace s

2017-10-31 14:38:03 299

原创 1031 UVA540 map+queue

UVA 540 又是题目读的乱七八糟的题，团体队列的话啊最重要的还是理解题意插入时有两种 1.有队友那么插入队友之后， 2.没有队友的话插入队尾所以问题的关键就是判断有没有队友队作为一个群体，具有相同的ID编号，即多对一的关系——–多对一的关的话很容易想到Map的吧（毕竟映射诶）好的呢判断条件解决啦~ 所以我们去执行呀

2017-10-30 21:10:18 206

其他猫做不到（> . <）