• 博客园logo
  • 会员
  • 众包
  • 新闻
  • 博问
  • 闪存
  • 赞助商
  • HarmonyOS
  • Chat2DB
    • 搜索
      所有博客
    • 搜索
      当前博客
  • 写随笔 我的博客 短消息 简洁模式
    用户头像
    我的博客 我的园子 账号设置 会员中心 简洁模式 ... 退出登录
    注册 登录
james1207

博客园    首页    新随笔    联系   管理    订阅  订阅

黑龙江省第七届大学生程序设计竞赛-Mysterious Organization

描述

 

GFW had intercepted billions of illegal links successfully. It has much more effect. Today, GFW intercepted a message of a mysterious organization. This mysterious organization package the message in legitimate URL.
To find the Black Hand behind the scenes, GFW didn’t shield the IP. Instead, it chooses to tap the massage. Because the messages are packaged in URL, and encrypted by the way we don’t know, GFW chooses to monitor all the URL passed, to get enough information to find the Black Hand behind the scenes.
This kind of URL is easy to find. This kind of URL including the word’ manure’. Your task is to find how many URL is this kind.

 

输入

 

Input has only one case, it has multiple lines. Each line has a string standing for the URL passing GFW. The length of the string is less than 256 without blank in it. There won’t be more than 256 lines in the cases.

 

输出

 

Output one line standing for the number of URL GFW needs.

 

样例输入

 

https://61.135.169.105//manurer//whoistheboss
http://61.135.169.105//manur//whoistheboss
http://61.135.169.105//mare//whoistheboss
https://61.135.169.105//manure//Iamtheboss

 

样例输出

 

2

#include<iostream>
#include<cstring>
using namespace std;
int main()
{
    char a[300];
    int sum=0;
    while(cin>>a)
   {

    for(int i=0;i<strlen(a)-5;i++)
    {
        if(a[i]=='m'&&a[i+1]=='a'&&a[i+2]=='n'&&a[i+3]=='u'&&a[i+4]=='r'&&a[i+5]=='e')
       sum++;
    }
  }
  cout<<sum<<endl;
  return 0;
}


 

posted @ 2013-09-02 19:31  Class Xman  阅读(218)  评论(0)    收藏  举报
刷新页面返回顶部
博客园  ©  2004-2025
浙公网安备 33010602011771号 浙ICP备2021040463号-3