ACM_暴力求解法
文章平均质量分 87
77458
手敲仙盘键,目视星空棋,灵控比特力,逍遥虚空界。
展开
-
The broken pedometer-纯暴力枚举
The broken pedometerTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluSubmit StatusDescription The Broken Pedometer T原创 2015-07-26 11:21:38 · 681 阅读 · 0 评论 -
CF - Profact(DFS + 剪枝)
A - ProfactTime Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmit Status Practice Gym 100796KDescriptionstandard input/output AnnouncementState原创 2015-11-23 12:14:25 · 1033 阅读 · 0 评论 -
2015长春网络赛1001 - HDU5433 - Alisha’s Party (模拟)
Alisha’s PartyTime Limit: 3000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 0 Accepted Submission(s): 0Problem DescriptionPrincess Alisha原创 2015-09-13 18:08:49 · 721 阅读 · 0 评论 -
vijos - P1077克隆龙 (找规律 + 指数型母函数 + python)
P1077克隆龙Accepted标签:[显示标签]描述现在龙的克隆已成为可能,龙基因由ACTG字母组成,而龙的基因有如下特点:1、A在基因中的出现为偶数次(包括0);2、C的情况也一样;当n=2时 满足条件的有6个:TT,TG,GT,GG,AA,CC你只需给出满足条件的基因数的最后两位数字即可;原创 2015-08-21 11:48:30 · 1379 阅读 · 0 评论 -
HDU - 4712 Hamming Distance(坑爹的随机数算法 + 暴力求解)
Hamming DistanceTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 1728 Accepted Submission(s): 680Problem Description(From wiki原创 2015-08-19 17:04:41 · 934 阅读 · 0 评论 -
Squares-暴力枚举或者二分
B - SquaresTime Limit:3500MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 2002DescriptionA square is a 4-sided polygon whose sides have eq原创 2015-07-24 17:47:41 · 1067 阅读 · 0 评论 -
猜数字-暴力枚举
A - 猜数字Time Limit:10000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 1172Description猜数字游戏是gameboy最喜欢的游戏之一。游戏的规则是这样的:计算机随机产生一个四位数,然后玩家猜这个原创 2015-07-25 01:21:56 · 1598 阅读 · 1 评论 -
POJ - 1062昂贵的聘礼最短路或者DFS
POJ - 1062昂贵的聘礼Time Limit: 1000MS Memory Limit: 10000KB 64bit IO Format: %I64d & %I64uSubmit StatusDescription年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了,于是便向酋长去求亲。酋长要他原创 2015-08-04 20:40:31 · 818 阅读 · 0 评论 -
HDU 2563 统计问题 (DFS + 打表)
统计问题Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6506 Accepted Submission(s): 3836Problem Description在一无限大的二维平面中,我们做如下假设:原创 2015-08-14 15:54:20 · 713 阅读 · 0 评论 -
HDU 1796 How many integers can you find (容斥定理 + 二进制)
How many integers can you findTime Limit: 12000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5493 Accepted Submission(s): 1567Problem Descripti原创 2015-08-15 09:25:59 · 1158 阅读 · 0 评论 -
Sereja and Bottles-水题有点坑爹
CodeForces - 315ASereja and BottlesTime Limit: 2000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64uSubmit StatusDescriptionSereja and his friends we原创 2015-07-30 01:33:29 · 1347 阅读 · 1 评论 -
Aizu - 2306 Rabbit Party (DFS图论)
G. Rabbit PartyTime Limit: 5000msCase Time Limit: 5000msMemory Limit: 65536KB64-bit integer IO format: %lld Java class name: MainSubmit Status PID: 39423Font Size: +原创 2015-08-24 20:47:27 · 793 阅读 · 0 评论 -
Triangular Pastures-DP(有点像是暴力枚举)
POJ - 1948Triangular PasturesTime Limit: 1000MS Memory Limit: 30000KB 64bit IO Format: %I64d & %I64uSubmit StatusDescriptionLike everyone, cows enjoy variet原创 2015-07-28 21:20:39 · 1015 阅读 · 0 评论 -
Aizu - 2305 Beautiful Currency (二分 + DFS遍历)
Beautiful CurrencyTime Limit: 5000msMemory Limit: 65536KBThis problem will be judged on Aizu. Original ID: 230564-bit integer IO format: %lld Java class name: MainPrev Submit原创 2015-08-24 20:35:16 · 669 阅读 · 0 评论 -
HDU - 1540 Tunnel Warfare 线段树 或者 让人心酸的暴力过
HDU - 1540Tunnel WarfareTime Limit: 2000MS Memory Limit: 32768KB 64bit IO Format: %I64d & %I64uSubmit StatusDescriptionDuring the War of Resistance Against Ja原创 2015-08-07 22:18:51 · 932 阅读 · 0 评论 -
HDU 2601An easy problem-素数的运用,暴力求解
An easy problemTime Limit: 3000MS Memory Limit: 32768KB 64bit IO Format: %I64d & %I64uSubmit StatusDescriptionWhen Teddy was a child , he was always thinking abou原创 2015-07-28 11:57:17 · 1328 阅读 · 0 评论 -
Knights in Chessboard
Knights in ChessboardCrawling in process...Crawling failedTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%lld & %lluSubmit Status DescriptionGiven an m x n chessboard wh原创 2015-04-02 21:08:57 · 1071 阅读 · 0 评论 -
UVA624 - CD (DFS)
由于题目给出不会超过20个,所以可以直接DFS暴力过#include #include #include using namespace std;const int MAXN = 20 + 5;int n, m, Max, O[MAXN], X[MAXN], M[MAXN];void dfs(int i,int p, int s) { if(s > n) return;原创 2016-07-11 21:03:44 · 553 阅读 · 0 评论