从今天开始回复BLOG留言

Lucky Coins Sequence Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 581    Accepted Submission(s): 301 Problem Description A

Lucky Coins SequenceTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 921    Accepted Submission(s): 488Problem DescriptionAs we all know,every co...

Lucky Coins Sequence Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 912    Accepted Submission(s): 481 Problem Description As we a

Lucky Coins Sequence Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 35 Accepted Submission(s): 29 Problem Descr...

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=3519

Lucky Coins Sequence Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 46 Accepted Submission(s): 32   Problem Descrip

#include #include #include #include #include #include using namespace std; #define LL __int64 const int mod=1e4+7; const int maxn=4; struct matrix{ int f[maxn][maxn]; }; matrix mul(matrix a,

这道题真好，体现了思想的灵活性。要3个连续状态以上嘛，好，那我就求出 只有1~2个状态的数量，最后总数减去即可。美妙，完结。 /* *State: 3519 0MS 256K 2354 B *题目大意： * 给定n个硬币，硬币有两种状态0或1，可以翻转，总共有2^n种 * 状态，规定如果有连续3个硬币的状态一样，即是特殊串...

Lucky Coins Sequence Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 415Accepted Submission(s): 223 Problem Description As we all know,every co...