ACM-思路很重要
寻找星空的孩子
CSDN博客首页:http://blog.csdn.net/u010579068?viewmode=list
博客园地址:http://www.cnblogs.com/yuyixingkong/
展开
-
滑动窗口的最大值(STL的应用+剑指offer)
滑动窗口的最大值参与人数:767时间限制:1秒空间限制:32768K通过比例:21.61%最佳记录:0 ms|8552K(来自 ) 题目描述给定一个数组和滑动窗口的大小,找出所有滑动窗口里数值的最大值。例如,如果输入数组{2,3,4,2,6,2,5,1}及滑动窗口的大小3,那么一共存在6个滑动窗口,他们的最大值分别为{4,4,6,6,6,5}; 针对数组{2,3原创 2015-12-10 17:58:11 · 1554 阅读 · 0 评论 -
Tri Tiling(hdu1143)
Tri TilingTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2731 Accepted Submission(s): 1547Problem DescriptionIn how many ways原创 2015-07-15 22:30:39 · 1612 阅读 · 2 评论 -
下沙的沙子有几粒?(hdu1267)递推
下沙的沙子有几粒?Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 1 Accepted Submission(s) : 1Problem Description2005年11月份,我们学校参加了ACM/ICPC 亚洲赛区成都原创 2015-07-15 22:24:29 · 952 阅读 · 2 评论 -
小兔的棋盘(hdu2067)
小兔的棋盘Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7547 Accepted Submission(s): 4020Problem Description小兔的叔叔从外面旅游回来给她带来了一个礼原创 2015-07-15 22:10:32 · 903 阅读 · 1 评论 -
A. Vanya and Table(Codeforces Round #308 (Div. 2))
A. Vanya and Tabletime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputVanya has a table consisting of 100 rows原创 2015-06-20 23:29:37 · 1506 阅读 · 0 评论 -
GukiZ and Binary Operations(矩阵+二进制)
Codeforces Round #307 (Div. 2) ,D. GukiZ and Binary Operations,原创 2015-06-16 20:22:03 · 1264 阅读 · 0 评论 -
Mike and Feet(CF 547B)
Mike and Feettime limit per test 1 secondmemory limit per test 256 megabytesinput standard inputoutput standard outputMike is the president of country What-The-原创 2015-06-11 21:58:25 · 1201 阅读 · 0 评论 -
Mike and Frog(CF547A)
A. Mike and Frogtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputMike has a frog and a flower. His frog is n原创 2015-06-11 21:50:54 · 1091 阅读 · 0 评论 -
Minimum Sum LCM(uva10791+和最小的LCM+推理)
L - Minimum Sum LCMTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit Status Practice UVA 10791 题意:输入正整数n,找至少两个数,使得他们的LCM为n且要输出最小的和; 思路:既然LCM是n,那么一定是原创 2015-06-11 21:20:35 · 1096 阅读 · 0 评论 -
Add Again(重复元素排序)
Add AgainInput: Standard InputOutput: Standard Output Summation of sequence of integers is always a common problem in Computer Science. Rather than computing blindly, some intelligent techniqu原创 2015-06-09 22:00:53 · 963 阅读 · 0 评论 -
希尔加密算法(湖南师范大学第六届大学生计算机程序设计竞赛)hnuoj11552
解密Time Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:65536KBTotal submit users: 2, Accepted users: 0Problem 11552 : No special judgementProblem descrip原创 2015-06-08 22:44:45 · 1961 阅读 · 0 评论 -
Again Prime? No Time.(uva10870+数论)
Again Prime? No time.Input: standard inputOutput: standard outputTime Limit: 1 secondThe problem statement is very easy. Given a number n you have to determine the largest power of m, not ne原创 2015-05-14 18:41:32 · 964 阅读 · 0 评论 -
Integer Game(UVA11489)3的倍数
K - Integer GameTime Limit:1000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit Status Practice UVA 11489 题意:在n中取数字,使剩下的数是3的倍数,不能取则失败。思路:如果能使当前数为3的倍数,数字和必是3的倍数。原创 2015-06-10 21:06:25 · 1054 阅读 · 0 评论 -
B - Soldier and Badges (CF546B) Codeforces Round #304 (Div. 2)
B. Soldier and Badgestime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputColonel has n badges. He wants to giv原创 2015-06-18 17:10:34 · 1321 阅读 · 1 评论 -
Integer Partition(hdu4658)2013 Multi-University Training Contest 6 整数拆分二
Integer PartitionTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 524 Accepted Submission(s): 238Problem DescriptionGiven n, k, calc原创 2015-07-17 15:44:46 · 1226 阅读 · 1 评论 -
Palindrome Numbers(LA2889)第n个回文数是?
J - Palindrome NumbersTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit Status Practice UVALive 2889 WA了一版面,我也是醉了,就因为一个编译环境不同。。。。。。 说多了都是泪。 题原创 2015-06-10 13:52:01 · 1261 阅读 · 0 评论 -
CRB and Candies(lcm(C(n,0)..C(n,n)=lcm(1,2,,,n+1)/(n+1)))hdu5407
CRB and CandiesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 358 Accepted Submission(s): 160Problem Description CRB has N d原创 2015-08-21 14:07:15 · 1652 阅读 · 0 评论 -
链表中环的入口结点(剑指offer)Floyd+O(1)
链表中环的入口结点参与人数:609时间限制:1秒空间限制:32768K通过比例:24.75%最佳记录:0 ms|8552K(来自 白云和黑土)题目描述一个链表中包含环,请找出该链表的环的入口结点。题目链接:http://www.nowcoder.com/practice/253d2c59ec3e4bc68da16833f79a38e4?rp原创 2015-09-09 13:52:53 · 1171 阅读 · 1 评论 -
2015 Multi-University Training Contest 6 solutions BY ZJU(部分解题报告)
2015 Multi-University Training Contest 6 solutions原创 2015-08-07 13:47:58 · 1255 阅读 · 1 评论 -
bzoj 2818 Gcd(莫比乌斯+gcd(a,b)=d) 经典
2818: GcdDescription给定整数N,求1<=x,y<=N且Gcd(x,y)为素数的数对(x,y)有多少对.原创 2015-08-19 20:28:44 · 2944 阅读 · 0 评论 -
S-Nim(hdu1536+SG函数)
S-NimTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5317 Accepted Submission(s): 2288Problem DescriptionArthur and his sister原创 2015-08-04 21:41:44 · 2878 阅读 · 2 评论 -
Coins(2015嘉杰信息杯+dp)
CoinsProblem Description:Duoxida buys a bottle of MaiDong from a vending machine and the machine give her n coins back. She places them in a line randomly showing head face or tail face on. And Duoxida wants to know how many situations that m continuou原创 2015-08-05 23:47:00 · 854 阅读 · 1 评论 -
邂逅明下(巴什博弈+hdu2897)
H - 邂逅明下Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u每行有三个数字n,p,q,表示一堆硬币一共有n枚,从这个硬币堆里取硬币,一次最少取p枚,最多q枚,如果剩下少于p枚就要一次取完。两人轮流取,直到堆里的硬币取完,最后一次取硬币的算输。对于每一行的三个数字,给出先取的人是否有必胜策略,如果有回答WIN,否则回答LOST。原创 2015-08-06 11:19:47 · 933 阅读 · 1 评论 -
博弈之——SG模板(hdu1848&&hdu1536)
很久没搞博弈了。先来写个模板: 现在我们来研究一个看上去似乎更为一般的游戏:给定一个有向无环图和一个起始顶点上的一枚棋子,两名选手交替的将这枚棋子沿有向边进行移动,无法移动者判负。事实上,这个游戏可以认为是所有Impartial Combinatorial Games的抽象模型。也就是说,任何一个ICG都可以通过把每个局面看成一个顶点,对每个局面和它的子局面连一条有向边来抽象原创 2015-08-04 21:51:14 · 661 阅读 · 1 评论 -
Fibonacci again and again(hdu1848+SG打表)
Fibonacci again and againTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6170 Accepted Submission(s): 2574Problem Description任何原创 2015-08-04 21:36:41 · 1573 阅读 · 1 评论 -
取石子游戏(hdu1527+威佐夫博弈)
Problem Description有两堆石子,数量任意,可以不同。游戏开始由两个人轮流取石子。游戏规定,每次有两种不同的取法,一是可以在任意的一堆中取走任意多的石子;二是可以在两堆中同时取走相同数量的石子。最后把石子全部取完者为胜者。现在给出初始的两堆石子的数目,如果轮到你先取,假设双方都采取最好的策略,问最后你是胜者还是败者。如果你胜,你第1次怎样取子?原创 2015-08-05 23:21:08 · 1091 阅读 · 1 评论 -
CO-PRIME(初探 莫比乌斯)NYOJ1066(经典)gcd(a,b)=1
CO-PRIME时间限制:1000 ms | 内存限制:65535 KB难度:3描述This problem is so easy! Can you solve it?You are given a sequence which contains n integers a1,a2……an, your task is to find how many pa原创 2015-08-17 16:11:43 · 1559 阅读 · 0 评论 -
取(2堆)石子游戏(威佐夫博弈+hdu2177)
Problem Description有两堆石子,数量任意,可以不同。游戏开始由两个人轮流取石子。游戏规定,每次有两种不同的取法,一是可以在任意的一堆中取走任意多的石子;二是可以在两堆中同时取走相同数量的石子。最后把石子全部取完者为胜者。现在给出初始的两堆石子的数目,如果轮到你先取,假设双方都采取最好的策略,问最后你是胜者还是败者。如果你胜,你第1次怎样取子?原创 2015-08-05 23:38:17 · 1023 阅读 · 1 评论 -
Visible Lattice Points(spoj7001+初探莫比乌斯)gcd(a,b,c)=1 经典
VLATTICE - Visible Lattice Pointsno tags Consider a N*N*N lattice. One corner is at (0,0,0) and the opposite one is at (N,N,N). How many lattice points are visible from corner at (0,0原创 2015-08-17 22:00:16 · 1175 阅读 · 0 评论 -
C-Soldier and Cards(CF546C)Codeforces Round #304 (Div. 2)
C. Soldier and Cardstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputTwo bored soldiers are playing card wa原创 2015-06-18 17:20:09 · 1201 阅读 · 0 评论 -
D-Soldier and Number Game(CF546D) Codeforces Round #304 (Div. 2)
D. Soldier and Number GameTwo soldiers are playing a game. At the beginning first of them chooses a positive integer n and gives it to the second soldier. Then the second one tries to make m原创 2015-06-18 17:27:25 · 1267 阅读 · 0 评论 -
Itself is Itself(scu1617)
Itself is Itself(scu1617)Contest2080 - 湖南多校对抗赛(2015.05.10)(国防科大学校赛决赛-Semilive)原创 2015-05-12 21:28:13 · 929 阅读 · 0 评论 -
面积最大的全1子矩阵
面积最大的全1子矩阵时间限制:1 秒内存限制:128 兆特殊判题:否提交:859解决:179题目描述:在一个M * N的矩阵中,所有的元素只有0和1,从这个矩阵中找出一个面积最大的全1子矩阵,所谓最大是指元素1的个数最多。 输入:输入可能包含多个测试样例。对于每个测试案例,输入的第一行是两个整数m、n(1矩阵共有m行,每行有n个整数,分别是0或1,相原创 2015-03-23 11:31:44 · 627 阅读 · 0 评论 -
11078 - Open Credit System
11078 - Open Credit SystemTime limit: 3.000 secondsProblem EOpen Credit SystemInput: Standard InputOutput: Standard OutputIn an open credit system, the students can choose anycou原创 2015-03-23 11:30:35 · 952 阅读 · 0 评论 -
First Date (hnoj12952)日期计算
First DateTime Limit: 3000ms, Special Time Limit:7500ms, Memory Limit:65536KBTotal submit users: 77, Accepted users: 46Problem 12952 : No special judgementProblem description原创 2015-03-23 11:30:30 · 622 阅读 · 0 评论 -
Inviting Friends(hdu3244 && zoj3187)完全背包+二分
Inviting FriendsTime Limit: 1 Second Memory Limit: 32768 KBYou want to hold a birthday party, inviting as many friends as possible, but you have to prepare enough food for them. For each person, y原创 2015-03-23 11:30:25 · 808 阅读 · 3 评论 -
Factorial Problem in Base K(zoj3621)
Factorial Problem in Base KTime Limit: 2 Seconds Memory Limit: 65536 KBHow many zeros are there in the end of s! if both s and s! are written in base k which is not necessarily to be 10? For general原创 2015-03-23 11:30:21 · 484 阅读 · 0 评论 -
最后的日子-训练2
A - Solve equationCrawling in process... Crawling failed Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Time Limit:1000MS Memory L原创 2015-03-23 11:31:39 · 776 阅读 · 0 评论 -
A simple problem(湘大邀请赛)
A simple problemProblem DescriptionThere is a simple problem. Given a number N. you are going to calculate N%1+N%2+N%3+...+N%N.原创 2015-03-23 11:28:49 · 1089 阅读 · 0 评论 -
Killing Monsters(hdu4970)
Killing MonstersTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1158 Accepted Submission(s): 527Problem DescriptionKingdom Rush is a p原创 2015-03-23 11:29:29 · 440 阅读 · 0 评论