基本算法-水题
文章平均质量分 82
Menglei Min
这个作者很懒,什么都没留下…
展开
-
UVA 488 Triangle Wave(输出三角波)
Triangle Wave Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %llu Submit Sta Description Triangle Wave In this problem you are to generate a原创 2014-08-04 14:01:19 · 1171 阅读 · 0 评论 -
POJ 1936 All in All(string)
All in All Time Limit: 1000MS Memory Limit: 30000K Description You have devised a new encryption technique which encodes a message by inserting between its char原创 2014-09-01 16:28:01 · 627 阅读 · 0 评论 -
HDU 2104 hide handkerchief(辗转相除法--GCD)
hide handkerchief Time Limit: 10000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 4693 Accepted Submission(s): 1547 Problem Description原创 2014-08-19 16:30:16 · 1121 阅读 · 0 评论 -
CodeForces 370A Rook, Bishop and King(车,象,王到目的地的最小步数)
Rook, Bishop and King Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u Description Little Petya is learning to play chess. He has already learned how to原创 2014-08-12 20:57:26 · 947 阅读 · 0 评论 -
10010 - Where's Waldorf?(找出单词的位置,可以在八个直线方向)
给出一个m行n列的字符矩阵(),和一个单词列表,在矩阵上匹配每个单词。在矩阵上匹配单词包含八个方向(上、下、左、右、左上、左下、右上、右下),单词匹配成功后输出第一个字符的坐标。原创 2014-08-05 13:57:32 · 776 阅读 · 0 评论 -
HDU 1335 Basically Speaking(进制转化)
Basically Speaking Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Description The Really Neato Calculator Company, Inc. has recently hired your team to help原创 2014-08-10 22:56:01 · 894 阅读 · 0 评论 -
UVA 146 ID code(next_permutation的运用)
题目大意: 输出当前的下一个(按照排序)。 解题思路: 用next_permutation。原创 2014-09-14 16:33:51 · 837 阅读 · 0 评论 -
poj 1493 Machined Surfaces(最后有多少个空格)
D - Machined Surfaces Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %llu Submit Status Description Machined Surfaces An imaging device furnishe原创 2014-08-01 09:45:22 · 623 阅读 · 0 评论 -
UVA 100 The 3n + 1 problem(超级大水题)
The 3n + 1 problem Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %llu Description Problems in Computer Science are often classified as belonging to a certain class of原创 2014-08-19 11:10:20 · 1305 阅读 · 0 评论 -
UVA 10361 - Automatic Poetry(<>里字符串交换)
Automatic Poetry Input: standard input Output: standard output Time Limit: 2 seconds Memory Limit: 32 MB “Oh God”, Lara Croft exclaims, “it’s one of these dumb riddles again!” In Tomb原创 2014-08-05 19:43:20 · 686 阅读 · 0 评论 -
UVA, 445 Marvelous Mazes(根据输入的字符输出相应的矩阵)
Problem H : Marvelous Mazes From:UVA, 445 Marvelous Mazes Your mission, if you decide to accept it, is to create a maze drawing program. A maze will consist of the alphabe原创 2014-07-30 15:51:36 · 660 阅读 · 0 评论 -
POJ, 1035 Spell checker(根据单词表,寻找符合相似度要求的单词。)
Spell checker From:POJ, 1035 Description You, as a member of a development team for a new spell checking program, are to write a module that will check the correctness of given words using a kn原创 2014-07-30 18:22:38 · 760 阅读 · 0 评论 -
UVA, 10008 What's Cryptanalysis?(先按次数从大到小排列,后按照字典中的字母顺序)
Problem I : What's Cryptanalysis? From:UVA, 10008 Cryptanalysis is the process of breaking someone else'scryptographic writing. This sometimes involves some kind of statisticalanalysis of原创 2014-07-30 23:56:00 · 969 阅读 · 0 评论 -
UVA 902 Password Search (字符串)
Password Search Being able to send encoded messages during World War II was very important to the Allies. The messages were always sent after being encoded with a known password. Having a fixed p原创 2015-01-09 13:27:59 · 945 阅读 · 0 评论