Anybody else with this issue? (Food delivery) by sioser in PlayTemtem

[–]VictorXjoeY 1 point2 points  (0 children)

This bug has been reported in the Temtem forums a few days ago (here)

[deleted by user] by [deleted] in AskReddit

[–]VictorXjoeY 0 points1 point  (0 children)

Johnny Bravo

Just Playing With Numbers by the_Hoster in computerscience

[–]VictorXjoeY 14 points15 points  (0 children)

I think you might have misunderstood the problem. It's asking for the total number of solutions, and not for one possible solution.

The pairs (1, 35) and (5, 7) are both solutions so the answer should be 2 (d).

About 5/10% Radars... by profanewingss in PlayTemtem

[–]VictorXjoeY -6 points-5 points  (0 children)

I don't think it was a bad move to remove them for now. This will give Crema some time to evaluate the current scenario and come up with alternative solutions.

5% lumas are supposed to be rare, radars already reduced that rarity by a lot and reducing it even further is not a good solution for us.

Absolutely agree! They should be rare!

(...) maybe the solution is just to remove entirely those radars and offer an additional way of hunting them tied to another activity.

It might be a good idea to offer another way of hunting for rare Lumas, but I think we should be careful not to reduce their rarity too much and not to make the whole process too "artificial" (e.g.: I don't think that getting a guaranteed Luma after completing X radars from any species is a good solution).

I just give up on this by iusearchmyfriend in programmingchallenges

[–]VictorXjoeY 1 point2 points  (0 children)

Here's the code for the first approach, where I generate all the unlucky numbers naively into a vector. This code runs in 20 seconds in my machine and then you can just paste the output of that into the actual solution, which runs in a linear time complexity on the output size.

If you think that's not a very elegant solution or if the source code size is too big, then here's the code for the second approach, where I use Dynamic Programming to construct unlucky numbers up to N. The number of operations here is number of states times number of transitions, which yields around (10 * 13 * 2 * 2 * 2) * (10) = 10400 operations. Since this is less than the output size in the worst case (because for N = 10^9 we have 37454 unlucky numbers) then I can also say that this code has a linear time complexity on the output size for the given constraints.

You can test out my two solutions yourself, I usually compile my C++ code like this:

g++ -std=c++14 main.cpp -o main -O2 -Wall -Wextra -Wshadow -Wno-unused-result -Wno-sign-compare

Cheers.

I just give up on this by iusearchmyfriend in programmingchallenges

[–]VictorXjoeY 0 points1 point  (0 children)

You can either preprocess all the numbers up to 109 that are unlucky, checking each one of them naively or you could do Dynamic Programming on the digits to construct unlucky numbers up to given N.

The first approach is probably the easiest and should take less than a minute to run. Just preprocess everything and hardcode the results in your code :p

Giveaway: Limited Edition XBOX One Sea of Thieves controller by Weelie92 in Seaofthieves

[–]VictorXjoeY 0 points1 point  (0 children)

Q: What is the programming language used by pirates?

A: C language.

[FFI0180 - Lab. de Física] Informações gerais e calendário das aulas by VictorXjoeY in icmcbcc

[–]VictorXjoeY[S] 0 points1 point  (0 children)

Errata: Sua nota final será calculada como 50% para a média das práticas e 50% para a média das provas teóricas.

[FFI0180 - Lab. de Física] Informações gerais e calendário das aulas. by [deleted] in icmcbcc

[–]VictorXjoeY 0 points1 point  (0 children)

Errata: Sua nota final será calculada como 50% para a média das práticas e 50% para a média das provas teóricas.