It is clear that if the candidate's words should be a regular or to push out a formula calculation
Here we use brute force computation to solve, it is very straightforward to find out the first 500 items, and their and, and then judge can
The code is as follows:
#include <cstdio>
#include <cmath>
using namespace std;
const int MAX = 1E5;
int A[max];
int main (void) {
int Count = 0;
A[1] = 1;a[2] = 1;
int sum = 0;
for (int i=0;i<=450;i+=count) {
count++;
for (int j=1;j<=count;j++) {
a[i+j] = POW (2,j-1);//Here is the solution
for each sum = = a[i+j];//take their and compute out
/ printf ("%d%d%lld\n", i+j,a[i+j],sum);
if (Sum & (sum-1) = = 0)//This is used to determine that sum conforms to the power of a mismatch of 2, and here you can add a i+j>100 directly to find the result
{
printf ("%d and%d\n", i+j , sum);
}} return 0;
}
So what we get is an item that matches the top N and the power of 2, and the result is as follows:
Obviously n>100 so it should be 440, so choose a. ~ ~ Of course, the college entrance examination can not take the computer, ...