字符串
文章平均质量分 85
ACLJW
这个作者很懒,什么都没留下…
展开
-
1339:Ancient Cipher
Ancient CipherTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 36467 Accepted: 11879DescriptionAncient Roman empire had a strong government system with various departments, including a secret...原创 2018-04-09 10:49:51 · 132 阅读 · 0 评论 -
227:Puzzle
A children’s puzzle that was popular 30 years ago consisted of a 5×5 frame which contained 24 smallsquares of equal size. A unique letter of the alphabet was printed on each small square. Since therew...原创 2018-04-05 13:17:58 · 146 阅读 · 0 评论 -
253:Cube painting
253:Cube painting开始的想法:骰子无论怎么转,每个数字和其对面的数字的对应关系永远不会改变,所以只需要比较两个骰子的三对数字是否相同即可,也的确AC了,但是后来想想不太对。#include<cstdio>#include<cstring>using namespace std;char s[12];int vis[3];int main(){ ...原创 2018-04-12 12:42:34 · 130 阅读 · 0 评论 -
232:Crossword Answers
Crossword AnswersTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 1357 Accepted: 572DescriptionA crossword puzzle consists of a rectangular grid of black and white squares and two lists of de...原创 2018-04-05 17:39:10 · 222 阅读 · 0 评论 -
1368:DNA Consensus String
问题简述:给定m个长度为n的DNA序列,求一个DNA序列,使其到所有这些序列的总hamming距离尽量小,如果有多个解,输出字典顺序的最小解。贪心#include<cstdio>#include<cstring>using namespace std;const int maxn = 1000 + 5,maxm = 50 + 5;char table[maxn][m...原创 2018-04-05 18:14:53 · 157 阅读 · 0 评论 -
13040:All in All
All in AllTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 34909 Accepted: 14571DescriptionYou have devised a new encryption technique which encodes a message by inserting between its charact...原创 2018-04-06 18:31:12 · 182 阅读 · 0 评论 -
1588:Kickdown
KickdownTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 2214 Accepted: 944DescriptionA research laboratory of a world-leading automobile company has received an order to create a special tra...原创 2018-04-06 22:50:34 · 300 阅读 · 0 评论 -
230:Borrowers
Borrowers又因为输出WA了一发。。。一定要看清楚输出要求啊啊#include<cstdio>#include<iostream>#include<map>#include<vector>#include<cstring>#include<algorithm>using namespace std;cons...原创 2018-04-23 10:48:29 · 152 阅读 · 0 评论 -
814:The Letter Carrier's Rounds
The Letter Carrier's Rounds注意可能有重复的收件人。version 1(20ms):#include<cstdio>#include<iostream>#include<map>#include<set>#include<cstring>#include<algorithm>using n...原创 2018-04-20 17:09:35 · 210 阅读 · 0 评论 -
1593:Alignment of Code
Alignment of Code#include<iostream>#include<cstring>#include<vector>#include<algorithm>#include<sstream>using namespace std;const int maxw = 180 + 5;const int maxl...原创 2018-04-21 01:13:42 · 129 阅读 · 0 评论 -
1596:Bug Hunt
Bug Hunt我的思路:对于每行code,若无等号,直接初始化数组即可,否则依次检查等号左边和右边的表达式是否正确。对于左边的表达式,只需检查到首个数组之前即可,因为可能要对其初始化;对于右边表达式则要全部检查。对于复合表达式要如何检查呢?我的做法是先找出数字下标,确定其最内层数组,然后依次向外找出外层数组。此外还有一些小细节需要特别注意,这次是一次AC,开心。具体代码如下:#include&l...原创 2018-04-25 12:23:54 · 361 阅读 · 0 评论 -
1597:Searching the Web
Searching the Web这道题就 "and" 查询麻烦点,别的还好,但是刚开始超时了。。。version 1(Time limit exceeded):#include<bits/stdc++.h>using namespace std;const int maxn = 100 + 5;typedef pair<int,int> P;vector<s...原创 2018-04-28 21:42:09 · 158 阅读 · 0 评论 -
455:Periodic Strings
A character string is said to have period k if it can be formed by concatenating one or more repetitionsof another string of length k. For example, the string ”abcabcabcabc” has period 3, since it is ...原创 2018-04-05 00:20:28 · 133 阅读 · 0 评论 -
1586:Molar mass
An organic compound is any member of a large class of chemicalcompounds whose molecules contain carbon. The molarmass of an organic compound is the mass of one mole of theorganic compound. The molar m...原创 2018-04-04 22:11:03 · 129 阅读 · 0 评论 -
489:Hangman Judge
489 - Hangman JudgeTime limit: 3.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=94&page=show_problem&problem=430In ``Hangman Judge,'' you are ...原创 2018-04-09 17:32:20 · 166 阅读 · 0 评论 -
10815:Andy's First Dictionary
Andy's First Dictionary#include<iostream>#include<set>#include<string>#include<sstream>using namespace std;set<string>dict;int main(){ string s,buf; while(c...原创 2018-04-15 20:48:32 · 143 阅读 · 0 评论 -
156:Ananagrams
Ananagrams思路:对于每一个单词,先存入数组,然后标准化(小写加排序)后的单词的计数值加1,最后输出数组中计数位1的单词即可。version 1(自己写的版本):#include<iostream>#include<map>#include<string>#include<algorithm>using namespace std;...原创 2018-04-15 21:57:27 · 127 阅读 · 0 评论 -
3. Longest Substring Without Repeating Characters
Given a string, find the length of the longest substring without repeating characters.Examples:Given "abcabcbb", the answer is "abc", which the length is 3.Given "bbbbb", the answer is "b", with the l...原创 2018-03-12 08:33:45 · 109 阅读 · 0 评论 -
5. Longest Palindromic Substring
Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.Example:Input: "babad"Output: "bab"Note: "aba" is also a valid answer. Example:I...原创 2018-03-25 12:36:18 · 146 阅读 · 0 评论 -
6. ZigZag Conversion
The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)P A H NA P L S I I G...原创 2018-03-28 16:53:11 · 109 阅读 · 0 评论 -
213:Message Decoding
Some message encoding schemes require that an encoded message be sent in two parts. The first part, called the header, contains the characters of the message. The second part contains a pattern that r...原创 2018-04-11 10:17:46 · 148 阅读 · 0 评论 -
272:TEX Quotes
TEX QuotesTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 10913 Accepted: 5670DescriptionTEX is a typesetting language developed by Donald Knuth. It takes source text together with a few typ...原创 2018-04-03 23:00:25 · 119 阅读 · 0 评论 -
10082:WERTYU
WERTYUTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9533 Accepted: 4543Description A common typing error is to place the hands on the keyboard one row to the right of the correct position....原创 2018-04-03 23:15:35 · 206 阅读 · 0 评论 -
401:Palindromes
PalindromesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1253 Accepted Submission(s): 504Problem DescriptionA regular palindrome is a strin...原创 2018-04-03 23:17:37 · 159 阅读 · 0 评论 -
1584:Circular Sequence
Some DNA sequences exist in circular forms as in the following figure, which shows a circular sequence “CGAGTCAGCT”, that is, the last symbol “T” in “CGAGTCAGCT” is connected to the first symbol “C”...原创 2018-04-04 13:03:09 · 104 阅读 · 0 评论 -
511:Do You Know the Way to San Jose?
Do You Know the Way to San Jose?题目不难,主要就是排序,不过有些细节需要注意。一个很坑的地方是 map 的两个对角点是不确定的,可能是左上和右下,也可能是左下和右上,而且两个点的顺序也不一定是左右。。。害我找了好久的bug。。。还有就是输出的时候注意单词别拼错了,空格别多打了。。因为这个WA了好几发。。AC大概是现在唯一能让我开心的事情了。#in...原创 2018-04-29 23:44:04 · 235 阅读 · 0 评论