cyclic rotation

static void Main(string[] args)
        {
            int[] input = new int[] {3, 8, 9, 7, 6};
            int k = 3;
            solution(input, k);
        }

        public static int[] solution(int[] input, int times)
        {
            var r = new int[input.Length];

            for (int i = 0; i < input.Length; i++)
            {
                var index = (i + times)%input.Length;
                r[index] = input[i];
            }

            return r;
        }