上一页 1 2 3 4 5 6 7 8 9 ··· 15 下一页
摘要: Cow MultiplicationTime Limit:1000MSMemory Limit:65536KTotal Submissions:9717Accepted:6574DescriptionBessie is tired of multiplying pairs of numbers the usual way, so she invented her own style of multiplication. In her style,A*Bis equal to the sum of all possible pairwise products between the digits 阅读全文
posted @ 2012-05-10 22:09 Stephen Li 阅读(311) 评论(0) 推荐(0) 编辑
摘要: Milking TimeTime Limit:1000MSMemory Limit:65536KTotal Submissions:3055Accepted:1281DescriptionBessie is such a hard-working cow. In fact, she is so focused on maximizing her productivity that she decides to schedule her nextN(1 ≤N≤ 1,000,000) hours (conveniently labeled 0..N-1) so that she produces 阅读全文
posted @ 2012-05-10 21:53 Stephen Li 阅读(457) 评论(0) 推荐(0) 编辑
摘要: 这两周一直在做计算几何的题,感觉计算几何题就是读懂题意,并且能有清晰的解题思路,剩下的就是套用模板了,所以模板相当重要!下面整理了一些模板以便以后做题用说明:下面的eps 都是1e-8;目录:㈠ Pick定理:㈡ 在二维空间中,已知四个点的坐标,求交点的坐标㈢ 已知多边形的顶点的坐标,求多边形的面积利用叉积㈣ 求三角形面积㈤ 判断一个多边形是否是一个凸包㈥ 求凸包的周长(在若干个点钟选取点组成凸包并求其周长)㈦ 判断点是否在凸包内㈧ 凸包内的点到凸包每条边的距离㈨ 跨立试验--判断两条线段是否相交(含顶点)㈩ 判断点是否在矩形的内部①.Pick定理:如图给定顶点坐标都是整点,所围成的多边形的面 阅读全文
posted @ 2012-05-09 21:32 Stephen Li 阅读(683) 评论(0) 推荐(0) 编辑
摘要: PipeTime Limit:1000MSMemory Limit:10000KTotal Submissions:6888Accepted:2020DescriptionThe GX Light Pipeline Company started to prepare bent pipes for the new transgalactic light pipeline. During the design phase of the new pipe shape the company ran into the problem of determining how far the light 阅读全文
posted @ 2012-05-08 21:55 Stephen Li 阅读(345) 评论(0) 推荐(0) 编辑
摘要: Scrambled PolygonTime Limit:1000MSMemory Limit:30000KTotal Submissions:4906Accepted:2327DescriptionA closed polygon is a figure bounded by a finite number of line segments. The intersections of the bounding line segments are called the vertices of the polygon. When one starts at any vertex of a clos 阅读全文
posted @ 2012-05-07 11:19 Stephen Li 阅读(356) 评论(0) 推荐(0) 编辑
摘要: Election TimeTime Limit:1000MSMemory Limit:65536KTotal Submissions:5420Accepted:2944DescriptionThe cows are having their first election after overthrowing the tyrannical Farmer John, and Bessie is one ofNcows (1 ≤N≤ 50,000) running for President. Before the election actually happens, however, Bessie 阅读全文
posted @ 2012-05-07 10:32 Stephen Li 阅读(861) 评论(0) 推荐(0) 编辑
摘要: IntersectionTime Limit:1000MSMemory Limit:10000KTotal Submissions:7609Accepted:1989DescriptionYou are to write a program that has to decide whether a given line segment intersects a given rectangle.An example:line: start point: (4,9)end point: (11,2)rectangle: left-top: (1,5)right-bottom: (7,1)Figur 阅读全文
posted @ 2012-05-06 21:37 Stephen Li 阅读(1089) 评论(0) 推荐(0) 编辑
摘要: TriangleTime Limit:1000MSMemory Limit:65536KTotal Submissions:3627Accepted:1586DescriptionAlattice pointis an ordered pair (x,y) wherexandyare both integers. Given the coordinates of the vertices of a triangle (which happen to be lattice points), you are to count the number of lattice points which l 阅读全文
posted @ 2012-05-06 19:58 Stephen Li 阅读(374) 评论(0) 推荐(0) 编辑
摘要: Costume PartyTime Limit:1000MSMemory Limit:65536KTotal Submissions:9132Accepted:3552DescriptionIt's Halloween! Farmer John is taking the cows to a costume party, but unfortunately he only has one costume. The costume fits precisely two cows with a length ofS(1 ≤S≤ 1,000,000). FJ hasNcows (2 ≤N≤ 阅读全文
posted @ 2012-05-06 17:47 Stephen Li 阅读(775) 评论(0) 推荐(0) 编辑
摘要: Beauty ContestTime Limit:3000MSMemory Limit:65536KTotal Submissions:19373Accepted:5850DescriptionBessie, Farmer John's prize cow, has just won first place in a bovine beauty contest, earning the title 'Miss Cow World'. As a result, Bessie will make a tour of N (2 <= N <= 50,000) fa 阅读全文
posted @ 2012-05-06 17:12 Stephen Li 阅读(270) 评论(0) 推荐(0) 编辑
上一页 1 2 3 4 5 6 7 8 9 ··· 15 下一页