Problem Description
Chen, Adrian (November 7, 2013). “Doge Is An Ac- tually Good Internet Meme. Wow.”. Gawker. Retrieved November 22, 2013.Doge is an Internet meme that became popular in 2013. The meme typically con- sists of a picture of a Shiba Inu dog ac- companied by multicolored text in Comic Sans MS font in the foreground. The text, representing a kind of internal monologue, is deliberately written in broken English, and usually contains the word “wow” and the phrases “such x”, “much x”, “many x”, “very x” and “so x”.
Kabosu, the Shiba Inu featured in the original meme, was first pictured in a 2010 blog post by Atsuko Sato, a Japanese kindergarten teacher. Afterwards, varia- tions of the pictures using overlaid Comic Sans text were posted from a Tumblr blog, Shiba Confessions. However, the use of the intentionally misspelled “doge” dates back to June 2005, when it was mentioned in an episode of Homestar Runners puppet series.
In August 2013, images of the meme were spammed on Reddit’s r/MURICA subreddit by 4chan’s random imageboard, /b/. A search of the term doge on Google Trends shows an explosion of popularity occurring in October 2013, and more so in the following month. By November 2013, the meme had become widespread on the Internet. Google later created a Doge Easter egg: when doge meme was entered into the YouTube search bar, all of the site’s text would be displayed in colorful Comic Sans, similar to the kind used by the meme.
The meme was ranked #12 on MTV’s list of “50 Things Pop Culture Had Us Giving Thanks For” in 2013. Io9 compared the internal dialog of the Shiba Inu dogs to lolcat-speak. The image most commonly associated with the meme is of a female Shiba Inu named Kabosu, taken from a Japanese blog documenting the dog’s daily activities. The spelling of doge has several variants, leading to debate on its actual pronunciation. On December 13, Doge was named the “top meme” of 2013 by Know Your Meme.
In December 2013, the Dogecoin was introduced as a new cryptocurrency, making it the first cryptocurrency to be based on an Internet meme; the viral phenomenon, along with usage of the Comic Sans MS typeface, gave it “the Internet density of a large star” according to Medium writer Quinn Norton.
In late December 2013, members of the U.S. Congress produced material in the meme’s style. Huffington Post commented that Doge was “killed” because of the Congress members’ usage of the meme.
By early 2014, Doge’s popularity was sustained by internet communities on social media, accompanied by the rapid growth and acceptance of Dogecoin. In April 2014, Doge experienced a second major media resurgence due to revelations of the Dogecoin community’s intent to sponsor Josh Wise in NASCAR and place a picture of the Shiba Inu on his vehicle.
—— Doge (meme). (2014, May 18).
In Wikipedia, The Free Encyclopedia. Retrieved 02:00, May 22, 2014, from
http://en.wikipedia.org/w/index.php?title=Doge_(meme)&oldid=609040691
Now, Doge wants to know how many words “doge” are there in a given article. Would you like to help Doge solve this problem?
Input
An article that Doge wants to know.
The size of the article does not exceed 64KB. The article contains only ASCII characters.
Output
Please output the number of word “doge” (case-insensitive). Refer to the samples for more details.
Sample Input
adoge
cutedo
yourge
blownDoge
lovelyDooge
Wow! Such Dooooooooooooooge!!!
D0ge
dOge DOGE
dogedoge
Sample Output
6
思路
输入很多字符串,求这些字符串出现doge的次数,直接kmp甚至可以暴力做。题出的倒挺吓人写了一堆没用的废话。
这道题写的没啥意思,但是希望自己要注意一个地方:j = num[j] 和 j = 0的区别。如果题目给的匹配串存在回文或者有循环节那么要当心可能是j = num[j]。如果问出现多少次那么j = num[j],如果问能裁剪出来多少个具体的匹配串应该是j = 0。但是也要看具体情况具体分析。
#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
using namespace std;
const int maxn = 1e6+5;
char s[maxn],p[10];
int num[maxn];
void get_next()
{
memset(num,-1,sizeof(num));
int i = 0,j = -1,n = 4;
while(i < n){
if(j == -1 || p[i] == p[j]){
i++;j++;
num[i] = j;
}
else{
j = num[j];
}
}
}
int kmp(int n,int m)
{
int i = 0,j = 0,ans = 0;
while(i < n){
if(j == -1 || s[i] == p[j]){
i++;j++;
}
else{
j = num[j];
}
if(j == m){
j = num[j]; //j = 0也可以
ans++;
}
}
return ans;
}
int main()
{
strcpy(p,"doge");
get_next();
int ans = 0;
while(gets(s)){
int n = strlen(s);
for(int i = 0;i < n;i++){
if(s[i] >= 'A' && s[i] <= 'Z'){
s[i] += 32;
}
}
ans += kmp(n,4);
}
printf("%d\n",ans);
return 0;
}