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_20612873_25670.cpp:4:25: error: stray '#' in program
     using namespace std;#define mod 100003 typedef long long LL;LL a[106][3],b[106][3],c[106][3]; int main(){    memset(a,0,sizeof(a));    memset(b,0,sizeof(b));    memset(c,0,sizeof(c));    c[0][0]=1;    for (int i=1;i<=100;i++)    {        a[i][0]=(a[i-1][0]*90%mod+c[i-1][0]*44%mod+a[i-1][1]*80%mod+c[i-1][1]*41%mod)%mod;        a[i][1]=(a[i-1][0]*10%mod+c[i-1][0]+a[i-1][1]*10%mod+c[i-1][1])%mod;        a[i][2]=(a[i-1][1]*10%mod+c[i-1][1]*3%mod+a[i-1][2]*100%mod+c[i-1][2]*45%mod)%mod;        b[i][0]=(b[i-1][0]*900%mod+a[i-1][0]*880+c[i-1][0]*284+b[i-1][1]*800%mod+            a[i-1][1]*820%mod+c[i-1][1]*275%mod)%mod;        b[i][1]=(b[i-1][0]*100%mod+a[i-1][0]*20%mod+c[i-1][0]+b[i-1][1]*100%mod            +a[i-1][1]*20%mod+c[i-1][1])%mod;        b[i][2]=(b[i-1][1]*100%mod+a[i-1][1]*60%mod+c[i-1][1]*9%mod+            b[i-1][2]*1000%mod+a[i-1][2]*900%mod+c[i-1][2]*285%mod)%mod;        c[i][0]=(c[i-1][0]*9%mod+c[i-1][1]*8%mod)%mod;        c[i][1]=(c[i-1][0]+c[i-1][1])%mod;        c[i][2]=(c[i-1][1]+c[i-1][2]*10%mod)%mod;    }    int test;    scanf("%d",&test);    for (int ii=1;ii<=test;ii++)    {        int n;        scanf("%d",&n);        printf("Case %d: %I64d\n",ii,b[n][2]);    }    return 0;}
                         ^
0_0_20612873_25670.cpp:4:26: error: 'define' does not name a type
     using namespace std;#define mod 100003 typedef long long LL;LL a[106][3],b[106][3],c[106][3]; int main(){    memset(a,0,sizeof(a));    memset(b,0,sizeof(b));    memset(c,0,sizeof(c));    c[0][0]=1;    for (int i=1;i<=100;i++)    {        a[i][0]=(a[i-1][0]*90%mod+c[i-1][0]*44%mod+a[i-1][1]*80%mod+c[i-1][1]*41%mod)%mod;        a[i][1]=(a[i-1][0]*10%mod+c[i-1][0]+a[i-1][1]*10%mod+c[i-1][1])%mod;        a[i][2]=(a[i-1][1]*10%mod+c[i-1][1]*3%mod+a[i-1][2]*100%mod+c[i-1][2]*45%mod)%mod;        b[i][0]=(b[i-1][0]*900%mod+a[i-1][0]*880+c[i-1][0]*284+b[i-1][1]*800%mod+            a[i-1][1]*820%mod+c[i-1][1]*275%mod)%mod;        b[i][1]=(b[i-1][0]*100%mod+a[i-1][0]*20%mod+c[i-1][0]+b[i-1][1]*100%mod            +a[i-1][1]*20%mod+c[i-1][1])%mod;        b[i][2]=(b[i-1][1]*100%mod+a[i-1][1]*60%mod+c[i-1][1]*9%mod+            b[i-1][2]*1000%mod+a[i-1][2]*900%mod+c[i-1][2]*285%mod)%mod;        c[i][0]=(c[i-1][0]*9%mod+c[i-1][1]*8%mod)%mod;        c[i][1]=(c[i-1][0]+c[i-1][1])%mod;        c[i][2]=(c[i-1][1]+c[i-1][2]*10%mod)%mod;    }    int test;    scanf("%d",&test);    for (int ii=1;ii<=test;ii++)    {        int n;        scanf("%d",&n);        printf("Case %d: %I64d\n",ii,b[n][2]);    }    return 0;}
                          ^
