2019杭电暑假多校训练营(第五场)
bootdubbo
这个作者很懒,什么都没留下…
展开
-
permutation 1
Problem Description A sequence of length n is called a permutation if and only if it’s composed of the first n positive integers and each number appears exactly once. Here we define the “difference se...原创 2019-08-25 20:32:37 · 238 阅读 · 0 评论 -
permutation 2
Problem Description You are given three positive integers N,x,y. Please calculate how many permutations of 1∼N satisfies the following conditions (We denote the i-th number of a permutation by pi): p...原创 2019-08-25 20:53:12 · 250 阅读 · 0 评论 -
string matching
Problem Description String matching is a common type of problem in computer science. One string matching problem is as following: Given a string s[0…len−1], please calculate the length of the longest ...原创 2019-08-25 21:01:40 · 179 阅读 · 0 评论