#include <iostream>
using namespace std;
#define MAXSIZE 3
typedef int KeyType;
typedef struct
{
KeyType key;
} ElemType;
typedef struct
{
ElemType *R;
int length;
} SSTable;
int InitList_SSTable(SSTable &L)
{
L.R==new ElemType[MAXSIZE];
if(!L.R) return 0;
L.length=0;
return 1;
}
int Insert_SSTable(SSTable &L)
{
int j;
cin>>j;
for(int i=0;i<=MAXSIZE;
i++)
{ L.R[i].key=j; L.length++; }
return 1;
}
int Search_Seq(SSTable ST,KeyType key)
{
ST.R[0].key=key;
for(int i=ST.length;ST.R[i].key!=key; i--)
return i;
}
void Show_End(int result,int testkey)
{
if(result==0)
cout<<"weizhaodao"<<endl;
else
cout<<"zhaodao"<<endl;
}
int main()
{
SSTable ST;
InitList_SSTable(ST);
Insert_SSTable(ST);
int testkey1=7,testkey2=200;
int result;
result=Search_Seq(ST,testkey1);
Show_End(result,testkey1);
result=Search_Seq(ST,testkey2);
Show_End(result,testkey2);
}
using namespace std;
#define MAXSIZE 3
typedef int KeyType;
typedef struct
{
KeyType key;
} ElemType;
typedef struct
{
ElemType *R;
int length;
} SSTable;
int InitList_SSTable(SSTable &L)
{
L.R==new ElemType[MAXSIZE];
if(!L.R) return 0;
L.length=0;
return 1;
}
int Insert_SSTable(SSTable &L)
{
int j;
cin>>j;
for(int i=0;i<=MAXSIZE;
i++)
{ L.R[i].key=j; L.length++; }
return 1;
}
int Search_Seq(SSTable ST,KeyType key)
{
ST.R[0].key=key;
for(int i=ST.length;ST.R[i].key!=key; i--)
return i;
}
void Show_End(int result,int testkey)
{
if(result==0)
cout<<"weizhaodao"<<endl;
else
cout<<"zhaodao"<<endl;
}
int main()
{
SSTable ST;
InitList_SSTable(ST);
Insert_SSTable(ST);
int testkey1=7,testkey2=200;
int result;
result=Search_Seq(ST,testkey1);
Show_End(result,testkey1);
result=Search_Seq(ST,testkey2);
Show_End(result,testkey2);
}