0_0_20612873_25670.cpp:4:65: error: 'LL' does not name a type
     using namespace std;#define mod 100003 typedef long long LL;LL a[106][3],b[106][3],c[106][3]; int main(){    memset(a,0,sizeof(a));    memset(b,0,sizeof(b));    memset(c,0,sizeof(c));    c[0][0]=1;    for (int i=1;i<=100;i++)    {        a[i][0]=(a[i-1][0]*90%mod+c[i-1][0]*44%mod+a[i-1][1]*80%mod+c[i-1][1]*41%mod)%mod;        a[i][1]=(a[i-1][0]*10%mod+c[i-1][0]+a[i-1][1]*10%mod+c[i-1][1])%mod;        a[i][2]=(a[i-1][1]*10%mod+c[i-1][1]*3%mod+a[i-1][2]*100%mod+c[i-1][2]*45%mod)%mod;        b[i][0]=(b[i-1][0]*900%mod+a[i-1][0]*880+c[i-1][0]*284+b[i-1][1]*800%mod+            a[i-1][1]*820%mod+c[i-1][1]*275%mod)%mod;        b[i][1]=(b[i-1][0]*100%mod+a[i-1][0]*20%mod+c[i-1][0]+b[i-1][1]*100%mod            +a[i-1][1]*20%mod+c[i-1][1])%mod;        b[i][2]=(b[i-1][1]*100%mod+a[i-1][1]*60%mod+c[i-1][1]*9%mod+            b[i-1][2]*1000%mod+a[i-1][2]*900%mod+c[i-1][2]*285%mod)%mod;        c[i][0]=(c[i-1][0]*9%mod+c[i-1][1]*8%mod)%mod;        c[i][1]=(c[i-1][0]+c[i-1][1])%mod;        c[i][2]=(c[i-1][1]+c[i-1][2]*10%mod)%mod;    }    int test;    scanf("%d",&test);    for (int ii=1;ii<=test;ii++)    {        int n;        scanf("%d",&n);        printf("Case %d: %I64d\n",ii,b[n][2]);    }    return 0;}
                                                                 ^
0_0_20612873_25670.cpp: In function 'int main()':
0_0_20612873_25670.cpp:4:121: error: 'a' was not declared in this scope
     using namespace std;#define mod 100003 typedef long long LL;LL a[106][3],b[106][3],c[106][3]; int main(){    memset(a,0,sizeof(a));    memset(b,0,sizeof(b));    memset(c,0,sizeof(c));    c[0][0]=1;    for (int i=1;i<=100;i++)    {        a[i][0]=(a[i-1][0]*90%mod+c[i-1][0]*44%mod+a[i-1][1]*80%mod+c[i-1][1]*41%mod)%mod;        a[i][1]=(a[i-1][0]*10%mod+c[i-1][0]+a[i-1][1]*10%mod+c[i-1][1])%mod;        a[i][2]=(a[i-1][1]*10%mod+c[i-1][1]*3%mod+a[i-1][2]*100%mod+c[i-1][2]*45%mod)%mod;        b[i][0]=(b[i-1][0]*900%mod+a[i-1][0]*880+c[i-1][0]*284+b[i-1][1]*800%mod+            a[i-1][1]*820%mod+c[i-1][1]*275%mod)%mod;        b[i][1]=(b[i-1][0]*100%mod+a[i-1][0]*20%mod+c[i-1][0]+b[i-1][1]*100%mod            +a[i-1][1]*20%mod+c[i-1][1])%mod;        b[i][2]=(b[i-1][1]*100%mod+a[i-1][1]*60%mod+c[i-1][1]*9%mod+            b[i-1][2]*1000%mod+a[i-1][2]*900%mod+c[i-1][2]*285%mod)%mod;        c[i][0]=(c[i-1][0]*9%mod+c[i-1][1]*8%mod)%mod;        c[i][1]=(c[i-1][0]+c[i-1][1])%mod;        c[i][2]=(c[i-1][1]+c[i-1][2]*10%mod)%mod;    }    int test;    scanf("%d",&test);    for (int ii=1;ii<=test;ii++)    {        int n;        scanf("%d",&n);        printf("Case %d: %I64d\n",ii,b[n][2]);    }    return 0;}
                                                                                                                         ^
0_0_20612873_25670.cpp:4:147: error: 'b' was not declared in this scope
     using namespace std;#define mod 100003 typedef long long LL;LL a[106][3],b[106][3],c[106][3]; int main(){    memset(a,0,sizeof(a));    memset(b,0,sizeof(b));    memset(c,0,sizeof(c));    c[0][0]=1;    for (int i=1;i<=100;i++)    {        a[i][0]=(a[i-1][0]*90%mod+c[i-1][0]*44%mod+a[i-1][1]*80%mod+c[i-1][1]*41%mod)%mod;        a[i][1]=(a[i-1][0]*10%mod+c[i-1][0]+a[i-1][1]*10%mod+c[i-1][1])%mod;        a[i][2]=(a[i-1][1]*10%mod+c[i-1][1]*3%mod+a[i-1][2]*100%mod+c[i-1][2]*45%mod)%mod;        b[i][0]=(b[i-1][0]*900%mod+a[i-1][0]*880+c[i-1][0]*284+b[i-1][1]*800%mod+            a[i-1][1]*820%mod+c[i-1][1]*275%mod)%mod;        b[i][1]=(b[i-1][0]*100%mod+a[i-1][0]*20%mod+c[i-1][0]+b[i-1][1]*100%mod            +a[i-1][1]*20%mod+c[i-1][1])%mod;        b[i][2]=(b[i-1][1]*100%mod+a[i-1][1]*60%mod+c[i-1][1]*9%mod+            b[i-1][2]*1000%mod+a[i-1][2]*900%mod+c[i-1][2]*285%mod)%mod;        c[i][0]=(c[i-1][0]*9%mod+c[i-1][1]*8%mod)%mod;        c[i][1]=(c[i-1][0]+c[i-1][1])%mod;        c[i][2]=(c[i-1][1]+c[i-1][2]*10%mod)%mod;    }    int test;    scanf("%d",&test);    for (int ii=1;ii<=test;ii++)    {        int n;        scanf("%d",&n);        printf("Case %d: %I64d\n",ii,b[n][2]);    }    return 0;}
                                                                                                                                                   ^
