I've got the answer, I just need someone to explain it, please!
...
![subject](/tpl/images/cats/informatica.png)
Computers and Technology, 15.12.2020 14:00 Taylor129
I've got the answer, I just need someone to explain it, please!
![ansver](/tpl/images/cats/User.png)
Answers: 2
![](/tpl/images/ask_question.png)
![](/tpl/images/ask_question_mob.png)
Another question on Computers and Technology
![question](/tpl/images/cats/informatica.png)
Computers and Technology, 24.06.2019 20:00
Write c++programs for the following problem: let the user enter two numbers and display which is greater. !
Answers: 1
![question](/tpl/images/cats/informatica.png)
Computers and Technology, 24.06.2019 23:30
Which example can be considered master data in an organization? a. holiday list b. dress code c. employee information d. recreational activities
Answers: 1
![question](/tpl/images/cats/informatica.png)
Computers and Technology, 25.06.2019 05:30
When a game allows you to pick party members from a large pool, each with different classes and roles but in which no single party combination is clearly superior to others, the game is using: intransitive relationships transitive relationships orthogonal relationships parallel relationships
Answers: 1
![question](/tpl/images/cats/informatica.png)
Computers and Technology, 25.06.2019 21:10
In this problem, we want to determine a set of states with the smallest total population that achieves an electoral college win. specifically, for each state i, for i = 1, 2, . . , n, let pi be its population and vi its electoral votes. all electoral votes of a state go a single candidate, and so the (overall) winning candidate is the one who receives at least v = b( p i vi)/2c + 1 electoral votes. our goal is to find the set of states s for which p i∈s pi is as small as possible subject to the constraint that p i∈s vi ≥ v . design a dynamic programming algorithm for this problem; prove its correctness; and analyze its time complexity.
Answers: 3
You know the right answer?
Questions
![question](/tpl/images/cats/biologiya.png)
Biology, 28.07.2019 07:30
![question](/tpl/images/cats/mat.png)
![question](/tpl/images/cats/en.png)
![question](/tpl/images/cats/en.png)
![question](/tpl/images/cats/istoriya.png)
History, 28.07.2019 07:30
![question](/tpl/images/cats/istoriya.png)
History, 28.07.2019 07:30
![question](/tpl/images/cats/himiya.png)
![question](/tpl/images/cats/fizika.png)
![question](/tpl/images/cats/istoriya.png)
![question](/tpl/images/cats/biologiya.png)
![question](/tpl/images/cats/fizika.png)
![question](/tpl/images/cats/biologiya.png)
![question](/tpl/images/cats/mat.png)
Mathematics, 28.07.2019 07:30
![question](/tpl/images/cats/obshestvoznanie.png)
Social Studies, 28.07.2019 07:30
![question](/tpl/images/cats/obshestvoznanie.png)
Social Studies, 28.07.2019 07:30
![question](/tpl/images/cats/istoriya.png)
History, 28.07.2019 07:30
![question](/tpl/images/cats/fizika.png)
![question](/tpl/images/cats/obshestvoznanie.png)
Social Studies, 28.07.2019 07:30
![question](/tpl/images/cats/obshestvoznanie.png)
Social Studies, 28.07.2019 07:30
![question](/tpl/images/cats/biologiya.png)
Biology, 28.07.2019 07:30