## poj2752

maksyuki 发表于 oj 分类，标签:

Seek the Name, Seek the Fame

The little cat is so famous, that many couples tramp over hill and dale to Byteland, and asked the little cat to give names to their newly-born babies. They seek the name, and at the same time seek the fame. In order to >>继续阅读

## poj2406

maksyuki 发表于 oj 分类，标签:

Power Strings

Given two strings a and b we define a*b to be their concatenation. For example, if a = "abc" and b = "def" then a*b = "abcdef". If we think of concatenation as multiplication, exponentiation by a non-negative integer is defined in the >>继续阅读

## poj1961

maksyuki 发表于 oj 分类，标签:

Period

For each prefix of a given string S with N characters (each character has an ASCII code between 97 and 126, inclusive), we want to know whether the prefix is a periodic string. That is, for each i (2 <= i <= N) we >>继续阅读

## hdu4763

maksyuki 发表于 oj 分类，标签:

Theme Section

Problem Description

It's time for music! A lot of popular musicians are invited to join us in the music festival. Each of them will play one of their representative songs. To make the programs more interesting and challenging, the h >>继续阅读

## hdu2594

maksyuki 发表于 oj 分类，标签:

Simpsons’ Hidden Talents

Problem Description

Homer: Marge, I just figured out a way to discover some of the talents we weren’t aware we had.

Marge: Yeah, what is it?

Homer: Take me for example. I want to find out if I have >>继续阅读

## lightoj1255

maksyuki 发表于 oj 分类，标签:

1255 - Substring Frequency

InputA string is a finite sequence of symbols that are chosen from an alphabet. In this problem you are given two non-empty strings A and B, both contain lower case English alphabets. You have to find the number of times  >>继续阅读