이영호/문자열검색

~cpp 
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <signal.h>

// while ��������� ���������. while��� 무��� 루��� 돌리��� Ctrl-C를 ������������ ���료�� 바��� ��내���.
void handler(int sig)
{
        fprintf(stderr, "\n��������램��� ���료���������.\n");
        exit(0);
}
//


int main()
{
        FILE *fp;
        char x[40] = "His teaching method is very good.";
        char buf[10];
        char *loc;


// signal handling
        struct sigaction act;

        act.sa_handler = handler;
        sigemptyset(&act.sa_mask);
        act.sa_flags = 0;

        sigaction(SIGINT, &act, 0);
//


        if((fp = fopen("result.out", "w")) == NULL)
                fprintf(stderr, "fopen() error: result.out\n"), exit(-1);

        while(1){
                fprintf(fp, "���료 -> %s\n", x);
                fprintf(fp, "������ 문������ -> ");

                printf("������ 문������ -> ");
                fgets(buf, sizeof(buf), stdin);         // 문��������������� ��������� space를 ������������.
                buf[strlen(buf)-1] = '\0';              // stream����� 받��� \n��� ������������.
                fprintf(fp, "%s\n", buf);

                if((loc = strstr(x, buf)) == 0)
                        fprintf(fp, "Not Found!\n");
                else
                        fprintf(fp, "first found -> %d\n", loc-x);
                fflush(fp);
        }

        fclose(fp);
        return 0;
}

~cpp 
// result.out

���료 -> His teaching method is very good.
������ 문������ -> method
first found -> 13
���료 -> His teaching method is very good.
������ 문������ -> test
Not Found!