SPOJ
文章平均质量分 89
_Occult_
物語が始まった
展开
-
SPOJ 694 Distinct Substrings
Description Given a string, we need to find the total number of its distinct substrings. Input T- number of test cases. T Each test case consists of one string, whose length is Output For e原创 2015-05-21 11:09:01 · 443 阅读 · 0 评论 -
SPOJ REPEATS Repeats
Description A string s is called an (k,l)-repeat if s is obtained by concatenating k>=1 times some seed string t with length l>=1. For example, the string s = abaabaabaaba is a (4,3)-repeat wit原创 2016-08-14 20:49:43 · 1105 阅读 · 0 评论 -
SPOJ 705 New Distinct Substrings
Description Given a string, we need to find the total number of its distinct substrings. Input T- number of test cases. T Output For each test case output one number saying the number of dist原创 2015-05-21 11:16:40 · 497 阅读 · 0 评论 -
SPOJ PHRASES Relevant Phrases of Annihilation
Description You are the King of Byteland. Your agents have just intercepted a batch of encrypted enemy messages concerning the date of the planned attack on your island. You immedietaly send for原创 2016-08-15 18:52:47 · 413 阅读 · 0 评论 -
SPOJ QTREE4 Query on a tree IV
Description You are given a tree (an acyclic undirected connected graph) with N nodes, and nodes numbered 1,2,3...,N. Each edge has an integer value assigned to it(note that the value can be nega原创 2016-05-13 15:27:26 · 1179 阅读 · 0 评论 -
SPOJ FTOUR2 Free tour II
Description After the success of 2nd anniversary (take a look at problem FTOUR for more details), this 3rd year, Travel Agent SPOJ goes on with another discount tour. The tour will be held on IC原创 2016-05-11 19:45:28 · 1026 阅读 · 0 评论 -
SPOJ SUBLEX Lexicographical Substring Search
Description Little Daniel loves to play with strings! He always finds different ways to have fun with strings! Knowing that, his friend Kinan decided to test his skills so he gave him a string S原创 2015-10-25 16:39:21 · 437 阅读 · 0 评论 -
SPOJ LCS2 Longest Common Substring II
Description A string is finite sequence of characters over a non-empty finite set Σ. In this problem, Σ is the set of lowercase letters. Substring, also called factor, is a consecutive sequence原创 2015-10-24 17:26:35 · 487 阅读 · 0 评论 -
SPOJ LCS Longest Common Substring
Description A string is finite sequence of characters over a non-empty finite set Σ. In this problem, Σ is the set of lowercase letters. Substring, also called factor, is a consecutive sequence原创 2015-10-24 16:50:17 · 525 阅读 · 0 评论 -
SPOJ NSUBSTR Substrings
Description You are given a string S which consists of 250000 lowercase latin letters at most. We define F(x) as the maximal number of times that some string with length x appears in S. For examp原创 2015-10-24 23:29:50 · 396 阅读 · 0 评论 -
SPOJ 1771 NQUEEN Yet Another N-Queen Problem
After solving Solution to the n Queens Puzzle by constructing, LoadingTime wants to solve a harder version of the N-Queen Problem. Some queens have been set on particular locations on the board in t原创 2015-07-29 15:47:29 · 818 阅读 · 0 评论 -
SPOJ QTREE Query on a tree
Description You are given a tree (an acyclic undirected connected graph) with N nodes, and edges numbered 1, 2, 3...N-1. We will ask you to perfrom some instructions of the following form: CH原创 2016-11-04 18:36:06 · 281 阅读 · 0 评论