Warm up 16 Quite a problem

Quite a problem

Time Limit: 10000ms, Special Time Limit:25000ms, Memory Limit:65536KB

Total submit users: 45, Accepted users: 45

Problem 12776 : No special judgement

Problem description

这个傻逼题，重判前就我一个人过真的是感人肺腑啊，居然可以是反的，出题人智商！

It gets tiring, looking for all ways in which the word ‘problem’ can be used (and mis-used) in the news media. And yet, that’s been your job for several years: looking through news stories for that word. Wouldn’t it be better if you could automate the process?

Input

Each line of input is one test case. Lines are at most 80 characters long. There are at most 1000 lines of input. Input ends at end of file.

Output

For each line of input, print yes if the line contains ‘problem’, and no otherwise. Any capitalization of ‘problem’ counts as an occurrence.

Sample Input

Problematic pair programming
"There’s a joke that pairs, like fish and house guests, go
rotten after three days," said Zach Brock, an engineering
manager. Working out problems with a pairing partner can be
a lot like working out problems with a significant other.
During one recent rough patch, Jamie Kite, a developer, sat
her partner down for a talk. "Hey, it feels like we’re
driving in different directions," she recalls saying. "It’s
like any relationship," Ms. Kite said. "If you don’t talk
about the problems, it’s not going to work." When those
timeouts don’t solve the problem, partners can turn to
on-staff coaches who can help with counseling. "People who
have been pairing a while, they’ll start acting like old
married couples," said Marc Phillips, one of the coaches.
People can be as much of a challenge as writing software.
(Excerpted from "Computer Programmers Learn Tough Lesson in
Sharing"; Wall Street Journal, August 27, 2012)

Sample Output

yes
no
no
yes
yes
no
no
no
no
yes
yes
no
no
no
no
no
no

Problem Source

HNU Contest 

Submit   Discuss   Judge Status  Problems  Ranklist 

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <map>
#include <queue>
#include <vector>
#include <string>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
using namespace std;
#define maxn 135
#define ll long long
#define mod 1000000007
#define INF 0x7fffffff
#define eps 1e-8
ll n, m;
char s[maxn];
char str[21];
char st[21];
int main(){
    /*int t;
    scanf("%d", &t);
    while (t--){
    scanf("%I64d", &n);

    }*/
    ll x, y, a, b, x1, x2, y1, y2, s1, s2;
    while (1){
        if (gets(s) == NULL)break;
        int flag = 0;
        for (int i = 0; i < (1 << 7); i++){
            strcpy(str, "PROBLEM");
            strcpy(st, "MELBORP");
            for (int j = 0; j < 7; j++)
            if (i&(1 << j)){
                str[j] += 'a' - 'A';
                st[j] += 'a' - 'A';
            }
            if (strstr(s, str) != NULL){printf("yes\n"); flag = 1; break;}
            if (strstr(s, st) != NULL){printf("yes\n"); flag = 1; break;}
        }
        if (flag == 0)printf("no\n");
    }
    return 0;
}