Ubuntu 16.04. Thunderbird 60.2.1 (64 bits) Calendar has disappeared.
That change in Thunderbird, which is automatically updated, costed me 1 hour of research and work. How many hours these guys took from ppl around the world? Is seems they just don't care. Because, maybe, they become big.
For now:
1. Remove Lighting from Thunderbird.
2. Close Thunderbird
3. sudo apt install xul-ext-lightning
4. Start Thunderbird again.
Calendar is here again.
Or... you may try to download and install appropriate version of Lighting:
- versions: https://developer.mozilla.org/en-US/docs/Mozilla/Calendar/Calendar_Versions#Stable_Releases
- downloads: https://ftp.mozilla.org/pub/calendar/lightning/candidates/
For tomorrow, seriously consider different pim tool, because you may find yourself in not comfortable situation.
czwartek, 8 listopada 2018
czwartek, 25 października 2018
Codility FibFrogg
Idea: This is a search graph task. A used this explanation of the algorithm LINK.
In first step you check all possible single jumps from start point. This creates a new "row" of starting positions.
In next step you check all possible single jumps from every start position in the "row".
Sum of found new positions create another row.
You skip if you find a possible jump to the position which was "visited" previously, because there is a shorter or equal path to that position.
You stop when any jump will reach "end position" or you cant find a position to jump anymore. Code:
In first step you check all possible single jumps from start point. This creates a new "row" of starting positions.
In next step you check all possible single jumps from every start position in the "row".
Sum of found new positions create another row.
You skip if you find a possible jump to the position which was "visited" previously, because there is a shorter or equal path to that position.
You stop when any jump will reach "end position" or you cant find a position to jump anymore. Code:
wtorek, 16 października 2018
Codility-CommonPrimeDivisors version by PrimeFactorization
It's much slower solution than by using Greatest Common Divisor, but it's different and still gets 100% on Codility platform
Codility-CommonPrimeDivisors version by GCD
It's tricky task. I used some help via internet.
Idea: Greatest common divisor of A and B consists of EVERY prime divisor of A & B. Consists or contains. There is no such a number E that would be prime, and divisor of A and B that GCD(A,B) * E = A && GCD(A,B) * E =B
Once you have GCD, you divide a number by it. That number can be considered as a "row" of prime factors and their exponents. So dividing number by GCD will remove some factors or their exponents.
Then you create a new GCD value form divided number and old GCD value. And repeat dividing. Eventually GCD will become = 1. Then there are two possibilities:
(last) divided number = 1 number consisted only with prime divisors contained in original GCD
(last) divided number != 1 number consists of some more prime divisors than original GCD
Idea: Greatest common divisor of A and B consists of EVERY prime divisor of A & B. Consists or contains. There is no such a number E that would be prime, and divisor of A and B that GCD(A,B) * E = A && GCD(A,B) * E =B
Once you have GCD, you divide a number by it. That number can be considered as a "row" of prime factors and their exponents. So dividing number by GCD will remove some factors or their exponents.
Then you create a new GCD value form divided number and old GCD value. And repeat dividing. Eventually GCD will become = 1. Then there are two possibilities:
(last) divided number = 1 number consisted only with prime divisors contained in original GCD
(last) divided number != 1 number consists of some more prime divisors than original GCD
wtorek, 9 października 2018
sobota, 6 października 2018
Subskrybuj:
Posty (Atom)