不想宅的冷同学

作者：LeetCode-Solution链接：https://leetcode-cn.com/problems/longest-palindromic-substring/solution/zui-chang-hui-wen-zi-chuan-by-leetcode-solution/来源：力扣（LeetCode）方法一：动态规划思路与算法class Solution: def longestPalindrome(self, s: str) -> str:

Manacher 算法：http://www.cnblogs.com/biyeymyhjob/archive/2012/10/04/2711527.htmlB - 吉哥系列故事――完美队形IITime Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64uSubmit Status

问题及代码：Problem DescriptionThere are another kind of Fibonacci numbers: F(0) = 7, F(1) = 11, F(n) = F(n-1) + F(n-2) (n>=2).InputInput consists of a sequence of lines, each containing an intege

问题及代码：Problem DescriptionFred Mapper is considering purchasing some land in Louisiana to build his house on. In the process of investigating the land, he learned that the state of Louisiana is

题目描述    Several days ago, a beast caught a beautiful princess and the princess was put in prison. To rescue the princess, a prince who wanted to marry the princess set out immediately. Yet, th

易彰彪最近有点奇怪，一向爱打游戏他最近居然盯着一张全是大小写字母的表在看，好像在找什么东西。他说，这是他女神给他的一张表，他需要回答女神的问题——在忽略大小写（即大写字母和小写字母视为同一字母）的情况下，是否能在表中找到某一连续的字符串（第 ii 行的尾部和第 i + 1i+1 行的头部视为相连）。但是英语不好的易彰彪一看到字母就头晕，聪明的你能帮他解决这个问题吗？输入格式：第一行会输

Find a wayTime Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9040    Accepted Submission(s): 2897Problem DescriptionPass a year lea

Problem DescriptionA hat’s word is a word in the dictionary that is the concatenation of exactly two other words in the dictionary.You are to find all the hat’s words in a dictionary.Input

