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_20613939_19436.cpp:6:6: error: 'g' does not name a type
      g; ll f(ll x){    if (x%2==0) return 2*(x/6+1)-1;        else return 2*((x-3)/6+1);} ll get(ll x){    if (g[x]!=0) return g[x];    g[x]=f(x);    for (ll i=2; i*i<=x; i++)    {        if (x%i>0) continue;        g[x]-=get(i);        if (i*i!=x)        {            g[x]-=get(x/i);        }    }    return g[x];} int main(){    scanf("%I64d",&t);    while (t--)    {        scanf("%I64d",&n);        if (n%3==0)        {            printf("0\n");            continue;        }        if ((n&1)==0)        {            printf("0\n");            continue;        }        if (n==1)        {            printf("1\n");            continue;        }        if (n==3)        {            printf("0\n");            continue;        }        n=(n+3)>>1;        printf("%I64d\n",get(n));    }    return 0;}
      ^
0_0_20613939_19436.cpp:5:31: error: expected initializer before 'namespace'
     #define ll long longusing namespace std; ll t,n;map<ll,ll>
                               ^
0_0_20613939_19436.cpp:6:9: note: in expansion of macro 'll'
      g; ll f(ll x){    if (x%2==0) return 2*(x/6+1)-1;        else return 2*((x-3)/6+1);} ll get(ll x){    if (g[x]!=0) return g[x];    g[x]=f(x);    for (ll i=2; i*i<=x; i++)    {        if (x%i>0) continue;        g[x]-=get(i);        if (i*i!=x)        {            g[x]-=get(x/i);        }    }    return g[x];} int main(){    scanf("%I64d",&t);    while (t--)    {        scanf("%I64d",&n);        if (n%3==0)        {            printf("0\n");            continue;        }        if ((n&1)==0)        {            printf("0\n");            continue;        }        if (n==1)        {            printf("1\n");            continue;        }        if (n==3)        {            printf("0\n");            continue;        }        n=(n+3)>>1;        printf("%I64d\n",get(n));    }    return 0;}
         ^
0_0_20613939_19436.cpp:5:46: error: 'll' does not name a type
     #define ll long longusing namespace std; ll t,n;map<ll,ll>
                                              ^
0_0_20613939_19436.cpp:6:9: note: in expansion of macro 'll'
      g; ll f(ll x){    if (x%2==0) return 2*(x/6+1)-1;        else return 2*((x-3)/6+1);} ll get(ll x){    if (g[x]!=0) return g[x];    g[x]=f(x);    for (ll i=2; i*i<=x; i++)    {        if (x%i>0) continue;        g[x]-=get(i);        if (i*i!=x)        {            g[x]-=get(x/i);        }    }    return g[x];} int main(){    scanf("%I64d",&t);    while (t--)    {        scanf("%I64d",&n);        if (n%3==0)        {            printf("0\n");            continue;        }        if ((n&1)==0)        {            printf("0\n");            continue;        }        if (n==1)        {            printf("1\n");            continue;        }        if (n==3)        {            printf("0\n");            continue;        }        n=(n+3)>>1;        printf("%I64d\n",get(n));    }    return 0;}
         ^
0_0_20613939_19436.cpp:5:53: error: 'map' does not name a type
     #define ll long longusing namespace std; ll t,n;map<ll,ll>
                                                     ^
0_0_20613939_19436.cpp:6:9: note: in expansion of macro 'll'
      g; ll f(ll x){    if (x%2==0) return 2*(x/6+1)-1;        else return 2*((x-3)/6+1);} ll get(ll x){    if (g[x]!=0) return g[x];    g[x]=f(x);    for (ll i=2; i*i<=x; i++)    {        if (x%i>0) continue;        g[x]-=get(i);        if (i*i!=x)        {            g[x]-=get(x/i);        }    }    return g[x];} int main(){    scanf("%I64d",&t);    while (t--)    {        scanf("%I64d",&n);        if (n%3==0)        {            printf("0\n");            continue;        }        if ((n&1)==0)        {            printf("0\n");            continue;        }        if (n==1)        {            printf("1\n");            continue;        }        if (n==3)        {            printf("0\n");            continue;        }        n=(n+3)>>1;        printf("%I64d\n",get(n));    }    return 0;}
         ^
0_0_20613939_19436.cpp:5:46: error: 'll' does not name a type
     #define ll long longusing namespace std; ll t,n;map<ll,ll>
                                              ^
0_0_20613939_19436.cpp:6:14: note: in expansion of macro 'll'
      g; ll f(ll x){    if (x%2==0) return 2*(x/6+1)-1;        else return 2*((x-3)/6+1);} ll get(ll x){    if (g[x]!=0) return g[x];    g[x]=f(x);    for (ll i=2; i*i<=x; i++)    {        if (x%i>0) continue;        g[x]-=get(i);        if (i*i!=x)        {            g[x]-=get(x/i);        }    }    return g[x];} int main(){    scanf("%I64d",&t);    while (t--)    {        scanf("%I64d",&n);        if (n%3==0)        {            printf("0\n");            continue;        }        if ((n&1)==0)        {            printf("0\n");            continue;        }        if (n==1)        {            printf("1\n");            continue;        }        if (n==3)        {            printf("0\n");            continue;        }        n=(n+3)>>1;        printf("%I64d\n",get(n));    }    return 0;}
              ^
