Icarus_的学习笔记

就是说一个由O X组成的字符串，每个O得分为连续出现的O的个数，X得分为0； 如：OOXXOXXOOO的得分为1+2+0+0+1+0+0+1+2+3=10原题：There is an objective test result such as OOXXOXXOOO". An `O' means a correct answer of a problem and an `X' m

输入文本，找出所有不同的单词，按字母序从小到大输出#include#include#include#includeusing namespace std;set dict;int main() { string s, buf; while (cin >> s) { for (int i = 0; i < s.length(); i++) { if (isalpha(s

#include#include#include#include#include#includeusing namespace std;map cnt;vector words;string repr(const string& s) { string ans = s; for (int i = 0; i < ans.length(); i++) { ans[i] = t

输出x在A中排第几小或输出没有x.先输入数x的时候，把a[x]++；那样，输出结束后，a[x]是几，那么就有几个X#include#includeusing namespace std;int a[100000];int main() { int m, n; int x; int k = 0; while (scanf_s("%d%d",&m,&n)==2&&m) { pr

丑数是不能被2,3,5以外的素数整除的数，求第1500个丑数#include #include#include#includeusing namespace std;typedef long long LL;//定义一个onglong类型的数LLconst int coeff[3]={2,3,5};int main(){ priority_queue,greater >p