Submission #3659243

---

Source Code Expand

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

namespace AtCoder
{
    class Program
    {
        static void Main(string[] args)
        {
            var vals = Console.ReadLine().Split(' ').Select(x => int.Parse(x)).ToArray();
            var N = vals[0];
            var K = vals[1];
            vals = Console.ReadLine().Split(' ').Select(x => int.Parse(x)).ToArray();

            //累積和を計算
            var cumsum = new long[N];
            var tmp = (long)0;//最大値
            foreach(var i in Enumerable.Range(0, N))
            {
                tmp += vals[i];
                cumsum[i] = tmp;
            }

            //部分和
            var subsets = new List<long>();
            for(var i = 0; i<N; i++)
            {
                subsets.Add(cumsum[i]);
                for(var j=0; j<i; j++)
                {
                    subsets.Add(cumsum[i] - cumsum[j]);
                }
            }

            //最大値のビットは？
            var sisuu = (int)(Math.Log(tmp) / Math.Log(2.0) + 0.0000001);
            var result = (long)0;
            var tmp_array = subsets;
            for(var i = sisuu; i >= 0; i--)
            {
                var target = (long)Math.Pow(2, i);
                var hantei = tmp_array.Where(x => (target & x) != 0).ToList();
                if(hantei.Count >= K)
                {
                    result = result | target;
                    tmp_array = hantei;
                }
            }
            
            Console.WriteLine(result);
        } 
    }
}

Submission Info

Judge Result