Submission #282688

---

Source Code Expand

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

class C1
{

    int[,] map;
    int n;
    int k;
    int[] now;
    bool Solve()
    {
        string[] str = Console.ReadLine().Split(' ');
        n = int.Parse(str[0]);
        k = int.Parse(str[1]);

        map = new int[n, k];
        now = new int[n];
        int[] dp = new int[k];

        for (int i = 0; i < n; i++)
        {
            string[] s = Console.ReadLine().Split(' ');
            for (int j = 0; j < k; j++)
                map[i, j] = int.Parse(s[j]);
        }
        return Check(0, 0);
    }

    bool Check(int q, int index)
    {
        if (q < n - 1)
        {
            for (int i = 0; i < k; i++)
            {
                now[q] = i;
                if (Check(q + 1, i)) return true;
            }
        }

        int last = map[0, now[0]];
        for (int i = 1; i < n; i++)
            last = last ^ map[i, now[i]];

        for (int i = 0; i < k; i++)
            if ((last ^ map[q, i]) == 0) return true;

        return false;
    }

    static void Main(string[] args)
    {
        Console.WriteLine(new C1().Solve() ? "Found" : "Nothing");
        Console.ReadLine();
    }

}

Submission Info

Judge Result