大模拟
文章平均质量分 79
蘑菇小哲
在通往梦想的道路上奋力潜行
展开
-
UVA 11210 Chinese Mahjong(中国麻将 , 大模拟)
解题思路: 关键在于如何判断十四张牌能否和牌,这里采用dfs来判断,详情看代码。 #include #include #include #include #include #include #include #include #include #include using namespace std; const int maxn = 1000 + 10; string c原创 2014-09-16 20:47:25 · 1195 阅读 · 0 评论 -
POJ 2176 Folding
C#include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; const int MAXN = 100 + 10; const int INF = 0x3f3原创 2015-04-07 22:25:26 · 863 阅读 · 0 评论 -
HDU 3683 Gomoku(五子棋判断结果,模拟题)
Gomoku Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1474 Accepted Submission(s): 376 Problem Description You are probably not原创 2015-09-08 17:19:23 · 609 阅读 · 0 评论 -
2015北京网络赛 Mission Impossible (模拟题)
#1228 : Mission Impossible 6 时间限制:1000ms 单点时限:1000ms 内存限制:256MB 描述 You must have seen the very famous movie series,"Mission Impossible", from 1 to 4. And "Mission Impossible 5原创 2015-09-21 15:52:55 · 566 阅读 · 0 评论