Codeforces Round #504 (rated, Div. 1 + Div. 2, based on VK Cup 2018 Final)

题目链接

A题：

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<queue>
#include<stack>
#include<list>
#include<map>
#include<set>

#define INF 0x3f3f3f3f
#define maxn 10
#define mod 1e9+7;
#define ll long long int

using namespace std;

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n,m;cin>>n>>m;
    string a,b;cin>>a>>b;
    if(n>m+1) cout<<"NO";
    else
    {
        int pos=-1;
        for(int i=0;i<n;i++)
        {
            if(a[i]=='*')
                pos=i;
        }
        if(pos<0)
        {
            if(n<m)
            {
                cout<<"NO";
                return 0;
            }
            int flag=1;
            for(int i=0;i<n;i++)
                if(a[i]!=b[i])
                    flag=0;
                    if(flag==0) cout<<"NO";
            if(flag==1) cout<<"YES";
        }
        if(pos>=0)
        {
            int cnt1=0,cnt2=0;
            for(int i=0;i<pos;i++)
            {
                if(a[i]==b[i]) cnt1++;
            }
            for(int i=n-1,j=m-1;i>pos;i--,j--)
            {
                if(a[i]==b[j]) cnt2++;
            }
            if(cnt1==pos&&cnt2==(n-pos-1))
                cout<<"YES";
            else cout<<"NO";
        }
    }
    return 0;
}

B题：

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<math.h>
#include<cstring>
#include<queue>
#include<stack>
#include<list>
#include<map>
#include<set>

#define INF 0x3f3f3f3f
#define maxn 10
#define mod 1e9+7;
#define ll long long int
using namespace std;

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    ll n,k;cin>>n>>k;
    cout<<min((k-1)/2,max(0ll,n-k/2));
    return 0;
}