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_15680758_17432.cpp:12:12: error: 'ull pow [2000005]' redeclared as different kind of symbol
 ull pow[LEN];
            ^
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_15680758_17432.cpp:6:
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_15680758_17432.cpp: In member function 'void Segment_Tree::up(int)':
0_0_15680758_17432.cpp:20:57: error: invalid types '<unresolved overloaded function type>[int]' for array subscript
   tree[k].Hash=tree[k<<1].Hash*pow[tree[k].R-tree[k].mid]+tree[k<<1|1].Hash;
                                                         ^
0_0_15680758_17432.cpp: In member function 'ull Segment_Tree::query(int, int, int)':
0_0_15680758_17432.cpp:39:53: error: invalid types '<unresolved overloaded function type>[int]' for array subscript
   return query(L,tree[k].mid,k<<1)*pow[R-tree[k].mid]+query(tree[k].mid+1,R,k<<1|1);
                                                     ^
0_0_15680758_17432.cpp: In function 'void pre_pro()':
0_0_15680758_17432.cpp:57:7: error: invalid types '<unresolved overloaded function type>[int]' for array subscript
  pow[0]=1;
       ^
0_0_15680758_17432.cpp:59:8: error: invalid types '<unresolved overloaded function type>[int]' for array subscript
   pow[i]=pow[i-1]*B;
        ^
0_0_15680758_17432.cpp:59:17: error: invalid types '<unresolved overloaded function type>[int]' for array subscript
   pow[i]=pow[i-1]*B;
                 ^


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 17:33:27, Gzip enabled