随笔分类 -  Hdu

上一页 1 2 3
Prime Ring Problem
摘要：Time Limit: 4000/2000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 30395Accepted Submission(s): 13525Problem Descript... 阅读全文
posted @ 2015-03-19 23:59 JL_Zhou 阅读(149) 评论(0) 推荐(0)
N皇后问题
摘要：Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10397Accepted Submission(s): 4682Problem Descripti... 阅读全文
posted @ 2015-03-19 21:20 JL_Zhou 阅读(136) 评论(0) 推荐(0)
2^x mod n = 1
摘要：Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13345Accepted Submission(s): 4146Problem Descripti... 阅读全文
posted @ 2015-03-14 00:20 JL_Zhou 阅读(560) 评论(0) 推荐(0)
Queuing
摘要：Time Limit: 10000/5000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3141Accepted Submission(s): 1431Problem Descripti... 阅读全文
posted @ 2015-03-10 16:46 JL_Zhou 阅读(281) 评论(0) 推荐(0)
Tr A（矩阵快速幂）
摘要：Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3175Accepted Submission(s): 2373Problem Descriptio... 阅读全文
posted @ 2015-03-09 23:06 JL_Zhou 阅读(522) 评论(0) 推荐(0)
亲和串
摘要：ime Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8855Accepted Submission(s): 4024Problem Description... 阅读全文
posted @ 2015-03-07 11:18 JL_Zhou 阅读(380) 评论(0) 推荐(0)
Buy the Ticket
摘要：Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4981Accepted Submission(s): 2085Problem Descriptio... 阅读全文
posted @ 2015-03-04 21:53 JL_Zhou 阅读(261) 评论(0) 推荐(0)
大菲波数
摘要：Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 12716Accepted Submission(s): 4352Problem Descripti... 阅读全文
posted @ 2015-02-11 20:30 JL_Zhou 阅读(271) 评论(0) 推荐(0)
人见人爱A^B
摘要：求A^B的最后三位数表示的整数。说明：A^B的含义是“A的B次方”Input输入数据包含多个测试实例，每个实例占一行，由两个正整数A和B组成（1//快速幂int powermod(int a,int b){ int ans=1; a=a%1000; if(a==0) return ... 阅读全文
posted @ 2015-02-06 11:27 JL_Zhou 阅读(145) 评论(0) 推荐(0)
找新朋友
摘要：Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8315Accepted Submission(s): 4368Problem Descriptio... 阅读全文
posted @ 2015-02-05 21:26 JL_Zhou 阅读(156) 评论(0) 推荐(0)
相遇周期
摘要：Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2084Accepted Submission(s): 1069Problem Descriptio... 阅读全文
posted @ 2015-02-05 12:07 JL_Zhou 阅读(533) 评论(0) 推荐(0)
Rightmost Digit
摘要：Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 35848Accepted Submission(s): 13581Problem Descript... 阅读全文
posted @ 2015-02-03 11:05 JL_Zhou 阅读(147) 评论(0) 推荐(0)
18岁生日
摘要：Problem DescriptionGardon的18岁生日就要到了，他当然很开心，可是他突然想到一个问题，是不是每个人从出生开始，到达18岁生日时所经过的天数都是一样的呢？似乎并不全都是这样，所以他想请你帮忙计算一下他和他的几个朋友从出生到达18岁生日所经过的总天数，让他好来比较一下。Input... 阅读全文
posted @ 2015-02-01 19:47 JL_Zhou 阅读(221) 评论(0) 推荐(0)
Eddy's digital Roots
摘要：Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4793Accepted Submission(s): 2672Problem Descriptio... 阅读全文
posted @ 2015-02-01 11:33 JL_Zhou 阅读(145) 评论(0) 推荐(0)
Encoding
摘要：Problem DescriptionGiven a string containing only 'A' - 'Z', we could encode it using the following method:1. Each sub-string containing k same charac... 阅读全文
posted @ 2015-01-31 10:50 JL_Zhou 阅读(213) 评论(0) 推荐(0)
Let the Balloon Rise
摘要：Problem DescriptionContest time again! How excited it is to see balloons floating around. But to tell you a secret, the judges' favorite time is guess... 阅读全文
posted @ 2015-01-30 17:22 JL_Zhou 阅读(120) 评论(0) 推荐(0)
A + B Problem II
摘要：Problem DescriptionI have a very simple problem for you. Given two integers A and B, your job is to calculate the Sum of A + B.InputThe first line of ... 阅读全文
posted @ 2015-01-30 17:19 JL_Zhou 阅读(144) 评论(0) 推荐(0)
Number Sequence
摘要：Problem DescriptionA number sequence is defined as follows:f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7.Given A, B, and n, you are t... 阅读全文
posted @ 2015-01-30 00:49 JL_Zhou 阅读(176) 评论(0) 推荐(0)
Fibonacci Again
摘要：Problem DescriptionThere are another kind of Fibonacci numbers: F(0) = 7, F(1) = 11, F(n) = F(n-1) + F(n-2) (n>=2).InputInput consists of a sequence o... 阅读全文
posted @ 2015-01-30 00:19 JL_Zhou 阅读(282) 评论(0) 推荐(0)

上一页 1 2 3