![](https://img-blog.csdnimg.cn/20201014180756780.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
模板
文章平均质量分 88
EIKY
这个作者很懒,什么都没留下…
展开
-
模板整理---大数模板
#include #include #include #include #include #include using namespace std; #define MAXN 9999 #define MAXSIZE 1000 #define DLEN 4 class BigNum { private: int a[MAXSIZE]; //可以控制大数的位数 int原创 2015-05-16 11:15:37 · 542 阅读 · 1 评论 -
POJ-2774-Long Long Message(后缀数组)
Input Two strings with lowercase letters on two of the input lines individually. Number of characters in each one will never exceed 100000. Output A single line with a single integer number – w原创 2016-04-05 15:40:51 · 402 阅读 · 0 评论 -
POJ-3164-Command Network(最小树形图)
Command Network Time Limit: 1000MS Memory Limit: 131072K Total Submissions: 15889 Accepted: 4571 Description After a long lasting war on words, a war on arms fina原创 2016-05-01 10:48:15 · 289 阅读 · 0 评论 -
SDUT-2878-Circle(概率DP/高斯消元)
Circle Time Limit: 2000ms Memory limit: 65536K 有疑问?点这里^_^ 题目描述 You have been given a circle from 0 to n - 1. If you are currently at x, you will move to (x - 1) mod n or (x + 1原创 2016-04-28 21:27:20 · 351 阅读 · 0 评论 -
HDU-5901-Count primes(大素数模板)
链接:http://acm.hdu.edu.cn/showproblem.php?pid=5901 题意: 求区间[1,N]的质数的个数(1≤N≤1011) CODE: 1,O(n^(3/4)) #include #define ll long long using namespace std; ll f[340000],g[340000],n; void init() {原创 2016-09-21 18:57:19 · 309 阅读 · 0 评论 -
HDU-2255-奔小康赚大钱(KM)
链接:http://acm.hdu.edu.cn/showproblem.php?pid=2255 二分图最大权匹配 //#pragma comment(linker, "/STACK:1024000000,1024000000") #include #include #include #include #include #include #include #in原创 2017-04-20 20:58:16 · 245 阅读 · 0 评论 -
STL---简单整理
STL原创 2015-06-12 12:28:13 · 461 阅读 · 0 评论