~不可描述~

K - 剪花布条 Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u Submit Status Description 一块花布条，里面有些图案，另有一块直接可用的小饰条，里面也有一些图案。对于给定的花布条和小饰条，计算一下能从花布条中尽可能剪出几块小饰条来呢

Number Sequence Time Limit:5000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u Submit Status Description Given two sequences of numbers : a[1], a[2], ...... , a[N], and

Power Strings Time Limit: 3000MS   Memory Limit: 65536K Total Submissions: 43073   Accepted: 17980 Description Given two strings a and b we define a*b to be their conca

Oulipo Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 35044   Accepted: 14146 Description The French author Georges Perec (1936–1982) once wrote a book, L

Seek the Name, Seek the Fame Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 16910   Accepted: 8614 Description The little cat is so famous, that many coup

Sequence I Time Limit: 3000/1500 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 3226    Accepted Submission(s): 1181 Problem Description Mr. Frog has tw