
HUST
文章平均质量分 56
tokers
所有的魅力在“习惯”面前都将无色。
展开
-
HUST1017----Exact cover
1017 - Exact cover Time Limit: 15s Memory Limit: 128MB Special Judge Submissions: 6023 Solved: 3188 DescriptionThere is an N*M matrix with only 0s and 1s, (1 <= N,M <= 1000). An exact cov原创 2015-01-05 21:21:02 · 823 阅读 · 0 评论 -
hust1384---The value of F[n]
DescriptionFor any integer i>=3 we have F[i]=(F[i-1]+2*F[i-2]+3*F[i-3])%9901;Now give you F[0],F[1],F[2],can you tell me the value of F InputFist Line, an integer Q(1<=Q<=100) represent the number of原创 2015-03-12 14:08:19 · 814 阅读 · 0 评论