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_20612041_12709.cpp:2:5: error: expected unqualified-id before numeric constant
     0; j--)            if (i%j == 0 &&                 mul[i] > mul[j] + i/j + 2)                 mul[i] = mul[j] + i/j + 2,                gmul[i] = j;    for (int i=1; i<=6000; i++)        add[i] = mul[i];    for (int i=1; i<=6000; i++)        for (int j=i-1; j>0; j--)            if (add[i] > add[j] + mul[i-j] + 2)                add[i] = add[j] + mul[i-j]+2,                gadd[i]=j; } void printmul(int N){    if (gmul[N] == 0)        for (int i=0; i<N; i++)            printf("|");    else    {        printmul(gmul[N]);        printf("x");        for (int i=0; i<N/gmul[N]; i++)            printf("|");    }} void print(int N){    if (gadd[N] == 0) printmul(N);    else    {        print(gadd[N]);        printf("+");        printmul(N-gadd[N]);    }} void printT(int N){    if (G[N] == 0) for (int i=0; i<N; i++) printf("|");    else         if (G[N] < 0)        {            printT(-G[N]);            printf("x");            for (int i=0; i<-N/G[N]; i++) printf("|");        }else{            printT(G[N]);            printf("+");            for (int i=0; i<N-G[N]; i++) printf("|");        }}int main(){    pre();    int N;    while (scanf("%d", &N)!=EOF)    {        if (N==0) break;        if (add[N] < mul[N])        {            printf("%d toothpicks: ", add[N]);            print(N);            printf("=%d\n", N);        }else{            printf("%d toothpicks: ", mul[N]);            printmul(N);            printf("=%d\n", N);         }    }}
     ^
0_0_20612041_12709.cpp:2:8: error: 'j' does not name a type
     0; j--)            if (i%j == 0 &&                 mul[i] > mul[j] + i/j + 2)                 mul[i] = mul[j] + i/j + 2,                gmul[i] = j;    for (int i=1; i<=6000; i++)        add[i] = mul[i];    for (int i=1; i<=6000; i++)        for (int j=i-1; j>0; j--)            if (add[i] > add[j] + mul[i-j] + 2)                add[i] = add[j] + mul[i-j]+2,                gadd[i]=j; } void printmul(int N){    if (gmul[N] == 0)        for (int i=0; i<N; i++)            printf("|");    else    {        printmul(gmul[N]);        printf("x");        for (int i=0; i<N/gmul[N]; i++)            printf("|");    }} void print(int N){    if (gadd[N] == 0) printmul(N);    else    {        print(gadd[N]);        printf("+");        printmul(N-gadd[N]);    }} void printT(int N){    if (G[N] == 0) for (int i=0; i<N; i++) printf("|");    else         if (G[N] < 0)        {            printT(-G[N]);            printf("x");            for (int i=0; i<-N/G[N]; i++) printf("|");        }else{            printT(G[N]);            printf("+");            for (int i=0; i<N-G[N]; i++) printf("|");        }}int main(){    pre();    int N;    while (scanf("%d", &N)!=EOF)    {        if (N==0) break;        if (add[N] < mul[N])        {            printf("%d toothpicks: ", add[N]);            print(N);            printf("=%d\n", N);        }else{            printf("%d toothpicks: ", mul[N]);            printmul(N);            printf("=%d\n", N);         }    }}
        ^
0_0_20612041_12709.cpp:2:157: error: expected unqualified-id before 'for'
     0; j--)            if (i%j == 0 &&                 mul[i] > mul[j] + i/j + 2)                 mul[i] = mul[j] + i/j + 2,                gmul[i] = j;    for (int i=1; i<=6000; i++)        add[i] = mul[i];    for (int i=1; i<=6000; i++)        for (int j=i-1; j>0; j--)            if (add[i] > add[j] + mul[i-j] + 2)                add[i] = add[j] + mul[i-j]+2,                gadd[i]=j; } void printmul(int N){    if (gmul[N] == 0)        for (int i=0; i<N; i++)            printf("|");    else    {        printmul(gmul[N]);        printf("x");        for (int i=0; i<N/gmul[N]; i++)            printf("|");    }} void print(int N){    if (gadd[N] == 0) printmul(N);    else    {        print(gadd[N]);        printf("+");        printmul(N-gadd[N]);    }} void printT(int N){    if (G[N] == 0) for (int i=0; i<N; i++) printf("|");    else         if (G[N] < 0)        {            printT(-G[N]);            printf("x");            for (int i=0; i<-N/G[N]; i++) printf("|");        }else{            printT(G[N]);            printf("+");            for (int i=0; i<N-G[N]; i++) printf("|");        }}int main(){    pre();    int N;    while (scanf("%d", &N)!=EOF)    {        if (N==0) break;        if (add[N] < mul[N])        {            printf("%d toothpicks: ", add[N]);            print(N);            printf("=%d\n", N);        }else{            printf("%d toothpicks: ", mul[N]);            printmul(N);            printf("=%d\n", N);         }    }}
                                                                                                                                                             ^
