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_20613568_4234.cpp:10:20: error: '#' is not followed by a macro parameter
     #define mem(a,b) memset(a,b,sizeof(a))#define lson i<<1,l,mid#define rson i<<1|1,mid+1,r#define INF 510010#define maxn 400010using namespace std;typedef long long ll;typedef unsigned long long ull;ll p[1010];ll prime[30]= {2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53};void getartprime(ll cur,int cnt,int limit,int k){    if(cur>
                    ^
0_0_20613568_4234.cpp:11:6: error: expected unqualified-id before numeric constant
     (1LL<<60) || cnt>150) return ;    if(p[cnt]!=0 && p[cnt]>cur)        p[cnt]=cur;    if(p[cnt]==0)        p[cnt]=cur;    ll temp=cur;    for(int i=1; i<=limit; i++)     {        temp=temp*prime[k];        if(temp>(1LL<<60)) return;        getartprime(temp,cnt*(i+1),i,k+1);    }}int main(){    int n;    getartprime(1,1,75,0);    for(int i=1; i<=75; i++)    {        if(p[i*2-1]!=0 && p[i*2]!=0)            p[i]=min(p[i*2-1],p[i*2]);        else if(p[i*2]!=0) p[i]=p[i*2];        else p[i]=p[i*2-1];    }    while(scanf("%d",&n),n)        printf("%I64d\n",p[n]);    return 0;}
      ^
0_0_20613568_4234.cpp:11:6: error: expected ')' before numeric constant
0_0_20613568_4234.cpp:11:39: error: expected unqualified-id before 'if'
     (1LL<<60) || cnt>150) return ;    if(p[cnt]!=0 && p[cnt]>cur)        p[cnt]=cur;    if(p[cnt]==0)        p[cnt]=cur;    ll temp=cur;    for(int i=1; i<=limit; i++)     {        temp=temp*prime[k];        if(temp>(1LL<<60)) return;        getartprime(temp,cnt*(i+1),i,k+1);    }}int main(){    int n;    getartprime(1,1,75,0);    for(int i=1; i<=75; i++)    {        if(p[i*2-1]!=0 && p[i*2]!=0)            p[i]=min(p[i*2-1],p[i*2]);        else if(p[i*2]!=0) p[i]=p[i*2];        else p[i]=p[i*2-1];    }    while(scanf("%d",&n),n)        printf("%I64d\n",p[n]);    return 0;}
                                       ^
0_0_20613568_4234.cpp:11:89: error: expected unqualified-id before 'if'
     (1LL<<60) || cnt>150) return ;    if(p[cnt]!=0 && p[cnt]>cur)        p[cnt]=cur;    if(p[cnt]==0)        p[cnt]=cur;    ll temp=cur;    for(int i=1; i<=limit; i++)     {        temp=temp*prime[k];        if(temp>(1LL<<60)) return;        getartprime(temp,cnt*(i+1),i,k+1);    }}int main(){    int n;    getartprime(1,1,75,0);    for(int i=1; i<=75; i++)    {        if(p[i*2-1]!=0 && p[i*2]!=0)            p[i]=min(p[i*2-1],p[i*2]);        else if(p[i*2]!=0) p[i]=p[i*2];        else p[i]=p[i*2-1];    }    while(scanf("%d",&n),n)        printf("%I64d\n",p[n]);    return 0;}
                                                                                         ^
0_0_20613568_4234.cpp:11:125: error: 'll' does not name a type
     (1LL<<60) || cnt>150) return ;    if(p[cnt]!=0 && p[cnt]>cur)        p[cnt]=cur;    if(p[cnt]==0)        p[cnt]=cur;    ll temp=cur;    for(int i=1; i<=limit; i++)     {        temp=temp*prime[k];        if(temp>(1LL<<60)) return;        getartprime(temp,cnt*(i+1),i,k+1);    }}int main(){    int n;    getartprime(1,1,75,0);    for(int i=1; i<=75; i++)    {        if(p[i*2-1]!=0 && p[i*2]!=0)            p[i]=min(p[i*2-1],p[i*2]);        else if(p[i*2]!=0) p[i]=p[i*2];        else p[i]=p[i*2-1];    }    while(scanf("%d",&n),n)        printf("%I64d\n",p[n]);    return 0;}
                                                                                                                             ^