Problem Description某省调查城镇交通状况，得到现有城镇道路统计表，表中列出了每条道路直接连通的城镇。省政府“畅通工程”的目标是使全省任何两个城镇间都可以实现交通（但不一定有直接的道路相连，只要互相间接通过道路可达即可）。问最少还需要建设多少条道路？ Input测试输入包含若干测试用例。每个测试用例的第1行给出两个正整数，分别是城镇数目N ( 注意:

Problem Description某国为了防御敌国的导弹袭击,发展出一种导弹拦截系统.但是这种导弹拦截系统有一个缺陷:虽然它的第一发炮弹能够到达任意的高度,但是以后每一发炮弹都不能超过前一发的高度.某天,雷达捕捉到敌国的导弹来袭.由于该系统还在试用阶段,所以只有一套系统,因此有可能不能拦截所有的导弹.怎么办呢?多搞几套系统呗!你说说倒蛮容易,成本呢?成本是个大问题啊.所以俺就到这里

#include #include #include using namespace std;int way[1001][1001],boy[1001],girl[1001];int m,n;bool findways(int x){ for (int i=1; i<=m; i++) { if(!girl[i]&&way[x][i]

#include #include #include using namespace std;int way[501][501],boy[501],girl[501];int k,m,n;bool findways(int x){ for (int i=1; i<=m; i++) { if(!girl[i]&&way[x][i])

#include #include #include using namespace std;int way[501][501],boy[501],girl[501];int m,n;bool findways(int x){ for (int i=1; i<=m; i++) { if(!girl[i]&&way[x][i])

1000ms 32768K江湖是什么，对于在象棋界厮杀的大钉来说，江湖就是一个矩阵，他的目标，就是在江湖之中骑着马，从他的位置出发，走到终点。当然，大钉的马也遵从中国象棋中的“马走日”的规则，而且在矩阵中，也会有一些障碍物，马不能跳到障碍物上；如果大钉的马面前有障碍物，即被“别马腿”，那么他将不能跳向有障碍物的左前和右前这两个方向。请问最少需要多少步，大钉才能骑着马跳到终点。输

王大钉喜欢喝酒，存货都喝完了，他就去楼下买，正好楼下的商店为了响应学校的 ACM 校赛推出了优惠活动：凡是在本店买的啤酒，喝完以后 33 个空瓶可以换一瓶，44 个瓶盖也可以换一瓶酒。王大钉觉得太合算了，决定多买，现在他手里的钱可以买 NN 瓶酒，但是他算不出来，通过活动兑换他一共可以喝到多少瓶？他很难过，你能帮他计算一下他能喝的酒的数量吗？输入格式：输入第一行是一个正整数 TT，代表

Defuse the BombTime Limit: 2 Seconds      Memory Limit: 65536 KBThe bomb is about to explode! Please defuse it as soon as possible!There is a display showing a number from 1 to 4 on the bomb

Seek the Name, Seek the FameTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 15829 Accepted: 8038DescriptionThe little cat is so famous, that many couple

Problem DescriptionN个气球排成一排，从左到右依次编号为1,2,3....N.每次给定2个整数a b(a Input每个测试实例第一行为一个整数N,(N 当N = 0，输入结束。Output每个测试实例输出一行，包括N个整数，第I个数代表第I个气球总共被涂色的次数。Sample Input31 12 23 33

Oil DepositsTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 22278    Accepted Submission(s): 12839Problem DescriptionThe GeoSurv

Prime Ring ProblemTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 39784    Accepted Submission(s): 17541Problem DescriptionA rin

http://blog.youkuaiyun.com/dark_scope/article/details/8880547          趣写算法#include #include #include using namespace std;int way[501][501],boy[501],girl[501];int k,m,n;bool findways(int x

Problem DescriptionIn a Lotto I have ever played, one has to select 6 numbers from the set {1,2,...,49}. A popular strategy to play Lotto - although it doesn't increase your chance of winning - is

poj1330 树结构 vector DFS

Description    30年的改革开放，给中国带来了翻天覆地的变化。2011全年中国手机产量约为11.72亿部。手机已经成为百姓的基本日用品！    给手机选个好听又好记的号码可能是许多人的心愿。但号源有限，只能辅以有偿选号的方法了。    这个程序的目的就是：根据给定的手机尾号（4位），按照一定的规则来打分。其规则如下：    1. 如果出现连号，不管

Description给出一个不多于5位的整数，要求 1、求出它是几位数 2、分别输出每一位数字 3、按逆序输出各位数字，例如原数为321,应输出123Input一个不大于5位的数字Output三行第一行 位数第二行 用空格分开的每个数字，注意最后一个数字后没有空格第三行 按逆序输出这个数Sample Input12345Sample Out

Description观察下面的算式：* * × * * = * * *它表示：两个两位数字相乘，结果是3位数。其中的星号(*)代表任意的数字，可以相同，也可以不同，只要不是在首位的就可以是0。当然，满足这个要求的算式很多，但我们还有如下的要求：所有星号所代表的数字全都是奇数。满足这个要求的算式就不多了。比如：13 x 15 = 195题目的任务

Description输入一行字符，分别统计出其中英文字母、数字、空格和其他字符的个数。Input一行字符Output统计值Sample Inputaklsjflj123 sadf918u324 asdf91u32oasdf/.';123Sample Output23 16 2 4HINT/**Copyright (c)2

问题及代码Problem DescriptionIgnatius bought a land last week, but he didn't know the area of the land because the land is enclosed by a parabola and a straight line. The picture below shows the area.

问题及代码Problem Description大家常常感慨，要做好一件事情真的不容易，确实，失败比成功容易多了！做好“一件”事情尚且不易，若想永远成功而总从不失败，那更是难上加难了，就像花钱总是比挣钱容易的道理一样。话虽这样说，我还是要告诉大家，要想失败到一定程度也是不容易的。比如，我高中的时候，就有一个神奇的女生，在英语考试的时候，竟然把40个单项选择题全部做错了！大家都学

题目及代码Problem DescriptionAs we know, Big Number is always troublesome. But it's really important in our ACM. And today, your task is to write a program to calculate A mod B.To make the problem

问题及代码Problem DescriptionOnce again, James Bond is fleeing from some evil people who want to see him dead. Fortunately, he has left a bungee rope on a nearby highway bridge which he can use to esca

题目DescriptionAstronomers often examine star maps where stars are represented by points on a plane and each star has Cartesian coordinates. Let the level of a star be an amount of the stars t

题目敌兵布阵Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 38750    Accepted Submission(s): 16353Problem DescriptionC国的死对头A国这段时间正

Problem DescriptionThe title of this problem is familiar,isn't it?yeah,if you had took part in the "Rookie Cup" competition,you must have seem this title.If you haven't seen it before,it doesn't m

Problem DescriptionNowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very popular in HDU. Maybe you are a good boy, and know little about this game, so I introduce it to

Statement of the ProblemYour task here is to write a program to aid in the assembly of a jigsaw puzzle by a robot.The puzzle is a rectangular array of flat four-sided pieces. Except for the outer

ZOJ Problem Set - 1002Fire NetTime Limit: 2 Seconds      Memory Limit: 65536 KBSuppose that we have a square city with straight streets. A map of a city is a square board with n rows and n

题目Problem DescriptionThe French author Georges Perec (1936–1982) once wrote a book, La disparition, without the letter 'e'. He was a member of the Oulipo group. A quote from the book

题目：DescriptionEdward has an array A with N integers. He defines the beauty of an array as the summation of all distinct integers in the array. Now Edward wants to know the summation of the

题目DescriptionHOHO，终于从Speakless手上赢走了所有的糖果，是Gardon吃糖果时有个特殊的癖好，就是不喜欢将一样的糖果放在一起吃，喜欢先吃一种，下一次吃另一种，这样；可是Gardon不知道是否存在一种吃糖果的顺序使得他能把所有糖果都吃完？请你写个程序帮忙计算一下。  Input第一行有一个整数T，接下来