2026年柯桥B班秋季第一次月测·答案

༺དༀ༒PHKLSA༒ༀཌ༻

2026-09-28 17:15:03

发布于：浙江

14阅读

0回复

0点赞

T1:

#include<bits/stdc++.h>
using namespace std;
string s="";
int a=0,b=0;
int main(){
    cin>>s;
    for(int i=0;i<s.length();++i){
    	if(s[i]<91)a++;
        if(s[i]>96)b++;
    }
    cout<<min(a,b);
	return 0;
}

T2:

#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll n,s[1024],qa[1024],ans=LLONG_MAX;
int main(){
    cin>>n;
    for(int i=0;i<n;++i){
        cin>>s[i];
        if(i==0)qa[i]=s[i];
        else qa[i]=s[i]+qa[i-1];
    }
    for(int i=0;i<n-2;++i){
    	ll a=0,b=0,c=0,maxabc=0,minabc=LLONG_MAX;
        for(int j=i+1;j<n-1;++j){
        	a=qa[i],b=qa[j]-qa[i],c=qa[n-1]-qa[j];
            maxabc=max(max(a,b),c);
            minabc=min(min(a,b),c);
            ans=min(ans,maxabc-minabc);
        }
    }
    cout<<ans;
	return 0;
}

T3:

#include<bits/stdc++.h>
using namespace std;
int n,m,k,a[1009][1009],d[1009][1009];
int dx[4]={-1,1,0,0};
int dy[4]={0,0,-1,1};
queue<pair<int,int> >q;
int main(){
    memset(d,-1,sizeof(d));
    cin>>n>>m>>k;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            cin>>a[i][j];
            if((i==1||i==n||j==1||j==m)&&a[i][j]==0){
                d[i][j]=1;
                q.push(make_pair(i,j));
            }
        }
    }
    while(!q.empty()){
        int x=q.front().first;
        int y=q.front().second;
        q.pop();
        for(int dir=0;dir<4;dir++){
            int nx=x+dx[dir];
            int ny=y+dy[dir];
            if(nx>=1&&nx<=n&&ny>=1&&ny<=m&&a[nx][ny]==0&&d[nx][ny]==-1){
                d[nx][ny]=d[x][y]+1;
                q.push({nx,ny});
            }
        }
    }
    while(k--){
        int x,y;
        cin>>x>>y;
        cout<<d[x][y]<<'\n';
    }
    return 0;
}

T4:

#include<bits/stdc++.h>
using namespace std;
int n;
int main(){
	cin>>n;
    vector<pair<int,int>>a(n);
    for(int i=0;i<n;i++){
		cin>>a[i].first>>a[i].second;
	}
	sort(a.begin(),a.end());
	vector<int>q;
	for(int i=0;i<n;i++){
		int y=a[i].second;
		auto it=lower_bound(q.begin(),q.end(),y);
		if(it==q.end())q.push_back(y);
		else *it=y;
	}
	cout<<(int)q.size();
	return 0;
}

T5:

#include<bits/stdc++.h>
using namespace std;
const int MOD=1e9+7;
long long dp[200005];
int n;
string s;
int main(){
    cin>>n>>s;
    dp[0]=1;
    for(int i=1;i<=n;i++){
        char c=s[i-1];
        if(c=='?')dp[i]=(dp[i]+dp[i-1]*9)%MOD;
        else if(c>='1' && c<='9')dp[i]=(dp[i]+dp[i-1])%MOD;
        if(i>=2){
            char c1=s[i-2],c2=s[i-1];
            int cnt=0;
            if(c1!='?' && c2!='?'){
                int num=(c1-'0')*10+(c2-'0');
                if(num>=10 && num<=26)cnt=1;
            }else if(c1=='?' && c2!='?'){
                if(c2>='0' && c2<='6')cnt=2;
                else cnt=1;
            }else if(c1!='?'&& c2=='?'){
                if(c1=='1')cnt=10;
                else if(c1=='2')cnt=7;
                else cnt=0;
            }else{
                cnt=17;
            }
            dp[i]=(dp[i]+dp[i-2]*cnt)%MOD;
        }
    }
    cout<<dp[n];
    return 0;
}