09 2018 档案
HDU-3366-Count the string(KMP,DP)
摘要:Count the string Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 14368 Accepted Submission(s): 65
牛客OI赛制测试赛2(0906)
摘要:牛客OI赛制测试赛2(0906) A :无序组数 题目描述 给出一个二元组(A,B) 求出无序二元组(a,b) 使得(a|A,b|B)的组数 无序意思就是(a,b)和(b,a) 算一组. 输入描述: 输出描述: 输入 输出 说明 分析 1. 给出A的所有因数 和B的所有因数 组成的无序二元组数。无序
HDU-3746-Cyclic Nacklace(KMP,循环节)
摘要:Cyclic Nacklace Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 15422 Accepted Submission(s): 642
POJ-1200-Crazy Search(字符串Hash)
摘要:Crazy Search Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 33142 Accepted: 9079 Description Many people like to solve hard puzzles some o
POJ-1002-487-3279(字符串)
摘要:487 3279 Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 309685 Accepted: 55292 Description Businesses like to have memorable telephone num
Gym-101615C-Fear Factoring(数论)
摘要:分析 题意是求 L R之间的数的因数和 我们知道如果对于一个数 i ( i k时,要加上i和j,因为i和j都是c的因数。 特判1和本身时,要注意对于ik的数要加上本身和1. c++ int main() { ll l,r; while(cin l r) { ll k = sqrt(r),ans =