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_20613025_23036.cpp:4:21: error: stray '#' in program
     #define eps 1e-8#define PI 3.14159265358979323846using namespace std; struct pt{    double x, y;    double ang;    double p;};int n;int idx[1010];pt p[1010]; inline double toAng(double a, double b){    double ret = b - a;    if (ret >
                     ^
0_0_20613025_23036.cpp:5:13: note: in expansion of macro 'eps'
      2*PI - eps)        ret -= 2*PI;    return ret < -eps ? (ret + 2*PI) : ret;} bool cmp(int a, int b){    return p[a].ang < p[b].ang;} double calc(int a){    if (p[a].p < eps)        return 0.0;    double tp = 0.0;        int m = n - 1;    for (int i = 0; i < n; i++)    {        if (i != a)tp += log(1.0 - p[i].p);        p[i].ang = (i == a) ? 10.0 : atan2(p[i].y - p[a].y, p[i].x - p[a].x);    }    sort(idx, idx + n, cmp);    double noP = 0.0, ret = 0.0;    int r = 0;    for (int i = 0; i < n - 1; i++)    {        while (r - i < m && toAng(p[idx[i]].ang, p[idx[r%m]].ang) < PI)        {            noP += log(1.0 - p[idx[r%m]].p);            r++;        }        noP -= log(1.0 - p[idx[i]].p);        ret += p[idx[i]].p * exp(noP);    }    return p[a].p * (ret + exp(tp));} double solve(){    if (n == 1)        return p[0].p;    double ans = 0.0;    for (int i = 0; i < n; i++)    {        ans += calc(i);    }    return ans;} int main(){    while (~scanf("%d", &n))    {        for (int i = 0; i < n; i++)        {            scanf("%lf %lf %lf", &p[i].x, &p[i].y, &p[i].p);            p[i].p /= 100.0;            idx[i] = i;        }        printf("%.2lf\n", solve());    }    return 0;}
             ^
0_0_20613025_23036.cpp:4:21: error: stray '#' in program
     #define eps 1e-8#define PI 3.14159265358979323846using namespace std; struct pt{    double x, y;    double ang;    double p;};int n;int idx[1010];pt p[1010]; inline double toAng(double a, double b){    double ret = b - a;    if (ret >
                     ^
0_0_20613025_23036.cpp:5:55: note: in expansion of macro 'eps'
      2*PI - eps)        ret -= 2*PI;    return ret < -eps ? (ret + 2*PI) : ret;} bool cmp(int a, int b){    return p[a].ang < p[b].ang;} double calc(int a){    if (p[a].p < eps)        return 0.0;    double tp = 0.0;        int m = n - 1;    for (int i = 0; i < n; i++)    {        if (i != a)tp += log(1.0 - p[i].p);        p[i].ang = (i == a) ? 10.0 : atan2(p[i].y - p[a].y, p[i].x - p[a].x);    }    sort(idx, idx + n, cmp);    double noP = 0.0, ret = 0.0;    int r = 0;    for (int i = 0; i < n - 1; i++)    {        while (r - i < m && toAng(p[idx[i]].ang, p[idx[r%m]].ang) < PI)        {            noP += log(1.0 - p[idx[r%m]].p);            r++;        }        noP -= log(1.0 - p[idx[i]].p);        ret += p[idx[i]].p * exp(noP);    }    return p[a].p * (ret + exp(tp));} double solve(){    if (n == 1)        return p[0].p;    double ans = 0.0;    for (int i = 0; i < n; i++)    {        ans += calc(i);    }    return ans;} int main(){    while (~scanf("%d", &n))    {        for (int i = 0; i < n; i++)        {            scanf("%lf %lf %lf", &p[i].x, &p[i].y, &p[i].p);            p[i].p /= 100.0;            idx[i] = i;        }        printf("%.2lf\n", solve());    }    return 0;}
                                                       ^
0_0_20613025_23036.cpp:4:21: error: stray '#' in program
     #define eps 1e-8#define PI 3.14159265358979323846using namespace std; struct pt{    double x, y;    double ang;    double p;};int n;int idx[1010];pt p[1010]; inline double toAng(double a, double b){    double ret = b - a;    if (ret >
                     ^
