We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Implementation
  4. Manasa and Stones
  5. Discussions

Manasa and Stones

  • tangjiaqing
     + 0 comments

    I think there is something wrong with the examples except for the first one. The first parameter represents non-zero stone. However, in the rest example, including the test cases, n represents total number of stones including non-zero. This is the solution to pass all of the tests.

    public static List<int> Run(int count, int diff1, int diff2)
{
	if (diff1 == diff2) return [diff1 * (count - 1)];

	var small = diff1 < diff2 ? diff1 : diff2;
	var large = diff1 < diff2 ? diff2 : diff1;

	var start = small * (count - 1);
	var end = large * (count - 1);
	var step = large - small;

	if (start == 0) start += step;

	var faces = new List<int>();

	for (var i = start; i <= end; i += step)
	{
		faces.Add(i);
	}

	return faces;
}