说了不再做水题的了。。。不幸又遇到了
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include <ctype.h>
#include <math.h>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <vector>
#include <string>
#include <iostream>
#include <algorithm>
using namespace std;
#define ll long long
#define ls rt<<1
#define rs ls1
#define lson l,mid,ls
#define rson mid+1,r,rs
#define middle (l+r)>>1
#define eps (1e-9)
#define type int
#define clr_all(x,c) memset(x,c,sizeof(x))
#define clr(x,c,n) memset(x,c,sizeof(x[0])*(n+1))
#define MOD 1000000007
#define inf 0x3f3f3f3f
#define pi acos(-1.0)
#define M 200000+5
struct {
int n;
char c;
}a[20];
int main(){
int T,i,j,flag,n;char s[11];
while(scanf("%d",&n)&&n){
i=0;
a[i].n=n;
getchar(); gets(s);
if(s[0]=='t')a[i].c=s[4];
else a[i].c=s[0];
i++;
while(s[0]!='r'){
scanf("%d",&n);
a[i].n=n;
getchar(); gets(s);
if(s[0]=='t')a[i].c=s[4];
else a[i].c=s[0];
i++;
}
flag=0;
for(j=0;j<i-1;j++){
if(a[j].n>a[i-1].n&&a[j].c=='l'){flag=1;break;}
if(a[j].n<=a[i-1].n&&a[j].c=='h'){flag=1;break;}
if(a[j].n==a[i-1].n){flag=1;break;}
}
if(flag==1)puts("Stan is dishonest");
else puts("Stan may be honest");
}
return 0;
}