CodeChef--July Lunchtime 2014_And Operation
And Operation
Given an array of n non-negative integers: A1,
A2, …, AN. Your mission is finding a pair of integers
Au, Av (1 ≤ u <
v ≤ N) such that (Au and
Av) is as large as possible.
And is a
原创
2014-07-28 11:16:44 ·
642 阅读 ·
0 评论