Watson gives to Sherlock an array: A1,A2,⋯,AN. He also gives to Sherlock two other arrays: B1,B2,⋯,BM and C1,C2,⋯,CM. Then Watson asks Sherlock to perform the following program:
for i = 1 to M do
for j = 1 to N do
if j % B[i] == 0 then
A[j] = A[j] * C[i]
endif
end do
end ...
@rolfl I would perhaps give him some hints about how to come to that conclusion, but I would not give him the O(n) solution directly (partially because I don't know it, although I have seen a similar question very recently around here)
In 1801, a guy called Carl Friedrich Gauss studied problems where the number line wrapped around, called Modular Arithmetic.
In his studies, he proved that:
$$
(a \times b) \% n = (a)\%n \times (b)\%n
$$
Also, 1000000007 is a prime number which means that there are other benefits...
And, ...
@SimonAndréForsberg - there, I solved the problem for him.
I have a small game I'm working on with a set of interfaces:
IHavePosition:
public interface IHavePosition<T>
{
T Position { get; set; }
}
ICanMove:
public interface ICanMove<T> : IHavePosition<T>
{
IEnumerable<IMotor<T>> Motors { get; set; }
}
ICharacter:
public inter...
I just can't find a way to make that a close reason
I expect people to bring their best work that they can do, and we can take them that next step forward.
So, if the other stuff is on topic, but not great, I can alsways just downvote the folk who I think are lazy, and answer and help the folk I think are trying, and are 'worth it'.
@rolfl I think that is a good approach for the moment, yes
@rolfl I think that could be a good meta question. "How can we avoid making Code Review a place where lazy people go?", with some links to questions that we want to avoid for that reason (such as the prolog question from earlier)
Watson gives to Sherlock an array: A1,A2,⋯,AN. He also gives to Sherlock two other arrays: B1,B2,⋯,BM and C1,C2,⋯,CM. Then Watson asks Sherlock to perform the following program:
for i = 1 to M do
for j = 1 to N do
if j % B[i] == 0 then
A[j] = A[j] * C[i]
endif
end do
end ...
In 1801, a guy called Carl Friedrich Gauss studied problems where the number line wrapped around, called Modular Arithmetic.
In his studies, he proved that:
$$
(a \times b) \% n = (a)\%n \times (b)\%n
$$
Also, 1000000007 is a prime number which means that there are other benefits...
And, ...
I have a small game I'm working on with a set of interfaces:
IHavePosition:
public interface IHavePosition<T>
{
T Position { get; set; }
}
ICanMove:
public interface ICanMove<T> : IHavePosition<T>
{
IEnumerable<IMotor<T>> Motors { get; set; }
}
ICharacter:
public inter...
Code Review - Discussion about help v…
Code Review - Discussion about help v…