| 比赛 |
csp2025模拟练习1 |
评测结果 |
AAAAAAAAAAAAAAAAAAAAAAAAA |
| 题目名称 |
麻烦的键盘 |
最终得分 |
100 |
| 用户昵称 |
李金泽 |
运行时间 |
0.116 s |
| 代码语言 |
C++ |
内存使用 |
3.92 MiB |
| 提交时间 |
2025-10-28 08:31:29 |
显示代码纯文本
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<string>
#define N 1
#define fo(i,l,r) for(int i=l;i<=r;i++)
#define rf(i,r,l) for(int i=r;i>=l;i--)
#define ll long long
#define ul unsigned long long
#define int long long
using namespace std;
int n,x,y;bool h[256];
string a,b;char c,d,e='-';
void swap(int &x,int &y){int t=x;x=y;y=t;}
int max(int x,int y){return x>y?x:y;}
int min(int x,int y){return x<y?x:y;}
int read(){
int sum=0;bool f=0;char c=getchar();
for(;c<48||c>57;c=getchar())if(c==45)f=1;
for(;c>=48&&c<=57;c=getchar())sum=sum*10+(c&15);
return f?-sum:sum;
}
signed main(){
freopen("troublekey.in","r",stdin);freopen("troublekey.out","w",stdout);
ios::sync_with_stdio(0);
cin>>a>>b;x=a.size();y=b.size();
fo(i,0,x-1)h[a[i]]=1;
for(int i=0,j=0;j<y;i++,j++)
{
if(a[i]==b[j])continue;
if(h[b[j]])
{
e=a[i];
while(a[i]!=b[j])i++;
}
else c=a[i],d=b[j];
}
if(x>y&&e=='-')e=a[x-1];
cout<<c<<' '<<d<<endl<<e;
return 0;
}