参赛资格与报名：
1、参赛者的范围包括：各高校在校本科生、硕士生、博士生,以及被北京大学预录取的应届高三保送生;其他人员如欲报名,请先询组委会;
2、竞赛以组队形式进行,每支队伍一名、两名或三名队员,设队长一名;
3、参赛队在截止时间前下载报名表并提交,组委会在收到报名后会给予回复;
4、外校参赛队如有需要,可向组委会申请提供邀请函;
5、本次竞赛不收取报名费;
　
竞赛流程与规则： 
1、参赛者应当在竞赛的前一天查看竞赛网站,或检查报名时所留的邮箱,以了解第二天竞赛细节方面可能的变动,并阅读最新通知;
2、参赛者须携带以下证件进入考场：
  校园卡或学生证北京大学在校生
  学生证,和有效身份证件其它高校在校生
  学生证、北京大学预录取通知书,和有效身份证件应届高三保送生
  有效身份证件,是指以下证件之一：身份证、护照、往来港澳通行证,或户口簿仅适用于未满16周岁的参赛者;
3、参赛者可以携带书、手册、英语词典、程序清单等纸质参考资料；但不得携带任何电子媒质的资料,例如移动硬盘、U盘、光盘、电子词典等;
4、每支队伍只能使用一台计算机,所有队伍使用计算机的规格配置均相同;
5、竞赛时可能会提供打印服务,参赛者可向赛场工作人员提出;
6、竞赛当天提供饮用水、巧克力或其它食品,无需自备午餐;
　
评奖： 
1、参赛队正确解答试题的数量,是评奖的依据;
2、如果多支队伍解题数量相同,则根据总用时加上惩罚时间进行排名;总用时和惩罚时间由每道解答正确的试题的用时加上惩罚时间组成;每道试题用时将从竞赛开始到试题解答被判定为正确为止,期间每一次错误的提交将被加罚20分钟时间,未正确解答的试题不计时;
3、竞赛设一、二、三等奖,具体数量由组委会在竞赛结束后,根据结果决定;
4、竞赛设最佳女生奖,颁给排名最高的女生队;所谓女生队,是指所有队员均为女生的参赛队;
硬件平台： 
      CPU      HT
      RAM      1GB
      硬盘    80GB
      显示器  17英寸
      键盘    国际标准键盘
      鼠标    光电鼠标
　
软件平台：
      Windows 2000 Professional 或 Windows XP
      Microsoft Visual C++
      Eclipse
      Dev-C++
     
　
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 :
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  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
2
Source
         
预录取