#include<cstdio>
#include<iostream>
#include<cstring>
using namespace std;
char a[80010],b[80010];
int same=0;
int diff=0;
int n,x,y;
int work()
{
return x>=y-diff&&y>=x-diff&&(x-same)+(y-same)<=diff;
}
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
scanf("%d%d%d",&n,&x,&y);
scanf("%s",a);
scanf("%s",b);
same=0;
diff=0;
for(int i=0;i<n;i++)
{
if(a[i]==b[i]) same++;
else diff++;
}
if(work())
puts("Not lying");
else
puts("Lying");
}
}
HDU6045(数学公式)
最新推荐文章于 2018-04-28 15:05:22 发布