浮躁的人，终究一事无成！

EXTENDED LIGHTS OUT Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 6628   Accepted: 4368 Description In an extended version of the game Lights Out, is a p

Flip Game Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 30805   Accepted: 13409 Description Flip game is played on a rectangular 4x4 field with two-sided

The Water Bowls Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 4352   Accepted: 1721 Description The cows have a line of 20 water bowls from which they dr

The Pilots Brothers' refrigerator Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 18641   Accepted: 7145   Special Judge Description The game “The Pilo

Chess Board Time Limit: 5 Seconds      Memory Limit: 65536 KB There's an N X M board which filled with black and white chesses. In each move, the player can flip one of these N X M chesses, m

Number Sequence Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 545    Accepted Submission(s): 258 Special Judge Problem Description

So easy Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 160    Accepted Submission(s): 104 Problem Description Small W gets two fil

Help him Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 480    Accepted Submission(s): 119 Problem Description As you know, when y

题目及代码：这道题目的意思是 给定一个数n，问这个数n是否能由斐波那契数列中的数的乘积组合而成。              首先想到一定会要先打表把所有的斐波那契数求出来，然后直接dfs就ok了。做题的时候很犹豫这样搜索到底行不行，总感觉会超时，结果却过了。 #include #include #include #include using namespace std; typ