2017 Multi-University Training Contest
来源:互联网 发布:国产电视知乎 编辑:程序博客网 时间:2024/06/15 18:35
点击打开题目链接
这个题是个水题,看好多人过了,结果错了九次才过,觉得一个判断条件特别有道理,写了之后交了错了,
又发现一个条件也很有道理,换了这个条件交,也Wa了,最后索性两个条件一块使用,过了。
#include<iostream>#include<stdio.h>#include<string>#include<cmath>using namespace std;const int N=80009;int n,num,score1,score2;char ch1[N];char ch2[N];int main(){ int t; scanf("%d",&t); while(t--) { num=0; scanf("%d%d%d",&n,&score1,&score2); scanf("%s",ch1); scanf("%s",ch2); int flag=0; for(int i=0; i<n; i++) { if(ch1[i]==ch2[i]) num++; } int Min=min(score1,score2); Min=min(num,Min); if((abs(score1-score2)<=n-num)&&(score1+score2-2*Min<=n-num)) printf("Not lying\n"); else printf("Lying\n"); } return 0;}
阅读全文
0 0
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- #2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- #2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- POI--------文件上传导出
- HDU 6047 Maximum Sequence
- CXF Weblogic 报错:Cannot create a secure XMLInputFactory
- <<python 核心编程>>第一章 正则表达式
- hdu6055 Regular polygon 2017多校联盟2 11题 -枚举
- 2017 Multi-University Training Contest
- 用C++实现双向链表
- poj 2104 K-th Number (主席树)
- 妙用Linux 的后台任务
- noip系列 2004提高组 合并果子
- BFC原理与清除浮动的关系
- 树状数组的基本运用
- 树状数组的基本+运用(HDU1166-敌兵布阵)
- linux-10 日志的管理