题目描述 In Finite Encyclopedia of Integer Sequences (FEIS), all integer sequences of lengths between 1 and N (inclusive) consisting of integers between 1 ...
分类:
其他好文 时间:
2018-08-04 17:29:25
阅读次数:
167
Time limit : 2sec / Memory limit : 256MB Score : 800 points Problem Statement In Finite Encyclopedia of Integer Sequences (FEIS), all integer sequence ...
分类:
其他好文 时间:
2018-08-04 11:38:32
阅读次数:
154
题目描述 In Finite Encyclopedia of Integer Sequences (FEIS), all integer sequences of lengths between 1 and N (inclusive) consisting of integers between 1 ...
分类:
其他好文 时间:
2018-08-03 22:35:52
阅读次数:
160
This is yet another problem dealing with regular bracket sequences. We should remind you that a bracket sequence is called regular, if by inserting «+ ...
分类:
其他好文 时间:
2018-08-02 23:11:19
阅读次数:
195
URAL 1081. Binary Lexicographic Sequence Time limit: 0.5 second Memory limit: 64 MB Description Consider all the sequences with length (0 include incl ...
分类:
其他好文 时间:
2018-08-02 16:56:38
阅读次数:
166
A conditional language model assigns probabilities to sequences of words. ...
分类:
其他好文 时间:
2018-08-01 22:10:30
阅读次数:
178
Description 给定n,m,求$\sum_{i=1}^{n}\sum_{j=1}^{m}\varphi(ij)$模10^9+7的值。 Input 仅一行,两个整数n,m。 Output 仅一行答案。 Sample Input 100000 1000000000 Sample Output 8 ...
分类:
其他好文 时间:
2018-07-30 13:24:12
阅读次数:
186
Polycarpus loves hamburgers very much. He especially adores the hamburgers he makes with his own hands. Polycarpus thinks that there are only three de ...
分类:
其他好文 时间:
2018-07-28 13:53:52
阅读次数:
164
"题目传送门" 虽然只是一道黄题,但还是学到了一点新知识—— 摩尔投票法 用$O(1)$的内存,$O(n)$的时间来找出一串长度为n的数中的众数,前提是众数出现的次数要大于$n/2$ 方法很简单: for(int i=1;i ...
分类:
其他好文 时间:
2018-07-26 21:16:34
阅读次数:
127
啥是正则表达式? 一个正则表达式(regular expression)就是包含正常字符串和特殊元字符(meta characters)或元序列(meta sequences)的字符串。正常字符串匹配它们自己。元字符和元序列是字符或表示数量、位置或字符类型的字符序列。 这里只是记录一下学习过程,学习 ...
分类:
Web程序 时间:
2018-07-25 16:16:11
阅读次数:
202