0_0_20612873_25670.cpp:4:173: error: 'c' was not declared in this scope
     using namespace std;#define mod 100003 typedef long long LL;LL a[106][3],b[106][3],c[106][3]; int main(){    memset(a,0,sizeof(a));    memset(b,0,sizeof(b));    memset(c,0,sizeof(c));    c[0][0]=1;    for (int i=1;i<=100;i++)    {        a[i][0]=(a[i-1][0]*90%mod+c[i-1][0]*44%mod+a[i-1][1]*80%mod+c[i-1][1]*41%mod)%mod;        a[i][1]=(a[i-1][0]*10%mod+c[i-1][0]+a[i-1][1]*10%mod+c[i-1][1])%mod;        a[i][2]=(a[i-1][1]*10%mod+c[i-1][1]*3%mod+a[i-1][2]*100%mod+c[i-1][2]*45%mod)%mod;        b[i][0]=(b[i-1][0]*900%mod+a[i-1][0]*880+c[i-1][0]*284+b[i-1][1]*800%mod+            a[i-1][1]*820%mod+c[i-1][1]*275%mod)%mod;        b[i][1]=(b[i-1][0]*100%mod+a[i-1][0]*20%mod+c[i-1][0]+b[i-1][1]*100%mod            +a[i-1][1]*20%mod+c[i-1][1])%mod;        b[i][2]=(b[i-1][1]*100%mod+a[i-1][1]*60%mod+c[i-1][1]*9%mod+            b[i-1][2]*1000%mod+a[i-1][2]*900%mod+c[i-1][2]*285%mod)%mod;        c[i][0]=(c[i-1][0]*9%mod+c[i-1][1]*8%mod)%mod;        c[i][1]=(c[i-1][0]+c[i-1][1])%mod;        c[i][2]=(c[i-1][1]+c[i-1][2]*10%mod)%mod;    }    int test;    scanf("%d",&test);    for (int ii=1;ii<=test;ii++)    {        int n;        scanf("%d",&n);        printf("Case %d: %I64d\n",ii,b[n][2]);    }    return 0;}
                                                                                                                                                                             ^
0_0_20612873_25670.cpp:4:265: error: 'mod' was not declared in this scope
     using namespace std;#define mod 100003 typedef long long LL;LL a[106][3],b[106][3],c[106][3]; int main(){    memset(a,0,sizeof(a));    memset(b,0,sizeof(b));    memset(c,0,sizeof(c));    c[0][0]=1;    for (int i=1;i<=100;i++)    {        a[i][0]=(a[i-1][0]*90%mod+c[i-1][0]*44%mod+a[i-1][1]*80%mod+c[i-1][1]*41%mod)%mod;        a[i][1]=(a[i-1][0]*10%mod+c[i-1][0]+a[i-1][1]*10%mod+c[i-1][1])%mod;        a[i][2]=(a[i-1][1]*10%mod+c[i-1][1]*3%mod+a[i-1][2]*100%mod+c[i-1][2]*45%mod)%mod;        b[i][0]=(b[i-1][0]*900%mod+a[i-1][0]*880+c[i-1][0]*284+b[i-1][1]*800%mod+            a[i-1][1]*820%mod+c[i-1][1]*275%mod)%mod;        b[i][1]=(b[i-1][0]*100%mod+a[i-1][0]*20%mod+c[i-1][0]+b[i-1][1]*100%mod            +a[i-1][1]*20%mod+c[i-1][1])%mod;        b[i][2]=(b[i-1][1]*100%mod+a[i-1][1]*60%mod+c[i-1][1]*9%mod+            b[i-1][2]*1000%mod+a[i-1][2]*900%mod+c[i-1][2]*285%mod)%mod;        c[i][0]=(c[i-1][0]*9%mod+c[i-1][1]*8%mod)%mod;        c[i][1]=(c[i-1][0]+c[i-1][1])%mod;        c[i][2]=(c[i-1][1]+c[i-1][2]*10%mod)%mod;    }    int test;    scanf("%d",&test);    for (int ii=1;ii<=test;ii++)    {        int n;        scanf("%d",&n);        printf("Case %d: %I64d\n",ii,b[n][2]);    }    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-30 05:33:25, Gzip enabled