摘要：
将正整数n表示成一系列正整数之和：n=n1+n2+…+nk， 其中n1≥n2≥…≥nk≥1，k≥1 #include<bits/stdc++.h> using namespace std; int dp[15][15]; int main() { int n,m,i,j,t; dp[1][1]=1; 阅读全文
摘要：
Mike and Ann are sitting in the classroom. The lesson is boring, so they decided to play an interesting game. Fortunately, all they need to play this 阅读全文
摘要：
Sasha grew up and went to first grade. To celebrate this event her mother bought her a multiplication table MM with nn rows and nn columns such that M 阅读全文
摘要：
When Serezha was three years old, he was given a set of cards with letters for his birthday. They were arranged into words in the way which formed the 阅读全文
摘要：
有一间长方形的房子，地上铺了红色、黑色两种颜色的正方形瓷砖。你站在其中一块黑色的瓷砖上，只能向相邻的黑色瓷砖移动。请写一个程序，计算你总共能够到达多少块黑色的瓷砖。Input包括多个数据集合。每个数据集合的第一行是两个整数W和H，分别表示x方向和y方向瓷砖的数量。W和H都不超过20。在接下来的H行中 阅读全文
摘要：
Given a positive integer n, write a program to find out a nonzero multiple m of n whose decimal representation contains only the digits 0 and 1. You m 阅读全文