Is Derek lying?

Derek and Alfia are good friends.Derek is Chinese,and Alfia is Austrian.This summer holiday,they both participate in the summer camp of Borussia Dortmund.During the summer camp,there will be fan tests at intervals.The test consists of N choice questions and each question is followed by three choices marked “A” “B” and “C”.Each question has only one correct answer and each question is worth 1 point.It means that if your answer for this question is right,you can get 1point.The total score of a person is the sum of marks for all questions.When the test is over,the computer will tell Derek the total score of him and Alfia.Then Alfiawill ask Derek the total score of her and he will tell her: “My total score is X,your total score is Y.”But Derek is naughty,sometimes he may lie to her. Here give you the answer that Derek and Alfia made,you should judge whether Derek is lying.If there exists a set of standard answer satisfy the total score that Derek said,you can consider he is not lying,otherwise he is lying.

输入

The first line consists of an integer T,represents the number of test cases.

For each test case,there will be three lines.

The first line consists of three integers N,X,Y,the meaning is mentioned above.

The second line consists of N characters,each character is “A” “B” or “C”,which represents the answer of Derek for each question.

The third line consists of N characters,the same form as the second line,which represents the answer of Alfia for each question.

Data Range:1≤N≤80000,0≤X,Y≤N,∑Ti=1N≤300000

输出

For each test case,the output will be only a line.

Please print “Lying” if you can make sure that Derek is lying,otherwise please print “Not lying”.

样例输入

23 1 3AAAABC5 5 0ABCBCACBCB

样例输出

Not lyingLying

题意：有n组测试数据，每组三行，第一行3个数，代表：总题数，告诉你的a做对的题数，告诉你的b做对的题数

第2行第三行分别代表a和b的答案，要求你判断告诉你的结果正确还是错误（只有不可能的结果才是错误的）

本题要找到a和b答案相同的共有几道题，然后就是不等式，a和b做对的题数一定小于等于总题数，做出对多的减去做对少的题数一定小于等于答案不同的题数

#include<iostream>#include<string>#include<cstring>#include<stdio.h>#include <algorithm>#include<math.h>using namespace std;int main(){    int n;    scanf("%d",&n);    while(n--)    {       int a,b,le;       cin>>le>>a>>b;       string sa,sb;       cin>>sa>>sb;       int s=0;       for(int i=0;i<le;i++)       {           if(sa[i]==sb[i])            s++;       }       if((a+b-s>le)||(max(a,b)-le+s>min(a,b)))       {           printf("Lying\n");       }       else       {           printf("Not lying\n");       }    }    return 0;}