2004ACM杯比赛往年试题集锦.docVIP

参赛资格与报名： 1、参赛者的范围包括：各高校在校本科生、硕士生、博士生，以及被北京大学预录取的应届高三保送生。其他人员如欲报名，请先询组委会。 2、竞赛以组队形式进行，每支队伍一名、两名或三名队员，设队长一名。 3、参赛队在截止时间前下载报名表并提交，组委会在收到报名后会给予回复。 4、外校参赛队如有需要，可向组委会申请提供邀请函。 5、本次竞赛不收取报名费。 　 竞赛流程与规则：? 1、参赛者应当在竞赛的前一天查看竞赛网站，或检查报名时所留的邮箱，以了解第二天竞赛细节方面可能的变动，并阅读最新通知。 2、参赛者须携带以下证件进入考场： ? * 校园卡或学生证（北京大学在校生） ? * 学生证，和有效身份证件（其它高校在校生） ? * 学生证、 ???? CPU????? 3.0GHz(HT) ???? RAM????? 1GB ???? 硬盘???? 80GB ???? 显示器?? 17英寸 ???? 键盘???? 国际标准键盘 ???? 鼠标???? 光电鼠标 　软件平台：???? Windows 2000 Professional 或 Windows XP ???? Microsoft Visual C++ 6.0 ???? Eclipse 3.2 ???? Dev-C++ 4.9.9.2 ?????? 　 Area Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 6845 Accepted: 1856 Description You are going to compute the area of a special kind of polygon. One vertex of the polygon is the origin of the orthogonal coordinate system. From this vertex, you may go step by step to the following vertexes of the polygon until back to the initial vertex. For each step you may go North, West, South or East with step length of 1 unit, or go Northwest, Northeast, Southwest or Southeast with step length of square root of 2. For example, this is a legal polygon to be computed and its area is 2.5: Input The first line of input is an integer t (1 = t = 20), the number of the test polygons. Each of the following lines contains a string composed of digits 1-9 describing how the polygon is formed by walking from the origin. Here 8, 2, 6 and 4 represent North, South, East and West, while 9, 7, 3 and 1 denote Northeast, Northwest, Southeast and Southwest respectively. Number 5 only appears at the end of the sequence indicating the stop of walking. You may assume that the input polygon is valid which means that the endpoint is always the start point and the sides of the polygon are not cross to each other.Each line may contain up to 1000000 digits. Output For each polygon, print its area on a single line. Sample Input 4 5 825 6725 6244865 Sample Output 0 0 0.5 2 Source POJ Monthly--2004.05.15 Liu Rujia@POJ [S