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_20614363_12695.cpp:11:26: error: stray '#' in program
     using namespace std; #define INF 1000000000#define N 111typedef __int64 LL; const LL mod = 1000000007; LL dp[N][N], C[N][N]; int n, num[N]; void init() {    for(int i = 0; i < N; i++) {        for(int j = 0; j <= i; j++) {            if(j == 0 || j == i) C[i][j] = 1;             else C[i][j] = (C[i-1][j-1] + C[i-1][j]) % mod;         }    }}LL dfs(int L, int R) {    if(dp[L][R] != -1) return dp[L][R];     if(L == R) return dp[L][R] = 1;     dp[L][R] = (dfs(L+1, R) + dfs(L, R - 1)) % mod;     for(int i = L+1; i <= R-1; i ++) {        if(num[i-1] != num[i+1]) continue;         dp[L][R] = (dp[L][R] + (dfs(L, i - 1) * dfs(i+1, R) % mod) * C[R- L][i - L]%mod) % mod;     }    return dp[L][R]; }int main() {    init();    while(scanf("%d", &n) != EOF) {        memset(dp, -1, sizeof(dp));         for(int i = 1;i <= n; i++) scanf("%d", &num[i]);         printf("%I64d\n", dfs(1, n));     }    return 0; }
                          ^
0_0_20614363_12695.cpp:11:48: error: stray '#' in program
     using namespace std; #define INF 1000000000#define N 111typedef __int64 LL; const LL mod = 1000000007; LL dp[N][N], C[N][N]; int n, num[N]; void init() {    for(int i = 0; i < N; i++) {        for(int j = 0; j <= i; j++) {            if(j == 0 || j == i) C[i][j] = 1;             else C[i][j] = (C[i-1][j-1] + C[i-1][j]) % mod;         }    }}LL dfs(int L, int R) {    if(dp[L][R] != -1) return dp[L][R];     if(L == R) return dp[L][R] = 1;     dp[L][R] = (dfs(L+1, R) + dfs(L, R - 1)) % mod;     for(int i = L+1; i <= R-1; i ++) {        if(num[i-1] != num[i+1]) continue;         dp[L][R] = (dp[L][R] + (dfs(L, i - 1) * dfs(i+1, R) % mod) * C[R- L][i - L]%mod) % mod;     }    return dp[L][R]; }int main() {    init();    while(scanf("%d", &n) != EOF) {        memset(dp, -1, sizeof(dp));         for(int i = 1;i <= n; i++) scanf("%d", &num[i]);         printf("%I64d\n", dfs(1, n));     }    return 0; }
                                                ^
0_0_20614363_12695.cpp:11:27: error: 'define' does not name a type
     using namespace std; #define INF 1000000000#define N 111typedef __int64 LL; const LL mod = 1000000007; LL dp[N][N], C[N][N]; int n, num[N]; void init() {    for(int i = 0; i < N; i++) {        for(int j = 0; j <= i; j++) {            if(j == 0 || j == i) C[i][j] = 1;             else C[i][j] = (C[i-1][j-1] + C[i-1][j]) % mod;         }    }}LL dfs(int L, int R) {    if(dp[L][R] != -1) return dp[L][R];     if(L == R) return dp[L][R] = 1;     dp[L][R] = (dfs(L+1, R) + dfs(L, R - 1)) % mod;     for(int i = L+1; i <= R-1; i ++) {        if(num[i-1] != num[i+1]) continue;         dp[L][R] = (dp[L][R] + (dfs(L, i - 1) * dfs(i+1, R) % mod) * C[R- L][i - L]%mod) % mod;     }    return dp[L][R]; }int main() {    init();    while(scanf("%d", &n) != EOF) {        memset(dp, -1, sizeof(dp));         for(int i = 1;i <= n; i++) scanf("%d", &num[i]);         printf("%I64d\n", dfs(1, n));     }    return 0; }
                           ^
