经典简约
清爽简洁,回归本真
液态水晶
毛玻璃+霓虹光带
赛博朋克
霓虹故障艺术风
🚫
违规操作检测
禁止使用右键菜单
⚠️ 此操作已被系统记录
1

Acmers Love AC

📝 题解 🔵 仅限 C++
题目描述
<p>We hate WA! We hate TLE! We hate RE! We hate PE......! The only thing we love is AC!Because we are ACMers! Now we give you a task that you should find how many strings―&quot;AcmersLoveAc&quot; are there in a string that we input.<br /> </p>
输入格式
<p>&nbsp; The input contains several testcases. Each testcase consists of one string(only contains capital letter and Lowercase letter) which is at most 100 characters. Input is terminated by EOF.<br /> </p>
输出格式
<p>&nbsp;For each testcase output, print an integer which stands for that how many strings―&quot;AcmersLoveAc&quot; are there in the input<br /> string.<br /> </p>
样例
样例输入 1
IKnowAcmersLoveAc AcmersDontLoveAc AcmersLoveAcAndAcmersLoveAc
样例输出 1
1 0 2
提交代码
请先登录后提交

🤖 AI 解题助手

DeepSeek
就绪
👋 你好!我是 AI 解题助手。
我已阅读了这道题,可以帮你分析思路、提供代码示例。
⚠️ 请先登录后使用