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_20613329_17623.cpp:7:25: error: stray '#' in program
     using namespace std;#define maxn 105int g[maxn];int x[maxn];int n,m;int inf=100*100;int all;int Get(int n){     n=(n&0x55555555)+((n>>1)&0x55555555);       n=(n&0x33333333)+((n>>2)&0x33333333);       n=(n&0x0f0f0f0f)+((n>>4)&0x0f0f0f0f);       n=(n&0x00ff00ff)+((n>>8)&0x00ff00ff);       n=(n&0x0000ffff)+((n>>16)&0x0000ffff);       return n;}void heng(int &x,int i){    x^=i;x^=i<<1;x^=i>>1;      x=x&all;}int main(){    int i, j,k;    while(scanf("%d%d", &n,&m) != EOF)    {        memset(g,0,sizeof(g));        for(i=0;i<n;i++)        {            for(j=0;j<m;j++)            {                int tmp;                scanf("%d",&tmp);                g[i]=g[i]<<1|tmp;            }        }        all=(1<<m)-1;        int ans=inf;        for(i=0;i<(1<<m);i++)        {                for(k=0;k<n;k++)x[k]=g[k];            int t=Get(i);            heng(x[0],i);            x[1]^=i;            for(j=1;j<n;j++)            {                int k=x[j-1]^all;                heng(x[j],k);                x[j+1]^=k;                t+=Get(k);            }            if(t<ans&&x[n-1]==all)ans=t;        }        if(ans==inf)printf("no solution\n");        else printf("%d\n",ans);    }    return 0;}
                         ^
0_0_20613329_17623.cpp:7:26: error: 'define' does not name a type
     using namespace std;#define maxn 105int g[maxn];int x[maxn];int n,m;int inf=100*100;int all;int Get(int n){     n=(n&0x55555555)+((n>>1)&0x55555555);       n=(n&0x33333333)+((n>>2)&0x33333333);       n=(n&0x0f0f0f0f)+((n>>4)&0x0f0f0f0f);       n=(n&0x00ff00ff)+((n>>8)&0x00ff00ff);       n=(n&0x0000ffff)+((n>>16)&0x0000ffff);       return n;}void heng(int &x,int i){    x^=i;x^=i<<1;x^=i>>1;      x=x&all;}int main(){    int i, j,k;    while(scanf("%d%d", &n,&m) != EOF)    {        memset(g,0,sizeof(g));        for(i=0;i<n;i++)        {            for(j=0;j<m;j++)            {                int tmp;                scanf("%d",&tmp);                g[i]=g[i]<<1|tmp;            }        }        all=(1<<m)-1;        int ans=inf;        for(i=0;i<(1<<m);i++)        {                for(k=0;k<n;k++)x[k]=g[k];            int t=Get(i);            heng(x[0],i);            x[1]^=i;            for(j=1;j<n;j++)            {                int k=x[j-1]^all;                heng(x[j],k);                x[j+1]^=k;                t+=Get(k);            }            if(t<ans&&x[n-1]==all)ans=t;        }        if(ans==inf)printf("no solution\n");        else printf("%d\n",ans);    }    return 0;}
                          ^
0_0_20613329_17623.cpp:7:59: error: 'maxn' was not declared in this scope
     using namespace std;#define maxn 105int g[maxn];int x[maxn];int n,m;int inf=100*100;int all;int Get(int n){     n=(n&0x55555555)+((n>>1)&0x55555555);       n=(n&0x33333333)+((n>>2)&0x33333333);       n=(n&0x0f0f0f0f)+((n>>4)&0x0f0f0f0f);       n=(n&0x00ff00ff)+((n>>8)&0x00ff00ff);       n=(n&0x0000ffff)+((n>>16)&0x0000ffff);       return n;}void heng(int &x,int i){    x^=i;x^=i<<1;x^=i>>1;      x=x&all;}int main(){    int i, j,k;    while(scanf("%d%d", &n,&m) != EOF)    {        memset(g,0,sizeof(g));        for(i=0;i<n;i++)        {            for(j=0;j<m;j++)            {                int tmp;                scanf("%d",&tmp);                g[i]=g[i]<<1|tmp;            }        }        all=(1<<m)-1;        int ans=inf;        for(i=0;i<(1<<m);i++)        {                for(k=0;k<n;k++)x[k]=g[k];            int t=Get(i);            heng(x[0],i);            x[1]^=i;            for(j=1;j<n;j++)            {                int k=x[j-1]^all;                heng(x[j],k);                x[j+1]^=k;                t+=Get(k);            }            if(t<ans&&x[n-1]==all)ans=t;        }        if(ans==inf)printf("no solution\n");        else printf("%d\n",ans);    }    return 0;}
                                                           ^
