Borderou de evaluare (job #3195128)
Utilizator | Data | 20 ianuarie 2024 10:03:37 | |
---|---|---|---|
Problema | Parantezare optima de matrici | Status | done |
Runda | Arhiva educationala | Compilator | cpp-64 | Vezi sursa |
Scor | 0 |
Raport evaluator
Eroare de compilare:
main.cpp: In function 'int main()':
main.cpp:20:20: error: 'INT_MAX' was not declared in this scope
20 | int best = INT_MAX;
| ^~~~~~~
main.cpp:2:1: note: 'INT_MAX' is defined in header '<climits>'; did you forget to '#include <climits>'?
1 | #include <iostream>
+++ |+#include <climits>
2 |
main.cpp:23:23: error: no matching function for call to 'min(int&, long long int)'
23 | best = min(best, dp[i][k] + dp[k+1][j] + d[i-1]*d[k]*d[j]);
| ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12.2.1/string:50,
from /usr/include/c++/12.2.1/bits/locale_classes.h:40,
from /usr/include/c++/12.2.1/bits/ios_base.h:41,
from /usr/include/c++/12.2.1/ios:42,
from /usr/include/c++/12.2.1/ostream:38,
from /usr/include/c++/12.2.1/iostream:39,
from main.cpp:1:
/usr/include/c++/12.2.1/bits/stl_algobase.h:230:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::min(const _Tp&, const _Tp&)'
230 | min(const _Tp& __a, const _Tp& __b)
| ^~~
/usr/include/c++/12.2.1/bits/stl_algobase.h:230:5: note: template argument deduction/substitution failed:
main.cpp:23:23: note: deduced conflicting types for parameter 'const _Tp' ('int' and 'long long int')
23 | best = min(best, dp[i][k] + dp[k+1][j] + d[i-1]*d[k]*d[j]);
| ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12.2.1/bits/stl_algobase.h:278:5: note: candidate: 'template<class _Tp, class _Compare> constexpr const _Tp& std::min(const _Tp&, const _Tp&, _Compare)'
278 | min(const _Tp& __a, const _Tp& __b, _Compare __comp)
| ^~~
/usr/include/c++/12.2.1/bits/stl_algobase.h:278:5: note: template argument deduction/substitution failed:
main.cpp:23:23: note: deduced conflicting types for parameter 'const _Tp' ('int' and 'long long int')
23 | best = min(best, dp[i][k] + dp[k+1][j] + d[i-1]*d[k]*d[j]);
| ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Non zero exit status: 1
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !