POJ3461 字符串HASH

#include
#include
#include
#define ull unsigned long long  
const ull B = 1e8+7;     
const int MAXN = 10010;  
char a[MAXN],b[MAXN*100];  
int ans;
int find()
{  
    int al=strlen(a),bl=strlen(b);  
    if(al>bl)return -1;  
    ull t=1,ah=0,bh=0;  
    for(int i=0;i

你可能感兴趣的:(程序代码,算法分享)