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

#F0670. Palindromic characteristics

  • ID: 676
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:提高
  • 上传者:
  • 枚举
  • 动态规划
  • 哈希
  • 字符串
  • 算法思想
  • 数据结构
  • 提高
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

Palindromic characteristics

题目描述

D. Palindromic characteristics
time limit per test
3 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

Palindromic characteristics of string s with length |s| is a sequence of |s| integers, where k-th number is the total number of non-empty substrings of s which are k-palindromes.

A string is 1-palindrome if and only if it reads the same backward as forward.

A string is k-palindrome (k>1) if and only if:

  1. Its left half equals to its right half.
  2. Its left and right halfs are non-empty (k-1)-palindromes.

The left half of string t is its prefix of length ⌊|t|/2⌋, and right half− the suffix of the same length. ⌊|t|/2⌋ denotes the length of string t divided by 2, rounded down.

Note that each substring is counted as many times as it appears in the string. For example, in the string "aaa" the substring "a" appears 3 times.

Input

The first line contains the string s (1≤|s|≤5000) consisting of lowercase English letters.

Output

Print |s| integers− palindromic characteristics of string s.

Examples
Input
abba
Output
6 1 0 0 
Input
abacaba
Output
12 4 1 0 0 0 0 
Note

In the first example 1-palindromes are substring «a», «b», «b», «a», «bb», «abba», the substring «bb» is 2-palindrome. There are no 3- and 4-palindromes here.


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