Occult

http://uva.onlinejudge.org/external/100/10069.pdf 两个字符串，求下一个再上一个之中出现的次数。 如果a[i] == b[j]则 dp[i][j] = dp[i-1][j] + dp[i-1][j-1] 如果a[i] != b[j]则 dp[i][j] = dp[i-1][j] 这里还涉及到高精度加法，是时候使用C语言的类了。

Integer Inquiry Description One of the first users of BIT's new supercomputer was Chip Diller. He extended his exploration of powers of 3 to go from 0 to 333 and he explored taking various sums

Description Andy每天都有很多作业要做，他的老师总是在说“这些作业你明天必须交上来……”。现在他找你帮忙做其中的一项作业，给出N个整数A1, A2, ..., AN，有 M 个询问 q (L, R)，对于每个询问，你要输出一个整数，第L个数到第R个数的乘积，这个乘积不会超过1000位。 Input 输入包含多组测试数据。每组数据第一行为两个整数N，M (

Problem Description Another common social inability is known as ACM (Abnormally Compulsive Meditation). This psychological disorder is somewhat common among programmers. It can be described as the

Problem Description Determine whether a sequence is a Geometric progression or not. In mathematics, a **geometric progression**, also known as a **geometric sequence**, is a sequence of numbers

1024. Palindromic Number (25) 时间限制 400 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue A number that will be the same when it

Problem Description     Silen August does not like to talk with others.She like to find some interesting problems.     Today she finds an interesting problem.She finds a segment x+y=q.The

Problem Description   度熊面前有一个全是由1构成的字符串，被称为全1序列。你可以合并任意相邻的两个1，从而形成一个新的序列。对于给定的一个全1序列，请计算根据以上方法，可以构成多少种不同的序列。   Input 这里包括多组测试数据，每组测试数据包含一个正整数N，代表全1序列的长度。 1≤N≤200   Output 对

After beats all opponents in 3-dimension-world OI, ZCC feels bored and sets about going to other universes. In a universe with D dimension(s), ZCC finds D segments floating in the air. To be more prec