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_30901065_8899.cpp: In function 'int polya(ll, int)':
0_0_30901065_8899.cpp:36:35: error: no matching function for call to '__gcd(ll&, int&)'
  for__(i,1,n) rt+=qpow(m,__gcd(n,i));
                                   ^
0_0_30901065_8899.cpp:36:35: note: candidate is:
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/algorithm:62:0,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/x86_64-w64-mingw32/bits/stdc++.h:64,
                 from 0_0_30901065_8899.cpp:1:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_algo.h:1229:5: note: template<class _EuclideanRingElement> _EuclideanRingElement std::__gcd(_EuclideanRingElement, _EuclideanRingElement)
     __gcd(_EuclideanRingElement __m, _EuclideanRingElement __n)
     ^
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_algo.h:1229:5: note:   template argument deduction/substitution failed:
0_0_30901065_8899.cpp:36:35: note:   deduced conflicting types for parameter '_EuclideanRingElement' ('long long int' and 'int')
  for__(i,1,n) rt+=qpow(m,__gcd(n,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-29 18:53:09, Gzip enabled