POJ
七情六欲·
唔西迪西 糊不拉几
展开
-
POJ 3414 Pots 倒水问题 + 回溯
这个题目在找翻译的时候百度一下居然搜到了博客园 神犇(以为非常大佬的博客 大家可以去看一下 博客园ID就是这个) 的博客,莫名的就是一种感触,想一想恍然间已经过去三年多了,好多事情零零碎碎的又突然浮现在眼前,只能道一句“天道有轮回,世事有因果”。还记得杜老师说:“似水流年,我们站在岁月的河边看花开花落,看流水轻轻划过,河面上是落英缤纷,以及逝去的年华。”PotsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 31715 .原创 2020-09-08 17:31:10 · 159 阅读 · 0 评论 -
POJ3126 Prime Path 质数变换
Prime PathTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 40556 Accepted: 21520DescriptionThe ministers of the cabinet were quite upset by the message from the Chief of Security stating that they would all have to change the four-digit room原创 2020-09-08 16:16:45 · 132 阅读 · 0 评论 -
POJ 1442 Black Box Treap 查询第K大
Black BoxTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 17311 Accepted: 7041DescriptionOur Black Box represents a primitive database. It can save an integer array and has a special i variable. At the initial moment Black Box is empty and i原创 2020-08-20 16:55:07 · 163 阅读 · 0 评论 -
POJ 3481 Double Queue Treap 带详细注释
今天吴永辉老师讲的是平衡树,怎么这就讲平衡树了,????????????????????没办法,听的也是云里雾里,自己补吧Double QueueTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 20706 Accepted: 8849DescriptionThe new founded Balkan Investment Group Bank (BIG-Bank) opened a new office in Buchare原创 2020-07-30 15:50:48 · 147 阅读 · 0 评论 -
POJ 3635 Full Tank?
Full Tank?Time Limit: 1000MS Memory Limit: 65536K Description After going through the receipts from your car trip through Europe this summer, you realised that the gas prices varied between the原创 2017-08-18 11:39:10 · 329 阅读 · 0 评论 -
POJ 2891 Strange Way to Express Integers
Strange Way to Express IntegersDescriptionElina is reading a book written by Rujia Liu, which introduces a strange way to express non-negative integers. The way is described as following:Choose原创 2017-08-10 08:30:05 · 233 阅读 · 0 评论 -
中国剩余定理
中国剩余定理(CRT)的表述如下设正整数为两两互素的数,那么同余方程组存在一组解:并且在模意义下有唯一解。解的计算公式:其中:,为模意义下的逆元。代码:void EXGCD(int a,int b,int &x,int &y){ if(!b){ x=1; y=0; return; } EXGCD(b,a%b,x,y); int tmp=x; x=y; y=tmp-(a原创 2017-08-10 07:48:33 · 263 阅读 · 0 评论 -
POJ 2104 K-th Number
K-th NumberTime Limit: 20000MS Memory Limit: 65536K Total Submissions: 57576 Accepted: 19913 Case Time Limit: 2000MS DescriptionYou are working for Macrohard company in data structures de原创 2017-07-12 20:23:20 · 216 阅读 · 0 评论 -
POJ 3160 Father Christmas flymouse
Father Christmas flymouseTime Limit: 1000MS Memory Limit: 131072K Total Submissions: 3484 Accepted: 1188 Description After retirement as contestant from WHU ACM Team, flymouse volunteered t原创 2017-06-10 10:08:50 · 266 阅读 · 0 评论 -
POJ1149 PIGS
PIGS Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 21217 Accepted: 9686 DescriptionMirko works on a pig farm that consists of M locked pig-houses and Mirko can’t unlock any原创 2017-06-08 16:58:01 · 239 阅读 · 0 评论 -
POJ 3461 Oulipo
Oulipo Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 42555 Accepted: 17085 Description The French author Georges Perec (1936–1982) once wrote a book, La disparition, withou原创 2017-08-13 10:37:53 · 290 阅读 · 0 评论 -
POJ 3417 Network
Network Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 5308 Accepted: 1520 Description Yixght is a manager of the company called SzqNetwork(SN). Now she’s very worried because原创 2017-09-27 14:50:12 · 200 阅读 · 0 评论 -
POJ2449 Remmarguts' Date A*搜索K短路
Remmarguts’ DateTime Limit: 4000MS Memory Limit: 65536K Total Submissions: 29778 Accepted: 8083 Description“Good man never makes girls wait or breaks an appointment!” said the mandarin du原创 2017-06-06 10:55:23 · 391 阅读 · 0 评论 -
2017.9.20 模拟考试
刚开动销第一天就赶上考试,还是聂老大出题….A 约数之和(count.pas/c/cpp)TL:1S ML:128MB 【Description】 我们用 D(x)表示正整数 x 的约数的个数。给定一个正整数 N,求 D(1)+D(2)+…+D(N)。 【Input】 一行一个正整数 N。 【Output】 一行一个整数,表示答案 【Sample Input】 5 【Sample原创 2017-09-20 14:47:23 · 340 阅读 · 0 评论 -
ZOJ 2422 POJ 2082 Terrible Sets
Terrible SetsTime Limit: 1000MS Memory Limit: 30000K Total Submissions: 5104 Accepted: 2611 Description Let N be the set of all natural numbers {0 , 1 , 2 , … }, and R be the set of all rea原创 2017-10-12 19:33:36 · 324 阅读 · 0 评论 -
POJ 2796 Feel Good
Feel Good Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 15830 Accepted: 4385 Case Time Limit: 1000MS Special Judge Description Bill is developing a new mathematical th原创 2017-10-12 21:12:28 · 293 阅读 · 0 评论 -
POJ 2096 Collecting Bugs
Collecting BugsTime Limit: 10000MS Memory Limit: 64000KTotal Submissions: 6416 Accepted: 3134Case Time Limit: 2000MS Special JudgeDescriptionIvan is fon原创 2017-11-07 19:22:56 · 197 阅读 · 0 评论 -
不写线段树好多年~~ POJ 3468 A Simple Problem with Integers
A Simple Problem with IntegersTime Limit: 5000MS Memory Limit: 131072K Total Submissions: 120234 Accepted: 37325 Case Time Limit: 2000MS DescriptionYou have N integers, A1, A2, … , AN. Yo原创 2017-10-15 19:50:30 · 188 阅读 · 0 评论 -
POJ 3281 Dining USACO07OPEN
Dining Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 17557 Accepted: 7822DescriptionCows are such finicky eaters. Each cow has a preference for certain foods and drinks, and原创 2017-05-07 17:13:08 · 529 阅读 · 0 评论 -
POJ 1523 SPF
SPFTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 8503 Accepted: 3877DescriptionConsider the two networks shown below. Assuming t原创 2017-03-17 16:21:49 · 179 阅读 · 0 评论 -
POJ3613 Cow Relays
Cow RelaysTime Limit: 1000MS Memory Limit: 65536K Total Submissions: 7665 Accepted: 3008 DescriptionFor their physical fitness program, N (2 ≤ N ≤ 1,000,000) cows have decided to run a relay原创 2017-06-07 10:16:11 · 247 阅读 · 0 评论 -
POJ 3061 Subsequence
SubsequenceTime Limit: 1000MS Memory Limit: 65536K Total Submissions: 14673 Accepted: 6192 Description A sequence of N positive integers (10 < N < 100 000), each of them less than or equ原创 2017-05-20 19:29:59 · 191 阅读 · 0 评论 -
POJ 2762 Going from u to v or from v to u?
Going from u to v or from v to u?Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 17761 Accepted: 4766 Description In order to make their sons brave, Jiajia and Wind take them原创 2017-05-16 22:10:16 · 176 阅读 · 0 评论 -
POJ 3580 SuperMemo
SuperMemoTime Limit: 5000MS Memory Limit: 65536K Total Submissions: 15653 Accepted: 4935 Case Time Limit: 2000MS Description Your friend, Jackson is invited to a TV show called SuperMem原创 2017-05-12 08:01:01 · 272 阅读 · 0 评论 -
POJ 1459 Power Network
Power NetworkTime Limit: 2000MS Memory Limit: 32768KTotal Submissions: 27831 Accepted: 14469DescriptionA power network consists of nodes (power stations, consumers原创 2017-03-17 16:24:08 · 142 阅读 · 0 评论 -
POJ 1062 昂贵的聘礼
昂贵的聘礼Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 47803 Accepted: 14234Description年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了,于是便向酋长去求亲。酋长要他用10000个金币作为聘礼才答应把女儿嫁给他。原创 2017-03-17 16:24:13 · 192 阅读 · 0 评论 -
POJ 3320 Jessica's Reading Problem
Jessica’s Reading ProblemTime Limit: 1000MS Memory Limit: 65536K Total Submissions: 12333 Accepted: 4192 DescriptionJessica’s a very lovely girl wooed by lots of boys. Recently she has a原创 2017-05-20 20:00:41 · 159 阅读 · 0 评论 -
POJ 3276 Face The Right Way
Face The Right WayTime Limit: 2000MS Memory Limit: 65536K Total Submissions: 5042 Accepted: 2344 Description Farmer John has arranged his N (1 ≤ N ≤ 5,000) cows in a row and many of them ar原创 2017-05-20 21:50:40 · 167 阅读 · 0 评论 -
POJ 1275 Vijos 1108 小胖超市
小胖超市描述:xuzhenyi的一家每天24小时营业的超市,需要一批出纳员来满足它的需要。超市经理雇佣你来帮他解决他的问题——超市在每天的不同时段需要不同数目的出纳员(例如:午夜时只需一小批,而下午则需要很多)来为顾客提供优质服务。他希望雇佣最少数目的出纳员。 经理已经提供你一天的每一小时需要出纳员的最少数量——R(0), R(1), …, R(23)。R(0)表示从午夜到上午1:00需要出纳员的原创 2017-06-03 15:20:16 · 260 阅读 · 0 评论 -
POJ 3177 Redundant Paths
Redundant PathsDescription In order to get from one of the F (1 <= F <= 5,000) grazing fields (which are numbered 1..F) to another field, Bessie and the rest of the herd are forced to cross near the T原创 2017-06-18 21:28:33 · 264 阅读 · 0 评论 -
POJ 3723 Conscription
ConscriptionTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 12905 Accepted: 4525DescriptionWindy has a country, and he wants to build an army to protect原创 2017-03-21 19:50:12 · 270 阅读 · 0 评论 -
POJ 2777 Count Color
Count ColorTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 45101Accepted: 13664DescriptionChosen Problem Solving and Program design as an optional cour原创 2017-03-27 15:06:15 · 268 阅读 · 0 评论 -
POJ 1061 青蛙(蛤蟆)的约会
青蛙的约会 Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 113194 Accepted: 23080 Description 两只青蛙在网上相识了,它们聊得很开心,于是觉得很有必要见一面。它们很高兴地发现它们住在同一条纬度线上,于是它们约定各自朝西跳,直到碰面为止。可是它们出发之前忘记了一件很重要原创 2017-04-06 08:37:53 · 369 阅读 · 0 评论 -
POJ 3463 Sightseeing
Sightseeing Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 9298 Accepted: 3264 DescriptionTour operator Your Personal Holiday organises guided bus trips across the Benelux. Ever原创 2017-06-06 19:07:30 · 222 阅读 · 0 评论 -
POJ 3013 Big Christmas Tree
Big Christmas Tree Time Limit: 3000MS Memory Limit: 131072K Total Submissions: 24251 Accepted: 5260 DescriptionChristmas is coming to KCM city. Suby the loyal civilian in KCM city is pre原创 2017-06-06 15:47:47 · 212 阅读 · 0 评论 -
POJ 3694 Network 割边+LCA
A network administrator manages a large network. The network consists of N computers and M links between pairs of computers. Any pair of computers are connected directly or indirectly by successive lin原创 2017-06-03 20:30:00 · 327 阅读 · 0 评论 -
Codevs 1710 == POJ 1190 生日蛋糕 == 洛谷P1731
生日蛋糕时间限制: 2 s 空间限制: 128000 KB 题目等级 : 大师 Master题目描述 Description7月17日是Mr.W的生日,ACM-THU为此要制作一个体积为Nπ的M层生日蛋糕,每层都是一个圆柱体。设从下往上数第i(1Ri+1且Hi>Hi+1。由于要在蛋糕上抹奶油,为尽可能节约经费,我们希望蛋糕外表面(最下一层原创 2017-03-17 16:24:44 · 282 阅读 · 0 评论