01 2014 档案

poj1611---The Suspects
摘要：The SuspectsTime Limit: 1000MSMemory Limit: 20000KTotal Submissions: 19754Accepted: 9576DescriptionSevere acute respiratory syndrome (SARS), an atypical pneumonia of unknown aetiology, was recognized as a global threat in mid-March 2003. To minimize transmission to others, the best strategy is to se 阅读全文

posted @ 2014-01-20 18:04 龚细军 阅读(337) 评论(0) 推荐(0) 编辑

nyoj-----幸运三角形
摘要：幸运三角形时间限制：1000ms | 内存限制：65535KB难度：3描述 话说有这么一个图形，只有两种符号组成（‘+’或者‘-’），图形的最上层有n个符号，往下个数依次减一，形成倒置的金字塔形状，除第一层外（第一层为所有可能情况），每层形状都由上层决定，相邻的符号相同，则下层的符号为‘+’，反之，为‘-’;如下图所示（n = 3 时的两种情况)： 如果图中的两种符号个数相同，那这个三角形就是幸运三角形，如上图中的图（2）.输入有多组测试数据（少于20组）。每行含一个整数n（0 2 int str[20]={0}; 3 bool map[20][2... 阅读全文

posted @ 2014-01-09 11:58 龚细军 阅读(234) 评论(0) 推荐(0) 编辑

HDUOJ --2523
摘要：http://acm.hdu.edu.cn/showproblem.php?pid=2523哈希表..球阀代码：#include#include#include#include#includeusing namespace std;bool hash[2000];int main(){ int c,n,k,i,j; scanf("%d",&c); while(c--) { scanf("%d%d",&n,&k); memset(hash,0,sizeof(hash)); vectorsav(n); for(i=0;i()); .. 阅读全文

posted @ 2014-01-08 19:36 龚细军 阅读(276) 评论(0) 推荐(0) 编辑

HDUOJ---1195Open the Lock
摘要：Open the LockTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3400Accepted Submission(s): 1507Problem DescriptionNow an emergent task for you is to open a password lock. The password is consisted of four digits. Each digit is numbered from 1 to 9. E 阅读全文

posted @ 2014-01-08 12:14 龚细军 阅读(230) 评论(0) 推荐(0) 编辑

HDUOJ----2952Counting Sheep
摘要：Counting SheepTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1782Accepted Submission(s): 1170Problem DescriptionA while ago I had trouble sleeping. I used to lie awake, staring at the ceiling, for hours and hours. Then one day my grandmother sugge 阅读全文

posted @ 2014-01-07 14:32 龚细军 阅读(273) 评论(0) 推荐(0) 编辑

HDUOJ1060Leftmost Digit
摘要：Leftmost DigitTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11600Accepted Submission(s): 4430Problem DescriptionGiven a positive integer N, you should output the leftmost digit of N^N.InputThe input contains several test cases. The first line of 阅读全文

posted @ 2014-01-07 12:03 龚细军 阅读(261) 评论(0) 推荐(0) 编辑

HDUOJ1086You can Solve a Geometry Problem too
摘要：You can Solve a Geometry Problem tooTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6340Accepted Submission(s): 3064Problem DescriptionMany geometry（几何）problems were designed in the ACM/ICPC. And now, I also prepare a geometry problem for this fina 阅读全文

posted @ 2014-01-07 09:47 龚细军 阅读(184) 评论(0) 推荐(0) 编辑

HDUOJ------1058 Humble Numbers
摘要：Humble NumbersTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14343Accepted Submission(s): 6229Problem DescriptionA number whose only prime factors are 2,3,5 or 7 is called a humble number. The sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15, 16 阅读全文

posted @ 2014-01-06 19:47 龚细军 阅读(286) 评论(0) 推荐(0) 编辑

HDUOJ------------1051Wooden Sticks
摘要：Wooden SticksTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9937Accepted Submission(s): 4081Problem DescriptionThere is a pile of n wooden sticks. The length and weight of each stick are known in advance. The sticks are to be processed by a woodwo 阅读全文

posted @ 2014-01-06 16:46 龚细军 阅读(285) 评论(0) 推荐(0) 编辑

HDUOJ-----2068RPG的错排
摘要：RPG的错排Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6173Accepted Submission(s): 2508Problem Description今年暑假杭电ACM集训队第一次组成女生队,其中有一队叫RPG,但做为集训队成员之一的野骆驼竟然不知道RPG三个人具体是谁谁。RPG给他机会让他猜猜，第一次猜：R是公主，P是草儿，G是月野兔；第二次猜：R是草儿，P是月野兔，G是公主；第三次猜：R是草儿，P是公主，G是月野兔；...... 阅读全文

posted @ 2014-01-06 11:50 龚细军 阅读(511) 评论(0) 推荐(0) 编辑

HDUOJ-----1066Last non-zero Digit in N!
摘要：Last non-zero Digit in N!Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5596Accepted Submission(s): 1382Problem DescriptionThe expression N!, read as "N factorial," denotes the product of the first N positive integers, where N is nonnega 阅读全文

posted @ 2014-01-06 10:06 龚细军 阅读(333) 评论(0) 推荐(0) 编辑

HDUOJ----2063过山车
摘要：过山车Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8364Accepted Submission(s): 3673Problem DescriptionRPG girls今天和大家一起去游乐场玩，终于可以坐上梦寐以求的过山车了。可是，过山车的每一排只有两个座位，而且还有条不成文的规矩，就是每个女生必须找个个男生做partner和她同坐。但是，每个女孩都有各自的想法，举个例子把，Rabbit只愿意和XHD或PQK做partner，Grass只 阅读全文

posted @ 2014-01-05 20:16 龚细军 阅读(295) 评论(0) 推荐(0) 编辑

HDUOJ------Worm
摘要：WormTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2471Accepted Submission(s): 1579Problem Description自从见识了平安夜苹果的涨价后，Lele就在他家门口水平种了一排苹果树，共有N棵。突然Lele发现在左起第P棵树上(从1开始计数)有一条毛毛虫。为了看到毛毛虫变蝴蝶的过程，Lele在苹果树旁观察了很久。虽然没有看到蝴蝶，但Lele发现了一个规律：每过1分钟，毛毛虫会随机从一棵树爬到相邻的一棵 阅读全文

posted @ 2014-01-05 18:05 龚细军 阅读(260) 评论(0) 推荐(0) 编辑

HDUOJ-------2149Public Sale
摘要：Public SaleTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3180Accepted Submission(s): 1958Problem Description虽然不想，但是现实总归是现实，Lele始终没有逃过退学的命运，因为他没有拿到奖学金。现在等待他的，就是像FarmJohn一样的农田生涯。要种田得有田才行，Lele听说街上正在举行一场别开生面的拍卖会，拍卖的物品正好就是一块20亩的田地。于是，Lele带上他的全部积蓄，冲往拍卖 阅读全文

posted @ 2014-01-05 15:26 龚细军 阅读(235) 评论(0) 推荐(0) 编辑

HDUOJ--1159Common Subsequence
摘要：Common SubsequenceTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 19595Accepted Submission(s): 8326Problem DescriptionA subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = another. 阅读全文

posted @ 2014-01-04 17:19 龚细军 阅读(272) 评论(0) 推荐(0) 编辑

HDUOJ----1170Milk
摘要：MilkTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11915Accepted Submission(s): 2885Problem DescriptionIgnatius drinks milk everyday, now he is in the supermarket and he wants to choose a bottle of milk. There are many kinds of milk in the superma 阅读全文

posted @ 2014-01-04 15:29 龚细军 阅读(337) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示