简单题
关注
分享
扫一扫
Kefault
这个作者很懒，什么都没留下…
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
poj 1222 EXTENDED LIGHTS OUT（高斯消元）
EXTENDED LIGHTS OUTTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 6628 Accepted: 4368DescriptionIn an extended version of the game Lights Out, is a p原创 2014-08-24 16:40:19 · 1096 阅读 · 0 评论 -
poj 1753 Flip Game（高斯消元）
Flip GameTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 30805 Accepted: 13409DescriptionFlip game is played on a rectangular 4x4 field with two-sided原创 2014-08-24 16:42:46 · 1095 阅读 · 0 评论 -
poj 3185 The Water Bowls（高斯消元）
The Water BowlsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4352 Accepted: 1721DescriptionThe cows have a line of 20 water bowls from which they dr原创 2014-08-24 16:45:08 · 926 阅读 · 0 评论 -
poj 2965 The Pilots Brothers' refrigerator（高斯消元）
The Pilots Brothers' refrigeratorTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 18641 Accepted: 7145 Special JudgeDescriptionThe game “The Pilo原创 2014-08-24 16:47:45 · 979 阅读 · 0 评论 -
zoj 3353 Chess Board（高斯消元）
Chess BoardTime Limit: 5 Seconds Memory Limit: 65536 KBThere'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原创 2014-08-24 22:10:21 · 824 阅读 · 0 评论 -
hdu 5014 Number Sequence（意淫题）
Number SequenceTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 545 Accepted Submission(s): 258Special JudgeProblem Description原创 2014-09-15 19:42:23 · 1130 阅读 · 0 评论 -
hdu 5058 So easy
So easyTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 160 Accepted Submission(s): 104Problem DescriptionSmall W gets two fil原创 2014-10-06 11:17:44 · 898 阅读 · 0 评论 -
hdu 5059 Help him
Help himTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 480 Accepted Submission(s): 119Problem DescriptionAs you know, when y原创 2014-10-06 11:22:54 · 1177 阅读 · 0 评论 -
hdu 5167-Fibonacci
题目及代码：这道题目的意思是 给定一个数n，问这个数n是否能由斐波那契数列中的数的乘积组合而成。 首先想到一定会要先打表把所有的斐波那契数求出来，然后直接dfs就ok了。做题的时候很犹豫这样搜索到底行不行，总感觉会超时，结果却过了。#include #include #include #include using namespace std;typ原创 2015-03-11 19:37:29 · 584 阅读 · 0 评论