07 2015 档案
摘要:Crazy BoboTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 879Accepted Submission(s): 264Problem D...
阅读全文
摘要:Solve this interesting problemTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1020Accepted Submiss...
阅读全文
摘要:PainterTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 497Accepted Submission(s): 239Problem Descr...
阅读全文
摘要:WorkTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 230Accepted Submission(s): 171Problem Descript...
阅读全文
摘要:RGCDQTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 323Accepted Submission(s): 162Problem Descrip...
阅读全文
摘要:-Error CurvesTime Limit:2000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusDescriptionJosephina is a clever girl and addicted to Machi...
阅读全文
摘要:C -Equation AgainTime Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusDescriptionThis problem’s author is too lazy to write t...
阅读全文
摘要:Monthly ExpenseTime Limit:2000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusDescriptionFarmer John is an astounding accounting wizard...
阅读全文
摘要:Hamburgers Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u Submit Status Hamburgers Submit Status Description Polycarpus loves h
阅读全文
摘要:BuildingsTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 221Accepted Submission(s): 29Problem De...
阅读全文
摘要:Piotr's AntsTime Limit: 2 seconds"One thing is for certain: there is no stopping them;the ants will soon be here. And I, for one, welcome ournew insec...
阅读全文
摘要:Time Limit: 4000/2000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1316Accepted Submission(s): 641Problem Description...
阅读全文
摘要:算法的一个实现方法如下。其中使用位运算替代2的幂次的计算,加快运算速度。使用时需要先调用initRMQ()进行初始化,然后再调用RMQ(u,v)进行查询。 1 const int mx = 10000 + 10; //数组最大长度 2 int n, a[mx]; //数组长度,数组内容 3 4 ...
阅读全文
摘要:1 #include 2 3 int binsearch(int x,int a[],int n) 4 { 5 int low,high,mid; 6 7 low=0,high=n-1; 8 9 while(lowa[mid]){16 low=...
阅读全文
摘要:Time Limit: 4000/2000 MS (Java/Others)Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 256Accepted Submission(s): 94Problem Description...
阅读全文
摘要:We'll defineS(n)for positive integernas follows: the number of then's digits in the decimal base. For example,S(893) = 3,S(114514) = 6.You want to mak...
阅读全文
摘要:Winters are just damn freezing cold in Nvodsk! That's why a group ofnfriends prefers to take a taxi, order a pizza and call girls. The phone numbers i...
阅读全文
摘要:Time Limit:2000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeURAL 1715DescriptionContestants often wonder what jury members d...
阅读全文
摘要:Time Limit:3000MSMemory Limit:262144KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeCodeForces 543ADescriptionProgrammers working on a large projec...
阅读全文
摘要:Time Limit:1000MSMemory Limit:262144KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeCodeForces 446ADescriptionDZY has a sequencea, consisting ofnin...
阅读全文
摘要:Time Limit:1000MSMemory Limit:262144KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeCodeForces 455ADescriptionAlex doesn't like boredom. That's why...
阅读全文