Welcome to OGeek Q&A Community for programmer and developer-Open, Learning and Share
Welcome To Ask or Share your Answers For Others

Categories

0 votes
210 views
in Technique[技术] by (71.8m points)

c# - Codeforces problem under the name of : Restore the Permutation by Merger

So as i wrote in the title i have a problem at solving this problem. https://codeforces.com/problemset/problem/1385/B

It seems working but i just can not figure out how to add back the solution in a correct way, as it expected in the output.

class Program
{
    static void Main(string[] args)
    {
        int n = int.Parse(Console.ReadLine());
        int n_elements = int.Parse(Console.ReadLine());
        for (int i = 1; i <= n; i++)
        {
            int[] k = Console.ReadLine().Split().Select(int.Parse).ToArray();
            int[] l = k.Distinct().ToArray();              
         
            foreach (var item in l)
            {
                Console.Write(item + " ");
            }
        }
    }
}

Thanks for your time looking at this silly problem :)

question from:https://stackoverflow.com/questions/65925713/codeforces-problem-under-the-name-of-restore-the-permutation-by-merger

与恶龙缠斗过久,自身亦成为恶龙;凝视深渊过久,深渊将回以凝视…
Welcome To Ask or Share your Answers For Others

1 Reply

0 votes
by (71.8m points)
Waitting for answers

与恶龙缠斗过久,自身亦成为恶龙;凝视深渊过久,深渊将回以凝视…
OGeek|极客中国-欢迎来到极客的世界,一个免费开放的程序员编程交流平台!开放,进步,分享!让技术改变生活,让极客改变未来! Welcome to OGeek Q&A Community for programmer and developer-Open, Learning and Share
Click Here to Ask a Question

...