Pseudoprime numbersTime Limit:1000MSMemory Limit:65536KTotal Submissions:7000Accepted:2855DescriptionFermat's theorem states that for any prime number...
分类：
其他好文 时间：
2015-02-23 09:35:42
阅读次数：
204
Description描述Find coordinates of any triangle ABC if it is know that |AB|=c, |AC|=b, |AM|=m, AM is a median of triangle.找到任何一个三角形ABC，使得它满足|AB| = c，|AC...
分类：
其他好文 时间：
2015-02-22 13:20:04
阅读次数：
140
Given any positive integer N, you are supposed to find all of its prime factors, and write them in the format N = p1^k1 * p2^k2 *…*pm^km. Input Specif...
分类：
其他好文 时间：
2015-02-21 11:59:24
阅读次数：
182
A reversible prime in any number system is a prime whose "reverse" in that number system is also a prime. For example in the decimal system 73 is a re...
分类：
其他好文 时间：
2015-02-21 09:42:17
阅读次数：
195
The task is simple: given any positive integer N, you are supposed to count the total number of 1's in the decimal form of the integers from 1 to N. F...
分类：
其他好文 时间：
2015-02-20 11:53:35
阅读次数：
249
换了新ID，以前的ID 运气不好D:题目隐藏的很深啊！如果说拓扑排序肯定会写，模型转换。计算每个点'.'的度，度：周围4个点为'.'的数目。然后BFS 枚举度为1的点 ，一遍构造，链接的点就度--；再压入队列中当枚举的点数不够'.'数目时，答案就是'unique';题目没要你输出any 这本身有蹊跷...
分类：
其他好文 时间：
2015-02-19 22:58:51
阅读次数：
157
For any 4-digit integer except the ones with all the digits being the same, if we sort the digits in non-increasing order first, and then in non-decre...
分类：
其他好文 时间：
2015-02-19 12:54:32
阅读次数：
138
Problem Description
You are given a number of case-sensitive strings of alphabetic characters, find the largest string X, such that either X, or its inverse can be found as a substring of any of the g...
分类：
其他好文 时间：
2015-02-17 16:33:16
阅读次数：
146
最近想研究一下sqlmapapi.py这个东西， 先找到一篇这个。
from: http://volatile-minds.blogspot.jp/2013/04/unofficial-sqlmap-restful-api.html
This isn't comprehensive, just the most useful methods. I haven't found any docs ...
分类：
数据库 时间：
2015-02-17 00:50:08
阅读次数：
2386
IP AddressTime Limit:1000MSMemory Limit:30000KTotal Submissions:18951Accepted:10939DescriptionSuppose you are reading byte streams from any device, re...
分类：
其他好文 时间：
2015-02-16 14:11:13
阅读次数：
164