0_0_20613568_4234.cpp:11:141: error: expected unqualified-id before 'for'
     (1LL<<60) || cnt>150) return ;    if(p[cnt]!=0 && p[cnt]>cur)        p[cnt]=cur;    if(p[cnt]==0)        p[cnt]=cur;    ll temp=cur;    for(int i=1; i<=limit; i++)     {        temp=temp*prime[k];        if(temp>(1LL<<60)) return;        getartprime(temp,cnt*(i+1),i,k+1);    }}int main(){    int n;    getartprime(1,1,75,0);    for(int i=1; i<=75; i++)    {        if(p[i*2-1]!=0 && p[i*2]!=0)            p[i]=min(p[i*2-1],p[i*2]);        else if(p[i*2]!=0) p[i]=p[i*2];        else p[i]=p[i*2-1];    }    while(scanf("%d",&n),n)        printf("%I64d\n",p[n]);    return 0;}
                                                                                                                                             ^
0_0_20613568_4234.cpp:11:154: error: 'i' does not name a type
     (1LL<<60) || cnt>150) return ;    if(p[cnt]!=0 && p[cnt]>cur)        p[cnt]=cur;    if(p[cnt]==0)        p[cnt]=cur;    ll temp=cur;    for(int i=1; i<=limit; i++)     {        temp=temp*prime[k];        if(temp>(1LL<<60)) return;        getartprime(temp,cnt*(i+1),i,k+1);    }}int main(){    int n;    getartprime(1,1,75,0);    for(int i=1; i<=75; i++)    {        if(p[i*2-1]!=0 && p[i*2]!=0)            p[i]=min(p[i*2-1],p[i*2]);        else if(p[i*2]!=0) p[i]=p[i*2];        else p[i]=p[i*2-1];    }    while(scanf("%d",&n),n)        printf("%I64d\n",p[n]);    return 0;}
                                                                                                                                                          ^
0_0_20613568_4234.cpp:11:164: error: 'i' does not name a type
     (1LL<<60) || cnt>150) return ;    if(p[cnt]!=0 && p[cnt]>cur)        p[cnt]=cur;    if(p[cnt]==0)        p[cnt]=cur;    ll temp=cur;    for(int i=1; i<=limit; i++)     {        temp=temp*prime[k];        if(temp>(1LL<<60)) return;        getartprime(temp,cnt*(i+1),i,k+1);    }}int main(){    int n;    getartprime(1,1,75,0);    for(int i=1; i<=75; i++)    {        if(p[i*2-1]!=0 && p[i*2]!=0)            p[i]=min(p[i*2-1],p[i*2]);        else if(p[i*2]!=0) p[i]=p[i*2];        else p[i]=p[i*2-1];    }    while(scanf("%d",&n),n)        printf("%I64d\n",p[n]);    return 0;}
                                                                                                                                                                    ^
0_0_20613568_4234.cpp:11:282: error: expected declaration before '}' token
     (1LL<<60) || cnt>150) return ;    if(p[cnt]!=0 && p[cnt]>cur)        p[cnt]=cur;    if(p[cnt]==0)        p[cnt]=cur;    ll temp=cur;    for(int i=1; i<=limit; i++)     {        temp=temp*prime[k];        if(temp>(1LL<<60)) return;        getartprime(temp,cnt*(i+1),i,k+1);    }}int main(){    int n;    getartprime(1,1,75,0);    for(int i=1; i<=75; i++)    {        if(p[i*2-1]!=0 && p[i*2]!=0)            p[i]=min(p[i*2-1],p[i*2]);        else if(p[i*2]!=0) p[i]=p[i*2];        else p[i]=p[i*2-1];    }    while(scanf("%d",&n),n)        printf("%I64d\n",p[n]);    return 0;}
                                                                                                                                                                                                                                                                                          ^


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-11-26 22:52:52, Gzip enabled