|
摘要：
试除法 ONE: Code Code highlighting produced by Actipro CodeHighlighter (freeware)http://www.CodeHighlighter.com/-->IsPrime(a){ for(i=2;i*ibool isPrime(int k) { for (int i = 2 ; i sqrt(n)时筛中剩下的数就已... 阅读全文
posted @ 2009-03-14 16:18 Y.Cloud 阅读(192) 评论(0) 推荐(0) 编辑
摘要：
TOJ 1516. Climbing Worm 很简单 Code Code highlighting produced by Actipro CodeHighlighter (freeware)http://www.CodeHighlighter.com/-->#include #include using namespace std; int main() { double n,... 阅读全文
posted @ 2009-03-14 15:53 Y.Cloud 阅读(185) 评论(0) 推荐(0) 编辑 |
||
