hqd_acm的专栏

 StatusIn/OutTIME LimitMEMORY LimitSubmit TimesSolved UsersJUDGE TYPEstdin/stdout30s8192K2312565StandardWhile skimming his phone directory in 1982, Albert Wilan

SPY Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 25   Accepted Submission(s) : 10Font: Times New Roman | Verdana | GeorgiaFont Size: ←→Problem DescriptionThe National Intelligence Council of X Nation

Download Manager<br />Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)<br />Total Submission(s): 94    Accepted Submission(s): 52<br /><br />Problem DescriptionJiajia downloads a lot, a lot more than you can even imagine.

<br /><br />Faulty OdometerTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7042 Accepted: 4375<br />DescriptionYou are given a car odometer which displays the miles traveled as an integer. The odometer has a defect, however: it proceeds from th

Sum of Consecutive Prime NumbersTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9435 Accepted: 5407<br />DescriptionSome positive integers can be represented by a sum of one or more consecutive prime numbers. How many such representations does a

<br /><br />Copier ReductionTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6700 Accepted: 3440<br />DescriptionWhat do you do if you need to copy a 560x400mm image onto a standard sheet of US letter-size paper (which is about 216x280mm), while

Communication SystemTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 14238 Accepted: 4987<br />DescriptionWe have received an order from Pizoor Communications Inc. for a special communication system. The system consists of several devices. For eac

<br />Spell checkerTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 10052 Accepted: 3713<br />DescriptionYou, as a member of a development team for a new spell checking program, are to write a module that will check the correctness of given words

False coinTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 12014 Accepted: 3229<br />DescriptionThe "Gold Bar"bank received information from reliable sources that in their last group of N coins exactly one coin is false and differs in weight from

<br />Cable masterTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 10943 Accepted: 2254<br />DescriptionInhabitants of the Wonderland have decided to hold a regional programming contest. The Judging Committee has volunteered and has promised to or

<br />Wooden SticksTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 11769 Accepted: 4803<br />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 woodworking

<br />The Fun Number SystemTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 6859 Accepted: 2132<br />DescriptionIn a k bit 2's complement number, where the bits are indexed from 0 to k-1, the weight of the most significant bit (i.e., in position

可能大家都坑在第一题上了，导致这个比较水的题都不做了#include #include #include #include using namespace std;struct Point{ double x, y;} node[201];st

Trick or TreatTime Limit: 5 Seconds      Memory Limit: 65536 KB      Special JudgeJohnny and his friends have decided to spend Halloween night doing the usual candy collection from the households of their village. As the village is too big for a sing

ACM again- Ancient China Mathematics againTimeLimit: 1 Second   MemoryLimit: 32 MegabyteTotalsubmit: 341   Accepted: 25  DescriptionACM again- Ancient China Mathematics againACM again- Ancient China Mathematics againDr.K has published a essay on ACM(Ancien

大教训StatusIn/OutTIME LimitMEMORY LimitSubmit TimesSolved UsersJUDGE TYPEstdin/stdout3s16384K27344StandardStudents ranklist is sorted by their average score.

BUPT的新生赛，做着玩玩！Strings calculateSubmit: 409   Accepted:116Time Limit: 1000MS  Memory Limit: 65536KDescriptionheimengnan最近学习了字符串。他想到整数和浮点数可以做加、减、乘等的运算，那么字符串之间是不是也能做运算呢?给定字符串s1与s2 有如下的三种运算+,-, *s1与s2

2652: 数组操作ResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s32768K43852Standard对于一个长度为n，初始化为0的数组，定义如下操作。S x 找出下标大于等于x的第一个值为0的元素，并输出其下标。M x 将x标记为1现在给出m次操作，请输出每次操

#include#include#includeusing namespace std;struct t{ int p,d;}s[100001];int f[100001];bool cmp(t a,t b){ return (a.p>b.p);}int main(){ int n,i,j; long long max; while(scanf("%d",&n)!=EOF) {        fo

Single CPU, multi-taskingTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 93    Accepted Submission(s): 40Problem DescriptionTuntun is a big fan of Apple Inc. who owns almost all kinds of products the

<br />Radar InstallationTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 20456 Accepted: 4160<br />DescriptionAssume the coasting is an infinite straight line. Land is in one side of coasting, sea in the other. Each small island is a point loc

<br /><br />Y2K Accounting BugTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3874 Accepted: 1795<br />DescriptionAccounting for Computer Machinists (ACM) has sufferred from the Y2K bug and lost some vital data for preparing annual report for M

<br /><br />TautologyTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3462 Accepted: 1294<br />Description<br />WFF 'N PROOF is a logic game played with dice. Each die has six faces representing some subset of the possible symbols K, A, N, C, E,

<br /><br />#include<stdio.h><br />int a[50];<br />int main()<br />{<br />    int T;<br />    scanf("%d",&T);<br />    while(T--)<br />    {<br />       int n,k=0;<br />       scanf("%d",&n);<br />       int pre,nex;<br />       for(int i=1;i<=n;i++)<br />

<br /><br />3901 - Editor<br />Asia - Seoul - 2007/2008PDF Submit Ranking<br /> <br /> <br />Mr. Kim is a professional programmer. Recently he wants to design a new editor which has as many functions as possible. Most editors support a simple search functi

<br />3903 - PHONE<br />Asia - Seoul - 2007/2008PDF Submit Ranking<br /> <br />Mobile phones prevail in everyday life. Every mobile phone has a number pad for users to dial the telephone number. Figure 1 shows a typical layout of number pads, which

<br />3900 - Molar mass<br />Asia - Seoul - 2007/2008PDF Submit Ranking<br /> <br />An organic compound is any member of a large class of chemical compounds whose molecules contain carbon. The molar mass of an organic compound is the mass of one mole

比赛时候脑子堵得慌，注意进位，这两场比赛都发挥的很不好#include #include #include using namespace std;//////////////////////////////////////#define MAX 10000