赛前培训——DAY 2

相比于昨天cqr出的题来说实在是太简单了

T1 lucky
想法是暴力枚举，然后做几个特判，让它永远是质数，可惜TED

80

#include
using namespace std;
int n,i,j,ans;
bool pos(int boler) {
    bool f=true;
    if(boler==1)    return f=false;
    for(int q=2; q<=sqrt(boler); q++) {
        if(boler%q==0) {
            return f=false;
        }
    }
    return f=true;
}
void wzt(int p) {
    int c=p,s=0;
    for(j=2; j
1) {
        cout<<p<>n;
    for(i=4; i<=n; i++) {
        wzt(i);
    }
    return 0;
}

T2 expand
简单模拟，将一个“=”去掉和“1”改成“0”就AC了

AC

#include
using namespace std;
int i;
char j;
string s;

int main( ) {
    freopen("expand.in","r",stdin);
    freopen("expand.out","w",stdout);
    cin>>s;
    int n=s.size( )-1;
    for(i=0; i<=n; i++) {
        if(s[i]!='-') {
            cout<='0' && s[i-1]s[i-1] && s[i+1]>='1' && s[i+1]<='9') {
                s[i-1]++;
                if(s[i-1]==s[i+1])  continue;
                for(j=s[i-1]; j<s[i+1]; j++) {
                    cout<='a' && s[i+1]>s[i-1] && s[i+1]<='z') {
                s[i-1]++;
                for(j=s[i-1]; j<s[i+1]; j++) {
                    cout<<j;
                }
            } else {
                cout<<'-';
                continue;
            }
        }
    }
    return 0;
}

T3 number
优先队列，一开始暴力解84（不是O2优化），用优先队列后成功AC

AC

#include
using namespace std;
priority_queue<int ,vector,greater >q;
char a;
int n,i,c;

int main( )
{
    freopen("number.in","r",stdin);
    freopen("number.out","w",stdout);
    cin>>n;
    for(i=1;i>a;
        if(a=='q')
        {
            cout<<q.top()<>c;
            q.push(c);
        }
    }
    return 0;
}

T4 paint
暴力模拟，得5分

#include
using namespace std;
char a[301][301];
int n,m,i,j,k,ans,pos,s,oo,vv;
int main( ) {
    freopen("paint.in","r",stdin);
    freopen("paint.out","w",stdout);
    cin>>n>>m;
    for(i=1; i<=n; i++)
        for(j=1; j>a[i][j];
    for(k=2; k<=n; k++) {
        for(i=0; i<n-k; i++) {
            for(j=0; j<m-k; j++) {
                for(oo=1; oo<=k; oo++) {
                    for(vv=1; vv<=k; vv++) {
                        if(a[oo+i][vv+j]=='1')  ans++;
                        if(a[oo+i][vv+j]=='0')  pos++;
                        cout<<ans<<" "<<pos<pos) {
                    cout<<ans<<" "<<pos<<endl;
                    if(ans-pos<2) {
                        ans=0;
                        pos=0;
                        s++;
                    } else {
                        ans=0;
                        pos=0;
                        continue;
                    }
                } else if(ans-pos<2) {
                    cout<<ans<<" "<<pos<<endl;
                    ans=0;
                    pos=0;
                    s++;
                } else {
                    ans=0;
                    pos=0;
                    continue;
                }
            }
        }
    }
    cout<<s;
    return 0;
}

T5 game
动规，不讨论

历年题回放
Q title
重要的一步是“读入”，简单模拟暴力

AC

#include
using namespace std;
char s[6];
int ans,i;
int main( )
{
    freopen("title.in","r",stdin);
    freopen("title.out","w",stdout);
    fgets(s,6,stdin);
    for(i=0;i='a' && s[i]='0' && s[i]='A' && s[i]<='Z')  ans++;
    }
    cout<<ans;
    return 0;
}

一本通题库
简单复习，不讨论