0_0_20613329_17623.cpp: In function 'int main()':
0_0_20613329_17623.cpp:7:496: error: 'g' was not declared in this scope
     using namespace std;#define maxn 105int g[maxn];int x[maxn];int n,m;int inf=100*100;int all;int Get(int n){     n=(n&0x55555555)+((n>>1)&0x55555555);       n=(n&0x33333333)+((n>>2)&0x33333333);       n=(n&0x0f0f0f0f)+((n>>4)&0x0f0f0f0f);       n=(n&0x00ff00ff)+((n>>8)&0x00ff00ff);       n=(n&0x0000ffff)+((n>>16)&0x0000ffff);       return n;}void heng(int &x,int i){    x^=i;x^=i<<1;x^=i>>1;      x=x&all;}int main(){    int i, j,k;    while(scanf("%d%d", &n,&m) != EOF)    {        memset(g,0,sizeof(g));        for(i=0;i<n;i++)        {            for(j=0;j<m;j++)            {                int tmp;                scanf("%d",&tmp);                g[i]=g[i]<<1|tmp;            }        }        all=(1<<m)-1;        int ans=inf;        for(i=0;i<(1<<m);i++)        {                for(k=0;k<n;k++)x[k]=g[k];            int t=Get(i);            heng(x[0],i);            x[1]^=i;            for(j=1;j<n;j++)            {                int k=x[j-1]^all;                heng(x[j],k);                x[j+1]^=k;                t+=Get(k);            }            if(t<ans&&x[n-1]==all)ans=t;        }        if(ans==inf)printf("no solution\n");        else printf("%d\n",ans);    }    return 0;}
                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                ^
0_0_20613329_17623.cpp:7:808: error: 'x' was not declared in this scope
     using namespace std;#define maxn 105int g[maxn];int x[maxn];int n,m;int inf=100*100;int all;int Get(int n){     n=(n&0x55555555)+((n>>1)&0x55555555);       n=(n&0x33333333)+((n>>2)&0x33333333);       n=(n&0x0f0f0f0f)+((n>>4)&0x0f0f0f0f);       n=(n&0x00ff00ff)+((n>>8)&0x00ff00ff);       n=(n&0x0000ffff)+((n>>16)&0x0000ffff);       return n;}void heng(int &x,int i){    x^=i;x^=i<<1;x^=i>>1;      x=x&all;}int main(){    int i, j,k;    while(scanf("%d%d", &n,&m) != EOF)    {        memset(g,0,sizeof(g));        for(i=0;i<n;i++)        {            for(j=0;j<m;j++)            {                int tmp;                scanf("%d",&tmp);                g[i]=g[i]<<1|tmp;            }        }        all=(1<<m)-1;        int ans=inf;        for(i=0;i<(1<<m);i++)        {                for(k=0;k<n;k++)x[k]=g[k];            int t=Get(i);            heng(x[0],i);            x[1]^=i;            for(j=1;j<n;j++)            {                int k=x[j-1]^all;                heng(x[j],k);                x[j+1]^=k;                t+=Get(k);            }            if(t<ans&&x[n-1]==all)ans=t;        }        if(ans==inf)printf("no solution\n");        else printf("%d\n",ans);    }    return 0;}
                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        ^
0_0_20613329_17623.cpp:7:860: error: 'x' was not declared in this scope
     using namespace std;#define maxn 105int g[maxn];int x[maxn];int n,m;int inf=100*100;int all;int Get(int n){     n=(n&0x55555555)+((n>>1)&0x55555555);       n=(n&0x33333333)+((n>>2)&0x33333333);       n=(n&0x0f0f0f0f)+((n>>4)&0x0f0f0f0f);       n=(n&0x00ff00ff)+((n>>8)&0x00ff00ff);       n=(n&0x0000ffff)+((n>>16)&0x0000ffff);       return n;}void heng(int &x,int i){    x^=i;x^=i<<1;x^=i>>1;      x=x&all;}int main(){    int i, j,k;    while(scanf("%d%d", &n,&m) != EOF)    {        memset(g,0,sizeof(g));        for(i=0;i<n;i++)        {            for(j=0;j<m;j++)            {                int tmp;                scanf("%d",&tmp);                g[i]=g[i]<<1|tmp;            }        }        all=(1<<m)-1;        int ans=inf;        for(i=0;i<(1<<m);i++)        {                for(k=0;k<n;k++)x[k]=g[k];            int t=Get(i);            heng(x[0],i);            x[1]^=i;            for(j=1;j<n;j++)            {                int k=x[j-1]^all;                heng(x[j],k);                x[j+1]^=k;                t+=Get(k);            }            if(t<ans&&x[n-1]==all)ans=t;        }        if(ans==inf)printf("no solution\n");        else printf("%d\n",ans);    }    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-07-01 20:43:42, Gzip enabled