摘要:
题意:裸kmp思路:kmp模板#include#include#includeusing namespace std;#define MaxSize 10005int s[1000005],t[10005];int next2[MaxSize];void GetNext(int t[],int le... 阅读全文
摘要:
题意:统计单串中从某个位置以前有多少重复的串思路:kmp模板#include#include#includeusing namespace std;#define MaxSize 1000005char str[MaxSize];int next2[MaxSize];void GetNext(cha... 阅读全文
摘要:
题意:小数大数加法思路:大数模板#include#include#includeusing namespace std;void plu(char *a,char *b){//注意存储方式:整数倒着存,小数正着存,看代码需注意 int i,j,k,lena,lenb,lena1,lena2,l... 阅读全文
摘要:
题意:整数大数加法思路:大数模板#include#include#include#includeusing namespace std;#define MAXN 9999//万进制#define DLEN 4//4位class BigNum{private: int a[500];//可以控制... 阅读全文
摘要:
题意:整数大数加法思路:大数模板#include#include#include#includeusing namespace std;#define MAXN 9999//万进制#define DLEN 4//4位class BigNum{private: int a[500];//可以控制... 阅读全文
摘要:
题意:整数大数乘法思路:大数模板#include#include#include#includeusing namespace std;#define MAXN 9999//万进制#define DLEN 4//4位class BigNum{private: int a[50000];//可以... 阅读全文
摘要:
题意:整数大数加法思路:大数模板#include#include#include#includeusing namespace std;#define MAXN 9999//万进制#define DLEN 4//4位class BigNum{private: int a[500];//可以控制... 阅读全文