摘要: Problem Description The i’th Fibonacci number f(i) is recursively defined in the following way: Your task is to compute some values of this sequence I 阅读全文
posted @ 2019-08-16 20:16 昏后一缕阳光 阅读(142) 评论(0) 推荐(0) 编辑
摘要: Problem Description After AC all the hardest problems in the world , the ACboy 8006 now has nothing to do . One day he goes to an old library to find 阅读全文
posted @ 2019-08-16 16:33 昏后一缕阳光 阅读(457) 评论(0) 推荐(0) 编辑
摘要: Problem Description Consider equations having the following form: a*x1^2+b*x2^2+c*x3^2+d*x4^2=0 a, b, c, d are integers from the interval [-50,50] and 阅读全文
posted @ 2019-08-16 15:42 昏后一缕阳光 阅读(156) 评论(1) 推荐(0) 编辑
摘要: Problem Description The French author Georges Perec (1936–1982) once wrote a book, La disparition, without the letter'e'. He was a member of the Oulip 阅读全文
posted @ 2019-08-16 11:31 昏后一缕阳光 阅读(183) 评论(0) 推荐(0) 编辑
摘要: Problem Description 给出一个只由小写英文字符a,b,c...y,z组成的字符串S,求S中最长回文串的长度. 回文就是正反读都是一样的字符串,如aba, abba等 Input 输入有多组case,不超过120组,每组输入为一行小写英文字符a,b,c...y,z组成的字符串S 两组 阅读全文
posted @ 2019-08-16 10:09 昏后一缕阳光 阅读(144) 评论(0) 推荐(0) 编辑