nyoj-411-Friends number

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<math.h>
using namespace std;
int main()
{
    int a[71]={220,1184,2620,5020,6232,10744,12285,17296,66928,67095,63020,69615,79750,122368,100485,122265,141664,142310,171856,176272,196724,185368,280540,308620,356408,319550,437456,469028,503056,522405,643336,600392,609928,624184,635624,667964,726104,802725,879712,898216,998104,1077890,947835,1154450,1185376,1156870,1280565,1175265,1392368,1328470,1358595,1511930,1466150,1468324,1798875,1669910,2082464,2236570,2723792,2739704,2652728,2802416,2728726,2803580,3276856,3606850,3805264,3786904,4238984,4259750,4246130};
    int b[71]={284,1210,2924,5564,6368,10856,14595,18416,66992,71145,76084,87633,88730,123152,124155,139815,153176,168730,176336,180848,202444,203432,365084,389924,399592,430402,455344,486178,514736,525915,652664,669688,686072,691256,712216,783556,796696,863835,901424,980984,1043096,1099390,1125765,1189150,1286744,1292570,1340235,1438983,1464592,1483850,1486845,1598470,1747930,1749212,1870245,2062570,2090656,2429030,2874064,2928136,2941672,2947216,3077354,3716164,3721544,3892670,4006736,4300136,4314616,4445050,4488910};
    int l,r;
    while(scanf("%d%d",&l,&r)!=EOF)
    {
        int sum=0,i;
        for(i=0;i<71;i++)
        {
            if(l<=a[i]&&b[i]<=r)
            sum++;
        }
        printf("%d
",sum);
    }
    return 0;
}
//我承认没那水平 所以打表了