0_0_20613025_23036.cpp:5:174: note: in expansion of macro 'eps'
      2*PI - eps)        ret -= 2*PI;    return ret < -eps ? (ret + 2*PI) : ret;} bool cmp(int a, int b){    return p[a].ang < p[b].ang;} double calc(int a){    if (p[a].p < eps)        return 0.0;    double tp = 0.0;        int m = n - 1;    for (int i = 0; i < n; i++)    {        if (i != a)tp += log(1.0 - p[i].p);        p[i].ang = (i == a) ? 10.0 : atan2(p[i].y - p[a].y, p[i].x - p[a].x);    }    sort(idx, idx + n, cmp);    double noP = 0.0, ret = 0.0;    int r = 0;    for (int i = 0; i < n - 1; i++)    {        while (r - i < m && toAng(p[idx[i]].ang, p[idx[r%m]].ang) < PI)        {            noP += log(1.0 - p[idx[r%m]].p);            r++;        }        noP -= log(1.0 - p[idx[i]].p);        ret += p[idx[i]].p * exp(noP);    }    return p[a].p * (ret + exp(tp));} double solve(){    if (n == 1)        return p[0].p;    double ans = 0.0;    for (int i = 0; i < n; i++)    {        ans += calc(i);    }    return ans;} int main(){    while (~scanf("%d", &n))    {        for (int i = 0; i < n; i++)        {            scanf("%lf %lf %lf", &p[i].x, &p[i].y, &p[i].p);            p[i].p /= 100.0;            idx[i] = i;        }        printf("%.2lf\n", solve());    }    return 0;}
                                                                                                                                                                              ^
0_0_20613025_23036.cpp:5:6: error: expected unqualified-id before numeric constant
      2*PI - eps)        ret -= 2*PI;    return ret < -eps ? (ret + 2*PI) : ret;} bool cmp(int a, int b){    return p[a].ang < p[b].ang;} double calc(int a){    if (p[a].p < eps)        return 0.0;    double tp = 0.0;        int m = n - 1;    for (int i = 0; i < n; i++)    {        if (i != a)tp += log(1.0 - p[i].p);        p[i].ang = (i == a) ? 10.0 : atan2(p[i].y - p[a].y, p[i].x - p[a].x);    }    sort(idx, idx + n, cmp);    double noP = 0.0, ret = 0.0;    int r = 0;    for (int i = 0; i < n - 1; i++)    {        while (r - i < m && toAng(p[idx[i]].ang, p[idx[r%m]].ang) < PI)        {            noP += log(1.0 - p[idx[r%m]].p);            r++;        }        noP -= log(1.0 - p[idx[i]].p);        ret += p[idx[i]].p * exp(noP);    }    return p[a].p * (ret + exp(tp));} double solve(){    if (n == 1)        return p[0].p;    double ans = 0.0;    for (int i = 0; i < n; i++)    {        ans += calc(i);    }    return ans;} int main(){    while (~scanf("%d", &n))    {        for (int i = 0; i < n; i++)        {            scanf("%lf %lf %lf", &p[i].x, &p[i].y, &p[i].p);            p[i].p /= 100.0;            idx[i] = i;        }        printf("%.2lf\n", solve());    }    return 0;}
      ^
