stack peep problem

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define MAXCOLUMS 100
#define MAXLINES 30
#define SIZE 128
 
char pilha[MAXLINES][MAXCOLUMS];
int top = 0;
char str2[] = "fim";
char str[SIZE];
char str1[SIZE];
 
 
void reads(char s[], int n)
{
    fgets(s, n, stdin);
    s[strlen(s) - 1] = '\0';
}
 
void push(char* str, int t)
{
    int i = 0;
    if(top == MAXLINES)
    {
        printf("\nSTACK OVERFLOW");
        return;
        }else{
            for(i = 0; i < t; i++)
            {
                pilha[top][i] = str[i];
            }
    }
}
 
 
char* pop()
{
    int i = 0;
    if(top == -1)
    {
        printf("\nSTACK UNDERFLOW");
    }else{
        return(pilha[top]);
    }
}
 
 
void separa_str(char str[]) {
    int i = 0;
    char *palavra = NULL;
    palavra = strtok(str, " ");
 
    while (palavra !=0) {
        i = strlen(palavra);
        push(palavra, i);
        top++;
        palavra = strtok( NULL, " " );
    }
}
 
void read_str()
{
    reads(str, SIZE);
    strcat(str, " ");
    do {
        printf("\n word to terminate?(fim)");
        reads(str1, SIZE);
 
        if (strcmp(str1, str2)!= 0)
            printf("\n wrong word try again..\n");
        else
            separa_str(str);
    } while (strcmp(str1, str2) != 0);
 
}
 
 
void p_print() {
    int i = 0;
    int j = 0;
    while(i < top){
        for (j = 0; j < MAXCOLUMS; j++) {
            printf("%c", pilha[i][j]);
        }
        printf("\n");
        i++;
    }
}
 
int peep()
{
    int i = 0;
    int j = 0;
    int a = 0;
    int b = 0;
    for(i = 0; i < top; i++)
        for(j = 0; j <MAXCOLUMS; j++)
            for(a = 0; a < top; a++)
                for(b = 0; b < MAXCOLUMS; b++)
                        if((strchr(pilha[top + a][i], pilha[top][i + b])) != 0)
                            return top;
}
 
 
 
main()
{
    int x = 0;
    char texto[SIZE];
    int tam = 0;
    printf("\n write whe text: ");
    read_str();
    p_print();
    peep();
}

Select allOpen in new window