AIex_2oo8's blog

By AIex_2oo8, history, 6 years ago, In English

Guys let's discuss how can we improve the state of regionals in India. Is there any viable alternative other than codechef?

IjustWantContribution

inspiredByAshishGup

Full text and comments »

  • Vote: I like it
  • -49
  • Vote: I do not like it

By AIex_2oo8, history, 6 years ago, In English

Question You are given an array A of n integers. Let the maximum possible bitwise OR of any subsequence of elements of the array be M. You need to print n integers numbered from 1 to n. The ith integer denotes the number of distinct subsequences of size i of the array whose bitwise OR is equal to M. Since the integers can be very large, print each of them modulo 10^9+ 7.

Note: Two subsequences are distinct if there exists at least one postion of the array which is included in one of the subsequences and not so in the other.

CONSTRAINTS

1 ≤ n ≤ 5000

0 ≤ Ai < 2^12


Full text and comments »

  • Vote: I like it
  • -3
  • Vote: I do not like it