0_0_20612041_12709.cpp:2:171: error: 'i' does not name a type
     0; j--)            if (i%j == 0 &&                 mul[i] > mul[j] + i/j + 2)                 mul[i] = mul[j] + i/j + 2,                gmul[i] = j;    for (int i=1; i<=6000; i++)        add[i] = mul[i];    for (int i=1; i<=6000; i++)        for (int j=i-1; j>0; j--)            if (add[i] > add[j] + mul[i-j] + 2)                add[i] = add[j] + mul[i-j]+2,                gadd[i]=j; } void printmul(int N){    if (gmul[N] == 0)        for (int i=0; i<N; i++)            printf("|");    else    {        printmul(gmul[N]);        printf("x");        for (int i=0; i<N/gmul[N]; i++)            printf("|");    }} void print(int N){    if (gadd[N] == 0) printmul(N);    else    {        print(gadd[N]);        printf("+");        printmul(N-gadd[N]);    }} void printT(int N){    if (G[N] == 0) for (int i=0; i<N; i++) printf("|");    else         if (G[N] < 0)        {            printT(-G[N]);            printf("x");            for (int i=0; i<-N/G[N]; i++) printf("|");        }else{            printT(G[N]);            printf("+");            for (int i=0; i<N-G[N]; i++) printf("|");        }}int main(){    pre();    int N;    while (scanf("%d", &N)!=EOF)    {        if (N==0) break;        if (add[N] < mul[N])        {            printf("%d toothpicks: ", add[N]);            print(N);            printf("=%d\n", N);        }else{            printf("%d toothpicks: ", mul[N]);            printmul(N);            printf("=%d\n", N);         }    }}
                                                                                                                                                                           ^
0_0_20612041_12709.cpp:2:180: error: 'i' does not name a type
     0; j--)            if (i%j == 0 &&                 mul[i] > mul[j] + i/j + 2)                 mul[i] = mul[j] + i/j + 2,                gmul[i] = j;    for (int i=1; i<=6000; i++)        add[i] = mul[i];    for (int i=1; i<=6000; i++)        for (int j=i-1; j>0; j--)            if (add[i] > add[j] + mul[i-j] + 2)                add[i] = add[j] + mul[i-j]+2,                gadd[i]=j; } void printmul(int N){    if (gmul[N] == 0)        for (int i=0; i<N; i++)            printf("|");    else    {        printmul(gmul[N]);        printf("x");        for (int i=0; i<N/gmul[N]; i++)            printf("|");    }} void print(int N){    if (gadd[N] == 0) printmul(N);    else    {        print(gadd[N]);        printf("+");        printmul(N-gadd[N]);    }} void printT(int N){    if (G[N] == 0) for (int i=0; i<N; i++) printf("|");    else         if (G[N] < 0)        {            printT(-G[N]);            printf("x");            for (int i=0; i<-N/G[N]; i++) printf("|");        }else{            printT(G[N]);            printf("+");            for (int i=0; i<N-G[N]; i++) printf("|");        }}int main(){    pre();    int N;    while (scanf("%d", &N)!=EOF)    {        if (N==0) break;        if (add[N] < mul[N])        {            printf("%d toothpicks: ", add[N]);            print(N);            printf("=%d\n", N);        }else{            printf("%d toothpicks: ", mul[N]);            printmul(N);            printf("=%d\n", N);         }    }}
                                                                                                                                                                                    ^
0_0_20612041_12709.cpp:2:212: error: expected unqualified-id before 'for'
     0; j--)            if (i%j == 0 &&                 mul[i] > mul[j] + i/j + 2)                 mul[i] = mul[j] + i/j + 2,                gmul[i] = j;    for (int i=1; i<=6000; i++)        add[i] = mul[i];    for (int i=1; i<=6000; i++)        for (int j=i-1; j>0; j--)            if (add[i] > add[j] + mul[i-j] + 2)                add[i] = add[j] + mul[i-j]+2,                gadd[i]=j; } void printmul(int N){    if (gmul[N] == 0)        for (int i=0; i<N; i++)            printf("|");    else    {        printmul(gmul[N]);        printf("x");        for (int i=0; i<N/gmul[N]; i++)            printf("|");    }} void print(int N){    if (gadd[N] == 0) printmul(N);    else    {        print(gadd[N]);        printf("+");        printmul(N-gadd[N]);    }} void printT(int N){    if (G[N] == 0) for (int i=0; i<N; i++) printf("|");    else         if (G[N] < 0)        {            printT(-G[N]);            printf("x");            for (int i=0; i<-N/G[N]; i++) printf("|");        }else{            printT(G[N]);            printf("+");            for (int i=0; i<N-G[N]; i++) printf("|");        }}int main(){    pre();    int N;    while (scanf("%d", &N)!=EOF)    {        if (N==0) break;        if (add[N] < mul[N])        {            printf("%d toothpicks: ", add[N]);            print(N);            printf("=%d\n", N);        }else{            printf("%d toothpicks: ", mul[N]);            printmul(N);            printf("=%d\n", N);         }    }}
                                                                                                                                                                                                                    ^
0_0_20612041_12709.cpp:2:226: error: 'i' does not name a type
     0; j--)            if (i%j == 0 &&                 mul[i] > mul[j] + i/j + 2)                 mul[i] = mul[j] + i/j + 2,                gmul[i] = j;    fo


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-09-29 12:21:26, Gzip enabled