Problem:
Search III

Your task is to write a program of a simple dictionary which implements the following instructions:

insert str: insert a string str in to the dictionary

find str: if the distionary contains str, then print 'yes', otherwise print 'no'

Input

In the first line n, the number of instructions is given. In the following n lines, n instructions are given in the above mentioned format.

Output

Print yes or no for each find instruction in a line.

Constraints

A string consists of 'A', 'C', 'G', or 'T'

1 ≤ length of a string ≤ 12

n ≤ 1000000

Sample Input 1

5
insert A
insert T
insert C
find G
find A

Sample Output 1

no
yes

Sample Input 2

13
insert AAA
insert AAC
insert AGA
insert AGG
insert TTT
find AAA
find CCC
find CCC
insert CCC
find CCC
insert T
find TTT
find T

Sample Output 2

yes
no
no
yes
yes
yes

Notes

Template in C

Solution in C (judge verdict: Time Limit Exceeded)

#include<stdio.h>
#include<string.h>

int search(char[] , int );

char inputdata[3000000][15];
int answer[3000000];

int main(){

  int datasum,i;
  char command[10];
  char finddata[20];
  int inputdatasum;
  int answer[2000000];
  int findsum;
  
  inputdatasum = 0;
  findsum = 0;


  scanf("%d",&datasum);

  for(i = 0; i < datasum; i++){

    scanf("%s",command);

    if((strcmp(command,"insert"))== 0){

      scanf("%s",inputdata[inputdatasum]);

      inputdatasum += 1;

    }

    if( (strcmp(command,"find")) == 0){

      scanf("%s",finddata);

      answer[findsum] = search(finddata,inputdatasum);

      findsum = findsum + 1;

      }

  }

  for(i = 0; i < findsum; i++){

    if(answer[i] == 1){

      printf("yes\n");

    }

    else{

      printf("no\n");

    }

  }
 
   return 0;  
}

int search(char searchdata[20], int inputsumdata){

  int i,flag;

  flag = 0;

  for(i = 0; i < inputsumdata; i++){

    if((strcmp(searchdata,inputdata[i])) == 0){

      flag = 1;

      return 1;

      break;

    }
  }


    return 0;

}