摘要：
S - 1019 Time Limit:1500MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Submit Status Practice FZU 1894 S - 1019 Submit Status Practice FZU 1894 阅读全文
posted @ 2016-09-29 10:12
luckilzy
阅读(285)
评论(0)
推荐(0)
摘要：
Sliding Window Time Limit: 12000MS Memory Limit: 65536K Total Submissions: 55309 Accepted: 15911 Case Time Limit: 5000MS Description An array of size 阅读全文
posted @ 2016-09-28 20:13
luckilzy
阅读(341)
评论(0)
推荐(0)
摘要：
Necklace Time Limit: 15000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4604 Accepted Submission(s): 1581 Probl 阅读全文
posted @ 2016-09-27 19:43
luckilzy
阅读(598)
评论(0)
推荐(0)
摘要：
Cube Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 1956 Accepted Submission(s): 1017 Problem D 阅读全文
posted @ 2016-09-27 12:09
luckilzy
阅读(257)
评论(0)
推荐(0)
摘要：
Parencodings Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 25010 Accepted: 14745 Description Let S = s1 s2...s2n be a well-formed string 阅读全文
posted @ 2016-09-26 22:26
luckilzy
阅读(277)
评论(0)
推荐(0)
摘要：
See you~ Time Limit: 5000/3000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 4729 Accepted Submission(s): 1515 Proble 阅读全文
posted @ 2016-09-20 20:10
luckilzy
阅读(384)
评论(0)
推荐(0)
摘要：
敌兵布阵 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 78691 Accepted Submission(s): 33255 Problem 阅读全文
posted @ 2016-09-17 22:14
luckilzy
阅读(375)
评论(0)
推荐(0)
摘要：
A Simple Problem with Integers Time Limit: 5000MS Memory Limit: 131072K Total Submissions: 97196 Accepted: 30348 Case Time Limit: 2000MS Description Y 阅读全文
posted @ 2016-09-17 11:11
luckilzy
阅读(803)
评论(0)
推荐(0)
摘要：
Flowers Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 3148 Accepted Submission(s): 1549 Problem 阅读全文
posted @ 2016-09-16 20:23
luckilzy
阅读(624)
评论(0)
推荐(0)
摘要：
转自 ：http://blog.csdn.net/int64ago/article/details/7425727 我们先开始一起写一个二分吧，要求是对num[]= {1,2,2,4,4,8,10}不减序列在区间[0,7)进行查找，当然我们得首先保证要查找的数e满足：num[0] <= e <= n 阅读全文
posted @ 2016-09-06 20:47
luckilzy
阅读(276)
评论(0)
推荐(0)
摘要：
Beans Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4451 Accepted Submission(s): 2103 Problem D 阅读全文
posted @ 2016-08-24 15:09
luckilzy
阅读(253)
评论(0)
推荐(0)
摘要：
Free DIY Tour Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6227 Accepted Submission(s): 2013 P 阅读全文
posted @ 2016-08-24 14:22
luckilzy
阅读(244)
评论(0)
推荐(0)
摘要：
How many ways Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4926 Accepted Submission(s): 2917 P 阅读全文
posted @ 2016-08-23 14:37
luckilzy
阅读(283)
评论(0)
推荐(0)
摘要：
Wooden Sticks Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 18745 Accepted Submission(s): 7692 阅读全文
posted @ 2016-08-22 19:13
luckilzy
阅读(326)
评论(0)
推荐(0)
摘要：
搬寝室 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 25674 Accepted Submission(s): 8821 Problem De 阅读全文
posted @ 2016-08-22 15:05
luckilzy
阅读(216)
评论(0)
推荐(0)
摘要：
Starship Troopers Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 17560 Accepted Submission(s): 阅读全文
posted @ 2016-08-19 20:13
luckilzy
阅读(294)
评论(0)
推荐(0)
摘要：
D. Choosing Capital for Treeland time limit per test 3 seconds memory limit per test 256 megabytes input standard input output standard output D. Choo 阅读全文
posted @ 2016-08-19 09:07
luckilzy
阅读(748)
评论(0)
推荐(0)
摘要：
Computer Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5903 Accepted Submission(s): 2963 Proble 阅读全文
posted @ 2016-08-18 11:12
luckilzy
阅读(313)
评论(0)
推荐(0)
摘要：
Rikka with Parenthesis II Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 857 Accepted Submission 阅读全文
posted @ 2016-08-17 20:24
luckilzy
阅读(563)
评论(0)
推荐(0)
摘要：
Crixalis's Equipment Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3957 Accepted Submission(s): 阅读全文
posted @ 2016-08-16 16:36
luckilzy
阅读(327)
评论(0)
推荐(0)
摘要：
B-number Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5000 Accepted Submission(s): 2866 Proble 阅读全文
posted @ 2016-08-10 21:22
luckilzy
阅读(247)
评论(0)
推荐(0)
摘要：
1026: [SCOI2009]windy数 Description windy定义了一种windy数。不含前导零且相邻两个数字之差至少为2的正整数被称为windy数。 windy想知道， 在A和B之间，包括A和B，总共有多少个windy数？ windy定义了一种windy数。不含前导零且相邻两个数 阅读全文
posted @ 2016-08-10 19:29
luckilzy
阅读(340)
评论(0)
推荐(0)
摘要：
Bomb Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 15025 Accepted Submission(s): 5427 Problem 阅读全文
posted @ 2016-08-09 09:54
luckilzy
阅读(324)
评论(0)
推荐(0)
摘要：
不要62 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 34469 Accepted Submission(s): 12459 Problem 阅读全文
posted @ 2016-08-08 20:02
luckilzy
阅读(237)
评论(0)
推荐(0)
摘要：
K - Necklace Crawling in process... Crawling failed Time Limit:1000MS Memory Limit:327680KB 64bit IO Format:%I64d & %I64u Submit Status Description In 阅读全文
posted @ 2016-08-06 16:44
luckilzy
阅读(355)
评论(0)
推荐(0)
摘要：
D - Hie with the Pie Crawling in process... Crawling failed Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%lld & %llu Submit Status Descripti 阅读全文
posted @ 2016-08-06 13:21
luckilzy
阅读(300)
评论(0)
推荐(0)
摘要：
C - 炮兵阵地 Crawling in process... Crawling failed Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%lld & %llu Submit Status Description Input Out 阅读全文
posted @ 2016-08-05 15:24
luckilzy
阅读(265)
评论(0)
推荐(0)
摘要：
I - 方格取数(1) Crawling in process... Crawling failed Time Limit:5000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Submit Status Description Inpu 阅读全文
posted @ 2016-08-04 11:29
luckilzy
阅读(340)
评论(0)
推荐(0)
摘要：
B - Corn Fields Crawling in process... Crawling failed Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%lld & %llu Submit Status Description In 阅读全文
posted @ 2016-08-03 21:00
luckilzy
阅读(464)
评论(0)
推荐(0)
摘要：
Teacher Bo Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 1052 Accepted Submission(s): 582 Pr 阅读全文
posted @ 2016-08-03 15:15
luckilzy
阅读(359)
评论(0)
推荐(0)
摘要：
引入 首先来说说“状态压缩动态规划”这个名称，顾名思义，状态压缩动态规划这个算法包括两个特点，第一是“状态压缩”，第二是“动态规划”。 状态压缩： 从状态压缩的特点来看，这个算法适用的题目符合以下的条件： 1.解法需要保存一定的状态数据（表示一种状态的一个数据值），每个状态数据通常情况下是可以通过2 阅读全文
posted @ 2016-08-02 13:32
luckilzy
阅读(278)
评论(0)
推荐(0)
摘要：
饭卡 Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 22829 Accepted Submission(s): 8000 Problem De 阅读全文
posted @ 2016-08-01 21:38
luckilzy
阅读(238)
评论(0)
推荐(0)
摘要：
How to Type Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 6072 Accepted Submission(s): 2729 Pr 阅读全文
posted @ 2016-08-01 16:04
luckilzy
阅读(421)
评论(0)
推荐(0)
摘要：
Robberies Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 20365 Accepted Submission(s): 7535 Pro 阅读全文
posted @ 2016-07-31 21:01
luckilzy
阅读(245)
评论(0)
推荐(0)
摘要：
免费馅饼 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 41189 Accepted Submission(s): 14108 Problem 阅读全文
posted @ 2016-07-29 22:53
luckilzy
阅读(486)
评论(0)
推荐(0)
摘要：
//1286 #include #include #include #include #include #include #include #include using namespace std; int main() { int t,n,sum; scanf("%d",&t); while(t--) { scanf("%d",&n); ... 阅读全文
posted @ 2016-07-29 08:42
luckilzy
阅读(276)
评论(0)
推荐(0)
摘要：
小数化分数2 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3420 Accepted Submission(s): 1258 Problem 阅读全文
posted @ 2016-07-28 23:31
luckilzy
阅读(326)
评论(0)
推荐(0)
摘要：
题意： 求N^N的首位数字，N不超过1000 000 000. 题解： 1 /* 2 m = n ^ n => log10(m) = n * log10(n) => m = 10 ^ (n * log10(n))。10的幂次中的整数的作用是增加0， 3 10的幂次的结果中的各个位置的数字取决于其小数 阅读全文
posted @ 2016-07-27 22:31
luckilzy
阅读(196)
评论(0)
推荐(0)
摘要：
题意： 求一个不超过1000000数的最大素因子的排位，1排0号，2排1号，5排3号...... 题解： 1 /* 2 n最大不超过1000000，可以枚举每一个数i，与小于它的数j进行乘积，得到的数n的最大质因子的排序是i和j中大的那一个 3 */ 4 #include <iostream> 5 阅读全文
posted @ 2016-07-27 22:30
luckilzy
阅读(206)
评论(0)
推荐(0)
摘要：
题意：输入行数和列数，然后输入大写字母的矩阵，从左上角出发，只能上下左右走，求能够经过的不重复字母的最多的个数。 题解 1 /* 2 基础的dfs 3 */ 4 #include <iostream> 5 #include <vector> 6 7 using namespace std; 8 9 阅读全文
posted @ 2016-07-27 22:22
luckilzy
阅读(218)
评论(0)
推荐(0)
浙公网安备 33010602011771号