2019徐州区域赛重现 A F C

不知道好多人为什么不写区域赛重现的题解，好想看看你们写的最后的那个Triangle题，找了半天没找到。。。

 

C题签到，变相的问区间素数是否达到三分之一，根据埃式筛素数的方式可以得知当区间大的时候这段区间可以被2，3，5，7筛出很多非质数，一定会超过三分之一。

 

 

#include <iostream>
#include <string.h>
#include <stdio.h>
#include <cmath>
#include <algorithm>
using namespace std;
typedef long long ll;
const ll mod=1e9+7;
const int maxx=5e5+7;
int main()
{
    ll n,x,t,y,i,j,l,m;
    /*for(i=1;i<=1000;i++)
    {
        x=i;
        int ans=0;
        for(j=1;j<=x;j++)
        {
            if(x%j==0)
            ans++;
        }
        printf("%d   %d\n",i,ans);
    }*/
    cin>>t;
    while(t--)
    {
        cin>>n>>m;
        if(m-n+1>=1000)
        {
            printf("Yes\n");
        }
        else
        {
            int ans=0;
            for(i=n;i<=m;i++)
            {

                for(j=2;j*j<=i;j++)
                {
                    if(i%j==0)
                    {
                        ans++;
                        break;
                    }
                }
            }
            x=m-n+1;
           // printf("%lld\n",ans);
            if(3*(x-ans)>=x)
            {
                 printf("No\n");
            }
            else
            {
                    printf("Yes\n");
            }
        }
    }
    return 0;
}

A算个找规律签到题，以偶数开头的四个连续值异或和=0，区间长度小于4的直接暴力，>4的找出以偶数开头的最长连续的数，然后枚举左边那个数（1个或0个，我的代码直接分了两种情况），右边最多有多三个数，然后取最大连续值即可。

#include <iostream>
#include <string.h>
#include <stdio.h>
#include <cmath>
#include <algorithm>
using namespace std;
typedef long long ll;
const ll mod=1e9+7;
const int maxx=5e5+7;
int main()
{
    ll n,x,t,y,i,j,l,m,ans,r;
    scanf("%lld",&t);
    while(t--)
    {
       scanf("%lld%lld%lld",&l,&r,&ans);
        x=r-l+1;
        ll maxl=0;
        if(x<=4)
        {
            for(i=l;i<=r;i++)
            {
                ll p=0;
                for(j=i;j<=r;j++)
                {
                    p^=j;
                    if(p<=ans)
                    {
                        maxl=max(maxl,j-i+1);
                    }
                }

            }
            if(maxl!=0)
            printf("%lld\n",maxl);
            else
            printf("-1\n");
        }
        else
        {
            ll o=x;
            if(l%2==0)
            {
                ll p=x/4;
                ll qishi=l+p*4;
                ll changdu=p*4;
                p=0;
               // printf("%lld\n",qishi);
                for(i=qishi;i<=r;i++)
                {
                    p^=i;
                    if(p<=ans)
                    {
                        maxl=(i-qishi+1);
                    }
                }
                printf("%lld\n",changdu+maxl);
            }
            else
            {
                x--;
                l++;
                ll p=x/4;
                ll qishi=l+p*4;
                ll changdu=p*4;
                p=0;
               // printf("%lld\n",qishi);
                for(i=qishi;i<=r;i++)
                {
                    p^=i;
                    if(p<=ans)
                    {
                        maxl=max(maxl,i-qishi+1);
                    }
                }
                p=l-1;
                ll ok=1;
                if(p<=ans)
                maxl=max(maxl,ok);
                for(i=qishi;i<=r;i++)
                {
                    p^=i;
                    if(p<=ans)
                    {
                        maxl=max(maxl,i-qishi+2);
                    }
                }
                printf("%lld\n",changdu+maxl);
            }
        }

    }
    return 0;
}

f题可以打表过，1e8*log1e8的复杂度打表，就是先将x=a+b+c的a+b存到数组里（一开始用map存的直接炸了），然后排序完之后二分这个数组里的数就可以了，打到表中，注意开long long 。

