#4028
NumarDeSubmultimi1
Să se determine numărul de submulțimi nevide ale mulțimii {1, 2,..., n}
cu proprietatea că oricare două elemente dintr-o submulțime au diferența în modul strict mai mare decât 1
.
Problema | NumarDeSubmultimi1 | Operații I/O |
![]() |
---|---|---|---|
Limita timp | 0.01 secunde | Limita memorie |
Total: 0.1 MB
/
Stivă 0.1 MB
|
Id soluție | #51043781 | Utilizator | |
Fișier | numardesubmultimi1.cpp | Dimensiune | 711 B |
Data încărcării | 20 Mai 2024, 23:59 | Scor / rezultat | 100 puncte |
numardesubmultimi1.cpp: In function 'std::vector<int> prod(const std::vector<int>&, const std::vector<int>&)': numardesubmultimi1.cpp:9:45: warning: narrowing conversion of '(((((long long int)(& a)->std::vector<_Tp, _Alloc>::operator[]<int, std::allocator<int> >(0u)) * ((long long int)(& b)->std::vector<_Tp, _Alloc>::operator[]<int, std::allocator<int> >(0u))) + (((long long int)(& a)->std::vector<_Tp, _Alloc>::operator[]<int, std::allocator<int> >(1u)) * ((long long int)(& b)->std::vector<_Tp, _Alloc>::operator[]<int, std::allocator<int> >(2u)))) % 777013ll)' from 'long long int' to 'int' inside { } [-Wnarrowing] (1ll*a[0] * b[0] + 1ll*a[1] * b[2]) % mod, ^ numardesubmultimi1.cpp:9:45: warning: narrowing conversion of '(((((long long int)(& a)->std::vector<_Tp, _Alloc>::operator[]<int, std::allocator<int> >(0u)) * ((long long int)(& b)->std::vector<_Tp, _Alloc>::operator[]<int, std::allocator<int> >(0u))) + (((long long int)(& a)->std::vector<_Tp, _Alloc>::operator[]<int, std::allocator<int> >(1u)) * ((long long int)(& b)->std::vector<_Tp, _Alloc>::operator[]<int, std::allocator<int> >(2u)))) % 777013ll)' from 'long long int' to 'int' inside { } [-Wnarrowing] numardesubmultimi1.cpp:10:45: warning: narrowing conversion of '(((((long long int)(& a)->std::vector<_Tp, _Alloc>::operator[]<int, std::allocator<int> >(0u)) * ((long long int)(& b)->std::vector<_Tp, _Alloc>::operator[]<int, std::allocator<int> >(1u))) + (((long long int)(& a)->std::vector<_Tp, _Alloc>::operator[]<int, std::allocator<int> >(1u)) * ((long long int)(& b)->std::vector<_Tp, _Alloc>::operator[]<int, std::allocator<int> >(3u)))) % 777013ll)' from 'long long int' to 'int' inside { } [-Wnarrowing] (1ll*a[0] * b[1] + 1ll*a[1] * b[3]) % mod, ^ numardesubmultimi1.cpp:10:45: warning: narrowing conversion of '(((((long long int)(& a)->std::vector<_Tp, _Alloc>::operator[]<int, std::allocator<int> >(0u)) * ((long long int)(& b)->std::vector<_Tp, _Alloc>::operator[]<int, std::allocator<int> >(1u))) + (((long long int)(& a)->std::vector<_Tp, _Alloc>::operator[]<int, std::allocator<int> >(1u)) * ((long long int)(& b)->std::vector<_Tp, _Alloc>::operator[]<int, std::allocator<int> >(3u)))) % 777013ll)' from 'long long int' to 'int' inside { } [-Wnarrowing] numardesubmultimi1.cpp:11:45: warning: narrowing conversion of '(((((long long int)(& a)->std::vector<_Tp, _Alloc>::operator[]<int, std::allocator<int> >(2u)) * ((long long int)(& b)->std::vector<_Tp, _Alloc>::operator[]<int, std::allocator<int> >(0u))) + (((long long int)(& a)->std::vector<_Tp, _Alloc>::operator[]<int, std::allocator<int> >(3u)) * ((long long int)(& b)->std::vector<_Tp, _Alloc>::operator[]<int, std::allocator<int> >(2u)))) % 777013ll)' from 'long long int' to 'int' inside { } [-Wnarrowing] (1ll*a[2] * b[0] + 1ll*a[3] * b[2]) % mod, ^ numardesubmultimi1.cpp:11:45: warning: narrowing conversion of '(((((long long int)(& a)->std::vector<_Tp, _Alloc>::operator[]<int, std::allocator<int> >(2u)) * ((long long int)(& b)->std::vector<_Tp, _Alloc>::operator[]<int, std::allocator<int> >(0u))) + (((long long int)(& a)->std::vector<_Tp, _Alloc>::operator[]<int, std::allocator<int> >(3u)) * ((long long int)(& b)->std::vector<_Tp, _Alloc>::operator[]<int, std::allocator<int> >(2u)))) % 777013ll)' from 'long long int' to 'int' inside { } [-Wnarrowing] numardesubmultimi1.cpp:12:45: warning: narrowing conversion of '(((((long long int)(& a)->std::vector<_Tp, _Alloc>::operator[]<int, std::allocator<int> >(2u)) * ((long long int)(& b)->std::vector<_Tp, _Alloc>::operator[]<int, std::allocator<int> >(1u))) + (((long long int)(& a)->std::vector<_Tp, _Alloc>::operator[]<int, std::allocator<int> >(3u)) * ((long long int)(& b)->std::vector<_Tp, _Alloc>::operator[]<int, std::allocator<int> >(3u)))) % 777013ll)' from 'long long int' to 'int' inside { } [-Wnarrowing] (1ll*a[2] * b[1] + 1ll*a[3] * b[3]) % mod ^ numardesubmultimi1.cpp:12:45: warning: narrowing conversion of '(((((long long int)(& a)->std::vector<_Tp, _Alloc>::operator[]<int, std::allocator<int> >(2u)) * ((long long int)(& b)->std::vector<_Tp, _Alloc>::operator[]<int, std::allocator<int> >(1u))) + (((long long int)(& a)->std::vector<_Tp, _Alloc>::operator[]<int, std::allocator<int> >(3u)) * ((long long int)(& b)->std::vector<_Tp, _Alloc>::operator[]<int, std::allocator<int> >(3u)))) % 777013ll)' from 'long long int' to 'int' inside { } [-Wnarrowing]
Test | Timp | Mesaj evaluare | Scor posibil | Scor obținut | ||
---|---|---|---|---|---|---|
1 | 0 secunde | OK. | 20 | 20 | Exemplu | |
2 | 0 secunde | OK. | 20 | 20 | ||
3 | 0 secunde | OK. | 20 | 20 | ||
4 | 0 secunde | OK. | 20 | 20 | ||
5 | 0 secunde | OK. | 20 | 20 | ||
Punctaj total | 100 |
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema NumarDeSubmultimi1 face parte din prima categorie. Soluția propusă de tine va fi evaluată astfel:
Suma punctajelor acordate pe testele utilizate pentru verificare este 100. Astfel, soluția ta poate obține cel mult 100 de puncte, caz în care se poate considera corectă.