2017 Multi-University Training Contest
来源:互联网 发布:淘宝网玉手镯 编辑:程序博客网 时间:2024/06/05 17:24
题目链接
题意:
先给出三个数,分别表示题目的个数,Derek说自己题目正确的个数和Alfia说自己题目正确的个数,然后给出两个字符串,分别表示两个人的答案,判断是否有人说谎。
思路:
先找出两个字符串相同的个数和不同的个数,然后用一个循环将X的值和Y的值还有相同的值同时进行减,直到其中有一个值为零,这里假设对的题目全是相等的,然后进行判断,如果两个同时为零,则必定没有说谎,
否则将X与Y的值相加若小于不同的,则没说谎,否则说谎。
代码:
# include <bits/stdc++.h>using namespace std;const int MAXN = 80000+10;int main (){ int T; int N, X, Y; char A[MAXN], B[MAXN]; scanf ("%d", &T); while (T--) { scanf ("%d%d%d", &N, &X, &Y); int sum1 = 0, sum2 = 0; scanf ("%s", &A); scanf ("%s", &B); for (int i=0; i<N; ++i) { if (A[i] != B[i]) sum1 ++; else sum2++; } while (X>0 && Y>0 && sum2>0) { X--; Y--; sum2--; } if (X == 0 && Y == 0) printf ("Not lying\n"); else { if (X + Y <= sum1) 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
- java(4)包装类型
- Js中window属性和方法
- CentOS 7 最小化安装后的注意事项及一些必备组件的安装
- 浅谈数论
- Java Cryptography Architecture(JCA)——加密的那点儿事儿(加密服务提供者、算法名称、转换名称)
- 2017 Multi-University Training Contest
- Linux下vim编辑器常用命令,必读
- 二叉树--判断一棵树是否是完全二叉树
- 安装eclipse并配置环境tomcat,总之让它跑起来
- JAVA-EE表单file文件的简单应用
- Unicode and ANSI
- 2017.7.27
- python学习笔记:使用requests库发送get与post请求
- 17.7.27 日记