0_0_20613025_23036.cpp: In function 'double toAng(double, double)':
0_0_20613025_23036.cpp:5:16: error: expected primary-expression before ')' token
      2*PI - eps)        ret -= 2*PI;    return ret < -eps ? (ret + 2*PI) : ret;} bool cmp(int a, int b){    return p[a].ang < p[b].ang;} double calc(int a){    if (p[a].p < eps)        return 0.0;    double tp = 0.0;        int m = n - 1;    for (int i = 0; i < n; i++)    {        if (i != a)tp += log(1.0 - p[i].p);        p[i].ang = (i == a) ? 10.0 : atan2(p[i].y - p[a].y, p[i].x - p[a].x);    }    sort(idx, idx + n, cmp);    double noP = 0.0, ret = 0.0;    int r = 0;    for (int i = 0; i < n - 1; i++)    {        while (r - i < m && toAng(p[idx[i]].ang, p[idx[r%m]].ang) < PI)        {            noP += log(1.0 - p[idx[r%m]].p);            r++;        }        noP -= log(1.0 - p[idx[i]].p);        ret += p[idx[i]].p * exp(noP);    }    return p[a].p * (ret + exp(tp));} double solve(){    if (n == 1)        return p[0].p;    double ans = 0.0;    for (int i = 0; i < n; i++)    {        ans += calc(i);    }    return ans;} int main(){    while (~scanf("%d", &n))    {        for (int i = 0; i < n; i++)        {            scanf("%lf %lf %lf", &p[i].x, &p[i].y, &p[i].p);            p[i].p /= 100.0;            idx[i] = i;        }        printf("%.2lf\n", solve());    }    return 0;}
                ^
0_0_20613025_23036.cpp:5:34: error: 'PI' was not declared in this scope
      2*PI - eps)        ret -= 2*PI;    return ret < -eps ? (ret + 2*PI) : ret;} bool cmp(int a, int b){    return p[a].ang < p[b].ang;} double calc(int a){    if (p[a].p < eps)        return 0.0;    double tp = 0.0;        int m = n - 1;    for (int i = 0; i < n; i++)    {        if (i != a)tp += log(1.0 - p[i].p);        p[i].ang = (i == a) ? 10.0 : atan2(p[i].y - p[a].y, p[i].x - p[a].x);    }    sort(idx, idx + n, cmp);    double noP = 0.0, ret = 0.0;    int r = 0;    for (int i = 0; i < n - 1; i++)    {        while (r - i < m && toAng(p[idx[i]].ang, p[idx[r%m]].ang) < PI)        {            noP += log(1.0 - p[idx[r%m]].p);            r++;        }        noP -= log(1.0 - p[idx[i]].p);        ret += p[idx[i]].p * exp(noP);    }    return p[a].p * (ret + exp(tp));} double solve(){    if (n == 1)        return p[0].p;    double ans = 0.0;    for (int i = 0; i < n; i++)    {        ans += calc(i);    }    return ans;} int main(){    while (~scanf("%d", &n))    {        for (int i = 0; i < n; i++)        {            scanf("%lf %lf %lf", &p[i].x, &p[i].y, &p[i].p);            p[i].p /= 100.0;            idx[i] = i;        }        printf("%.2lf\n", solve());    }    return 0;}
                                  ^
0_0_20613025_23036.cpp:4:22: error: expected ';' before 'define'
     #define eps 1e-8#define PI 3.14159265358979323846using namespace std; struct pt{    double x, y;    double ang;    double p;};int n;int idx[1010];pt p[1010]; inline double toAng(double a, double b){    double ret = b - a;    if (ret >
                      ^
0_0_20613025_23036.cpp:5:55: note: in expansion of macro 'eps'
      2*PI - eps)        ret -= 2*PI;    return ret < -eps ? (ret + 2*PI) : ret;} bool cmp(int a, int b){    return p[a].ang < p[b].ang;} double calc(int a){    if (p[a].p < eps)        return 0.0;    double tp = 0.0;        int m = n - 1;    for (int i = 0; i < n; i++)    {        if (i != a)tp += log(1.0 - p[i].p);        p[i].ang = (i == a) ? 10.0 : atan2(p[i].y - p[a].y, p[i].x - p[a].x);    }    sort(idx, idx + n, cmp);    double noP = 0.0, ret = 0.0;    int r = 0;    for (int i = 0; i < n - 1; i++)    {        while (r - i < m && toAng(p[idx[i]].ang, p[idx[r%m]].ang) < PI)        {            noP += log(1.0 - p[idx[r%m]].p);            r++;        }        noP -= log(1.0 - p[idx[i]].p);        ret += p[idx[i]].p * exp(noP);    }    return p[a].p 


Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2024 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000000(s) query 1, Server time : 2024-06-17 15:17:53, Gzip enabled