KEYENCE Programming Contest 2024（AtCoder Beginner Contest 374） 题解

A - Takahashi san 2

Problem Statement
KEYENCE has a culture of addressing everyone with the suffix “-san,” regardless of roles, age, or positions.

You are given a string S consisting of lowercase English letters.

If S ends with san, print Yes; otherwise, print No.

#include<bits/stdc++.h> 
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=pre[x];p;p=next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=next[p])  
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,0x3f,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define MEMx(a,b) memset(a,b,sizeof(a));
#define INF (0x3f3f3f3f)
#define F (1000000007)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define vi vector<int> 
#define pi pair<int,int>
#define SI(a) ((a).size())
#define Pr(kcase,ans) printf("Case #%d: %lld\n",kcase,ans);
#define PRi(a,n) For(i,n-1) cout<<a[i]<<' '; cout<<a[n]<<endl;
#define PRi2D(a,n,m) For(i,n) {
     
      \
						For(j,m-1) cout<<a[i][j]<<' ';\
						cout<<a[i][m]<<endl; \
						} 
#pragma comment(linker, "/STACK:102400000,102400000")
#define ALL(x) (x).begin(),(x).end()
#define gmax(a,b) a=max(a,b);
#define gmin(a,b) a=min(a,b);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
ll mul(ll a,ll b){
   
   return (a*b)%F;}
ll add(ll a,ll b){
   
   return (a+b)%F;}
ll sub(ll a,ll b){
   
   return ((a-b)%F+F)%F;}
void upd(ll &a,ll b){
   
   a=(a%F+b%F)%F;}
inline int read()
{
   
   
	int x=0,f=1; char ch=getchar();
	while(!isdigit(ch)) {
   
   if (ch=='-') f=-1; ch=getchar();}
	while(isdigit(ch)) {
   
    x=x*10+ch-'0'; ch=getchar();}
	return x*f;
} 
int main()
{
   
   
//	freopen("D.in","r",stdin);
//	freopen(".out","w",stdout);
	string s;
	cin>>s;
	int n=s.length();
	if(n>=2) {
   
   
		if(s[n-1]=='n' && s[n-2]=='a' && s[n-3]=='s') puts("Yes");else puts("No");
	}
	
	
	return 0;
}

B - Unvarnished Report

給2个字符串，判断第一个字符不同的位置。

#include<bits/stdc++.h> 
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=pre[x];p;p=next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=next[p])  
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,0x3f,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define MEMx(a,b) memset(a,b,sizeof(a));
#define INF (0x3f3f3f3f)
#define F (1000000007)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define vi vector<int> 
#define pi pair<int,int>
#define SI(a) ((a).size())
#define Pr(kcase,ans) printf("Case #%d: %lld\n",kcase,ans);
#define PRi(a,n) For(i,n-1) cout<<a[i]<<' '; cout<<a[n]<<endl;
#define PRi2D(a,n,m) For(i,n) {
     
      \
						For(j,m-1) cout<<a[i][j]<<' ';\
						cout<<a[i][m]<<endl; \
						} 
#pragma comment(linker, "/STACK:102400000,102400000")
#define ALL(x) (x).begin(),(x).end()
#define gmax(a,b) a=max(a,b);
#define gmin(a,b) a=min(a,b);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
ll mul(ll a,ll b){
   
   return (a*b)%F;}
ll add(ll a,ll b){
   
   return (a+b)%F;}
ll sub(ll a,ll b){
   
   return ((a-b)%F+F)%F;}
void upd(ll &a,ll b){
   
   a=(a%F+b%F)%F;}
inline int read()
{
   
   
	int x=0,f=1; char ch=getchar();
	while(!isdigit(ch)) {
   
   if (ch=='-') f=-1; ch=getchar();}
	while(isdigit(ch)) {
   
    x=x*10+ch-'0'; ch=getchar();}
	return x*f;
} 
int main()
{
   
   
//	freopen("D.in","r",stdin);
//	freopen(".out","w",stdout);
	string s,t;
	cin>>s>>t;
	Rep(i,s.length()) if(s[i]!=t[i]) {
   
   
		cou