输入n,Derek和Alfia的得分,给你两列n个题的答案,问是否矛盾.
坑在代码里
没啥好说的,找出坑来就很水了
code:
#include<cstdio>
#include<iostream>
using namespace std;
const int maxn=1e5+10;
char a[maxn];
char b[maxn];
int main()
{
int kase;
int n,x,y;
scanf("%d",&kase);
while(kase--)
{
scanf("%d %d %d",&n,&x,&y);
scanf("%s",a);
scanf("%s",b);
/*for(int i=0;i<n;i++)
cout<<a[i]<<endl;*/
int same=0;
for(int i=0;i<n;i++)
if(a[i]==b[i])
same++;
if(x<y)
{
int t=x;
x=y;
y=t;
}
//cout<<x<<" "<<y<<" "<<same<<endl;
if((x+y-same<=n)&&(x-y+same<=n)&&(x<=n)&&(y<=n))//坑在这
{
printf("Not lying\n");
}
else
printf("Lying\n");
}
}