0_0_20614363_12695.cpp:11:87: error: 'LL' does not name a type
     using namespace std; #define INF 1000000000#define N 111typedef __int64 LL; const LL mod = 1000000007; LL dp[N][N], C[N][N]; int n, num[N]; void init() {    for(int i = 0; i < N; i++) {        for(int j = 0; j <= i; j++) {            if(j == 0 || j == i) C[i][j] = 1;             else C[i][j] = (C[i-1][j-1] + C[i-1][j]) % mod;         }    }}LL dfs(int L, int R) {    if(dp[L][R] != -1) return dp[L][R];     if(L == R) return dp[L][R] = 1;     dp[L][R] = (dfs(L+1, R) + dfs(L, R - 1)) % mod;     for(int i = L+1; i <= R-1; i ++) {        if(num[i-1] != num[i+1]) continue;         dp[L][R] = (dp[L][R] + (dfs(L, i - 1) * dfs(i+1, R) % mod) * C[R- L][i - L]%mod) % mod;     }    return dp[L][R]; }int main() {    init();    while(scanf("%d", &n) != EOF) {        memset(dp, -1, sizeof(dp));         for(int i = 1;i <= n; i++) scanf("%d", &num[i]);         printf("%I64d\n", dfs(1, n));     }    return 0; }
                                                                                       ^
0_0_20614363_12695.cpp:11:108: error: 'LL' does not name a type
     using namespace std; #define INF 1000000000#define N 111typedef __int64 LL; const LL mod = 1000000007; LL dp[N][N], C[N][N]; int n, num[N]; void init() {    for(int i = 0; i < N; i++) {        for(int j = 0; j <= i; j++) {            if(j == 0 || j == i) C[i][j] = 1;             else C[i][j] = (C[i-1][j-1] + C[i-1][j]) % mod;         }    }}LL dfs(int L, int R) {    if(dp[L][R] != -1) return dp[L][R];     if(L == R) return dp[L][R] = 1;     dp[L][R] = (dfs(L+1, R) + dfs(L, R - 1)) % mod;     for(int i = L+1; i <= R-1; i ++) {        if(num[i-1] != num[i+1]) continue;         dp[L][R] = (dp[L][R] + (dfs(L, i - 1) * dfs(i+1, R) % mod) * C[R- L][i - L]%mod) % mod;     }    return dp[L][R]; }int main() {    init();    while(scanf("%d", &n) != EOF) {        memset(dp, -1, sizeof(dp));         for(int i = 1;i <= n; i++) scanf("%d", &num[i]);         printf("%I64d\n", dfs(1, n));     }    return 0; }
                                                                                                            ^
0_0_20614363_12695.cpp:11:141: error: 'N' was not declared in this scope
     using namespace std; #define INF 1000000000#define N 111typedef __int64 LL; const LL mod = 1000000007; LL dp[N][N], C[N][N]; int n, num[N]; void init() {    for(int i = 0; i < N; i++) {        for(int j = 0; j <= i; j++) {            if(j == 0 || j == i) C[i][j] = 1;             else C[i][j] = (C[i-1][j-1] + C[i-1][j]) % mod;         }    }}LL dfs(int L, int R) {    if(dp[L][R] != -1) return dp[L][R];     if(L == R) return dp[L][R] = 1;     dp[L][R] = (dfs(L+1, R) + dfs(L, R - 1)) % mod;     for(int i = L+1; i <= R-1; i ++) {        if(num[i-1] != num[i+1]) continue;         dp[L][R] = (dp[L][R] + (dfs(L, i - 1) * dfs(i+1, R) % mod) * C[R- L][i - L]%mod) % mod;     }    return dp[L][R]; }int main() {    init();    while(scanf("%d", &n) != EOF) {        memset(dp, -1, sizeof(dp));         for(int i = 1;i <= n; i++) scanf("%d", &num[i]);         printf("%I64d\n", dfs(1, n));     }    return 0; }
                                                                                                                                             ^
