Borderou de evaluare (job #3229657)
Utilizator | Data | 16 mai 2024 22:49:36 | |
---|---|---|---|
Problema | Long Story Short | Status | done |
Runda | Arhiva de probleme | Compilator | cpp-64 | Vezi sursa |
Scor | 0 |
Raport evaluator
Eroare de compilare:
main.cpp:1:2: warning: #import is a deprecated GCC extension [-Wdeprecated]
1 | #import<bits/stdc++.h>
| ^~~~~~
main.cpp:2:13: warning: multi-character character constant [-Wmultichar]
2 | long long v['ↈ'],n,k,a,i;main(){std::fstream f("lss.in"),g("lss.out",std::_S_out);f>>k>>n;while(i<n)f>>v[i++];std::sort(v,v+n);while(n--)a+=std::max((v[n]-1)%k+1-n,1);g<<a;}
| ^~~
main.cpp:2:26: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
2 | long long v['ↈ'],n,k,a,i;main(){std::fstream f("lss.in"),g("lss.out",std::_S_out);f>>k>>n;while(i<n)f>>v[i++];std::sort(v,v+n);while(n--)a+=std::max((v[n]-1)%k+1-n,1);g<<a;}
| ^~~~
main.cpp: In function 'int main()':
main.cpp:2:149: error: no matching function for call to 'max(long long int, int)'
2 | long long v['ↈ'],n,k,a,i;main(){std::fstream f("lss.in"),g("lss.out",std::_S_out);f>>k>>n;while(i<n)f>>v[i++];std::sort(v,v+n);while(n--)a+=std::max((v[n]-1)%k+1-n,1);g<<a;}
| ~~~~~~~~^~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12.2.1/bits/specfun.h:45,
from /usr/include/c++/12.2.1/cmath:1935,
from /usr/include/c++/12.2.1/x86_64-pc-linux-gnu/bits/stdc++.h:41,
from main.cpp:1:
/usr/include/c++/12.2.1/bits/stl_algobase.h:254:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::max(const _Tp&, const _Tp&)'
254 | max(const _Tp& __a, const _Tp& __b)
| ^~~
/usr/include/c++/12.2.1/bits/stl_algobase.h:254:5: note: template argument deduction/substitution failed:
main.cpp:2:149: note: deduced conflicting types for parameter 'const _Tp' ('long long int' and 'int')
2 | long long v['ↈ'],n,k,a,i;main(){std::fstream f("lss.in"),g("lss.out",std::_S_out);f>>k>>n;while(i<n)f>>v[i++];std::sort(v,v+n);while(n--)a+=std::max((v[n]-1)%k+1-n,1);g<<a;}
| ~~~~~~~~^~~~~~~~~~~~~~~~~~
/usr/include/c++/12.2.1/bits/stl_algobase.h:300:5: note: candidate: 'template<class _Tp, class _Compare> constexpr const _Tp& std::max(const _Tp&, const _Tp&, _Compare)'
300 | max(const _Tp& __a, const _Tp& __b, _Compare __comp)
| ^~~
/usr/include/c++/12.2.1/bits/stl_algobase.h:300:5: note: template argument deduction/substitution failed:
main.cpp:2:149: note: deduced conflicting types for parameter 'const _Tp' ('long long int' and 'int')
2 | long long v['ↈ'],n,k,a,i;main(){std::fstream f("lss.in"),g("lss.out",std::_S_out);f>>k>>n;while(i<n)f>>v[i++];std::sort(v,v+n);while(n--)a+=std::max((v[n]-1)%k+1-n,1);g<<a;}
| ~~~~~~~~^~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12.2.1/algorithm:61,
from /usr/include/c++/12.2.1/x86_64-pc-linux-gnu/bits/stdc++.h:65:
/usr/include/c++/12.2.1/bits/stl_algo.h:5746:5: note: candidate: 'template<class _Tp> constexpr _Tp std::max(initializer_list<_Tp>)'
5746 | max(initializer_list<_Tp> __l)
| ^~~
/usr/include/c++/12.2.1/bits/stl_algo.h:5746:5: note: template argument deduction/substitution failed:
main.cpp:2:149: note: mismatched types 'std::initializer_list<_Tp>' and 'long long int'
2 | long long v['ↈ'],n,k,a,i;main(){std::fstream f("lss.in"),g("lss.out",std::_S_out);f>>k>>n;while(i<n)f>>v[i++];std::sort(v,v+n);while(n--)a+=std::max((v[n]-1)%k+1-n,1);g<<a;}
| ~~~~~~~~^~~~~~~~~~~~~~~~~~
/usr/include/c++/12.2.1/bits/stl_algo.h:5756:5: note: candidate: 'template<class _Tp, class _Compare> constexpr _Tp std::max(initializer_list<_Tp>, _Compare)'
5756 | max(initializer_list<_Tp> __l, _Compare __comp)
| ^~~
/usr/include/c++/12.2.1/bits/stl_algo.h:5756:5: note: template argument deduction/substitution failed:
main.cpp:2:149: note: mismatched types 'std::initializer_list<_Tp>' and 'long long int'
2 | long long v['ↈ'],n,k,a,i;main(){std::fstream f("lss.in"),g("lss.out",std::_S_out);f>>k>>n;while(i<n)f>>v[i++];std::sort(v,v+n);while(n--)a+=std::max((v[n]-1)%k+1-n,1);g<<a;}
| ~~~~~~~~^~~~~~~~~~~~~~~~~~
Non zero exit status: 1
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !