Codeforces Round 928 (Div. 4) A - Vlad and the Best of Five 给一个只由A,B组成的字符串,问哪个字母出现次数最多 map打桶计数(我甚至懒得另起变量),over #include<bits/stdc++.h>#define yes cout<<"Yes"<<endl#define no cout<<"No"<<endl#define endl "\n"usingnamespacestd;usingll=longlo...
Code Folders and filesLatest commit motikan2010-bot Auto Update 2024/05/24 00:28:34 bab60ad· May 24, 2024 History6,463 Commits 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 ...
We read every piece of feedback, and take your input very seriously. Include my email address so I can be contacted Cancel Submit feedback Saved searches Use saved searches to filter your results more quickly Cancel Create saved search Sign in Sign up Reseting focus {...