摘要:题目链接:https://vjudge.net/problem/POJ-3581 Sequence Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 7754 Accepted: 1761 Case Time Limit: 2000
阅读全文
摘要:题目链接:https://vjudge.net/problem/POJ-3450 Corporate Identity Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 8046 Accepted: 2710 Description
阅读全文
摘要:题目链接:https://vjudge.net/problem/UVA-11475 题意: 给出一个字符串,问在该字符串后面至少添加几个字符,使得其成为回文串,并输出该回文串。 题解: 实际上是求该字符串的“最长回文后缀”,有多种做法,其中用字符串哈希的方法最方便而且速度最快。 字符串哈希: 从字符
阅读全文
摘要:题目链接:https://vjudge.net/problem/POJ-3415 Common Substrings Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 12240 Accepted: 4144 Description
阅读全文
摘要:题目链接:https://vjudge.net/problem/SPOJ-PHRASES PHRASES - Relevant Phrases of Annihilation no tags no tags You are the King of Byteland. Your agents have
阅读全文
摘要:题目链接:https://vjudge.net/problem/POJ-1226 Substrings Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 15122 Accepted: 5309 Description You ar
阅读全文
摘要:题目链接:https://vjudge.net/problem/POJ-3294 Life Forms Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 16905 Accepted: 4970 Description You ma
阅读全文
摘要:题目链接:https://vjudge.net/problem/POJ-3693 Maximum repetition substring Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 11250 Accepted: 3465
阅读全文
摘要:题目链接:https://vjudge.net/problem/SPOJ-REPEATS REPEATS - Repeats no tags no tags A string s is called an (k,l)-repeat if s is obtained by concatenating
阅读全文
摘要:题目链接:https://vjudge.net/problem/POJ-2774 Long Long Message Time Limit: 4000MS Memory Limit: 131072K Total Submissions: 33144 Accepted: 13344 Case Time
阅读全文
摘要:题目链接:https://vjudge.net/problem/POJ-3261 Milk Patterns Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 17157 Accepted: 7592 Case Time Limit
阅读全文
摘要:题目链接:https://vjudge.net/problem/POJ-1743 Musical Theme Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 32402 Accepted: 10808 Description A
阅读全文
摘要:题目链接:https://vjudge.net/problem/SPOJ-SUBST1 SUBST1 - New Distinct Substrings #suffix-array-8 #suffix-array-8 Given a string, we need to find the total
阅读全文
摘要:一. 模板 1 struct Trie 2 { 3 int sz, M[256]; 4 int next[MAXN][50], fail[MAXN], end[MAXN]; 5 int root, L, id // L为结点个数, id为单词个数。id可选择使用 6 7 int newnode()
阅读全文
摘要:题目链接:https://vjudge.net/problem/HDU-3247 Resource Archiver Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 100000/100000 K (Java/Others)Total S
阅读全文
摘要:题目链接:https://vjudge.net/problem/POJ-1625 Censored! Time Limit: 5000MS Memory Limit: 10000K Total Submissions: 10870 Accepted: 2979 Description The alp
阅读全文
摘要:题目链接:https://vjudge.net/problem/ZOJ-3228 Little jay really hates to deal with string. But moondy likes it very much, and she's so mischievous that she
阅读全文
摘要:题目链接:https://vjudge.net/problem/ZOJ-3430 One day, Nobita found that his computer is extremely slow. After several hours' work, he finally found that i
阅读全文
摘要:题目链接:https://vjudge.net/problem/HDU-2296 Ring Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 442
阅读全文
摘要:题目链接:https://vjudge.net/problem/HDU-4511 小明系列故事——女友的考验 Time Limit: 500/200 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(
阅读全文
摘要:题目链接:https://vjudge.net/problem/HDU-2457 DNA repair Time Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s
阅读全文
摘要:题目链接:https://vjudge.net/problem/HDU-2825 Wireless Password Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submi
阅读全文
摘要:题目链接:https://vjudge.net/problem/HDU-2243 考研路茫茫——单词情结 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(
阅读全文
摘要:题目链接:https://vjudge.net/problem/POJ-2778 DNA Sequence Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 18479 Accepted: 7112 Description It's
阅读全文
摘要:题目链接:https://vjudge.net/problem/LightOJ-1151 1151 - Snakes and Ladders PDF (English) Statistics Forum Time Limit: 2 second(s) Memory Limit: 32 MB 'Sna
阅读全文
摘要:题目链接:https://vjudge.net/problem/LightOJ-1274 1274 - Beating the Dataset PDF (English) Statistics Forum Time Limit: 4 second(s) Memory Limit: 32 MB You
阅读全文
摘要:题目链接:https://vjudge.net/problem/LightOJ-1287 1287 - Where to Run PDF (English) Statistics Forum Time Limit: 2 second(s) Memory Limit: 32 MB Last night
阅读全文
摘要:题目链接:https://vjudge.net/problem/LightOJ-1284 1284 - Lights inside 3D Grid PDF (English) Statistics Forum Time Limit: 4 second(s) Memory Limit: 32 MB Y
阅读全文
摘要:题目链接:https://vjudge.net/problem/LightOJ-1248 1248 - Dice (III) PDF (English) Statistics Forum Time Limit: 1 second(s) Memory Limit: 32 MB Given a dice
阅读全文
摘要:题目链接:https://vjudge.net/problem/LightOJ-1265 1265 - Island of Survival PDF (English) Statistics Forum Time Limit: 2 second(s) Memory Limit: 32 MB You
阅读全文
摘要:题目链接:https://vjudge.net/problem/LightOJ-1038 1038 - Race to 1 Again PDF (English) Statistics Forum Time Limit: 2 second(s) Memory Limit: 32 MB Rimi le
阅读全文
摘要:题目链接:https://vjudge.net/problem/LightOJ-1079 1079 - Just another Robbery PDF (English) Statistics Forum Time Limit: 4 second(s) Memory Limit: 32 MB As
阅读全文
摘要:题目链接:https://vjudge.net/problem/LightOJ-1104 1104 - Birthday Paradox PDF (English) Statistics Forum Time Limit: 2 second(s) Memory Limit: 32 MB Someti
阅读全文
摘要:题目链接:https://vjudge.net/problem/LightOJ-1030 1030 - Discovering Gold PDF (English) Statistics Forum Time Limit: 2 second(s) Memory Limit: 32 MB You ar
阅读全文
摘要:题目链接:https://vjudge.net/problem/LightOJ-1027 1027 - A Dangerous Maze PDF (English) Statistics Forum Time Limit: 2 second(s) Memory Limit: 32 MB You ar
阅读全文
摘要:题目链接:https://vjudge.net/problem/CodeForces-385E E. Bear in the Field time limit per test 1 second memory limit per test 256 megabytes input standard i
阅读全文
摘要:题目链接:https://vjudge.net/problem/UVA-10518 题解: 问:求斐波那契数f[n]的时候调用了多少次f[n] = f[n-1] + f[n-2],没有记忆化,一直递归到f[0]、f[1],其中f[0]、f[1]也算调用了一次。 设求f[n]调用了S[n]次,则可知:
阅读全文
摘要:题目链接:https://vjudge.net/problem/UVA-11149 题意: 给出矩阵A,求出A^1 + A^2 …… + A^k 。 题解: 1.可知:A^1 + A^2 …… + A^k = (1+A^k/2)*(A^1 + A^2 …… + A^k/2)+ (k%2?A^k:0)
阅读全文
摘要:题目链接:https://vjudge.net/problem/HDU-4686 Arc of Dream Time Limit: 2000/2000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission
阅读全文
摘要:题目链接:https://vjudge.net/problem/HDU-4565 So Easy! Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s):
阅读全文
摘要:题目链接:https://vjudge.net/problem/UVA-10655 题意: a+b、ab的值分别为p、q,求a^n+b^n。 题解: 1.a、b未知,且直接求出a、b也不太实际。 2.看到 a^n+b^n 这个式子就想到二阶齐次递推式的通项公式,然后就想是否能通过通项公式反推回递推式
阅读全文
摘要:题目链接:https://vjudge.net/problem/HDU-5950 Recursive sequence Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Subm
阅读全文
摘要:题目链接:https://vjudge.net/problem/UVA-10870 题意: 典型的矩阵快速幂的运用。比一般的斐波那契数推导式多了几项而已。 代码如下: 1 #include <bits/stdc++.h> 2 #define rep(i,s,t) for(int (i)=(s); (
阅读全文
摘要:题目链接:https://vjudge.net/problem/HDU-5171 GTY's birthday gift Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Sub
阅读全文
摘要:题目链接:https://vjudge.net/problem/HDU-4965 Fast Matrix Calculation Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Tot
阅读全文
摘要:题目链接:https://vjudge.net/problem/UVA-11551 题意: 给定一列数,每个数对应一个变换,变换为原先数列一些位置相加起来的和,问r次变换后的序列是多少 题解: 构造矩阵:要加的位置值为1,其余位置为0。然后用快速幂计算。 代码如下: 1 #include <iost
阅读全文
摘要:题目链接:https://vjudge.net/problem/HDU-4549 M斐波那契数列 Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s):
阅读全文
摘要:题目链接:https://vjudge.net/problem/UVA-10689 题解: 代码如下: 1 #include <iostream> 2 #include <cstdio> 3 #include <cstring> 4 #include <algorithm> 5 #include <
阅读全文
摘要:题目链接:https://vjudge.net/problem/HDU-4990 Reading comprehension Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total S
阅读全文
摘要:题目链接:https://vjudge.net/problem/HDU-5015 233 Matrix Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(
阅读全文
摘要:题目链接:https://vjudge.net/problem/CodeForces-450B B. Jzzhu and Sequences time limit per test 1 second memory limit per test 256 megabytes input standard
阅读全文
摘要:一. 素数筛、素数表 1.小区间素数(1e6、1e7): 2.大区间素数筛(1e12): 3.题目: 二.唯一分解定理 1.模板: 2.题目: 三. 欧几里得、扩展欧几里得 1.欧几里得算法: 辗转相除法证明: 设 d = gcd(a,b), 那么 d | a 、d | b …… 符号“|”表示整除
阅读全文