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_33638657_31173.cpp:9:49: error: 'int pow [120]' redeclared as different kind of symbol
 int map[maxn][maxn],vis[maxn],dis[maxn],pow[maxn],dp[maxx];
                                                 ^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/cmath:44:0,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/random:38,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_algo.h:66,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/algorithm:62,
                 from 0_0_33638657_31173.cpp:2:
GCC4.9.2/x86_64-w64-mingw32/include/math.h:151:18: note: previous declaration 'double pow(double, double)'
   double __cdecl pow(double _X,double _Y);
                  ^
0_0_33638657_31173.cpp: In function 'int main()':
0_0_33638657_31173.cpp:40:26: error: ISO C++ forbids applying 'sizeof' to an expression of function type [-fpermissive]
   memset(pow,0,sizeof(pow));
                          ^
0_0_33638657_31173.cpp:40:27: error: cannot resolve overloaded function 'pow' based on conversion to type 'void*'
   memset(pow,0,sizeof(pow));
                           ^
0_0_33638657_31173.cpp:55:21: error: invalid types '<unresolved overloaded function type>[int]' for array subscript
    scanf("%d",&pow[i]);
                     ^
0_0_33638657_31173.cpp:56:21: error: invalid types '<unresolved overloaded function type>[int]' for array subscript
    sum = sum + pow[i];
                     ^
0_0_33638657_31173.cpp:60:31: error: invalid types '<unresolved overloaded function type>[int]' for array subscript
    for(int j = sum; j >= pow[i]; j--) {
                               ^
0_0_33638657_31173.cpp:61:35: error: invalid types '<unresolved overloaded function type>[int]' for array subscript
     dp[j] = max(dp[j],dp[j - pow[i]] + dis[i]);
                                   ^


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 13:37:46, Gzip enabled