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_20613040_12708.cpp:4:5: error: 'c' does not name a type
     c||k+n2>c||l+n3>c) continue;                         temp = dp[i-1][j][k][l]+(n1!=0)+(n2!=0)+(n3!=0);                         if(dp[i][j+n1][k+n2][l+n3]==-1||dp[i][j+n1][k+n2][l+n3]>temp)                            dp[i][j+n1][k+n2][l+n3]=temp;                       }             }    int maxn=inf;    for(int i=0;i<=c;i++)      for(int j=0;j<=c;j++)      {         if(i+j>m) continue;         if(dp[16][i][j][m-i-j] == -1) continue;         if(dp[16][i][j][m-i-j]<maxn)            maxn=dp[16][i][j][m-i-j];      }      printf("Case %d: %d\n",T,maxn);  }}
     ^
0_0_20613040_12708.cpp:4:58: error: 'temp' does not name a type
     c||k+n2>c||l+n3>c) continue;                         temp = dp[i-1][j][k][l]+(n1!=0)+(n2!=0)+(n3!=0);                         if(dp[i][j+n1][k+n2][l+n3]==-1||dp[i][j+n1][k+n2][l+n3]>temp)                            dp[i][j+n1][k+n2][l+n3]=temp;                       }             }    int maxn=inf;    for(int i=0;i<=c;i++)      for(int j=0;j<=c;j++)      {         if(i+j>m) continue;         if(dp[16][i][j][m-i-j] == -1) continue;         if(dp[16][i][j][m-i-j]<maxn)            maxn=dp[16][i][j][m-i-j];      }      printf("Case %d: %d\n",T,maxn);  }}
                                                          ^
0_0_20613040_12708.cpp:4:131: error: expected unqualified-id before 'if'
     c||k+n2>c||l+n3>c) continue;                         temp = dp[i-1][j][k][l]+(n1!=0)+(n2!=0)+(n3!=0);                         if(dp[i][j+n1][k+n2][l+n3]==-1||dp[i][j+n1][k+n2][l+n3]>temp)                            dp[i][j+n1][k+n2][l+n3]=temp;                       }             }    int maxn=inf;    for(int i=0;i<=c;i++)      for(int j=0;j<=c;j++)      {         if(i+j>m) continue;         if(dp[16][i][j][m-i-j] == -1) continue;         if(dp[16][i][j][m-i-j]<maxn)            maxn=dp[16][i][j][m-i-j];      }      printf("Case %d: %d\n",T,maxn);  }}
                                                                                                                                   ^
0_0_20613040_12708.cpp:4:272: error: expected declaration before '}' token
     c||k+n2>c||l+n3>c) continue;                         temp = dp[i-1][j][k][l]+(n1!=0)+(n2!=0)+(n3!=0);                         if(dp[i][j+n1][k+n2][l+n3]==-1||dp[i][j+n1][k+n2][l+n3]>temp)                            dp[i][j+n1][k+n2][l+n3]=temp;                       }             }    int maxn=inf;    for(int i=0;i<=c;i++)      for(int j=0;j<=c;j++)      {         if(i+j>m) continue;         if(dp[16][i][j][m-i-j] == -1) continue;         if(dp[16][i][j][m-i-j]<maxn)            maxn=dp[16][i][j][m-i-j];      }      printf("Case %d: %d\n",T,maxn);  }}
                                                                                                                                                                                                                                                                                ^


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-26 12:31:52, Gzip enabled