10 2015 档案

BestCoder Round #61 (div.2)
摘要：Numbers Accepts: 571 Submissions: 1212 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/262144 K (Java/Others) Problem DescriptionThere a... 阅读全文
posted @ 2015-10-31 22:04 handsomecui 阅读(613) 评论(1) 推荐(0) 编辑
CCPC L(水)
摘要：Huatuo's Medicine Time Limit: 3000/1000MS (Java/Others) Memory Limit: 65535/65535KB (Java/Others)Huatuo was a famous doctor. He use identical bottles... 阅读全文
posted @ 2015-10-30 13:19 handsomecui 阅读(165) 评论(0) 推荐(0) 编辑
CCPC A(模拟)
摘要：Secrete Master Plan Time Limit: 3000/1000MS (Java/Others) Memory Limit: 65535/65535KB (Java/Others)Master Mind KongMing gave Fei Zhang a secrete mast... 阅读全文
posted @ 2015-10-30 12:44 handsomecui 阅读(205) 评论(0) 推荐(0) 编辑
Intersecting Lines（数学）
摘要：Intersecting LinesTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 12844Accepted: 5703DescriptionWe all know that a pair of distinct points on... 阅读全文
posted @ 2015-10-30 11:26 handsomecui 阅读(351) 评论(0) 推荐(0) 编辑
C Looooops(扩展欧几里德)
摘要：C LooooopsTime Limit : 2000/1000ms (Java/Other)Memory Limit : 131072/65536K (Java/Other)Total Submission(s) : 10Accepted Submission(s) : 3Problem Desc... 阅读全文
posted @ 2015-10-29 22:01 handsomecui 阅读(1167) 评论(0) 推荐(0) 编辑
结构体+模版
摘要：代码：#includeusing namespace std;template struct Point{ T x,y; Point(T x=0,T y=0)/*:x(x),y(y)*/{ this->x=x; this->y=y; }};templatePoint o... 阅读全文
posted @ 2015-10-29 21:04 handsomecui 阅读(258) 评论(0) 推荐(0) 编辑
Intersection（poj）
摘要：IntersectionTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 13140Accepted: 3424DescriptionYou are to write a program that has to decide wheth... 阅读全文
posted @ 2015-10-29 19:01 handsomecui 阅读(368) 评论(0) 推荐(0) 编辑
lightoj Again Array Queries
摘要：1100 - Again Array Queries PDF (English) Statistics Forum Time Limit: 3 second(s)Memory Limit: 32 MBGiven an array with n integers, and you are give... 阅读全文
posted @ 2015-10-28 22:27 handsomecui 阅读(321) 评论(0) 推荐(0) 编辑
Proving Equivalences（加多少边使其强联通）
摘要：Proving EquivalencesTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4384Accepted Submission(s): 15... 阅读全文
posted @ 2015-10-28 22:12 handsomecui 阅读(672) 评论(0) 推荐(0) 编辑
Hat’s Words（字典树）
摘要：Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11314 Accepted Submission(s): 4041 阅读全文
posted @ 2015-10-28 20:09 handsomecui 阅读(569) 评论(0) 推荐(0) 编辑
Phone List（字典树）
摘要：Description Given a list of phone numbers, determine if it is consistent in the sense that no number is the prefix of another. Let's say the phone cat 阅读全文
posted @ 2015-10-28 19:10 handsomecui 阅读(447) 评论(0) 推荐(0) 编辑
Dating with girls(1)(二分+map+set)
摘要：Dating with girls(1)Time Limit: 6000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3954Accepted Submission(s): 1... 阅读全文
posted @ 2015-10-28 18:10 handsomecui 阅读(732) 评论(0) 推荐(0) 编辑
Color the ball(树状数组+线段树+二分)
摘要：Color the ballTime Limit : 9000/3000ms (Java/Other)Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 3Accepted Submission(s) : 1Problem De... 阅读全文
posted @ 2015-10-27 21:39 handsomecui 阅读(432) 评论(0) 推荐(0) 编辑
Shot（三分）
摘要：ShotTime Limit: 5000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1053Accepted Submission(s): 590Problem Descrip... 阅读全文
posted @ 2015-10-27 16:53 handsomecui 阅读(307) 评论(0) 推荐(0) 编辑
遮挡判断（模拟）
摘要：遮挡判断Time Limit: 10000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 907Accepted Submission(s): 292Problem Descrip... 阅读全文
posted @ 2015-10-27 16:03 handsomecui 阅读(620) 评论(0) 推荐(0) 编辑
Score（规律）
摘要：ScoreTime Limit : 5000/1000ms (Java/Other)Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 2Accepted Submission(s) : 2Problem Description... 阅读全文
posted @ 2015-10-27 15:36 handsomecui 阅读(363) 评论(0) 推荐(0) 编辑
Shortest Prefixes（trie树唯一标识）
摘要：Description Input Output Sample Input Sample Output 阅读全文
posted @ 2015-10-25 20:04 handsomecui 阅读(326) 评论(0) 推荐(0) 编辑
字典树（转）
摘要：字典树：很强大的数据结构，实现多个字符串的查找、对其个数的纪录以及对其子串的查询。连接：http://blog.csdn.net/chenzhenyu123456/article/details/46490539这里讲下建树过程：准备：MAX 记录总节点数目 [cpp] view plaincopy... 阅读全文
posted @ 2015-10-25 19:23 handsomecui 阅读(238) 评论(0) 推荐(0) 编辑
统计难题（trie树）
摘要：Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131070/65535 K (Java/Others)Total Submission(s): 26206 Accepted Submission(s): 10637 阅读全文
posted @ 2015-10-25 19:16 handsomecui 阅读(691) 评论(0) 推荐(0) 编辑
Palindrome（Manacher）
摘要：PalindromeTime Limit: 15000MSMemory Limit: 65536KTotal Submissions: 6183Accepted: 2270DescriptionAndy the smart computer science student was attending... 阅读全文
posted @ 2015-10-25 17:24 handsomecui 阅读(299) 评论(0) 推荐(0) 编辑
最长回文（Manacher）
摘要：HOT~ 杭电2015级新生如何加入ACM集训队？ 最长回文Time Limit: 4000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 12244Accepted Submis... 阅读全文
posted @ 2015-10-25 16:28 handsomecui 阅读(279) 评论(0) 推荐(0) 编辑
Romantic（裸扩展欧几里德）
摘要：RomanticTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3944Accepted Submission(s): 1638Problem De... 阅读全文
posted @ 2015-10-25 13:34 handsomecui 阅读(300) 评论(0) 推荐(0) 编辑
A/B（扩展欧几里德）
摘要：A/BTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3340Accepted Submission(s): 2534Problem Descrip... 阅读全文
posted @ 2015-10-25 12:59 handsomecui 阅读(298) 评论(0) 推荐(0) 编辑
青蛙的约会(裸扩展欧几里德)
摘要：青蛙的约会Time Limit: 1000MSMemory Limit: 10000KTotal Submissions: 99567Accepted: 18976Description两 只青蛙在网上相识了，它们聊得很开心，于是觉得很有必要见一面。它们很高兴地发现它们住在同一条纬度线上，于是它们约... 阅读全文
posted @ 2015-10-25 11:48 handsomecui 阅读(286) 评论(0) 推荐(0) 编辑
One Person Game（扩展欧几里德求最小步数）
摘要：One Person GameTime Limit: 2 Seconds Memory Limit: 65536 KBThere is an interesting and simple one person game. Suppose there is a number axis under... 阅读全文
posted @ 2015-10-25 11:12 handsomecui 阅读(306) 评论(0) 推荐(0) 编辑
Modular Inverse(模逆元，扩展欧几里德)
摘要：Modular InverseTime Limit: 2 Seconds Memory Limit: 65536 KBThe modular modular multiplicative inverse of an integer a modulo m is an integer x such... 阅读全文
posted @ 2015-10-25 09:32 handsomecui 阅读(3017) 评论(0) 推荐(0) 编辑
D - 楼下水题（kmp+Manacher）
摘要：Description A string is said to be a palindrome if it remains same when read backwards. So, 'abba', 'madam' both are palindromes, but 'adam' is not. N 阅读全文
posted @ 2015-10-24 22:10 handsomecui 阅读(337) 评论(0) 推荐(0) 编辑
B - 楼下水题(扩展欧几里德)
摘要：B - 楼下水题 Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmit Status Practice CodeForces 7CDescriptionA line on the plane is de... 阅读全文
posted @ 2015-10-24 22:00 handsomecui 阅读(294) 评论(0) 推荐(0) 编辑
1005 - Rooks（规律）
摘要：1005 - Rooks PDF (English) Statistics Forum Time Limit: 1 second(s)Memory Limit: 32 MBA rook is a piece used in the game of chess which is played on... 阅读全文
posted @ 2015-10-24 20:51 handsomecui 阅读(606) 评论(0) 推荐(0) 编辑
1148 - Mad Counting（数学）
摘要：1148 - Mad Counting PDF (English) Statistics Forum Time Limit: 0.5 second(s)Memory Limit: 32 MBMob was hijacked by the mayor of the Town "TruthTown"... 阅读全文
posted @ 2015-10-24 20:45 handsomecui 阅读(309) 评论(0) 推荐(0) 编辑
扩展欧几里德算法
摘要：连接：http://blog.csdn.net/zhjchengfeng5/article/details/7786595扩展欧几里德算法 谁是欧几里德？自己百度去 先介绍什么叫做欧几里德算法 有两个数 a b，现在，我们要求 a b 的最大公约数，怎么求？枚举他们的因子？不现实，当 a b ... 阅读全文
posted @ 2015-10-24 20:37 handsomecui 阅读(365) 评论(0) 推荐(0) 编辑
Roman Roulette(约瑟夫环模拟)
摘要：Roman RouletteTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 286Accepted Submission(s): 105Proble... 阅读全文
posted @ 2015-10-24 12:23 handsomecui 阅读(541) 评论(0) 推荐(0) 编辑
1的个数(数学)
摘要：1的个数时间限制：1000ms | 内存限制：65535KB难度：3描述给你两个数a和b,你的任务是计算出1在a和b之间出现的次数,比如说，如果a=1024,b=1032，那么a和b之间的数就是：1024 1025 1026 1027 1028 1029 1030 1031 1032则有10个1出现... 阅读全文
posted @ 2015-10-24 10:24 handsomecui 阅读(456) 评论(0) 推荐(0) 编辑
find the most comfortable road（并差集，找差值最小的权值）
摘要：find the most comfortable roadTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5359Accepted Submiss... 阅读全文
posted @ 2015-10-23 21:06 handsomecui 阅读(612) 评论(0) 推荐(0) 编辑
Network of Schools(强连通分量+缩点） （问添加几个点最少点是所有点连接+添加最少边使图强连通)
摘要：Network of SchoolsTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 13801Accepted: 5505DescriptionA number of schools are connected to a comput... 阅读全文
posted @ 2015-10-23 20:01 handsomecui 阅读(384) 评论(0) 推荐(0) 编辑
Happy Matt Friends(dp)
摘要：Happy Matt FriendsTime Limit: 6000/6000 MS (Java/Others)Memory Limit: 510000/510000 K (Java/Others)Total Submission(s): 1810Accepted Submission(s): 71... 阅读全文
posted @ 2015-10-23 17:56 handsomecui 阅读(418) 评论(0) 推荐(1) 编辑
D - 金樽清酒斗十千(搜索dfs)
摘要：D - 金樽清酒斗十千 Time Limit:2000MS Memory Limit:524288KB 64bit IO Format:%I64d & %I64uSubmit Status Practice CodeForces 589JDescriptionMasha has recently b... 阅读全文
posted @ 2015-10-23 13:57 handsomecui 阅读(473) 评论(0) 推荐(0) 编辑
Junk-Mail Filter(并差集删点)
摘要：Junk-Mail FilterTime Limit: 15000/8000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7755Accepted Submission(s): 2449P... 阅读全文
posted @ 2015-10-22 19:44 handsomecui 阅读(522) 评论(0) 推荐(0) 编辑
Stars(树状数组+线段树)
摘要：Stars Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6676 Accepted Submission(s): 2659 Problem D 阅读全文
posted @ 2015-10-22 11:35 handsomecui 阅读(444) 评论(0) 推荐(0) 编辑
Summer Holiday(强联通入度最小点)
摘要：Summer HolidayTime Limit: 10000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2319Accepted Submission(s): 1082Pro... 阅读全文
posted @ 2015-10-21 20:16 handsomecui 阅读(250) 评论(0) 推荐(0) 编辑
迷宫城堡(强联通targin)
摘要：迷宫城堡Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10409Accepted Submission(s): 4674Problem Descr... 阅读全文
posted @ 2015-10-21 17:42 handsomecui 阅读(652) 评论(0) 推荐(0) 编辑
士兵杀敌（三）（线段树）
摘要：士兵杀敌（三）时间限制：2000 ms | 内存限制：65535 KB 难度：5描述南将军统率着N个士兵，士兵分别编号为1~N,南将军经常爱拿某一段编号内杀敌数最高的人与杀敌数最低的人进行比较，计算出两个人的杀敌数差值，用这种方法一方面能鼓舞杀敌数高的人，另一方面也算是批评杀敌数低的人，起到了很好的... 阅读全文
posted @ 2015-10-20 20:54 handsomecui 阅读(695) 评论(0) 推荐(0) 编辑
Ping pong(树状数组经典)
摘要：Ping pongTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4874Accepted Submission(s): 1777Problem D... 阅读全文
posted @ 2015-10-20 20:07 handsomecui 阅读(475) 评论(0) 推荐(0) 编辑
士兵杀敌（五）
摘要：士兵杀敌（五）时间限制：2000ms | 内存限制：65535KB难度：5描述南将军麾下有百万精兵，现已知共有M个士兵，编号为0~M，每次有任务的时候，总会有一批编号连在一起人请战（编号相近的人经常在一块，相互之间比较熟悉），最终他们获得的军功，也将会平分到每个人身上，这样，有时候，计算他们中的哪一... 阅读全文
posted @ 2015-10-20 16:03 handsomecui 阅读(521) 评论(0) 推荐(1) 编辑
stringstream字符串流
摘要：例题详解題目：输入的第一行有一个数字 N 代表接下來有 N 行資料，每一行資料里有不固定個數的整數(最多 20 個，每行最大 200 個字元)，請你寫一個程式將每行的总和印出來。輸入：31 2 320 17 23 54 77 60111 222 333 444 555 666 777 888 999... 阅读全文
posted @ 2015-10-20 13:23 handsomecui 阅读(204) 评论(0) 推荐(0) 编辑
士兵杀敌（二）（线段树+树状数组）
摘要：士兵杀敌（二）时间限制：1000 ms | 内存限制：65535 KB 难度：5描述南将军手下有N个士兵，分别编号1到N，这些士兵的杀敌数都是已知的。小工是南将军手下的军师，南将军经常想知道第m号到第n号士兵的总杀敌数，请你帮助小工来回答南将军吧。南将军的某次询问之后士兵i可能又杀敌q人，之后南将军... 阅读全文
posted @ 2015-10-19 21:26 handsomecui 阅读(252) 评论(0) 推荐(0) 编辑
士兵杀敌（一）（树状数组）
摘要：士兵杀敌（一）时间限制：1000 ms | 内存限制：65535 KB 难度：3描述南将军手下有N个士兵，分别编号1到N，这些士兵的杀敌数都是已知的。小工是南将军手下的军师，南将军现在想知道第m号到第n号士兵的总杀敌数，请你帮助小工来回答南将军吧。注意，南将军可能会问很多次问题。输入只有一组测试数据... 阅读全文
posted @ 2015-10-19 21:01 handsomecui 阅读(297) 评论(0) 推荐(0) 编辑
C语言文件读写操作总结
摘要：C语言文件读写操作总结C语言文件操作一、标准文件的读写1.文件的打开fopen() 文件的打开操作表示将给用户指定的文件在内存分配一个FILE结构区，并将该结构的指针返回给用户程序，以后用户程序就可用此FILE指针来实现对指定文 件的存取操作了。当使用打开函数时，必须给出文件名、文件操作方式(读、写... 阅读全文
posted @ 2015-10-19 13:44 handsomecui 阅读(406) 评论(0) 推荐(0) 编辑
BC第二场
摘要：GT and sequenceAccepts: 385Submissions: 1467Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Problem DescriptionYou are ... 阅读全文
posted @ 2015-10-17 21:04 handsomecui 阅读(235) 评论(0) 推荐(0) 编辑
C++STL之string (转)
摘要：在学习c++STL中的string，在这里做个笔记，以供自己以后翻阅和初学者参考。1：string对象的定义和初始化以及读写string s1; 默认构造函数，s1为空串string s2(s1); 将s2初始化为s1的一个副本string s3("valuee"); 将s3初始化一个字符串面值副本... 阅读全文
posted @ 2015-10-16 18:03 handsomecui 阅读(332) 评论(0) 推荐(0) 编辑
最大子矩阵(矩阵压缩)
摘要：最大子矩阵Time Limit : 30000/10000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 1 Accepted Submission(s) : 1Problem Descrip... 阅读全文
posted @ 2015-10-16 13:41 handsomecui 阅读(350) 评论(0) 推荐(0) 编辑
To the Max(矩阵压缩)
摘要：To the MaxTime Limit : 2000/1000ms (Java/Other) Memory Limit : 20000/10000K (Java/Other)Total Submission(s) : 2 Accepted Submission(s) : 2Problem Desc... 阅读全文
posted @ 2015-10-16 13:39 handsomecui 阅读(235) 评论(0) 推荐(0) 编辑
龟兔赛跑(DP)
摘要：龟兔赛跑Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 13914Accepted Submission(s): 5178Problem Descr... 阅读全文
posted @ 2015-10-15 13:06 handsomecui 阅读(381) 评论(0) 推荐(0) 编辑
nefu 462 fib组合
摘要：nefu 462 fib组合 （斐波那契数列的通项公式以及推倒过程）分类：数学2014-05-21 10:27190人阅读评论(0)收藏举报题目链接：http://acm.nefu.edu.cn/JudgeOnline/problemshow.php?problem_id=462斐波那契数列的通项公... 阅读全文
posted @ 2015-10-12 20:14 handsomecui 阅读(208) 评论(0) 推荐(0) 编辑
MZL's xor
摘要：MZL's xorTime Limit : 2000/1000ms (Java/Other)Memory Limit : 65536/65536K (Java/Other)Total Submission(s) : 1Accepted Submission(s) : 1Problem Descrip... 阅读全文
posted @ 2015-10-12 19:50 handsomecui 阅读(238) 评论(0) 推荐(0) 编辑
The Highest Mark(01背包)
摘要：The Highest MarkTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 247Accepted Submission(s): 101Pr... 阅读全文
posted @ 2015-10-11 11:08 handsomecui 阅读(390) 评论(0) 推荐(0) 编辑
Reorder the Books(规律)
摘要：Reorder the BooksTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 179Accepted Submission(s): 125P... 阅读全文
posted @ 2015-10-11 09:44 handsomecui 阅读(304) 评论(0) 推荐(0) 编辑
SDOI(队列)
摘要：SDOI Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 841 Accepted Submission(s): 332 Problem D 阅读全文
posted @ 2015-10-10 21:05 handsomecui 阅读(452) 评论(0) 推荐(0) 编辑
超级密码(bfs)
摘要：超级密码Time Limit : 20000/10000ms (Java/Other)Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 4Accepted Submission(s) : 0Problem Descriptio... 阅读全文
posted @ 2015-10-10 00:07 handsomecui 阅读(1001) 评论(0) 推荐(0) 编辑
毕业bg（dfs）
摘要：毕业bgTime Limit : 2000/1000ms (Java/Other)Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 3Accepted Submission(s) : 1Problem Description每... 阅读全文
posted @ 2015-10-09 21:53 handsomecui 阅读(380) 评论(0) 推荐(0) 编辑
Yet Another Multiple Problem(bfs好题)
摘要：Yet Another Multiple ProblemTime Limit : 40000/20000ms (Java/Other)Memory Limit : 65536/65536K (Java/Other)Total Submission(s) : 2Accepted Submission(... 阅读全文
posted @ 2015-10-09 19:04 handsomecui 阅读(333) 评论(0) 推荐(0) 编辑
翻纸牌游戏（dfs回溯）
摘要：翻纸牌游戏Time Limit : 9000/3000ms (Java/Other)Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 2Accepted Submission(s) : 2Problem Description... 阅读全文
posted @ 2015-10-08 20:17 handsomecui 阅读(1034) 评论(0) 推荐(0) 编辑
xmu1125 越野车大赛(三分)
摘要：1125: 越野车大赛Time Limit: 500 MSMemory Limit: 64 MBSpecial JudgeSubmit: 4Solved: 3[Submit][Status][Web Board]Description TheBeet正在参加一场越野车大赛。比赛的场地如右图： 共... 阅读全文
posted @ 2015-10-08 13:42 handsomecui 阅读(307) 评论(4) 推荐(0) 编辑
Light Bulb（三分）
摘要：ZOJ Problem Set - 3203Light BulbTime Limit: 1 Second Memory Limit: 32768 KBCompared to wildleopard's wealthiness, his brother mildleopard is rather p... 阅读全文
posted @ 2015-10-08 12:49 handsomecui 阅读(333) 评论(0) 推荐(0) 编辑
Turn the corner (三分)
摘要：Turn the cornerTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 151 Accepted Submission(s): 61Prob... 阅读全文
posted @ 2015-10-08 11:56 handsomecui 阅读(462) 评论(0) 推荐(0) 编辑
xmu1214: 购物
摘要：1214: 购物Time Limit: 500 MSMemory Limit: 64 MBSubmit: 10Solved: 5[Submit][Status][Web Board]Description为了组织班级聚会，wlnwyyfc来到新华都购买一种物品，这类物品的价值为P。他身上有N笔款项，... 阅读全文
posted @ 2015-10-07 22:09 handsomecui 阅读(154) 评论(0) 推荐(0) 编辑
Tempter of the Bone(dfs奇偶剪枝)
摘要：Tempter of the BoneTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 92175Accepted Submission(s): 25... 阅读全文
posted @ 2015-10-07 21:25 handsomecui 阅读(240) 评论(0) 推荐(0) 编辑
爱的宣言
该文被密码保护。
posted @ 2015-10-03 13:48 handsomecui 阅读(4) 评论(0) 推荐(0) 编辑