0_0_20614363_12695.cpp: In function 'void init()':
0_0_20614363_12695.cpp:11:181: error: 'N' was not declared in this scope
     using namespace std; #define INF 1000000000#define N 111typedef __int64 LL; const LL mod = 1000000007; LL dp[N][N], C[N][N]; int n, num[N]; void init() {    for(int i = 0; i < N; i++) {        for(int j = 0; j <= i; j++) {            if(j == 0 || j == i) C[i][j] = 1;             else C[i][j] = (C[i-1][j-1] + C[i-1][j]) % mod;         }    }}LL dfs(int L, int R) {    if(dp[L][R] != -1) return dp[L][R];     if(L == R) return dp[L][R] = 1;     dp[L][R] = (dfs(L+1, R) + dfs(L, R - 1)) % mod;     for(int i = L+1; i <= R-1; i ++) {        if(num[i-1] != num[i+1]) continue;         dp[L][R] = (dp[L][R] + (dfs(L, i - 1) * dfs(i+1, R) % mod) * C[R- L][i - L]%mod) % mod;     }    return dp[L][R]; }int main() {    init();    while(scanf("%d", &n) != EOF) {        memset(dp, -1, sizeof(dp));         for(int i = 1;i <= n; i++) scanf("%d", &num[i]);         printf("%I64d\n", dfs(1, n));     }    return 0; }
                                                                                                                                                                                     ^
0_0_20614363_12695.cpp:11:260: error: 'C' was not declared in this scope
     using namespace std; #define INF 1000000000#define N 111typedef __int64 LL; const LL mod = 1000000007; LL dp[N][N], C[N][N]; int n, num[N]; void init() {    for(int i = 0; i < N; i++) {        for(int j = 0; j <= i; j++) {            if(j == 0 || j == i) C[i][j] = 1;             else C[i][j] = (C[i-1][j-1] + C[i-1][j]) % mod;         }    }}LL dfs(int L, int R) {    if(dp[L][R] != -1) return dp[L][R];     if(L == R) return dp[L][R] = 1;     dp[L][R] = (dfs(L+1, R) + dfs(L, R - 1)) % mod;     for(int i = L+1; i <= R-1; i ++) {        if(num[i-1] != num[i+1]) continue;         dp[L][R] = (dp[L][R] + (dfs(L, i - 1) * dfs(i+1, R) % mod) * C[R- L][i - L]%mod) % mod;     }    return dp[L][R]; }int main() {    init();    while(scanf("%d", &n) != EOF) {        memset(dp, -1, sizeof(dp));         for(int i = 1;i <= n; i++) scanf("%d", &num[i]);         printf("%I64d\n", dfs(1, n));     }    return 0; }
                                                                                                                                                                                                                                                                    ^
0_0_20614363_12695.cpp:11:290: error: 'C' was not declared in this scope
     using namespace std; #define INF 1000000000#define N 111typedef __int64 LL; const LL mod = 1000000007; LL dp[N][N], C[N][N]; int n, num[N]; void init() {    for(int i = 0; i < N; i++) {        for(int j = 0; j <= i; j++) {            if(j == 0 || j == i) C[i][j] = 1;             else C[i][j] = (C[i-1][j-1] + C[i-1][j]) % mod;         }    }}LL dfs(int L, int R) {    if(dp[L][R] != -1) return dp[L][R];     if(L == R) return dp[L][R] = 1;     dp[L][R] = (dfs(L+1, R) + dfs(L, R - 1)) % mod;     for(int i = L+1; i <= R-1; i ++) {        if(num[i-1] != num[i+1]) continue;         dp[L][R] = (dp[L][R] + (dfs(L, i - 1) * dfs(i+1, R) % mod) * C[R- L][i - L]%mod) % mod;     }    return dp[L][R]; }int main() {    init();    while(scanf("%d", &n) != EOF) {        memset(dp, -1, sizeof(dp));         for(int i = 1;i <= n; i++) scanf("%d", &num[i]);         printf("%I64d\n", dfs(1, n));     }    return 0; }
                                                                                                                                                                                                                                                                                                  ^
0_0_20614363_12695.cpp:11:328: error: 'mod' was not declared in this scope
 


Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2025 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.001000(s) query 1, Server time : 2025-02-17 07:49:07, Gzip enabled