ZCMU 暑期训练四---E题

Vus the Cossack has two binary strings, that is, strings that consist only of "0" and "1". We call these strings aa and bb. It is known that |b|≤|a||b|≤|a|, that is, the length of bb is at most the length of aa.

The Cossack considers every substring of length |b||b| in string aa. Let's call this substring cc. He matches the corresponding characters in bb and cc, after which he counts the number of positions where the two strings are different. We call this function f(b,c)f(b,c).

For example, let b=00110b=00110, and c=11000c=11000. In these strings, the first, second, third and fourth positions are different.

Vus the Cossack counts the number of such substrings cc such that f(b,c)f(b,c) is even.

For example, let a=01100010a=01100010 and b=00110b=00110. aa has four substrings of the length |b||b|: 0110001100, 1100011000, 1000110001, 0001000010.

• f(00110,01100)=2f(00110,01100)=2;
• f(00110,11000)=4f(00110,11000)=4;
• f(00110,10001)=4f(00110,10001)=4;
• f(00110,00010)=1f(00110,00010)=1.

Since in three substrings, f(b,c)f(b,c) is even, the answer is 33.

Vus can not find the answer for big strings. That is why he is asking you to help him.

Input

The first line contains a binary string aa (1≤|a|≤1061≤|a|≤106) — the first string.

The second line contains a binary string bb (1≤|b|≤|a|1≤|b|≤|a|) — the second string.

Output

Print one number — the answer.

Examples

Input

01100010
00110

Output

3

Input

1010111110
0110

Output

4

Note

The first example is explained in the legend.

In the second example, there are five substrings that satisfy us: 10101010, 01010101, 11111111, 11111111.

【题解】

异或问题  刚好前一天做过类似的 还记得一点就A了

 

#include<cstdio>
#include<cmath>
#include<iostream>
#include<vector>
#include<cstring>
using namespace std;
int main(){
	int ans=0,sum=0,i;
	char a[1000006],b[1000006];
     cin>>a>>b;
     int len1=strlen(a);
     int len2=strlen(b);
     for(i= 0;i<len2;i++){
         ans=ans^(a[i]-48)^(b[i]-48);
     }
     if(!ans) sum++;
     for(int i=len2;i<len1;i++){
         ans=ans^(a[i-len2]-48)^(a[i]-48);
         if(!ans)sum++;
     }
     printf("%d\n",sum);
    return 0;
 }