#include <iostream>
#include <string.h>
#include <stdio.h>
#include <cmath>
#include <algorithm>
using namespace std;
typedef long long ll;
const ll mod=1e9+7;
const int maxx=5e5+7;
struct node{
    ll a,b,c;
}A[200]={{0,5000,-5000},{1,5000,-5000},{-486,4375,-4373},{4,4,-5},{-205,644,-637},{168,44,-169},{5000,2,-5000},{217,-52,-216},{683,-353,-650},{-641,843,-695},{10,7,-11},{332,-262,-265},{4118,-588,-4114},{2195,2977,-3331},{1671,-1276,-1373},{47,91,-95},{2833,-741,-2816},{-287,445,-401},{8,8,-10},{2357,1839,-2683},{237,2106,-2107},{5000,3,-5000},{-249,2269,-2268},{235,-69,-233},{-244,1557,-1555},{-509,1154,-1120},{2358,2731,-3223},{445,-84,-444},{16,25,-27},{837,-307,-823},{-5,8,-7},{2025,1709,-2369},{815,-473,-758},{49,139,-141},{3991,-1247,-3950},{602,659,-796},{2141,1518,-2370},{3891,-648,-3885},{1837,3131,-3329},{559,505,-672},{982,361,-998},{1202,-163,-1201},{668,845,-966},{2903,-1561,-2744},{146,102,-161},{4,5000,-5000},{403,903,-929},{1,4,1},{398,134,-403},{824,2325,-2359},{401,443,-533},{-104,434,-432},{344,-146,-335},{2123,-829,-2080},{711,-196,-706},{-706,1366,-1300},{-1719,2638,-2368},{1188,847,-1317},{3651,1315,-3707},{4271,-1972,-4126},{-1282,1686,-1390},{2036,1953,-2514},{365,1798,-1803},{-2912,3992,-3389},{861,4039,-4052},{-98,253,-248},{20,14,-22},{3200,-991,-3168},{2391,-1638,-2101},{984,-622,-893},{1870,-903,-1797},{319,2325,-2327},{229,118,-239},{8,-4,-7},{-1165,2760,-2689},{1117,947,-1309},{1345,-948,-1165},{2924,853,-2948},{4966,-2312,-4793},{11,8,-12},{-757,1945,-1906},{962,-555,-896},{383,4327,-4328},{3789,-1673,-3677},{1219,2725,-2804},{38,-16,-37},{0,5,-1},{5000,5,-5000},{-419,2217,-2212},{4988,-3881,-4034},{3997,-726,-3989},{1801,-1238,-1580},{2,5,-1},{389,167,-399},{-1766,3203,-3013},{1395,-629,-1351},{816,946,-1116},{-428,801,-758},{-77,103,-86},{104,116,-139},{-3,8,-7},{3342,-2552,-2746},{-7,10,-8},{-263,376,-327},{1528,2131,-2366},{260,317,-367},{215,447,-463},{486,741,-805},{3744,-695,-3736},{2145,-516,-2135},{3721,-1049,-3693},{1526,383,-1534},{3972,-1654,-3874},{-2476,4980,-4767},{4180,-1417,-4125},{4033,-2943,-3423},{-59,79,-66},{890,-574,-802},{1521,-1012,-1354},{-2149,4047,-3834},{1178,891,-1328},{-170,349,-335},{1169,-160,-1168},{15,-10,-13},{2691,1503,-2839},{974,4861,-4874},{-29,91,-90},{976,4876,-4889},{5,5,-4},{-1092,2000,-1885},{1635,318,-1639},{-1403,1974,-1702},{4815,-593,-4812},{399,-215,-377},{16,16,-20},{1112,-579,-1057},{3026,-1606,-2867},{3809,-1347,-3752},{2199,508,-2208},{2334,-638,-2318}};

int main()
{
    ll n,x,t,y,i,j,l,m,ans,r,k;
    //scanf("%lld",&t);
    scanf("%lld",&t);
    while(t--)
    {
        scanf("%lld",&n);
        int flag=0;
        for(i=0;i<200;i++)
        {
            if(A[i].a*A[i].a*A[i].a+A[i].b*A[i].b*A[i].b+A[i].c*A[i].c*A[i].c==n)
            {
                printf("%lld %lld %lld\n",A[i].a,A[i].b,A[i].c);
                flag=1;
                break;
            }
        }
        if(flag==0) printf("impossible\n");
    }


    return 0;
}