2013年9月9日

The area(抛物线与直线的相交面积)

摘要: The area时间限制(普通/Java):3000MS/10000MS 运行内存限制:65536KByte 描述Ignatius bought a land last week, but he didn't know the area of the land because the land is enclosed by a parabola and a straight line. The picture below shows the area. Now given all the intersectant points shows in the picture, can you 阅读全文

posted @ 2013-09-09 21:11 落叶伴雨下 阅读(677) 评论(0) 推荐(0)

线段长度问题(简单题)

摘要: 线段长度问题时间限制(普通/Java):5000MS/10000MS 运行内存限制:65536KByte描述在数轴X轴上有n条线段,线段之间可以有重叠,计算所有线段覆盖X轴的总长度。 输入输入文件第一行为测试用例个数N(1#include#include#include#includeusing namespace std;typedef struct{ double x; double y;}P;bool func(P a,P b){ return (a.x>t; while(t--) { cin>>n; p = new P[n]; ... 阅读全文

posted @ 2013-09-09 21:01 落叶伴雨下 阅读(563) 评论(0) 推荐(0)

Jumping Cows

摘要: Jumping Cows时间限制(普通/Java):3000MS/10000MS 运行内存限制:65536KByte描述Farmer John's cows would like to jump over the moon, just like the cows in their favorite nursery rhyme. Unfortunately, cows can not jump. The local witch doctor has mixed up P (1 #include#include#include#includeusing namespace std;int 阅读全文

posted @ 2013-09-09 20:53 落叶伴雨下 阅读(329) 评论(0) 推荐(0)

Triangular Pastures

摘要: Triangular Pastures时间限制(普通/Java):3000MS/10000MS 运行内存限制:65536KByte描述Like everyone, cows enjoy variety. Their current fancy is new shapes for pastures. The old rectangular shapes are out of favor; new geometries are the favorite.I. M. Hei, the lead cow pasture architect, is in charge of creating a tri 阅读全文

posted @ 2013-09-09 20:44 落叶伴雨下 阅读(242) 评论(0) 推荐(0)

Human Gene Functions

摘要: Human Gene Functions时间限制(普通/Java):3000MS/10000MS 运行内存限制:65536KByte描述It is well known that a human gene can be considered as a sequence, consisting of four nucleotides, which are simply denoted by four letters, A, C, G, and T. Biologists have been interested in identifying human genes and determining 阅读全文

posted @ 2013-09-09 20:33 落叶伴雨下 阅读(272) 评论(0) 推荐(0)

Number Triangles

摘要: Number Triangles时间限制(普通/Java):5000MS/10000MS 运行内存限制:65536KByte描述Consider the number triangle shown below. Write a program that calculates the highest sum of numbers that can be passed on a route that starts at the top and ends somewhere on the base. Each step can go either diagonally down to the lef 阅读全文

posted @ 2013-09-09 20:19 落叶伴雨下 阅读(252) 评论(0) 推荐(0)

导航