eight | Phone book for LDAP | Identity Management library

I have an issue with my application. I'm creating a "simple" mobile game where I have a list of a button that have an opacity of 0.4 and I take one random button in the list and set it opacity to 1. And my point is to have two button generated, so for now I just called the function twice at the start but the problem is that when the two button are the same it generates just one after. I hope you'll understand (I'm French).

I am in need of help proving that an algorithm has greedy choice property and optimal substructure.

Context of the problem:

Consider a problem where a company owns n gas stations that are connected by a highway. Each gas station has a limited supply g_i of gas-cans. Since the company don't know which gas station is most visited they want all of them to have the same amount of gas.

So they hire a fueling-truck to haul gas between the stations in their truck. However, truck also consumes 1 gas-can per kilometer driven.

Your task will be to help the chain calculate the largest amount of gas-cans g_bar they can have at all Stations.

Consider the example: Here we have g = (20, 40, 80, 10, 20) and p = (0, 5, 13, 33, 36) (in kilometers). In order to send one gas-can from station 3 to station 4 we need to put 41 gas-cans in the truck, as the fueling-truck will consume 40 before reaching their destination (to send two gas-cans we need to put 42 in the truck). The optimal g_bar for the example is 21 and can be achieved as follows:

1. Station 2 sends 11 gas-cans towards Station 1. One gas-can arrives while ten are consumed on the way.

2. Station 3 sends 59 gas-cans towards Station 4. 19 arrive while 40 are consumed on the way.

3. Station 4 now has 29 gas-cans and send eight towards Station 5. Two of these arrive and six are consumed on the way.

4. The final distribution of gas-cans is: (21, 29, 21, 21, 22).

Given an integer g_bar. Determine whether it is possible to get at least g_bar gas-cans in every Gas Station.

in order for the greedy choice property and optimal substructure to make sense for a decision problem, you can define an optimal solution to be a solution with at least g_bar gas-cans in every gas station if such a solution exists; otherwise, any solution is an optimal solution.

Input: The position p_i and gas-can supply g_i of each bar. Here g_i is the supply for the bar at position p_i. You may assume that the positions are in sorted order – i.e. p_1 < p_2 < . . . < p_n.

Output: The largest amount g_bar, such that each gas-station can have a gas-can supply of at least g_bar after the truck have transferred gas-cans between the stations.

How can i prove Greedy Choice and Optimal Substructure for this?

I'm currently in the process of learning C++ and for that I'm reading the book "C++ Primer". The book is pretty good so far and I have learned a lot however I experienced weird behaviour using a vector and I'm unsure if this is right or if it's a problem from my side.

The task is:

Read a sequence of words from cin and store the values a vector. After you've read all the words, process the vector and change each word to uppercase. Print the transformed elements, eight words to a line."

This is my code:

In this picture, I have to draw four charts, but there are spaces around the charts, and I don't know how to remove them. 

Although I have used regular expressions fairly often, I rarely create my own. I've been reading up on them recently as I need to create some fairly specific expressions for a project I am working on.

I have a very specific brief as to which telephone numbers are allowed in a form. There are restrictions on either the first two or else the first three numbers.

Numbers must start with 06 or 07, or alternatively with 081, 082, 083 or 084.

I have written a regular expression with a conditional statement that I believe should do one of two things:

1. If the number starts with 06 or 07, then check that the other 8 characters in the string are numbers.
2. If the number starts with 08, check that the next character is between 1 and 4, then check that the other 7 characters are numbers.

I used this tutorial to learn how conditionals work in regex. Here is the expression that I created:

I have 2 issues:

1. Array split functionality as I cannot use it not sure why?
2. Words are not highlighting.

Consider this map of (A ∧ D) ∨ (B ∧ D) ∨ (A ∧ ¬B ∧ C ∧ D):

The map is grouped into two sections, both of four squares. Thus producing the simplified expression of (B ∧ D) ∨ (A ∧ D) as shown below.

This is in following with the rule:

"Groups must contain 1, 2, 4, 8, or in general 2^n cells"

However, if I were to group in such a way that groups contain six cells (not following the 2^n rule):

This would produce the simplified expression of:

I have the following code where I need to do direct comparisons between the ranks. For example I need to be able to do self as u8 + 1 == other as u8.

I can't understand why Rust complains ("can't borrow as immutable because also borrowed as mutable") in this code (even considering that .len() is a "constant/harmless" function):