跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F1453. Hamming Distance Sum

  • ID: 1459
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:进阶
  • 上传者:
  • 组合数学
  • 字符串
  • 数学
  • 进阶
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

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|≤200000).

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

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 is 1+0+1+1=3.

The second sample case is described in the statement.


题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 961 题。保留原作者与原赛事署名。