暴力/回溯
文章平均质量分 60
殷华
跪着跪着就跪成大神了
展开
-
uva 10167 - Birthday Cake
省赛在即,只能挑实用的练了,图论交给我的原创 2014-05-06 13:50:01 · 452 阅读 · 0 评论 -
Codeforces #264 (Div. 2) C. Gargari and Bishops
一道暴力题,但是原创 2014-08-30 19:35:29 · 443 阅读 · 0 评论 -
hdu 5024 Wang Xifeng's Little Plot(搜索:遍历)
让找到一个直角,这个直角对应的liangtiaobianzhihe原创 2014-09-21 10:26:29 · 382 阅读 · 0 评论 -
Codeforces #262 (Div. 2) C. Present(二分+贪心)
C. Present time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Little beaver is a beginner programmer, so infor原创 2014-08-21 12:49:20 · 546 阅读 · 0 评论 -
UVa 12097 - Pie
Problem C - Pie Time limit: 1 second My birthday is coming up and traditionally I'm serving pie. Not just one pie, no, I have a number N of them, of various tastes and of various sizes. F of my f原创 2014-04-10 22:53:46 · 665 阅读 · 4 评论 -
poj 1166 The Clocks
题意我就没读懂... 百度才知道是给了jiug原创 2014-07-31 14:12:14 · 387 阅读 · 0 评论 -
Uva 11384 - Help is needed for Dexter
Problem H Help is needed for Dexter Time Limit: 3 Second Dexter is tired of Dee Dee. So he decided to keep Dee Dee busy in a game. The game he planned for her is quite easy to play but not easy原创 2014-03-05 22:35:57 · 615 阅读 · 0 评论 -
hdu 1032 The 3n + 1 problem(水题)
开一个10W+de直接暴力就可以了原创 2014-07-21 18:34:24 · 565 阅读 · 0 评论 -
UVa 639 - Don't Get Rooked
#include #include #include #define MAXN 100 #define ll long long using namespace std; int a[MAXN][MAXN]; int besttot, n; void judge() { int ok = 1; int tot = 0; for(int i=0; i<n; ++i)原创 2014-05-21 17:07:45 · 598 阅读 · 0 评论 -
Codeforces #248 (Div. 2) B. Kuriyama Mirai's Stones
开始想到暴力了,但是看到n最大为10原创 2014-05-24 22:51:31 · 547 阅读 · 0 评论 -
POJ 一 1321 棋盘问题
棋盘问题 Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 19223 Accepted: 9588 Description 在一个给定形状的棋盘(形状可能是不规则的)上面摆放棋子,棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列,请编程求解原创 2013-08-30 16:39:21 · 669 阅读 · 0 评论 -
Codeforces #247 (Div. 2) B. Shower Line
暴力题,知道下一个排列:next_permutation()就好做了 b原创 2014-05-22 10:13:25 · 538 阅读 · 0 评论 -
UVa 216 - Getting in Line
暴力回溯 这么一看回溯题其实原创 2014-05-20 23:06:14 · 476 阅读 · 0 评论 -
UVa 10474 - Where is the Marble?
白书上把这个题分类为回溯法,但我觉得就是暴力啊原创 2014-05-20 20:08:25 · 475 阅读 · 0 评论 -
Codeforces #250 (Div. 2) B. The Child and Set
题读错了啊。。。 一直原创 2014-06-02 12:18:22 · 1330 阅读 · 0 评论 -
UVa 729 - The Hamming Distance Problem (暗藏杀机的大水题!!)
一看又是下一个排列的大水题,就没怎么当回事... 结果原创 2014-05-13 21:46:59 · 685 阅读 · 0 评论 -
uva 10098 - Generating Fast
感觉和uva146没什么区别啊... 就加一个排序,然原创 2014-05-09 22:22:20 · 524 阅读 · 0 评论 -
uva 146 ID Codes (下一个排列)
就是给定一个字符串,如果这个字符串原创 2014-05-07 20:21:00 · 1025 阅读 · 0 评论 -
hdu 1496 Equations(数学:暴力|| HASH)
这道题一看jiuyong原创 2014-08-18 23:35:03 · 353 阅读 · 0 评论