
数学
文章平均质量分 82
fcbruce
Veni,Vidi,Vici
展开
-
POJ 3233 Matrix Power Series (教练,我想学线代……)
http://poj.org/problem?id=3233 Matrix Power Series Time Limit: 3000MS Memory Limit: 131072K Total Submissions: 13472 Accepted: 5809 Description Given a n原创 2014-02-13 13:18:23 · 808 阅读 · 0 评论 -
POJ 1905 Expanding Rods(二分)
http://poj.org/problem?id=1905 Expanding Rods Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 10655 Accepted: 2724 Description When a thin原创 2014-03-01 11:25:43 · 940 阅读 · 0 评论 -
XTU 1192 Number(位运算)
http://202.197.224.59/OnlineJudge2/index.php/Problem/read/id/1192 Number Accepted : 10 Submit : 140 Time Limit : 5000 MS Memory Limit : 65536 KB原创 2014-04-14 21:01:08 · 1032 阅读 · 0 评论 -
Codeforces Round #240 (Div. 2)(前三题解题报告)
sign。。。。今天看来又要掉分了原创 2014-04-07 03:01:38 · 1259 阅读 · 0 评论 -
ZOJ 1484 Minimum Inversion Number(线段树,数论)
http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=1484原创 2014-07-01 21:28:33 · 751 阅读 · 0 评论 -
Codeforces 227A Where do I Turn?(代数)
http://codeforces.com/problemset/problem/227/A A. Where do I Turn? time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standa原创 2014-02-10 17:04:21 · 942 阅读 · 0 评论 -
POJ 1465 Multiple (BFS,同余定理)
http://poj.org/problem?id=1465 Multiple Time Limit: 1000MS Memory Limit: 32768K Total Submissions: 6164 Accepted: 1339 Description a program that, given原创 2014-08-04 22:13:32 · 1304 阅读 · 0 评论 -
探寻C/C++中更快的大数(自然数集)模板
本文系fcbruce个人原创整理,转载请注明出处http://blog.youkuaiyun.com/u012965890/article/details/40432511,谢谢! 我们知道在C/C++中int型可处理-2^31~2^31-1(32位及以上编译器),long long型可处理-2^63~2^63-1的数据,这实际上是非常有限的,在很多情况下,我们往往会处理范围更大的数据。Java中有BigInteger类,python中想要多大就有多大(取决于内存),但是C/C++就显得有些乏力,这时候我们会原创 2014-10-24 20:52:46 · 1765 阅读 · 0 评论