Problem Link: http://www.lightoj.com/volume_showproblem.php?problem=1255
Solution:
#include <bits/stdc++.h>
#define pf printf
#define sf(a) scanf("%d",&a)
#define sfl(a) scanf("%lld",&a)
#define sff(a,b) scanf("%d %d",&a,&b)
#define sffl(a,b) scanf("%lld %lld",&a,&b)
#define sfff(a,b,c) scanf("%d %d %d",&a,&b,&c)
#define sfffl(a,b,c) scanf("%lld %lld %lld",&a,&b,&c)
#define sffff(a,b,c,d) scanf("%d %d %d %d",&a,&b,&c,&d)
#define sffffl(a,b,c,d) scanf("%lld %lld %lld %lld",&a,&b,&c,&d)
#define sfffff(a,b,c,d,e) scanf("%d %d %d %d %d",&a,&b,&c,&d,&e)
#define sfffffl(a,b,c,d,e) scanf("%lld %lld %lld %lld %lld",&a,&b,&c,&d,&e)
#define sfc(a) scanf("%c",&a)
#define ms(a,b) memset(a,b,sizeof(a))
#define pb(a) push_back(a)
#define db double
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define pll pair<long,long>
#define ff first
#define ss second
#define sz(x) (int)x.size()
#define all(x) x.begin(),x.end()
#define CIN ios_base::sync_with_stdio(0); cin.tie(0)
#define max3(a, b, c) max(a, b) > max(b, c) ? max(a, b) : max(b, c)
#define min3(a, b, c) min(a, b) < min(b, c) ? min(a, b) : min(b, c)
#define for0(i,n) for(int i=0;i<n;i++)
#define for1(i,n) for(int i=1;i<=n;i++)
#define forrev(i,n) for(int i=n-1; i>=0; i--)
#define forab(i,a,b) for(int i=a;i<=b;i++)
#define forba(i,b,a) for(int i=b;i>=a;i--)
#define stlloop(x) for(__typeof(x.begin()) it=x.begin();it!=x.end();it++)
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) ((a)*((b)/gcd(a,b)))
#define case1(z) cout<<"Case "<<z<<": "
#define case2(z) printf("Case %d: ",z)
#define PI acos(-1) //3.14159265358979323846264338328
#define valid(tx,ty) tx>=0 && tx<row && ty>=0 && ty<col
#define intlim 2147483648
#define MAX 1000006
#define inf 100000008
ll power(int n,int p)
{
ll ans=1;
for1(i,p) ans*=n;
return ans;
}
ll m=1000001;
ll bigmod(ll n,ll p)
{
if(p==0) return 1;
else if(p%2==0)
{
ll x=(bigmod(n,p/2))%m;
return (x*x)%m;
}
else return ((n%m)*(bigmod(n,p-1)%m))%m;
}
/*------------------------------Graph Moves----------------------------*/
//const int fx[]={+1,-1,+0,+0};
//const int fy[]={+0,+0,+1,-1};
//const int fx[]={+0,+0,+1,-1,-1,+1,-1,+1}; // Kings Move
//const int fy[]={-1,+1,+0,+0,+1,+1,-1,-1}; // Kings Move
//const int fx[]={-2, -2, -1, -1, 1, 1, 2, 2}; // Knights Move
//const int fy[]={-1, 1, -2, 2, -2, 2, -1, 1}; // Knights Move
/*---------------------------------------------------------------------*/
using namespace std;
/*---------------------Hashing---------------------*/
#define Base1 10000019
#define Base2 10000079
#define MOD1 1000000007
#define MOD2 1000000009
ll B1[MAX],B2[MAX];
void init_hash()
{
B1[0]=B2[0]=1;
for(int i=1;i<MAX;i++)
{
B1[i]=(B1[i-1]*Base1)%MOD1;
B2[i]=(B2[i-1]*Base2)%MOD2;
}
}
struct Hash
{
pll H[MAX];
int digit[MAX];
int len;
Hash()
{
len=0;
H[0]=pll(0,0);
}
void clear()
{
len=0;
H[0]=pll(0,0);
}
void insert(char ch)
{
len++;
digit[len]=ch-'a'+1;
H[len].ff=(((H[len-1].ff*Base1)%MOD1)+digit[len])%MOD1;
H[len].ss=(((H[len-1].ss*Base2)%MOD2)+digit[len])%MOD2;
}
pll substr(int l, int r)
{
int sub_len=r-l+1;
pll ans;
ans.ff=(H[r].ff-((H[l-1].ff*B1[sub_len])%MOD1)+MOD1)%MOD1;
ans.ss=(H[r].ss-((H[l-1].ss*B2[sub_len])%MOD2)+MOD2)%MOD2;
return ans;
}
pll concate(pll h, int l, int r)
{
pll x=substr(l,r);
int sub_len=r-l+1;
h.ff=(((h.ff*B1[sub_len])%MOD1)+x.ff)%MOD1;
h.ss=(((h.ss*B2[sub_len])%MOD2)+x.ss)%MOD2;
return h;
}
bool operator==(const Hash& p) const
{
return len==p.len && H[len]==p.H[len];
}
pll & operator[](int index)
{
return H[index];
}
};
Hash h1,h2;
int lcp(int id1, int id2, int l)
{
int lo=1,hi=l;
while(lo<=hi)
{
int mid=(lo+hi)/2;
if(h1.substr(id1,id1+mid)==h2.substr(id2,id2+mid))
lo=mid+1;
else
hi=mid-1;
}
return hi;
}
/*------------------Hashing End---------- ----------*/
int main()
{
///freopen("in.txt","r",stdin);
///freopen("out.txt","w",stdout);
init_hash();
int t;
string s1,s2;
sf(t);
for1(z,t)
{
h1.clear();
h2.clear();
cin>>s1>>s2;
for0(i,sz(s1)) h1.insert(s1[i]);
for0(i,sz(s2)) h2.insert(s2[i]);
int ans=0;
for0(i,(sz(s1)-sz(s2)+1))
{
if(h1.substr(i+1,i+sz(s2))==h2[sz(s2)]) ans++;
}
case2(z);
pf("%d\n",ans);
}
return 0;
}
Fall out, Codes! 