© 2026 Hedgehog Software, LLC

TwitterGitHubDiscord
More
CommunitiesDocsAboutTermsPrivacy
Search
Star
Setup for Free
C#C
C#•3y ago•
10 replies
Spekulant

❔ just a quick help

using System;
using System.Collections.Generic;
using System.Linq;

class Program {
    static void Main(string[] args) {
        string[] input = Console.ReadLine().Split("  ");
        int[] limits = input[0].Split().Select(int.Parse).ToArray();
        int[] initial = input[1].Split().Select(int.Parse).ToArray();


        int m = limits.Max();
        List<int> res = new List<int>();
        List<int> resMoves = new List<int>();

        for (int i = 0; i <= m; i++) {
            int[] cur = initial.ToArray();
            Queue<int[]> queue = new Queue<int[]>();
            queue.Enqueue(cur);
            Queue<int> depth = new Queue<int>();
            depth.Enqueue(0);

            List<int[]> history = new List<int[]>();

            while (queue.Count > 0) {
                cur = queue.Dequeue();
                history.Add(cur);
                int curDepth = depth.Dequeue();

                if (cur.Contains(i)) {
                    res.Add(i);
                    resMoves.Add(curDepth);
                    break;
                }
using System;
using System.Collections.Generic;
using System.Linq;

class Program {
    static void Main(string[] args) {
        string[] input = Console.ReadLine().Split("  ");
        int[] limits = input[0].Split().Select(int.Parse).ToArray();
        int[] initial = input[1].Split().Select(int.Parse).ToArray();


        int m = limits.Max();
        List<int> res = new List<int>();
        List<int> resMoves = new List<int>();

        for (int i = 0; i <= m; i++) {
            int[] cur = initial.ToArray();
            Queue<int[]> queue = new Queue<int[]>();
            queue.Enqueue(cur);
            Queue<int> depth = new Queue<int>();
            depth.Enqueue(0);

            List<int[]> history = new List<int[]>();

            while (queue.Count > 0) {
                cur = queue.Dequeue();
                history.Add(cur);
                int curDepth = depth.Dequeue();

                if (cur.Contains(i)) {
                    res.Add(i);
                    resMoves.Add(curDepth);
                    break;
                }
C# banner
C#Join
We are a programming server aimed at coders discussing everything related to C# (CSharp) and .NET.
61,871Members
Resources

Similar Threads

Was this page helpful?
Recent Announcements

Similar Threads

Need help with a quick question
C#CC# / help
4y ago
✅ just a quick question about if, else, else if
C#CC# / help
2y ago
❔ A quick question
C#CC# / help
3y ago
Quick Help with some basic things x)
C#CC# / help
3y ago