Codeforces 608B Hamming Distance Sum

B. Hamming Distance Sum

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Genos needs your help. He was asked to solve the following programming problem by Saitama:

The length of some string s is denoted |s|. The Hamming distance between two strings s and t of equal length is defined as , where si is the i-th character of s and ti is the i-th character of t. For example, the Hamming distance between string "0011" and string "0110" is |0 - 0| + |0 - 1| + |1 - 1| + |1 - 0| = 0 + 1 + 0 + 1 = 2.

Given two binary strings a and b, find the sum of the Hamming distances between a and all contiguous substrings of b of length |a|.

Input

The first line of the input contains binary string a (1 ≤ |a| ≤ 200 000).

The second line of the input contains binary string b (|a| ≤ |b| ≤ 200 000).

Both strings are guaranteed to consist of characters '0' and '1' only.

Output

Print a single integer — the sum of Hamming distances between a and all contiguous substrings of b of length |a|.

Examples

input

01
00111

output

3

input

0011
0110

output

2

Note

For the first sample case, there are four contiguous substrings of b of length |a|: "00", "01", "11", and "11". The distance between "01" and "00" is |0 - 0| + |1 - 0| = 1. The distance between "01" and "01" is |0 - 0| + |1 - 1| = 0. The distance between "01" and "11" is|0 - 1| + |1 - 1| = 1. Last distance counts twice, as there are two occurrences of string "11". The sum of these edit distances is1 + 0 + 1 + 1 = 3.

The second sample case is described in the statement.

这道题纠结了好长时间，不过师傅说了一个很巧妙的方法，感觉挺不错的，这里贴一下代码。

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int i,j,k,l,n,m;
char s1[210000],s2[210000];
int main()
{
   while(scanf("%s",s1)!=EOF)
   {
   	 scanf("%s",s2);
   	 int len1=strlen(s1);
   	 int len2=strlen(s2);
   	 l=0;
   	 k=0;
	 __int64 sum=0;
   	 for(i=0;i<len2-len1+1;i++)
   	 {
   	 	if(s2[i]=='0')
   	 	l++;
   	 	else if(s2[i]=='1')
   	 	k++;
	 }
	 if(s1[0]=='0')
	 sum+=k;
	 else if(s1[0]=='1')
	 sum+=l;
   for(i=1;i<len1;i++)
   {
      if(s2[i-1]=='0')
      l--;
      else if(s2[i-1]=='1')
      k--;
      if(s2[len2-len1+i]=='0')
      l++;
      else if(s2[len2-len1+i]=='1')
      k++; 
      if(s1[i]=='1')
	  sum+=l;
	  else if(s1[i]=='0')
	  sum+=k;
	}
	printf("%I64d\n",sum);
   }
 }