- 博客(31)
- 收藏
- 关注
原创 山东省高校组队训练邀请赛——AC题目(4AC:3水题,1扩展欧几里得)
按AC顺序问题 J: Too Expensive to Buy a House时间限制: 1 Sec 内存限制: 128 MB提交: 141 解决: 101[提交][状态][讨论版]题目描述WNJXYK and DIDIDI are good friends . One day, WNJXYK found DIDIDI bought a house,
2017-08-27 19:51:22 421
原创 山东省高校组队训练邀请赛——总结
第一次正式组队,第一场组队后比赛。仍有很多问题,仍需继续努力开题后,没有找对题目,上去读了个难题(最后只有一队出了这个题),发现别人把J题A了,抓紧看了J题。12分12秒,敲完交上,交成了C语言,编译错误。12分39秒, J题AC(-1)。这时候I题已经有人出了,判断一个数字里面含不含4,忘了怎么数字转换字符串,卡了一下,队友来写,队友手写转换函数卡住。
2017-08-27 19:11:19 256
原创 POJ - 3278 Catch That Cow(BFS)
Catch That CowTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 97233 Accepted: 30516DescriptionFarmer John has been informed of the location of a fugit
2017-08-22 11:02:49 189
原创 POJ - 2251 Dungeon Master(三维BFS)
Dungeon MasterTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 37134 Accepted: 14185DescriptionYou are trapped in a 3D dungeon and need to find the qui
2017-08-22 10:58:18 169
原创 POJ - 1321 棋盘问题(DFS)
棋盘问题Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 49948 Accepted: 24195Description在一个给定形状的棋盘(形状可能是不规则的)上面摆放棋子,棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列,请编
2017-08-21 17:50:31 237
原创 HDU - 5832 A water problem(大整数取模)
A water problemTime Limit: 5000/2500 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 3072 Accepted Submission(s): 1113Problem DescriptionTwo planet
2017-08-15 19:28:07 225
原创 URAL - 1964 Chinese Dialects (数学集合)
1964. Chinese DialectsTime limit: 1.0 secondMemory limit: 64 MBVova moved from Guangzhou to Shenzhen. He immediately found out that the local people don't understand his Cantonese phrase
2017-08-11 11:52:36 248
原创 FZU - 2148 Moon Game (枚举+计算几何)
Problem 2148 Moon GameAccept: 1040 Submit: 3205Time Limit: 1000 mSec Memory Limit : 32768 KB Problem DescriptionFat brother and Maze are playing a kind of special (hentai) game i
2017-08-11 09:04:14 227
原创 枚举排列(入门经典7-2)
枚举排列的常见方法有两种:一是递归枚举,二是STL中的next_permutation.// 求1~n的全排列. n<100// Rujia Liu#includeusing namespace std;int A[101];// 输出1~n的全排列void print_permutation(int n, int* A, int cur) { if(cur == n) {
2017-08-10 20:16:39 258
原创 HDU-2047 阿牛的EOF牛肉串(递推)
阿牛的EOF牛肉串Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 37212 Accepted Submission(s): 17589Problem Description今年的ACM暑期集训队一共有
2017-08-10 11:11:25 239
原创 HDU-2045 不容易系列之(3)—— LELE的RPG难题(递推)
不容易系列之(3)—— LELE的RPG难题Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 54381 Accepted Submission(s): 21921Problem Description人
2017-08-10 10:36:28 264
原创 HDU - 2955 Robberies(01背包)
RobberiesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 25266 Accepted Submission(s): 9310Problem DescriptionThe aspiring Ro
2017-08-09 17:05:58 158
原创 ZOJ - 3123 Subsequence (思路细节)
SubsequenceTime Limit: 1 Second Memory Limit: 32768 KBA sequence of N positive integers (10 , each of them less than or equal 10000, and a positive integer S (S are given. Write a pr
2017-07-28 21:23:43 200
原创 UVA-508 Morse Mismatches(STL模拟)
https://vjudge.net/contest/174376#problem/E读题很关键。。。题意:输入每个字母的编码,一个词典,和若干个编码。对于每个编码判断他可能是哪个单词。如果有多个精确匹配,输出第一个并且后面加上‘!’,如果在编码尾部删除或添加尽可能少的字符可以匹配,在后面加上‘?’。解决:把词典里的单词存成编码,然后把每个输入的编码比较就好。细节:自己没做出来,主
2017-07-28 19:51:20 192
原创 UVa - 11300 Spreading the Wealth (代数分析)
https://vjudge.net/problem/UVA-11300训练指南 1 - 3题意:圆桌有n个人,每个人都有一定的金币,金币总数能被n整除,每个人可以给相邻的人一些金币,使得他们每个人的金币相等。求转手金币的最小值。解决:书上给了一大串代数分析,很好,不再赘述。以后做题可以先列公式,可能会有意想不到的事情发生(简单不知道多少倍)。细节:分析到最后,有一个中位数的应用,
2017-07-27 16:20:44 150
原创 POJ - 3253 Fence Repair(贪心,注意数据范围!!!)
Fence RepairTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 51042 Accepted: 16772DescriptionFarmer John wants to repair a small length of the fence ar
2017-07-27 09:05:50 220
原创 POJ - 3069 Saruman's Army (贪心)
Saruman's ArmyTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10942 Accepted: 5526DescriptionSaruman the White must lead his army along a straight p
2017-07-26 21:00:44 151
原创 POJ - 3617 Best Cow Line(贪心)
Best Cow LineTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 25475 Accepted: 6947DescriptionFJ is about to take his N (1 ≤ N ≤ 2,000) cows to the annu
2017-07-25 21:42:26 145
原创 POJ - 2386 Lake Counting (DFS)
Lake CountingTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 36172 Accepted: 17965DescriptionDue to recent rains, water has pooled in various places i
2017-07-25 19:57:31 174
原创 POJ 1852 Ants(思路题)
点击打开链接题意:一根竹竿,上面很多蚂蚁往两边爬,两只蚂蚁撞到就各自调头回去,问所有蚂蚁爬出杆的最长时间和最短时间思路:两只蚂蚁相撞,可以看成交错,然后继续前进细节:。。#include#includeusing namespace std;int t, l, n;int a[1000005];int maxs, mins;int main(){ cin
2017-07-25 16:57:12 303
原创 UVa 11292 Dragon of Loowater(排序+贪心)
点击打开链接题意:有n条龙,m个骑士,骑士的能力为x,可以砍x以下的头,每个骑士只能雇佣一次并且只能砍一次,费用是能力值x。求能不能消灭所有龙,并求出最小费用。解决:将骑士和龙排序就好。细节:。。。#include#includeusing namespace std;int a[20005], b[20005];//dragon, knightsint
2017-07-25 15:51:18 155
原创 HDU 4430 Yukari's Birthday(枚举+二分)
Yukari's BirthdayTime Limit: 12000/6000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6103 Accepted Submission(s): 1438Problem DescriptionToday i
2017-07-24 20:51:02 230
转载 直线、折线分割平面
注明出处,摘自 http://www.cnblogs.com/chaosheng/archive/2012/01/26/2329583.html(1) n条直线最多分平面问题 题目大致如:n条直线,最多可以把平面分为多少个区域。 析:可能你以前就见过这题目,这充其量是一道初中的思考题。但一个类型的题目还是从简单的入手,才容易发现规律。当有n-1条直线时,平面最多被分成
2017-07-23 19:21:31 325
转载 快速幂
转载于 百度百科 https://baike.baidu.com/item/%E5%BF%AB%E9%80%9F%E5%B9%82/5500243?fr=aladdin快速幂就是快速算底数的n次幂。其时间复杂度为 O(log₂N), 与朴素的O(N)相比效率有了极大的提高。快速幂可以用位运算来实现1b and
2017-07-23 09:58:11 246
原创 HDU 2044 一只小蜜蜂...(DP递推)
一只小蜜蜂...Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 75968 Accepted Submission(s): 27275Problem Description有一只经过训练的蜜蜂只能爬向右
2017-07-22 21:07:51 203
原创 HDU 2018 母牛的故事(DP递推)
母牛的故事Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 84620 Accepted Submission(s): 42088Problem Description有一头母牛,它每年年初生一头小母牛。
2017-07-22 20:22:52 186
原创 HDU 2084 数塔 (DP递推)
数塔Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 45238 Accepted Submission(s): 26836Problem Description在讲述DP算法的时候,一个经典的例子就是数
2017-07-21 22:58:15 234
原创 ZOJ Problem Set - 3023 (水题)
ZOJ Problem Set - 3023 题意:两人各有n,m张牌,交换一张,使得两人手牌加和相等。有多种方法的时候,选交换牌加和小的一组。解决:挨个寻找就行了。细节:无。收获:读对题很要。一开始以为是平均数相等。 #include #include #include using namespace std;int n, m;int a[110], b[110
2017-07-08 21:01:10 223
原创 ZOJ Problem Set - 2100 (DFS)
ZOJ Problem Set - 2100题意:一块田地,播种机从左上出发,不能重复走,不能走石头。判断能不能。思路:简单的dfs。细节:走过的标记成石头,不行就改回来。#include #include #include using namespace std;int n, m;char a[10][10];int num , flag;void dfs(in
2017-07-08 20:56:14 163
原创 CF #421 B. Mister B and Angle in Polygon
B. Mister B and Angle in Polygontime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputOn one quiet day all of su
2017-06-28 16:44:56 394
原创 CF #420 B. Okabe and Banana Trees
B. Okabe and Banana Treestime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputOkabe needs bananas for one of hi
2017-06-27 22:29:31 496
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人