LYC1498165445的专栏

钱币兑换问题 Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 2   Accepted Submission(s) : 2Font: Times New Roman | Verdana | Georgia Font Size:

Marsha and Bill own a collection of marbles. They want to split the collection among themselves so that both receive an equal share of the marbles. This would be easy if all the marbles had the same v

Consumer Time Limit : 4000/2000ms (Java/Other)   Memory Limit : 32768/65536K (Java/Other)Problem DescriptionFJ is going to do some shopping, and before that, he needs some boxes to carry the dif

Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 5132    Accepted Submission(s): 1626Problem DescriptionNew semester is coming, and DuoDu

Problem DescriptionYour old uncle Tom inherited a piece of land from his great-great-uncle. Originally, the property had been in the shape of a rectangle. A long time ago, however, his great-great

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3693    Accepted Submission(s): 1514Problem DescriptionAfter months of hard workin

Problem Description2012 If this is the end of the world how to do? I do not know how. But now scientists have found that some stars, who can live, but some people do not fit to live some of the pl

Problem DescriptionIgnatius再次被魔王抓走了(搞不懂他咋这么讨魔王喜欢)……这次魔王汲取了上次的教训，把Ignatius关在一个n*m的地牢里，并在地牢的某些地方安装了带锁的门，钥匙藏在地牢另外的某些地方。刚开始Ignatius被关在(sx,sy)的位置，离开地牢的门在(ex,ey)的位置。Ignatius每分钟只能从一个坐标走到相邻四个坐标中的其中一个。

判断区间 [x0, y0] 和区间 [x1,y1] 是否重叠，或者重叠部分区间是多少如果要重叠部分是多少(前提是有重叠部分)，重叠区间为 [max(x0, x1), min(y0, y1)]bool function(int x0,int y0,int x1,int y1){ return x0<y1 && x1<y0;}