0_0_20613939_19436.cpp:5:53: error: 'map' does not name a type
     #define ll long longusing namespace std; ll t,n;map<ll,ll>
                                                     ^
0_0_20613939_19436.cpp:6:14: note: in expansion of macro 'll'
      g; ll f(ll x){    if (x%2==0) return 2*(x/6+1)-1;        else return 2*((x-3)/6+1);} ll get(ll x){    if (g[x]!=0) return g[x];    g[x]=f(x);    for (ll i=2; i*i<=x; i++)    {        if (x%i>0) continue;        g[x]-=get(i);        if (i*i!=x)        {            g[x]-=get(x/i);        }    }    return g[x];} int main(){    scanf("%I64d",&t);    while (t--)    {        scanf("%I64d",&n);        if (n%3==0)        {            printf("0\n");            continue;        }        if ((n&1)==0)        {            printf("0\n");            continue;        }        if (n==1)        {            printf("1\n");            continue;        }        if (n==3)        {            printf("0\n");            continue;        }        n=(n+3)>>1;        printf("%I64d\n",get(n));    }    return 0;}
              ^
0_0_20613939_19436.cpp:5:31: error: expected initializer before 'namespace'
     #define ll long longusing namespace std; ll t,n;map<ll,ll>
                               ^
0_0_20613939_19436.cpp:6:91: note: in expansion of macro 'll'
      g; ll f(ll x){    if (x%2==0) return 2*(x/6+1)-1;        else return 2*((x-3)/6+1);} ll get(ll x){    if (g[x]!=0) return g[x];    g[x]=f(x);    for (ll i=2; i*i<=x; i++)    {        if (x%i>0) continue;        g[x]-=get(i);        if (i*i!=x)        {            g[x]-=get(x/i);        }    }    return g[x];} int main(){    scanf("%I64d",&t);    while (t--)    {        scanf("%I64d",&n);        if (n%3==0)        {            printf("0\n");            continue;        }        if ((n&1)==0)        {            printf("0\n");            continue;        }        if (n==1)        {            printf("1\n");            continue;        }        if (n==3)        {            printf("0\n");            continue;        }        n=(n+3)>>1;        printf("%I64d\n",get(n));    }    return 0;}
                                                                                           ^
0_0_20613939_19436.cpp:5:46: error: 'll' does not name a type
     #define ll long longusing namespace std; ll t,n;map<ll,ll>
                                              ^
0_0_20613939_19436.cpp:6:91: note: in expansion of macro 'll'
      g; ll f(ll x){    if (x%2==0) return 2*(x/6+1)-1;        else return 2*((x-3)/6+1);} ll get(ll x){    if (g[x]!=0) return g[x];    g[x]=f(x);    for (ll i=2; i*i<=x; i++)    {        if (x%i>0) continue;        g[x]-=get(i);        if (i*i!=x)        {            g[x]-=get(x/i);        }    }    return g[x];} int main(){    scanf("%I64d",&t);    while (t--)    {        scanf("%I64d",&n);        if (n%3==0)        {            printf("0\n");            continue;        }        if ((n&1)==0)        {            printf("0\n");            continue;        }        if (n==1)        {            printf("1\n");            continue;        }        if (n==3)        {            printf("0\n");            continue;        }        n=(n+3)>>1;        printf("%I64d\n",get(n));    }    return 0;}
                                                                                           ^
0_0_20613939_19436.cpp:5:53: error: 'map' does not name a type
     #define ll long longusing namespace std; ll t,n;map<ll,ll>
                                                     ^
0_0_20613939_19436.cpp:6:91: note: in expansion of macro 'll'
      g; ll f(ll x){    if (x%2==0) return 2*(x/6+1)-1;        else return 2*((x-3)/6+1);} ll get(ll x){    if (g[x]!=0) return g[x];    g[x]=f(x);    for (ll i=2; i*i<=x; i++)    {        if (x%i>0) continue;        g[x]-=get(i);        if (i*i!=x)        {            g[x]-=get(x/i);        }    }    return g[x];} int main(){    scanf("%I64d",&t);    while (t--)    {        scanf("%I64d",&n);        if (n%3==0)        {            printf("0\n");            continue;        }        if ((n&1)==0)        {            printf("0\n");            continue;        }        if (n==1)        {            printf("1\n");            continue;        }        if (n==3)        {            printf("0\n");            continue;        }        n=(n+3)>>1;        printf("%I64d\n",get(n));    }    return 0;}
                                                                                           ^
0_0_20613939_19436.cpp:5:46: error: 'll' does not name a type
     #define ll long longusing namespace std; ll t,n;map<ll,ll>
                                              ^
0_0_20613939_19436.cpp:6:98: note: in expansion of macro 'll'
      g; ll f(ll x){    if (x%2==0) return 2*(x/6+1)-1;        else return 2*((x-3)/6+1);} ll get(ll x){    if (g[x]!=0) return g[x];    g[x]=f(x);    for (ll i=2; i*i<=x; i++)    {        if (x%i>0) continue;        g[x]-=get(i);        if (i*i!=x)        {  


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-26 13:01:53, Gzip enabled