A.Gennady and a Card Game

【A.Gennady and a Card Game】的更多相关文章

A.Gennady and a Card Game

http://m3.codeforces.com/contest/1097/problem/A Gennady and a Card Game time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Gennady owns a small hotel in the countryside where he lives a peacef…

codeforces Hello 2019(未写完)

A. Gennady and a Card Game a题惯例签到题题意:给你一张牌,再给你5张牌,判断能不能出一次牌... 所以只要检查第二行中的某个卡是否与第一行中的卡具有共同字符有就输出YES否则输出NO #include<iostream> #include<cstring> #include<cstdio> using namespace std; char a,b,s[101]; bool tf=0; int main(){ scanf("%c…

codeforces 1097 Hello 2019

又回来了.. A - Gennady and a Card Game 好像没什么可说的了. #include<bits/stdc++.h> using namespace std; char gc() { static char buf[100000],*p1,*p2; return (p1==p2)&&(p2=(p1=buf)+fread(buf,1,100000,stdin))?EOF:*p1++; return getchar(); } template<class…

Hello 2019 Solution

A. Gennady and a Card Game 签到. #include <bits/stdc++.h> using namespace std; ], t[]; bool solve() { int flag = false; ; i <= ; ++i) { scanf("%s", t); ] == s[] || t[] == s[]) flag = true; } return flag; } int main() { while (scanf("…

Hello 2019题解

Hello 2019题解题解 CF1097A [Gennady and a Card Game] map大法好qwq 枚举每一个的第\(1,2\)位判是否与给定的重复即可 # include <bits/stdc++.h> std::map<char, int> m1, m2; int main() { std::string s[6], str; std::cin >> str; for(int i = 1; i <= 5; i++) std::cin >…

Lesson 3 Please send me a card

Text Postcards always spoil my holidays. Last summer, I went to Italy. I visited museums and sat in public gardens. A friendly waiter taught me a few words of Italian. Then he lent me a book. I read a few lines, but I did not understand a word. Every…