 Local area network

Problem Description
A local area network (LAN) supplies networking capability to a group of computers in close proximity to each other such as in an office building, a school, or a home. A LAN is useful for sharing resources like files, printers, games or other applications. A LAN in turn often connects to other LANs, and to the Internet or other WAN.
In this contest, everybody is connecting with each others like the following figure.The contest’s network was built as N rows and M columns, your computer locate at (0, 0) and the judger’s computer locate at (m1, n1) The code you submit would only transfer to up or right smoothly. It doesn’t matter if some accidents happened. Could you tell me how many ways from your computer to judger when a data wire was broken?
Input
There are multiple cases. Every case contains two integers in the first line, N, M (3<=N+M<=40). Second line contains four integers X1, Y1, X2, Y2 (0<=X1, X2<M, 0<=Y1, Y2<N, X1+Y1X2Y2=1), meaning the broken wire position.Output
Print the answer in one line.Sample Input
3 3
0 0 1 0Sample Output
3
 其他相关推荐
 Local area network
 Problem DescriptionnA local area network (LAN) supplies networking capability to a group of computers in close proximity to each other such as in an office building, a school, or a home. A LAN is useful for sharing resources like files, printers, games or other applications. A LAN in turn often connects to other LANs, and to the Internet or other WAN. nIn this contest, everybody is connecting with each others like the following figure.nnnnnThe contest’s network was built as N rows and M columns, your computer locate at (0, 0) and the judger’s computer locate at (m1, n1) The code you submit would only transfer to up or right smoothly. It doesn’t matter if some accidents happened. Could you tell me how many ways from your computer to judger when a data wire was broken?nn nnInputnThere are multiple cases. Every case contains two integers in the first line, N, M (3<=N+M<=40). Second line contains four integers X1, Y1, X2, Y2 (0<=X1, X2
 局域网（Local Area Network，LAN）
 局域网（Local Area Network，LAN）是指在某一区域内由多台计算机互联成的计算机组。一般是方圆几千米以内。局域网可以实现文件管理、应用软件共享、打印机共享、工作组内的日程安排、电子邮件和传真通信服务等功能。局域网是封闭型的，可以由办公室内的两台计算机组成，也可以由一个公司内的上千台计算机组成。
 VLAN(Virtual Local Area Network)
 VLAN(Virtual Local Area Network) 详细描述了VLAN的各种格式等。
 VLAN（Virtual Local Area Network）划分
 VLAN（Virtual Local Area Network）的中文名为"虚拟局域网"。VLAN是一种将局域网设备从逻辑上划分成一个个网段，从而实现虚拟工作组的新兴数据交换技术。这一新兴技术主要应用于交换机和路由器中，但主流应用还是在交换机之中。但又不是所有交换机都具有此功能，只有VLAN协议的第三层以上交换机才具有此功能，这一点可以查看相应交换机的说明书即可得知
 Virtual eXtensible Local Area Network (VXLAN)简介
 本文介绍rfc4348 Virtual eXtensible Local Area Network (VXLAN): A Frameworkfor Overlaying Virtualized Layer 2 Networks over Layer 3 Networks VXLAN技术是一种大二层的虚拟网络技术，主要的技术原理就是引入一个UDP格式的外层隧道，作为数据的链路层，而原有数据报文内容作为隧道净荷来传输。由于外层采用了UDP作为传输手段，就可以让净荷数据轻而易举的在二三层网络中传送，为了能够支持原有VLAN广播域寻址能力，VXLAN还引入了三层IP组播来代替以太网的广播，让BUM（Broadcast广播，unknown unicast， multicast）报文通过广播方式在虚拟网络中传送
 Wide area network
 CCNA(Cisco Certified Network Associate)认证是Cisco售后工程师认证体系的入门认证，也是Cisco各项认证中级别低的技术认证，通过CCNA认证可证明你已掌握网络的基本知识，并能初步安装、配置和操作Cisco路由器、交换机及简单的LAN和WAN。此套课程也是进入网络行业的极佳的入门课程，从网络基础到基本配置，应有尽有。
 switch local network and wireless
 可自由切换本地连接与无线网络，同样的从无线网络到本地连接的方式，只需稍微修改一下里面的本地连接名称，无线网络连接名称，以及无线网络的SID与密码即可使用。注意，使用时以管理员方式运行。本代码适用于需要频繁切换内网与外网的用户，以便能服务逻辑隔绝数据的目的。 排除网络上目前所有不能用的代码，此版本为目前发现的第一个可以用来快速切换的代码！ 请给予支持啊！
 Designing an IBM Storage Area Network
 Designing an IBM Storage Area Network
 Introduction to the Controller Area Network (CAN)
 Introduction to the Controller Area Network (CAN). How to Make a basic CAN bus using TI CAN transceivers and DSP's
 Networking Fundamentals: Wide, Local and Personal Area Communications
 Focusing on the physical layer, Networking Fundamentals provides essential information on networking technologies that are used in both wired and wireless networks designed for local area networks (LANs) and wide–area networks (WANs).
 區域網路控制CAN network (Controller Area Network) Brief Introduction
 區域網路控制 CAN network (Controller Area Network) 傳統式的線路採用點對點的方式來傳遞彼此之間的訊息，現今的電子配備及功能日益增加，各控制單元必須傳遞的資訊大幅度增加，這使得電路的設計被迫複雜化，同時也使得電路的檢測複雜化。 區域網路控制CAN network (Controller Area Network) 便因此出現，並且有效的與傳統的線路相結合，使原本必須複雜化的問題得到了解決，並且也解決了在車上控制單元互相溝通傳遞訊息管理上的問題，
 CAN 是Controller Area Network 的缩写.doc
 C:\Documents and Settings\Administrator\桌面\CAN 是Controller Area Network 的缩写.doc
 Networkers2009：BRKDCT3708  Advanced Storage Area Network Troubleshooting
 Networkers2009：BRKDCT3708  Advanced Storage Area Network Troubleshooting
 车载网络: CAN (Control Area Network) 控制器局域网络
 概述CAN，全称 控制器局域网络 (Controller Area Network, CAN)，是由以研发和生产汽车电子产品著称的德国BOSCH公司开发的，并最终成为 国际标准（ISO 11898），是国际上应用最广泛的现场总线之一。CAN工作方式通过一种类似于“会议”的机制实现通信。每一个会议参与人员都可以自由地提出会议议题（多主通信模式） [1]。诞生为了解决现代汽车中众多控制器及测试仪器之间的
 LIN Local Interconnect Network（lin规范）
 LIN Local Interconnect Network 是低成本的汽车网络它是现有多种汽车网络在功能上的补充 由于能够提高质量降低成本LIN 将是在汽车中使用汽车分级网络的启动因素LIN 的标准化将简化多种 现存的多点解决方案且将降低在汽车电子领域中的开发生产服务和后勤成本
 Service Host: Local System(network restricted)
 如题。 我的电脑在昨晚插入android手机之后自动安装了驱动，然后不知道为什么我的电脑上网就受到了影响，可以说是断断续续能上，之前不会这样。看了任务管理器后见到许多如题的进程，后面还有跟着（10），（7）之类的，就是Service Host: Local System(network restricted)（10）像这样。我想问下是不是装了手机驱动能影响到，还有就是我在前晚装了虚拟机，我不知道这个也能不能影响，或者说具体是哪个影响到冲突了，求大神解答啊！急！我的电脑系统是win8 64bit， 虚拟机是vmware workstation，装的xp 32bit系统,手机插得是三星Galaxy S4。求大神解答啊，希望能得到解决方案啊！
 FreeBSD7出现大量arplookup...host is not on local network错误
 arplookup 60.12.225.183 failed: host is not on local network rnarplookup 60.191.105.183 failed: host is not on local network rnarplookup 60.12.225.183 failed: host is not on local network rnarplookup 60.191.105.183 failed: host is not on local network rnarp: 60.12.230.129 moved from 00:0f:e2:31:8a:d0 to 00:d0:05:6c:34:0a on em0 rnarp: 60.12.230.129 moved from 00:d0:05:6c:34:0a to 00:0f:e2:31:8a:d0 on em0 rnrn服务器放在机房，最近大量地出现这些错误，访问WEB时有时会打不开。 rn这几个IP不是我的，而且错误日志换来换去就这几个IP。似乎是同一个域内的。 rnrn请问大家这是怎么回事，我应该如何解决？rnrnFreeBSD 7
 Area
 Problem Descriptionn电子科大清水河校区是电子科大大力兴建的未来主校区，于07年秋正式迎接学生入住，目前有07、08级本科生及部分研究生在此校区学习、生活。n清水河校区位于成都高新西区的中部地带，占地约3128亩。从空中看，新校区的整体像一个长方形，南北长，东西窄。一条水渠从西北角的顶点注入，笔直的延伸到南面围墙的大概三分之一分点的地方，由此流出学校。位于这条水渠和西墙之间的是研究院，最南面的是学术交流中心和接待中心。n在本题中，假设清水河校区是一个凸多边形，水渠是一条直线，要求给出清水河校区被水渠分割成的两部分的面积。n n nnInputn输入包含多组数据。每组数据第一行是一个整数N(3<=N<=20)，表示清水河校区的边数，N=0表示输入结束。随后有N行，每行有两个整数X，Y（0<=X,Y<=10000），按顺时针顺序给出清水河校区的每个顶点的坐标。最后一行包含四个整数X0,Y0,X1,Y1,(0<= X0,Y0,X1,Y1<=10000)，表示水渠上的两个点的(X0,Y0)，(X1,Y1)的坐标，保证这两个点一定不会重合，同时保证水渠一定穿过清水河校区。n nnOutputn对每组数据，输出一行，按大小顺序输出清水河校区被水渠分割成的两部分的面积。面积大者在前面输出。(输出部分要四舍五入到整数)！n nnSample Inputn4n0 0n0 100n100 100n100 0n10 0 15 5n0n nnSample Outputn5950 4050
 area
 rn rn rn rnrnrn为何area背景图片无法显示？
 about client area and nonclient area
 窗口都有客户区和非客户区，那么客户区和非客户区的大小是系统固定的还是用户可调的，如果可调，是不是在WM_NCCALCSIZE中处理，如何处理？欢迎大家讨论。
 ISO 11898 Road vehiclesController area network(CAN) 英文全集
 ISO 1189812003 Road vehiclesController area network(CAN)Part 1：Data link layer and physical signalling ISO 1189822003 Road vehiclesController area network(CAN)Part 2：Highspeed medium access unit ISO 1189832006 Road vehiclesController area network(CAN)Part 3：Lowspeed，faulttolerant，mediumdependent interface ISO 1189842004 Road vehiclesController area network(CAN)Part 4：Timetriggered communication ISO 1189852007 Road vehiclesController area network(CAN)Part 5：Highspeed medium access unit with lowpower mode
 Networkers2009：BRKDCT2003  Storage Area Network Extension Design and Operation
 Networkers2009：BRKDCT2003  Storage Area Network Extension Design and Operation
 ISO 11898 Road vehicles  Controller area network(CAN)
 ISO 11898 consists of the following parts, under the general title Road vehicles  Controller area network (CAN):  Part 1: Data link layer adn physical signalling  Part 2: Highspeed medium access unit  Part 3: Lowspeed, faulttolerant, mediumdependent interface  Part 4: Timetriggered communication  Part 5: Highspeed medium access unit with lowpower mode  Part 6: Highspeed medium access unit with selective wakeup functionality
 local svr local svr
 local svr local svr
 local
 请问local 和localhome两个接口到底是干什么用的？能不能详细点？
 Area in Triangle
 DescriptionnnGiven a triangle field and a rope of a certain length (Figure1), you are required to use the rope to enclose a region within the field and make the region as large as possible. n![](http://poj.org/images/1927_1.jpg)nnInputnnThe input has several sets of test data. Each set is one line containing four numbers separated by a space. The first three indicate the lengths of the edges of the triangle field, and the fourth is the length of the rope. Each of the four numbers have exactly four digits after the decimal point. The line containing four zeros ends the input and should not be processed. You can assume each of the edges are not longer than 100.0000 and the length of the rope is not longer than the perimeter of the field.nOutputnnOutput one line for each case in the following format: nnCase i: X nnWhere i is the case number, and X is the largest area which is rounded to two digits after the decimal point. nSample Inputnn12.0000 23.0000 17.0000 40.0000n84.0000 35.0000 91.0000 210.0000n100.0000 100.0000 100.0000 181.3800n0 0 0 0nSample OutputnnCase 1: 89.35nCase 2: 1470.00nCase 3: 2618.00n
 Area 51
 DescriptionnnMichael and Nick are living near the famous topsecret "Area 51" facility. The facility is enclosed by a fence and is so large that for the purpose of this problem we consider the fence being a line that stretches infinitely into both directions. nnOnly extremely brave boys are not scared to go to the fence and peek at the facility. Nick is among the brave ones. He once came to the fence and saw a number of chimneys with distinct shapes. As a proof of his bravery he tells everybody what chimneys he saw from his left to his right. nnMichael's father is working at "Area 51" and has a facility's map at his home. Michael found this map and he can now verify Nick's claim of being near the facility's fence. However, it turns out to be complicated, and your task is to write a program to perform this verification. nnOn a map distinctly shaped chimneys are denoted by capital letters from A to Z. Each letter denotes a distinct shape, but chimneys with this shape can appear more than once on a map. The map uses Cartesian coordinate system oriented so that the fence is Ox axis and all chimneys are located on a halfplane with a positive y coordinate. All chimneys are considered to be points (their sizes and actual geometrical shapes are ignored for the purpose of this problem). nnNick claims that he looked from a point on the fence where no two chimneys were on the same line of his sight (a line that originates from his point of view). It means that at the point he looked from, all the chimneys he saw had a welldefined order from left to right. nnMichael have already made a preliminary verification of Nick's claim. He made sure that the number of distinctly shaped chimneys matches their number on the map. Now Michael needs to perform a final verification  to get a list of x coordinates on a fence (if any) where the corresponding arrangement of chimneys could be seen from. This information shall be presented as an ordered list of open intervals (a1, b1), (a2, b2), ..., (an, bn), so that a1 < b1 <= a2 < b2 <= ... <= an < bn. Asterisk symbol ("*") is used in place of a1 and/or bn to denote interval that extends to infinity on the left or on the right correspondingly. nnNote, that bi = ai+1 = x in case where Nick could not have been at the point x on a fence, because he would have seen more than one chimney on a single line of his sight, but being to the left or to the right of x yields the order of chimneys that he saw.nInputnnThe first line of the input contains an integer number m  the number of chimneys at the "Area 51" facility (1 <= m <= 100). The second line of the input file contains a string of m letters from A to Z that describe the chimneys that Nick saw from his left to his right. A single letter can be used more than once (if Nick saw the same shape more than once). Then follow m lines that describe chimneys on the map. Each line contains three tokens separated by spaces  chimney shape letter (from A to Z), and two integers xi and yi  chimney coordinates (100 <= xi <= 100, 0 <= yi <= 100). On these m lines letters appear in arbitrary order, but each letter from A to Z appears the same number of times as on the second line of the input. No two chimneys have the same coordinates.nOutputnnWrite to the first line of the output a single integer number n  the number of intervals that describe x coordinates on a fence where Nick could have seen the corresponding arrangement of chimneys from. Write to the second line of the output file 2n numbers a1, b1, ... , an, bn using "*" instead of a number a1 and/or bn to denote infinity. Numbers must be precise up to 106.nSample Inputnn4nCDDCnC 0 7nD 4 5nC 2 1nD 2 3nSample Outputnn3n* 11 11 3.5 14 *
 Convex area
 DescriptionnnA 3dimensional shape is said to be convex if the line segment joining any two points in the shape is entirely contained within the shape. Given a general set of points X in 3dimensional space, the convex hull of X is the smallest convex shape containing all the points.nnFor example, consider X = (0, 0, 0), (10, 0, 0), (0, 10, 0), (0, 0, 10). The convex hull of X is the tetrahedron with vertices given by X. Note that the tetrahedron contains the point (1, 1, 1), so even if this point were added to X, the convex hull would not change.nnGiven X, your task is to find the surface area of the convex hull of X, rounded to the nearest integer.nnNOTE: The convex hull of any point set will have polygonal faces. For this problem, you may assume there will be at most 3 points in X on any face of the convex hull.nnInputnnThe input test file will contain multiple test cases, each of which begins with an integer n (4 ≤ n ≤ 25) indicating the number of points in X. This is followed by n lines, each containing 3 integers giving the x, y and z coordinate of a single point. All coordinates are between −100 and 100 inclusive. The endoffile is marked by a test case with n = 0 and should not be processed.nnOutputnnFor each test case, write a single line with the surface area of the convex hull of the given points. The answer should be rounded to the nearest integer (e.g., 2.499 rounds to 2, but 2.5 rounds to 3).nnSample Inputnn5n0 0 0n10 0 0n0 10 0n0 0 10n1 1 1n9n0 0 0n2 0 0n2 2 0n0 2 0n1 1 2n1 1 2n1 1 1n1 1 0n1 1 1n0nSample Outputnn237n18
 Grey Area
 Problem DescriptionnDr. Grey is a data analyst, who visualizes various aspects of data received from all over the world everyday. He is extremely good at sophisticated visualization tools, but yet his favorite is a simple selfmade histogram generator.nn![](http://acm.hdu.edu.cn/data/images/C38410001.jpg)nFigure 1: A histogramnnFigure 1 is an example of histogram automatically produced by his histogram generator. A histogram is a visual display of frequencies of value occurrences as bars. In this example, values in the interval 0–9 occur five times, those in the interval 10–19 occur three times, and 20–29 and 30–39 once each. Dr. Grey’s histogram generator is a simple tool. First, the height of the histogram is fixed, that is, the height of the highest bar is always the same and those of the others are automatically adjusted proportionately. Second, the widths of bars are also fixed. It can only produce a histogram of uniform intervals, that is, each interval of a histogram should have the same width (10 in the above example). Finally, the bar for each interval is painted in a grey color, where the colors of the leftmost and the rightmost intervals are black and white, respectively, and the darkness of bars monotonically decreases at the same rate from left to right. For instance, in Figure 1, the darkness levels of the four bars are 1, 2/3, 1/3, and 0, respectively. In this problem, you are requested to estimate ink consumption when printing a histogram on paper. The amount of ink necessary to draw a bar is proportional to both its area and darkness.n nnInputnThe input consists of multiple datasets, each of which contains integers and specifies a value table and intervals for the histogram generator, in the following format:nnwnv1nv2n.n.n.nvnnn is the total number of value occurrences for the histogram, and each of the n lines following the first line contains a single value. Note that the same value may possibly occur multiple times. w is the interval width. A value v is in the first (i.e. leftmost) interval if 0 ≤ v
 shape area
 一个帮助理解java抽象类的概念和应用的实例小程序。
 Area Ratio
 To make things easier, WishingBone decides to put this simple geometry problem at the beginning. Given a triangle, what is the ratio of the area of its inscribed circle to that of its circum circle?nnnnInputnn9 integers x1 y1 z1 x2 y2 z2 x3 y3 z3 on one line (1000 <= x, y, z <= 1000), the three coordinates of the triangle. The three coordinates will not appear collinear.nnProcess to the end of file.nnnOutputnnOne ratio per line, exact to three digits to the right of the decimal point.nnnSample Inputnn0 0 0 0 0 1 0 1 0nnnSample Outputnn0.172
 Area of Polycubes
 Problem DescriptionnA polycube is a solid made by gluing together unit cubes (one unit on each edge) on one or more faces. The figure in the lowerleft is not a polycube because some cubes are attached along an edge.nn![](http://acm.hdu.edu.cn/data/images/C17810071.jpg)nFor this problem, the polycube will be formed from unit cubes centered at integer lattice points in 3space. The polycube will be built up one cube at a time, starting with a cube centered at (0,0,0). At each step of the process (after the first cube), the next cube must have a face in common with a cube previously included and not be the same as a block previously included. For example, a 1by1by5 block (as shown above in the upperleft polycube) could be built up as:nn(0,0,0) (0,0,1) (0,0,2) (0,0,3) (0,0,4)nnand a 2by2by2 cube (upperright figure) could be built as:nn(0,0,0) (0,0,1) (0,1,1) (0,1, 0) (1,0,0) (1,0,1) (1,1,1) (1,1, 0)nnSince the surface of the polycube is made up of unit squares, its area is an integer.nnWrite a program which takes as input a sequence of integer lattice points in 3space and determines whether is correctly forms a polycube and, if so, what the surface area of the polycube is.n nnInputnThe first line of input contains a single integer N, (1 ≤ N ≤ 1000) which is the number of data sets that follow. Each data set consists of multiple lines of input. The first line contains the number of points P, (1 ≤ P ≤ 100) in the problem instance. Each succeeding line contains the centers of the cubes, eight to a line (except possibly for the last line). Each center is given as 3 integers, separated by commas. The points are separated by a single space.n nnOutputnFor each data set, you should generate one line of output with the following values: The data set number as a decimal integer (start counting at one), a space and the surface area of the polycube if it is correctly formed, OR, if it is not correctly formed, the string "NO" a space and the index (starting with 1) of the first cube which does not share a face with a previous cube. Note that the surface area includes the area of any included holes.n nnSample Inputn4 n5 n0,0,0 0,0,1 0,0,2 0,0,3 0,0,4 n8 n0,0,0 0,0,1 0,1,0 0,1,1 1,0,0 1,0,1 1,1,0 1,1,1n4 n0,0,0 0,0,1 1,1,0 1,1,1 n20 n0,0,0 0,0,1 0,0,2 0,1,2 0,2,2 0,2,1 0,2,0 0,1,0n1,0,0 2,0,0 1,0,2 2,0,2 1,2,2 2,2,2 1,2,0 2,2,0n2,1,0 2,1,2 2,0,1 2,2,1 n nnSample Outputn1 22 n2 24 n3 NO 3 n4 72
 area图
 熟练使用jQuery HighchartTable 插件开发饼状图、柱状图、线形图等图表
 创建第一个 local network（I）  每天5分钟玩转 OpenStack（80）
 在 ML2 配置文件中 enable local network 后，本节将开始创建第一个 local network。
 创建第二个 local network  每天5分钟玩转 OpenStack（84）
 普通用户和 admin 用不同的方式创建 network。 前面用普通用户方式创建了 "first_local_net"，本节将以 admin 方式创建 "second_local_net"。
 WinXP下如何结束用户名为local service和network的svchost服务
 今天下午安装了WinXP,感觉比以前慢多了，打开Windows任务管理器rn一看才知道，那个svchost .exe system cpu 50% rn结果使得CPU的占用率一直维持在80%左右，难怪我运行软件rn很慢，那个svchost 在任务管理器中有四个项，其中只有一个rn显示为 用户名为“local server”,另一项显示为"net work"rn其余两个为system,rn就只有那个local server占CPU最多，请问如何永久地结束它的运行！！！rn
 Service Host: Local System(Network Restricted)(7)占用大量CPU
 Windows 8系统下Service Host: Local System(Network Restricted)(7)进程占用大量CPU，求大神协助解决rnrn[img=https://imgbbs.csdn.net/upload/201502/04/1423019189_431928.jpg][/img]
 SQL Server Express安装问题请教服务账户:Local system/Network service/Local Service
 安装到服务账户界面时候，出现三个服务账户选择，这三个账户分别是什么含义？rnrn内置系统账户:Local system/Network service/Local Servicernrn谢谢！
 创建第一个 local network（II） 每天5分钟玩转 OpenStack（81）
 上一节通过 Web GUI 创建了 “first_local_net”，本节我们需要搞清楚底层网络结构有了哪些变化？
 Area K
 Problem DescriptionnYou, and a group of other scientists, have recently discovered strange gravity anomalies on the planet Alderaan. Further analysis shows that the gravity anomalies are caused by some asteroids floating in orbit. The strange positioning of the asteroids notwithstanding, all scientists except you had decided that this is not a matter worthy of attention and departed to continue research on other places. On the other hand, you believe with pure heart that this is not merely a random event, and landed on the surface of Alderaan to continue your study.nAfter doing some scanning, you have recorded the positions of all asteroids on your navigation computer as points in a threedimensional Cartesian system. Interestingly, the data shown by your scanning system indicates that there is some sort of force field around each asteroid – more precisely, the shape of every asteroid’s force field is a regular hexahedron whose every face is perpendicular to one of the axis of the coordinate system, which further confirmed your belief that there is something serious going on here. To find out the source of all these, you have decided to do a series of research on the planet. nThe first research you have decided to conduct is to get the area of surface on the ground covered by exactly K asteroids’ force field. For simplicity, you can view the surface of Alderaan as the plane Z = 0.n nnInputnThere are multiple test cases in the input file. Each test case starts with one integer N (1 <= N <= 104), the number of asteroids in orbit. Each of the next N lines consists of four integers X, Y, Z and L (106<= X, Y <= 106, 0 < Z, L <= 106), describing the position of an asteroid and its edge length of the force field. The asteroid is just at the center of the hexahedron. The last part of each test case consists of one integer K (1 <= K <= N) followed by a blank line, meaning that you need to get the sum of areas on the ground affected by exactly K asteroids’ force fields.nThere is a blank line between two successive test cases. A single line with N = 0 indicates the end of input file.n nnOutputnFor each test case, output one real number on one separate line, the total area of surface covered by exactly K asteroids, in the format as indicated in the sample output.n nnSample Inputn2n1 0 1 2n0 1 1 2n1nn0n nnSample OutputnCase 1: 6.000n