F.A.Q
Hand In Hand
Online Acmers
Problem Archive
Realtime Judge Status
Authors Ranklist
 
     C/C++/Java Exams     
ACM Steps
Go to Job
Contest LiveCast
ICPC@China
Best Coder beta
VIP | STD Contests
    DIY | Web-DIY beta
Author ID 
Password 
 Register new ID

View Compilation Error

0_0_18475251_10484.cpp:1:10: error: #include expects "FILENAME" or <FILENAME>
 #include #include using namespace std;//用于存储坐标的结构体struct POINT{int x; int y;};//主函数int main(void) {    //dRad为180/pi,用于弧度到角度的转换,    const float fRad = 57.295779513082320876798154814105f;    //dMax为cos(0.01),任何大于此值的参数都不能进行acos    const float fMax = 0.99999998476912904932780850903444f;    //循环处理每一组输入的数据,d为直径,x和y为观查者坐标    for (float d, x, y; cin  d  x  y && d != 0; ) {        //将所有值放大100倍并取整,一可加快运算,二可保证精度        POINT Eye = {int(x * 100 + 0.5), int(y * 100 + 0.5)};        int nDiam = (int)(d * 100 + 0.5), nCnt = 0;        //依次由里圈向外层层遍例每棵树,检查是否被里面的树遮挡        for (int iBeg = 0, iEnd = 100; iEnd = fMax) { //夹角不能大于cos(0.01)                                break;                            }                            //求出夹角角度                            float fAng = acos(fACOS) * fRad;                            //分别计算两棵树干自身与眼睛形成的的夹角                            fNMod = asin((float)nDiam / 2.0f / fNMod) * fRad;                            fFMod = asin((float)nDiam / 2.0f / fFMod) * fRad;                            //判断是否遮挡,如果有则跳出循环                            if (fAng - fNMod - fFMod  iEnd - 100);                }            }        }        //输出结果        cout 转自:http://www.cnblogs.com/devymex/archive/2010/08/18/1801968.html                              
          ^


Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2025 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.001000(s) query 1, Server time : 2025-01-11 01:13:15, Gzip enabled